Could you give me some tests to train my code? I WA in test 6 many times and I don't know why anymore.. I need some people to help me.
Here is my code:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
int sg[55][110][110];
int a[110][110];
int n;
bool v[110], l[110];
int mex ( int l, int r, int x ){
    if ( sg[x][l][r] != -1 ) return sg[x][l][r];
    if ( l > r ) return 0;
    int i, j, k;
    int p, ss;
    memset ( v, false, sizeof (v) );
    for ( i = l; i <= r; i ++ ){
        p = a[x][i]; ss = 0;
        k = l;
        for ( j = l; j <= r; j ++ ){
            if ( a[x][j] <= p ){
                ss ^= mex ( k, j-1, x );
                k = j+1;
            }
        }
        ss ^= mex ( k, r, x );
        v[ss] = true;
    }
    for ( i = 0; ; i ++ ){
        if ( v[i] == false ){
            sg[x][l][r] = i;
            return i;
        }
    }
}
int get_sg ( int x ){
    int i, j, k;
    for ( i = 1; i <= a[x][0]; i ++ ) sg[x][i][i] = 1;
    return mex ( 1, a[x][0], x );
}
void get_way ( int ans ){
    int i, j, k, x, y, o;
    int p, s;
    for ( i = 1; i <= n; i ++ ){
        for ( j = 1; j <= a[i][0]; j ++ ){
            p = a[i][j]; s = 0;
            o = 1;
            for ( k = 1; k <= a[i][0]; k ++ ){
                if ( a[i][k] <= p ){
                    s ^= mex ( o, k-1, i );
                    o = k+1;
                }
            }
            s ^= mex ( o, a[i][0], i );
            if ( (ans^sg[i][1][a[i][0]]^s) == 0 ){
                printf ( "%d %d\n", i, j );
                return;
            }
        }
    }
}
int main (){
    int i, j, k;
    scanf ( "%d", &n );
    k = 0;
    memset ( sg, -1, sizeof (sg) );
    for ( i = 1; i <= n; i ++ ){
        scanf ( "%d", &a[i][0] );
        for ( j = 1; j <= a[i][0]; j ++ ) scanf ( "%d", &a[i][j] );
        get_sg (i);
        k ^= sg[i][1][a[i][0]];
    }
    if ( k == 0 ) printf ( "S\n" );
    else{
        printf ( "G\n" );
        get_way (k);
    }
    return 0;
}

#include <iostream>
using namespace std;
bool Chekcker(int A[],int k)
{
    int i,j,v;
    bool circle=true;
    for(j=1;j<=k;j++)
        for(v=1;v<=k;v++)
        {
            if(A[v]==0 && A[j]==v )
                A[j]=0;
        }

    for(j=1;j<=k;j++)
        for(v=1;v<=k;v++)
        {
            if(A[j]==0 && A[v]==j )
                A[v]=0;
        }
    for(v=1;v<=k;v++)
        if(A[v]==0)
        { circle=true;}
        else{circle=false;break;}

    return circle;
}

int main() {
    int n;
    cin>>n;
    int i,j,k = 0,v;
    int temK;
    bool circle;
    int conf;
    int A[30000];
    for(i=1;i<=n;i++)
    {
        cin>>k;
        j=1;
        v=1;
        temK=k;
        circle=true;
        conf=0;

        for(j=1;j<=k;j++)
        {
            cin>>A[j];

        }

        for(j=1;j<=k;j++)
        {
            if(A[j]==0)
            conf++;
        }



        circle=Chekcker(A,k);

        if(conf==0 || conf>1)
        {circle=false;}

        if(circle==true)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;

        for(v=1;v<=k;v++)
            A[v]=0;

        }



       return 0;
}


this code get correct on every test in the forum, however fails test #3. Whats Wrong????

PLS GUYS HELP ME WITH WA#26
MY AZZ IS VERYYY HOOOOT because of this test

Edited by author 02.04.2015 23:22

Why first test isn't like in sample?

I checked there are only 1 test, and it is "18". Where another 17 tests have gone?

N=input()
ans=2
print ans
for i in range(0,N):
    ans=(ans-1)*ans+1
    print ans

It returns correct answer on my PC,but gets WA when submitted.

# include <iostream>
# include <fstream>
# include <cmath>
# include <vector>
# include <algorithm>
# include <math.h>
# include <time.h>
# include <string>
# include <string.h>
# include <map>
# include <queue>
# include <stack>

using namespace std;
const int MAXN = 1000000007;//, Maxn = 1000000009;

long long n, a, san, num, dereje = 1, x;

bool zero, one;

string s, h;

int main()
{
    cin >> n >> s >> h;

    a = n-1;

    for (int i=0; i<n; i++) {
        san = (san + (dereje * (s[i]-'a'+1))) % MAXN;
        num = (num + (dereje * (h[i]-'a'+1))) % MAXN;
        dereje = (dereje * 27) % MAXN;
    }

    if (san == num)    {cout << 0 << '\n'; return 0;}

    for (int i=0; i<n; i++) {
        san = (san * 27) % MAXN,
        san = (san - (((s[a]-'a'+1) * dereje) % MAXN)),
        san = (san + MAXN) % MAXN,
        san = (san + (s[a]-'a'+1)) % MAXN;

        if (san == num)    {cout << i+1 << '\n'; return 0;}
        a--;
    }

    cout << -1 << '\n';

    return 0;
}


WA 8.why?
i used HASH!


plz help me!

#include <iostream>
using namespace std;


