Cod sursa(job #577602)
Utilizator | Data | 10 aprilie 2011 14:02:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int main()
{int t,i;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>t;
int c[t];
for(i=1;i<=(t+t);i++)
fin>>c[i];
for(i=1;i<=(t+t);i=i+2)
{while(c[i]!=c[i+1])
if(c[i]>c[i+1])
c[i]-=c[i+1];
else
c[i+1]-=c[i];
if(c[i]==1)
fout<<0<<'\n';
else
fout<<c[i]<<'\n';
}
return 0;
}