Please do something with TL on java applications. My usual programs gets TL too often. For example, normal solution in 1222 using DP and BigInteger has failed because of this problem. I had to use precalculations, but it's not so clear a normal solutions.

First make the sum to determinate MIN and MAX money the teacher wanted to give. Then divide it by the price of one ticket. Do it in this order. Hope I helped! :)

read(x,y);
readln(e);
t:=0;
if ((abs (x-sin(sqrt(t)))<=e) and (abs(y-cos(t))<=e))
 then begin  write('0') ; exit; end;
f1:=true;

f2:=true;

repeat
t:=t+e
until (abs(sin(sqrt(t))-x)<=e) and (abs(cos(t)-y)<=e)  or (t>10e12) ;

if t>10e12 then write ('FAIL') else write(t:0:1);

Nothing special to get AC, just think a little and write about 20 strings of code.

http://hastebin.com/luqeribeha.avrasm -my code
no ideas why :(

program ex;
type
z=array [1..4002] of longint;

var n,n1,n2,i,t,k,s,j,l:longint; a,a1,a2,r:z;
begin
readln(n);
for i:=1 to n do read(a[i]);
readln(n1);
for i:=1 to n1 do read(a1[i]);
readln(n2);
for i:=1 to n2 do read(a2[i]);

j:=1;
i:=1;
k:=0;
repeat
if a1[j]>a[i] then i:=i+1;
if a1[j]<a[i] then j:=j+1;
if a1[j]=a[i] then begin
k:=k+1;
r[k]:=a1[j];
j:=j+1;

end;
until (i>=n) or (j>=n2) ;
i:=1;
j:=1;
s:=0;
repeat
if r[j]>a2[i] then i:=i+1;
if r[j]<a2[i] then j:=j+1;
if r[j]=a2[i] then begin
s:=s+1;
j:=j+1;

 end;
until (i>=n2) or (j>=k) ;
write(s);

end.

Gimme The 10 Test pls!!!

Hi
I think this Problem is very very Nice
Easy to understand Hard 2 solve!
i got AC with all theoric methods:

[code deleted]

Sincrely
Aidin_n7

Edited by moderator 20.11.2019 23:24

Send my solutions in Java.
And get "Runtime error (non-zero exit code)".

I decide to check an already accepted solution.
Sent the same solution that was accepted 4 days ago and it returned "Runtime error (non-zero exit code)".

What's wrong? Any changes on server for Java in last 4 days?

P.S. Even with test problem 1000 from here: http://acm.timus.ru/help.aspx?topic=java

Edited by author 08.01.2015 11:52

Edited by author 08.01.2015 15:24

Input:

"Hello world

"Next paragraph" and this works " \par
last one
\endinput

Output:

Hello world

``Next paragraph'' and this works  \par
last one
\endinput

#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

int main()
{
    double n;
    vector<double> v;


    int a = 1;
    while (a==1)
    {
        cin >> n;
        v.push_back(n);
        if (cin.peek() == '\n')
            a = 0;
    }

    for (int i = 0; i <= v.size() - 1; i++)
    {
        //cout << sqrt(v[v.size() - 1 - i]) << endl;
        printf("%.4f\n", sqrt(v[v.size() - 1 - i]));


    }

    cout << endl;

}

8888  -->  16

Edited by author 08.01.2015 10:09

Edited by author 08.01.2015 10:09

n = 0 ?
Может такое быть ?

I'm repeatedly getting WA in Test#3.
I converted all weights to negative and used Bellman-Ford. I also checked if the destination is reachable from the source. Nevertheless, I'm getting WA in the same test case. Could someone give me test case #3?

I got WA#1 :(
What's wrong bros?

===============================================================
static int speakerCount = 0;

    static void solve() throws IOException {
        final int N = nextInt();

        // graph[i][j] = true: i-th is parent of j-th
        final boolean[][] graph = new boolean[N + 1][N + 1];

        for (int line = 1; line <= N; line++) {
            int parent = nextInt();

            if (parent == 0) {
                continue;
            }

            int child = nextInt();
            while (0 < child) {
                graph[parent][child] = true;

                child = nextInt();
            }
        }

        StringBuilder speakerList = new StringBuilder();
        final boolean[] visitedNodes = new boolean[N + 1];

        while (speakerCount < N) {
            for (int node = 1; node <= N; node++) {
                if (!visitedNodes[node]) {
                    visit(node, visitedNodes, speakerList, graph);

                    break;
                }
            }
        }

        out.println(speakerList.toString().trim());
    }

    private static void visit(int node, boolean[] visitedNodes,
            StringBuilder speakerList, boolean[][] graph) {

        // Stop if marked
        if (visitedNodes[node]) {
            return;
        }

        // Marked
        visitedNodes[node] = true;

        // Visit each child
        for (int child = 1; child < visitedNodes.length; child++) {
            if (graph[node][child]) {
                visit(child, visitedNodes, speakerList, graph);
            }
        }

        speakerList.insert(0, node + " ");
        speakerCount++;
    }

Edited by author 23.05.2014 15:48

Contains empty sequence.

can anyone help me with that?

My code:

[code deleted]

Edited by moderator 20.06.2020 16:24

What is the 11th test about?
Two my solutions (on pascal and c++) got wa11 and I really don't know why.

My code got WA for #27. After checking forever for errors, I edited my comparison for my set so that if two distances are equal, the distance with the bigger key will come first as a last desperation. After submitting this, I got AC.
I think this should be stated in the problem statement, because it affects the solutions.
For those that don't understand what I'm talking about:

Input:
2
1 1
1 1
1
1
(Before) WA 27
Output:
1
(After) AC
Output:
2