Pagini recente » Cod sursa (job #2453023) | Cod sursa (job #2505075) | Cod sursa (job #220350) | Cod sursa (job #2705315) | Cod sursa (job #505448)
Cod sursa(job #505448)
#include<stdio.h>
#include<math.h>
int prim[ ]={2,3,5};
int nr[ 3] ;
void func( int x,int k )
{
for(int i=0;i<=2;++i)
{
while( x % prim[i ] == 0)
{
nr[ i ] += k;
x/= prim[i];
}
}
}
int D;
long long R,n;
int main()
{
long long i;
freopen("pascal.in","r",stdin);
freopen("pascal.out","w",stdout);
scanf("%lld%d",&R,&D);
for(i=1;i<=R;i++)
{
func( R - i + 1 , 1);
func( i , -1 );
if(D==6)
if(nr[1]>=1 && nr[0]>=1)
n++;
if(D==5)
if(nr[2]>=1)
n++;
if(D==4)
if(nr[0]>=2)
n++;
if(D==3)
if(nr[1]>=1)
n++;
if(D==2)
if(nr[0]>=1)
n++;
}
printf("%lld\n",n);
return 0;
}