Pagini recente » Cod sursa (job #2806965) | summer2020 | Cod sursa (job #2669690) | Cod sursa (job #1437502) | Cod sursa (job #1255666)
/*------------------------------------------------------------------
Problema rezolvata de Stefan Rapeanu-Andreescu in data de 05.11.2014
Facultatea de matematica si informatica, Universitatea din Bucuresti
Sectia Calculatoare si tehnologia informatiei - Grupa 152
------------------------------------------------------------------*/
#include <iostream>
#include <fstream>
using namespace std;
unsigned short cmmdc(unsigned short a, unsigned short b) {
if (a%b==0) return b;
else return cmmdc(b, a%b);
}
int main() {
unsigned short n;
unsigned short fractii=0;
fstream fin ("fractii.in", ios::in);
fstream fout ("fractii.out", ios::out);
fin >> n;
for (unsigned short p=1; p<=n; p++) {
for (unsigned short q=1; q<=n; q++) {
if (cmmdc(p, q)==1) fractii+=1;
}
}
fout << fractii;
fin.close();
fout.close();
return 0;
}