Cod sursa(job #821507)
Utilizator | bonta florin bonta.florin | Data | 22 noiembrie 2012 15:02:24 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int main()
{
long long T,i,a,b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>T;
if ((T>=1)&&(T<=2000000000))
for (i=1;i<=T;i++)
{f>>a>>b;
if ((a>=2)&&(a<=2000000000)&&(b>=2)&&(b<2000000000))
while (a!=b)
if (a<b) b=b-a;
else if (a>b) a=a-b;
g<<a<<endl;}
f.close();
g.close();
return 0;
}