Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
//WAP to calculate big modulo (mod m) value of a power(p) of a number(b) #include<stdio.h> int big_mod(int b,int p,int m); int main() { int x,y,z,res; scanf("%d %d %d",&x,&y,&z); res=big_mod(x,y,z); if(y%2==1) res=(res*(x%z))%z; printf("%d\n",res); return 0; } int big_mod(int b,int p,int m) { int q; if(p==0) return 1; else { q=big_mod(b,p/2,m); return ((q*q)%m); } }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
