T.J的博客

Pots SDUT题目是 有 两个桶 分别为A升 B升 ， 通过多次的六种操作， 得到 C升水求出最少操作步数。利用BFS 的特点（涟漪效应，可以求最短路）BFS遍历 图：（此图来自 jack cui， https://cuijiahua.com/blog/2018/01/alogrithm_10.html）#include<stdio.h>#include<...

Sum It UpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others) Total Submission(s): 9199 Accepted Submission(s):4792Problem Description Given a specified total t...

#include<cstdio>#include<cstring>#include<cstdlib>#include<iostream>#include<algorithm>using namespace std;int ans[105];//存答案int n;int j ;//int flag ;// 标记是否找到v...