枚举等待牌,然后枚举一个对子,然后判断剩下的牌能否拿掉,我们可以从小到大贪心地先拿刻子,再拿顺子。复杂度 O(n3)
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 410
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,m,a[N],ans[N],b[N];
inline bool jud1(){
for(int i=1;i<=n;++i){
b[i]%=3;if(i+2>n&&b[i]) return 0;
if(b[i+1]<b[i]||b[i+2]<b[i]) return 0;
b[i+1]-=b[i];b[i+2]-=b[i];
}return 1;
}
inline bool jud(){
for(int i=1;i<=n;++i){
if(a[i]<2) continue;
memcpy(b,a,sizeof(a));b[i]-=2;
if(jud1()) return 1;
}return 0;
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();
for(int i=1;i<=3*m+1;++i) a[read()]++;
for(int i=1;i<=n;++i){
a[i]++;if(jud()) ans[++ans[0]]=i;a[i]--;
}if(!ans[0]){puts("NO");return 0;}
printf("%d",ans[1]);for(int i=2;i<=ans[0];++i) printf(" %d",ans[i]);
return 0;
}