Cod sursa(job #1642666)
| Utilizator | Data | 9 martie 2016 15:27:22 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long cmmdc(long long a, long long b) {
while (b != 0) {
int r = a % b;
a = b;
b = r;
}
return a;
}
void read() {
int n;
f>>n;
for (int i=1;i<=n;i++) {
long long a, b;
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
}
int main() {
read();
f.close(); g.close();
return 0;
}
