Here my code
#include<iostream>
using namespace std;
void main()
{
        char c,str[10000]; int f=0,i=0;
        while (cin.get(c))
        {

                if (c=='!'||c=='?'||c=='.') {f=0; str[i]=c; i++;} else
                if (c>='A'&&c<='Z')
                {
                if (f!=0) {str[i]=c-'A'+'a'; i++;} else {str[i]=c; i++; f++;}
                } else {str[i]=c; i++;}
        }
        cout<<str;

}

На 7 или на 8 тесте ошибка но все тесты что я видел все правильно идут вот код:
var
state:string;
n,i,k,max,min:integer;
h,s:boolean;
begin
readln(n);
min:=10;
max:=3;
for i:=1 to n do begin
                 readln(k,state);
                 delete(state,1,1);
                 if state='hungry' then begin
                                        if h=false then begin
                                                        max:=k;
                                                        h:=true;
                                                        end;
                                        if max<k then max:=k;
                                        end else begin
                                                 if s=false then begin
                                                                 min:=k;
                                                                 s:=true;
                                                                 end;
                                                 if min>k then min:=k;
                                                 end;
                 end;
if max>=min then write('Inconsistent') else write(min);
end.

I Have a problem. Explain me.
1 2 3 4 5
4 1 5 2 3

1 2 3 4 5
2 4 3 1 5

1 2 3 4 5
4 1 3 2 5

1 2 3 4 5
2 4 3 1 5
...

What shall I do?

Edited by author 07.08.2005 19:54

Got AC 0.001 sec from the first effort :) I saw many requests for clarification here, but it's easier to describe grammar in terms of behavior.

Go sequentially through input data.

1. If you meet '{' - everything until closest corresponding '}' is a single comment, no matter what's inside. '}' corresponds to '{' if all {,} characters between them form valid bracket sequence.

2. If you meet '//' - everything until '\n' is a single comment, no matter what's inside.

3. If you meet ' - everything until next ' is a string, no matter what's inside.

3. If you meet '#' followed by a digit - everything until first non-digit is a string.

4. If you meet a digit, then everything until first non-digit is a number. If first non-digit character is '.' AND it is followed by another digit, then this post-dot digit sequence is appended to the number as well as the dot itself. I.e. "1.23" is a single number, but "123.a" is number '123' followed by '.', followed by identifier 'a'.

5. If you meet underscore or letter, everything until first non-digit-non-underscore-non-letter is an identifier. It may be a keyword.

6. Output all other characters as is.

Edited by author 17.08.2008 01:02

<PRE>
and a line
</PRE>

replace "and a line" with it's translation (и строку) :-)

Please help!!!Tell me what is wrong in my algo???Help to orgonise input!Here is my code:
#include <iostream.h>
int main()
{
    const int N=50000;
    int x[N],y[N];
    bool s;
    int i,k;
    int a,b;
    cin>>a;
    for(i=0;i<a;i++)
    {
        cin>>x[i];
    }
    cin>>b;
    for(i=0;i<b;i++)
    {
        cin>>y[i];
    }
    for(i=0;i<a;i++)
    {
        for(k=0;k<b;k++)
        {
            if(x[i]+y[k]==10000)
            {
                s=true;
            }
            if(x[i]+y[i]!=10000)
            {
                s=false;
            }
        }
    }
    if(s=true)
    {
        cout<<"YES"<<endl;
    }
    if(s=false)
    {
        cout<<"NO"<<endl;
    }
    return 0;

}

Help somebody!!
Why my code has WA6..or GIVE SOME TESTS, please))

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

vector<int>easy_numbers(0);

int next_number(int numb_of_numb)
{
        int step=easy_numbers.size()-1;
        int curr_number=easy_numbers[step];
        while(step+1<numb_of_numb)
        {
                while(1)
                {
                        curr_number++;
                        int sq_root=sqrt(static_cast<double>(curr_number))+1;
                        int buf_step;
                        buf_step=0;
                        while(easy_numbers[buf_step]<sq_root)
                                if (curr_number%easy_numbers[buf_step++]!=0) continue;
                                else goto g1;
                        break;
                        g1:
                }
                easy_numbers.push_back(curr_number);
                step++;
        }
        return curr_number;
}

int main()
{
        int K;
        int L=-1;
        cin >> K;
        if (K==4) {cout << 3; exit(0);}
        easy_numbers.push_back(3);
        int buf=0;
        while((easy_numbers[buf]*easy_numbers[buf])<=K)
        next_number(++buf);
        for (int i=0;i<easy_numbers.size();i++)
        {
                if (K%easy_numbers[i]==0) {L=easy_numbers[i]-1; break;}

        }
        if (L==-1 && K%2==0) {L=K/2-1; cout << L;
        exit(0);}
        if (L==-1) {L=K-1; cout << L;
        exit(0);}
        cout << L;
        return 0;
}

Please add test

aa

I know AC solution that answers to this test 'a'.

We can use Matrix-Tree theoremd(生成树计数) to solve it!
O(N^3)

have a try.
{
while not seekeof
begin

end;
}

Does the order in which you print the word matters?

I cannot pass thru 5th test.

What's the trick on Test #11?..

Help me ...

I have writen the program if many similar ways. I don't know why I got ac with this program:
const u : set of char = ['A'..'Z','a'..'z'];
var
  s   : string;
  i   : integer;
  ch  : char;
begin
  s := '';
  while not (eof) do
    begin
      read(ch);
      if ch in u then s := ch+s
                 else begin
                        write(s);
                        write(ch);
                        s := '';
                      end;
    end;
  if ch in u then write(s);
end.

two rivers are considered to be connected iff they share at least one vertex (no matter inner vertex or end vertex)

example 1:
2
2
-1 0
1 0
2
0 1
0 -1
not connected, because their intersection (0, 0) is not a vertex of river 1 or river 2

example 2:
2
2
-1 0
1 0
3
0 1
0 0
0 -1
not connected, because (0, 0) is not a vertex of River 1

example 3:
2
3
0 1
0 0
0 -1
3
-1 0
0 0
1 0
connected, because (0, 0) appears on both rivers

After 3 test use a/b=>(a/nod(a,b))/(b/nod(a,b))

Hello.

I have an array of numbers from 1 to N. The order is random. I have to answer a lot(M) of questions like: how many numbers from interval [x, y] bigger than k. I tried to build two-dimensional interval tree: each edge of interval tree has an internal tree. But that tree was too large.

1 <= N, M <= 100000
Memory limit = 64 Mb

Also I tried to build Fenwick tree. But it also needs too much memory: O(N^2).

Please, can you help me to compress an interval tree or Fenwick tree? Or, maybe, there is another way to solve this problem?

Thank you.

I still have WA on test 18 after many efforts.
Does anyone know some tricks about this test?
My program gives right answers on all my tests.
Can anyone give me more tests?

Shouldn't the answer to the sample be 0.3660?
I've solved this problem assuming, that pyramid lies on triangular edge. It seems to me that it is wrong suggestion, nevertheless it got AC. It seems to me, that pyramid should be firstly rotated to lay on one of the triangular face - then the answer is 0.3660. Am I wrong?

Edited by author 09.11.2009 02:17