当前位置: 首页 > news >正文

2020CSPS T1 儒略日题解

这是一道超级大模拟

前后调了差不多3个小时,要是考场上那就已经炸了

题意其实很简单,但是处理起来是真的麻烦

最后写了份特别丑的代码,A过去了

主要是特例判的恶心,总是会有1月0日的错误

这题一定要耐住性子做下来试试

#include <bits/stdc++.h>
using namespace std;
const long long day = 365;
const long long bound = 2299161;
const long long bound2 = 1721424;
vector<long long> month(13);
vector<long long> month2(13);
int main() {ios::sync_with_stdio(false);cin.tie(nullptr); month2[1] = 31;month2[2] = month2[1] + 29;month2[3] = month2[2] + 31;month2[4] = month2[3] + 30;month2[5] = month2[4] + 31;month2[6] = month2[5] + 30;month2[7] = month2[6] + 31;month2[8] = month2[7] + 31;month2[9] = month2[8] + 30;month2[10] = month2[9] + 31;month2[11] = month2[10] + 30;month2[12] = month2[11] + 31;month[1] = 31;month[2] = month[1] + 28;month[3] = month[2] + 31;month[4] = month[3] + 30;month[5] = month[4] + 31;month[6] = month[5] + 30;month[7] = month[6] + 31;month[8] = month[7] + 31;month[9] = month[8] + 30;month[10] = month[9] + 31;month[11] = month[10] + 30;month[12] = month[11] + 31;long long BY = 3 * day + day + 1;long long Q;cin>>Q;long long r;while(Q--) {cin>>r;r += 1;if(r <= bound) {if(r <= bound2) {long long y = (r / BY) * 4;r %= BY;if(r == 0) {y--;r += 366;}if(r <= 366) {long long x = lower_bound(month2.begin() + 1, month2.end(), r) - month2.begin();long long d = r - month2[x - 1];cout<<d<<" "<<x<<" "<<4713 - y<<" "<<"BC"<<"\n";}else {r -= 366;y += 1;y += r / 365;r %= 365;if(r == 0) {y--;r += 365;}long long x = lower_bound(month.begin() + 1, month.end(), r) - month.begin();long long d = r - month[x - 1];cout<<d<<" "<<x<<" "<<4713 - y<<" "<<"BC"<<"\n";}}else {r -= bound2;int flag = 1;if(r == 0) flag = 0;long long y = (r / BY) * 4;r %= BY;if(r == 0 && flag == 1) {y--;r += 366;cout<<31<<" "<<12<<" "<<1 + y<<"\n";}else {y += r / 365;if(r / 365 == 3) {r %= 365;if(r == 0) {y--;cout<<31<<" "<<12<<" "<<1 + y<<"\n";}else {long long x = lower_bound(month2.begin() + 1, month2.end(), r) - month2.begin();long long d = r - month2[x - 1];cout<<d<<" "<<x<<" "<<1 + y<<"\n";}}else if(r / 365 == 4) {y--;r = 365;long long x = lower_bound(month2.begin() + 1, month2.end(), r) - month2.begin();long long d = r - month2[x - 1];cout<<d<<" "<<x<<" "<<1 + y<<"\n";}else {r %= 365;if(r == 0 && flag) {y--;cout<<31<<" "<<12<<" "<<1 + y<<"\n";}else {long long x = lower_bound(month.begin() + 1, month.end(), r) - month.begin();long long d = r - month[x - 1];cout<<d<<" "<<x<<" "<<1 + y<<"\n";}}}}}else {r -= bound;if(r <= 78) {r += month[9] + 4;r += 10;long long x = lower_bound(month.begin() + 1, month.end(), r) - month.begin();long long d = r - month[x - 1];cout<<d<<" "<<x<<" "<<1582<<"\n";}else {r -= 78;long long year = 1583;if(r <= 6575) {if(r <= 365) {long long x = lower_bound(month.begin() + 1, month.end(), r) - month.begin();long long d = r - month[x - 1];cout<<d<<" "<<x<<" "<<1583<<"\n";}else {r -= 365;long long y = (r / BY) * 4;r %= BY;if(r == 0) {y--;r += 366;}if(r <= 366) {long long x = lower_bound(month2.begin() + 1, month2.end(), r) - month2.begin();long long d = r - month2[x - 1];cout<<d<<" "<<x<<" "<<y + 1584<<"\n";}else {r -= 366;y += 1;y += r / 365;r %= 365;if(r == 0) {y--;r += 365;}long long x = lower_bound(month.begin() + 1, month.end(), r) - month.begin();long long d = r - month[x - 1];cout<<d<<" "<<x<<" "<<1584 + y<<"\n";}}}else {r -= 6575;long long YY = BY * 100 - 3;long long y = (r / YY) * 400;r %= YY;if(r == 0) {y--;r += 366;}else {long long YYY = BY * 25 - 1;y += (r / YYY) * 100;r %= YYY;if(r == 0) {y--;r += 365;}else {y += (r / BY) * 4;r %= BY;if(r == 0) {y--;r += 366;}else {y += r / 365;if(r / 365 == 4) {y--;r -= 365 * 3;}else {r %= 365;if(r == 0) {y--;r += 365;}}}}}if((1601 + y) % 4 == 0 && (1601 + y) % 100 != 0) {long long x = lower_bound(month2.begin() + 1, month2.end(), r) - month2.begin();long long d = r - month2[x - 1];cout<<d<<" "<<x<<" "<<y + 1601<<"\n";}else if((1601 + y) % 400 == 0) {long long x = lower_bound(month2.begin() + 1, month2.end(), r) - month2.begin();long long d = r - month2[x - 1];cout<<d<<" "<<x<<" "<<y + 1601<<"\n";}else {long long x = lower_bound(month.begin() + 1, month.end(), r) - month.begin();long long d = r - month[x - 1];cout<<d<<" "<<x<<" "<<y + 1601<<"\n";}}}}}return 0;
}
http://www.hskmm.com/?act=detail&tid=25494

