链接地址:

Poj:http://poj.org/problem?id=1044

OpenJudge:http://bailian.openjudge.cn/practice/1044/

题目:

总时间限制:
1000ms
内存限制:
65536kB
描述
There are rumors that there are a lot of computers having a problem with the year 2000. As they use only two digits to represent the year, the date will suddenly turn from 1999 to 1900. In fact, there are also many other, similar problems. On some systems, a 32-bit integer is used to store the number of seconds that have elapsed since a certain fixed date. In this
way, when 2^32 seconds (about 136 Years) have elapsed, the date will jump back to whatever the fixed date is.
Now,
what can you do about all that mess? Imagine you have two computers C1
and C with two different bugs: One with the ordinary Y2K-Bug (i. e.
switching to a1 := 1900 instead of b1 := 2000) and one switching to a2
:= 1904 instead of b2 := 2040. Imagine that the C1 displays the year y1
:= 1941 and C2 the year y2 := 2005. Then you know the following
(assuming that there are no other bugs): the real year can't be 1941,
since, then, both computers would show the (same) right date. If the
year would be 2005, y1 would be 1905, so this is impossible, too.
Looking only at C1 , we know that the real year is one of the following:
1941, 2041, 2141, etc. We now can calculate what C2 would display in
these years: 1941, 1905, 2005, etc. So in fact, it is possible that the
actual year is 2141.
To calculate all this manually is a lot of
work. (And you don't really want to do it each time you forgot the
actual year.) So, your task is to write a program which does the
calculation for you: find the first possible real year, knowing what
some other computers say (yi) and knowing their bugs (switching to ai
instead of bi ). Note that the year ai is definitely not after the year
the computer was built. Since the actual year can't be before the year
the computers were built, the year your program is looking for can't be
before any ai .
输入
The input file contains several test cases, in which the actual
year has to be calculated. The description of each case starts with a
line containing an integer n (1 <= n <= 20), the number of
computers. Then, there is one line containing three integers yi,ai,bi
for each computer (0 <= ai <= yi < bi < 10000). yi is the
year the computer displays, bi is the year in which the bug happens (i.
e. the first year which can't be displayed by this computer) and ai is
the year that the computer displays instead of bi .
The input is terminated by a test case with n = 0. It should not be processed.
输出
For each test case, output output the line "Case #k:", where k is
the number of the situation. Then, output the line "The actual year is
z.", where z is the smallest possible year (satisfying all computers and
being greater or equal to u). If there is no such year less than 10000,
output "Unkown bugs detected.". Output a blank line after each case.
样例输入
2
1941 1900 2000
2005 1904 2040
2
1998 1900 2000
1999 1900 2000
0
样例输出
Case #1:
The actual year is 2141. Case #2:
Unknown bugs detected.
来源
Mid-Central European Regional Contest 1999

思路:

水题,简单遍历

代码:

 #include <iostream>
#include <cstdio>
using namespace std; int main()
{
int n,i;
int count = ;
int temp_y;
scanf("%d",&n);
while(n!=)
{ int *arr_a = new int[n];
int *arr_b = new int[n];
int *arr_y = new int[n]; for(i =; i < n; i++) scanf("%d%d%d",&arr_y[i],&arr_a[i],&arr_b[i]);
temp_y = arr_y[];
while(temp_y < )
{
for(i = ;i < n; i++)
{
if((temp_y < arr_y[i]) || (temp_y - arr_y[i]) % (arr_b[i] - arr_a[i]) != ) break;
}
if(i >= n) break;
temp_y = temp_y + (arr_b[] - arr_a[]);
}
if(temp_y < ) printf("Case #%d: \nThe actual year is %d.\n",++count,temp_y);
else printf("Case #%d:\nUnknown bugs detected.\n",++count);
printf("\n"); delete [] arr_a;
delete [] arr_b;
delete [] arr_y; scanf("%d",&n);
}
return ;
}

