Cod sursa(job #2221717)
Utilizator | Data | 15 iulie 2018 16:01:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in;
in.open("euclid2.in");
ofstream out;
out.open("euclid2.out")
int k,i;
in >>k;
int n,m;
for(i = 0; i!= k ; i++){
in >> n>>m;
while (n != m){
if(n>m) n = n-m;
else m=m-n;
}
out <<n<<endl;
}
return 0;
}