Tongji Online Judge ID:1013

Tongji Online Judge
Problem 1013: 高精度整数去位去最小问题

#include<stdio.h>#include<string.h>#define MAX 240int min(char * str, int cur, int end){        int i, min=cur;        for(i=cur+1; i<=end; i++)                 if(str[i]<str[min])                         min=i;        return min;}int main(){        char str[MAX];        int i, n, m, p;        while(scanf("%s%d", str, &n)!=EOF){                p=-1;                m=strlen(str);                for(i=0;i<m-n;i++) {                        p=min(str, ++p, n+i);                        if(p==n+i) {                                for(; p<m; p++)putchar(str[p]);                                break;                        }                        else putchar(str[p]);                }                putchar('/n');        }        return 0;}