Cod sursa(job #1619920)
Utilizator | Data | 28 februarie 2016 19:48:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a,int b)
{ int r;
while(b) {r=a%b;
a=b;
b=r;}
return a;
}
int main()
{ int n ,a, b;
f>>n;
while(n)
{
f>>a>>b;
g<<cmmdc(a,b)<<"\n";
n--;
}
return 0;
}