Cod sursa(job #753902)
Utilizator | Data | 30 mai 2012 19:02:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int euclid (int a,int b)
{int r= a % b;
while (r)
{a=b;
b=r;
r=a%b;}
return b;
}
int main(){
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int a,b,n;
in>>n;
for (int i=1;i<=n;i++)
{
in>>a>>b;
out<<euclid(a,b)<<endl;
}
in.close();out.close();
return 0;
}