qq_44797733的博客

题目连接： https://vjudge.net/problem/ZOJ-4060 思路：遍历找到俩个字符串不同的段数，通过观察可以发现，假设段数X 1.X=0 C(n,2)+n 2 X=1 2*(n-1)自己可以推算一下 3X=2 6 4 X> =3 0 code : #include<iostream> #include<cstdio> using namespace std; const int ...

A. Even But Not Even time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Let's define a numberebne (even but not even)if and only if...