답안 #123144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
123144	2019-06-30T09:12:14 Z	davitmarg	Toys (CEOI18_toy)	C++17	19 / 100	5000 ms	504 KB

toy

/*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/n;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())
        ~^~~~~~~~~~

Subtask #1

19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	256 KB	Output is correct
2	Correct	9 ms	256 KB	Output is correct
3	Correct	7 ms	376 KB	Output is correct
4	Correct	72 ms	392 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	25 ms	256 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct
8	Correct	140 ms	364 KB	Output is correct
9	Correct	72 ms	376 KB	Output is correct
10	Correct	16 ms	380 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	52 ms	356 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	12 ms	256 KB	Output is correct
15	Correct	16 ms	252 KB	Output is correct
16	Correct	277 ms	476 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	153 ms	388 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	32 ms	504 KB	Output is correct
21	Correct	151 ms	256 KB	Output is correct
22	Correct	58 ms	356 KB	Output is correct
23	Correct	73 ms	352 KB	Output is correct
24	Correct	186 ms	360 KB	Output is correct
25	Correct	295 ms	376 KB	Output is correct

Subtask #2

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	256 KB	Output is correct
2	Correct	9 ms	256 KB	Output is correct
3	Correct	7 ms	376 KB	Output is correct
4	Correct	72 ms	392 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	25 ms	256 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct
8	Correct	140 ms	364 KB	Output is correct
9	Correct	72 ms	376 KB	Output is correct
10	Correct	16 ms	380 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	52 ms	356 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	12 ms	256 KB	Output is correct
15	Correct	16 ms	252 KB	Output is correct
16	Correct	277 ms	476 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	153 ms	388 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	32 ms	504 KB	Output is correct
21	Correct	151 ms	256 KB	Output is correct
22	Correct	58 ms	356 KB	Output is correct
23	Correct	73 ms	352 KB	Output is correct
24	Correct	186 ms	360 KB	Output is correct
25	Correct	295 ms	376 KB	Output is correct
26	Correct	1698 ms	376 KB	Output is correct
27	Correct	1611 ms	364 KB	Output is correct
28	Correct	696 ms	376 KB	Output is correct
29	Correct	611 ms	364 KB	Output is correct
30	Correct	269 ms	256 KB	Output is correct
31	Execution timed out	5033 ms	256 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	256 KB	Output is correct
2	Correct	9 ms	256 KB	Output is correct
3	Correct	7 ms	376 KB	Output is correct
4	Correct	72 ms	392 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	25 ms	256 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct
8	Correct	140 ms	364 KB	Output is correct
9	Correct	72 ms	376 KB	Output is correct
10	Correct	16 ms	380 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	52 ms	356 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	12 ms	256 KB	Output is correct
15	Correct	16 ms	252 KB	Output is correct
16	Correct	277 ms	476 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	153 ms	388 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	32 ms	504 KB	Output is correct
21	Correct	151 ms	256 KB	Output is correct
22	Correct	58 ms	356 KB	Output is correct
23	Correct	73 ms	352 KB	Output is correct
24	Correct	186 ms	360 KB	Output is correct
25	Correct	295 ms	376 KB	Output is correct
26	Correct	1698 ms	376 KB	Output is correct
27	Correct	1611 ms	364 KB	Output is correct
28	Correct	696 ms	376 KB	Output is correct
29	Correct	611 ms	364 KB	Output is correct
30	Correct	269 ms	256 KB	Output is correct
31	Execution timed out	5033 ms	256 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	256 KB	Output is correct
2	Correct	9 ms	256 KB	Output is correct
3	Correct	7 ms	376 KB	Output is correct
4	Correct	72 ms	392 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	25 ms	256 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct
8	Correct	140 ms	364 KB	Output is correct
9	Correct	72 ms	376 KB	Output is correct
10	Correct	16 ms	380 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	52 ms	356 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	12 ms	256 KB	Output is correct
15	Correct	16 ms	252 KB	Output is correct
16	Correct	277 ms	476 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	153 ms	388 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	32 ms	504 KB	Output is correct
21	Correct	151 ms	256 KB	Output is correct
22	Correct	58 ms	356 KB	Output is correct
23	Correct	73 ms	352 KB	Output is correct
24	Correct	186 ms	360 KB	Output is correct
25	Correct	295 ms	376 KB	Output is correct
26	Correct	1698 ms	376 KB	Output is correct
27	Correct	1611 ms	364 KB	Output is correct
28	Correct	696 ms	376 KB	Output is correct
29	Correct	611 ms	364 KB	Output is correct
30	Correct	269 ms	256 KB	Output is correct
31	Execution timed out	5033 ms	256 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	256 KB	Output is correct
2	Correct	9 ms	256 KB	Output is correct
3	Correct	7 ms	376 KB	Output is correct
4	Correct	72 ms	392 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	25 ms	256 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct
8	Correct	140 ms	364 KB	Output is correct
9	Correct	72 ms	376 KB	Output is correct
10	Correct	16 ms	380 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	52 ms	356 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	12 ms	256 KB	Output is correct
15	Correct	16 ms	252 KB	Output is correct
16	Correct	277 ms	476 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	153 ms	388 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	32 ms	504 KB	Output is correct
21	Correct	151 ms	256 KB	Output is correct
22	Correct	58 ms	356 KB	Output is correct
23	Correct	73 ms	352 KB	Output is correct
24	Correct	186 ms	360 KB	Output is correct
25	Correct	295 ms	376 KB	Output is correct
26	Correct	1698 ms	376 KB	Output is correct
27	Correct	1611 ms	364 KB	Output is correct
28	Correct	696 ms	376 KB	Output is correct
29	Correct	611 ms	364 KB	Output is correct
30	Correct	269 ms	256 KB	Output is correct
31	Execution timed out	5033 ms	256 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-