码迷,mamicode.com
首页 >  
搜索关键字:seleniu grid    ( 4227个结果
HDU4925:Apple Tree
Problem Description I’ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant an apple tree to get one...
分类:移动开发   时间:2014-08-08 16:13:06    阅读次数:281
Automation 的 ReportFlow
ReportFlow:// click the Grid icon and switch to grid pagepublic void changeToGrid()// click the Add/Locate icon in the grid page/or in the controller,...
分类:其他好文   时间:2014-08-08 12:32:45    阅读次数:260
组件属性流化注意事项
组件的属性流化是按照属性的声明顺序进行的,当加载窗体时会按流化顺序依次初始化属性值。要注意的是有些属性相互影响,比如 Grid 组件行/列数目和固定行/列数目两个属性存在制约关系。使用在存储和载入时都应该先进行行/列属性值的读写,再对固定行/列属性值进行读写。比如行存储是10行固定行存储是6行,而初...
分类:其他好文   时间:2014-08-08 01:38:14    阅读次数:296
HDU 4925 Apple Tree
Problem Description I’ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant an apple tree to get one a...
分类:移动开发   时间:2014-08-07 18:59:10    阅读次数:293
extjs 导出excel
Extjs — Grid数据导出成Excel 最近因为项目问题,需要解决Extjs导出成Excel的问题。 下面简单描述这个问题解决的步骤如下: 1、先在js文件里写了一个button的handler事件,通过点击按钮,来实现调用ExportExcel...
分类:Web程序   时间:2014-08-07 16:00:00    阅读次数:216
Oracle Grid 11.2.0.4 安装是出现“[INS-41112] Specified network interface doesnt maintain connectivity across cluster”错误
安装Oracle 11.2.0.4 的RAC,在Grid 安装时报错:[INS-41112]Specified network interface doesnt maintain connectivity across cluster nodes首先尝试在节点间ping 各个IP 地址没有问题。因为...
分类:数据库   时间:2014-08-07 15:40:10    阅读次数:672
UVA 11605 - Lights inside a 3d Grid(概率+数学)
UVA 11605 - Lights inside a 3d Grid 题目链接 题意:给定一个NxMxP的三维网格,每个格子上一盏灯,现在每次随机选择两点,把这两点构成立方体中间那一块开关灯状态转换,问K步之后网格中亮灯的期望 思路:概率问题,把x,y,z轴分开考虑,算出每一个点xi,yi,zi分别能被选到的情况数,然后根据乘法原理相乘起来除以总情况就能算出一点的概率,然后问题...
分类:其他好文   时间:2014-08-07 00:47:37    阅读次数:179
Oracle Grid Infrastructure Installation Guide for Linux 以debug模式安装并记录日志
使用如下命令能够以debug模式安装Oracle Grid并将日志记录到文件[grid@vdb1 11ggrid]$ ./runInstaller -debug > /home/grid/oracle_grid_installer.log
分类:数据库   时间:2014-08-07 00:34:17    阅读次数:414
Minimum Path Sum
问题:从左上角到右下角的最小路径和class Solution {public: int num[300][300]; int dfs(int x,int y,vector >&grid) { if(x==grid.size()-1 && y==grid[0].siz...
分类:其他好文   时间:2014-08-06 22:22:52    阅读次数:231
HDU 2845 Beans (DP)
Problem Description Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 grid. Now you want to ...
分类:其他好文   时间:2014-08-06 01:57:00    阅读次数:248
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!