2017年02月_chudongfang2015

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 Vocabulary in Computer science and technology

February 13thfiltering [‘fɪltərɪŋ] n. 过滤，滤除，滤清 v. 透过( filter的现在分词 );（光或声）渗入;缓行;（交通指示灯处的交通）仅可左转行驶component [kəmˈpəʊnənt] n. 成分;组分;零件;[数]要素 adj. 成分的;组成的;合成的;构成的precision [prɪˈsɪʒn] n.

2017-02-13 10:52:12 650

原创刷题常用模板 by flytosky2015

声明模板：#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <iomanip>#include <algorithm>#include <climits>#include <cstring>#include <string>#include <set>#include <

2017-02-10 14:27:38 3250

原创 Codeforces Round #401 (Div. 2) 题解

A. Shell Gametime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBomboslav likes to look out of the window i

2017-02-28 15:19:23 506

原创 Codeforces 768C Jon Snow and his Favourite Number

C. Jon Snow and his Favourite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputJon Snow now has to fi

2017-02-21 10:09:45 2100

原创 Codeforces 768B Code For 1

B. Code For 1time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputJon fought bravely to rescue the wildlings wh

2017-02-21 10:06:24 574

原创 Codeforces 768A Oath of the Night's Watch

A. Oath of the Night's Watchtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output"Night gathers, and now my wat

2017-02-21 10:02:41 730

原创 HDU - 3085 A - Nightmare Ⅱ 双向BFS

Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze. They will kill the p

2017-02-20 22:43:57 665

原创 Codeforces Round #398 (Div. 2) B. The Queue brute force+greedy

B. The Queuetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFinally! Vasya have come of age and that means

2017-02-18 21:42:16 403

原创 Codeforces Round #398 (Div. 2) A. Snacktower 模拟

A. Snacktowertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAccording to an old legeng, a long time ago A

2017-02-18 21:28:51 950

原创 [C++ primer] 第13章_拷贝、赋值、销毁知识总结+代码实现

13.1 拷贝、赋值与销毁13.1.1拷贝构造函数拷贝构造函数条件： 1. 第一个参数为自身类型的引用 2. 任何额外参数都有默认值对于类类型的成员，会使用其拷贝构造函数来拷贝，内置类型则直接拷贝。#include using namespace std;int main(){ return 0;}class Sales_data {public

2017-02-18 16:57:20 399

原创 Codeforces Round #397 题解

A. Neverending competitionstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThere are literally dozens of s

2017-02-15 22:40:42 1072 2

原创 Codeforces Round #272 (Div. 2) < math >

A Dreamoon and Stairs 数学水题题目思路：判断一下m的倍数的两倍是否大于n.代码#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <iomanip>#include <algorithm>#include <climits>#include <cstring

2017-02-13 17:37:57 335

原创 Codeforces Round #396 (Div. 2)题解

A Mahmoud and Longest Uncommon Subsequence解题思路整理：最长不相同串，思路很简单，如果两个串相同，则肯定不存在不相同串，如果两个串不相同，则取最长串的长度~解题代码：#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <iomanip>#in

2017-02-10 14:16:13 383

原创 Codeforces Round #268 (Div. 2) 题解

A I Wanna Be the Guy解题思路直接用一个set，最后判断一下是否有n个数。#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <iomanip>#include <algorithm>#include <climits>#include <cstring>#i

2017-02-10 14:03:36 303

原创假期训练——THE DRUNK JAILER POJ - 1218 模拟

A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked. One night, the jailer gets bored and decides to play a game. Fo

2017-02-06 19:49:13 345

原创假期训练——Hangman Judge UVA - 489 模拟

In ``Hangman Judge,'' you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are the same as the classic game

2017-02-06 19:42:18 310

原创假期训练——The Dole Queue UVA - 133 模拟

题目连接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=69解题思路:简单模拟，直接模拟环，注意选择同一人特判。#include #include #include #include #include #i

2017-02-06 19:31:11 288

原创假期训练——The Blocks Problem UVA - 101 模拟

题目连接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=37解题思路:分别模拟四次操作，用数据记录每个数据当前组号，还有就是注意当两个操作对象在同一个组时直接跳过该操作。#include #include

2017-02-06 19:27:49 371

原创假期训练—— Repeating Decimals UVA - 202 模拟

题目连接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=138解题思路：模拟除法，在每一次进行除法运算时都会有一个被除数，如果两次被除数相同，则遇到一个循环节，通过判断其出现位置，解题。代码如下：#include

2017-02-06 19:12:17 268

原创假期训练——Puzzle UVA - 227 模拟+DFS and similar

题目连接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=163解题思路：简单模拟，每走一步，交换一次，如果越界，则退出。#include #include #include #include #include #i

2017-02-06 19:07:40 679

原创假期训练——Mahjong HDU - 4431 模拟

Japanese Mahjong is a four-player game. The game needs four people to sit around a desk and play with a set of Mahjong tiles. A set of Mahjong tiles contains four copies of the tiles described next:

2017-02-06 18:51:16 322

原创 Codeforces Round #269 (Div. 2) C MUH and House of Cards 爆搜+剪枝

C. MUH and House of Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolar bears Menshykov and Uslada f

2017-02-06 10:08:18 521

原创 Codeforces Round #269 (Div. 2) D MUH and Cube Walls KMP

D. MUH and Cube Wallstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolar bears Menshykov and Uslada from

2017-02-06 10:01:13 369

原创 Codeforces Round #395 (Div. 2) 题解

题目连接：http://codeforces.com/contest/764A. Taymyr is calling you解题思路：两个for循环，对一个数组进行操作，访问次数为2的数目为答案时间复杂度：O(n) 空间复杂度：O(n)代码如下：#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#i

2017-02-03 21:43:56 365

原创 Codeforces Round #394 (Div. 2) 题解

Codeforces Round #394 (Div. 2) 题解A. Dasha and Stairs解题思路：判断一下两者相减的绝度值是否为小于2。注意特判两个0的情况时间复杂度：O(1) 空间复杂度：O(1)代码如下：#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <alg

2017-02-01 17:02:43 428