救!样例全队但是蜜汁全WA

P1079 [NOIP2012 提高组] Vigenère 密码

你多输出了很多东西
by lzx1999 @ 2020-10-14 21:26:59


您输出了中间结果\kk
by Mr_steamedbread @ 2020-10-14 21:28:37


谢谢各位dalao ~~(其实这些是我debug时弄得,忘了删了……)~~
by Hz138588 @ 2020-10-28 19:09:47


等等……
by Hz138588 @ 2020-10-28 19:11:09


还有bug!WA了7个! 改后: ```c++ #include<bits/stdc++.h> using namespace std; int main(void) { string word,key; cin>>key; cin>>word; int ks=key.size(); for(int i=0; i<word.size(); i++) { if(word[i]<'a'&&word[i]>='A') { if(key[i%ks]>'a') word[i]-=key[i%ks]-'a'; else word[i]-=key[i%ks]-'A'; if(word[i]<'A') word[i]+=26; } if(word[i]>='a') { if(key[i%ks]>'a') word[i]-=key[i%ks]-'a'; else word[i]-=key[i%ks]-'A'; if(word[i]<'a') word[i]+=26; } } cout<<word; return 0; } ```
by Hz138588 @ 2020-10-28 19:11:48


```cpp#include<iostream> #include<cstdio> #include<cstring> #include<string> using namespace std; int main() { char a[101],b[1001]; char d[1001]; cin>>a>>b; int c=strlen(b); int f=strlen(a); for(int i=0;i<c;i++) { d[i]=a[i%f]; } for(int i=0;i<c;i++) { b[i]-=(d[i]-97); if(b[i]<97){ int ff=97-int(b[i]); b[i]=char(123-ff); } } cout<<b; return 0; } //97
by SPFA @ 2020-10-31 16:45:45


同求
by SPFA @ 2020-10-31 16:46:09


|