摘要：
题目链接 Problem Description键盘输入一个高精度的正整数n（≤100位），去掉其中任意s个数字后剩下的数字按照原来的左右次序组成一个新的正整数。编程对给定的n与s，寻找一种方案，使得剩下的数字组成的新数最小。 Input输入有多组 每组包括原始数n，要去掉的数字数s； Output 阅读全文
摘要：
题目链接 Problem Description Little Q wants to buy a necklace for his girlfriend. Necklaces are single strings composed of multiple red and blue beads.Lit 阅读全文
摘要：
题目链接 Jzzhu has invented a kind of sequences, they meet the following property: You are given x and y, please calculate fn modulo 1000000007 (109 + 7). 阅读全文