码迷,mamicode.com
首页 >  
搜索关键字:floating point    ( 7266个结果
Codeforces Round #195 (Div. 2) A. Vasily the Bear and Triangle
水题,注意数据范围即可#include #include #include using namespace std;typedef pair Point;int main(){ int x,y; cin >> x >>y; Point a,b; if((x>0 && y > ...
分类:其他好文   时间:2014-06-16 10:47:47    阅读次数:226
iOS8 NotificationCenter Extension 简介
在最新的WWDC14上面,苹果发布了iOS8的一些新特性,而其中最让程序员兴奋的特性莫过于Extension,或者称之为Widget。下面就来尝鲜试验一把。一、Extension简介首先,苹果只支持下面这种类型的Extension Point,也不支持第三方应用自己设置Extension Point...
分类:移动开发   时间:2014-06-16 00:35:22    阅读次数:392
【Leetcode】Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the...
分类:其他好文   时间:2014-06-15 19:28:54    阅读次数:246
窗体或控件的两种拖动方式
第一种音量调节的示例#region 音量控制 private Point mouse_offset; private void pictureBox7_MouseDown(object sender, MouseEventArgs e) { ...
分类:Windows程序   时间:2014-06-13 06:56:03    阅读次数:384
RMAN Table Point In Time Recovery (PITR) in PDBs
1.首先使用RMAN做一次备份(必需有次备份) rman target / backup database; or backup database root; backup pluggable database pdb; 2.在pdb中创建test用户并授权 sqlplus / as sysdba alter session set container=pdb; cr...
分类:数据库   时间:2014-06-11 00:37:06    阅读次数:403
[leetcode]Container With Most Water @ Python
原题地址:https://oj.leetcode.com/problems/container-with-most-water/题意:Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordina...
分类:编程语言   时间:2014-06-10 20:05:44    阅读次数:213
Unique Paths
题目 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying t...
分类:其他好文   时间:2014-06-10 18:43:37    阅读次数:254
TOMCAT启动提示NB: JAVA_HOME should point to a JDK not a JRE解决
本人使用的Tomcat版本为apache-tomcat-6.0.18(用的是解压包),解压路径为E:\apache-tomcat-6.0.18\apache-tomcat-6.0.18\,我如果部署在myEclipse里启动可以正常启动,当然也可以访问我的工程,但是如果我直接在tomcat源文件b....
分类:编程语言   时间:2014-06-10 08:32:35    阅读次数:264
codeforces Round #252 (Div. 2) C - Valera and Tubes
贪心算法,每条路径最短2格,故前k-1步每次走2格,最后一步全走完由于数据比较小,可以先打表#include #include #include #include using namespace std;typedef pair Point;int main(){ int n, m, k, f...
分类:其他好文   时间:2014-06-10 00:33:15    阅读次数:302
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!