Submission #448159

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
448159	2021-07-29T04:40:26 Z	Calico	Toys (CEOI18_toy)	C++17	0 / 100	1 ms	332 KB

toy

#include <bits/extc++.h>
using namespace std;
 
unordered_set<int> ans;
__gnu_pbds::gp_hash_table<int, vector<int>> dvs;
 
void brute(int n, int sum, int prv) {
	ans.insert(n+sum-1);
 
	for (int i: dvs[n]) {
		if (i < prv) break;
		brute(n/i, sum+i-1, i);
	}
}
 
signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin >> n; vector<int> dv;
	for (int i = 1; i*i <= n; i++) {
		if (n % i == 0) {
			int a = i, b = n/i;
			dv.push_back(a);
			if (a != b) dv.push_back(b);
		}
	}
	
	for (int j: dv) {
		for (int i = 1; i*i <= j; i++) {
			if (j % i == 0) {
				int a = i, b = j/i;
				if (a != b && b != 1 && b != j) dvs[j].push_back(b);
			}
		}
		for (int i = sqrt(j); i >= 1; i--) {
			if (j % i == 0) {
				int a = i;
				if (a != 1 && a != j) dvs[j].push_back(a);
			}
		}
	}
 
	brute(n, 0, 0);
	vector<int> anss(ans.begin(), ans.end());
	sort(anss.begin(), anss.end());
 
	cout << anss.size() << '\n';
	for (int i: anss) cout << i << ' ';
	
	return 0;
}

Subtask #1

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Runtime error	1 ms	332 KB	Execution killed with signal 8
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Runtime error	1 ms	332 KB	Execution killed with signal 8
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Runtime error	1 ms	332 KB	Execution killed with signal 8
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Runtime error	1 ms	332 KB	Execution killed with signal 8
13	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Runtime error	1 ms	332 KB	Execution killed with signal 8
13	Halted	0 ms	0 KB	-