#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;
}

I was little discouraged when my O(n^4) solution got AC.What remains the purpose of Dp ,if I could do it by complete search.

Please mail me the O(n^3),O(n^2),O(n) solution for this task,any or all complexity written here.
My mail id is royalbird.raman@gmail.com
thanks for your support

I wrote my code 3 times and the checker keeps on telling me that my solution crashes on some kind of stack overflow...Please help in fixing this issue, thanks.

UPD: The problem is solved, so the question is canceled.

Edited by author 26.12.2012 10:56

Hehe,,, normally i don't write Java code, but I am lazy this time :)

Hello, ladies and gentlemens. Can somebody help me? My program compiles on my computer (Delphi 6), but when i send it to judge, i get message 'Crash (floating-point invalid operation)'. How i can solve this problem? what is wrong?

So Sad!!

What to do with this problem???

3
0 0
0 4
4 0
3 1

what's in this test

что в этом тесте может быть такого?
перепроверил все уже... все примеры с форума, свои придумал, но все-равно ВА17
кто знает тест?

Edited by author 01.08.2009 17:05

решил. спасибо всем )

Edited by author 01.08.2009 17:20

Could someone provide me with a test case? Each test from the discussion list passes ok. But still WA2.

Edited by author 20.12.2012 00:01

Program NoName;
var n,r,i:integer;
x: array [1..100] of real;
y: array [1..100] of real;
s,sg:real;
input,output:text;

begin
s:=0;
   assign(input, 'input.txt');
   reset(input);
   assign(output, 'output.txt');
   rewrite(output);


readln(n,r);
 if n=1 then writeln(1.00)else begin
   For i:=1 to n do
  readln(x[i],y[i]);
sg:=2*pi*r;
For i:=1 to n-1 do  s:=s+sqrt(sqr(x[i]-x[i+1])+sqr(y[i]-y[i+1]));
s:=s+sqrt(sqr(x[n]-x[1])+sqr(y[n]-y[1]));
s:=s+sg;
end;
writeln(s:1:2);
   close(input);
   close(output);
end.

Edited by author 19.12.2012 04:05
wrong test 4? 1837, why?
Edited by author 19.12.2012 04:06

Edited by author 19.12.2012 04:06

Edited by author 19.12.2012 04:06

Edited by author 19.12.2012 04:07

Edited by author 19.12.2012 04:10

I can't realize what my problem is! #1 must be the simplest test case ( or the sample given ) but I can't see anything in my code that seems to be wrong...
can YOU help me?

I got AC as I changed all ints to longs. I thought ints would be sufficient to do the sum. Still can't figure out why longs are needed.

could you explain me test and answer? i can't understand how this situation may happen