Please can anybody tell me what is test case #11

Instead of copying actually data, we might put a marked-number (index to copy) in the array.
For example,

            if (x > 0)
            {
                stack[q ++] = x;
            }
            else
            if (x == -1)
            {
                int y = stack[q - 1];
                if (y > 0)
                {
                    System.out.println(y);
                    q--;
                }
                else
                {
                    y = -y;
                    System.out.println(stack[y]);
                    stack[q - 1] = -(y - 1);
                    if (y == 0)
                    {
                        q--;
                    }
                }
            }
            else
            {
                stack[q] = -(q - 1); // negative numbers mean a copy.
                q ++;
            }

of course, this doesn't work for multiple continuous copy (e.g. 0, 0, 0 ..).

It seems like the solution ratings are first sorted based on runtime, and then if a tie, on the time of submission which does not make too much sense. Maybe it should be sorted based on memory usage if a tie on runtime?

You can prove it with the knowledge of maths.

Edited by author 22.08.2007 14:43

This is hint: maximal substring-palindrome is maximal common substring of given string and reversed string => You can solve it for O(N^2).
The second variant - trivial dynamic. dp[l][r] = answer for substring from l to r. Sorry for my poor english(((

Edited by author 13.11.2012 23:38

Just a quick question..

the timings set for each problem, for example, maximum 1 second.

Does this one second refer to the execution time of all tests or just for each test point?

I guess, it is for each test point. am I right?

I need to cаlculate sum of torques about axes, right.

T = ∑F·d = 0, where T is torque, F is vector of force, d is distance from F to center of sphere.

Is it right?

while((ch=getchar())!='\n')
{
    if(ch==')')
    {
       ...
    }
    else
    {
       ....
    }
    printf("%i",(!K)*ans);
}

#include<stdio.h>
int f(int X1,int X2,int X3,int x1,int x2,int x3)
{
    if(X1==x1&&X2==x2&&X3==x3)return 0;
    if(x3+X1==x1+X3&&x3+X1==x2+X2&&(x3+X1)%2==0)return 1;
    if(x1-X1==x2-X2&&x1-X1==x3-X3&&(x1-X1)%2==0)return 2;
    return -1;
}
void ff(int &ans, int &k1, int &k2)
{
    if(k1!=-1&&k2!=-1&&k1+k2<ans)ans=k1+k2;
}
int main()
{
    int x1,y1,x2,y2,x3,y3,X1,Y1,X2,Y2,X3,Y3,ans=30;
    scanf("%i %i %i %i %i %i",&x1,&y1,&x2,&y2,&x3,&y3);
    scanf("%i %i %i %i %i %i",&X1,&Y1,&X2,&Y2,&X3,&Y3);
    int k11,k12,k21,k22,k31,k32,k41,k42,k51,k52,k61,k62;
    k11=f(X1,X2,X3,x1,x2,x3);   k12=f(Y1,Y2,Y3,y1,y2,y3);
    k21=f(X1,X3,X2,x1,x2,x3);   k22=f(Y1,Y3,Y2,y1,y2,y3);
    k31=f(X2,X1,X3,x1,x2,x3);   k32=f(Y2,Y1,Y3,y1,y2,y3);
    k41=f(X2,X3,X1,x1,x2,x3);   k42=f(Y2,Y3,Y1,y1,y2,y3);
    k51=f(X3,X1,X2,x1,x2,x3);   k52=f(Y3,Y1,Y2,y1,y2,y3);
    k61=f(X3,X2,X1,x1,x2,x3);   k62=f(Y3,Y2,Y1,y1,y2,y3);

    ff(ans,k11,k12);
    ff(ans,k21,k22);
    ff(ans,k31,k32);
    ff(ans,k41,k42);
    ff(ans,k51,k52);
    ff(ans,k61,k62);

    if(ans==30)puts("IMPOSSIBLE");
    else printf("%i",ans);
    return 0;
}

if ((p = 0) and (n = 0)) and ((Pc = 1) and (Nc = 1)) then
  writeln('undefined');

if (((p = 0) and (n <> 0)) or ((p <> 0) and (n = 0)))and ((Pc = 1) and (Nc = 1)) then
  writeln('error');

this pair if we have on input n and p (Nc = 1 and Pc = 1)
but still i have wa on 6 test!
are there any conditions for "error" and "undefined"??? please help. i've already sent my solution for 13 times! and still it's wa...

It works but here i get Compilation Error

#include <iostream>
using namespace std;

int main(){
    int num, val, numMod;
    string nFuc;
    cin >> num >> nFuc;

    int i = nFuc.length();

    int mod = num % i;
    if(mod != 0){
        numMod = num;
        val = numMod;
        while(numMod != mod){
            numMod -= i;
            val *= numMod;
            }
        }

    else if(mod == 0){
        numMod = num;
        val = numMod;
        while(numMod > i){
            numMod -= i;
            val *= numMod;
            }
        }

    cout << val << endl;
}

Thanks

In the sample input, there is an extra space in the third line from the bottom (i.e. after the number '1'). Because there are no extra spaces in the actual tests, this extra space is better removed cuz people who use strict char by char reading (like me) might freak out fora while.

my code c#


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


namespace kyrsach1294
{
    class Program
    {
        static int Main(string[] args)
        { int a,b,c,d;
            string[] dlins = Console.ReadLine().Split(' ');
         a = int.Parse(dlins[0]);
         b = int.Parse(dlins[1]);
         c = int.Parse(dlins[2]);
         d = int.Parse(dlins[3]);
         if (a * b==c * d)
         {
             {
                 Console.WriteLine("Impossible.");
                 return 0;
             }
         }


       double s,s1,s2;
       s1 = c * d / (c * d - a * b);

        s2 = a * b / (c * d - a * b);
       s = s1*a*a+s1*b*b-s2*c*c-s2*d*d;
            if (s < 0)
            {
                Console.WriteLine("Impossible.");
                return 0;
            }
            int answer;

            s = Math.Sqrt(s) * 1000;
            answer = Convert.ToInt32(s);
            Console.WriteLine("Distance is "+answer+" km.");
            return 0;
        }
    }
}
please help

Edited by author 03.04.2012 22:40

I don't think, that N<=1000. Because when I submit mas[1001][1001], I get WA2. But when I submit mas[2000][2000], I get AC

Why WA?

#include <iostream>
using namespace std;
void main(){
    int x;
    int y;
    int jb = 0, jc = 0;
        cin >> x;
        //int mass[x];
        int *mass = new int[x];
        int *mass2 = new int[x];
        int *mass3 = new int[x];

        for(int i=0;i<x;i++){
            cin >> y;
            mass[i] = y;
        }

        for(int i=0, j=0, p=0;i<x;i++, j=0, p=0){
            if(mass[i] == 0){
                continue;
            }
            for(;j<x;j++){
                if(mass[j] == 0){
                continue;
            }
                if(mass[i]==mass[j]){
                    p++;
                    if(i!=j){
                    mass[j]=0;
                    }
                }
            }
            mass2[i] = p;
            mass3[i] = mass[i];
            if(jb<=mass2[i]){
                jb=mass2[i];
                jc=i;
            }
        }
        cout << mass3[jc];
}

AND JAVA How make this program faster?
import java.util.*;

public class Uno {
    public static void main(String[] args){
        int jb = 0, jc = 0;
        Scanner in = new Scanner(System.in);
        int x = in.nextInt();
        int[] mass = new int[x];
        int[] mass2 = new int[x];
        int[] mass3 = new int[x];

        for(int i=0;i<mass.length;i++){
            int y = in.nextInt();
            mass[i] = y;
        }

        for(int i=0, j=0, p=0;i<mass.length;i++, j=0, p=0){
            if(mass[i] == 0){
                continue;
            }
            for(;j<mass.length;j++){
                if(mass[j] == 0){
                    continue;
                }
                if(mass[i]==mass[j]){
                    p++;
                    if(i!=j){
                    mass[j]=0;
                    }
                }
            }
            mass2[i] = p;
            mass3[i] = mass[i];
            if(jb<=mass2[i]){
                jb=mass2[i];
                jc=i;
            }
        }
        System.out.print(mass3[jc]);
    }
}

OR C#
using System;

public class Uno
{
    public static void Main(String[] args)
    {
        string x; string y;
        int jb = 0, jc = 0;
        x = Console.ReadLine();
        int[] mass = new int[int.Parse(x)];
        int[] mass2 = new int[int.Parse(x)];
        int[] mass3 = new int[int.Parse(x)];

        for (int i = 0; i < int.Parse(x); i++)
        {
            y = Console.ReadLine();
            mass[i] = int.Parse(y);
        }

        for (int i = 0, j = 0, p = 0; i < int.Parse(x); i++, j = 0, p = 0)
        {
            if (mass[i] == 0)
            {
                continue;
            }
            for (; j < int.Parse(x); j++)
            {
                if (mass[j] == 0)
                {
                    continue;
                }
                if (mass[i] == mass[j])
                {
                    p++;
                    if (i != j)
                    {
                        mass[j] = 0;
                    }
                }
            }
            mass2[i] = p;
            mass3[i] = mass[i];
            if (jb <= mass2[i])
            {
                jb = mass2[i];
                jc = i;
            }
        }
        Console.Write(mass3[jc]);
    }
}

what is test 23?

Hi
I am new to forum. I just tried Reverse Root problem and had judgement result as "wrong answer". Below is my code .. just wondering what is wrong with it. Because I ran it on Visual Studio and it seems to give right numbers.

Many Thanks
-----------------------------------------


#include <iostream>
#include <iomanip>
#include <cmath>
int main(){
    double arr[65536];
    int i = 0;
    int value = 0;
    while(std::cin >> value){
        arr[i++] = sqrt(static_cast<double> (value));
    }
    std::cout<<std::setprecision(4)<<std::fixed;
    while(i--)
        std::cout << arr[i] << std::endl;
}