ENG  RUSTimus Online Judge
Online Judge
Задачи
Авторы
Соревнования
О системе
Часто задаваемые вопросы
Новости сайта
Форум
Ссылки
Архив задач
Отправить на проверку
Состояние проверки
Руководство
Регистрация
Исправить данные
Рейтинг авторов
Текущее соревнование
Расписание
Прошедшие соревнования
Правила
вернуться в форум

Обсуждение задачи 1306. Медиана последовательности

This problem is not solvable in C#
Послано Hikmat Ahmedov 31 авг 2012 00:05
Guys, apparently this problem is not solvable in C#. Even it is written in FAQ:
“It’s not recommended to use Java and C# for solving following problems: 1220, 1275, 1306.”
Just creating half of the required array length with int gives Memory Limit Error
Like
using System;
public class Program
{
    private static void Main()
    {
        int[] nn=new int[125000];
    }
}
This code gives Memory Limit Error.
But some people solved in Java.
To whom who solved in Java, what was the array length in your case?
Does it give Memory Limit Error in Java  creating 125000 elements in int type ?
So should I learn C++?
Is it worth it?
Thanks for suggestions.
Re: This problem is not solvable in C#
Послано Sandro (USU) 31 авг 2012 16:07
Re: This problem is not solvable in C#
Послано Buxoro 2 сен 2012 16:13


Edited by author 02.09.2012 16:14
Re: This problem is not solvable in C#
Послано Hikmat Ahmedov 2 сен 2012 16:16
To whom who solved in Java or C#, Could you please send me the algorithm or solution to fakel2005@gmail.com

Thanks a lot
To Admins: This problem is not solvable in C#
Послано Hikmat Ahmedov 2 сен 2012 18:23
I’m sorry I’m obsessed with this problem

using System;
public class Program
{
    private static void Main()
    {

    }
}

Why this code gives me “Memory Limit Exceeded?”
I’m not doing anything here.
How is it even possible then writing something in it and expecting not to get MLE?
I have a question, if you submit those codes who solved in C# NOW, will it give AC NOW as before?
What I mean is maybe C# compiler which is being used now consumes too much memory?

Thanks,