Cod sursa(job #2192927)
Utilizator | Data | 7 aprilie 2018 18:33:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include fstream
using namespace std;
ifstream f(euclid2.in);
ofstream g(euclid2.out);
int main()
{
int a;
int x, y;
fa;
for(int i=1; i=a; i++)
{
fxy;
while(x!=y)
{
if(xy) x=x-y;
else y=y-x;
}
gxendl;
}
return 0;
}