<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Angela_Aki]]></title><description><![CDATA[心随音动~~~]]></description><link>https://blog.youkuaiyun.com/u012903039</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u012903039]]></copyright><item><title><![CDATA[Linux内核编码风格]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17718803</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17718803</guid><author>u012903039</author><pubDate>Tue, 31 Dec 2013 17:39:43 +0800</pubDate><description><![CDATA[一个良好风格的程序看起来直观、美观，便于阅读，还能有助于对程序的理解，特别在代码量比较大情况下更显现编码素质的重要性。相反没有良好的风格的代码读起来难看、晦涩，甚至有时候一个括号没对齐就能造成对程序的曲解或者不理解。我曾经就遇见过这样的情况，花费了很多不必要的时间在程序的上下文对照上，还debug了半天没理解的程序。后来直接用indent -kr -i8给他转换格式来看了。特此转过来一个关于代码风]]></description><category></category></item><item><title><![CDATA[4A.Watermelon]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17709693</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17709693</guid><author>u012903039</author><pubDate>Tue, 31 Dec 2013 09:56:48 +0800</pubDate><description><![CDATA[Watermelon


time limit per test
1 second


memory limit per test
64 megabytes


input
standard input


output
standard output



One hot summer day Pete and his friend Billy decid]]></description><category></category></item><item><title><![CDATA[1A. Theatre Square]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17708599</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17708599</guid><author>u012903039</author><pubDate>Tue, 31 Dec 2013 09:24:43 +0800</pubDate><description><![CDATA[A. Theatre Square


time limit per test
2 seconds


memory limit per test
64 megabytes


input
standard input


output
standard output



Theatre Square in the capital city of Berl]]></description><category></category></item><item><title><![CDATA[Linux学习路线]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17596489</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17596489</guid><author>u012903039</author><pubDate>Thu, 26 Dec 2013 23:47:08 +0800</pubDate><description><![CDATA[首先先学学编辑器，vim,emacs什么的都行。

然后学makefile文件，只要知道一点就行，这样就可以准备编程序了。




　　然后看看《C程序设计语言》K&R，这样呢，基本上就可以进行一般的编程了，顺便找本数据结构的书来看。




　　如果想学习UNIX/LINUX的编程，《APUE》绝对经典的教材，加深一下功底，学习《UNP》的第二卷。这样基本上系统方面的就可]]></description><category></category></item><item><title><![CDATA[一位女程序员的奋斗路程]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17596473</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17596473</guid><author>u012903039</author><pubDate>Thu, 26 Dec 2013 23:46:30 +0800</pubDate><description><![CDATA[不懂虚函数有什么用，不知道除了构造函数，析构函数外还有拷贝函数，还有深浅拷贝之分。每天下班后我没有直接回家，而是留在了单位telnet到SUNOS上，开始了我学习unix的计划。我觉得是时候该离开这个安逸的国企了，说真的，真有些舍不得，我向PM提出辞职时，经理非常真诚的挽留我，说我工作做得不错，叫我考虑考虑再走。

    一.并不成功的开始

    我所读的学校是中国西部的一所普通高校]]></description><category></category></item><item><title><![CDATA[NWPU ACM 2013.12月赛]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17548769</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17548769</guid><author>u012903039</author><pubDate>Wed, 25 Dec 2013 08:36:38 +0800</pubDate><description><![CDATA[Description




给你一个二进制数，将其翻转后与原二进制数相乘，并按下列所述格式将乘积也按二进制输出。



Input




输入有多组测试数据（不超过1000组），每组数据只有一个二进制数并且占一行，每个二进制数长度不超过30。



Output




每组数据按照样例格式输出一行。


Sample Input

1]]></description><category></category></item><item><title><![CDATA[9duoj1021]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17083775</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17083775</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:27:11 +0800</pubDate><description><![CDATA[题目1021：统计字符



时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：3435

解决：1996



题目描述：
    统计一个给定字符串中指定的字符出现的次数。


输入：
    测试输入包含若干测试用例，每个测试用例包含2行，第1行为一个长度不超过5的字符串，第2行为一个长度不超过80的字符串。注意这里的字符串包含空格，即]]></description><category></category></item><item><title><![CDATA[zoj2876]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17083041</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17083041</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:03:43 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;

int main()
{
	ifstream cin("2876.txt");
	int T, n;
	string str;
	vector v;
	cin >> T;
	while (T--)
	{
		v.clear();
		bool flag =]]></description><category></category></item><item><title><![CDATA[zoj2835]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17083021</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17083021</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:03:08 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

bool IsHuanFang(int sum1, int sum2, int *Rsum, int *Csum, int n)
{
	int sum = 0;
	if (sum1 != sum2)
		return false;
	for (int i = 0; i < n; ++i)
	{
		if (sum1]]></description><category></category></item><item><title><![CDATA[zoj2829]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17082985</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17082985</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:02:39 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

map m;
int main()
{
	int flag = 0, i = 0;
	int n;
	while (1)
	{
		++i;
		if (i % 3 == 0 || i % 5 == 0)
			m[++flag] = i;
		if (flag > 100000)
			break;
	}
	wh]]></description><category></category></item><item><title><![CDATA[zoj2772]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17082973</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17082973</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:02:08 +0800</pubDate><description><![CDATA[#include 
using namespace std;

int main()
{
	int N, money, temp, Case = 0;
	cin >> N;
	while (N--)
	{
		cin >> money;
		cout << ++Case << " ";
		temp = money / 25;
		cout << temp << " QUARTER(S), ";
]]></description><category></category></item><item><title><![CDATA[zoj2723]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17082959</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17082959</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:01:30 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

vector v;
set s;

void Picture(int x, int y)
{
	for (int i = x; i <= y; ++i)
	{
		if (i != 2 && i % 2 == 0)
			continue;
		for (int j = 3;]]></description><category></category></item><item><title><![CDATA[zoj2476]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17082937</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17082937</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:00:51 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;

int main()
{
	ifstream cin("2467.txt");
	string s1, s2, temp;
	int flag, a, b, sum;
	int n;
	map m1;
	m1['0'] = 0;
	m1['1'] = 1;]]></description><category></category></item><item><title><![CDATA[zoj2201]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17082911</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17082911</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 23:00:15 +0800</pubDate><description><![CDATA[#include 
using namespace std;

int main()
{
	int T, X, Y;
	cin >> T;
	while (T--)
	{
		cin >> X >> Y;
		if (X >= Y)
			cout << "NMM BRAIN" << endl;
		else
			cout << "NO BRAINS" << endl;
	}
	return 0]]></description><category></category></item><item><title><![CDATA[9duoj1014]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17066775</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17066775</guid><author>u012903039</author><pubDate>Mon, 02 Dec 2013 09:05:27 +0800</pubDate><description><![CDATA[题目1014：排名



时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：6035

解决：1721



题目描述：
    今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的考生，并将他们的成绩按降序打印。


输入：
]]></description><category></category></item><item><title><![CDATA[zju2109]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17051083</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17051083</guid><author>u012903039</author><pubDate>Sun, 01 Dec 2013 01:03:10 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
struct Mouse{
	double J;
	double F;
	double a;
};
bool Comp(const Mouse &s1, const Mouse &s2)
{
	if (s1.a != s2.a)
		return s1.a > s2.a;
	e]]></description><category></category></item><item><title><![CDATA[zju2722]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17051057</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17051057</guid><author>u012903039</author><pubDate>Sun, 01 Dec 2013 01:01:31 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

int main()
{
	double n, count;
	while (cin >> n && n)
	{
		count = 0;
		for (double i = 0; i < 32; ++i)
		{
			if (pow(2.0, i) >= n)
			{
				count = i;
				b]]></description><category></category></item><item><title><![CDATA[zju2727]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17051053</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17051053</guid><author>u012903039</author><pubDate>Sun, 01 Dec 2013 01:00:55 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
struct Book{
	string book;
	int year;
	int price;
};

bool NameSort(const Book &s1, const Book &s2)
{
	if (s1.book != s2.book) re]]></description><category></category></item><item><title><![CDATA[zju2818]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17051047</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17051047</guid><author>u012903039</author><pubDate>Sun, 01 Dec 2013 00:59:56 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

int main()
{
	double B, N;
	double s1, s2, A, con;
	int pos;
	while (cin >> B >> N)
	{
		for (A = 0;; ++A)
		{
			if (pow(A, N) = B)
			{
				pos = ]]></description><category></category></item><item><title><![CDATA[9duoj1048]]></title><link>https://blog.youkuaiyun.com/u012903039/article/details/17050957</link><guid>https://blog.youkuaiyun.com/u012903039/article/details/17050957</guid><author>u012903039</author><pubDate>Sun, 01 Dec 2013 00:53:17 +0800</pubDate><description><![CDATA[题目1048：判断三角形类型



时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：4065

解决：2000



题目描述：

给定三角形的三条边，a,b,c。判断该三角形类型。


输入：

测试数据有多组，每组输入三角形的三条边。


输出：

对于每组输入,输出直角三角形、锐角三角形、或是钝角三角形。


样例]]></description><category></category></item></channel></rss>