poj 3349

雪花

額，剛開始不知是怎麼回事，數組開小了RE，開大了MLE

然後我換了個MOD，過了......

#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdio>
#define MOD 14997
using namespace std;
const int maxn = 15000 + 20 ;
typedef struct node{
    int p[7];
}node;
int num[maxn];
node snow[maxn][150];
bool solve(node a,node b){
    sort(a.p,a.p+6);
    sort(b.p,b.p+6);
    for(int i=0;i<6;i++){
            if(a.p[i]!=b.p[i])return false;

    }
    return true;
}
void ori(){
    memset(num,0,sizeof(num));


}
int main(){
    int n;
    while(~scanf("%d",&n)){
            ori();
        int flag=0;
        int sum;
        node tmp;
        for(int i=0;i<n;i++){
                sum=0;
            for(int j=0;j<6;j++){

                scanf("%d",&tmp.p[j]);
                sum+=tmp.p[j];
                sum%=(int)MOD;
            }
            if(!flag){
                for(int k=0;k<num[sum];k++){
                    if(solve(tmp,snow[sum][k])){
                        flag=1;
                        break;
                    }
                }
            }
          snow[sum][num[sum]]=tmp;
          num[sum]++;
        }
        if(flag)printf("Twin snowflakes found.\n");
        else printf("No two snowflakes are alike.\n");
    }
}