HDU多校Round 3

Solved:4

rank:268

C. Dynamic Graph Matching  状压DP一下

#include <stdio.h>
#include <algorithm>
#include <algorithm>
#include <string.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + ;

ll dp[ << ];
ll ans[];
int num[ << ];

void work()
{
    int len =  << ;
    for(int i = ; i < len; i++)
    {
        int x = i;
        while(x)
        {
            if(x & ) num[i]++;
            x >>= ;
        }
    }
}

int main()
{
    work();
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n, m;
        scanf("%d%d", &n, &m);
        memset(dp, , sizeof(dp));
        memset(ans, , sizeof(ans));
        dp[] = ;

        char s[];
        int len  =  << n;
        for(int i = ; i <= m; i++)
        {
            int a, b;
            scanf("%s", s);
            scanf("%d%d", &a, &b);
            a--, b--;

            int tmp = ( << a) | ( << b);
            for(int i = ; i < len; i++)
            {
                if(num[i] & ) continue;
                if((i & tmp) == tmp)
                {
                    if(s[] == '+')
                    {
                        dp[i] = (dp[i] + dp[i - tmp]) % mod;
                        ans[num[i] / ] += dp[i - tmp];
                        ans[num[i] / ] %= mod;
                    }
                    else
                    {
                        dp[i] -= dp[i - tmp];
                        dp[i] = (dp[i] + mod) % mod;
                        ans[num[i] / ] -= dp[i - tmp];
                        ans[num[i] / ] += mod;
                        ans[num[i] / ] %= mod;
                    }
                }
            }
            for(int i = ; i <= n / ; i++)
            {
                if(i == ) printf("%d", ans[i]);
                else printf(" %d", ans[i]);
            }
            puts("");
        }
    }
    return ;
}

D. Euler Function

#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;

int getphi(int o)
{
    int res = o;
    int n = o;
    for(int i = ; i * i <= n; i++)
    {
        if(n % i == )
        {
            res -= res / i;
            while(n % i == ) n /= i;
        }
    }
    if(n > )  res -= res / n;
    return res;
}

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n;
        scanf("%d", &n);
        if(n == ) printf("5\n");
        else if(n == ) printf("7\n");
        else printf("%d\n", n + );
    }
    return ;
}

L. Visual Cube

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;

char tu[][];

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);

        int lie = a *  +  + b * ;
        int hang = c *  +  + b * ;

        for(int i = ; i <= hang; i++)
            for(int j = ; j <= lie; j++)
                tu[i][j] = '.';

        for(int i = ; i <= hang; i += )
            for(int j = ; j <= lie; j += )
                tu[i][j] = '+';

        for(int i = ; i <= hang; i += )
            for(int j = ; j <= lie; j += )
                tu[i][j] = '-';

        for(int i = ; i <= hang; i+= )
            for(int j = ; j <= lie; j += )
                tu[i][j] = '|';

        int in = ;
        int jn = b *  + ;
        for(int i = ; i <= b; i++)
        {
            in += ;
            jn -= ;
            for(int j = ; j <= a + ; j++)
            {
                tu[in][jn + (j - ) * ] = '.';
                tu[in][jn + (j - ) *  + ] = '/';
            }
        }

        int inj = lie + ;
        int inh = ;
        for(int i = ; i <= b; i++)
        {
            inj -= ;
            inh += ;
            for(int j = ; j <= c; j++)
            {
                tu[inh + (j - ) * ][inj] = '.';
                tu[inh + (j - ) *  + ][inj] = '/';
            }
        }

        int len = b *  + ;
        for(int i = ; i <= b * ; i++)
        {
            len--;
            for(int j = ; j <= len; j++)
                tu[i][j] = '.';
        }

        len = b *  + ;
        for(int i = hang; i >= hang - b * ; i--)
        {
            len--;
            for(int j = lie - len + ; j <= lie; j++)
                tu[i][j] = '.';
        }

        for(int i = ; i <= hang; i++)
        {
            for(int j = ; j <= lie; j++)
                printf("%c", tu[i][j]);
            puts("");
        }
    }
    return ;
}