这道题逻辑不难，模拟真的很复杂，我写了一半就放弃了
#define _CRT_SECURE_NO_WARNINGS 1
#include<string>
#include <iostream>
#include <string>
#include <map>
#include<vector>
#include<cstdio>
#include<cstdlib>
using namespace std;
int n;
string s, t;
string str;
const int maxn=25;
int pos;
int num;
string ans;
struct crontab {
vector<int> minutes;
vector<int> hours;
vector<int> dayofmonth;//月份中的天数
vector<int> month;//月份
vector<int> dayofweek;//星期几
string command;
}cron[maxn];
map<string, string> mp;//日期字符串-》command的映射大全
map<string, int> mpmon;
map<string, int> mpweek;
void chushihua() {
mpmon["Jan"] = 1; mpmon["Feb"] = 2; mpmon["Mar"] = 3; mpmon["Apr"] = 4; mpmon["May"] = 5; mpmon["Jun"] = 6; mpmon["Jul"] = 7; mpmon["Aug"] = 8; mpmon["Sep"] = 9; mpmon["Oct"] = 10; mpmon["Nov"] = 11; mpmon["Dec"] = 12;
mpweek["Sun"] = 0; mpweek["Mon"] = 1; mpweek["Tue"] = 2; mpweek["Wed"] = 3; mpweek["Thu"] = 4; mpweek["Fri"] = 5; mpweek["Sat"] = 6;
}
vector<int> func(string str,int flag)//输入字符串，返回一串数字
{
vector<int> vec;
int temp;
temp = str.find("*");
if (str.find("*") !=-1)//说明所有的情况都有包括
{
if (flag == 1)//取值0-59
{
for (int i = 0; i <= 59; i++)
vec.push_back(i);
}
else if (flag == 2)
{
for (int i = 0; i <= 23; i++)
vec.push_back(i);
}
else if (flag == 3)
{
for (int i = 1; i <= 31; i++)
vec.push_back(i);
}
else if (flag == 4)
{
for (int i = 1; i <= 12; i++)
vec.push_back(i);
}
else
{
for (int i = 0; i <= 6; i++)
vec.push_back(i);
}
}
else if(str.find(",")!=-1||str.find("-")!=-1)//有逗号或者减号
{
//只考虑数字，没有字符串参与
temp = 0;
int mum = 0;
int left, right;
while (temp!=-1)
{
temp = str.find(",",temp+1);
vec.push_back(str[temp - 1] - '0');
}
while (mum != -1)
{
mum = str.find(",", mum + 1);
left=str[mum - 1] - '0';
right = str[mum + 1] - '0';
for (int i = left; i <= right; i++)
{
vec.push_back(i);
}
}
}
return vec;
}
string tostr(int num)//将一串数字变成字符
{
string tempstr;
tempstr[4]=num%
tempstr = a;
return tempstr;
}
int judge(int day,int ju)//查看day是否符和ju的星期标准，如果符和，则输出1，反之输出0；
{
}
int main()
{
scanf("%d",&n);
cin >> s >> t;
chushihua();
for (int i = 0; i < n; i++)
{
cin >> str;
cron[i].minutes = func(str,1);
cin >> str;
cron[i].hours = func(str,2);
cin >> str;
cron[i].dayofmonth= func(str,3);
cin >> str;
cron[i].month = func(str,4);
cin >> str;
cron[i].dayofweek = func(str,5);
cin >> str;
cron[i].command = str;
}
//下面构造mp映射大全
int times;
int day;
for (int i = 0; i < n; i++)
{
for (int k1 = 0; k1 < cron[i].minutes.size(); k1++)
{
for (int k2 = 0; k2 < cron[i].hours.size(); k2++)
{
times = cron[i].minutes[k1] + cron[i].hours[k2]*100;
for (int k3 = 0; k3 < cron[i].dayofmonth.size(); k3++)
{
for (int k4 = 0; k4 < cron[i].month.size(); k4++)
{
day = cron[i].dayofmonth[k3] + cron[i].month[k4];
for (int k5 = 0; k5 < cron[i].dayofweek.size(); k5++)
{
if (judge(day, cron[i].dayofweek[k5]))
{
mp[tostr(day) + tostr(times)] = cron[i].command;
}
}
}
}
}
}
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
char vMon[][4]={
"","jan","feb","mar","apr","may","jun","jul","aug","sep","oct","nov","dec"};
char vWek[][4]={
"sun","mon","tue","wed","thu","fri","sat"};
int mtharray[]={
0,31,28,31,30,31,30,31,31,30,31,30,31};
map<string,int> mMon,mWek;
map<string,vector<string> > mrt;
void buildMonAndWekMap()
{
for(int i=1;i<=12;++i) mMon[vMon[i]]=i;//月份
for(int i=0;i<=6;++i) mWek[vWek[i]]=i;//星期
}
string to_string_x(int n)//c++11 surport
{
stringstream ss;
ss<<n;
return ss.str();
}
int stoi_x(const string &str)//c++11 surport
{
int ans;
stringstream ss(str);
ss>>ans;
return ans;
}
void toStandard(string &str)//转化为标准小写
{
int len=str.size();
for(int i=0;i<len;++i)str[i]=tolower(str[i]);
}
vector<string> splitStringAndbuildVector(string &str,int TAG)//TAG=0(other),1(month),2(dayofweek);
{
str+=",";
vector<string> vret;
size_t found=str.find(",");
while(found!=string::npos)
{
string x=str.substr(0,found);
str=str.substr(found+1,str.size()-found-1);
size_t fdx=x.find("-");
if(fdx==string::npos)//非连续值
{
if(TAG==1&&isalpha(x[0])) x=to_string_x(mMon[x]);//是month英文缩写，转换为数字
if(TAG==2&&isalpha(x[0])) x=to_string_x(mWek[x]);//是day of week英文缩写，转换为数字
if(x.size()==1) x="0"+x;//添加0
vret.push_back(x);
}
else//连续值
{
string L=x.substr(0,fdx),R=x.substr(fdx+1,x.size()-fdx-1);
int left,right;
if(TAG==0) left=stoi_x(L),right=stoi_x(R);
else if(TAG==1)//month
{
left=(isalpha(L[0]))?mMon[L]:stoi_x(L);
right=(isalpha(R[0]))?mMon[R]:stoi_x(R);
}
else if(TAG==2)//day of week
{
left=(isalpha(L[0]))?mWek[L]:stoi_x(L);
right=(isalpha(R[0]))?mWek[R]:stoi_x(R);
}
while(left<=right)
{
string num=to_string_x(left);
if(num.size()==1)num="0"+num;
vret.push_back(num);
++left;
}
}
found=str.find(",");
}
return vret;
}
bool isleapyear(int y)
{
return (y%4==0&&y%100)||y%400==0;
}
string getWeekday(string year,string month,string day)
{
int y=stoi_x(year),m=stoi_x(month),d=stoi_x(day);
int by=1970,countday=0;
while(by<y)
{
countday+=(isleapyear(by))?366:365;
++by;
}
for(int i=1;i<m;++i) countday+=mtharray[i];
countday+=d-1;
return "0"+to_string_x((4+countday%7)%7);
}
int main()
{
int n;
string st,et;
buildMonAndWekMap();
cin>>n>>st>>et;
string syy=st.substr(0,4),smm=st.substr(4,2),sdd=st.substr(6,2),sHH=st.substr(8,2),sMM=st.substr(10,2);
string eyy=et.substr(0,4),emm=et.substr(4,2),edd=et.substr(6,2),eHH=et.substr(8,2),eMM=et.substr(10,2);
int syInt=stoi_x(syy),eyInt=stoi_x(eyy);
while(n--)
{
vector<string> vmts,vhur,vdfm,vmth,vdfw;
string minutes,hours,dofmon,month,dofwek,command;
cin>>minutes>>hours>>dofmon>>month>>dofwek>>command;
toStandard(month);//不区别大小写，转化为标准小写
toStandard(dofwek);//不区别大小写，转化为标准小写
if(minutes=="*") minutes="0-59";
vmts=splitStringAndbuildVector(minutes,0);//应该执行的分钟
if(hours=="*") hours="0-23";
vhur=splitStringAndbuildVector(hours,0); //应该执行的小时
if(dofmon=="*") dofmon="1-31";
vdfm=splitStringAndbuildVector(dofmon,0);//应该执行的日期
if(month=="*") month="1-12";
vmth=splitStringAndbuildVector(month,1);//应该执行的月份
if(dofwek=="*") dofwek="0-6";
vdfw=splitStringAndbuildVector(dofwek,2);//应该周几执行
set<string> wekexist;
for(size_t i=0;i<vdfw.size();++i) wekexist.insert(vdfw[i]);//更快的检索当前日期（dayofweek）是不是应该执行
int curyear=syInt;//从开始年份执行
while(curyear<=eyInt)
{
if(isleapyear(curyear)) mtharray[2]=29;//leapyear的2月份应该是29天
else mtharray[2]=28;
string year=to_string_x(curyear);//年份
for(size_t mi=0;mi<vmth.size();mi++)//month
{
string curm=vmth[mi];//当前月份
for(size_t di=0;di<vdfm.size();di++)//day of month
{
string curd=vdfm[di];//当前日期
string wd=getWeekday(year,curm,curd);//该年，该月，该日是星期几
if(wekexist.count(wd)==0||stoi_x(curd)>mtharray[stoi_x(curm)])continue;
//命令行中不包含该星期或者当前天数超过当前月份的应有天数时
for(size_t Hi=0;Hi<vhur.size();++Hi)//hour
{
for(size_t Mi=0;Mi<vmts.size();++Mi)//minutes
{
string datetime=year+curm+curd+vhur[Hi]+vmts[Mi];
if(datetime>=st&&datetime<et) mrt[datetime].push_back(command);//在当前日期时间内
}
}
}
}
++curyear;//进入下一年
}
}
for(map<string,vector<string> >::iterator it=mrt.begin();it!=mrt.end();++it)
{
map<string,int> isprt;
for(size_t i=0;i<it->second.size();++i)
{
string dis=it->first+" "+it->second[i];
if(isprt.count(dis)==0)
{
cout<<dis<<endl;
isprt[dis]=1;
}
}
}
return 0;
}