#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
ll n;
ll sum (ll l , ll r ){
return ( r * (r+1ll) / 2ll ) - ( l * (l-1ll) / 2ll) ;
}
int main(){
cin >> n ;
for ( ll i= 1 ;i < min(1000001ll,n) ;i ++ ){
ll l=i+1,r=n;
while ( r-l >1 ){
if ( sum ( i , mid ) <=n ) l=mid;
else r=mid;
}
if ( sum ( i ,l ) == n ){
cout<< i << " " << l << endl;
i = l;
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
256 KB |
Output is correct |
| 4 |
Incorrect |
13 ms |
256 KB |
Output isn't correct |
| 5 |
Incorrect |
23 ms |
376 KB |
Output isn't correct |
| 6 |
Correct |
125 ms |
256 KB |
Output is correct |
| 7 |
Incorrect |
142 ms |
256 KB |
Output isn't correct |
| 8 |
Incorrect |
170 ms |
376 KB |
Output isn't correct |
| 9 |
Incorrect |
182 ms |
376 KB |
Output isn't correct |
| 10 |
Incorrect |
161 ms |
256 KB |
Output isn't correct |
