- 博客(27)
- 收藏
- 关注
RSS订阅原创 POJ 1061 青蛙的约会
//POJ 1061//扩展欧几里得算法/*求解ax + by = c, 可先解得ax + by = gcd(a, b)与等式右边无关，可得结论x = x0 + kb/gcd(a, b).为了求解最小非负解，可以先取模在加上模值再取模得到*/void exgcd(LL a, LL b, LL &d, LL &x, LL &y) { if (!b) d = a, x = 1, y
2017-07-31 09:24:31
248
原创 例题6-4 破损的键盘（又名：悲剧文本）（Broken Keyboard（a.k.a. Beiju Text）, UVa 11988）
#ifdef _DEBUG#pragma warning(disable : 4996)#endif#include #include #include #include #include #include #include #include #include #include #include #include #include #include #includ
2017-07-28 10:21:08
695
原创 例题6-3 矩阵链乘（Matrix Chain Multiplication, UVa 442）
#ifdef _DEBUG#pragma warning(disable : 4996)#endif#include #include #include #include #include #include #include #include #include #include #include #include #include #include #includ
2017-07-27 21:49:36
250
原创 HDUOJ 1045 Fire Net
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLEAR(a, b)
2017-07-23 21:47:21
269
原创 UVa 725
//UVa 725typedef pair PII;vector v;bool judge(int a, int b) { char s1[20], s2[20]; sprintf(s1, "%d", a); sprintf(s2, "%d", b); int l1 = strlen(s1), l2 = strlen(s2); if (l2 != 5) return false;
2017-07-21 10:13:28
232
原创 POJ 3190 Stall Reservations
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLEAR(a, b)
2017-07-19 11:20:52
154
原创 例题6-2 铁轨（Rails, ACM/ICPC CERC 1997, UVa 514）
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLEAR(a, b) memset(a, b, sizeof(
2017-07-16 22:09:11
588
原创 Chapter 3. Strings, Vectors, and Arrays
//Exercises Section 3.5.1//Exercise 3.27: Assuming txt_size is a function that takes no arguments//and returns an int value, which of the following definitions are illegal ?//Explain why.//unsigne
2017-07-16 19:38:10
212
原创 4-1 单链表逆转
//真让人头大，这题debug了一个点。。。typedef struct Node *PtrToNode;struct Node { int Data; /* 存储结点数据 */ PtrToNode Next; /* 指向下一个结点的指针 */};typedef PtrToNode List; /* 定义单链表类型 */List Reverse(List L) { PtrTo
2017-07-15 21:11:12
242
原创 例题6-1 并行程序模拟（Concurrency Simulator, ACM/ICPC World Finals 1991, UVa210）
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(fal
2017-07-15 11:25:51
764
原创 暑假flag
今天是假期的第一天，立个flag吧，希望在这个假期里： 1. 能把c++primer补完 2. 完成数据结构c语言版的学习及练习 3. 紫书能够每日一题 4. 学习qt
2017-07-15 08:55:49
316
原创 Chapter 2. Variables and Basic Types
//float 误差int main() { //OUT(); float a = 1.f / 81; float b = 0; for (int i = 0; i < 729; ++i) b += a; printf("%.7g\n", b); double c = 1.0 / 81; double d = 0; for (int i = 0; i < 729; ++i) d
2017-07-13 22:17:58
228
原创 HDUOJ 1160 Leftmost Digit
求整数部分，联想到科学计数法设n^n = a*10^x,a的整数部分即为n的整数部分，也就是我们所求的两边取对数，nlgn = x + lga;求得a = 10^(nlgn-x),又应为0<a<10,得到lga即为nlg的小数部分于是a = 10^(nlgn-floor(nlgn))取整#include #include #include #include #include
2017-07-13 20:51:25
249
原创 HDUOJ 4282 A very hard mathematic problem
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(fal
2017-07-12 09:56:30
326
原创 HDUOJ 2136 Largest prime factor
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(fal
2017-07-11 14:02:13
205
原创 HDUOJ 2138 How many prime numbers
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(fal
2017-07-10 21:31:09
387
原创 HDUOJ 1051 Wooden Sticks
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(fal
2017-07-10 18:24:26
254
原创 习题5-10 在Web中搜索（Searching the Web, UVa1597）
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(false)#defin
2017-07-05 10:20:56
265
原创 第五章 总结
//检索int main() { int a[] = { 10, 20, 30, 40 }; auto p1 = find(a, a + 4, 10); auto p2 = find(a, a + 4, 0); auto p3 = lower_bound(a, a + 4, 15);//return >= val auto p4 = upper_bound(a, a + 4, 15);
2017-07-04 15:18:15
191
原创 习题5-9 找bug（Bug Hunt, UVa1596）
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(false)#defin
2017-07-04 12:01:12
424
原创 14.3. Arithmetic and Relational Operators
#include #include using namespace std;class Sales_data { friend istream &operator>>(istream &, Sales_data &); friend ostream &operator<<(ostream &, const Sales_data &); friend Sales_data opera
2017-07-03 18:56:13
182
原创 14.2. Input and Output Operators
#include #include using namespace std;class String { friend ostream &operator<<(ostream &, const String &);public: String() : String("") { } String(const char *); String(const String &); St
2017-07-03 13:43:41
273
原创 14.1.Basic Concepts
//14.1. Basic Concepts//Exercises Section 14.1//Exercise 14.1: In what ways does an overloaded operator differ from a//built - in operator ? In what ways are overloaded operators the same as the
2017-07-03 10:00:30
171
原创 13.5. Classes That Manage Dynamic Memory
#include #include #include using namespace std;class StrVec {public: StrVec() : elements(nullptr), first_free(nullptr), cap(nullptr) { } StrVec(const StrVec &); StrVec &operator=(const StrVe
2017-07-02 20:12:35
142
原创 13.4. A Copy-Control Example
//Exercises Section 13.4//Exercise 13.33: Why is the parameter to the save and remove members//of Message a Folder&? Why didn’t we define that parameter as Folder?//Or const Folder&?//Because it h
2017-07-02 16:46:52
199
原创 习题5-8 图书管理系统（Borrowers, UVa230）
习题5-8 图书管理系统（Borrowers, UVa230）Before they are returned to the shelves, the returnedbooks are sorted by author and then title using the ASCII collating sequence.#include #include #include #inclu
2017-07-02 14:00:15
391
原创 习题5-7 打印队列（Printer Queue, UVa12100）
习题5-7 打印队列（Printer Queue, UVa12100）1.adding and removing jobs from the queue is instantaneous.#include #include #include #include #include #include #include #include #include #include #in
2017-07-01 18:32:18
629
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人