#include <iostream>
using ll = long long;
const ll MOD = 1e9 + 7;
ll qpow(ll a, ll n){
if(n == 0) return 1;
ll res = qpow(a, n / 2); res *= res; res %= MOD;
if(n & 1) res *= a;
return res % MOD;
}
int...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《[c++] 快速幂（递归）》 | 306字 | 1.3分钟 | 100% | 204 CPM | 39 次 | 0 | 良好，向更快挑战！ |
|
Suggestion:
可能对按键不够熟悉，或者对输入法不够熟练所导致，不要急慢慢来，先打对把准确率提高，然后逐渐的加快速度，最后才能打准打快。
|
|||||||
| Inspirational quotes: 人生不能象做菜，把所有的料都准备好了才下锅。 ——李安 | |||||||
| What do you think of this article? Give it a rating and let it serve as a guiding light for others | |||||||
Registration with the Ministry of Industry and Information Technology: Min ICP No. 19000005