Pagini recente » Cod sursa (job #1866936) | Cod sursa (job #1290951) | Cod sursa (job #1033046) | Cod sursa (job #2106850) | Cod sursa (job #1760437)
#include <fstream>
using namespace std;
bool prim(int a, int b)
{
int r = a%b;
while (b!=0)
{ r=a%b;
a=b;
b=r;
}
if(a==1)
return true;
else
return false;
}
int main()
{
int n,x=0;
ifstream f_in("fractii.in");
ofstream f_out("fractii.out");
f_in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(prim(i,j))
x++;
f_out<<x;
f_in.close();
f_out.close();
return 0;
}