Submission #1010174

#	Time	Username	Problem	Language	Result	Execution time	Memory
1010174		christinelynn	Toys (CEOI18_toy)	C++17	59 / 100	5078 ms	1300 KiB

toy

#include <bits/stdc++.h>
 
#define ll int
#define en "\n"
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define fi first
#define se second
#define rep(i, a, b) for(ll i = a; i <= b; ++i)
#define per(i, a, b) for(ll i = a; i >= b; --i)
#define kaizokuO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define r0 return 0
#define all(v) v.begin(), v.end()
#define gcd(a,b) __gcd(a,b);
#define lcm(a,b) (a*b)/ __gcd(a, b)
#define bitt(x) __builtin_popcount(x)
#define fill1(arr, i, n) for(ll a = 0; a <= n; ++a) arr[a] = i;
#define fill2(arr, i, n, m) for(ll a = 0; a <= n; ++a) for(ll b = 0; b <= m; ++b) arr[a][b] = i;
#define flsh fflush(stdout)
#define ext exit(0)
#define inp freopen("input.txt","r",stdin)
#define outp freopen("output.txt","w",stdout)
 
using namespace std;
 
//const ll mod = 1e9 + 7;
//const ll mod = 998244353;
//const ll mod = 26101991;
//const ll mod = 1e8;
//const double pi = 3.14159;
pii dir[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

set<ll> ans;
void dfs(ll x, ll sum){
    bool valid = 0;
    for(ll i = 2; i*i <= x; ++i){
        if(x%i!=0) continue;
        if(x/i==1) continue;
        ans.insert(sum+i-1+(x/i)-1);
        dfs(x/i, sum + i - 1);
        valid = 1;
    }

    if(!valid) ans.insert(sum+x-1);

}
void solve(){
    ll n; cin >> n;
    dfs(n, 0);
    ans.insert(n-1);
    cout << ans.size() << en;
    for(ll i : ans) cout << i << " ";
    cout << en;
}
 

int main() {
    kaizokuO;
 
    ll t = 1; //cin >> t;
    while(t--){
        solve();
    }
}

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