Cod sursa(job #24528)

Utilizator AdixSuciu Adrian Adix Data 2 martie 2007 19:47:48
Problema Fractii Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.55 kb
#include <stdio.h>
#include <math.h>
#include <string.h>
long long nmax,fract,nrprim;
long p[1000000],prim[80000],npr[80000];

void citire(){
		 FILE *in;
		 in=fopen("fractii.in","r");
		 fscanf(in,"%lld",&nmax);
		 fclose(in);
		 }


void scriere(){
     FILE *out;
     out=fopen("fractii.out","w");
		 fprintf(out,"%lld",(fract*2)+1);
     fclose(out);          
     }
     
int ciur(){
   int i, j, nr = 0;  
   for (i = 2; i <= nmax; ++i) {  
     if (p[i] == 0) {  
       nr++;  
			 for (j = i + i; j <= nmax; j += i) {
				 p[j] = 1;
			 }
		 }
	 }
	 return nr;
}
void vectprim(){
long i,j;
j=1;
i=2;
while(j<=nrprim){
                 if(!p[i]) {prim[j]=i;j++;}
				   		    i++;
						 }
		 }

long descfactprimi(long k){
long i,j;
int b=1;
i=1;
j=0;
   while(k!=1){
               if(k%prim[i]==0){
																if(b){j++;
																			npr[j]=prim[i];

                                       b=0;
                                       }
                                k=k/prim[i];}
                    else {i++;b=1;}
               }
               
		 return j;
}

double totient(long k){
long i,nrprimi;
double prod=1;
    nrprimi=descfactprimi(k);
		for(i=1;i<=nrprimi;i++)
		prod=prod*(1-(double)1/npr[i]);
    return prod*k;
    }

void procesare(){
     long long i;
		 nrprim=ciur();
		 vectprim();
		 for(i=1;i<=nmax;i++){
          fract=fract+totient(i);
                              }
         }
int main(){
		citire();
		procesare();
		scriere();

		 return 0;
		 }