-
Notifications
You must be signed in to change notification settings - Fork 19
/
Copy pathmain.cpp
33 lines (29 loc) · 777 Bytes
/
main.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
#include<bits/stdc++.h>
using namespace std;
/*===== TREENODE CODE =====
struct TreeNode {
int val;
TreeNode * left;
TreeNode * right;
TreeNode(): val(0), left(nullptr), right(nullptr) {}
TreeNode(int x): val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode * left, TreeNode * right): val(x), left(left), right(right) {}
};
*/
/* == GRAPH NODE TEMPLATE CODE ===
struct Node {
int val;
vector < Node * > neighbors;
Node(): val(0), neighbors({}) {};
Node(int x): val(x), neighbors({}) {};
Node(int x, vector < Node * > neighbors): val(x), neighbors(neighbors) {};
};
*/
int main(){
vector<int> sachin(10,1);
for (int i = 0; i < sachin.size(); i++)
{
cout << sachin[i] << endl;
}
return 0;
}