Блог пользователя JulitoPeligro

Автор JulitoPeligro, история, 16 месяцев назад, По-английски
  • Проголосовать: нравится
  • -33
  • Проголосовать: не нравится

Автор JulitoPeligro, история, 20 месяцев назад, По-английски

Hi, the input file is so big that my vscode and sublime crashed and now I am not able to run it anywhere and get my output! Can anyone pls help me regarding this?

Полный текст и комментарии »

  • Проголосовать: нравится
  • -6
  • Проголосовать: не нравится

Автор JulitoPeligro, история, 20 месяцев назад, По-английски

FIXED

THE ISSUE HAS BEEN RESOLVED.

THANKS META!

Полный текст и комментарии »

  • Проголосовать: нравится
  • +8
  • Проголосовать: не нравится

Автор JulitoPeligro, история, 22 месяца назад, По-английски

Alice is a little girl, she lovest o eat cakes too much. There are N cakes in a line and an array of tastes is given to her, the i'th of them has taste[i]. She is allowed to choose at most K distinct subarrays of the array and eat all the cakes in the subarrays (the subarray can't intersect each other), such that the total taste of the cakes is exactly M. Since Alcie is very little, she wants to eat a minimum possible number of cakes such that the total taste is exactly M.

If possible, print minimum number of cakes alice can each such that the total taste is M otherwise print -1.

1 =< N <= 100 1 =< K <= N 1 =< M <= 600 1 =< TASTE[i] <= 100

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

Автор JulitoPeligro, история, 22 месяца назад, По-английски

I have multiple queries and queries are of 2 types and i also have empty stack like datastructure but i can remove any element in a stack in 0(1) .If given type 1 query i need to add that element into the stack. If given type 2 i need to remove the element which has highest frequency in the stack and if there are multiple elements with highest frequency i need to remove the element which is near to the top of stack. n<=10^5

Полный текст и комментарии »

  • Проголосовать: нравится
  • +3
  • Проголосовать: не нравится

Автор JulitoPeligro, история, 2 года назад, По-английски

On the top of the Crumpetty Tree The Quangle Wangle sat, But his face you could not see, On account of his Beaver Hat. For his Hat was a hundred and two feet wide, With ribbons and bibbons on every side And bells, and buttons, and...

Полный текст и комментарии »

  • Проголосовать: нравится
  • -18
  • Проголосовать: не нравится