Cod sursa(job #1819776)
Utilizator | Data | 30 noiembrie 2016 20:13:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int euclid(int a,int b)
{
while(b!=0)
{
int aux=b;
b=a%b;
a=aux;
}
return a;
}
int main()
{
int n;
long int x,y;
in>>n;
for(int i=1;i<=n;i++)
{
in>>x>>y;
out<<euclid(x,y)<<'\n';
}
}