Edited by moderator 23.08.2020 01:17

can anyone please tell me what is test case 2

I don't know what my code's problem is. I have tested all input and got correct output, however I got WA#1 when summitting. Please help me!!

Edited by moderator 23.08.2020 01:19

My code is ok all tests before #8, but I've WA on #8... Anything that I don't see?

Thanks

So, i wrote my program for a warn-up to commercial programming, but i have a problem at this problem. It gives me wrong answer at the first test and i need your help, guys from this site. Here's the code:
// Percentofpeople.cpp : Defines the entry point for the console application.
//

// Your task is to find the minimal positive integer number Q so that the product of digits of Q is exactly equal to N.

#include <iostream>
#include <string>


int main()
{
    int number; // a number that we need to get
    std::string answer;
    std::cout << "Enter the number: " << std::endl;
    std::cin >> number;
        for (int i = 9; i >= 2; i--)
        {
            while (number > 1 && number % i == 0) // if we can divide number and before it gets to 1 we'll do the following code:
            {
                answer = std::to_string(i) + answer; // add the number that divides N completely
                number /= i; // divide
            }
        }
        if (number == 1)
            std::cout << answer;
        else
            std::cout << -1;
    std::cin.get();
    std::cin.get();
    return 0;
}

I dunno how it looks but i think you'll understand it. So, where is the problem? The problem is with numbers from 1 to 9 or what?

        if is_test_script:
            print True if begin_script(10) == 25 else False
            print True if begin_script(9) == 9 else False
            print True if begin_script(150) == 556 else False
            print True if begin_script(11) == -1 else False

            print True if begin_script(10000000000) == -1 else False
            print True if begin_script(1000000000) == 555555555888 else False

            print True if begin_script(167) == -1 else False
            print True if begin_script(24) == 38 else False
            print True if begin_script(180) == 566 else False
            print True if begin_script(360) == 589 else False
            print True if begin_script(0) == 10 else False
            print True if begin_script('test') == -1 else False

            print True if begin_script(1013) == -1 else False
            print True if begin_script(27) == 39 else False
            print True if begin_script(1) == 1 else False
            print True if begin_script(0001) == 1 else False
            print True if begin_script(45) == 59 else False
            print True if begin_script(40) == 58 else False
            print True if begin_script(22) == -1 else False

that tests are true
Edited by author 29.05.2016 05:08

Edited by author 29.05.2016 05:09

What is Test #3?

If someone is interested Test# 4 is the following

Q=0;
Output = 10;

Program must return Q=10 if N==0 and Q=1 if N==1.

This is not what one should expect from the description of the problem.

Edited by moderator 23.08.2020 01:25

(source removed after AC)

Edited by author 23.01.2015 06:01

New tests have been added. All accepted solutions have been rejudged. 886 authors have lost AC.

I am getting WA in test#10. Can anyone help me??? Thanks in advance. :)

Обратите внимание на результат при N = 1000000000.
А точнее на его размер 555555555888 в 32 бита он не поместится.
8 тест из-за этого выдает "Wrong answer".

tell me, please, what input in test 5.

use long long int instead of int , it may help..

if N=1 000 000 000 i have Q->555555555888. And as i read it's right answer.

Edited by author 06.01.2013 05:07

N=12 Q=26 not 34.

To whom it may concern!

There were sovlved two different programms. The first one, when there is given an input 120 the output is 358; the second output is 456. But both of them were accepted. Could you explain to me why this that, if you please?

   var
a:array[1..10000] of Longint;
b:array[1..10000] of string;
min,c,n,i,j,k:Longint;
s:string;
begin
read(n);
for i:=2 to n-1 do
begin
 if n mod i=0 then j:=i;
 if (j<>0) and (j<10)  then
 begin
 k:=k+1;
 str(j,b[k]);  str(trunc(n div j),s);
 b[k]:=b[k]+s
 end;
end;
 for i:=1 to k do val(b[i],a[i],c);
 min:=a[1];
 for i:=1 to k do
  if min>a[i] then min:=a[i];
  if min<>0 then write(min);
 if j=0 then  write('-1');
 end.