LeCalin's blog

By LeCalin, history, 6 years ago, In English

Hello Codeforces.

Today I read about Fenwick tree. Correctly update in range and find sum in range. Update in range, it means adding value to the range. Can we set value in range and find sum in range with fenwick tree?

Sorry for my English.

Full text and comments »

  • Vote: I like it
  • -8
  • Vote: I do not like it

By LeCalin, history, 6 years ago, In English

Hello Codeforces.

Hello MikeMirzayanov, I want to change my handle again. Please I have one mistake. Mistake. Give to all one more gift please. One more chance to change handle.

Full text and comments »

  • Vote: I like it
  • -12
  • Vote: I do not like it

By LeCalin, history, 6 years ago, In English

Hello Codeforces.

Today I sumbit almost same 2 codes. But first is WA, second is AC. I don't understand why.

1 code, 2 code.

Why first is WA?

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By LeCalin, history, 6 years ago, In English

Hello Codeforces comunity )

Today I want to open a new challenge, challenge " LIKE IT ".

Condition of challenge is easy:

1) Like all of my blogs.

2) Like all of my comments.

3) That's all.

I give challenge to _VanGogh_, wish_me, EngineerX.

I want to everybody's Contribution be normal.

P.S. Sorry for my English.

Full text and comments »

  • Vote: I like it
  • -39
  • Vote: I do not like it

By LeCalin, history, 6 years ago, In English

Hello Codeforces .

Plase help.

Given n, array a(a1, a2,,, an). n, a[i] <= 100.

How can i make dp[i][j].

Corectly dp[i][j] = 1, if we can get sum j without a[i].

Full text and comments »

  • Vote: I like it
  • +1
  • Vote: I do not like it