Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #include <stdio.h>
- #include <string.h>
- #include <stdlib.h>
- struct Node
- {
- int data;
- Node* next;
- };
- void add_node(Node*& first, Node*& last, int data)
- {
- if (first == NULL)
- {
- first = new Node;
- first->data = data;
- first->next = NULL;
- last = first;
- }
- else
- {
- Node* cur = new Node;
- cur->data = data;
- last->next = cur;
- cur->next = NULL;
- last = cur;
- }
- }
- void print_list(Node* first)
- {
- while (first != NULL)
- {
- printf("%d ", first->data);
- first = first->next;
- }
- }
- int sum_num(int num)
- {
- int sum = 0;
- while (num > 0)
- {
- sum += num % 10;
- num = num / 10;
- }
- return sum;
- }
- void find_num(Node* first)
- {
- int sum;
- while (first != NULL)
- {
- sum = sum_num(first->data);
- if (sum > 10)
- printf("%d, %d\n", first->data, sum);
- first = first->next;
- }
- }
- int main()
- {
- Node* first = NULL;
- Node* last = NULL;
- char snum[80];
- puts("Enter numbers:");
- while (gets_s(snum), strlen(snum) > 0)
- add_node(first, last, atoi(snum));
- puts("List:");
- print_list(first);
- puts("\n\nNumbers:");
- find_num(first);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement