Cod sursa(job #2079734)
Utilizator | Data | 1 decembrie 2017 19:13:29 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
long n;
long r;
f>>n;
r=pow(n,2)+1;
for(int i=1;i<=n;i++)
for(int j=2;j<=n;j++)
if((i/j)>=1)
r--;
g<<r;
f.close();
g.close();
return 0;
}