#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 510 , INF = 0x3f3f3f3f;
int n , m;
int g[N][N];
int dist[N];
bool st[N];
int prim() {
...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《Prim算法求最小生成树》 | 952字 | 7.8分钟 | 100% | 96 CPM | 102 次 | 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