其他

DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0The coefficients are given integers from the interval [-50,50]. It is consider a solution a system (x1, x2, x3, x4, x5) that verifies the equation, xi∈[-50,50

Problem DescriptionIn 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 stands for digitadition, a term coined by

Problem DescriptionThe cows are thrilled because they've just learned about encrypting messages. They think they will be able to use secret messages to plot meetings with cows on other farms.Cows are not known for their intelligence. Their

http://ac.nbutoj.com/Problem/view.xhtml?id=1475問題描述 炎熱的暑期集訓就要結束了，在這短短的20天，大家都很努力，因為很多都是光棍嘛。balabala所以 Marknoon 先森一直耿耿於懷，畢竟他也是單身嘛。有一天，Marknoon 先森看著一串數字，發現了那個跟他同命相連的數字1，所以他就開始無聊起來，想知道從數字1到數字N，一共出現了幾個1。例如N=12，則1的個數為5，出現1的數字分別為1,10,11,12。 輸入 輸入一個數N(1

http://ac.nbutoj.com/Problem/view.xhtml?id=1477問題描述 AmeriDarts is a dangerous but full of glamour. Mr.cai wants to have a try.The rule is simple:throw some boomerangs in a line from left to right as quickly as you can. You are asked to throw twice,

DescriptionFermat's theorem states that for any prime number p and for any integera > 1,ap = a (mod p). That is, if we raisea to thepth power and divide by p, the remainder isa. Some (but not very many) non-prime values ofp, known as

Problem DescriptionEverybody knows any number can be combined by the prime number.Now, your task is telling me what position of the largest prime factor.The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc.Specially, LPF(1) =

Problem DescriptionMo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extra random letters so as to make a rectangular array

Problem

Problem Description　　We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the number buttons may correspond to some English letters respectively, as shown below:　　2 : a, b,

 MightyHorse is playing a music game called osu!.After playing for several months, MightyHorse discovered the way of calculating score in osu!:1. While playing osu!, player need to click some circles following the rhythm. Each time a player clicks,

Problem Description某國為了防禦敵國的飛彈襲擊,發展出一種飛彈攔截系統.但是這種飛彈攔截系統有一個缺陷:雖然它的第一發炮彈能夠到達任意的高度,但是以後每一發炮彈都不能超過前一發的高度.某天,雷達捕捉到敵國的飛彈來襲.由於該系統還在試用階段,所以只有一套系統,因此有可能不能攔截所有的飛彈.怎麼辦呢?多搞幾套系統唄!你說說倒蠻容易,成本呢?成本是個大問題啊.所以俺就到這裡來求救了,請協助計算一下最少需要多少套攔截系統. Input輸入若干組資料.每組資料包括:飛彈總個數(正整數),

DescriptionIn a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not a trivial task for the countries (maybe except for Luxembourg). To enforce that

Problem Description　　吉哥這幾天對隊形比較感興趣。　　有一天，有n個人按順序站在他的面前，他們的身高分別是h[1], h[2] ...

Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them rich cities) while the others are short of resource (we

DescriptionThe world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exchange. He follows stock prices every day looking for

Problem Description'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the signals on the chip connecting the ports of two functional blocks cross

Problem Description　　大家都知道小明最喜歡研究跟序列有關的問題了，可是也就因為這樣，小明幾乎已經玩遍各種序列問題了。可憐的小明苦苦地在各大網站上尋找著新的序列問題，可是找來找去都是自己早已研究過的序列。小明想既然找不到，那就自己來發明一個新的序列問題吧！小明想啊想，終於想出了一個新的序列問題，他欣喜若狂，因為是自己想出來的，於是將其新序列問題命名為“小明序列”。　　提起小明序列，他給出的定義是這樣的：　　①首先定義S為一個有序序列，S={ A1 , A2 , A3 , ...

DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence, if s is a regular brackets sequence, then (s) and [s] are regular brackets sequences, andif a and b are regular

文章目錄 題目描述輸入格式輸出範例輸入範例輸出