Cod sursa(job #1293176)
Utilizator | Data | 15 decembrie 2014 15:31:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a,int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
int t,a,b;
f>>t;
for(int i=1;i<=t;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
return 0;
}