Cod sursa(job #989226)
| Utilizator | Data | 25 august 2013 12:19:12 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
long int a, b;
int euclid(int a, int b)
{
while(b!=0)
{
int c=b;
b=a%b;
a=c;
}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>a>>a>>b;
g<<euclid(a, b)<<endl;
while(f>>a>>b) g<<euclid(a,b)<<endl;
g.close();
f.close();
}
