whi 第19页

栈的简单应用（模拟出栈进栈）

while(scanf("%d",&N)==1&&N){ stacks; for(inti=1;i>num[i]; } intk=1; for(inti=1;i<=N;i++){ s.push(i); whi

liujian20150808·2016-02-27 12:00

UVA 714(p244)----Copying Books

typedeflonglongLL; intv[maxn]; LLsum,maxx; LLn,m,a[maxn],l,r,mid; intcheck(LLlimit) { inti=0,num=1; LLsum=0; whi

wang2147483647·2016-02-25 23:00

iOS之通过事件传递机制获取视图的控制器

nextisKindOfClass:[UIViewControllerclass]]) { return(UIViewController*)next; } next=[nextnextResponder]; }whi

LVXIANGAN·2016-02-25 10:00

The 5th Zhejiang Provincial Collegiate Programming Contest---ProblemF：Faster, Higher, Stronger

#include #include usingnamespacestd; intmain(){ intt,i; strings; intn,a[10001]; cin>>t; whi

April_AA·2016-02-20 11:00

HDU2084 数塔【DP问题】

右子节点的大小进行递推；最终从顶端开始向下搜索就行了；#include usingnamespacestd; intdp[500][500]; intmain() { intt,i,j; cin>>t; whi

qq_33638791·2016-02-19 23:00

ZOJ2836-Number Puzzle-容斥原理

include #include #include usingnamespacestd; intN,M,save[100]; longlongans; intmain() { whi

Helica·2016-02-17 23:00

HDU - 2289 CUP

doubler1,r2,hc,vw; scanf("%lf%lf%lf%lf",&r1,&r2,&hc,&vw); doubleleft=0; doubleright=hc; doublemid; whi

qq_32995183·2016-02-16 20:00

[python]创建文本文件，并读取

\n" whi

sophia194910·2016-02-16 10:30

循环语句等

varbox=10; whi

呜里熊·2016-02-15 20:00

[C++]函数

2//用const才能直接用字符串字面值来调用函数 intfind_char(conststring&s,charcheck){ inti=0; whi

stary_yan·2016-02-12 20:00

JAVA之for

、进行循环条件的判断，如果条件为true，则执行循环体内代码；如果为false，则直接退出循环、执行循环变量变化部分，改变循环变量的值，以便进行下一次条件判断、依次重新执行、、，直到退出循环特点：相比whi

微笑人生笑笑笑·2016-01-31 13:00

s12-day04-work01 简单计算器功能实现

