201509-2-日期計算-ccf
阿新 • • 發佈:2018-11-14
題目:http://118.190.20.162/view.page?gpid=T31
解題思路:簡單模擬
#include<iostream> #include<cstdio> using namespace std; bool yun(int n){ if(n%4==0&&n%100!=0||n%400==0){ return true; } return false; } int main(){ int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int n,ds,days=0; cin>>n; cin>>ds; int k,day=0; if(yun(n)) m[2]++; for(int i=0;i<=12;i++){ days+=m[i]; if(ds<=days){ k=i; day=ds-(days-m[i]); break; } } cout<<k<<endl; cout<<day<<endl; return 0; }