第13届浙江省赛D题POJ3939

关注

原创最新推荐文章于 2026-07-24 13:16:49 发布 612 阅读 AI 写同款· GEO 优化 ›

USB3.0一致性测试方案为各测试项目具体测试结果包括脉冲串突发时间、脉冲串重复时间、时钟周期以及眼图等完整USB3.0测试项目，工程师可以看到各项测试的具体结果方便观察。RIGOL 提供了一套完善的工具，包括数字示波器、专业的测试夹具以及全自动一致性测试软件，使得USB 3.0设备设计人员能够高效精确地进行信号捕捉、测试与分析。报告第二部分测试摘要，在此可以看到USB3.0测试所有测试项目，并且可以观看到测试是否正常，可以帮助工程师更好的判断测试结果。，以简化下载、存储以及对于多媒体的大量内容的共享。阅读详情

/*
题目来源：13届浙江省大学生程序设计竞赛D题（ POJ3939http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3939）
作者：1412190214李建青
类型：模拟
题目描述：
Description
Edward, the headmaster of the Marjar University, is very busy every day and always forgets the date.

There was one day Edward suddenly found that if Monday was the 1st, 11th or 21st day of that month, he could remember the date clearly in that week. Therefore, he called such week "The Lucky Week".

But now Edward only remembers the date of his first Lucky Week because of the age-related memory loss, and he wants to know the date of the N-th Lucky Week. Can you help him?

Input
There are multiple test cases. The first line of input is an integer T indicating the number of test cases. For each test case:

The only line contains four integers Y, M, D and N (1 ≤ N ≤ 109) indicating the date (Y: year, M: month, D: day) of the Monday of the first Lucky Week and the Edward's query N.

The Monday of the first Lucky Week is between 1st Jan, 1753 and 31st Dec, 9999 (inclusive).

Output
For each case, print the date of the Monday of the N-th Lucky Week.

Sample Input
2
2016 4 11 2
2016 1 11 10
Sample Output
2016 7 11
2017 9 11

题目大意：定义一个Lucky Week为1号或者11号或者21号为周一的那周，求给定的Lucky Week后面（包含这周）第N个Lucky Week的日期
注意：这里每400年一次循环，一个循环有2058个Lucky Week

#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
int weekday(int y,int m,int d)
{


       int tm=m>=3?(m-2):(m+10);


       int ty=m>=3?y:(y-1);


       return (ty+ty/4-ty/100+ty/400+(int)(2.6*tm-0.2)+d)%7;
}
int preoperate()
{
int year,mon,da,cont=0;
for(year=1753;year<=1753+400;year++)
{
for(mon=1;mon<=12;mon++)
{
for(da=1;da<=21;da=da+10)
{
if(weekday(year,mon,da)==1)
cont++;
}
}
}
return cont;
}
void gotowhat(int y,int m,int d,int howmany)
{
int cont=howmany;
int year,mon,da;
year=y;
for(mon=m;mon<=12;mon++)
{
for(da=(mon==m?d:1);da<=21;da=da+10)
{
         int tag=weekday(year,mon,da);
if(tag==1)
cont--;
if(cont==0)
{
cout<<year<<" "<<mon<<" "<<da<<endl;
return ;
}
}
}
for(year=y+1;year<=y+500;year++)
{
for(mon=1;mon<=12;mon++)
{
for(da=1;da<=21;da=da+10)
{
       int tag=weekday(year,mon,da);
if(tag==1)
cont--;
if(cont==0)
{
cout<<year<<" "<<mon<<" "<<da<<endl;
return ;
}
}
}
}
}
int main()
{
int t,y,m,d,number,st,ts;
int oneturn=preoperate();
cin>>t;
while(t--)
{
cin>>y>>m>>d>>number;
st=number%2058;
ts=number/2058;
y+=400*ts;
                number=number-2058*ts;
gotowhat(y,m,d,number);
}
return 0;
}

收录于