Pagini recente » Cod sursa (job #874977) | Cod sursa (job #2884619) | Cod sursa (job #686288) | Cod sursa (job #2775882) | Cod sursa (job #237938)
Cod sursa(job #237938)
#include <stdio.h>
FILE*in = fopen("pascal.in","r");
FILE*out= fopen("pascal.out","w");
long long cmmdc(long long a, long long b){
int r;
while(b!=0){
r=a%b;
a=b;
b=r;
}
return a;
}
int main(){
long long i,j,factj=1,x,c=0,n,e,rez,numitor;
long long numarator[7],k,l;
fscanf(in,"%lld%lld",&i,&x);
if((i+1)%2 == 0) n = (i+1)/2;
else n = (i+1)/2+1;
for(j=1;j<n;j++){
// formez fractia
// numitor
if(j!=0) factj *= j;
numitor = x * factj;
// numarator
for(k=1;k<=j;k++)
numarator[k] = i-j+k;
// operatiile de simplificare
for(l=1;l<=k;l++){
rez = cmmdc(numarator[l],numitor);
if(rez == numitor){ c++; break;}
else
if(rez == numarator[l]){
numarator[l] = 1;
numitor /= rez;
}else{
numitor /= rez;
numarator[l] /= rez;
}
}
}
if((i+1)%2 == 0) c = c * 2;
else c = c * 2 -1;
fprintf(out,"%lld",c);
return 0;
}