Cod sursa(job #1218659)
Utilizator | Data | 12 august 2014 10:40:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <cstdio>
int a, b;
int gcd(int a, int b) {
int c;
while (b != 0) {
b = a % (c = b);
a = c;
}
return a;
}
int main() {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a,b));
return 0;
}