text stringlengths 525 23.5k | conversation_id int64 129 108k | embedding sequence | cluster int64 6 6 |
|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 129 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 130 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 131 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 132 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 133 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 134 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 135 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem is different from the easy version. In this version Ujan makes at most 2n swaps. In addition, k ≤ 1000, n ≤ 50 and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previo... | 136 | [
0.28955078125,
-0.09613037109375,
-0.1514892578125,
-0.057098388671875,
-0.62646484375,
-0.5537109375,
0.038604736328125,
-0.0033721923828125,
0.071533203125,
1.01953125,
0.978515625,
0.06304931640625,
0.2388916015625,
-1.1875,
-0.63916015625,
-0.00443267822265625,
-0.4404296875,
-... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Little Girl loves problems on games very much. Here's one of them.
Two players have got a string s, consisting of lowercase English letters. They play a game that is described by the following rules:
* The players move in turns; In o... | 286 | [
-0.05926513671875,
-0.02166748046875,
-0.0196075439453125,
0.052215576171875,
-0.450927734375,
-0.7783203125,
0.09783935546875,
-0.270263671875,
0.10504150390625,
0.57373046875,
0.467529296875,
0.044158935546875,
0.09722900390625,
-0.6591796875,
-0.7041015625,
-0.381103515625,
-0.829... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Little Girl loves problems on games very much. Here's one of them.
Two players have got a string s, consisting of lowercase English letters. They play a game that is described by the following rules:
* The players move in turns; In o... | 287 | [
-0.058990478515625,
0.04998779296875,
-0.04571533203125,
0.0178375244140625,
-0.456298828125,
-0.7587890625,
0.0537109375,
-0.1953125,
0.0712890625,
0.578125,
0.54736328125,
0.0281982421875,
0.02008056640625,
-0.72607421875,
-0.62646484375,
-0.3623046875,
-0.80859375,
-0.7827148437... | 6 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Little Girl loves problems on games very much. Here's one of them.
Two players have got a string s, consisting of lowercase English letters. They play a game that is described by the following rules:
* The players move in turns; In o... | 288 | [
-0.0165557861328125,
0.034942626953125,
-0.0272216796875,
0.042144775390625,
-0.454833984375,
-0.7890625,
0.053314208984375,
-0.215576171875,
0.113525390625,
0.56787109375,
0.529296875,
0.049713134765625,
0.07135009765625,
-0.63720703125,
-0.65185546875,
-0.384765625,
-0.78076171875,... | 6 |
End of preview. Expand in Data Studio
- Downloads last month
- 4