uva 384 Slurpys
2017-04-20 01:40
148 查看
题目:给了slury的语法(由slimp和slump组成),语法分析判断
注意:函数变量用形参
函数设置一个begin变量真的很方便
#include <cstdio>
#include <string.h>
#include <cstdlib>
#include <cmath>
#include <ctgmath>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool slump(char m[61],int &begin){
if(m[begin]=='D' || m[begin]=='E'){
if (m[++begin] == 'F') {
while (m[++begin]=='F');
if(m[begin]=='G') return true;
else if(m[begin]=='D' || m[begin]=='E') return slump(m, begin);
else return false;
}
else return false;
}
else return false;
}
//DFG
// 01234567
//DFG, EFG, DFFFFFG, DFDFDFDFG, DFEFFFFFG
//DFEFF, EFAHG, DEFG, DG, EFFFFDG
bool slimp(char m[61],int &begin){
if (m[begin] == 'A') {
begin++;
if (m[begin] == 'H') return true;
else if (m[begin] == 'B'){
if(slimp(m, ++begin)){
if (m[++begin] == 'C') return true;
else return false;
}
else return false;
}
else if (m[begin]=='D' || m[begin]=='E'){
if(slump(m, begin)){
if (m[++begin] == 'C') return true;
else return false;
}
else return false;
}
else return false;
}
else return false;
}
//AH, ABAHC, ABABAHCC, ADFGC, ADFFFFGC, ABAEFGCC, ADFDFGC
int main(){
int num;
cin>>num;
char input[61];
cout<<"SLURPYS OUTPUT"<<endl;
while (num--) {
cin >> input;
int b = 0;
// cout<<slimp(input, b);
if (slimp(input, b)) {
if (slump(input, ++b)) {
if (b==(strlen(input)-1)) {//防止出现AHDFGA
cout<<"YES"<<endl;
}
else cout<<"NO"<<endl;
}
else cout<<"NO"<<endl;
}
else cout<<"NO"<<endl;
}
cout<<"END OF OUTPUT"<<endl;
return 0;
}
注意:函数变量用形参
函数设置一个begin变量真的很方便
#include <cstdio>
#include <string.h>
#include <cstdlib>
#include <cmath>
#include <ctgmath>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool slump(char m[61],int &begin){
if(m[begin]=='D' || m[begin]=='E'){
if (m[++begin] == 'F') {
while (m[++begin]=='F');
if(m[begin]=='G') return true;
else if(m[begin]=='D' || m[begin]=='E') return slump(m, begin);
else return false;
}
else return false;
}
else return false;
}
//DFG
// 01234567
//DFG, EFG, DFFFFFG, DFDFDFDFG, DFEFFFFFG
//DFEFF, EFAHG, DEFG, DG, EFFFFDG
bool slimp(char m[61],int &begin){
if (m[begin] == 'A') {
begin++;
if (m[begin] == 'H') return true;
else if (m[begin] == 'B'){
if(slimp(m, ++begin)){
if (m[++begin] == 'C') return true;
else return false;
}
else return false;
}
else if (m[begin]=='D' || m[begin]=='E'){
if(slump(m, begin)){
if (m[++begin] == 'C') return true;
else return false;
}
else return false;
}
else return false;
}
else return false;
}
//AH, ABAHC, ABABAHCC, ADFGC, ADFFFFGC, ABAEFGCC, ADFDFGC
int main(){
int num;
cin>>num;
char input[61];
cout<<"SLURPYS OUTPUT"<<endl;
while (num--) {
cin >> input;
int b = 0;
// cout<<slimp(input, b);
if (slimp(input, b)) {
if (slump(input, ++b)) {
if (b==(strlen(input)-1)) {//防止出现AHDFGA
cout<<"YES"<<endl;
}
else cout<<"NO"<<endl;
}
else cout<<"NO"<<endl;
}
else cout<<"NO"<<endl;
}
cout<<"END OF OUTPUT"<<endl;
return 0;
}
相关文章推荐
- UVA_384_Slurpys
- uva 594 One Little, Two Little, Three Little Endians
- uva 11078 Open Credit System
- UVAlive 6152 Bits Equalizer 解题报告
- UVa 10878 磁带解码
- UVA 11426 欧拉函数
- Stamps and Envelope Size - UVa 242 dp
- UVa 10723 Cyborg Genes(LCS变种)
- uva 11186
- UVA_10667_Largest Block
- Gym 100299C && UVaLive 6582 Magical GCD (暴力+数论)
- UVA 1393 Highways(数学思想)
- UVa 7037 ACM/ICPC 2014 Xian(网络流+最大密度子图)
- UVa Problem 10137 The Trip (旅行)
- Uva 216 - Getting in Line
- uva 1339 Ancient Cipher(字符串处理)
- uva 10891 - Game of Sum
- UVA 1351 - String Compression
- UVA11624大火蔓延的迷宫
- UVa-1368 - DNA Consensus String