Pagini recente » Cod sursa (job #955496) | Cod sursa (job #1238955) | Cod sursa (job #231316) | Cod sursa (job #2724986) | Cod sursa (job #1830039)
#include<fstream>
//#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
bool prim(int n)
{
int c=0;
for(int i=1;i*i<=n;i++)
{
if(n%i==0){c++;}
if(c>1){return false;}
}
return true;
}
int fractii(int n)
{
vector<int> v;
int p,j,i,w1,s=0,w=0;
for( i=2;i<=n;i++)
{
for( j=2;j<=i;j++)
{
if(prim(j)==1 && i%j==0)
{
w+=n/j;
v.push_back(j);
}
}
for(int j2=0;j2<v.size()-1;j2++)
{
for(int j3=j2+1;j3<v.size();j3++)
{
s+=(n/(v[j2]*v[j3]));
}
}
v.erase(v.begin(),v.end());
}
w1=n*n-w+s;
return w1;
}
main()
{
int n;
fin>>n;
fout<<fractii(n);
}