Cod sursa(job #2142250)
| Utilizator | Data | 24 februarie 2018 21:18:24 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
typedef unsigned int uint;
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
uint n,a,b;
uint gcd ( uint a, uint b )
{
uint r;
while (b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
ios::sync_with_stdio (false);
fin >> n;
for ( uint i = 0; i < n; ++i )
{
fin >> a >> b;
fout << gcd(a,b) << '\n';
}
return 0;
}
