2012年2月2日
joj1032
摘要： 1032: DeckResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE15s8192K1893628StandardScenarioA single playing card can be placed on a table, carefully, so that the short edges of the card are parallel to the table's edge, and half the length of the card hangs over the edge of the table. If the car 阅读全文
posted @ 2012-02-02 15:05 漂木 阅读(303) 评论(0) 推荐(0) 编辑
Why C++ ? 王者归来
摘要： 来自酷壳http://coolshell.cn/articles/6548.html因为又有人我去Quora的C2C站去回答问题去了，这回是 关于@laiyonghao的这篇有点争议的博文《2012 不宜进入的三个技术点》ActionScript，Thread 和 C++，C++争议的争议最大。（要我说，.NET比C++更需要慎重进入，呵）。我就在这里回复一下这个问题吧。正好我一个月前看到一个视频，这个演讲视频还比较著名，这个演讲者是Exceptional C++和C++ Coding Standards的作者，还是ISO C++ 委员会的Chair，C++/CLI首席架构师，还是Micros 阅读全文
posted @ 2012-02-02 14:10 漂木 阅读(161) 评论(0) 推荐(0) 编辑
2012年1月29日
Ubuntu换回Gnome界面
摘要： 安装了Ubuntu11.10，Unity界面实在是不怎么习惯。遂换回Gnome。 1. 首先安装Gnome sudo apt-get install gnome-shell sudo apt-get install gnome-tweak-tool 2. 设置自动登录Gnome shell classic sudo /usr/lib/lightdm/lightdm-set-defaults -s gnome-classic 由于笔记本是A卡，Gnome3各种悲剧，干脆就用classic。闲了折腾一下A卡的Gnome3，备忘一个网址http://wiki.cchtm... 阅读全文
posted @ 2012-01-29 21:20 漂木 阅读(1259) 评论(0) 推荐(0) 编辑
2012年1月28日
如何卸载Linux
摘要： 尝试了一个多月LinuxMint，感觉不如Ubuntu，Fedora用着舒服。昨日更是诡异地瞬间关机，之后就一直卡在Linux启动界面进不了系统，遂决定卸载LinuxMint。 网上有各种方法，我使用的是最暴力的----直接格掉Linux的几个分区。 1.在Win7中用Disc Management将分给Linux的几个区格掉后，重启; 2.出现Grub Rescue，至于为什么出现这个应该是由于grub的mbr找不到在Linux分区中的/grub目录; 3.将Win7的盘放入，重启，选光盘启动，这里可以有两种方法：一种是进入安装windows的选项，一直到安装Windows的界面... 阅读全文
posted @ 2012-01-28 17:44 漂木 阅读(648) 评论(0) 推荐(0) 编辑
2012年1月27日
joj1146
摘要： 1146: Word ReversalResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K2658690StandardFor each list of words, output a line with each word reversed without changing the order of the words.This problem contains multiple test cases!The first line of a multiple input is an integer N, then a blank 阅读全文
posted @ 2012-01-27 23:32 漂木 阅读(230) 评论(0) 推荐(0) 编辑
joj1024
摘要： 1024: Function Run FunResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K28941177StandardWe all love recursion! Don't we?Consider a three-parameter recursive function w(a, b, c):if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:1if a > 20 or b > 20 or c > 20, then w( 阅读全文
posted @ 2012-01-27 22:44 漂木 阅读(266) 评论(0) 推荐(0) 编辑
joj1006
摘要： 1006: All your baseResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K59671984StandardGiven a base, and two positive integers in decimal (base 10), convert the two numbers to the new base, add them, and display their sum in the new base.InputThree positive integers denoting the base and the tw 阅读全文
posted @ 2012-01-27 21:59 漂木 阅读(160) 评论(0) 推荐(0) 编辑
joj1277
摘要： 1277: Fibonacci FreezeResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K2367561StandardThe Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:Write a program to calculate the Fibonacci Numbers.Input and OutputThe input to your program would be a sequenc 阅读全文
posted @ 2012-01-27 17:54 漂木 阅读(165) 评论(0) 推荐(0) 编辑
joj1011
摘要： 1011: If only I had a Venn diagramResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s524288K39901595StandardThe symmetric difference of two sets is the set of elements belonging to one but not both of the two sets. For example, if we have two sets A = {1,2,3,4,5} and B = {3,4,5,6,7,8}, then the sym 阅读全文
posted @ 2012-01-27 16:04 漂木 阅读(177) 评论(0) 推荐(0) 编辑
joj1008
摘要： [JPoints: 381, Sender!: 0/0]1008: Go hang a salami, IResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K86581612StandardGiven a character string, determine if it is a palindrome. A palindrome is a word or phrase that reads the same forwards and backwards, like mom or noon. For our purposes, pa 阅读全文
posted @ 2012-01-27 15:16 漂木 阅读(226) 评论(0) 推荐(0) 编辑