Submission #7603

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <functional>

using namespace std;

bool uruu( int n )
{
	if ( !( n % 400 ) )
	{
		return true;
	}

	if ( !( n % 100 ) )
	{
		return false;
	}

	if ( !( n % 4 ) )
	{
		return true;
	}

	return false;
}

const int reg[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
const int uru[] = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };


int main()
{
	string buffer;

	cin >> buffer;

	for ( unsigned int i = 0; i < buffer.length(); i++ )
	{
		if ( buffer[i] == '/' )
		{
			buffer[i] = ' ';
		}
	}

	int y, m, d;

	istringstream( buffer ) >> y >> m >> d;

	int yi = y, mi = m, di = d;

	while ( true )
	{
		while ( true )
		{
			while ( true )
			{
				if ( !( yi % ( mi * di ) ) )
				{
					printf("%02d/%02d/%02d\n", yi, mi, di );
					return 0;
				}

				if ( uruu( y ) )
				{
					if ( di == uru[mi -1] )
					{
						di = 1;
						break;
					}
					else
					{
						di++;
					}
				}
				else
				{
					if ( di == reg[ mi - 1 ] )
					{
						di = 1;
						break;
					}
					else
					{
						di++;
					}
				}
			}

			if ( mi == 12 )
			{
				mi = 1;
				break;
			}
			else
			{
				mi++;
			}
		}

		yi++;
	}

	return 0;
}

Submission Info

Judge Result