三 彩 测 评

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <windows.h>
using namespace std;
int n,m,a[50010],b[50010],xihuan[10010],answer;
int main()
{
	memset(xihuan,1,sizeof(xihuan));
	scanf("%d%d",&n,&m);
	for(int i=1; i<=m; i++) scanf("%d%d",&a[i],&b[i]);
	for(int i=1; i<=m; i++)
		xihuan[b[i]]++;
	for(int i=1; i<=m; i++)
		for(int j=1; j<=m; j++)
			if(b[i]==a[j])
				xihuan[b[j]]++;
	int maxn=-99;
	for(int i=1; i<=n; i++)
		if(xihuan[i]>maxn)
			maxn=xihuan[i];
	answer=0;
	for(int i=1; i<=n; i++)
		if(maxn==xihuan[i])
			answer++;
	printf("%d\n",answer);
	return 0;
}