Cod sursa(job #400836)
Utilizator | StaNy . StaNy | Data | 22 februarie 2010 01:44:06 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream ("euclid2.in");
ofstream ("euclid2.out");
int main()
{ int n, x[1000],y[1000];
f>>n;
for (i=1;i<=n;i++)
f>>x[i];
f>>y[i];
euclid(x[i],y[i]);
g<<b;
}
int euclid (int a, int b)
{
while (a!=b)
{ r=a%b;
a=b;
b=r;
}
return b;
}