Cod sursa(job #1680358)
| Utilizator | Data | 8 aprilie 2016 17:56:51 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("euclid2.in");
ofstream fout("euclid2.out");
int gbf(int a, int b)
{
if(!b) return a;
else return gbf(b,a%b);
}
int main()
{
int T, a[100],i,ok=0,j;
f>>T;
for(i=1; i<=T*2; i++)
{
f>>a[i];
}
for(i=1; i<=T*2; i=i+2)
{
fout<<gbf(a[i],a[i+1])<<" ";
}
}
