Cod sursa(job #1916442)
Utilizator | Data | 9 martie 2017 09:31:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 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){
int c;
while(b){
c=a%b;
a=b;
b=c;
}
fout<<a<<'\n';
}
int main()
{
fin>>n;
for( i=1;i<=n;i++)
{
fin>>x>>y;
divizor(x,y);
}
return 0;
}