poj 1480 如何用程序实现m^n

最新推荐文章于 2016-04-04 16:45:58 发布

xiepenghakuna

最新推荐文章于 2016-04-04 16:45:58 发布

阅读量632

点赞数

分类专栏：数据结构与算法文章标签： div

本文链接：https://blog.csdn.net/xiepenghakuna/article/details/5778152

版权

数据结构与算法专栏收录该内容

7 篇文章 0 订阅

订阅专栏

问题描述

见http://acm.pku.edu.cn/JudgeOnline/problem?id=1480

问题分析

暴力法，从只需2两步到需要10步往下分析，每一步从 ADD, SUB, MUL, DIV and DUP任选一个。那么第i（2<=i<=10)步的时候，运算量是5^i。这个是不能用for做的，想要写m^n还得用函数的递归实现。

代码

#include <cstdio> #include <cmath> #include <algorithm> #include <float.h> using namespace std; #define M 12 enum e_op{ADD, DIV, DUP, MUL, SUB}; char szBuf[][4] = {"ADD", "DIV", "DUP", "MUL", "SUB"}; int g_n; int g_ax[M], g_ay[M]; // int g_stack[M][8]; // e_op g_op[M]; int g_nTry; bool Func() { int numTop, iTop; int iTopAdd; for (int i=0; i<g_n; i++) g_stack[i][0] = g_ax[i]; iTop = 0; // for (int i=0; i<g_nTry; i++) { for (int j=0; j<g_n; j++) { switch(g_op[i]) { case ADD: numTop = g_stack[j][iTop]; g_stack[j][iTop-1] += numTop; iTopAdd = -1; break; case DIV: numTop = g_stack[j][iTop]; if (numTop == 0) return false; g_stack[j][iTop-1] /= numTop; iTopAdd = -1; break; case DUP: numTop = g_stack[j][iTop]; g_stack[j][iTop+1] = numTop; iTopAdd = 1; break; case MUL: numTop = g_stack[j][iTop]; g_stack[j][iTop-1] *= numTop; iTopAdd = -1; break; case SUB: numTop = g_stack[j][iTop]; g_stack[j][iTop-1] -= numTop; iTopAdd = -1; break; } if (g_stack[j][iTop-1] > 30000 || g_stack[j][iTop-1] < -30000) return false; } // iTop += iTopAdd; } bool bIdent = true; for (int i=0; i<g_n; i++) if (g_stack[i][0] != g_ay[i]) return false; return true; } bool Try(int nDup, int nth) { if (nth == g_nTry) { for (int i=0; i<5; i++) { if (i!=DUP) { g_op[g_nTry-1] = (e_op)i; if (Func() ) return true; } } // return false; } // if (nDup*2==nth && nDup*2<g_nTry) { g_op[nth] = DUP; return Try(nDup+1, nth+1); } else { for (int i=0; i<5; i++) { if (i!=DUP) { g_op[nth] = (e_op)i; if (Try(nDup, nth+1) ) return true; } else if (i==DUP && nDup*2<g_nTry) { g_op[nth] = (e_op)i; if (Try(nDup+1, nth+1) ) return true; } } // } return false; } void PrintOp() { for (int i=0; i<g_nTry; i++) printf("%s ", szBuf+(int)(g_op[i]) ); printf("/n"); } int main() { //freopen("ReadMe.txt", "r", stdin); int nCase = 1; bool bIdent; while (scanf("%d", &g_n) && g_n) { for (int i=0; i<g_n; i++) scanf("%d", &(g_ax[i]) ); for (int i=0; i<g_n; i++) scanf("%d", &(g_ay[i]) ); // bIdent = true; for (int i=0; i<g_n; i++) { if (g_ax[i] != g_ay[i]) { bIdent = false; break; } } printf("Program %d/n", nCase++); if (bIdent) printf("Empty sequence/n"); else { for (g_nTry=2; g_nTry<=10; g_nTry+=2) { if (Try(0, 0) ) { PrintOp(); break; } } // if (g_nTry>10) printf("Impossible/n"); } printf("/n"); } return 0; }