相关文章:

  • 调用百度AI接口实现网络图片中的文字识别
  • 英语_阅读_ChatGPT_待读
  • 实用指南:React 组件异常捕获机制详解
  • win11 为什么我的程序断网就转入导后台进程
  • 深入解析:AI与区块链:数据确权与模型共享的未来
  • 10.6阅读笔记
  • hetao 国庆
  • 详细介绍:运维 pgsql 安装完后某次启动不了
  • visual studio
  • [MCP] StreamableHTTPServer
  • 牛客 周赛109 20250924
  • 罗技G102螺丝型号
  • 详细介绍:深入剖析C#构造函数执行:基类调用、初始化顺序与访问控制
  • 英语_阅读_Let your baby go_待读
  • 第三章习题
  • 系统管理员的日常困境与幽默自嘲
  • AI数据标注平台获融资挑战行业巨头
  • 详细介绍:如何用 pnpm patch 给 element-plus 打补丁修复线上 bug(以 2.4.4 修复 PR#15197 为例)
  • Numericaltables1
  • ARC 207
  • 半年小结 Vol4. 跌跌撞撞开启 PhD 生涯
  • 深入解析:C++:内存管理
  • 大数求余
  • visual studio 无法打开文件
  • 基于MPPT算法的光伏并网发电系统simulink建模与仿真
  • 实用指南:【系统架构设计师】2025年上半年真题论文回忆版: 论系统负载均衡设计方法(包括解题思路和参考素材)
  • 软件版悟空博弈+WAUC构筑元人文演化之路研究报告——声明Ai研究
  • QBXT2025S刷题 Day5题
  • [KaibaMath1001] 关于∀ε0,|a-b|ε = a=b的证明
  • 基于Web的分布式图集管理系统架构设计与实践 - 教程