# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721195 | vjudge1 | Uzastopni (COCI17_uzastopni) | C++17 | 1085 ms | 324 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>
#define sts stable_sort
#define B begin()
#define rB rbegin()
#define E end()
#define rE rend()
#define F first
#define S second
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define ppf pop_front()
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long
using namespace std;
const int MAXN = 1e6 + 4;
const int MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
ll n; cin >> n;
ll l = 1, r = l + 1;
ll sum = l + r;
vector<pair<ll,ll> > v;
while(l <= n / 2){
if(sum == n){
v.pb({l, r});
l++; r = l + 1; sum = l + r;
}else if(sum > n){
l++; r = l + 1; sum = l + r;
}else{
r++; sum += r;
}
}
for(auto &c : v){
cout << c.F << " " << c.S << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |