結果

問題 No.1243 約数加算
ユーザー dot_haraaidot_haraai
提出日時 2021-06-05 15:34:00
言語 Nim
(2.0.2)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 1,274 bytes
コンパイル時間 3,413 ms
コンパイル使用メモリ 86,580 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-21 13:21:06
合計ジャッジ時間 4,072 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 1 ms
6,816 KB
testcase_04 AC 2 ms
6,816 KB
testcase_05 AC 3 ms
6,820 KB
testcase_06 AC 3 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 2 ms
6,820 KB
testcase_09 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()=
  var
    t = scan()
    ab = newseqwith(t,(scan(),scan()))
  for i in 0..<t:
    var
      (a,b)=ab[i]
      digit  = (b.float.log2+1).floor.int
      ans = newseq[int]()
    #echo "a:",a.toBin(digit)
    #echo "b:",b.toBin(digit)

    for d in countdown(digit,0):
      if ((b and 1.shl(d))>0) and ((a and 1.shl(d))==0):
        for i in 0..<d:
          if (a and 1.shl(i))>0:
            ans.add(1.shl(i))
            a+=1.shl(i)
      #echo a.toBin(digit)
    for d in countdown(digit-1,0):
      if ((b and 1.shl(d))>0) and ((a and 1.shl(d))==0):
        ans.add(1.shl(d))
        a+=1.shl(d)
      #echo a.toBin(digit)
    echo ans.len
    #echo a==b
    echo ans.join(" ")
    #if a!=b:
      #break
      
     
solve()
0