instruction_seed stringlengths 189 24.4k | _source stringclasses 1
value | embedding sequencelengths 3.07k 3.07k | mean_positive_score float64 0.15 0.35 | mean_negative_score float64 0.01 0.17 | difference_score float64 0.14 0.25 |
|---|---|---|---|---|---|
There is a job which can be decomposed into x equally-sized smaller tasks. You have a team of size y <= x, where every member works equally fast on any task. The goal for this challenge is to divide the work as evenly as possible such that every member of your team has at least 1 task to perform. As evenly as possible means that given any member a, the number of tasks it must perform may be at most one more than any other member b. A single task cannot be further divided or worked on simultaneously by two members.
Input
Your program/function will take as input two positive integers x and y. y is guaranteed to be less than or equal to x. You are free to decide in what order your program will take these inputs. You may take the inputs from any input source desired.
Output
Your program/function will output a list of positive integers of length y representing the number of tasks each member must perform. The list may be in any order. For example, the following outputs are identical:
2 1 2 1
1 1 2 2
2 2 1 1
Outputs may be to any output sink desired.
Examples
Each line pair denotes inputs and one possible output. These example inputs specify x first.
1 1
1
4 1
4
4 2
2 2
4 3
2 1 1
4 4
1 1 1 1
10 3
3 4 3
10 7
1 2 2 2 1 1 1
Scoring
This is code golf; shortest code wins. Standard loopholes apply.
| stackexchange_codegolf | [
-0.012169911526143551,
0.009494833648204803,
-0.008411257527768612,
0.03860238939523697,
-0.009027541615068913,
0.003616434521973133,
0.011634895578026772,
0.03201966732740402,
0.025911007076501846,
0.028227150440216064,
-0.02866058237850666,
-0.002094348892569542,
0.01820407435297966,
0.0... | 0.273979 | 0.083697 | 0.190282 |
Problem
John bought 5 apples. You are given the weights of every group of four apples, and must then find the weights of the apples themselves.
For example, if all apples without the first one weigh 798 g, without the second - 794 g, without the third - 813 g, without the fourth - 806 g, and without the fifth - 789 g, the weights are 202, 206, 187, 194, and 211.
Rules
The solution of the problem by enumeration is allowed
Consider the number of points as follows: the number of bytes in your code. The lower the number of points, the better.
Have fun!
| stackexchange_codegolf | [
-0.008431856520473957,
0.006825625896453857,
-0.0017740462208166718,
-0.004407717380672693,
-0.012774502858519554,
-0.04854996129870415,
0.03391921520233154,
0.051125410944223404,
0.004280999768525362,
-0.0034658974036574364,
0.004568682983517647,
-0.023850305005908012,
0.014754037372767925,... | 0.288557 | 0.145627 | 0.14293 |
"Your input is an array of numbers: a permutation of \\$\\{1, 2 \\dots n\\}\\$ for some integer \\$n(...TRUNCATED) | stackexchange_codegolf | [-0.016256216913461685,-0.011137207970023155,-0.013480765745043755,-0.016057971864938736,-0.01578892(...TRUNCATED) | 0.251404 | 0.101416 | 0.149988 |
"The name of the challenge was prompted by this GIF and the GIF also gave me the idea.\nYour challen(...TRUNCATED) | stackexchange_codegolf | [0.0067511266097426414,0.032875049859285355,-0.010693730786442757,0.017611633986234665,0.00657767849(...TRUNCATED) | 0.274093 | 0.114621 | 0.159472 |
"Problem description\nVertices \\$V\\$ of directed graph \\$G=(V,E)\\$ represent gossipping ladies; (...TRUNCATED) | stackexchange_codegolf | [-0.01747760735452175,0.011889001354575157,-0.009415355511009693,0.027710463851690292,0.009936865419(...TRUNCATED) | 0.227634 | 0.048925 | 0.178709 |
"A superpermutation on n symbols is a string which contains every permutation of n symbols in its bo(...TRUNCATED) | stackexchange_codegolf | [0.012981436215341091,0.005661121569573879,-0.010913286358118057,0.03147793933749199,0.0132268099114(...TRUNCATED) | 0.214057 | 0.058231 | 0.155826 |
"Specifications\nYour program must can take in an integer n, then take in n more strings (containing(...TRUNCATED) | stackexchange_codegolf | [0.009720866568386555,0.023930445313453674,-0.010955262929201126,0.027156706899404526,-0.01962408795(...TRUNCATED) | 0.250617 | 0.107654 | 0.142963 |
"Given a set of intervals \\$\\mathcal{I} = \\{I_1, \\ldots, I_m\\}\\$, where each interval \\$I_j\\(...TRUNCATED) | stackexchange_codegolf | [0.004652287811040878,0.02385037951171398,-0.008900332264602184,-0.020379459485411644,-0.01657399348(...TRUNCATED) | 0.273077 | 0.070164 | 0.202913 |
"Given two natural numbers (less than 100) as input print the sequence of intermediate results obtai(...TRUNCATED) | stackexchange_codegolf | [0.015185413882136345,0.004571838770061731,-0.004014899488538504,0.0013562182430177927,-0.0192602369(...TRUNCATED) | 0.236602 | 0.08206 | 0.154542 |
"Challenge\nIn this challenge, you have to fill an \\$M\\$ x \\$N\\$ rectangle grid with the most \\(...TRUNCATED) | stackexchange_codegolf | [0.03244597837328911,-0.02471691183745861,-0.012116922065615654,0.0288766510784626,0.012479222379624(...TRUNCATED) | 0.291429 | 0.108222 | 0.183207 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3