Math
文章平均质量分 58
wintermelon27
这个作者很懒,什么都没留下…
展开
-
ZOJ Problem Set - 3702 Gibonacci number
Gibonacci numberTime Limit: 2 Seconds Memory Limit: 65536 KB In mathematical terms, the normal sequence F(n) of Fibonacci numbers is defined by the recurrence relationF(n)=F(n-1)+F(n-原创 2014-04-30 01:20:06 · 817 阅读 · 0 评论 -
XTU 1236 Fraction (二分)
题目链接:http://202.197.224.59/OnlineJudge2/index.php/Problem/read/id/1236题目大意: 给出一个0,1之间小数,求最接近该小数的分数,分母规定在1到1000。 注意题目有10000个数据。。。解题思路: 预处理一个分数和对应的小数表并且排好序,按照题目要求,先按分数值大小排序,再按分子分母大小排,对于每次查询进行二分查找这个表得到原创 2015-06-14 19:45:23 · 783 阅读 · 0 评论 -
Codeforces Round #308 (Div. 2) C. Vanya and Scales (数学常识,进制转换)
传送门:http://codeforces.com/contest/552/problem/C题目大意:给定砝码基重w,给定重量为w^0,w^1,w^2,,,w^100的砝码,每个只允许用一次。有一个重量为m的物品,问是否能够把物品放在天平左边,天平两边也各放一些砝码,使得天平平衡。解题思路: 把m表示成w进制,不断用m对w取模,合法的情况只有0,1,-1三种,0和1的情况容易处理,如果是-1的话原创 2015-06-21 18:46:03 · 752 阅读 · 0 评论 -
LA 3303 / POJ 2675 Songs (数学证明+排序)
题目链接:http://poj.org/problem?id=2675题目大意:给定n首歌,求出一种放歌顺序使得下图中的式子值最小,s(i)代表每首歌的标号,f(s(i))表示编号为s(i)的歌播放频率,l(s(i))表示编号为s(i)的歌的播放时长,询问第s首歌的编号。思路:假设某两首歌A和B,要确定A和B的播放前后关系,假设A要在B之前播放,则有,A.len原创 2015-05-29 15:54:23 · 806 阅读 · 0 评论 -
Light OJ 1116 Ekka Dokka(数学,二进制的应用)
1116 - Ekka DokkaPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBEkka and his friend Dokka decided to buy a cake. They both love c原创 2014-05-11 22:17:34 · 1222 阅读 · 0 评论 -
CodeForces 275C k-Multiple Free Set
二分查找原创 2014-04-25 00:26:28 · 1245 阅读 · 0 评论 -
ZOJ 3712 Hard to Play
Hard to PlayTime Limit: 2 Seconds Memory Limit: 65536 KB MightyHorse is playing a music game called osu!. After playing for several months, MightyHorse discovered the way of calcu原创 2014-04-25 01:59:48 · 907 阅读 · 0 评论 -
Light OJ 1008- Fibsieve`s Fantabulous Birthday
直接模拟:#include#includeusing namespace std;int main(){ int t; scanf("%d",&t); for(int ca=1;ca<=t;ca++) { long long n,x,r,c; scanf("%lld",&n); printf("Case %d: ",ca); x=sqrt(n);原创 2014-04-23 02:40:49 · 948 阅读 · 0 评论 -
Light OJ 1045 Digits of Factorial(求位数)
1045 - Digits of FactorialPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBFactorial of an integer is defined by the following func原创 2014-05-02 00:50:37 · 975 阅读 · 0 评论 -
Light OJ 1109 - False Ordering
1109 - False OrderingPDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBWe define b is a Divisor of a number a if a is divisible by b原创 2014-05-02 00:42:15 · 1067 阅读 · 0 评论 -
Codeforces Round #202 (Div. 2) D. Apple Tree (DFS + Math)
传送门:http://codeforces.com/contest/349/problem/D题目大意:给出一棵树,每个叶子都有苹果,每个子树平衡的条件是各子树的重量相等,子树重量为该子树所有叶子的苹果树,求要使整棵树平衡最小要除掉的苹果树。解题思路:假设答案为ans,根结点的分支数为n,那么根下面的每棵子树的重量为ans/n,每颗子树所占整棵树的比重为1/n,再假设根结点的某棵子树根节点的分支数为原创 2015-07-16 16:53:27 · 1080 阅读 · 0 评论