UVA 296 Safebreaker

Fucker — Tue, 02 Nov 2010 04:35:00 GMT

��单的猜数字游戏，直接枚�D接好�Q�注意输出的时候要前缀0。MMD�Q�浪费了好多旉��在这上面�?/div>

#include <stdio.h>

#define N 15

struct guess
{
  int num[4];
  int a, b;
}g[N];

int main()
{
//  freopen("in", "r", stdin);
  int t, n, a, b, data;
  scanf("%d", &t);
  while(t--)
  {
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
    {
        scanf("%d %d/%d", &data, &a, &b);
        g[i].num[0] = data / 1000; g[i].num[1] = (data % 1000) / 100;
        g[i].num[2] = (data % 100) / 10; g[i].num[3] = data % 10;
        g[i].a = a, g[i].b = b;
    }
    int num[4], mk[2][4], flag, count(0), ans[4];
    for(int i = 0; i < 10000; i++)
    {
        num[0] = i / 1000; num[1] = (i % 1000) / 100;
        num[2] = (i % 100) / 10; num[3] = i % 10;
        flag = 0;
        for(int j = 0; j < n; j++)
        {
            a = b = 0;
            for(int k = 0; k < 4; k++) mk[0][k] = mk[1][k] = 0;
            for(int k = 0; k < 4; k++)
            {
                if(num[k] == g[j].num[k])
                {
                    mk[0][k] = mk[1][k] = 1;
                    a++;
                }
            }
            for(int k = 0; k < 4; k++)
            {
                if(mk[0][k]) continue;
                for(int l = 0; l < 4; l++)
                {
                    if(mk[1][l]) continue;
                    if(g[j].num[k] == num[l])
                    {
                        mk[0][k] = mk[1][l] = 1;
                        b++;
                        break;
                    }
                }
            }
            if(a != g[j].a || b != g[j].b)
            {
                flag = 1;
                break;
            }
        }
        if(!flag)
        {
            count++;
            ans[0] = num[0], ans[1] = num[1];
            ans[2] = num[2], ans[3] = num[3];
        }
    }
    if(!count) puts("impossible");
    else if(count == 1) printf("%d%d%d%d\n", ans[0], ans[1], ans[2], ans[3]);
    else puts("indeterminate");
  }
  return 0;
}

Fucker 2010-11-02 12:35 发表评论

UVA 846 Steps

Fucker — Sat, 30 Oct 2010 12:12:00 GMT

�l�你一个个阶梯�Q�要求�v步和停止的步长�ؓ一�Q�每�ơ只能在上次的基��上增加一�Q�减��一或者不变。求最��的步长�?/div>

直接模拟��好�Q�分别从头尾开始增加步�ѝ�?/div>

#include <stdio.h>

int main()
{
  int t, a, b;
  int diff, count, step;
  scanf("%d", &t);
  while(t--)
  {
    scanf("%d %d", &a, &b);
    diff = b - a;
    count = 0;
    step = 1;
    bool flag = false;
    while(diff > 0)
    {
      diff -= step;
      count++;
      if(flag) step++;
      flag = !flag;
    }
    printf("%d\n", count);
  }
  return 0;
}

Fucker 2010-10-30 20:12 发表评论

亚洲美女视频在线观看,久久婷婷综合激情,免费观看在线综合色

UVA 296 Safebreaker

UVA 846 Steps