计算方法
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
Optimal Milking
Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 13968 Accepted: 5044 Case Time Limit: 1000MSDescription FJ has moved his K (1 <= K <= 30) milking machines out原创 2015-08-10 10:38:37 · 925 阅读 · 0 评论 -
【HYSBZ 2301】——莫比乌斯反演
Time Limit: 50 Sec Memory Limit: 256 MBDescription对于给出的n个询问,每次求有多少个数对(x,y),满足a≤x≤b,c≤y≤d,且gcd(x,y) = k,gcd(x,y)函数为x和y的最大公约数。Input第一行一个整数n,接下来n行每行五个整数,分别表示a、b、c、d、kOutput共n行,每行一个整数表示满足要求的数对(x,y)的个数Samp原创 2016-05-11 21:21:14 · 847 阅读 · 0 评论 -
Coderforces 354Div2
A. Nicholas and Permutation time limit per test:1 second memory limit per test:256 megabytesNicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a per原创 2016-06-23 13:25:25 · 622 阅读 · 0 评论 -
51Nod【1686】——1686 第K大区间(尺取+二分)
51Nod 1686 第k大区间基准时间限制:1 秒 空间限制:131072 KB定义一个区间的值为其众数出现的次数。 现给出n个数,求将所有区间的值排序后,第K大的值为多少。 众数(统计学/数学名词)_百度百科 Input第一行两个数n和k(1<=n<=100000,k<=n*(n-1)/2)原创 2016-08-28 17:02:01 · 963 阅读 · 0 评论 -
2016 Mulit-University Training Contest 8
HDU【5821】——Rikka with SequenceHDU【5826】——physicsHDU【5828】——Rikka with SequenceHDU【5831】——Rikka with Parenthesis II原创 2016-08-11 20:19:52 · 955 阅读 · 0 评论 -
Uvalive 7366 Brocard
Uvalive7366 Brocard原创 2016-10-09 11:30:54 · 406 阅读 · 0 评论 -
HackerRank Week of Code 23——Enclosure(等周定理+余弦定理)
Vigo the Carpathian is an evil feudal lord. He wants to seize land from his serfs by enclosing it with a polygonal fence where each respective side has a strictly specified length. Can you help him max原创 2016-09-21 11:01:04 · 602 阅读 · 0 评论 -
【HDU4855】Goddess——区间+三分
HDU 4855 GoddessTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Special JudgeProblem DescriptionGoddess used to be a原创 2016-10-21 11:54:16 · 861 阅读 · 0 评论 -
【HDU5919】Sequence II——主席树+二分
HUD5919 Sequence IITime Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionMr. Frog has an integer sequence of length n,原创 2016-10-13 13:24:38 · 767 阅读 · 0 评论 -
【HDU1402】A * B Problem Plus——FFT初步
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionCalculate A×BA \times B.InputEach line will contain two integers A and B. Process to end of file.No原创 2016-11-19 18:41:35 · 475 阅读 · 0 评论 -
2013 Multi-University Training Contest 1
【4609HDU】3-idiots——组合计数+FFT Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionKing OMeGa catched three men who had been streaking in the street. Lo原创 2016-11-20 10:28:59 · 612 阅读 · 0 评论 -
2015 Multi-University Training Contest 2
【HDU5307】He is Flying——FFT+母函数原创 2016-11-21 01:31:20 · 539 阅读 · 0 评论 -
【HDU5730】Shell Necklace——CDQ+FFT
【HDU5730】Shell Necklace——CDQ+FFT Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionPerhaps the sea‘s definition of a shell is the pearl. However, i原创 2016-11-22 11:08:17 · 758 阅读 · 0 评论 -
Topcoder 639 Div2
A题意:喂养宠物,给你两个宠物的喂养的初始的时间,喂养的次数和喂养的时间间隔。判断喂养两个宠物是不是有冲突,即两个宠物的喂养的时间是一样的,如果有返回”Difficult“,否则返回“Easy”。思路:暴力计算即可。#include <bits/stdc++.h>using namespace std;class ElectronicPetEasy{ public: string原创 2016-06-20 11:32:09 · 423 阅读 · 0 评论 -
2016 Multi-University Training Contset 2
HDU【5734】-Acperience Time Limit: 4000/2000 MS (Java/Others) Memory Limit:65536/65536 K (Java/Others)Problem DescriptionDeep neural networks (DNN) have shown significant improvements in several appl原创 2016-07-21 21:04:21 · 1328 阅读 · 0 评论 -
POJ3420Quad Tiling(矩阵快速幂)
Quad TilingTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 3740 Accepted: 1684 DescriptionTired of the Tri Tiling game finally, Michael turns to a more challengeable game, Quad Ti原创 2015-12-29 18:50:41 · 1395 阅读 · 0 评论 -
SUDTOJ 3323园艺问题 (线段树)
园艺问题 Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述本巨养了一盆双色茉莉。这种花有一种特点:第i朵花在第Di天盛开,刚开时是紫色的,Ai天之后会变成白色,再过Bi天就会凋谢。如Di = 3,Ai = 4,Bi = 5,那么在第3至6天为紫色,第7至11天为白色,第11天之后就凋谢了。现在给出一些事件,你需要按要求给出答案。原创 2015-09-15 19:50:35 · 760 阅读 · 0 评论 -
Flyer(二分 HDU4768)
Flyer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2009 Accepted Submission(s): 736Problem Description The new semester begins! Differe原创 2015-09-06 08:35:43 · 524 阅读 · 0 评论 -
Count Color(线段树+位运算 POJ2777)
Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 39917 Accepted: 12037Description Chosen Problem Solving and Program design as an optional course, you are required原创 2015-09-04 20:28:00 · 551 阅读 · 0 评论 -
Mayor's posters(线段树+离散化POJ2528)
Mayor’s posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 51175 Accepted: 14820Description The citizens of Bytetown, AB, could not stand that the candidates in the mayor原创 2015-09-04 16:44:19 · 462 阅读 · 0 评论 -
Inviting Friends(二分+背包)
Inviting Friends Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 241 Accepted Submission(s): 97Problem Description You want to hold a birt原创 2015-08-20 20:24:05 · 560 阅读 · 0 评论 -
【SPOJ375】 Query on a tree——树链剖分
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3…N-1.We will ask you to perfrom some instructions of the following form:CHANGE i ti : change the cos原创 2016-03-20 19:49:56 · 448 阅读 · 0 评论 -
【SDUT2416】Fruit Ninja II——积分
Fruit Ninja II题目描述Have you ever played a popular game named “Fruit Ninja”?Fruit Ninja (known as Fruit Ninja HD on the iPad and Fruit Ninja THD for Nvidia Tegra 2 based Android devices) is a video game原创 2016-03-20 19:58:48 · 505 阅读 · 0 评论 -
半平面交初级
半平面:顾名思义,半平面就是平面的一半,那么半平面应该如何表示呢?我们知道一条直线可以将平面分成两半,如果直线的方程为ax+by+c=0ax+by+c = 0,那么半平面就可以表示为ax+by+c<0或者ax+by+c>0ax+by+c< 0 或者 ax+by+c>0,如果我们这样定义半平面,那么半平面交也就很好解释了。半平面交:每一个半平面就是一个不等方程,那么半平面交就是满足这些半平面不等方程原创 2016-04-15 20:15:33 · 2048 阅读 · 0 评论 -
Topcoder SRM 636 Div2 C
题意:给你一个矩阵,每一个小格都有一个字母表示它的值(′0′∼′9′'0'\sim '9'),让你横着切三刀,纵着切三刀。把一个矩阵分成16个小矩阵,你会得到16个矩阵的最小的权值,问最小的权值最大为多少。分析:由于矩阵最大为75*75,但是如果直接枚举切的方式,肯定会超时,但是我们可以折半枚举,只枚举横着切的方式,然后预处理出每一列的前缀和,通过二分的方式,二分最小值,计算最后的答案。 #i原创 2016-06-02 21:11:06 · 423 阅读 · 0 评论 -
Topcoder SRM 636 Div2 B
题意:定义一种数叫做”sortedness”,对于数组中下标i<j的数,其中a[i]<a[j]的对数数组中下标i<j的数,其中a[i]<a[j]的对数,给你一个长度为数组,数组中的数的大小为0∼n0\sim n,数组中0表示对应得位置没有数,求在在没有数的地方将缺失的数填上使得数组的sortedness 的大小等于给定的sortedness的方案数。同时保证在一个数组中0的个数不会超过5个。思路:由原创 2016-06-02 21:23:22 · 468 阅读 · 0 评论 -
Topcoder SRM 636 Div1 A
题意:这个题意和Div2的C题的题意一样只不过数据更少,估计暴力可过。#include <bits/stdc++.h>using namespace std;class ChocolateDividingEasy{ public : int sum[55][55]; int num[4][55]; int n,m; int ans ; bool Judge(i原创 2016-06-03 13:35:15 · 309 阅读 · 0 评论 -
Hackerrank——Week of Code 29
Week of Code 29原创 2017-03-02 09:44:39 · 487 阅读 · 0 评论