Advertisement
Guest User

Untitled

a guest
Feb 22nd, 2019
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.64 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. struct vet{
  4.  
  5. int tam;
  6. int key[10];
  7. char content[10][60];
  8.  
  9. };
  10.  
  11. typedef struct vet vetor;
  12.  
  13. void insert(vetor s, int ind, char cnt[]){
  14.  
  15. int i;
  16.  
  17. s.key[s.tam] = ind;
  18.  
  19. for(i = 0; i < 60; i++){
  20.  
  21. s.content[s.tam][i] = cnt[i];
  22.  
  23. if (cnt[i] == '') break;
  24.  
  25. }
  26.  
  27. s.tam++;
  28.  
  29. }
  30.  
  31. int search(vetor s, int ind){
  32.  
  33. int i, k;
  34.  
  35. for(i = 0; i < s.tam; i++)
  36. if (s.key[i] == ind)
  37. return 1;
  38.  
  39. return 0;
  40.  
  41. }
  42.  
  43. int main(){
  44.  
  45. vetor s1;
  46. s1.tam = 0;
  47.  
  48. insert(s1, 11, "acre");
  49.  
  50. if (search(s1, 11)) printf("foundn");
  51. else printf("not foundn");
  52.  
  53. return 0;
  54.  
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement