Submission #73379

#TimeUsernameProblemLanguageResultExecution timeMemory
73379jiaqing23Toys (CEOI18_toy)C++14
0 / 100
3 ms520 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define fi first #define se second #define mp make_pair #define pb push_back #define pop pop_back #define fbo find_by_order #define ook order_of_key typedef long long ll; typedef pair<ll,ll> pi; typedef vector<ll> vi; typedef long double ld; typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds; typedef set<ll>::iterator sit; typedef map<ll,ll>::iterator mit; typedef pair<int,pair<int,int> > tri; unordered_set<ll> ans; ll n; vector<ll> fac; void factorize(ll n, ll now, ll smallfac){ if(now == n){ int tem = -fac.size(); for(int i = 0; i < fac.size(); i++) tem+=fac[i]; ans.insert(tem); } for(int i = smallfac; i*now <= n; i++){ if((n/now) % i == 0){ fac.pb(i); factorize(n, now*i, i); fac.pop(); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; factorize(n, 1, 2); cout<<ans.size()<<endl; for(unordered_set<ll>::iterator it = ans.begin(); it!=ans.end(); it++){ cout<<*it<<' '; } return 0; }

Compilation message (stderr)

toy.cpp: In function 'void factorize(ll, ll, ll)':
toy.cpp:32:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < fac.size(); i++) tem+=fac[i];
                        ~~^~~~~~~~~~~~
#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...