int main()
{
    int aNumber, bNumber;
    cin>>aNumber;
    cin>>bNumber;


    if(bNumber > aNumber)
    {

        cout<< ((bNumber-(aNumber + (aNumber%2? 0:1) ))/2) + 1;
    }
    else if(bNumber == aNumber)
    {
        cout<<"1";
    }

}

what might be test case #4 ?

tell me how to use the compiler, if changed (macbook)OSX. Can I xCode?

What is "Idleness limit exceeded"?

Disabling syncing with C's stdio by using std::ios::sync_with_stdio(false) makes the C++ streams very fast (even faster than C's scanf/printf in many cases) allowing more elegant C++ solutions that don't suffer TLE. (like problem 1100). This should be in the FAQ.

http://stackoverflow.com/questions/1042110/using-scanf-in-c-programs-is-faster-than-using-cin

What is in test #7 ??

            Thread.CurrentThread.CurrentCulture = CultureInfo.InvariantCulture;

            var n = int.Parse(Console.ReadLine().Trim());

            int a = 0;
            var p = (int)Math.Truncate(Math.Sqrt(n + n));
            while (p > 1)
            {
                var s = n - p * (p + 1) / 2;
                if (s >= 0)
                {
                    int rem;
                    a = Math.DivRem(s, p, out rem);
                    if (rem == 0)
                        break;
                }
                p--;
            }
            a++;

            Console.WriteLine("{0} {1}", a, p);

what's the differance between sort and stable_sort in C++?

Edited by author 21.07.2013 20:38

Edited by author 21.07.2013 20:39

Не знаю английского, извините админы :( Помогите пожалуйста, всё время выскакивает эта ошибка на 8 или на 9 тесте. Пишу на C# помогите оптимизировать код.


using System;

namespace EkzamenIstorii
{
    class Program
    {
        static void Main()
        {
            Work work = new Work();
            work.Start();
        }
    }

    class Work
    {
        int[][] TichersDate;
        int[] UchenikDate;
        int Sovpadenia, buf=0;

        public void Start()
        {
            Input();
            Algoritm();
            Output();
        }

        void Input()
        {

            int CountTichersDates = int.Parse(Console.ReadLine());
            buf = CountTichersDates / 1000;
            buf += 1;
            TichersDate = new int[buf][];
            for (int i = 0; i < buf; i++)
            {
                TichersDate[i] = new int[1];
                for (int j = 0; j < CountTichersDates; j++)
                {

                    TichersDate[i][j] = int.Parse(Console.ReadLine());
                    Array.Resize(ref TichersDate[i], TichersDate[i].Length + 1);
                    if (i == 999)
                    {
                        CountTichersDates -= 1000;
                        break;
                    }
                }

                Array.Resize(ref TichersDate[i], TichersDate[i].Length-1);
            }

            int CountUchenikDate = int.Parse(Console.ReadLine());
            UchenikDate = new int[CountUchenikDate];
            for (int i = 0, j=0; i < UchenikDate.Length; i++)
                UchenikDate[i] = int.Parse(Console.ReadLine());

        }

        void Algoritm()
        {
            for (int k = 0; k < UchenikDate.Length; k++)
            {
                bool flag = false;
                for (int i = 0; i < buf; i++)
                {
                    if (UchenikDate[k] >= TichersDate[i][0] && UchenikDate[k] <= TichersDate[i][TichersDate[i].Length-1])
                        for (int j = 0; j < TichersDate[i].Length; j++)
                            if (UchenikDate[k] == TichersDate[i][j])
                            {
                                Sovpadenia++;
                                flag = true;
                                break;
                            }
                    if (flag) break;
                }
            }
        }

        void Output()
        {
            Console.WriteLine(Sovpadenia);
        }
    }
}

__author__ = 'abdujabbor'
import sys
numbers = { 0: {'o', 'q', 'z'},
            1: {'i', 'j'},
            2: {'a', 'b', 'c'},
            3: {'d', 'e', 'f'},
            4: {'g', 'h'},
            5: {'k', 'l'},
            6: {'m', 'n'},
            7: {'p', 'r', 's'},
            8: {'t', 'u', 'v'},
            9: {'w', 'x', 'y'}}


while True:
    number = input()
    if(number == '-1'):
        sys.exit(0)
    words_counter = int(input())
    words_list = []
    result = []

    for x in range(0, words_counter):
        word = input()
        words_list.append(word)

    i = 0
    t = 0
    for word in words_list:
        found = False
        finded_word = ''
        current_position = i
        for item, c in enumerate(word):
            if c in numbers[int(number[i])]:
                i += 1
                finded_word += c
            else:
                break
        if finded_word == word:
            result.append(finded_word)
        else:
            i = current_position
        t += 1
    result_words = ' '
    if len(result) > 0:
        print(result_words.join(str(item) for item in result))
    else:
        print('No solution.')

I know AC solution that answers 0 to the following test:
1
29999 30000

- I have just learned somethings new :
Toposort: http://en.wikipedia.org/wiki/Topological_sorting O(|V| + |E| )
... Sorry for my english :D

Pls tell me what does author of this problem mean..
If all delegates are in different rooms then we can't use less than 4 connections to achieve the goal in sample input. What 3 connections can we use to do it?
Do we need all M pairs to be in answer?
I still can't solve it because statement is too loose for me.

Please give me tests. Always WA #3.
I'm writing in Go and using float64 for the numbers.

O(sqrt(2 * N))
I have:
A = (2 * N - P * P + P ) / ( 2 * P )
and P = [1, 2, 3, ..., sqrt(2 * N) + 3] :D
I got AC ...