- 博客(32)
- 资源 (2)
- 收藏
- 关注
原创 希尔排序
该方法的基本思想是:先将整个待排元素序列分割成若干个子序列(由相隔某个“增量”的元素组成的)分别进行直接插入排序,然后依次缩减增量再进行排序,待整个序列中的元素基本有序(增量足够小)时,再对全体元素进行一次直接插入排序。因为直接插入排序在元素基本有序的情况下(接近最好情况),效率是很高的,因此希尔排序在时间效率上比前两种方法有较大提高。#include #define M
2016-12-30 17:07:55 233
原创 UVA10976 Fractions Again?!
对分数进行拆分,考虑到精度问题,最好避免用除法。 #include <stdio.h>#define MAX 100char str[20005][MAX];int main(){ int k; long long x,y; while(~scanf("%d",&k)){ int count = 0; for(y = k +...
2016-12-25 11:44:29 175
原创 sprintf的用法
把一些数据写入字符串中,进行缓存。适用于一些要输出具体数字的题目且先输出数量。sprintf(str[count],"1/%d = 1/%d + 1/%d",k,x,y);
2016-12-24 21:26:40 311
原创 UVA11059 Maximum Product
暴力求解即可。 #include <stdio.h>int s[30];long long max;int main(){ int n,index = 0; while(scanf("%d",&n) != EOF){ int i,j; for(i = 0; i < n; i ++) scanf("%d",&s[...
2016-12-21 21:21:16 282
原创 UVA725 Division
题目大意为输入一个数n,用0~9组成任意的数字使其整除的结果为n,可以存在前导0。题解:直接暴力就可以,求出第一个数,使其对n取余为0,在整除n求出第二个数,把数存进a数组里面,用judge数组判断是否出现重复数字。 #include <stdio.h>#include <string.h>int a[10];int main(){ int ...
2016-12-21 13:29:34 266
原创 UVA1585 Score
水题一枚,大意为输入如题所示的字符串OOXXOXXOOO,O的得分为目前O的连续个数,X的得分为零,计算出总的得分。 #include <stdio.h>#include <string.h>#include <iostream>using namespace std;char str[100];int main(){ in...
2016-12-19 20:27:08 268
原创 UVA455 Periodic Strings
#include <iostream>#include <cstring>using namespace std;char str[104];int main(){ int n; cin>>n; while (n --) { cin>>str; int ...
2016-12-19 20:06:13 171
原创 UVA1225 Digit Counting
#include <stdio.h>#include <string.h>int main(){ int T,i,num,n,a[10]; scanf("%d",&T); while(T --){ memset(a,0,sizeof(a)); scanf("%d",&n); for(i = ...
2016-12-19 20:04:56 194
原创 UVA1586 Molar mass
#include <stdio.h>#include <string.h>#include <ctype.h>int main(){ int T; char str[85]; double sum; double m[4]={12.01,1.008,16.00,14.01}; double num[4]; ...
2016-12-19 20:02:54 225
原创 快速排序的非递归形式
快速排序的非递归形式,用栈来存储分治后的起止下标即可#include #include #include #include using namespace std;int a[100];int partition(int a[], int i, int j){ int temp = a[i]; while(i < j){ while(i = temp) j
2016-12-15 15:11:37 277
原创 51Nod1011 最大公约数GCD
输入2个正整数A,B,求A与B的最大公约数。Input2个数A,B,中间用空格隔开。(1<= A,B <= 10^9)Output输出A与B的最大公约数。Input示例30 105Output示例15 #include <stdio.h>int gcd(int a, int b){ if(...
2016-12-14 21:48:28 378
原创 ACM学习计划
ACM学习计划初期:一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. (5)构造法.(poj3295) (6)模拟法.(poj1068,poj2632,poj157
2016-12-12 22:20:37 412
原创 POJ 3414 Pots
PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15104 Accepted: 6353 Special JudgeDescriptionYou are given two pots, having the volume of A and
2016-12-10 11:11:09 306
原创 sscanf的一些用法
sscanf() - 从一个字符串中读进与指定格式相符的数据。在头文件中。常见用法:char buf[512];sscanf("123456","%s",buf);//此处buf是数组名,它的意思是将123456以%s的形式存入buf中!printf("%s\n",buf);取指定长度字符串:sscanf("123456","%4s",buf);printf("%s\n",buf
2016-12-10 11:09:04 289
原创 插入排序
1.直接插入排序每次选取待插入元素与之前排好序的元素进行比较,比其大,则插入,否则移动元素。#include #define MAX 200typedef struct{ int r[MAX]; int length;}SqList;void InitList(SqList &L){ int n; printf("please input the num of co
2016-12-06 10:54:45 294
原创 HDU2095find your present (2)
find your present (2)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22130 Accepted Submission(s): 8755Problem DescriptionIn
2016-12-05 21:06:46 179
原创 HDU2109 Fighting for HDU
Fighting for HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11181 Accepted Submission(s): 5717Problem Description在上一回,我们让
2016-12-05 20:23:10 212
原创 HDU2107 Founding of HDU
Founding of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9336 Accepted Submission(s): 6247Problem Description经过慎重的考虑,XH
2016-12-05 20:14:02 335
原创 HDU2103 Family planning
Family planningTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10142 Accepted Submission(s): 2632Problem DescriptionAs far as
2016-12-05 20:03:54 667
原创 折半查找
#include void BinarySearch(int a[], int left, int right, int num){ if(left > right){ printf("查找失败!\n"); return ; } int mid = (left + right) / 2; if(a[mid] == num){ printf("要查找的数字的位置为
2016-12-04 15:43:22 287
原创 迪杰斯特拉算法
#include #include #define MAX 20#define INFINITY 65538typedef int AdjMatrix[MAX][MAX];//存储图 typedef int PathMatrix[MAX][MAX];//记录v0到各点的最短路径 typedef int ShortPath[MAX];//辅助数组,记录最短距离 typedef str
2016-12-04 15:42:33 366
原创 HDU2050 折线分割平面
折线分割平面Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27581 Accepted Submission(s): 18735Problem Description我们看到过很多直线分割平面的题目,
2016-12-04 10:34:39 201
原创 分割问题
(1) n条直线最多分平面问题 题目大致如:n条直线,最多可以把平面分为多少个区域。 析:可能你以前就见过这题目,这充其量是一道初中的思考题。但一个类型的题目还是从简单的入手,才容易发现规律。当有n-1条直线时,平面最多被分成了f(n-1)个区域。则第n条直线要是切成的区域数最多,就必须与每条直线相交且不能有同一交点。这样就会得到n-1个交点。这些交点将第n条直线分为2条射...
2016-12-04 10:30:33 237
原创 HDU 2045 不容易系列之(3)—— LELE的RPG难题
不容易系列之(3)—— LELE的RPG难题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 48604 Accepted Submission(s): 19431Problem Description人
2016-12-04 09:53:20 173
原创 HDU2046 骨牌铺方格
骨牌铺方格Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 48176 Accepted Submission(s): 23242Problem Description在2×n的一个长方形方格中,用一个1
2016-12-03 21:52:13 270
原创 HDU2047 阿牛的EOF牛肉串
阿牛的EOF牛肉串Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32803 Accepted Submission(s): 15431Problem Description今年的ACM暑期集训队一共有
2016-12-03 21:26:13 305
原创 HDU2078 复习时间
复习时间Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7539 Accepted Submission(s): 5535Problem Description为了能过个好年,xhd开始复习了,于是每天
2016-12-03 15:41:21 268
原创 HDU 2076 夹角有多大(题目已修改,注意读题)
夹角有多大(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14720 Accepted Submission(s): 5786Problem Description时间过的好快,
2016-12-03 11:58:59 180
原创 HDU2058 The sum problem
The sum problemTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23723 Accepted Submission(s): 7052Problem DescriptionGiven a s
2016-12-03 11:12:18 224
原创 HDU2052 Picture
PictureTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27028 Accepted Submission(s): 13642Problem DescriptionGive you the wid
2016-12-03 10:00:22 311
原创 HDU 2054 A == B ?
A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 96648 Accepted Submission(s): 15372Problem DescriptionGive you two nu
2016-12-03 09:43:55 192
原创 HDU2068 RPG的错排
RPG的错排Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11701 Accepted Submission(s): 4797Problem Description今年暑假杭电ACM集训队第一次组成女
2016-12-01 22:02:18 262
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人