Submission #721319

#TimeUsernameProblemLanguageResultExecution timeMemory
721319vjudge1Uzastopni (COCI17_uzastopni)C++17
56 / 80
245 ms65536 KiB
#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; if(k >= 8*1e7){ return 0; } vector<ll> table(k+1); table[1] = 1; for(ll i = 2; i <= k; i++){ if(table[i-1] == n){ cout << 1 <<" "<< i-1 <<"\n"; } table[i] = ((i*(i+1))/2); } for(ll i = 1; i <= k; i++){ if(table[i]-n < 0){ continue; } if(binary_search(table.begin(), table.end(), table[i]-n)){ cout << lower_bound(table.begin(), table.end(), table[i]-n)-table.begin()+1 <<" "<< i <<"\n"; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...