Discussion @ 1537. Ents @ Timus Online Judge

So Sui Ming hint // Problem 1537. Ents 4 Mar 2024 10:59

[LG]_NAPSTER I got WA#15... Because I think that my algorithm is right... [4] // Problem 1537. Ents 29 Nov 2007 17:55

Dmitriy Black crash!! please help!! [2] // Problem 1537. Ents 2 Jan 2012 04:05

my program works fine on my computer. it even gives right answers :) But when i submit it has crash on 20 test. I cannot understant why. Please help!!

import java.io.*;
import java.util.Arrays;
public class Task_1537 {
    public static void main(String[] args) throws Exception{
        StreamTokenizer st = new StreamTokenizer(new InputStreamReader(System.in));
        st.nextToken();
        int k = (int) st.nval;
        st.nextToken();
        int p = (int) st.nval;

        int t[] = new int[k+1];
        t[2] = 1 % p;
        for (int i = 3; i <= k; i++){
            if ((i & 1) == 1)
                t[i] = t[i-1];
            else t[i] = t[i-1] + t[i/2];
            if (t[i] >= p)
                t[i] = t[i] - p;
        }
        //System.out.println(Arrays.toString(t));
        System.out.println(t[k]);
    }

}

Sunnat accepted 0.078 s c++ 0.218 s JAVA [1] // Problem 1537. Ents 15 Apr 2012 15:08

// JAVA :
import java.io.*;
import java.util.Arrays;
public class Task_1537 {
    public static void main(String[] args) throws Exception{
        StreamTokenizer st = new StreamTokenizer(new InputStreamReader(System.in));
        st.nextToken();
        int k = (int) st.nval;
        st.nextToken();
        int p = (int) st.nval;
        if(k<2)System.out.println(0);
        else {
        int t[] = new int[k+1];
        t[2] = 1 % p;
        for (int i = 3; i <= k; i++){
            if ((i & 1) == 1)
                t[i] = t[i-1];
            else t[i] = t[i-1] + t[i/2];
            if (t[i] >= p)
                t[i] = t[i] - p;
        }
        //System.out.println(Arrays.toString(t));
        System.out.println(t[k]);
       }
    }

}

// C++ :

#include<stdio.h>
int main(){
    int k,p,i;
    int *t;
    scanf("%i%i",&k,&p);
    if(k<2)printf("0");
    else {
    t = new int[k+3];
        t[2] = 1 % p;
        for (i = 3; i <= k; i++){
            if ((i & 1) == 1)
                t[i] = t[i-1];
            else t[i] = t[i-1] + t[i/2];
            if (t[i] >= p)
                t[i] = t[i] - p;
        }
        printf("%i",t[k]);
    }
}

Sunnat Re: accepted 0.156 s paskall // Problem 1537. Ents 15 Apr 2012 18:06

CONST
MaxN = 10000000;

VAR
K, P : Longint;
A    : Array [0 .. MaxN] of Longint;

PROCEDURE Solve;
Var
i : Longint;
   Begin
    A[1] := 0;
    A[2] := 1 mod P;
     for i := 3 to K do
      if i mod 2 = 0 then
        A[i] := (A[i - 1] + A[i div 2]) mod P
          else
        A[i] := A[i - 1] mod P;
   End;

PROCEDURE Run;
   Begin
    Read(K, P);
    if K<2 then WriteLn(0)
    else begin
    Solve;
    WriteLn(A[K]);
    end;
   End;

BEGIN
Run;
END.

Mikhail Svyatlovskiy I got AC!! // Problem 1537. Ents 7 Feb 2012 02:20

Elday delete // Problem 1537. Ents 13 Jun 2011 18:55

AiD WA 20 [2] // Problem 1537. Ents 8 May 2007 18:30

radio please help, crash... stack overflow, here's code: [1] // Problem 1537. Ents 21 May 2008 05:33

AlMag Damn, Always WA#15 (-) [11] // Problem 1537. Ents 3 Mar 2007 13:38

CHIDEMYAN SERGEY WhY WA#16???????????????!!!!!!!! I think it true solution [12] // Problem 1537. Ents 15 Mar 2007 21:57

Duzhy Igor WA#8 [5] // Problem 1537. Ents 5 Mar 2007 12:03

shilp what should be the answer for 1 10 [1] // Problem 1537. Ents 3 Mar 2007 14:22

Discussion of Problem 1537. Ents