int main(int argc, char *argv[])
{
int *ints, *permuted_ints, x;
size_t i, len, elem_size;
int permutation_number;
len = (argc > 1) ? (size_t)atoi(argv[1]) : 4;
permutation_number = (argc > 2) ? atoi(argv[2]) : -1;
if (len == 0) {
printf("[]\n");
return 0;
}
elem_size = sizeof(int);
ints = malloc(elem_size * len);
if (!ints) {
fprintf(stderr, "malloc(%lu) == NULL\n",
(unsigned long)elem_size * len);
return 1;
}
permuted_ints = malloc(elem_size * len);
if (!permuted_ints) {
fprintf(stderr, "2nd malloc(%lu) == NULL\n",
(unsigned long)elem_size * len);
return 1;
}
for (i = 0; i < len; ++i) {
ints[i] = (int)i;
}
printf("---------\n");
print_ints(ints, len);
printf("---------\n");
if (permutation_number < 0) {
if (!factorial_size_t(len)) {
fprintf(stderr, "factorial(%lu) overflows\n",
(unsigned long)len);
}
for (i = 0; i < factorial_size_t(len); ++i) {
permute(i, ints, permuted_ints, len, elem_size, &x);
print_ints(permuted_ints, len);
}
} else {
permute((size_t)permutation_number, ints, permuted_ints, len,
elem_size, &x);
print_ints(permuted_ints, len);
}
if (MAKE_VALGRIND_HAPPY) {
free(ints);
free(permuted_ints);
}
return 0;
}
int main(int argc, char* argv[])
{
int* numbers = get_triangular_numbers(TO_PRINT);
//sizeof(numbers) doesnt equals to how many to print.
print_ints(numbers, TO_PRINT);
free(numbers);
return 0;
}
void middle_main(int rank) {
int primes[3];
int* composites = (int*)malloc(sizeof(int) * 100);
catch_ints(composites, 100);
int num_relative_primes = count_nonzeros(composites, 100);
int* composites_pool = (int*)malloc(sizeof(int) * 100);
print_ints(primes, 3);
drop_ints(primes, 3);
}
int main()
{
print_ints(5, 1,2,3,4,5);
return 0;
}
int main()
{
print_ints(3, 79, 101, 32);
return 0;
}
int main(){
print_ints(3, 79, 101, 32);
}
