2013 ACM/ICPC Asia Regional Chengdu Online//HDU4730/HDU4731/HDU4734/HDU4737

1003：We Love MOE Girls

 

签到题：

 

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;

int QuickMod(int a, int b, int n);
string str;
int main()
{
    int t;
    scanf("%d", &t);
    int cnt = 0;
    while(t--)
    {
        cnt++;
        cin >> str;
        int len = str.length();
        if(len < 4)
            str += "nanodesu";
        else if(str[len-1] == 'u' && str[len-2] == 's' && str[len-3] == 'e' && str[len-4] == 'd')
        {
            str[len-4] = 'n', str[len-3] = 'a', str[len-2] = 'n', str[len-1] = 'o';
            str += "desu";
        }
        else
            str += "nanodesu";
        printf("Case #%d: ", cnt);
        cout << str << endl;
    }
    return 0;
}

 

1004 Minimum palindrome

打表.......

 

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
inline void RD(int &ret)
{
    char c;
    do
    {
        c = getchar();
    }
    while(c < '0' || c > '9') ;
    ret = c - '0';
    while((c=getchar()) >= '0' && c <= '9')
        ret = ret * 10 + ( c - '0' );
}
int T, m, n;

int main()
{
    int cas = 0;
    RD(T);
    while (T--)
    {
        printf("Case #%d: ", ++cas);
        scanf("%d %d", &m, &n);
        if (m == 1)
        {
            for (int i = 1; i <= n; i++)
                printf("a");
        }
        else if (m >= 3)
            for (int i = 0; i < n; i++) cout << char(i % 3  + 'a');
        else
        {
            if (n == 1) printf("a");
            else if (n == 2) printf("ab");
            else if (n == 3) printf("aab");
            else if (n == 4) printf("aabb");
            else if (n == 5) printf("aaaba");
            else if (n == 6) printf("aaabab");
            else if (n == 7) printf("aaababb");
            else if (n == 8) printf("aaababbb");
            else
            {
                string gg = "babbaa";
                cout << "aaaa";
                for (int i = 0; i < n - 4; i++)
                    printf("%c", gg[i % 6]);
            }
        }
        printf("\n");
    }
    return 0;
}

 

1007 F(x)

 

0.5S的题目，T了的....

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;

int QuickMod(int  a,int b)
{
    int r = 1;
    while(b)
    {
        if(b&1)
            r = (r*a);
        a = (a*a);
        b >>= 1;
    }
    return r;
}
int main()
{
    int t;
    scanf("%d", &t);
    int B;
    char A[15];
    int cnt = 0;
    while(t--)
    {
        getchar();
        cnt++;
        scanf("%s", A);
        scanf("%d", &B);
        int len = strlen(A);
        int base = QuickMod(2, len-1);
        int suma = 0;
        for(int i = 0; i < len; ++i)
        {
            int tp = A[i] - '0';
            suma += (tp*base);
            base/=2;
        }
        int up = (B/100);
        int BB = (up*100 - 1);
        int st = 0;
        int ans = 0;
        for(int i = 0; i < up; ++i)
        {
            int tp = (suma - st + 1);
            if(tp%2==0)
                ans += (((tp/2)*(tp+2))/2);
            else
                ans += ((tp/2 + 1)*(tp+1))/2;
            st += 4;//
        }
        //cout << ":::::::" << ans << endl;
        if(st <=suma)
        {
            if(B <= BB+10)
            {
                int ff=B-BB;
                int le = suma - st+1;
                if(le>ff)le=ff;
                ans += le;
            }
            else
            {
                int tp = (suma - st + 1);
                int tt = (B - up*100)/10;
                if(tp > 0)
                {
                    for(int i = 0; i < tt; ++i)
                    {
                        ans += tp;
                        tp-=2;
                        if(tp <= 0)
                            break;
                    }
                }
                if(tp > 0)
                {
                    st += (2*tt);
                    int le = suma - st+1;
                    ans += le;
                }
            }
        }
        printf("Case #%d: %d\n", cnt, ans);
    }
    return 0;
}

 

 

1010  A Bit Fun

刚开始听说是线段树之类的，题目意思就是给你一个数组，然后求一个从一个位置i开始， 使得a[i]|a[i+1]....|a

[k] < m的情况有多少种？

 

比赛完成之后看到这个很牛逼的代码：直接两重for，把每一个位置置为开始为，向后扫描，直到不满足条件的时候

break,这个break应该很好的卡住了循环，时间效率还可以：

 

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;

int main()
{
    int t;
    int cnt = 0;
    scanf("%d", &t);
    while(t--)
    {
        int n, m;
        int sum[100001];
        scanf("%d%d", &n, &m);
        for(int i = 0; i < n; ++i)
            scanf("%d", &sum[i]);
        __int64 ans = 0;
        for(int i = 0; i < n; ++i)
        {
            int tp = sum[i];
            for(int j = i; j < n; ++j)
            {
                tp |= sum[j];
                if(tp < m)
                    ans++;
                else
                    break;
            }
        }
        printf("Case #%d: %I64d\n", ++cnt, ans);
    }
    return 0;
}