Pagini recente » Cod sursa (job #748813) | Cod sursa (job #3004887) | Cod sursa (job #1556426) | Cod sursa (job #1254172) | Cod sursa (job #2302590)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int NMAX = 1000001;
int n;
int main()
{
fin >> n;
int nr = 0;
for (int i=1;i<=n;i++)
{
for (int j=i+1;j<=n;j++)
{
int k = 2;
int p = i * 2;
int q = j * 2;
while (p<=n && q<=n)
{
nr++;
k++;
p = i * k;
q = j * k;
}
}
}
fout << n*n-((n-1) + 2 * nr);
return 0;
}