Programming question category (editing)

1. programming 2. data Structure 3. string 4. sort 5. figure 6. figure algorithm 7. search: pruning, heuristic search 8. dynamic Planning/recurrence 9. sub-governance/recursion 10. greedy 11. simulation 12. arithmetic and algebra 13. combination question 14. number Theory 15. grid, ry, and computational ry [programming entry] PC 110101, ultraviolet A 100, the 3N + 1 problem, difficulty 1 Pc 110102, ultraviolet A 10189, Minesweeper, difficulty 1 Pc 110103, and ultraviolet A 10137, the trip, difficulty 1 Pc 110104, ultraviolet A 706, LC-display, difficulty 1 Pc 110105, ultraviolet A 10267, Graphical Editor, difficulty 1 Pc 110106, ultraviolet A 10033, interpreter, difficulty 2 PC 110107, ultraviolet A 10196, check the check, Difficulty 1 Pc 110108, ultraviolet A 10142, illegal Alian voting, difficulty 1 Sicily 1144 taotao picked an apple. simple counting, difficulty 0 Sicily 1145 out-of-school tree. simple count, difficulty 0 Sicily 1232 electrical outlets. simple counting, difficulty 0 Sicily 1388 quicksum. simple counting, difficulty 0 Sicily 1324 score. simple count, difficulty 0 Sicily 1157 the hardest problem. simple size comparison, difficulty 0 Sicily 1147 who took the most scholarship. struct, array, and branch. The difficulty is 1 Sicily 1051. biker's trip odomete. simple calculation question Sicily 1795. table Tennis. geometric question. sicily 1798. alice and Bob. policy. difficulty 1 Sicily 1087 Fu NNY game. simple game. difficulty 1 Sicily 1510 mispelling, String, difficulty 0 Sicily 1500 prime gap. returns the maximum prime number less than the given integer. difficulty 1. sicily 1561 prime number. returns the nth prime number. difficulty 1 Sicily 1007 to and fro, array and subscript (two-dimensional array), difficulty 1 Sicily 1036 crypto columns, two-dimensional array, String, sorting, difficulty 1 Sicily 1014 specialized four-Dig, hexadecimal conversion, String, stack, difficulty 1 Sicily 1813 M hexadecimal number problem, difficulty 1 Sicily 1298. number conversion. converts an integer to a special three-digit number. difficulty 2. sicily 1325 digit generator. extract integers and numbers. difficulty 0 Sicily 1154 easy sort. simple sorting. Difficulty: 0 Sicily 1636. show me the money. simple computing. difficulty 0 Sicily 1814 date calculation problem. calculates the number of days between two dates. difficulty 1. the Sicily 1815 calculates the distance between two points in the Sicily 1816 planimial ry. The Sicily 1817 score conversion Sicily 1818 stupid monkey. count the difference between the maximum number of letters and the minimum number of letters in the string to determine whether it is a prime number. [Data structure]/* Data Structure: stacks and queuesbinary search treehash tabledictionaries (set, MAP) Priority inclusetstriessuffix treesb-treeskd-treesskip-lists balanced trees: AVL Tree, splay tree, red-black tree */PC 110201, ultraviolet A 10038, Jolly Jumper, difficulty 1 Pc 110202, ultraviolet A 10315, poker hands, difficulty 2 PC 110203, ultraviolet A 10050, hartals, difficulty 2 PC 110204, ultraviolet A 843, crypt kicker, difficulty 2 PC 110205, ultraviolet A 10205, stack' Em up, difficulty 1 Pc 110206, ultraviolet A 10044, Erdos numbers, difficulty 2 PC 110207, ultraviolet A 10258, contest scoreboard, difficulty 1 Pc 110208, ultraviolet A 10149, Yahtzee, difficulty 3 Sicily 1052. candy sharing game. ring linear structure. sicily 1200 stick. simple search pairing, or sort or use set, Multiset, MAP, difficulty 1 Sicily 1486 statistics. map can be easily used. Difficulty 2. Sicily 1819 matrix. binary matrix multiplication, which can be bitset or vector. Difficulty 2 Sicily 1194 message flood. Word search. Binary Search after sorting, or hash or balance binary tree or set, or trie difficulty 2 Sicily 1931 card game. queue. Difficulty: 2 Sicily 1003. hit or miss. queue, simulate. difficulty 2.5 Sicily 1443 printer queue. queue and priority queue. Sicily 1021 couples. stack, difficulty 1 Sicily 1934 mobile ball. linear table, difficulty 2 Sicily 1509 rails. difficulty 2 Sicily 1768 double stack sorting Sicily 1021 couples. stack, difficulty 2 Sicily 1210 binary tree. the binary tree traversal sequence is transformed. reconstruction of the Sicily 1935 binary tree. the first and middle traversal sequences of a binary tree are given, and its breadth first traversal sequences are obtained. recursive build, BFs. difficulty 3 Sicily 1082 manager. maintain a data structure that can delete the smallest element and the largest element. It can be implemented using a large root heap and a small root heap. difficulty 3. sicily 2543. complete Binary Tree. Find the nearest common ancestor of the two nodes in the Complete Binary Tree. Recursion. Sicily 1490. Tree grafting. The conversion from a tree to a binary tree. The height of the tree before and after the conversion is obtained. The input is the DFS sequence of the tree. Sicily 1838. sub tree. two M-ary trees are provided to determine whether one is another subtree. sicily 1875. small tree. weighted tree. sicily 1063. who's the boss. sorting, stack, and invisible tree structure Sicily 1042. squadtrees. sicily 1088. cows. tree array, which sorts [s, E] By s from small to large. e is sorted from large to small at the same time by S. Insert e to the tree array. Pay attention to processing at the same time. Sicily 1375 balanced lineup. hash Sicily 1149 equivalent expression. judge whether the expression is equivalent (recursive) Sicily 1156. binary Tree. an edge set of a directed tree is provided, and the edge set is first traversed in the order of Sicily 1310. right-heavy tree. binary Search Tree, traversing; Cartesian tree correlation, complexity O (n) or O (nlogn ). Sicily 1426 phone list. Phone number prefix search, related to the trie tree. Sicily 1686. Happy Children's Day. The maximum continuous subinterval and the M-interval query in the long sequence of the Sicily 1136 mountain longitude. n. Line Segment tree/rmqsicily 1092 stars in your window line segment tree. [String]/* string problems: String matchingapproximate string matchingtext compressioncryptographylongest common substring/subsequenceshortest common superstring */PC 110302, ultraviolet 10010, where's Waldorf, string PC 110304, and ultraviolet 850, crypt kicker II, string PC 110306 file fragmentation, string PC 110307 doublets, string Sicily 1753. decoding. sicily 1129. ISBN number. obtain the last digit of ISBN Based on the given rule. sicily 1133. Spam. output the valid email address in the input string. Sicily 1323. Switch text. string processing. Sicily 1035. DNA matching. difficulty 2. sicily 1299. academy Award. count the number of occurrences of a string. difficulty 2. sicily 1282. computer game. substring matching of a string. standard KMP. difficulty 3. [sorting and searching]/* sorting: insertion sort, selection sort, heapsort, mergesort, quicksort, counting sort, bucket sortsearching: sequence search, binary searchmedian and selection */PC 110401, ultraviolet A 10041, Vito's family PC 110403, ultraviolet A 10037, bridge PC 110405, ultraviolet A 10026, shoemaker's Problem PC 110406, ultraviolet A 10138, cdviipc 110402, ultraviolet A 120, stacks of flapjacks, stack, sorting PC 110404, ultraviolet A 10191, longest nappc 110407, ultraviolet A 10152, shellsort, and turtle shell sorting PC 110408, ultraviolet A 10194, footballsicily 1046 plane spotting. sort. difficulty 2. sicily 1097 led modding. sort. sicily 1134 building block distribution. sort from small to large. difficulty 1. sicily 1154. easy sort. any sorting algorithm. difficulty 1. sicily 1198 substring. string, sort. difficulty 1. sicily 1252 defining moment. the prefix and suffix of string division. sicily 1306. sorting Algorithm. Basic sorting, O (nlogn) sorting algorithm. Difficulty 2. Random Number clearly displayed in Sicily 1341. Input N number, repeat and sort. Difficulty 1. sicily 1351. multi-key sorting. multi-key sorting. difficulty 2. sicily 1438. shopaholic. sort by the sum of three values. difficulty 1. sicily 1482. scholarship. sorts multiple keys. difficulty 2. sicily 1532. binary Search. difficulty 4. sicily 1628. extended normal order sort. difficulty 4. sicily 1641. binary searchable. difficulty 2. sicily 1775. simple sort. sorts multiple keys. difficulty 3. sicily 1930. sort. select sort directly. difficulty 2. [graph traversal]/* graph travasalbreadth-first search and applications: connected components, two-coloring graphs, d Epth-first search and applications: Finding circles, articulation vertices find cut points, topological sorting, stronugly connected componensts, */PC 110901, VA 10004, bicoloring, difficulty 1 Pc 110902, 2 PC 10067, 110903, 10099, 110904, 705, 110905, 10029, edit step ladders, difficulty 3 PC 110906, ultraviolet A 10051, Tower of cubes, difficulty 3 -- Not PC judge) PC 110907, ultraviolet A 10187, from dusk till dawn, difficulty 3 PC 110908, ultraviolet A 10276, HANOI tower troubles again, difficulty 3 Sicily 1936 knight moves. deep Priority Search, backtracking Sicily 1940 ordering tasks. topological sorting. difficulty 3 Sicily 1424 bonus. topological sorting: Sicily 1030 task scheduling. topological sorting. difficulty 4 Sicily 1155 can I post the letter to determine whether two points are reachable. (Graph traversal) Sicily 1308 dependencies among jobs. n jobs are given, the time required to complete each job is given, the dependencies of each job are given, and how long it takes to complete a job. search for BFS in width first. difficulty 2 Sicily 1034 forest. defines the forest and calculates the maximum width and depth. deep Priority Search for Sicily 1068. euro efficiency. give a coin with six scores and ask how to combine it to get a number less than 100. search by breadth first. difficulty 2. in Sicily 1114, the breadth of food cubes is first traversed to dye a three-dimensional spatial graph. (DFS is prone to stack overflow) the Sicily 1187 laserbox has m converters on the n × n mesh. When the rays encounter a converter, the rays will deflection 90 degrees to the right. Rays enter the grid from the edge of the grid,
If the last ray is emitted, the output position is "0 0 ". DFS traversal. Sicily 1304. delivering food. search, which requires pruning and optimization. difficulty 4 [Graph Algorithm]/* graph processing Polynomial-time processing interval spanning treeshortest pathtransitive closure and Cycle cycle/Chinese postmanedge and vertex connectivitynetwork flow2. hard processing setvertex covertraveling salesman processing cyclegraph processing coloringc Oloringgraph isomorphismsteiner treefeedback EDGE/vertex set */PC 111001, ultraviolet A 10034, freckles, difficulty 2 PC 111002, ultraviolet A 10054, The neck.pdf, difficulty 3, (use ultraviolet A judge -- not PC judge) PC 111006, ultraviolet A 10199, tourist guide, difficulty 3 PC 111007, ultraviolet A 10249, the grand dinner, difficulty 4, (use ultraviolet A judge -- not PC judge) PC 111003, ultraviolet A 10278, fire Station, difficulty 2 PC 111004, ultraviolet A 10039, railroads, difficulty 3 PC 111005, ultraviolet A 10158, war, difficulty 3 P C 111008, ultraviolet A 10092, the problem with the problem setter, difficulty 3 Sicily 1031. Campus. Single Source Shortest short circuit, Dijkstra. Difficulty 3. Sicily 1321. Robot. Single-source shortest path, Dijkstra. Difficulty 3. Sicily 1090. Highways. Minimum Spanning Tree. Difficulty 2. Sicily 1402. panic Room. figure out the maximum flow of the network, Sicily 1303. job assignment. the maximum weight of the Bipartite Graph is Sicily 1684. christmas. binary: The maximum matching of the Bipartite Graph. The Hungarian algorithm Sicily 1192 guardian of decency is used to find the maximum independent set. In particular, binary matching can be performed. Sicily 1211. Merchant's publicity. Simple question, digraph matrix multiplication, O (N ^ 3 * logl); direct iteration, O (N * m * l ). Sicily 1350. piggy banks. returns a directed graph with an outbound degree of 1 for each vertex and calculates the number of rings. keep searching for the parent node. If no parent node is marked, add 1 to the answer. the two-color theorem of Sicily 1423 magic bug is used to find the minimum cut of the network. Sicily 1173 reliable nets returns the smallest two-connected subgraph in an undirected graph. (Small data size can be searched) Sicily 1141 monkey battle full graph minimum number of methods to generate tree, full node arrangement: n! * (N ^ (n-2) Sicily 1196 Conflict Relationship closure transformation Sicily 1170 countdown build, statistics Sicily 1132 routes. Represent the tree with a sequence of parentheses, and find the closest common ancestor of the two nodes. Sicily 1326 apple tree. Build a tree to find the closest common ancestor of the two nodes. Stack utilization: Counter = 0, when '0' is encountered, the counter goes into the stack, the counter ++; When '1' is encountered, the top element of the stack goes out of the stack, in addition, the top element of the current stack is the parent node and edge of the output stack element. [Search: Tracing, heuristic search, pruning] PC 110801, ultraviolet A 861, bishops PC 110802, ultraviolet A 10181, 15-puzzle problem (use ultraviolet A judge -- not PC judge) PC 110805, ultraviolet A 10032, tug of warpc 110806 Garden of Eden PC 110807, ultraviolet A 704, colour hashsicily 1002. anti-prime sequences. search and trace back. Sicily 1019. Apple tree. DFS or DP. Sicily 1835 n queens problem. Search and trace back. Sicily 1444 prime path breadth first search Sicily 1428. B baby climber ). extended search, bfssicily 1048 inverso. the breadth search is BFS first, and the binary value indicates that the status is heavy and the violent DFS is used. Difficulty 3: Sicily 1317 Sudoku. Number of sudoku solutions. Sicily 1171 the game of EFIL 2 ^ 16 DFS enumeration board and then detect the new red and black tree of Sicily 1219. tree cutting game, min-max search or memory search Sicily 1215 out of the dungeon. there is a limited maze to find the minimum steps for the two to meet. (Breadth-first search) Sicily 1180 pasting strings gives 10 strings, find an arrangement to make a certain weight and the largest, full sorting search. Sicily 1024 Magic Island. find the longest path in the tree. BFS or DFS. difficulty 2: Sicily 1050 numbers & letters: backtrack DFS to find the number of 5. Can we calculate the number of targets? Otherwise, the output result is smaller than the maximum number of targets. in Sicily 1135, the shortest time goes over the map over the wilderness, and the breadth search is preferred. sicily 1107 simple puzzle: search by question. There may be zero front and sorting by output. sicily 1150 simple magic board. breadth-first search, Sicily 1151 magic board. sicily 1515 magic board C. sicily 1152 simple horse traveling problem. backtracking: feasible pruning of the Maze problem. sicily 1153. same as above, nodes in extended state are sorted by the target function value. Sicily 1378 8 digital problem. heuristic search. [Dynamic Planning] PC 111101 is bigger smarter? (Use va judge -- not PC judge) PC 111103 Weights and Measures PC 111104 unidirectional tsp pc 111106 ferry loading (use va judge -- not PC judge) Sicily 1782. knapsack. 01 backpack. sicily 1342. happy Jin Ming. 01 backpack. sicily 1146. medicine collection. 01 backpack, similar to Sicily 1342. sicily 1077. case machine. multiple backpacks can be obtained using a similar algorithm. sicily 1750. sports meeting. group backpack. sicily 1346. jin Ming's budget plan. A dependent backpack. sicily 1091. maximum Sum. maximum M segments and problems. sicily 1888. circular sequence. please A maximum Max, judge whether it is the entire string, if it is a minimum min, then the MAX-MIN is the final solution, Otherwise Max is the solution. sicily 1564. housing. it can be converted to coin to solve the problem. sicily 1902. counting problem. it can be seen as a coin problem. sicily 1060. bridging signals. special methods are required. sicily 1685. missile. the longest is not just a tone sequence. small Data, O (N ^ 2 ). sicily 1448. antimonotonicity. the longest not just tone sequence (F [0]> F [1] <F [2]> F [3] ..) count the number of Poles. big Data, requires the O (n) algorithm. sicily 1345. energy necklace. similar to the matrix chain problem, two-dimensional state storage DP. sicily 1176 two ends. the two get the number from both ends, and the other party greedy for the big one. Try to make the difference between the two as big as possible. two-dimensional status DP. sicily 1563. Gecko. DP. Sicily 1822. Fight Club. DP. Sicily 1326. Apple Tree DP, edge DFS edge updates the optimal value. 05. This is a simplified version of the classic recent public ancestor (LCA. Because the access order is given,
It is much simpler than the traditional LCA because it is only required once. You can use the simple algorithm of a traditional single LCA problem to solve this problem. The following is a brief introduction: The LCA that requires u and v, as long as the father of U starts to enumerate the ancestor of u along the tree and stores it in the list l, and then uses a similar method to enumerate V, when a first ancestor X is found in L, returns X. The complexity is O (n ). Because of the special nature of this question, you can also do it in a simpler way. That is, based on the DFS principle, a stack is set up to scan from left to right. This is also O (N), but it is easier to write, but more error-prone. In addition, note that when a = B is used, you must handle the problem. Sicily 1225. electronic eye. minimum edge coverage is obtained on the tree + side graph. tree DP. sicily 1898. tree. for a tree where each node is white or black, ask how many times the node color is exchanged to interconnect the black node. tree DP. sicily 2681. tree. for a tree, all nodes are black. By a node, you can change the color of the node and its adjacent nodes (black turns white, white turns black ). Calculate the minimum number of buttons that change the color of all nodes. tree DP. sicily 1404 HIE with the pie. status compression DP. sicily 1123. the longest walk. the Directed Graph calculates the longest path of any starting and ending point without repeating points, and the State compresses the DP. sicily 1148. crossing the river. path compression and greedy dynamic planning. sicily 1103 the top-code. string division DP, which requires the State representation method when the lexicographic output scheme is used. sicily 1001. alphacode. DP basic questions. sicily 1010. zipper. DP. sicily 1011. lenny's lucky lotto. DP. sicily 1049. mondriaan. 2*1 and 1*1 bricks are paved with 2 * n aisle Methods % 10. dpsicily 1057. rhyme schemes. DP. sicily 1073. pearls. DP. sicily 1081. game. DP. sicily 1108. online selection. in a Q & A game, K answers on N layers scored M points and the maximum number of answers was 0. sicily 1121. tri tiling. number of 3 * n aisles paved with 2*1 bricks. DP. sicily 1138. A journey to treasure hunt. DP. sicily 1158. pick numbers. the M * n numeric matrix is given. In the upper left corner of the starting point, the point () and the lower right corner of the end point (m, n) can only be moved to the right or down. You must find a path from the starting point to the end point,
Makes the sum of the passed numbers a positive number as small as possible. DFS. difficulty: 2 Sicily 1166. computer transformatation. DP. sicily 1211. merchant publicity. figure DP. difficulty 3 Sicily 1221. digital games. N number sequence each number will decrease B [I] each time, take out M number, and calculate the maximum value. sicily 1222. word selection. in a given article, selecting a consecutive segment that contains the most word and has the shortest length is disgusting. sicily 1264. atomic car race. DP basic questions. sicily 1373. cows of the Round Table. DP. sicily 1274. pascal's travels. DP. sicily 1419. on the run. milk delivery. DP. sicily 1687. permutation. DP. sicily 1828. minim Al. DP. [unclassified dynamic planning/recurrence/combined counting] Sicily 1355 the bus. two-dimensional longest ascending sub-sequence, the longest variant of the sub-sequence without decreasing, using map in STL to write giant simple. sicily 1169 ACM (acronymmaker) asks some phrases for the number of methods that constitute the specified abbreviation according to the meaning of the question. sicily 1163 tour. euclidean Traveling Salesman Problem (p314 by Wu wenhu) Sicily 1233 neck?decomposition separates letters by question. the Sicily 1197 hotel string contains the matching of common characters and memory-based search. sicily 1120 walk through the forest simple undirected graph, calculate the number of methods from node 1 to node 2 by question. sicily 1091. maximum Sum provides a series, which is used to calculate the sum of two parts and the maximum. sicily 1098 marching in the Corp gives Partial Order Relations, Calculate the number of possible ranking methods. Sicily 1327 pinary recursively calculates the K pinary number. Sicily 1233 neck1_decomposition: separate letters by question. sicily 1139 circuit stability recursive processing parentheses on the sequence calculation circuit failure probability. in Sicily 1033 City Road, evaluate the number of the shortest Methods 0 to n + 1, m + 1, and there are some obstacles in the middle. sicily 1413 Whac-A-Mole: This is the best way to hit the largest hamster in a certain period of time. Sicily 1415 honeycomb walk the number of methods for returning to the departure location in n steps. [Grouping and Recursion] Sicily 1017 rate of return. solving the equation. difficulty 2 Sicily 1211 merchant's propaganda seeks the number of methods to arrive at step l between two points. sicily 1137 bed. the difference between the minimum number and the maximum number is not greater than K. Sicily 1376. monthly expense. for a sequence of N numbers, it is required to divide it into M segments so that the maximum value of the sum of each segment is as small as possible. second, greedy. difficulty 3 Sicily 1441 pie binary Sicily 1454. pseudo Prime numbers. number Theory, binary, recursion. Difficulty 3 [greedy] Sicily 1739. Helpful paper. Task Scheduling Problems. Sicily 1717. Computer. standalone task scheduling. Greedy + minimal heap. Sicily 1198 substring 8 strings discharge the minimum Lexicographic Order. (Sort by AB <Ba comparison function) the heritage of King Sicily 1140. cut the maximum branches of no more than n/2 nodes Sicily 1172 queens, knights and pawns dyeing simulation Sicily 1193 up the stairs move the box up the stairs. [arithmetic and algebra]/* numerical problems: Solving Linear equationsbandwidth ctionmatrix Matrix Functions and functions and unconstrined optimizationlinear programingrandom number generationfactoring and primality testingarbitrary-Precision Limit prpbl Emdiscret Fourier transform * // * prime number: returns the prime number. The total division of prime numbers is the maximum common number, minimum Common modulo arithmetic cool */PC 110502 reverse and add PC 110503 the archeologists 'dilemma PC 110504 ones PC 110505 a multiplication gamepc 110702 Carmichael numbers (use va judge -- not PC judge) PC 110704 factovisors PC 110707 marbles PC 110708 repackaging Sicily 1040. polly nomials. polynomial computing. difficulty 2 Sicily 1813 M hexadecimal number problem. hexadecimal conversion, difficulty 1 Sicily 1201 01000001. large integer binary addition Sicily 1159 sum. returns the sum of positive integers. sicily 1029 rabbit. recurrence, sum of big integers, difficulty 2 Sicily 1020 big integer. evaluate the modulo of a large integer. The difficulty is 2 Sicily 1381 a * B. big integer multiplication. difficulty 2 Sicily 1240 faulty odometer. the number of digits in decimal format is 4 less than that in Sicily 1294. high-level confidential. enter the integers A, B, and C (a ^ B) mod C. sicily 1422. table Tennis. the surface is a geometric question, and the essence is a number question. The problem can be converted to the minimum public multiple of length A and B, Sicily 1363. semi-prime H-numbers. define H-numbers: 1, 5, 9, 13, 17, 225, 29 ,...; H-Prime: only 1 × H, such ,...; H-composites: 25, 45, 65, 81, 85 ,...; H-simiprime: it is obtained by multiplying two H-prime values, such as 25, 45, 65, 81, 85,105,117 ,...; 125 is the sum instead of the semi-prime number. Given the number N, calculate the number of semi-prime numbers between 1 and N. difficulty 2 [problem combination]/* Problem Problems: Median and selectiongenerating interval subsetsgenerating interval graphsgenerating calculationsjob interval */PC 110603 counting PC 110604 expressions PC 110606 the priest interval PC 110607 selfdescribing sequencesicily 1370. how between 0's ?. Number of zeros required to write all numbers between two integers in sequence. sicily 1089 farey sequence. calculate the number of farey sequence elements. Euler's function: Set A = (A1 ^ P1) * (A2 ^ P2 )... (AK ^ PK), where A1 ,..., if AK is a prime number, f (a) = A * (1-1/A1) * (1-1/A2 )*... * (1-1/AK ). difficulty 2 Sicily 1224 fast Match Game combo math on classic stable marriage issues. Sicily 1242 suit distribution bored count Sicily 1174 square count Number of squares, the principle of rejection. Sicily 1302 magic square the odd-order Cube Structure Sicily 1125 Arnie versus the IRS. The number of 0-9 digits displayed during the two days is counted, not counted on weekends. Sicily 1200 stick. an odd number of wooden sticks. Each type has an even number and only an odd number. Exclusive or. Difficulty 1 Sicily 1200 stick. an odd number of wooden sticks. Different types have an even number, and one type has only an odd number. Exclusive or. difficulty 1: A regular sequence of the Sicily 1344 series generates the Sicily 1203 The cubic end to a 1, 3, 7. 9. The end of a cube is the original number Sicily 1280 permutationsicily 1214. binary representation is a back-to-text. Speaker Liang Feng,
This is an interesting question. I cannot think of it if I have read his report. Have you ever thought about this series in the binary direction? N =,; An =,
Their binary form is n = (1) 2, (10) 2, (11) 2, (100) 2, (101) 2, (110) 2, (111) 2, (1000) 2; An = (1) 2, (01) 2, (11) 2, (11) 2, (001) 2, (101) 2, (011) 2, (111) 2, (0001) 2,
Have you found any rule? The binary string of an is exactly the inverse of the binary string of N. In fact, this can be proved by induction: For a2n = An, (2n) 2 = (n) 2_0 (note that here "_" is the binary string Connection Symbol, and then set ~ Returns the reverse of a binary string whose N is N ),
After function a is reversed, the equation is true (0 is actually absent after the inversion ). For a4n + 1 = 2 * a2n + 1-An, (4n + 1) 2 = (n) 2_01, (2n + 1) 2 = (n) 2_1, (a4n + 1) 2 = 10 _(~ N) 2, 2 * a (2n + 1) = 2*[1 _(~ N) 2] = 1 _(~ N) 2_0, An = (~ N) 2, a4n + 1 + an = 10 _(~ N) 2 + (~ N) 2 = 1 _(~ N) 2_0 = 2 * a2n + 1. Similarly, the a4n + 3 equation also proves that the overall superior formula is true for all nε n. Knowing this nature is simple, so that only the binary form of an = n is the same as the input string,
Enumerate the First Half of the binary P, flip to the last half, note that two N values should be generated,
One is P _(~ P), one is P _~ (INT (p/2). If it is less than or equal to N, statistics are collected. The time complexity is O (√ N ). Sicily 1009. mersenne composite n. calculate the prime number of Mason. [not subdivided mathematics for the time being] Sicily 1251 plinko bullet ball game calculates the probability of Sicily 1258 it polynomial to calculate the continuous number of Sicily 1047 super snooker and can it be divided into two points. sicily 1433 optimal parking directly calculates Sicily 1259 sum of consecutive prime numbers continuous prime numbers and Sicily 1239 smallest differencev digital numbers, which constitute two prime products with the smallest difference, enumeration factor Sicily 1218 commemorative stamp with 1209 Sicily 1209 sequence sum possibilities evaluate m into different continuous integers and the number of methods Sicily 1206 stacking cylinders heap cylinders, solving the equation. sicily 1199. GCD. calculate the number of gcds smaller than N and greater than M. prime Number decomposition. sicily 1190 reduced ID number finding the smallest number makes all the given numbers mod its results are different Sicily 1099 packing passengers linear modulus equation Sicily 1119 factstone benchmark evaluate N! <= 2 ^ K at the maximum n. the logarithm of the two sides is obtained. Sicily 1412 tour guide, where n objects are uniformly moving in all directions. Sicily 1305 who's winner game question, find the rule. [Simulation/others] Sicily 1052. Candy sharing game. Annular linear structure. Sicily 1122 prerequisites simulates statistics on student electives. Sicily 1093 air express enumeration. The Sicily 1237 paint mix black and white dyes are used to mix the specified grayscale dyes. Sicily 1202 the Bank of kalii date comparison Sicily 1177 take your vitamins do some basic data statistics as required. The relationship between the Sicily 1182 context-free Clock Time and the angle between the hour-hand minute-hand. Sicily 1100 Tennis anyone tennis ranking statistics. Sicily 1110 IOI photos simulation. Statistical Sicily 1128 dice to determine whether the dice is left-hand or right-hand, simulated rotation. (this can be done in reverse order) Sicily 1401 children of the candy corn to simulate the left-hand rule to walk the maze. Sicily 1205 brainf * ck a programming language [ry and computational ry]/* computatinal geometry defined in the execution question of simulated interpretation: robust geometric cannot parse neighbor searchrange searchpoint locationintersection detectionbin packingmedial-axis transformpolygon extends polygonssharpe similaritymotion planningmaintaining line between sum */PC 111202 the monocycle PC 111203 star PC 111205 robbery PC 111207 dermuba triangle PC 111301 dog and Gopher PC 111302 rope crisis in ropeland! PC 111305 birthday cake (use va judge -- not PC judge) PC 111308 how big is it? PC 111401 herding frosh PC 111403 Chainsaw Massacre PC 111404 hotter colder PC 111408 nice milk Sicily 1012 stacking cylinders. plane ry. difficulty 2 Sicily 1175 swamp things Plane n points, find a line that goes through the most points. Sicily 1234 playground semi-circle can constitute a closed circle. Select a plan and convert it to determine whether the polygon can constitute an area of the Sicily 1179 extrusion polygon. difficulty 2 Sicily 1045 space management: calculate the total area of the rectangle stacked on the plane, and cut or discretization the rectangle. sicily 1145 discretization of trees outside the school gate or scanning of O (n) Sicily 1223 defensive force field to find a line with punctuation, make the points on one side of the straight line at least Sicily 1216 the Shortest Path of the field marching light. The Sicily 1118 war on weather ball has a direct judgment range with the ball tangent. [Unclassified] Sicily 1278. Soldiers Sicily 1006. team rankings. Enumeration generates a full arrangement of five letters, ABCDE.