Init skeleton c_impl and problem description

This commit is contained in:
Stephen Seo 2021-08-18 12:36:57 +09:00
parent 369411b02b
commit 7671380054
5 changed files with 32 additions and 0 deletions

3
c_impl/.gitignore vendored Normal file
View file

@ -0,0 +1,3 @@
build*/
.cache/
compile_commands.json

16
c_impl/CMakeLists.txt Normal file
View file

@ -0,0 +1,16 @@
cmake_minimum_required(VERSION 3.9)
project(AronsonsSequencePractice)
set(ASP_SOURCES
src/main.c)
set(CMAKE_C_FLAGS "-Wall -Wextra -Wpedantic")
set(CMAKE_C_FLAGS_DEBUG "-g -O0")
set(CMAKE_C_FLAGS_RELEASE "-O3 -DNDEBUG")
if(NOT CMAKE_BUILD_TYPE OR "${CMAKE_BUILD_TYPE}" MATCHES ^$)
set(CMAKE_BUILD_TYPE "Debug")
message("Set defualt build type to Debug")
endif()
add_executable(aronsonsSequence ${ASP_SOURCES})

3
c_impl/src/main.c Normal file
View file

@ -0,0 +1,3 @@
int main(int argc, char **argv) {
return 0;
}

9
problemDesc.txt Normal file
View file

@ -0,0 +1,9 @@
Aronson\u2019s sequence 1, 4, 11, 16, 24, 29, 33, 35, 39, \u2026 (A005224) is
an infinite self-referential sequence defined as:
T is the first, fourth, eleventh, \u2026 letter in this sentence.
Your task is to write a program that generates Aronson\u2019s sequence and use
it to compute the first hundred members of the sequence. When you are finished,
you are welcome to read or run a suggested solution, or to post your own
solution or discuss the exercise in the comments below.

1
problemLink.txt Normal file
View file

@ -0,0 +1 @@
https://programmingpraxis.com/2021/06/22/aronsons-sequence/