Maybe there is just small limits or not right topic??

My solution is O(n^2*logn) and works ~1.7 seconds. But some people got AC in .078. How?

I solved it with next algo:
I bruteforce all possible connections (if graph consists of several not connected parts) and then add some edges for Euler path with greedy.

Of course its right algo, but some complicated (i think).
Does anyone knows more simple one?

its not bbaaabb

Подскажите кто нибудь что я делаю неправильно?
import java.util.*;
import static java.lang.Math.*;

public class Sqrt{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        System.out.println(sqrt(in.nextInt()));
    }
}

The main method I followed was to first compare two of the arrays and extract the similar values in another array. I then compared that array with the third array, and updated the counter each time there was a match in eigenvalues. This method avoids comparing all the arrays together, and hence takes up less time. So in essence number of operations reduces to O(2*N^2) instead of O(N^3). However, more sophisticated algorithms like binary search are more effective. But still I include this method for people like myself, who are new to algorithms. Hope it helps someone.

Any hints for this problem?

var j,i,n:longint;
m:array of real;
begin
n:=1;
while not seekeof do
begin
read(j);
SetLength(m,n);
m[n]:=sqrt(j);
inc(n);
end;
for i:=n to 1 do
writeln(m[i]:0:4);
end.

I don't understand what's wrong in my program. Give me test 9 please

is there something invalid in test cases??

Help! What is in the test 26?

Forgot to sort the updates :)

I am getting WA in 22nd case! I cant find my mistake. Can someone help me ?

Please could anybody give me the test case?

Thanks

If you are using int(s[i]) to get the representation for any alphabet, you may need to enlarge your counting sort table and counting sort iteration limit. I thought 200 was enough for latin alphabets, but actually I tried several times and succeeded at about 1100. I don't even know why...

what is 34 test?

char s[16384] ;
unsigned n = 0;

 //  AC  0.001s with this code.
    for(int c = std::getc(stdin); c != EOF; c = std::getc(stdin))
       s[n++] = c;

// and AC 0.015s with   n = fread(s,1,sizeof(s)-1,stdin);  code.

// I'm wonder that  the std::getc faster than fread!!

System.out.printf("%.6f\n",(t+s+ss[i])/2d);