<commit_before><commit_msg>added an example cloudcoder problem XML file<commit_after><ccproblem>
	<name>prob_5_1</name>
	<type>C_PROGRAM</type>
	<brief>Print integers from 1 to n</brief>
	<assigned>2 2 2012 9:00:00 -0500</assigned>
	<due>2 7 2012 9:00:00 -0500</due>
	<description><![CDATA[
<p>
Write a program that reads an integer (which you may assume
will be positive) and prints all of the integers from
1 to that integer, <em>on a single line</em>.
</p>

<p>
For example, if the integer read by the program is <b>7</b>,
then the program should print a line reading
</p>

<blockquote>
<pre>
1 2 3 4 5 6 7
</pre>
</blockquote>

<p>
Hint: make sure that there is at least one space between each
number.  In other words, if the integer is <b>4</b>,
then the output should be <code>1 2 3 4</code>, not <code>1234</code>.
</p>

<p>
If the program produces more than 20 lines of output, it will terminate and the test will fail.
</p>
]]>
	</description>
	<skeleton><![CDATA[#include <stdio.h>

int main(void) {
	// TODO: your code goes here

	return 0;
}
]]>
	</skeleton>
	<testcase>
		<name>nEquals7</name>
		<input>7</input>
		<output>^\s*\s*1\s*2\s*3\s*4\s*5\s*6\s*7\s*$</output>
	</testcase>
	<testcase>
		<name>nEquals4</name>
		<input>4</input>
		<output>^\s*\s*1\s*2\s*3\s*4\s*$</output>
	</testcase>
	<testcase>
		<name>nEquals5</name>
		<input>5</input>
		<output>^\s*\s*1\s*2\s*3\s*4\s*5\s*$</output>
	</testcase>
	<testcase secret="true">
		<name>nEquals9</name>
		<input>9</input>
		<output>^\s*\s*1\s*2\s*3\s*4\s*5\s*6\s*7\s*8\s*9\s*$</output>
	</testcase>
</ccproblem>

{'fraction_non_alphanumeric': 0.19216182048040456, 'fraction_numerical': 0.054993678887484194, 'mean_word_length': 4.090032154340836, 'pattern_counts': {'":': 0, '<': 76, '<?xml version=': 0, '>': 76, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2634837', 'n_tokens_mistral': 731, 'n_tokens_neox': 670, 'n_words': 178}