Given T(1 <= T <= 1e5) the no. of test cases.
Each testcase contains an integer N(1 <= N <= 1e18).
We define F(x) as the xor of all the digits in x.
Find 
(summation of F(x) where x goes from 1 to N) for each testcase.
Can anyone help me with this?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 14.11.2024 19:48:17 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by virus_1010 (previous revision, new revision, compare).
Auto comment: topic has been updated by virus_1010 (previous revision, new revision, compare).
simple digits dp — xor of digits <= 15. So dp[l][y][z][x] = number of len-(l+1) numbers, y denotes if number is non-prefix or not, z if number is non-zero or not, x the current xor — try current digit(c) 0-9(check c's possibility — (y||(c<=N[l])) then add dp[l-1][y||(c<N[l]][z||c][x^c]; write proper base cases.
For final answer, add (number of numbers for each xor<=15) * xor.
Time complexity — O(log(N)*64);