static List nums = new List(); public static bool IsHappy(int n) { int newint = 0; while (n != 0) { ...
分类：
移动开发 时间：
2015-08-07 19:26:45
阅读次数：
899
Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbe...
分类：
其他好文 时间：
2015-08-07 19:25:02
阅读次数：
111
欢迎参加——每周六晚的BestCoder（有米！）Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15007Acce...
分类：
其他好文 时间：
2015-08-07 19:19:15
阅读次数：
124
/** This demo shows how to use semaphore between threads.**/#include #include #include #include #include /** Global var*/int number;sem_t sem_id;void*...
分类：
系统相关 时间：
2015-08-07 19:08:45
阅读次数：
144
Given acompletebinary tree, count the number of nodes.Definition of a complete binary tree fromWikipedia:In a complete binary tree every level, except...
分类：
其他好文 时间：
2015-08-07 19:00:01
阅读次数：
139
题意：
在a串中寻找第一个包含b串的的位置
思路：直接KMP即可
#include
#define MAXN 1000010
using namespace std;
void kmp_pre(int x[],int m,int next[]){
int i,j;
j=next[0]=-1;
i=0;
while(i<m){
while(-...
分类：
其他好文 时间：
2015-08-07 16:17:55
阅读次数：
129
select * from dbo.orders group by custid with cube select custid ,row_number() over(order by empid) as number from orders select count(*) from order.....
分类：
数据库 时间：
2015-08-07 15:58:12
阅读次数：
151
hdu 5363 的传送门Problem Descriptionsoda has a set S with n integers {1,2,…,n}. A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subsets of S...
分类：
其他好文 时间：
2015-08-07 14:51:56
阅读次数：
163
hdu 5349 的传送门Problem DescriptionA simple problem
Problem Description
You have a multiple set,and now there are three kinds of operations:
1 x : add number x to set
2 : delete the minimum number (if...
分类：
其他好文 时间：
2015-08-07 14:46:55
阅读次数：
134
Problem Description
soda has a set S with n integers {1,2,…,n}.
A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subsets of S are
...
分类：
其他好文 时间：
2015-08-07 13:27:28
阅读次数：
109
