結果

問題 No.2246 1333-like Number
ユーザー omgflakaomgflaka
提出日時 2023-03-17 21:35:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 48 ms / 2,000 ms
コード長 2,534 bytes
コンパイル時間 2,389 ms
コンパイル使用メモリ 205,640 KB
実行使用メモリ 4,348 KB
最終ジャッジ日時 2023-10-18 14:03:54
合計ジャッジ時間 3,534 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 48 ms
4,348 KB
testcase_05 AC 18 ms
4,348 KB
testcase_06 AC 24 ms
4,348 KB
testcase_07 AC 29 ms
4,348 KB
testcase_08 AC 5 ms
4,348 KB
testcase_09 AC 19 ms
4,348 KB
testcase_10 AC 5 ms
4,348 KB
testcase_11 AC 15 ms
4,348 KB
testcase_12 AC 2 ms
4,348 KB
testcase_13 AC 4 ms
4,348 KB
testcase_14 AC 6 ms
4,348 KB
testcase_15 AC 5 ms
4,348 KB
testcase_16 AC 10 ms
4,348 KB
testcase_17 AC 29 ms
4,348 KB
testcase_18 AC 3 ms
4,348 KB
testcase_19 AC 4 ms
4,348 KB
testcase_20 AC 41 ms
4,348 KB
testcase_21 AC 23 ms
4,348 KB
testcase_22 AC 12 ms
4,348 KB
testcase_23 AC 46 ms
4,348 KB
testcase_24 AC 38 ms
4,348 KB
testcase_25 AC 2 ms
4,348 KB
testcase_26 AC 48 ms
4,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int> 
#define vb vector<bool> 
#define pub push_back
#define emb emplace_back
#define rep(i,a,b) for(long long i = a; i < b; i++)
#define rrep(i,a,b) for(long long i = a; i >= b; i--)
#define iterm(key,val,ok) for(auto const& [key, val]:ok)
#define all(x) x.begin(),x.end()
#define py cout<<"YES"<<endl
#define pn cout<<"NO"<<endl
#define pa cout<<ans<<endl
#define pe cout<<endl
#define mp make_pair
#define f first 
#define se second 
using pii=pair<ll,ll>;
template<typename T>             istream& operator>>(istream& is, vector<T>& v) { for (auto& i : v) is >> i;        return is; }
template<typename T>             ostream& operator<<(ostream& os, const vector<T>& v) { for (auto& i : v) os << i << " "; return os; }
template<typename T>             istream& operator>>(istream& is, pair<T, T>& v) { is >> v.first >> v.second;        return is; }
template<typename T>             ostream& operator<<(ostream& os, const pair<T, T>& v) { os << v.first << " " << v.second; return os; }
 
 
 
/*
problems with mod or small constraints are DP (2d,3d) or combo
ascii: 1=49 a=97 A=65
check edge cases and constraints CHECK FOR JUST ONE ELEMENT OR SAME NUMBERS ETC
always think about reversing a process
see if theres any dumb tricks if youre not getting it: like only having to check small values or sth
(a-b)modm = (a%m+(m-b%m))%m
mark visited after adding to queue
think about transforming representations of graphs, if some graph is too big to be represented, think about bipartite
representation, if its too small maybe you can expand according to problem to make it easier
you can also bfs on pairs of nodes, different representations of nodes etc etc
lower bound can give beyond end also (check segfaults etc if using)
many smol vectors are slowwww, use std:array instead
to search for and remove particular things fastly just use multiset, like u can use prefix multiset and find closest
value of something also like so many applications in just logn time
*/

void solve(){
    ll n;cin>>n;
    vector<ll> arr;
    rep(i,1,10){
        rep(j,i+1,10){
            arr.pub(10*i+j);
        }
    }
    ll d=(n/36);
    ll f=(n%36);
    if(f==0){
        f=36;
        d--;
    }
    string s=to_string(arr[f-1]);
    rep(i,0,d){
        s=s+s[s.size()-1];
    }
    cout<<s<<endl;
}
 
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}
0