Cod sursa(job #1920705)
Utilizator | Data | 10 martie 2017 09:26:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream t ("euclid2.out");
int euclid(int a,int b){
int aux;
while (b){
aux=b;
b=a%b;
a=aux;
}
return a;
}
int main()
{
int q;
f>>q;
for (int a,b;q;--q)
f>>a>>b,
t<<euclid(a,b)<<'\n';
return 0;
}