Cod sursa(job #2639556)
Utilizator | Data | 2 august 2020 18:40:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <cstring>
#include <bitset>
#include <vector>
#include <deque>
#include <algorithm>
using namespace std;
ifstream cin("euclid2.in") ;
ofstream cout("euclid2.out") ;
int main()
{
int n ;
cin >> n ;
for(int f = 1 ; f <= n ; f ++)
{
int a, b ;
cin >> a >> b ;
cout << __gcd(a, b) << '\n' ;
}
return 0 ;
}