Cod sursa(job #1206334)
Utilizator | Data | 9 iulie 2014 17:21:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
long euclid(long a,long b){
if(b==0)
return a;
long m=a%b;
while(m){
a=b;
b=m;
m=a%b;
}
return b;
}
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n;
long a,b;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>a>>b;
out<<euclid(a,b)<<endl;
}
return 0;
}