zoukankan      html  css  js  c++  java
  • 判断时间段内有几个休息期

    declare   @b   datetime,@e   datetime  
      set   @b   =   '2003-12-20'  
      set   @e   =   '2004-01-21'  
       
      select   datediff(week,@b,@e)  
      ,datediff(week,@b,@e)   +   case   when   datepart(weekday,@b)   >   1   then   0   else   1   end   -   case   when   datepart(weekday,@e)   >=   1   then   0   else   1   end   as   周日数  
      ,datediff(week,@b,@e)   +   case   when   datepart(weekday,@b)   >   2   then   0   else   1   end   -   case   when   datepart(weekday,@e)   >=   2   then   0   else   1   end   as   周一数  
      ,datediff(week,@b,@e)   +   case   when   datepart(weekday,@b)   >   3   then   0   else   1   end   -   case   when   datepart(weekday,@e)   >=   3   then   0   else   1   end   as   周二数  
      ,datediff(week,@b,@e)   +   case   when   datepart(weekday,@b)   >   4   then   0   else   1   end   -   case   when   datepart(weekday,@e)   >=   4   then   0   else   1   end   as   周三数  
      ,datediff(week,@b,@e)   +   case   when   datepart(weekday,@b)   >   5   then   0   else   1   end   -   case   when   datepart(weekday,@e)   >=   5   then   0   else   1   end   as   周四数  
      ,datediff(week,@b,@e)   +   case   when   datepart(weekday,@b)   >   6   then   0   else   1   end   -   case   when   datepart(weekday,@e)   >=   6   then   0   else   1   end   as   周五数  
      ,datediff(week,@b,@e)   +   case   when   datepart(weekday,@b)   >   7   then   0   else   1   end   -   case   when   datepart(weekday,@e)   >=   7   then   0   else   1   end   as   周六数  
  • 相关阅读:
    CF961E Tufurama 主席树
    [BZOJ3638 && BZOJ3272]带修区间不相交最大K子段和(线段树模拟费用流)
    [BZOJ5294][BJOI2018]二进制(线段树)
    [BZOJ5293][BJOI2018]求和(倍增)
    [BZOJ5306][HAOI2018]染色(容斥+FFT)
    [BZOJ5303][HAOI2018]反色游戏(Tarjan)
    [CF1053C]Putting Boxes Together(线段树)
    整体二分
    JSOI2018R2题解
    LCT维护子树信息
  • 原文地址:https://www.cnblogs.com/jcomet/p/1590863.html
Copyright © 2011-2022 走看看