razrlele
POJ1860
POJ1860 Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 23824 Accepted: 8620 Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can be several points specializing in the same pair of currencies. Each point has its own exchange rates, exchange rate of A to B is the quantity of B you get for 1A. Also each exchange point has some commission, the sum you have to pay for your exchange operation. Commission is always collected in source currency.
Sublime 3下用Fcitx输入法输入中文
首先安装一下依赖包 Shell 1 sudo apt-get install pkg-config gtk+-2.0
英文版Ubuntu Gnome 14.04配置Fcitx输入法
安装fcitx Shell 123 sudo apt-get install fcitxsudo apt-get install fcitx-googlepinyin//我安装的是Google拼音//也可以有其他选择
解决ssh连接服务器不操作时自动掉线
昨天从学长那里蹭来了一台FreeBSD VPS, 可是每次ssh登录过后只要一两分钟不操作SSH就会自动掉线, 搜索了一下过后过后解决方法如下:
POJ2499
POJ2499 Binary Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6424 Accepted: 2954 Description Background Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like this:
Codeforces #459 B
Codeforces #459 B B. Pashmak and Flowers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output
Codeforces #459 A
昨天刚回学校, 晚上就和孟海一起打了一场, 结果得了个鸭蛋, 身残志坚, 我还能再战. Codeforces #459 A A. Pashmak and Garden
POJ2234
POJ2234 Matches Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9306 Accepted: 5372 Description Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile (Of course the number of matches, which is taken away, cannot be zero and cannot be larger than the number of matches in the chosen pile). If after a player’s turn, there is no match left, the player is the winner. Suppose that the two players are all very clear. Your job is to tell whether the player who plays first can win the game or not.