Pagini recente » Cod sursa (job #3338424) | Cod sursa (job #3338385) | Borderou de evaluare (job #3322021) | Cod sursa (job #3322018) | Cod sursa (job #3338549)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n, i, j, s = 0, k;
int main()
{
f >> n;
#define lgt = n+1;
int a[lgt][lgt];
for (i = 2; i <= n; i++)
{
for (j = i; j <= n; j+=i)
{
for(k = i;k<= n; k+=i)
a[k][j] = 1;
}
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
s += a[i][j];
}
}
g << n*n-s;
return 0;
}