| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
为什么老是wa,请帮忙#include<iostream.h>
int isEqual(int *, int *, int);
void main()
{
int p,t,person,tree,result;
int a[100][100];
for(int i=0;i<100;i++)
for(int j=0;j<100;j++)
a[i][j]=0;
cin>>p>>t;
result=p;
while(cin>>person>>tree)
{
a[person-1][tree-1]=1;
}
for(i=0; i<100; i++)
for(int j=i+1; j<100; j++)
{
if(isEqual(a[i],a[j],100))
{
for(int m=0; m<100; m++)
a[j][m]=0;
}
}
for(i=0;i<p;i++)
{
for(int j=0;j<100;j++)
{
if(a[i][j]!=0)
{
break;
}
}
if(j==100)
result--;
}
cout<<result<<endl;
}
int isEqual(int *a,int *b,int n)
{
for(int i=0;i<n;i++)
if(a[i]!=b[i])
return 0;
return 1;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator