CN111145422B - Competition label sequence construction method, device, equipment and readable storage medium - Google Patents
Competition label sequence construction method, device, equipment and readable storage medium Download PDFInfo
- Publication number
- CN111145422B CN111145422B CN201911272316.5A CN201911272316A CN111145422B CN 111145422 B CN111145422 B CN 111145422B CN 201911272316 A CN201911272316 A CN 201911272316A CN 111145422 B CN111145422 B CN 111145422B
- Authority
- CN
- China
- Prior art keywords
- competition
- array
- tag
- label
- total number
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C15/00—Generating random numbers; Lottery apparatus
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the technical field of automatic race course arrangement, and provides a method, a device, equipment and a readable storage medium for constructing a race label sequence, wherein the method comprises the following steps: respectively inputting a competition personnel information set, a drawing parameter set and a grouping number; performing lottery arrangement processing on the competitor information sets according to the lottery parameter sets to obtain a competition tag sequence to be verified; performing fairness check processing on the sign sequence to which the competition tag sequence to be checked belongs according to the number of the groups to obtain an expected competition tag sequence; compared with the existing competition tag sequence construction method, the operation steps of checking the competition tag sequence to be checked are added, the existing competition tag sequence construction method is mainly focused on the checking-free competition tag sequence, and the fairness and the accuracy of automatically constructing the expected competition tag sequence are enhanced, so that the construction quality of the expected competition tag sequence is improved, and the expected competition tag sequence is more fit for the electronic competition process.
Description
Technical Field
The invention relates to the technical field of automatic race schedule arrangement, in particular to a method, a device, equipment and a readable storage medium for constructing a competition tag sequence.
Background
The automatic drawing arrangement service is provided by applying computer programs such as an electronic commerce program, a game program, a course program and the like, so that the manpower consumed by manual drawing arrangement is saved, and the drawing arrangement efficiency is improved.
The conventional course program carries out drawing arrangement on a drawing object group depending on the input drawing probability or/and drawing instructions, so that the drawing object group is constructed into a competition tag sequence serving as the basis of electronic course arrangement.
Disclosure of Invention
Aiming at the problem that the existing competition tag sequence construction method focuses on the check-free competition tag sequence, the invention provides a competition tag sequence construction method, a device, equipment and a readable storage medium.
The invention provides a competition tag sequence construction method in a first aspect, which comprises the following steps:
respectively inputting a competition personnel information set, a drawing parameter set bound with the competition personnel information set and a group number bound with the drawing parameter set;
performing lottery arrangement processing on the competitor information sets according to the lottery parameter sets to obtain a competition tag sequence to be verified;
and carrying out fairness check processing on the signature sequence to which the competition tag sequence to be checked belongs according to the group number to obtain the expected competition tag sequence.
The second aspect of the present invention provides a competition tag sequence constructing apparatus, including:
the data loading module is used for respectively inputting a competition participant information set, a drawing parameter set bound with the competition participant information set and a grouping number bound with the drawing parameter set;
the drawing and arranging module is used for drawing and arranging the information sets of the competitors according to the drawing and arranging parameter set to obtain a competition tag sequence to be verified;
and the sign bit checking module is used for carrying out fairness checking processing on the sign bit sequence to which the competition tag sequence to be checked belongs according to the grouping number to obtain the expected competition tag sequence.
A third aspect of the present invention provides an intelligent drawing device, including: a memory configured to store a course program and a processor coupled to the memory, the processor configured to load and execute the course program to implement the operational steps performed by the race tag sequence construction method according to the first aspect.
A fourth aspect of the present invention provides a computer-readable storage medium configured with at least one instruction or at least one program or set of codes or sets of instructions, which is loaded and executed to implement the operational steps performed by the competition tag sequence construction method according to the first aspect.
The competition tag sequence construction method, the competition tag sequence construction device, the intelligent drawing equipment and the computer readable storage medium have the advantages that: compared with the existing competition tag sequence construction method, the operation step of checking the competition tag sequence to be checked is added, the defect that the existing competition tag sequence construction method emphasizes on checking-free competition tag sequence is overcome, and the fairness and the accuracy of automatically constructing the expected competition tag sequence are enhanced, so that the construction quality of the expected competition tag sequence is improved, and the expected competition tag sequence is more suitable for the electronic competition process.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a schematic flow chart of a competition tag sequence construction method according to an embodiment of the present invention;
fig. 2 is a GUI schematic diagram for displaying a custom check-in interface on a smart television according to an embodiment of the present invention;
fig. 3 is a GUI schematic diagram for displaying a customized configuration interface of a drawing parameter on a smart television according to an embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a competition tag sequence constructing apparatus according to an embodiment of the present invention;
fig. 5 is a schematic view of a communication principle of the intelligent drawing device provided by the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth by way of illustration only and are not intended to limit the scope of the invention.
Example one
As shown in FIG. 1, a competition tag sequence construction method includes the following operation steps:
and 3, performing fairness check processing on the signature sequence to which the competition tag sequence to be checked belongs according to the number of the groups to obtain the expected competition tag sequence.
In a particular aspect, a display device, such as a smartphone, tablet computer, desktop computer, and smart television, is configured with a course program that, when loaded and run by the aforementioned display device, provides a custom check-in interface for the display device to display the custom check-in interface, the custom check-in interface including a plurality of contestant entry records and a check-in selection field corresponding one-to-one to each contestant entry record, the course program recording a check-in status corresponding to each check-in selection field in response to a user operation in the area where each check-in selection field occupies the custom check-in interface, and binding the check-in status and each contestant entry record to corresponding contestant entry information, forming a contestant information set from all contestant entry records in the check-in status to enable the contestant information set to be imported into the course program, the competition personnel information sets can be conveniently configured in a user-defined mode in the competition process program, and the user experience is improved.
As shown in fig. 2, the custom check-in interface is shown, on the custom check-in interface, each entry record of the competitor includes a player name, an age, a gender, an identification number, a project group, a mobile phone number and a province, and when the check-in selection bar is switched from a default color to gray, the gray presented by the check-in selection bar is used as a check-in state.
In a specific embodiment, the course program further provides a self-defined configuration interface for the drawing parameters, and in response to an interface switching operation input on the self-defined check-in interface, the display device switches and displays the self-defined check-in interface as the self-defined configuration interface for the drawing parameters, as shown in fig. 3, the self-defined configuration interface for the drawing parameters presents a competition system selection field, a seed number input field, a group number input field and a plurality of seed number input fields bound to the check-in status, the competition system selection field provides a self-defined configuration function related to the competition system tags, the total seed number input field provides a self-defined configuration function related to the total seed number, the group number input field provides a self-defined configuration function related to the group number, and each of the seed number input fields provides a self-defined configuration function related to the corresponding seed number value, so that the competition system tags respectively configured in the competition system selection field, The total seed number in the total seed number input field and the seed number values in various sub number input fields form a drawing parameter set, so that the drawing parameter set and the grouping number configured to the grouping number input field are input into the course program, the drawing parameter set and the grouping number bound with the competitor information set are conveniently configured in the course program in a user-defined mode, and the user experience is improved.
In a specific mode, during the process that the course program is continuously operated by the display device, the step 2 and the step 3 are executed in a serial mode through the course program, after the step 3, the electronic course presented in a form or a map is generated according to the expected competition tag sequence through the course program, and the electronic course is uploaded to the competition server through the display device.
Compared with the existing competition tag sequence construction method, the operation step of checking the competition tag sequence to be checked is added, the defect that the existing competition tag sequence construction method emphasizes on checking-free competition tag sequence is overcome, and the fairness and the accuracy of automatically constructing the expected competition tag sequence are enhanced, so that the construction quality of the expected competition tag sequence is improved, and the expected competition tag sequence is more suitable for the electronic competition process.
As an optional implementation manner, step 2 specifically includes the following operation steps:
step 21, extracting the match-making labels, the total number of seeds and a plurality of seed number values from the extraction parameter set;
step 22, when the competitor information set is not an empty set, the competitor sign-in entry information bound with various sub-number values one by one is extracted from the competitor information set, the various sub-number values bound with each other and the competitor sign-in entry information are reconstructed to obtain corresponding competitor tags, and the competitor tags are stored until the last competitor tag is stored;
and step 23, classifying and arranging all competition player labels according to the total number of the seeds and the competition system labels to obtain a competition label sequence to be verified.
In a specific embodiment, the match system tag includes a bad match system or a obsolete match system expressed in a text format, and the total number of seeds is less than the total number of the registration information of all competitors, for example: the total number of seeds is 8 and the total number of all contestants sign-in entry information is 64, and all seed number values may constitute a seed number sequence in the order from 1 to the total number of seeds, for example: the seed number sequence is denoted as [1,2,3,4,5, 6,7,8 ].
In a specific mode, the competition process program judges whether the competition personnel information set belongs to an empty set, when the competition personnel information set is the empty set, prompt information used for indicating no sign-in personnel is output to be displayed by display equipment, so that a user can visually know the sign-in condition of competition entry personnel, the judgment result of the nonempty set of the competition personnel information set is used as a trigger basis for executing the step of carrying out the drawing and reorganization on the competition personnel information set, and each seed number value and each competition personnel sign-in entry information which are bound with each other are constructed into corresponding competition player tags, for example: each contestant label is represented as a key value pair, the keys in the key value pair are provided with corresponding seed number values, and the values in the key value pair are provided with contestant sign-in entry information, so that the reliability of the drawing reorganization step is guaranteed.
As an optional implementation manner, step 23 specifically includes the following operation steps:
step 231, configuring the total number of the tags of all contestants as the total number of contestants, and configuring the total number equal to 2 according to the total number of contestantsaThe minimum number of the signs is more than or equal to the total number of the participants, and the total number of the participants is more than or equal to 2;
step 232, respectively creating a first array and a second array;
step 233, identifying one by one whether the seed number value to which each contestant label belongs to a null value, if not, storing the corresponding contestant label to a first array, if so, storing the corresponding contestant label to a second array until the last contestant label is stored;
step 234, creating a third array matched with the minimum signature number;
step 235, storing all contestant tags in the first array and all contestant tags in the second array to a third array;
step 236, configuring the difference value between the minimum signature number and the total number of the participated persons as the total number of the wheel space;
step 237a, when the total number of the wheel spaces is zero, storing a preset wheel space tag in the third array is avoided;
and 238, classifying and recombining the third array according to the minimum signature number, the total number of the seeds and the competition tags to obtain a competition tag sequence to be verified.
As an optional implementation manner, step 23 specifically includes the following operation steps:
step 231, configuring the total number of the tags of all contestants as the total number of contestants, and configuring the total number equal to 2 according to the total number of contestantsaThe minimum number of the signs is more than or equal to the total number of the participants, and the total number of the participants is more than or equal to 2;
step 232, respectively creating a first array and a second array;
step 233, identifying one by one whether the seed number value to which each contestant label belongs to a null value, if not, storing the corresponding contestant label to a first array, if so, storing the corresponding contestant label to a second array until the last contestant label is stored;
step 234, creating a third array matched with the minimum signature number;
step 235, storing all contestant tags in the first array and all contestant tags in the second array to a third array;
step 236, configuring the difference value between the minimum signature number and the total number of the participated persons as the total number of the wheel space;
step 237b, when the total number of the wheel spaces is greater than zero, respectively storing preset wheel space labels in each wheel space in the third array;
and 238, classifying and recombining the third array according to the minimum signature number, the total number of the seeds and the competition tags to obtain a competition tag sequence to be verified.
In a specific embodiment, during the course program executing step 231, each contestant tag is cumulatively counted to obtain the total number of all contestant tags, the total number is set as the total number of contestants, and whether the total number of contestants meets the power of 2 is verified, if yes, the total number of contestants is configured as the minimum number of tags, and if not, the total number of contestants is 2 with the minimum difference between the minimum number of contestantsaConfigured as a minimum number of signatures, for example: the total number of the participants is equal to 7, and the minimum signature number is 23Equal to 8, or a total number of participants equal to 28 and a minimum number of 2 tokens5Equal to 32.
In a specific mode, in the course of executing the step 232 through the course program, two one-dimensional arrays with the length equal to the total number of the participants are synchronously created, and the two one-dimensional arrays are divided into a first array and a second array, so that the creation efficiency and the reliability of the first array and the second array are ensured.
In a specific embodiment, in the course of the operation step 233 executed by the course program, for any one of the contest player tags, when the course program determines that the seed number value assigned to the contest player tag is null, it indicates that the corresponding contest player tag belongs to a normal player tag, the contest player tags belonging to the normal player tag are stored in a first array, and when the course program determines that the seed number value assigned to the contest player tag is not null, it indicates that the corresponding player tag belongs to a seed player tag, the contest player tags belonging to the seed player tag are stored in a second array, and after the last contest player tag is stored, if at least one contest player tag exists in the first array, the first array is a normal tag array, for example: the common tag array is denoted as [ null → R1, null → R2], null denotes a null value of seed number, R1 and R2 denote two different contestant check-in entry information, and if at least one contestant tag is present in the second array, the second array is a seed tag array, for example: the seed label array is represented as [1 → R3, 2 → R4], 1 and 2 represent two non-null seed number values, and R3 and R4 represent registration information of two different competitors, so that the reliability of automatic classified storage of all competitor labels is ensured.
In a specific manner, during the course program executing step 234, a one-dimensional null array with a length equal to the minimum signature number is created, and the one-dimensional null array is determined as the third array, so that the reliability of the third array is ensured.
In a specific mode, in the course of executing step 235 through the course program, the first array is traversed, the competition player tags are extracted one by one from the first array, the extracted competition player tags are stored in the vacant positions in the third array until the last competition player tag in the first array is extracted and stored in the vacant position in the third array, then the second array is traversed, the competition player tags are extracted one by one from the second array, the extracted competition player tags are stored in the vacant positions in the third array until the last competition player tag in the second array is extracted and stored in the vacant position in the third array, so that all competition player tags in the third array are in a discrete distribution characteristic, and the difficulty of discretely storing all competition player tags in the third array is effectively reduced.
In a specific embodiment, after the step 236 is executed by the course program, if the difference between the minimum signature number and the total number of persons participating in the race is zero, the total number of the rounds is equal to zero, and if the difference between the minimum signature number and the total number of persons participating in the race is non-zero, the total number of the rounds is greater than zero, and it is verified whether the total number of the rounds is equal to zero, if so, the step 237a is executed by the course program, and if not, the step 237b is executed by the course program.
In a specific manner, in the process of executing step 237a by the course program, the verification result that the total number of the wheel wells is zero is taken as a basis for avoiding storing the preset wheel well tag in the third array, and the operation of storing the preset wheel well tag in the third array can be avoided by outputting the third array, so that the preset wheel well tag is prevented from being stored in the third array under the condition that the total number of the wheel wells is zero, which is beneficial to saving the processing time of the third array and improving the processing efficiency of the third array.
In a specific manner, in the process of executing step 237a through the course program, the verification result that the total number of the wheel wells is greater than zero is used as a basis for storing the preset wheel well tags in each remaining wheel well in the third array, and all the preset wheel well tags whose total number is equal to the total number of the wheel wells can be synchronously and discretely stored in the third array, so that all the preset wheel well tags in the third array are in a discrete distribution characteristic, thereby avoiding the need of storing the preset wheel well tags in each remaining wheel well in the third array under the condition that the total number of the wheel wells is greater than zero, improving the reliability of storing the preset wheel well tags in the third array, and preventing the preset wheel well tags from being mistakenly stored in the third array.
As an optional implementation manner, step 238 specifically includes the following operation steps:
step 2381, performing classification and recombination on the third array to obtain a fixed seed label array, a variable seed label array, a common label array and a null label array;
2382, according to the minimum sign number sum equals 2bCreates a two-dimensional array satisfying m x n, where b ∈ [2, a-1 ]]M is greater than or equal to the ratio between the minimum signature number and a first preset threshold, and n is greater than or equal to the first preset threshold;
step 2383a, when the total number of seeds is equal to 1, and only one contestant tag exists in the fixed seed tag array, and at least one contestant tag exists in the ordinary tag array, storing one contestant tag in the fixed seed tag array in the 1 st row and the 1 st column of the two-dimensional array, and storing any contestant tag in the ordinary tag array in the mth row and the nth column of the two-dimensional array;
step 2384a, when only one preset empty tag exists in the empty tag array, storing the preset empty tag in the empty tag array in the 2 nd row of the 1 st row to which the two-dimensional array belongs;
step 2385, when at least one contestant label exists in the modified seed label array, discretely storing all contestant labels in the modified seed label array in a vacancy partition to which the two-dimensional array belongs according to the contestant label and the minimum label number, wherein the vacancy partition belongs to a region formed from the 1 st row, the 3 rd column to the m th row, the n-1 st column to which the two-dimensional array belongs;
step 2386, after all the contestant tags in the modified seed tag array are stored in the empty location partition, if at least one remaining preset empty tag except the two preset empty tags which are stored in the 2 nd row of the 1 st row and the n-1 th row respectively exists in the empty wheel tag array, storing the remaining preset empty wheel tags in the empty wheel tag array in the empty location partition one by one until the empty wheel tag array is an empty wheel array;
step 2387, after all the remaining preset wheel empty tags in the wheel empty tag array are stored in the empty space partition, if at least one contestant tag exists in the ordinary tag array, storing the contestant tags in the ordinary tag array in the empty space partition one by one until the ordinary tag array is an empty array;
and 2388, determining the two-dimensional array formed by recombining the fixed seed label array, the variable seed label array, the common label array and the empty label array as the competition label sequence to be verified.
As an optional implementation manner, step 238 specifically includes the following operation steps:
step 2381, performing classification and recombination on the third array to obtain a fixed seed label array, a variable seed label array, a common label array and a null label array;
2382, according to the minimum sign number sum equals 2bCreates a two-dimensional array satisfying m x n, where b ∈ [2, a-1 ]]M is greater than or equal to the ratio between the minimum signature number and a first preset threshold, and n is greater than or equal to the first preset threshold;
step 2383b, when the total number of seeds is greater than or equal to 2 and only two contestant labels exist in the fixed seed label array, discretely storing the two contestant labels in the fixed seed label array in the 1 st row, the 1 st column and the mth row, the nth column of the 1 st row to which the two-dimensional array belongs;
step 2384b, when at least two preset null tags exist in the null tag array, discretely storing any two preset null tags in the null tag array in the 2 nd column of the 1 st row and the n-1 th column of the m-th row to which the two-dimensional array belongs;
step 2385, when at least one contestant label exists in the modified seed label array, discretely storing all contestant labels in the modified seed label array in a vacant partition to which the two-dimensional array belongs according to the contest label and the minimum label number, so that the modified seed label array is a vacant array, and the vacant partition belongs to an area formed by the 1 st row, the 3 rd column to the m th row, the n-2 th column to which the two-dimensional array belongs;
step 2386, after all the contestant tags in the modified seed tag array are stored in the empty location partition, if at least one remaining preset empty tag except the two preset empty tags which are stored in the 2 nd row of the 1 st row and the n-1 th row respectively exists in the empty wheel tag array, storing the remaining preset empty wheel tags in the empty wheel tag array in the empty location partition one by one until the empty wheel tag array is an empty wheel array;
step 2387, after all the remaining preset wheel empty tags in the wheel empty tag array are stored in the empty space partition, if at least one contestant tag exists in the ordinary tag array, storing the contestant tags in the ordinary tag array in the empty space partition one by one until the ordinary tag array is an empty array;
and 2388, determining the two-dimensional array formed by recombining the fixed seed label array, the variable seed label array, the common label array and the empty label array as the competition label sequence to be verified.
As an optional implementation manner, in step 2385, discretely storing all contestant tags in the modified seed tag array in the vacancy partition to which the two-dimensional array belongs according to the contest tags and the minimum tag number, specifically includes: when the competition system label marks the circulation competition system, configuring a variable seed signature sequence according to the minimum signature and a first preset fair sorting rule which is consistent with the circulation competition system; or when the competition system label marks eliminate the competition system, configuring the signature sequence of the variable seeds according to the minimum signature and a second preset fair sorting rule which is consistent with the elimination competition system; carrying out hierarchical unit statistics on all contestant labels in the variable seed label array to obtain all hierarchical unit information; and (3) according to the sequence of the variable seed labels and the information of all hierarchical units, allocating the official labels of all contestants in the variable seed label array to the vacancy subarea in a flattening way, so that all the contestant labels in the vacancy subarea are in the characteristic of uniform distribution of the same-level unit subareas.
As an optional implementation manner, step 3 specifically includes the following operation steps:
step 31, carrying out unit statistics of the same level on the competition tag sequence to be verified to obtain all unit information of the same level and the total number of units matched with all unit information of the same level;
step 32, configuring checking times according to the minimum signature number, a second preset threshold value and the total number of units;
step 33, averagely grouping the signature sequences to which the competition tag sequences to be verified belong according to the grouping number to obtain at least two grouped signature sequences;
step 34, performing same-group statistics on all grouping signature sequences according to unit information of each same level to obtain the total number of corresponding same-group signatures;
step 35, verifying whether the total number of the tags in each group is equal to zero one by one, if so, scoring the tag sequence of the competition tag sequence to be verified as a preset fair score, otherwise, reducing the preset fair score to a corresponding current evaluation score according to the total number of the tags in each group which is not zero until the last total number of the tags in the same group is verified;
step 36a, when the score of the signature sequence to which the competition tag sequence to be verified belongs is a preset fair score, configuring the competition tag sequence to be verified as an expected competition tag sequence;
step 36b, when the preset fairness score is reduced to the current evaluation score, the sequence of the tag positions to which the competition tag sequences to be checked belong is adjusted according to the total number of the non-zero tags in each same group, and the current competition tag sequences are obtained;
and step 37, performing iterative verification on the signature sequence to which the current competition tag sequence belongs according to the verification times to obtain the expected competition tag sequence.
As an optional implementation manner, step 32 specifically includes: when the minimum signature number is smaller than a second preset threshold value, carrying out linear solution on the total number of units according to a preset linear calculation model to obtain the checking times; or when the minimum signature number is equal to a second preset threshold, configuring a first preset experience value larger than the second preset threshold as the checking times; or when the minimum signature number is smaller than a second preset threshold value, configuring a second preset experience value smaller than the second preset threshold value as the verification number.
The preset linear calculation model is specifically expressed as: and the S-num is alpha multiplied by U-num + beta, wherein the S-num represents the checking times, alpha represents a preset slope, U-num represents the total number of units, and beta represents a preset intercept.
In a specific manner, the second preset threshold may be equal to 64, the first preset experience value may be equal to 81, both the second preset experience value and the preset slope α may be equal to 30, and the preset intercept β may be equal to 1, so as to provide a guarantee for rationality and accuracy of the number of times of verification, to accurately control the number of times of iterative verification, and further to guarantee construction efficiency and accuracy of the expected competition tag sequence.
Example two
As shown in fig. 4, a competition tag sequence construction apparatus includes: the data loading module is used for respectively inputting the competition personnel information sets, the drawing parameter sets bound with the competition personnel information sets and the grouping numbers bound with the drawing parameter sets; the drawing and arranging module is used for drawing and arranging the information sets of the competitors according to the drawing and arranging parameter set to obtain a competition tag sequence to be verified; and the sign bit checking module is used for carrying out fairness checking processing on the sign bit sequence to which the competition tag sequence to be checked belongs according to the number of the groups to obtain the expected competition tag sequence.
The drawing arrangement module specifically comprises: the parameter extraction submodule is used for respectively extracting the match-making labels, the total number of the seeds and a plurality of seed number values from the drawing parameter set; the label construction submodule is used for extracting the registration information of the competitors bound with various sub-number values one by one from the competitor information set when the competitor information set is not an empty set, reconstructing the bound various sub-number values and the registration information of the competitors to obtain corresponding competitor labels, and storing the competitor labels until the last competitor label is stored; and the classification arrangement submodule is used for classifying and arranging all competition player labels according to the total number of the seeds and the competition system labels to obtain a competition label sequence to be verified.
The classification and arrangement submodule specifically comprises: the label grouping unit is used for grouping labels in the label grouping unit.
A parameter configuration unit for configuring the total number of the tags of all contestants as the total number of contestants, wherein the total number of contestants is 2aThe minimum number of the signs is more than or equal to the total number of the participants, and the total number of the participants is more than or equal to 2.
The first creating unit is used for respectively creating a first array and a second array.
And the label grouping unit is used for identifying whether the seed number value to which each competition player label belongs to a null value one by one, storing the corresponding competition player label to the first array if the seed number value to which each competition player label belongs does not belong, and storing the corresponding competition player label to the second array if the seed number value to which each competition player label belongs is not the null value until the last competition player label is stored.
And the second creating unit is used for creating a third array matched with the minimum signature number.
And the first recombination unit is used for storing all contestant labels in the first array and all contestant labels in the second array into the third array.
The round empty filling unit is used for configuring the difference value between the minimum signing number and the total number of the participated players as the round empty total number; when the total number of the wheel spaces is zero, storing a preset wheel space label in the third array is avoided; or when the total number of the wheel spaces is greater than zero, respectively storing preset wheel space labels in each empty position in the third array according to the total number of the wheel spaces.
And the second recombination unit is used for carrying out classification recombination on the third array according to the minimum signature number, the total seed number and the competition tag to obtain a competition tag sequence to be verified.
The second recombination unit specifically includes: the system comprises a classification recombination subunit, an array creation subunit, a first storage subunit, a second storage subunit, a third storage subunit, a fourth storage subunit, a fifth storage subunit and a sequence determination subunit.
And the classification recombination subunit is used for performing classification recombination on the third array to obtain a fixed seed label array, a variable seed label array, a common label array and a null label array.
An array creation subunit for creating a set of data based on the sum of the minimum number of signatures equal to 2bCreates a two-dimensional array satisfying m x n, where b ∈ [2, a-1 ]]M is greater than or equal to the ratio between the minimum number of signatures and a first preset threshold, n is greater than or equal to the first preset threshold.
The first storage subunit is used for storing one competition player label in the fixed seed label array in the 1 st row and the 1 st column of the 1 st row to which the two-dimensional array belongs and storing any competition player label in the common label array in the mth row and the nth column to which the two-dimensional array belongs when the total number of seeds is equal to 1, only one competition player label exists in the fixed seed label array and at least one competition player label exists in the common label array; or when the total number of the seeds is greater than or equal to 2 and only two contestant labels exist in the fixed seed label array, discretely storing the two contestant labels in the fixed seed label array in the 1 st row and the 1 st column and the mth row and the nth column of the 1 st row to which the two-dimensional array belongs.
The second storage subunit is used for storing one preset null label in the null label array in the 2 nd row of the 1 st row to which the two-dimensional array belongs when only one preset null label exists in the null label array; or when at least two preset null labels exist in the null label array, discretely storing any two preset null labels in the null label array in the 2 nd column of the 1 st row and the n-1 th column of the m row to which the two-dimensional array belongs.
And the third storage subunit is used for discretely storing all competition player tags in the modified seed tag array in a vacant partition to which the two-dimensional array belongs according to the competition system tag and the minimum tag number when at least one competition player tag exists in the modified seed tag array, so that the modified seed tag array is a vacant array, and the vacant partition belongs to a region formed by the 1 st row, the 3 rd column, the m th row, the n-2 th column or the n-1 th column to which the two-dimensional array belongs.
And the fourth storage subunit is used for storing the remaining preset empty labels in the empty label array one by one in the empty partition until the empty label array is an empty array if at least one remaining preset empty label in the empty label array except the two preset empty labels stored in the 2 nd row in the 1 st row and the n-1 th row in the m-th row respectively exists after all the contestant player labels in the variable seed label array are stored in the empty partition.
The fifth storage subunit is used for storing all the remaining preset wheel-empty labels in the wheel-empty label array into the vacant partition, and storing the competition player labels in the common label array into the vacant partition one by one if at least one competition player label exists in the common label array until the common label array is a vacant array;
and the sequence determining subunit is used for determining a two-dimensional array formed by recombining the fixed seed label array, the variable seed label array, the common label array and the empty label array as a competition label sequence to be verified.
The third storage subunit is specifically configured to: when the competition system label marks the circulation competition system, configuring a variable seed signature sequence according to the minimum signature and a first preset fair sorting rule which is consistent with the circulation competition system; when the competition system label marks eliminate the competition system, configuring the sequence of the variable seed label according to the minimum label and a second preset fair sorting rule which is consistent with the elimination competition system; carrying out hierarchical unit statistics on all contestant labels in the variable seed label array to obtain all hierarchical unit information; and (3) according to the sequence of the variable seed labels and all hierarchical unit information, allocating the official labels of all contestants in the variable seed label array to the vacancy subarea in a flattening way, wherein all contestant labels in the vacancy subarea are characterized by uniform distribution of the same unit subareas.
Sign position check module specifically includes: the device comprises a unit counting submodule, a frequency configuration submodule, an average grouping submodule, a group counting submodule, a fraction configuration submodule, a first checking submodule and a second checking submodule.
And the unit counting submodule is used for carrying out unit counting on the same level on the competition tag sequence to be checked to obtain all unit information on the same level and the total number of units matched with all the unit information on the same level.
And the frequency configuration submodule is used for configuring the checking frequency according to the minimum signature number, a second preset threshold value and the total number of units.
The number configuration submodule is specifically configured to: when the minimum signature number is smaller than a second preset threshold value, carrying out linear solution on the total number of units according to a preset linear calculation model to obtain the checking times; or when the minimum signature number is equal to a second preset threshold, configuring a first preset experience value larger than the second preset threshold as the checking times; or when the minimum signature number is smaller than a second preset threshold value, configuring a second preset experience value smaller than the second preset threshold value as the verification number.
And the average grouping submodule is used for carrying out average grouping on the signature sequences to which the competition tag sequences to be checked belong according to the grouping number to obtain at least two grouping signature sequences.
And the group counting submodule is used for carrying out same-group counting on all the grouping signature sequences according to the unit information of each same level to obtain the corresponding total number of the same-group signatures.
And the score configuration submodule is used for verifying whether the total number of the tags in each group is equal to zero one by one, if so, scoring the tag sequence of the competition tag sequence to be verified into a preset fair score, and if not, reducing the preset fair score to the corresponding current evaluation score according to the non-zero total number of the tags in each group until the last total number of the tags in the same group is verified.
And the first checking submodule is used for configuring the competition tag sequence to be checked into the expected competition tag sequence when the score of the signature sequence to which the competition tag sequence to be checked belongs is a preset fair score.
The second checking submodule is used for performing sequence adjustment on the tag bit sequence to which the competition tag sequence to be checked belongs according to the total number of the non-zero tags in each same group when the preset fair score is reduced to the current evaluation score, so as to obtain the current competition tag sequence; and performing iterative check on the signature sequence to which the current competition tag sequence belongs according to the check times to obtain the expected competition tag sequence.
EXAMPLE III
As shown in fig. 5, an intelligent drawing device includes: the competition tag sequence building method comprises a memory and a processor coupled with the memory, wherein the memory is configured to store a competition program, and the processor is configured to load and execute the competition program to realize any operation step executed by the competition tag sequence building method in the embodiment one.
In some embodiments, the smart drawing device may include any one of a smartphone, an ipad, a laptop, a desktop, a smart tv, and a server.
Example four
A computer-readable storage medium, such as a flash disk or/and a removable hard disk or/and a flash memory or/and a hard disk, configured with at least one instruction or at least one program or a set of codes or a set of instructions, which is loaded and executed by an intelligent lottery device to implement any operation step performed by the method for constructing a competition tag sequence according to an embodiment of the present invention, and which is not described herein again.
The reader should understand that in the description of this specification, reference to the description of the terms "aspect," "embodiment," and "implementation," etc., means that a particular feature, step, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention, and the terms "first" and "second," etc., are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated, whereby the features defined as "first" and "second," etc., may explicitly or implicitly include at least one such feature.
In this specification, where the terminology above is used for the purpose of describing particular features, steps or characteristics in general, it is not necessary for the terminology above to be restricted to the same embodiments or examples, and the described particular features, steps or characteristics may be combined in any suitable manner in one or more particular examples or examples, or those skilled in the art may combine or/and combine features of different embodiments or examples described in this specification and other features of different embodiments or examples without conflict with one another.
Claims (7)
1. A competition tag sequence construction method is characterized by comprising the following steps:
respectively inputting a competition personnel information set, a drawing parameter set bound with the competition personnel information set and a group number bound with the drawing parameter set;
performing lottery arrangement processing on the competitor information sets according to the lottery parameter sets to obtain a competition tag sequence to be verified;
performing fairness check processing on the signature sequence to which the competition tag sequence to be checked belongs according to the group number to obtain an expected competition tag sequence;
the drawing parameter set comprises a match label, a total number of seeds and a plurality of seed number values; according to the drawing parameter set, drawing and arranging the information set of the competitors to obtain a competition tag sequence to be verified, which specifically comprises the following steps:
when the contestant information set is not an empty set, the contestant attendance registration information bound with various sub-number values one by one is extracted from the contestant information set one by one, the various sub-number values bound with each other and the contestant attendance registration information are reconstructed to obtain corresponding contestant labels, and the contestant labels are stored until the last contestant label is stored;
classifying and arranging all competition player labels according to the total number of the seeds and the competition system labels to obtain a competition label sequence to be verified;
classifying and arranging all competition player labels according to the total number of the seeds and the competition system labels to obtain the competition label sequence to be verified, wherein the method specifically comprises the following steps:
configuring the total number of the tags of all contestants as the total number of contestants, and configuring the total number equal to 2 according to the total number of the contestantsaThe minimum number of credits is greater than or equal to the total number of participants, and the total number of participants is greater than or equal to 2;
respectively creating a first array and a second array;
identifying whether the seed number value of each competition player label belongs to a null value one by one, if not, storing the corresponding competition player label to the first array, and if so, storing the corresponding competition player label to the second array until the last competition player label is stored;
creating a third array adapted to the minimum signature number;
storing all contestant tags in the first array and all contestant tags in the second array in the third array;
configuring the difference between the minimum number of credits and the total number of participants to be a round-robin total;
when the total number of the wheel spaces is zero, storing a preset wheel space label in the third array is avoided;
when the total number of the wheel spaces is larger than zero, respectively storing preset wheel space labels in each wheel space in the third array;
classifying and recombining the third array according to the minimum label number, the total number of the seeds and the competition tags to obtain the competition tag sequence to be verified;
performing fairness check processing on the signature sequence to which the competition tag sequence to be checked belongs according to the group number to obtain an expected competition tag sequence, and specifically comprising the following steps:
carrying out unit statistics of the same level on the competition tag sequence to be verified to obtain all unit information of the same level and the total number of units matched with all the unit information of the same level;
configuring checking times according to the minimum signature number, a second preset threshold value and the total number of units;
averagely grouping the signature sequences to which the competition tag sequences to be verified belong according to the grouping number to obtain at least two grouped signature sequences;
performing same-group statistics on all grouping signature sequences according to the unit information of each same level to obtain the corresponding total number of the same-group signatures;
verifying whether the total number of the tags in each group is zero or not one by one, if so, scoring the tag order of the competition tag sequence to be verified as a preset fair score, otherwise, reducing the preset fair score to a corresponding current evaluation score according to the total number of the tags in each group which is not zero until the last total number of the tags in the same group is verified;
when the score of the signature sequence to which the competition tag sequence to be verified belongs is the preset fairness score, configuring the competition tag sequence to be verified as the expected competition tag sequence;
when the preset fairness score is reduced to the current evaluation score, the sequence of the signature bit to which the competition tag sequence to be checked belongs is adjusted according to the total number of nonzero labels in each same group, and the current competition tag sequence is obtained;
and performing iterative check on the signature sequence to which the current competition tag sequence belongs according to the check times to obtain the expected competition tag sequence.
2. The method for constructing a competition tag sequence according to claim 1, wherein the third array is sorted and recombined according to the minimum signature number, the total number of seeds and the competition tags to obtain the competition tag sequence to be verified, and specifically comprises:
classifying and recombining the third array to obtain a fixed seed label array, a variable seed label array, a common label array and a null label array;
according to the minimum sum of the signs being equal to 2bCreates a two-dimensional array satisfying m x n, where b ∈ [2, a-1 ]]M is greater than or equal to the ratio between the minimum signature number and the first preset threshold, and n is greater than or equal to the first preset threshold;
when the total number of the seeds is equal to 1, only one competition player tag exists in the fixed seed tag array, and at least one competition player tag exists in the common tag array, storing one competition player tag in the fixed seed tag array in the 1 st row and the 1 st column of the two-dimensional array, and storing any competition player tag in the common tag array in the mth row and the nth column of the two-dimensional array;
when the total number of the seeds is more than or equal to 2 and only two contestant labels exist in the fixed seed label array, discretely storing the two contestant labels in the fixed seed label array in the 1 st row, the 1 st column and the mth row, the mth column of the two-dimensional array belongs to;
when only one preset empty label exists in the empty label array, storing one preset empty label in the empty label array in the 2 nd row of the 1 st row to which the two-dimensional array belongs;
when at least two preset null labels exist in the null label array, discretely storing any two preset null labels in the null label array in the 2 nd row of the 1 st row and the n-1 th row of the mth row to which the two-dimensional array belongs;
when at least one competition player tag exists in the variable seed tag array, discretely storing all competition player tags in the variable seed tag array in a vacancy partition to which the two-dimensional array belongs according to the competition system tag and the minimum tag number, wherein the vacancy partition belongs to a region formed by the 3 rd column from the 1 st row to the n-2 nd column from the m th row to which the two-dimensional array belongs or the n-1 st column;
after all contestant tags in the variable seed tag array are stored in the vacancy partition, if at least one remaining preset null tag except two preset null tags which are respectively stored in the 2 nd row of the 1 st row and the n-1 th row exists in the null tag array, storing the remaining preset null tags in the null tag array one by one until the null tag array is a null array;
after all the remaining preset wheel empty tags in the wheel empty tag array are stored in the empty space partition, if at least one competition player tag exists in the common tag array, storing the competition player tags in the common tag array in the empty space partition one by one until the common tag array is an empty array;
and determining the two-dimensional array formed by recombining the fixed seed label array, the variable seed label array, the common label array and the empty label array as the competition label sequence to be verified.
3. The competition tag sequence construction method according to claim 2, wherein discretely storing all competition player tags in the varied seed tag array in a vacancy partition to which the two-dimensional array belongs according to the competition tags and the minimum tag number specifically comprises:
when the competition system label marks a circulating competition system, configuring a variable seed signing sequence according to the minimum signing number and a first preset fair sorting rule which is consistent with the circulating competition system;
when the competition tag identification eliminates the competition, configuring a variable seed tagging sequence according to the minimum tagging number and a second preset fair sorting rule which is consistent with the eliminated competition;
carrying out hierarchical unit statistics on all contestant labels in the variable seed label array to obtain all hierarchical unit information;
and according to the label sequence of the variable seeds and the information of all hierarchical units, allocating the labels of all contestants in the variable seed label array to the vacancy subarea in a flattening way, so that the labels of all contestants in the vacancy subarea are characterized by uniform distribution of the same unit subareas.
4. The competition tag sequence construction method according to claim 3, wherein the configuration of the number of verification times according to the minimum number of tags, a second preset threshold value and the total number of units specifically includes:
when the minimum sign number is smaller than the second preset threshold value, linearly solving the total unit number according to a preset linear calculation model to obtain the checking times;
when the minimum signature number is equal to the second preset threshold, configuring a first preset experience value larger than the second preset threshold as the verification times;
when the minimum sign number is smaller than the second preset threshold, configuring a second preset experience value smaller than the second preset threshold as the checking times;
the preset linear calculation model is specifically expressed as:
S_num＝α×U_num+β
wherein S _ num represents the number of times of the verification, α represents a preset slope, U _ num represents the total number of the units, and β represents a preset intercept.
5. A race tag sequence construction apparatus, comprising:
the data loading module is used for respectively inputting a competition participant information set, a drawing parameter set bound with the competition participant information set and a grouping number bound with the drawing parameter set;
the drawing and arranging module is used for drawing and arranging the information sets of the competitors according to the drawing and arranging parameter set to obtain a competition tag sequence to be verified;
the sign bit checking module is used for carrying out fairness checking processing on the sign bit sequence to which the competition tag sequence to be checked belongs according to the grouping number to obtain the expected competition tag sequence;
the drawing arrangement module specifically comprises: the parameter extraction submodule is used for respectively extracting the match-making labels, the total number of the seeds and a plurality of seed number values from the drawing parameter set; the label construction submodule is used for extracting the registration information of the competitors bound with various sub-number values one by one from the competitor information set when the competitor information set is not an empty set, reconstructing the bound various sub-number values and the registration information of the competitors to obtain corresponding competitor labels, and storing the competitor labels until the last competitor label is stored; the classification arrangement submodule is used for classifying and arranging all competition player labels according to the total number of the seeds and the competition tags to obtain a competition tag sequence to be verified;
the classification and arrangement submodule specifically comprises: the label grouping unit is used for grouping labels in the label grouping unit;
the parameter configuration unit is used for configuring the total number of the tags of all contestants into the total number of the contestants, and the total number of the contestants is configured to be 2aThe minimum number of the signs is more than or equal to the total number of the participants, and the total number of the participants is more than or equal to 2;
the first creating unit is used for respectively creating a first array and a second array;
the label grouping unit is used for identifying whether the seed number value of each competition player label belongs to a null value or not one by one, if not, storing the corresponding competition player label to a first array, and if so, storing the corresponding competition player label to a second array until the last competition player label is stored;
the second creating unit is used for creating a third array matched with the minimum signature number;
the first recombination unit is used for storing all contestant labels in the first array and all contestant labels in the second array into a third array;
the round empty filling unit is used for configuring the difference value between the minimum signing number and the total number of the participated players as the round empty total number; when the total number of the wheel spaces is zero, storing a preset wheel space label in the third array is avoided; or when the total number of the wheel spaces is greater than zero, respectively storing preset wheel space labels in each empty position in the third array according to the total number of the wheel spaces;
the second recombination unit is used for carrying out classification recombination on the third array according to the minimum signature number, the total number of the seeds and the competition tags to obtain a competition tag sequence to be verified;
the sign position checking module specifically comprises: the system comprises a unit counting submodule, a frequency configuration submodule, an average grouping submodule, a group counting submodule, a fraction configuration submodule, a first checking submodule and a second checking submodule;
the unit counting submodule is used for carrying out unit counting on the same level on the competition tag sequence to be checked to obtain all unit information on the same level and the total number of units matched with all the unit information on the same level;
the number configuration submodule is used for configuring the checking number according to the minimum signature number, a second preset threshold value and the total number of units;
the average grouping submodule is used for carrying out average grouping on the signing bit sequence to which the competition tag sequence to be verified belongs according to the grouping number to obtain at least two grouping signing bit sequences;
the group counting submodule is used for carrying out same-group counting on all the grouping signature sequences according to the unit information of each same level to obtain the total number of corresponding same-group signatures;
the score configuration submodule is used for verifying whether the total number of the tags in each group is equal to zero or not one by one, if so, scoring the tag sequence of the competition tag sequence to be verified into a preset fair score, and if not, reducing the preset fair score to a corresponding current evaluation score according to the total number of the tags in each group which is not zero until the last total number of the tags in each group is verified;
the first checking submodule is used for configuring the competition tag sequence to be checked into an expected competition tag sequence when the score of the signature sequence to which the competition tag sequence to be checked belongs is a preset fair score;
the second checking submodule is used for performing sequence adjustment on the tag bit sequence to which the competition tag sequence to be checked belongs according to the total number of the non-zero tags in each same group when the preset fairness score is reduced to the current evaluation score, so as to obtain the current competition tag sequence; and performing iterative check on the signature sequence to which the current competition tag sequence belongs according to the check times to obtain the expected competition tag sequence.
6. An intelligent drawing device, comprising: a memory and a processor coupled with the memory, the memory configured to store a course program, the processor configured to load and execute the course program to implement the operational steps performed by the race tag sequence construction method of any of claims 1-4.
7. A computer-readable storage medium, configured with at least one instruction or at least one program or set of codes or sets of instructions, which is loaded and executed to carry out the operational steps performed by the competition tag sequence construction method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911272316.5A CN111145422B (en) | 2019-12-12 | 2019-12-12 | Competition label sequence construction method, device, equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911272316.5A CN111145422B (en) | 2019-12-12 | 2019-12-12 | Competition label sequence construction method, device, equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111145422A CN111145422A (en) | 2020-05-12 |
| CN111145422B true CN111145422B (en) | 2022-04-26 |
Family
ID=70518231
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911272316.5A Active CN111145422B (en) | 2019-12-12 | 2019-12-12 | Competition label sequence construction method, device, equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111145422B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002288379A (en) * | 2001-03-26 | 2002-10-04 | Sony Corp | Method for holding golf competition and system for the same |
| US7813821B1 (en) * | 2005-11-02 | 2010-10-12 | David Howell | System, method and computer program product for determining a tennis player rating |
| WO2013015002A1 (en) * | 2011-07-22 | 2013-01-31 | 株式会社コナミデジタルエンタテインメント | Game management device, game system, game management method, program and recording medium |
| CN106504397A (en) * | 2015-09-07 | 2017-03-15 | 吴昇桓 | Method, server and the computer program of sports bets service are provided |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8684820B2 (en) * | 2012-02-06 | 2014-04-01 | Hothead Games, Inc. | Virtual competitive group management systems and methods |
| US9895615B2 (en) * | 2016-03-29 | 2018-02-20 | Equibrand Corporation | System and method for arranging equine competitions according to participant ability groupings |
| US10207173B2 (en) * | 2017-04-21 | 2019-02-19 | Jan Pasternak | Sports communication and collaboration platform |
| CN108305005A (en) * | 2018-02-01 | 2018-07-20 | 深圳市鹰硕技术有限公司 | Contest object matching method in study competition and device |
| WO2019175816A1 (en) * | 2018-03-14 | 2019-09-19 | Nawab Shahtaj Shaji Ul Mulk | System for scheduling a sporting event |
-
2019
- 2019-12-12 CN CN201911272316.5A patent/CN111145422B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002288379A (en) * | 2001-03-26 | 2002-10-04 | Sony Corp | Method for holding golf competition and system for the same |
| US7813821B1 (en) * | 2005-11-02 | 2010-10-12 | David Howell | System, method and computer program product for determining a tennis player rating |
| WO2013015002A1 (en) * | 2011-07-22 | 2013-01-31 | 株式会社コナミデジタルエンタテインメント | Game management device, game system, game management method, program and recording medium |
| CN106504397A (en) * | 2015-09-07 | 2017-03-15 | 吴昇桓 | Method, server and the computer program of sports bets service are provided |
Non-Patent Citations (1)
| Title |
|---|
| 淘汰赛"种子"选手合理定位技术的研究;邓万金，刘永东;《广州体育学院学报》;20061113;第26卷(第05期);第52-55页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111145422A (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108427708A (en) | Data processing method, device, storage medium and electronic device | |
| CN111539610A (en) | Production management system, method, device, equipment and medium for assembly workshop | |
| CN101320406A (en) | Card game service providing method and system | |
| CN110113634A (en) | A kind of information interaction method, device, equipment and storage medium | |
| CN102315955A (en) | Control method for setting obstruction for junk information and corresponding control device | |
| CN110110201A (en) | A kind of content recommendation method and system | |
| CN109542395A (en) | Lottery information determines method, apparatus, equipment and storage medium | |
| US7367883B2 (en) | Method of operating a selection game | |
| CN112445897A (en) | Method, system, device and storage medium for large-scale classification and labeling of text data | |
| CN111145422B (en) | Competition label sequence construction method, device, equipment and readable storage medium | |
| CN103810379A (en) | Target state recommendation method and device | |
| CN104715131A (en) | Data processing method and device for internet game | |
| CN109271609A (en) | Label generating method, device, terminal device and computer storage medium | |
| JP6503785B2 (en) | Information processing apparatus, information sharing method, system and program | |
| CN110414609A (en) | Method and device is determined based on the object of Incompletely information games | |
| CN106600159A (en) | Competition article distribution management terminal and method | |
| CN116011787A (en) | Intelligent course arrangement method and device, electronic equipment and computer readable storage medium | |
| CN109819024A (en) | Information-pushing method, device, storage medium and terminal based on data analysis | |
| CN108810916A (en) | Wi-Fi Hotspot recommends method, apparatus and storage medium | |
| CN107807908A (en) | Variety result of the match Forecasting Methodology, device and storage medium | |
| EP2503502A1 (en) | Soccer prediction voting system | |
| CN110721471B (en) | Virtual application object output method and device and computer storage medium | |
| CN112801016A (en) | Vote data statistical method, device, equipment and medium | |
| CN112905673B (en) | Method for intelligently presenting questionnaire report data on screen | |
| US20140164395A1 (en) | Efficient sorting of large dimensional data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |