Cod sursa(job #1317260)
Utilizator | Data | 14 ianuarie 2015 19:18:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
int euclid(int a,int b)
{ if(!b)return a;
else return euclid(b,a%b);
}
int main()
{ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;f>>n;
for(int i=1;i<=n;++i)
{f>>a>>b;
g<<euclid(a,b)<<'\n';}
}