# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
502421 |
2022-01-05T22:58:31 Z |
inksamurai |
Datum (COCI20_datum) |
C++17 |
|
30 ms |
396 KB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
void print(){
cout<<"\n";
}
template<class te,class ...ti>
void print(const te&v, const ti&...nv) {
cout<<v;
if(sizeof...(nv)){
cout<<" ";
print(nv...);
}
}
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;
const int inf=1e9;
const int valid[]={0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
void slv(){
int od,om,oy;
char ch;
cin>>od>>ch>>om>>ch>>oy>>ch;
int y=oy;
while(true){
int d=(y%10)*10+(y%100)/10;
int m=((y%1000)/100)*10+((y%10000)/1000);
if(min(m,d) and m<=12
and d<=valid[m]+(m==2
and y%4==0?1:0)
and (y>oy or m>om or (m==om and d>od))){
if(d<10) printf("0");
printf("%d",d);
printf(".");
if(m<10) printf("0");
printf("%d",m);
printf(".");
if(y<1000) printf("0");
if(y<100) printf("0");
if(y<10) printf("0");
printf("%d",y);
printf(".\n");
break;
}
y++;
}
}
int main(){
_3qplfh5;
int t=0;
cin>>t;
rep(cs,t)
slv();
//
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
29 ms |
396 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
30 ms |
332 KB |
Output is correct |