int main() { FILE *in = fopen("task.in", "r"); FILE *out = fopen("task.out", "w"); int length1 = scanLen(in); int length2 = scanLen(in); int size = length1 + length2; int array1[length1]; int array2[length2]; int arrayMerge[size]; int index = 0; arrayScan(in, array1, length1); arrayScan(in, array2, length2); fclose(in); for ( int i = 0; i < length1; i++ ) { arrayMerge[i] = array1[i]; } for ( int i = length1; i < size; i++ ) { arrayMerge[i] = array2[index]; index += 1; } sort(arrayMerge, size); arrayPrint(out, arrayMerge, size); fclose(out); return 0; }
int main() { FILE *in = fopen("task.in", "r"); FILE *out = fopen("task.out", "w"); int length = scanLen(in); int array[length]; int needle; arrayScan(in, array, length); fclose(in); needle = jump(array, length); arrayPrint(out, needle); fclose(out); return 0; }
int main() { FILE *in = fopen("task.in", "r"); FILE *out = fopen("task.out", "w"); int len = scanLen(in); int array[len]; for ( int i = 0; i < len; i++ ) { fscanf(in, "%d", &array[i]); } fclose(in); mergeSort(array, 0, len-1); for ( int i = 0; i < len - 1; i++ ) { fprintf(out, "%d ", array[i]); } fprintf(out, "%d\n", array[len-1]); fclose(out); return 0; }