Pagini recente » Cod sursa (job #108253) | Cod sursa (job #1059480) | Cod sursa (job #1781204) | Cod sursa (job #2853230) | Cod sursa (job #497223)
Cod sursa(job #497223)
#include<stdio.h>
#include<string.h>
int a[ 205 ][ 205 ],sol,i,j,k,l,A,B,n;
char x[ 205 ];
void citire(){
freopen("diviz.in","r",stdin);
scanf("%d %d %d",&A,&B,&k);
scanf("%s",x);
}
void solve(){
n = strlen(x);
int N,i,j,t,r;
for(t = 0 ; t < n ; t++){
N = (x[t] - '0')%k;
for(i = B-1;i>0;i--)
for(j = 0;j<k;j++)
if(a[i][j])
{r = (j*10 + N)%k;
if(!r && i>=A)
sol+= a[i][j];
a[i+1][r] += a[i][j];
}
a[1][N]++;
if(!N && (1>=A)&&(1<=B))
sol++;
}
}
void afisare(){
freopen("diviz.out","w",stdout);
printf("%d",sol);
}
int main(){
citire();
solve();
afisare();
return 0;}