Breaking News: Grepper is joining You.com. Read the official announcement!

modulo 1e14

Gentle Gentoo answered on December 13, 2023 Popularity 3/10 Helpfulness 1/10

answer modulo 1e14

modulo 1e14

Comment

int mult(int x,int y){ return ((x%mod)*(y%mod))%mod;}
int expo(int x,int y){
  if (y==0) return 1;
  int a=expo(x,y/2);
  a=mult(a,a);
  if (a%2) a=mult(a,x);
  return a;
}
int divide(int x,int y){ return mult(x,expo(y,mod-2));}
//divide(mult(mult(a,b),c),mult(mult(x,y),z));

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: codeforces.com

Tags: modulo whatever

Link to this answer
Share Copy Link

Contributed on Dec 13 2023

Gentle Gentoo

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

modulo 1e14

Contents

More Related Answers

modulo 1e14

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.