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 ...

Got WA2. please respond.

See this test:

6
2 2 2 3 3 3

Bad answer: 5
Good answer: 3

Maybe new problem with increase S,K)

5 500
250 250 250 250 250
-------------------
22288580