# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337845 | beksultan04 | Odd-even (IZhO11_oddeven) | C++14 | 1 ms | 364 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 int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int n;
bool is(int x){
x = (x*(x+1))/2;
ret x >= n;
}
main(){
int i,c=1,cnt=0,l=1,r=INF;
scan1(n)
if( n == 1){
cout <<1;
ret 0;
}
while (r-l>1){
int m = l+r>>1;
if (is(m))r=m;
else l=m;
}
if (is(r))l=r;
c = l*l;
cnt = r*(r+1)>>1;
c -= (cnt-n)*2;
cout <<c;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |