結果
問題 | No.2246 1333-like Number |
ユーザー |
|
提出日時 | 2023-03-17 21:35:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 20 ms / 2,000 ms |
コード長 | 2,534 bytes |
コンパイル時間 | 2,068 ms |
コンパイル使用メモリ | 198,072 KB |
最終ジャッジ日時 | 2025-02-11 12:41:05 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#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 secondusing 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 comboascii: 1=49 a=97 A=65check edge cases and constraints CHECK FOR JUST ONE ELEMENT OR SAME NUMBERS ETCalways think about reversing a processsee 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))%mmark visited after adding to queuethink about transforming representations of graphs, if some graph is too big to be represented, think about bipartiterepresentation, if its too small maybe you can expand according to problem to make it easieryou can also bfs on pairs of nodes, different representations of nodes etc etclower bound can give beyond end also (check segfaults etc if using)many smol vectors are slowwww, use std:array insteadto search for and remove particular things fastly just use multiset, like u can use prefix multiset and find closestvalue 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();}}