Cod sursa(job #2383908)
Utilizator | Data | 19 martie 2019 21:17:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int a[100000], b[100000],n,i;int T;
fin>>T;
for(i=1;i<=T;i++){ fin>>a[i];
fin>>b[i];}
for(i=1;i<=T;i++)
{
while (b[i] != 0)
{
int t = b[i];
b[i] = a[i] % b[i];
a[i] = t;
}
fout<<a[i]<<" ";
}
}