摘要：
Problem Description: Input: 输入数据有多组，每一组第一行包含两个数字N，M(1 <= N <= 50000 , 1 <= M <= 50000) 接下来M行，每一行包含两个数， 第一个数输入1则表示铁头娃要分蛋糕，接下来一个数字K，表示所有编号取余K为0的小伙伴分到一个蛋 阅读全文
摘要：
Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his sma 阅读全文
摘要：
题目描述：There are n cities in Byteland, and the ith city has a value ai. The cost of building a bidirectional road between two cities is the sum of their 阅读全文
摘要：
Problem Description: Input: 输入包含多个测试用例。 每行包含两个整数n，m（0 <n，m <= 2000）。 当n = 0和m = 0时输入终。 Input: Output: 如果kiki赢，输出kiki；如果bibi赢，输出bibi。 Output: Sample In 阅读全文