Cod sursa(job #2490276)
Utilizator | Data | 9 noiembrie 2019 23:42:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
int n,a,b;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int main()
{
f>>n;
for (int i=0; i<n;i++){
f>>a>>b;
while(a!=b){
if (a>b)a=a-b;
else b=b-a;
}
g<<a;
}
return 0;
}