Cod sursa(job #1402576)

Utilizator avaspAva Spataru avasp Data 26 martie 2015 17:38:19
Problema Diviz Scor 60
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.63 kb
#include<cstdio>
#include<cstring>
using namespace std;
int k,am,b,rez;
char s[202];
int a[201][103],d[201][103],n,first[201][203];
int main(){
    freopen("diviz.in","r",stdin);
    freopen("diviz.out","w",stdout);
    scanf("%d%d%d\n",&k,&am,&b);
    gets(s);
    n=strlen(s)-1;
    for(int i=0;i<=n;i++)
        memset(first[i],-1,n);
    for(int i=0;i<=9;i++)
        first[i][n+1]=(n + 1);

    for(int i=n;i>=0 ;i--) {
        for(int c=0;c<=9;c++) {
            first[c][i]=first[c][i+1];
        }
        first[s[i]-'0'][i]=i;
    }
    for(int cif=1;cif<=9;cif++)
        if(first[cif][0]!=-1)
            d[first[cif][0]][cif%k]=1;

    for(int c=2;c<=b+1;c++){
         if(c-1>=am)
        for(int i=0;i<=n;i++){
            rez=(rez+d[i][0])%30103;
            for(int cif=0;cif<=9;cif++)
                if(first[cif][i+1]!=-1){
                    for(int r=0;r<=k-1;r++){
                            int var=(r*10+cif)%k;
                            a[first[cif][i+1]][var]+=d[i][r];
                            a[first[cif][i+1]][var]%=30103;
                    }
                }
        }
        else
            for(int i=0;i<=n;i++){
            for(int cif=0;cif<=9;cif++)
                if(first[cif][i+1]!=-1){
                    for(int r=0;r<=k-1;r++){
                            int var=(r*10+cif)%k;
                            a[first[cif][i+1]][var]+=d[i][r];
                            a[first[cif][i+1]][var]%=30103;
                    }
                }
        }
        memcpy(d,a,sizeof(d));
        memset(a,0,sizeof(a));
    }
    printf("%d",rez);
    return 0;
}