# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721267 | 2023-04-10T15:22:35 Z | vjudge1 | Uzastopni (COCI17_uzastopni) | C++17 | 60 ms | 65536 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ll n; cin >> n; ll k = n/2+1; vector<ll> table; table.push_back(1); for(ll i = 2; i <= k; i++){ if(table.back() == n){ cout << 1 <<" "<< i-1 <<"\n"; } table.push_back((i*(i+1))/2); } ll pos = upper_bound(table.begin(), table.end(), n) - table.begin(); for(ll i = pos; i < table.size(); i++){ if(binary_search(table.begin(), table.end(), table[i]-n)){ cout << lower_bound(table.begin(), table.end(), table[i]-n)-table.begin()+2 <<" "<< i+1 <<"\n"; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 3 ms | 856 KB | Output is correct |
5 | Correct | 6 ms | 1492 KB | Output is correct |
6 | Correct | 57 ms | 8684 KB | Output is correct |
7 | Runtime error | 56 ms | 65536 KB | Execution killed with signal 9 |
8 | Runtime error | 60 ms | 65536 KB | Execution killed with signal 9 |
9 | Runtime error | 51 ms | 65536 KB | Execution killed with signal 9 |
10 | Runtime error | 52 ms | 65536 KB | Execution killed with signal 9 |