C++ :

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
#include<math.h>
#define M(i,n,m) for(int i = n;i < m;i ++)
#define L(i,n,m) for(int i = n;i >= m;i --)
#define N(n,m) memset(n,m,sizeof(n));
const int MAX = 10010;

using namespace std;

int aa[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

int is(int i)
{
    if((i%4 == 0 && i % 100 != 0)||(i % 400 == 0))
        return 1;
    return 0;
}

int main()
{
    int a,b,c,x,y,z;
    while(~scanf("%d%d%d%d%d%d",&a,&b,&c,&x,&y,&z))
    {
        int sum;
        sum = (x - a) * 365;
        for(int i = a; i < x; i ++)
            if(is(i))
                ++ sum;
        int t = c;
        for(int i = 1; i < b; i ++)
            t += aa[i];
        if(is(a) && b > 2)
            t ++;
        sum -= t;
        t = z;
        for(int i = 1; i < y; i ++)
            t += aa[i];
        if(is(x) && y > 2)
            t ++;
        sum += t;
        printf("%d\n",sum);
    }
    return 0;
}