Please help me with WA#10. Can you give me the test in which my program outputs this WA.

program Project1;
{$LONGSTRINGS ON}
{$APPTYPE CONSOLE}

uses
  SysUtils;

var c,lc:char;
    ans:longint;
    b:boolean;

begin
  {$IFNDEF ONLINE_JUDGE}
  reset(input,'input.txt');
  rewrite(output,'output.txt');
  {$ENDIF}
  ans := 0;
  b := false;
  c := #1;
  while not eof(input) do
  begin
    lc := c;
    read(c);
    if (c in ['a'..'z']) and (not b) then
      inc(ans);
    if (c in ['A'..'Z']) and (lc in (['A'..'Z'] + ['a'..'z'])) then
      inc(ans);
    if not (c in ['.','?','!',' ',#10,#13]) then
      b := true;
    if c in ['.','?','!'] then
      b := false;
  end;
  write(ans);
end.

Hello! If you have WA 31 (I haven't seen these yet, but all is possible:D), try these test:
5
2 0
3 0
1 0
3 5 0
4 0
--
4 5 0
Maybe it will help you.

Edited by author 28.07.2016 14:58

For example:
1
9

What it is test 20 ?

Edited by author 27.07.2016 17:35

Edited by author 27.07.2016 17:35

Edited by author 27.07.2016 18:36

Please, give me some tests. I can't understand why i get WA4.

Why wa26?)
Tests help me to pass test 2 and test 3.
9
1 -1
2 1
1 0
2 2
0 1
-2 2
-1 0
-2 1
-1 -1

1.00

12
2 1
1 1
1 2
-1 2
-1 1
-2 1
-2 -1
-1 -1
-1 -2
1 -2
1 -1
2 -1

1.41

never mind...

Edited by author 28.07.2016 07:32

class Node:
    def __init__(self, name, number):
        self.name = name
        self.number = number
        self.children = []

    def d(self, name):
        for i in self.children:
            if i.name == name:
                self.children.remove(i)
        for i in self.children:
            i.d(name)


def fnc(cmds, item, isenb, root):
    for c in cmds:
        if item.name in c:
            for n in c:
                if not n in isenb:
                    isenb[n] = item.number + 1
                    item.children.append(Node(n, item.number + 1))
                elif isenb[n] > (item.number + 1):
                    isenb[n] = item.number + 1
                    root.d(n)
                    item.children.append(Node(n, item.number + 1))
    for i in item.children:
        fnc(cmds, i, isenb, root)

import sys
if __name__=='__main__':
    n_command = input()
    if(int(n_command) > 0):
        isenb = {}
        cmds = []
        for i in range(0,int(n_command)):
            cmds.append(input().split())
        flag = False
        for c in cmds:
            if "Isenbaev" in c:
                flag = True
                break
        if flag:
            root = Node("Isenbaev", 0)
            isenb["Isenbaev"] = 0
            fnc(cmds, root, isenb, root)
        for c in cmds:
            for i in c:
                if not i in isenb:
                    isenb[i] = "underfined"
        s = ''
        for key,value in sorted(isenb.items()):
            if s == '':
                s += (str(key) + ' ' + str(value))
            else:
                s += ('\n' + str(key) + ' ' + str(value))
        sys.stdout.write(s)
    else:
        sys.stdout.flush()

i solved, but my algo so slow, how can i solve this problem faster,
sorry for my english.
thx!

Please give me test 6?

Can anyone please suggest the test case which might give me WA35...

I have used string , also tried with character array...  and KMP algorithm

.....
please do reply

don't print endline symbol after last query:

for(int i=0;i<queries;i++){
answer_the_query();
if(i!=queries-1) printf("\n") //without this line it got wa#1!
}

Edited by author 15.09.2010 08:42

I've made a browser extension that adds charts of count of solved problems to Timus profiles.

You can find screenshots, installation instructions, and source code here:
http://github.com/borzunov/timus-charts/blob/master/README.md

The extension is available for Chrome, Firefox (with Greasemonkey) and Opera.

Edited by author 20.07.2016 22:47

#include<iostream>
#include<list>
using namespace std;
bool in_the_range(char a)
{
    if (a >= 'a'&&a <= 'z')
    {
        return true;
    }
    else
    {
        return false;
    }
}

int chance_one_symb(char in_symbol, char out_sybmbol)
{
    if ((in_the_range(in_symbol) && in_the_range(out_sybmbol)) || !(in_the_range(in_symbol)) && !(in_the_range(out_sybmbol)))
    {
        if (in_symbol == out_sybmbol)
        {
            return 0;
        }
        else
        {
            return 5;
        }
    }
    else
    {
        if (((int)in_symbol + 32) == out_sybmbol || ((int)in_symbol - 32) == out_sybmbol)
        {
            return 5;
        }
        else
        {
            return 10;
        }
    }


}

int main()
{
    char str[200] = { NULL };
    const char word[6] = { 'S', 'a', 'n', 'd', 'r', 'o' };
    int final_cost = 60, temp_cost = 0;
    cin.get(str, 200);
    list<char> temp;
    list<char>::iterator ptr;
    for (size_t i = 0; i < 6; i++)
    {
        temp.push_back(str[i]);
    }
    int j = 0;
    for (size_t i = 6; i <= strlen(str); i++)
    {
        for (ptr=temp.begin(); ptr!=temp.end(); ptr++)
        {
            temp_cost += chance_one_symb(*ptr, word[j]);
            if (temp_cost>=final_cost)
            {
                break;
            }
            j++;
        }
        j = 0;
        if (temp_cost < final_cost)
        {
            final_cost = temp_cost;
        }
        temp_cost = 0;
        temp.pop_front();
        temp.push_back(str[i]);


    }
    cout << final_cost;
    return 0;
}

Edited by author 14.07.2016 22:33

i came to know about this very good russian site, e-maxx.ru...
but i dont know russian, can anybody help how to read the content in english ?

import java.util.*;
public class N1068 {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        if ((n>=1)&&(n<10000)) System.out.print(n *(n + 1) / 2);
        if ((n<1)&&(n>-10000)) System.out.print(-((-n) *(1 -n) / 2) + 1);
    }
}

что здесь не так?

Could anybody give me this test please? Other tests are welcome as well :)

Edited by author 19.07.2016 15:33

I set condition to terminate program:

while (!halt)
{
    //bla bla bla
    executed++;

    if (executed > MAX_EXECUTED)
          terminate_program();
}

to

while (executed < MAX_EXECUTED && !halt)
{
     //bla bla bla
     executed++;
}

if (executed >= MAX_EXECUTED && !halt)
    terminate_program();

It helps me and I got AC :)

Edited by author 16.07.2016 19:03

Edited by author 16.07.2016 19:04

Edited by author 16.07.2016 19:05

I am using dijkstra by adding a reverse edge of weight 1. Answer will be MIN ( Shortest distance, total_edges - shortest_distance);