Cod sursa(job #1025303)
| Utilizator | Data | 9 noiembrie 2013 19:38:57 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,i,a[100][10],r,aux,b,x;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i][1];
fin>>a[i][2];
}
for(i=1;i<=n;i++)
{
int r,aux;
x=a[i][1];
b=a[i][2];
r=x%b;
while(r)
{
aux=x;
x=b;
b=r;
r=x%b;
}
fout<<b<<endl;
}
fin.close();
fout.close();
return 0;
}
