답안 #845342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845342 2023-09-06T13:14:05 Z vjudge1 Datum (COCI20_datum) C++17
50 / 50
24 ms 532 KB
#include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define int long long
using namespace std;

const int inf = 2e18 + 5;
const int N = 5e3 + 5;
const int mod = 998244353;

string rev(string a){
 reverse(a.begin(), a.end());
 return a;
}

int32_t main(){
  //freopen("in.txt","r", stdin);
  vector<int> m = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  vector<string> v;
  for(int i = 0; i <= 3112; i++){
    int bas1 = i/1000, bas2 = (i/100)%10, bas3 = (i/10)%10, bas4 = i%10;

    if(bas3 * 10 + bas4 <= 12 && bas3*10 + bas4 > 0){
        int ri = bas4 * 1000 + bas3*100 + bas2*10 + bas1;
        if(m[bas3 * 10 + bas4 - 1] + (bas3 * 10 + bas4 == 2 && ri%4 == 0 ? 1 : 0) >= bas1 * 10 + bas2 && bas1 + bas2 != 0){
            string a = "";
            a += (char)bas1 + '0';
            a += (char)bas2 + '0';
            a += (char)bas3 + '0';
            a += (char)bas4 + '0';

             string c = "";
             c += a[3];
             c += a[2];
             c += a[1];
             c += a[0];
             c += a[2];
             c += a[3];
             c += a[0];
             c += a[1];
            v.pb(c);
        }
    }
  }
  sort(v.begin(), v.end());

  int n;
  cin>>n;
  while(n--){
    string s;
    cin>>s;
    string ss = "";
    ss += s[6];
    ss += s[7];
    ss += s[8];
    ss += s[9];
    ss += s[3];
    ss += s[4];
    ss += s[0];
    ss += s[1];


    string oh;
    for(int i = 0; i < v.size(); i++){
        if(v[i] > ss){
            oh = v[i];
            break;
        }
    }

    cout<<oh[6]<<oh[7]<<"."<<oh[4]<<oh[5]<<"."<<oh.substr(0, 4)<<"."<<endl;
  }

  return 0;
}

Compilation message

datum.cpp: In function 'int32_t main()':
datum.cpp:64:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i = 0; i < v.size(); i++){
      |                    ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 24 ms 532 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 23 ms 480 KB Output is correct