Codeforces Gym101473 E.Dangerous Dive (2013-2014 ACM-ICPC Brazil Subregional Programming Contest)

 

 

代码：

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<cmath>
 5 #include<algorithm>
 6 using namespace std;
 7 const int N=1e4+10;
 8 int a[N];
 9 int flag[N];
10 int main(){
11     int n,m;
12     while(~scanf("%d%d",&n,&m)){
13         memset(flag,0,sizeof(flag));
14         for(int i=1;i<=m;i++){
15             scanf("%d",&a[i]);
16             flag[a[i]]=1;
17         }
18         int num=0;
19         for(int i=1;i<=n;i++){
20             if(flag[i]==0){
21                 printf("%d ",i);
22                 num++;
23             }
24         }
25         if(num==0)printf("*\n");
26         else cout<<endl;
27     }
28     return 0;
29 }