Read a non-negative integer n and determine how many of its digits are perfect squares. The digits that are perfect squares are 0 (= 0²), 1 (= 1²), 4 (= 2²), and 9 (= 3²).
Mobile coding works. A laptop is faster for long sessions.
Problem
Input format
Input
input.txt
The program reads from standard input a single non-negative integer `n`. - `0 <= n <= 1000000000` - if `n = 0`, the program prints `1` (digit `0` is `0`²)
Output format
Output
output.txt
The program prints to standard output a single non-negative integer: the count of digits of `n` that are perfect squares, followed by a newline.
Example
input
149
output
3
Stuck?
Use the Get Hint button in the action bar to reveal a guided hint.
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
149
Expected output
3
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc