登录
|
注册
公司
标签
文章
搜索
POJ
所有
有回答
没回答
新题目
有最佳答案
排序
热度
·
时间
·
经典指数
0
0
652
A brand-new Japanese puzzle is coming from the East to strike the world-popular Sudoku game and become an international hit. The rules of this puzzle are kept in secret yet, but the goal is already advertised: given a square grid n × n, where each square contains a block with one of k types of pictures, the player has to rearrange it to get the maximal possible number of equal first rows (two rows are considered equal if both of them are filled with the same pictures in the same or ...
阅读题目
POJ
问答题
经典指数
0
0
797
As a member of the International Rock-Skipping League, you travel to a different lake each week and compete in a rock-skipping contest. The goal is to throw a rock so that it skips as many times as possible; the exact rules for determining the winner are given below. To make the competitions interesting, the IRSL often chooses lakes with logs, sandbars, and other obstacles. You are provided with a side-view, water-level "map" of the lake as shown in the top line of th ...
阅读题目
POJ
问答题
经典指数
0
0
752
古斯迪尔文明曾在约10亿年前在地球上辉煌一时,尤其在历法、数学、天文等方面的发展水平已经超过现代。在古城的众多庙宇中,考古人员都发现了一种奇特的建筑,该建筑包含一排独立的房间。 以下是一个规模较小的建筑的内部结构,包括9个房间: 在每个房间的中央,挂有一个转盘,每个转盘分为6个格子,每个格子写着一个1到9的数字。转盘可以逆时针转动。转盘的红色标记始终指向上方的格子。每个房间的转盘都不相同。 CC考古工作室近日成功地破译了当时的文字,对进一步研究古斯迪尔文明作出了重要贡献。首先,研究人员翻译了当时的宗教书籍,得知了建筑的用途。原来每个寺院都要在建成以后每隔若干年举行一次大型的庆典。由于?天机不可泄漏?,寺院方面并不直接说明庆典的日期,而是采用?暗示?的方法。奇特的建筑就是为了确定庆典的日期而专门建造的。 房间从左到右编号为1,2,3,卬,同时寺院有n个祭司也从1到n编号,这些祭司每年到房间中祈祷一次。建寺那年祭司和自己编号相同的房间祈祷。同时,转盘上红色标记指示的格子的数字就是该祭司第二年祈祷的房间编号。在祭司祈祷完毕以后,将转盘逆时针旋转一格。转盘的设计使得在每年祈祷 ...
阅读题目
POJ
问答题
经典指数
0
0
554
Erik G. Hallnor and Steven K. Reinhardt from the University of Michigan suggested a fully associative software-managed cache design in ISCA (International Symposium on Computer Architecture) 2000. They have two primary contributions: a practical design for a fully associative memory structure, the indirect index cache (IIC), and a novel replacement algorithm, generational replacement, that is specifically designed to work with the IIC. They analyze the behavior of an IIC with generational replac ...
阅读题目
POJ
问答题
经典指数
0
0
580
司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示: 如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色的网格表示它能够攻击到的区域:沿横向左右各两格,沿纵向上下各两格。图上其它白色网格均攻击不到。从图上可见炮兵的攻击范围不受地形的影响。 现在,将军们规划如何部署炮兵部队,在防止误伤的前提下(保证任何两支炮兵部队之间不能互相攻击,即任何一支炮兵部队都不在其他支炮兵部队的攻击范围内),在整个地图区域内最多能够摆放多少我军的炮兵部队。 输入描述 第一行包含两个由空格分割开的正整数,分别表示N和M; 接下来的N行,每一行含有连续的M个字符('P'或者'H'),中间没有空格。按顺序表示地图中每一输出描述 仅一行,包含一个整数K,表示最多能摆放的炮兵部队的数量。输入例子 5 4 PHPP PPHH PPPP PHPP PHHP 输出 ...
阅读题目
POJ
问答题
经典指数
0
0
678
It's election time. The farm is partitioned into a 5x5 grid of cow locations, each of which holds either a Holstein ('H') or Jersey ('J') cow. The Jerseys want to create a voting district of 7 contiguous (vertically or horizontally) cow locations such that the Jerseys outnumber the Holsteins. How many ways can this be done for the supplied grid?输入描述 * Lines 1..5: Each of the five lines contains five characters per line, each 'H' or 'J'. No spaces are present.输出描述 * Line 1: The number of distin ...
阅读题目
POJ
问答题
经典指数
0
0
534
Given a base b and two non-negative base b integers p and m, compute p mod m and print the result as a base b integer. p mod m is defined as the smallest non-negative integer k such that p = a*m + k for some integer a.输入描述 Input consists of a number of cases. Each case is represented by a line containing three unsigned integers. The first, b, is a decimal number between 2 and 10. The second, p, contains up to 1000 digits between 0 and b-1. The third, m, contains up to 9 digits between 0 and b-1. ...
阅读题目
POJ
问答题
经典指数
<<
<
45
46
47
48
49
50
>
>>
497
题目数
1
贡献者
9
答案数
扫描后移动端查看
我也分享一个题目
同类标签
内容运营
用户运营
操作系统
C/C++
网络基础
C++工程师
编译和体系结构
数据库
编程基础
java
微信公众号
欢迎加入,一起群聊
×
登录
注册
找回密码
记住登录
登录
快速注册
直接第三方登录