紫书例题
风中一颗松
慢慢学,慢慢看
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
八皇后问题
#include<stdio.h> #define NUM 8 int a[NUM+1]; main() { int number,i,k,flag,not_finish=1,count=0; i=1; a[1]=1; printf("The possible configuration of 8 queens are:\n"); while(n...原创 2018-03-14 19:29:55 · 302 阅读 · 0 评论 -
uva540 Team Queue
A - Team QueueQueues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lun...原创 2018-03-03 15:27:05 · 294 阅读 · 0 评论 -
B - Ugly Numbers
B - Ugly Numbers 题意丑数是指不能被2,3,5以外的其他素数整除的数。把丑数从小到大排列起来,结果如下: 1,2,3,4,5,6,8,9,10,12,15…… 求第1500个丑数输入没有输入输出The 1500'th ugly number is <number>.#include &...原创 2018-03-03 15:50:09 · 437 阅读 · 0 评论 -
HDU-1241 Oil Deposits
Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38404 Accepted Submission(s): 22274Problem Description The GeoSurvComp geologic s...原创 2018-04-01 16:50:21 · 176 阅读 · 0 评论
分享