Cod sursa(job #617596)
| Utilizator |  Brehoi Cosmin cos_lp |
Data | 15 octombrie 2011 09:03:06 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int gcd(int a, int b) {
int c;
while(b != 0) {
c=a%b;
a=b;
b=c;
}
return a;
}
int main () {
int T, a, b;
fin >> T;
for(int i = 1; i <= T; i++) {
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
return 0;
}
