Leaderboard
Showing:
Handle Score
@Ibrahim Nash 6420
@blackshadows 6380
@mb1973 5646
@Quandray 5233
@akhayrutdinov 5111
@saiujwal13083 4716
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3413
Complete Leaderboard
Number of ways to find two numbers
Easy Accuracy: 23.33% Submissions: 30 Points: 2

Given a positive integer K. Find the number of ordered pairs of positive integers (a,b) where 1a<b<K such that a+bK.

 

Example 1:

Input:
K = 2
Output:
0
Explanation:
There are no solutions for K = 2.

Example 2:

Input:
K = 4
Output:
2
Explanation:
There are 2 solutions:- (1,2) and (1,3).

 

Your Task:
You don't need to read input or print anything. Your task is to complete the function numOfWays() which takes an Integer K as input and returns the number of solutions for a and b (1≤a<b<K) such that a+b ≤ K.

 

Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)

 

Constraints:
1 <= K <= 105

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Number of ways to find two numbers

Output Window