Pagini recente » Cod sursa (job #1006509) | Atasamentele paginii Clasament 1212121 | Istoria paginii runda/123455 | Cod sursa (job #2797567) | Cod sursa (job #1029032)
#include<fstream>
using namespace std;
int main()
{
int n,a,i,j,k=0;
ifstream cin("fractii.in");
ofstream cout("fractii.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 )
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;
}