Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

建议用位压缩改写,先对集合排序再统计相同的数目,最后用总数减

Posted by frkstyc at 2005-04-26 20:51:44 on Problem 2419
In Reply To:帮忙看看那里错了,谢谢各位了!!! Posted by:shasha at 2005-04-26 20:46:48
> #include<iostream.h>
> int isequal(int *, int *, int );
> int main(){
> 	int p,t,pp,tt,result=0;
> 	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;
> 	
> 	while(cin>>pp>>tt){
> 		
>         a[pp-1][tt-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<100; i++){
> 		for(int j=0; j<100;j++)
> 			if(a[i][j]!=0){
> 			result++;
> 			break;
> 			}
> 	}
> 
>   
> 	cout<<result<<endl;
> 	return 0;
> }
> 
> 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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator