words per minute
3
Typist_1810553
00:00
Speed
#include <iostream>
#include <fstream>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#define For(i,n) for(int i = 0; i < n; ++i)
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define be(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define umap unordered_map
#define uset unordered_set
#define mset multiset
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template<class T>
istream& operator>> (istream& is, vector<T>& vec)
{
for (int i = 0; i < (int)vec.size(); ++i)is >> vec[i]; return is;
}
template<class T>
ostream& operator<< (ostream& is, vector<T>& vec)
{
for (int i = 0; i < (int)vec.size(); ++i)is << vec[i] << " "; cout << "\n"; return is;
}
void solve()
{
int n;
cin >> n;
vi a(n);
cin >> a;
cout << a;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--)
solve();
}