Cod sursa(job #1045732)
Utilizator | Data | 1 decembrie 2013 22:25:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{int t,i,a[100000],b[100000],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;
}