Pagini recente » Cod sursa (job #1970200) | Cod sursa (job #2727953) | Borderou de evaluare (job #996898) | Cod sursa (job #2961080) | Cod sursa (job #2864240)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
int main()
{
fstream inp, outp;
inp.open("fractii.in", ios::in);
outp.open("fractii.out", ios::out);
long int n, total, pv;
inp >> n;
vector<vector<int>> vec(n+1, vector<int> (n+1, 0));
total=n*n-n+1;
for (int i=2; i<=n; i++)
{
for (int j=1; j<i; j++)
{
pv=2;
while (i*pv<=n && j*pv<=n && vec[i][j]==0)
{
vec[i*pv][j*pv]=1;
total-=2;
pv++;
}
}
}
outp << total;
inp.close();
outp.close();
}