Cod sursa(job #143357)
Utilizator | Data | 26 februarie 2008 13:17:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, m, i;
int main()
{
f>>n>>m;
f.close();
while(m!=0){
i=n%m;
n=m;
m=i;
}
g<<n;
g.close();
return 0;
}