What is different with case #15.
My program runs good for 14 tests.

import java.io.*;
import java.util.Scanner;
public class string {
    public static void main(String args[]) throws IOException
    {
        Scanner sc = new Scanner(System.in);
        BufferedReader bufferedreader = new BufferedReader(new InputStreamReader(System.in));
        String each;
        int m=0,l=0,e=0;
        int num = sc.nextInt();
        for(int i=0;i<num;i++)
        {
            each = bufferedreader.readLine();
            if(each.charAt(0)=='M')
            {
                m++;
            }
            else if(each.charAt(0)=='L')
            {
                l++;
            }
            else if(each.charAt(0)=='E')
            {
                e++;
            }
        }
        if((m>=l) && (m>=e))
            System.out.println("Macaroni Penguin");
        if((l>=m) && (l>=e))
            System.out.println("Little Penguin");
        if((e>=m) && (e>=l))
            System.out.println("Emperor Penguin");

    }

Are there exactly two plates to be put on the tray or can there be more/less than two? Can someone clarify this for me? Thanks!

I'm using simple DFS from every point and got TLE on 5th test. Wich algo should I use to solve it faster?

what is in 13 test?

I don't know how to solve this problem with DP, because here is just a one cycle without any
cool thinking)
Where is a DP here?)

what is test #5? why did I have wa



var k,n,s,j,max:integer;
a:array [0..100000] of integer;
b:array [1..10] of integer;
begin
a[1]:=1;   a[0]:=0;
for k:=2 to 10000 do
begin
if k mod 2 =0 then a[k]:=a[k div 2] else
a[k]:=a[k div 2]+a[(k div 2)+1];
end;
k:=0;
while not eof do
begin
k:=k+1;
readln(b[k]);
end;
n:=k-1;
for k:=1 to n do
begin
max:=0;
s:=b[k];
for j:=1 to s do
begin
if a[j]>max then max:=a[j];
end;
writeln(max);
end;
end.

Guys, apparently this problem is not solvable in C#. Even it is written in FAQ:
“It’s not recommended to use Java and C# for solving following problems: 1220, 1275, 1306.”
Just creating half of the required array length with int gives Memory Limit Error
Like
using System;
public class Program
{
    private static void Main()
    {
        int[] nn=new int[125000];
    }
}
This code gives Memory Limit Error.
But some people solved in Java.
To whom who solved in Java, what was the array length in your case?
Does it give Memory Limit Error in Java  creating 125000 elements in int type ?
So should I learn C++?
Is it worth it?
Thanks for suggestions.

It works in my computer 0k...

#include<iostream>
#include<string.h>
#include<cstdio>
#include<vector>
#include<cmath>
using namespace std;
int main(){
        unsigned long long aux;
        vector<unsigned long long>v1;
        while(cin >> aux)v1.push_back(aux);
        int i=v1.size()-1;
        while(i>=0){
                printf("%.4f\n",sqrt(v1[i]));
                i--;
        }
}

cb37c1a6-2f8c-4b8d-9b35-bb945448c8b1
cb37c1a6-2f8c-4b8d-9b35-bb945448c8b1(14) : error C2668: 'sqrt' : ambiguous call to overloaded function
        S:\checker\compile\vc10\include\math.h(589): could be 'long double sqrt(long double)'
        S:\checker\compile\vc10\include\math.h(541): or       'float sqrt(float)'
        S:\checker\compile\vc10\include\math.h(127): or       'double sqrt(double)'
        while trying to match the argument list '(unsigned __int64)'

#include <iostream>
#include <stdio.h>

int main()
{
    long n,k,t;
    scanf("%ld%ld",&n,&k);
    t=2*(n/k)+(n%k!=0)+((n%k>k/2.0)||(n<k));
    printf("%ld\n",t);
    return 0;
}

Edited by author 05.05.2012 14:45

Edited by author 05.05.2012 14:45

what's wrong in my code?
Here is my code:
#include <stdio.h>

main()
{
      int x[100][100],a,i,j;
      scanf("%d",&a);
      for( i = 0 ; i < a ; i++ )
           for( j = 0 ; j < a ; j++ )
                scanf("%d",&x[i][j]);
      for( i = 0 ; i < a ; i++ )
           for( j = 0 ; j <= i ; j++ )
                printf("%d ",x[i-j][j]);
      for( i = a ; i < 2 * a - 1 ; i++ )
           for( j = a - 1 ; j >= i - 3 ; j-- )
                printf("%d ",x[j][i-j]);
      return 0;
}

Edited by author 31.08.2012 20:24

After reading the background, I thought it would always be q[i]<=p[i]. But it seems not so, and normal dp is ok...

#include <stdio.h>
#include <math.h>

main()
{
      int a,x[65535],i,t,delta;
      float x1;
      scanf("%d",&a);
      for( i = 0 ; i < a ; i++ )
           scanf("%d",&x[i]);
      for( i = 0 ; i < a ; i++ )
      {
            t = (x[i] - 1) * 2;
            delta = 1 + 4 * t;
            x1 = sqrt(delta);
            printf("%d ",fmod(x1,1.0) == 0);
      }
      return 0;
}

If you have problems with size of program stack just read FAQ and use special directives :)
In pascal it is {$M 16777216}

then the problem is clear

what's wrong?
#include <stdio.h>
#include <conio.h>

main()
{
      int a,len=0,t=1;
      char b[20];
      scanf("%d%s",&a,b);
      len = strlen(b);
      for( ; a > 1 ; a -= len )
           t *= a;
      printf("%d",t);
      return 0;
}

In testing my code .. it gets stuck in toggling between 41325 and 24315...and ends in infinite loop.

Can anyone help me with what I might be doing wrong ?

I am failing test#1 .. can anyone hint me what is it?

please anyone help me if accepted . it gives me wrong answer on test 1 and as i suppose in test 1 k=0 and i don't know what write :) thanks...