Cod sursa(job #2033078)
Utilizator | Data | 6 octombrie 2017 09:00:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
void rezolvare()
{
int n,a,b;
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<<"cmmdc este :"<<a<<endl;
}
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
rezolvare();
return 0;
}