思维
水果妹妹踩前端的坑
这个作者很懒,什么都没留下…
展开
-
zcmu--2024: cc的神奇背包【思维】
2024: cc的神奇背包Description Input 1 <= T <= 201 <= n, v <= 10001 <= ai, bi <= 1000Output Sample Input1 4 2 1 2 2 1 3 1 2 3Sample Outputyes解题思路:先用结构来存储背包的ai和b...原创 2018-09-13 15:12:48 · 749 阅读 · 0 评论 -
zcmu-- 中医药院校程序设计竞赛备赛一【前缀和,博弈】
目录2959--Problem B: Amity Assessment【思维】1986- Problem C: 周期串plus【周期】1980-- Problem D: 不存在的泳池【最大公因数】1907-- Problem E: k倍区间【前缀和优化】1916-Problem F: E.当然是选...原创 2018-09-18 14:46:20 · 548 阅读 · 0 评论 -
zcmu1756: 台球碰撞
1756: 台球碰撞Description在平面直角坐标系下,台球桌是一个左下角在(0,0),右上角在(L,W)的矩形。有一个球心在(x,y),半径为R的圆形母球放在台球桌上(整个球都在台球桌内)。受撞击后,球沿极角为a的射线(即:x正半轴逆时针旋转到此射线的角度为a)飞出,每次碰到球桌时均发生完全弹性碰撞(球的速率不变,反射角等于入射角)。 如果球的速率为v,s个时间单位之后球心在什么地...原创 2018-10-12 16:01:26 · 294 阅读 · 0 评论 -
zcmu1777: 寻找倍数【抽屉原理】
1777: 寻找倍数Description给出n(n<=10000)个正整数,每个数xi<=15000.可以在这个n个数中选择一些数出来,至少选择一个,是否存在一种选择方案使得选择出来的数的和是n的整数倍 Input第一行一个T(T<=500),第二行一个数n,接下来n个正整数 OutputCase #x: y,其中x是测试编号,从1开始,y表示...原创 2018-10-14 19:14:04 · 307 阅读 · 0 评论 -
1151 LCA in a Binary Tree (30 分)【最小公共祖先】
1151 LCA in a Binary Tree (30 分)The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.Given any two nodes in a binary tree, you a...原创 2019-01-03 15:20:37 · 771 阅读 · 4 评论 -
1140 Look-and-say Sequence (20 分)
Look-and-say sequence is a sequence of integers as the following:D, D1, D111, D113, D11231, D112213111, ...whereDis in [0, 9] except 1. The (n+1)st number is a kind of description of the nth n...原创 2019-02-27 21:29:30 · 200 阅读 · 0 评论 -
PAT甲级1096 Consecutive Factors (20 分)【思维】
Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3×5×6×7, where 5, 6, and 7 are the three consecutive numbers. Now given ...原创 2019-02-26 19:53:49 · 232 阅读 · 0 评论