栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 1501 Knockout Tournament

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 1501 Knockout Tournament

#include<stdio.h>#include<string.h>int main(){int n, m, first = 1, temp[128], map[129][129], win[129], lose[129];while (scanf("%d", &n), n){if (!first)putchar('n');elsefirst = 0;memset(map, 0, sizeof(map));memset(win, 0, sizeof(win));memset(lose, 0, sizeof(lose));int i, j, k, num, t = 1 << n;for (i = 0; i < t; i++)temp[i] = i + 1;for (i = n - 1; i >= 0; i--)for (j = 0; j < 1 << i; j++){scanf("%d", &num);if (temp[2 * j] == num)map[num][temp[2 * j + 1]] = 1;elsemap[num][temp[2 * j]] = 1;temp[j] = num;}for (k = 1; k <= t; k++)for (i = 1; i <= t; i++)for (j = 1; j <= t; j++)map[i][j] = map[i][j] || (map[i][k] && map[k][j]);for (i = 1; i <= t; i++)for (j = 1; j <= t; j++)if (map[i][j]){win[i]++;lose[j]++;}scanf("%d", &m);for (i = 0; i < m; i++){scanf("%d", &num);printf("Player %d can be ranked as high as %d or as low as %d.n",num, lose[num] + 1, t - win[num]);}}return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/366051.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号