Little Bricks(小磚頭) has a very brilliant calculator,
it can parse the number from the a sentense and sum up all the numbers in the sentense.
One day, he broke the calculator,
but the calculator cannot be bought anymore,
so he ask you to make a new one for him.
ouo.
Hint:
This is a Partial Judge Problem:
0. You will be provided 2 files below: 'main.c', 'function.h'. You should only upload your 'solver' function inside a your '.c' file.
1. The 'main.c' file contains input, output, and function call, the 'function.h' file contains the defination of 'solver' function, and your '.c' file should contain the implement of 'solver' function.
2. You can compile multiple file by command, ex: 'gcc main.c function.h your_code.c', or create a project in your IDE.
3. Remember to include 'function.h'.
main.c
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
#include <stdio.h> #include "function.h" #define maxn 1000 char input[1000010]; int main() { int sum = 0; int a[maxn]; int *ptr[maxn]; for (int i = 0; i < maxn; i++) { a[i] = 0; ptr[i] = &a[i]; } scanf("%s", input); int n = solver(ptr, &sum, input); printf("%d", a[0]); for (int i = 1; i < n; i++) printf(" %d", a[i]); printf("\n%d\n", sum); return 0; } |
function.h
1 2 3 4 5 |
#ifndef FUNCTION_H #define FUNCTION_H int solver(int **ptr, int *sum, char *s); #endif |
For example, if the sentense is 'Now:12/31,23:59',
then you should parse the 4 numbers: 12, 31, 23, 59 out,
and calculate the sum of these numbers, which is 12+31+23+59=129
The numbers should be separate by a space, after a newline character, output the sum of numbers.
Note that your calculator should be able to handle negative number.
Input contain only 1 line, a string S.
It is guarantee that:
0. 1<= |S| <= 10^6
1. Numbers in S will be in the range [-10^5, 10^5]
2. The ammount of number in S will be in the range [1, 1000]
Output contains 2 lines.
The first line should output all numbers appear in the input string S, separate with a space character,
the next line should be the sum of numbers at the first line.