标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1858 Accepted Submission(s): 727
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
char s[10010];
int n,len;
void work()
{
int temp=n;
while(temp--)
{
int i=0;
while(i<len-1&&s[i]<=s[i+1]) i++;
for(int j=i+1;j<len;j++)
s[j-1]=s[j];
}
}
int main()
{
while(scanf("%s%d",s,&n)!=EOF)
{
len=strlen(s);
if(n>=len)
{
printf("0\n");
continue;
}
work();
bool flag=false;
for(int i=0;i<len-n;i++)
{
if(!flag&&(s[i]==‘0‘&&i!=len-n-1))
continue;
else
{
printf("%c",s[i]);
flag=1;
}
}
printf("\n");
memset(s,‘0‘,sizeof(s));
}
return 0;
}
标签:
原文地址:http://www.cnblogs.com/a972290869/p/4262252.html