Submission #991622
Source Code Expand
/* -------------------------------- Template -------------------------------- */ #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cmath> #include <complex> #include <cstdio> #include <cstring> #include <deque> #include <functional> #include <iomanip> #include <locale> #include <iostream> #include <map> #include <memory> #include <new> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> #define REP(i,n) for(int i=0;i<(int)(n);i++) #define ALL(x) (x).begin(),(x).end() using ll = long long; using ld = long double; template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); } template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); } template<typename T> constexpr T inf = [](){ assert(false); }; // template<> constexpr int inf<int> = 1e9; // template<> constexpr ll inf<ll> = 1e18; // template<> constexpr ld inf<ld> = 1e30; struct yes_no : std::numpunct<char> { string_type do_truename() const { return "Yes"; } string_type do_falsename() const { return "No"; } }; void solve(); int main() { std::locale loc(std::locale(), new yes_no); std::cout << std::boolalpha << std::setprecision(12) << std::fixed; std::cout.imbue(loc); solve(); return 0; } using namespace std; /* -------------------------------- Library -------------------------------- */ /* ---------------------------------- Main ---------------------------------- */ int f(int n) { int sum = 0; REP(i,100000) { sum += i; if (sum >= n) return i; } return -1; } void solve() { int N; cin >> N; const int m = f(N); vector<int> res; for (int i = m; i > 0; --i) { if (N >= i) { res.push_back(i); N -= i; } } sort(ALL(res)); for (int i: res) cout << i << endl; return; }
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | asi1024 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 2040 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 384 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 3 ms | 256 KB |
01-02.txt | AC | 3 ms | 256 KB |
01-03.txt | AC | 3 ms | 256 KB |
01-04.txt | AC | 3 ms | 256 KB |
01-05.txt | AC | 3 ms | 256 KB |
01-06.txt | AC | 3 ms | 256 KB |
01-07.txt | AC | 3 ms | 256 KB |
01-08.txt | AC | 3 ms | 256 KB |
01-09.txt | AC | 3 ms | 256 KB |
01-10.txt | AC | 3 ms | 256 KB |
02-01.txt | AC | 21 ms | 256 KB |
02-02.txt | AC | 21 ms | 256 KB |
02-03.txt | AC | 21 ms | 256 KB |
02-04.txt | AC | 21 ms | 256 KB |
02-05.txt | AC | 21 ms | 256 KB |
02-06.txt | AC | 12 ms | 384 KB |
02-07.txt | AC | 9 ms | 256 KB |
02-08.txt | AC | 21 ms | 256 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |
sample-03.txt | AC | 3 ms | 256 KB |