题意不多说,直接解释需要模拟的东西吧。
题目中会给你一段题中创造的程序,这个程序除了最开始的BEGIN到END,内部就是从LOOP到END,中间的所有OP或者是其他嵌套的程序都是相加关系,最后的LOOP x是将内部的式子乘x,拿输入样例举例
BEGIN LOOP n OP 4 LOOP 3 LOOP n OP 1 END OP 2 END OP 1 END OP 17 END这个就可一写成n*(3*((n*1)+2)+1+4)+17化简之后就是输出了。这道题本人用了栈的方法,loop和op进栈,end出栈并且一直出道与它最近的loop为止。在出栈过程中,我设定了一个表达式状态数组,数组每行从0-10下标表示n的指数,存储的数据为对应项的系数。对于每次出栈,我先让数组继承上一个状态arr[top][i] += arr[top+1][i];并把上一个状态清0。然后对于每个OP将后面的值加入到当前状态数组第0位(arr[top][0] += arr[top+1][0] + sta[top].d;)再遇到LOOP之后如果LOOP后面的字符是n那么就让数组每位后移,如果字符是数,那么就每位*x(arr[top][i] += arr[top+1][i]*sta[top].d;)需要注意的是,每次对上一状态的继承不是对上一状态的直接赋值,而是前态和现态的累加。
该题还需要注意的是各种输出限制,例如n的一次方只写n不写n^1,还有系数的正负等等,本人比较笨,160行的代码80行的输出,就为了控制输出格式……
代码后面会附上网上找到的11组测试数据
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;
struct node
{
char str[20];
char c;
int d;
}sta[100000];
int main()
{
int t;
char d[20],dd[20];
int ca=1;
int arr[101][11];
scanf("%d%*c",&t);
while(t--)
{
memset(arr,0,sizeof(arr));
int top=1;
scanf("%s",d);
while(top)
{
scanf("%s",d);
if(strcmp(d,"END")==0)
{
top--;
while(strcmp(sta[top].str,"LOOP")!=0&&top!=0)
{
for(int i=1;i<=10;i++){
arr[top][i] += arr[top+1][i];
arr[top+1][i]=0;
}
arr[top][0] += arr[top+1][0] + sta[top].d;
arr[top+1][0]=0;
top--;
}
if(top==0)break;
if(sta[top].c=='n')
{
for(int i=10;i>0;i--)
{
arr[top][i]=arr[top+1][i-1];
arr[top+1][i-1]=0;
}
arr[top][0]=0;
}
else{
for(int i=0;i<=10;i++){
arr[top][i] += arr[top+1][i]*sta[top].d;
arr[top+1][i]=0;
}
}
}
else
{
scanf("%s",dd);
if(dd[0]=='n')
{
sta[top].c='n';
sta[top].d=0;
}
else
{
int len=strlen(dd);
int t=1;
int l=0;
for(int i=len-1;i>=0;i--)
{
l+=(dd[i]-'0')*t;
t*=10;
}
sta[top].c=' ';
sta[top].d=l;
}
strcpy(sta[top++].str,d);
}
}
printf("Program #%d\n",ca++);
printf("Runtime = ");
int flag=1;
for(int i=10;i>=1;i--)
{
if(arr[1][i]!=0&&i!=1){
if(flag){
if(arr[1][i]==1)
printf("n^%d",i);
else if(arr[1][i]==-1)
printf("-n^%d",i);
else
printf("%d*n^%d",arr[1][i],i);
flag=0;
}
else if(arr[1][i]>0)
{
if(arr[1][i]==1)
printf("+n^%d",i);
else
printf("+%d*n^%d",arr[1][i],i);
}
else if(arr[1][i]<0)
{
if(arr[1][i]==-1)
printf("-n^%d",i);
else
printf("%d*n^%d",arr[1][i],i);
}
}
else if(arr[1][i]!=0&&i==1)
{
if(flag){
if(arr[1][i]==1)
printf("+n");
else if(arr[1][i]==-1)
printf("-n");
else
printf("%d*n",arr[1][i]);
flag=0;
}
else if(arr[1][i]>0)
{
if(arr[1][i]==1)
printf("+n");
else
printf("+%d*n",arr[1][i]);
}
else if(arr[1][i]<0)
{
if(arr[1][i]==-1)
printf("-n");
else
printf("%d*n",arr[1][i]);
}
}
}
if(arr[1][0]>0){
if(flag)printf("%d\n",arr[1][0]);
else printf("+%d\n",arr[1][0]);
}
else if(arr[1][0]<0)
printf("%d\n",arr[1][0]);
else{
if(flag) printf("0\n");
else printf("\n");
}
printf("\n");
}
return 0;
}
Sample Input
11
BEGIN
LOOP n
OP 4
LOOP 3
LOOP n
OP 1
END
OP 2
END
OP 1
END
OP 17
END
BEGIN
OP 1997 LOOP n LOOP n OP 1 END END
END
BEGIN
LOOP 0 OP 17 END
END
BEGIN
LOOP n OP 0 END
END
BEGIN
OP 1 LOOP n LOOP n OP 3 LOOP n OP 2 END END END
END
BEGIN
LOOP n OP 1
LOOP n OP 2
LOOP n OP 3
LOOP n OP 4
LOOP n OP 5
LOOP n OP 6
LOOP n OP 7
LOOP n OP 8
LOOP n OP 9
LOOP n OP 10
END END END END END
LOOP 17 LOOP n LOOP n OP 3 END END END
END END END END END
END
BEGIN LOOP 1 LOOP 2 LOOP 3 OP 1 LOOP 4 LOOP 5 LOOP 6 LOOP 7 LOOP 8 OP 1
END END END END OP 2 END END END END OP 17 END
BEGIN OP 1 OP 2 OP 3 OP 4 OP 5 OP 6 OP 7 OP 8 OP 9 OP 10 OP 11 OP 12 END
BEGIN LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n
OP 12345 END END END END END END END END END END END
BEGIN OP
17
LOOP 2
LOOP n
LOOP
2 OP
4 LOOP
n OP 4
LOOP n OP 5
END
END OP 4 END
END END
END
BEGIN
OP 0 LOOP n LOOP
n
OP 88 OP 0 LOOP n LOOP 0 OP 17 END END
END END
OP 0 LOOP n LOOP 3 OP 0 END
END OP 8
END
11
BEGIN
LOOP n
OP 4
LOOP 3
LOOP n
OP 1
END
OP 2
END
OP 1
END
OP 17
END
BEGIN
OP 1997 LOOP n LOOP n OP 1 END END
END
BEGIN
LOOP 0 OP 17 END
END
BEGIN
LOOP n OP 0 END
END
BEGIN
OP 1 LOOP n LOOP n OP 3 LOOP n OP 2 END END END
END
BEGIN
LOOP n OP 1
LOOP n OP 2
LOOP n OP 3
LOOP n OP 4
LOOP n OP 5
LOOP n OP 6
LOOP n OP 7
LOOP n OP 8
LOOP n OP 9
LOOP n OP 10
END END END END END
LOOP 17 LOOP n LOOP n OP 3 END END END
END END END END END
END
BEGIN LOOP 1 LOOP 2 LOOP 3 OP 1 LOOP 4 LOOP 5 LOOP 6 LOOP 7 LOOP 8 OP 1
END END END END OP 2 END END END END OP 17 END
BEGIN OP 1 OP 2 OP 3 OP 4 OP 5 OP 6 OP 7 OP 8 OP 9 OP 10 OP 11 OP 12 END
BEGIN LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n
OP 12345 END END END END END END END END END END END
BEGIN OP
17
LOOP 2
LOOP n
LOOP
2 OP
4 LOOP
n OP 4
LOOP n OP 5
END
END OP 4 END
END END
END
BEGIN
OP 0 LOOP n LOOP
n
OP 88 OP 0 LOOP n LOOP 0 OP 17 END END
END END
OP 0 LOOP n LOOP 3 OP 0 END
END OP 8
END
Sample Output
Program #1
Runtime = 3*n^2+11*n+17
Program #2
Runtime = n^2+1997
Program #3
Runtime = 0
Program #4
Runtime = 0
Program #5
Runtime = 2*n^3+3*n^2+1
Program #6
Runtime = 10*n^10+9*n^9+8*n^8+58*n^7+6*n^6+5*n^5+4*n^4+3*n^3+2*n^2+n
Program #7
Runtime = 40391
Program #8
Runtime = 78
Program #9
Runtime = 12345*n^10
Program #10
Runtime = 20*n^3+16*n^2+32*n+17
Program #11
Runtime = 88*n^2+8
Program #1
Runtime = 3*n^2+11*n+17
Program #2
Runtime = n^2+1997
Program #3
Runtime = 0
Program #4
Runtime = 0
Program #5
Runtime = 2*n^3+3*n^2+1
Program #6
Runtime = 10*n^10+9*n^9+8*n^8+58*n^7+6*n^6+5*n^5+4*n^4+3*n^3+2*n^2+n
Program #7
Runtime = 40391
Program #8
Runtime = 78
Program #9
Runtime = 12345*n^10
Program #10
Runtime = 20*n^3+16*n^2+32*n+17
Program #11
Runtime = 88*n^2+8