#include<bits/stdc++.h> usingnamespace std; // 传送门:https://www.lanqiao.cn/courses/2786/learning/?id=67081 // 答案:-30 intmain() { int ans = -1; for (int i = 0; i <= 40; i++) for (int j = 0; j <= 40; j++) for (int z = 0; z <= 40; z++) { if (i * i + j * j + z * z == 1000) { ans = max(ans, j); ans = max(ans, z); ans = max(ans, i); } } cout << "-" << ans; return0; }
#include<stdio.h> intmain(){ int ans = 0; for (int a = 0;a < 5;a++) { for (int b = 0;b < 5;b++) { for (int c = 0;c < 5;c++) { for (int d = 0;d < 5;d++) { for (int e = 0;e < 5;e++) { for (int f = 0;f < 5;f++) { for (int g = 0;g < 5;g++) { for (int h = 0;h < 5;h++) { for (int i = 0;i < 5;i++) { for (int j = 0;j < 5;j++) { for (int k = 0;k < 5;k++) { for (int l = 0;l < 5;l++) { for (int m = 0;m < 5;m++) { if ((a+b+c+d+e+f+g+h+i+j+k+l+m) == 13) ans++; } } } } } } } } } } } } } printf ("%d",ans); return0; }
#include<bits/stdc++.h> usingnamespace std; // dp解法:http://lx.lanqiao.cn/problem.page?gpid=T2797 // 75分 constlonglong mod = 1e9 + 7; longlong dp[50000][7]; // dp[i][j]代表第i层j朝上时,此时有多少种方案 int op[7]; //对立面 int conflict[7][7]; //冲突 int n, m; longlongfast_power(longlong a, longlong b, longlong c) { longlong ans = 1; while (b) { if (b % 2) ans = (ans * a) % c; b /= 2; a = (a * a) % c; } return ans; } voidinit()//初始化 { op[1] = 4; op[2] = 5; op[3] = 6; op[4] = 1; op[5] = 2; op[6] = 3; for (int i = 1; i <= 6; i++) { dp[1][i] = 1; } } intmain() { ios::sync_with_stdio(false); init(); cin >> n >> m; for (int i = 1; i <= m; i++) { int remp1, remp2; cin >> remp1 >> remp2; conflict[remp1][remp2] = conflict[remp2][remp1] = 1; } for (int i = 2; i <= n; i++) //枚举层数 { for (int j = 1; j <= 6; j++) //枚举上面的骰子顶部数字 { for (int k = 1; k <= 6; k++) //枚举上面骰子顶部数字 { int down = op[k]; if (conflict[j][down] == 0) { dp[i][k] = dp[i][k] + dp[i - 1][j]; dp[i][k] %= mod; } } } } longlong ans = 0; for (int i = 1; i <= 6; i++) { ans = ans + dp[n][i]; ans %= mod; } ans = ans * fast_power(4, n, mod); ans %= mod; cout << ans; return0; }