栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 3550 AT – sequence

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 3550 AT – sequence

#include <cstdio>#include <cstring>#include <algorithm>#include <cctype>using namespace std;int len;int next(int state, char c);char wd[1000];bool spc(char c){return c == '&' || c == '#' || c == '@';}void output(int s, int t){int i;for (i = s; i < t; ++i)putchar(wd[i]);putchar('n');}int main(){int i, j, k, pre,  state = 0;scanf("%s", wd+1);len = strlen(wd+1);if (len == 2){puts("");return 0;}pre = 3; state = 2;for (i = 3; i <= len + 1; ++i){state = next(state, wd[i]);if (state == 2){state = next(state, wd[i]);output(pre, i);pre = i;}}return 0;}int next(int state, char c){if (c == 0) return 2;if (state == 0){if (c == 'A') return 1;}if (state == 1){if (c == 'T') return 1;}if (state == 2){if (isupper(c))return 3;if (spc(c))return 4;}if (state == 3){if (isupper(c))return 5;if (spc(c))return 2;if (isdigit(c))return 6;if (c == '=')return 7;}if (state == 4){return 5;}if (state == 5){if (isupper(c) || spc(c))return 2;if (isdigit(c))return 6;if (c == '=')return 7;}if (state == 6){if (isdigit(c))return 6;if (c == '=')return 7;return 2;}if (state == 7){if (isdigit(c))return 7;return 2;}}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/378099.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号