Cod sursa(job #1029035)
Utilizator | Data | 14 noiembrie 2013 22:30:10 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<fstream>
using namespace std;
int main()
{
int n,a,i,j,k,x;
ifstream cin("adunare.in");
ofstream cout("adunare.out");
cin>>n;
k=n*2-1;
for(i=2;i<=n;i++)
{
for(j=2;j<=n;j++)
{
if(i%j==0 || j%i==0 )
x=k;
else
k++;
}
}
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
for(a=2;a<=n;a++)
if(i%a==0 && j%a==0 && i%j!=0 && j%i!=0)
k--;
cout<<k;
return 0;
}