Submission #81682

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