Onnenluku

input/code.cpp: In function 'long long int g(std::string)':
input/code.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < s.length()-1; i++) {
                     ^
input/code.cpp:25:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < s.length()-2; i++) {
                     ^
input/code.cpp:30:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < s.length()-1; i++) {
                     ^
input/code.cpp:36:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 2; i < s.length(); i++) {
                    ^
input/code.cpp: In function 'long long int f(std::string)':
input/code.cpp:51:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 2; i <= s.length()-1; i++) {
                    ^
input/code...

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

#define ll long long

string a,b;
ll d[51][51];

ll g(string s)
{
	ll r = 0;
	ll t = 0;
	ll u = 0;
	int x = s[0] - '0';
	int y = s[1] - '0';
	if (y > x) {
		for (int i = 0; i < s.length()-1; i++) {
			r += d[s.length()-1][i];
		}
		r *= (y-2);
		for (int i = 0; i < s.length()-2; i++) {
			t += d[s.length()-2][i];
		}
		t *= 8;
	} else {
		for (int i = 0; i < s.length()-1; i++) {
			r += d[s.length()-2][i];
		}
		r *= (y-1);
	}
	u = 1;
	for (int i = 2; i < s.length(); i++) {
		if (s[i] - '0' < x && s[i] - '0'  < y) {
			u *= 0;
		} else if (s[i] - '0' < x || s[i] - '0'  < y) {
			u *= 1;
		} else {
			u *= 2;
		}
	}
	return r+t+u;
}

ll f(string s)
{
	ll p = 0;
	for (int i = 2; i <= s.length()-1; i++) {
		for (int j = 1; j <= i-1; j++) {
			p += d[i][j];
		}
	}
	p *= 36;
	ll q = 0;
	for (int i = 1; i <= s.length()-1; i++) {
		q += d[s.length()][i];
	}
	int x = s[0] - '0';
	q *= 4*(x-1);
	return p+q+g(s);
}

bool lucky(string s) {
	set<char> v;
	for (int i = 0; i < s.length(); i++) {
		if (s[i] != '0') v.insert(s[i]);
	}
	return v.size() == 2 ? true : false;
}

int main()
{
	cin >> a >> b;
	for (int i = 0; i <= b.length(); i++) {
		d[i][0] = 1;
		for (int j = 1; j <= i; j++) {
			d[i][j] = d[i-1][j-1]+d[i-1][j];
		}
	}
	if (!lucky(a)) {
		cout << f(b)-f(a) << "\n";
	} else {
		cout << f(b)-f(a)+1 << "\n";
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED