OJ Board

hi..
pls help me finding the bug>>>
thanks for any help... thanks.

I did not read your code carefully...But her is a good note
Most who get wrong answer assume smith number is a prime number
I think you do that

Note
No need for generating any primes...Just a function that try all i that less than or equal to its sqrt
If you need more about this Just ask

I am at my wits end what to do. I tried by all means but could not break the vicious cycle of WA from the online judge !!
here is my code: It passes all the inputs . I checked it with almost possible inputs and everytime it gives me the right answer. I dont know where it is going wrong . Is theke anyone to help me?

Hi, Kallol.

http://online-judge.uva.es/board/viewto ... ight=10042
This thread will just help you.

Best regards.

Thanx a lot.
I just missed out the case for 2.
I almost left trying that problem and wasted lots of my time for that silly mistake.Now I got ACCEPTED.
Thank u once again

There are some inputs but no corresponding outputs. Pls someone post correct outputs.
Thnx in advance.

this is the code...



#include<iostream>
#include<cstdlib>
#include<vector>
#include<cmath>
using namespace std;
int sum_digits(long num)
{
int sum=0;
while(num!=0)
{
sum+=num%10;
num/=10;
}
return sum;
}
int main()
{
vector<long> primes;
vector<int>primes_sum;
primes.push_back(2);
primes_sum.push_back(2);
long limit=(long)floor(sqrt(1000000000)),num,j;
int num_cases;
for(long i=3;i<=limit;i++)
{
bool flag=true;
int size=primes.size();
for (int j=0;j<size;j++)
{
if(i%primes[j]==0)
{
flag=false;
break;
}
}

if(flag)
{
primes.push_back(i);
primes_sum.push_back(sum_digits(i));
}

}
cin >>num_cases;
for(int k=0;k<num_cases;k++)
{
std::cin >>j;
j++;
while (1)
{
int total_count=0;
num=j;
int digits=sum_digits(num),prime_digits=0;
for(int i=0;i<primes.size()&&num!=1;i++)
{
int count=0;
while(num%primes==0)
{
count++;
num/=primes;
total_count++;
}
prime_digits+=primes_sum*count;
count=0;
}
if(num!=1)
{
prime_digits+=sum_digits(num);
total_count++;
}
if(digits==prime_digits && total_count>1 )
{
cout<<j<<'\n';
break;

}
else
j++;
}
}
return(0);
}

I tried out evrything....but couldnt find the mistake...
please help me out..

Anybody who still got WA should read these notes:
1. Prime numbers are NOT Smith numbers
2. Integer data type is ENOUGH, instead using unsigned or long long
3. Output for 1,000,000,000 is 1,000,000,165
4. Output for 1 is 4 !!!

sample:
output:

#include <stdio.h>

unsigned Factorize(unsigned u);
int sumPosNumber(unsigned number);

int main()
{
unsigned number = 29716;
unsigned smith= 0;
unsigned result = 1;
unsigned max;

scanf("%ld",&max);
for(unsigned i=0;i<max;i++){
scanf("%ld",&number);
number++;
while(smith != result )
{
result = Factorize(number);
// printf("result = %ld\n",result);
if(result != 0){
smith = sumPosNumber(number);
// printf("smith = %ld\n",smith);
}
number++;
}
printf("%ld\n",number-1);
result = 0;
}
return 0;
}

unsigned Factorize(unsigned u)
{
unsigned init = u;
unsigned result = 0;
unsigned temp;

for(unsigned i = 2;i<u;)
{
if(u%i == 0)
{
temp = sumPosNumber(i);
//printf("%ld",temp);
result += temp;
if (u!=i)
{
// printf("*");
u /= i;
i = 2;
}
}else
i++;

}
if(init == u){

return 0;
}
// printf("%d\n",u);


temp = sumPosNumber(u);
return result+temp;
}

int sumPosNumber(unsigned number)
{
int smith = 0;
int temp;

while(1)
{
if(number == 0){
break;
}else{
temp = number%10;
smith += temp;
}

number = number/10;
}
return smith;
}

why ... wa?
i'm not good well english... sorry about ..

scanf and printf should use %u for unsigned, %ld is for a long.

thanks to brianfry713 !! time limit t. t

Start by precomputing a list of primes.

Acc

Try to speed up your Cal function. If you only want 10,000 primes you only need to check up to 104,729, not 100,000,000.