Skip to content

Instantly share code, notes, and snippets.

View ShaneRich5's full-sized avatar
🏠
Working from home

Shane Richards ShaneRich5

🏠
Working from home
33 followers · 62 following
  • FTI Consulting
  • New York, NY
View GitHub Profile
@ShaneRich5
ShaneRich5 / acm_icpc_team.py
Created April 26, 2017 15:10
Solution to the ACM ICPC Team problem. https://www.hackerrank.com/challenges/acm-icpc-team
#!/bin/python
n, k = map(int, raw_input().split(' '))
queen_row, queen_column = map(int, raw_input().split(' '))
top = n - queen_row
bottom = queen_row - 1
right = n - queen_column
left = queen_column - 1
@ShaneRich5
ShaneRich5 / instruction.md
Last active May 10, 2020 23:58
Solution to the Queen Attack II Problem on Hackerrank. https://www.hackerrank.com/challenges/queens-attack-2

You are given a list of people who are attending ACM-ICPC World Finals. Each of them are either well versed in a topic or they are not. Find out the maximum number of topics a 2-person team can know. And also find out how many teams can know that maximum number of topics.

Note Suppose a, b, and c are three different people, then (a,b) and (b,c) are counted as two different teams.

Input Format

The first line contains two integers, and , separated by a single space, where represents the number of people, and represents the number of topics. lines follow. Each line contains a binary string of length . If the th line's th character is , then the th person knows the th topic; otherwise, he doesn't know the topic.

Constraints