Cod sursa(job #2973077)
| Utilizator | Data | 30 ianuarie 2023 22:02:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream fin;
fin.open("euclid2.in");
ofstream outdata;
outdata.open("euclid2.out");
//----------------
int t ;
fin >> t;
for(int i = 0; i < t; i++)
{
long long a, b, c,d, rest;
fin >> a >> b;
c= min(a,b);
d= max(a,b);
rest = d%c;
while(rest !=0)
{
long var = 0;
var = c % rest;
c = rest;
rest = var;
}
outdata << c << endl;
}
}
