|
|
вернуться в форумПоказать все сообщения Спрятать все сообщенияTest #8 Igor Gomes 8 окт 2004 10:55
My code is ok all tests before #8, but I've WA on #8... Anything that I don't see?
Thanks Can anyone help me? I have the same problem and I know the code is ok, I checked it 100 times
Edited by author 29.07.2005 01:06 I also had WA on test#8(now I have AC). I don't know this test, but look:
N = 362880
Right Q is 2578899.
You see: all numbers(digits)in Q must be sorted:
2<=5<=7<=8<=8<=9<=9 - it's condition for minimal Q, but
you must surch begining from 9
in my program the digits are sorted. for your example my answer is also 2578899 correct answer for 0 is 10.
maybe this fact help you. my God..my alog is WRONG.
thx!
Edited by author 02.10.2011 20:48 May be this helps. If input is 12 output should be 26 not 34 . It is something strange...
My program outputs 10, when input is 0, in your examples: 12 -> 26, not 34, but I have WA#8, why????? Program is correct, maybe tests are wrong??? Yes i am having the exact same problem... considered all test cases and am getting the write answers in ascending order but test#8 is giving WA
Edited by author 03.12.2005 18:23
Edited by author 03.12.2005 18:23 I think tests are OK.
If you still need some help send me your code
to sk1@hotbox.ru I have this problem too!!!
All test, what i see is correct;
I use unsigned long;
May be it consist false;
What I doing wrong?
Edited by author 05.04.2006 14:23 test
Edited by author 04.07.2006 19:44 my solution in c++ 0.031 s. #include<iostream> #include<cmath> #include<string> #include<algorithm> using namespace std; inline bool isprime(long a) { if(a==1)return false; if(a==2)return true; if(a%2==0)return false; for(int i=3;i<sqrt(a);i+=2) { if(a%i==0)return false; } return true; } int main() { string a; long n; int d=1; cin>>n; if(n==0)cout<<"10"<<endl; else if(n==1)cout<<"1"<<endl; else{ if(isprime(n) && n>10)d=0; else { int gamyop=9; while(n!=1) { if(n%gamyop==0) { a+=(gamyop+'0'); n/=gamyop; if(isprime(n) && n>10){d=0;break;} } else { gamyop--; } } } sort(a.begin(),a.end()); if(d==1)cout<<a<<endl; else cout<<"-1"<<endl; } return 0; } I have this problem too!!!
All test, what i see is correct;
I use unsigned long;
May be it consist false;
What I doing wrong?
Edited by author 05.04.2006 14:23 try string,or int64 if I using __int64 I have overflow too. In this problem must use only string for result. I used recursive algorithm. (C++)
result and local variables in function must be __int64(long long)
In other cases you'll get an overflow
Usage of string not are obligatory
Test#8 is:
N=1 000 000 000
Q->555555555888
for examle with local or result variables of type unsigned you'll get
Q->1504774704
Sorry for my English :) Re: Test #8 Shu Konstantin Preslavski 22 апр 2010 04:46 I don't know if what is exactlly the test but the answer is something like -1 or 26 ;D It works for me there after fixing that... ;) Yep... problem in java was using int instead of long. Yep... problem in java was using int instead of long. I have Q->555555555888 when N=1 000 000 000, but Test#8 say "WA". Why? thanks mate. I was getting wrong for this reason.
Those who are getting WA at Test #8. try to use "Unsigned long long int" insted of "int". |
|
|
