Cod sursa(job #1056929)
| Utilizator | Data | 14 decembrie 2013 13:55:45 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
int A[1000],B[1000],K[1000],L[1000],t,c,m;
ifstream f("euclid3.in");
ofstream g ("euclid3.out");
int main()
{
f>>t;
for(;t;t--)
{
f>>A[0]>>B[0]>>c;
for(m=0;B[m];m++)
{
A[m+1]=B[m];
B[m+1]=A[m]%B[m];
}
if(c%A[m])
{
g<<"0 0 \n";
continue;
}
c/=A[m];K[m]=1;L[m]=0;
for(m--;m>=0;m--)
{
K[m]=L[m+1];
L[m]=K[m+1]-A[m]/B[m]*L[m+1];
}
g<<K[0]*c<<' '<<L[0]*c<<'\n';
}
return 0;
}
