jrz1900博客

题目描述：  Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a substring of B? For example, the text string B is ‘1001110110’

//有3个国家名，找出按字母顺序排在最前面的国家字符串 代码如下： #include #include using namespace std; int main() { void smallest_string(char str[ ][30],int i);//函数声明 int i; char country_name[3][30];//定义二维字符数组,把一个二