Pagini recente » Cod sursa (job #2987974) | Cod sursa (job #409820) | Cod sursa (job #1653135) | Cod sursa (job #1418840) | Cod sursa (job #30646)
Cod sursa(job #30646)
#include<stdio.h>
#include<math.h>
long r,d,nr,i,c[6],n1,n2=1;
/*void nc()
{while(n1%2==0) {c[2]++;n1=n1/2;}
while(n1%3==0) {c[2]++;n1=n1/3;}
while(n1%5==0) {c[5]++;n1=n1/5;}
while(n2%2==0) {c[2]--;n2=n2/2;}
while(n2%3==0) {c[2]--;n2=n2/3;}
while(n2%5==0) {c[5]--;n2=n2/5;}}
int div()
{if(d==6) return c[2]&&c[3];
if(d==4) return c[2]>1;
return c[d];}*/
int main()
{freopen("pascal.in","r",stdin);
freopen("pascal.out","w",stdout);
scanf("%ld %ld",&r,&d);
n1=r;
for(i=1;i<=r/2;i++,r--)
{/*n1=r-i+1;
n2=i;nc();
if(div()) nr=nr+2;*/
n2=n2*r/i;
if(n2%d) nr++;}
if(r%2==0)nr--;
printf("%ld",nr);
fclose(stdout);
return 0;}