TLU3753

沒啥好說的水題,但不知道爲什麼int可以long long型卻PE?????

 

#include<iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
int N,M;
char name[10005][35];
int binary[35][10];
double bar[10];
char p[35];
int main()
{
    while(scanf("%d%d",&N,&M)!=EOF)
    {
        for(int i=0;i<N;i++)
            scanf("%s",name[i]);
            int sum=0;
        for(int i=0;i<M;i++)
            {
                int k;
                scanf("%d",&k);
                for(int j=0;j<k;j++)
                {
                    scanf("%lf",&bar[0]);
                    //int d=(int)floor(bar[0]+0.05);
                    double temp1=0.95/1.05;
                    double temp2=1.05/0.95;
                    binary[j][0]=0;
                    int flag=0;
                    for(int v=1;v<8;v++)
                    {

                        scanf("%lf",&bar[v]);

                        if(bar[v]/bar[0]>=temp1&&bar[v]/bar[0]<=temp2)
                            binary[j][v]=0;
                        else
                        {
                            binary[j][v]=1;
                            if(bar[v]/bar[0]>=0.5*temp1&&bar[v]/bar[0]<=0.5*temp2)
                                flag=1;

                        }
                    }

                    if(flag)
                    {
                        int temp;
                        for(int h=0;h<8;h++)
                        {
                             temp=binary[j][h];
                             binary[j][h]=!temp;
                        }


                    }
               // for(int g=0;g<8;g++)printf("%d ",binary[j][g]);printf("/n");
                    int decimal=0;
                    for(int h=0;h<8;h++)
                    {
                        decimal=decimal*2+binary[j][h];
                    }
                    p[j]=decimal+'a'-97;
                   // printf("%c/n",p[j]);
                }

                for(int h=0;h<N;h++)
                {
                    int flag1=0;
                    for(int u=0;u<k;u++)
                    {
                        if(name[h][u]!=p[u])
                        {
                            flag1=1;
                            break;
                        }
                    }
                    if(!flag1)
                        sum++;

                }

            }
    printf("%d/n",sum);
    }
    return 0;
}

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章