c语言
文章平均质量分 51
长夜qingfeng
羽落尽长安,南亭风林晚
展开
-
关于动态规划问题
https://zhuanlan.zhihu.com/p/150516970原创 2021-03-10 21:16:00 · 76 阅读 · 0 评论 -
HDU 1239 Calling Extraterrestrial Intelligence Again
题目http://acm.hdu.edu.cn/showproblem.php?pid=1239Problem DescriptionA message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November 16, 1974. The message consisted o原创 2021-03-08 21:54:23 · 477 阅读 · 0 评论 -
各种排序方法汇总
还是以前老师上课总结的//经典排序算法: 冒泡、选择、插入、希尔、快排、归并#include<stdio.h>#include<stdlib.h>void swap0(int *a, int *b){ int temp = *a; *a = *b; *b = temp;}//交换数组a[]中的第i和第j个元素void swap(int *a, int i, int j){ int temp = a[i]; a[i] = a[j];原创 2021-03-08 20:24:00 · 206 阅读 · 0 评论 -
素数筛选函数
原理:任何数的整数倍必定不是素数,大于二的偶数必定不是素数。假设有一个筛子存放1~N,例如:2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 ....N先将2的倍数筛去:2 3 5 7 9 11 13 15 17 19 21....N再将3的倍数筛去:2 3 5 7 11 13 17 19....N再来将5的倍数筛去,再来将7的质数筛去,再来将11的倍数筛去........,如此进行到最后留下的数就都是质数,这就是原创 2021-03-08 20:06:26 · 270 阅读 · 0 评论 -
HDU 1016 Prime Ring Problem
题目Prime Ring Problemhduoj1016Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the number of first c原创 2021-02-25 12:29:49 · 96 阅读 · 0 评论 -
HDU 1015 Safecracker
题目hduoj1015SafecrackerProblem Description=== Op tech briefing, 2002/11/02 06:42 CST ===“The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, w原创 2021-02-24 22:38:14 · 212 阅读 · 0 评论 -
HDU 1010
题目:Tempter of the BoneProblem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap,原创 2021-02-23 22:19:26 · 110 阅读 · 1 评论 -
HDU Big Number
题目Total Submission(s) : 23 Accepted Submission(s) : 4Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are原创 2021-01-31 22:00:44 · 82 阅读 · 0 评论 -
HDU 汉诺塔V
题目Problem Description用1,2,…,n表示n个盘子,称为1号盘,2号盘,…。号数大盘子就大。经典的汉诺塔问题经常作为一个递归的经典例题存在。可能有人并不知道汉诺塔问题的典故。汉诺塔来源于印度传说的一个故事,上帝创造世界时作了三根金刚石柱子,在一根柱子上从下往上按大小顺序摞着64片黄金圆盘。上帝命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定,在小圆盘上不能放大圆盘,在三根柱子之间一回只能移动一个圆盘。我们知道最少需要移动2^64-1次.在移动过程中发现,有的圆盘移原创 2021-01-30 19:24:28 · 238 阅读 · 0 评论 -
HDU IP Address
前言没啥好说的水题一道,睡觉前做完睡的舒服些(嘿嘿)一、分析题目已经说得很清楚了,每行会输32位数,每8位算一位地址,根据1的位置定数值。没啥好说的直接代码(可能写得有点多,但是逻辑很清楚)二、代码代码如下:#include<stdio.h>#include<math.h>#include<string.h>int a,b,c,d;int math[8]={128,64,32,16,8,4,2,1};//将可能得出的数值放在数组中,不用再计算了in原创 2021-01-12 22:29:24 · 114 阅读 · 0 评论 -
HDU The 3n + 1 problem
前言一道水题,做了半天的深搜还是没搞懂,先来道水题树立信心(哭)。一、分析题意:输入两整数要你对他们之间的数进行操作:如果这个数是偶数就除二,不是就乘3加1,直到变为1,再统计这个数变到1要几步,求这个步骤的最大值。需要注意的就是输入的前一个数不一定比后一个小,然后就差不多了。二、代码代码如下:#include<iostream>#include<cstring>#include<stdio.h>using namespace std;int mai原创 2021-01-12 20:31:30 · 67 阅读 · 0 评论 -
HDU Financial Management
前言一道水题,求平均数,不知道为什么莫名其妙挂了几次,后面重写才过。1.代码代码如下(示例):#include<stdio.h>int main(){ double sum=0,a,i; for(i=0;i<12;i++) { scanf("%lf",&a); sum+=a; } printf("$%.2f\n",sum/12); return 0;}...原创 2021-01-12 10:07:38 · 62 阅读 · 0 评论