# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106064 | leonarda | Uzastopni (COCI17_uzastopni) | C++14 | 3 ms | 384 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;
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 0;
int n;
vector<pi> v;
int main ()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 2; i <= sqrt(2 * n); ++i) {
int d = i;
if(2 * n % d == 0) {
int m1 = d;
int m2 = 2 * n / d;
int f1 = (n * 2 / m1 - m1 + 1) / 2;
int f2 = (n * 2 / m2 - m2 + 1) / 2;
if(f1 > 0 and (n * 2 / m1 - m1 + 1) % 2 == 0)
v.pb(mp(f1, f1 + m1 - 1));
if(f2 > 0 and (n * 2 / m2 - m2 + 1) % 2 == 0)
v.pb(mp(f2, f2 + m2 - 1));
}
}
for(int i = 0; i < v.size(); ++i)
cout << v[i].F << " " << v[i].S << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |