Test:
15 5
10 12 10
10 12 10  0.01

3
4
5
95
95

96
6
97
97
98

99
99
99
97
99

What is answer?
My answer is:
Surface found at 4.
Bottom found at 5.
Channel 1: No object.
Channel 2: No object.

Why it is not correct?

"The interpreter must check EACH LINE of the main program searching for the following errors".

Edited by author 21.06.2013 02:12

I dont Know What the error mean and what the wrong with the code !! I appreciate if someone explain it for me =)


import java.io.File;
import java.io.FileNotFoundException;

import java.util.Scanner;
import java.util.Stack;

public class Telenum {

    public static int num(char s) {
        int y = 0;
        if ((s == 'i') || (s == 'j')) {
            y = 1;
        }
        if ((s == 'a') || (s == 'b') || (s == 'c')) {
            y = 2;
        }
        if ((s == 'd') || (s == 'e') || (s == 'f')) {
            y = 3;
        }
        if ((s == 'g') || (s == 'h')) {
            y = 4;
        }
        if ((s == 'k') || (s == 'l')) {
            y = 5;
        }
        if ((s == 'm') || (s == 'n')) {
            y = 6;
        }
        if ((s == 'p') || (s == 'r') || (s == 's')) {
            y = 7;
        }
        if ((s == 't') || (s == 'u') || (s == 'v')) {
            y = 8;
        }
        if ((s == 'w') || (s == 'x') || (s == 'y')) {
            y = 9;
        }
        if ((s == 'o') || (s == 'q') || (s == 'z')) {
            y = 0;
        }
        return y;

    }

    public static void main(String[] args) throws FileNotFoundException {

        Scanner sc = new Scanner(new File("pp"));
        String phonum = "", w1, w2 = null,l="", word = "";
        int wn = 0, numtr, phnum, flag;
        boolean f = true;
        char Takechar = ' ';
        Stack st1 = new Stack();
        Stack st2 = new Stack();
        while (f != false) {

            phonum = "" + sc.next();

            if (phonum.equals("-1")) {
                break;
            }
            wn = sc.nextInt();
if ((phonum.length()<=100)&&(wn<=50000)){
            for (int i = 0; i < wn; i++) {
                l=sc.next();
                if (l.length()<51){
                st1.add(l);}else{break;}
            }

            //transfare word to num
            for (int i = 0; i < st1.size(); i++) {
                word = (String) st1.get(i);


                flag = word.length();
                for (int j = 0; j < word.length(); j++) {
                    Takechar = word.charAt(j);
                    numtr = num(Takechar);


                    phnum = phonum.charAt(j) - '0';


                    if (numtr != phnum) {

                        break;
                    }

                    flag--;
                    if (flag == 0) {
                        st2.add(word);

                        w1 = phonum.substring(word.length());
                        phonum = "" + w1;
                    }
                }
            }
            if (st2.empty()) {
                System.out.println("no solution.");
                st1.clear();
            } else {

                for (int s = 0; s < st2.size(); s++) {
                    System.out.print(st2.get(s) + " ");

                }
                System.out.println();
                st2.clear();
                st1.clear();

            }

        }
    }
    }
}

import java.io.*;
import java.util.*;

public class A_B_Problem {
    public static void main(String[] args) throws Exception
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);

        int A = Integer.parseInt(reader.readLine()), B = Integer.parseInt(reader.readLine());
        out.println(A + B);

        out.flush();
    }
}

The limitations were changed from 180 to 1800.

I take WR!!! I don't know what s wrong!!!
---------------------------------MY PROGRAM-------------------------
var N,M,Y:longint;
    a:array[1..15]of byte;
    b:array[1..15]of longint;
    d:array[1..1000]of integer;
    h,x,l:integer;
    i,j,s:longint;
begin
  assign(input,'1110.dat');
  reset(input);
  readln(N,M,Y);
  x:=N;
  for i:=1 to 15 do
  begin
    a[i]:=x mod 2;
    x:=x div 2;
    if x = 0 then break;
  end;
  l:=i;
  for i:=0 to M-1 do
  begin
    b[1]:=i;
    for j:=2 to l do
    begin
      b[j]:=(b[j-1]*b[j-1]) mod M;
    end;
    s:=1;
    for j:=1 to l do if a[j]=1 then
    begin
      s:=(s*b[j]) mod M;
    end;
    if s = Y then
    begin
      inc(h);
      d[h]:=i;
    end;
  end;
  for i:=1 to h-1 do write(d[i],' ');
  if h<>0 then writeln(d[h]);
end.

Good afternoon, tell me please, what is wrong with the code? In Eclipse, I have everything working. Maybe I misunderstood condition. I wrote so that the program first asks how many numbers will be introduced, and then takes them.
-------------------------------------------
import java.text.DecimalFormat;
import java.text.DecimalFormatSymbols;
import java.util.*;
public class zadacha {

