码迷,mamicode.com
首页 >  
搜索关键字:while break continue    ( 40024个结果
HTML基础教程(17)——HTML 4.01速查手册
自 W3School 的 HTML 快速参考。可以打印它,以备日常使用。HTML Basic DocumentDocument name goes hereVisible text goes hereText ElementsThis is a paragraph (line break) (hor...
分类:Web程序   时间:2014-07-19 17:20:19    阅读次数:217
php各种验证类
= $min) ? true : false;break;case 2: //只匹配最大值return ($max >= $len) ? true : false;break;default: //min = 1000 && $timeArr[0] = 0 && $dateArr[1] = 0 &&...
分类:Web程序   时间:2014-07-19 17:07:29    阅读次数:286
About custom Theme and Style
For android system, of course you can custom your own style and theme, but you can't break compatibility with AOSP.We should follow AOSP design, and d...
分类:其他好文   时间:2014-07-19 16:22:00    阅读次数:231
java多线程编程(2)交替输出数字和字母
mark一下,不停的看看notify和wait的没有理解class Printer{ int index=0; //输出奇数 public synchronized void printA(int a) { while(index%2==0) { ...
分类:编程语言   时间:2014-07-19 14:37:39    阅读次数:256
POJ - 1458 Common Subsequence
最长公共子序列求解问题。 1 #include 2 #include 3 const int maxn=1000; 4 char s1[maxn],s2[maxn]; 5 int c[maxn][maxn]; 6 int main() 7 { 8 while(scanf("%s%s",s1,...
分类:其他好文   时间:2014-07-19 14:30:43    阅读次数:223
Box Game
There are two identical boxes. One of them contains n balls, while the other box contains one ball. Alice and Bob invented a game with the boxes and b...
分类:其他好文   时间:2014-07-19 14:25:51    阅读次数:228
CSU-ACM2014暑假集训基础组训练赛(1) 解题报告
?Problem A HDU 4450 水题,签到题水题。。没啥好说的。给大家签到用的。 1 #include 2 int main(){ 3 int n,a,ans; 4 while(scanf("%d",&n),n){ 5 ans = 0; 6 ...
分类:其他好文   时间:2014-07-19 13:33:32    阅读次数:300
定时器UNIX crontab vs Quartz
Using cron seems to add another entry point into your application, while Quartz would integrate into it. So you would be forced to deal with some inter-process communication if you wanted to pass...
分类:其他好文   时间:2014-07-19 11:11:44    阅读次数:373
C++ Primer(第五版) 笔记 C01-02
C01++val;优于 val++;对数量不定的输入数据:while(cin>>value)...遇到无效的输入或eof后,cin变为无效状态,条件变为假。来自标准库的头文件用包围,不属于标准库的用""包围。文件重定向工作:exename.exe outfile点运算符:左侧运算对象是类类型的,右侧...
分类:编程语言   时间:2014-07-19 08:31:13    阅读次数:277
poj 3974 Palindrome
边吃边敲,效率就是高 代码如下: #include #include #define MAX 1000050 char s[MAX],ss[MAX*2]; int p[MAX*2]; int min(int a,int b){return a>b?b:a;} int main() { int i,id,mx,max,n,j; j=1; while(scanf("%s",s...
分类:其他好文   时间:2014-07-19 02:31:25    阅读次数:166
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!