제출 #581717

#제출 시각아이디문제언어결과실행 시간메모리
581717OspleiToys (CEOI18_toy)C++17
0 / 100
1 ms392 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector <ll> d;
set <ll> v;

void j (ll p, ll n, ll c){
  v.insert(c+n-1);
  if (n==1) return;
  if (n<d[p]*d[p]) return;
  if (p==d.size()) return;
  if (n%d[p]==0) j(p, n/d[p], c+d[p]-1);
  j(p+1, n, c);
}

int main(){
  ll n;

  cin >> n;

  for (ll i=1; i*i<=n; i++){
    if (n%i) continue; 
    if (i>1) d.push_back(i);
  }
    
  sort (d.begin(), d.end());
  j(0, n, 0);

  cout << v.size() << "\n";
  for (auto &i : v) cout << i << " ";
  cout << "\n";
}

컴파일 시 표준 에러 (stderr) 메시지

toy.cpp: In function 'void j(ll, ll, ll)':
toy.cpp:14:8: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   if (p==d.size()) return;
      |       ~^~~~~~~~~~
#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...