题解 | #打印日期#
打印日期
https://www.nowcoder.com/practice/b1f7a77416194fd3abd63737cdfcf82b
#include <iostream>
using namespace std;
int p[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int Run(int k)
{
if((k%400==0)||((k%4==0)&&(k%100!=0)))return 1;
else return 0;
}
int main() {
int y, n;
while (cin >> y >> n) {
if(Run(y)==1)p[2]=29;
else p[2]=28;
int m=1;
int d=0;
for(int i=1;i<=12;i++)
{
if(n-p[i]<0)
{
m=i;
d=n;
break;
}
else if(n-p[i]==0){
m=i;
d=p[i];
break;
}
n-=p[i];
}
cout<<y<<"-";
if(m/10==0)cout<<"0"<<m<<"-";
else cout<<m<<"-";
if(d/10==0)cout<<"0"<<d<<endl;
else cout<<d<<endl;
}
}
// 64 位输出请用 printf("%lld")

