Cod sursa(job #2733186)
| Utilizator | Data | 30 martie 2021 08:40:24 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int T, n, m;
fin>>T;
for(int i=0; i<T; i++)
{
fin>>m>>n;
while(m != 0)
{
int r = n % m;
n = m;
m = r;
}
fout<<n<<'\n';
}
fin.close();
fout.close();
return 0;
}
