Pagini recente » Cod sursa (job #1507855) | Cod sursa (job #798323) | Atasamentele paginii sumqueries | Cod sursa (job #977565) | Cod sursa (job #3344580)
#include <fstream>
std::ifstream f("fractii.in");
std::ofstream g("fractii.out");
int main(){
int N, c = 0;
f >> N;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++)
if(j == 1 && i == 1)
c++;
else if(i > j){
int k = 2, ok = 1;
while(k <= i && ok){
if(i % k == 0 && j % k == 0)
ok = 0;
k++;
}
if(ok)
c++;
}
else if(j > i){
int k = 2, ok = 1;
while(k <= j && ok){
if(i % k == 0 && j % k == 0)
ok = 0;
k++;
}
if(ok)
c++;
}
}
g << c;
return 0;
}