本月博客排行
-
第1名
wy_19921005 -
第2名
mft8899 -
第3名
benladeng5225 - duanfei
- Anmin
- wddpwzzhao123
年度博客排行
-
第1名
龙儿筝 -
第2名
宏天软件 -
第3名
wy_19921005 - benladeng5225
- vipbooks
- kaizi1992
- tanling8334
- sam123456gz
- arpenker
- zysnba
- fantaxy025025
- xiangjie88
- wallimn
- e_e
- jh108020
- ganxueyun
- Xeden
- xyuma
- wangchen.ily
- zhanjia
- johnsmith9th
- zxq_2017
- forestqqqq
- jbosscn
- daizj
- xpenxpen
- 青否云后端云
- 喧嚣求静
- kingwell.leng
- lchb139128
- kristy_yy
- javashop
- lzyfn123
- sunj
- yeluowuhen
- ajinn
- lerf
- lemonhandsome
- chenqisdfx
- xiaoxinye
- lyndon.lin
- flashsing123
- bosschen
- zhangjijun
- sunnylocus
- lyj86
- paulwong
- sgqt
- hudiemeng870329
- mft8899
最新文章列表
Question 2a String Containing
After reading the suggested solutions of the problem , there is a very interesting solution: use a different prime number to indicate a different alphabet, go through the first string, multiply all th ...
Output the k-th Prime Number
问题:输出第k个素数(1<=k<=10000)。
时间要求:必须在50ms内完成计算。
实现代码:
#define MAX 105000
unsigned long r[MAX],p[10000],n,t;
int main(){
int i,j,k,m;
for(i=0;i<MAX;++i) r[i]=i;
for(i=0;i<MAX;++i) ...