| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1319399 | lrnnz | Magic Show (APIO24_show) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;
#define ll long long
#define pb push_back
vector<pair<int,int>> Alice(){
ll n = 100;
ll x = setN(n);
vector<pair<int,int>> tree;
for (int i = 1; i < n; i++) {
tree.pb({i+1, x % i + 1});
}
return tree;
}
#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;
#define ll long long
#define pb push_back
vector<pair<int,int>> Alice(){
ll n = 100;
ll x = setN(n);
vector<pair<int,int>> tree;
for (int i = 2; i < n; i++) {
tree.pb({i+1, x % i + 1});
}
return tree;
}
