# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341499 | A_D | Datum (COCI20_datum) | C++14 | 189 ms | 620 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
ID: antwand1
TASK: pprime
LANG: C++
*/
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define du long double
#define F first
#define S second
#define FOR(a,b) for(int a=1;a<=b;a++)
#define FORl(a,b) for(a=1;a<=b;a++)
#define FOR0(a,b) for(int a=1;a<b;a++)
#define FORl0(a,b) for(a=0;a<b;a++)
#define ii pair<int,int>
using namespace std;
int a[]={31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool ok(int v)
{
if(v%4==0)a[1]=29;
else a[1]=28;
string s;
while(v){
s+=(v%10)+'0';
v/=10;
}
while(s.size()<4){
s+='0';
}
// cout<<s<<" ";
int q=(s[2]-'0')*10+s[3]-'0';
// cout<<q<<" ";
int g=(s[0]-'0')*10+s[1]-'0';
//cout<<g<<endl;
if(q==0||q>12)return 0;
return g&&a[q]>=g;
}
void solve()
{
string s;
int cnt=0;
cin>>s;
int v=0;
for(int i=0;i<s.size();i++){
if(s[i]=='.'){
cnt++;
continue;
}
if(cnt==2){
v*=10;
v+=s[i]-'0';
}
}
// cout<<v<<endl;
v++;
while(!ok(v)){
if(v>9999)assert(0);
v++;
}
s="";
while(v){
s+=(v%10)+'0';
v/=10;
}
while(s.size()<4)s=s+'0';
string f=s;
reverse(f.begin(),f.end());
s+=f;
string ans;
for(int i=0;i<s.size();i++){
ans+=s[i];
if(i==1)ans+='.';
if(i==3)ans+='.';
}
ans+='.';
cout<<ans<<endl;
}
main()
{
int n;
cin>>n;
while(n--)solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |