------- 数据结构 ------
文章平均质量分 83
叶孤心丶
这个作者很懒,什么都没留下…
展开
-
改进的素数筛
最简单的筛素数法方法就是从2开始,将所以2的倍数去掉,然后从3开始,将3的倍数去掉。根据这样很容易写出代码,下面代码就是是筛素数法得到100以内的素数并保存到primes[]数组中。[cpp] view plaincopy//by MoreWindows( http://blog.csdn.net/MoreWindows ) const int转载 2014-08-05 13:51:29 · 324 阅读 · 0 评论 -
A - 简单字符串排序
A - 简单字符串排序Time Limit:5000MS Memory Limit:100000KB 64bit IO Format:%lld & %lluSubmit StatusDescription从键盘输入10个学生的姓名和成绩,请按字典序排列学生的姓名并输出(姓名和成绩对应关系保持不变)。Input输入共原创 2014-07-30 20:11:24 · 1204 阅读 · 0 评论 -
大数加法
A - 你会敲A+B吗?Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1503DescriptionOne of the first users of BIT's new supercompute原创 2014-07-30 20:36:08 · 540 阅读 · 0 评论 -
D - Pots
D - PotsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice SDUTOJ 2780DescriptionYou are given two pots, having the volume of A and B liters respectively.原创 2014-07-30 20:26:25 · 477 阅读 · 0 评论 -
大数减法
#include #include #include #define maxn 107using namespace std;char a[maxn],b[maxn];//接受输入的字符串int ta[maxn],tb[maxn];//倒序记录输入的字符串int main(){ int i,t; int len1,len2; s转载 2014-06-08 09:34:42 · 324 阅读 · 0 评论 -
大数加法
1.#include #include #include #include using namespace std;int main(){ char a[201],b[201]; int c[201],d[201]; int l1,l2,l,t; int flag; while(scanf("%s",a)!=EO转载 2014-06-08 09:33:58 · 468 阅读 · 0 评论 -
A. Feed with Candy
A. Feed with Candytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe hero of the Cut the Rope game is a l原创 2014-06-14 13:55:44 · 725 阅读 · 0 评论 -
快速素数判断的方法
#include #include #define LL long long bool f(LL n) { if(n == 2 || n == 3 || n == 5) return true ; if(n % 2 == 0 || n % 3 == 0 || n % 5 == 0 || n == 1)转载 2014-06-06 20:38:43 · 642 阅读 · 0 评论 -
A - 搜索
A - 搜索Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescription在古老的魔兽传说中,有两个军团,一个叫天灾,一个叫近卫。在他们所在的地域,有n个隘口,编号为1..n,某些隘口之间是有通道连接的。其中近卫军团在1号隘口,天原创 2014-08-21 21:10:35 · 433 阅读 · 0 评论 -
二分图最大匹配
As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that原创 2014-08-21 21:26:32 · 356 阅读 · 0 评论 -
数据结构实验:哈希表
数据结构实验:哈希表Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述 在n个数中,找出出现次数最多那个数字,并且输出出现的次数。如果有多个结果,输出数字最小的那一个。输入 单组数据,第一行数字n(1接下来有n个数字,每个数字不超过100000000输出原创 2014-07-05 17:57:09 · 574 阅读 · 0 评论 -
艺术联合会(超时了)
#include#includeint a[50000][6];int b[50001],c[50001];int main(){ int T,n,m,i,j; int p,r,pp; int e; scanf("%d",&T); while(T--) { memset(b,0,sizeof(原创 2014-06-06 20:37:54 · 571 阅读 · 0 评论 -
大数乘法
大数乘法#include #include #include #include using namespace std;int main(){ char str1[300],str2[300]; int d[300],f[300],c[600]; int l1,l2,l,w,e; while(scanf("%s",str1)!=EOF) {转载 2014-06-08 09:32:46 · 506 阅读 · 0 评论 -
查找练习 hash——出现过的数字
查找练习 hash——出现过的数字Time Limit: 1000MS Memory limit: 65536K题目描述有一个数据字典,里面存有n个数字(n 输入 输入数据只有一组!第一行包含两个整数n m,分别代表字典中数字的个数和要查询的数字的个数。接着n行代表字典中的n个数字。最后m表示要查询的数字。原创 2014-05-30 19:03:37 · 564 阅读 · 0 评论 -
数据结构上机实验之二分查找
数据结构上机实验之二分查找Time Limit: 1000MS Memory limit: 65536K题目描述 在一个递增的序列里,查找元素是否存在,若存在输出YES,不存在输出NO.输入 本题多组数据,首先输入一个数字n,然后输入n个数,数据保证数列递增,然后再输入一个查找数字。输出 若存在输出YES,不存在输出NO.原创 2014-05-30 19:02:27 · 667 阅读 · 0 评论 -
HDU 2160母猪的故事
B - 背包Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription话说现在猪肉价格这么贵,著名的ACBoy 0068 也开始了养猪生活。说来也奇怪,他养的猪一出生第二天开始就能每天中午生一只小猪,而且生下来的竟然都原创 2014-08-21 21:10:05 · 1812 阅读 · 0 评论 -
POJ 1006 Biorhythms
E - BiorhythmsTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1006DescriptionSome people believe that there are three cyc原创 2014-07-30 20:27:05 · 436 阅读 · 0 评论 -
POJ 1731 Orders
C - OrdersTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe stores manager has sorted all kinds of goods in an alphabetical原创 2014-07-30 20:16:20 · 394 阅读 · 0 评论 -
POJ 3981 字符串替换
B - 字符串替换Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription编写一个C程序实现将字符串中的所有"you"替换成"we"Input输入包含多行数据 每行数据是一原创 2014-07-30 20:13:09 · 559 阅读 · 0 评论 -
POJ 2109 Power of Cryptography
Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18103 Accepted: 9136DescriptionCurrent work in cryptography involves (among other t原创 2014-06-14 14:06:24 · 366 阅读 · 0 评论 -
POJ 1183 反正切函数的应用
H - 反正切函数的应用Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1183Description反正切函数可展开成无穷级数,有如下公式 (其中0 使用反正切函数计算PI是一种常原创 2014-07-30 20:32:06 · 449 阅读 · 0 评论 -
HDU 2149 Public Sale(博弈论原理)
Public SaleTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4332 Accepted Submission(s): 2631Problem Description虽然不想,但是现实总归是现实原创 2014-09-15 16:38:28 · 543 阅读 · 0 评论 -
HDU 1846 Brave Game(博弈论)
Brave GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6721 Accepted Submission(s): 4515Problem Description十年前读大学的时候,中国每年都原创 2014-09-15 16:47:27 · 600 阅读 · 0 评论 -
HDU 2147 kiki's game(博弈论)
kiki's gameTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/1000 K (Java/Others)Total Submission(s): 6788 Accepted Submission(s): 4054Problem DescriptionRecently kiki h原创 2014-09-15 17:05:46 · 687 阅读 · 0 评论 -
HD3863 No Gambling
No GamblingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65568/32768 K (Java/Others)Total Submission(s): 1321 Accepted Submission(s): 924Problem DescriptionOne day, Flyvan原创 2014-09-15 21:26:13 · 814 阅读 · 0 评论 -
HDU 1527 取石子游戏(博弈论)
取石子游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3717 Accepted Submission(s): 1868Problem Description有两堆石子,数量任意,可以不同。游戏开始原创 2014-09-16 17:42:34 · 776 阅读 · 0 评论 -
POJ 1502 MPI Maelstrom(最短路)
MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5476 Accepted: 3409DescriptionBIT has recently taken delivery of their new supercomputer, a 3原创 2014-09-25 21:17:28 · 887 阅读 · 0 评论 -
最短路径算法—Bellman-Ford(贝尔曼-福特)算法分析与实现(C/C++)
最短路径算法—Bellman-Ford(贝尔曼-福特)算法分析与实现(C/C++)相关文章:1.Dijkstra算法:http://www.wutianqi.com/?p=18902.Floyd算法:http://www.wutianqi.com/?p=1903Dijkstra算法是处理单源最短路径的有效算法,但它局限于边的权值非负的情况转载 2014-09-25 11:37:40 · 1709 阅读 · 0 评论 -
POJ 1125 Stockbroker Grapevine(多源求最短路)
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27338 Accepted: 15143DescriptionStockbrokers are known to overreact to rumours. You h原创 2014-09-25 20:20:56 · 801 阅读 · 0 评论 -
博弈论专题
首先当然要献上一些非常好的学习资料:基础博弈的小结:http://blog.csdn.net/acm_cxlove/article/details/7854530经典翻硬币游戏小结:http://blog.csdn.net/acm_cxlove/article/details/7854534经典的删边游戏小结:http://blog.csdn.net/acm_cxlove/articl转载 2014-09-15 17:00:20 · 785 阅读 · 0 评论 -
POJ2240 Arbitrage(最短路)
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15991 Accepted: 6737DescriptionArbitrage is the use of discrepancies in currency exchange rates原创 2014-09-28 20:14:05 · 700 阅读 · 0 评论 -
POJ 2502 Subway(最短路)
SubwayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6229 Accepted: 2026DescriptionYou have just moved from a quiet Waterloo neighbourhood to a big, no原创 2014-10-07 19:39:14 · 2673 阅读 · 4 评论 -
POJ 1013 Counterfeit Dollar
Counterfeit DollarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39972 Accepted: 12734DescriptionSally Jones has a dozen Voyageur silver dollars. Howev原创 2014-10-07 19:23:20 · 588 阅读 · 0 评论 -
POJ 2506 Tiling
TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7679 Accepted: 3734DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?原创 2014-10-08 19:38:11 · 694 阅读 · 0 评论 -
HDU1710 Binary Tree Traversals
A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most important ways in which th原创 2014-11-15 17:32:22 · 859 阅读 · 0 评论 -
CodeForces 34C Page Numbers
Page NumbersTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 34CDescription«Bersoft» company is working on a new ver原创 2014-11-15 22:09:27 · 862 阅读 · 0 评论 -
HDU1873 看病要排队
E - 看病要排队Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription看病要排队这个是地球人都知道的常识。不过经过细心的0068的观察,他发现了医院里排队还是有讲究的。0068所去的医院有三个医生(汗,这么少原创 2014-11-15 17:20:22 · 1505 阅读 · 0 评论 -
CodeForces 34C Page Numbers
Page NumbersTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 34CDescription«Bersoft» company is working on a new ver原创 2014-11-15 22:32:50 · 980 阅读 · 0 评论 -
CodeForces 34B Sale
B - SaleTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 34BDescriptionOnce Bob got to a sale of old TV sets. There we原创 2014-11-15 22:35:47 · 1066 阅读 · 0 评论 -
CodeForces 34A Reconnaissance 2
Reconnaissance 2Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 34ADescriptionn soldiers stand in a circle. For eac原创 2014-11-15 22:44:15 · 1573 阅读 · 0 评论