Cod sursa(job #1220781)
Utilizator | Data | 18 august 2014 16:03:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n,a,b;
int euclid(int a,int b)
{
while(a!=b)
if(a>b)
a=a-b;
else
b=b-a;
return a;
}
int main()
{
fin>>n;
int i;
for(i=1;i<=n;i++){
fin>>a>>b;
fout<<euclid(a,b)<<'\n';}
fin.close();fout.close();
return 0;
}