Submission #111735

---

Source Code Expand

#!/usr/bin/env python
# -*- coding:utf-8 -*-
import time
import sys
import io
import re
import math
#start = time.time()
#start = time.clock()
l=[]
g=[]
o=[]
x,y=0,1
(N,M) = map(int, raw_input().split())
if M==0:
    print '1'
else:
    for j in range(M):
        l.append(map(int, raw_input().split()))
    for k in l:
        g.append(int(l[x][1]))
        x+=1
    for a in g:
        o.append(g.count(y))
        y+=1
    print max(o)+1

Submission Info

Judge Result