Submission #992051


Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

bool prb[10000001];

int main(){
	
	int n;
	
	int max = 0;
	
	cin >> n;
	
	for(int i = 0; i < 10000001; i++){
		prb[i] = false;
	}
	
	for(long long int i = 0; i < 100000; i++){
		if(i * (i + 1) / 2 >= n){
			max = i;
			break;
		}
	}
	
	//cout << max << endl;;
	
	for(int i = max; i > 0; i--){
		if(n - i >= 0){
			n -= i;
			prb[i] = true;
		}
	}
	
	for(int i = 1; i < 10000001; i++){
		if(prb[i]){
			cout << i << endl;
		}
	}
	
	return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User monolith
Language C++14 (GCC 5.4.1)
Score 300
Code Size 625 Byte
Status AC
Exec Time 40 ms
Memory 10112 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 21
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 22 ms 9984 KB
01-02.txt AC 22 ms 9984 KB
01-03.txt AC 21 ms 9984 KB
01-04.txt AC 22 ms 9984 KB
01-05.txt AC 21 ms 9984 KB
01-06.txt AC 22 ms 9984 KB
01-07.txt AC 22 ms 9984 KB
01-08.txt AC 22 ms 10112 KB
01-09.txt AC 21 ms 9984 KB
01-10.txt AC 21 ms 9984 KB
02-01.txt AC 40 ms 9984 KB
02-02.txt AC 40 ms 9984 KB
02-03.txt AC 40 ms 9984 KB
02-04.txt AC 40 ms 9984 KB
02-05.txt AC 40 ms 9984 KB
02-06.txt AC 31 ms 9984 KB
02-07.txt AC 28 ms 9984 KB
02-08.txt AC 39 ms 9984 KB
sample-01.txt AC 22 ms 9984 KB
sample-02.txt AC 21 ms 9984 KB
sample-03.txt AC 21 ms 9984 KB