If your code on pascal, don't use "CASE x oF"

it's got CE(Compilation error)

Consider for instance the first drawing : in my perception, the staircase has 4 steps because there are 4 horizontal levels. So the first step (ie the lower one) is made up with 4 blocks, the second with 3 blocks, the third one with 2 blocks and the fourth with 2 blocks again ; so the sizes of the steps are not in _strictly_ descending order (the sizes are 4 3 2 2).

So what does "size of a step" really mean? the number of blocks between two consecutive horizontal levels ?  the height from the ground of a given level? the height between two consécutive levels?

"descending order" : how do you count the steps? from right to left? from top to bottom?


The task is no more than finding the number of partitions of n into at least two distinct parts.

Edited by author 29.06.2013 04:27

here is my code. In my computer he got AC on test#1. But in timus that got WA#1

var
 a:array[0..500010] of longint;

procedure sort(l,r:longint);
var
 i,j,p,x:longint;
begin randomize;
 i:=l; j:=r; x:=a[random(r-l+1)+l];
 repeat
  while x>a[i] do inc(i);
  while x<a[j] do dec(j);
  if i<=j then
   begin
    p:=a[i];a[i]:=a[j];a[j]:=p;
    inc(i); dec(j);
   end;
 until i>j;
 if i<r then sort(i,r);
 if l<j then sort(l,j);
end;

var
 p,j,k,n,i,temp,have:longint;
begin
 readln(n);
 for i:=1 to n do
  readln(a[i]);
 sort(1,n);
 temp:=-1;
 for i:=1 to n do
  begin
   if a[i]=temp then begin inc(have); continue; end;
   if n mod 2=1 then k:=1 else k:=0;
   if have>=n div 2+k then begin writeln(temp); halt; end;
   have:=1;temp:=a[i];
  end;
 if n=1 then writeln(temp);
end.

Transposing means swapping two tombstones NOT reversing the order of all the stones between selected two.

1...n print(i)
(n+1)...n+m print(i*n)

I have WA on test 8. Can someone help. I tried every given test in the site but I can't find any mistakes.
This is my code:
//
#include<iostream>
#include<cmath>
#include<algorithm>
#include<iomanip>
using namespace std;
bool b[2005][2005];
long double a[2005][2005];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    long double diag=sqrt(2)*100;
    int n,m,k,k1,r;
    cin>>n>>m>>r;
    for(int i=0;i<r;i++)
    {
        cin>>k>>k1;
        b[k][k1]=1;
    }
    n++;
    m++;
    for(int i=2;i<=n;i++)a[1][i]=a[1][i-1]+100;
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            a[i][j]=a[i-1][j]+100;
            if(j!=1 && a[i][j]>a[i][j-1]+100)a[i][j]=a[i][j-1]+100;
            if(b[i-1][j-1] && a[i][j]>a[i-1][j-1]+diag+0.001)a[i][j]=a[i-1][j-1]+diag;
        }
    }
    cout<<fixed<<setprecision(0)<<a[n][m]<<"\n";
    return 0;
}

If you got WA #3, check case n=1 ;)

input:

HELLO. I AM ANJELA! AND YOU?
I AM BLONDE.


output:

Hello. I am anjela! And you?
I am blonde.

Give me test . please!

I can't get past WA #5.  I know it's an n=500 case, but my solution works for n=500 with various k and passenger data as far as I can tell.   Any other boundary conditions known to be in test 5?

P and A must satisfy the condition :

P ( P + 2A - 1) = 2N

good luck !

Test
0 0 0 0 0 1
499

Answer
10
1 2 3 4 5 6 7 8 9 10

I am not getting how my program is giving wrong answer for some test case#12.
Can someone help pls

[code deleted]

Edited by author 21.06.2013 16:13

Edited by moderator 21.10.2013 20:39

use operator SEEKEOF

while seekeof do
begin
 read(x);
 .....
 .....
end;

