結果

問題 No.939 and or
ユーザー dot_haraai
提出日時 2021-04-03 17:24:55
言語 Nim
(2.2.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,067 bytes
コンパイル時間 4,771 ms
コンパイル使用メモリ 86,528 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-25 03:12:56
合計ジャッジ時間 5,369 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve():int=
  var
    bit = 32
    a = scan().toBin(bit+1)
    b = scan().toBin(bit+1)
    dp = newseqwith(bit+1,newseqwith(2,0))
  dp[0][0]=1
  for i in 1..bit:
    if a[i]=='1' and b[i]=='1':
      dp[i][0]=dp[i-1][0]
      dp[i][1]=dp[i-1][1]
    elif a[i]=='0' and b[i]=='0':
      dp[i][0]=dp[i-1][0]
      dp[i][1]=dp[i-1][1]
    elif a[i]=='0' and b[i]=='1':
      dp[i][0]=0
      dp[i][1]=dp[i-1][1]*2+dp[i-1][0]
    else:
      dp[i][0]=0
      dp[i][1]=0
  #echo dp
  return dp[bit].sum()

    


    


  
echo solve()
0