#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++] 快速幂（递归）》 | 278字 | 2.9分钟 | 100% | 91 CPM | 23 次 | 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