快速幂

昨天的课有比较深印象的是快速幂，感觉代码短又实用

#include<iostream>using namespace std;int quickpow(int a, int b)//a的b次方{int ans;ans = 1;while (b){if (b % 2)ans *= a;a *= a;b /= 2;}return ans;}int main(){int a, b;int i;i = 1;while (cin >> a >> b){cout << "Case " << i++ << ": " << quickpow(a, b) << endl;}return 0;}