N=12 Q=26 not 34.

My solutions is stack overflow in test 9. Help me, please.

Could anyone give me the test#6?
godsuriyel@gmail.com
thanks!

I want some tips or tests

var
i,s3,s4,s,s1,s2,n,a,b:Longint;
begin
read(n,a,b);
 s:=1;
s1:=1;
 s2:=1;
 s3:=1;
 s4:=1;
for i:=1 to n+a do
 s:=s*i;
for i:=1 to n+b do
s1:=s1*i;
for i:=1 to n do
 s2:=s2*i;
for i:=1 to a do
s3:=s3*i;
for i:=1 to b do
s4:=s4*i;
write((s*s1)/(s2*s3*s4*s2));
end.

My solution is that
1. I calulate how many passengers go off when the train arrive the station i , called Di[i] (assume we are doing on the first turn that is from Vladivostok to Moscow). And I also have similar manipulation on doing the second turn that is from Moscow to Vladivostok), called Ve[i]
2. Then, I do for (i = 2; i <= n; i++) to browse all stations that the train will come. At station i, I subtract the number of passengers who go off the train at the station (i - 1) and plus the number of passengers who will come to the station i. And, I find the MAX from them at every station i, called luotDi. I do the same with the second turn from Moscow to Vladi..., called luotVe
4. I find maxPassengers = max(luotDi, luotVe)
5. I print the result (how many cars) = maxPassengers / 36 + 1 * (maxPassengers % 36 == 0 ? 0 : 1)

I can't find what I was wrong. Please help me! Here my source code

#include <iostream>
using namespace std;

int main()
{
    int n;
    int tam;
    int a[106][106];
    int Di[106];
    int Ve[106];


    int luotDi = 0;
    int luotVe = 0;
    cin >> n;
    for (int i = 0; i <= n + 5; i++)
    {
        Di[i] = Ve[i] = 0;
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cin >> a[i][j];
            if (i < j)
            {
                Di[j] += a[i][j];
            }
            else
            {
                if (i > j)
                    Ve[j] += a[i][j];
            }
        }
    }

    // the first turn (Vla... -> Moscow)
    int soKhach = 0;
    // station j th
    for (int j = 2; j <= n; j++)
    {
        // drop passengers
        soKhach -= Di[j - 1];

        // pick up passengers
        for (int i = 1; i < j; i++)
        {

            soKhach += a[i][j];
        }

        // find MAX
        if (soKhach > luotDi)
        {
            luotDi = soKhach;
        }
    }

    // the second turn (Moscow -> Vla...)
    soKhach = 0;
    // station j th
    for (int j = n - 1; j >= 1; j--)
    {
        // drop passenger
        soKhach -= Ve[j + 1];
        // pick up passenger
        for (int i = n; i > j; i--)
        {
            soKhach += a[i][j];
        }
        // find MAX
        if (soKhach > luotVe)
        {
            luotVe = soKhach;
        }
    }

    int result;
    float lDi = (float) luotDi;
    float lVe = (float) luotVe;
    if (luotDi > luotVe)
    {
        lDi = lDi / 36;
        result = (int) lDi;
        if (result < lDi)
        {
            result++;
        }
    }
    else
    {
        lVe = lVe / 36;
        result = (int) lVe;
        if (result < lVe)
        {
            result++;
        }
    }

    cout << result;
    return 0;
}

Thanks very much!

Edited by author 15.10.2011 17:52

how Andrey will increase the capital?
2: (20-1)*1 =19
3:  (19-1)*1=18
****
How can more, than 20?
thank

unable to understand do we have to read input from file or user i mean how many numbers are taken as input.
as in sample four numbers are given plz help

Edited by author 23.11.2012 09:56

Edited by author 23.11.2012 09:56

I use Aho Corasick algorithm but get "Wrong answer 3". Why? Please give me test 3.

Edited by author 23.11.2012 13:28

var i,n,L,R:longint;
    ch:char;
begin
 readln(n);
 L:=0;
 R:=0;
 for i:=1 to n do
 begin
  read(ch);
  while not(ch in ['<','>']) do
   read(ch);
  case ch of
   '>':inc(R);
   '<':inc(L,R);
  end;
 end;
 writeln(L);
end.

why do i get Time limit exceeded :(

#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;

int main ()
{
    char * pch;
    char str[30005],str1[30005];
    int number,i=0,j=0;
    scanf("%d",&number);
    while(i<number)
    {
    scanf("%s",str);
    i+=strlen(str);
    strcat(str1,str);
    }
    while(strstr(str1,"><"))
    {
        pch=strstr(str1,"><");
        strncpy(pch,"<>",2);
        j++;
    }

        printf("%d",j);
  return 0;
}

Эпиграф: следует писать "филиппинцы".
Последнее предложение первого абзаца:
"иначе пушку уже нельзя будет навести на цель, и команда попадет в плен" - запятая не нужна.

WA4, i still don't know why :)
please give me some cool inputs and (optionally) your answers to them.

To whom it may concern!

There were sovlved two different programms. The first one, when there is given an input 120 the output is 358; the second output is 456. But both of them were accepted. Could you explain to me why this that, if you please?

on test # 1......................
if i get it again, i'm gonna break something....
it runs perfectly on my compiler


#include <stdio.h>
#include <iostream>
#include <vector>
#define PB push_back

using namespace std;

int lev[110];

int main()
{
  int i,j,k,l,n,s,e,v;
  int q[10100];
  vector<int> a[110];
  scanf("%d",&n);
//  cin>>n;
  for (i=1; i<=n; i++)
   {
     while (1)
     {
      scanf("%d",&j);
//  cin>>j;
      if (j!=0) a[i].PB(j); else break;
     }
   }


  for (i=1; i<=n; i++)
  if (!lev[i])
{
  q[0]=i; e=0;
  for (s=0; s<=e; s++)
   {
      for (j=0; j<a[q[s]].size(); j++)
       {
        v=a[q[s]][j];
        lev[v]=lev[q[s]]+1;
        q[e++]=v;
       }
   }
}

  vector<int> ans;
  for (i=1; i<=n; i++)
   if (lev[i]%2) ans.PB(i);

  printf("%d\n",ans.size());
  for (i=0;i<ans.size()-1; i++)
   printf("%d ",ans[i]);
  printf("%d\n",ans[ans.size()-1]);

  return 0;
}

It was really wrong :)

Edited by author 22.11.2012 11:33