剑指OFFER之打印1到最大的N位数（九度OJ1515）

1 

1
2
3
4
5
6
7
8
9

#include <stdio.h>
int main(void){
    int n,i;
    while(scanf("%d",&n)!=EOF && n>=1 && n<=5){
        i = n;
        int m = 1;
        while(i--){
            m *= 10;
        }
        for(i=1;i<m;i++)
            printf("%d\n",i);
    }
    return 0;
}
/**************************************************************
    Problem: 1515
    User: xhalo
    Language: C
    Result: Accepted
    Time:40 ms
    Memory:912 kb
****************************************************************/

#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
int num[10];
int add(int n);
int main(void){
    int n,i;
    while(scanf("%d",&n)!=EOF && n>=1 && n<=5){
        memset(&num,0,sizeof(int)*10);
        while(!add(n)){
            int flag = 0;
            for(i=10-n;i<10;i++)
                if(num[i] != 0 || flag){ //如果是前面的零，则不输出；如果是后面的零，则输出
                    flag = 1;
                    printf("%d",num[i]);
                }
            printf("\n");
        }
    }
    return 0;
}
int add(int n){
    int isoverflow = 0;
    int carry = 0;
    int i;
    for(i=9;i>=10-n;i--){
        num[i] += carry;
        if(i == 9)
            num[i]++;
 
        if(num[i] >= 10){
            if(i == 10-n){
                isoverflow = 1;
            }else{
                num[i] -= 10;
                carry = 1;
            }
        }else{
            break;
        }
    }
    return isoverflow;
}
/**************************************************************
    Problem: 1515
    User: xhalo
    Language: C
    Result: Accepted
    Time:110 ms
    Memory:912 kb
****************************************************************/