NortheasternEurope(NEERC)2001测试数据资源-CSDN文库

共372个文件

exe：11个

xml：10个

04a：9个

4星 · 超过85%的资源需积分: 20 88 浏览量 2009-05-03 20:47:39 上传评论收藏 1.15MB RAR 举报

【东北欧程序设计竞赛（NEERC）2001测试数据】东北欧程序设计竞赛（Northeastern European Regional Contest, 简称NEERC）是国际大学生程序设计竞赛（ACM/ICPC）的一部分，这是一个享誉全球的编程比赛，旨在挑战学生的算法设计、问题解决和编程技能。2001年的NEERC比赛提供了丰富的测试数据，供参赛队伍训练和测试自己的解决方案。在编程竞赛中，测试数据至关重要，因为它验证了参赛者提交的代码是否能够正确解决特定问题。"problems"这个压缩包文件很可能包含了当年比赛的所有题目及其对应的测试用例。这些测试用例通常包括一组输入数据和预期的输出结果，用于检查参赛者编写的程序在不同情况下的行为。 ACM/ICPC竞赛的格式通常是这样的：参赛团队需要解决一系列算法问题，这些问题涵盖了从数据结构到图论，从动态规划到搜索算法等各种计算机科学领域的知识点。每个问题都有一个描述，阐述了问题的背景和要求，以及输入和输出的格式。在2001年NEERC的"problems"文件中，我们可以期待找到这样的详细信息： 1. **问题描述**：对每个问题的详细解释，包括问题的背景、输入输出格式、限制条件等。 2. **样例输入和输出**：演示如何使用正确答案的示例，帮助参赛者理解问题要求。 3. **测试数据**：大量的实际输入，用于评估参赛者的代码在各种情况下的性能。 4. **评分标准**：可能包含时间限制和错误容忍度，决定了程序在多长时间内运行完并接受多少错误答案仍然可以得分。通过对这些测试数据的研究，参赛者不仅能够了解当年比赛的难度和风格，还能通过调试和优化代码提升自己的编程能力。这些数据对教育和培训新程序员也有很高的价值，因为它们提供了一个实战环境，让学生面对真实的问题，锻炼解决问题的能力。 NEERC 2001的测试数据是一份宝贵的教育资源，它体现了算法和编程在解决复杂问题中的核心作用。通过深入分析和实践，学习者能够掌握更多的算法技巧，提升自己的编程水平，并为未来的ACM/ICPC或其他编程挑战做好准备。对于希望在编程竞赛中取得成功或者提升计算机科学理论知识的人来说，这是一个不可多得的学习资源。

资源推荐

资源详情

资源评论

收起资源包目录

Northeastern Europe (NEERC)2001 测试数据（372个子文件）

stat.01 377B

chem.01 149B

wall.01 88B

library.01 57B

teams.01 52B

cable.01 30B

bracket.01 6B

pairs.01 5B

sum.01 4B

stat.01a 2KB

chem.01a 266B

pairs.01a 83B

teams.01a 13B

bracket.01a 8B

cable.01a 6B

wall.01a 6B

library.01a 5B

sum.01a 4B

chem.02 123B

library.02 57B

stat.02 54B

teams.02 52B

wall.02 28B

cable.02 14B

pairs.02 5B

sum.02 3B

bracket.02 3B

chem.02a 209B

pairs.02a 83B

teams.02a 16B

cable.02a 7B

wall.02a 7B

library.02a 5B

bracket.02a 4B

sum.02a 3B

stat.02a 0B

chem.03 206B

stat.03 65B

wall.03 64B

cable.03 54B

library.03 23B

teams.03 9B

pairs.03 4B

sum.03 3B

bracket.03 3B

chem.03a 363B

stat.03a 309B

pairs.03a 16B

teams.03a 10B

cable.03a 7B

wall.03a 7B

library.03a 5B

bracket.03a 4B

sum.03a 3B

cable.04 97KB

chem.04 526B

stat.04 186B

wall.04 61B

library.04 23B

pairs.04 12B

teams.04 11B

sum.04 3B

bracket.04 3B

stat.04a 1KB

chem.04a 703B

pairs.04a 461B

cable.04a 10B

teams.04a 10B

wall.04a 7B

library.04a 5B

bracket.04a 4B

sum.04a 3B

chem.05 526B

stat.05 499B

library.05 112B

wall.05 91B

cable.05 15B

teams.05 13B

pairs.05 4B

sum.05 4B

bracket.05 3B

stat.05a 3KB

chem.05a 703B

pairs.05a 16B

teams.05a 10B

cable.05a 6B

library.05a 5B

sum.05a 4B

wall.05a 4B

bracket.05a 4B

wall.06 12KB

stat.06 577B

chem.06 252B

library.06 112B

bracket.06 102B

cable.06 20B

teams.06 12B

pairs.06 11B

sum.06 4B

chem.06a 1KB

共 372 条

