CSDN向來是以娛樂精神出名的。有網(wǎng)友曾笑談：“當(dāng)我無聊，當(dāng)我猥瑣的時候，上CSDN，總是能找到組織。”這話基本沒錯。
    曾經(jīng)數(shù)次導(dǎo)演編程語言PK的CSDN，今天又發(fā)表了篇很娛樂很有導(dǎo)火索的文章

實例演示：Java和C語言哪個更快？

    作者很娛樂地寫了堆代碼來驗證Java不比C語言快，留言的高手們也很娛樂地來繼續(xù)聲討。
    孰是孰非我也不關(guān)心，Java和C的快慢以前也層寫過一些所謂的計算程序比較過，JVM的Hostspot機(jī)制，在這種小打小鬧的“測試”下確實威力巨大。有時還真的會比完成相同計算任務(wù)的C程序快。但是不要忘了真刀真槍的環(huán)境，大型應(yīng)用光一個GC就足可讓Java落后C寫的本地代碼一大截！
   無聊無聊
   


  高級接口封裝變成了底層接口，需求幾天之內(nèi)就能完全變個樣，真是奇跡！
  剩下一個月不到了，咬咬牙，邊干活邊寫論文吧。
  Dido這幾天也很累，每天短信哄她睡覺，很讓人心疼的女孩兒。

    口袋里僅剩下20塊零五毛的時候，突然發(fā)現(xiàn)了錢的重要。
    于是給人做了兩個小程序，前后總共大概花了三天，拿了1000塊到手。學(xué)院還欠自己600塊的項目補(bǔ)助。不知道何時才能到賬上。一向不愿意計算口袋里的錢，這回終于窘迫起來。
    賺了點小米，畢業(yè)還有一個月不到，先撐過去。晚上和人吃飯，笑談一個局域網(wǎng)流量計費的活兒。開玩笑說一周時間，優(yōu)惠價2000。怕要真有活兒，一周時間搞不定吧。說大話容易，做起來是另外回事。Dido說我有時喜歡說大話，我承認(rèn)。
    論文寫了七千字，繼續(xù)努力。
    上海，我來了。雖然第一份工作并沒有想象中的好，但是，會硬著頭皮撐下去。生活給的是挑戰(zhàn)，喜歡挑戰(zhàn)。

? 631所的項目已經(jīng)開始了兩個月了.現(xiàn)在還是在做運行代理這一模塊.我算是搞核心編碼吧.被JNI,Socket,Thread,RMI整得暈乎著呢.
? 沒有考試壓力,沒有就業(yè)壓力.一切都平靜得很.每天睡六小時.兩杯咖啡(早晨中午各一杯).三天一包煙.中午是兩節(jié)玉米外加一大片菠蘿.兩天BT一部電影.
?? 一天上班7個半小時,晚上看書3小時.喜歡現(xiàn)在的寧靜.寧靜得如水一樣.
?     三方協(xié)議寄出去了,沒正式回到手里,學(xué)院沒蓋章之前,還是有些小小的不放心.^_^,畢竟回上海的機(jī)會太難得了.
   上海不是我家,可對我而言,對于一個遠(yuǎn)在西北求學(xué)的人而言,至少是家門口了那天打電話告訴媽媽,聽得出來,她非常高興.
   現(xiàn)在才發(fā)現(xiàn)自己沒有想象中那么豁達(dá),以為很多事情能放得開.以為天下之大,到處可以容身.是的,天下是很大,可是我能容身的地方卻不是如此.總有張網(wǎng),心里一張網(wǎng)把我網(wǎng)住. 記得有人說過,牢籠是自己造的. 很有道理,但是我卻愿意囚禁在這籠子里.
   一片沒邊際的天,有幾個人真正敢去接受?
 打定主意回去,未來怎么樣,我沒法去想. 最起碼,回去,能給未來一個模糊可能性,我的要求不高.知足了.
    看著辦吧,一切都如田野里的百合,自然就會開的.
    我所要做的,只是去呼吸,去汲取,去曬太陽! 今天開始復(fù)習(xí)專業(yè)課,無聊的宣講會或招聘會一律不參加!

編程求解: 運動員打靶,10發(fā)子彈命中90環(huán)(每分成績?yōu)?到10環(huán)不等)
???????????????? 求可能情況的總數(shù)

解法一:
?#include <stdio.h>
#include <stdlib.h>

int f(int n, int m)
{
?int fn=0,i;
?if(m<0||m>10*n) return 0;
?if(n==1) return 1;
?for(i=0;i<=10;i++)
?fn+=f(n-1,m-i);
?return fn;
}

int main()
{
?int n,m;
?printf("Please enter n and m:");
?scanf("%d%d",&n,&m);
?printf("\n%d發(fā)打中%d環(huán)有%d種可能.\n",n,m,f(n,m));

?system("PAUSE");
?return 0;
}?

解法二:

?#include"stdio.h"

int main(){

int num =1,i;
for(i=1;i<=10;i++)
num = num *(9+i)/i;
printf("%d",num);
}

