Cod sursa(job #1366712)
Utilizator | Data | 1 martie 2015 13:14:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
int cmmdc(int x,int y)
{
if(y==0)
return x;
return cmmdc(y,x%y);
}
int main()
{
int x,y,i;
f>>n;
for(i=1;i<=n;i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<"\n";
}
return 0;
}