Print All Divisors of Number in Increasing Order (Code Vita)

general
85

I think you are saying the same . Did you check my sample code for pf . Here it is fQZFMk - Online C++0x Compiler & Debugging Tool - Ideone.com .

1 Like
86

Maybe this works as well.

87

yeah ! So if a number is composite , the inner while loop will reduce my number , and the sqrt(n) will also get further reduced . But if a number is prime itself , then inner while loop wonā€™t run and my complexity in worst case will be sqrt(n) . How will you achieve sqrt(n)/10 in this case .

88

I precompute all prime numbers before hand and push them into a vector (letā€™s say vector v) (using sieve).
PS: This is useful when we want to factorize more than 10 numbers.
We had to factorize 15 different numbers in the que which was discussed in this thread.
Then for each test case i do

             for(int i=0;v[i]<=sqrt(n);i++)
                      while(n%v[i]==0)
                               n/=v[i];
1 Like
89

What about the pf greater than the sqrt(n) . It will itself be prime right ? .

1 Like
90

right \hspace{0mm}

91

Thanx . By the way whatā€™s your cf handle name ?

92

smit_mandavia \hspace{0mm}
welcome

93

Such a Genius :heart_eyes::heart_eyes::heart_eyes::heart_eyes::heart_eyes::blush::blush::blush::blush::blush:

94

Youā€™re joking :joy: \hspace{0mm}

95

@meiniak Can you please share you solution if it was Accepted . :slightly_smiling_face:

96

results announcedā€¦,.,.,.,.,.,.,

97

where we can see the rank?? they just send me the mail of shortlisting wtf??

98

yes same hereā€¦,.,.,.,.,

99

in mockvita the results and ranks are showcase on TCS codevita siteā€¦Now it will not open for loginā€¦Iā€™m so desperate to see my rankā€¦XD

100

Used sqrt method to found all the divisor and created two list one containing divisor in ascending order and other in descending order . printed 2nd list in descending order . I got this solution passed after 2-3 attempts :smile:

101

I did exactly same but got TLE :sweat_smile:

102

Do in C they have supercomputer :sweat_smile::sweat_smile:

103

This is working :
import java.util.*;
public class Divinedivisor {
public static void main(String[]args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
Listl1=new ArrayList();
for(int i=1;i<=n;i++)
{
if(n%i==0)
{
l1.add(i);

}
}
for(int i=0;i<l1.size();i++)
{
System.out.println(l1.get(i)+" ");
}
}

}