c++笔记之日历的实现

任务:给定具体某一天的年月日,并指出这是星期几,凭此可以查出任何一年的日历。

未解决问题:1.未能实现日历的列数的自由控制,只能一列,

2.循环部分过于复杂,找时间修改,

3.日期算法或许并没有真正简化.

以下为源码,部分还未能完善:

#include<iostream>
#include<string>
#include<iomanip>
using namespace std;
#define decide_leap 250
#define nx 4
//用来定义日历每个数之间的间隔


int max_month[31] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19
,20,21,22,23,24,25,26,27,28,29,30,31 };
int mid_month[30] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19
,20,21,22,23,24,25,26,27,28,29,30 };
int leap_month[29] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19
,20,21,22,23,24,25,26,27,28,29 };
int least_month[28] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19
,20,21,22,23,24,25,26,27,28 };
string month[12] = { "一月","二月","三月","四月","五月","六月","七月","八月","九月","十月","十一月","十二月" };
int decide(int x, int y, int z,int q);
int whatDay(int x);
int decideleap(int x);
int main() {
int x, y, z,q;
cout << "Please enter the num of the year,month,day in sequence" << endl;
cin >> x >> y >> z;
cout << "Please enter what day is the day?" << endl;
cin >> q;
decide(x, y, z,q);
system("PAUSE");
return 0;
}


int decide(int x, int y, int z,int q) {
int numberOfYear;
int before_day = 0;
int after_day = 0;
//来确定输入日期的那一年的日期前后各有多少天,要注意输入的那一天怎么算?
for (int i = 1; i < y; i++) {
if (i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10 || i == 12) {
before_day += 31;
}
else if (i == 4 || i == 6 || i == 9 || i == 11) {
before_day += 30;
}
else {
before_day += 28;
//注意是闰年的时候把sum加上一!
}
}
before_day += z-1;//此处应该减去一;
after_day += z;
//注意这个z没减一
cout << "Please enter the number of the year" << endl;
cin >> numberOfYear;
while (x > numberOfYear) {
if (decideleap(x) == 250) {
before_day += 366;
}
else {
before_day += 365;
}
x--;
}
int mo = whatDay(before_day);
//先找出那一年第一天是星期几;
int xingqi;
if (q - mo > 0) {
xingqi = q - mo;
}
else {
xingqi = q - mo + 7;
}
//这里求出来的xingqi应该是这一年第一天是星期几了吧;
for (int i = 1; i <= 12; i++) {
int jiezhi = xingqi;
cout << endl<<setw(16)<<month[i-1]<<endl;
if (i == 1 || i == 3 || i== 5 || i == 7 || i == 8 || i == 10 || i == 12) {
cout << setw(nx) << "一" << setw(nx) << "二" << setw(nx) << "三" << setw(nx) << "四" <<                                          setw(nx) <<"五" << setw(nx) << "六" << setw(nx) << "日" <<setw(nx)<< endl;
if (xingqi == 0) {
xingqi = 7;
}//最后一个找到的bug,真难找,根本不会有⑦的出现
for (int i = 1; i < xingqi; i++) {
cout <<setw(nx)<<" ";
}
for (int i = 0; i < 31; i++) {
cout <<setw(nx)<< max_month[i];
xingqi++;
if (xingqi == 8) {
cout << endl;
xingqi = 1;
}
}
jiezhi += 31;
xingqi = jiezhi % 7;
}
else if (i == 4 || i == 6 || i == 9 || i == 11) {
cout <<setw(nx)<< "一" <<setw(nx)<< "二" << setw(nx) << "三" << setw(nx) << "四" << setw(nx)<<"五" << setw(nx) << "六" << setw(nx) << "日" <<setw(nx)<<  endl;
if (xingqi == 0) {
xingqi = 7;
}
for (int i = 1; i < xingqi; i++) {
cout << setw(nx)<<" " ;
}
for (int i = 0; i < 30; i++) {
cout << setw(nx)<<mid_month[i];
xingqi++;
if (xingqi == 8) {
cout << endl;
xingqi = 1;
}
}
cout << endl;
jiezhi += 30;
xingqi = jiezhi % 7;
}
else {
                                       cout <<setw(nx)<< "一" <<setw(nx) << "二" << setw(nx)<< "三" <<setw(nx)<< "四" <<                                    setw(nx) <<"五" <<setw(nx)<< "六" << setw(nx) << "日" <<setw(nx)<<endl;
if (xingqi == 0) {
xingqi = 7;
}
for (int i = 1; i < xingqi; i++) {
cout << setw(nx)<<" ";
}
if (decideleap(numberOfYear) == 250) {
for (int i = 0; i < 29; i++) {
cout << setw(nx)<<leap_month[i];
xingqi++;
if (xingqi == 8) {
cout << endl;
xingqi = 1;
}
}
cout << endl;
jiezhi += 29;
xingqi = jiezhi % 7;
}else {
for (int i = 0; i < 28; i++) {
cout <<setw(nx)<<least_month[i];


xingqi++;
if (xingqi == 8) {
cout << endl;
xingqi = 1;
}
}
cout << endl;
jiezhi += 28;
xingqi = jiezhi % 7;
}
}
}
return 0;
}

int whatDay(int x) {
if (x % 7 == 1) {
return 1;
}
else if (x % 7 == 2) {
return 2;
}
else if (x % 7 == 3) {
return 3;
}
else if (x % 7 == 4) {
return 4;
}
else if (x % 7 == 5) {
return 5;
}
else if (x % 7 == 6) {
return 6;
}
else {
return 7;
}
}
int decideleap(int x) {
if (x % 4 == 0 && x % 100 != 0) {
x = decide_leap;
}
if (x % 400 == 0) {
x = decide_leap;
}
return x;

}

本次写代码,只在大脑里有一个模糊的思路,先写出了大概并进行一次次的添加,一步步的debug,没有一个完整清晰的思路,代码也不够清晰,实在是令人很不满意,还需多加努力啊!希望学习一段事件后能精简此代码!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值