Boy_Scouts_Scheduler.GreedyAlgorithm.GreedyScheduler.ZeroOut C# (CSharp) Метод

        private static void ZeroOut()
        {
            int i, j, k;

            for (i = 0; i < MAXD; i++)
                for (j = 0; j < MAXS; j++)
                {
                    masterSchedule[i, j] = new Dictionary<int, int>();
                    oldMasterSchedule[i, j] = new Dictionary<int, int>();
                }

            for (i = 0; i < MAXN; i++)
                for (j = 0; j < MAXN; j++)
                {
                    GroupStationAssignments[i, j] = GroupRankStationAssignments[i, j] = GroupAssignments[i] = StationAssignmentsCounts[i] = 0;

                    lastDaySlotAssignedToStation[i, j] = new KeyValuePair<int, int>(-1, -1);
                    lastDaySlotAssignedToPin[i] = new KeyValuePair<int, int>(-1, -1);

                    for (k = 0; k < MAXN; k++)
                    {
                        StationSlotAssignmentsCounts[i, j, k] = stationTotalAvailabilityCounts[i, j, k] = 0;
                        isGroupBusy[i, j, k] = false;
                    }

                    ConstraintMet[i] = false;
                }
        }