Cod sursa(job #1045717)
Utilizator | Data | 1 decembrie 2013 22:17:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmmdc.in");
ofstream fout("cmmdc.out");
int main()
{int t,i,a[10000],b[10000],r;
fin>>t;
for(i=0;i<t;i++)
fin>>a[i]>>b[i];
for(i=0;i<t;i++)
{while(b[i]){r=a[i]%b[i];a[i]=b[i];b[i]=r;} fout<<a[i]<<"\n";}
return 0;
}