Submission #1333200


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	long long int n;
	cin >> n;
	long long int l, r;
	l = 0;
	r = n;
	while (r > l + 1) {
		long long int mid = (l + r) / 2;
		long long int res = (mid*(mid - 1)) / 2;
		if (n <= mid + res) {
			r = mid;
		}
		else {
			l = mid;
		}
	}
	vector<long long int> p;
	while (n > 0) {
		if (n - r >= 0) {
			p.push_back(r);
			n -= r;
			r--;
		}
		else {
			p.push_back(n);
			n = 0;
		}
		
	}
	long long int sz = p.size();
	for (long long int i = 0; i < sz; i++) {
		cout << p[sz-1-i] << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User scor
Language C++14 (GCC 5.4.1)
Score 300
Code Size 637 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 384 KB
02-04.txt AC 8 ms 384 KB
02-05.txt AC 8 ms 384 KB
02-06.txt AC 5 ms 256 KB
02-07.txt AC 4 ms 256 KB
02-08.txt AC 8 ms 384 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