I got WA #4, but I think I got all special cases ok, so help please.

hi,
what is wrong with this code:
#include <iostream>
using namespace std;
int main() {
 int n ;
 cin >> n ;

 if ( n>= 1 && n <= 4)
     cout << "few";
 if ( n>= 5 && n <= 9)
     cout << "several";
 if ( n>= 10 && n <= 19)
     cout << "pack";
 if ( n>= 20 && n <= 49)
     cout << "lots";
 if ( n>= 50 && n <= 99)
     cout << "horde";
 if ( n>= 100 && n <= 249)
     cout << "throng";
 if ( n>= 250 && n <= 499)
     cout << "swarm";
 if ( n>= 500 && n <= 999)
     cout << "zounds";
 if ( n == 1000)
     cout << "legion";
   system ("PAUSE");
}

it seems that there is no error but it dosen't accept.

1.you should consider total sides that must be fried instead the number of steaks.
2.with every pan we can fry one side of steak independently. for example if we have only 1 steak and 2 pan we can fry it in 1 minute or for 5 steaks and 6 pan we can do it for 1 minute.

Edited by author 07.07.2014 17:30

Edited by author 07.07.2014 17:32

I have WA5, because when i found minx, maxx, miny, maxy they were equal maxx = -10000, minx = 10000 and another too, when i changed all this values to 0, a got AC.

import java.io.*;

public class TaskTimus
{
    public static void main(String[] args) throws IOException
    {
        new TaskTimus().vvod();
    }

    String s = ""; String s1 = ""; String a[] = new String[120]; char c;
    int sch = -1, mistake = 0; String slovo = "";  int osh = 0; boolean bo = true;

    void vvod() throws IOException // INPUT THE DICTIONARY
    {
        BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        while (true)
        {
            slovo = r.readLine();
            if ("#".equals(slovo)) break;
            sch++;
            a[sch] = slovo;
        }
        prov();
    }

    void prov() throws IOException  //INPUT THE TEXT (FILE OR TIMUS CONSOLE)
    {

        boolean oj = System.getProperty("ONLINE_JUDGE") != null;
        Reader reader = oj ? new InputStreamReader(System.in) : new FileReader("C:\\test.txt");
        StreamTokenizer st = new StreamTokenizer(new BufferedReader(reader));
        st.eolIsSignificant(true);
        st.wordChars(32,47);
        st.wordChars(58,64);

        while (st.nextToken() != StreamTokenizer.TT_EOF)
        {
            if (st.ttype == StreamTokenizer.TT_WORD)
               s+=st.sval;

            if (st.ttype == StreamTokenizer.TT_EOL)
            {
                analysis();
                s = "";
            }
        }
        if (s!="") analysis();
        System.out.print(osh); // END OF INPUT, WRITE NUMBER OF MISTAKES
    }

    void analysis() throws IOException // CHECK
    {
        StringReader sr = new StringReader(s);
        for (int i = 0; i < s.length(); i++)
        {
                c = (char) sr.read();
                if (c <= 'z' && c >= 'a' || c <= 'Z' && c >= 'A') s1 += c;
                else mist();

        }
        if (s1!="") mist();
        System.out.println();
        sr.close();
    }

    void mist() throws IOException  // SEARCHING OF MISTAKE
    {
        for (int j = 0; j<=sch; j++)
        {
            if (a[j].length()==s1.length())
            {
                for (int k = 0; k<s1.length(); k++)
                {
                    if (a[j].charAt(k)!=s1.charAt(k)) mistake++;
                    if (mistake>1) { mistake = 0; break; }
                }
                if (mistake == 1)
                {
                   System.out.print(a[j]);
                   if (!(c <= 'z' && c >= 'a' || c <= 'Z' && c >= 'A')) System.out.print(c);
                   osh++; bo = false; mistake = 0; break;
                }
            }
        }
        if (bo) System.out.print(s1); if ( (!(c <= 'z' && c >= 'a' || c <= 'Z' && c >= 'A')) && bo) System.out.print(c);
        s1=""; bo = true; mistake = 0;
    }
}

