Submission #9691821


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000


int main(){
	
	int N;
	cin>>N;
	
	vector<int> ans;
	
	int sum = 0;
	
	for(int i=1;i<=N;i++){
		ans.push_back(i);
		sum+=i;
		if(sum>=N)break;
	}
	
	for(int i=0;i<ans.size();i++){
		if(ans[i] == sum-N){
			ans.erase(ans.begin()+i);
			break;
		}
	}
	
	for(int i=0;i<ans.size();i++){
		cout<<ans[i]<<endl;
	}
		
	
	return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User m_99
Language C++14 (GCC 5.4.1)
Score 300
Code Size 512 Byte
Status AC
Exec Time 8 ms
Memory 384 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 24
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 384 KB
02-02.txt AC 8 ms 384 KB
02-03.txt AC 8 ms 256 KB
02-04.txt AC 8 ms 384 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