DTL66的博客

E - Doing Homework againTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description zichen has just come back school from the 30th ACM/ ICPC. Now he has a l

F - TIANKENG’s restaurantTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatus Description TIANKENG manages a restaurant after graduating from ZCMU, and tens of t

1189 - Sum of Factorials   PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBGiven an integer n, you have to find whether it can b

C. Quiztime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao is taking part in a quiz. The quiz consists of

A Magic Lamp 题意：给出一个大数，然后给出N,输出大数去除N个数之后的最小数，不输出前导0； 思路：反向想一下就是从大数中取strlen(str)-N个数使取出的数最小，枚举每一个区间右端点，计算区间左端点即可，每次查询需要得到查找区间范围内最小值的位置（多个最小值时反回位置最小者），所以d[][]保存的应该是最小值的位置而不是最小值；*AC代码：#include<cstdio>