Submission #5702604


Source Code Expand

#include<iostream>
#include<string>
#include<typeinfo>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
typedef long long int ll;
using namespace std;
int main()
{
	int n;
	cin >> n;
	int nokori=n;
	for(int i=1; i<=n; i++){
		if(nokori-i>=i+1){
			cout << i << endl;
			nokori -= i;
		}
		if(nokori==0){
			break;
		}else if(nokori==i){
			cout << i << endl;
			nokori=0;
		}
	}
	return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User proton
Language C++14 (GCC 5.4.1)
Score 0
Code Size 438 Byte
Status WA
Exec Time 8 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 7
WA × 6
AC × 12
WA × 12
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 WA 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 AC 1 ms 256 KB
01-08.txt WA 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt WA 1 ms 256 KB
02-01.txt WA 8 ms 256 KB
02-02.txt AC 8 ms 256 KB
02-03.txt AC 8 ms 256 KB
02-04.txt WA 8 ms 256 KB
02-05.txt WA 8 ms 256 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 AC 1 ms 256 KB