稍微能用

#include<bits/stdc++.h>
using namespace std;
int qwq(int a)
{
    int s=0;
    while(a!=0){
        s+=a%10;
        a/=10;
    }
    return s;
}
bool awa(int y)
{
	if(y%4==0&&y%100!=0||y%400==0)
		return 1;
	return 0;
	
}
int pwp(int y,int m)
{
	int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
	if(awa(y)&&m==2) return 29;
	return a[m];
}
int main()
{
	bool used[100]={0};
	int y1,y2,m1,m2,d1,d2,count=0;
	cin>>y1>>m1>>d1>>y2>>m2>>d2;
	int y=y1,m=m1,d=d1;
	while(y<y2||y==y2&&m<m2||y==y2&&m==m2&&d<=d2){
		int s=0;
		s=qwq(y)+qwq(m)+qwq(d);
		if(used[s]==0){
			count++;
			used[s]=1;
		}
		d++;
		if(d>pwp(y,m)){
			d=1;
			m++;
			if(m>12){
				m=1;
				y++;
			}
		}
	}
	cout<<count;
    return 0;
}