Cod sursa(job #813376)
| Utilizator |  Tannous Marc tannous.marc |
Data | 15 noiembrie 2012 12:29:49 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
using namespace std;
ifstream fin("cmmdc.in");
ofstream fout("cmmdc.out");
int main()
{
int a,b,r,c,t;
fin>>t;
for(int i=1;i<=t;i++){
fin>>a>>b;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
c=a;
if(c==1)c=0;
fout<<c<<endl;
}
return 0;
}