文章列表
经常在ubuntu下由于更新package不成功，或者误删除了一些文件会出现
Depends: aaa (< 2.31) but bbb is to be installed
解决方法是先试着安装所缺的package，一般不会成功。这时，可以sudo apt-get purge bbb
然后再安装
颈、肩部酸痛预防
- 博客分类：
- Healthy Life
症状、两肩酸麻、精神萎靡不振。
原因、压力沉重令肌肉紧张，血气运行差，肌肉毛细血管形成淤血所致。
解决方法、紧张时，最好在每天睡觉前洗个澡，令患处温热。避免长时间采用同一姿势，不要让肩膀受凉 ...
You have been employed by the organisers of a Super Krypton Factor Contest in which contestants have very high mental and physical abilities. In one section of the contest the contestants are tested on their ability to recall a sequence of characters which has been read to them by the Quiz Master. M ...
A ring is composed of n (even number) circles as shown in diagram. Put natural numbers into each circle separately, and the sum of numbers in two adjacent circles should be a prime.
Note: the number of first circle should always be 1.
Input
n (0 < n <= 16)
Output
The outp ...
nyist 488 素数环
- 博客分类：
- Online Judge
http://acm.nyist.net/JudgeOnline/problem.php?pid=488
描述
有一个整数n，把从1到n的数字无重复的排列成环，且使每相邻两个数（包括首尾）的和都为素数，称为素数环。
为了简便起见，我们规定每个素数环都从1开始。例如，下图就是6的一个素数环。
输入
有多组测试数据，每组输入一个n(0<n<20)，n=0表示输入结束。
输出
每组第一行输出对应的Case序号，从1开始。如果存在满足题意叙述的素数环，从小到大输出。否则输出No Answer。
样例输入
6
8
3
0
样例输出
Case ...
ACM进阶计划
- 博客分类：
- Online Judge
ACM队不是为了一场比赛而存在的，为的是队员的整体提高。
大学期间，ACM队队员必须要学好的课程有：
l C/C++两种语言
l 高等数学
l 线性代数
l 数据结构
8皇后问题的三种解法
- 博客分类：
- Algorithm
算法竞赛入门经典第7章
1 生成遍历法：先产生所有的可能，然后根据限制条件过滤结果
#define RUN
#ifdef RUN
#include<stdio.h>
//C[x]=y 表示x行的皇后处于y列
int C[50], tot = 0, n = 8, nc = 0;
void search(int cur) {
int i, j;
nc++;
//检查每个可能，看是否会冲突
if(cur == n) {
for(i = 0; i < n; i++)
for(j = ...
UVA 592 - Island of Logic
- 博客分类：
- UVA
The Island of Logic has three kinds of inhabitants: divine beings that always tell the truth, evil beings that always lie, and human beings that are truthful during the day and lie at night. Every inhabitant recognizes the type of every other inhabitant.
A social scientist wants to visit the island ...
The Hamming distance between two strings of bits (binary integers) is the number of corresponding bit positions that differ. This can be found by using XOR on corresponding bits or equivalently, by adding corresponding bits (base 2) without a carry. For example, in the two bit strings that follow:
...
UVA 146 - ID Codes
- 博客分类：
- UVA
It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, the Government decides on a radical measure--all citizens are to have a tiny microcomputer surgically ...
Generating permutation has always been an important problem in computer science. In this problem you will have to generate the permutation of a given string in ascending order. Remember that your algorithm must be efficient.
Input
The first line of the input contains an integer n, which indicate ...
adb pull and push
- 博客分类：
- Android
adb push /path/to/local/file /mnt/sdcard/path/to/file
adb pull /sdcard/foo.txt D:\bar.txt
In 5-card draw poker, a player is dealt a hand of five cards (which may be looked at). The player may then discard between zero and five of his or her cards and have them replaced by the same number of cards from the top of the deck (which is face down). The object is to maximize the value of ...
1、 真正基础雄厚的人应该是可以将一个常用的基础性知识熟记成诵的人。提到一个基本的名词或话题能够将其来龙去脉解释清楚的人。
2、 我在简历当中最打动面试官的地方恰恰是我利用课余时间及逃课所写的程序，还有利用背考试题的时间所读的课外书。
3、 要想成为优秀的程序员，对于基本算法有深入与精确的理解应该是一项必须的基本技能。
4、 Your time is limited
夜宵频频胃黏膜难修复
- 博客分类：
- Healthy Life
不少年轻人喜欢熬夜，养成了经常吃夜宵的习惯，殊不知，常吃夜宵最不利于胃部健康。有专家认为，经常吃夜宵容易引发胃癌，因为胃黏膜的上皮细胞约2到3天会更新一次，这一再生修复的过程是在夜间胃肠道休息时进行的，如果经常在夜间进餐，胃肠道得不到必要的休息，黏膜修复也就无法顺利进行。 其次，夜间睡眠时，吃的夜宵长时间停滞在胃中，会促进胃液的大量分泌，对胃黏膜造成刺激，久而久之就容易导致胃黏膜糜烂、溃疡，抵抗力减弱，如果食物中含有致癌物质，例如常吃一些油炸、烧烤、煎制、腌制食品，长时间滞留在胃中，就更容易对黏膜造成不良影响，从而引发胃癌。
晚10时至次日早晨6时为禁食时间，以确保胃黏膜细胞的更新 ...