| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1296477 | okahak71 | Palindrome-Free Numbers (BOI13_numbers) | C++20 | 846 ms | 580 KiB |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int a, b, ans = 0; cin >> a >> b;
while(a <= b){
bool add = 1;
int k = a, q = -1, qp = -1, qpp;
while(k > 0){
qpp = qp;
qp = q;
q = k % 10;
if(q == qpp or q == qp){
add = 0;
break;
}
k /= 10;
}
ans += add;
a++;
} cout << ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
