oj.uz

답안 #90719

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90719 2018-12-24T01:02:46 Z Ahmad_Elsisy Uzastopni (COCI17_uzastopni) C++14
80 / 80
 3 ms 760 KB 
#include <bits/stdc++.h>
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define popcnt(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define watch(x) cout << (#x) << " is " << (x) << endl

using namespace std;
typedef long long  ll;

int dx[] = {0 , 0 , 1 , -1 , 1 , 1 , -1 , -1};
int dy[] = {1 ,-1 , 0 , 0 , -1 , 1 ,  1 , -1};

int main() {
    ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
    ll N;
    cin >> N;

    vector<pair<ll , ll> > res;
    for(ll cur = 2 ; cur * (cur + 1) / 2 <= N ; ++cur){
        if((N * 2) % cur == 0){
            ll s = N * 2 / cur;
            ll y = (s + cur - 1) / 2;

            ll x = y - cur + 1;

            if((x + y) * cur / 2 == N)res.pb({x , y});
        }
    }

    for(auto e : res)
        cout << e.first << ' ' << e.second << '\n';
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 580 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 1 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct