摘要：
Problem DescriptionFang Fang says she wants to be remembered.I promise her. We define the sequenceFof strings.F0=‘‘f",F1=‘‘ff",F2=‘‘cff",Fn=Fn−1+‘‘f",... 阅读全文
摘要：
Problem DescriptionThere arenpeople andmpairs of friends. For every pair of friends, they can choose to become online friends (communicating using onl... 阅读全文
摘要：
Problem DescriptionPrincess Alisha invites her friends to come to her birthday party. Each of her friends will bring a gift of some valuev, and all of... 阅读全文
摘要：
Problem DescriptionThere arenkids and they want to know who can jump the farthest. For each kid, he can jump three times and the distance he jumps is ... 阅读全文
摘要：
Problem DescriptionAlexandra has a little brother. He is new to programming. One day he is solving the following problem: Given an positive integer N,... 阅读全文
摘要：
Problem DescriptionThere are many people's name and birth in a list.Your task is to print the name from young to old.(There is no pair of two has the ... 阅读全文
摘要：
Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n) The xor of an ... 阅读全文
摘要：
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... 阅读全文
摘要：
Problem Description给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。Input输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为... 阅读全文
