hdu 2065 "紅色病毒"問題
阿新 • • 發佈：2018-06-16
span 快速 pre AC namespace ane clu %d ase
n=1 --> ans = 2 = 1*2 = 2^0(2^0+1)
n=2 --> ans = 6 = 2*3 = 2^1(2^1+1) n=3 --> ans = 20 = 4*5 = 2^2(2^2+1) n=4 --> ans = 72 = 8*9 = 2^3(2^3+1) n=k --> ??? = 2^k-1*(2^k-1+1) 於是題目轉化為快速冪問題.....#include<bits/stdc++.h> using namespace std; typedef long long ll; int solve(ll a, ll b) { ll ans= 1; a %= 100; while(b) { if(b&1) ans = ans *a % 100; b /= 2; a = a * a % 100; } return ans; } int main() { int t; while(cin >> t && t) { for(int i = 1; i <= t; i++) { ll n; cin >> n; n = solve(2, n-1); printf("Case %d: %d\n", i, (n*(n+1))%100); } printf("\n"); } return 0; }
hdu 2065 "紅色病毒"問題