
ZOJ丶
Accepted丶
A C M 之 路 丶
展开
-
ZOJ 1045 HangOver
水题一道,用二分解决问题 但由于涉及浮点数,可能引起精度误差,注意一下就好。//#include <bits/stdc++.h>//#define _ ios_base::sync_with_stdio(0);cin.tie(0);#include <iostream>#include <sstream>#include <iomanip>#include <vector>#inclu原创 2015-12-16 00:02:36 · 482 阅读 · 0 评论 -
ZOJ 2812 Quicksum
#include <bits/stdc++.h>#define _ ios_base::sync_with_stdio(0);cin.tie(0);#include <iostream>#include <sstream>#include <iomanip>#include <vector>#include <deque>#include <list>#include <set>#i原创 2016-01-24 14:38:12 · 375 阅读 · 0 评论 -
ZOJ1764 A Contesting Decision
#include <bits/stdc++.h>#define _ ios_base::sync_with_stdio(0);cin.tie(0);#include <iostream>#include <sstream>#include <iomanip>#include <vector>#include <deque>#include <list>#include <set>#i原创 2016-01-24 19:24:14 · 388 阅读 · 0 评论 -
ZOJ1090 The Circumference of the Circle
//#include <bits/stdc++.h>//define _ ios_base::sync_with_stdio(0);cin.tie(0);#include <iostream>#include <sstream>#include <iomanip>#include <vector>#include <deque>#include <list>#include <set>原创 2016-01-24 20:06:22 · 359 阅读 · 0 评论 -
Accepted丶 Personal Training (数据结构 && STL) 【未完待续】
Problem A ZOJ 1004 Anagrams by Stack 题意:给你两个串,一个原串,一个目标串,让你借用栈来得出所有的使原串变成目标串的序列。 解法:借用DFS递归求解,先进栈,后出栈,当出入栈次数刚好为原单词的长度时,目标单词构造完毕,输出操作序列#include <bits/stdc++.h>#define INF 0x3f3f3f3f#define eps 1原创 2016-06-12 22:47:03 · 550 阅读 · 0 评论