Who has WA this test. What's wrong? Could you give me some tests.

why WA?

Edited by author 08.04.2010 14:57

Could you verify test #1 and my output for this test? I stressed my solution with earlier one (AC solution) and have not found any bad test or mistake. Also i tested my solution on sample test from statement. May be it connected with difference of compiler i use and your compiler.

Give my please 6 test

Edited by author 20.03.2010 15:04

input 5
output 20

input 6
output 28

input 7
output 44

input 100
output 4503599627370492

input 1000
output 13093562431584567480052758787310396608866568184172259157933165472384535185618698219533080369303616628603546736510240284036869026183541572213314110357500

input 2000
output 42860344287450692837937001962400072422456192468221344297750015534814042044997444899727935152627834325103786916702125873007485811427692561743938310298794299215738271099296923941684298420249484567511816728612185899934327765069595070236662175784308251658284785910746168670641719326610497547348822672277500

Is a case with [ in template, without ] after it, valid?
For example, will there be any case like this:
'something' like '[a'
(without closed bracket)?

HELLO! Answer once in your life!!!! SOMEONE is *surely* reading the discussions of this task and has read this text! AND SOMEONE (at least admin) KNOWS THE ANSWER!!!!
So REPLYYYYYYYYYY!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

Edited by author 07.04.2010 19:09

I apply rounding (as floor(x*100+0.5)/100)
only to RESULT of T(R) and to regional coefficient. But I can't pass test 7. Can anybody help me?

i got WA because of it for 3 times!
You guys pay attention to it!

The answer will contain 23857 digits in this case! What to do? Long arithmetic will not help because of TL

In my code I have this:

struct cmpf {
  bool operator ( )( const int &i, const int &j ){
    if ( dist[i] != dist[j] ) return dist[i] < dist[j];
    return i < j;
  }
};

...

S.erase(i);

Why am I receiving this boring compile error down here, it doesn't make sense!

e6a69c8b-fd41-4c39-9a60-1c924ab01be4
S:\checker\compile\\Vc7\include\xtree(988): error: no instance of function "cmpf::operator()" matches the argument list and object (the object has cv-qualifiers that prevent a match)
            argument types are: (const int, const std::_Tree<std::_Tset_traits<int, cmpf, std::allocator<int>, false>>::key_type)
            object type is: const cmpf
              if (this->comp(_Key(_Pnode), _Keyval))

                  ^
          detected during:
            instantiation of "std::_Tree<_Traits>::_Nodeptr std::_Tree<_Traits>::_Lbound(const std::_Tree<_Traits>::key_type &) const [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 801
            instantiation of "std::_Tree<_Traits>::iterator std::_Tree<_Traits>::lower_bound(const std::_Tree<_Traits>::key_type &) [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 821
            instantiation of "std::_Tree<_Traits>::_Pairii std::_Tree<_Traits>::equal_range(const std::_Tree<_Traits>::key_type &) [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 757
            instantiation of "std::_Tree<_Traits>::size_type std::_Tree<_Traits>::erase(const std::_Tree<_Traits>::key_type &) [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 71 of "e6a69c8b-fd41-4c39-9a60-1c924ab01be4"

S:\checker\compile\\Vc7\include\xtree(1089): error: no instance of function "cmpf::operator()" matches the argument list and object (the object has cv-qualifiers that prevent a match)
            argument types are: (const std::_Tree<std::_Tset_traits<int, cmpf, std::allocator<int>, false>>::key_type, const int)
            object type is: const cmpf
              if (this->comp(_Keyval, _Key(_Pnode)))

                  ^
          detected during:
            instantiation of "std::_Tree<_Traits>::_Nodeptr std::_Tree<_Traits>::_Ubound(const std::_Tree<_Traits>::key_type &) const [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 811
            instantiation of "std::_Tree<_Traits>::iterator std::_Tree<_Traits>::upper_bound(const std::_Tree<_Traits>::key_type &) [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 821
            instantiation of "std::_Tree<_Traits>::_Pairii std::_Tree<_Traits>::equal_range(const std::_Tree<_Traits>::key_type &) [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 757
            instantiation of "std::_Tree<_Traits>::size_type std::_Tree<_Traits>::erase(const std::_Tree<_Traits>::key_type &) [with _Traits=std::_Tset_traits<int, cmpf, std::allocator<int>, false>]" at line 71 of "e6a69c8b-fd41-4c39-9a60-1c924ab01be4"

compilation aborted for e6a69c8b-fd41-4c39-9a60-1c924ab01be4 (code 2)

why I get crash(access violation) at test 6?
who have the test?
S.O.S!!

My program gives right answer all tests in the forum but T've got WA#2.Please give me some test
Thanks

For example :
N = 7 and M = 3
you see : 7!/(3!*4!) = (2*3*4*5*6*7)/(2*3*2*3*4) = (5*6*7)/(2*3) = 35
=> you need not to calculate the multiple but divide all numbers into prime
I assign : the left = (5*6*7), the right = (2*3)
after division the left :
5 = 5
6 = 2*3
7 = 7
you will count all prime, the result is following :
there are 1 primes with value of 2
there are 1 primes with value of 3
there are 1 primes with value of 5
there are 1 primes with value of 7
I put into the bracket (1,1,1,1)
after divison the right :
2 = 2
3 = 3
there are 1 primes with value of 2
there are 1 primes with value of 3
there are 0 primes with value of 5
there are 0 primes with value of 7
I put into the bracket (1,1,0,0)
the left - the right = (1,1,1,1) - (1,1,0,0) = (0,0,1,1)
and the result 0+0+1+1 = 2
2 is the result
GOOD LUCK !

This site is very good,,, just one suggestion

It may be good to have some statistics on the languages, for example, i would like to see how many C++ programs i submitted and how many Pascal etc... this can be added to the public author page..



.

Edited by author 05.04.2010 08:00

var i,ans,n:longint; a,b:array[1..1000] of longint;
begin
  readln(n);
  for i:=1 to n do readln(a[i],b[i]);
  for i:=1 to n do
  begin
      if a[i]=1 then
      begin
         if b[i]=1 then writeln(1) else writeln(0);
      end
      else
               begin
      ans:=0;
      while b[i] mod  a[i] =0 do
      begin
        b[i]:=b[i] div a[i];
        inc(ans);
      end;
      writeln(ans);
                end;

  end;
  readln;
end.

Although i get AC, but i want to know how the formula is derived..

2 PI * R + perimeter of polygon

The extra length is formed just a circle (radius = R).
i can image with just a few nails. but could you tell me the proof of this...

thanks..

I get WA5? Whats that test about?