Cod sursa(job #1415377)
Utilizator | Data | 4 aprilie 2015 14:45:52 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int T,i,a[100],b[100],r;
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&T);
for(i=1;i<=T;i++)
scanf("%d %d",&a[i],&b[i]);
for(i=1;i<=T;i++)
{
while(a[i]%b[i]!=0)
{
r=a[i]%b[i];
a[i]=b[i];
b[i]=r;
}
printf("%d\n",b[i]);
}
return 0;
}