Cod sursa(job #1851199)
Utilizator | Data | 19 ianuarie 2017 14:41:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
int a,b,c,x,t;
using namespace std;\
int GCD(int a, int b){
if(!b)
return a;
else
return GCD(b, a%b);
}
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
f >> t;
f >> a;
f >> b;
for(int i = 1; i<=t; i++)
{
cout << GCD(a,b);
g << a;
}
return 0;
}