Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total Submission (s): 35148 Accepted Submission (s): 14106
problem DescriptionCalled "AC female killer" Super Idol Lele recently suddenly played a deep, this can be nasty many "Cole" (Lele fans, that is, "Cola"), after a lot of snooping, a veteran Cole finally know the reason, originally, Lele recently studied the famous RPG puzzle:
There are rows of n squares, with red (red), powder (Pink), Green (green) Three colors each lattice, each color, requires that any adjacent squares can not be the same color, and the first and the first two squares also different colors. All the requirements of the coating method.
These are the famous RPG puzzles.
If you are Cole, I think you will be able to help Lele solve the problem, if not, look at the many beautiful pain of the Cole Girl's face, you will not stand by?
InputThe input data contains multiple test instances, one row per test instance, and an integer n, (0<n<=50).
Outputfor each test instance, output all of the required coating methods, one row for each instance output.
Sample Input
12
Sample Output
36
#include <stdio.h>
int main ()
{
int i,m,a,b;
Double x[52];
x[1]=3;
x[2]=6;
x[3]=6;
for (i=4; i<52; i++)
x[i]=x[i-1]+x[i-2]*2;
while (scanf ("%d", &m)!=eof)
{
printf ("%.lf\n", X[m]);
}
return 0;
}
Not easy series of (3)--lele RPG puzzles
