fork download
  1. #include <iostream>
  2. using namespace std;
  3. #define N (100)
  4.  
  5. struct person{
  6. string first_name,last_name,number;
  7. bool used;
  8. person()
  9. {
  10. used=0;
  11. first_name=last_name=number="";
  12. }
  13. };
  14.  
  15. person a[N];
  16.  
  17. void add_person(string f_n,string l_n,string num)
  18. {
  19. for(int i=0;i<N;i++)
  20. if(!a[i].used)
  21. {
  22. a[i].used=1,a[i].first_name=f_n,a[i].last_name=l_n,a[i].number=num;
  23. return ;
  24. }
  25. }
  26.  
  27. void search_first_name(string f_n)
  28. {
  29. int counter=0;
  30. for(int i=0;i<N;i++)
  31. if(a[i].used && a[i].first_name==f_n)
  32. counter++,cout<<a[i].first_name<<" "<<a[i].last_name<<" "<<a[i].number<<"\n";
  33. if(!counter)
  34. cout<<"Not Found.\n";
  35. }
  36.  
  37. void search_last_name(string l_n)
  38. {
  39. int counter=0;
  40. for(int i=0;i<N;i++)
  41. if(a[i].used && a[i].last_name==l_n)
  42. counter++,cout<<a[i].first_name<<" "<<a[i].last_name<<" "<<a[i].number<<"\n";
  43. if(!counter)
  44. cout<<"Not Found.\n";
  45. }
  46.  
  47. void search_number(string num)
  48. {
  49. int counter=0;
  50. for(int i=0;i<N;i++)
  51. if(a[i].used && a[i].number==num)
  52. counter++,cout<<a[i].first_name<<" "<<a[i].last_name<<" "<<a[i].number<<"\n";
  53. if(!counter)
  54. cout<<"Not Found.\n";
  55. }
  56.  
  57. void delete_person(string f_n,string l_n,string num)
  58. {
  59. for(int i=0;i<N;i++)
  60. if(a[i].used && a[i].first_name==f_n && a[i].last_name==l_n && a[i].number==num)
  61. a[i].used=0;
  62. }
  63.  
  64. int main()
  65. {
  66. add_person("Mehrdad","Saberi","09111213123");
  67. add_person("Sa1378",":D","55115511");
  68. add_person("Faeze","Frn","09110000000");
  69. search_number("09111213123");
  70. delete_person("Mehrdad","Saberi","09111213123");
  71. search_last_name("Saberi");
  72. search_first_name("Faeze");
  73. return 0;
  74. }
Success #stdin #stdout 0s 3464KB
stdin
Standard input is empty
stdout
Mehrdad Saberi 09111213123
Not Found.
Faeze Frn 09110000000