제출 #825348

#제출 시각아이디문제언어결과실행 시간메모리
825348alex_2008Toys (CEOI18_toy)C++14
100 / 100
2751 ms79960 KiB
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
const int NN = 2e3 + 10;
int main() {
	int n;
	cin >> n;
	if (n == 1) {
		cout << "1\n";
		cout << "0\n";
		return 0;
	}
	vector <int> v;
	int j;
	for (int i = 1; i * i <= n; i++) {
		if (n % i == 0) v.push_back(i);
		if (i * i < n) j = i;
	} 
	for (int i = j; i >= 1; i--) {
		if (n % i == 0) {
			v.push_back(n / i);
		}
	}
	map <int, int> yp;
	unordered_map <int, int> mp;
	int N = (int)v.size();
	for (int i = 1; i <= (int)v.size(); i++) {
		mp[i] = v[i - 1];
		yp[v[i - 1]] = i;
	}
	vector<unordered_map<int, bool>> ans(N + 1);
	ans[1] = { { 0, true} };
	for (int i = 1; i < N; i++) {
		for (int j = 2; j <= N - i + 1; j++) {
			if (yp.find(mp[i] * mp[j]) != yp.end()) {
				for (auto it : ans[i]) {
					ans[yp[mp[i] * mp[j]]][it.first + mp[j] - 1] = true;
				}
			}
		}
	}
	vector <int> vv; 
	for (auto &it : ans[N]) {
		vv.push_back(it.first);
	}
	sort(vv.begin(), vv.end());
	cout << (int)vv.size() << "\n";
	for (auto it : vv) {
		cout << it << " ";
	}
}

컴파일 시 표준 에러 (stderr) 메시지

toy.cpp: In function 'int main()':
toy.cpp:19:6: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   19 |  int j;
      |      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...