OJ Board

Hi.
I need help with 640 problem. I wrong answered and I don't understand why.
Could someone send me the solution?
Thank you in advance.
agutierrez1@usuarios.retecal.es

Hi

Try do this in brutal way (check all the posibilities)
You can do this in this way:

for x=1 to 1000000 do

if (x was not used before) then
begin
Write (x)
end;

generate new number and check it as used
(you can use an array)

end;

This program should generate all the numbers.





<font size=-1>[ This Message was edited by: cyfra on 2001-12-20 12:56 ]</font>

Help me, I'm getting WA on this problem.
How many self numbers are there below 10000 and below 50000?
Please someone answer my question and Thanks.

<10000: 983
<50000: 4895

My code is bellow. It generates Runtime Error. Would U help me?

==============================
#include<stdio.h>
#include<bitset>
#include<string>
#include<iostream>
using namespace std;

bitset <1000010> self_num;

long long gnrt(long long a)
{
unsigned long j = a;
while(a != 0)
{
j += a%10; a /= 10;
}
return j;
}

int main()
{
long long i, j;
for(i = 1; i <= 1000000; i++)
if(self_num.test(i) == 0)
{
printf("%ld\n", i);
j = gnrt(i) ;
self_num.set(j);
}
else
{
j=gnrt(i); self_num.set(j);
}
return 0;
}
==============================

Hi, consider this segment of your code.

[cpp]
for(i = 1; i <= 1000000; i++)
if(self_num.test(i) == 0)
{
printf("%ld\n", i);
j = gnrt(i) ;
self_num.set(j);
}
else
{
j=gnrt(i); self_num.set(j);
}
[/cpp]

when i is very large, j will be a value which is larger than the size of your bitset, hence you will get RTE when attempting to set that bit.

In generating self numbers of base 10 I am using the recursive relation:
Initial condition is g(1)=9
My program prints 9 and then directly jumps to 97. What might be wrong with my program? Please reply.

koodeGuru wrote:In generating self numbers of base 10 I am using the recursive relation:

Code: Select all

g(n)=8*10^(n-1)+g(n-1)+8;

Initial condition is g(1)=9
My program prints 9 and then directly jumps to 97. What might be wrong with my program? Please reply.

your program is right Ciao!!!

Claudio

I knew that I was getting appropriate output. But how do I print out all self numbers less than 1000000. Do I have to use a different recursive relation?Thanks.

I knew that I was getting appropriate output. But how do I print out all self numbers less than 1000000. Do I have to use a different recursive relation?Thanks.

koodeGuru wrote:I knew that I was getting appropriate output. But how do I print out all self numbers less than 1000000. Do I have to use a different recursive relation?Thanks.

Basically self(n+1)=self(n)+11.
You only need some extra care when you step over multiples of 10^n with n>=2.

Ciao!!!

Claudio

U can also check all number if it is self number
J get AC by deleting numbers who are not self number's

Here is my code I don't understand why it's WA. Help me pls.

[cpp]Spoiler[/cpp]

Arm.Turbo,
You are only adding five digits, whereas the numbers can be up to six digits.

999943
999945
999956
999967
999978
999989

My last numbers are they correct?