HDOJ(~1004)

T1000

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

T1001

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

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 = 1;
        memset(num, 0, 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 / 4 + (tmplen % 4 > 0);
    for (int i = 0, j = 0; i < tmplen; ++i, ++j)
    {
        input.num[j] = tmp[i] - '0';
        if (tmp[++i] == '\0')
            break;
        input.num[j] += 10 * (tmp[i] - '0');
        if (tmp[++i] == '\0')
            break;
        input.num[j] += 100 * (tmp[i] - '0');
        if (tmp[++i] == '\0')
            break;
        input.num[j] += 1000 * (tmp[i] - '0');
    }
}
inline largeint operator +(largeint a, largeint b)
{
    int tmp = 0;
    a.len = std::max(a.len, b.len);
    for (int i = 0; i < a.len; ++i)
    {
        a.num[i] += b.num[i] + tmp;
        tmp = a.num[i] / MAXCARRY;
        a.num[i] %= MAXCARRY;
    }
    if (tmp > 0)
        a.num[a.len++] = 1;
    return a;
}
void printf_override(largeint output)
{
    printf("%d", output.num[--output.len]);
    for (int i = output.len - 1; i > -1; --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 + 1);
    printf_override(a);
    printf(" + ");
    printf_override(b);
    printf(" = ");
    a = a + b;
    printf_override(a);
    printf("\n");
}
int main()
{
    int T;
    scanf("%d", &T);
    work(0);
    for (int i = 1; i < T; ++i)
        { printf("\n"); work(i); }
    return 0;
}

 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 = 0, start_tmp = 0, end_tmp = 0;
    max_tmp = max = INT_MIN;
    for (int i = 0; i < length; ++i)
    {
        if (max_tmp < 0)
        {
            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 = 0; i < n; ++i)
        scanf("%d", &number[i]);
    dp(n);
    printf("%d %d %d\n", max, start + 1, end + 1);
}
int main()
{
    int T;
    scanf("%d", &T);
    for (int i = 1; i < T; printf("\n"), ++i)
        work(i);
    work(T);
    return 0;
}

 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 = -1;
    string tmp_stl_string;
    char tmp_string[21];
    for (int i = 0; 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 > 0)
    {
        work(n);
        scanf("%d", &n);
    }
    return 0;
}