I always WA at TEST9,who can give me a test like test9 ? other test in discuss were all used.It's right.

What is the format of output, blank spaces before number?

I have wa8 when I used float numbers, when I changed it to double I get ac.

import java.util.Scanner;
public class Summa {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
Scanner scan=new Scanner( System.in);
System.out.println("Введите значение a");
int a;
a=scan.nextInt();
System.out.println("Введите значение b");
int b;
b=scan.nextInt();

System.out.println(" a + b = " + (a + b));

    }

}

I don't understand what's wrong? In my IDEA all works!

import java.io.IOException;
import java.util.Scanner;


public class summa {
    public static void main(String[] args) throws IOException {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int[] mas = new int[n*n];
        if(n!= 0) {
            for (int i = 0; i < n * n; i++) {
                mas[i]=s.nextInt();
            }
            if(mas.length>1) {
                qSort(mas, 0, mas.length-1);
                for (int i = 0; i < mas.length; i++) {
                    System.out.print(mas[i] + " ");
                }
            }else System.out.println(mas[0]);
        }else System.out.println("0 элемнтов");
    }

    public static void qSort(int[] A, int low, int high) {
        int i = low;
        int j = high;
        int x = A[(low+high)/2];
        do {
            while(A[i] < x) ++i;
            while(A[j] > x) --j;
            if(i <= j){
                int temp = A[i];
                A[i] = A[j];
                A[j] = temp;
                i ++ ; j --;
            }
        } while(i <= j);

        if(low < j) qSort(A, low, j);
        if(i < high) qSort(A, i, high);
    }
}

Edited by author 02.10.2014 20:36

Edited by author 02.10.2014 20:36

Any suggestions of the test? I rewrote solution from numerical to purely geometric, but still WA #10 and I can't find the reason.

Can anyone provide with more tests? especially Test#3 ?

It's not the easiest problem and I don't know good solution, but if I was on the olympiad and would have to solve the problem, I would just precalculate the answer.

Why "Time limit exceeded" ???

Edited by author 28.09.2014 09:03

Use G++ 4.7.2. G++ 4.7.2 C11 works wrong.

import java.util.Scanner;
public class Acm {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int[] a = new int[n];
        int[] b = new int[n];
        for(int j = 0; j < n; j++){
                Scanner u = new Scanner(System.in);
                   a[j] = s.nextInt();
            b[j] = s.nextInt();
        }

        for(int p = 100; p >= 0; p--){
            for(int q = 0; q < n; q++){
                if(b[q] == p){
                    System.out.println(a[q] + " " + b[q]);
                }
            }
        }
    }
}

Edited by author 26.09.2014 23:34

hi,i know! there are some solution in this discussion that is a dangerous thing for someone that want to think more... so i say something about this problem for only hint..

for solving this problem this is better to check 2 or 3 example then consider a general case with n as input then try to simulate the answer and in the final step code it.

be successful...

I tried everything before I realized that my program should accept numbers like 1.e+1 even if there is no digits after '.'. Weird! I hope this information would be helpful to someone.

first the person goes to (2,2) from (1,1) +141 then (3,2) +100 so why not 241?

My algorithm is
1. sort wait time min -> max
2. variable time declared to add total time
3. add minimal wait time and exam time to var(time)
4. add exam time everybody
5. if time > freetime print time-freetime
   else print 0
I think my algorithm is right ,but I got WA #7
Could you help me plz?

This problem seems hard but the algo is so simple.
if there n pedestals then the m is always 2 * n - 1;

if you just at i-pedestal and original is at jth, then
1. if abs(i - j) - even you can catch it if you just walk towards it just by one.
2. if abs(i - j) - odd then you just two times take the i-th pedestal to make the difference even and go to 1.

For doing above algo just start from the 1st pedestal to n
and take n again then go back to the 2nd pedestal

Good luck



Edited by author 17.10.2010 13:47

import java.util.*;
import java.text.*;

public class Test{
    public static void main(String args[]){
        Scanner in = new Scanner(System.in);

        String s;

        s = in.nextLine();

        char c;

        int i = 0;

        Double [] mass = new Double [256];

        String st = "";

        for(int j = 0; j < s.length(); j++){
            c = s.charAt(j);

            if(c == ' ' || j == s.length() - 1){
                //реализация вывода корня
                mass[255 - i] = Double.valueOf(st);

                i++;

                st = "";
            }

            if(c != ' ')
                st += c;
        }

                DecimalFormatSymbols symbol = new DecimalFormatSymbols();
                symbol.setDecimalSeparator('.');
                DecimalFormat f = new DecimalFormat("#,##0.0000", symbol);

        for(Double d: mass){
            if(d != null){
                System.out.println(f.format(Math.sqrt(d)));
            }

        }
   }
}

Edited by author 25.09.2014 02:00

When probability from 0~9 different, how to calculate the expected number???

Thank very much!!

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class hgg {

    /**
     * @param args
     */
    public static ArrayList<concho> listcho = new ArrayList<concho>();
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int a = sc.nextInt();
        for (int i = 0; i < a; i++) {
            listcho.add(new concho(sc.nextInt(),sc.nextInt()));
        }
        Collections.sort(listcho, new Comparator<concho>() {

            public int compare(concho o1, concho o2) {
                // TODO Auto-generated method stub
                if(o1.kg<o2.kg) return 1;
                if(o1.kg>o2.kg) return -1;
                return 0;
            }
        });
        for (concho item : listcho) {
            System.out.println(item.tuoi+" "+item.kg);
        }
    }
    public static class concho
    {
        int tuoi;
        int kg;
        public concho(int t, int k)
        {
            tuoi=t; kg=k;
        }
    }

}