一道acm题,Delete NumberTime Limit:1000MS Memory Limit:65536KTotal Submit:701 Accepted:129DescriptionGiven 2 integer number n and m.You can delete m digits from the number n,then number n changes to a new number n1.Tell me how to delete the number,

来源:学生作业帮助网 编辑:六六作业网 时间:2024/11/08 14:24:04
一道acm题,DeleteNumberTimeLimit:1000MSMemoryLimit:65536KTotalSubmit:701Accepted:129DescriptionGiven2int

一道acm题,Delete NumberTime Limit:1000MS Memory Limit:65536KTotal Submit:701 Accepted:129DescriptionGiven 2 integer number n and m.You can delete m digits from the number n,then number n changes to a new number n1.Tell me how to delete the number,
一道acm题,
Delete Number
Time Limit:1000MS Memory Limit:65536K
Total Submit:701 Accepted:129
Description
Given 2 integer number n and m.You can delete m digits from the number n,then number n changes to a new number n1.Tell me how to delete the number,you can get the smallest one.
For example,
m:1 n:1456
n1 may be 145,156,146,456
the smallest one is 145.Then n1 should be 145.
Input
The input consists of T test cases.The number of them (T) is given on the first line of the input file.Each test case consists of one single line containing two integer number m(1

一道acm题,Delete NumberTime Limit:1000MS Memory Limit:65536KTotal Submit:701 Accepted:129DescriptionGiven 2 integer number n and m.You can delete m digits from the number n,then number n changes to a new number n1.Tell me how to delete the number,
1
2 178023
if (*(p-1)>*p&&n>0)
{
del (p-1);
n--;
}
……
if (*(p-1)>*p&&n>0)
{
del (p-1);
n--;
p=str+1;
}
不知道题目在那~没有测试~

一道acm题,Delete NumberTime Limit:1000MS Memory Limit:65536KTotal Submit:701 Accepted:129DescriptionGiven 2 integer number n and m.You can delete m digits from the number n,then number n changes to a new number n1.Tell me how to delete the number, 一道acm的排序题Snow_storm有n(0 ACM一道算法题,我的算法为何WADescription There is N pairs of balls in a small box.That means the number for each pair is the same.However,for some reason,a ball is lost.Now,you will get the number of the rest.Can you find the number of the 一道基础的ACM数学编程题When we were young,everyone was taught that:If the sum of a number's each bit could be exactly divided by 3,then itself would be exactly divided by 3,so for a k-base number,if that the sum of its each bit could be e 一道ACM水题,还可以怎么简化呢?DescriptionA prime number is a natural number which has exactly two distinct natural number divisors:1 and itself.The first prime number is 2.Can you write a program that computes the nth prime number,given a c语言acm题 acm刷题是什么意思 阶乘所得结果的位数怎么算?这是一道acm编程题. acm的一道c语言问题 一道数学的ACM题.1514:x + 2y + 3z = nTime Limit:1000MS Memory Limit:65536KTotal Submit:229 Accepted:52 [Submit] [Status] [Discuss] Font Size:Aa Aa Aa DescriptionThis problem is so easy:given an positive integer n,you are to find the number of so 英语翻译The output contains the number of digits in the factorial of the integers appearing in the input.PS:这是一道ACM题中出现的,一个单词一个单词查,最后也木串出一个明确的意思⊙﹏⊙b汗 一道ACM英语题The checking principle is very simple:The computer regards each fishing net as a simple graph constructed by nodes and edges.In the graph,if any circle whose length (the number of edges) is larger than 3 must has at least one chord, 一道很简单的ACM题,求大神看看我错在哪儿了,C++You must have heard of an ancient encryption called Caesar cipher or 'shift cipher'.That is,given the plaintext and a number D,you should replace every character c in the plaintext with an 一道ACM题求大神指导是怎么推出周期的?Problem Description A number sequence is defined as follows:f(1) = 1,f(2) = 1,f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A,B,and n,you are to calculate the value of f(n).Input The input consis c语言acm水题不会弄Descriptionfind the median of several integersInputThe first line of input is the number of test cases T(T 问道ACM题,Problem DescriptionGiven a number sequence A with n numbers,you task is to find the max A[i]-A[j] which i 一道ACM题目(解释一下题意)http://acm.hrbeu.edu.cn/index.php?act=problem&proid=6060主要是这段话不理解:Factorials grow very rapidly--5! = 120, 10! = 3,628,800. One way of specifying such large numbers is by specifying the number of 求助一道ACM题一道很简单的ACM题目,题在这里我写的代码如下:#include using namespace std;int main(){int n,m[30];cin>>n;for(int i=0;i=0;j--){cout