Cod sursa(job #2384536)
| Utilizator |  Codrut Copas Codrut112 |
Data | 20 martie 2019 20:44:29 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,a,b;
int main()
{ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(i=1;i<=n;i++){
f>>a>>b;
while(a!=b){
if(a>b) a=a-b;
if(b>a) b=b-a;
}g<<a<<endl;
}
}
