Advertisement
Guest User

Untitled

a guest
Mar 28th, 2017
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.57 KB | None | 0 0
  1. #include <iostream>
  2. #include <cstdlib>
  3. using namespace std;
  4. int n;
  5. struct date{
  6. int day, month, year;
  7. };
  8. class datefile{
  9. date *d;
  10. public:
  11. datefile()
  12. {
  13. d=(date*)malloc(n*sizeof(date));
  14. for(int i=0;i<n;i++)
  15. {
  16. d[i].day=0;
  17. d[i].month=0;
  18. d[i].year=0;
  19. }
  20. }
  21. void writedate()
  22. {
  23. for(int i=0;i<n;i++)
  24. {
  25. printf("enter day month year:\n");
  26. scanf("%2d %2d %4d",&d[i].day,&d[i].month,&d[i].year);
  27. }
  28. }
  29. void safefile()
  30. {
  31. FILE *f=fopen("f.txt","w");
  32. for(int i=0;i<n;i++)
  33. {
  34. fprintf(f,"%2d %2d %4d",d[i].day,d[i].month,d[i].year);
  35. }
  36. fclose(f);
  37. }
  38. int minyear(void)
  39. {
  40. int min_year=d[0].year;
  41. for(int i=0;i<n;i++)
  42. {
  43. if(d[i].year>d[i++].year)
  44. min_year=d[i++].year;
  45. }
  46. return min_year;
  47. }
  48. void showlastdate()
  49. {
  50. int lastyear=d[0].year;
  51. int lastmonth=d[0].month;
  52. int lastday=d[0].year;
  53. printf("last date:\n");
  54. for(int i=0;i<n;i++)
  55. {
  56. if(d[i].day<d[i++].day)
  57. lastday=d[i++].day;
  58. if(d[i].month<d[i++].month)
  59. lastmonth=d[i+1].month;
  60. if(d[i].year<d[i++].year)
  61. lastyear=d[i++].year;
  62. }
  63. printf("%d.%d.%4d\n",lastday,lastmonth,lastyear);
  64. }
  65. void spring()
  66. {
  67. printf("spring dates:\n");
  68. for(int i=0;i<n;i++)
  69. {
  70. if(d[i].month<6 && d[i].month>2)
  71. printf("%2d %2d %4d\n",d[i].day,d[i].month,d[i].year);
  72. }
  73. }
  74. };
  75. int main()
  76. {
  77. printf("enter an ammount of dates:\n");
  78. scanf("%d",&n);
  79. datefile d1;
  80. d1.writedate();
  81. d1.safefile();
  82. cout<<"least year"<<d1.minyear()<<endl;
  83. d1.showlastdate();
  84. d1.spring();
  85. return 0;
  86. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement