http://acm.hdu.edu.cn/showproblem.php?pid=4104 题意:给出n个数,每个数最多只能用一次,每次可以选任意个数相加,求不能相加得到的最小值是多少. 思路: 先排序并计算出前缀和. 现在如果前k个数能组成[1,$sum_{k}$]之间的所有数,那么再新加入$a_{k+1}$后,就可以组成[$a_{k+1}$,$a_{k+1}+sum_{k}$]之间的所有数,那么这两个区间不能有间隔.所以必须满足$a_{k+1}$<=$sum_{k}$+1. #includ…

http://acm.hdu.edu.cn/showproblem.php?pid=4104 一开始还以为这题是背包,然后优化下这个背包,但是一直都优化不出来. 然后题解是直接模拟而已,唉 先从小到大排序后 设[L, R]表示前i个数能组合成这个区间里面的任何一个数. 那么,枚举一个数a[i + 1]进来的时候,他就能表示[a[i + 1], a[i + 1] + R]中的所有数字, 关键是R和a[i + 1]是否能合并而已. 判断一下就好,.注意这题p有可能是0 #include <cstdi…

http://acm.hdu.edu.cn/showproblem.php?pid=1455 http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=243 uva开头描述: 307 - Sticks Time limit: 3.000 seconds hduoj 开头描述: E - Sticks Time Limit:3000MS     Memo…

http://www.lydsy.com/JudgeOnline/problem.php?id=4104 网上题解满天飞,我也懒得写了 #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int N = 200003; int in() { int k = 0, fh = 1; char c = getchar(); for(; c < '0' || c…

http://acm.hdu.edu.cn/showproblem.php?pid=4712 Hamming Distance Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1610    Accepted Submission(s): 630 Problem Description (From wikipedia) For bina…

hduoj 4706 Children's Day 2013 ACM/ICPC Asia Regional Online —— Warmup Herding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2005    Accepted Submission(s): 563 Problem Description Little Joh…

Discount Diesel Time 9150-1 Quartz Wrist watch [WAT022]- US$4.49 Diesel Time 9150-1 Quartz Wrist watch…

最短路基础 这个题目hdu-oj 1874可以用来练习最短路的一些算法. Dijkstra 无优化版本 #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #define mt memset using namespace std; const int maxn = 210; const int inf = 1<<30; int N,M; int mp…

版权声明: 本文为博主Bravo Yeung(知乎UserName同名)的原创文章,欲转载请先私信获博主允许,转载时请附上网址 http://blog.csdn.net/lzuacm. HDUoj 5391 - Zball in Tina Town 在线提交: http://acm.hdu.edu.cn/showproblem.php?pid=5391 Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Ja…

版权声明: 本文为博主Bravo Yeung(知乎UserName同名)的原创文章,欲转载请先私信获博主允许,转载时请附上网址 http://blog.csdn.net/lzuacm. C++版 - HDUoj 2010 3阶的水仙花数 - 牛客网 时间限制:1秒 空间限制:32768K 热度指数:1005 在线提交(牛客网仅支持C++或Java): https://www.nowcoder.com/questionTerminal/dc943274e8254a9eb074298fb208470…

If your tax calculation is based on a problematic configuration, the following warnings appear: Warning. Tax discount configuration might result in different discounts than a customer might expect for store(s); Europe Website (French), Europe Website…

Discount Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 984    Accepted Submission(s): 591 Problem Description All the shops use discount to attract customers, but some shops doesn’t give direc…

4104: [Thu Summer Camp 2015]解密运算 Time Limit: 10 Sec  Memory Limit: 512 MBSubmit: 370  Solved: 237 Description 对于一个长度为N的字符串,我们在字符串的末尾添加一个特殊的字符".".之后将字符串视为一个环,从位置1,2,3,...,N+1为起点读出N+1个字符,就能得到N+1个字符串. 比如对于字符串“ABCAAA”,我们可以得到这N+1个串: ABCAAA. BCAAA.A C…

附件:http://files.cnblogs.com/lzj87980239/Category_Quantity_Discount.rar 效果图后台1.将update.sql导入到数据库 2.将YOUR_TEMPLATES文件夹改为自己的模板名,然后上传到网站根目录 3.在includes/database_tables.php 在末尾添加代码 define('TABLE_CATEGORIES_DISCOUNT_QUANTITY', DB_PREFIX . 'categories_disco…

