Cod sursa(job #2150962)
Utilizator | Data | 3 martie 2018 22:10:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#define ll long long
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
ll cmmdc (ll x,ll y)
{
ll z;
while(y)
{
z=x%y;
x=y;
y=z;
}
return x;
}
ll n,i,a,b;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}