Submission #942884

#TimeUsernameProblemLanguageResultExecution timeMemory
942884vjudge1Toys (CEOI18_toy)C++17
59 / 100
5067 ms1504 KiB
#include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define all(a) a.begin(), a.end() #define int long long signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); auto split=[&](int n){ set<int> ans; ans.insert(n-1); vector<int> p; for(int i = 2; i * i <= n; i++){ if(n%i == 0){ p.push_back(i); if(n / i != i) p.push_back(n / i); } } sort(all(p)); for(int len = 2; len <= 33; len++){ function<void(int, int, int)> f=[&](int cur, int have, int sum){ if(have == len){ if(cur == n) ans.insert(sum); return; } if(have == len-1){ int x = n / cur; if(n % cur != 0 or x <= 1) return; ans.insert(sum + x - 1); return; } long long atleast = cur * (1LL<<(len - have)); if(atleast > n) return; for(int x : p){ atleast = cur * x * (1LL<<(len - have - 1)); if(atleast > n) return; f(cur*x, have + 1, sum + x - 1); } }; f(1, 0, 0); } return ans; }; int n; cin >> n; int N = n; vector<pair<int, int>> factors; for(int i = 2; i * i <= n; i++){ pair<int, int> s = {i, 0}; while(n > 0 && n % i == 0){ n/= i; s.ss++; } if(s.ss > 0) factors.push_back(s); } set<int> st = split(N); cout << st.size() << '\n'; for(auto x : st){ cout << x << ' '; } cout << '\n'; return 0; }
#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...