ACM試題An Easy Problem
Description
As we known, data stored IN the computers is IN bINary form. The problem we discuss now is about the positive INtegers and its bINary form. Given a positive INteger I, you task is to fINd out an INteger J, which is the mINimum INteger greater than I, and the number of 1 s IN whose bINary form is the same as that IN the bINary form of I. For example, if "78" is given, we can write out its bINary form, "1001110". This bINary form has 4 1 s. The mINimum INteger, which is greater than "1001110" and also contaINs 4 1 s, is "1010011", i.e. "83", so you should output "83".
標簽:
Description
computers
Problem
bINary
上傳時間:
2013-12-11
上傳用戶:libenshu01
A six people s rushINg replies an implement, use some s switches IN toggle switch K0 ~ K5 is that ON accomplishes when rushINg to reply button , nobody rush to answer, 6 numerical code circulation takes turns at demonstratINg 1 ~ 6 (horse races) , who rushes to reply the numerical code stops havINg a ride on a horse , first, whose serial number, has simultaneous light of 6 numerical codes agaIN afterwards the key presses down. System denies respondINg to, until this place is OFF batch , the wheel restorINg 1 ~ 6 horse races startINg time as soon as rushes to answer.
標簽:
implement
switches
rushINg
replies
上傳時間:
2013-12-27
上傳用戶:l254587896