Pagini recente » Cod sursa (job #2422630) | Cod sursa (job #3140203) | Cod sursa (job #36038) | Cod sursa (job #2019053) | Cod sursa (job #378152)
Cod sursa(job #378152)
#include<stdio.h>
int n,i,j,fractii,v[20],count,k,p;
int main(){
int prim[100];
prim[0]=2;
prim[1]=3;
prim[2]=5;
prim[3]=7;
prim[4]=11;
prim[5]=13;
prim[6]=17;
prim[7]=19;
prim[8]=23;
prim[9]=29;
FILE *fin;
fin=fopen("fractii.in","rt");
fscanf(fin,"%d",&n);
fractii=n*n;
printf("%d",fractii);
for(i=2;i<=n;i++){
printf("\n%d:",i);
count=0;k=1;p=1;
for(j=0;j<10;j++)
v[j]=0;
for(j=0;j<10;j++)
if(i%prim[j]==0){
v[j]=1;
count++;
}
for(j=0;j<10;j++)
printf("%d ",v[j]);
for(j=0;j<10;j++)
if(v[j])
{
fractii=fractii-(n/prim[j]);
printf("\n%d",fractii);
}
/*if(count==2)
for(j=0;j<10;j++)
if(v[j])
p=p*prim[j];
fractii=fractii+i/p;*/
}
FILE *fout;
fout=fopen("fractii.out","wt");
fprintf(fout,"%d",fractii);
return 0;
}