small_small_chick的专栏

hdu1073Online Judge #include using namespace std; #define N 256 #define M 5010 char source[M]; char dist[M]; int m_hash[N]; int main() { int i, n, t; char tmpstr[N]; while(scanf("%d",

hdu1210Eddy's 洗牌问题 //求交叉换位循环最后和原串相同的次数 #include #include #include using namespace std; int main() { int n, i,j,k; int maxN, num; while(scanf("%d", &n) != EOF) {   n *= 2; i =

#include #include using namespace std; #define NSIZ 1010 char str[NSIZ]; char source[27] = {"QWERTYUIOPASDFGHJKLZXCVBNM"}; char target[27] = {"ABCDEFGHIJKLMNOPQRSTUVWXYZ"}; typedef st

#include using namespace std; #define NSIZ 40 char str1[NSIZ]; char str2[NSIZ]; int  num[27]; int num_n_1[27]; int num_n_2[27]; int main() { int t, i, n1, n2, j,k; scanf("%d", &t);

水题：数字的反转，123变成321，  复数时前导0去掉 比如-100变成-1 #include using namespace std; #define N 10000 int Reverse(int inNum) { int sum = 0; if (inNum < 10) { return inNum; } while(inNum%10 == 0) inNum /=