摘要：DescriptionThere is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has ... 阅读全文

摘要：Description尼克发明了这样一个游戏：在一个坐标轴上，有一些圆，这些圆的圆心都在x轴上，现在给定一个x轴上的点，保证该点没有在这些圆内(以及圆上)，尼克可以以这个点为圆心做任意大小的圆，他想知道自己做多可以与多少个给定的圆相交(相切也算,包含不算)。Input输入有多组数据 输入到文件尾每一... 阅读全文

摘要：Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is o... 阅读全文

摘要：时间限制:7000ms单点时限:1000ms内存限制:256MB描述给定两个整数n和m，求是否存在恰好包含n个0和m个1的01串S，使得S中不存在子串"001"和"11"。如果存在符合条件的01串则输出字典序最小的S，否则输出NO。输入一行两个整数，表示n和m。(0#include #include... 阅读全文

摘要：DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to ... 阅读全文