Cod sursa(job #873795)
Utilizator | Data | 7 februarie 2013 17:18:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a,int b)
{
int s;
while(b)
{
s=b;
b=a%b;
a=s;
}
return a;
}
int main()
{
int t,x,y;
f>>t;
for(int i=1; i<=t; ++i)
{
f>>x>>y;
g<<euclid(x,y)<<'\n';
}
g<<'\n';
return 0;
}