Cod sursa(job #1597001)
Utilizator | Data | 11 februarie 2016 16:27:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t,i,a,b,c;
int div(int a,int b){
if(b==0)return a;
else return div(b,a%b);
}
int main()
{int t,i,c;
fin>>t;
for(i=1;i<=t;i++){fin>>a>>b;
fout<<div(a,b)<<endl;
}
return 0;
}