package problemsPackage;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class IsenbayevNumbers {
    public static void main(String args[]) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        int numberOfTeams = Integer.parseInt(in.readLine());

        // Node containing Names of progers in team
        LinkedList<String[]> teamsList = new LinkedList<String[]>();

        LinkedList<String> uniqueParticipantsName = new LinkedList<String>();

        while (numberOfTeams != 0) {
            StringTokenizer tokenizer = new StringTokenizer(in.readLine(), " ");
            String members[] = new String[3];
            int i = 0;
            while (tokenizer.hasMoreTokens()) {
                members[i] = tokenizer.nextToken();
                addToList(uniqueParticipantsName, members[i]);
                i++;
            }
            teamsList.add(members);
            numberOfTeams--;
        }
        int array[][] = new int[uniqueParticipantsName.size()][uniqueParticipantsName.size()];
        fillArray(array,uniqueParticipantsName,teamsList);
        int participants = uniqueParticipantsName.size();
        int esenId = getIndex("Isenbaev", uniqueParticipantsName);

        int[] tentativeDistances = new int[participants];
        LinkedList<Integer>unvisitedNodes = new LinkedList<Integer>();

        for(int i=0;i<participants;i++){
            unvisitedNodes.add(i);
            if(i==esenId) tentativeDistances[i]=0;
            else tentativeDistances[i]=4000;
        }

        while(unvisitedNodes.size()!=0){
            int node  = getCurrentNode(tentativeDistances,unvisitedNodes);
            processNode(node,tentativeDistances,unvisitedNodes,array);
        }
        String names[] = new String[uniqueParticipantsName.size()];
        for(int i=0;i<uniqueParticipantsName.size();i++){
            names[i]=uniqueParticipantsName.get(i);
        }

        java.util.Arrays.sort(names);

        for(int i=0;i<names.length;i++){
            int index = getIndex(names[i], uniqueParticipantsName);
            int distance = tentativeDistances[index];
            if(distance!=4000)
                System.out.print(names[i]+" "+distance+"\n");
            else System.out.print(names[i]+" undefined\n");
        }
    }







    private static void processNode(int node, int[] tentativeDistances,
            LinkedList<Integer> unvisitedNodes, int[][] array) {

            LinkedList<Integer>neighbors = new LinkedList<Integer>();
            for(int j=0;j<array.length;j++){
                if(node!=j)
                    if(array[node][j]==1) neighbors.add(j);
            }

            for(int i=0;i<neighbors.size();i++){
                if(tentativeDistances[neighbors.get(i)]>tentativeDistances[node]+1)
                    tentativeDistances[neighbors.get(i)]=tentativeDistances[node]+1;
            }

            for(int i=0;i<unvisitedNodes.size();i++){
                if(unvisitedNodes.get(i)==node){
                    unvisitedNodes.remove(i);
                    break;
                }
            }
    }







    private static int getCurrentNode(int[] tentativeDistances,
            LinkedList<Integer> unvisitedNodes) {
        int minimum=10000;
        int index=0;
        for(int i=0;i<unvisitedNodes.size();i++){
            if(tentativeDistances[unvisitedNodes.get(i)]<minimum){
                minimum=tentativeDistances[unvisitedNodes.get(i)];
                index=unvisitedNodes.get(i);
            }
        }
        return index;
    }



    /**
     * Fill twodimensional array
     * @param array
     * @param uniqueParticipantsName
     * @param teamsList
     */
    private static void fillArray(int[][] array,
            LinkedList<String> uniqueParticipantsName,
            LinkedList<String[]> teamsList) {
        for(int i=0;i<uniqueParticipantsName.size();i++){
            String name = uniqueParticipantsName.get(i);
            for(int j=0;j<teamsList.size();j++){
                boolean exist=false;
                if(teamsList.get(j)[0].equalsIgnoreCase(name) || teamsList.get(j)[1].equalsIgnoreCase(name) || teamsList.get(j)[2].equalsIgnoreCase(name)) exist=true;
                if(exist){
                    if(!teamsList.get(j)[0].equalsIgnoreCase(name)) array[getIndex(name, uniqueParticipantsName)][getIndex(teamsList.get(j)[0], uniqueParticipantsName)]=1;
                    if(!teamsList.get(j)[1].equalsIgnoreCase(name)) array[getIndex(name, uniqueParticipantsName)][getIndex(teamsList.get(j)[1], uniqueParticipantsName)]=1;
                    if(!teamsList.get(j)[2].equalsIgnoreCase(name))    array[getIndex(name, uniqueParticipantsName)][getIndex(teamsList.get(j)[2], uniqueParticipantsName)]=1;
                }
            }
        }
    }


    /**
     * Index of name in list.
     * @param name
     * @param uniqueParticipantsName
     * @return
     */
    private static int getIndex(String name,LinkedList<String> uniqueParticipantsName){
        int index=0;
        for(int i=0;i<uniqueParticipantsName.size();i++){
            if(uniqueParticipantsName.get(i).equalsIgnoreCase(name)){
                index=i;
                break;
            }
        }
        return index;
    }


    /**
     * Store unique participant names into list
     * @param uniqueParticipantsName
     * @param string
     */
    private static void addToList(LinkedList<String> uniqueParticipantsName,
            String string) {
        boolean exist = false;
        for (int i = 0; i < uniqueParticipantsName.size(); i++) {
            if (uniqueParticipantsName.get(i).equalsIgnoreCase(string)) {
                exist = true;
                break;
            }
        }
        if (!exist)
            uniqueParticipantsName.add(string);
    }

}

Any suggestions please?
I'm a complete newbie at graph theory, so I guess this is something really stupid.

just change char mas_n[200000]={0};
into char mas_n[200005]={0};

))

Edited by author 26.07.2012 18:28

?

Edited by author 10.05.2012 01:08

Somebody.... Anybody... Help