Cod sursa(job #1805684)
Utilizator | Data | 14 noiembrie 2016 00:46:31 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.3 kb |
#include<fstream>
using namespace std;
int main()
{ long long n, k;
int i, j;
ifstream f1("fractii.in");
ofstream f2("fractii.out");
f1>>n;
f1.close();
k=2*n-1;
if(n>2)
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)if( i%j!=0 && j%i!=0 )k++;
f2<<k;
f2.close();
return 0;
}