# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721294 | vjudge1 | Uzastopni (COCI17_uzastopni) | C++17 | 103 ms | 65536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
vector<ll> table(n+1);
table[1] = 1;
for(ll i = 2; i <= n-1; i++){
if(table[i-1] == n){
cout << 1 <<" "<< i-1 <<"\n";
}
table[i] = ((i*(i+1))/2);
}
ll pos = upper_bound(table.begin(), table.end(), n) - table.begin();
for(ll i = pos; i <= n-1; i++){
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";
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |