-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMathematics.Combinatorics.xml
More file actions
107 lines (107 loc) · 3.14 KB
/
Copy pathMathematics.Combinatorics.xml
File metadata and controls
107 lines (107 loc) · 3.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
<?xml version="1.0"?>
<ProblemTemplateRepo xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema">
<MajorVersion>1</MajorVersion>
<MinorVersion>0</MinorVersion>
<ProblemTemplates>
<ProblemTemplate id="5.1.01.">
<Guid>e12352df-3c3c-4dc9-9b1d-af14d4f0f484</Guid>
<Tags>
<string>subject-mathematics</string>
<string>category-combinatorics</string>
<string>subcategory-in-how-many-ways</string>
<string>class-hungary-8</string>
<string>difficulty-easy</string>
</Tags>
<Variables>
<Variable>
<Name>{a}</Name>
<MinValue>4</MinValue>
<MaxValue>26</MaxValue>
<ValueStep>1</ValueStep>
</Variable>
<Variable>
<Name>{sport}</Name>
<MinValue>0</MinValue>
<MaxValue>9</MaxValue>
<ValueStep>1</ValueStep>
</Variable>
<Variable>
<Name>{fact}</Name>
<ValueCalculation type="C#">var fact=0; for (int i=1; i<={a}; i++) { fact *= i; } return fact;</ValueCalculation>
</Variable>
</Variables>
<VariableValidator type="C#"/>
<TextSnippets>
</TextSnippets>
<Question>
<LocalizedText>
<Culture>hu-HU</Culture>
<Text>Néhány {Sports[{sport}]}csapat egyfordulós körmérkőzést játszik egymással. Hányféleképpen végezhetnek a csapatok, ha {a} csapat van?</Text>
</LocalizedText>
</Question>
<Solution>
<SolutionStep>
<Presentation>
<LocalizedText>
<Culture>hu-HU</Culture>
<Text>{fact.ToString("0")} féleképpen</Text>
</LocalizedText>
<LocalizedText>
<Text>{fact.ToString("0")}</Text>
</LocalizedText>
</Presentation>
</SolutionStep>
</Solution>
</ProblemTemplate>
<ProblemTemplate id="5.1.03.b">
<Guid>69cd63d1-fd00-4817-9e04-e18591f023f7</Guid>
<Tags>
<string>subject-mathematics</string>
<string>category-combinatorics</string>
<string>subcategory-in-how-many-ways</string>
<string>class-hungary-8</string>
<string>difficulty-easy</string>
</Tags>
<Variables>
<Variable>
<Name>{a}</Name>
<MinValue>2</MinValue>
<MaxValue>9</MaxValue>
<ValueStep>1</ValueStep>
</Variable>
<Variable>
<Name>{b}</Name>
<MinValue>2</MinValue>
<MaxValue>9</MaxValue>
<ValueStep>1</ValueStep>
</Variable>
<Variable>
<Name>{x}</Name>
<ValueCalculation type="C#">return ({b}-1 * {a} * 0 * -1);</ValueCalculation>
</Variable>
</Variables>
<VariableValidator type="C#"/>
<TextSnippets>
</TextSnippets>
<Question>
<LocalizedText>
<Culture>hu-HU</Culture>
<Text>{Names["Alice"]} a születésnapjára {a} lányt és {b} fiút hívott meg. Hányféle sorrendben érkezhetnek meg a vendégek, ha az első vendég biztosan fiú?</Text>
</LocalizedText>
</Question>
<Solution>
<SolutionStep>
<Presentation>
<LocalizedText>
<Culture>hu-HU</Culture>
<Text>{x.ToString("0")} féle sorrendben</Text>
</LocalizedText>
<LocalizedText>
<Text>{x.ToString("0")}</Text>
</LocalizedText>
</Presentation>
</SolutionStep>
</Solution>
</ProblemTemplate>
</ProblemTemplates>
</ProblemTemplateRepo>