oj.uz

Submission #203950

# Submission time Handle Problem Language Result Execution time Memory
203950 2020-02-23T07:19:33 Z awlintqaa Uzastopni (COCI17_uzastopni) C++14
80 / 80
 6 ms 376 KB 
#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+1) / 2 ) - ( l* ( l-1) /2 ) ;
}
int main () {
        cin >> n ;
        ll L = 0 , R = n ;
        while ( R - L > 1 ){
                ll MID = ( L + R ) /2ll ;
                if ( sum ( 1 , MID ) <= n) L=MID;
                else R = MID ;
        }
        for ( ll i=2 ;i <= R ;i ++ ){
                ll x = n / i ;
                ll num =i-1 ;
                ll l = x - (num/2) ;
                ll r = x + (num - (num/2) ) ;
                if ( l<=0 ) C ;
                if ( sum (l , r ) == n ) {
                        cout << l << " " << r << endl;
                }
        }
}

Subtask #1
80.0 / 80.0

# 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 Correct 4 ms 248 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 256 KB Output is correct