Pagini recente » Cod sursa (job #2825176) | Cod sursa (job #2936416) | Cod sursa (job #629811) | Cod sursa (job #1927012) | Cod sursa (job #2205177)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
void euclid(long long a,long long b,long long *d,long long *x,long long *y)
{
if(b==0)
{
*d=a;
*x=1;
*y=0;
}
else
{
long long x0,y0;
euclid(b,a%b,d,&x0,&y0);
*x=y0;
*y=x0-(a/b)*y0;
}
}
int main()
{
long long t;
fin>>t;
for(long long nr_t=1;nr_t<=t;nr_t++)
{
long long a,b,c;
fin>>a>>b>>c;
long long d,x,y;
euclid(a,b,&d,&x,&y);
if(c%d!=0)
{
fout<<"0 0\n";
continue;
}
long long f=c/d;
fout<<f*x<<" "<<f*y<<"\n";
}
return 0;
}
/**
#include <fstream>
using namespace std;
ifstream cin("evaluare.in");
ofstream cout("evaluare.out");
const int N=100000;
int n;
char s[N+5];
int p=0;
int termen();
int factor();
int expresie();
int expresie(){
int sum=termen();
while(s[p]=='+' || s[p]=='-'){
if(s[p]=='+'){
p++;
sum+=termen();
}
else{
p++;
sum-=termen();
}
}
return sum;
}
int termen(){
int sol=factor();
while(s[p]=='*' || s[p]=='/'){
if(s[p]=='*'){
p++;
sol*=factor();
}
else{
p++;
sol/=factor();
}
}
return sol;
}
int factor(){
int semn=1,val=0;
while(s[p]=='-'){
semn*=-1;
p++;
}
if(s[p]=='('){
p++;
val=expresie();
p++;
return semn*val;
}
while('0'<=s[p] && s[p]<='9'){
val=10*val+s[p]-'0';
p++;
}
return semn*val;
}
int main(){
cin.getline(s,N+5);
cout<<expresie();
return 0;
}
**/