Cod sursa(job #1741698)
| Utilizator | Data | 14 august 2016 19:49:31 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int minimum(int a ,int b);
int main()
{
int n;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=0;i<n;i++){
int a,b;
f>>a>>b;
for(int j=minimum(a,b);j>=1;j--){
if(a%j==0 && b%j==0){
g<<j<<endl;
break;
}
}
}
return 0;
}
int minimum(int a,int b){
if(a<b){
return a;
}
else return b;
}
