2530081_ce.cpp

做的POJ的一些题目

#include <stdio.h>
#include <stdlib.h>
using namespace std;
int mg[100000][7];
void com(int n)
{
     int i,j,k;
    for(i=0;i<n;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(mg[j][6]==mg[i][6])
            {
                  for(k=0;k<6;k++)
                  {
                      int kw=0,w=0;
                      while(mg[i][k]!=mg[j][w] && w<6)
                           w++;
                      if(w==6)
                        continue;
                      if(mg[i][k]==mg[j][w])
                      if(mg[i][(k+1)%6]==mg[j][(w+1)%6])
                      if(mg[i][(k+2)%6]==mg[j][(w+2)%6])
                      if(mg[i][(k+3)%6]==mg[j][(w+3)%6]) 
                      if(mg[i][(k+4)%6]==mg[j][(w+4)%6])
                      if(mg[i][(k+5)%6]==mg[j][(w+5)%6])
                      {
                                printf("%s\n","Twin snowflakes found.");
                                return;            
                      }    
                      if(mg[i][k]==mg[j][w])
                      if(mg[i][(k-1)%6]==mg[j][(w+1)%6])
                      if(mg[i][(k-2)%6]==mg[j][(w+2)%6])
                      if(mg[i][(k-3)%6]==mg[j][(w+3)%6])
                      if(mg[i][(k-4)%6]==mg[j][(w+4)%6])
                      if(mg[i][(k-5)%6]==mg[j][(w+5)%6])
                      {
                                 printf("%s\n","Twin snowflakes found.");
                                 return;     
                      }
                  }        
            }  
        }       
    } 
     printf("%s\n","No two snowflakes are alike.");  
}
int main()
{
    int n,i,h;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
         mg[i][6]=0;
         for(h=0;h<6;h++)
         {  
               scanf("%d",&mg[i][h]);
               mg[i][6]=mg[i][6]+mg[i][h];
         } 
    }
    com(n);
    system("pause");
    return 0;
}