Andrew-Malcom

Andrew-Malcom : EOJ 徒弟的下山之路(广度优先搜索+优先队列)
5 年,6 月前

include #include < queue > #include < cstdio > #include < cstdlib > #include < cctype > #include < cstring > #include < string > using namespace std ; // bfs const int INF = 0x3f3f3f ; const int dx [] = { 0 , 0 , 1 ...查看全文
Andrew-Malcom : 如何用起泡法进行数据排序?
5 年,11 月前

include int main() { int a[3]; int i, j, t; for (i = 0; i < 3; i++) scanf(“%d”, &a[i]); for(j=0;j<3;j++) { for (i = 0; i < 2 - j; i++) { if (a[i] > a[i + 1]) { t ...查看全文