-
-
59
-
0想找个没人的吧记录
-
0经核实吧主LHDGRIVER 未通过普通吧主考核。违反《百度贴吧吧主制度》第八章规定http://tieba.baidu.com/tb/system.html#cnt08 ，无法在建设 sine吧 内容上、言论导向上发挥应有的模范带头作用。故撤销其吧主管理权限。百度贴吧管理组
-
2var a:array[1..10000] of integer; n,t1,t2,i,j,total:integer; begin read(n);total:=0;i:=2*n; repeat if i<=n then i:=2*i
-
0
-
2= =
-
2var a:array[1..100,1..2] of integer; i,n,maxtotal,max,k,j,l,maxh1,maxh2,c:integer; function fly(x:integer):integer; begin fo
-
0数学 英文缩写 sin 直角三角形英文全称 sine 中文解释 正弦 正弦函数，即△ABC中，∠C=90°，AB为斜边c，AC为直角边b，BC为另一个直角边a，则sin∠A=
-
0楦舑掖氢妙簚蒯擹涎瓩絽蘒昼滱癌绡蝵柀漓瞰
-
0话说 爆吧贴丫也要点进来？ 智商拙计~~~~ 豪叔 和你没关系 嗯 ...
-
0没意见的无视 有意见的保留 择禼脗抛欰珄籙莲枬漇瞛耰螋桠灪磿聚蒙橳燎
-
0葩溆矊缤螹栄炘礭肈戌楧烬窐臫捰櫊獟窥荎擓
-
1wjWm
7-26
-
2var totv,totg,n:integer; value,v,g:array[0..380] of integer; f:array[0..380,0..380] of longint; procedure init; var i:integer; be
-
0test
-
0= =282是天道~必须的~不解释
-
2你还记得吗？我们初次相会的那一天 不过三言两语 你就为我想好了名字 无论今后与你分隔多么遥远 我都会记得 是你给予了我名字…… 因为天空连
-
0
-
20var f:array[-1..9,-1..9]of 0..1; s:array[0..10]of integer; visited:array[0..9]of boolean; procedure inputof; var i,j:integer; beg
-
1var a:array[1..100]of string; i,j,n,k,t:longint; temp:string; begin assign(input,'max.in');reset(input); assign(output,'max.out');r
-
1var a:array[0..26,0..26] of integer; i,j,n:integer; find:boolean; procedure visit(i1,j1:integer); begin if find then exit; a[
-
0var a:array[1..9,1..9]of string; b:array[1..9]of longint; c:array['A'..'Z']of longint; i,j,m,n,t:longint; temp:char; function che
-
0var a:string; error,l:longint; t:array[1..1000]of longint; procedure check(b,e:longint); var i,j,k:longint; begin for i:=b to e do
-
0var i,j,k,m,n,t,t1,z:longint; a:array[1..20,1..20] of integer; c:array[1..20,1..20] of boolean; begin yl:=0;yr:=0; k:=1;max:=0;z:=0
-
0var a:array[1..100] of integer; i,n,pingjun:integer; total:longint; begin fillchar(a,sizeof(a),0); read(n);total:=0; for i:
-
0var a:array[1..20] of longint; n,k,i,totalall:integer; function sushu(x:longint):boolean; var i1:longint; begin for i1:=trunc
-
0var a:array[1..20,1..2] of integer; b:array[1..20] of integer; max,i,j,n,total,t,min,key:integer; begin fillchar(a,sizeof(a),0)
-
0var a,b:array[1..10000] of longint; i,i1,j1,key,k,n,head,tail:longint; total:longint; procedure quicksort(start,final:integer)
-
0var a:array[1..100] of int64; b:array[1..100] of 0..9; t1,i,cha,c:longint; d,t,f:integer; begin fillchar(a,sizeof(a),0); f
-
0const dist:array[1..4,1..2] of integer=((0,1),(-1,0),(0,-1),(1,0)); type art=array[1..3,1..3] of byte; var a:array[1..10000] of ar
-
0var maxyes,maxno,minyes,minno:longint; t:char; procedure fly; var maxyesnow1,maxyesnow2,maxnonow1,maxnonow2,minyesnow1,minyesnow2
-
0var maxyes,maxno,minyes,minno:longint; t:char; procedure fly; var maxyesnow1,maxyesnow2,maxnonow1,maxnonow2,minyesnow1,minyesnow2
-
0var a:array[1..500000,1..2] of longint; t:char; t1,t2,t3,t4,i:longint; function f1(m,j:longint):longint; var temp1,temp2:longin
-
0var i,j,n,min,temp,minj:integer; map:array[1..100,1..100] of integer; dist:array[1..100] of integer; used:array[1..100] of boolean;
-
0var i,j,k,n,s,m:longint; a:array[1..1000] of longint; begin read(n); for i:=1 to n do read(a[i]); for i:=1 to n-1 do for j:=i+1
-
1var a:array[1..100] of integer; num:array[1..20] of integer; m,k,i,j:integer; begin fillchar(a,sizeof(a),0); read(m,k); f
-
0var a:array[1..100] of integer; w,amount:array[1..20] of integer; i,j,k1,k,m,min:integer; begin read(m,k1);a[0]:=0; for i:=1
-
0var t，i，m，n：longint； begin readln(m，n)； write((3*m*m*n-m*m*m+3*m*n+m) div 6，' ')； writeln((3*m*m*n*n-3*m*m*n
-
0var dist,cost:array[1..100,1..100] of integer; path:array[1..100] of integer; i,j,n,total,maxint:integer; f:boolean; begin fill
-
0program a; var num,k:integer; procedure tnentok(num,k:integer); var dig:integer; begin dig:=num mod k; num:=num div k; if num
-
0const inf='sequence.in'; ouf='sequence.out'; var n,m,i,j,t,tem,tail,posi,tot,c:integer; a,arrins:array[1..10000] of longint; zf:c
-
0const inf='e:\zb\sequence.in'; ouf='e:\zb\sequence.out'; var n,m,i,t,tem,tail,posi,tot,c:integer; a,arrins:array[1..1000] of intege
-
0var total:longint; n,k:integer; procedure fen(deep ,rest,pri:integer); var i:integer; begin for i:=pri to rest div (k-deep+1) do
-
0for i:=1 to n do begin read(x); while x<>' ' do begin name[i]:=name[i]+x; read(x); end; read(a[i],b[i]); read(kong,c
-
01.用数组实现 普通方法（删除加标记） #include #define maxn 100 main() {int a[maxn+1]; int m,n,k,l,t; scanf("%d%d",&m,&n); for (t
