1032 - Intersecting Dates
A research group is developing a computer program that will fetch historical stock market quotes from a service that charges a fixed fee for each day's quotes that it delivers. The group has examined the collection of previously-requested quotes and discovered a lot of duplication, resulting in wasted money. So the new program will maintain a list of all past quotes requested by members of the group. When additional quotes are required, only quotes for those dates not previously obtained will be fetched from the service, thus minimizing the cost.
You are to write a program that d etermines when new quotes are required. Input for the program consists of the date ranges for which quotes have been requested in the past and the date ranges for which quotes are required. The program will then determine the date ranges for which quotes must be fetched from the service.
Input
There will be multiple input cases. The input for each case begins with two non-negative integers NX and NR , ( 0NX, NR100 ). NX is the number of existing date ranges for quotes requested in the past. NR is the number of date ranges in the incoming requests for quotes. Following these are NX + NR pairs of dates. The first date in each pair will be less than or equal to the second date in the pair. The first NX pairs specify the date ranges of quotes which have been requested and obtained in the past, and the next NR pairs specify the date ranges for which quotes are required.
Two zeroes will follow the input data for the last case.
Each input date will be given in the form YYYYMMDD. YYYY is the year (1700 to 2100), MM is the month (01 to 12), and DD is the day (in the allowed range for the given month and year). Recall that months 04, 06, 09, and 11 have 30 days, months 01, 03, 05, 07, 08, 10, and 12 have 31 days, and month 02 has 28 days except in leap years, when it has 29 days. A year is a leap year if it is evenly divisible by 4 and is not a century year (a multiple of 100), or if it is divisible by 400.
Output
For each input case, display the case number (1, 2, ...) followed by a list of any date ranges for which quotes must be fetched from the service, one date range per output line. Use the American date format shown in the sample output below. Explicitly indicate (as shown) if no additional quotes must be fetched. If two date ranges are contiguous or overlap, then merge them into a single date range. If a date range consists of a single date, print it as a single date, not as a range consisting of two identical dates. Display the date ranges in chronological order, starting with the earliest date range.
Sample Input
1 1
19900101 19901231
19901201 20000131
0 3
19720101 19720131
19720201 19720228
19720301 19720301
1 1
20010101 20011231
20010515 20010901
0 0
Sample Output
Case 1:
1/1/1991 to 1/31/2000 Case 2:
1/1/1972 to 2/28/1972
3/1/1972 Case 3:
No additional quotes are required.
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int n,m,i,j,a,b,cases,no_quotes,st[101],ed[101];
int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
char c[147000];
int leap(int y)
{
return y%400==0||y%4==0&&y%100;
} void get_date(int day)
{
int y,m;
for(y=1700;day>365+leap(y);y++)
day-=365+leap(y);
for(m=1;day>days[m]+(m==2&&leap(y));m++)
day-=days[m]+(m==2&&leap(y));
printf("%d/%d/%d",m,day,y);
} int f(int x)
{
int i,tmp,sum;
tmp=x/10000;
sum=0;
for(i=1700;i<tmp;i++)
{
sum+=365;
if(leap(i))
sum++;
}
tmp=x%10000/100;
for(i=1;i<tmp;i++)
{
sum+=days[i];
if(i==2&&leap(x/10000))
sum++;
}
return sum+x%100;
} void fill(int a,int b,int x)
{
int fa,fb;
fa=f(a);
fb=f(b);
memset(&c[fa],x,fb-fa+1);
} int main()
{
while(scanf("%d%d",&n,&m)&&n+m)
{
if(cases)
printf("\n");
memset(c,0,sizeof(c));
for(i=0;i<n;i++)
scanf("%d%d",&st[i],&ed[i]);
for(i=0;i<m;i++)
{
scanf("%d%d",&a,&b);
fill(a,b,2);
}
for(i=0;i<n;i++)
fill(st[i],ed[i],1);
printf("Case %d:\n",++cases);
no_quotes=1;
for(i=0;i<147000;i++)
if(c[i]>1)
{
no_quotes=0;
printf(" ");
get_date(i);
if(c[i+1]<2)
printf("\n");
else
{
printf(" to ");
for(j=i;c[j]>1;j++);
get_date(j-1);
printf("\n");
i=j;
}
}
if(no_quotes)
printf(" No additional quotes are required.\n");
}
return 0;
}
1032 - Intersecting Dates的更多相关文章
- sqlservr (708) 打开日志文件 C:\Windows\system32\LogFiles\Sum\Api.log 时出现错误 -1032 (0xfffffbf8)
在windows server 2012 standard上新安装好的SQL Server 2014,查看错误日志,发现此报错 sqlservr (708) 打开日志文件 C:\Windows\sys ...
- Light OJ 1032 - Fast Bit Calculations(数学)
题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1032 题目大意:一个十进制数变化为二进制,那么对于这个数,如果连着两个二进制位 ...
- 1032: [JSOI2007]祖码Zuma
链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1032 Description 这是一个流行在Jsoi的游戏,名称为祖玛.精致细腻的背景,外加神 ...
- 解剖SQLSERVER 第四篇 OrcaMDF里对dates类型数据的解析(译)
解剖SQLSERVER 第四篇 OrcaMDF里对dates类型数据的解析(译) http://improve.dk/parsing-dates-in-orcamdf/ 在SQLSERVER里面有几 ...
- loj 1032 数位dp
题目链接:http://lightoj.com/volume_showproblem.php?problem=1032 思路:数位dp, 采用记忆化搜索, dp[pos][pre][have] 表示 ...
- PAT乙级 1032. 挖掘机技术哪家强(20)
1032. 挖掘机技术哪家强(20) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue 为了用事实说明挖掘机技术到底 ...
- [MySQL] SQL_ERROR 1032解决办法
一.缘由: 在主主同步的测试环境,由于业务侧没有遵循同一时间只写一个点的原则,造成A库上删除了一条数据,B库上在同时更新这条数据. 由于异步和网络延时,B的更新event先到达A端执行,造成A端找不到 ...
- 1032 - A-B 组合数学
http://www.ifrog.cc/acm/problem/1032 1032 - A-B Time Limit:1s Memory Limit:128MByte Submissions:680S ...
- POJ 1269 Intersecting Lines --计算几何
题意: 二维平面,给两条线段,判断形成的直线是否重合,或是相交于一点,或是不相交. 解法: 简单几何. 重合: 叉积为0,且一条线段的一个端点到另一条直线的距离为0 不相交: 不满足重合的情况下叉积为 ...
随机推荐
- Python中类的运算符重载
这篇文章仅仅是总结性质的,待以后有时间的时候会针对比较难理解的部分补充一些例子. 构造和析构 __init__ __del__ 函数调用 __call__ 打印操作 __str__ __repr__ ...
- PHP练习题(二)
程序6.题目: 假设某人有100,000现金,每经过一次路口需要进行一次交费交费规则为当他现金大于50,000时每次需要交%5,如果现金小于等于50,000时每次交5,000.问此人可以经过多少次这个 ...
- java.lang.NullPointerException: Attempt to invoke virtual method 'void 、Handler.removeMessages(int)' on a null object reference
onDestory进行释放Handler时,需要判断null if(null != mHandler) { mHandler.removeMessages(MSG_CHANGE ...
- JQuery自学代码---(一)
/** * Created by wyl on 15-3-4. */ //Jquery是一个JavaScrioe库,它极大的简化了JavaScript编程 $(document).ready(func ...
- 偶尔转帖:AI会议的总结(by南大周志华)
偶尔转帖:AI会议的总结(by南大周志华) 说明: 纯属个人看法, 仅供参考. tier-1的列得较全, tier-2的不太全, tier-3的很不全. 同分的按字母序排列. 不很严谨地说, tier ...
- Spring 使用外部部署文件
1.导入属性文件: <context:property-placeholder location="classpath:db.properties"/> 2.使用外部化 ...
- 【良心noip膜你赛】总结
一点都不良心!!!! AK 快乐爆零快乐!!! 1. A. value512mb 1s规定一个区间的价值为这个区间中所有数 and 起来的值与这个区间所有数 or 起来的值的乘积.例如 3 个数 2, ...
- Leetcode解题思想总结篇:双指针
Leetcode解题思想总结篇:双指针 1概念 双指针:快慢指针. 快指针在每一步走的步长要比慢指针一步走的步长要多.快指针通常的步速是慢指针的2倍. 在循环中的指针移动通常为: faster = f ...
- 【原创】如何构建MIPS交叉编译工具链
运行环境:Ubuntu12.04PC提前安装库:flex,bison,libncureses5-dev,texinfo,这些库提前apt-get install.需要重新安装:gawk(先apt-ge ...
- Uncompressing Linux___ done, booting the kernel_tekkamanninja-ChinaUnix博客
今天用主线Linux内核移植到MINI6410,主线内核2.6.37.1基本已经支持了MINI6410的板子,所以移植到能够启动起来的阶段很简单,但是在移植的时候还是出现了一个比较常见的问题: MIN ...