Pagini recente » Istoria paginii runda/ojiji-becali/clasament | Cod sursa (job #2479926) | Istoria paginii runda/ofjaso20165/clasament | Istoria paginii runda/wellcodesimulareclasa11-12-11martie/clasament | Cod sursa (job #2470104)
#include <iostream>
#include <fstream>
using namespace std;
int a;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
void read(){
fin >> a;
}
int cmmdc(int b, int c){
while(b != c){
if (b > c) b = b-c;
else c = c-b;
}
return b;
}
int fractii(int a){
int num = 0;
for (int i = 1; i <= a; i++){
for (int j = 1; j <= a; j++){
if ( cmmdc(i,j) == 1) num++;
}
}
return num;
}
int main(){
read();
if (a >= 1 && a <= 1000000) fout << fractii(a);
return 0;
}