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

Help...实在想不出哪WR了...3X了

Posted by Bter at 2006-04-15 23:40:21 on Problem 2419
#include <iostream.h>
#include <string.h>

void main ()
{
	int		a[101][101], set[101]; 
	int		t, p, i, j; 

	cin >> p >> t; 
	memset(a, 0, sizeof(a)); 
	while (cin >> i >> j) {
		a[i][j] = 1; a[i][0] ++; 
	}
	int tot = 0; 
	int num = 0; 
	memset(set, 0, sizeof(set)); //集合
	for (i = 1; i <= p; i ++) 
		if (set[i] == 0) { 
			++ tot; //集合标号
			set[i] = tot; 
			for (j = i + 1; j <= p; j ++) 
				if (a[i][0] == a[j][0]) {	
					bool flag = true; 
					for (int k = 1; k <= t; k ++) 
						if (a[i][k] != a[j][k]) { 
							flag = false; break; 
						}					
					if (flag) { set[j] = set[i]; num ++; }
				}
		}
	cout << tot << endl; 	
//	cout << p - num << endl; 
}

不管是输出集合数目,还是用P-相同数目都WR...实在想不出哪有BUG,3X各位了

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