ªð¦^¦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 : §g¤l¥ß«í§Ó¡A¤p¤H«í¥ß§Ó¡C
ªð¦^¦Cªí ¤W¤@¥DÃD