Question
must be written in java #Special Tickets #You are given a number 1 N 50. Every ticket has two N-digit numbers. We call a ticket
must be written in java
#Special Tickets
#You are given a number 1 N 50. Every ticket has two N-digit numbers. We call a ticket special, if the sum of its first N digits is equal to the sum of its last N digits. You are also given the sum of ALL digits in the number. Your task is to count an amount of special numbers, having the specified sum of ALL digits.
#Input
Two space-separated numbers: N and S. Here S is the sum of all digits. Assume that 0 S 1000.
Output
The amount of special tickets.
Sample
Notes
The special tickets are 0101, 0110, 1001, 1010 in the example above
input | output |
22 | 4 |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started