Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
贴个代码,给大家抛砖引玉。。。#include<stdio.h> #include<stdlib.h> #include<string.h> int state[5]; char s[205]; int l=0; int ind() { char ch=s[l++]; printf(""); switch(ch) { case 'p': case 'q': case 'r': case 's': case 't': return state[ch-'p']; break; case 'K': return ind()&ind(); break; case 'A': return ind()|ind(); break; case 'N': return !ind(); break; case 'C': return !ind()|ind(); break; case 'E': return ind()==ind(); break; } } int main() { scanf("%s", s); while(s[0]!='0') { int len=strlen(s); int mark=1; for(state[0]=0; state[0]<=1 && mark; state[0]++) { for(state[1]=0; state[1]<=1 && mark; state[1]++) { for(state[2]=0; state[2]<=1 && mark; state[2]++) { for(state[3]=0; state[3]<=1 && mark; state[3]++) { for(state[4]=0; state[4]<=1 && mark; state[4]++) { l=0; if(ind()==0) mark=0; } } } } } if(mark==1) printf("tautology\n"); else printf("not\n"); scanf("%s", s); } return 0; } Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator