| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 50399 | jiabokai | 【例82.1】不吉利日期 | C++ | No Test Data | 0 MS | 0 KB | 301 | 2024-08-21 18:25:22 |
#include<bits/stdc++.h> using namespace std; int main(){ int d[365],n; int m[12]={12,43,71,102,132,163,193,224,255,285,316,346} ; cin>>n; for(int i=0;i<365;i++){ d[i]=n; if(n==7){ n=1; }else{ n++; } } for(int i=0;i<12;i++){ if(d[m[i]]==5) cout<<i+1<<endl; } }