Submission #1678089
Source Code Expand
#include <iostream> #include <iomanip> #include <algorithm> #include <string> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <vector> #include <list> #include <map> #include <set> #include <queue> #include <stack> #define INF (int)1e09 using std::cin; using std::cout; using std::endl; using std::setprecision; using std::fixed; using std::pair; using std::make_pair; using std::min; using std::max; using std::string; using std::vector; using std::list; using std::map; using std::set; // insert erase find count using std::queue; using std::priority_queue; using std::stack; template <typename T> using Vec = vector<T>; // c++11 typedef pair<int, int> PII; typedef pair<int, pair<int, int> > PIII; int main(void) { int n; cin >> n; while (n != 0) { int i = 1; while (1) { if (i * (i + 1) >= 2 * n) { cout << i << endl; n -= i; break; } else { i++; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | naobird |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1109 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 256 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 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 | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 1 ms | 256 KB |
02-01.txt | AC | 15 ms | 256 KB |
02-02.txt | AC | 15 ms | 256 KB |
02-03.txt | AC | 15 ms | 256 KB |
02-04.txt | AC | 15 ms | 256 KB |
02-05.txt | AC | 15 ms | 256 KB |
02-06.txt | AC | 7 ms | 256 KB |
02-07.txt | AC | 5 ms | 256 KB |
02-08.txt | AC | 14 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |