Cod sursa(job #2437271)
Utilizator | Data | 9 iulie 2019 08:57:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid (int a,int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int n,i,a,b;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<euclid(a,b)<<'\n';
}
return 0;
}