<?xml version="1.0"?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html> <head> <title>Chemical reactions</title> </head> <body> <h2>Chemical reactions</h2> <table> <tr><td><strong>Input file</strong></td><td><tt>chem.in</tt></td></tr> <tr><td><strong>Output file</strong></td><td><tt>chem.out</tt></td></tr> </table> <p>Bill teaches chemistry in the school and has prepared a number of tests for his students. Each test has a chemical formula and a number of possible reaction outcomes that his students are to choose one correct from. However, Bill wants to make sure that he has not made any typos while entering his tests into a computer and that his students won't easily throw away wrong answers simply by counting a number of chemical elements on the left and on the right side of the equation, which should be always equal in a valid reaction.</p> <p>You are to write a program that will help Bill. The program shall read the description of the test for the students that consists of the given left side of the equation and a number of possible right sides, and determines if the number of chemical elements on each right side of the equation is equal to the number of chemical elements on the given left side of the equation.</p> <p>To help you, poor computer folks, that are unaware of the complex world of chemistry, Bill has formalized your task. Each side of the equation is represented by a string of characters without spaces, and consists of one or more chemical sequences separated by a '+' (plus) characters. Each sequence has an optional preceding integer multiplier that applies to the whole sequence and a number of elements. Each element is optionally followed by an integer multiplier that applies to it. An element in this equation can be either distinct chemical element or a whole sequence that is placed in round parenthesis. Every distinct chemical element is represented by either one capital letter or a capital letter that is followed by a small letter.</p> <p>Even more formally, using notation that is similar to BNF, we can write:</p> <ul> <li><formula> ::= [<number>] <sequence> { '+' [<number>] <sequence> }</li> <li><sequence> ::= <element> [<number>] { <element> [<number>] }</li> <li><element> ::= <chem> | '(' <sequence> ')'</li> <li><chem> ::= <uppercase_letter> [ <lowercase_letter> ]</li> <li><uppercase_letter> ::= 'A'..'Z'</li> <li><lowercase_letter> ::= 'a'..'z'</li> <li><number> ::= '1'..'9' { '0'..'9' }</li> </ul> <p>Every distinct chemical element is said to occur in the given formula for some total number X, if X is the sum of all separate occurrences of this chemical element multiplied to all numbers that apply to it. For example, in the following chemical formula:</p> <p><tt>C2H5OH+3O2+3(SiO2)</tt></p> <ul> <li><tt>C</tt> occurs for a total of 2 times.</li> <li><tt>H</tt> occurs for a total of 6 times (5 + 1).</li> <li><tt>O</tt> occurs for a total of 13 times (1 + 3*2 + 3*2).</li> <li><tt>Si</tt> occurs for a total of 3 times.</li> </ul> <p>All multipliers in the formula are integer numbers that are at least 2 if explicitly specified and are 1 by default. Each chemical formula is at most 100 characters long, and every distinct chemical element is guaranteed to occur for a total of no more than 10000 times in each formula.</p> <h3>Input</h3> <p>The first line of the input file represents a chemical formula that is to be tested as the left side of the equation. The second line of the input file contains a single integer number N (1 ≤ N ≤ 10), which is the number of right sides of the equation that are to be tested. Each one of the following N lines represents one such formula.</p> <h3>Output</h3> <p>You are to write to the output file N lines - one line per each possible answer of the chemical test for Bill's students that is given in the input file. For each right-hand side formula that is encountered in the input file, write to the output file:</p> <p><tt><left_formula>==<right_formula></tt></p> <p>if the total number of occurrences of each distinct chemical element on the left-hand side equals to the total number of occurrences of this chemical element on the right-hand side. Otherwise write:</p> <p><tt><left_formula>!=<right_formula></tt></p> <p>Here <tt><left_formula></tt> must be replaced exactly (character by character) with the original left-hand side formula as it is given in the first line of the input file, and <tt><right_formula></tt> must be replaced exactly with each right-hand side formula as they are given in the input file. Do not place any spaces in the lines you write to the output file.</p> <h3>Sample input</h3> <pre><tt>C2H5OH+3O2+3(SiO2) 7 2CO2+3H2O+3SiO2 2C+6H+13O+3Si 99C2H5OH+3SiO2 3SiO4+C2H5OH C2H5OH+3O2+3(SiO2)+Ge 3(Si(O)2)+2CO+3H2O+O2 2CO+3H2O+3O2+3Si</tt></pre> <h3>Output for the sample input</h3> <pre><tt>C2H5OH+3O2+3(SiO2)==2CO2+3H2O+3SiO2 C2H5OH+3O2+3(SiO2)==2C+6H+13O+3Si C2H5OH+3O2+3(SiO2)!=99C2H5OH+3SiO2 C2H5OH+3O2+3(SiO2)==3SiO4+C2H5OH C2H5OH+3O2+3(SiO2)!=C2H5OH+3O2+3(SiO2)+Ge C2H5OH+3O2+3(SiO2)==3(Si(O)2)+2CO+3H2O+O2 C2H5OH+3O2+3(SiO2)!=2CO+3H2O+3O2+3Si</tt></pre> <h3>Note</h3> <p>The sample input and output do not contain digit '0' because it looks the same as the symbol for the chemical element oxygen. The actual tests may contain any allowed characters.</p> </body> </html>

评论收藏

内容反馈