Cod sursa(job #2168707)
Utilizator | Data | 14 martie 2018 12:00:52 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a, int b)
{
int i;
if(a<b) swap (a,b);
for(i=b;i>=1;i--)
{
if(a%i==0&&b%i==0) return i;
}
}
int k,a,b;
int main()
{
f>>k;
while(k!=0)
{
f>>a>>b;
g<<euclid(a,b)<<endl;
k--;
}
return 0;
}