伪类： ：first-child :link :hover :active :visited :focus :lang伪元素： :first-line :first-letter :before :after注意：CSS3中伪元素前是两个冒号，如 ::first-lin...
分类：
其他好文 时间：
2014-08-18 09:14:33
阅读次数：
240
第14章 使用选择器在页面中插入内容使用选择器来插入文字图片上一章提到过使用before和after伪类为某个元素之前或之后插入内容 h2:after{content:'12345'}，也可以指定个别元素不进行插入h2.class1:after{content:none}，也可以插入图片h2:aft...
分类：
Web程序 时间：
2014-08-18 01:26:43
阅读次数：
311
You are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation & sketching, you have figured out the requirements for an energy-efficient design that c...
分类：
其他好文 时间：
2014-08-18 00:21:55
阅读次数：
211
Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After several thrilling events we find her in the first station of Algorithms City Metro, examining the tim...
分类：
其他好文 时间：
2014-08-18 00:21:13
阅读次数：
383
启动了AVD却说找不到AVD
错误提示：
No active compatible AVD's or devices found. Relaunch this configuration after connecting a device o
查看你的project版本是运行在哪个版本的（AndroidManifest.xml中android:targetSdkVersion属性...
分类：
其他好文 时间：
2014-08-18 00:20:43
阅读次数：
253
Happy Reversal
Elfness is studying in an operation "NOT".
For a binary number A, if we do operation "NOT A", after that, all digits of A will be reversed. (e.g. A=1001101, after operation "NOT A...
分类：
移动开发 时间：
2014-08-16 21:10:31
阅读次数：
321
Description
Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such th...
分类：
其他好文 时间：
2014-08-16 17:11:52
阅读次数：
272
Description
RPG battles
In many typical RPG games, you battle with bad guys, creatures, monsters or ghosts etc. all the time. After each battle, you may get magic potions th...
分类：
其他好文 时间：
2014-08-16 13:51:30
阅读次数：
245
Detect the Virus
Time Limit: 2 Seconds Memory Limit: 65536 KB
One day, Nobita found that his computer is extremely slow. After several hours' work, he finally found that it was a virus that...
分类：
其他好文 时间：
2014-08-16 09:44:50
阅读次数：
377
本题需要使用选择矩阵的程序求解，这个和Leetcode上的一个程序是一样道理的。如果使用额外空间，那么是很容易做到的，这里不使用额外空间，直接使用到位操作，空间效率是O(1)，这是个非常漂亮的到位旋转程序。
题意还是很重要，这次看错了一句话，就WA了一次：
The maximum amount of cells which contains two equal numbers after ov...
分类：
其他好文 时间：
2014-08-15 22:35:29
阅读次数：
288
