fu
104

fur
83

FBRDub
23

DUDu
1

lrbudf
35

LRBUDF
35

BBUUBB
1

This is my code

var n,i:integer;
baza:array[1..1000]of string[2];
tmp,bukva:string[2];
begin
read(n);
i:=0;
repeat
i:=i+1;
readln(baza[i]);
until i=n;
read(bukva);
for i:=1 to n do
begin
tmp:=baza[i];
if bukva=tmp[1] then writeln(tmp);
end;
end.

Where mystake? I think to this code is right, but i have WA in test1. Help please

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Тарелки2
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] parampidn = Console.ReadLine().Split(' ');
            int a = int.Parse(parampidn[0]);
            int b = int.Parse(parampidn[1]);
            int d = int.Parse(parampidn[2]);
            string[] muska1 = Console.ReadLine().Split(' ');
            int r1 = int.Parse(muska1[0]);
            int r2 = int.Parse(muska1[1]);
            int minradmuska1 = 0, maxradmuska1 = 0;
            if (r1 > r2)
            {
                maxradmuska1=r1;
            }
            else r2 = maxradmuska1;
            if (r2 > r1)
            {
                minradmuska1 = r1;
            }
            else minradmuska1 = r2;
            string[] muska2 = Console.ReadLine().Split(' ');
            int R1 = int.Parse(muska2[0]);
            int R2 = int.Parse(muska2[1]);
            int minradmuska2=0, maxradmuska2=0;
            if (R1 > R2)
            {
                maxradmuska2 = R1;
            }
            else maxradmuska2 = R2;
            if (R2 > R1)
            {
                minradmuska2 = R1;
            }
            else minradmuska2 = R2;
            int h = int.Parse(Console.ReadLine());
            int minst=0, maxst=0, maxradvel12;
            if (maxradmuska1>maxradmuska2)
            {
                maxradvel12=maxradmuska1;
            }
            else maxradvel12=maxradmuska2;
            if (a>b)
            {
                minst=b;
            }
            else minst =a;
            if (a>b)
            {
                maxst=a;
            }
            else maxst=b;
            if (((2*maxradmuska1+2*maxradmuska2)<=maxst)&&(2*maxradvel12<=minst)&&(2*maxradmuska1+2*maxradmuska2<=
                Math.Sqrt((double)a*a+(double)b*b)))
            {
                Console.WriteLine("YES");
            }
            else
            {
                Console.WriteLine("NO");
            }
        }
    }
}

#include<iostream.h>
#include<math.h>
#include<stdlib.h>
bool prov(char s[10])
{
int k1=0,k2=0;

k1=s[0]-'0'+s[1]-'0'+s[2]-'0';

k2=s[3]-'0'+s[4]-'0'+s[5]-'0';

if(abs(k2-k1)==1)return true;else return false;

}
int main()
{
char s[10],str1[10];
int pr=0,k1,k2;
cin>>s;
if(prov(s)==true)
{
ltoa(atol(s)+1,str1,10);
k1=str1[0]-'0'+str1[1]-'0'+str1[2]-'0';
k2=str1[3]-'0'+str1[4]-'0'+str1[5]-'0';
if(k1==k2)pr=1;

ltoa(atol(s)-1,str1,10);
k1=str1[0]-'0'+str1[1]-'0'+str1[2]-'0';
k2=str1[3]-'0'+str1[4]-'0'+str1[5]-'0';
if(k1==k2)pr=1;

if(pr==0)cout<<"No";else cout<<"Yes";
}else cout<<"No";

return 0;


}

#include <stdio.h>
int main()
{
    int number;
    int b;
        int weight;
        int sum;
        int sum1;
        int i;
        int k;
        int p;
    int a[20];
    status:
        scanf("%d", &number);
        if(number>=1&&number<=20)
        {
            for(weight=0;weight<number;weight++)
            {
                scanf ("%d", &b);
                if(b>=1&&b<=100000)
                a[weight]=b;
                else
                weight--;
            }
            for(i=0;i<number;i++)
             {
             for(weight=0;weight<number;weight++)
            {
               if(a[weight]>a[weight+1])
             {
                    p=a[weight];
                 a[weight]=a[weight+1];
                   a[weight+1]=p;
            }
            }
        }
          sum=a[number-1];
        sum1=a[number-2]+a[number-3];
        for(i=4;i<=number;i++)
         {
             if((sum1+a[number-i])<=sum)
             sum1=sum1+a[number-i];
            else
            sum=sum+a[number-i];
        }
        k=sum-sum1;
        printf ("%d\n", k);
}
        else
        {
            printf("enter again\n");
            goto
            status;
        }
       return 0;
}

Edited by author 22.12.2011 18:18

here is the algorithm:
#include <iostream>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
   freopen("input.txt", "rt", stdin);
   freopen("output.txt", "wt", stdout);
#endif
    short *a_list,*d_list; unsigned short a_list_size, d_list_size, a_pos, d_pos;
    char flag;
    cin >> a_list_size;
    a_list = new short[a_list_size];
    for (a_pos = 0; a_pos<a_list_size; a_pos++) {
    cin >> a_list[a_pos];}
    cin >> d_list_size;
    d_list = new short[d_list_size];
    for (d_pos = 0; d_pos<d_list_size; d_pos++) {
    cin >> d_list[d_pos];}
    a_pos = d_pos = 0; flag = 'p';
    do {
        if ((a_list[a_pos]+d_list[d_pos]) > 10000) {
            if (d_pos == d_list_size) flag = 'n';
            else d_pos++;
        }
        else if ((a_list[a_pos]+d_list[d_pos]) < 10000) {
            if (a_pos == a_list_size) flag = 'n';
            else a_pos++;
        }
        else flag = 'y';
    } while (flag == 'p');
    if (flag == 'y') cout << "YES";
    else if (flag == 'n') cout << "NO";
}

what can be wrong?

Attention:

At the beginning, [0, 1000000000)is white,and the second test's output is [..., 1000000000), and in fact you have to deal it with[0, 1000000000 - 1), or you'll got wa. I don't know why!


Forgive my english:)

Edited by author 13.11.2011 16:28

It seems there are extra characters in test 6!

I use following construction:
while (scanf("%d") != EOF)) {
  //proccess test
}
to be able to proccess several test from one file.

With this construction i got WA6. When i proccessed only one test i got Accepted.

i got wa on 16 please give me test# 16, i don't know where my mistake: size of heap and arrays are enough.

Why WA5?

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

Correct answer "-2 1" but my program gave answer "Impossible". =)

Do not use the fact that there are only 3 moves left. The traditional minimax is fast and simpler to write.

Hm...Very bad. My programm got AC when i add this code in end program
    if(ncount==5) if(answer==2) answer=0;(ncount-count of stone)
ADMIN READ IT PLEASE
pls repair test!!! add this test for example
6
1 4 5 6 7 9
right answer is 0 {(9+7) and (1+4+5+6)}.
My program failed this test))
thanks for watching/

Edited by author 25.11.2011 00:45

Edited by author 25.11.2011 00:46

Can you help me for DFA? I am really not sure how to solve the question.

Thanks for your help in advance.

did anyone make the same mistake?
what's that?

I can't understand my mistake(

I can't understand what do we need the plain coordinates for.

Edited by author 20.12.2008 14:48