Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

nicio9's blog

Suspicious hacking activity
By nicio9, history, 2 months ago, In English

The following submissions were both made by C.RONALDO.7., and both hacked by powershop9640: 224981068 224979936

Both submissions were pretty obviously set up to be hacked, if you look at them...

Is it breaking any rules? If not, could someone explain why the two users may be doing this? Just curious.

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

»
2 months ago, # |
  Vote: I like it +1 Vote: I do not like it

It doesn't matter, hacking after this contest will not give you any extra points:)

→ Reply
»
2 months ago, # |
← Rev. 2   Vote: I like it +12 Vote: I do not like it

Bro ، Hacking in this round does not give you extra points, so I was just trying to learn how to hack with my friend

→ Reply
»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

حراق انا صح ؟

→ Reply
»
2 months ago, # |
← Rev. 11   Vote: I like it 0 Vote: I do not like it

Any idea for the problem

A pair of integers (x, y) is perfect if both of the following conditions are met:

min(|x-y|, |x + y| )<= min([x], [y]) max(|x — y|, |x+y|)>= max(|x|,[y])

Given an array arr of length n find the number of perfect pairs (arr[i], arr[i]) whele 0 <= i < j < n Here min(a, b) is the minimum of a and b, max(a, b) is the maximum of a and b, and | x| is the absolute value of x.

Example: am = [2, 5, -3] In this example, n = 3 The possible pairs are (2,-3) and (5,-3).

1<=n<=2*1e5 -1e9<=arr[i]<=1e9

→ Reply