Cod sursa(job #1082948)
| Utilizator |  FMI Cornoiu Vlad vladutz15 |
Data | 15 ianuarie 2014 12:51:33 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b,a%b);
}
int main ()
{
f>>n;
for (;n;n--)
{
f>>a>>b;
g<<gcd(a,b)<<"\n";
}
}