Pagini recente » Monitorul de evaluare | Cod sursa (job #2000138) | Cod sursa (job #2044414) | Diferente pentru probleme-de-taietura intre reviziile 96 si 69 | Cod sursa (job #1251344)
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <cstdio>
#include <climits>
#define PII pair < int , int >
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define LL long long
#define NMAX 20
using namespace std;
int euclid ( int a, int b, int &x, int &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
else
{
int x0,y0,d;
d=euclid(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
return d;
}
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{ int d,a,b,c,x,y;
scanf("%d %d %d",&a,&b,&c);
d=euclid(a,b,x,y);
if(c%d!=0) printf("0 0\n");
else printf("%d %d\n",x*(c/d),y*(c/d));
}
return 0;
}