# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
458179 | 2021-08-08T02:11:08 Z | cpp219 | Toys (CEOI18_toy) | C++14 | 147 ms | 262148 KB |
#pragma GCC optimization O2 #pragma GCC optimization "unroll-loop" #pragma target ("avx2") #include <bits/stdc++.h> #define ll int #define ld long double #define fs first #define sc second using namespace std; typedef pair<ll,ll> LL; const ll N = 1e5 + 9; const ll Log2 = 21; const ll inf = 1e9 + 7; map<LL,ll> mp; vector<ll> uoc,ans; ll n; void f(ll rm,ll sum){ mp[{rm,sum}] = 1; if (rm == 1) ans.push_back(sum); for (auto i : uoc) if (rm % i == 0) f(rm/i,sum + i - 1); } int main(){ ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0); #define task "tst" if (fopen(task".INP","r")){ freopen(task".INP","r",stdin); //freopen(task".OUT","w",stdout); } cin>>n; uoc.push_back(n); for (ll i = 2;i <= n/i;i++){ if (n%i == 0){ uoc.push_back(i); if (n/i != i) uoc.push_back(n/i); } } f(n,0); sort(ans.begin(),ans.end()); ans.resize(unique(ans.begin(),ans.end()) - ans.begin()); cout<<ans.size()<<"\n"; for (auto i : ans) cout<<i<< " "; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 147 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 147 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 147 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 147 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 147 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |