摘要:
--select select * from student; --all 查询所有 select all sex from student; --distinct 过滤重复 select distinct sex from student; --count 统计 select count(*) f... 阅读全文
摘要:
TourTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 2462Accepted Submission(s): 1222 Problem Desc... 阅读全文
摘要:
#include /********************************* * 方法1: 第一维的长度可以不指定 * * 但必须指定第二维的长度 * *********************************/ void print_a(int a[][5], int n, i... 阅读全文
摘要:
Battle shipsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1007Accepted Submission(s): 353 Probl... 阅读全文
摘要:
棋盘游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3358 Accepted Submission(s): 1989 Problem De... 阅读全文
摘要:
Girls' research Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1160 Accepted Submission(s): 448 阅读全文
摘要:
CodeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 597Accepted Submission(s): 230 Problem Descri... 阅读全文
摘要:
http://www.cnblogs.com/AOQNRMGYXLMV/p/4065628.html一、莫比乌斯(Möbius)函数 对于每个正整数n(n ≥ 2),设它的质因数分解式为: 根据这个式子定义n的莫比乌斯函数为: 也就是如果n有平方因子,则为0. 否则是-1的质因数个数次... 阅读全文
摘要:
今天,上数据库课,偶然想着可以用hash表的思想去查询,那样肯定很快,回来敲了敲,发现结果竟然和自己预想的不符;很疑惑; 然后改了下,不用string了,就对了。。。 代码贴上: 代码: 人之初,性本善,性相近,习相远。苟不教,性乃迁,教之道,贵以专。 昔孟母,择邻处,子不学,断机杼。窦燕山,有义方 阅读全文
摘要:
11427 - Expect the ExpectedSome mathematical background. This problem asks you to compute the expected value of a randomvariable. If you haven’t seen ... 阅读全文