poj 130题 acm pku

#include<stdio.h> #include<string.h> #include<stdlib.h> int stack[1000]; int zero = 0; int top = 0; struct _node { struct _node * next; int n; //n次 __int64 m; //常数 }; typedef struct _node node; node * head = NULL; node * temp = NULL; node * cur = NULL; int loop = 0; int end_loop = 0; int main(void) { int test,test_count = 0; char str[10]; char cmd[10]; int value = 0; int flag = 0; node *q, *p; scanf("%d",&test); head = (node *)malloc(sizeof(node)); for(test_count = 1; test_count <= test; ++test_count) { scanf("%s",cmd); ++loop; flag = 0; head->next = NULL; cur = (node *)malloc(sizeof(node)); cur->m = 1; cur->n = 0; cur->next = NULL; top = 0; zero = 0; while( 1 ) { scanf("%s",cmd); if( strcmp(cmd,"OP") == 0 ) { scanf("%d",&value); if( value == 0 ) continue; flag = 1; temp = (node *)malloc(sizeof(node)); temp->n = cur->n; temp->m = cur->m * value; temp->next = NULL; if( head->next == NULL ) { head->next = temp; } else { p = head->next; q = head; while( p != NULL && p->n > temp->n ) { q = p; p = p->next; } if( p != NULL && p->n == temp->n ) //找到了与之相同次数的 { p->m = p->m + temp->m; free(temp); } else if( p == NULL ) //temp比p 大 加在最后 { q->next = temp; } else //加在当前位置 { q->next = temp; temp->next = p; } } } else if( strcmp(cmd,"LOOP") == 0 ) { scanf("%s",str); if( str[0] == 'n' ) { stack[top++] = -1; cur->n = cur->n + 1; ++loop; } else { value = atoi(str); if( value == 0 ) { //遇到0的处理方法 ++zero; while( zero ) { scanf("%s",cmd); if( strcmp(cmd,"LOOP") == 0 ) { ++zero; scanf("%s",str); } else if( strcmp(cmd,"END") == 0 ) { --zero; } else { scanf("%s",str); } } } else { stack[top++] = value; cur->m = cur->m * value; ++loop; } } } else if( strcmp(cmd,"END") == 0 ) { ++end_loop; if( loop == end_loop ) break; if( stack[--top] == -1 ) { cur->n = cur->n - 1; } else { cur->m = cur->m / stack[top]; } } } //END WHILE printf("Program #%d\n",test_count); printf("Runtime = "); if( flag == 0 ) { printf("0\n"); } else { p = head->next; while( p ) { if( p->n > 1 ) { if( p->m <= 1 ) printf("n^%d",p->n); else { printf("%I64d*n^%d",p->m,p->n); } } else if( p->n == 1 ) { if( p->m <= 1 ) printf("n",p->n); else { printf("%I64d*n",p->m); } } else { printf("%I64d",p->m); } if( p->next != NULL ) printf("+"); q = p; p = p->next; free(q); } printf("\n"); } printf("\n"); free(cur); } // END FOR free(head); return 0; }