Cod sursa(job #1777579)
| Utilizator | Data | 12 octombrie 2016 17:49:06 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int gcd(long long a,long long b)
{
if(!b) return a;
return gcd(b,a%b);
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
long long n;
long long a;
long long b;
ifstream myf;
myf.open("euclid2.in");
ofstream op;
op.open("euclid2.out");
myf >> n;
while (n)
{
myf >> a >> b;
int p = gcd(a,b);
op << p << "\n";
n--;
}
return 0;
}
