2045 锛氫笉瀹规槗绯诲垪涔?三)鈥斺€?LELE鐨凴PG闅鹃

2045 锛氫笉瀹规槗绯诲垪涔?3)鈥斺€?LELE鐨凴PG闅鹃
涓嶅鏄撶郴鍒椾箣(3)鈥斺€?LELE鐨凴PG闅鹃

鏉數oj锛岀畝鍗曢€掓帹锛屾敞鎰忚鎺掗櫎棣栧熬鐩稿悓鐨勪覆锛屼絾鏄紝涓嶈兘鎺掗櫎闀垮害灏忎簬n鐨勯灏剧浉鍚岀殑涓层€傝繖鏍锋墠涓嶄細瀵艰嚧婕忚В銆?

鏉數OJ棰樼洰閾炬帴

#include <stdio.h>
#include <string.h>

int main() {
	int i, n;
	__int64 f[55][4][4], sum;
	memset(f, 0, sizeof(f));
	f[1][0][0] = 1;
	f[1][1][1] = 1;
	f[1][2][2] = 1;
	
	f[2][0][1] = 1;
	f[2][0][2] = 1;
	f[2][1][0] = 1;
	f[2][1][2] = 1;
	f[2][2][0] = 1;
	f[2][2][1] = 1;
	
	f[3][0][1] = 1;
	f[3][0][2] = 1;
	f[3][1][0] = 1;
	f[3][1][2] = 1;
	f[3][2][0] = 1;
	f[3][2][1] = 1;
	
	f[3][0][0] = 2;
	f[3][1][1] = 2;
	f[3][2][2] = 2;
		
	while(scanf("%d", &n) != EOF) {
		if(n < 4) {
			if(n < 3) printf("%d\n", 3*n);
			else	  printf("6\n");	
			continue;
		}
		sum = 0;
		
		for(i=4; i<=n; i++) {

			f[i][0][0] = f[i-1][0][1] + f[i-1][0][2];
			f[i][1][1] = f[i-1][1][0] + f[i-1][1][2];
			f[i][2][2] = f[i-1][2][0] + f[i-1][2][1]; 		
			 	
			f[i][0][1] = f[i-1][0][0] + f[i-1][0][2]; 
			f[i][0][2] = f[i-1][0][0] + f[i-1][0][1]; 
					
			f[i][1][0] = f[i-1][1][1] + f[i-1][1][2];  
			f[i][1][2] = f[i-1][1][0] + f[i-1][1][1]; 
			
			f[i][2][0] = f[i-1][2][1] + f[i-1][2][2];
			f[i][2][1] = f[i-1][2][0] + f[i-1][2][2]; 
		}		
		
		sum = f[n][0][1] + f[n][0][2] + f[n][1][0] + 
			  f[n][1][2] + f[n][2][0] + f[n][2][1]; 
			  
		printf("%I64d\n", sum);	
	}
	return 0;
}

寮曠敤

Problem Description
浜虹О鈥淎C濂充箣鏉€鎵嬧€濈殑瓒呯骇鍋跺儚LELE鏈€杩戝拷鐒剁帺璧蜂簡娣辨矇锛岃繖鍙€ュ潖浜嗕紬澶氣€淐ole鈥濓紙LELE鐨勭矇涓?鍗?鍙箰"锛?缁忚繃澶氭柟鎵撴帰锛屾煇璧勬繁Cole缁堜簬鐭ラ亾浜嗗師鍥狅紝鍘熸潵锛孡ELE鏈€杩戠爺绌惰捣浜嗚憲鍚嶇殑RPG闅鹃:

鏈夋帓鎴愪竴琛岀殑锝庝釜鏂规牸锛岀敤绾?Red)銆佺矇(Pink)銆佺豢(Green)涓夎壊娑傛瘡涓牸瀛愶紝姣忔牸娑備竴鑹诧紝瑕佹眰浠讳綍鐩搁偦鐨勬柟鏍间笉鑳藉悓鑹诧紝涓旈灏句袱鏍间篃涓嶅悓鑹诧紟姹傚叏閮ㄧ殑婊¤冻瑕佹眰鐨勬秱娉?

浠ヤ笂灏辨槸钁楀悕鐨凴PG闅鹃.

濡傛灉浣犳槸Cole,鎴戞兂浣犱竴瀹氫細鎯冲敖鍔炴硶甯姪LELE瑙ｅ喅杩欎釜闂鐨?濡傛灉涓嶆槸,鐪嬪湪浼楀婕備寒鐨勭棝涓嶆鐢熺殑Cole濂崇殑闈㈠瓙涓?浣犱篃涓嶄細琚栨墜鏃佽鍚?

Input
杈撳叆鏁版嵁鍖呭惈澶氫釜娴嬭瘯瀹炰緥,姣忎釜娴嬭瘯瀹炰緥鍗犱竴琛?鐢变竴涓暣鏁癗缁勬垚锛?0<n<=50)銆?

Output
瀵逛簬姣忎釜娴嬭瘯瀹炰緥锛岃杈撳嚭鍏ㄩ儴鐨勬弧瓒宠姹傜殑娑傛硶锛屾瘡涓疄渚嬬殑杈撳嚭鍗犱竴琛屻€?

Sample Input
1
2

Sample Output
3
6

璇存槑	鏈枃涓哄師鍒涳紝杞浇璇锋敞鏄庡嚭澶勩€?/a>
Author	skywolf

2045 锛氫笉瀹规槗绯诲垪涔?三)鈥斺€?LELE鐨凴PG闅鹃

相关推荐