ZOJ 3326 An Awful Problem

最新推荐文章于 2017-04-16 16:59:28 发布

c3090402188

最新推荐文章于 2017-04-16 16:59:28 发布

阅读量274

点赞数

本文链接：https://blog.csdn.net/c3090402188/article/details/5597686

版权

要细心。。。 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const bool day[32] = {0,0,1,1,0,1,0,1,0,0,0,1 ,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1}; const int yearnums[2] = {52,53}; const int monthnums[2][13] = { {0,0,9,11,0,11,0,11,0,0,0,10,0}, {0,0,10,11,0,11,0,11,0,0,0,10,0} }; int main ( ) { int t, y1, m1, d1, y2, m2, d2; while( EOF != scanf("%d", &t) ) { while(t--) { scanf("%d%d%d%d%d%d", &y1, &m1, &d1, &y2, &m2, &d2); int ans = 0; for(int i = y1 + 1; i < y2; i++) ans += yearnums[(i%4==0&&i%100!=0)||i%400==0]; if(y1 < y2) { for(int i = m1 + 1; i < 12; i++) ans += monthnums[(y1%4==0&&y1%100!=0)||y1%400==0][i]; for(int i = 2; i < m2; i++) ans += monthnums[(y2%4==0&&y2%100!=0)||y2%400==0][i]; int flag = 31; if(m1 == 2 ) { if((y1%4==0&&y1%100!=0)||y1%400==0) ans -= 1; else ans -= 2; } if(m1 == 11) ans--; if(day[m1]) for(int i = d1; i <= flag; i++) ans += day[i]; if(day[m2]) for(int i = 1; i <= d2; i++) ans += day[i]; } else { for(int i = m1 + 1; i < m2; i++) ans += monthnums[(y1%4==0&&y1%100!=0)||y1%400==0][i]; if(m1 < m2) { int flag = 31; if(m1 == 2 ) { if((y1%4==0&&y1%100!=0)||y1%400==0) ans -= 1; else ans -= 2; } if(m1 == 11) ans--; if(day[m1]) for(int i = d1; i <= flag; i++) ans += day[i]; if(day[m2]) for(int i = 1; i <= d2; i++) ans += day[i]; } else { if(day[m1]) for(int i = d1; i <= d2; i++) ans += day[i]; } } printf("%d/n",ans); } } return 0; }

c3090402188

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
2
评论
ZOJ 3326 An Awful Problem

要细心。。。#include #include #include #include #include #include #include #include #include #include #include #in
复制链接

扫一扫