#include <iostream>
#define ll long long
using namespace std;
ll Quick_pow(ll a,ll b){
ll ans=1;
while(b){
if((b&1) == 1){
ans *= a;
}
a *= a;
b >>= 1;
}
return ans;
}
int main(){
ll ...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《c++快速幂》 | 270字 | 1.0分钟 | 96% | 70 CPM | 11 次 | 3 | 不及格，加强练习！ |
| The wrong word this time: _,(,l | |||||||
| 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