oj.uz

답안 #82056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
82056 2018-10-28T20:45:41 Z josiftepe Nadan (COCI18_nadan) C++14
50 / 50
 2 ms 684 KB 
    #include <iostream>
    #include <cstring>
    #include <vector>
    #include <set>
    #include <map>
    #include <sstream>
    #include <cstdio>
    #include <algorithm>
    #include <stack>
    #include <queue>
    #include <cmath>
    #include <iomanip>
    #include <fstream>
    //#include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int INF = (1 << 30);
    const ll inf = (1LL << 60LL);
    const int maxn = 1e5 + 10;
    int n, k;
    int main(int argc, const char * argv[]) {
        
        ios_base::sync_with_stdio(false);
        cin >> k >> n;
        int sum = 0;
        for(int i = 1; i < n; ++i){
            sum += i;
            cout << i << "\n";
        }
        cout << k - sum << endl;
        return 0;
    }

Subtask #1
50.0 / 50.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 448 KB Output is correct
4 Correct 2 ms 524 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 540 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 684 KB Output is correct