Cod sursa(job #720946)
Utilizator | Data | 23 martie 2012 08:17:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
int main()
{int n,i,n1,n2,n3;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
f>>n;
for(i=1;i<=n;i++)
{f>>n1>>n2>>n3;
while(n1!=n2)
{if(n1>n2)
n1=n1-n2;
if(n2>n1)
n2=n2-n1;
}
while(n1!=n3)
{if(n1>n3)
n1=n1-n3;
if(n3>n1)
n3=n3-n1;
}
g<<n1<<endl;
}
}