wyjwyl的专栏

Integer InquiryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He exten

PalindromeTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3919    Accepted Submission(s): 1341Problem DescriptionA palindrome is a s

Advanced FruitsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2017    Accepted Submission(s): 1029Special JudgeProblem DescriptionT

1368 - DNA Consensus StringTime limit: 3.000 secondsDNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nucleotides, namely A

10340 - All in AllTime limit: 3.000 secondsYou have devised a new encryption technique which encodes a message by inserting between its charactersrandomly generated strings in a clever way. Be

202 - Repeating DecimalsTime limit: 3.000 secondsThe decimal expansion of the fraction 1/33 is 0.03, where the 03 is used to indicate that the cycle 03repeats indefinitely with no intervening

1587 - BoxTime limit: 3.000 secondsIvan works at a factory that produces heavy machinery. He has a simple job — he knocks up woodenboxes of different sizes to pack machinery for delivery to th

11809 - Floating-Point NumbersTime limit: 1.000 seconds题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=226&page=show_problem&problem=2909Floating-point nu

#include #include#includeusing namespace std;char mazz[6][6];int x,y;int judge(int x,int y){ if(x=5||y=5) return 0; return 1;}int change(int sx,int sy){ if(judge(x+sx,y+s

1588 - KickdownTime limit: 3.000 seconds题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=448&page=show_problem&problem=4463A research laboratory of a world

1339 - Ancient CipherTime limit: 3.000 secondsAncient Roman empire had a strong government system with various departments, including a secretservice department. Important documents were sen

问题 I: CZY找句子时间限制: 1 Sec  内存限制: 128 MB提交: 99  解决: 45[提交][状态][讨论版]题目描述YY喜欢读书，而且总是喜欢从书上摘取好的句子或词语，但是抄完之后她变忘了在哪，于是她就请CZY帮她，CZY感觉这我多我可咋找啊！于是又来麻烦聪明的你，为了方便CZY早已用高端译码机器把句子变成的数字，他想让你告诉他句子在文章中出现的位置

Hangman JudgeIn ``Hangman Judge,'' you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are the same as

ZYB's BiologyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 340    Accepted Submission(s): 281Problem DescriptionAfter getting 60

D. New Year and Ancient Prophecytime limit per test2.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputLimak is a little polar

B. Error Correct Systemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFord Prefect got a job as a web dev

亲和串Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9701    Accepted Submission(s): 4432Problem Description人随着岁数的增长是越大越聪明还是越大越笨，这是一个值

Hard CodeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 999    Accepted Submission(s): 708Problem DescriptionSome strange code is s

题目描述： 给出一个长度不超过1000的字符串，判断它是不是回文(顺读，逆读均相同)的。输入： 输入包括一行字符串，其长度不超过1000。输出： 可能有多组测试数据，对于每组数据，如果是回文字符串则输出"Yes!”，否则输出"No!"。样例输入： hellollehhelloworld样例输出： Yes!No!水。。。#inc

如题，需要你做的就是写一个程序，得出最长公共子序列。tip：最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列。nyoj36#include#includechar a[101

DescriptionYou have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we wil

ZOJ问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Problem Description对给定的字符串(只包含'z','o','j'三种字符),判断他是否能AC。是否AC的规则如下：1. zoj能AC；2. 若字符串形式为xzojx，则也能A

DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 89161 Accepted: 35831DescriptionOne measure of ``unsortedness'' in a sequence is the number o

circumgyrate the stringTime Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Problem Description  Give you a string, just circumgyrate. The number N means you jus

Problem Description输入一行数字，如果我们把这行数字中的‘5’都看成空格，那么就得到一行用空格分割的若干非负整数（可能有些整数以‘0’开头，这些头部的‘0’应该被忽略掉，除非这个整数就是由若干个‘0’组成的，这时这个整数就是0）。你的任务是：对这些分割得到的整数，依从小到大的顺序排序输出。 Input输入包含多组测试用例，每组输入数据只有一行数字（

Problem DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the

Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrari

I Love You TooTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1768    Accepted Submission(s): 1061Problem DescriptionThis is a true

叠筐Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14566    Accepted Submission(s): 3787Problem Description需要的时候，就把一个个大小差一圈的筐叠上去，使得从上往下

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 37421 Accepted: 15462DescriptionGiven two strings a and b we define a*b to be their concatena

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14092 Accepted: 7009DescriptionThe little cat is so famous, that many couples

OulipoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7297    Accepted Submission(s): 2922Problem DescriptionThe French author Georg

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43159 Accepted: 17490DescriptionA subsequence of a given sequence is the given sequence

Spell It Right (20) Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each input file contai