wust_cyl的博客

问题描述: Define the function S(x)S(x) for xx is a positive integer. S(x)S(x) equals to the sum of all digit of the decimal expression of xx. Please find a positive integer kk that S(k*x)\%233=0S(k∗x)

问题描述:As Valeric and Valerko were watching one of the last Euro Championship games in a sports bar, they broke a mug. Of course, the guys paid for it but the barman said that he will let them watch

问题描述:You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the following game to warm up: initially a piece of paper has an integer q. During a move a player

问题描述:Petya loves football very much, especially when his parents aren't home. Each morning he comes to the yard, gathers his friends and they play all day. From time to time they have a break to h

问题描述:Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 ar

问题描述:A string t is called an anagram of the string s, if it is possible to rearrange letters in t so that it is identical to the string s. For example, the string "aab" is an anagram of the stri

问题描述:You've got another problem dealing with arrays. Let's consider an arbitrary sequence containing n (not necessarily different) integers a1, a2, ..., an. We are interested in all possible pai

问题描述:众所周知，ZiP有一个室友叫老郭，是个满分帅气暖男，只是有个习惯是*狗。然而老郭是一个强迫症患者，他*的狗必须满足以下条件：首先他会把n只狗排成一排，从1到n依次编号。接着他会让ZiP给他报一个整数m。然后任意选出三只狗编号为x,y,z，如果能满足x^m+y^m=z^m(分别代表x,y,z的m次方)，则会把狗*掉。那么问题来了，对于n只狗，已经ZiP给定的一个数m

问题描述:生活在另一个平行宇宙中的HLD，是一个杰出的数学家，他在20岁时就发现了超奇异质数。         作为数学家的他当然是很热爱数字的啦！这天他心血来潮想见识一下传说中的小学奥数题，于是他随便找了一道小学奥数题，聪明如他，没过多久他便想出来了，并准备算出答案。         这个题目是:把自然数 0,1，2，3，4，5，6，7，8，9，10，11，12，... 作为字符

题目题意:Once upon a time in the Kingdom of Far Far Away lived Sir Lancelot, the chief Royal General. He was very proud of his men and he liked to invite the King to come and watch drill exercises whi

问题描述:Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:Each digit is represented

问题描述:You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.Numb

问题描述:An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet t

问题描述:Hamming distance between strings a and b of equal length (denoted by h(a, b)) is equal to the number of distinct integers i (1 ≤ i ≤ |a|), such that ai ≠ bi, where aiis the i-th symbol of