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