Cod sursa(job #989227)
Utilizator | Data | 25 august 2013 12:22:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
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)<<"\n";
while(f>>a>>b) g<<euclid(a,b)<<"\n";
return 0;
}