Modular inverses can be computed as follows (from Rosetta Code): #include <stdio.h> int mul_inv(int a, int b) { int b0 = b, t, q; int x0 = 0, x1
mapnik
ceres-solver
angular-jest
nyc
ktrain
pooling
fresnel
android-widget
embed-tag
aws-vm-import
acts-as-audited
abstract
second-level-cache
text-formatting
examplematcher
utf-16le
raven
ng-modal
lit-html
django-1.4
mcustomscrollbar
taskmanager
qgroundcontrol
vaapi
google-aiy
reaper
nexus-iq
data-corruption
spring-cloud-aws
extended-ascii