Cod sursa(job #1825103)
Utilizator | Data | 8 decembrie 2016 18:53:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <cstring>
#define MaxT 100000
using namespace std;
int cmmdc(int a,int b)
{
if(b==0)
return a;
else
return cmmdc(b,a%b);
}
int main()
{
ifstream f("euclid.in");
ofstream g("euclid.out");
int n , t[MaxT];
f>>n;
for(int i=1;i<=n;i++)
{
int x,y;
f>>x>>y;
g<<cmmdc(x,y)<<endl;
}
return 0;
}