답안 #123143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123143 2019-06-30T09:11:48 Z davitmarg Toys (CEOI18_toy) C++17
19 / 100
5000 ms 404 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;
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);
    sort(all(a));
    for(int i=0;i<=1000000;i++)
    {
        dfs(0,0,1);
		random_shuffle(all(a));
    }
    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())
        ~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 12 ms 256 KB Output is correct
3 Correct 12 ms 256 KB Output is correct
4 Correct 72 ms 404 KB Output is correct
5 Correct 12 ms 256 KB Output is correct
6 Correct 70 ms 368 KB Output is correct
7 Correct 13 ms 376 KB Output is correct
8 Correct 136 ms 360 KB Output is correct
9 Correct 70 ms 256 KB Output is correct
10 Correct 71 ms 364 KB Output is correct
11 Correct 12 ms 376 KB Output is correct
12 Correct 152 ms 364 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 69 ms 376 KB Output is correct
15 Correct 69 ms 364 KB Output is correct
16 Correct 268 ms 376 KB Output is correct
17 Correct 12 ms 252 KB Output is correct
18 Correct 153 ms 376 KB Output is correct
19 Correct 12 ms 256 KB Output is correct
20 Correct 154 ms 376 KB Output is correct
21 Correct 152 ms 376 KB Output is correct
22 Correct 296 ms 360 KB Output is correct
23 Correct 70 ms 376 KB Output is correct
24 Correct 546 ms 256 KB Output is correct
25 Correct 296 ms 360 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 12 ms 256 KB Output is correct
3 Correct 12 ms 256 KB Output is correct
4 Correct 72 ms 404 KB Output is correct
5 Correct 12 ms 256 KB Output is correct
6 Correct 70 ms 368 KB Output is correct
7 Correct 13 ms 376 KB Output is correct
8 Correct 136 ms 360 KB Output is correct
9 Correct 70 ms 256 KB Output is correct
10 Correct 71 ms 364 KB Output is correct
11 Correct 12 ms 376 KB Output is correct
12 Correct 152 ms 364 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 69 ms 376 KB Output is correct
15 Correct 69 ms 364 KB Output is correct
16 Correct 268 ms 376 KB Output is correct
17 Correct 12 ms 252 KB Output is correct
18 Correct 153 ms 376 KB Output is correct
19 Correct 12 ms 256 KB Output is correct
20 Correct 154 ms 376 KB Output is correct
21 Correct 152 ms 376 KB Output is correct
22 Correct 296 ms 360 KB Output is correct
23 Correct 70 ms 376 KB Output is correct
24 Correct 546 ms 256 KB Output is correct
25 Correct 296 ms 360 KB Output is correct
26 Execution timed out 5068 ms 380 KB Time limit exceeded
27 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 12 ms 256 KB Output is correct
3 Correct 12 ms 256 KB Output is correct
4 Correct 72 ms 404 KB Output is correct
5 Correct 12 ms 256 KB Output is correct
6 Correct 70 ms 368 KB Output is correct
7 Correct 13 ms 376 KB Output is correct
8 Correct 136 ms 360 KB Output is correct
9 Correct 70 ms 256 KB Output is correct
10 Correct 71 ms 364 KB Output is correct
11 Correct 12 ms 376 KB Output is correct
12 Correct 152 ms 364 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 69 ms 376 KB Output is correct
15 Correct 69 ms 364 KB Output is correct
16 Correct 268 ms 376 KB Output is correct
17 Correct 12 ms 252 KB Output is correct
18 Correct 153 ms 376 KB Output is correct
19 Correct 12 ms 256 KB Output is correct
20 Correct 154 ms 376 KB Output is correct
21 Correct 152 ms 376 KB Output is correct
22 Correct 296 ms 360 KB Output is correct
23 Correct 70 ms 376 KB Output is correct
24 Correct 546 ms 256 KB Output is correct
25 Correct 296 ms 360 KB Output is correct
26 Execution timed out 5068 ms 380 KB Time limit exceeded
27 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 12 ms 256 KB Output is correct
3 Correct 12 ms 256 KB Output is correct
4 Correct 72 ms 404 KB Output is correct
5 Correct 12 ms 256 KB Output is correct
6 Correct 70 ms 368 KB Output is correct
7 Correct 13 ms 376 KB Output is correct
8 Correct 136 ms 360 KB Output is correct
9 Correct 70 ms 256 KB Output is correct
10 Correct 71 ms 364 KB Output is correct
11 Correct 12 ms 376 KB Output is correct
12 Correct 152 ms 364 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 69 ms 376 KB Output is correct
15 Correct 69 ms 364 KB Output is correct
16 Correct 268 ms 376 KB Output is correct
17 Correct 12 ms 252 KB Output is correct
18 Correct 153 ms 376 KB Output is correct
19 Correct 12 ms 256 KB Output is correct
20 Correct 154 ms 376 KB Output is correct
21 Correct 152 ms 376 KB Output is correct
22 Correct 296 ms 360 KB Output is correct
23 Correct 70 ms 376 KB Output is correct
24 Correct 546 ms 256 KB Output is correct
25 Correct 296 ms 360 KB Output is correct
26 Execution timed out 5068 ms 380 KB Time limit exceeded
27 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 12 ms 256 KB Output is correct
3 Correct 12 ms 256 KB Output is correct
4 Correct 72 ms 404 KB Output is correct
5 Correct 12 ms 256 KB Output is correct
6 Correct 70 ms 368 KB Output is correct
7 Correct 13 ms 376 KB Output is correct
8 Correct 136 ms 360 KB Output is correct
9 Correct 70 ms 256 KB Output is correct
10 Correct 71 ms 364 KB Output is correct
11 Correct 12 ms 376 KB Output is correct
12 Correct 152 ms 364 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 69 ms 376 KB Output is correct
15 Correct 69 ms 364 KB Output is correct
16 Correct 268 ms 376 KB Output is correct
17 Correct 12 ms 252 KB Output is correct
18 Correct 153 ms 376 KB Output is correct
19 Correct 12 ms 256 KB Output is correct
20 Correct 154 ms 376 KB Output is correct
21 Correct 152 ms 376 KB Output is correct
22 Correct 296 ms 360 KB Output is correct
23 Correct 70 ms 376 KB Output is correct
24 Correct 546 ms 256 KB Output is correct
25 Correct 296 ms 360 KB Output is correct
26 Execution timed out 5068 ms 380 KB Time limit exceeded
27 Halted 0 ms 0 KB -