小磊's blog

题目描述 键盘输入一个高精度的正整数n（≤100位），去掉其中任意s个数字后剩下的数字按照原来的左右次序组成一个新的正整数。编程对给定的n与s，寻找一种方案，使得剩下的数字组成的新数最小。 输入 输入有多组 每组包括原始数n，要去掉的数字数s； 输出 输出去掉s个数后最小的数 #include #include using namespace std; int ma

Saving HDU Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1629 Accepted Submission(s): 716   Problem Descr

Crixalis's Equipment Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1715    Accepted Submission(s): 705 Problem Description Crixalis -

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3187 Accepted Submission(s): 971   Problem

Hero Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2030 Accepted Submission(s): 928 Problem Description When playing DotA with god-like