# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66357 | KLPP | Uzastopni (COCI17_uzastopni) | C++14 | 6 ms | 648 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<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<stdio.h>
#include<cmath>
using namespace std;
typedef long long int lld;
int main(){
lld n;
scanf("%lld",&n);
n*=2;
for(lld i=1;i<sqrt(n);i++){
if(n%i==0){
lld f=n/i;
if((i+f)%2==1){
lld a,b;
b=(i+f-1)/2;
a=(f-i+1)/2;
if(a<b)printf("%lld %lld\n",a,b);
}
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |