Pagini recente » Borderou de evaluare (job #2912982) | Cod sursa (job #2653682) | Cod sursa (job #1833603) | Cod sursa (job #2411078) | Cod sursa (job #451078)
Cod sursa(job #451078)
#include <stdio.h>
int main()
{
int n,d,i,j,k,nd,m,c;
freopen("pascal.in","r",stdin);
freopen("pascal.out","w",stdout);
scanf("%d%d",&n,&d);
nd=0;
k=n;m=n/2;c=0;
for (i=0;i<m;i++)
{
int ax=k;
while (!(ax%d))
{
ax/=d;
nd++;
}
ax=n-k+1;
while (!(ax%d))
{
ax/=d;
nd--;
}
if (nd)
c++;
k--;
}
if ( !(n%2) )
{
c= (nd) ?(c-1)*2 +1 : c*2;
}
else
{
c*=2;
}
printf("%d\n",c);
return 0;
}