-
-
0水一下
-
3身为吧主,竟然这么多天都没有签过到了。。。哀呼,呜呼,。。。。。。。
-
1topcoder codeforce bestcoder 各种oj~~welcome to you all discuss in here。。。。。
-
4
-
19
-
0http://www.id666.com 在众多免费虚拟空间中算好的了~还不错哦!
-
5我居然是今天第二个签到的人~\(≥▽≤)/~
-
2
-
6人在那里
-
0这些错误看不懂啊 #include <stdio.h> #include <string.h> int main() { void sort(char *name[], int n); void print(char *name[], int n); char *name[]={"Follow me","BASIC","Great Wall","FORTRAN","Comouter design"}; int n=5; sort(name , n); print (name, n); return 0; } void sort(char *name[], int n){ char *temp; int i,j,k; for(i=0; i<n-1; i++){ k=i; for(j=i+1; j<n; j++) if(strcmp(name[k], name[j])>0) k=j; if(k!=i){ temp=name[i]; name[i]=name[k]; name[k]=temp; } } } void print(char *name[], int n){ int i; for(i=0; i<n; i++) printf("%s\n",name[i]); }
-
1c++: int year=(5730*log(810/d*w)/log(2.0)); c: year=(int)(5730*(log(810/d*w)/log(2.0)));
-
5花儿为谁娇艳? 骄阳为谁灿烂? 疾雨为谁倾泄? 人儿为谁难眠? 有花的季节,勿忘花的馨香; 有光的日子,勿忘光的绵长; 有雨的天气,勿忘雨的恩情; 有人思念的时候,勿忘思念的悠长—— 祝: 暑假愉快!
-
0#include <stdio.h> #include <string.h> #define N 100000 char s[N]; void high_add(char s1[], char s2[]) { int a[N],b[N],count; int i,n,l1,l2,g,max,temp,times=1; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); l1=strlen(s1); l2=strlen(s2); for(i=l1-1,g=N-1; i>=0; i--) a[g--]=s1[i]-'0'; for(i=l2-1,g=N-1; i>=0; i--) b[g--]=s2[i]-'0'; if(l1>l2) max=l1; else max=l2; for(i=N-1; i>=N-max; i--){ a[i] += b[i]; if(a[i]>9){ a[i] -= 10; a[i-1]++; } } if(a[N-max-1]!=0) temp=1; else temp=0; for(i=N-max-temp,count=0; i<N; i++){ s[count++]=a[i]+48; } } int main() { int n; char ch1[N
-
4卤煮第一枚抄来的线段树 ,就这么挂在了poj 3246上。。。吧主求改错。。。 #include <iostream> #include <cstdio> using namespace std; const int INF = 0xffffff0; int maxV = -INF; int minV = INF; struct Node // 节点 { int L, R; int maxV, minV; int Mid() { return (L + R) / 2; } }; struct Node tree[1000010]; //4 * n void BuildTree(int root, int L, int R) // 建树 { tree[root].L = L; tree[root].R = R; tree[root].maxV = -INF; tree[root].minV = INF; if(L != R) { BuildTree(2 * root + 1, L, (L + R) / 2); BuildTree(2 * root + 2, (L + R) / 2 + 1, R); } } void inser
-
0Until the second half of the 20th century, determining the actual age of an archaeological find had been more or less a matter of educated guessing. Comparing finds to previous, already dated, ones and evaluation of the surroundings of a find were the best available techniques. But nowadays, there is a much more reliable method: carbon dating. Carbon dating works as follows: Naturally occurring carbon is a mixture of stable isotope (mostly 12C) and the unstable, radioactive, isotope 14C. The ratio between the two is almost constant in living organisms: 14C slowly decays, but at the same time,
-
2
-
0Inversion Time Limit: 2 Seconds Memory Limit: 65536 KB Let { A1,A2,...,An } be a permutation of the set{ 1,2,..., n}. If i < j and Ai > Aj then the pair (Ai,Aj) is called an "inversion" of the permutation. For example, the permutation {3, 1, 4, 2} has three inversions: (3,1), (3,2) and (4,2). The inversion table B1,B2,...,Bn of the permutation { A1,A2,...,An } is obtained by letting Bj be the number of elements to the left of j that are greater than j. (In other words, Bj is the number of inversions whose second component is j.) For example, the permutation: { 5,9,1,8,2,6,4,7,3 } has the
-
1该怎么就怎么样吧
-
1http://www.hongsuda.com 在此交流手机、电脑等等问题 欢迎注册会员~,~
-
2http://pan.baidu.com/s/1nt9KpAh 祝大家早日吃到苹果 !!
-
1http://yun.baidu.com/s/1o6NVk86 http://pan.baidu.com/s/1dDsz0AH 条鱼精心制作,非卖品!!
-
9经过两天的奔波,昨天终于成功到家话说家里太凉爽了,我真想大声喊一声,郑州我受够你了!!大家都到家了么?家乡的景色美不美?快晒一晒吧!
-
0http://pan.baidu.com/s/1sjLNwAD 没用的话请私信我
-
0在学校看到一对双胞胎兄弟打架, 然后两个人被同学拉开。 可是两人还不解气,继续对骂。 忽然兄弟二人其中一个骂另一个: 瞅瞅你长那B样!。。。。。。。 然后全场都安静了。。。。。。。。
-
14
-
0http://icpc.baylor.edu/scoreboard/
-
2加群交流折腾电脑系统经验
-
0如果您有美图 如果您有笑点 请私信发我投稿 更多精彩 尽在邪恶的条鱼吧!!!
-
20
-
7
-
4小A:这是我的号,想我了可以随便打哦 小B:你的号怎么这么长啊?联通还是移动? 小A:建行的。。。。
-
5有意者快去申请吧!!~,~
-
5条鱼君,,我是第33个
-
2女朋友有点神经质,总爱提一些莫名其妙的要求。今天,她突然抱住我的胳膊撒娇:老公,摔我!摔我嘛!我十分震惊,可看到她期待的眼神,还是狠下心一把抱住她来了一个过肩摔,没想到她站起来对着我就是一耳光:混蛋!老娘让你说!爱!我!#你唆,你唆,你还爱不爱我!!#
-
2刚远远隐约看到个人好帅。 走近一看。 啊他妈的原来是镜子。 我立马把镜子砸碎了。 擦这么帅的人都有, 看到我都自卑了。 。。。。。。
-
0苹果已成功!! 教程暑期和windows还有linux同时发布
-
9小学四年级,我引以为傲的语文破天荒考了87分,我趴在桌上狂哭。 坐在我后面拉了我四年辫子的男生吓了一跳,偷拿了我的试卷去找老师,说我成绩好,不可能考得比他还差。 老师拿着我的试卷,发现真的算错了十分。 当后桌把那张划掉87改为77的试卷递给我时,我实在忍不住,又嚎啕大哭起来。