2012-10-01ãã1ã¶æéã®è¨äºä¸è¦§
å æ¥é¨ã§ã2æ³3æ¥ã®æ±äº¬é å¾ã«è¡ã£ã¦ãã¾ããã 1æ¥ç®ã¯ç§èåã2æ¥ç®ã¯çºè¡¨ç·´ç¿ãããã¦3æ¥ç®ã¯Google社ã«è¨ªåããã¦ããã ãã¾ãããGoogle社ã§ã¯ç¤¾å é£å ã§ããã®æåãªãBinary Hacksãã®èè ã®æ¹ã¨ãé£äºãã話ããã¦ããã ããå¾ãã¨ã³ã¸ãã¢ã®æ¹ã ã®â¦
250 TheBrickTowerEasyDivTwo並ã¹ãã ã class TheBrickTowerEasyDivTwo { public: int find(int redCount, int redHeight, int blueCount, int blueHeight) { int now_h = 0; int C[2] = {blueCount,redCount}; int H[2] = {blueHeight,redHeight}; memset(â¦
1651 -- Multiplication Puzzle [åé¡] Næã®ã«ã¼ããä¸ããããããããã®ä¸ããä»»æã®1æãåãé¤ãããã®éãé¸ãã ã«ã¼ã * å·¦ã®ã«ã¼ã * å³ã®ã«ã¼ãã®ã¹ã³ã¢ãå ç®ãããããã ã両端ã®ã«ã¼ãã¯é¸ã¹ãªãã å¯è½ãªéããããã®æä½ãç¹°ãè¿ããæã®åè¨â¦
1611 -- The Suspects [åé¡] ããã¤ãã®ã°ã«ã¼ãã¨ããã«æå±ããçå¾ã®ã¡ã³ãã¼ã®æ å ±ãä¸ããããã0çªã®çå¾ãå¼·åãªé¢¨éªè(æ訳)ãæã£ã¦ãã¦ãåãã°ã«ã¼ãã«æå±ãã¦ããçå¾ã«ææãã¦ãã¾ããææã¯æ¨ç§»çã§ãããä¾ãã° aã°ã«ã¼ã 㨠bã°ã«ã¼ã両â¦
1564 -- Sum It Up [åé¡] Nåã®è¦ç´ ãããªãéåãä¸ãããã¾ããåè¨ãtã¨ãªãä»»æã®é¨åéåãdecreasing orderã§åºåãã¦ãã ããã(ä¾) Input: t = 400 N = 12 [50 50 50 50 50 50 25 25 25 25 25 25]Output: Sums of 400: 50+50+50+50+50+50+25+25+25+â¦