NYOJ 280 LK的项链 :click here POJ 2409 Let it Bead:click here 题意:一盒有红、蓝、绿三种颜色的珠子,每种颜色珠子的个数都大于24,现在LK想用这一盒珠子穿出一条项链,项链上的珠子个数为n(0<=n<=24),请你帮她计算一下一共可以用这一盒珠子可以穿出多少条不同的项链。通过旋转、翻转达到同一种状态的被认为是相同的项链。
Makefile # the above include may override LKROOT and LKINC to allow external# directories to be included in the build-include lk_inc_lc.mk LKMAKEROOT ?= .LKROOT ?= .LKINC ?=BUILDROOT ?= .DEFAU