結果

問題 No.1452 XOR×OR
コンテスト
ユーザー dot_haraai
提出日時 2021-05-09 16:23:46
言語 Nim
(2.2.0)
結果
AC  
実行時間 1,989 ms / 2,000 ms
コード長 945 bytes
コンパイル時間 4,559 ms
コンパイル使用メモリ 86,400 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-18 22:13:46
合計ジャッジ時間 34,355 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 25) Warning: imported and not used: 'sequtils' [UnusedImport]
/home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [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]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
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')



#echo (1 xor 2) or 2


proc solve():int=
  var 
    n = scan()
    lesser = 1
    pair = newseq[(int,int)]()
  while lesser^2<=n:
    if n.mod(lesser)==0:
      pair.add((lesser,n.div(lesser)))
    lesser+=1
  #echo pair
  for (l,r) in pair:
    #echo l,", ",r
    for x in 0..r:
      if (r == ((l xor x) or x)) and ((l xor x) >= x):
        #echo ":",x, ", ",l xor x
        result+=1

  
  
echo solve()
0