oj.uz

답안 #407573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
407573 2021-05-19T03:21:57 Z LptN21 Uzastopni (COCI17_uzastopni) C++14
72 / 80
 2 ms 292 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e9
#define eps 1e-9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = 1e3+7, M=13+7;
const int MOD = 1e9+7;

int n, m, k, t;

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    ll n;scanf("%lld", &n);
    for(ll j, i=1;i*i+i<2*n;i++) {
        j=(2*n-i*(i+1))/(2*i+2);
        if((2*n-i*(i+1))%(2*i+2)) continue;
        printf("%d %d\n", j, j+i);
    }
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Compilation message

uzastopni.cpp: In function 'int main()':
uzastopni.cpp:29:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll' {aka 'long long int'} [-Wformat=]
   29 |         printf("%d %d\n", j, j+i);
      |                 ~^        ~
      |                  |        |
      |                  int      ll {aka long long int}
      |                 %lld
uzastopni.cpp:29:21: warning: format '%d' expects argument of type 'int', but argument 3 has type 'll' {aka 'long long int'} [-Wformat=]
   29 |         printf("%d %d\n", j, j+i);
      |                    ~^        ~~~
      |                     |         |
      |                     int       ll {aka long long int}
      |                    %lld
uzastopni.cpp:25:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     ll n;scanf("%lld", &n);
      |          ~~~~~^~~~~~~~~~~~

Subtask #1
72.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Incorrect 2 ms 204 KB Output isn't correct