Cod sursa(job #2483677)
| Utilizator | Data | 30 octombrie 2019 08:48:43 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n;
int main()
{
int a,b;
in >> n ;
for(int i=1; i<=n; i++)
{
in >> a >> b ;
out << __gcd(a,b) << "\n" ;
}
return 0;
}
