CodeVs 1197 && noip 2012 Day1 Vigenère密码

这一纯粹是找规律，好水呀..不过在转换的时候要注意一下，不然很容易会wa...所以处理这些字符与数字必须要严谨....

#include<cstdio>#include<string>#include<cstring>#include<iostream>using namespace std;char word[28];void init(){char s='a';int tot=0;for (int i=0; i<=25; i++){word[++tot]=int(s+i);}}int main(){init();string ms;string mw;cin>>ms>>mw;    int tot=0;    for (int i=0; i<ms.size(); i++)    {    if (ms[i]>='A' && ms[i]<='Z') ms[i]-=('A'-'a');    }    for (int i=0; i<mw.size(); i++)    {    if (tot>ms.size()-1) tot=0;char s=mw[i];    if (mw[i]>='A' && mw[i]<='Z'){        s-='A'-'a';        if (s<ms[tot]) cout<<char('z'-(ms[tot]-s)+'A'-'a'+1);    else cout<<char(s-ms[tot]+'a'+'A'-'a');    }    else if (s<ms[tot]) cout<<char('z'-(ms[tot]-s)+1);else cout<<char(s-ms[tot]+'a');    tot++;    }    cout<<endl;return 0;}