Pagini recente » Cod sursa (job #2546994) | Cod sursa (job #447287) | Cod sursa (job #2165447) | Cod sursa (job #1407889) | Cod sursa (job #1338578)
#include<stdio.h>
using namespace std;
int div(int n,int a){
int k=a,put=0;
while(k<=n){
put=put+n/k;
k*=a;
}
return put;
}
int main(){
freopen("pascal.in","r",stdin);
freopen("pascal.out","w",stdout);
int l,m,put2,put3,put5,put02,put03,put05,k,c,put0,nr=0;
scanf("%d%d",&l,&m);
put2=div(l,2);
put3=div(l,3);
put5=div(l,5);
for(c=0;c<=l;c++){
put02=put2-div(c,2)-div(l-c,2);
put03=put3-div(c,3)-div(l-c,3);
put05=put5-div(c,5)-div(l-c,5);
if(m==2&&put02>0)
nr++;
if(m==3&&put03>0)
nr++;
if(m==5&&put05>0)
nr++;
if(m==4&&put02>1)
nr++;
if(m==6&&put02>0&&put03>0)
nr++;
}
printf("%d",nr);
return 0;
}