Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- unsigned long long v[100001],min,k1[11],n1[11],poz=1,n,i,j,prime[11],k;
- cin>>n>>k;
- prime[1]=2; prime[2]=3; prime[3]=5; prime[4]=7; prime[5]=11;
- prime[6]=13; prime[7]=17; prime[8]=19; prime[9]=23; prime[10]=29;
- v[1]=1;
- for(i=1;i<=k;i++)
- k1[i]=1;
- for(i=2;i<=n;i++)
- {
- for(j=1;j<=k;j++)
- n1[j]=v[k1[j]]*prime[j];
- min=n1[1];
- for(j=2;j<=k;j++)
- if(min>n1[j])min=n1[j];
- v[++poz]=min;
- for(j=1;j<=k;j++)
- if(min==n1[j])k1[j]++;
- }
- for(i=1;i<=n;i++)cout<<v[i]<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement