Occult

Number SequenceInput: standard inputOutput: standard outputTime Limit: 1 secondA single positive integer iis given. Write a program to find the digit located in the position iin the sequen

DescriptionOnce Bob took a paper stripe of n squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negative. He became interested in how many ways exi

DescriptionNick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer greater than 2 can be expressed as the sum of two primes. That got Nick's a

DescriptionHehe keeps a flock of sheep, numbered from 1 to n and each with a weight wi. To keep the sheep healthy, he prepared some training for his sheep. Everytime he selects a pair of numbers (

DescriptionGive you a positive integer x, determine whether it is the sum of three positive cubic numbers.InputThere’re several test cases. For each case: Only one line containing an

DescriptionIsun loves digit 4 and 8 very much. He thinks a number is lucky only if the number satisfy the following conditions: 1.       The number only consists of digit 4 and 8. 2.       The

Problem DescriptionA list of n integers are given. For an integer x you can do the following operations:+ let the binary representation of x be b31b30...b0¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯, you can flip

Descriptionas we all know, ZhangYu(Octopus vulgaris) brother has a very famous speech - “Keep some distance from me”. ZhangYu brother is so rich that everyone want to contact he, and scfkcf is o

问题描述我们可爱的KK有一道困难的化学题目：实验室有N\left(1\leq N\leq 100 \right)N(1≤N≤100)瓶化学药品，编号为00到N-1N−1，现在KK知道第i瓶当且仅当和第c[i]c[i]瓶放在一起时会发生爆炸。KK得到任务要整理实验室，他需要将他们装进k个不同的盒子里。显然，为了KK的生命安全，你不能把两瓶会造成爆炸的药品放进同一个箱子。现在KK想知道有多少种不同

Problem DescriptionMr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and more interesting things about GCD. Today He comes up with Range Greatest Common Divisor Query (

Problem DescriptionYou are one of the competitors of the Olympiad in numbers. The problem of this year relates to beatiful numbers. One integer is called beautiful if and only if all of its digita

DescriptionThere is a matrix of size R rows by C columns. Each element in the matrix is either “0” or “1”. A square is called magic square if it meets the following three conditions. (1)  The el

Problem Descriptionztr loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn't contain digits other than 4 and 7. For example, numbers 47, 744