Skip to content

Instantly share code, notes, and snippets.

@shounaklohokare

shounaklohokare/ACM ICPC Team Secret

Created December 21, 2020 08:48
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save shounaklohokare/826b4db4370c7b28959af88e274486c5 to your computer and use it in GitHub Desktop.
Save shounaklohokare/826b4db4370c7b28959af88e274486c5 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
ACM ICPC Team
def acmTeam(topic):
ans = []
for i in range(n):
for j in range(i+1, n):
know=0
for a,b in zip(topic[i], topic[j]):
if a=='1' or b=='1':
know+=1
ans.append(know)
return [max(ans), ans.count(max(ans))]
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment