HDU:1048.The Hardest Problem Ever
来源:互联网 发布:大数据精准营销案例 编辑:程序博客网 时间:2024/05/17 02:41
记得 这道题在校赛上遇到过,那时没解得出来,如今来看这道题,感觉实在太水了,也说明这段时间有了进步,继续加油吧,骚年!
#include<stdio.h>#include<string.h>char ci[1000000],st[10],en[10];char Cipher[30]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'},Plain[30]={'V','W','X','Y','Z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U'};int main(){ while(scanf("%s",st)!=EOF){ getchar(); if(strcmp(st,"ENDOFINPUT")==0) break; gets(ci); scanf("%s",en); getchar(); int len=strlen(ci); for(int i=0;i<len;++i){ if(ci[i]>=65&ci[i]<=90) printf("%c",Plain[ci[i]-'A']); else printf("%c",ci[i]); } printf("\n"); } return 0;}
- HDU:1048.The Hardest Problem Ever
- HDU The Hardest Problem Ever
- The Hardest Problem Ever HDU
- HDU 1048 The Hardest Problem Ever
- (hdu 1048)The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever(水题)
- HDU 1048 The Hardest Problem Ever
- Android客户端通过GET和POST向服务器发送数据
- linux获取系统当前函数
- Amazon Dynamo论文解读 — Dynamo数据划分算法
- STL算法学习
- 像素
- HDU:1048.The Hardest Problem Ever
- 计算几何专项:UVa 811
- 编译原理--文法基础知识
- 一个效率很高的归并排序算法!
- 大白话解析模拟退火算法
- 类与类之间的关系
- 数字转化成字符串或者字符串转化成数字
- nginx平台初探(100%)
- 使用memcached及启动项参数说明