UVA
关注
分享
扫一扫
文章平均质量分 80
Puya
人生不设限 没有不可能
展开
-
UVA 11879 Multiple of 17
题目链接#include#include#include#include#includeusing namespace std;int main(){ string str; int i,ans; while(getline(cin,str),str[0]-'0') //string的头文件是#include { a原创 2016-05-21 22:01:50 · 326 阅读 · 0 评论 -
UVA 11882 Biggest Number
题目链接#include #include #include #include #include using namespace std;typedef long long LL;const int MAXN = 33;struct Node { int a[MAXN], len; void clear() { len = 0; }转载 2016-05-21 22:19:04 · 527 阅读 · 0 评论 -
UVA 12657 Boxes in a Line【双向链表】
https://vjudge.net/problem/UVA-12657#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#in原创 2017-02-25 18:32:28 · 268 阅读 · 0 评论 -
UVA 11988 Broken Keyboard 【链表】
Broken Keyboard #include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing原创 2017-02-25 14:20:30 · 331 阅读 · 0 评论 -
UVA 679 Dropping Balls 【二叉树】
https://vjudge.net/problem/UVA-679#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include原创 2017-02-25 19:42:32 · 316 阅读 · 0 评论 -
UVA 122 Trees on the level【二叉树】
https://vjudge.net/problem/UVA-122#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#incl原创 2017-02-26 21:15:04 · 289 阅读 · 0 评论 -
UVA 1343 The Rotation Game 【IDA*】
The Rotation Game UVA - 1343 #include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long l原创 2017-07-10 21:25:41 · 300 阅读 · 0 评论 -
UVA 1599 Ideal Path【双向bfs+非简单图的最短路】
Ideal Path UVA - 1599 思路：从终点开始倒着bfs一次，得到每个点到终点的距离，然后从起点开始，按照每次距离减1的方法寻找接下来的点的编号。按照颜色最小的走，如果有多个颜色最小，则都拉入队列中，将最小的颜色记录在res数组中。细节：已经进入队列的节点不能重复入队，否则复杂度太高，会tle（重复入队的原创 2017-07-09 21:26:20 · 366 阅读 · 0 评论