個人觀點:
? 計算機(jī)是一門和數(shù)學(xué)相關(guān)的學(xué)科,隨著這門學(xué)科的發(fā)展,這種"本質(zhì)"似乎被弱化了.解法1是很普通的方法,一般人都是這種思路.而解法二則是從數(shù)學(xué)角度考慮.簡潔,快速.
上次去神碼筆試,碰到一題
?? :給定一個數(shù),如7899,把各位數(shù)值相加7+8+9+9=33,3+3=6,用這種方法計算機(jī)下去,求最后得到的個位數(shù)

我給出的解法:
#include "stdio.h"

int main(){
???int i;
???scanf("%d",&i);
???printf("%d",i%9==0?9:i%9);
?? return 0
}//~end?
?

有6個英文字母,a,b,c ,d,e,f
?從中任意取N個(N<=6)來排列.
已知 a 只能與 b 相連,?
???????? b不能和e,f相連
?????????c不能和a相連
???????? d不能和 a ,e相連
???????????f 不能和?a,b相連
請打印出字母f或b 在末尾的組合順序,用Java實現(xiàn)

我的解答:

??? import java.util.*;

/**
?*
?* @author ShenXiaoliang
?*
?*/
public class DemoGraph {
?
?final static int VERTICE=6;
?
?private ArrayList<String> patheSet=new ArrayList<String>();
?
?private String[] ver={"a","b","c","d","e","f"};
?
?private int[][] graph=new int[6][6];
?
?private String path="";
?
?private boolean[] isVisit=new boolean[VERTICE];
?
?
?public DemoGraph() {
??
??initiGraph();
??for(int index=0;index<VERTICE;index++)
??depthSearch(index);
??show();
??
?}
?
?private void initiGraph(){
??graph[0][1]=1;
??graph[1][0]=1;
??graph[1][2]=1;
??graph[1][3]=1;
??graph[2][1]=1;
??graph[2][3]=1;
??graph[2][4]=1;
??graph[2][5]=1;
??graph[3][1]=1;
??graph[3][2]=1;
??graph[3][5]=1;
??graph[4][2]=1;
??graph[4][5]=1;
??graph[5][2]=1;
??graph[5][3]=1;
??graph[5][4]=1;
?}
?
?private void depthSearch(int start){
??
??isVisit[start]=true;
??path+=ver[start];
??if(path.charAt(path.length()-1)=='f'||path.charAt(path.length()-1)=='b') patheSet.add(path);
??for(int index=0;index<VERTICE;index++)
???if(graph[start][index]==1&&isVisit[index]==false)
????depthSearch(index);
???else continue;
??path=path.substring(0,path.length()-1);
??isVisit[start]=false;
?}
?
?
?private void show(){
??for(String pa:patheSet)
???System.out.println(pa);
?}

?/**
? * @param args
? */
?public static void main(String[] args) {
??// TODO Auto-generated method stub
??new DemoGraph();
?}

}

?????????

i bought a durain in the supermarket,smelling terrible.
i thought about durain for time,not because i miss the test of it .just for curiosity。so ugly ,so smelly and so expensive.why so many persons love this strange fruit? is it really do delicious ?
today, i bought one.hehe.
well,i've no idea to deal the prickly,hard "stone".so it is reasonable to ask the worker of the supermark to get it . The flesh of durain is milk white with a little yellow,just like the ice cream for its softness. the feeling is good.
?i put a piece of the "cream" into my mouth,so carefully and nervous . wow ,the smell is still terrible,but the taste is unexpected delicious. soft,sweet,smooth.
?really good! Ubuntu is really a charming distribution of GUN/Linux . I've noticed it two months ago. The live CD instaills very easily and the "face" is beautiful . it is interesting that the X of Linux abroad is mostly Gnome while the domestic is KDE .well ,KDE looks more flamboyance for its class-style look . Gnome is simplicity comparatively. Why ? May be the people who use Linux aborad miss their Unix ,Hehe . Unix looks simplicity as well .
?Kubuntu is based on KDE ,it is the extending project of the Ubuntu ,seems less important than Dubuntu . But? frankly speaking ,Kubuntu looks more lovely ? i feel a lot about the importance of English these days.The foreign corporations and the top domestic companies ask for excellent skill of English. i am so soory now?and i should learn my English well .
? last weekend , we talked ablout if time back up for four years ,what we would do in the future 4 years .it is the very topic .some guy said he would find a girl firend ,while the other said he would not touch the on-line game . for me ,i said i would keep away from the C++ and devote myself to learing English?.and i said i had wasted a lot time on?some courses .
? most of us?will regret something in the past four years . we can not catch the gone time?.but i can try my best to?make good use?time nowaday .
?
? 華為筆試題：計算字符串“010111001100....”中‘0’和‘1’連續(xù)出現(xiàn)的次數(shù)。

#include<iostream>;

void main() {

???char *charArray="01000111100011100111100001";
???int max[2]?? ?={0,0};
???int count[2]? ={0,0};

? while(*charArray){
??????
? int?? index???? =*charArray-'0';

? count[index]++;
??count[index^1] =0;

? if(count[index]>max[index])
?????? ?max[index]=count[index];

? charArray++;
? }
?
?std:cout<<"Max times of 0 is"<<max[0]<<std:endl;
?std:cout<<"Max times of 1 is"<<max[1]<<std:endl;
}
//~:end the codes

程序代碼的藝術(shù)化，呵呵