ªð¦^¦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°±º¢¤£«e¡A²×µL©Ò±o¡j¤H³£°g©ó´M§ä©_ÂÝ¡A¦]¦Ó°±º¢¤£«e¡FÁa¨Ï®É¶¡¦A¦h¡B¸ô¦Aªø¡A¤]¤FµL¥Î³B¡A²×µL©Ò±o¡C
ªð¦^¦Cªí ¤W¤@¥DÃD