Cod sursa(job #2846931)
| Utilizator | Data | 9 februarie 2022 20:56:23 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
bool prim(int x)
{
for(int d = 2; d <= x/2; d++)
if(!(x%d))
return 0;
return 1;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int n, sum = 0;
in >> n;
for(int d = 2; d <= n/2; d++)
{
if(prim(d))
{
sum += (n/d)*((n/d)-1)/2;
// out << d << " " << (n/d)*((n/d)-1)/2 << endl;
}
}
out << n*(n-1)-(2*sum)+1;
}