Pagini recente » Cod sursa (job #2281854) | Cod sursa (job #1426825) | Cod sursa (job #1943947) | Cod sursa (job #1600562) | Cod sursa (job #3042144)
| Utilizator |
SS KMF SSKMF |
Data |
4 aprilie 2023 09:48:46 |
| Problema |
Fractii |
Scor |
100 |
| Compilator |
cpp-64 |
Status |
done |
| Runda |
tot_ |
Marime |
0.71 kb |
#include <fstream>
using namespace std;
ifstream cin ("fractii.in");
ofstream cout ("fractii.out");
int prime[1000001];
int main ()
{
int limita;
cin >> limita;
for (int indice = 2 ; indice <= limita ; indice++)
prime[indice] = indice;
for (int indice = 2 ; indice <= limita ; indice++)
if (prime[indice] == indice)
for (int factor = 1 ; indice * factor <= limita ; factor++)
prime[indice * factor] = prime[indice * factor] / indice * (indice - 1);
long long fractii = 1;
for (int indice = 2 ; indice <= limita ; indice++)
fractii += 2 * prime[indice];
cout << fractii;
cout.close(); cin.close();
return 0;
}