Is there any formula for calculating the count of prime factors of a number 'N'? I know the loose upper bound is log2(N) but is there a better upper bound? Thanks.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Is there any formula for calculating the count of prime factors of a number 'N'? I know the loose upper bound is log2(N) but is there a better upper bound? Thanks.
I'm trying this problem from some time but not even able to get one step towards the solution. Any help regarding the approach / concept required will be much helpful ThankYou
int a[100];
int sum = 0;
for(int i = 0; i < 100; ++i) {
cin >> a[i];
sum += a[i];
}
and
int sum = 0;
for(int i = 0; i < 100; ++i) {
int val;
cin >> val;
sum += val;
}
My doubt is whether both the code snippets consume same amount of memory ?
Thanks in advance!
Edit : I don't understand why it's getting downvoted despite being a valid doubt.
Name |
---|