Cod sursa(job #1232054)
Utilizator | Data | 21 septembrie 2014 22:30:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int i,t,a,b,aux;
int euclid (int a1, int b1)
{
while (b1)
{
aux=b1;
b1=a1%b1;
a1=aux;
// cout<<a1<<" "<<b1<<" ";
}
// cout<<"\n";
return a1;
}
int main()
{
f>>t;
for (i=1;i<=t;i++)
{
f>>a>>b;
g<<euclid(a, b)<<"\n";
}
return 0;
}