Cod sursa(job #2225192)
| Utilizator | Data | 26 iulie 2018 12:40:30 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n;
//Input File
ifstream in;
in.open("euclid.in");
in >> n;
/////////////
int a;
int b;
int A[n];
int B[n];
int r = 0;
for(int i = 1; i<=n;++i){
in >> a >> b;
A[r] = a;
B[r] = b;
r += 1;
}
int cmmdc;
//Output File
ofstream out("euclid.out");
/////////////
for(int i = 0;i<n;++i){
cmmdc = A[i];
while(A[i] % cmmdc + B[i] % cmmdc != 0){
cmmdc -= 1;
}
out << cmmdc << endl;
}
}
