User Profile

shivpratap · Mar 21 '10, 08:02 PM

I have improved my code a lot now but is it possible to reduce its time further without making a major change in this algorithm??.... pls suggest...

Code:

#include<stdio.h>
#include<math.h>
int main()
{  
    long long int n,t,i,sum=0,k;
    scanf("%lld",&t);
    while(t)
    {
    scanf("%lld",&n);
     k =(sqrt(n));

...

shivpratap · Mar 20 '10, 03:26 PM

@yaarofdoom

Thanks,this was my 1st post i dis forum,ill tk care abt it next time...btw i know i can cutshort this loop if replace n with n/2 in the loop......bt still it's consuming more time.....ny better algorithm i can use???.....pls help

@donbock

Thanks can u suggest a better algorithm for this 1??

shivpratap · Mar 20 '10, 02:51 PM

@yaarofdoom

Thanks,this was my 1st post i dis forum,ill tk care abt it next time...btw i know i can cutshort this loop if replace n with n/2 in the loop......bt still it's consuming more time.....ny better algorithm i can use???.....pls help

@donbock

Thanks can u suggest a better algorithm for this 1??

shivpratap · Mar 20 '10, 01:46 PM

@yaarofdoom

Thanks,this was my 1st post i dis forum,ill tk care abt it next time...btw i know i can cutshort this loop if replace n with n/2 in the loop......bt still it's consuming more time.....ny better algorithm i can use???.....pls help

@donbock

Thanks can u suggest a better algorithm for this 1??

shivpratap · Mar 20 '10, 01:27 PM

@yaarofdoom

Thanks,this was my 1st post i dis forum,ill tk care abt it next time...btw i know i can cutshort this loop if replace n with n/2 in the loop......bt still it's consuming more time.....ny better algorithm i can use???.....pls help

@donbock

Thanks can u suggest a better algorithm for this 1??

User Profile

Profile Sidebar

Leave a comment:

Leave a comment:

Leave a comment:

Leave a comment:

Leave a comment:

How can i find the sum of divisors of a given number in a faster way?