Last K Factors of N

PKJ

 Coding Problem Keys 

 Last K Factors of N 

 Problem Statement 

The program must accept two integers N and K as the input. The program must print the last K factors of N in ascending order as the output. If the number of factors in N is less than K, the program must print all the factors of N in ascending order.

 Input Format 

The first line contains N and K separated by a space.

 Output Format 

The first line contains the integer value(s) separated by a space.

 Boundary Condition(s) 

1 <= N < 10⁴
1 <= K <= 100

 Example Input/Output 1 

 Input 

100 5

 Output 

10 20 25 50 100

 Example Input/Output 2 

 Input 

24 10

 Output 

1 2 3 4 6 8 12 24

 Max Execution Time Limit: 500 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n,k=map(int,input().split())
c=[n]
for i in range(n//2,0,-1):
    if(n%i==0):
        c.append(i)
print(*sorted(set(c[:k])))

# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

String Rotation Odd and Even Positions

PKJ
 Coding Problem Keys   String Rotation Odd and Even Positions   Problem Statement  A string S and two integers M and N are passed as input. The program must rotate the characters present in the odd positions of the string M times and rotate characters present in the even positions of the string N times.  Boundary Condition(s)  2 <= Length of the string <= 1000. 1 <= M, N <= 1000.  Input Format  The first line contains the values of S, M and N separated by space(s).  Output Format  The first line contains the rotated string.  Example Input/Output 1   Input  technology 2 3  Output  logotycenh  Explanation  The characters present in the odd positions are 'tcnlg'. When rotated 2 positions, the value is 'lgtcn'. The characters present in the even position are 'ehooy', When rotated 3 positions, the value is 'ooyeh'. Hence the rotated string value is 'logotycenh'.  Example Input...
Click to Continue...

Adding One without Operator

PKJ
 Coding Problem Keys   Adding One without Operator   Problem Statement  Write a program to add one to a given number. The use of operators like '+', '-', '*', '/', '++', '--' etc... are not allowed.  Input Format  The first line contains the value of N.  Output Format  The first line contains value of N+1.  Example Input/Output 1   Input  23  Output  24  Example Input/Output 2   Input  89  Output  90  Solution   Programming Language: C++ Language  #include <bits/stdc++.h> using namespace std; int addOne ( int x){ int m= 1 ; while (x&m){ x=x^m; m<<= 1 ; } x=x^m; return x; } int main (){ int n; cin>>n; cout<<(addOne(n)); } // Published By PKJCODERS  ( Note:  Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improv...
Click to Continue...

Desktop Products

PKJ
 Coding Problem Keys   Desktop Products   Problem Statement  A company DigiComparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Each product manufactured by the company has a unique productID from a-z and and A-Z. The laptop products have productIDs (a, i, e, o, u, A, I, E, O, U) while the rest of the productIDs are assigned to the desktop products. The company manager wishes to find the sales data for the desktop products. Given a list of productIDs of the sales of the last N products, write an algorithm to help the manager find the productIDs of the desktop products.  Input Format  The first line of the input consists of an integer numOfProducts, representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ... , productID N  represen...
Click to Continue...

First N Repeated Characters

PKJ
 Coding Problem Keys   First N Repeated Characters   Problem Statement  The program must accept a string S and then print all the characters which are among the first N repeated characters in S.  Input Format  The first line contains the value of S. The second line contains the value of N.  Output Format  The first line contains the string output.  Constraints  1 <= Length of S  <= 1000 1 <= N <= 100  Example Input/Output 1   Input  abcdeabecdacdbe 4   Output  abceabecacbe   Explanation  Though all characters a, b, c, d, e are repeated thrice, the first four repeated characters are a b c e.  Example Input/Output 2   Input  officialwork 2   Output  ffii  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  def firstRepeatedChar (s,n): h = {} k=[] for ch ...
Click to Continue...

Reversed Sum of Pairs

PKJ
 Coding Problem Keys   Reversed Sum of Pairs    Problem Statement  An array of N integers is passed as input. The program must print the sum of every two consecutive elements in the array from last.  Boundary Condition(s)  1 <= N <= 1000  Input Format  The first line contains N . The second line contains N integers separated by space(s).  Output Format  The first line contains the sum of pairs separated by a space.  Example Input/Output 1   Input  4 10 50 30 60  Output  90 60  Example Input/Output 2   Input  5 25 50 100 250 300  Output  550 150 25  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main () { int n,i; scanf( "%d" ,&n); int arr[n]; for ( int i= 0 ;i<n;i++){ scanf( "%d" ,&arr[...
Click to Continue...

Find Maxima/Minima

PKJ
 Coding Problem Keys   Find Maxima/Minima   Problem Statement  Implement the following function: def MaximaOrMinima(a, b, c): Quadratic equation: A quadratic equation is any equation having the form, ax ² + bx + c, where 'a' cannot be zero. The function accepts coefficients of a quadratic equation, 'a', 'b' and 'c' as its argument. Implement the function to find the maximum or minimum value of quadratic equation by substituting integer values x, where -100 <= x <= 100. Return the values as follow: If a > 0, return the minimum value of the equation. If a < 0, return the maximum value of the equation. Assumption: a is not equal to zero. Note: Computed value lies within integer range.  Example 1   Input  a: 1 b: 2 c: 1  Output  0  Explanation  Since, (a > 0) output is the minimum value which is at x = -1, output = 1 * (-1) ²  + 2 * (-1) + 1 = 0. The custom input format for the above case: 1 2 1 (Th...
Click to Continue...