Please help me. I cann't find what is wrong.
Any tests or ideas please.

import java.util.Scanner;


public class T_1644 {
public static void main(String[] args) {
    Scanner sc= new Scanner(System.in);
    int n=sc.nextInt();
    int min=10;
    int max=Integer.MIN_VALUE;
    for (int i = 0; i < n; i++) {
        int x=sc.nextInt();
        String s=sc.next();
        if(s.equals("hungry"))max=Math.max(x, max);
        else min=Math.min(min,x);
    }
    if(max<min) System.out.println(min);
    else System.out.println("Inconsistent");
}
}

// code deleted

Edited by author 17.06.2015 01:38

Messages should not contain correct solutions.

i use 2 TreeSet<Integer>, nope, ok
nope is prepopulated with 2, ok is prepopulated with 10

in cycle i read counts into one of them with checking if other one does not contain new value has been read recently

if nope.last()>=ok.first() then the result is ok.first()

This test helped me!
8
01100101
00000000

answer:
196

subject 1002 wrong answer 1

It is said that text contains not more than 1000 words,
but limitations on length of words exist (in statement)
only for dictionary. It means that (technically)
Russian statement does not bound length of text
at all.

So, can you tweak problem statement a bit to make it more clear, please?

Edited by author 30.07.2014 20:05

why wrong ans test case # ?? Plzzz help
my code:
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int a[12],n,i;
//int n,i;
    float res,sum=0;
    cin>>n;

    for(i=0; i<n; i++)
    {
        cin>>a[i];
        sum+=a[i];
    }
    res=(float)sum/n;

    if(res==5)
        printf("Named\n");
    else if(res>=4.5&&res<5)
        printf("High\n");

    else if(res>3&&res<4.5)
        printf("Common\n");
    else
        printf("None\n");
    return 0;
}

Messages should not contain correct solutions.

i use matrix of costs, each step set value of the cell as minimal of the

previous vertical cost + 100,
previous horizontal cost + 100,
previous diagonal cost + 100*sqrt(2)

the answer is Math.round(cost[M][N])

p.s.
cycle is organized from 1 to n, 1 to m inclusively


Edited by author 14.06.2015 17:09

#include <iostream>
#include <vector>
#include <cmath>


using std::cout;
using std::cin;
using std::vector;
using std::endl;


int _tmain(int argc, _TCHAR* argv[])
{
    long long number;
    vector <long long> s;
    while (cin >> number)
    {
        s.push_back(number);
    }
    for (int i = s.size() - 1; i >= 0; --i)
    {
        cout << sqrt((long double)s[i]) << endl;
    }
    return 0;
}

uyyuzk-abb69e.cpp(12) : error C2061: syntax error : identifier '_TCHAR'

Edited by author 14.06.2015 09:40

var n,k,l:real;
begin
read(n,k);
l:=(n*2/k);
if trunc(l)=0 then write(2)
else if frac(l)=0 then write(l)
else write(trunc(l)+1);
end.

WA 6
3
2 0
1 3 0
2 0
-----
2
1 3

3
2 3 0
1 0
1 0
--
1
1

WA 11
4
2 0
1 4 0
4 0
2 3 0
--
2
1 3

WA 13
3
3 0
3 0
1 2 0
--
2
1 2

For the first time used deque which got 0.204sec after I have changed data structure to a vector got 0.015 sec runing time!
insane :)

input: 0
output: 10

var i,j,k,n,d,l:longint;
st:string;
s:array [1..100] of string;
a:array [1..100] of integer;
begin
readln (n);
if n=0 then writeln ('10');
k:=0;
st:='';
for j:=1 to n do begin
    readln (k,st);
    a[j]:=k;
    s[j]:=st;
    end;
    for l:=1 to n-1 do
    for i:=1 to n-l do begin
     if a[i]<a[i+1] then begin
       k:=a[i];
       a[i]:=a[i+1];
       a[i+1]:=k;
       st:=s[i];
       s[i]:=s[i+1];
       s[i+1]:=st;
       end;
end;
    i:=1;
     if s[1]=' satisfied' then begin
    while s[i]=' satisfied' do begin
     i:=i+1;
     k:=a[i-1];
     end;
     writeln (k);
     end;
     d:=1;
     if s[1]=' hungry' then begin
    for i:=2 to n do begin
    if s[1]=s[i] then inc(d);
    end;
    if d=    n then writeln ('10') else writeln ('Inconsistent');
    end;

 end.

can you give some tests?

Edited by author 20.01.2009 14:17

What is in test 2 ??????????????????
YOUR TEST CASES ARE WROUNG

MY PROGRAMM IS CORRECT !!

my code:

#include <iostream>
#include <string>

using namespace std;

int main(int argc, char *argv[])
{
    string sent;
    char c = 0;
    size_t count = 0;
    while (cin.get(c))
    {
        sent.push_back(c);
        if (c == '.' || c == '?' || c == '!')
        {
            size_t i = 0;
            while (i < sent.size() && !isalpha(sent[i]))
            {
                i++;
            }

            if (i < sent.size() && islower(sent[i]))
                count++;

            string word = "";
            for (size_t i = 0; i < sent.size() + 1; i++)
            {
                if (i < sent.size() && (isalpha(sent[i])))
                {
                    word += sent[i];
                }
                else
                {
                    for (size_t j = 1; j < word.size(); j++)
                    {
                        if (isupper(word[j]) && isalpha(word[j]))
                            count++;
                    }
                    word = "";
                }
            }
            sent.clear();
            //cout << count << endl;
        }
    }
    cout << count;
    return 0;
}


Edited by author 12.06.2015 20:13

Edited by author 12.06.2015 20:13

for WA5, try this test

hEllo wOrld!!! w

The correct answer is 4

i cant find 12 distinct combinations if N = 2...
i can only think of:
0-0
0-1
0-2
1-1
1-2
2-2
That are only 6 combinations... what did i miss?

It is says, at least p percent from the total number of the bags that have already been checked

If the total number includes current one?