Pagini recente » Cod sursa (job #1908960) | Istoria paginii runda/simulare_oji_bv_11-12 | Cod sursa (job #1904073) | Cod sursa (job #1628104) | Cod sursa (job #2377405)
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int cmmdc(int a, int b)
{
while(b)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n, i, j, nrf=0;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(cmmdc(i,j)==1)
nrf++;
g<<nrf;
}