Cod sursa(job #1347332)
| Utilizator | Data | 18 februarie 2015 21:50:10 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long n,a,b;
long long gcd(long long a, long long b){
if(b == 0) return a;
else return gcd(b, a%b);
}
int main()
{
long long i;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &n)
for(i=1; i<=n; i++){
scanf("%d %d", &a, &b);
printf("%d %d", a, b);
}
return 0;
}
