Почему не проходит тест? Вроде все правильно

WA in Case #6.
Could you give me the case?

Edited by author 11.10.2015 17:59

Edited by author 11.10.2015 17:44

Just print:
1)2*n-1
2)1 2 ... n
3)n n-1 ... 2

Please help me, what is wrong with my solution....
Const
 MaxN = 100000;
Var
 b : array[1..MaxN] of boolean;
 c : array[1..2,1..MaxN] of longint;
 c_num,n,m,i,x,y : longint;
BEGIN
 Readln(n,m);
 Fillchar(b,sizeof(b),true);
 Fillchar(c,sizeof(c),0);
 c_num := 0;
 For i := 1 to m do
  begin
   Read(x,y);
   if b[x] and b[y] then
    Begin
     Inc(c_num);
     c[1][c_num] := x;
     c[2][c_num] := y;
     b[x] := false;
     b[y] := false;
    End;
  End;
 Writeln(c_num);
 For i := 1 to C_num do
  Begin
   Writeln(c[1][i],' ',c[2][i]);
  End;
END.

Кто решил,напишите пару тестов.

import sys

def wall_scaner(amount, wall):
    count = 0
    high = 0
    mid_number = ''
    while count < int(amount) - 2:
        summ = 0
        unit = wall[count:count + 3]
        for i in unit:
            summ += int(i)
        if summ > high:
            high = summ
            mid_number = count + 2
        count += 1
    return high, mid_number

data1 = sys.stdin.readline()
data2 = sys.stdin.readline()
amount = ''.join(data1.split())
wall = ''.join(data2.split())
answer = wall_scaner(amount, wall)
print(answer[0], answer[1])

plz tell me what's wrong
this code always return right format and answer for me

What's wrong?
Please, answer me.

#include <iostream>
#include <vector>
using namespace std;

int main() {
    bool z;
    vector <int> so(0), st(0);
    unsigned int a;
    cin >> a;
    while (so.size() < a) {
        int soe;
        cin >> soe;
        so.push_back(soe);
    }
    unsigned int b;
    cin >> b;
    while (st.size() < b) {
        int ste;
        cin >> ste;
        st.push_back(ste);
    }

    for (unsigned int i = 0; i < so.size(); i++)
        for (unsigned int j = 0; j < st.size(); j++) {
            if (so[i] + st[j] == 10000) {
                z = true;
            }
        }
    if (z == true) {
        cout << "YES" << endl;
    }
    else {
        cout << "NO" << endl;
    }

}

Edited by author 24.10.2015 04:23

New test was added, 1158 AC solutions failed.

Hi there,

My AC code (and, I think, many others) outputs "-1" for the following test, whereas according to the problem statement right answer is "3":

1 5
+-+-+-+.+-+
| | .1|2| |
+-+.+-+-+-+

It seems this problem needs more good tests.

I thought ranking was determined first by solution time, with ties broken by submission date.   But you can see here: http://acm.timus.ru/rating.aspx?space=1&num=1797  that the #1 ranked solution has the same solution time as the other top submissions, but a later submission date.    Why is this?

There are too many different cases to consider, use a brute-force approach to get AC on the first attempt with one page of code:

1) write a function that checks that the situation is good;

2) for every coordinate make a list of four interesting values (all values taken by existing potatoes and some others if this is not enough);

3) try all possible ways to move none, one, or two potatoes, so that the coordinates of the new position are from the interesting values.

from random import randint

v1 = ''
v2 = ''
cod1 = ''.join(map(str, [randint(0, 9) for _ in range(1, 5)]))
cod2 = ''.join(map(str, [randint(0, 9) for _ in range(1, 5)]))

while v1 != cod1 and v2 !=cod2:
    n = input().split()
    v1 = n[0]
    v2 = n[1]
    if v1 != cod1 and v2 != cod2:
        print('no')
print('yes')

Tested with already palindrome (as said before), any ideas?
For input: aba it will write: ababa and for: abba -> abbabba

Can you give me more tests so i can check my programm? Any input i give him is solved correctly, no matter the size or the number of paranthesis. Please help!

//package timus;

import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Scanner;

public class p1793 {
    public static void main(String[] args) {
        InputStream is = System.in;
        Scanner sc = new Scanner(new InputStreamReader(is));
        double a,b,h,r1,r2,R1,R2,H,rr1,rr2,x1,y1,x2,y2,D,d;
        boolean inside1,inside2;
        a = sc.nextInt();
        b = sc.nextInt();
        h = sc.nextInt();
        r1 = sc.nextInt();
        R1 = sc.nextInt();
        r2 = sc.nextInt();
        R2 = sc.nextInt();
        H = sc.nextInt();
        rr1 = R1;
        rr2 = R2;
        if (H >= h) {
            double d1,d2;
            d1 = (R1-r1)/2.0;
            d2 = (R2-r2)/2.0;
            rr1 = 2*d1 * h / H + r1;
            rr2 = 2*d2 * h / H + r2;
        }
        inside1 = 2.0 * rr1 <= a && 2.0 * rr2 <= b;
        inside2 = 2.0 * rr1 <= b && 2.0 * rr2 <= a;
        if (!inside1 || !inside2) {
            System.out.println("NO");
            return;
        }
        x1 = rr1;
        y1 = rr1;
        x2 = a - rr2;
        y2 = b - rr2;
        D = R1 + R2;
        d = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
        if (d >= D * D) {
            if ((x2 - x1 + rr1 + rr2) <= a && (y2 - y1 + rr1 + rr2) <= b)
                System.out.println("YES");
            else
                System.out.println("NO");
        } else {
            System.out.println("NO");
        }
    }

}

All ok!)

Edited by author 03.10.2015 14:49

Edited by author 03.10.2015 14:49

Edited by author 05.10.2015 18:55