Cod sursa(job #1893036)
| Utilizator | Data | 25 februarie 2017 14:13:29 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
int a[100005],b[100005],c[100005];
unsigned GCD(unsigned u, unsigned v) {
while ( v != 0) {
unsigned r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
ifstream fin("euclid2.in");
int n;
fin>>n;
for (int i=1;i<=n;i++)
{
fin>>a[i]>>b[i];
}
fin.close();
ofstream fout("euclid2.out");
for (int i=1;i<=n;i++)
fout<<GCD(a[i],b[i])<<'\n';
fout.close();
return 0;
}
