Pagini recente » Rating De ce sa ma inregistrez (foroji2019) | Cod sursa (job #433886) | Monitorul de evaluare | Cod sursa (job #1868227) | Cod sursa (job #213267)
Cod sursa(job #213267)
#include <fstream>
using namespace std;
long div (long x) {
long n=0;
for (long i=2 ; i<x ; i++)
if (x%i==0 || (x%2==0 && i%2==0)) n++;
return n;
}
void fractii() {
ifstream f("fractii.in");
ofstream g("fractii.out");
long nr=0,n;
f>>n;
f.close();
for (long i=1 ; i<=n ; i++) nr=nr+(i-div(i)-1);
g<<nr*2-1;
g.close();
}
int main() {
fractii();
return 0;
}