I have AC, but it seems to me that my algo isn't the best.
I used DP. Is there any formula?

If I run

public class Stacks {
    public static void main(String... args) {
        System.gc();
    }
}

It reports I exceed the memory limit with a usage of 4885 KB.

public class Stacks {
    public static void main(String... args) {
        System.gc();
    }
}

Reports 326 KB used.

How is the memory usage determined.  I assume you cannot have your managed memory trigger a GC which is a bit restrictive for Java.

Could you give me case for 14.Thank you.

Hi!
How can I get the data for the tests?
For example -
1) coding task number N!
2) send for checking!
3) Wrong answer! Test number 2!
4) How to get input data for test 2?

Thanks for the help!

i have a problem in test 6, can't find ,whats the matter?!?!
help plz!!

I've seen lots of guys crashed on test 2. Could anyone provide a hint for this test?

I don't now why!! AAAAAAAA!!!!

var s: char;
i, sim: integer;
begin
sim:=0;
while not EOF do
begin
//for i:=1 to s do
begin
read (s);
if ((s='a') or (s='d') or (s='g')or(s='g') or (s='m')or (s='p') or (s='t') or (s='w')) then sim:= sim+1
else if ((s='b') or (s='e') or (s='h') or (s='k') or(s='n') or (s='q') or (s='u') or (s='x')) then sim:= sim+2
else if ((s='c') or (s='f') or (s='i') or (s='o') or (s='r') or (s='v') or (s='y')) then sim:= sim+3
else if ((s='s') or (s='z')) then sim:=sim+4
else if (s=' ') then sim:=sim+1
else if (s='.') then sim:= sim+1
else if (s=',') then sim:= sim+2
else if (s='!') then sim:= sim+3
end
end;
write (sim);
end.

Edited by author 31.12.2012 01:58

Can anybody tell what the problem ?

Edited by author 30.12.2012 19:51

From :
We know that there are more than P% conductors and less than Q% conductors.

To clarify, you should write :
By percentage, we know that there are more than P% conductors and less than Q% conductors of all Russian citizens in this city.

Until I've read several comments in discussion, I found out what the problem wants.
Sincerely.

Can you explain me the first example.. why 17??

#include <iostream>
using namespace std;

void 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 <= 449) )    cout << "swarm";
    if( (n >= 500) && (n <= 999) )    cout << "zounds";
    if( (n >= 1000) )    cout << "legion";

}

input:
3
1
1
2

answer:
4
1 1
1 2
2 3 1
2 3 2

answer:
5
1 1
1 2
2 3 1
2 3 2
3 1 2 3

answer:
3
1 1
1 2
3 1 2 3

answer:
1
3 1 2 3

#include<stdio.h>
double i,j,p,q,per;
int main()
{
      scanf("%lf %lf",&p,&q);

      for (i=1;;i++)
          for (j=0;j<=i;j++)
          {
              per=100*j/i;
              if (p<per && per<q)
              {
                 printf("%d",(int) i);
                 scanf(" ");
                 return 0;
              }
          }
}

The main loop is just O(n), not O(n^2)
you need to sort the heroes first according to their wishes.

the main loop is

for (int i = 1; i <= ulen; i ++)
{
    if (w[0].wish <= i)
    {
        used[0] = true;
        search(0, i, 1);
        used[0] = false;
    }
}


Edited by author 29.12.2012 01:28

Edited by author 29.12.2012 01:31

if 'a' and 'b' are both longint,abs(a-b) can be __int64.

# include <iostream>
#include <cmath>
#include <vector>

using namespace std;
int main()
{
    vector < int > asd;
    int a,b,c,d,e=0;

    cin>>a>>b>>c;

    for(double i=1;i<=999;i++)
    {
        if(i<=b)
        {
            d=pow(i,a);
            if(d%b==c)
                asd.push_back(i);

            else
                e++;
            }
        }
            if(e==b)
                cout<<"-1";
            else
            {
                cout<<asd[0];
                for(int i=1;i<asd.size();i++)
                    cout<<' '<<asd[i];
            }

    getchar();
    getchar();

    return 0;
}