Submission #73045227
Source Code Expand
#if !__INCLUDE_LEVEL__
#include __FILE__
int main(){
int n;
cin >> n;
if(n%111==0){
Yes;
}else{
No;
}
}
#else
#include <bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
#define rep(i, x, limit) for (ll i = (ll)x; i < (ll)limit; i++)
#define REP(i, x, limit) for (ll i = (ll)x; i <= (ll)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template<typename T1, typename T2>
std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){
os << "{" << p.first << "," << p.second << "}";
return os;
}
// 配列の要素を空白区切りで出力 第二引数をtrueにすると改行区切り
template<typename T> inline void print_vec(const vector<T> &v, bool split_line=false) {
if(v.empty()){
cout << "This vector is empty." << el;
return;
}
constexpr bool isValue = is_integral<T>::value;
for (int i = 0; i < (int)v.size(); i++) {
if constexpr(isValue){
if((v[i]==inf) || (v[i]==infl)) cout << 'x' << " \n"[split_line];
else cout << v[i] << " \n"[split_line || i+1==(int)v.size()];
}else cout << v[i] << " \n"[split_line || i+1==(int)v.size()];
}
}
template<typename T1, typename T2> inline void print_vec(const vector<pair<T1,T2>> &v, bool split_line=false){
if(v.empty()){
cout << "This vector is empty." << el;
return;
}
for(int i = 0; i < (int)v.size(); i++){
cout << '{';
auto [a,b] = v[i];
constexpr pair<bool,bool> isValue = {is_integral<T1>::value, is_integral<T2>::value};
if constexpr(isValue.first){
if(a==inf || a==infl) cout << "x,";
else cout << a << ",";
}else cout << a << ",";
if constexpr(isValue.second){
if(b==inf || b==infl) cout << "x,";
else cout << b;
}else cout << b;
cout << "}" << " \n"[split_line || i+1==(int)v.size()];
}
}
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
bool compare = a < b;
if(compare) a = b;
return compare;
}
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
bool compare = a > b;
if(compare) a = b;
return compare;
}
// std::chronoを利用した時間計測用クラス
class Timer{
chrono::system_clock::time_point start;
public:
Timer() : start(chrono::system_clock::now()) {}
double count(){
chrono::duration<double> Time_ = chrono::system_clock::now() - start;
return Time_.count();
}
bool is_under(double x){
return (this -> count()) < x;
}
};
#endif
Submission Info
| Submission Time |
|
| Task |
A - Repdigit |
| User |
xX0Mame0Xx |
| Language |
C++23 (GCC 15.2.0) |
| Score |
100 |
| Code Size |
3427 Byte |
| Status |
AC |
| Exec Time |
1 ms |
| Memory |
3668 KiB |
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
100 / 100 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
0_sample_1.txt, 0_sample_2.txt, 0_sample_3.txt |
| All |
0_sample_1.txt, 0_sample_2.txt, 0_sample_3.txt, 1_1.txt, 2_1.txt, 2_2.txt, 2_3.txt, 2_4.txt, 3_1.txt, 3_2.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 0_sample_1.txt |
AC |
1 ms |
3668 KiB |
| 0_sample_2.txt |
AC |
1 ms |
3616 KiB |
| 0_sample_3.txt |
AC |
1 ms |
3508 KiB |
| 1_1.txt |
AC |
1 ms |
3604 KiB |
| 2_1.txt |
AC |
1 ms |
3616 KiB |
| 2_2.txt |
AC |
1 ms |
3472 KiB |
| 2_3.txt |
AC |
1 ms |
3508 KiB |
| 2_4.txt |
AC |
1 ms |
3548 KiB |
| 3_1.txt |
AC |
1 ms |
3548 KiB |
| 3_2.txt |
AC |
1 ms |
3564 KiB |