fork(25) download
  1.  
  2. def GCD(a, b):
  3. prevx, x = 1,0
  4. prevy, y = 0, 1
  5. while b:
  6. q = a/b
  7. x, prevx = prevx - q*x, x
  8. y, prevy = prevy - q*y, y
  9. a, b = b, a%b
  10. return a, prevx, prevy
  11.  
  12. def modinv(x, m):
  13. (gcd, c, d)= GCD(x,m)
  14. if c<0:
  15. c += m
  16. return c
  17.  
  18. s1=0x44e1ff2dfd8102cf7a47c21d5c9fd5701610d04953c6836596b4fe9dd2f53e3e
  19. s2=0x9a5f1c75e461d7ceb1cf3cab9013eb2dc85b6d0da8c3c6e27e3a5a5b3faa5bab
  20. q=2**256 - 432420386565659656852420866394968145599
  21. print "s1-s2 = %064x" % (s1-s2)
  22.  
  23. print "1/(s1-s2)= %064x" % modinv(s1-s2, q)
  24.  
Success #stdin #stdout 0.01s 7852KB
stdin
Standard input is empty
stdout
s1-s2 = -557d1d47e6e0d4ff37877a8e337415bdb24a9cc454fd437ce7855bbd6cb51d6d
1/(s1-s2)= f7d5417b3844fd8f4b3d909979fa7480ce094fb233d759274fd6c3aa6cf86593