码迷,mamicode.com
首页 >  
搜索关键字:other    ( 5856个结果
codeforces Towers 题解
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the...
分类:其他好文   时间:2014-07-22 23:01:53    阅读次数:323
hdu 1242:Rescue(BFS广搜 + 优先队列)
RescueTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 14Accepted Submission(s) : 7Font:Times New Ro...
分类:其他好文   时间:2014-07-22 23:00:35    阅读次数:247
百度之星题--斐波拉契数列
题目:du熊学斐波那契ITime Limit : 2000/1000ms (C/Other) Memory Limit : 65535/32768K (C/Other)本次组委会推荐使用C、C++Problem Descriptiondu熊对数学一直都非常感兴趣。最近在学习斐波那契数列的它,向你展示...
分类:其他好文   时间:2014-07-22 23:00:33    阅读次数:226
google mapsDemo示例运行
①申请API KEY②SelectFile>Import>Android>Existing Android Code Into Workspaceand clickNext.导入google-play-services_lib③SelectFile>New>Other>Android Sample ...
分类:其他好文   时间:2014-05-05 23:05:06    阅读次数:344
高德地图AmapSDKDemo运行
①file/new/other/androd Application Poject,选择SDKDemo,复制到workspace②申请amap的key,名字在res/values/strings/的demo_title:为AMapsD Demo③run-as可以在模拟器里也可以在手机上。
分类:其他好文   时间:2014-05-05 21:48:01    阅读次数:257
[ACM] hdu 1029 Ignatius and the Princess IV (动归或hash)
Ignatius and the Princess IV Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32767K (Java/Other) Total Submission(s) : 7   Accepted Submission(s) : 3 Font: Times New Roman | Verdana | ...
分类:其他好文   时间:2014-05-05 13:01:52    阅读次数:325
Cocos2d-x3.0 Json解析
2dx3.0下JSON解析库官方已经集成好了,我们引用就OK。 JSON文件hello.json内容 {"pets":["dog","cat"],"stuInfo":{"stuAge":"23","stuName":"zhangsan","birthday":"1990-01-12"},"username":"tomsfff","other":[true,30]} .h头文件...
分类:Web程序   时间:2014-05-03 21:34:48    阅读次数:319
[ACM] hdu 1087 Super Jumping! Jumping! Jumping! (动态规划)
Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 6   Accepted Submission(s) : 5 Font: Times New Roman | Verdan...
分类:其他好文   时间:2014-05-03 16:47:07    阅读次数:262
codeforces A. Shaass and Oskols 题解
Shaass has decided to hunt some birds. There are n horizontal electricity wires aligned parallel to each other. Wires are numbered 1 to n from top to bottom. On each wire there are some oskols sitti...
分类:其他好文   时间:2014-05-02 20:48:26    阅读次数:462
std::max 错误
Today I typed the following:intt=(std::max)(timeout,lagtime);Why did I put parentheses around std::max? Because windows.h defines (among other things)...
分类:其他好文   时间:2014-05-01 05:26:13    阅读次数:383
5856条   上一页 1 ... 583 584 585 586 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!