«прийти» вместо «придти»

Hi,

Does anyone know what the test case is? I've tried my solution against the following, and they seem to be correct. A little lost right now.

"No", "OnLine", "AbabaAab", "abaabaaba", "2101221012", "122212221", "A", "AA", "aba", "saaasaaas", "babab"

Solutions
=========
NoN
OnLineniLnO
AbabaAababA
abaabaabaaba
210122101221012
1222122212221
AA
AAA
ababa
saaasaaasaaas
bababab


Thanks!

Edited by author 03.03.2012 08:35

Какие есть способы избежать Time limit?

What are the ways to avoid Time limit?

This is my Prog:

var
  i,n,k,l,g:integer;
begin
  read(n,k);
  l:=1;
  i:=1;
  while i<k do
  begin
    l:=l+i;
    inc(g);
    if l<n then
    i:=i*2
    else break;
  end;
  while l<n do
  begin
    l:=l+k;
    inc(g);
  end;
  writeln(g);
end.

flow can solve this.

Edited by author 19.02.2010 16:08

If u used Dijkstra alg, u should add min price for all pices, and theh deduct it from unswer multiplying on count of the tops.

Sorry for my eng :D

I got WA 10, where is wrong?


///////////////////////
#include <iostream>
using namespace std;
int main()
{
    int N,M,sum,counter,mul;
    counter=0;
    cin>>N>>M;
    sum=M;
    mul=N*M;
    while(sum!=mul)
    {
        N--;
        sum+=N;
        counter++;
        if(sum==mul)
            break;
        M--;
        sum+=M;
        counter++;
    }
    cout<<counter<<endl;

}

Try different epsilons. I got AC with solution that had WA 30,32,34 before that. And all that i changed was epsilon.

#include <iostream>
#include <math.h>
#include <iomanip>

using namespace std;

int main()
{
    float a[4] = { 0 };
    int i;

    for (i = 0; i < 4; i++){
        cin >> a[i];
    }

    for (i = 0; i < 4; i++){
        printf("%.4f\n", sqrt(a[i]));
    }

    return 0;
}

Hi all.

I tried to solve this problem with standart method. I devide all numbers on GCD, and calculate all x in A*x + B*y and I tried find the maximum T, T <= N.

In cicle I write something like this:
if ( max < T )
{
   max = T;
   //something too
}
and have WA16.
After WA16 I tried fix my program, but don't find anything global. Fix something right on wrong, I 13 times get WA 1 - 16.

Then I changed ( max < T ) on ( max <= T ), and don't send, because did not think, what that will be changed WA16 on AC. I was wrong.

I don't know why that fix is right, can someone explain me?

Thanks. Sorry for bad English.

#include <iostream>
#include <string>


using namespace std;


int main()
{
    int n;
    cin>>n;
    int p[n];
    string posi;
    for(int i=0; i<n; i++)
    {
        cin>>posi;
        if ((posi[0]<'a'||posi[0]>'h')||(posi[1]<'1'||posi[1]>'8'))
            return 0;
        if (posi[0]>='c'&&posi[0]<='f')
        {
            if (posi[1]>='3'&&posi[1]<='6')
                p[i]=8;
            if (posi[1]=='2'||posi[1]=='7')
                p[i]=6;
            if (posi[1]=='1'||posi[1]=='0')
                p[i]=4;
        }
        if (posi[0]=='b'||posi[0]=='g')
        {
            if (posi[1]>='3'&&posi[1]<='6')
                p[i]=6;
            if (posi[1]=='2'||posi[1]=='7')
                p[i]=4;
            if (posi[1]=='1'||posi[1]=='8')
                p[i]=3;
        }
        if (posi[0]=='a'||posi[0]=='h')
        {
            if (posi[1]>='3'&&posi[1]<='6')
                p[i]=4;
            if (posi[1]=='2'||posi[1]=='7')
                p[i]=3;
            if (posi[1]=='1'||posi[1]=='8')
                p[i]=2;
        }
    }
    for (int i=0; i<n; i++)
        cout<<p[i]<<endl;

    return 0;
}

Can not get past this one, all tests in the discussion are passed correctly. Can anyone hint on why test #3 may be failed?

Help me. I got WA7.
Give me some test.

try this test:
11

answer is 11, not 1

wa on test24 who can help me!= =
what's the data?

Only my personal opinions, hope they can help you.☺

If you stuck on WA#3, try the following understanding:
The description said "A component of a salad could be a basic ingredient or [another] salad", but Test 3 may contain some cases in which the component of a salad is this salad itself.

If you stuck on WA#6, please remember that "Percentages should be output with an absolute or relative error no more than 10−3"

Is there somebody who can give me input data for test #2?

Try this test:
5 5
2 2 2 3 4
answer: 0 0

Try this test:
10
e
e
f
f
unknown
g
unknown
g
d
d
Answer: Igor is wrong. But my programm gave me "5", because i forgot check v[j] when last="unknown".

if (last == "unknown" && v[j] != "unknown")
                    {
                        last = v[j];
                        if (m[last] == true) f = false;
                    }

Very simple problem, only what you need is to read the directions of buttons more CAREFULLY.
Their keyboard is like
 0
789
456
123

Edited by author 11.07.2014 06:36

1=(y-1*sqrt(2)/2) (x-1*sqrt(2)/2)
7=(y+1*sqrt(2)/2) (x-1*sqrt(2)/2)
9=(y+1*sqrt(2)/2) (x+1*sqrt(2)/2)
3=(y-1*sqrt(2)/2) (x+1*sqrt(2)/2)
2=(y-1)
8=(y+1)
4=(x-1)
6=(x+1)
  that's all

Edited by author 09.02.2006 18:40