Cod sursa(job #2980875)
Utilizator | Data | 16 februarie 2023 21:21:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int t[100001];
int main()
{
long long a, b, n;
fin >> n;
for(int i = 1; i<= n;i++)
{
fin >> a >> b;
while(b != 0)
{
long long r = a % b;
a = b;
b = r;
}
t[i] = a;
}
for(int i = 1; i<= n;i++)
fout << t[i] << '\n';
return 0;
}