Pagini recente » Cod sursa (job #1894228) | Cod sursa (job #1898319) | Cod sursa (job #1579542) | Cod sursa (job #1439635) | Cod sursa (job #971066)
Cod sursa(job #971066)
#include <cstdio>
#include <vector>
#include <map>
#include <cmath>
int main(void)
{
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
int nV = 0, nS = 0, nC = 0;
scanf("%d", &nV);
std::vector<int> myV;
std::vector<bool> myB;
myB.resize(nV + 1, true);
for(int i(2); i <= sqrt(nV); i++)
if(myB[i])
for(int j(i * i); j <= nV; j += i)
myB[j] = false;
for(int i(2); i <= nV; i++)
if(myB[i])
{
nS++;
myV.push_back(i);
}
myB.erase(myB.begin(), myB.end());
myB.resize(nV + 1, true);
std::map<int, std::vector<int> > myM;
for(int i(0); i < nS; i++)
{
int j = myV[i];
while(j < nV + 1)
{
if(myB[j])
{
myM[myV[i]].push_back(j);
myB[j] = false;
}
j += myV[i] ;
}
}
nC = (nV - 1) * 2 + 1;
for(int i(0); i < nS; i++)
for(unsigned k(0); k < myM[myV[i]].size(); k++)
for(int j(i + 1); j < nS; j++)
if(myM[myV[i]][k] % myV[j] != 0) nC += myM[myV[j]].size() * 2;
printf("%d ", nC);
return 0;
}