OpenJudge / Poj 1044 Date bugs C++的更多相关文章

  1. POJ 1044: Date bugs

    题目描述 There are rumors that there are a lot of computers having a problem with the year 2000. As they ...

  2. POJ1044 Date bugs

    题目来源:http://poj.org/problem?id=1044 题目大意: 与众所周知的”千年虫“类似,某些计算机上存在日期记录的bug.它们的时钟有一个年份周期,每当到达最大值时,就会自动跳 ...

  3. OpenJudge / Poj 2141 Message Decowding

    1.链接地址: http://poj.org/problem?id=2141 http://bailian.openjudge.cn/practice/2141/ 2.题目: Message Deco ...

  4. OpenJudge/Poj 2105 IP Address

    1.链接地址: http://poj.org/problem?id=2105 http://bailian.openjudge.cn/practice/2105 2.题目: IP Address Ti ...

  5. OpenJudge/Poj 2027 No Brainer

    1.链接地址: http://bailian.openjudge.cn/practice/2027 http://poj.org/problem?id=2027 2.题目: 总Time Limit: ...

  6. OpenJudge/Poj 2013 Symmetric Order

    1.链接地址: http://bailian.openjudge.cn/practice/2013 http://poj.org/problem?id=2013 2.题目: Symmetric Ord ...

  7. OpenJudge/Poj 1088 滑雪

    1.链接地址: bailian.openjudge.cn/practice/1088 http://poj.org/problem?id=1088 2.题目: 总Time Limit: 1000ms ...

  8. OpenJudge/Poj 2001 Shortest Prefixes

    1.链接地址: http://bailian.openjudge.cn/practice/2001 http://poj.org/problem?id=2001 2.题目: Shortest Pref ...

  9. OpenJudge/Poj 2000 Gold Coins

    1.链接地址: http://bailian.openjudge.cn/practice/2000 http://poj.org/problem?id=2000 2.题目: 总Time Limit: ...

随机推荐

  1. sqlite3使用教程1 SQLite 命令

    http://www.runoob.com/sqlite/sqlite-commands.html 本章将向您讲解 SQLite 编程人员所使用的简单却有用的命令.这些命令被称为 SQLite 的点命 ...

  2. IOS UILabel自动换行

    { UILabel *lb=[[UILabel alloc]initWithFrame:CGRectMake(offset_xx, offset_yy, , )]; [lb setText:@&quo ...

  3. 把sublime添加到右键菜单(转)

    sublime text是前端利器,为了方便,我们把它加入到win7系统的右键菜单(xp不支持) 保存为bat文件,放入sublimetext安装文件夹与sublime_text同级,双击执行即可. ...

  4. SQL索引详解

    转自:http://www.cnblogs.com/AK2012/archive/2013/01/04/2844283.html SQL索引在数据库优化中占有一个非常大的比例, 一个好的索引的设计,可 ...

  5. 计算机思维or人的思维

    计算机领域就会有计算机领域的一些特性和一些思维方式,或者说有他自己的一些问题,须要用相应的思维方式来进行理解它,从而更好的驾驭他.有些时候遇到的一些问题,自己想却想不明确,也是由于我们没有把自己当做一 ...

  6. 17周 oj 比較大小 类模板

    /*声明一个类模板,利用它分别实现两个整数. 浮点数和字符的比較,求出大数和小数. 说明:在类模板外定义各成员函数. 输入两个整数.两个浮点数和两个字符 从大到小输出两个整数.两个浮点数和两个字符 * ...

  7. 【shell】while read line 与for循环的区别

    http://m.blog.itpub.net/22664653/viewspace-1175858/

  8. window.top、window.parent

    iframe和frameset中可能会用到window.parent.window.top 其中window.parent是相对于打开子页面的当前js所在页面的层级: 例如:a页面中包含一个ifram ...

  9. Pitfalls of the Hibernate Second-Level / Query Caches--reference

    This post will go through how to setup the Hibernate Second-Level and Query caches, how they work an ...

  10. ubuntu 13.04 root权限设置方法详解

    很多朋友安装升级Ubuntu 13.04之后不知道ubuntu 13.04 root权限设置的具体方法,今天这篇文章就将为大家详细介绍设置root权限的步骤,新手朋友可以来看一看哦~ Ubunto 1 ...