Submission #82056

#TimeUsernameProblemLanguageResultExecution timeMemory
82056josiftepeNadan (COCI18_nadan)C++14
50 / 50
2 ms684 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...