n = int(input())
k=int(input())
n=n*2
if n % k ==0:
  print(n/k)
else:
    a=int(n/k)+1
    print(a)

I can't find my mistake.
It keep telling me "Runtime error"

Help with wa48

Why wa48 or wa49?

Edited by author 06.10.2017 11:52

program de;
    var
    a,b:array[-1400..1400] of integer;
    a1,b1:array[1..2800] of integer;
    i,j,n,max_a,max_b:integer;
    ch:char;
procedure diog;
begin
        if ch='s' then
            begin
             b[i-j]:=0;
             inc(a[i-j]);
             if a[i-j]>max_a then max_a:=a[i-j];
            end
         else
           begin
             a[i-j]:=0;
             inc(b[i-j]);
             if b[i-j]>max_b then max_b:=b[i-j];
            end;
end;
procedure diogobrat;
begin
        if ch='s' then
            begin
             b1[i+j]:=0;
             inc(a1[i+j]);
             if a1[i+j]>max_a then max_a:=a1[i+j];
            end
         else
           begin
             a1[i+j]:=0;
             inc(b1[i+j]);
             if b1[i+j]>max_b then max_b:=b1[i+j];
            end;
end;
procedure vivod;
begin
   if max_a=max_b then
      begin
        writeln('?');
        writeln(max_a);
      end
   else
   if max_a<max_b then
      begin
        writeln('S');
        writeln(max_b);
      end
   else
      begin
        writeln('s');
        writeln(max_a);
      end;
end;
begin
{   assign(input,'c:\test.txt');
   reset(input);                   }
   readln(n);
   for i:=1 to n do
   begin
     for j:=1 to n do
      begin
        read(ch);
        diog;
        diogobrat;
      end;
      readln;
   end;
   vivod;
end.

Please anyone help

try this test

3
2 4
1 5
3 5

bonnon
Answer
b onno n

Edited by author 27.10.2022 10:18

Edited by author 27.10.2022 10:19

n = int(input())
k=int(input())
n=n*2
if n % k ==0:
  print(n/k)
else:
    a=int(n/k)+1
    print(a)

I can't find my mistake.
It keep telling me "Runtime error"

My program got WA8 all the time.
I have added next string to my program

    if(n>50)         vector<long> xxx(1000000);

and it got AC after that!!!
Variable "xxx" never uses in my code! If i delete this line it got WA8!!!!

-200 -5 0
200 -5 0
0 200 0

answer should be 16707.55 (> pi*r*r/2), not 14708.38 (my AC program)

короче сам голову ломал, там переменные в 1 строку вводить надо
может кто то также ошибся

Edited by author 17.10.2022 09:55

Edited by author 17.10.2022 09:55

I don't know why there were so many submitted O(n^2) DP solutions. Here is a simple formula for this problem:
answer = n - (yes + yes*(yes-1) + no*(no-1))/n, where yes = s-2*n and no = n-yes are the total numbers of occurrences of corresponding strings in answer.txt.
You can easily derive this if you try to think of probability of the same verdict for two arbitrary consecutive tests.

What is the mistake?
n = int(input())
a = []
for i in range(1, n+1):
    if n % i == 0:
        a.append(i)
if n == 1:
    print("1")
    exit(0)
if n == 0:
    print("10")
    exit()
if len(a) > 2:
    for i in range(len(a) - 1):
        if a[i] * a[i + 1] == n or a[i]*a[i] == n:
            if a[i] * a[i + 1] == n:
                s = "".join(sorted(str(a[i])+str(a[i+1])))
                print(s)
            else:
                print(a[i], a[i], sep="")
else:
    print("-1")

# Alternative Solution

Valentine is a veteran of programming contests and he's been working in the program committee for many years. He is very busy this week: the bike is under repair, some problems with Indian colleagues have to be solved, and five student groups are to be examined in philosophical problems of mathematics at the university. To crown it all, the new chairman of the program committee asked Valentine to write an alternative solution for one of the problems of the forthcoming contest.

Valentine was so busy that he had no time to read the problem statement. He only glanced at the output format and understood that it was required to output either `YES`, or `NO`.

Fortunately, Valentine was well acquainted with the testing system used in the contest. The system successively runs a solution on all tests of a problem, and for each test the checking process goes as follows. The input is copied to the file input.txt. Then the solution is launched. It reads the input from the file input.txt and writes the result to the file output.txt. When it finishes, the correct answer is copied to the file answer.txt. If the contents of the files answer.txt and output.txt match, the test is assumed to be passed; otherwise, the test is not passed.

Valentine decided to write a program that would operate as follows. If the folder containing the program doesn't contain the file answer.txt (i.e. the program is run on the first test), then the program outputs `YES`. Otherwise, the program outputs the contents of the file answer.txt.

Valentine plans to tell the chairman of the program committee that there is a nontrivial mistake in his program, and this mistake, fortunately, shows itself when the program is run on the excellent hard tests prepared by the author of the problem. However, first Valentine has to estimate the number of tests that his solution won't pass. Valentine doesn't have access to the tests, but he knows the number of tests and the total size of the files with answers. He also knows that the size of the file with the answer `YES` is 3 bytes, the size of the file with the answer `NO` is $2$ bytes, and all the variants of the order of tests are equally probable. Help Valentine to calculate the average number of tests that his solution won't pass.

## Input

The only line contains two integers $n$ and $s$ ($1 \le n \le 5000$; $2n \le s \le 3n$) which are the number of tests and the total size of the files with answers, respectively. The numbers are separated with a space.

## Output

Output the average number of tests that Valentine's solution won't pass, accurate to $10^{-5}$.

## Sample

### input

```
3 7
```

### output

```
2.0000000
```

Let a=s-2n,b=3n-s.
Then the answer is (2ab+b)/n.
Try it, you won't regret it!

answer=(2s-4n+1)(3n-s)/n

we dont know use the locomotive as a carriage, like:
input:
1 1
AA
AB

output:
NO

GOOD LUCK!!!