Code Jam 2011 Statistics · Find a solution
Find Solutions To find solutions in a specific language, select a problem from the list below, then select the language on the linked page. Qualification RoundBot TrustMagickaCandy SplittingGoroSortRound 1AFreeCell StatisticsThe Killer WordPseudominionRound 1BRPIRevenge of the Hot DogsHouse of KittensRound 1CSquare TilesSpace EmergencyPerfect HarmonyRound 2Airport WalkwaysSpinning BladeExpensive D
Google Code Jam Japan 2011 äºˆé¸ A. カードシャッフル - kusano_progã®æ—¥è¨˜
カードシャッフル 逆ã‹ã‚‰è¨ˆç®—ã™ã‚‹ã€‚例ãˆã°ã€ã‚µãƒ³ãƒ—ルã®æœ€å¾Œã®ä¾‹ã ã¨ã€[1 2 3 4 5] → [4 5 1 2 3] → [3 4 5 1 2] → [1 2 3 4 5]ã§ã€3回目ã®ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã®å¾Œã§2番目ã«ã‚るカードã¯ã€3回目ã®ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã®å‰ã«ã¯5番目ã«ã€2回目ã®ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã®å‰ã«ã¯4番目ã«ã€æœ€åˆã¯2番目ã®ä½ç½®ã«ã‚る。ã“ã†ã™ã‚Œã°ã‚«ãƒ¼ãƒ‰ã®æžšæ•°ã«é–¢ã‚らãšã€æœ€å¾Œã«W番目ã«æ¥ã‚‹ã‚«ãƒ¼ãƒ‰ã®ä½ç½®ã ã‘を覚ãˆã¦ãŠã‘ã°ã‚ˆã„。 def solve(M,C,W,A,B): for i in range(C)[::-1]: if W<=B[i]: W = A[i]+W-1 elif W<=A[i]+B[i]-1: W -= B[i] return W for t in range(input()): M,C,W = map(int,raw_input().split()) A,B = [0]*C,[0]*C for
Google Code Jam Japan 2011 äºˆé¸ - nokunoã®æ—¥è¨˜
å‚åŠ ã—ã¾ã—ãŸï¼ŽGoogle Code Jam Japan 2011 カードシャッフルカードãã®ã‚‚ã®ã®ãƒªã‚¹ãƒˆã‚’作るã¨è¨ˆç®—é‡çš„ã«åŽ³ã—ã„ã®ã§ï¼Œã‚«ãƒ¼ãƒ‰ã®ç¯„囲ã®ãƒªã‚¹ãƒˆã‚’作る．ã‚ã‚“ã©ã„．ã—ã‹ã‚‚カードã®ã‚«ãƒƒãƒˆã£ã¦æœ€åˆæ„味ãŒåˆ†ã‹ã‚‰ãªãã¦Wikipediaã§èª¿ã¹ã¦ã‚„ã£ã¨ç†è§£ã—ãŸï¼Žsmall/largeã¨ã‚‚ã«è§£ã‘ãŸï¼Ž #!/usr/bin/env python import sys def search_position(cards, pos): current = 0 for i in xrange(len(cards)): old = current current += cards[i][1] - cards[i][0] + 1 if current >= pos: return i, pos - old - 1 def update_card_list(cards, A, B): # search s
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}