==数学and思维==
文章平均质量分 72
idealistic
编程渣渣~~
展开
-
概率
I - ITime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1104 uDebugDescriptionSometimes some mathematical results are hard to原创 2016-08-15 17:02:17 · 214 阅读 · 0 评论 -
能组成几个平行四边形--组合数
H - HTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1058 uDebugDescriptionThere are n distinct points in the plane, given转载 2016-08-13 20:45:53 · 2497 阅读 · 0 评论 -
Bungee Jumping(基础物理)
J - JTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1155DescriptionOnce again, James Bond is fleeing from some evil peop原创 2016-08-13 17:20:59 · 592 阅读 · 0 评论 -
**质因子个数
C - CTime Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 546DDescriptionTwo soldiers are playing a game. At the begin原创 2016-08-14 18:43:07 · 1209 阅读 · 0 评论 -
数学水题
Beru-taxiTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 706AAppoint description: System Crawler (Aug 12, 2016 10:47:45 AM原创 2016-08-16 16:34:12 · 372 阅读 · 0 评论 -
平行四边形面积
B - B 圆周率用acos(-1.0) 使用longlongTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1305 uDebugDescriptionA parallelogram is a q原创 2016-08-27 15:41:37 · 823 阅读 · 0 评论 -
三维坐标是否有重复
1915: HTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 282 Solved: 118SubmitStatusWeb BoardDescription在三维空间里,晴天得到了一些坐标,然后他想知道这些坐标有没有重合的哇,然后若两个坐标是重合的也就是x=x,y=y,z=z。然后他把这个任务交给你啦。In原创 2016-08-17 17:13:43 · 554 阅读 · 0 评论 -
lightoj 1006
B - Hex-a-bonacciTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1006DescriptionGiven a code (not optimized), and necess原创 2016-08-27 18:56:26 · 516 阅读 · 0 评论 -
Mishka and trip 道路权值和
Mishka and tripTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 703BAppoint description: System Crawler (Aug 15, 2016 11:19原创 2016-08-18 11:50:34 · 358 阅读 · 0 评论 -
拆数字游戏
F - Spider ManTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 705BAppoint description: System Crawler (Aug 12, 2016 3:03原创 2016-08-17 21:02:14 · 1349 阅读 · 0 评论 -
【poj1852】Ants
AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14948 Accepted: 6498DescriptionAn army of ants walk on a horizontal pole of length l cm, each with a原创 2016-08-18 21:23:55 · 228 阅读 · 0 评论 -
1899最大和难题
1899: 985的最大和难题Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 329 Solved: 41SubmitStatusWeb BoardDescription985有2 * n - 1个整数,他每次可以将其中n个数变号,操作次数不限,问他可以得到的最大和。Input第一行输入一个整数原创 2016-08-19 17:45:02 · 255 阅读 · 0 评论 -
A+B for Matrices
题目1001:A+B for Matrices时间限制:1 秒内存限制:32 兆特殊判题:否提交:19925解决:7958题目描述: This time, you are supposed to find A+B where A and B are two matrices, and then count the num原创 2016-09-02 17:18:50 · 351 阅读 · 0 评论 -
*规律-技巧
圆周率用acos(-1.0) 使用longlongTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1136 uDebugDescriptionThere is sequence 1, 12, 123原创 2016-08-26 09:07:44 · 425 阅读 · 0 评论 -
Bear and Reverse Radewoosh(水)
Bear and Reverse RadewooshTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionLimak and Radewoosh are going to compete against ea原创 2016-08-22 18:38:35 · 329 阅读 · 0 评论 -
Co-prime Array
Co-prime ArrayTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou are given an array of n elements, you must make it a co-pri原创 2016-08-22 18:56:04 · 341 阅读 · 0 评论 -
Dima and Guards
Dima and GuardsTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 366ADescriptionNothing has changed since the last ro原创 2016-08-22 20:31:51 · 239 阅读 · 0 评论 -
【杭电5247】*找连续数
找连续数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 5247Description小度熊拿到了一个无序的数组,对于这个数组,小度熊想知道是否能找到一个k 的区间,里面的 k 个数字排完序后是连续原创 2016-08-23 11:07:52 · 367 阅读 · 0 评论 -
Alarm--找规律
1010 - AlarmTime Limit:1s Memory Limit:128MByteSubmissions:289Solved:96DESCRIPTIONGiven a number sequence [3,7,22,45,116,...][3,7,22,45,116,...]. Please tell me the kk-th原创 2016-08-20 16:13:12 · 300 阅读 · 0 评论 -
数学
A - A 使用long longTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIn this problem you are to calculate the sum of all integers原创 2016-08-23 19:35:47 · 323 阅读 · 0 评论 -
数学
使用long longTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionGiven two integers: n and m and n is divisible by 2m, you have to write d原创 2016-08-23 19:37:24 · 224 阅读 · 0 评论 -
数学
使用long longTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 597ADescriptionFind the number of k-divisible numbers原创 2016-08-23 20:25:56 · 316 阅读 · 0 评论 -
相似三角形--水
使用long longTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1043 uDebugDescriptionSee the picture below.You are given AB,原创 2016-08-23 21:04:08 · 261 阅读 · 0 评论 -
***分解定理
G - G 使用long longTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1138 uDebugDescriptionYou task is to find minimal natural原创 2016-08-23 21:26:42 · 536 阅读 · 0 评论 -
*哥德巴赫猜想
猜想:任何一个大于2的偶数都可以写成两个质数之和数值验证:#include#include#includeint f(int n,int prime[]){ int i,j; for(i=2;i<=n;i++) prime[i]=1; prime[0]=prime[1]=0; for(i=2;i*i<=n;i++) { if(prime[i]==1) {原创 2016-09-14 17:50:22 · 690 阅读 · 0 评论 -
RSA算法基础
RSA定理:若P,Q是两个相异质数,另有正整数R,M;其中M的值与(P-1)*(Q-1)互质,并使得(RM)mod(P-1)(Q-1)=1.有正整数A,且A C=A的R次方 mod PQ; B=C的M次方 mod PQ;则有A==B;生成公钥和私钥:1.选择素数P,Q2.N=P*Q3原创 2016-09-14 16:11:25 · 322 阅读 · 0 评论 -
【codeforces】Tricky Sum
Tricky SumTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription求和是一种最常见的运算,我们经常做的就是1加到n的和。例如,1加到100的和是5050。但是现在,我们稍微变动一下求和方法,对于属于2的幂原创 2016-07-21 14:47:37 · 237 阅读 · 0 评论 -
求解孪生素数--梅森素数
孪生素数:间隔为2的相邻素数#include#includeint main(){ //素数打表 int a[10001]={1,1}; for(int i=2;i<=10000;i++) { if(a[i]==1) continue; for(int j=2*i;j<=10000;j+=i) a[j]=1; } //统计素数数量 int c=0;i原创 2016-09-14 16:04:10 · 612 阅读 · 0 评论 -
求中位数
Optimal Point on a LineTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice _Appoint description: System Crawler (Sep 16, 2016 7:22:55 PM)原创 2016-09-16 20:00:31 · 475 阅读 · 0 评论 -
二进制中1的个数
圆周率用acos(-1.0) 使用longlongTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1182 uDebugDescriptionGiven an integer n, first we原创 2016-08-26 09:04:01 · 222 阅读 · 0 评论 -
面积--水
圆周率用acos(-1.0) 使用longlongTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1022 uDebugDescriptionA circle is placed perfectly原创 2016-08-26 09:06:45 · 319 阅读 · 0 评论 -
数字对称
E - E 圆周率用acos(-1.0) 使用longlongTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1225 uDebugDescriptionA palindromic number or原创 2016-08-26 09:10:42 · 585 阅读 · 0 评论 -
求面积
F - F 圆周率用acos(-1.0) 使用longlongTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1331 uDebugDescriptionAgent J is preparing t原创 2016-08-26 09:11:43 · 250 阅读 · 0 评论 -
*数学--规律-技巧
H - H 圆周率用acos(-1.0) 使用longlongTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1109 uDebugDescriptionWe define b is a Divis原创 2016-08-26 09:14:32 · 325 阅读 · 0 评论 -
汉诺塔
n个圆盘--移动次数2^n-1;#includelong count;//记录移动次数void hanoi(int n,char a,char b,char c)//要将n个从a移到c上,b作为辅助的柱 {if(n==1)printf("第%d次,%c-->%c柱\n",++count,a,c);else{ hanoi(n-1,a,c,b);//先将n-1个移到辅助柱上 p原创 2016-09-23 22:39:19 · 188 阅读 · 0 评论 -
codefoceA--New Year Transportation
New Year TransportationTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNew Year is coming in Line World! In this world, there原创 2016-09-20 18:02:28 · 360 阅读 · 0 评论 -
codefoce500B
New Year PermutationTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionUser ainta has a permutation p1, p2, ..., pn. As the New原创 2016-09-20 18:12:16 · 344 阅读 · 0 评论 -
codeforce285A--Misha and Changing Handles-字符串
Misha and Changing HandlesTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMisha hacked the Codeforces site. Then he decided t原创 2016-09-21 18:04:34 · 333 阅读 · 0 评论 -
An easy problem
An easy problemTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionWhen Teddy was a child , he was always thinking about some simp原创 2016-10-10 22:40:19 · 437 阅读 · 0 评论 -
QAQ的区间价值
1009: QAQ的区间价值时间限制: 1 Sec 内存限制: 128 MB提交: 73 解决: 47[提交][状态][讨论版]题目描述QAQ有一个整数序列,元素个数有N个,分别为1,2,3 ... N-1,N。假定用数组a[]来依次记录N个元素,那么区间[i, j]的价值 = sum(i, j) * Check(i, j)。其中sum(i, j) = a[i] +原创 2016-10-08 21:24:46 · 260 阅读 · 0 评论