#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字 | 0.3分钟 | 0% | 3 CPM | 0 次 | 264 | 不及格，错误太多！ |
| The wrong word this time: #,i,n,c,l,u,d,e,,<,i,o,s,t,r,e,a,m,>,u,s,i,n,g,,l,l,,=,,l,o,n,g,,l,o,n,g,;,c,o,n,s,t,,l,l,,M,O,D,,=,,1,e,9,,+,,7,;,l,l,,q,p,o,w,(,l,l,,a,,,,l,l,,n,),{,i,f,(,n,,=,=,,0,),,r,e,t,u,r,n,,1,;,l,l,,r,e,s,,=,,q,p,o,w,(,a,,,,n,,/,,2,),;,,r,e,s,,*,=,,r,e,s,;,,r,e,s,,%,=,,M,O,D,;,i,f,(,n,,&,,1,),,r,e,s,,*,=,,a,;,r,e,t,u,r,n,,r,e,s,,%,,M,O,D,;,},i,n,t,,m,a,i,n,(,),{,i,n,t,,a,,,,b,s,t,d,:,:,c,i,n,,>,>,,a,,>,>,,b,;,s,t,d,:,:,c,o,u,t,,<,<,,q,p,o,w,(,a,,,,b,),,<,<,,s,t,d,:,:,e,n,d,l,;,} | |||||||
|
Suggestion:
正确率比较低，多观察一下出错的字加以修正，一般来讲都要达到95%以上比较好。
总的来说速度上可能不是很快，多练习键位、或英文文章巩固一下，然后试着对应的输入法练习上，多增加词组等、一次性多字的输出，这样可以总体上提高部份速度。
|
|||||||
| 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