[POJ 1351] Number of Locks

真·skysys

于 2016-07-07 09:42:09 发布

阅读量448

点赞数 1

分类专栏：算法与数学文章标签： DP poj

请明确标注出处

本文链接：https://blog.youkuaiyun.com/qq_33583069/article/details/51848657

版权

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

这道题目描述了一种弹簧锁的制造过程，每个锁有n个槽位，槽位高度可以是1、2、3或4。锁的设计要求至少有一对相邻槽位高度差为3，并且锁中必须有至少3种不同的高度。输入给出每个锁的槽位数n，任务是计算在满足条件的情况下，能制造出多少种不同的锁。样例输入包括2个槽位和3个槽位的情况，以及结束标志-1。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Number of Locks
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 1326 Accepted: 642

Description
In certain factory a kind of spring locks is manufactured. There are n slots (1 < n < 17, n is a natural number.) for each lock. The height of each slot may be any one of the 4 values in｛1,2,3,4｝( neglect unit ). Among the slots of a lock there are at least one pair of neighboring slots with their difference of height equal to 3 and also there are at least 3 different height values of the slots for a lock. If a batch of locks is manufactured by taking all over the 4 values for slot height and meet the two limitations above, find the number of the locks produced.

Input
There is one given data n (number of slots) on every