Welcome![Sign In][Sign Up]
Location:
Search - poj 12

Search list

[Other resource5.12

Description: 简易电子地图hinik hijijdfo jpopod jfpojpaj pojpjo kjopkapkfd -simple electronic map hinik hijijdfo jpopod jfpojpaj POJ pjo kjopkapkfd
Platform: | Size: 17268 | Author: 方圆 | Hits:

[GIS program5.12

Description: 简易电子地图hinik hijijdfo jpopod jfpojpaj pojpjo kjopkapkfd -simple electronic map hinik hijijdfo jpopod jfpojpaj POJ pjo kjopkapkfd
Platform: | Size: 17408 | Author: 方圆 | Hits:

[Windows Developreport

Description: poj解题报告,包括了许多很经典的算法-POJ problem solving reports, including a number of classic algorithms
Platform: | Size: 5842944 | Author: michael | Hits:

[Windows Developpoj2810

Description: poj2810 完美立方 http://poj.grids.cn/problem?id=2810 a的立方 = b的立方 + c的立方 + d的立方为完美立方等式。例如12的立方 = 6的立方 + 8的立方 + 10的立方 。编写一个程序,对任给的正整数N (N≤100),寻找所有的四元组(a, b, c, d),使得a的立方 = b的立方 + c的立方 + d的立方,其中a,b,c,d 大于 1, 小于等于N。 可直接运行-http://poj.grids.cn/problem?id=2810 a perfect cube poj2810 cubic = b c+ c a+ d of the cubic cubic cubic equation for the perfect. For example, 12 cubic cubic = 6+ 8+ 10 cubic cubic. The preparation of a program, for any given positive integer N (N ≤ 100), looking for all the four-tuple (a, b, c, d), makes a cube = b of the cubic+ c c+ d of the cube, in which a, b, c, d greater than 1, less than or equal to N. Can be directly run
Platform: | Size: 877568 | Author: henry | Hits:

[source in ebookpoj1222

Description: poj 1222解题报告(附注释)如果要其他的解题报告,可以联系我-problem-solving poj 1222 report (attached note) If you want to report other problem-solving, you can contact me
Platform: | Size: 1024 | Author: guo | Hits:

[Windows Developpoj1200

Description: poj 1200 高效算法 poj 1200 高效算法-poj 1200 Efficient Algorithm poj 1200 Efficient Algorithm
Platform: | Size: 1161216 | Author: chenjin | Hits:

[Windows Developpoj2814

Description: Time Limit: 1000ms Memory limit: 65536kB 题目描述 有9个时钟,排成一个3*3的矩阵。 现在需要用最少的移动,将9个时钟的指针都拨到12点的位置。共允许有9种不同的移动。如右表所示,每个移动会将若干个时钟的指针沿顺时针方向拨动90度。 移动 影响的时钟 1 ABDE 2 ABC 3 BCEF 4 ADG 5 BDEFH 6 CFI 7 DEGH 8 GHI 9 EFHI (图 2) 输入 从标准输入设备读入9个整数,表示各时钟指针的起始位置。1=12点、1=3点、2=6点、3=9点。 输出 输出一个最短的移动序列,使得9个时钟的指针都指向12点。按照移动的序号大小,输出结果-Time Limit: 1000ms Memory limit: 65536kB subject described in 9 clock, arranged in a 3* 3 matrix. Now need to move with the least, will have nine clock pointer Slide 12 o' clock. Allowed a total of 9 different mobile. Like right in the table below, each move will be a number of pointer clock toggle 90 degrees clockwise. Effects of clock movement 1 ABDE 2 ABC 3 BCEF 4 ADG 5 BDEFH 6 CFI 7 DEGH 8 GHI 9 EFHI (Figure 2) input from the standard input device 9 reads an integer, said the starting position of the clock pointer. 1 = 12 points, 1 = 3 points, 2 = 6 points, 3 = 9 points. Output Output a shortest movement sequence, making nine clock pointers all point to 12 points. According to the size of mobile serial number, output
Platform: | Size: 1024 | Author: jing | Hits:

[Algorithm1228

Description: POJ 1228 求解凸包, 并判断凸包每条边上点的数量-Tu Bao
Platform: | Size: 1024 | Author: Henry | Hits:

[VC/MFC1753

Description: 用位操作+BFS解决.基本思想如下:给棋盘每一个状态赋予一个状态id,id计算方法是将棋盘与数的二进制表示联系起来,如题所给的数据:bwwbbbwbbwwbbwww状态id为6585,计算方法为1*2^0+0*2^1+1*2^2..1*2^12+0*2^13..=6585(其中b代表1,w代表0)在此基础上进行BFS搜索,首先理解一点,先点(0,0)再点(0,1)与先点(0,1)再点(0,0)对结果不造成任何影响.因此遍历棋盘的16个位置,将每次点击后的状态id利用树状结构保存.如-poj 1753
Platform: | Size: 1024 | Author: lzr | Hits:

[Algorithmpoj2696

Description: POJ 2692:假币问题 时间限制: 1000ms 内存限制: 65536kB 描述 赛利有12枚银币。其中有11枚真币和1枚假币。假币看起来和真币没有区别,但是重量不同。但赛利不知道假币比真币轻还是重。于是他向朋友借了一架天平。朋友希望赛利称三次就能找出假币并且确定假币是轻是重。例如:如果赛利用天平称两枚硬币,发现天平平衡,说明两枚都是真的。如果赛利用一枚真币与另一枚银币比较,发现它比真币轻或重,说明它是假币。经过精心安排每次的称量,赛利保证在称三次后确定假币。 输入 第一行有一个数字n,表示有n组测试用例。 对于每组测试用例: 输入有三行,每行表示一次称量的结果。赛利事先将银币标号为A-L。每次称量的结果用三个以空格隔开的字符串表示:天平左边放置的硬币 天平右边放置的硬币 平衡状态。其中平衡状态用``up , ``down , 或 ``even 表示, 分别为右端高、右端低和平衡。天平左右的硬币数总是相等的。 输出 输出哪一个标号的银币是假币,并说明它比真币轻还是重(heavy or light)。-Peking university POJ 2696
Platform: | Size: 1024 | Author: changxin | Hits:

[OtherBiorhythms

Description: poj 1006 生理周期 Description 人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出现高峰的天数(不一定是第一次高峰出现的时间)。你的任务是给定一个从当年第一天开始数的天数,输出从给定时间开始(不包括给定时间)下一次三个高峰落在同一天的时间(距给定时间的天数)。例如:给定时间为10,下次出现三个高峰同天的时间是12,则输出2(注意这里不是3)-poj 1006 menstrual cycles Description born with three menstrual cycles, were physical, emotional and intellectual cycles, their cycle length is 23 days, 28 days and 33 days. Every day is a cycle peak. At the peak, people will behave well in corresponding ways. For example, the peak period of intelligence, quick thinking people, concentration will be easier. Because different circumference three cycles, it is usually peaks of the three cycles of the same day. For each person, we want to know when the peak falls on the same day three. For each period, we will be given the first day of the beginning of the current year, (not necessarily the first time the peak appears) to a peak in the number of days. Your task is given a number of days the first day of the year the number of the output a given start time (not including the given time) the next triple peak the same day (the number of days a given time). For example: given time is 10, with the next peak occurred three days is 12, then
Platform: | Size: 1024 | Author: 宇文霏 | Hits:

CodeBus www.codebus.net