Pagini recente » Cod sursa (job #895932) | Cod sursa (job #1833979) | Istoria paginii runda/oji_bv_2022 | Cod sursa (job #1152874) | Cod sursa (job #1159990)
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int n,p,q,nr,a;
void cmmdc()
{
int b,r;
a=p;b=q;
while(b)
{
r=a%b;
a=b;
b=r;
}
}
void fractii()
{
p=1;
nr=0;
while(p<=n)
{
q=1;
while(q<=n)
{
cmmdc();
if(a==1)
nr++;
q++;
}
p++;
}
out<<nr;
}
int main()
{
in>>n;
fractii();
in.close();
out.close();
return 0;
}