Submission #20374218
Source Code Expand
defmodule Main do
def main() do
n = IO.read(:line) |> String.trim() |> String.to_integer()
digits = Integer.to_string(n) |> String.codepoints() |> Enum.count()
numbers(digits)
|> Enum.filter(&(&1 <= n))
|> Enum.count()
|> IO.puts()
end
defp numbers(digits) do
1..digits
|> Enum.reduce([[]], fn _, list_of_lists ->
Enum.reduce(list_of_lists, [], fn list, acc ->
[[3 | list], [5 | list], [7 | list], list | acc]
end)
end)
|> Enum.filter(fn list ->
Enum.any?(list, &(&1 == 3)) and Enum.any?(list, &(&1 == 5)) and Enum.any?(list, &(&1 == 7))
end)
|> Enum.map(fn list ->
Enum.join(list) |> String.to_integer()
end)
|> MapSet.new()
end
end
Submission Info
| Submission Time | |
|---|---|
| Task | C - 755 |
| User | awesomey |
| Language | Elixir (1.10.2) |
| Score | 300 |
| Code Size | 757 Byte |
| Status | AC |
| Exec Time | 1013 ms |
| Memory | 129272 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | a01, a02, a03 |
| All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| a01 | AC | 599 ms | 31012 KiB |
| a02 | AC | 611 ms | 31012 KiB |
| a03 | AC | 989 ms | 129272 KiB |
| b04 | AC | 565 ms | 31364 KiB |
| b05 | AC | 583 ms | 31156 KiB |
| b06 | AC | 582 ms | 31140 KiB |
| b07 | AC | 581 ms | 31272 KiB |
| b08 | AC | 578 ms | 31120 KiB |
| b09 | AC | 581 ms | 31188 KiB |
| b10 | AC | 580 ms | 31184 KiB |
| b11 | AC | 586 ms | 31012 KiB |
| b12 | AC | 589 ms | 31068 KiB |
| b13 | AC | 584 ms | 31480 KiB |
| b14 | AC | 610 ms | 34104 KiB |
| b15 | AC | 687 ms | 44864 KiB |
| b16 | AC | 1011 ms | 129148 KiB |
| b17 | AC | 1013 ms | 129248 KiB |
| b18 | AC | 979 ms | 129256 KiB |
| b19 | AC | 988 ms | 129192 KiB |
| b20 | AC | 999 ms | 128916 KiB |