-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProgram.cs
More file actions
70 lines (64 loc) · 2.22 KB
/
Copy pathProgram.cs
File metadata and controls
70 lines (64 loc) · 2.22 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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace RandomGuess
{
class Program
{
private static Random rnd = new Random();
private static int[] totalCounts = {0, 0, 0};
private static int[] latestCounts = { 0, 0, 0 };
private const int latestSize = 1000;
private static Queue<int> latestNumbers = new Queue<int>(latestSize);
private static int totalGuesses = 0;
private static int correctGuesses = 0;
static void Main(string[] args)
{
int guess = 3;
for (int i = 0; i < 100000; i++)
{
int nextResult = AddRandomNumber();
if (guess < 3)
{
totalGuesses++;
if (guess == nextResult)
{
Console.WriteLine("Guess {0} was CORRECT.", guess);
correctGuesses++;
}
else
{
Console.WriteLine("Guess {0} did not match {1}", guess, nextResult);
}
}
if (latestNumbers.Count >= latestSize)
{
for (guess = 0; guess < 3; guess++)
{
if (latestCounts[guess] < 300)
{
Console.WriteLine("Distribution is 0:{0} ({1} total) 1:{2} ({3} total) 2:{4} ({5} total)\nGuessing {6}."
, latestCounts[0], totalCounts[0], latestCounts[1], totalCounts[1], latestCounts[2], totalCounts[2], guess);
break;
}
}
}
}
Console.WriteLine("Final distribution: 0:{0}, 1:{1}, 2:{2}"
, totalCounts[0], totalCounts[1], totalCounts[2]);
Console.WriteLine("Total guesses: {0}; correct guesses: {1}; percent correct: {2}"
, totalGuesses, correctGuesses, correctGuesses * 100.0 / totalGuesses);
}
static int AddRandomNumber()
{
int result = rnd.Next(3);
totalCounts[result]++;
latestCounts[result]++;
latestNumbers.Enqueue(result);
if (latestNumbers.Count > latestSize)
latestCounts[latestNumbers.Dequeue()]--;
return result;
}
}
}