数学
文章平均质量分 68
风动护花
喜欢我你就关注我,有话说你就评论我,没话说你就点个赞≖‿≖✧
展开
-
zoj-3868
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5480数学题,用GCD做。用到容斥的知识。感谢LinXI的博客#include #include #include #include #include #include #include #include #include #include #includ原创 2015-05-10 19:49:10 · 453 阅读 · 0 评论 -
ICPC 6929 Sums
思路 :如果一个数n是2的阶乘,那么是无解的。然后,如果N是奇数,那么肯定能由中间的两个数相加得到。如果N是偶数,就要分成两种情况,一种是 取 n-1 n n+1等等,n的左右两边可以取I个值,可以发现n-2和n+2相加和n-1加n+1相加相等。。另一种情况就是中间情况是 n-1 n n+1,n-1和n的值等于n-2和n+1的值。。贴上JYJJ阿姨的代码#include #inclu原创 2015-09-01 14:47:00 · 386 阅读 · 0 评论 -
HZNUOJ 1804 邮局选址问题
1804: 邮局选址问题Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 18 Solved: 16 Scores: 87.29[Submit][Status][BBS]Description问题描述: 在一个按照东西和南北方向划分成规整街区的城市里,n个居民点散乱地分布在不同的街区中。用x 坐标表示东西向,用y坐标表原创 2015-08-18 18:45:07 · 1373 阅读 · 0 评论 -
ICPC 6828 Help cupid(Regionals 2014 >> Latin America)
Cupid’s job is getting harder, so he is adopting new technologies to help him with his difficult task of matching people into happy couples. He appointed the best programmers in his staff to a new projec原创 2015-09-03 16:39:23 · 457 阅读 · 0 评论 -
ICPC 6921 Refraction
一个水槽如图InputFirst line of the input file contains an integer T (0 < T < 100001) which denotes the number of test cases. Each of the next T lines contains the input for one test case. Each line conta原创 2015-09-03 13:11:53 · 481 阅读 · 0 评论 -
ICPC 6918 And Or
#include#includeusing namespace std;#define ll long longlong long A,B;ll solve(ll x){ ll cnt = 0; ll y = 1; while(x>=y) { // cout<<"/////"<<endl; y = y<<1; ++cnt; } return cnt;}int原创 2015-09-02 15:06:44 · 447 阅读 · 0 评论 -
HDU 3826 Squarefree number
Squarefree numberTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2754 Accepted Submission(s): 695Problem DescriptionIn mathemati原创 2015-10-02 10:30:01 · 519 阅读 · 0 评论 -
HDU 5570 balls
代码不是自己写的,这道题看上去是个好题。先囤着。#include#includeusing namespace std;int n;int m;int a[1005][1005];int sum[1005];double f[1005][1005];double g[1005][1005];double ans;int main(){ while(~scanf("%d%d"原创 2015-11-22 17:35:20 · 376 阅读 · 0 评论 -
HDU1002 A + B Problem II
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.Input The first line of the input contains an integer T(1<=T<=20) which原创 2017-05-03 09:10:19 · 325 阅读 · 0 评论 -
HDU1720 A+B Coming
Problem Description Many classmates said to me that A+B is must needs. If you can’t AC this problem, you would invite me for night meal. ^_^Input Input may contain multiple test cases. Each case con原创 2017-05-03 09:42:38 · 817 阅读 · 0 评论 -
HDU2104 hide handkerchief
Problem Description The Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.原创 2017-05-03 10:34:24 · 368 阅读 · 0 评论 -
HSACM 1625 Cantor表
1625: Cantor表Time Limit: 1 Sec Memory Limit: 32 MBSubmit: 16 Solved: 14 Scores:88.98[Submit][Status][BBS]Description 现代数学的著名证明之一是Georg Cantor证明了有理数是可枚举的。他是用下面这一张表来证明这一命题的:原创 2015-08-05 09:54:32 · 360 阅读 · 0 评论 -
HDU 5391 Zball in Tina Town
Zball in Tina TownTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 726 Accepted Submission(s): 417Problem DescriptionTina Town i原创 2015-08-16 20:46:41 · 782 阅读 · 0 评论 -
codechef(MAY15)第二题Set Difference
http://www.codechef.com/MAY15/第二题刚开始找到的规律是对NUM数组进行两个FOR循环,答案就是(num[j]-num[i])*make_pow(2,j-i-1,mod),但是两个循环一定是超的。然后就联想到吧这个规律×进去计算看看,结果发现,是有规律的。可以举个例子数列1,2,3,4来计算来找规律。另外有一个坑就是代码里面不能写成ans+=......应为原创 2015-05-13 12:21:50 · 543 阅读 · 0 评论 -
codechef(MAY15)第三题Chef and Prime Divisors
http://www.codechef.com/MAY15/problems/CHAPDYou are given two positive integers – A and B. You have to check whether A is divisible by all the prime divisors of B.InputThe first line o原创 2015-05-14 19:12:59 · 757 阅读 · 1 评论 -
cf-289A
此题就是判断如何改变区间的长度让这些区间长度之和能被k整除.其中求出大于ANS的第一个K的倍数的方法就是。如代码#includeusing namespace std;int main() { long long n,k; cin >> n >> k; long long ans = 0; long long a,b; for(int i=0;i<n;i++) { cin原创 2015-06-04 20:54:27 · 462 阅读 · 0 评论 -
ZOJ 3647 Gao the Grid
直接是算出所有的三角#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;long long c(long long n,long原创 2015-07-10 17:01:12 · 1195 阅读 · 0 评论 -
ZOJ 3758 Singles' Day
速查表:char -128 ~ +127 (1 Byte)short -32767 ~ + 32768 (2 Bytes)unsigned short 0 ~ 65535 (2 Bytes)int -2147483648 ~ +2147483647 (4 Bytes)unsigned int 0 ~ 4294967295 (4 Bytes)long == intlo原创 2015-07-10 09:03:59 · 588 阅读 · 0 评论 -
HDU 4814 Golden Radio Base
Golden Radio BaseTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 717 Accepted Submission(s): 299Problem DescriptionGolden ratio base (原创 2015-07-11 21:00:09 · 591 阅读 · 0 评论 -
HDU 4790 Just Random
Just RandomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2068 Accepted Submission(s): 576Problem Description Coach Pang and Uncle Ya原创 2015-07-11 11:01:00 · 379 阅读 · 0 评论 -
ZOJ 3557 How Many Sets II
How Many Sets IITime Limit: 2 Seconds Memory Limit: 65536 KB Given a set S = {1, 2, ..., n}, number m and p, your job is to count how many setT satisfies the following condition:原创 2015-08-08 10:41:10 · 622 阅读 · 0 评论 -
HDU 4764 Stone
StoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 985 Accepted Submission(s): 712Problem DescriptionTang and Jiang are good fr原创 2015-08-26 13:21:31 · 415 阅读 · 0 评论 -
ICPC 7096 A Rational Sequence
题目大意,看图片和样例。输入一个数,求这个数接下去的数。可以找到规律。如果是左支。。。。。。右支。。。。。。其中右支不能直接的和下一个数有联系。可以看出,右支可以一路上推出某根,然后通过这个所谓的根,往下再一直推左支直到解。#include #include #include #include #inclu原创 2015-08-29 17:28:43 · 522 阅读 · 0 评论 -
HDU1197 Specialized Four-Digit Numbers
Problem Description Find and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits when represented in hexadecimal (base 1原创 2017-05-03 15:44:07 · 252 阅读 · 0 评论