oj.uz

Submission #81682

# Submission time Handle Problem Language Result Execution time Memory
81682 2018-10-26T07:05:35 Z Saboon Nadan (COCI18_nadan) C++14
50 / 50
 2 ms 672 KB 
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <algorithm>
#include <iomanip>
#define F first
#define S second
#define PB push_back
#define PF push_front
#define MP make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int maxn = 2e5 + 37;

int main() {
    ios_base::sync_with_stdio(false);
    int n, t;
    cin >> t >> n;
    int sum = 0;
    for (int i = 1; i <= n - 1; sum += i, i++)
        cout << i << " ";
    cout << t - sum << endl;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 2 ms 672 KB Output is correct
10 Correct 2 ms 672 KB Output is correct