제출 #893967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893967		vjudge1	Toys (CEOI18_toy)	C++11	79 / 100	5023 ms	119908 KiB

toy

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 2000 + 10;
const ll mod = 1e9 + 7;

ll um(ll a, ll b){
	return ((1LL * a * b) % mod + mod) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll binpow(ll x, ll step){
	ll res = 1LL;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
map <ll, bool> mp;
map <pll, bool> dp;
void calc(ll cur, ll x, ll sum){
	if(dp[{cur, sum}]) return;
	if(cur == 1){
		mp[sum] = true;
		return;
	}
	for(ll i = 2; i * i <= cur; i++){
		if(cur % i == 0){
			if(i >= x) calc(cur / i, i, sum + i - 1);
			if(cur/i != i && cur / i > x) calc(i, i, sum + cur/i - 1);
		}
	}
	if(cur >= x) calc(1, cur, sum + cur - 1);
	dp[{cur, sum}] = true;
}
int main() {
	ios::sync_with_stdio(false);
  	cin.tie(NULL);
  	ll n;
  	cin >> n;
  	calc(n, 1, 0);
  	cout << mp.size() << endl;
  	for(auto u : mp){
  		cout << u.F << " ";
  	}
  return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 0 / 21