10014 - Simple calculations

[tan_Yui]

Your recursive function cannot work if n>1.
Then the function continues infinitely, so the judge said RE.

Best regards.

[Staryin]

10014 WA WHO CAN GIVE ME TESTDATA!!!

[tmdrbs6584]

Why don't you make bigger array size?

[taskin]

thanks. yes, this program falls in an infinite recursion when n > 1. in fact, it's not possible to solve this by using recursive call.

[dust_cover]

hi Revenger,

I was trying to solve the problem. But getting WA.

CAn u please tell me the output of the judges's data so I can match it with my one!

--thnx in advance

[dust_cover]

Hello,
I got ACC. I made wrong calculation!
Thanx in advance!

[rana_cse_ruet]

t

[Debashis Maitra]

try to read carefully the output format of the problem

Print a blank line between the outputs for two consecutive test cases.

I hope it will help you

And remember dont open a new thread if there is one already. you can find old posts using search and use them to post

Best of luck

[rana_cse_ruet]

Thanks, but i thought a have already printed that after each output. Is there any other way to print a blank line? Please help me about the new line if can...

[Debashis Maitra]

Your question is not clear...

If your question is how can you print a blank line between 2 test case

Answer is

Code: Select all

.......
main()
{
    ....
    ....
    char btwn_case=0;
    ...........
    while(tast_case--)
    {
       ...
       ....
       ......
      if (btwn_case)printf("\n");/*print it before printing any output*/
       else btwn_case=1;
       
      /*Now print your output of this test case*/
      ....
      .....
      .....
    }
}

This code prints new line between 2 test cases because
it prints a new line before the output (except first case)

I hope it will help you

Best of luck

[Debashis Maitra]

Rana

Now Remove your code

[rana_cse_ruet]

Thanks a lot. I got the point.

[Debashis Maitra]

Thats good
Now remove your code

[linux]

I'm got wrong answer. I need sample outputs for inputs. Please help.

[aeiou]

Hi,

I ve been trying this problem for a long time...but getting WA..
I m sure about my calculations....
I used the formula : (n+1)a1=n*a0 + (an+1) - 2(n*c1 + (n-1)*c2 + (n-2)*c3 + ... + 1*cn)

Here's my code :

Code: Select all

#include<iostream>
#include<cmath>
#include<vector>
using namespace std;

int main ()
{
 int t;
 while ( scanf ( "%d" , &t ) == 1 )
 {
  while ( t -- )
  {
   int n , m;
   double a0 , an;
   scanf ( "%d %lf %lf" , &n , &a0 , &an );
   vector <double> ci(n);
   for ( int i = 0 ; i < n ; i ++ )
    scanf ( "%lf" , &ci[i]);
   m = n;
   a0 = ( n * a0 );
   a0 += an;
   double x = 0.0;
   for ( int i = 0 ; i < n ; i ++ )
   {
    x += ( n * ci[i] );
    n --;
   }
   x *= 2;
   double ans = ( a0 - x ) / ( m + 1.0 ); 
   printf ( "%.2lf\n" , ans);
   if ( t > 0 )
    cout << endl;
  }
 }
 return 0;
}

Can anybody help me out of this ????!!!!!!!!

for ( ; ; )
{
cout << "Thankx in advance";
}