Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- vector<int> graph[1001];
- void dfs(int node) {
- for(int neighbour : graph[node]) {
- cout << neighbour << " ";
- }
- }
- int main()
- {
- vector<int> v;
- int n;
- cin >> n;
- for(int i = 0; i < n; i++) {
- int x;
- cin >> x;
- v.push_back(x);
- }
- for(int x : v) {
- cout << x << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement