Submission #1889860
Source Code Expand
#include<iostream> #include <list> #include<stack> #include<queue> #include <vector> #include <set> #include <map> #include<algorithm> #include<math.h> #include<stdlib.h> #include<string> #include <functional> #include"time.h" using namespace std; #define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++) #define REP(i,n) FOR((i),0,(n)) #define LL long long #define CLR(a) memset((a),0,sizeof(a)) #define SZ(x) (int((x).size())) #define dump(x) cerr << #x << " = " << (x) << endl #define WAITING(str) int str;std::cin>>str; #define DEBUGING(str) cout<<str<<endl const int INF = (1 << 30); //毎回変える定数 #define N_MAX 200 //問題文のとおりの変数 int N; //オリジナル変数 //サブ関数 //入力 void input() { cin >> N; } //計算 void calc() { } //出力 void output() { int upper = 0; while (upper*(upper+1)*0.5 < N) upper++; while (N > 0) { if (upper <= N) { cout << upper << endl; N -= upper; } upper--; } } //デバッグ void debug() { cin >> N; } //メイン関数 int main() { input(); calc(); output(); debug(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | toma25 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1164 Byte |
Status | AC |
Exec Time | 8 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 | 8 ms | 256 KB |
02-02.txt | AC | 8 ms | 256 KB |
02-03.txt | AC | 8 ms | 256 KB |
02-04.txt | AC | 8 ms | 256 KB |
02-05.txt | AC | 8 ms | 256 KB |
02-06.txt | AC | 5 ms | 256 KB |
02-07.txt | AC | 4 ms | 256 KB |
02-08.txt | AC | 8 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 |