Cod sursa(job #2241135)
Utilizator | Data | 14 septembrie 2018 22:05:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fcin("euclid2.in");
ofstream fcout("euclid2.out");
int n, r=1;
fcin>>n;
int a[n][2];
for (int i=1; i<=n; i++)
for(int j=1; j<=2; j++)
fcin>>a[i][j];
for(int i=1; i<=n; i++)
{
while(a[i][2]) {
r = a[i][1] % a[i][2];
a[i][1]=a[i][2];
a[i][2]=r;
}
fcout<<a[i][1]<<endl;
}
return 0;
}