Submission #3907627
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <set> #include <cmath> #include <stack> #include <algorithm> #include <iomanip> #include <map> #include <queue> #include <functional> #include <numeric> #include <chrono> using ll = long long; using namespace std; const ll MOD = 1e9 + 7; #define REP(i, n) for (int(i) = 0; (i) < (n); ++(i)) // bool operator<(const pair<int, int> &a, const pair<int, int> &b) // { // if (a.first == b.first) // return a.second < b.second; // return a.first < b.first; // }; /*unsigned int xor128(void) { static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123; unsigned int t = (x ^ (x << 11)); x = y; y = z; z = w; return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8))); } unsigned int xor128rnd(unsigned int m) { return xor128() % m; }*/ vector<vector<string>> v(27); vector<pair<int, int>> vp; int main(void) { int N; cin >> N; int idx = 1; for (;; ++idx) { if (idx * (idx + 1) / 2 >= N) break; } //cout << idx << endl; int t = idx; vector<int> ans; ans.push_back(idx); N -= t; while (N > idx) { t--; ans.push_back(t); N -= t; } ans.push_back(N); sort(ans.begin(), ans.end()); for (auto e : ans) cout << e << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | hamray |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1438 Byte |
Status | WA |
Exec Time | 8 ms |
Memory | 384 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 100 | ||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt |
dataset2 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | WA | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | WA | 1 ms | 256 KB |
01-05.txt | WA | 1 ms | 256 KB |
01-06.txt | WA | 1 ms | 256 KB |
01-07.txt | WA | 1 ms | 256 KB |
01-08.txt | WA | 1 ms | 256 KB |
01-09.txt | WA | 1 ms | 256 KB |
01-10.txt | WA | 1 ms | 256 KB |
02-01.txt | WA | 8 ms | 384 KB |
02-02.txt | WA | 8 ms | 384 KB |
02-03.txt | WA | 8 ms | 384 KB |
02-04.txt | WA | 8 ms | 384 KB |
02-05.txt | WA | 8 ms | 384 KB |
02-06.txt | WA | 5 ms | 256 KB |
02-07.txt | WA | 4 ms | 256 KB |
02-08.txt | WA | 8 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | WA | 1 ms | 256 KB |