2023日期统计

#include <bits/stdc++.h>

int dfs(int sq[],int datesq[],int post1,int post2){//post1表示目前找到了seq的第几位，post2找到了datesq的第几位
    if(post2==8){
        return 1;
    }
    if(post1>=100){
        return 0;
    }
    if(sq[post1]==datesq[post2]){
        return dfs(sq,datesq,post1+1,post2+1);
    }
    else{
        return dfs(sq,datesq,post1+1,post2);
    }

}
int seq[100];
int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int main() {

    for(int i=0;i<100;i++){
        scanf("%d",&seq[i]);
    }
    int datesq[8]={2,0,2,3,0,0,0,0};
    int ans=0;
    for(int i=1;i<=12;i++){//月
        if(i<10){
            datesq[4]=0;
            datesq[5]=i;
        }
        else{
            datesq[4]=1;
            datesq[5]=i%10;
        }
        for(int j=1;j<=days[i];j++){//日
            if(j<10){
                datesq[6]=0;
                datesq[7]=j;
            }
            else{
                datesq[6]=j/10;
                datesq[7]=j%10;
            }
            ans+=dfs(seq,datesq,0,0);

        }
    }

    printf("%d",ans);
    return 0;
}