HDOJ(~1004)

T1000

 #include <stdio.h>
 int main()
 {
     int a, b;
     while (scanf("%d %d", &a, &b) != EOF)
         printf("%d\n", a + b);
     return ;
 }

T1001

 #include <stdio.h>
 #ifdef AUTHOR
 Code By Hatsuakira Tenan
 #endif
 int f(int n)
 {
     int js = ;
     for (; n > ; --n)
         js += n;
     return js;
 }
 int main()
 {
     int n;
     while (scanf("%d", &n) != EOF)
         printf("%d\n\n", f(n));
     return ;
 }

T1002

 #include <stdio.h>
 #include <string.h>
 #include <stdlib.h>
 #include <algorithm>
 #define MAXLENGTH 1002
 #define MAXCARRY 10000
 #ifdef AUTHOR
 Code By Hatsuakira Tenan
 #endif
 struct largeint
 {
     int num[MAXLENGTH], len;
     largeint()
     {
         len = ;
         memset(num, , sizeof(num));
     }
 };
 void scanf_override(largeint &input)
 {
     int tmplen;
     char tmp[MAXLENGTH];
     scanf("%s", tmp);
     std::reverse(tmp, tmp + (tmplen = strlen(tmp)));
     input.len = tmplen /  + (tmplen %  > );
     for (int i = , j = ; i < tmplen; ++i, ++j)
     {
         input.num[j] = tmp[i] - '';
         if (tmp[++i] == '\0')
             break;
         input.num[j] +=  * (tmp[i] - '');
         if (tmp[++i] == '\0')
             break;
         input.num[j] +=  * (tmp[i] - '');
         if (tmp[++i] == '\0')
             break;
         input.num[j] +=  * (tmp[i] - '');
     }
 }
 inline largeint operator +(largeint a, largeint b)
 {
     int tmp = ;
     a.len = std::max(a.len, b.len);
     for (int i = ; i < a.len; ++i)
     {
         a.num[i] += b.num[i] + tmp;
         tmp = a.num[i] / MAXCARRY;
         a.num[i] %= MAXCARRY;
     }
     if (tmp > )
         a.num[a.len++] = ;
     return a;
 }
 void printf_override(largeint output)
 {
     printf("%d", output.num[--output.len]);
     for (int i = output.len - ; i > -; --i)
         printf("%04d", output.num[i]);
 }
 void work(int k)
 {
     largeint a = largeint(), b = largeint();
     scanf_override(a);
     scanf_override(b);
     printf("Case %d:\n", k + );
     printf_override(a);
     printf(" + ");
     printf_override(b);
     printf(" = ");
     a = a + b;
     printf_override(a);
     printf("\n");
 }
 int main()
 {
     int T;
     scanf("%d", &T);
     work();
     for (int i = ; i < T; ++i)
         { printf("\n"); work(i); }
     return ;
 }

T1003

最长连续子序列和, 根据数据范围(N<=100, 000 & T<=20)选择使用O(n)的算法, 是较为基础的动态规划.

 #include <stdio.h>
 #include <limits.h>
 #define MAXLENGTH 100005
 #ifdef AUTHOR
 Code By Hatsuakira Tenan
 #endif
 int number[MAXLENGTH], start, end, max;
 void dp(int length)
 {
     int max_tmp = , start_tmp = , end_tmp = ;
     max_tmp = max = INT_MIN;
     for (int i = ; i < length; ++i)
     {
         if (max_tmp < )
         {
             if (number[i] > max_tmp)
             {
                 max_tmp = number[i];
                 start_tmp = end_tmp = i;
                 if (max < max_tmp)
                 {
                     max = max_tmp;
                     start = start_tmp;
                     end = end_tmp;
                 }
             }
         }
         else
         {
             max_tmp += number[i];
             end_tmp = i;
             if(max_tmp > max)
             {
                 max = max_tmp;
                 start = start_tmp;
                 end = end_tmp;
             }
         }
     }
 }
 void work(int R)
 {
     printf("Case %d:\n", R);
     int n;
     scanf("%d", &n);
     for (int i = ; i < n; ++i)
         scanf("%d", &number[i]);
     dp(n);
     printf("%d %d %d\n", max, start + , end + );
 }
 int main()
 {
     int T;
     scanf("%d", &T);
     for (int i = ; i < T; printf("\n"), ++i)
         work(i);
     work(T);
     return ;
 }

T1004 用STL 做这个题很耍赖, 但是鉴于数据量不大所以直接暴力遍历也是可以的.

 #include <stdio.h>
 #include <string.h>
 #include <map>
 #include <string>
 using std::map;
 using std::string;
 map<string, int> set;
 void work(int n)
 {
     set.clear();
     int maxn = -;
     string tmp_stl_string;
     char tmp_string[];
     for (int i = ; i < n; tmp_stl_string = tmp_string, ++set[tmp_stl_string], ++i)
         scanf("%s", tmp_string);
     for (map<string, int>::iterator it = set.begin(); it != set.end(); ++it)
         if (maxn < it -> second)
         {
             maxn = it -> second;
             tmp_stl_string = it -> first;
         }
     printf("%s\n", tmp_stl_string.c_str());
 }
 int main()
 {
     int n;
     scanf("%d", &n);
     while (n > )
     {
         work(n);
         scanf("%d", &n);
     }
     return ;
 }