Study 시저 복호화 알고리즘 bslime 2008. 5. 31. 15:44 #include <iostream> using namespace std; int main() { int count, add; char encode[] = "GungJnfRnfl"; int encode_ascii[11]; for(count=0; count<11; count++) { encode_ascii[count] = (int)encode[count]; } for(add=0; add<26; add++) { for(count=0; count<11; count++) { encode_ascii[count]++; if(encode_ascii[count] == 91) { encode_ascii[count]-=26; } if(encode_ascii[count] == 123) { encode_ascii[count]-=26; } cout << (char)encode_ascii[count]; } cout << '\n'; } return 0; } 간만에 써본 c++,Casper 레포트