Cod sursa(job #1170959)
Utilizator | Data | 14 aprilie 2014 22:07:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <string>
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
while (a!=0&&b!=0)
if (a>b) a%=b;
else b%=a;
return (a+b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int T,a,b;
f>>T;
for(int i=1;i<=T;i++)
{
f>>a;
f>>b;
g<<euclid(a,b)<<"\n";
}
f.close();
g.close();
return 0;
}