Cod sursa(job #418619)
| Utilizator |  Codreanu Ionut cody |
Data | 16 martie 2010 09:48:35 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
long int euclid(long int a,long int b)
{
long int rest;
while(a!=0)
{
rest=b%a;
b=a;
a=rest;
}
return b;
}
int main(){
long int a,b,n,i;
ofstream g("euclid2.out");
ifstream f("euclid2.in");
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<euclid(a,b)<<"\n";
}
g.close();
}