# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66357 | 2018-08-10T10:17:58 Z | KLPP | Uzastopni (COCI17_uzastopni) | C++14 | 6 ms | 648 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 3 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 540 KB | Output is correct |
4 | Correct | 2 ms | 540 KB | Output is correct |
5 | Correct | 3 ms | 584 KB | Output is correct |
6 | Correct | 2 ms | 584 KB | Output is correct |
7 | Correct | 3 ms | 648 KB | Output is correct |
8 | Correct | 3 ms | 648 KB | Output is correct |
9 | Correct | 3 ms | 648 KB | Output is correct |
10 | Correct | 6 ms | 648 KB | Output is correct |