Cod sursa(job #1592951)
| Utilizator | Data | 8 februarie 2016 10:39:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstdarg>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
struct joj {int a;int b;};
int euclid(int a,int b)
{
if(b==0) return a;
else return euclid(b,a%b);
}
int main()
{
int load;
int a;
int b;
in>>load;
for(register int i=1;i<=load;i++)
{
in>>a;
in>>b;
out<<euclid(a,b);
out<<endl;
}
}