5E-mail:[email protected] 6''' 7 8importtime,sys 9importmodule 10 11if__name__=="__main__": 12whi

南非波波·2016-01-29 10:00

ZOJ 1586

structedge{ ints,e,w; }; edgee[200009]; intp[10009],cost[10009]; boolcmp(edgea,edgeb){returna.w>m; whi

Dextrad_ihacker·2016-01-25 21:00

Python编程中对文件和存储器的读写示例

#创建一个文件，并且写入字符f=file('test_file.txt','w')f.write(s)f.close()#读取文件，逐行打印f=file('test_file.txt')whi

lixiang0522·2016-01-25 15:11

验证码

imagecolorallocate($img,0x00,0xFF,0x00);$white=imagecolorallocate($img,0xFF,0xFF,0xFF);imagefill($img,0,0,$whi

刀冲·2016-01-24 22:00

3390: [Usaco2004 Dec]Bad Cowtractors牛的报复最大生成树

m,tot,ans; structnode{intx,y,z;}e[20005]; intf[1005]; inlineintread() { inta=0,f=1;charc=getchar(); whi

Phenix_2015·2016-01-12 21:00

hadoop 2.6.0 LightWeightGSet源代码分析

/** *Alowmemoryfootprint{@linkGSet}implementation, *whi

houzhizhen·2016-01-12 18:00

第1章第2节练习题11 就地逆置单链表

如下图所示：算法描述1voidRverList(LNode*head){ LNode*p=head->next; LNode*q=p->next; head->next=NULL; whi

u013595419·2016-01-12 15:00

迭代器

操作返回一个迭代器， //begin()操作返回一个迭代器指向向量中的第一个数据元素， vector::iteratoriter=v.begin(); vector::iteratorend=v.end(); whi

qq_31248551·2016-01-12 10:00

BZOJ 2600: [Ioi2011]ricehub|暴力|中位数

include #include #defineT111111 #definelllonglong usingnamespacestd; llsc() { lli=0;charc=getchar(); whi

ws_yzy·2016-01-10 19:00

python IO多路复用之select

socket服务端的代码：import socketip_port = ('127.0.0.1',9999)sk = socket.socket()sk.bind(ip_port)sk.listen(5)whi

hellowgw·2016-01-08 15:53

5-15 计算圆周率

：3.132157解答程序：#include #include usingnamespacestd; intmain() { doublep,t=1,sum=1; inti=1,n; cin>>p; whi

Gao__Xiong·2016-01-05 21:00

九度OJ 1361(反转) 1362(循环移位) 1363(判断) 1364(01背包) 1365(BFS)

include #defineM50000 intmain(void) { intn,i,j,m,k; chars[M+1]; while(gets(s)) { n=strlen(s); i=n; whi

thudaliangrx·2016-01-03 00:00

无向图的存储以及广度优先搜索.

#include #include #include namespace{ enum Color{ whi

SHIHUAMarryMe·2016-01-01 22:00

递归下降分析法--算数语法分析

voidscaner();voidmain(){charch;inti=0;printf("请输入需要分析的curr语法：(以#结束)\n");do{scanf("%c",&ch);LL1[i]=ch;i++;}whi

13陈楷淇·2015-12-30 16:00

C - Ping pong hdu2492

ints[maxx];intl[maxx];//表示左边比他小的个数和比他大的个数 intlowbit(inttemp) { returntemp&(-temp); } voidadd(intx) { whi

qq_31237061·2015-12-23 23:00

leetcode -- Count Complete Tree Nodes -- 重点。BFS

algorithms/leetcode-222-complete-tree-nodesclassSolution(object): defgetLeftDepth(self,root,level): level=0 whi

xyqzki·2015-12-18 23:00

第十四周项目1-验证折半查找算法（1）

usingnamespacestd; intmain() { intlow=0,high,n; inta[100]; inti=0,f; cout>n) { cin>>f; high=n-1; whi

WangYangW·2015-12-18 08:00

VC++实现双屏显示同一内容

基于以上需求，开发了如下代码：DWORDWINAPIThreadFunc(HANDLEThread){ whi

phmatthaus·2015-12-14 09:00

python读取视频显示视频和保存视频文件

importnumpyasnpimportcv2cap=cv2.VideoCapture(0)whi

qq_18343569·2015-12-12 15:31

c-简单的计算器

defineMAXN100 #defineMOD1000 chara[MAXN]; intmain(intargc,char*argv[]) { inti,j; doublefin,fina=0,finb=0; whi

kallyshall·2015-12-03 23:00

字符串函数汇总

1.1数组int my_strlen(char s[]) { int i = 0; whi

Sekai_Z·2015-11-30 23:37

bzoj1069[SCOI2007]最大土地面积

include #include #include #defineLLlonglong #definefo(i,a,b)for(inti=a;i'9'){if(s=='-')f=-1;s=getchar();} whi

BPM136·2015-11-30 21:00

The G1 Garbage Collector

targetedformulti-processormachineswithlargememories.Itmeetsgarbagecollection(GC)pausetimegoalswithahighprobability,whi

鑫鑫哥哥呀·2015-11-19 19:00

两个栈实现一个队列

returns1.empty()&&s2.empty(); } voidput(constT&e) { s1.push(e); } Tremove() {//未考虑为空的情况 if(s2.empty()) { whi

itismelzp·2015-11-18 22:00

《拓扑排序》hdu acm 5.2.4 c++优先队列邻接表

typedefstructh{intindegree; v*next;}H; Hteam[10010]; V*p;intmain(){inti,n,m,a,b,cnt; priority_queue,greater>q;whi

a709743744·2015-11-16 01:00

OpenCASCADE Quaternion

The idea for quaternions occurred to him whi

·2015-11-13 22:17

Merge Two Sorted Lists

ListNode *l2) { ListNode *helper=new ListNode(0); ListNode *head=helper; whi

·2015-11-13 15:30

输入输出外挂

T> inline void scan_d(T &ret) { char c; ret=0; while((c=getchar())<'0'||c>'9'); whi

·2015-11-13 12:37

HDU1257

2 const int maxn = 200005; 3 int a[ maxn ],vis[ maxn ]; 4 int main(){ 5 int n; 6 whi

·2015-11-13 05:42

hdu Big Number

namespace std; 5 6 int main() 7 { 8 int t,n; 9 scanf("%d",&t); 10 whi

·2015-11-13 03:06

反转索引

key index, compared to a standard index, reverses the bytes of each column indexed (except the rowid) whi

·2015-11-13 03:53

彻底搞懂反转索引

key index, compared to a standard index, reverses the bytes of each column indexed (except the rowid) whi

·2015-11-13 03:52

vc 10进制与2 8 16进制相互转换

s2[100]; //存2进制 char s8[100];//存8进制 char s10[100];//存10进制 char s16[100];//存16进制 whi

·2015-11-12 22:07

HDU 2317 Nasty Hacks

#include <stdio.h> int main() { int n,r,e,c,f; scanf("%d",&n); whi

·2015-11-12 21:41

清空目录

*",DirName); BOOL IsFinded=(BOOL)tempFind.FindFile(tempFileFind); whi

·2015-11-12 21:42

HDU 2178 猜数字

cstdio> #include <cmath> int main() { int t; scanf("%d",&t); whi

·2015-11-12 20:20

异常： NAMESPACE_ERR: An attempt is made to create or change an object in a way whi

异常：NAMESPACE_ERR: An attempt is made to create or change an object in a way whi---- 这是我自己写客户端调用webservice

·2015-11-12 19:35

css之自动换行

)元素拥有默认的white-space:normal,当定义的宽度之后自动换行html<div id="wrap">正常文字的换行(亚洲文字和非亚洲文字)元素拥有默认的whi

·2015-11-12 18:21

SPOJ COT3 Combat on a tree（Trie树、线段树的合并）

They take turns to do the following operation:Choose a whi

·2015-11-12 17:40

推荐频道

whi