Cod sursa(job #1884420)
Utilizator | Data | 18 februarie 2017 18:58:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int s;
int main()
{
ifstream input;
ofstream output;
input.open("euclid2.in");
input>>s;
int a[s+1][3];
for (int i=1;i<=s;i++){
input>>a[i][1]>>a[i][2];
}
input.close();
output.open("euclid2.out");
for (int i=1;i<=s;i++){
cout<<__gcd(a[i][1],a[i][2])<<"\n";
}
output.close();
return 0;
}