OJ Board

HI WR!! I OBTAINED AN ACCEPT!!!jejeje
I change the loop, and I check each number and use long, and now my program is ACCEPT!!!
thanks very much for all!!!

OK.In first time I try to check each number, but I obtained a TLE, for that reason I prove the table.
When I'll prove the changes I'll said you the results, ok??
And thanks very much for all, I'm in debt with you
thanks.

hi WR,
1) I prove to write a new line, but I obtained a WA.
I prove to write the first smith number greater than 1e9,but I obtained a WA.
I prove to NO write anything, but I obtained a WA.

and.. I don't know what can I prove...

2)My program find the prime numbers lowest than 50000, becose the ...

eh... ouch!!! jejejjee I ignore that.. but run ok!!my program read the input and find the solution but don't write a new line for the new matrix.

I always got WA for this problem and I don't know where my mistake.
I prove for a this input...
5
26 325
AB
AC
AD
AE
AF
AG
AH
AI
AJ
AK
AL
AM
AN
AO
AP
AQ
AR
AS
AT
AU
AV
AW
AX
AY
AZ
BC
BD
BE
BF
BG
BH
BI
BJ
BK
BL
BM
BN
BO
BP
BQ
BR
BS
BT
BU
BV
BW
BX
BY
BZ
CD
CE
CF
CG
CH
CI
CJ
CK
CL
CM
CN
CO
CP
CQ
CR ...

Yes, for that input your program goes well.. but, you should be prove for that input :wink:


2

8 11
abcDEFGhigg
hEbkWalDork
FtyAwaldORm
FtsimrLqsrc
byoArBeDeyv
Klcbqwikomk
strEBGadhrb
yUiqlxcnBjf
7
fha
fro
ggi
Waldorf
Bambi
Betty
Dagbert
6 8
dbFdxHYo
IaVNewTd
aDvEntuR
YoYoYoYo ...

thanks WR
who can tell me one solution of my problem???

hi WR,I prove your input and this is my output :wink:

22
22
22
4
22
4
4
4
22
4
22
4
22
22
4
4
22
22
4
22
58
22
85
58
58
58
27
121
58
85
27
85
58
85
94
85
4
85
22
85
762
265
438
265
121
778
58
378
562
985
454
913
319
346
861
728
483
663
825
58
7287
7674
1507
94
6502
1449
3690
5998
4126
7089
9094 ...

in this post you have an input and output
http://online-judge.uva.es/board/viewtopic.php?t=7694
i have WA too, but the input is correct.

yes, this is my output, and what's wrong??
22,27,58,4937775,4937818,1000000165 and 31639 are smith numbers, or no?
22= 2+2=4-->2+1+1=4
27=2+7=9-->3+3+3=9
...
1000000165=1+1+6+5=13;-->5+200000033=5+2+3+3=13(200000033 is prime)

what's should be the output with a input greater than 1e9??
I prove

if ...

thanks, but i know this:

Wilansky decided later that a (simple and unsophisticated) prime number is not worth being a Smith number and he excluded them from the definition.

and my output from this input:(that i find in another post)

20
4937774
4997775
5445454
4648787
4897987
5789798 ...

somebody can tell me what's the result?can tell me what I have to write to make the problem?

mercy

I always got WA for this problem and I don't know where my mistake.

where is the problem?????in my home goes well :cry:

using namespace std;
#include <iostream>
#include <list>
#include <cmath>

list<int> prim;
list<int> ::iterator itp=prim.begin();

inline void suma(unsigned int& s,int n ...