Cod sursa(job #610668)
| Utilizator | Data | 28 august 2011 17:01:33 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream.h>
#include<iostream.h>
main()
{long int T,a[100000],b[100000],i,c;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>T;
for(i=1;i<=T;i++)
{f>>a[i]>>b[i];
do
{if(a[i]>b[i])
{c=a[i];
a[i]=b[i];
b[i]=c%b[i];}
else
{c=b[i];
b[i]=a[i];
a[i]=c%a[i];}}while(a[i]!=0&&b[i]!=0);
if(a[i]==0)
g<<b[i]<<endl;
else
g<<a[i]<<endl;}
}