# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1070377 | 2024-08-22T13:47:09 Z | YassirSalama | Toys (CEOI18_toy) | C++17 | 0 ms | 348 KB |
#include<bits/stdc++.h> using namespace std; #define pb push_back template<typename T> void dbg(const T& t){ cout<<t<<"\n"; } template<typename T,typename... Args> void dbg(const T& t,const Args&... args){ cout<<t<<" , "; dbg(args...); } #define dbg(...) cout<<"("<<#__VA_ARGS__<<") : ";dbg(__VA_ARGS__); #define all(v) v.begin(),v.end() set<vector<int>> decomp; set<vector<int>> c; signed main(){ int n; cin>>n; int x=n; vector<int> p; for(int i=2;i*i<=n;i++){ while(n%i==0){ p.pb(i); n/=i; } } if(n!=1) p.pb(n); sort(all(p)); decomp.insert({1}); for(auto pp : p){ c.clear(); for(auto &x:decomp){ for(int i=0;i<x.size();i++){ vector<int> t=x; t[i]*=pp; sort(all(t)); c.insert(t); } vector<int> t=x; t.pb(pp); sort(all(t)); c.insert(t); } decomp=c; } unordered_set<int> ans; for(auto x:decomp){ long long s=0; for(auto y:x){ s+=y-1; } ans.insert(s); } cout<<ans.size()<<"\n"; for(auto x:ans){ cout<<x<<" "; } cout<<"\n"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |