TJU : 3507 (Simple Date)



// http://acm.tju.edu.cn/toj/showp3507.html
// Tag : date

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>
#define INT_MAX 2147483647
#define INT_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL unsigned long long
using namespace std;

bool leap_year (int y)
{
    if ( y % 400 == 0 ) return true;
    if ( y % 100 == 0 ) return false;
    if ( y % 4 == 0 ) return true;
    return false;
}

int countDays (int y, int m, int d)
{
    int ret = 0;

    for ( int i = 1; i < y; i++ ) {
        if ( leap_year (i) ) ret += 366;
        else ret += 365;
    }

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

    for ( int i = 1; i < m; i++ )
        ret += days_in_months [i];

    ret += d;

    if ( leap_year(y) && m > 2 ) ret++;

    return ret;

}

int main ()
{
    int testCase;
    scanf ("%d", &testCase);

    while ( testCase-- ) {
        int year, month, day;
        scanf ("%d/%d/%d", &year, &month, &day);

        int num_days_year1 = countDays (year, month, day);

        scanf ("%d/%d/%d", &year, &month, &day);

        int num_days_year2 = countDays (year, month, day);

        printf ("%d\n", abs (num_days_year1 - num_days_year2));

    }

	return 0;
}

// @END_OF_SOURCE_CODE

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s