ªð¦^¦Cªí ¤W¤@¥DÃD µo©«

[µo°Ý] Ãö©ó½Æ»sªº¤èªk

for (int nSortedSchedule = 0; nSortedSchedule < number_of_schedules; nSortedSchedule++, nDuplicated++)
        {               
                duplicated_schedules[nDuplicated] = sorted_schedules[nSortedSchedule%(number_of_schedules/2)];
        }

¤Ö¤FÂIªF¦è!

TOP

        ÀR«ä¦Û¦b : ¡i»X½ªªº¦Û¥Ñ¡j¤H±`¦b¤°»ò³£¥i¥H¦Û¥Ñ¦Û¦bªº®É­Ô¡A«o³Q³oºØÀH¤ß©Ò±ýªº¦Û¥Ñ»X½ª¡AµêÂY®É¥ú¦Ó²@µLıª¾¡C
ªð¦^¦Cªí ¤W¤@¥DÃD