Pagini recente » Cod sursa (job #536408) | Cod sursa (job #1216962) | Cod sursa (job #3318545) | Cod sursa (job #2350501) | Cod sursa (job #957794)
Cod sursa(job #957794)
#include <fstream>
using namespace std;
int main()
{
ifstream IN("fractii.in");
ofstream OUT("fractii.out");
int n, nr[1000001];
long long max = 0;
IN >> n;
//http://infoarena.ro/forum/index.php?topic=2512.0
for (int i = 2; i <= n; i++)
nr[i] = i - 1;
for (int i = 2; i <=n; i++)
{
max += nr[i];
for (int j = 2 * i; j <= n; j += i)
nr[j] -= nr[i];
}
max = max * 2 + 1;
OUT << max;
return 0;
}