九度 oj 题目1491：求1和2的个数

http://ac.jobdu.com/problem.php?pid=1491

参考了

1. http://www.cnblogs.com/jy02414216/archive/2011/03/09/1977724.html

2. http://www.myexception.cn/program/1846717.html （未使用）

3. http://www.xuebuyuan.com/1864757.html （代码来源）

#include <stdio.h>
#include <cstring>

static char s[110];  
int factor(int n){  
    int x = 1;
    while(n){ 
        x *= 10; 
        x = x % 20123;
        n--;
    }  
    return x;
}  

int atob(int a,int b){ 
    int x = 0; 
    for (int i = a; i <=b; ++i) { 
        x = x * 10 + s[i]; 
        x = x % 20123;
    } 
    return x; 
}  

int main(){ 
    while(scanf("%s",s)!=EOF ){ 
        int sum =0;
        int len =(int)  strlen(s);  
        for (int i = 0; i < len ; ++i) { 
            s[i] -= '0'; 
        } 
        for (int i = 0; i < len; ++i) { 
            int highnum = atob(0,i-1);
            int lowernum = atob(i+1,len-1);
            int fat = factor(len - i -1);  
            switch(s[i]){ 
                case 0 : 
                    sum += (2 * highnum * fat) % 20123;
                    break;  
                case 1 :
                    sum += (2 * highnum * fat + lowernum + 1) % 20123;
                    break;
                case 2:
                    sum += ((2 * highnum + 1) * fat + lowernum +1 ) % 20123; 
                    break;
                default:
                    sum += (2 * (highnum+1) * fat ) % 20123; 
            }  
            sum = sum % 20123;
        }
        printf("%d\n",sum); 
    }  
    return 0;
}