Cod sursa(job #1756659)
Utilizator | Data | 13 septembrie 2016 12:52:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a,int b){
if (b==0) return a;
else return gcd(b,a%b);
}
int main()
{
int a,b,n;
f>>n;
while(n){
f>>a>>b;
g<< gcd(a,b);
n--;
}
return 0;
}