Pagini recente » Cod sursa (job #3177955) | Cod sursa (job #1343171) | Cod sursa (job #1446841) | Cod sursa (job #2722682) | Cod sursa (job #183495)
Cod sursa(job #183495)
#include<fstream.h>
#include<math.h>
unsigned long long c,i,j,p,sol=0,n,d,nr=0,nr1,nr2,aux;
int main()
{
ifstream f("pascal.in");
ofstream g("pascal.out");
f>>n>>d;
c=d; p=1;
while(c<=n)
{ aux=n/c; nr+=aux;
p++;
c=pow(d,p);
}
if(n%2==0)
{
for(j=0;j<=n/2-1;j++)
{
c=d; p=1; nr1=0; nr2=0;
while(c<=j)
{
aux=j/c; nr1+=aux;
p++;
c=pow(d,p);
}
c=d; p=1;
while(c<=(n-j))
{
aux=(n-j)/c; nr1+=aux;
p++;
c=pow(d,p);
}
if(nr-nr1-nr2>0) sol++;
}
sol*=2;
c=d; p=1; nr1=0; nr2=0;
while(c<=j)
{
aux=j/c; nr1+=aux;
p++;
c=pow(d,p);
}
c=d; p=1;
while(c<=(n-j))
{
aux=(n-j)/c; nr1+=aux;
p++;
c=pow(d,p);
}
if(nr-nr1-nr2>0) sol++;
g<<sol;
}
else
{for(j=0;j<=n/2;j++)
{
c=d; p=1; nr1=0; nr2=0;
while(c<=j)
{
aux=j/c; nr1+=aux;
p++;
c=pow(d,p);
}
c=d; p=1;
while(c<=(n-j))
{
aux=(n-j)/c; nr1+=aux;
p++;
c=pow(d,p);
}
if(nr-nr1-nr2>0) sol++;
}
sol*=2;
g<<sol;
}
f.close();
g.close();
return 0;
}