# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151741 | AbdullahIshfaq | Make them Meet (EGOI24_makethemmeet) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 998244353
void solve(){
ll n, m, u , v;
cin >> n >> m;
for(int i = 0; i < m; i++){
cin >> u >> v;
}
cout << 2 * n - 1 << '\n';
for(int i = 1; i < n ; i++){
for(int j = 0 ; j < n; j ++){
if(i == j){
cout << 0 << " ";
}
else{
cout << j << " ";
}
}
cout << '\n';
for(int j = 0 ; j < n; j ++){
if(i == j){
cout << 0 << " ";
}
else{
cout << j << " ";
}
}
cout << '\n';
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |