Ledger Nano X - The secure hardware wallet
SHARE
TWEET

Untitled

a guest Mar 31st, 2020 71 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4.  
  5. structNode
  6. {
  7.     int digit;
  8.     struct Node* next;
  9. };
  10. typedefstruct Node* NodePtr;
  11.  
  12. void getInputs(int* base, int* number)
  13. {
  14.     printf ("Enter a base: ");
  15.     scanf ("%s", base);
  16.     printf ("Enter a number: ");
  17.     scanf ("%s", number);
  18. }
  19.  
  20. void convertNumber(Node** top, int base, int number)
  21. {
  22.  
  23. }
  24.  
  25. void displayNumber(Node* top)
  26. {
  27.     Node* currPtr(new name) = top;        
  28.    
  29.     if(startPtr(new name) == NULL)
  30.         printf("EMpty list.\n");
  31.     else
  32.    
  33.     while(top != NULL )
  34.     {
  35.         printf("%-26s %3d\n", currPtr->item, currPtr->qty );   (change name of currptr)
  36.         currPtr(new name) = currPtr(new name)->next;
  37.     }
  38. }
  39.    
  40.  
  41. int counDigitst(Node* top)
  42.     {
  43.     int numNodes = 0;
  44.     Node current = root;
  45.  
  46.     // if root is null, the number of nodes is 0
  47.     if(current != null)
  48.      {
  49.  
  50.         // if root is not null, we have at least one node
  51.         numNodes = 1;
  52.  
  53.         // count all nodes
  54.         while(current .next != null)
  55.          {
  56.          ++numNodes;
  57.          current = current.next;
  58.          }
  59.     }
  60. }
  61. int main()
  62. {
  63.    
  64. }
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
Top