Pagini recente » Cod sursa (job #1574374) | Cod sursa (job #1589742) | Cod sursa (job #460521) | Cod sursa (job #278497) | Cod sursa (job #675108)
Cod sursa(job #675108)
#include <fstream>
using namespace std;
int prim (int a, int b)
{
while (a!=b)
{
if (a>b)
a=a-b;
else
if (a<b)
b=b-a;
}
return a;
}
int main (void)
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int i,j,n,count=0;
in>>n;
in.close();
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (prim(i,j)==1)
count++;
out<<count;
out.close();
return 0;
}