Cod sursa(job #2808609)
Utilizator | Data | 25 noiembrie 2021 12:42:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
#define n_max 100001
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, m;
void read()
{
int t;
int x, y;
f>>t;
for(int i = 1;i <= t;++i)
{
f>>x>>y;
int r;
while(y)
{
r = x % y;
x = y;
y = r;
}
g<<x<<'\n';
}
}
int main()
{
read();
return 0;
}