what if k=7?
Is l=2?

Just list all of cases like x>=y>=c or y>=x>=c
and you'll understand

//1152
#include <iostream>
#include <vector>
#include <cmath>


using namespace std;

int main() {
    int n, x0, y0, index0;
    cin >> n;
    if (n == 2){
        cout << 1 + ' ' + 2;
    } else {
        vector<vector<int>> p(n, vector<int>(2)); // [x, y]
        vector<double> k(n);
        for (int i = 0; i < n; i++) {
            cin >> p[i][0] >> p[i][1];
        }

        x0 = y0 = 2147483647;
        for (int i = 0; i < n; i++) {
            if (p[i][0] < x0 ||p[i][0] == x0 && p[i][1] < y0){
                x0 = p[i][0];
                y0 = p[i][1];
                index0 = i;
                }
        }

        for (int i = 0; i < n; i++) { //y = kx + m
            if (i == index0) {
                k[i] = 9223372036854775807;
            } else {
                if (x0 == p[i][0]) {
                    k[i] = 9223372036854775807;
                } else {
                    k[i] = (p[i][1] - y0) / (p[i][0] - x0);
                }
            }
        }


        vector<int> d(n);
        for (int i = 0; i < n; i++) {
            d[i] = i;
        }

        double tempD;
        int tempI;
        for (int i = n - 1; i >= 0; i--) {
            for (int j = 0; j < i; j++) {
                if (k[j + 1] < k[j]) {

                    tempD = k[j + 1];
                    k[j + 1] = k[j];
                    k[j] = tempD;

                    tempI = d[j + 1];
                    d[j + 1] = d[j];
                    d[j] = tempI;

                }
            }
        }
        cout << index0 + 1 << ' ' << d[n / 2  -1] + 1;
    }
return 0;
}

I wrote program on Python 3, but second test is wrong for me. Why? I need a hint. Maybe, you can wrote test for my program?

Idea:
1. sort length descending
2. take first that smaller SUM in row
3. reduce SUM and colored ship
4. take next
5. finally for SUM if they == 0 -> go to next row


My solution:

[n, m] = [ int(x) for x in input().split() ]
a = []
for i in range(n):
    a.append(int(input()))
b = []
for i in range(m):
    b.append(int(input()))
a.sort(reverse=True)
color = [-1 for x in range(n)]

i = 0
while i < m:
    s = b[i]
    z = 0
    while z < n:
        aa = []
        j = z
        while s > 0:
            while j < n and a[j] > s :
                j += 1
            if j >= n:
                for ee in aa:
                    s += a[ee]
                    color[ee] = -1
                aa = []
                break
            elif color[j] != -1:
                j += 1
            else:
                s = s - a[j]
                aa.append(j)
                color[j] = i
        z += 1
        if s == 0:
            break
    i += 1
for i in range(m):
    aa = []
    cnt = 0
    for j in range(n):
        if color[j] == i:
            aa.append(a[j])
            cnt += 1
    print(cnt)
    aa.sort(reverse=True)
    ab = [str(x) for x in aa]
    ss = " ".join(ab)
    print(ss)

The statement describes the precision as 10^-9, but in the second example I see "1.41421356237309" This number has 14 digits behind decimal point. I tried submitting answers with precision 9, 14 and 16. They all WA#1 even though my calculations have to be correct. Does someone know what's the correct precision?

Edited by author 14.04.2016 15:20

Edited by author 14.04.2016 15:20

var
    a,b,c,d,e,f,g,h : real
begin
    read(a,b,c,d);
    e := sqrt(a);
    f := sqrt(b);
    g := sqrt(c);
    h := sqrt(d);
    writeln(h:0:4);
    writeln(g:0:4);
    writeln(f:0:4);
    writeln(e:0:4);
end.
why is my answer wrong?

For those who using prime numbers! Search biggest prime number that <= max!!!
NOT first prime number that >=min !!

У меня получилось вот что
I have this:
 > http://ideone.com/8CHWDd

Почему проверка считает что ответ неверен
Why it's wrong?

test 11.please give me some test.thx!

My solution is O(n) and I can prove it.
All tests from forum were successfully passed.
Solution's body is 31 strings (without var declaratoins, etc.) and I am looking for mistakes more than an hour. So I suppose, there is no bug..(

But I have WA5.
Mabe some incorrect input ? Or some thing I didn't notice ?
If u have got any idea or maybe test, please, help..

Edited by author 14.08.2009 05:39

Gimme some data, please

#include<stdio.h>
#include<math.h>
double str[300000];
using namespace std;
int main()
{
    double a;
    int w=0;
    while(~scanf("%lf",&str[w]))
        w++;
    for(int i=w-1;i>=0;i--)
        printf("%.6f\n",sqrt(str[i]));
    return 0;
}
//Don't use cin or cout
//str[N],Nshould>=262144

Why this answer for test 1 gets WA

2 3
1 2
3 4 5

?????????

algorithm is just
print on
1 ... n
then n+1 ... n+m

what's wroung with this???????????????

Что пивело Гоголя к смерти?



Edited by author 11.04.2016 08:03

что привело Гоголя к смерти?

Edited by author 11.04.2016 08:03

Use dynamic programming

Задача простая. Но вопрос таков:
Из правил сайта я понял, что входные данные вводятся только и только через консоль, не считываются с файла.
Если это так, то как определить что входные данные уже вбиты??
Из задания понятно, что вводятся целые числа не больше 10 в степени 18, до каких пор будут вводится входные данные? есть какой нибудь стоп кондишн?