# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634343 | inksamurai | Uzastopni (COCI17_uzastopni) | C++17 | 15 ms | 316 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 rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3PGDklf ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
signed main(){
_3PGDklf;
#define int ll
int n;
cin>>n;
auto f=[&](int l,int r){
return (r*(r+1))/2-(l*(l+1))/2;
};
for(int len=2;len<=sqrt(2*n);len++){
int l=0,r=1e9;
int c=-1;
while(l<=r){
int m=(l+r)/2;
if(f(m-len,m)<n){
l=m+1;
}else{
c=m,r=m-1;
}
}
if(f(c-len,c)==n){
cout<<c-len+1<<" "<<c<<"\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |