Cod sursa(job #881065)
Utilizator | Data | 17 februarie 2013 17:57:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
using namespace std;
#include<fstream>
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int x[100000][2], n, t, i, j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=2;j++)
fin>>x[i][j];
for(i=1;i<=n;i++)
{while(x[i][2])
{ t=x[i][2];
x[i][2]=x[i][1]%x[i][2];
x[i][1]=t;
}
fout<<x[i][1]<<"\n";
}
}