小shan在努力~

#include#include#include#includeusing namespace std;int main(){ int ncases; char ch; cin>>ncases; getchar(); //一个字符一个字符判断 while(ncases--) { ch=getchar();

Don't Get RookedIn chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at most 44) that can also conta

Dick and JaneTime Limit: 2 Seconds      Memory Limit: 65536 KB Dick is 12 years old. When we say this, we mean that it is at least twelve and not yet thirteen years since Dick was born.D

Number StepsTime Limit: 2 Seconds      Memory Limit: 65536 KB Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the figure. For example,

All in AllInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MBYou have devised a new encryption technique which encodes a message by inserting between its cha