Cod sursa(job #526127)
Utilizator | Data | 27 ianuarie 2011 15:07:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long x[100010],T,i,a,b,r,cmmdc;
int main()
{
f>>T;
for(i=1;i<=T;i++)
{
f>>a;
f>>b;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
cmmdc=a;
x[i]=cmmdc;
x[i]=x[i+1];
g<<x[i]<<'\n';
}
return 0;
}