Pagini recente » Cod sursa (job #219456) | Cod sursa (job #1767469) | Cod sursa (job #2292492) | Istoria paginii utilizator/boutiquequorn | Cod sursa (job #1927138)
#include<fstream>
using namespace std;
bool maxim(int a, int b)
{
return a>b;
}
bool prime(int x, int y)
{
int r;
if(maxim(x,y)==1)
{
while(x%y!=0)
{
r=x%y;
x=y;
y=r;
}
return y;
}
else
{
while(y%x!=0)
{
r=y%x;
y=x;
x=r;
}
return x;
}
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,i,j,k,nr=0;
f>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(prime(i,j)==1)
nr++;
g<<nr;
return 0;
}