Edited by author 08.07.2014 00:57

It's very easy to get but how to prove it?

Edited by author 08.08.2012 02:32

x first or y first matters!!!

Edited by author 06.07.2014 16:48

how can I use #include <iostream > if it doesn't work?

-

Edited by author 05.07.2014 22:48

if you stuck on WA#17, try enlarging your array size ^_<

5 6 4
1 1 1 V
6 1 1 H
1 5 2 H
5 5 2 H
1

ans: 10

test 4
5
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0

test 5
5
0 2 2 2 2
2 0 4 8 4
2 4 0 4 8
2 8 4 0 4
2 4 8 4 0

What is in test #35????? ;)

Edited by author 18.10.2011 01:30

Please somebody help me, and give some tests, please!

Is it possible to solve this problem using SQRT-decomposition ?
0.5 second is a very tight limit and in-spite of minor optimizations and fast I/O my code having complexity of O (N * sqrt (N)) is getting TLE on test case 17.  I am just curious about the possibility.

When I run this code I get the right answer, why do I fail test #2


import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class EJ1880 {

    /**
     * @param args
     * @throws FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
        // TODO Auto-generated method stub
        File Arc = new File("C:\\Documents and Settings\\Admin\\workspace\\ACM\\src\\timus\\datos.txt");
        Scanner in = new Scanner(Arc);
        //Scanner in = new Scanner(System.in);
        ArrayList<Integer> L1 = new ArrayList<Integer>();
        ArrayList<Integer> B1 = new ArrayList<Integer>();

        //Cargar elementos
        int a = in.nextInt();
        for (int aux = 0; aux < a; aux++)
            L1.add(in.nextInt());

        int b = in.nextInt();
        for (int aux = 0; aux < b; aux++)
            L1.add(in.nextInt());

        int c = in.nextInt();
        for (int aux = 0; aux < c; aux++)
            L1.add(in.nextInt());

        //Ordenar elementos
        Collections.sort(L1);

        //Buscar cantidad de elementos repetidos
        for (int i = 0; i < L1.size(); i++) {
            if ((Collections.frequency(L1, L1.get(i)) > 1)) {
                B1.add(i);
            }
        }

        System.out.println(L1.size() - B1.size());

    }

}

1. If you read some discussion, you may have found out, that there is `simple` algo solution, which just does A^M, and sums all final states counts (here A - is transition matrix of automaton built by `bad words`)

Yes, it is cool, algorithmic, etc.
But personally I've completely forgotten the 1st year of university, and after reading that I felt little shame, which results in not willing to implement that.

2. DP
This is one of hardest DP I've ever thought about.
It took me for almost 3 weeks of `background-thinking`.
Although, when you came to the function, which is `DP-able` - code looks small, etc.
But still, the function is hard to come to.
Personally, i felt pure happiness after got my DP ACed.
Actually I'm writing this post affected by this happiness :) Like in school :)
Wish u the same when u solve it!

I'd rate it as `one of the hardest problem` in this volume, if there was only DP solution and no automaton analogy.

If someone can invent similar problem, but without automaton solution - would be very cool!

I don't know why I got wa on 17,is there any tests??Please help me, it drives me crazy for 4 hours/

My program gives correct answers for all the tests, but has WA#3. Swap(x,y) doesn't help :(
Give me, please, some unusual tests

lock1 = input()
lock2 = input()

if lock1 % 2 == 0 or lock2 % 1 == 1: print "yes"
else: print "no"



I got WA in testcase 3. Why could that be?

Edited by author 21.06.2014 17:45

hi,
if we want to use cin in C++
how we can use it like below for scanf

while( scanf( "%lf", &m ) != EOF )

can we edit while( cin >> m != EOF )???