Pagini recente » Cod sursa (job #1633787) | Cod sursa (job #1340218) | Cod sursa (job #835762) | Cod sursa (job #868683) | Cod sursa (job #7290)
Cod sursa(job #7290)
#include <stdio.h>
#define nmax 256
#define modulo 30103
int x[nmax];
int k,a,b;
int c[nmax][nmax];
char ch;
char c1[nmax][nmax][10];
int main() {
freopen("diviz.in","r",stdin);
freopen("diviz.out","w",stdout);
scanf("%d %d %d\n",&k,&a,&b);
scanf("%c",&ch);
while(ch>='0' && ch<='9') {
x[++x[0]]=(int)(ch-'0');
scanf("%c",&ch);
}
c[0][0]=1;
for(int i=1;i<=x[0];i++) {
int px=0;
if(x[i]==0) px++;
for(int j=b;j>=px;j--)
for(int l=k-1;l>=0;l--) {
c[j+1][(l*10+x[i])%k]+=c[j][l];
c[j+1][(l*10+x[i])%k]%=modulo;
}
}
int x=0;
for(int i=a;i<=b;i++) {
x+=c[i][0];
x%=modulo;
}
printf("%d\n",x);
return 0;
}