help !

Правка en1, от S0cI0pAtH, 2017-01-05 22:38:37

Given an integer N, find how many pairs (A, B) are there such that: gcd(A, B) = A xor B where 1 ≤ B ≤ A ≤ N. where 1 ≤ N ≤ 30000000

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский S0cI0pAtH 2017-01-05 22:45:00 72
en2 Английский S0cI0pAtH 2017-01-05 22:39:17 10 Tiny change: ' B ≤ A ≤ N.\nwhere 1 ≤ N ≤ 3' -> ' B ≤ A ≤ N & 1 ≤ N ≤ 3'
en1 Английский S0cI0pAtH 2017-01-05 22:38:37 140 Initial revision (published)