제출 #116694

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116694		johutha	Toys (CEOI18_toy)	C++14	100 / 100	3198 ms	86600 KiB

toy

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

#define int int64_t

using namespace std;

vector<int> getdivs(int n)
{
  vector<int> res;
  for (int d = 2; d*d <= n; d++)
  {
    if (n % d == 0)
    {
    	res.push_back(d);
    	if (d * d != n) res.push_back(n / d);
    }
  }
  res.push_back(n);
  sort(res.begin(), res.end());
  return res;
}

signed main()
{
  int n;
  cin >> n;
  
  vector<int> divs = getdivs(n);
  
  int dc = divs.size();
  
  vector<set<int>> res(dc);
  
  for (int f = 0; f < dc; f++)
  {
    int fdiv = divs[f];
    for (int sd = 0; sd < f; sd++)
    {
      int sdiv = divs[sd];
      if (fdiv % sdiv == 0)
      {
        int od = fdiv / sdiv;
        for (int nr : res[sd])
        {
          res[f].insert(nr + od - 1);
        }
      }
    }
    res[f].insert(fdiv - 1);
  }
  cout << res[dc - 1].size() << "\n";
  for (int i : res[dc - 1]) cout << i << " ";
  cout << "\n";
}

• Subtask 1: 19 / 19
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 21 / 21