Cod sursa(job #1053594)
| Utilizator | Data | 12 decembrie 2013 20:42:01 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
inline int euclid(int a,int b)
{
if (b == 0)return a;
else return euclid(b, a%b);
}
int main()
{
int n, a, b;
ifstream citire;
ofstream scriere;
citire.open("euclid2.in");
scriere.open("euclid2.out");
citire >> n;
for (int i = 0; i < n; i++)
{
citire >> a >> b;
scriere << euclid(a, b)<<"\n";
}
citire.close();
scriere.close();
return 0;
}