# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993222 | 2024-06-05T12:55:31 Z | dagii | Magic Show (APIO24_show) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include "Alice.h" #define pii pair<int, int> #define all(v) v.begin(), v.end() using namespace std; using ll=long long; ll setN(ll n) { ll x; cin >> x; return x; } std::vector<std::pair<int,int>> Alice() { ll x = setN(5000); vector<pii> tree; for(int i=1; i<5000; i++) tree.push_back({x%i+1, i+1}); sort(all(tree)); return tree; }