http://www.lydsy.com/JudgeOnline/problem.php?id=4104 网上题解满天飞,我也懒得写了 #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int N = 200003; int in() { int k = 0, fh = 1; char c = getchar(); for(; c < '0' || c…

题目:https://www.lydsy.com/JudgeOnline/problem.php?id=4104 想了很久,想出一个 nlogn (也许是 n2logn )的,可惜空间是 n2 . 已知字符集,对它排个序,对应上给出的那些字符,就能知道每个字符前面是哪个字符. 这样得到了一些长度为2的串.这些长度为2的串一定也是这 n+1 行的开头:所以对它们排序后对应上给出的那些字符,就能得到长度为3的串.这样就能得到答案. 但是太慢.考虑已知长度为 k 的串,想一下把它接成 2*k 的串.…

HDUOJ题目HTML的爬取 封装好的exe/app的GitHub地址:https://github.com/Rhythmicc/HDUHTML 按照系统选择即可. 其实没什么难度,先爬下来一个题目的html,然后正则匹配一波塞个标签上去就好了. 下图运行效果: 下面是爬取下的HTML运行效果: 源码: import re import requests from requests.exceptions import RequestException url = "http://acm.hdu.…

题目:https://www.lydsy.com/JudgeOnline/problem.php?id=4104 一开始发现了给出的顺序是按这些末尾字符后面的后缀排序得到的: 然后发现可以一个一个把字符串补全: 因为首先知道所有单个字符,排序后就是那些串的第一位,和末尾连起来,得到 n+1 个二元组: 然后把这 n+1 个二元组排序,再和末尾连起来,得到 n+1 个三元组: 以此类推,最后可以得到整个串,可惜这样做是 n^2 的,空间也是: 考虑倍增?因为这样得到的四元组的前两个位置其实和当初得…

Description: Linda is a shopaholic. Whenever there is a discount of the kind where you can buy three items and only pay for two, she goes completely mad and feels a need to buy all items in the store. You have given up on curing her for this disease,…

链接:https://www.nowcoder.com/acm/contest/140/B来源:牛客网 题目描述 White Rabbit wants to buy some drinks from White Cloud. There are n kinds of drinks, and the price of i-th drink is p[i] yuan per bottle. Since White Cloud is a good friend of White Rabbit, whe…

在backoffice的Price Settings->Discount->Customer Discount Groups菜单下面,创建一个新的Customer Discount Group,这只是一个place holder,用来存放随后创建的具体折扣信息: 到Discount里维护一条折扣记录,打折20%,id为jerrydiscount_20: 还需要一条路及关系把Discount Group和Discount 关联起来,这就是Discount Row. 新建一条Discount ro…

Nor can we discount the possibility that some factor in the diet itself has harmful effects. ADJ-GRADED 悲观的Someone who is pessimistic thinks that bad things are going to happen. Not everyone is so pessimistic about the future... 不是每个人都对未来如此悲观. ADJ 破产…

http://acm.hdu.edu.cn/showproblem.php?pid=1251 统计难题 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 21236    Accepted Submission(s): 9145 Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成…

http://acm.hdu.edu.cn/showproblem.php?pid=1286 找新朋友 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8694 Accepted Submission(s): 4592 Problem Description 新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其…

http://acm.hdu.edu.cn/showproblem.php?pid=1285 确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14739 Accepted Submission(s): 5892 Problem Description 有N个比赛队(1<=N<=500),编号依次为1,2,3,....,N进行比赛…

http://acm.hdu.edu.cn/showproblem.php?pid=3459 Rubik 2×2×2 Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 327670/327670 K (Java/Others) Total Submission(s): 654    Accepted Submission(s): 234 Special Judge Problem Description Sonny is proba…

http://acm.hdu.edu.cn/showproblem.php?pid=4710 Balls Rearrangement Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 735    Accepted Submission(s): 305 Problem Description Bob has N balls and A b…

http://acm.hdu.edu.cn/showproblem.php?pid=4708 Rotation Lock Puzzle Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description Alice was felling into a cave. She found a strange door with a number square m…

http://acm.hdu.edu.cn/showproblem.php?pid=4715 Difference Between Primes Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description All you know Goldbach conjecture.That is to say, Every even integer great…

http://acm.hdu.edu.cn/showproblem.php?pid=4707 Pet Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description One day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in th…