您的位置:首页 > 其它

UVa Problem Solution: 10082 - WERTYU

2008-11-10 18:18 543 查看
The simplest problem ever since...

Code:
/*************************************************************************
* Copyright (C) 2008 by liukaipeng *
* liukaipeng at gmail dot com *
*************************************************************************/

/* @JUDGE_ID 00000 10082 C++ "WERTYU" */

#include <iostream>
#include <fstream>
#include <string>
#include <vector>

using namespace std;

int ncharacters = 128;
int const buffsize = 2048;

int main(int argc, char *argv[])
{
#ifndef ONLINE_JUDGE
filebuf in, out;
cin.rdbuf(in.open((string(argv[0]) + ".in").c_str(), ios_base::in));
cout.rdbuf(out.open((string(argv[0]) + ".out").c_str(), ios_base::out));
#endif

char table[ncharacters];
char x[] = "1234567890-=WERTYUIOP[]//SDFGHJKL;'XCVBNM,./ /n";
char y[] = "`1234567890-QWERTYUIOP[]ASDFGHJKL;ZXCVBNM,. /n";
for (int i = 0; i < sizeof (x); ++i) {
table[x[i]] = y[i];
}

char typo[buffsize];
char type[buffsize];
while (true) {
cin.read(typo, buffsize);
int size = cin.gcount();
for (int i = 0; i < size; ++i) {
type[i] = table[typo[i]];
}
cout.write(type, size);
if (!cin) break;
}

return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: