C-coding/gcd.cpp at master · bakaboi123/C-coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include<bits/stdc++.h>
#define max 1000001
using namespace std;
int smallPrime[max]={};
vector <vector<int> > factor (max);

void seive(){
    for(int i=1;i<max;i++)
    smallPrime[i]=i;
    for(int i=1;i<max;i++)
    {
        if(i%2==0)
        smallPrime[i]=2;
    }
    for(int i = 3;i*i<max;i++)
    {
        if(smallPrime[i]==i)
        {
            for(int j=i*i;j<max;j+=i)
            {
                if(smallPrime[j]==j)
                smallPrime[j]=i;
            }
        }
    }
}
void primeFactor(){
    factor[1].push_back(1);
    for(int i=2;i<max;i++)
    {

        int x = i;
        while(x!=1)
        {
            int temp = smallPrime[x];
            if(x%temp==0)
            {
                factor[i].push_back(temp);
            }
            while(x%temp==0){
                x=x/temp;
            }
        }

    }
}


int main()
{
    int t;
    cin>>t;
    seive();
    primeFactor();
    while(t--)
    {
        int n;
        cin>>n;
        int count = 0;
        vector <vector<int> > v;
        int visited[1000001]={};
        int days = 0;

        while(count!=n)
        {
            vector<int> temp;
            int p[100001]={};
            for(int i=1;i<=n;i++)
            {
                if(visited[i]!=1)
                {

                    vector <int> :: iterator it = factor[i].begin();
                    int count1=0;
                    for(it = factor[i].begin();it!=factor[i].end();it++)
                    {
                        if(p[(*it)]==0)
                        {
                            count1++;
                        }
                        else
                        break;
                    }
                    if(count1==factor[i].size())
                    {
                        count++;
                        temp.push_back(i);
                        visited[i]=1;
                        for(it = factor[i].begin();it!=factor[i].end();it++)
                        {
                            p[*it]=1;
                        }
                    }
                }
            }
            v.push_back(temp);
            days++;
        }
        cout<<days<<endl;
        for(int i=0;i<days;i++)
        {
            vector<int> :: iterator it;
            cout<<v[i].size()<<" ";
            for(it=v[i].begin();it!=v[i].end();it++)
            {
                cout<<*it<<" ";
            }
            cout<<endl;
        }


    }
}