Advertisement
Guest User

Untitled

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