Pagini recente » Cod sursa (job #2429359) | Cod sursa (job #1281358) | Cod sursa (job #669904) | Cod sursa (job #908357) | Cod sursa (job #228151)
Cod sursa(job #228151)
#include<fstream.h>
int i,j,q,k,l,m,n,nr,a[1000000];
ifstream f("fractii.in");
ofstream g("fractii.out");
int fractii(int i){
int m=0;
for(int i1=1;i1<=q;i1++)
{if(i%a[i1]==0)
{
if(m)
m-=n/i;
m+=n/a[i1];
}
}
if(m)
return n-m;
a[q+1]=i;
q++;
return n-n/i;}
int main(){
f>>n;
nr=n;
for(i=2;i<=n;i++)
nr+=fractii(i);
g<<nr;
f.close();
g.close();
return 0;}