/* * Solution Template for Space Mission * * Australian Informatics Olympiad 2021 * * This file is provided to assist with reading of input and writing of output * for the problem. You may modify this file however you wish, or * you may choose not to use this file at all. */ #include /* N is the number of available days. */ int N; /* F is the amount of fuel available. */ int F; /* C contains the fuel needed to open a portal on each day. */ int C[100005]; int answer; int main(void) { /* Read the value of N and F. */ scanf("%d%d", &N, &F); /* Read the cost to open a portal on each day. */ for (int i = 0; i < N; i++) { scanf("%d", &C[i]); } /* * TODO: This is where you should compute your solution. Store the maximum * number of samples you could collect into the variable answer. */ /* Write the answer. */ printf("%d\n", answer); return 0; }