tomasf1234

doomsday calc

Mar 18th, 2014
192
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.18 KB | None | 0 0
  1. #define Sunday 0
  2. #define Monday 1
  3. #define Tuesday 2
  4. #define Wednesday 3
  5. #define Thursday 4
  6. #define Friday 5
  7. #define Saturday 6
  8. #define GREG_CAL 1582
  9.  
  10. int anchorDay(int yearEntered){
  11.     int day;
  12.     if(yearEntered>2100){
  13.         day = 0;
  14.     }
  15.     if(yearEntered<2099){
  16.         day = 2;
  17.     }
  18.     if(yearEntered<1999){
  19.         day = 3;
  20.     }
  21.     if(yearEntered<1899){
  22.         day = 5;
  23.     }
  24.     return day;
  25. }
  26.  
  27. int findDoomsday(int returnedAnchorDay, int enteredYear){
  28.  
  29.     int result;
  30.     int intermediateres = enteredYear;
  31.     int divcounter;
  32.     int intermediateresdiv;
  33.     int resdiff;
  34.     int divcounttwelve;
  35.     int divbyfour;
  36.     int divbyfourcount;
  37.     int divsevencount;
  38.  
  39. //Determines the last two digits of the number
  40.     while(intermediateres>1000){
  41.         intermediateres = intermediateres - 1000;
  42.     }
  43.  
  44. //Stores the last two digits into another variable for use
  45.     intermediateresdiv = intermediateres
  46.  
  47. //Determines the mod12 of the last two digits of the year
  48.     //Without using mod
  49.     while(intermediateres >12){
  50.         intermediateres= intermediateres - 12;
  51.         divcounter += 1;
  52.     }
  53.  
  54. //Determines the difference between the generated number and
  55.     //the last two digits of the year
  56.     divcounttwelve = divcounter * 12;
  57.     resdiff = intermediateres - divcounttwelve
  58.  
  59. //Divide resdiff by 4 and gain the whole number resul
  60.     divbyfour = resdiff
  61.     while(divbyfour>4){
  62.         divbyfour - 4;
  63.         divbyfourcount += 1;
  64.     }
  65.    
  66. //Add all the results together
  67.     result = divcounter + divcounttwelve + divbyfourcount + returnedAnchorDay;
  68.  
  69. //Mod 7
  70.     while(result>7){
  71.         result = result - 7;
  72.         divsevencount += 1;
  73.     }
  74.  
  75. //Returns the day that the doomsday falls on
  76.     return divsevencount;
  77.  
  78.  
  79. }
  80.  
  81. int isLeapYear (int yearvar)
  82.  
  83. {
  84.     int success = 0;
  85.  
  86.     if ((yearvar % 100)==0) {
  87.         success = 0;
  88.     }  
  89.  
  90.     if ((yearvar % 4)==0) {
  91.         success = 1;
  92.     }
  93.  
  94.     if ((yearvar % 400)==0) {
  95.         success = 1;
  96.     }
  97.     return success;
  98. }
  99.  
  100. int dayOfWeek (int doomsday, int leapYear, int month, int day) {
  101.    int dayOfWeek;
  102.  
  103.    
  104.  
  105.    return (dayOfWeek);
  106.  
  107. int main (int argc, const char * argv[]){
  108.     int userYearInput;
  109.     int returnedanchorday = anchorDay(userYearInput);
  110.     int yeardoomsday = findDoomsday(returnedanchorday, userYearInput);
  111.     int leapYear = isLeapYear(userYearInput);
  112.  
  113. }
Advertisement
Add Comment
Please, Sign In to add comment