Problem:-
There is a frog initially placed at the origin of the coordinate plane. In exactly second, the frog can either move up unit, move right unit, or stay still. In other words, from position , the frog can spend second to move to:
After seconds, a villager who sees the frog reports that the frog lies on or inside a square of side-length with coordinates , , , . Calculate how many points with integer coordinates on or inside this square could be the frog's position after exactly seconds
Input Format:
The first and only line of input contains four space-separated integers: , , , and .
Output Format:
Print the number of points with integer coordinates that could be the frog's position after seconds.
Constraints:
Note that the Expected Output Feature for Custom Invocation is not supported for this contest.
The points shown are the points on or in the specified square, and those that are red are the points that the frog could be at after seconds.
Code:-
Solution 1 ( C language):-
Solution 2 ( C++ language):-
Solution 3 (java language):-
keywords:-
,counting frog paths hackerearth solution,frog path code in python,,frog path in python,counting closed paths hackerrank solution,count paths hackerearth solution,counting closed paths in c hackerrank,counting closed paths hackerrank solution in c,
Recommended Post:-
- codechef problems:-
Wipro :-
- Update the booking ID | Wipro previous year question paper solution
- Pages in PDF
- Find the location id
- Find the odd digits
- Find the Product ID
Infytq :-
Key Points;-
Hackerrank:-
- Python : missing characters : hackerrank solution
- Python : string transformation | Hackerrank solution
- Active Traders certification test problem | Hackerrank Solution
- Usernames changes certification test problem | Hackerrank Solution
- string Representation of objects certification test hackerrank solution
- Average Function | hackerrank certification problem solution
C-tutorial:-
- Micros in C
- Pointer in c
- Function declaration
- Types of user define function
- return type of function
- 2D array
- c program to convert specified days into years weeks and days
- Print Reverse Hollow Pyramid
- Update the booking ID | Wipro previous year question paper
- Pages in PDF | Wipro previous year question paper
- Sparse Matrix in data structure
- Find the location ID | Wipro previous year Coding question
- find the odd digits | Wipro Coding question
- Find the product id | Wipro Coding question
- Difference between static and dynamic memory allocation
- What is asymptotic Notation
0 Comments