oj.uz

답안 #118739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118739 2019-06-19T14:27:42 Z davitmarg Toys (CEOI18_toy) C++17
0 / 100
 2 ms 256 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n,f;
vector<int> a;
set<int> s;
void dfs(int p,int sum,int d)
{
    //cout<<sum<<" : "<<d<<endl;
    if(p==a.size())
    {
        s.insert(sum+d-1);
        return;
    }
    dfs(p+1,sum+d-1,a[p]);
    dfs(p+1,sum,d*a[p]);
}
int main()
{
    cin>>n;
    for(int i=2;i*i<=n;i++)
    {
        if(n%i)
            continue;
        while(n%i==0)
        {
            a.PB(i);
            n/=i;
        }
    }
    if(n>1)
        a.PB(n);
    f=1;
    for(int i=1;i<=a.size();i++)
        f*=i;
    sort(all(a));
    for(int i=1;i<=f/2;i++)
    {
        dfs(0,0,1);
        if(!next_permutation(all(a)))
            break;
    }
    cout<<s.size()<<endl;
    for(auto it=s.begin();it!=s.end();++it)
        printf("%d ",(*it));
    cout<<endl;
	return 0;
}


/*


*/

Compilation message

toy.cpp: In function 'void dfs(int, int, int)':
toy.cpp:31:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(p==a.size())
        ~^~~~~~~~~~
toy.cpp: In function 'int main()':
toy.cpp:55:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<=a.size();i++)
                 ~^~~~~~~~~~

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -