Pagini recente » Inrudit | Istoria paginii utilizator/6miac1191hp9 | Cod sursa (job #3150596) | Diferente pentru problema/civilizatie intre reviziile 9 si 8 | Cod sursa (job #2347745)
#include<cstdio>
#define M 2000000
char p[M],e[11];
int i=-1,k,t,a,b,r,j;
int A()
{
int s=0;
for(i++;p[i]>='0'&&p[i]<='9';i++)
s=s*10+p[i]-'0';
return s;
}
int main()
{
freopen("euclid2.in","r",stdin),freopen("euclid2.out","w",stdout),fread(p,1,M,stdin),t=A();
while(t--)
{
for(a=A(),b=A();r=a%b;a=b,b=r);
for(j=0;b;b/=10,j++)
e[j]=b%10+'0';
for(j--;j>=0;j--)
p[k++]=e[j];
p[k++]='\n';
}
fwrite(p,1,k,stdout);
}