Submission #721283

#TimeUsernameProblemLanguageResultExecution timeMemory
721283vjudge1Uzastopni (COCI17_uzastopni)C++17
48 / 80
60 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 > 7*1e7){ return 0; } 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 (stderr)

uzastopni.cpp: In function 'int main()':
uzastopni.cpp:28:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(ll i = pos; i < table.size(); i++){
      |                     ~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...