# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105662 | KDM_Dvali | 나일강 (IOI24_nile) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
if (q > 5) {
cerr << endl;
return 1;
}
vector<int> W(n), A(n, 2), B(n, 1), E(q);
for (int i = 0; i < n; i++) {
W[i] = i + 1;
}
for (int i = 0; i < q; i++) {
cin >> E[i];
}
cout << "W: ";
for (int w : W) cout << w << " ";
cout << "\nA: ";
for (int a : A) cout << a << " ";
cout << "\nB: ";
for (int b : B) cout << b << " ";
cout << "\nE: ";
for (int e : E) cout << e << " ";
cout << endl;
return 0;
}