zoukankan      html  css  js  c++  java
  • 杭电2133What day is it

    给你个日期 问是星期几        知道1 1 1是周1就行了

    #include <iostream>
    #include <cstdio>
    using namespace std;
    int arr[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
    char str[7][100] = {"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
    bool run(int x);
    int main()
    {
        int a,b,c,i,j,sum = 0;
        int Y = 2007,M = 11,D = 17,R = 6;
        for(i =0; i < 2007; ++i)
            if(run(i))
        while(scanf("%d%d%d",&a,&b,&c) != EOF)
        {
            long long sum = 0;
            if(b == 0 || c == 0 || (b == 2 && c > 29 && run(a)) || (b == 2 && c > 28 && !run(a)) || (c > arr[b] && b != 2) )
            {
                cout << "illegal" << endl;
                continue;
            }
            for(i = 1; i < a; ++i)
            {
                if(run(i)) sum += 366;
                else sum += 365;
            }
            for(i = 1; i <= b-1; ++i)
            {
                sum += arr[i];
            }
            if(run(a) && b > 2)
                sum ++;
            sum += c;
            sum= sum%7;
    //        if(!sum) sum = 7;
            cout << str[sum] << endl;
        }
    }
    bool run(int x)
    {
        if((x % 4 == 0 && x % 100 != 0)|| x%400 == 0)
            return true;
        else
            return false;
    }

  • 相关阅读:
    P1265 公路修建 最小生成树
    P1991 无线通讯网 最小生成树
    Stock Chase 拓扑
    Rank of Tetris 拓扑排序+并查集
    P1169 [ZJOI2007]棋盘制作 DP悬线法
    P4147 玉蟾宫 二维DP 悬线法
    P1341 无序字母对 欧拉回路
    P2921 [USACO08DEC]在农场万圣节Trick or Treat on the Farm 记忆化搜索dfs
    BSTestRunner插件的用法.py
    Selenium
  • 原文地址:https://www.cnblogs.com/mltang/p/8695564.html
Copyright © 2011-2022 走看看