Cod sursa(job #1692385)
Utilizator | Data | 20 aprilie 2016 19:25:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc (int a, int b){
int rest;
while (b){
rest=a%b;
a=b;
b=rest;}
return a;}
int main() {
long long t,a,b,i;
f >> t;
for (i=1;i<=t;i++){
f>>a>>b;
g<<cmmdc(a,b)<<'\n';}
g.close();
return 0;
}