Submission #1250081

#TimeUsernameProblemLanguageResultExecution timeMemory
1250081PlayVoltzToys (CEOI18_toy)C++20
100 / 100
2076 ms86480 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> #include <random> #include <chrono> #include <fstream> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; vector<int> vect; for (int i=1; i<=sqrt(n); ++i){ if (!(n%i))vect.pb(i); if (!(n%i)&&n!=i*i)vect.pb(n/i); } sort(vect.begin(), vect.end()); vector<set<int> > dp(vect.size()); dp[0].insert(0); for (int i=0; i<vect.size(); ++i)for (int j=0; j<i; ++j)if (!(vect[i]%vect[j]))for (auto a:dp[j])dp[i].insert(a+vect[i]/vect[j]-1); cout<<dp.back().size()<<"\n"; for (auto a:dp.back())cout<<a<<" "; }
#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...