Submission #1305806

---

Source Code Expand

#include <iostream>
#include <cstdio>

using namespace std;

#define M 1000000007
typedef long long ll;

ll pow(ll a, long b){
  ll x;
  if(a>0) x=a%M;
  else x=M-(-a)%M;
  ll ans=1;
  while(b>0){
    if(b&1) {ans*=x; ans%=M;}
    x*=x; x%=M;
    b=b>>1;
  }
  return ans;
}

int main(){
  long A,B,D;
  cin >> B >> A >> D;
  ll ad=A*D, ab=A*B, bd=B*D;
  ll X= bd+ab-ad;
  long r = ((ad-bd)%M)*(pow(X,M-2))%M;
  long c = ((ad-ab)%M)*(pow(X,M-2))%M;
  cout << r << " " << c << endl;
}

Submission Info

Judge Result