Submission #960504

#TimeUsernameProblemLanguageResultExecution timeMemory
960504vjudge1Toys (CEOI18_toy)C++14
100 / 100
580 ms4548 KiB
#include<bits/stdc++.h>

using namespace std;

int n;
vector<int> divs;
vector<int> v;
set<int> ans;

void backtrack(int cur, int lst, int sum){
   if (cur==1){
      ans.insert(sum);
      return;
   }
   for (int i:divs){
      if (i>lst) break;
      if (cur%i) continue;
      backtrack(cur/i, i, sum+i-1);
   }
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   for (int i=1; i*i<=n; ++i) if (n%i==0){
      if (i!=1) divs.push_back(i);
      if (i*i!=n) divs.push_back(n/i);
   }
   sort(divs.begin(), divs.end());
   for (int i:divs) backtrack(n/i, i, i-1);
   if (n==1){
      cout << "1\n0\n";
      return 0;
   }
   cout << ans.size() << '\n';
   for (int i:ans) cout << i << ' ';
   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...