王朝网络

分享

 

01.浙大在线评测 1056 The Worm Turns
Problem: Worm is an old computer game. There are many versions, but all involve maneuvering a "worm" around the screen, trying to avoid running the worm into itself or an obstacle. We'll si...查看完整版>>浙大在线评测 1056 The Worm Turns 02.浙大在线评测 1074 To the Max
Problem: Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. The sum of a rectangle...查看完整版>>浙大在线评测 1074 To the Max 03.浙大在线评测 1006 Do the Untwist
Question: Cryptography deals with methods of secret communication that transform a message (the plaintext) into a disguised form (the ciphertext) so that no one seeing the ciphertext will be able t...查看完整版>>浙大在线评测 1006 Do the Untwist04.浙大在线评测 1181 Word Amalgamation
Problem: In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the ans...查看完整版>>浙大在线评测 1181 Word Amalgamation05.浙大在线评测 1180 Self Numbers
Problem: In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the digits of n. (The d st...查看完整版>>浙大在线评测 1180 Self Numbers06.浙大在线评测 1178 Booklet Printing
Problem: When printing out a document, normally the first page is printed first, then the second, then the third, and so on until the end. However, when creating a fold-over booklet, the order of p...查看完整版>>浙大在线评测 1178 Booklet Printing07.浙大在线评测 1170 String Matching
Problem: It's easy to tell if two words are identical - just check the letters. But how do you tell if two words are almost identical? And how close is "almost"? There are lots of techniques for...查看完整版>>浙大在线评测 1170 String Matching 08.浙大在线评测 1159 487-3279
Problem: Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University o...查看完整版>>浙大在线评测 1159 487-327909.浙大在线评测 1151 Word Reversal
Problem: For each list of words, output a line with each word reversed without changing the order of the words. This problem contains multiple test cases! The first line of a multiple input i...查看完整版>>浙大在线评测 1151 Word Reversal10.浙大在线评测 1150 S-Trees
Problem: A Strange Tree (S-tree) over the variable set Xn = {x1,x2,...,xn} is a binary tree representing a Boolean function f:{0,1}->{0,1}. Each path of the S-tree begins at the root node and co...查看完整版>>浙大在线评测 1150 S-Trees

 

 

免责声明：本文为网络用户发布，其观点仅代表作者个人观点，与本站无关，本站仅提供信息存储服务。文中陈述内容未经本站证实，其真实性、完整性、及时性本站不作任何保证或承诺，请读者仅作参考，并请自行核实相关内容。