Edited by author 23.08.2008 22:49

Getting wrong answer on test case 6. But i think my program is correct can anybody tell me what is the test case for 6?

Give me some tests

Please, tell me what does that test look like?

My prog got ac, but haven't passed this test:
4
1 1 1
1 1 1
1 1 1
1 1 2
correct answer - 4, answer of my prog - 2.

The compiler has been changed to VC.
long long is still available but we must use %I64d instead of %lld!!!

My solution TLE. I not know program what optimal algorithm.
Help me

What is the most simple way to find an area of two squares' intersection?

Сразу прошу извинения за то, что пишу на русском...

У меня вопрос: как может заполнена клетка, где большая буква?
........
........
...aa...
..aA.x..
..a..x..
...bb...
........
........

ведь все те клетки, что с ней пересекаются, симметрические относительно нее.

Заранее спасибо за помощь!

Why this answer is not correct?
0 3 1 0 0
0 0 3 1 1
1 0 0 1 1
3 1 1 0 0
3 1 1 0 0

Can somebody explain me this test
input
-1 1 0
1 -1 -1
0 1 -1
output
0 0 1
3 0 3
1 0 0

Should the interval tree be balanced? I use simple interval tree and get TL22.

Here is my code. Please help to find mistake.
#include <stdio.h>
void main()
{
int x,n,m,y,p,i,s,u;
vv:
scanf("%d",&n);
scanf("%d",&m);
scanf("%d",&y);
if (n<=0 || n>=999 || m<=1 || m>=999 || y<=0 || y>=99) goto vv;
u=-1;
s=0;
x=0;
while (x<=(m-1))
{
 p=1;
 for (i=1; i<=n; i++)
 {
  p=p*x;
 }
 if ((p % m) == y)
 {
 printf("%d ",x);
 s++;
 }
 x++;
}
 if (s==0)
 printf("%d\t",u);
}

What range have 1st step? For example, for MEDUIM (period == 500) is it [0..499] or [0..500] ?
The same question for last step: [Tmax-perion, Tmax-1] or [Tmax-period,Tmax] ?

Dance Level Bonus is 0 if Dance Points were negative at any stage during the game (even if final value is non-negative).

It's not quite logical because first MISS/BOO ruins bonus for entire game, even if the rest was PERFECT. But that's it :)

Can this be done with O(N) memory ?

#include <iostream>
#include <cstring>
#include <vector>

using namespace std;

int main()
{
    char str[20000],str2[10000],str3[10000];
    unsigned int len;
    unsigned int i,j,k;
    vector<char>check;
    char ch;

    while(gets(str))
    {
        len=strlen(str);

        if(len==1)
            cout<<str[0]<<str[0]<<endl;

        else
        {

            for(i=0;i<len;i++)
                str2[i]=str[len-1-i];

            if(strncmp(str,str2,len)==0)
            {
                for(i=1;i<=len;i++)
                {
                    for(j=i;j<len;j++)
                    {
                        ch=str[j];
                        check.push_back(ch);
                    }

                    for(j=0;j<check.size();j++)
                    {
                        str2[j]=check[j];
                        str3[j]=check[check.size()-1-j];
                    }

                    if(strncmp(str2,str3,check.size())==0)
                    {
                        for(k=0;k<i;k++)
                            str[len+k]=str[i-k-1];

                        for(k=0;k<len+i;k++)
                            cout<<str[k];
                        cout<<endl;

                        check.clear();
                        break;
                    }
                    check.clear();
                }
            }

            else
            {
                for(i=0;i<len;i++)
                {
                    for(j=i;j<len;j++)
                    {
                        ch=str[j];
                        check.push_back(ch);
                    }

                    for(j=0;j<check.size();j++)
                    {
                        str2[j]=check[j];
                        str3[j]=check[check.size()-1-j];
                    }

                    if(strncmp(str2,str3,check.size())==0)
                    {
                        for(k=0;k<i;k++)
                            str[len+k]=str[i-k-1];

                        for(k=0;k<len+i;k++)
                            cout<<str[k];
                        cout<<endl;

                        check.clear();
                    break;
                    }
                    check.clear();
                }
            }
        }

    }

    return 0;
}

Potentialy very interesting but with too weak tests problem
I got Ac very unexpected on halphway of solution.
MY prog can't process test
4
1 2 1
2 1 2
3 4 3
4 3 4
with answer
1 1 1 1
This specific case most interesting case when
there are K~100-250 unintersecting circles in given
graph. We should build forest consist of such
circles and process each tree from the root.
Circles are bound throught whome each statement belong.
All this situation is unreflected because weak tests.

Edited by author 12.02.2007 22:08

Edited by author 12.02.2007 22:09

Edited by author 12.02.2007 22:09

Edited by author 12.02.2007 22:11