    public static void main(String[] args) {
        System.out.println("Сколько чисел вы хотите ввести?");
        Scanner scan = new Scanner(System.in);
        int temp = scan.nextInt();
        int arr[] = new int[temp];

        for (int i=0; i < temp; ++i){
            System.out.println("Введите число номер " +(i+1));
            arr[i] = scan.nextInt();
        }
        scan.close();
        DecimalFormatSymbols s = new DecimalFormatSymbols();
        s.setDecimalSeparator('.');
        DecimalFormat f = new DecimalFormat("#,##0.0000", s);
        for (int j = temp-1; j >= 0; j--){
            double z = Math.sqrt(arr[j]);
            System.out.println(f.format(z));
        }
    }
}

Подскажите, как сократить время работы программы?
[code deleted]

Edited by moderator 19.11.2019 23:42

const n=500;
var a:array[1..n]of string;
    i,j,k,l,m,rk,v,t,z,pus:longint;
    sum,ss,zz:string;
function mmm(p:longint):longint;
  begin
  v:=1;
    while ((v+1)*(v+2)) div 2<=p do v:=v+1;
  mmm:=v;
  end;
function plus(pluss1,pluss2:string):string; {only pozitive!!!}
  var plusi,pluscode,plusi1,plusi2,plusna,plusba:integer;
      pluss,plusss:string;
  begin
    if pluss1='' then pluss1:='0';
    if pluss2='' then pluss2:='0';
  pluss:='';
    while length(pluss1)<length(pluss2) do pluss1:='0'+pluss1;
    while length(pluss2)<length(pluss1) do pluss2:='0'+pluss2;
  plusna:=0; plusba:=0;
    for plusi:=length(pluss1) downto 1 do begin
    val(pluss1[plusi],plusi1,pluscode);
    val(pluss2[plusi],plusi2,pluscode);
    plusba:=(plusi1+plusi2+plusna) mod 10;
    plusna:=(plusi1+plusi2+plusna) div 10;
    str(plusba,plusss);
    pluss:=plusss+pluss;
    end;
    if plusna<>0 then begin
    str(plusna,plusss);
    pluss:=plusss+pluss;
    end;
  plus:=pluss;
  end;
begin
  readln(m);
    for i:=1 to m do a[i]:='1';
  sum:='0';
  rk:=mmm(m);
    for i:=2 to rk do begin {&#1031;&#1168;&#1072;&#1168;&#1038;&#174;&#1072; &#1031;&#174; k}
      for j:=1 to i do begin
      t:=i+j;
        while (t<(i+1)*i div 2)and(t<=m) do t:=t+i;
      ss:='0';
        while t<=m do begin
        zz:=a[t];
        a[t]:=plus(a[t-i],ss);
        t:=t+i;
        ss:=zz;
        end;
      end;
      if m<((i+1)*i div 2)-1 then pus:=m else pus:=((i+1)*i div 2)-1;
      for z:=1 to pus do a[z]:='0';
    sum:=plus(sum,a[m]);
    end;
  writeln(sum);
end.

This problem is just to troll you. I first thought of doing it using suffix array. Just read the question properly, it says 'any substring'?

I got AC http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=10161&courseid=0, but here I got WA1. Why???

My solution:
Cutting the array into blocks, so I can now update a segment with O(sqrt n) each query;
therefore, I can get the increase in O(1) while scanning each factor (at most 180 in total).
It is obvious that I should prepare all the factors for each number.

The complexity of the algorithm is O((sqrt(n) + 180) * m + 180 * n).

and .. I reduce a lot of modular and divide operations to get this AC. :P

Edited by author 25.10.2015 00:21

Edited by author 26.10.2015 23:24

using System;
class First {
    static void Main() {
        String[] ss = Console.ReadLine().Split();
        Console.WriteLine (int.Parse(ss[0]) + int.Parse((ss[1]));
            }

}

Anyone knows what's the problem with 2nd test? any ideas, please!!

do i misunderstand the meaning of this problem?
64631000033 is a prime,why it not the right answer of the sample?
please help me!thanks!

As far as I understand the tasks the 12 digit number should be prime.
Can it have leading zeros?
Can the number 646310000033 be a corect output for the sample input?
And how to format long long (was it "%I64" ?)?
 Rostislav

Edited by author 19.02.2005 15:48

Stuck at test case #12

Per reply in 2008, someone suggested testing with axayaaxa

I don't know whether this is the real #12. But I tried anyway.

My program answers a x aya axa

And another possible answer is axa y a axa

Both with 4 palindromes. Question says output any is correct.

Suggestion?

Thanks in advance!

import java.util.Scanner;

/**
 * Created by Coder on 05.12.2014.
 */
public class Copy1131_ {
    public static void main(String[] args) {
        Scanner x = new Scanner(System.in);
        int n = x.nextInt();
        int k = x.nextInt();
        int time = 0, i = 1;
        long s = 1;
        while (s < n) {
            if (i >= k) {
                s += k;
            } else {
                s += i++;
            }
            time++;
        }
        System.out.println(time);
    }
}

from math import sqrt
s=input().replace("\n"," ").split()
x=[sqrt(int(i)) for i in s]
x.reverse()
for i in  x:
    print("%.4f"%i)