# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
212266 |
2020-03-22T16:10:00 Z |
model_code |
Datum (COCI20_datum) |
C++17 |
|
35 ms |
384 KB |
#include <bits/stdc++.h>
using namespace std;
set<int> dates;
set<int>::iterator it;
int q;
string date;
int mj[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
bool palin(int y)
{
int day = (y % 10) * 10 + (y % 100) / 10;
int month = y / 1000 + ((y / 100) % 10) * 10;
return (day <= mj[month - 1] && day != 0 && month != 0 && month <= 12);
}
string ispis(int y)
{
string ret = "";
ret += (y % 10 + '0');
ret += (y / 10) % 10 + '0';
ret += ".";
ret += (y / 100) % 10 + '0';
ret += y / 1000 + '0';
ret += ".";
ret += (y / 1000) + '0';
ret += (y / 100) % 10 + '0';
ret += (y / 10) % 10 + '0';
ret += y % 10 + '0';
return ret;
}
bool kasnije(string a, string b)
{
int mja = (a[3]- '0') * 10 + a[4] - '0';
int mjb = (b[3]- '0') * 10 + b[4] - '0';
int daa = (a[0]- '0') * 10 + a[1] - '0';
int dab = (b[0]- '0') * 10 + b[1] - '0';
if(mja > mjb)
return true;
if(mja == mjb)
{
if(daa > dab)
return true;
return false;
}
return false;
}
int main()
{
for(int i = 1; i < 10000; i++)
if(palin(i))
dates.insert(i);
cin >> q;
while(q--)
{
cin >> date;
int year = (date[6] - '0') * 1000 + (date[7] - '0') * 100 + (date[8] - '0') * 10 + date[9] - '0';
if(dates.find(year) != dates.end())
{
string pal = ispis(year);
if(kasnije(pal, date))
cout << pal << "." << endl;
else
cout << ispis(*(dates.lower_bound(year + 1))) << "." << endl;
}
else
cout << ispis(*(dates.lower_bound(year))) << "." << endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
35 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
32 ms |
384 KB |
Output is correct |