Cod sursa(job #612830)
Utilizator | Data | 10 septembrie 2011 15:27:18 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | test_info20 | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long a,n,b,c,i,j;
ifstream fis1 ("fractii.in");
ofstream fis2 ("fractii.out");
if (fis1.is_open())
{
n=0;
fis1 >> n;
b=0;
for (i=2;i<=n;i++)
{
for (j=2;j<=n;j++)
if (!((i==j) || ((i%2==0) && (j%2==0)) || ((i%3==0) && (j%3==0)) || ((i%5==0) && (j%5==0)) || ((i%7==0) && (j%7==0)) || (i%j==0) || (j%i==0)))
b++;
}
c=n+n-1+b;
fis2<<c;
}
fis1.close();
fis2.close();
return 0;
}