- #include<stdio.h>
- #include<math.h>
- #include<stdlib.h>
- int sortvdei (const void *a,const void*b){
- if (*(int*)a>*(int*)b)
- return 1;
- else
- return -1;}
- int eric (const void *a,const void*b){
- if (*(int*)a>*(int*)b)
- return -1;
- else
- return 1;}
- int main()
- {
- freopen ("printesa.in","r",stdin);
- freopen ("printesa.out","w",stdout);
- int h,v[1001],k,i,j,cate,p[1001],ciur[1001],x;
- scanf ("%d%d",&k,&h);
- for (i=1;i<=h;i++)
- scanf ("%d",&v[i]);
- qsort (v+1,h,sizeof (v[1]),sortvdei);
- x=sqrt (60000);
- ciur[1]=1;
- for (i=2;i<=x;i++)
- if (ciur[i]==0){
- for (j=2;j<=x/2;j++)
- ciur[i*j]=1;
- for (i=1;i<=k;i++)
- if (i!=v[i])
- p[i]=i;}
- qsort (p+1,k,sizeof (p[1]),eric);
- for (i=1;i<=k;i++)
- printf ("%d ",p[i]);
- return 0;
- }
Buna!
Va rog imi aratati cum generez primii n termeni primi pentru un vector??
Welcome to BitCell. Click here to register !