Cod sursa(job #1916431)
Utilizator | Data | 9 martie 2017 09:28:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int i, x,y,n;
void divizor(int a, int b){
while(a!=b){
if(a>b)
a=a-b;
if(b>a)
b=b-a;
}
fout<<a<<'\n';
}
int main()
{
fin>>n;
for( i=1;i<=n;i++)
{
fin>>x>>y;
divizor(x,y);
}
return 0;
}