Gimme some tests, please :) All tests that I found my program passed right, I can't understand my mistake.
Now I have WA4 :)


Edited by author 08.07.2012 10:07

When the number of compartments is 0 you should output 0 (not -1),maybe you guessed why i said "not -1",because when you output (Number_of_Compartments-1) the answer will be -1 because Number_of_Compartments=0 ,maybe it will help you.
Good Luck!

#include <iostream>
#include <stdio.h>
#include <vector>
#include <cctype>
#include <stdlib.h>
#include <numeric>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iterator>
#include <set>

using namespace std;

#define FOR(i, a, b) for (int i = (a) ; i < (b); i++)
#define sz size()
#define pb push_back
#define clean(t) memset ((t) , -1, sizeof(t))
#define VI vector <int>
#define VS vector <string>
#define cinput(n) scanf("%d", &n)


int main()
{
    int n;
    double a;
    VI ans;
    while(cin >> n)
    {
        if (n == 1) {ans.pb(1); continue; }
        if (n == 0) goto end;
        a = log(n)/log(2);
        if ( a == (int ) a) ans.pb(a);
        else ans.pb((int) a+1);

    }

    end:;

    int q;
    FOR(q, 0, ans.sz)
    {
        cout << ans[q] << endl;
    }

    return 0;
}


What's Wrong?? Plz some1 tell me..

I am able to find the minimum cost but not being able to print the room numbers.

Please, check this test(or checker) - my program passes all tests correctly(all 365 tests for non-leaps years and 366 for leap years), but WA 10, or say, if my solution gives a wrong answer at all :)

What's the numeber means after the wrong answer. Is the correct number or wrong?

what is test 8. i get wrong answew :(

I use bit operations for this problem =) and simple DP =)
It has AC with ~4Mb memory and ~0.7 sec time...

Could anyone give me some test cases?
Thanks.

Edited by author 07.03.2013 11:16

Edited by author 07.03.2013 11:16

Edited by author 07.03.2013 11:17

Edited by author 07.03.2013 11:17

I'm only start to learn Haskell.
I'm confused with std function and IO.

My solution (does not work):
main = do
   a <- getLine
   let b = sum map read words a // <- I try to use this functions
   putStrLn (show b)

let b = words a // work, but
let b = sum map (read::Int) words a //does not work

Where I wrong?

#include <stdio.h>
#include <stdlib.h>

int cmp(const void *a, const void *b)
{
    unsigned long long *pa = (unsigned long long *)a,
    *pb = (unsigned long long *)b;
    return *(unsigned long long *)pa - *(unsigned long long *)pb;
}


int main()
{
    unsigned long long arr[15000], min=1000000000000000000;
    int N=3, count=0, i;

    for(i = 0; i<N; i++)
        scanf("%llu", &arr[i]);
    while(min)
    {
        qsort (arr, N, sizeof(unsigned long long), cmp);
        for (i = 0; i<N-1; i++)
            if(arr[i+1] - arr[i]<min) min=arr[i+1] - arr[i];
        arr[N++] = min;
        count++;
    }
    printf("%d", count);

    return 0;
}
Can anybody help me?

In JAVA version of the tests, in test 3, N<3, be careful when declaring array sizes.
In C# version of the tests there is no such test.

This code results in a runtime error at test #26:
from sys import stdout
d = int(float(raw_input().strip()))
n = [1,5,10,20,50,100,250,500,1000,2000]
l = ['few','few','several','pack','lots','horde','throng','swarm','zounds','legion','legion']
a = min(map(lambda x: x+d,filter(lambda x: x > 0, map(lambda x:x - d,n))))
stdout.write(l[n.index(a)])

This code was accepted without error:
from sys import stdout
d = int(raw_input())
if d > 0 and d < 5:
    stdout.write('few')
elif d < 10:
    stdout.write('several')
elif d < 20:
    stdout.write('pack')
elif d < 50:
    stdout.write('lots')
elif d < 100:
    stdout.write('horde')
elif d < 250:
    stdout.write('throng')
elif d < 500:
    stdout.write('swarm')
elif d < 1000:
    stdout.write('zounds')
else:
    stdout.write('legion')

Can anyone explain why the first code fails but the second doesn't?

Initially, in one trie node i stored:

Node child, sibling, sufLink;
byte parSymb; short lEnd;

This is 4 * 3 + 1 + 2 = 15 bytes per node, ML 28.

Then I used static array of nodes(maximum number of nodes is 99991), memory consumption per node is the same(instead of Node reference we store int), ML 28.

At the end, I stored child, sibling, sufLink and parSymb(we need 17 bits for each memory pointer and 8 bits for parent symbol, 17 * 3 + 8 = 59 bits in total) in one long, and lEnd in short, only 10 bytes per node, and got AC!

#include<stdio.h>
int main()
{
    long long i,n;
    while(scanf("%lld",&n)==1)
    {
        long long s=0;
        if(n==1) printf("%lld",n);
        if(n>1&&n<=10000)
        {
            for(i=1;i<=n;i++)
            {
                s=s+i;
            }
        }
        if(n<1&&n>=-10000)
        {
            for(i=1;i>=n;i--)
            {
                s=s+i;
            }
        }
        printf("%lld\n",s);
    }
    return 0;
}

Help me!!!I got WA#2
Please give me some tests...
I use merge sort.

Здравствуйте, прошу прощения за русский язык (проблемы с английским)...
Число 1 не строго больше одного, а значит, ошибка в условии задачи, т.к. при Вашем условии при вводе 4 1 6 на принтер выведется 2 2 1 1 и вывод программы будет 2... Исправьте, пожалуйста, условие для того чтобы не возникали недоразумения. СПАСИБО!

Hi! Please help russian shoolboy
Where the error is?
I realized that '1'-s are in the field of the sequence.
1 2 4 7 11 16
int main()
{
    long a,j,i,n;
    cin>>n;
    for(int x=0; x<n; x++)
    {
        cin>>a;
        i=1;
        j=1;
        while (a>i)
        {
           i=i+j;
           j++;
        }
        if (a==i)
            cout<<1;
        else
            cout<<0;
     }
    return 0;
}

Sorry, I have it, I just forgive write it at the sample for you. Program code has generate  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 isn't right?

Hi! Sorry, how i can have WA 1# if my program generate 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 at first test?