Submission #48470

#	Time	Username	Problem	Language	Result	Execution time	Memory
48470		rkocharyan	Palindrome-Free Numbers (BOI13_numbers)	C++14	25 / 100	24 ms	628 KiB

numbers

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <bitset>
#include <iomanip>
#include <memory>
#include <functional>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cassert>
using namespace std;

#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define mp make_pair
#define add push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mem(a,b) memset(a, b, sizeof(a))
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:20000007")
#pragma GCC optimize("unroll-loops")

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> lnum;

const int N = (int)1e6 + 100;
const int maxn = (int)1e3 + 100;
const int base = (int)1e9;
const int mod = (int)1e9 + 7;
const int inf = INT_MAX;
const long long ll_inf = LLONG_MAX;
const long double PI = acos((long double)-1.0);
const long double eps = 1e-8;

void solve() {
	long long l, r; cin >> l >> r;
	if (r - l > N) {
		cout << (r - l) / 2 << '\n';
		return;
	}
	long long ans = 0;
	for (long long i = l; i <= r; ++i) {
		string now = to_string(i);
		bool pal2, pal3;
		pal2 = pal3 = 1;
		if (now.size() >= 2) {
			for (int j = 0; j < now.size() - 1; ++j) if (now[j] == now[j + 1]) {
				pal2 = 0;
				break;
			}
		}
		if (now.size() >= 3) {
			for (int j = 0; j < now.size() - 2; ++j) if (now[j] == now[j + 2]) {
				pal3 = 0;
				break;
			}
		}
		ans += (pal2 & pal3);
	}
	cout << ans << '\n';
}

int main() {
	//ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

	//#define Freopen
#ifdef Freopen
#ifndef _MSC_VER 
#define TASK ""
	freopen(TASK".in", "r", stdin);
	freopen(TASK".out", "w", stdout);
#endif
#endif

	int T = 1;
	//scanf("%d", &T);

	for (; T; --T) solve();

#ifdef DEBUG
	cerr << double(1.0 * clock() / CLOCKS_PER_SEC) << '\n';
#endif 

	return 0;
}

Compilation message (stderr)

numbers.cpp:34:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)
 
numbers.cpp:35:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:20000007")
 
numbers.cpp: In function 'void solve()':
numbers.cpp:66:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < now.size() - 1; ++j) if (now[j] == now[j + 1]) {
                    ~~^~~~~~~~~~~~~~~~
numbers.cpp:72:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < now.size() - 2; ++j) if (now[j] == now[j + 2]) {
                    ~~^~~~~~~~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 0 / 75