参考代码:
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int a = scanner.nextInt(); int b = scanner.nextInt(); String []week = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"}; //System.out.println(week[binEmod1(a, b, 7)]); System.out.println(week[binEmod2(a, b, 7)]); } public static int binEmod1(int a, int b, int m) { int res = 1; while(b > 0) { if((b & 1) == 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } public static int binEmod2(int a, int b, int m) { if(b == 0) return 1; int res = binEmod1(a, b >> 1, m); return ((b & 1) == 1) ? res * res * a % m : res * res % m; } }
0.0分
5 人评分
C语言程序设计教程(第三版)课后习题8.5 (C++代码)浏览:733 |
分糖果 (C++代码)浏览:865 |
C语言程序设计教程(第三版)课后习题8.7 (C语言代码)浏览:647 |
C二级辅导-同因查找 (C语言代码)浏览:562 |
C语言程序设计教程(第三版)课后习题8.4 (C语言代码)浏览:545 |
C二级辅导-同因查找 (C语言代码)浏览:663 |
大神老白 (C语言代码)浏览:611 |
简单的a+b (C语言代码)浏览:676 |
小明A+B (C语言代码)浏览:1256 |
ASCII帮了大忙浏览:749 |