Datasets:
id
stringlengths 6
117
| description
stringlengths 29
13k
| code
stringlengths 9
465k
| language
class label 4
classes | test_samples
sequence | source
class label 5
classes |
|---|---|---|---|---|---|
brcktsrm_0 | Problem description.
Vipul is a hardworking super-hero who maintains the bracket ratio of all the strings in the world. Recently he indulged himself in saving the string population so much that he lost his ability for checking brackets (luckily, not permanently ).Being his super-hero friend help him in his time of hardship.
Input
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
The first line of each test case contains a single string S denoting the string to be checked.
Output
For each test case, output a single line printing "YES" or "NO" (without " " and in uppercase only) , denoting if the brackets in the given string is balanced or not .
Constraints
1 ≤ T ≤ 10
1 ≤ length of S ≤ 60
Example
Input:
3
((()))
(())()
()(()
Output:
YES
YES
NO
Explanation
Example is self-explanatory. | for _ in range(input()):
try:
eval(raw_input())
print 'YES'
except TypeError:
print 'YES'
except:
print 'NO' | 1Python2
| {
"input": [
"3\n((()))\n(())()\n()(()",
"3\n((()))\n(())()\n()())",
"3\n((()()\n(())()\n()(()",
"3\n((()))\n(())))\n()())",
"3\n)))(((\n(())))\n()())",
"3\n((()))\n(())()\n))(((",
"3\n((()()\n(())()\n()(((",
"3\n((()))\n(())()\n()()(",
"3\n((()()\n'())()\n()(((",
"3\n)))(((\n(())))\n()(*)",
"3\n)(()()\n'())()\n()(((",
"3\n))*(((\n(())))\n()(*)",
"3\n)()(()\n'())()\n()(((",
"3\n)*)(((\n(())))\n()(*)",
"3\n)()())\n'())()\n()(((",
"3\n)*)(((\n(()())\n()(*)",
"3\n)()())\n'()())\n()(((",
"3\n)*)(((\n(()())\n))(*(",
"3\n)()()(\n'()())\n()(((",
"3\n)()(*(\n(()())\n))(*(",
"3\n)()()(\n))()('\n()(((",
"3\n)()(*(\n(())))\n))(*(",
"3\n)')()(\n))()('\n()(((",
"3\n)()(*(\n(())))\n))()(",
"3\n)')()(\n)(())'\n()(((",
"3\n)()(*(\n(())))\n()())",
"3\n))'()(\n)(())'\n()(((",
"3\n)('()(\n)(())'\n()(((",
"3\n)('()(\n)('))(\n()(((",
"3\n)('()(\n)('))(\n')(((",
"3\n)('()(\n())'()\n')(((",
"3\n)('()(\n)())'(\n')(((",
"3\n)('()(\n)())'(\n((()'",
"3\n)('()(\n))))'(\n((()'",
"3\n((()))\n)())()\n()(()",
"3\n)))(((\n(())()\n()())",
"3\n((()()\n(())()\n()(')",
"3\n)))(((\n(())()\n))(((",
"3\n)((())\n(())))\n()())",
"3\n((()()\n(())()\n((()(",
"3\n((()))\n(())()\n')()(",
"3\n)))(()\n(())))\n()())",
"3\n((()()\n&())()\n()(((",
"3\n)))(((\n))))((\n()(*)",
"3\n)(()()\n'())()\n(((((",
"3\n))*(((\n(())))\n)*()(",
"3\n)()(()\n'())((\n()(((",
"3\n)*)(((\n(())))\n*)(()",
"3\n)()())\n'())()\n()('(",
"3\n)*)(((\n))()((\n()(*)",
"3\n)')())\n'()())\n()(((",
"3\n)()()(\n'()())\n()()(",
"3\n)()(*(\n(()())\n))(*)",
"3\n)()()(\n))()('\n((()(",
"3\n)')')(\n))()('\n()(((",
"3\n)()(*(\n(())))\n)())(",
"3\n()()')\n)(())'\n()(((",
"3\n(*)(()\n(())))\n()())",
"3\n))'()(\n'))(()\n()(((",
"3\n)('(((\n)(())'\n()(((",
"3\n)('()(\n((')))\n()(((",
"3\n)('()(\n)('))(\n')()(",
"3\n)('()(\n())'()\n((()'",
"3\n)('()(\n)())((\n')(((",
"3\n)('()(\n)())'(\n((()(",
"3\n()('))\n))))'(\n((()'",
"3\n((())(\n)())()\n()(()",
"3\n)))(((\n)())()\n()())",
"3\n((()()\n(()(()\n()(')",
"3\n)))(((\n(())()\n*)(((",
"3\n)((())\n'())))\n()())",
"3\n((()()\n(())()\n()()(",
"3\n((()))\n)()(()\n')()(",
"3\n)))((*\n(())))\n()())",
"3\n()((()\n&())()\n()(((",
"3\n)))(((\n))))((\n(*(*)",
"3\n)(()()\n)())('\n(((((",
"3\n))*(((\n()()))\n)*()(",
"3\n)()())\n'())()\n()(''",
"3\n)')())\n'()())\n((()(",
"3\n)()()(\n&()())\n()()(",
"3\n)()(*(\n(()())\n*)(*)",
"3\n)()()(\n))()('\n(())(",
"3\n)')')(\n))()('\n()(('",
"3\n)()(*(\n(())))\n)()((",
"3\n)')())\n)(())'\n()(((",
"3\n)*)(()\n(())))\n()())",
"3\n))'()(\n'))((*\n()(((",
"3\n)('(((\n)(())'\n()(('",
"3\n)('()(\n((')))\n(((((",
"3\n)('()'\n)('))(\n')()(",
"3\n)('()(\n)())((\n')('(",
"3\n)('()(\n'()))(\n((()(",
"3\n()('))\n('))))\n((()'",
"3\n((())(\n*())()\n()(()",
"3\n)))(((\n)())()\n((())",
"3\n((()))\n(())()\n*)(((",
"3\n)((())\n'())))\n()'))",
"3\n((()()\n(())()\n')()(",
"3\n((()))\n)()(()\n()()'",
"3\n)))((*\n(())))\n))())"
],
"output": [
"YES\nYES\nNO",
"YES\nYES\nNO\n",
"NO\nYES\nNO\n",
"YES\nNO\nNO\n",
"NO\nNO\nNO\n",
"YES\nYES\nNO\n",
"NO\nYES\nNO\n",
"YES\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"YES\nNO\nNO\n",
"NO\nYES\nNO\n",
"NO\nYES\nNO\n",
"NO\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"YES\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"YES\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\n",
"YES\nYES\nNO\n",
"NO\nNO\nNO\n",
"NO\nYES\nNO\n",
"YES\nNO\nNO\n",
"NO\nNO\nNO\n"
]
} | 1CODECHEF
|
comm3_1 | The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef all carry two-way transceivers so they can stay in constant contact. Of course, these transceivers have a limited range so if two are too far apart, they cannot communicate directly.
The Chef invested in top-of-the-line transceivers which have a few advanced features. One is that even if two people cannot talk directly because they are out of range, if there is another transceiver that is close enough to both, then the two transceivers can still communicate with each other using the third transceiver as an intermediate device.
There has been a minor emergency in the Chef's restaurant
and he needs to communicate with both the head server and the sous-chef right away. Help the Chef determine if it is possible for all three people to communicate with each other, even if two must communicate through the third because they are too far apart.
Input
The first line contains a single positive integer T ≤ 100 indicating the number of test cases to follow. The first line of each test case contains a positive integer R ≤ 1,000 indicating that two transceivers can communicate directly without an intermediate transceiver if they are at most R meters away from each other. The remaining three lines of the test case describe the current locations of the Chef, the head server, and the sous-chef, respectively. Each such line contains two integers X,Y (at most 10,000 in absolute value) indicating that the respective person is located at position X,Y.
Output
For each test case you are to output a single line containing a single string. If it is possible for all three to communicate then you should output "yes". Otherwise, you should output "no".
To be clear, we say that two transceivers are close enough to communicate directly if the length of the straight line connecting their X,Y coordinates is at most R.
Example
Input:
3
1
0 1
0 0
1 0
2
0 1
0 0
1 0
2
0 0
0 2
2 1
Output:
yes
yes
no | import math
no_of_testcases = int(input())
for each in range(no_of_testcases):
dist = int(input())
point_1 = map(int,raw_input().split())
point_2 = map(int,raw_input().split())
point_3 = map(int,raw_input().split())
point_12 =math.sqrt( math.pow((point_1[0] -point_2[0]),2) + math.pow((point_1[1] -point_2[1]),2))
point_23 =math.sqrt( math.pow((point_2[0] -point_3[0]),2) + math.pow((point_2[1] -point_3[1]),2))
point_31 =math.sqrt( math.pow((point_3[0] -point_1[0]),2) + math.pow((point_3[1] -point_1[1]),2))
count =0
if point_12 <= dist:
count =count+1
if point_23 <= dist:
count =count+1
if point_31 <= dist:
count =count+1
if count >=2:
print "yes"
else:
print "no" | 1Python2
| {
"input": [
"3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 -1\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n2 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 0\n2\n2 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 -1\n1\n2 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -2\n-1 -1\n1 0\n2\n-1 0\n-1 0\n1 -1\n1\n1 -1\n1 2\n1 1",
"3\n2\n0 1\n0 -1\n2 -1\n1\n2 0\n0 -1\n1 -2\n2\n0 0\n1 2\n1 2",
"3\n2\n0 0\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n0 0\n1 2\n2 1",
"3\n2\n0 -1\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n0 0\n1 2\n2 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n2 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n0 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 0\n0 0\n1 -1\n2\n1 0\n1 2\n0 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 0\n0 0\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 0\n0 -1\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n1 0\n0 -1\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n1\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 0\n2\n1 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 0\n1\n2 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 0\n1\n2 1\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 3\n2 1",
"3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 1\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n0 -1\n1 0\n2\n0 0\n-1 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n1 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n0 0\n1 2\n2 1",
"3\n2\n0 -1\n0 -1\n1 0\n3\n0 0\n0 0\n1 0\n2\n0 0\n1 2\n2 1",
"3\n2\n0 -1\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n2 2",
"3\n3\n0 -1\n-1 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n2 1",
"3\n2\n0 -1\n-1 -1\n1 -1\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n0 1",
"3\n4\n0 -1\n-1 -1\n1 0\n2\n0 0\n0 0\n1 -1\n2\n1 0\n1 2\n0 1",
"3\n2\n0 -2\n-1 -1\n1 0\n2\n0 0\n0 0\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 1\n0 -1\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n1 0\n1 -1\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -1\n3\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n0 -2\n2\n1 0\n1 2\n1 1",
"3\n1\n0 -1\n-1 0\n2 0\n2\n1 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 0\n2\n1 0\n0 -2\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 0\n2\n2 0\n0 -1\n1 -2\n2\n1 1\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 1\n1\n2 1\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n1\n0 1\n0 0\n1 0\n4\n0 1\n0 0\n1 0\n2\n0 0\n0 3\n2 1",
"3\n2\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n0 -1\n1 0\n2\n0 0\n-1 0\n1 0\n2\n0 0\n0 2\n3 1",
"3\n2\n0 0\n1 -1\n1 0\n2\n0 0\n0 0\n1 -1\n2\n0 0\n1 2\n2 1",
"3\n3\n0 -1\n-1 -1\n1 0\n2\n-1 0\n0 0\n1 0\n2\n1 0\n1 2\n2 1",
"3\n2\n0 -1\n-1 -1\n2 -1\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n0 1",
"3\n4\n0 -1\n-1 -1\n1 0\n2\n0 -1\n0 0\n1 -1\n2\n1 0\n1 2\n0 1",
"3\n2\n0 -2\n-1 -1\n1 0\n2\n0 0\n0 0\n1 -1\n2\n1 -1\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 1\n0 -1\n1 -1\n2\n2 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n1 0\n1 -1\n1 -1\n2\n1 0\n2 2\n1 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -1\n3\n1 0\n1 2\n1 0",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 1\n0 -1\n0 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 1\n2\n2 0\n0 -1\n1 -2\n2\n1 1\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 -1\n1\n2 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 2",
"3\n2\n0 -1\n0 -1\n2 1\n1\n2 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 1",
"3\n1\n0 1\n0 0\n1 0\n4\n0 1\n0 0\n0 0\n2\n0 0\n0 3\n2 1",
"3\n2\n0 2\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n0 -1\n1 0\n2\n0 0\n-1 0\n1 0\n2\n0 0\n1 2\n3 1",
"3\n2\n0 0\n1 -1\n1 0\n3\n0 0\n0 0\n1 -1\n2\n0 0\n1 2\n2 1",
"3\n3\n0 -1\n-1 -1\n1 0\n2\n-1 0\n0 0\n1 0\n2\n1 0\n1 2\n1 1",
"3\n4\n0 -1\n-1 -1\n1 1\n2\n0 -1\n0 0\n1 -1\n2\n1 0\n1 2\n0 1",
"3\n2\n0 -2\n-1 -1\n1 0\n2\n0 0\n0 0\n1 -1\n1\n1 -1\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 1\n-1 -1\n1 -1\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n1 0\n1 -1\n1 -1\n2\n1 0\n2 2\n2 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n1 -1\n1 -1\n3\n1 0\n1 2\n1 0",
"3\n2\n0 -1\n-1 -1\n2 1\n2\n1 1\n0 -1\n0 -2\n2\n1 0\n1 2\n1 1",
"3\n2\n0 -1\n0 -1\n2 1\n2\n2 1\n0 -1\n1 -2\n2\n1 1\n1 2\n1 1",
"3\n2\n0 0\n0 -1\n2 -1\n1\n2 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 2",
"3\n2\n0 -1\n0 -1\n2 1\n1\n2 0\n0 -1\n1 -2\n2\n1 0\n0 2\n1 1",
"3\n1\n0 0\n0 0\n1 0\n4\n0 1\n0 0\n0 0\n2\n0 0\n0 3\n2 1",
"3\n2\n0 2\n0 0\n1 0\n2\n-1 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1",
"3\n2\n0 0\n0 -1\n1 0\n2\n0 0\n-1 0\n1 0\n2\n0 0\n1 2\n3 2",
"3\n2\n0 0\n1 -1\n1 0\n3\n0 0\n0 0\n1 -1\n3\n0 0\n1 2\n2 1",
"3\n3\n0 -1\n-1 -2\n1 0\n2\n-1 0\n0 0\n1 0\n2\n1 0\n1 2\n1 1",
"3\n4\n0 -1\n-1 -1\n1 1\n2\n0 -1\n0 0\n1 -1\n2\n2 0\n1 2\n0 1",
"3\n2\n0 -2\n-1 -1\n1 0\n2\n0 0\n-1 0\n1 -1\n1\n1 -1\n1 2\n1 1",
"3\n2\n0 -1\n-1 -1\n1 0\n2\n0 1\n-1 -1\n1 -1\n2\n1 0\n1 2\n2 1",
"3\n2\n0 -1\n0 -1\n1 0\n2\n1 0\n1 -1\n1 -1\n2\n1 0\n2 2\n1 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n1 -1\n1 -1\n3\n1 0\n2 2\n1 0",
"3\n2\n0 -1\n0 -1\n2 1\n2\n2 1\n0 -1\n1 -2\n2\n1 1\n1 3\n1 1",
"3\n2\n0 1\n0 -1\n2 -1\n1\n2 0\n0 -1\n1 -2\n2\n1 0\n1 2\n1 2",
"3\n2\n0 -1\n0 -1\n2 1\n1\n3 0\n0 -1\n1 -2\n2\n1 0\n0 2\n1 1",
"3\n1\n0 0\n0 0\n1 0\n4\n0 2\n0 0\n0 0\n2\n0 0\n0 3\n2 1",
"3\n2\n0 2\n0 0\n1 0\n2\n-1 1\n0 0\n1 0\n2\n-1 0\n0 2\n2 1",
"3\n2\n0 0\n1 -2\n1 0\n3\n0 0\n0 0\n1 -1\n3\n0 0\n1 2\n2 1",
"3\n3\n0 -1\n-2 -2\n1 0\n2\n-1 0\n0 0\n1 0\n2\n1 0\n1 2\n1 1",
"3\n7\n0 -1\n-1 -1\n1 1\n2\n0 -1\n0 0\n1 -1\n2\n2 0\n1 2\n0 1",
"3\n2\n-1 -1\n-1 -1\n1 0\n2\n0 1\n-1 -1\n1 -1\n2\n1 0\n1 2\n2 1",
"3\n2\n0 -1\n0 -1\n1 0\n2\n1 0\n2 -1\n1 -1\n2\n1 0\n2 2\n1 1",
"3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n1 -1\n1 -1\n3\n1 0\n2 1\n1 0",
"3\n2\n0 -1\n0 -2\n2 1\n2\n2 1\n0 -1\n1 -2\n2\n1 1\n1 3\n1 1",
"3\n2\n0 1\n0 -1\n2 -1\n1\n2 -1\n0 -1\n1 -2\n2\n1 0\n1 2\n1 2",
"3\n2\n0 -1\n0 -1\n2 1\n1\n3 0\n0 -1\n1 -2\n2\n1 1\n0 2\n1 1",
"3\n1\n0 0\n0 0\n1 0\n4\n0 2\n0 1\n0 0\n2\n0 0\n0 3\n2 1",
"3\n2\n0 2\n0 0\n1 0\n2\n-1 0\n0 0\n1 0\n2\n-1 0\n0 2\n2 1",
"3\n2\n0 0\n1 -2\n1 0\n3\n0 1\n0 0\n1 -1\n3\n0 0\n1 2\n2 1",
"3\n3\n0 -1\n-2 -1\n1 0\n2\n-1 0\n0 0\n1 0\n2\n1 0\n1 2\n1 1",
"3\n4\n0 -1\n-1 -1\n1 1\n2\n0 -1\n0 0\n2 -1\n2\n2 0\n1 2\n0 1"
],
"output": [
"yes\nyes\nno\n",
"no\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nno\nyes\n",
"yes\nno\nyes\n",
"no\nno\nno\n",
"yes\nno\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nno\nyes\n",
"no\nno\nyes\n",
"yes\nyes\nno\n",
"no\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nno\nyes\n",
"no\nno\nyes\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nno\nyes\n",
"no\nno\nyes\n",
"yes\nno\nyes\n",
"no\nno\nyes\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nno\n",
"yes\nno\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nno\nyes\n",
"no\nno\nyes\n",
"yes\nno\nyes\n",
"no\nno\nyes\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nno\n",
"no\nyes\nno\n",
"yes\nno\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nno\nyes\n",
"yes\nno\nyes\n",
"no\nno\nyes\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nno\n",
"no\nno\nyes\n",
"yes\nyes\nyes\n",
"no\nyes\nyes\n",
"no\nno\nyes\n",
"yes\nno\nyes\n",
"no\nno\nyes\n",
"yes\nyes\nno\n",
"yes\nyes\nno\n",
"yes\nyes\nyes\n",
"yes\nyes\nyes\n",
"yes\nyes\nno\n"
]
} | 1CODECHEF
|
gcd2_2 | Frank explained its friend Felman the algorithm of Euclides to calculate the GCD
of two numbers. Then Felman implements it algorithm
int gcd(int a, int b)
{
if (b==0)
return a;
else
return gcd(b,a%b);
}
and it proposes to Frank that makes it
but with a little integer and another integer that has up to 250 digits.
Your task is to help Frank programming an efficient code for the challenge of Felman.
Input
The first line of the input file contains a number representing the number of lines to follow.
Each line consists of two number A and B (0 ≤ A ≤ 40000 and A ≤ B < 10^250).
Output
Print for each pair (A,B) in the input one integer representing the GCD of A and B.
Example
Input:
2
2 6
10 11
Output:
2
1 | def gcd(a,b):
while(b):
a,b=b,a%b
return a
t=input()
while(t):
a,b=map(int,raw_input().split())
print(gcd(a,b))
t=t-1; | 1Python2
| {
"input": [
"2\n2 6\n10 11",
"2\n3 6\n10 11",
"2\n1 3\n10 11",
"2\n0 6\n10 11",
"2\n0 6\n0 11",
"2\n3 6\n8 22",
"2\n3 6\n8 4",
"2\n5 2\n10 2",
"2\n4 10\n8 6",
"2\n7 14\n8 6",
"2\n7 14\n8 4",
"2\n2 6\n5 2",
"2\n0 14\n16 2",
"2\n0 11\n10 1",
"2\n0 14\n16 1",
"2\n1 3\n10 5",
"2\n0 12\n0 11",
"2\n3 8\n8 4",
"2\n0 5\n8 6",
"2\n7 14\n8 5",
"2\n0 6\n0 2",
"2\n0 20\n10 1",
"2\n0 6\n12 20",
"2\n0 4\n5 2",
"2\n0 18\n7 1",
"2\n0 4\n16 6",
"2\n0 20\n12 2",
"2\n3 6\n9 15",
"2\n1 2\n14 7",
"2\n1 2\n14 14",
"2\n0 1\n9 6",
"2\n0 4\n20 4",
"2\n0 12\n21 2",
"2\n7 15\n16 16",
"2\n0 2\n14 14",
"2\n0 2\n9 6",
"2\n0 12\n21 3",
"2\n0 10\n1 10",
"2\n0 10\n3 3",
"2\n8 18\n16 16",
"2\n0 17\n1 17",
"2\n1 6\n11 22",
"2\n0 17\n0 17",
"2\n0 23\n39 1",
"2\n0 2\n10 30",
"2\n0 5\n1 17",
"2\n0 2\n12 30",
"2\n1 2\n0 12",
"2\n1 2\n0 20",
"2\n0 2\n0 20",
"2\n0 8\n2 5",
"2\n0 3\n0 20",
"2\n0 8\n0 5",
"2\n0 4\n0 11",
"2\n0 6\n10 5",
"2\n3 6\n8 8",
"2\n3 6\n6 6",
"2\n0 9\n5 1",
"2\n0 13\n10 1",
"2\n0 26\n11 1",
"2\n2 6\n4 20",
"2\n2 3\n10 20",
"2\n0 2\n0 11",
"2\n3 8\n8 8",
"2\n3 6\n0 14",
"2\n0 2\n5 25",
"2\n0 25\n0 2",
"2\n0 32\n12 1",
"2\n3 6\n9 18",
"2\n0 4\n9 6",
"2\n0 10\n8 10",
"2\n0 8\n4 2",
"2\n0 6\n21 28",
"2\n3 9\n0 15",
"2\n7 7\n16 16",
"2\n5 10\n14 14",
"2\n0 10\n0 10",
"2\n0 9\n3 3",
"2\n0 19\n26 3",
"2\n0 17\n0 14",
"2\n0 34\n39 1",
"2\n1 3\n6 42",
"2\n0 2\n15 30",
"2\n2 3\n0 25",
"2\n2 2\n0 12",
"2\n1 8\n0 9",
"2\n0 4\n10 5",
"2\n0 52\n11 1",
"2\n3 3\n10 11",
"2\n3 6\n8 11",
"2\n5 3\n10 11",
"2\n2 3\n10 11",
"2\n5 1\n10 11",
"2\n2 3\n14 11",
"2\n5 2\n10 11",
"2\n2 3\n14 13",
"2\n3 6\n8 3",
"2\n2 1\n14 13",
"2\n3 6\n8 6",
"2\n5 3\n10 2",
"2\n0 1\n14 13"
],
"output": [
"2\n1\n",
"3\n1\n",
"1\n1\n",
"6\n1\n",
"6\n11\n",
"3\n2\n",
"3\n4\n",
"1\n2\n",
"2\n2\n",
"7\n2\n",
"7\n4\n",
"2\n1\n",
"14\n2\n",
"11\n1\n",
"14\n1\n",
"1\n5\n",
"12\n11\n",
"1\n4\n",
"5\n2\n",
"7\n1\n",
"6\n2\n",
"20\n1\n",
"6\n4\n",
"4\n1\n",
"18\n1\n",
"4\n2\n",
"20\n2\n",
"3\n3\n",
"1\n7\n",
"1\n14\n",
"1\n3\n",
"4\n4\n",
"12\n1\n",
"1\n16\n",
"2\n14\n",
"2\n3\n",
"12\n3\n",
"10\n1\n",
"10\n3\n",
"2\n16\n",
"17\n1\n",
"1\n11\n",
"17\n17\n",
"23\n1\n",
"2\n10\n",
"5\n1\n",
"2\n6\n",
"1\n12\n",
"1\n20\n",
"2\n20\n",
"8\n1\n",
"3\n20\n",
"8\n5\n",
"4\n11\n",
"6\n5\n",
"3\n8\n",
"3\n6\n",
"9\n1\n",
"13\n1\n",
"26\n1\n",
"2\n4\n",
"1\n10\n",
"2\n11\n",
"1\n8\n",
"3\n14\n",
"2\n5\n",
"25\n2\n",
"32\n1\n",
"3\n9\n",
"4\n3\n",
"10\n2\n",
"8\n2\n",
"6\n7\n",
"3\n15\n",
"7\n16\n",
"5\n14\n",
"10\n10\n",
"9\n3\n",
"19\n1\n",
"17\n14\n",
"34\n1\n",
"1\n6\n",
"2\n15\n",
"1\n25\n",
"2\n12\n",
"1\n9\n",
"4\n5\n",
"52\n1\n",
"3\n1\n",
"3\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"3\n1\n",
"1\n1\n",
"3\n2\n",
"1\n2\n",
"1\n1\n"
]
} | 1CODECHEF
|
luckybal_3 | A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of the lucky digits 4 and 7.
The Little Elephant calls some string T of the length M balanced if there exists at least one integer X (1 ≤ X ≤ M) such that the number of digits 4 in the substring T[1, X - 1] is equal to the number of digits 7 in the substring T[X, M]. For example, the string S = 7477447 is balanced since S[1, 4] = 7477 has 1 digit 4 and S[5, 7] = 447 has 1 digit 7. On the other hand, one can verify that the string S = 7 is not balanced.
The Little Elephant has the string S of the length N. He wants to know the number of such pairs of integers (L; R) that 1 ≤ L ≤ R ≤ N and the substring S[L, R] is balanced. Help him to find this number.
Notes.
Let S be some lucky string. Then
|S| denotes the length of the string S;
S[i] (1 ≤ i ≤ |S|) denotes the i^th character of S (the numeration of characters starts from 1);
S[L, R] (1 ≤ L ≤ R ≤ |S|) denotes the string with the following sequence of characters: S[L], S[L + 1], ..., S[R], and is called a substring of S. For L > R we mean by S[L, R] an empty string.
Input
The first line of the input file contains a single integer T, the number of test cases. Each of the following T lines contains one string, the string S for the corresponding test case. The input file does not contain any whitespaces.
Output
For each test case output a single line containing the answer for this test case.
Constraints
1 ≤ T ≤ 10
1 ≤ |S| ≤ 100000
S consists only of the lucky digits 4 and 7.
Example
Input:
4
47
74
477
4747477
Output:
2
2
3
23
Explanation
In the first test case balance substrings are S[1, 1] = 4 and S[1, 2] = 47.
In the second test case balance substrings are S[2, 2] = 4 and S[1, 2] = 74.
Unfortunately, we can't provide you with the explanations of the third and the fourth test cases. You should figure it out by yourself. Please, don't ask about this in comments. | n = input()
for i in range(n):
str = raw_input()
l = len(str)
megacounter = 0
counter = 0
i = 0
while(1):
while(i<l and str[i]=='7'):
i=i+1
counter=counter+1
if(i>=l):
break
megacounter = megacounter + (counter*(counter+1))/2
i=i+1
counter=0
megacounter = megacounter + (counter*(counter+1))/2
supercounter = (l*(l+1))/2 - megacounter
print supercounter | 1Python2
| {
"input": [
"4\n47\n74\n477\n4747477",
"4\n47\n47\n477\n4747477",
"4\n7\n47\n477\n4747477",
"4\n4\n47\n477\n4747477",
"4\n7\n7\n477\n4747477",
"4\n7\n44\n477\n4747477",
"4\n44\n74\n477\n4747477",
"4\n7\n44\n7\n4747477",
"4\n47\n44\n477\n4747477",
"4\n47\n4\n477\n4747477",
"4\n7\n7\n447\n4747477",
"4\n47\n7\n477\n4747477",
"4\n44\n44\n477\n4747477",
"4\n4\n44\n477\n4747477",
"4\n74\n47\n477\n4747477",
"4\n44\n47\n477\n4747477",
"4\n7\n74\n477\n4747477",
"4\n7\n77\n477\n4747477",
"4\n47\n77\n477\n4747477",
"4\n4\n74\n477\n4747477"
],
"output": [
"2\n2\n3\n23\n",
"2\n2\n3\n23\n",
"0\n2\n3\n23\n",
"1\n2\n3\n23\n",
"0\n0\n3\n23\n",
"0\n3\n3\n23\n",
"3\n2\n3\n23\n",
"0\n3\n0\n23\n",
"2\n3\n3\n23\n",
"2\n1\n3\n23\n",
"0\n0\n5\n23\n",
"2\n0\n3\n23\n",
"3\n3\n3\n23\n",
"1\n3\n3\n23\n",
"2\n2\n3\n23\n",
"3\n2\n3\n23\n",
"0\n2\n3\n23\n",
"0\n0\n3\n23\n",
"2\n0\n3\n23\n",
"1\n2\n3\n23\n"
]
} | 1CODECHEF
|
prpaln_4 | Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of the string after deletion would be one less than it was before.
Input
First line of the input contains a single integer T denoting number of test cases.
For each test case, you are given a single line containing string s.
Output
For each test case, print YES or NO depending on the answer of the problem.
Constraints
Example
Input:
4
aaa
abc
abdbca
abba
Output:
YES
NO
YES
YES
Explanation
Example case 1. Delete any one 'a', resulting string is "aa" which is a palindrome.
Example case 2. It is not possible to delete exactly one character and having a palindrome.
Example case 3. Delete 'c', resulting string is "abdba" which is a palindrome.
Example case 4. Delete 'b', resulting string is "aba" which is a palindrome. | import math
import sys
def checkpal(s):
return s==s[::-1]
for a in range(input()):
s=raw_input()
l=len(s)
if(l==2):
print "YES"
else:
if checkpal(s):
print "YES"
else:
while s[0] == s[-1] and len(s)>2:
s=s[1:-1]
if checkpal(s[1:]) or checkpal(s[:-1]):
print "YES"
else:
print "NO" | 1Python2
| {
"input": [
"4\naaa\nabc\nabdbca\nabba",
"4\naaa\nabc\nabdbca\nabca",
"4\naaa\nabc\nabdbc`\naaca",
"4\naab\nacc\n`bd`cb\naaad",
"4\nbaa\nabc\n`bd`bb\naabd",
"4\nbab\nabb\nbb`db`\naabd",
"4\nbaa\n`aa\nbb`c`b\ndba`",
"4\nba`\n`aa\nbb`c_c\ndba`",
"4\n`a_\naa`\ndda`^c\nca^a",
"4\n_c`\n]`_\ncdad^`\n`c_^",
"4\n_c`\n]`_\ncdac^`\n_c_^",
"4\ne`_\n_\\^\nd_`c_d\nbc^_",
"4\naaa\nabc\nabdbca\naaca",
"4\naaa\nabc\n`bdbc`\naaca",
"4\naab\nabc\n`bdbc`\naaca",
"4\nbaa\nabc\n`bdbc`\naaca",
"4\nbaa\nabc\nabdbc`\naaca",
"4\nbaa\nabc\nabd`cb\naaca",
"4\nbaa\nabc\nabd`cb\nacaa",
"4\nbaa\nabc\n`bd`cb\nacaa",
"4\nbaa\nabc\n`bd`cb\nadaa",
"4\nbaa\nabc\n`bd`cb\naaad",
"4\naab\nabc\n`bd`cb\naaad",
"4\naab\nacc\n`bd`bb\naaad",
"4\naab\nacc\n`cd`bb\naaad",
"4\nbaa\nacc\n`cd`bb\naaad",
"4\nbaa\nacc\n`bd`bb\naaad",
"4\nbaa\nabc\n`bd`bb\naaad",
"4\nbaa\nabc\nbb`db`\naabd",
"4\nbab\nabc\nbb`db`\naabd",
"4\nbab\nacb\nbb`db`\naabd",
"4\nbab\naca\nbb`db`\naabd",
"4\nbab\naba\nbb`db`\naabd",
"4\nbab\naba\nbb`cb`\naabd",
"4\nbab\naba\ncb`cb`\naabd",
"4\naab\naba\ncb`cb`\naabd",
"4\naab\naba\n`bc`bc\naabd",
"4\nbaa\naba\ncb`cb`\naabd",
"4\nbaa\naaa\ncb`cb`\naabd",
"4\nbaa\naaa\ncb`cb`\ndbaa",
"4\nbaa\naaa\nbb`cb`\ndbaa",
"4\nbaa\naaa\nbb`cb`\ndba`",
"4\nbaa\n`aa\nbb`cb`\ndba`",
"4\nbaa\na`a\nbb`c`b\ndba`",
"4\nbaa\na`a\nbb`c`c\ndba`",
"4\nbaa\na`a\nbb`c_c\ndba`",
"4\nbaa\n`aa\nbb`c_c\ndba`",
"4\nba_\n`aa\nbb`c_c\ndba`",
"4\nba_\n`aa\nbb_c_c\ndba`",
"4\nba_\n`aa\nbb_c_c\nabd`",
"4\naa_\n`aa\nbb_c_c\nabd`",
"4\nab_\n`aa\nbb_c_c\nabd`",
"4\nab_\n`aa\nbb_c_c\nab`d",
"4\nab_\n`aa\nbb_c_c\nba`d",
"4\nab_\n`aa\nbb_c_c\nbad`",
"4\nab_\n`aa\nbb_c_c\n`dab",
"4\n_ba\n`aa\nbb_c_c\n`dab",
"4\n_ba\n`aa\n_b_cbc\n`dab",
"4\n_ba\n`aa\ncbc_b_\n`dab",
"4\nab_\n`aa\ncbc_b_\n`dab",
"4\nab_\naa`\ncbc_b_\n`dab",
"4\n_ba\naa`\ncbc_b_\n`dab",
"4\n_ba\naa`\ncbc__b\n`dab",
"4\n^ba\naa`\ncbc__b\n`dab",
"4\n^ba\naa`\ncbc__b\n`cab",
"4\n^ba\naa`\ncbc__b\n_cab",
"4\n^aa\naa`\ncbc__b\n_cab",
"4\n^aa\naa`\ncbc__b\n_caa",
"4\n^aa\naa`\ncbc__c\n_caa",
"4\n^aa\naa`\ncbc__c\n^caa",
"4\naa^\naa`\ncbc__c\n^caa",
"4\naa^\n`aa\ncbc__c\n^caa",
"4\naa^\n`aa\ncbc`_c\n^caa",
"4\naa^\n``a\ncbc`_c\n^caa",
"4\naa^\n`a`\ncbc`_c\n^caa",
"4\naa^\n`a`\ncbc`_c\nc^aa",
"4\naa^\n`a`\ndbc`_c\nc^aa",
"4\naa_\n`a`\ndbc`_c\nc^aa",
"4\naa_\n`a`\ndac`_c\nc^aa",
"4\naa_\n`a`\nc_`cad\nc^aa",
"4\n`a_\n`a`\nc_`cad\nc^aa",
"4\n`a_\n`a`\nc_`dad\nc^aa",
"4\n`a_\n`a`\ndad`_c\nc^aa",
"4\n`a_\n`a`\ndad`^c\nc^aa",
"4\n`a_\n`a`\ndad`^c\naa^c",
"4\n`a_\na``\ndad`^c\naa^c",
"4\n`a_\na``\ndda`^c\naa^c",
"4\n`a_\naa`\ndda`^c\naa^c",
"4\n`a_\naa`\nc^`add\nca^a",
"4\n`a_\naa`\ndda`^c\ncb^a",
"4\n`a_\naa`\ndda`^c\na^bc",
"4\n`a_\na``\ndda`^c\na^bc",
"4\n`a_\na``\ndda`^c\n`^bc",
"4\n`a_\na``\ncda`^c\n`^bc",
"4\n_a`\na``\ncda`^c\n`^bc",
"4\n`a_\n``a\ncda`^c\n`^bc",
"4\n`a_\na``\ncd``^c\n`^bc",
"4\n`a_\na``\ncd``^c\nb^`c",
"4\n`b_\na``\ncd``^c\nb^`c",
"4\n_b`\na``\ncd``^c\nb^`c",
"4\n_b`\na``\ncd``^c\nb^_c"
],
"output": [
"YES\nNO\nYES\nYES\n",
"YES\nNO\nYES\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nYES\nNO\nYES\n",
"YES\nNO\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nYES\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nYES\n",
"NO\nNO\nNO\nNO\n",
"NO\nNO\nNO\nYES\n",
"NO\nNO\nYES\nNO\n",
"YES\nNO\nYES\nYES\n",
"YES\nNO\nYES\nYES\n",
"YES\nNO\nYES\nYES\n",
"YES\nNO\nYES\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nYES\nNO\nYES\n",
"YES\nYES\nNO\nYES\n",
"YES\nYES\nNO\nYES\n",
"YES\nYES\nNO\nYES\n",
"YES\nNO\nNO\nYES\n",
"YES\nNO\nNO\nNO\n",
"YES\nNO\nNO\nNO\n",
"YES\nNO\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nYES\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"YES\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nYES\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n",
"NO\nYES\nNO\nNO\n"
]
} | 1CODECHEF
|
tf01_5 | An established group of scientists are working on finding solution to NP hard problems. They claim Subset Sum as an NP-hard problem. The problem is to determine whether there exists a subset of a given set S whose sum is a given number K.
You are a computer engineer and you claim to solve this problem given that all numbers in the set are non-negative. Given a set S of size N of non-negative integers, find whether there exists a subset whose sum is K.
Input
First line of input contains T, the number of test cases. T test cases follow.
Each test case contains 2 lines. First line contains two integers N and K. Next line contains N space separated non-negative integers (each less than 100000).
0 < T < 1000
0 < N < 1000
0 < K < 1000
Output
Output T lines, one for each test case. Every line should be either 0 or 1 depending on whether such a subset exists or not.
Example
Input:
2
5 10
3 4 6 1 9
3 2
1 3 4
Output:
1
0 | import sys
for __ in range(input()) :
n , k = map(int,sys.stdin.readline().split())
lists = map(int,sys.stdin.readline().split())
dp = [0]*(k+1)
dp[0]=1
for i in lists :
for j in range(k-i,-1,-1) :
if dp[k] :
break
if dp[j] :
dp[j+i] = 1
print dp[k] | 1Python2
| {
"input": [
"2\n5 10\n3 4 6 1 9\n3 2\n1 3 4"
],
"output": [
"1\n0"
]
} | 1CODECHEF
|
1012_E. Cycle sort_6 | You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following operation any number of times: select several distinct indices i_1, i_2, ..., i_k (1 ≤ i_j ≤ n) and move the number standing at the position i_1 to the position i_2, the number at the position i_2 to the position i_3, ..., the number at the position i_k to the position i_1. In other words, the operation cyclically shifts elements: i_1 → i_2 → … i_k → i_1.
For example, if you have n=4, an array a_1=10, a_2=20, a_3=30, a_4=40, and you choose three indices i_1=2, i_2=1, i_3=4, then the resulting array would become a_1=20, a_2=40, a_3=30, a_4=10.
Your goal is to make the array sorted in non-decreasing order with the minimum number of operations. The additional constraint is that the sum of cycle lengths over all operations should be less than or equal to a number s. If it's impossible to sort the array while satisfying that constraint, your solution should report that as well.
Input
The first line of the input contains two integers n and s (1 ≤ n ≤ 200 000, 0 ≤ s ≤ 200 000)—the number of elements in the array and the upper bound on the sum of cycle lengths.
The next line contains n integers a_1, a_2, ..., a_n—elements of the array (1 ≤ a_i ≤ 10^9).
Output
If it's impossible to sort the array using cycles of total length not exceeding s, print a single number "-1" (quotes for clarity).
Otherwise, print a single number q— the minimum number of operations required to sort the array.
On the next 2 ⋅ q lines print descriptions of operations in the order they are applied to the array. The description of i-th operation begins with a single line containing one integer k (1 ≤ k ≤ n)—the length of the cycle (that is, the number of selected indices). The next line should contain k distinct integers i_1, i_2, ..., i_k (1 ≤ i_j ≤ n)—the indices of the cycle.
The sum of lengths of these cycles should be less than or equal to s, and the array should be sorted after applying these q operations.
If there are several possible answers with the optimal q, print any of them.
Examples
Input
5 5
3 2 3 1 1
Output
1
5
1 4 2 3 5
Input
4 3
2 1 4 3
Output
-1
Input
2 0
2 2
Output
0
Note
In the first example, it's also possible to sort the array with two operations of total length 5: first apply the cycle 1 → 4 → 1 (of length 2), then apply the cycle 2 → 3 → 5 → 2 (of length 3). However, it would be wrong answer as you're asked to use the minimal possible number of operations, which is 1 in that case.
In the second example, it's possible to the sort the array with two cycles of total length 4 (1 → 2 → 1 and 3 → 4 → 3). However, it's impossible to achieve the same using shorter cycles, which is required by s=3.
In the third example, the array is already sorted, so no operations are needed. Total length of empty set of cycles is considered to be zero. | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 300000;
map<int, int> mapa;
map<pair<int, int>, vector<int>> pos;
vector<int> g[MAXN];
int ptr[MAXN];
int used[MAXN];
void euler(int v, vector<int> &res) {
used[v] = true;
for (; ptr[v] < (int)(g[v]).size();) {
++ptr[v];
int u = g[v][ptr[v] - 1];
euler(u, res);
res.push_back(u);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, s;
cin >> n >> s;
int k = 0;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> b = a;
sort((b).begin(), (b).end());
int m = 0;
for (int i = 0; i < n; ++i) {
if (a[i] == b[i]) {
continue;
}
++m;
if (!mapa.count(b[i])) {
mapa[b[i]] = k++;
}
}
if (m > s) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < n; ++i) {
if (a[i] == b[i]) {
continue;
}
a[i] = mapa[a[i]];
b[i] = mapa[b[i]];
g[b[i]].push_back(a[i]);
pos[{b[i], a[i]}].push_back(i);
}
vector<vector<int>> cycles;
for (int i = 0; i < k; ++i) {
if (!used[i]) {
vector<int> arr;
euler(i, arr);
reverse((arr).begin(), (arr).end());
cycles.push_back({});
for (int i = 0; i < (int)(arr).size(); ++i) {
int j = (i + 1) % (int)(arr).size();
cycles.back().push_back(pos[{arr[i], arr[j]}].back());
pos[{arr[i], arr[j]}].pop_back();
}
}
}
vector<vector<int>> res;
if (s - m > 1 && (int)(cycles).size() > 1) {
int len = min((int)(cycles).size(), s - m);
res.push_back({});
vector<int> newcycle;
for (int i = (int)(cycles).size() - len; i < (int)(cycles).size(); ++i) {
res.back().push_back(cycles[i].back());
for (int j : cycles[i]) {
newcycle.push_back(j);
}
}
reverse((res.back()).begin(), (res.back()).end());
for (int i = 0; i < len; ++i) {
cycles.pop_back();
}
cycles.push_back(newcycle);
}
for (int i = 0; i < (int)(cycles).size(); ++i) {
res.push_back(cycles[i]);
}
cout << (int)(res).size() << endl;
for (int i = 0; i < (int)(res).size(); ++i) {
cout << (int)(res[i]).size() << endl;
for (int j : res[i]) {
cout << j + 1 << " ";
}
cout << endl;
}
}
| 2C++
| {
"input": [
"5 5\n3 2 3 1 1\n",
"4 3\n2 1 4 3\n",
"2 0\n2 2\n",
"5 0\n884430748 884430748 708433020 708433020 708433020\n",
"2 1\n1 1\n",
"2 0\n2 1\n",
"5 2\n65390026 770505072 65390026 65390026 65390026\n",
"5 4\n812067558 674124159 106041640 106041640 674124159\n",
"5 4\n167616600 574805150 651016425 150949603 379708534\n",
"5 5\n472778319 561757623 989296065 99763286 352037329\n",
"5 4\n201429826 845081337 219611799 598937628 680006294\n",
"2 2\n2 1\n",
"5 0\n1000000000 1000000000 1000000000 1000000000 1000000000\n",
"5 6\n971458729 608568364 891718769 464295315 98863653\n",
"5 5\n641494999 641494999 228574099 535883079 535883079\n",
"5 5\n815605413 4894095 624809427 264202135 152952491\n",
"1 0\n258769137\n",
"2 0\n1 1\n",
"1 0\n2\n",
"5 4\n335381650 691981363 691981363 335381650 335381650\n",
"5 4\n81224924 319704343 319704343 210445208 128525140\n",
"5 4\n579487081 564229995 665920667 665920667 644707366\n",
"5 200000\n682659092 302185582 518778252 29821187 14969298\n",
"5 0\n884430748 884430748 182474629 708433020 708433020\n",
"5 2\n65390026 1454694739 65390026 65390026 65390026\n",
"5 4\n167616600 574805150 651016425 232181430 379708534\n",
"5 4\n201429826 845081337 219611799 598937628 1013339305\n",
"2 2\n4 1\n",
"5 6\n971458729 608568364 891718769 268781113 98863653\n",
"5 5\n539341452 4894095 624809427 264202135 152952491\n",
"1 0\n483419747\n",
"5 4\n579487081 564229995 288357375 665920667 644707366\n",
"5 200000\n682659092 302185582 185982759 29821187 14969298\n",
"4 3\n2 2 6 3\n",
"5 4\n201429826 845081337 219611799 1097635109 1811343985\n",
"5 6\n335381650 691981363 484551438 335381650 201569796\n",
"5 1\n641494999 641494999 228574099 535883079 535883079\n",
"1 0\n1\n",
"5 4\n335381650 691981363 691981363 335381650 201569796\n",
"5 1\n81224924 319704343 319704343 210445208 128525140\n",
"4 3\n2 1 6 3\n",
"5 -1\n884430748 884430748 182474629 708433020 708433020\n",
"5 2\n65390026 1454694739 65390026 65390026 100733760\n",
"0 4\n167616600 574805150 651016425 232181430 379708534\n",
"5 4\n201429826 845081337 219611799 598937628 1811343985\n",
"1 2\n4 1\n",
"5 3\n971458729 608568364 891718769 268781113 98863653\n",
"5 0\n641494999 641494999 228574099 535883079 535883079\n",
"5 2\n539341452 4894095 624809427 264202135 152952491\n",
"1 1\n483419747\n",
"0 0\n1\n",
"5 4\n335381650 691981363 484551438 335381650 201569796\n",
"5 1\n81224924 413380565 319704343 210445208 128525140\n",
"5 4\n579487081 564229995 288357375 946230441 644707366\n",
"5 200000\n682659092 302185582 185982759 20056766 14969298\n",
"5 -1\n884430748 884430748 267312749 708433020 708433020\n",
"5 2\n501175 1454694739 65390026 65390026 100733760\n",
"0 4\n167616600 90071718 651016425 232181430 379708534\n",
"1 2\n6 1\n",
"5 3\n971458729 341020287 891718769 268781113 98863653\n",
"5 -1\n641494999 641494999 228574099 535883079 535883079\n",
"5 2\n539341452 4894095 624809427 264202135 209695341\n",
"1 1\n682471575\n",
"0 0\n2\n",
"3 1\n81224924 413380565 319704343 210445208 128525140\n",
"5 4\n579487081 92588299 288357375 946230441 644707366\n"
],
"output": [
"1\n5\n1 4 2 3 5 \n",
"-1\n",
"0\n",
"-1\n",
"0\n",
"-1\n",
"1\n2\n2 5 \n",
"-1\n",
"-1\n",
"1\n5\n1 3 5 2 4 \n",
"1\n4\n2 5 4 3 \n",
"1\n2\n1 2 \n",
"0\n",
"2\n2\n1 5\n3\n2 3 4\n",
"1\n5\n1 4 2 5 3 \n",
"2\n3\n1 5 2\n2\n3 4\n",
"0\n",
"0\n",
"0\n",
"1\n4\n2 4 3 5 \n",
"1\n4\n2 4 3 5 \n",
"2\n2\n1 2\n2\n3 5\n",
"2\n2\n1 5\n3\n2 3 4\n",
"-1\n",
"1\n2\n2 5 \n",
"2\n2\n2 4 \n2\n3 5 \n",
"1\n3\n2 4 3 \n",
"1\n2\n1 2 \n",
"2\n2\n1 5 \n3\n2 3 4 \n",
"1\n5\n1 4 3 5 2 \n",
"0\n",
"2\n2\n1 3 \n2\n4 5 \n",
"2\n2\n1 5 \n2\n2 4 \n",
"1\n2\n3 4 \n",
"1\n2\n2 3 \n",
"1\n5\n1 3 4 2 5 \n",
"-1\n",
"0\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"0\n",
"1\n3\n2 4 3 \n",
"0\n",
"-1\n",
"-1\n",
"-1\n",
"0\n",
"0\n",
"-1\n",
"-1\n",
"2\n2\n1 3 \n2\n4 5 \n",
"2\n2\n1 5 \n2\n2 4 \n",
"-1\n",
"-1\n",
"0\n",
"0\n",
"-1\n",
"-1\n",
"-1\n",
"0\n",
"0\n",
"-1\n",
"-1\n"
]
} | 2CODEFORCES
|
1012_E. Cycle sort_7 | You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following operation any number of times: select several distinct indices i_1, i_2, ..., i_k (1 ≤ i_j ≤ n) and move the number standing at the position i_1 to the position i_2, the number at the position i_2 to the position i_3, ..., the number at the position i_k to the position i_1. In other words, the operation cyclically shifts elements: i_1 → i_2 → … i_k → i_1.
For example, if you have n=4, an array a_1=10, a_2=20, a_3=30, a_4=40, and you choose three indices i_1=2, i_2=1, i_3=4, then the resulting array would become a_1=20, a_2=40, a_3=30, a_4=10.
Your goal is to make the array sorted in non-decreasing order with the minimum number of operations. The additional constraint is that the sum of cycle lengths over all operations should be less than or equal to a number s. If it's impossible to sort the array while satisfying that constraint, your solution should report that as well.
Input
The first line of the input contains two integers n and s (1 ≤ n ≤ 200 000, 0 ≤ s ≤ 200 000)—the number of elements in the array and the upper bound on the sum of cycle lengths.
The next line contains n integers a_1, a_2, ..., a_n—elements of the array (1 ≤ a_i ≤ 10^9).
Output
If it's impossible to sort the array using cycles of total length not exceeding s, print a single number "-1" (quotes for clarity).
Otherwise, print a single number q— the minimum number of operations required to sort the array.
On the next 2 ⋅ q lines print descriptions of operations in the order they are applied to the array. The description of i-th operation begins with a single line containing one integer k (1 ≤ k ≤ n)—the length of the cycle (that is, the number of selected indices). The next line should contain k distinct integers i_1, i_2, ..., i_k (1 ≤ i_j ≤ n)—the indices of the cycle.
The sum of lengths of these cycles should be less than or equal to s, and the array should be sorted after applying these q operations.
If there are several possible answers with the optimal q, print any of them.
Examples
Input
5 5
3 2 3 1 1
Output
1
5
1 4 2 3 5
Input
4 3
2 1 4 3
Output
-1
Input
2 0
2 2
Output
0
Note
In the first example, it's also possible to sort the array with two operations of total length 5: first apply the cycle 1 → 4 → 1 (of length 2), then apply the cycle 2 → 3 → 5 → 2 (of length 3). However, it would be wrong answer as you're asked to use the minimal possible number of operations, which is 1 in that case.
In the second example, it's possible to the sort the array with two cycles of total length 4 (1 → 2 → 1 and 3 → 4 → 3). However, it's impossible to achieve the same using shorter cycles, which is required by s=3.
In the third example, the array is already sorted, so no operations are needed. Total length of empty set of cycles is considered to be zero. | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.util.Random;
import java.util.ArrayList;
import java.io.UncheckedIOException;
import java.util.List;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) throws Exception {
Thread thread = new Thread(null, new TaskAdapter(), "", 1 << 27);
thread.start();
thread.join();
}
static class TaskAdapter implements Runnable {
@Override
public void run() {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastInput in = new FastInput(inputStream);
FastOutput out = new FastOutput(outputStream);
ECycleSort solver = new ECycleSort();
solver.solve(1, in, out);
out.close();
}
}
static class ECycleSort {
int n;
int[] a;
public void solve(int testNumber, FastInput in, FastOutput out) {
n = in.readInt();
int s = in.readInt();
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = in.readInt();
}
int[] b = a.clone();
Randomized.shuffle(b);
Arrays.sort(b);
int[] same = new int[n];
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i]) {
same[i] = 1;
}
}
for (int x : same) {
sum += x;
}
if (n - sum > s) {
out.println(-1);
return;
}
IntegerList permList = new IntegerList(n);
for (int i = 0; i < n; i++) {
if (same[i] == 0) {
permList.add(i);
}
}
int[] perm = permList.toArray();
CompareUtils.quickSort(perm, (x, y) -> Integer.compare(a[x], a[y]), 0, perm.length);
DSU dsu = new DSU(n);
for (int i = 0; i < perm.length; i++) {
int from = perm[i];
int to = permList.get(i);
dsu.merge(from, to);
}
for (int i = 1; i < perm.length; i++) {
if (a[perm[i]] != a[perm[i - 1]]) {
continue;
}
if (dsu.find(perm[i]) == dsu.find(perm[i - 1])) {
continue;
}
dsu.merge(perm[i], perm[i - 1]);
SequenceUtils.swap(perm, i, i - 1);
}
IntegerList first = new IntegerList();
if (perm.length > 0) {
int remain = s - (n - sum) - 1;
first.add(perm[0]);
for (int i = 1; remain > 0 && i < perm.length; i++) {
if (dsu.find(perm[i - 1]) != dsu.find(perm[i])) {
remain--;
first.add(perm[i]);
dsu.merge(perm[i - 1], perm[i]);
}
}
int last = a[first.get(0)];
for (int i = 1; i < first.size(); i++) {
int y = first.get(i);
int tmp = a[y];
a[y] = last;
last = tmp;
}
a[first.get(0)] = last;
//System.err.println(Arrays.toString(a));
}
List<IntegerList> circles = new ArrayList<>();
if (first.size() > 1) {
circles.add(first);
}
circles.addAll(solve());
out.println(circles.size());
for (IntegerList list : circles) {
out.println(list.size());
for (int i = 0; i < list.size(); i++) {
out.append(list.get(i) + 1).append(' ');
}
out.println();
}
}
public List<IntegerList> solve() {
int[] b = a.clone();
Randomized.shuffle(b);
Arrays.sort(b);
int[] same = new int[n];
for (int i = 0; i < n; i++) {
if (a[i] == b[i]) {
same[i] = 1;
}
}
IntegerList permList = new IntegerList(n);
for (int i = 0; i < n; i++) {
if (same[i] == 0) {
permList.add(i);
}
}
int[] perm = permList.toArray();
CompareUtils.quickSort(perm, (x, y) -> Integer.compare(a[x], a[y]), 0, perm.length);
DSU dsu = new DSU(n);
for (int i = 0; i < perm.length; i++) {
int from = perm[i];
int to = permList.get(i);
dsu.merge(from, to);
}
for (int i = 1; i < perm.length; i++) {
if (a[perm[i]] != a[perm[i - 1]]) {
continue;
}
if (dsu.find(perm[i]) == dsu.find(perm[i - 1])) {
continue;
}
dsu.merge(perm[i], perm[i - 1]);
SequenceUtils.swap(perm, i, i - 1);
}
int[] index = new int[n];
for (int i = 0; i < n; i++) {
if (same[i] == 1) {
index[i] = i;
}
}
for (int i = 0; i < perm.length; i++) {
index[perm[i]] = permList.get(i);
}
PermutationUtils.PowerPermutation pp = new PermutationUtils.PowerPermutation(index);
List<IntegerList> circles = pp.extractCircles(2);
return circles;
}
}
static class Randomized {
private static Random random = new Random(0);
public static void shuffle(int[] data) {
shuffle(data, 0, data.length - 1);
}
public static void shuffle(int[] data, int from, int to) {
to--;
for (int i = from; i <= to; i++) {
int s = nextInt(i, to);
int tmp = data[i];
data[i] = data[s];
data[s] = tmp;
}
}
public static int nextInt(int l, int r) {
return random.nextInt(r - l + 1) + l;
}
}
static class SequenceUtils {
public static void swap(int[] data, int i, int j) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
public static boolean equal(int[] a, int al, int ar, int[] b, int bl, int br) {
if ((ar - al) != (br - bl)) {
return false;
}
for (int i = al, j = bl; i <= ar; i++, j++) {
if (a[i] != b[j]) {
return false;
}
}
return true;
}
}
static class FastInput {
private final InputStream is;
private byte[] buf = new byte[1 << 20];
private int bufLen;
private int bufOffset;
private int next;
public FastInput(InputStream is) {
this.is = is;
}
private int read() {
while (bufLen == bufOffset) {
bufOffset = 0;
try {
bufLen = is.read(buf);
} catch (IOException e) {
bufLen = -1;
}
if (bufLen == -1) {
return -1;
}
}
return buf[bufOffset++];
}
public void skipBlank() {
while (next >= 0 && next <= 32) {
next = read();
}
}
public int readInt() {
int sign = 1;
skipBlank();
if (next == '+' || next == '-') {
sign = next == '+' ? 1 : -1;
next = read();
}
int val = 0;
if (sign == 1) {
while (next >= '0' && next <= '9') {
val = val * 10 + next - '0';
next = read();
}
} else {
while (next >= '0' && next <= '9') {
val = val * 10 - next + '0';
next = read();
}
}
return val;
}
}
static class FastOutput implements AutoCloseable, Closeable, Appendable {
private StringBuilder cache = new StringBuilder(10 << 20);
private final Writer os;
public FastOutput append(CharSequence csq) {
cache.append(csq);
return this;
}
public FastOutput append(CharSequence csq, int start, int end) {
cache.append(csq, start, end);
return this;
}
public FastOutput(Writer os) {
this.os = os;
}
public FastOutput(OutputStream os) {
this(new OutputStreamWriter(os));
}
public FastOutput append(char c) {
cache.append(c);
return this;
}
public FastOutput append(int c) {
cache.append(c);
return this;
}
public FastOutput println(int c) {
cache.append(c);
println();
return this;
}
public FastOutput println() {
cache.append(System.lineSeparator());
return this;
}
public FastOutput flush() {
try {
os.append(cache);
os.flush();
cache.setLength(0);
} catch (IOException e) {
throw new UncheckedIOException(e);
}
return this;
}
public void close() {
flush();
try {
os.close();
} catch (IOException e) {
throw new UncheckedIOException(e);
}
}
public String toString() {
return cache.toString();
}
}
static class IntegerList implements Cloneable {
private int size;
private int cap;
private int[] data;
private static final int[] EMPTY = new int[0];
public IntegerList(int cap) {
this.cap = cap;
if (cap == 0) {
data = EMPTY;
} else {
data = new int[cap];
}
}
public IntegerList(IntegerList list) {
this.size = list.size;
this.cap = list.cap;
this.data = Arrays.copyOf(list.data, size);
}
public IntegerList() {
this(0);
}
public void ensureSpace(int req) {
if (req > cap) {
while (cap < req) {
cap = Math.max(cap + 10, 2 * cap);
}
data = Arrays.copyOf(data, cap);
}
}
private void checkRange(int i) {
if (i < 0 || i >= size) {
throw new ArrayIndexOutOfBoundsException();
}
}
public int get(int i) {
checkRange(i);
return data[i];
}
public void add(int x) {
ensureSpace(size + 1);
data[size++] = x;
}
public void addAll(int[] x, int offset, int len) {
ensureSpace(size + len);
System.arraycopy(x, offset, data, size, len);
size += len;
}
public void addAll(IntegerList list) {
addAll(list.data, 0, list.size);
}
public int size() {
return size;
}
public int[] toArray() {
return Arrays.copyOf(data, size);
}
public String toString() {
return Arrays.toString(toArray());
}
public boolean equals(Object obj) {
if (!(obj instanceof IntegerList)) {
return false;
}
IntegerList other = (IntegerList) obj;
return SequenceUtils.equal(data, 0, size - 1, other.data, 0, other.size - 1);
}
public int hashCode() {
int h = 1;
for (int i = 0; i < size; i++) {
h = h * 31 + Integer.hashCode(data[i]);
}
return h;
}
public IntegerList clone() {
IntegerList ans = new IntegerList(size);
ans.addAll(this);
return ans;
}
}
static class DSU {
int[] p;
int[] rank;
public DSU(int n) {
p = new int[n];
rank = new int[n];
reset();
}
public void reset() {
for (int i = 0; i < p.length; i++) {
p[i] = i;
rank[i] = 0;
}
}
public int find(int a) {
return p[a] == p[p[a]] ? p[a] : (p[a] = find(p[a]));
}
public void merge(int a, int b) {
a = find(a);
b = find(b);
if (a == b) {
return;
}
if (rank[a] == rank[b]) {
rank[a]++;
}
if (rank[a] > rank[b]) {
p[b] = a;
} else {
p[a] = b;
}
}
}
static interface IntComparator {
public int compare(int a, int b);
}
static class PermutationUtils {
private static final long[] PERMUTATION_CNT = new long[21];
static {
PERMUTATION_CNT[0] = 1;
for (int i = 1; i <= 20; i++) {
PERMUTATION_CNT[i] = PERMUTATION_CNT[i - 1] * i;
}
}
public static class PowerPermutation {
int[] g;
int[] idx;
int[] l;
int[] r;
int n;
public List<IntegerList> extractCircles(int threshold) {
List<IntegerList> ans = new ArrayList<>(n);
for (int i = 0; i < n; i = r[i] + 1) {
int size = r[i] - l[i] + 1;
if (size < threshold) {
continue;
}
IntegerList list = new IntegerList(r[i] - l[i] + 1);
for (int j = l[i]; j <= r[i]; j++) {
list.add(g[j]);
}
ans.add(list);
}
return ans;
}
public PowerPermutation(int[] p) {
this(p, p.length);
}
public PowerPermutation(int[] p, int len) {
n = len;
boolean[] visit = new boolean[n];
g = new int[n];
l = new int[n];
r = new int[n];
idx = new int[n];
int wpos = 0;
for (int i = 0; i < n; i++) {
int val = p[i];
if (visit[val]) {
continue;
}
visit[val] = true;
g[wpos] = val;
l[wpos] = wpos;
idx[val] = wpos;
wpos++;
while (true) {
int x = p[g[wpos - 1]];
if (visit[x]) {
break;
}
visit[x] = true;
g[wpos] = x;
l[wpos] = l[wpos - 1];
idx[x] = wpos;
wpos++;
}
for (int j = l[wpos - 1]; j < wpos; j++) {
r[j] = wpos - 1;
}
}
}
public int apply(int x, int p) {
int i = idx[x];
int dist = DigitUtils.mod((i - l[i]) + p, r[i] - l[i] + 1);
return g[dist + l[i]];
}
public String toString() {
StringBuilder builder = new StringBuilder();
for (int i = 0; i < n; i++) {
builder.append(apply(i, 1)).append(' ');
}
return builder.toString();
}
}
}
static class CompareUtils {
private static final int THRESHOLD = 4;
private CompareUtils() {
}
public static <T> void insertSort(int[] data, IntComparator cmp, int l, int r) {
for (int i = l + 1; i <= r; i++) {
int j = i;
int val = data[i];
while (j > l && cmp.compare(data[j - 1], val) > 0) {
data[j] = data[j - 1];
j--;
}
data[j] = val;
}
}
public static void quickSort(int[] data, IntComparator cmp, int f, int t) {
if (t - f <= THRESHOLD) {
insertSort(data, cmp, f, t - 1);
return;
}
SequenceUtils.swap(data, f, Randomized.nextInt(f, t - 1));
int l = f;
int r = t;
int m = l + 1;
while (m < r) {
int c = cmp.compare(data[m], data[l]);
if (c == 0) {
m++;
} else if (c < 0) {
SequenceUtils.swap(data, l, m);
l++;
m++;
} else {
SequenceUtils.swap(data, m, --r);
}
}
quickSort(data, cmp, f, l);
quickSort(data, cmp, m, t);
}
}
static class DigitUtils {
private DigitUtils() {
}
public static int mod(int x, int mod) {
x %= mod;
if (x < 0) {
x += mod;
}
return x;
}
}
}
| 4JAVA
| {
"input": [
"5 5\n3 2 3 1 1\n",
"4 3\n2 1 4 3\n",
"2 0\n2 2\n",
"5 0\n884430748 884430748 708433020 708433020 708433020\n",
"2 1\n1 1\n",
"2 0\n2 1\n",
"5 2\n65390026 770505072 65390026 65390026 65390026\n",
"5 4\n812067558 674124159 106041640 106041640 674124159\n",
"5 4\n167616600 574805150 651016425 150949603 379708534\n",
"5 5\n472778319 561757623 989296065 99763286 352037329\n",
"5 4\n201429826 845081337 219611799 598937628 680006294\n",
"2 2\n2 1\n",
"5 0\n1000000000 1000000000 1000000000 1000000000 1000000000\n",
"5 6\n971458729 608568364 891718769 464295315 98863653\n",
"5 5\n641494999 641494999 228574099 535883079 535883079\n",
"5 5\n815605413 4894095 624809427 264202135 152952491\n",
"1 0\n258769137\n",
"2 0\n1 1\n",
"1 0\n2\n",
"5 4\n335381650 691981363 691981363 335381650 335381650\n",
"5 4\n81224924 319704343 319704343 210445208 128525140\n",
"5 4\n579487081 564229995 665920667 665920667 644707366\n",
"5 200000\n682659092 302185582 518778252 29821187 14969298\n",
"5 0\n884430748 884430748 182474629 708433020 708433020\n",
"5 2\n65390026 1454694739 65390026 65390026 65390026\n",
"5 4\n167616600 574805150 651016425 232181430 379708534\n",
"5 4\n201429826 845081337 219611799 598937628 1013339305\n",
"2 2\n4 1\n",
"5 6\n971458729 608568364 891718769 268781113 98863653\n",
"5 5\n539341452 4894095 624809427 264202135 152952491\n",
"1 0\n483419747\n",
"5 4\n579487081 564229995 288357375 665920667 644707366\n",
"5 200000\n682659092 302185582 185982759 29821187 14969298\n",
"4 3\n2 2 6 3\n",
"5 4\n201429826 845081337 219611799 1097635109 1811343985\n",
"5 6\n335381650 691981363 484551438 335381650 201569796\n",
"5 1\n641494999 641494999 228574099 535883079 535883079\n",
"1 0\n1\n",
"5 4\n335381650 691981363 691981363 335381650 201569796\n",
"5 1\n81224924 319704343 319704343 210445208 128525140\n",
"4 3\n2 1 6 3\n",
"5 -1\n884430748 884430748 182474629 708433020 708433020\n",
"5 2\n65390026 1454694739 65390026 65390026 100733760\n",
"0 4\n167616600 574805150 651016425 232181430 379708534\n",
"5 4\n201429826 845081337 219611799 598937628 1811343985\n",
"1 2\n4 1\n",
"5 3\n971458729 608568364 891718769 268781113 98863653\n",
"5 0\n641494999 641494999 228574099 535883079 535883079\n",
"5 2\n539341452 4894095 624809427 264202135 152952491\n",
"1 1\n483419747\n",
"0 0\n1\n",
"5 4\n335381650 691981363 484551438 335381650 201569796\n",
"5 1\n81224924 413380565 319704343 210445208 128525140\n",
"5 4\n579487081 564229995 288357375 946230441 644707366\n",
"5 200000\n682659092 302185582 185982759 20056766 14969298\n",
"5 -1\n884430748 884430748 267312749 708433020 708433020\n",
"5 2\n501175 1454694739 65390026 65390026 100733760\n",
"0 4\n167616600 90071718 651016425 232181430 379708534\n",
"1 2\n6 1\n",
"5 3\n971458729 341020287 891718769 268781113 98863653\n",
"5 -1\n641494999 641494999 228574099 535883079 535883079\n",
"5 2\n539341452 4894095 624809427 264202135 209695341\n",
"1 1\n682471575\n",
"0 0\n2\n",
"3 1\n81224924 413380565 319704343 210445208 128525140\n",
"5 4\n579487081 92588299 288357375 946230441 644707366\n"
],
"output": [
"1\n5\n1 4 2 3 5 \n",
"-1\n",
"0\n",
"-1\n",
"0\n",
"-1\n",
"1\n2\n2 5 \n",
"-1\n",
"-1\n",
"1\n5\n1 3 5 2 4 \n",
"1\n4\n2 5 4 3 \n",
"1\n2\n1 2 \n",
"0\n",
"2\n2\n1 5\n3\n2 3 4\n",
"1\n5\n1 4 2 5 3 \n",
"2\n3\n1 5 2\n2\n3 4\n",
"0\n",
"0\n",
"0\n",
"1\n4\n2 4 3 5 \n",
"1\n4\n2 4 3 5 \n",
"2\n2\n1 2\n2\n3 5\n",
"2\n2\n1 5\n3\n2 3 4\n",
"-1\n",
"1\n2\n2 5 \n",
"2\n2\n2 4 \n2\n3 5 \n",
"1\n3\n2 4 3 \n",
"1\n2\n1 2 \n",
"2\n2\n1 5 \n3\n2 3 4 \n",
"1\n5\n1 4 3 5 2 \n",
"0\n",
"2\n2\n1 3 \n2\n4 5 \n",
"2\n2\n1 5 \n2\n2 4 \n",
"1\n2\n3 4 \n",
"1\n2\n2 3 \n",
"1\n5\n1 3 4 2 5 \n",
"-1\n",
"0\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"0\n",
"1\n3\n2 4 3 \n",
"0\n",
"-1\n",
"-1\n",
"-1\n",
"0\n",
"0\n",
"-1\n",
"-1\n",
"2\n2\n1 3 \n2\n4 5 \n",
"2\n2\n1 5 \n2\n2 4 \n",
"-1\n",
"-1\n",
"0\n",
"0\n",
"-1\n",
"-1\n",
"-1\n",
"0\n",
"0\n",
"-1\n",
"-1\n"
]
} | 2CODEFORCES
|
1037_E. Trips_8 | There are n persons who initially don't know each other. On each morning, two of them, who were not friends before, become friends.
We want to plan a trip for every evening of m days. On each trip, you have to select a group of people that will go on the trip. For every person, one of the following should hold:
* Either this person does not go on the trip,
* Or at least k of his friends also go on the trip.
Note that the friendship is not transitive. That is, if a and b are friends and b and c are friends, it does not necessarily imply that a and c are friends.
For each day, find the maximum number of people that can go on the trip on that day.
Input
The first line contains three integers n, m, and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ m ≤ 2 ⋅ 10^5, 1 ≤ k < n) — the number of people, the number of days and the number of friends each person on the trip should have in the group.
The i-th (1 ≤ i ≤ m) of the next m lines contains two integers x and y (1≤ x, y≤ n, x≠ y), meaning that persons x and y become friends on the morning of day i. It is guaranteed that x and y were not friends before.
Output
Print exactly m lines, where the i-th of them (1≤ i≤ m) contains the maximum number of people that can go on the trip on the evening of the day i.
Examples
Input
4 4 2
2 3
1 2
1 3
1 4
Output
0
0
3
3
Input
5 8 2
2 1
4 2
5 4
5 2
4 3
5 1
4 1
3 2
Output
0
0
0
3
3
4
4
5
Input
5 7 2
1 5
3 2
2 5
3 4
1 2
5 3
1 3
Output
0
0
0
0
3
4
4
Note
In the first example,
* 1,2,3 can go on day 3 and 4.
In the second example,
* 2,4,5 can go on day 4 and 5.
* 1,2,4,5 can go on day 6 and 7.
* 1,2,3,4,5 can go on day 8.
In the third example,
* 1,2,5 can go on day 5.
* 1,2,3,5 can go on day 6 and 7. |
import sys
range = xrange
n,m,k = [int(x) for x in sys.stdin.readline().split()]
inp = [int(x)-1 for x in sys.stdin.read().split()]
ii = 0
coupl = [[] for _ in range(n)]
time = [[] for _ in range(n)]
nfr = [0]*n
for i in range(m):
a,b = inp[ii],inp[ii+1]
ii += 2
coupl[a].append(b)
coupl[b].append(a)
time[a].append(i)
time[b].append(i)
nfr[a] += 1
nfr[b] += 1
notf = 0
rem = [i for i in range(n) if nfr[i]<k]
while rem:
node = rem.pop()
notf += 1
for nei in coupl[node]:
if nfr[nei]==k:
rem.append(nei)
nfr[nei]-=1
out = []
for j in reversed(range(m)):
out.append(n-notf)
a,b = inp[j*2],inp[j*2+1]
nfra = nfr[a]
nfrb = nfr[b]
if nfra>=k:
if nfrb==k:
rem.append(b)
nfr[b]-=1
if nfrb>=k:
if nfra==k:
rem.append(a)
nfr[a]-=1
while rem:
node = rem.pop()
notf += 1
for i in range(len(coupl[node])):
nei = coupl[node][i]
t = time[node][i]
if t<j:
if nfr[nei]==k:
rem.append(nei)
nfr[nei]-=1
print '\n'.join(str(x) for x in reversed(out)) | 1Python2
| {
"input": [
"4 4 2\n2 3\n1 2\n1 3\n1 4\n",
"5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"5 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 1\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 2\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 3\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 2\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n9 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 5\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n4 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n6 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n3 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n7 1\n3 2\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 3\n2 1\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n19 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 23\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 16\n",
"27 20 3\n10 3\n5 1\n20 2\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n25 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 7\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 24\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n3 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n2 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n2 7\n8 15\n"
],
"output": [
"0\n0\n3\n3\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n7\n7\n7\n7\n7\n11\n11\n11\n11\n15\n15\n15\n15\n16\n",
"2\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n13\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n13\n13\n13\n13\n14\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n12\n12\n13\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n11\n11\n12\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n15\n15\n16\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n6\n6\n6\n6\n6\n10\n10\n12\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n10\n10\n10\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n4\n4\n4\n4\n11\n11\n11\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n7\n7\n9\n10\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n12\n12\n12\n",
"0\n0\n0\n0\n3\n5\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n9\n9\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n10\n12\n12\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n"
]
} | 2CODEFORCES
|
1037_E. Trips_9 | There are n persons who initially don't know each other. On each morning, two of them, who were not friends before, become friends.
We want to plan a trip for every evening of m days. On each trip, you have to select a group of people that will go on the trip. For every person, one of the following should hold:
* Either this person does not go on the trip,
* Or at least k of his friends also go on the trip.
Note that the friendship is not transitive. That is, if a and b are friends and b and c are friends, it does not necessarily imply that a and c are friends.
For each day, find the maximum number of people that can go on the trip on that day.
Input
The first line contains three integers n, m, and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ m ≤ 2 ⋅ 10^5, 1 ≤ k < n) — the number of people, the number of days and the number of friends each person on the trip should have in the group.
The i-th (1 ≤ i ≤ m) of the next m lines contains two integers x and y (1≤ x, y≤ n, x≠ y), meaning that persons x and y become friends on the morning of day i. It is guaranteed that x and y were not friends before.
Output
Print exactly m lines, where the i-th of them (1≤ i≤ m) contains the maximum number of people that can go on the trip on the evening of the day i.
Examples
Input
4 4 2
2 3
1 2
1 3
1 4
Output
0
0
3
3
Input
5 8 2
2 1
4 2
5 4
5 2
4 3
5 1
4 1
3 2
Output
0
0
0
3
3
4
4
5
Input
5 7 2
1 5
3 2
2 5
3 4
1 2
5 3
1 3
Output
0
0
0
0
3
4
4
Note
In the first example,
* 1,2,3 can go on day 3 and 4.
In the second example,
* 2,4,5 can go on day 4 and 5.
* 1,2,4,5 can go on day 6 and 7.
* 1,2,3,4,5 can go on day 8.
In the third example,
* 1,2,5 can go on day 5.
* 1,2,3,5 can go on day 6 and 7. | #include <bits/stdc++.h>
using namespace std;
const int module = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<set<int>> to(n, set<int>());
vector<pair<int, int>> edges(m);
vector<int> nbr(n);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
nbr[a]++;
nbr[b]++;
to[a].insert(b);
to[b].insert(a);
edges[i] = {a, b};
}
vector<bool> vis(n);
int all = n;
for (int i = 0; i < n; ++i) {
if (!vis[i]) {
if (nbr[i] < k) {
queue<int> q;
q.push(i);
vis[i] = true;
all--;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int t : to[cur]) {
nbr[t]--;
to[t].erase(cur);
if (nbr[t] < k && !vis[t]) {
q.push(t);
vis[t] = true;
all--;
}
}
}
}
}
}
queue<int> q;
vector<int> answer;
answer.push_back(all);
for (int i = m - 1; i > 0; i--) {
auto [a, b] = edges[i];
if (!vis[a] && !vis[b]) {
to[a].erase(b);
to[b].erase(a);
nbr[a]--;
nbr[b]--;
if (nbr[a] < k) {
q.push(a);
vis[a] = true;
all--;
}
if (nbr[b] < k) {
q.push(b);
vis[b] = true;
all--;
}
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int t : to[cur]) {
nbr[t]--;
to[t].erase(cur);
if (nbr[t] < k && !vis[t]) {
q.push(t);
vis[t] = true;
all--;
}
}
}
}
answer.push_back(all);
}
for (int i = answer.size() - 1; i >= 0; i--) {
cout << answer[i] << "\n";
}
}
| 2C++
| {
"input": [
"4 4 2\n2 3\n1 2\n1 3\n1 4\n",
"5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"5 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 1\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 2\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 3\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 2\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n9 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 5\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n4 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n6 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n3 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n7 1\n3 2\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 3\n2 1\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n19 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 23\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 16\n",
"27 20 3\n10 3\n5 1\n20 2\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n25 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 7\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 24\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n3 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n2 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n2 7\n8 15\n"
],
"output": [
"0\n0\n3\n3\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n7\n7\n7\n7\n7\n11\n11\n11\n11\n15\n15\n15\n15\n16\n",
"2\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n13\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n13\n13\n13\n13\n14\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n12\n12\n13\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n11\n11\n12\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n15\n15\n16\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n6\n6\n6\n6\n6\n10\n10\n12\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n10\n10\n10\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n4\n4\n4\n4\n11\n11\n11\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n7\n7\n9\n10\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n12\n12\n12\n",
"0\n0\n0\n0\n3\n5\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n9\n9\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n10\n12\n12\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n"
]
} | 2CODEFORCES
|
1037_E. Trips_10 | There are n persons who initially don't know each other. On each morning, two of them, who were not friends before, become friends.
We want to plan a trip for every evening of m days. On each trip, you have to select a group of people that will go on the trip. For every person, one of the following should hold:
* Either this person does not go on the trip,
* Or at least k of his friends also go on the trip.
Note that the friendship is not transitive. That is, if a and b are friends and b and c are friends, it does not necessarily imply that a and c are friends.
For each day, find the maximum number of people that can go on the trip on that day.
Input
The first line contains three integers n, m, and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ m ≤ 2 ⋅ 10^5, 1 ≤ k < n) — the number of people, the number of days and the number of friends each person on the trip should have in the group.
The i-th (1 ≤ i ≤ m) of the next m lines contains two integers x and y (1≤ x, y≤ n, x≠ y), meaning that persons x and y become friends on the morning of day i. It is guaranteed that x and y were not friends before.
Output
Print exactly m lines, where the i-th of them (1≤ i≤ m) contains the maximum number of people that can go on the trip on the evening of the day i.
Examples
Input
4 4 2
2 3
1 2
1 3
1 4
Output
0
0
3
3
Input
5 8 2
2 1
4 2
5 4
5 2
4 3
5 1
4 1
3 2
Output
0
0
0
3
3
4
4
5
Input
5 7 2
1 5
3 2
2 5
3 4
1 2
5 3
1 3
Output
0
0
0
0
3
4
4
Note
In the first example,
* 1,2,3 can go on day 3 and 4.
In the second example,
* 2,4,5 can go on day 4 and 5.
* 1,2,4,5 can go on day 6 and 7.
* 1,2,3,4,5 can go on day 8.
In the third example,
* 1,2,5 can go on day 5.
* 1,2,3,5 can go on day 6 and 7. | from collections import deque
def solve(adj, m, k, uv):
n = len(adj)
nn = [len(a) for a in adj]
q = deque()
for i in range(n):
if nn[i] < k:
q.append(i)
while q:
v = q.popleft()
for u in adj[v]:
nn[u] -= 1
if nn[u] == k-1:
q.append(u)
res = [0]*m
nk = len([1 for i in nn if i >= k])
res[-1] = nk
for i in range(m-1, 0, -1):
u1, v1 = uv[i]
if nn[u1] < k or nn[v1] < k:
res[i - 1] = nk
continue
if nn[u1] == k:
q.append(u1)
nn[u1] -= 1
if not q and nn[v1] == k:
q.append(v1)
nn[v1] -= 1
if not q:
nn[u1] -= 1
nn[v1] -= 1
adj[u1].remove(v1)
adj[v1].remove(u1)
while q:
v = q.popleft()
nk -= 1
for u in adj[v]:
nn[u] -= 1
if nn[u] == k - 1:
q.append(u)
res[i - 1] = nk
return res
n, m, k = map(int, input().split())
a = [set() for i in range(n)]
uv = []
for i in range(m):
u, v = map(int, input().split())
a[u - 1].add(v - 1)
a[v - 1].add(u - 1)
uv.append((u-1, v-1))
res = solve(a, m, k, uv)
print(str(res)[1:-1].replace(' ', '').replace(',', '\n')) | 3Python3
| {
"input": [
"4 4 2\n2 3\n1 2\n1 3\n1 4\n",
"5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"5 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 1\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 2\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 3\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 2\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n9 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 5\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n4 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n6 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n3 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n7 1\n3 2\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 3\n2 1\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n19 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 23\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 16\n",
"27 20 3\n10 3\n5 1\n20 2\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n25 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 7\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 24\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n3 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n2 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n2 7\n8 15\n"
],
"output": [
"0\n0\n3\n3\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n7\n7\n7\n7\n7\n11\n11\n11\n11\n15\n15\n15\n15\n16\n",
"2\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n13\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n13\n13\n13\n13\n14\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n12\n12\n13\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n11\n11\n12\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n15\n15\n16\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n6\n6\n6\n6\n6\n10\n10\n12\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n10\n10\n10\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n4\n4\n4\n4\n11\n11\n11\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n7\n7\n9\n10\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n12\n12\n12\n",
"0\n0\n0\n0\n3\n5\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n9\n9\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n10\n12\n12\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n"
]
} | 2CODEFORCES
|
1037_E. Trips_11 | There are n persons who initially don't know each other. On each morning, two of them, who were not friends before, become friends.
We want to plan a trip for every evening of m days. On each trip, you have to select a group of people that will go on the trip. For every person, one of the following should hold:
* Either this person does not go on the trip,
* Or at least k of his friends also go on the trip.
Note that the friendship is not transitive. That is, if a and b are friends and b and c are friends, it does not necessarily imply that a and c are friends.
For each day, find the maximum number of people that can go on the trip on that day.
Input
The first line contains three integers n, m, and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ m ≤ 2 ⋅ 10^5, 1 ≤ k < n) — the number of people, the number of days and the number of friends each person on the trip should have in the group.
The i-th (1 ≤ i ≤ m) of the next m lines contains two integers x and y (1≤ x, y≤ n, x≠ y), meaning that persons x and y become friends on the morning of day i. It is guaranteed that x and y were not friends before.
Output
Print exactly m lines, where the i-th of them (1≤ i≤ m) contains the maximum number of people that can go on the trip on the evening of the day i.
Examples
Input
4 4 2
2 3
1 2
1 3
1 4
Output
0
0
3
3
Input
5 8 2
2 1
4 2
5 4
5 2
4 3
5 1
4 1
3 2
Output
0
0
0
3
3
4
4
5
Input
5 7 2
1 5
3 2
2 5
3 4
1 2
5 3
1 3
Output
0
0
0
0
3
4
4
Note
In the first example,
* 1,2,3 can go on day 3 and 4.
In the second example,
* 2,4,5 can go on day 4 and 5.
* 1,2,4,5 can go on day 6 and 7.
* 1,2,3,4,5 can go on day 8.
In the third example,
* 1,2,5 can go on day 5.
* 1,2,3,5 can go on day 6 and 7. | import java.io.*;
import java.util.*;
public class Test {
static int readInt() {
int ans = 0;
boolean neg = false;
try {
boolean start = false;
for (int c = 0; (c = System.in.read()) != -1; ) {
if (c == '-') {
start = true;
neg = true;
continue;
} else if (c >= '0' && c <= '9') {
start = true;
ans = ans * 10 + c - '0';
} else if (start) break;
}
} catch (IOException e) {
}
return neg ? -ans : ans;
}
static long readLong() {
long ans = 0;
boolean neg = false;
try {
boolean start = false;
for (int c = 0; (c = System.in.read()) != -1; ) {
if (c == '-') {
start = true;
neg = true;
continue;
} else if (c >= '0' && c <= '9') {
start = true;
ans = ans * 10 + c - '0';
} else if (start) break;
}
} catch (IOException e) {
}
return neg ? -ans : ans;
}
static String readString() {
StringBuilder b = new StringBuilder();
try {
boolean start = false;
for (int c = 0; (c = System.in.read()) != -1; ) {
if (c >= '0' && c <= '9') {
start = true;
b.append((char) (c));
} else if (start) break;
}
} catch (IOException e) {
}
return b.toString().trim();
}
static PrintWriter writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
void start() {
int n = readInt(), m = readInt(), k = readInt();
int[] from = new int[m], to = new int[m];
int[] q = new int[n];
Set<Integer>[] g = new Set[n + 1];
for (int i = 1; i <= n; i++) g[i] = new HashSet<>();
for (int i = 0; i < m; i++) {
int u = readInt(), v = readInt();
g[u].add(v);
g[v].add(u);
from[i] = u;
to[i] = v;
}
TreeSet<Integer> f = new TreeSet<>();
int a = 0, b = 0;
for (int i = 1; i <= n; i++)
if (g[i].size() < k) q[b++] = i;
else f.add(i);
while (a < b) {
int u = q[a++];
for (int v : g[u]) {
g[v].remove(u);
if (g[v].size() == k - 1) {
f.remove(v);
q[b++] = v;
}
}
g[u].clear();
}
int[] ans = new int[m];
for (int i = m - 1; i >= 0; i--) {
ans[i] = f.size();
a = 0;
b = 0;
int u = from[i], v = to[i];
for (int x : new int[]{u, v}) {
g[x].remove(x == u ? v : u);
if (g[x].size() == k - 1) {
f.remove(x);
q[b++] = x;
}
}
while (a < b) {
u = q[a++];
for (int x : g[u]) {
g[x].remove(u);
if (g[x].size() == k - 1) {
f.remove(x);
q[b++] = x;
}
}
g[u].clear();
}
}
for (int i = 0; i < m; i++) writer.println(ans[i]);
}
public static void main(String[] args) {
Test te = new Test();
te.start();
writer.flush();
}
}
| 4JAVA
| {
"input": [
"4 4 2\n2 3\n1 2\n1 3\n1 4\n",
"5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"5 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 1\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 2\n2 1\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 3\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n3 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 2\n16 2\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n9 3\n10 2\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 5\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n7 15\n1 7\n8 15\n",
"9 7 2\n1 5\n4 2\n2 5\n3 4\n1 2\n5 3\n1 3\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n6 12\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n11 9\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n1 14\n3 15\n1 7\n8 15\n",
"9 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n7 1\n3 2\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"2 1 3\n2 1\n",
"27 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n19 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 3\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 23\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 2\n10 3\n5 1\n20 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 16\n",
"27 20 3\n10 3\n5 1\n20 2\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 7\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n25 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 7\n12 5\n7 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n2 6\n1 10\n11 16\n11 1\n16 4\n10 2\n14 4\n15 24\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"27 20 3\n10 3\n5 1\n20 5\n12 5\n13 6\n12 10\n3 6\n1 10\n11 16\n11 1\n16 4\n3 2\n14 4\n15 14\n3 13\n1 15\n1 8\n7 15\n1 7\n8 15\n",
"16 20 2\n10 3\n5 3\n13 5\n12 7\n7 6\n9 10\n2 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 14\n4 3\n13 15\n2 14\n7 15\n1 7\n8 15\n",
"16 20 2\n10 4\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 3\n10 3\n14 4\n15 14\n4 13\n13 3\n1 8\n7 15\n2 7\n8 15\n"
],
"output": [
"0\n0\n3\n3\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n7\n7\n7\n7\n7\n11\n11\n11\n11\n15\n15\n15\n15\n16\n",
"2\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n13\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n13\n13\n13\n13\n14\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n12\n12\n13\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n11\n11\n12\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n7\n7\n7\n7\n7\n9\n12\n12\n12\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n11\n11\n15\n15\n16\n",
"0\n0\n0\n0\n3\n4\n4\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n6\n6\n6\n6\n6\n10\n10\n12\n13\n14\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n10\n10\n10\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n4\n4\n4\n4\n11\n11\n11\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n7\n7\n9\n10\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n12\n12\n12\n",
"0\n0\n0\n0\n3\n5\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n4\n9\n9\n9\n9\n9\n9\n12\n12\n13\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n6\n6\n6\n6\n6\n9\n10\n12\n12\n",
"0\n0\n0\n3\n3\n4\n4\n5\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n14\n14\n14\n14\n15\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n",
"0\n0\n3\n3\n3\n3\n3\n3\n3\n3\n3\n7\n7\n7\n7\n7\n7\n10\n10\n11\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n5\n5\n8\n8\n9\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n5\n5\n5\n11\n11\n13\n13\n13\n",
"0\n0\n0\n0\n0\n0\n4\n4\n4\n4\n10\n10\n10\n10\n10\n12\n12\n14\n14\n15\n"
]
} | 2CODEFORCES
|
1060_A. Phone Numbers_12 | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone numbers as possible. Each card must be used in at most one phone number, and you don't have to use all cards. The phone numbers do not necessarily have to be distinct.
Input
The first line contains an integer n — the number of cards with digits that you have (1 ≤ n ≤ 100).
The second line contains a string of n digits (characters "0", "1", ..., "9") s_1, s_2, …, s_n. The string will not contain any other characters, such as leading or trailing spaces.
Output
If at least one phone number can be made from these cards, output the maximum number of phone numbers that can be made. Otherwise, output 0.
Examples
Input
11
00000000008
Output
1
Input
22
0011223344556677889988
Output
2
Input
11
31415926535
Output
0
Note
In the first example, one phone number, "8000000000", can be made from these cards.
In the second example, you can make two phone numbers from the cards, for example, "80123456789" and "80123456789".
In the third example you can't make any phone number from the given cards. | n=int(raw_input())
s=str(raw_input())
cou=s.count('8')
if cou==0 or n<11: print 0
else:
while n<11*cou: cou-=1
print cou
| 1Python2
| {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n",
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"54\n438283821340622774637957966575424773837418828888614203\n",
"100\n1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026\n",
"100\n2833898888858387469888804083887280788584887487186899808436848018181838884988432785338497585788803883\n",
"42\n885887846290886288816884858898812858495482\n",
"75\n878909759892888846183608689257806813376950958863798487856148633095072259838\n",
"11\n55814018693\n",
"31\n0868889888343881888987888838808\n",
"21\n888888888888000000000\n",
"62\n18888883884288488882387888486858887882838885288886472818688888\n",
"77\n11111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"30\n888888888888888888888888888888\n",
"64\n8885984815868480968883818886281846682409262501034555933863969284\n",
"44\n15920309219313427633220119270900111650391207\n",
"97\n4088468966684435599488804806521288358953088399738904557539253573051442198885776802972628197705081\n",
"100\n8800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n",
"50\n88888888888888888888888888888888888888888888888888\n",
"20\n88888888888888888888\n",
"32\n88888888888888888888888888888888\n",
"82\n8889809888888888485881851986857288588888888881988888868888836888887858888888888878\n",
"91\n8828880888888884883888488888888888888881888888888884888888848588888808888888888888888880888\n",
"87\n311753415808202195240425076966761033489788093280714672959929008324554784724650182457298\n",
"85\n6888887655188885918863889822590788834182048952565514598298586848861396753319582883848\n",
"100\n8088888818885808888888848829886788884187188858898888888788988688884828586988888888288078638898728181\n",
"21\n888111111111111111111\n",
"1\n8\n",
"93\n888088898748888038885888818882806848806887888888882087481868888888177809288888889648468888188\n",
"77\n11233392925013001334679215120076714945221576003953746107506364475115045309091\n",
"40\n8888888888888888888888888888888888888888\n",
"33\n888800000000000000000000000000000\n",
"21\n881234567900123456790\n",
"98\n87247250157776241281197787785951754485531639139778166755966603305697265958800376912432893847612736\n",
"90\n888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"22\n4215079217017196952791\n",
"99\n509170332523502565755650047942914747120102240396245453406790272793996913905060450414255616791704320\n",
"96\n812087553199958040928832802441581868680188987878748641868838838835609806814288472573117388803351\n",
"1\n0\n",
"100\n8888888888828188888888888888888808888888888888888888891888888768888888888288888885886888838888888888\n",
"11\n80000000000\n",
"86\n84065885114540280210185082984888812185222886689129308815942798404861082196041321701260\n",
"92\n86888880558884738878888381088888888895888881888888888368878888888884888768881888888888808888\n",
"76\n7900795570936733366353829649382870728119825830883973668601071678041634916557\n",
"32\n88000000000000000000000000000000\n",
"70\n8888888888888888888888888888888888888888888888888888888888888888888888\n",
"11\n88888888888\n",
"21\n888000000000000000000\n",
"66\n747099435917145962031075767196746707764157706291155762576312312094\n",
"22\n8899999999999999999999\n",
"11\n81234567123\n",
"41\n78888884888874788841882882888088888588888\n",
"10\n8888888888\n",
"100\n2867878187889776883889958480848802884888888878218089281860321588888888987288888884288488988628618888\n",
"66\n157941266854773786962397310504192100434183957442977444078457168272\n",
"44\n30153452341853403190257244993442815171970194\n",
"63\n728385948188688801288285888788852829888898565895847689806684688\n",
"100\n1835563855281170226095294644116563180561156535623048783710060508361834822227075869575873675232708159\n",
"21\n888888555555555555555\n",
"100\n8881888389882878867888888888888888888886388888888870888884878888089888883898887888808688888487888888\n",
"53\n85838985300863473289888099788588319484149888886832906\n",
"60\n888888888888888888888888888888888888888888888888888888888888\n",
"100\n8820286285185244938452488887088871457098945874486988698468788381417332842888928188688887641132194956\n",
"11\n24572366390\n",
"84\n181288888282608548858058871581888853888486785801381108858832882809848798828837386086\n",
"32\n88257478884887437239023185588797\n",
"99\n097167815527663544905782574817314139311067328533970663873718450545467450059059869618211361469505108\n",
"43\n7404899846883344886153727489084158470112581\n",
"100\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008\n",
"8\n12345678\n",
"88\n2694079127792970410465292300936220976260790323517221561516591792566791677970332966660472\n",
"21\n582586788289484878588\n",
"33\n270375004567749549929235905225024\n",
"50\n88000000000000000000000000000000000000000000000000\n",
"33\n429980628264468835720540136177288\n",
"27\n888000000000000000000000000\n",
"10\n8000000000\n",
"74\n70988894874867688968816582886488688881063425288316858438189808828755218508\n",
"22\n6188156585823394680191\n",
"81\n808888883488887888888808888888888888188888888388888888888888868688888488888882888\n",
"57\n888888888888888888888888888888888888888888888888888888888\n",
"100\n6451941807833681891890004306065158148809856572066617888008875119881621810329816763604830895480467878\n",
"83\n88584458884288808888588388818938838468960248387898182887888867888888888886088895788\n",
"11\n81234567090\n",
"21\n880000000000000000000\n",
"94\n8188948828818938226378510887848897889883818858778688882933888883888898198978868888808082461388\n",
"52\n8878588869084488848898838898788838337877898817818888\n",
"61\n8880888836888988888988888887388888888888868898887888818888888\n",
"71\n88888888888888888888888188888805848888788088888883888883187888838888888\n",
"95\n29488352815808808845913584782288724288898869488882098428839370889284838688458247785878848884289\n",
"73\n2185806538483837898808836883483888818818988881880688028788888081888907898\n",
"80\n88888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"55\n3982037603326093160114589190899881252765957832414122484\n",
"100\n8888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"51\n1732111733638718702525811518175029394157760329139501\n",
"55\n8150965228922987149322123425550549439018369681986057802\n",
"72\n129108839650139854381903715683735947815379560715643428841035623040980032\n",
"42\n1251996236006506309908626867460855811743437\n",
"11\n78451611424\n",
"31\n1288033400433082469939233589875\n",
"77\n11111111111111111111111111110111111111111111111111111111111111111111111111111\n",
"100\n6152069453350735030379611937645928787504993143655436498747601445943408903686298029084639414463403044\n",
"91\n14936165072891114728916862658660934186358455115509481550778215813586122858153579186424029047\n",
"99\n274084708428239737964144281827339813543219110156398212401158259206614326520025226572837805871014585\n",
"65\n48741672913800855829009396895109319701475498378204701259174825079\n",
"54\n779678408554409873811691913824373072271022281181199372\n",
"100\n2956058251342921002154580504550305512343357719751238174127440647858171411479019640719389442193156761\n",
"75\n1447209574891881128506764534477602010865884193215132888674271629390187643471\n",
"21\n144372480849939667628\n",
"62\n22219613982136747210935631389171649693997034283345662337583626\n",
"30\n1753916125842151020270252344941\n",
"64\n11582262715289018472878260813237715750398740538192284144993914364\n",
"50\n176486247346285355078927403393181612062909344472557\n",
"20\n91475329980766165627\n",
"32\n19421253273631271902830546309853\n",
"82\n7130439677311429054289691926669678715559951971255528089422170252214949673055037409\n",
"87\n162583935074903283877678799324942261343776405281956667200663049919992379727457618445822\n",
"85\n5179672314445498518747825535464653999958180121132851369872452192607293658801721323112\n",
"100\n9056860173107534527953825197265296206177542053400053495648579654157105028804543604477636859834254169\n",
"1\n1\n",
"93\n142900738143682625540105342312253998971541513968430294618654527208656244186427714456429260061\n",
"40\n5893664850088420104653125672989780401302\n",
"33\n1316344704121056356767252590078035\n",
"21\n961247912193573032091\n",
"98\n49633593424238946228753574785033663393046515774919065229285836778263762289889151310882662050295958\n",
"90\n730563418212452051964132091144698723276121264664193850618023916261543013128815335399938850\n",
"22\n7062633451897974105718\n",
"96\n961606338203745446796386398079921610824760993214546398685366784604568762326307249029204455750851\n",
"1\n2\n",
"100\n7175584485805705849693168885514278862585249734475140923711025638113565719364706001732933879282593903\n",
"86\n89039327901659721416677561947986258951074654231236865933796800700895217312937370088565\n",
"92\n13903087491287793799250985459288313710990837230413759979322281000113896197749900430556616452\n",
"76\n5668848880083489060516181669185910162345821775435654230881288559909881276359\n",
"32\n58450846655060080321140700557862\n",
"70\n16574756577915966791279923539175441020736780209276978053521928356127012\n",
"11\n113055057882\n",
"21\n268581310685218650707\n",
"22\n17634833004338166206452\n",
"11\n145852211224\n",
"41\n156430801927200855536123837894662214568721\n",
"63\n573970989884638574001047539444219592287349724845896428516061930\n",
"100\n1649954454354216348324856353744769591239957512599507743765021441866612320593824942841904141584444809\n",
"100\n10073026040057460848727605087211482331696312132261702754626166388448133087167204984955299978572844873\n",
"53\n10294950976088816073199215671673167174963164469332544\n",
"60\n903744304501293516369258888423725616678289531242891710261181\n",
"84\n248058851050244586329972244431845068342053230180314142152399592177294389690811412469\n",
"43\n1139522786373859748629536978350302283047435\n",
"21\n414764769360229758359\n",
"50\n125006241747367172352961887620449940392294290156400\n",
"33\n163445991198719783945688442744574\n",
"27\n1771475345807520480504293951\n",
"74\n36141517601805443470215839078489508863753596872271855476653668390338703335\n",
"22\n6162495896368099518135\n",
"81\n1363025613301211201344873793522274412138701392236333959084281266030086492586969946\n",
"57\n1423705310783370356206488007848026002555725247788497695627\n",
"100\n8214196852752695233729514144265209784838859240743133895909669295408086624114628470690490149346858149\n",
"11\n125693053523\n",
"21\n308846580116646657569\n",
"94\n7747830900414725615555168784062745495617871594159096430181393382508562672892413314594899237874\n",
"52\n15654026030811325908652336362901586634418944356707873\n",
"61\n3124080573365283337934382711688970811847579177395736805511317\n",
"95\n41233047758106206206178493651979098498928879946838810418979522774647327191027440365238678414753\n",
"73\n4184646398440799539343302069138501059187195143871098078245424570574650630\n",
"80\n70052317105276311821557953815064235609254227147552660921877560719279678214601763\n",
"55\n2532584617276433831959785690851391005271119317728379073\n",
"100\n12214470388509637187316171407185732399094381485438987303313809772379863936872280956215437122989955784\n",
"11\n50641445791\n",
"51\n1645695007619178112182600011052173832799865107349261\n",
"55\n8052132475340067086462704381340546682468514641256540302\n",
"65\n80507303857224037529289924361631148371584546228214411186937338609\n",
"42\n1400161523759972055334925227721345988082774\n",
"75\n381633323259241978825160604051651800305930639598198353611274713769732694803\n",
"11\n85999264342\n",
"21\n158411602392309813153\n",
"77\n11111111111111111111111111110111111111111111111111111111111111110111111111111\n"
],
"output": [
"2\n",
"1\n",
"0\n",
"4\n",
"0\n",
"6\n",
"5\n",
"4\n",
"1\n",
"9\n",
"3\n",
"6\n",
"1\n",
"2\n",
"1\n",
"5\n",
"0\n",
"2\n",
"5\n",
"0\n",
"8\n",
"2\n",
"4\n",
"1\n",
"2\n",
"7\n",
"8\n",
"7\n",
"7\n",
"9\n",
"1\n",
"0\n",
"8\n",
"0\n",
"3\n",
"3\n",
"1\n",
"8\n",
"8\n",
"0\n",
"0\n",
"8\n",
"0\n",
"9\n",
"1\n",
"7\n",
"8\n",
"6\n",
"2\n",
"6\n",
"1\n",
"1\n",
"0\n",
"2\n",
"1\n",
"3\n",
"0\n",
"9\n",
"5\n",
"2\n",
"5\n",
"9\n",
"1\n",
"9\n",
"4\n",
"5\n",
"9\n",
"0\n",
"7\n",
"2\n",
"9\n",
"3\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"2\n",
"3\n",
"2\n",
"0\n",
"6\n",
"2\n",
"7\n",
"5\n",
"9\n",
"7\n",
"1\n",
"1\n",
"8\n",
"4\n",
"5\n",
"6\n",
"8\n",
"6\n",
"7\n",
"5\n",
"9\n",
"4\n",
"5\n",
"6\n",
"3\n",
"1\n",
"2\n",
"0\n",
"7\n",
"8\n",
"9\n",
"5\n",
"4\n",
"6\n",
"6\n",
"1\n",
"4\n",
"1\n",
"5\n",
"4\n",
"1\n",
"2\n",
"4\n",
"7\n",
"7\n",
"7\n",
"0\n",
"7\n",
"3\n",
"1\n",
"0\n",
"8\n",
"8\n",
"2\n",
"8\n",
"0\n",
"9\n",
"7\n",
"8\n",
"6\n",
"2\n",
"3\n",
"1\n",
"1\n",
"2\n",
"1\n",
"3\n",
"5\n",
"7\n",
"9\n",
"3\n",
"5\n",
"7\n",
"3\n",
"1\n",
"2\n",
"3\n",
"2\n",
"6\n",
"2\n",
"6\n",
"5\n",
"9\n",
"0\n",
"1\n",
"8\n",
"4\n",
"5\n",
"8\n",
"6\n",
"4\n",
"5\n",
"9\n",
"0\n",
"4\n",
"5\n",
"5\n",
"3\n",
"6\n",
"1\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1060_A. Phone Numbers_13 | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone numbers as possible. Each card must be used in at most one phone number, and you don't have to use all cards. The phone numbers do not necessarily have to be distinct.
Input
The first line contains an integer n — the number of cards with digits that you have (1 ≤ n ≤ 100).
The second line contains a string of n digits (characters "0", "1", ..., "9") s_1, s_2, …, s_n. The string will not contain any other characters, such as leading or trailing spaces.
Output
If at least one phone number can be made from these cards, output the maximum number of phone numbers that can be made. Otherwise, output 0.
Examples
Input
11
00000000008
Output
1
Input
22
0011223344556677889988
Output
2
Input
11
31415926535
Output
0
Note
In the first example, one phone number, "8000000000", can be made from these cards.
In the second example, you can make two phone numbers from the cards, for example, "80123456789" and "80123456789".
In the third example you can't make any phone number from the given cards. | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3fll;
int t, n, a, b, cnt1, cnt2;
string s;
int main() {
cin >> n;
cin >> s;
cnt1 = n / 11;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') cnt2++;
}
cout << min(cnt1, cnt2) << endl;
return 0;
}
| 2C++
| {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n",
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"54\n438283821340622774637957966575424773837418828888614203\n",
"100\n1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026\n",
"100\n2833898888858387469888804083887280788584887487186899808436848018181838884988432785338497585788803883\n",
"42\n885887846290886288816884858898812858495482\n",
"75\n878909759892888846183608689257806813376950958863798487856148633095072259838\n",
"11\n55814018693\n",
"31\n0868889888343881888987888838808\n",
"21\n888888888888000000000\n",
"62\n18888883884288488882387888486858887882838885288886472818688888\n",
"77\n11111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"30\n888888888888888888888888888888\n",
"64\n8885984815868480968883818886281846682409262501034555933863969284\n",
"44\n15920309219313427633220119270900111650391207\n",
"97\n4088468966684435599488804806521288358953088399738904557539253573051442198885776802972628197705081\n",
"100\n8800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n",
"50\n88888888888888888888888888888888888888888888888888\n",
"20\n88888888888888888888\n",
"32\n88888888888888888888888888888888\n",
"82\n8889809888888888485881851986857288588888888881988888868888836888887858888888888878\n",
"91\n8828880888888884883888488888888888888881888888888884888888848588888808888888888888888880888\n",
"87\n311753415808202195240425076966761033489788093280714672959929008324554784724650182457298\n",
"85\n6888887655188885918863889822590788834182048952565514598298586848861396753319582883848\n",
"100\n8088888818885808888888848829886788884187188858898888888788988688884828586988888888288078638898728181\n",
"21\n888111111111111111111\n",
"1\n8\n",
"93\n888088898748888038885888818882806848806887888888882087481868888888177809288888889648468888188\n",
"77\n11233392925013001334679215120076714945221576003953746107506364475115045309091\n",
"40\n8888888888888888888888888888888888888888\n",
"33\n888800000000000000000000000000000\n",
"21\n881234567900123456790\n",
"98\n87247250157776241281197787785951754485531639139778166755966603305697265958800376912432893847612736\n",
"90\n888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"22\n4215079217017196952791\n",
"99\n509170332523502565755650047942914747120102240396245453406790272793996913905060450414255616791704320\n",
"96\n812087553199958040928832802441581868680188987878748641868838838835609806814288472573117388803351\n",
"1\n0\n",
"100\n8888888888828188888888888888888808888888888888888888891888888768888888888288888885886888838888888888\n",
"11\n80000000000\n",
"86\n84065885114540280210185082984888812185222886689129308815942798404861082196041321701260\n",
"92\n86888880558884738878888381088888888895888881888888888368878888888884888768881888888888808888\n",
"76\n7900795570936733366353829649382870728119825830883973668601071678041634916557\n",
"32\n88000000000000000000000000000000\n",
"70\n8888888888888888888888888888888888888888888888888888888888888888888888\n",
"11\n88888888888\n",
"21\n888000000000000000000\n",
"66\n747099435917145962031075767196746707764157706291155762576312312094\n",
"22\n8899999999999999999999\n",
"11\n81234567123\n",
"41\n78888884888874788841882882888088888588888\n",
"10\n8888888888\n",
"100\n2867878187889776883889958480848802884888888878218089281860321588888888987288888884288488988628618888\n",
"66\n157941266854773786962397310504192100434183957442977444078457168272\n",
"44\n30153452341853403190257244993442815171970194\n",
"63\n728385948188688801288285888788852829888898565895847689806684688\n",
"100\n1835563855281170226095294644116563180561156535623048783710060508361834822227075869575873675232708159\n",
"21\n888888555555555555555\n",
"100\n8881888389882878867888888888888888888886388888888870888884878888089888883898887888808688888487888888\n",
"53\n85838985300863473289888099788588319484149888886832906\n",
"60\n888888888888888888888888888888888888888888888888888888888888\n",
"100\n8820286285185244938452488887088871457098945874486988698468788381417332842888928188688887641132194956\n",
"11\n24572366390\n",
"84\n181288888282608548858058871581888853888486785801381108858832882809848798828837386086\n",
"32\n88257478884887437239023185588797\n",
"99\n097167815527663544905782574817314139311067328533970663873718450545467450059059869618211361469505108\n",
"43\n7404899846883344886153727489084158470112581\n",
"100\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008\n",
"8\n12345678\n",
"88\n2694079127792970410465292300936220976260790323517221561516591792566791677970332966660472\n",
"21\n582586788289484878588\n",
"33\n270375004567749549929235905225024\n",
"50\n88000000000000000000000000000000000000000000000000\n",
"33\n429980628264468835720540136177288\n",
"27\n888000000000000000000000000\n",
"10\n8000000000\n",
"74\n70988894874867688968816582886488688881063425288316858438189808828755218508\n",
"22\n6188156585823394680191\n",
"81\n808888883488887888888808888888888888188888888388888888888888868688888488888882888\n",
"57\n888888888888888888888888888888888888888888888888888888888\n",
"100\n6451941807833681891890004306065158148809856572066617888008875119881621810329816763604830895480467878\n",
"83\n88584458884288808888588388818938838468960248387898182887888867888888888886088895788\n",
"11\n81234567090\n",
"21\n880000000000000000000\n",
"94\n8188948828818938226378510887848897889883818858778688882933888883888898198978868888808082461388\n",
"52\n8878588869084488848898838898788838337877898817818888\n",
"61\n8880888836888988888988888887388888888888868898887888818888888\n",
"71\n88888888888888888888888188888805848888788088888883888883187888838888888\n",
"95\n29488352815808808845913584782288724288898869488882098428839370889284838688458247785878848884289\n",
"73\n2185806538483837898808836883483888818818988881880688028788888081888907898\n",
"80\n88888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"55\n3982037603326093160114589190899881252765957832414122484\n",
"100\n8888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"51\n1732111733638718702525811518175029394157760329139501\n",
"55\n8150965228922987149322123425550549439018369681986057802\n",
"72\n129108839650139854381903715683735947815379560715643428841035623040980032\n",
"42\n1251996236006506309908626867460855811743437\n",
"11\n78451611424\n",
"31\n1288033400433082469939233589875\n",
"77\n11111111111111111111111111110111111111111111111111111111111111111111111111111\n",
"100\n6152069453350735030379611937645928787504993143655436498747601445943408903686298029084639414463403044\n",
"91\n14936165072891114728916862658660934186358455115509481550778215813586122858153579186424029047\n",
"99\n274084708428239737964144281827339813543219110156398212401158259206614326520025226572837805871014585\n",
"65\n48741672913800855829009396895109319701475498378204701259174825079\n",
"54\n779678408554409873811691913824373072271022281181199372\n",
"100\n2956058251342921002154580504550305512343357719751238174127440647858171411479019640719389442193156761\n",
"75\n1447209574891881128506764534477602010865884193215132888674271629390187643471\n",
"21\n144372480849939667628\n",
"62\n22219613982136747210935631389171649693997034283345662337583626\n",
"30\n1753916125842151020270252344941\n",
"64\n11582262715289018472878260813237715750398740538192284144993914364\n",
"50\n176486247346285355078927403393181612062909344472557\n",
"20\n91475329980766165627\n",
"32\n19421253273631271902830546309853\n",
"82\n7130439677311429054289691926669678715559951971255528089422170252214949673055037409\n",
"87\n162583935074903283877678799324942261343776405281956667200663049919992379727457618445822\n",
"85\n5179672314445498518747825535464653999958180121132851369872452192607293658801721323112\n",
"100\n9056860173107534527953825197265296206177542053400053495648579654157105028804543604477636859834254169\n",
"1\n1\n",
"93\n142900738143682625540105342312253998971541513968430294618654527208656244186427714456429260061\n",
"40\n5893664850088420104653125672989780401302\n",
"33\n1316344704121056356767252590078035\n",
"21\n961247912193573032091\n",
"98\n49633593424238946228753574785033663393046515774919065229285836778263762289889151310882662050295958\n",
"90\n730563418212452051964132091144698723276121264664193850618023916261543013128815335399938850\n",
"22\n7062633451897974105718\n",
"96\n961606338203745446796386398079921610824760993214546398685366784604568762326307249029204455750851\n",
"1\n2\n",
"100\n7175584485805705849693168885514278862585249734475140923711025638113565719364706001732933879282593903\n",
"86\n89039327901659721416677561947986258951074654231236865933796800700895217312937370088565\n",
"92\n13903087491287793799250985459288313710990837230413759979322281000113896197749900430556616452\n",
"76\n5668848880083489060516181669185910162345821775435654230881288559909881276359\n",
"32\n58450846655060080321140700557862\n",
"70\n16574756577915966791279923539175441020736780209276978053521928356127012\n",
"11\n113055057882\n",
"21\n268581310685218650707\n",
"22\n17634833004338166206452\n",
"11\n145852211224\n",
"41\n156430801927200855536123837894662214568721\n",
"63\n573970989884638574001047539444219592287349724845896428516061930\n",
"100\n1649954454354216348324856353744769591239957512599507743765021441866612320593824942841904141584444809\n",
"100\n10073026040057460848727605087211482331696312132261702754626166388448133087167204984955299978572844873\n",
"53\n10294950976088816073199215671673167174963164469332544\n",
"60\n903744304501293516369258888423725616678289531242891710261181\n",
"84\n248058851050244586329972244431845068342053230180314142152399592177294389690811412469\n",
"43\n1139522786373859748629536978350302283047435\n",
"21\n414764769360229758359\n",
"50\n125006241747367172352961887620449940392294290156400\n",
"33\n163445991198719783945688442744574\n",
"27\n1771475345807520480504293951\n",
"74\n36141517601805443470215839078489508863753596872271855476653668390338703335\n",
"22\n6162495896368099518135\n",
"81\n1363025613301211201344873793522274412138701392236333959084281266030086492586969946\n",
"57\n1423705310783370356206488007848026002555725247788497695627\n",
"100\n8214196852752695233729514144265209784838859240743133895909669295408086624114628470690490149346858149\n",
"11\n125693053523\n",
"21\n308846580116646657569\n",
"94\n7747830900414725615555168784062745495617871594159096430181393382508562672892413314594899237874\n",
"52\n15654026030811325908652336362901586634418944356707873\n",
"61\n3124080573365283337934382711688970811847579177395736805511317\n",
"95\n41233047758106206206178493651979098498928879946838810418979522774647327191027440365238678414753\n",
"73\n4184646398440799539343302069138501059187195143871098078245424570574650630\n",
"80\n70052317105276311821557953815064235609254227147552660921877560719279678214601763\n",
"55\n2532584617276433831959785690851391005271119317728379073\n",
"100\n12214470388509637187316171407185732399094381485438987303313809772379863936872280956215437122989955784\n",
"11\n50641445791\n",
"51\n1645695007619178112182600011052173832799865107349261\n",
"55\n8052132475340067086462704381340546682468514641256540302\n",
"65\n80507303857224037529289924361631148371584546228214411186937338609\n",
"42\n1400161523759972055334925227721345988082774\n",
"75\n381633323259241978825160604051651800305930639598198353611274713769732694803\n",
"11\n85999264342\n",
"21\n158411602392309813153\n",
"77\n11111111111111111111111111110111111111111111111111111111111111110111111111111\n"
],
"output": [
"2\n",
"1\n",
"0\n",
"4\n",
"0\n",
"6\n",
"5\n",
"4\n",
"1\n",
"9\n",
"3\n",
"6\n",
"1\n",
"2\n",
"1\n",
"5\n",
"0\n",
"2\n",
"5\n",
"0\n",
"8\n",
"2\n",
"4\n",
"1\n",
"2\n",
"7\n",
"8\n",
"7\n",
"7\n",
"9\n",
"1\n",
"0\n",
"8\n",
"0\n",
"3\n",
"3\n",
"1\n",
"8\n",
"8\n",
"0\n",
"0\n",
"8\n",
"0\n",
"9\n",
"1\n",
"7\n",
"8\n",
"6\n",
"2\n",
"6\n",
"1\n",
"1\n",
"0\n",
"2\n",
"1\n",
"3\n",
"0\n",
"9\n",
"5\n",
"2\n",
"5\n",
"9\n",
"1\n",
"9\n",
"4\n",
"5\n",
"9\n",
"0\n",
"7\n",
"2\n",
"9\n",
"3\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"2\n",
"3\n",
"2\n",
"0\n",
"6\n",
"2\n",
"7\n",
"5\n",
"9\n",
"7\n",
"1\n",
"1\n",
"8\n",
"4\n",
"5\n",
"6\n",
"8\n",
"6\n",
"7\n",
"5\n",
"9\n",
"4\n",
"5\n",
"6\n",
"3\n",
"1\n",
"2\n",
"0\n",
"7\n",
"8\n",
"9\n",
"5\n",
"4\n",
"6\n",
"6\n",
"1\n",
"4\n",
"1\n",
"5\n",
"4\n",
"1\n",
"2\n",
"4\n",
"7\n",
"7\n",
"7\n",
"0\n",
"7\n",
"3\n",
"1\n",
"0\n",
"8\n",
"8\n",
"2\n",
"8\n",
"0\n",
"9\n",
"7\n",
"8\n",
"6\n",
"2\n",
"3\n",
"1\n",
"1\n",
"2\n",
"1\n",
"3\n",
"5\n",
"7\n",
"9\n",
"3\n",
"5\n",
"7\n",
"3\n",
"1\n",
"2\n",
"3\n",
"2\n",
"6\n",
"2\n",
"6\n",
"5\n",
"9\n",
"0\n",
"1\n",
"8\n",
"4\n",
"5\n",
"8\n",
"6\n",
"4\n",
"5\n",
"9\n",
"0\n",
"4\n",
"5\n",
"5\n",
"3\n",
"6\n",
"1\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1060_A. Phone Numbers_14 | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone numbers as possible. Each card must be used in at most one phone number, and you don't have to use all cards. The phone numbers do not necessarily have to be distinct.
Input
The first line contains an integer n — the number of cards with digits that you have (1 ≤ n ≤ 100).
The second line contains a string of n digits (characters "0", "1", ..., "9") s_1, s_2, …, s_n. The string will not contain any other characters, such as leading or trailing spaces.
Output
If at least one phone number can be made from these cards, output the maximum number of phone numbers that can be made. Otherwise, output 0.
Examples
Input
11
00000000008
Output
1
Input
22
0011223344556677889988
Output
2
Input
11
31415926535
Output
0
Note
In the first example, one phone number, "8000000000", can be made from these cards.
In the second example, you can make two phone numbers from the cards, for example, "80123456789" and "80123456789".
In the third example you can't make any phone number from the given cards. | n = int(input())
s = input()
k = s.count("8")
l = n - k
if k <= l//10: print(k)
else:
while k > l//10:
k -= 1
l += 1
print(min(k, l//10))
| 3Python3
| {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n",
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"54\n438283821340622774637957966575424773837418828888614203\n",
"100\n1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026\n",
"100\n2833898888858387469888804083887280788584887487186899808436848018181838884988432785338497585788803883\n",
"42\n885887846290886288816884858898812858495482\n",
"75\n878909759892888846183608689257806813376950958863798487856148633095072259838\n",
"11\n55814018693\n",
"31\n0868889888343881888987888838808\n",
"21\n888888888888000000000\n",
"62\n18888883884288488882387888486858887882838885288886472818688888\n",
"77\n11111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"30\n888888888888888888888888888888\n",
"64\n8885984815868480968883818886281846682409262501034555933863969284\n",
"44\n15920309219313427633220119270900111650391207\n",
"97\n4088468966684435599488804806521288358953088399738904557539253573051442198885776802972628197705081\n",
"100\n8800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n",
"50\n88888888888888888888888888888888888888888888888888\n",
"20\n88888888888888888888\n",
"32\n88888888888888888888888888888888\n",
"82\n8889809888888888485881851986857288588888888881988888868888836888887858888888888878\n",
"91\n8828880888888884883888488888888888888881888888888884888888848588888808888888888888888880888\n",
"87\n311753415808202195240425076966761033489788093280714672959929008324554784724650182457298\n",
"85\n6888887655188885918863889822590788834182048952565514598298586848861396753319582883848\n",
"100\n8088888818885808888888848829886788884187188858898888888788988688884828586988888888288078638898728181\n",
"21\n888111111111111111111\n",
"1\n8\n",
"93\n888088898748888038885888818882806848806887888888882087481868888888177809288888889648468888188\n",
"77\n11233392925013001334679215120076714945221576003953746107506364475115045309091\n",
"40\n8888888888888888888888888888888888888888\n",
"33\n888800000000000000000000000000000\n",
"21\n881234567900123456790\n",
"98\n87247250157776241281197787785951754485531639139778166755966603305697265958800376912432893847612736\n",
"90\n888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"22\n4215079217017196952791\n",
"99\n509170332523502565755650047942914747120102240396245453406790272793996913905060450414255616791704320\n",
"96\n812087553199958040928832802441581868680188987878748641868838838835609806814288472573117388803351\n",
"1\n0\n",
"100\n8888888888828188888888888888888808888888888888888888891888888768888888888288888885886888838888888888\n",
"11\n80000000000\n",
"86\n84065885114540280210185082984888812185222886689129308815942798404861082196041321701260\n",
"92\n86888880558884738878888381088888888895888881888888888368878888888884888768881888888888808888\n",
"76\n7900795570936733366353829649382870728119825830883973668601071678041634916557\n",
"32\n88000000000000000000000000000000\n",
"70\n8888888888888888888888888888888888888888888888888888888888888888888888\n",
"11\n88888888888\n",
"21\n888000000000000000000\n",
"66\n747099435917145962031075767196746707764157706291155762576312312094\n",
"22\n8899999999999999999999\n",
"11\n81234567123\n",
"41\n78888884888874788841882882888088888588888\n",
"10\n8888888888\n",
"100\n2867878187889776883889958480848802884888888878218089281860321588888888987288888884288488988628618888\n",
"66\n157941266854773786962397310504192100434183957442977444078457168272\n",
"44\n30153452341853403190257244993442815171970194\n",
"63\n728385948188688801288285888788852829888898565895847689806684688\n",
"100\n1835563855281170226095294644116563180561156535623048783710060508361834822227075869575873675232708159\n",
"21\n888888555555555555555\n",
"100\n8881888389882878867888888888888888888886388888888870888884878888089888883898887888808688888487888888\n",
"53\n85838985300863473289888099788588319484149888886832906\n",
"60\n888888888888888888888888888888888888888888888888888888888888\n",
"100\n8820286285185244938452488887088871457098945874486988698468788381417332842888928188688887641132194956\n",
"11\n24572366390\n",
"84\n181288888282608548858058871581888853888486785801381108858832882809848798828837386086\n",
"32\n88257478884887437239023185588797\n",
"99\n097167815527663544905782574817314139311067328533970663873718450545467450059059869618211361469505108\n",
"43\n7404899846883344886153727489084158470112581\n",
"100\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008\n",
"8\n12345678\n",
"88\n2694079127792970410465292300936220976260790323517221561516591792566791677970332966660472\n",
"21\n582586788289484878588\n",
"33\n270375004567749549929235905225024\n",
"50\n88000000000000000000000000000000000000000000000000\n",
"33\n429980628264468835720540136177288\n",
"27\n888000000000000000000000000\n",
"10\n8000000000\n",
"74\n70988894874867688968816582886488688881063425288316858438189808828755218508\n",
"22\n6188156585823394680191\n",
"81\n808888883488887888888808888888888888188888888388888888888888868688888488888882888\n",
"57\n888888888888888888888888888888888888888888888888888888888\n",
"100\n6451941807833681891890004306065158148809856572066617888008875119881621810329816763604830895480467878\n",
"83\n88584458884288808888588388818938838468960248387898182887888867888888888886088895788\n",
"11\n81234567090\n",
"21\n880000000000000000000\n",
"94\n8188948828818938226378510887848897889883818858778688882933888883888898198978868888808082461388\n",
"52\n8878588869084488848898838898788838337877898817818888\n",
"61\n8880888836888988888988888887388888888888868898887888818888888\n",
"71\n88888888888888888888888188888805848888788088888883888883187888838888888\n",
"95\n29488352815808808845913584782288724288898869488882098428839370889284838688458247785878848884289\n",
"73\n2185806538483837898808836883483888818818988881880688028788888081888907898\n",
"80\n88888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"55\n3982037603326093160114589190899881252765957832414122484\n",
"100\n8888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"51\n1732111733638718702525811518175029394157760329139501\n",
"55\n8150965228922987149322123425550549439018369681986057802\n",
"72\n129108839650139854381903715683735947815379560715643428841035623040980032\n",
"42\n1251996236006506309908626867460855811743437\n",
"11\n78451611424\n",
"31\n1288033400433082469939233589875\n",
"77\n11111111111111111111111111110111111111111111111111111111111111111111111111111\n",
"100\n6152069453350735030379611937645928787504993143655436498747601445943408903686298029084639414463403044\n",
"91\n14936165072891114728916862658660934186358455115509481550778215813586122858153579186424029047\n",
"99\n274084708428239737964144281827339813543219110156398212401158259206614326520025226572837805871014585\n",
"65\n48741672913800855829009396895109319701475498378204701259174825079\n",
"54\n779678408554409873811691913824373072271022281181199372\n",
"100\n2956058251342921002154580504550305512343357719751238174127440647858171411479019640719389442193156761\n",
"75\n1447209574891881128506764534477602010865884193215132888674271629390187643471\n",
"21\n144372480849939667628\n",
"62\n22219613982136747210935631389171649693997034283345662337583626\n",
"30\n1753916125842151020270252344941\n",
"64\n11582262715289018472878260813237715750398740538192284144993914364\n",
"50\n176486247346285355078927403393181612062909344472557\n",
"20\n91475329980766165627\n",
"32\n19421253273631271902830546309853\n",
"82\n7130439677311429054289691926669678715559951971255528089422170252214949673055037409\n",
"87\n162583935074903283877678799324942261343776405281956667200663049919992379727457618445822\n",
"85\n5179672314445498518747825535464653999958180121132851369872452192607293658801721323112\n",
"100\n9056860173107534527953825197265296206177542053400053495648579654157105028804543604477636859834254169\n",
"1\n1\n",
"93\n142900738143682625540105342312253998971541513968430294618654527208656244186427714456429260061\n",
"40\n5893664850088420104653125672989780401302\n",
"33\n1316344704121056356767252590078035\n",
"21\n961247912193573032091\n",
"98\n49633593424238946228753574785033663393046515774919065229285836778263762289889151310882662050295958\n",
"90\n730563418212452051964132091144698723276121264664193850618023916261543013128815335399938850\n",
"22\n7062633451897974105718\n",
"96\n961606338203745446796386398079921610824760993214546398685366784604568762326307249029204455750851\n",
"1\n2\n",
"100\n7175584485805705849693168885514278862585249734475140923711025638113565719364706001732933879282593903\n",
"86\n89039327901659721416677561947986258951074654231236865933796800700895217312937370088565\n",
"92\n13903087491287793799250985459288313710990837230413759979322281000113896197749900430556616452\n",
"76\n5668848880083489060516181669185910162345821775435654230881288559909881276359\n",
"32\n58450846655060080321140700557862\n",
"70\n16574756577915966791279923539175441020736780209276978053521928356127012\n",
"11\n113055057882\n",
"21\n268581310685218650707\n",
"22\n17634833004338166206452\n",
"11\n145852211224\n",
"41\n156430801927200855536123837894662214568721\n",
"63\n573970989884638574001047539444219592287349724845896428516061930\n",
"100\n1649954454354216348324856353744769591239957512599507743765021441866612320593824942841904141584444809\n",
"100\n10073026040057460848727605087211482331696312132261702754626166388448133087167204984955299978572844873\n",
"53\n10294950976088816073199215671673167174963164469332544\n",
"60\n903744304501293516369258888423725616678289531242891710261181\n",
"84\n248058851050244586329972244431845068342053230180314142152399592177294389690811412469\n",
"43\n1139522786373859748629536978350302283047435\n",
"21\n414764769360229758359\n",
"50\n125006241747367172352961887620449940392294290156400\n",
"33\n163445991198719783945688442744574\n",
"27\n1771475345807520480504293951\n",
"74\n36141517601805443470215839078489508863753596872271855476653668390338703335\n",
"22\n6162495896368099518135\n",
"81\n1363025613301211201344873793522274412138701392236333959084281266030086492586969946\n",
"57\n1423705310783370356206488007848026002555725247788497695627\n",
"100\n8214196852752695233729514144265209784838859240743133895909669295408086624114628470690490149346858149\n",
"11\n125693053523\n",
"21\n308846580116646657569\n",
"94\n7747830900414725615555168784062745495617871594159096430181393382508562672892413314594899237874\n",
"52\n15654026030811325908652336362901586634418944356707873\n",
"61\n3124080573365283337934382711688970811847579177395736805511317\n",
"95\n41233047758106206206178493651979098498928879946838810418979522774647327191027440365238678414753\n",
"73\n4184646398440799539343302069138501059187195143871098078245424570574650630\n",
"80\n70052317105276311821557953815064235609254227147552660921877560719279678214601763\n",
"55\n2532584617276433831959785690851391005271119317728379073\n",
"100\n12214470388509637187316171407185732399094381485438987303313809772379863936872280956215437122989955784\n",
"11\n50641445791\n",
"51\n1645695007619178112182600011052173832799865107349261\n",
"55\n8052132475340067086462704381340546682468514641256540302\n",
"65\n80507303857224037529289924361631148371584546228214411186937338609\n",
"42\n1400161523759972055334925227721345988082774\n",
"75\n381633323259241978825160604051651800305930639598198353611274713769732694803\n",
"11\n85999264342\n",
"21\n158411602392309813153\n",
"77\n11111111111111111111111111110111111111111111111111111111111111110111111111111\n"
],
"output": [
"2\n",
"1\n",
"0\n",
"4\n",
"0\n",
"6\n",
"5\n",
"4\n",
"1\n",
"9\n",
"3\n",
"6\n",
"1\n",
"2\n",
"1\n",
"5\n",
"0\n",
"2\n",
"5\n",
"0\n",
"8\n",
"2\n",
"4\n",
"1\n",
"2\n",
"7\n",
"8\n",
"7\n",
"7\n",
"9\n",
"1\n",
"0\n",
"8\n",
"0\n",
"3\n",
"3\n",
"1\n",
"8\n",
"8\n",
"0\n",
"0\n",
"8\n",
"0\n",
"9\n",
"1\n",
"7\n",
"8\n",
"6\n",
"2\n",
"6\n",
"1\n",
"1\n",
"0\n",
"2\n",
"1\n",
"3\n",
"0\n",
"9\n",
"5\n",
"2\n",
"5\n",
"9\n",
"1\n",
"9\n",
"4\n",
"5\n",
"9\n",
"0\n",
"7\n",
"2\n",
"9\n",
"3\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"2\n",
"3\n",
"2\n",
"0\n",
"6\n",
"2\n",
"7\n",
"5\n",
"9\n",
"7\n",
"1\n",
"1\n",
"8\n",
"4\n",
"5\n",
"6\n",
"8\n",
"6\n",
"7\n",
"5\n",
"9\n",
"4\n",
"5\n",
"6\n",
"3\n",
"1\n",
"2\n",
"0\n",
"7\n",
"8\n",
"9\n",
"5\n",
"4\n",
"6\n",
"6\n",
"1\n",
"4\n",
"1\n",
"5\n",
"4\n",
"1\n",
"2\n",
"4\n",
"7\n",
"7\n",
"7\n",
"0\n",
"7\n",
"3\n",
"1\n",
"0\n",
"8\n",
"8\n",
"2\n",
"8\n",
"0\n",
"9\n",
"7\n",
"8\n",
"6\n",
"2\n",
"3\n",
"1\n",
"1\n",
"2\n",
"1\n",
"3\n",
"5\n",
"7\n",
"9\n",
"3\n",
"5\n",
"7\n",
"3\n",
"1\n",
"2\n",
"3\n",
"2\n",
"6\n",
"2\n",
"6\n",
"5\n",
"9\n",
"0\n",
"1\n",
"8\n",
"4\n",
"5\n",
"8\n",
"6\n",
"4\n",
"5\n",
"9\n",
"0\n",
"4\n",
"5\n",
"5\n",
"3\n",
"6\n",
"1\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1060_A. Phone Numbers_15 | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone numbers as possible. Each card must be used in at most one phone number, and you don't have to use all cards. The phone numbers do not necessarily have to be distinct.
Input
The first line contains an integer n — the number of cards with digits that you have (1 ≤ n ≤ 100).
The second line contains a string of n digits (characters "0", "1", ..., "9") s_1, s_2, …, s_n. The string will not contain any other characters, such as leading or trailing spaces.
Output
If at least one phone number can be made from these cards, output the maximum number of phone numbers that can be made. Otherwise, output 0.
Examples
Input
11
00000000008
Output
1
Input
22
0011223344556677889988
Output
2
Input
11
31415926535
Output
0
Note
In the first example, one phone number, "8000000000", can be made from these cards.
In the second example, you can make two phone numbers from the cards, for example, "80123456789" and "80123456789".
In the third example you can't make any phone number from the given cards. |
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author anhnth37
*/
public class A_1060 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
String s = input.next();
int maxPhoneNumber = n / 11;
int countNumberEight = 0;
for (int i = 0; i < n; i++) {
if (s.charAt(i) == '8') {
countNumberEight++;
}
}
if (countNumberEight > maxPhoneNumber) {
System.out.println(maxPhoneNumber);
} else {
System.out.println(countNumberEight);
}
}
}
| 4JAVA
| {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n",
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"54\n438283821340622774637957966575424773837418828888614203\n",
"100\n1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026\n",
"100\n2833898888858387469888804083887280788584887487186899808436848018181838884988432785338497585788803883\n",
"42\n885887846290886288816884858898812858495482\n",
"75\n878909759892888846183608689257806813376950958863798487856148633095072259838\n",
"11\n55814018693\n",
"31\n0868889888343881888987888838808\n",
"21\n888888888888000000000\n",
"62\n18888883884288488882387888486858887882838885288886472818688888\n",
"77\n11111111111111111111111111111111111111111111111111111111111111111111111111111\n",
"30\n888888888888888888888888888888\n",
"64\n8885984815868480968883818886281846682409262501034555933863969284\n",
"44\n15920309219313427633220119270900111650391207\n",
"97\n4088468966684435599488804806521288358953088399738904557539253573051442198885776802972628197705081\n",
"100\n8800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n",
"50\n88888888888888888888888888888888888888888888888888\n",
"20\n88888888888888888888\n",
"32\n88888888888888888888888888888888\n",
"82\n8889809888888888485881851986857288588888888881988888868888836888887858888888888878\n",
"91\n8828880888888884883888488888888888888881888888888884888888848588888808888888888888888880888\n",
"87\n311753415808202195240425076966761033489788093280714672959929008324554784724650182457298\n",
"85\n6888887655188885918863889822590788834182048952565514598298586848861396753319582883848\n",
"100\n8088888818885808888888848829886788884187188858898888888788988688884828586988888888288078638898728181\n",
"21\n888111111111111111111\n",
"1\n8\n",
"93\n888088898748888038885888818882806848806887888888882087481868888888177809288888889648468888188\n",
"77\n11233392925013001334679215120076714945221576003953746107506364475115045309091\n",
"40\n8888888888888888888888888888888888888888\n",
"33\n888800000000000000000000000000000\n",
"21\n881234567900123456790\n",
"98\n87247250157776241281197787785951754485531639139778166755966603305697265958800376912432893847612736\n",
"90\n888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"22\n4215079217017196952791\n",
"99\n509170332523502565755650047942914747120102240396245453406790272793996913905060450414255616791704320\n",
"96\n812087553199958040928832802441581868680188987878748641868838838835609806814288472573117388803351\n",
"1\n0\n",
"100\n8888888888828188888888888888888808888888888888888888891888888768888888888288888885886888838888888888\n",
"11\n80000000000\n",
"86\n84065885114540280210185082984888812185222886689129308815942798404861082196041321701260\n",
"92\n86888880558884738878888381088888888895888881888888888368878888888884888768881888888888808888\n",
"76\n7900795570936733366353829649382870728119825830883973668601071678041634916557\n",
"32\n88000000000000000000000000000000\n",
"70\n8888888888888888888888888888888888888888888888888888888888888888888888\n",
"11\n88888888888\n",
"21\n888000000000000000000\n",
"66\n747099435917145962031075767196746707764157706291155762576312312094\n",
"22\n8899999999999999999999\n",
"11\n81234567123\n",
"41\n78888884888874788841882882888088888588888\n",
"10\n8888888888\n",
"100\n2867878187889776883889958480848802884888888878218089281860321588888888987288888884288488988628618888\n",
"66\n157941266854773786962397310504192100434183957442977444078457168272\n",
"44\n30153452341853403190257244993442815171970194\n",
"63\n728385948188688801288285888788852829888898565895847689806684688\n",
"100\n1835563855281170226095294644116563180561156535623048783710060508361834822227075869575873675232708159\n",
"21\n888888555555555555555\n",
"100\n8881888389882878867888888888888888888886388888888870888884878888089888883898887888808688888487888888\n",
"53\n85838985300863473289888099788588319484149888886832906\n",
"60\n888888888888888888888888888888888888888888888888888888888888\n",
"100\n8820286285185244938452488887088871457098945874486988698468788381417332842888928188688887641132194956\n",
"11\n24572366390\n",
"84\n181288888282608548858058871581888853888486785801381108858832882809848798828837386086\n",
"32\n88257478884887437239023185588797\n",
"99\n097167815527663544905782574817314139311067328533970663873718450545467450059059869618211361469505108\n",
"43\n7404899846883344886153727489084158470112581\n",
"100\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008\n",
"8\n12345678\n",
"88\n2694079127792970410465292300936220976260790323517221561516591792566791677970332966660472\n",
"21\n582586788289484878588\n",
"33\n270375004567749549929235905225024\n",
"50\n88000000000000000000000000000000000000000000000000\n",
"33\n429980628264468835720540136177288\n",
"27\n888000000000000000000000000\n",
"10\n8000000000\n",
"74\n70988894874867688968816582886488688881063425288316858438189808828755218508\n",
"22\n6188156585823394680191\n",
"81\n808888883488887888888808888888888888188888888388888888888888868688888488888882888\n",
"57\n888888888888888888888888888888888888888888888888888888888\n",
"100\n6451941807833681891890004306065158148809856572066617888008875119881621810329816763604830895480467878\n",
"83\n88584458884288808888588388818938838468960248387898182887888867888888888886088895788\n",
"11\n81234567090\n",
"21\n880000000000000000000\n",
"94\n8188948828818938226378510887848897889883818858778688882933888883888898198978868888808082461388\n",
"52\n8878588869084488848898838898788838337877898817818888\n",
"61\n8880888836888988888988888887388888888888868898887888818888888\n",
"71\n88888888888888888888888188888805848888788088888883888883187888838888888\n",
"95\n29488352815808808845913584782288724288898869488882098428839370889284838688458247785878848884289\n",
"73\n2185806538483837898808836883483888818818988881880688028788888081888907898\n",
"80\n88888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"55\n3982037603326093160114589190899881252765957832414122484\n",
"100\n8888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888\n",
"51\n1732111733638718702525811518175029394157760329139501\n",
"55\n8150965228922987149322123425550549439018369681986057802\n",
"72\n129108839650139854381903715683735947815379560715643428841035623040980032\n",
"42\n1251996236006506309908626867460855811743437\n",
"11\n78451611424\n",
"31\n1288033400433082469939233589875\n",
"77\n11111111111111111111111111110111111111111111111111111111111111111111111111111\n",
"100\n6152069453350735030379611937645928787504993143655436498747601445943408903686298029084639414463403044\n",
"91\n14936165072891114728916862658660934186358455115509481550778215813586122858153579186424029047\n",
"99\n274084708428239737964144281827339813543219110156398212401158259206614326520025226572837805871014585\n",
"65\n48741672913800855829009396895109319701475498378204701259174825079\n",
"54\n779678408554409873811691913824373072271022281181199372\n",
"100\n2956058251342921002154580504550305512343357719751238174127440647858171411479019640719389442193156761\n",
"75\n1447209574891881128506764534477602010865884193215132888674271629390187643471\n",
"21\n144372480849939667628\n",
"62\n22219613982136747210935631389171649693997034283345662337583626\n",
"30\n1753916125842151020270252344941\n",
"64\n11582262715289018472878260813237715750398740538192284144993914364\n",
"50\n176486247346285355078927403393181612062909344472557\n",
"20\n91475329980766165627\n",
"32\n19421253273631271902830546309853\n",
"82\n7130439677311429054289691926669678715559951971255528089422170252214949673055037409\n",
"87\n162583935074903283877678799324942261343776405281956667200663049919992379727457618445822\n",
"85\n5179672314445498518747825535464653999958180121132851369872452192607293658801721323112\n",
"100\n9056860173107534527953825197265296206177542053400053495648579654157105028804543604477636859834254169\n",
"1\n1\n",
"93\n142900738143682625540105342312253998971541513968430294618654527208656244186427714456429260061\n",
"40\n5893664850088420104653125672989780401302\n",
"33\n1316344704121056356767252590078035\n",
"21\n961247912193573032091\n",
"98\n49633593424238946228753574785033663393046515774919065229285836778263762289889151310882662050295958\n",
"90\n730563418212452051964132091144698723276121264664193850618023916261543013128815335399938850\n",
"22\n7062633451897974105718\n",
"96\n961606338203745446796386398079921610824760993214546398685366784604568762326307249029204455750851\n",
"1\n2\n",
"100\n7175584485805705849693168885514278862585249734475140923711025638113565719364706001732933879282593903\n",
"86\n89039327901659721416677561947986258951074654231236865933796800700895217312937370088565\n",
"92\n13903087491287793799250985459288313710990837230413759979322281000113896197749900430556616452\n",
"76\n5668848880083489060516181669185910162345821775435654230881288559909881276359\n",
"32\n58450846655060080321140700557862\n",
"70\n16574756577915966791279923539175441020736780209276978053521928356127012\n",
"11\n113055057882\n",
"21\n268581310685218650707\n",
"22\n17634833004338166206452\n",
"11\n145852211224\n",
"41\n156430801927200855536123837894662214568721\n",
"63\n573970989884638574001047539444219592287349724845896428516061930\n",
"100\n1649954454354216348324856353744769591239957512599507743765021441866612320593824942841904141584444809\n",
"100\n10073026040057460848727605087211482331696312132261702754626166388448133087167204984955299978572844873\n",
"53\n10294950976088816073199215671673167174963164469332544\n",
"60\n903744304501293516369258888423725616678289531242891710261181\n",
"84\n248058851050244586329972244431845068342053230180314142152399592177294389690811412469\n",
"43\n1139522786373859748629536978350302283047435\n",
"21\n414764769360229758359\n",
"50\n125006241747367172352961887620449940392294290156400\n",
"33\n163445991198719783945688442744574\n",
"27\n1771475345807520480504293951\n",
"74\n36141517601805443470215839078489508863753596872271855476653668390338703335\n",
"22\n6162495896368099518135\n",
"81\n1363025613301211201344873793522274412138701392236333959084281266030086492586969946\n",
"57\n1423705310783370356206488007848026002555725247788497695627\n",
"100\n8214196852752695233729514144265209784838859240743133895909669295408086624114628470690490149346858149\n",
"11\n125693053523\n",
"21\n308846580116646657569\n",
"94\n7747830900414725615555168784062745495617871594159096430181393382508562672892413314594899237874\n",
"52\n15654026030811325908652336362901586634418944356707873\n",
"61\n3124080573365283337934382711688970811847579177395736805511317\n",
"95\n41233047758106206206178493651979098498928879946838810418979522774647327191027440365238678414753\n",
"73\n4184646398440799539343302069138501059187195143871098078245424570574650630\n",
"80\n70052317105276311821557953815064235609254227147552660921877560719279678214601763\n",
"55\n2532584617276433831959785690851391005271119317728379073\n",
"100\n12214470388509637187316171407185732399094381485438987303313809772379863936872280956215437122989955784\n",
"11\n50641445791\n",
"51\n1645695007619178112182600011052173832799865107349261\n",
"55\n8052132475340067086462704381340546682468514641256540302\n",
"65\n80507303857224037529289924361631148371584546228214411186937338609\n",
"42\n1400161523759972055334925227721345988082774\n",
"75\n381633323259241978825160604051651800305930639598198353611274713769732694803\n",
"11\n85999264342\n",
"21\n158411602392309813153\n",
"77\n11111111111111111111111111110111111111111111111111111111111111110111111111111\n"
],
"output": [
"2\n",
"1\n",
"0\n",
"4\n",
"0\n",
"6\n",
"5\n",
"4\n",
"1\n",
"9\n",
"3\n",
"6\n",
"1\n",
"2\n",
"1\n",
"5\n",
"0\n",
"2\n",
"5\n",
"0\n",
"8\n",
"2\n",
"4\n",
"1\n",
"2\n",
"7\n",
"8\n",
"7\n",
"7\n",
"9\n",
"1\n",
"0\n",
"8\n",
"0\n",
"3\n",
"3\n",
"1\n",
"8\n",
"8\n",
"0\n",
"0\n",
"8\n",
"0\n",
"9\n",
"1\n",
"7\n",
"8\n",
"6\n",
"2\n",
"6\n",
"1\n",
"1\n",
"0\n",
"2\n",
"1\n",
"3\n",
"0\n",
"9\n",
"5\n",
"2\n",
"5\n",
"9\n",
"1\n",
"9\n",
"4\n",
"5\n",
"9\n",
"0\n",
"7\n",
"2\n",
"9\n",
"3\n",
"1\n",
"0\n",
"0\n",
"1\n",
"0\n",
"2\n",
"3\n",
"2\n",
"0\n",
"6\n",
"2\n",
"7\n",
"5\n",
"9\n",
"7\n",
"1\n",
"1\n",
"8\n",
"4\n",
"5\n",
"6\n",
"8\n",
"6\n",
"7\n",
"5\n",
"9\n",
"4\n",
"5\n",
"6\n",
"3\n",
"1\n",
"2\n",
"0\n",
"7\n",
"8\n",
"9\n",
"5\n",
"4\n",
"6\n",
"6\n",
"1\n",
"4\n",
"1\n",
"5\n",
"4\n",
"1\n",
"2\n",
"4\n",
"7\n",
"7\n",
"7\n",
"0\n",
"7\n",
"3\n",
"1\n",
"0\n",
"8\n",
"8\n",
"2\n",
"8\n",
"0\n",
"9\n",
"7\n",
"8\n",
"6\n",
"2\n",
"3\n",
"1\n",
"1\n",
"2\n",
"1\n",
"3\n",
"5\n",
"7\n",
"9\n",
"3\n",
"5\n",
"7\n",
"3\n",
"1\n",
"2\n",
"3\n",
"2\n",
"6\n",
"2\n",
"6\n",
"5\n",
"9\n",
"0\n",
"1\n",
"8\n",
"4\n",
"5\n",
"8\n",
"6\n",
"4\n",
"5\n",
"9\n",
"0\n",
"4\n",
"5\n",
"5\n",
"3\n",
"6\n",
"1\n",
"1\n",
"0\n"
]
} | 2CODEFORCES
|
1081_G. Mergesort Strikes Back_16 | Chouti thought about his very first days in competitive programming. When he had just learned to write merge sort, he thought that the merge sort is too slow, so he restricted the maximum depth of recursion and modified the merge sort to the following:
<image>
Chouti found his idea dumb since obviously, this "merge sort" sometimes cannot sort the array correctly. However, Chouti is now starting to think of how good this "merge sort" is. Particularly, Chouti wants to know for a random permutation a of 1, 2, …, n the expected number of inversions after calling MergeSort(a, 1, n, k).
It can be proved that the expected number is rational. For the given prime q, suppose the answer can be denoted by u/d where gcd(u,d)=1, you need to output an integer r satisfying 0 ≤ r<q and rd ≡ u \pmod q. It can be proved that such r exists and is unique.
Input
The first and only line contains three integers n, k, q (1 ≤ n, k ≤ 10^5, 10^8 ≤ q ≤ 10^9, q is a prime).
Output
The first and only line contains an integer r.
Examples
Input
3 1 998244353
Output
499122178
Input
3 2 998244353
Output
665496236
Input
9 3 998244353
Output
449209967
Input
9 4 998244353
Output
665496237
Note
In the first example, all possible permutations are [1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1].
With k=1, MergeSort(a, 1, n, k) will only return the original permutation. Thus the answer is 9/6=3/2, and you should output 499122178 because 499122178 × 2 ≡ 3 \pmod {998244353}.
In the second example, all possible permutations are [1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1] and the corresponding outputs of MergeSort(a, 1, n, k) are [1,2,3],[1,2,3],[2,1,3],[1,2,3],[2,3,1],[1,3,2] respectively. Thus the answer is 4/6=2/3, and you should output 665496236 because 665496236 × 3 ≡ 2 \pmod {998244353}. | #include <bits/stdc++.h>
const int MAXN = 1e5 + 20;
int n, k, M;
int inv[MAXN], pre_inv[MAXN];
void math_pre() {
inv[1] = 1;
for (int i = 2; i <= ((n < 4) ? 4 : n); ++i)
inv[i] = 1ll * (M - M / i) * inv[M % i] % M;
for (int i = 1; i <= n; ++i) pre_inv[i] = (pre_inv[i - 1] + inv[i]) % M;
}
struct map {
static const int MAXMap = 2;
int tot;
struct pad {
int key, val;
pad() {}
pad(const int &KEY, const int &VAL) : key(KEY), val(VAL) {}
} node[MAXMap + 1];
map() { tot = 0; }
pad *find(const int &key) {
pad *ret = node;
while (ret - node < tot && ret->key != key) ++ret;
return ret;
}
void insert(const pad &new_element) { node[tot++] = new_element; }
pad *begin() { return &node[0]; }
pad *end() { return &node[tot]; }
} Map;
void solve(const int &l, const int &r, const int &h) {
if (l >= r || h <= 1) {
int len = r - l + 1;
map::pad *it = Map.find(len);
if (it == Map.end())
Map.insert(map::pad(len, 1));
else
++it->val;
return;
}
int mid = (l + r) >> 1;
solve(l, mid, h - 1), solve(mid + 1, r, h - 1);
}
int calc(const int &len1, const int &len2) {
int ret = 0;
for (int i = 1; i <= len1; ++i)
ret = ((ret + 1ll * inv[2] * len2 % M -
(pre_inv[i + len2] - pre_inv[i + 1 - 1])) %
M +
M) %
M;
return ret;
}
int main() {
scanf("%d%d%d", &n, &k, &M);
math_pre();
solve(1, n, k);
int ans = 0;
for (map::pad *it = Map.begin(); it != Map.end(); ++it) {
int len = it->key, cnt = it->val;
ans = (ans + 1ll * cnt * len % M * (len - 1) % M * inv[4] % M) % M;
}
for (map::pad *it1 = Map.begin(); it1 != Map.end(); ++it1)
for (map::pad *it2 = Map.begin(); it2 != Map.end(); ++it2) {
if (it1 == it2) {
int len = it1->key, cnt = 1ll * (0 + (it1->val - 1)) * it1->val / 2 % M;
ans = (ans + 1ll * cnt * calc(len, len) % M) % M;
} else if (it1->key < it2->key) {
int len1 = it1->key, len2 = it2->key,
cnt = 1ll * it1->val * it2->val % M;
ans = (ans + 1ll * cnt * calc(len1, len2) % M) % M;
}
}
printf("%d", ans);
}
| 2C++
| {
"input": [
"3 2 998244353\n",
"9 3 998244353\n",
"3 1 998244353\n",
"9 4 998244353\n",
"53812 4 967428361\n",
"7 2 400166453\n",
"75727 16 485722667\n",
"65536 10 802338989\n",
"65535 12 196344479\n",
"5000 4 961162523\n",
"13694 5 579788161\n",
"99999 14 746231791\n",
"14823 8 622667251\n",
"65536 1 262776883\n",
"65535 4 585040979\n",
"1 2 932173633\n",
"65535 13 543456539\n",
"56907 7 653135281\n",
"65535 16 589256509\n",
"79602 9 341282581\n",
"65535 15 148502831\n",
"91299 13 883710911\n",
"65536 7 999999937\n",
"65535 3 200770211\n",
"4558 9 768001957\n",
"78790 14 947580449\n",
"11045 4 779484089\n",
"65536 7 474924587\n",
"100000 1 327496733\n",
"7 4 674998729\n",
"93705 8 728681249\n",
"65535 7 775068599\n",
"93014 3 464769397\n",
"65536 9 512750233\n",
"65536 8 624488609\n",
"2 2 105534269\n",
"4 2 717931793\n",
"29670 1 798626077\n",
"1 100000 355399153\n",
"4866 5 828460181\n",
"5000 3 947484677\n",
"4862 11 340369703\n",
"67260 11 159230609\n",
"96560 6 621206447\n",
"6 4 142235399\n",
"319 6 736338271\n",
"99999 4 721319531\n",
"5000 5000 824957897\n",
"95449 16 477786341\n",
"65536 4 530056207\n",
"5 2 488196377\n",
"99999 10 201673531\n",
"8 2 401001541\n",
"65536 2 547031129\n",
"65535 6 100000007\n",
"87440 14 373345151\n",
"99999 5 950991961\n",
"65535 10 764125471\n",
"39062 3 557718113\n",
"100000 4 866430809\n",
"99999 7 612486629\n",
"65610 7 576223171\n",
"3 3 537728333\n",
"79173 7 329778431\n",
"19679 2 978579983\n",
"65535 1 969378797\n",
"8 4 617453693\n",
"99999 2 594212063\n",
"99999 3 538530137\n",
"99999 15 385602223\n",
"65535 2 332622313\n",
"31581 2 803297119\n",
"65536 16 307380313\n",
"5 4 294228373\n",
"12657 1 328355033\n",
"4 3 691608353\n",
"65536 17 355422121\n",
"2 3 738541207\n",
"68102 2 409693891\n",
"65535 14 379941571\n",
"65536 12 883299773\n",
"59614 14 431666281\n",
"99999 11 739822453\n",
"20621 4 420701179\n",
"65536 14 292184353\n",
"23880 14 515153497\n",
"99999 8 616151843\n",
"33727 15 177545087\n",
"8 3 930233189\n",
"65536 6 526215803\n",
"9292 12 386116849\n",
"3 2 457143689\n",
"5 3 698057369\n",
"64554 13 711786883\n",
"99999 18 278747437\n",
"6 3 706327789\n",
"6 2 126580711\n",
"100000 3 372547751\n",
"99999 17 222262553\n",
"7 3 957060541\n",
"99999 6 769267349\n",
"58791 1 627994511\n",
"92275 9 505206379\n",
"65535 9 939195329\n",
"65535 8 629794369\n",
"65536 11 506680939\n",
"99999 1 501051697\n",
"5000 2 444286949\n",
"99999 12 608975467\n",
"99999 16 424240459\n",
"65535 5 492219967\n",
"9569 7 974022443\n",
"100000 2 330782867\n",
"65536 5 347538067\n",
"99999 9 543989543\n",
"93976 8 747153793\n",
"42288 6 367611719\n",
"100000 100000 658399519\n",
"65536 3 759400619\n",
"65536 13 543490043\n",
"99999 13 838056061\n",
"65535 6 563701807\n",
"65535 17 131827369\n",
"1 1 807831149\n",
"65536 15 568071787\n",
"65535 11 390043253\n",
"58370 15 756534617\n",
"74973 12 872697443\n",
"53812 5 967428361\n",
"12 2 400166453\n",
"27203 10 802338989\n",
"59715 12 196344479\n",
"14823 11 622667251\n",
"80668 1 262776883\n",
"1 4 932173633\n",
"8041 13 543456539\n",
"89551 7 653135281\n",
"65535 13 589256509\n",
"65535 9 148502831\n",
"76586 13 883710911\n",
"65535 6 200770211\n",
"58162 7 775068599\n",
"93014 2 464769397\n",
"65536 6 512750233\n",
"5000 2 947484677\n",
"4862 4 340369703\n",
"478 6 736338271\n",
"95449 8 477786341\n",
"65536 4 427104367\n",
"7 2 488196377\n",
"40929 10 201673531\n",
"4 2 401001541\n",
"65536 2 937051711\n",
"99999 10 950991961\n",
"55933 10 764125471\n",
"39062 5 557718113\n",
"7205 7 576223171\n",
"3 1 537728333\n",
"79173 13 329778431\n",
"65535 2 969378797\n",
"12657 2 328355033\n",
"5 3 691608353\n",
"68102 4 409693891\n",
"98757 14 379941571\n",
"20621 1 420701179\n",
"99999 13 616151843\n",
"33727 10 177545087\n",
"6 2 457143689\n",
"99999 2 278747437\n",
"7 2 126580711\n",
"31157 1 627994511\n",
"21025 9 939195329\n",
"65535 11 629794369\n",
"99999 4 608975467\n",
"9569 9 974022443\n",
"100000 2 356499727\n",
"4558 15 768001957\n",
"8 4 674998729\n",
"2 2 196326497\n",
"2 100000 355399153\n",
"67260 20 159230609\n",
"8 7 617453693\n",
"65536 28 307380313\n",
"5 8 294228373\n",
"2888 17 355422121\n",
"23880 25 515153497\n",
"8 6 930233189\n",
"9292 16 386116849\n"
],
"output": [
"665496236\n",
"449209967\n",
"499122178\n",
"665496237\n",
"950881274\n",
"37158321\n",
"166058860\n",
"462855383\n",
"7405077\n",
"935148925\n",
"20837734\n",
"534083991\n",
"282687828\n",
"22617908\n",
"73478343\n",
"0\n",
"170536956\n",
"367828981\n",
"362272581\n",
"15283453\n",
"46429722\n",
"238048909\n",
"195101941\n",
"26568059\n",
"338635790\n",
"804769289\n",
"766560946\n",
"244871950\n",
"207497869\n",
"0\n",
"90464274\n",
"580904942\n",
"3096497\n",
"56371267\n",
"456424095\n",
"0\n",
"59827651\n",
"619382846\n",
"0\n",
"236115936\n",
"453430334\n",
"187513462\n",
"38214063\n",
"336730170\n",
"0\n",
"133698563\n",
"482453887\n",
"0\n",
"181225428\n",
"175616225\n",
"455649955\n",
"6497465\n",
"108365903\n",
"68232417\n",
"19616415\n",
"58174995\n",
"236965854\n",
"44493100\n",
"311741364\n",
"315155497\n",
"160702769\n",
"475692890\n",
"0\n",
"112881569\n",
"166411803\n",
"589003274\n",
"0\n",
"241186421\n",
"420705596\n",
"286320285\n",
"23332505\n",
"335334542\n",
"210721421\n",
"0\n",
"40046748\n",
"0\n",
"0\n",
"0\n",
"248567049\n",
"364848655\n",
"385022293\n",
"382826545\n",
"286705678\n",
"289746143\n",
"211044160\n",
"28372663\n",
"506564910\n",
"137396822\n",
"465116600\n",
"158448501\n",
"339357599\n",
"304762460\n",
"1\n",
"501856006\n",
"0\n",
"529745844\n",
"61180682\n",
"341122978\n",
"24806593\n",
"239265139\n",
"537638613\n",
"550083467\n",
"372045131\n",
"374972142\n",
"563763277\n",
"206613192\n",
"245192364\n",
"161627985\n",
"317105066\n",
"81192002\n",
"1097877\n",
"297115301\n",
"20709968\n",
"50947333\n",
"330542468\n",
"239386990\n",
"235655808\n",
"0\n",
"725177449\n",
"510005251\n",
"772746099\n",
"478190145\n",
"0\n",
"0\n",
"2593916\n",
"2137720\n",
"174119749\n",
"741474461\n",
"917661730",
"283075928",
"609490011",
"177057827",
"371585348",
"50150091",
"0",
"4639320",
"376344920",
"39302203",
"112736555",
"796832946",
"172311008",
"105621524",
"253519494",
"440659059",
"580574907",
"88006673",
"215597521",
"350368233",
"26721086",
"407992694",
"119000082",
"167083977",
"867192219",
"241380517",
"116443791",
"516123427",
"372129053",
"268864168",
"58492360",
"469948571",
"81278217",
"1",
"357288965",
"34664831",
"106301255",
"245015784",
"173904684",
"236190911",
"132612778",
"35261777",
"242681873",
"714422268",
"438097614",
"46413838",
"224951190",
"153235142",
"0",
"0",
"0",
"0",
"0",
"0",
"0",
"0",
"0",
"0",
"0",
"0"
]
} | 2CODEFORCES
|
End of preview. Expand
in Dataset Viewer.
Dataset Card for Code Contest Processed
Dataset Summary
This dataset is created by processing code_contest dataset from Deepmind. It is a competitive programming dataset for machine-learning. Read more about dataset at original source.
Columns Description
id: unique string associated with a problemdescription: problem descriptioncode: one correct code for the problemlanguage: programming language used for codetest_samples: contains inputs and their corresponding outputs for the problemsource: source of problem
- Downloads last month
- 82