text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int a[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int n;
cin >> n;
cout << (a[n % 10] * a[n / 10]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n, i1, i2;
cin >> n;
i1 = n % 10;
i2 = n / 10;
cout << x[i1] * x[i2];
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, result, l, arr[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
scanf("%d", &n);
l = n % 10;
n = n / 10;
result = arr[n] * arr[l];
printf("%d\n", result);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int f = n / 10;
int s = n % 10;
int arr[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int c = arr[f] * arr[s];
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[12] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
char s[5];
cin >> s;
int a = (int)(s[0] - '0');
int b = (int)(s[1] - '0');
cout << v[a] * v[b] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int poss[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
int n, r1 = 0, r2 = 0;
cin >> n;
r1 = n % 10;
n /= 10;
r2 = n % 10;
cout << poss[r1] * poss[r2] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int data[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int a;
cin >> a;
int x, y;
x = a % 10;
a = a / 10;
y = a % 10;
cout << data[x] * data[y] << endl;
}
|
#include <bits/stdc++.h>
int main() {
int t[11] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}, p = 0, q = 0, cp = 0, cq = 0;
unsigned n = 0, i = 0;
scanf("%d", &n);
p = n / 10;
q = n % 10;
for (i = 0; i <= 9; i++) {
if (p == i) cp = t[i];
if (q == i) cq = t[i];
}
printf("%d", cq * cp);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int x1, x2, k1 = 0, k2 = 0, count1 = 0, count2 = 0;
int a[10][7] = {{1, 1, 1, 0, 1, 1, 1}, {0, 0, 1, 0, 0, 0, 1},
{0, 1, 1, 1, 1, 1, 0}, {0, 1, 1, 1, 0, 1, 1},
{1, 0, 1, 1, 0, 0, 1}, {1, 1, 0, 1, 0, 1, 1},
{1, 1, 0, 1, 1, 1, 1}, {0, 1, 1, 0, 0, 0, 1},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 1, 1, 0, 1, 1}};
int arr1[7], arr2[7];
cin >> n;
x2 = n % 10;
n = n / 10;
x1 = n % 10;
for (int i = 0; i <= 6; ++i) {
if (a[x1][i] == 1) {
arr1[k1] = i;
++k1;
}
}
for (int i = 0; i <= 6; ++i) {
if (a[x2][i] == 1) {
arr2[k2] = i;
++k2;
}
}
int flag1, flag2;
for (int i = 0; i <= 9; ++i) {
flag1 = 0;
for (int k = 0; k < k1; ++k) {
if (a[i][arr1[k]] == 1) {
flag1 = 1;
} else {
flag1 = 0;
break;
}
}
if (flag1) {
count1++;
}
}
for (int i = 0; i <= 9; ++i) {
flag2 = 0;
for (int k = 0; k < k2; ++k) {
if (a[i][arr2[k]] == 1) {
flag2 = 1;
} else {
flag2 = 0;
break;
}
}
if (flag2) {
count2++;
}
}
cout << count1 * count2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(int i, int j) { return i > j; }
int main() {
int arr[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
cin >> n;
cout << arr[n / 10] * arr[n % 10];
}
|
#include <bits/stdc++.h>
using namespace std;
string str;
int from[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
getline(cin, str);
cout << (from[str[0] - '0'] * from[str[1] - '0']) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n;
int arr[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
x = n / 10;
y = n % 10;
int z = arr[x] * arr[y];
cout << z << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
string n;
cin >> n;
int ans = 1;
int a[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
for (int i = 0; i < n.length(); i++) {
int index = n[i] - '0';
ans *= a[index];
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b = 0, c = 0;
cin >> a;
if (a % 10 == 0) b = 2;
if (a % 10 == 1) b = 7;
if (a % 10 == 2) b = 2;
if (a % 10 == 3) b = 3;
if (a % 10 == 4) b = 3;
if (a % 10 == 5) b = 4;
if (a % 10 == 6) b = 2;
if (a % 10 == 7) b = 5;
if (a % 10 == 8) b = 1;
if (a % 10 == 9) b = 2;
if (a / 10 == 0) c = 2;
if (a / 10 == 1) c = 7;
if (a / 10 == 2) c = 2;
if (a / 10 == 3) c = 3;
if (a / 10 == 4) c = 3;
if (a / 10 == 5) c = 4;
if (a / 10 == 6) c = 2;
if (a / 10 == 7) c = 5;
if (a / 10 == 8) c = 1;
if (a / 10 == 9) c = 2;
cout << b * c;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ar[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cin >> n;
cout << ar[n % 10] * ar[n / 10];
}
|
#include <bits/stdc++.h>
const double EULER = 0.57721566490153286060651209;
const double PI = 3.14159265358979323846264338328;
const double E = 2.718281828459045235360287471352;
using namespace std;
bool a[10][7] = {
1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1,
1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1,
1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1,
};
int r[10];
bool cmp(int x, int y) {
for (int i = 0; i < 7; i++)
if (a[x][i] && !a[y][i]) return false;
return true;
}
char in[5];
int main() {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) r[i] += cmp(i, j);
}
while (gets(in)) {
printf("%d\n", r[in[0] - '0'] * r[in[1] - '0']);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool digits[10][7] = {{1, 1, 1, 0, 1, 1, 1}, {0, 0, 1, 0, 0, 1, 0},
{1, 0, 1, 1, 1, 0, 1}, {1, 0, 1, 1, 0, 1, 1},
{0, 1, 1, 1, 0, 1, 0}, {1, 1, 0, 1, 0, 1, 1},
{1, 1, 0, 1, 1, 1, 1}, {1, 0, 1, 0, 0, 1, 0},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 1, 1, 0, 1, 1}};
bool valid(int d1, int d2) {
for (int i = 0; i < 7; ++i) {
if (digits[d1][i] && !digits[d2][i]) {
return false;
}
}
return true;
}
int count(int dig) {
int cnt = 1;
for (int i = 0; i < 10; ++i) {
if (i != dig) {
if (valid(dig, i)) ++cnt;
}
}
return cnt;
}
int main() {
ios_base::sync_with_stdio(0);
char c1, c2;
cin >> c1 >> c2;
cout << count(c1 - '0') * count(c2 - '0') << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int test = 1;
void solve() {
string cr;
int arr[] = {1, 6, 1, 2, 2, 3, 1, 4, 0, 1};
cin >> cr;
int cntr = arr[(cr[1] - '0')] + 1;
cntr *= (arr[(cr[0] - '0')] + 1);
cout << cntr << endl;
}
int main() {
for (int i = 0; i < test; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m = 1, n;
int a[11] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cin >> n;
for (int i = 0; i < 10; i++) {
if (n / 10 == i) {
m = a[i];
for (int j = 0; j < 10; j++) {
if (n % 10 == j) {
m *= a[j];
break;
}
}
break;
}
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int x, i, sum, j, t, k;
scanf("%d", &k);
int a[11] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
sum = a[k / 10] * a[k % 10];
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
string s;
cin >> s;
cout << T[s[0] - 48] * T[s[1] - 48] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;
char n[2];
for (int i = 0; i < 2; i++) {
cin >> n[i];
}
for (int i = 0; i < 2; i++) {
if (i == 0) {
if (n[i] == '0' || n[i] == '2' || n[i] == '6' || n[i] == '9') {
s = 2;
} else if (n[i] == '3' || n[i] == '4') {
s = 3;
} else if (n[i] == '1') {
s = 7;
} else if (n[i] == '5') {
s = 4;
} else if (n[i] == '7') {
s = 5;
} else if (n[i] == '8') {
s = 1;
}
} else {
if (n[i] == '0' || n[i] == '2' || n[i] == '6' || n[i] == '9') {
s *= 2;
} else if (n[i] == '3' || n[i] == '4') {
s *= 3;
} else if (n[i] == '1') {
s *= 7;
} else if (n[i] == '5') {
s *= 4;
} else if (n[i] == '7') {
s *= 5;
} else if (n[i] == '8') {
s *= 1;
}
}
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int data[10][7] = {
{1, 1, 1, 1, 1, 1, 0}, {0, 1, 1, 0, 0, 0, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 0, 0, 1}, {0, 1, 1, 0, 0, 1, 1}, {1, 0, 1, 1, 0, 1, 1},
{1, 0, 1, 1, 1, 1, 1}, {1, 1, 1, 0, 0, 0, 0}, {1, 1, 1, 1, 1, 1, 1},
{1, 1, 1, 1, 0, 1, 1},
};
int counter[10] = {0};
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
bool ans = true;
for (int k = 0; k < 7; k++) {
if (data[i][k] == 1 && data[j][k] != 1) {
ans = false;
}
}
if (ans) {
counter[i]++;
}
}
}
string n;
cin >> n;
cout << counter[n[0] - '0'] * counter[n[1] - '0'];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int v[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int x, y, z;
while (cin >> z) {
x = z / 10;
y = z % 10;
cout << v[x] * v[y] << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int a;
cin >> a;
cout << x[a % 10] * x[a / 10];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(10);
a[0] = 2;
a[1] = 7;
a[2] = 2;
a[3] = 3;
a[4] = 3;
a[5] = 4;
a[6] = 2;
a[7] = 5;
a[8] = 1;
a[9] = 2;
int p = n % 10;
int q = n / 10;
cout << a[p] * a[q] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) swap(a, b);
if (b == 0)
return a;
else
return gcd(a % b, b);
}
int main() {
long long int i, j;
string s;
cin >> s;
int a[2];
for (i = 0; i < s.size(); i++) {
char x = s[i];
if (x == '5')
a[i] = 4;
else if (x == '2' || x == '6' || x == '9')
a[i] = 2;
else if (x == '7')
a[i] = 5;
else if (x == '4' || x == '3')
a[i] = 3;
else if (x == '8')
a[i] = 1;
else if (x == '0')
a[i] = 2;
else if (x == '1')
a[i] = 7;
}
long long int ans = a[0] * a[1];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char dig[][8] = {"1110111", "0010010", "1011101", "1011011", "0111010",
"1101011", "1101111", "1010010", "1111111", "1111011"};
auto subset = [](char* x, char* y) {
while (*x) {
if (*x > *y) return false;
x++;
y++;
}
return true;
};
int pre[10] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
for (int i(0); i < 10; i++) {
for (int j(i + 1); j < 10; j++) {
if (subset(dig[i], dig[j])) {
pre[i]++;
} else {
if (subset(dig[j], dig[i])) {
pre[j]++;
}
}
}
};
int num;
std::cin >> num;
std::cout << pre[num % 10] * pre[num / 10] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
int s[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
char a, b;
int main() {
scanf("%c%c", &a, &b);
printf("%d\n", s[a - '0'] * s[b - '0']);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const f[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
char s[10];
cin >> s;
cout << f[s[0] - '0'] * f[s[1] - '0'] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, aa, bb;
cin >> n;
a = n / 10;
b = n % 10;
if (a == 0) {
aa = 2;
} else if (a == 1) {
aa = 7;
} else if (a == 2) {
aa = 2;
} else if (a == 3) {
aa = 3;
} else if (a == 4) {
aa = 3;
} else if (a == 5) {
aa = 4;
} else if (a == 6) {
aa = 2;
} else if (a == 7) {
aa = 5;
} else if (a == 8) {
aa = 1;
} else {
aa = 2;
}
if (b == 0) {
bb = 2;
} else if (b == 1) {
bb = 7;
} else if (b == 2) {
bb = 2;
} else if (b == 3) {
bb = 3;
} else if (b == 4) {
bb = 3;
} else if (b == 5) {
bb = 4;
} else if (b == 6) {
bb = 2;
} else if (b == 7) {
bb = 5;
} else if (b == 8) {
bb = 1;
} else {
bb = 2;
}
cout << aa * bb;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char c, d;
long long a[104];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> c >> d;
a[0] = 2;
a[1] = 7;
a[2] = 2;
a[3] = 3;
a[4] = 3;
a[5] = 4;
a[6] = 2;
a[7] = 5;
a[8] = 1;
a[9] = 2;
cout << a[c - '0'] * a[d - '0'] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int s[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int ans = 1;
int main() {
char c;
c = getchar();
ans *= s[c - '0'];
c = getchar();
ans *= s[c - '0'];
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1111;
const int INF = 0x7f7f7f7f;
int cases;
int num[11];
int main() {
num[0] = 2, num[1] = 7, num[2] = 2, num[3] = 3, num[4] = 3, num[5] = 4,
num[6] = 2, num[7] = 5, num[8] = 1, num[9] = 2;
int x, y;
scanf("%1d%1d", &x, &y);
cout << num[x] * num[y] << endl;
}
|
#include <bits/stdc++.h>
int change(int a) {
switch (a) {
case 0:
return 2;
case 1:
return 7;
case 2:
return 2;
case 3:
return 3;
case 4:
return 3;
case 5:
return 4;
case 6:
return 2;
case 7:
return 5;
case 8:
return 1;
case 9:
return 2;
}
}
int main() {
int n, a, b;
scanf("%d", &n);
a = n / 10;
b = n - a * 10;
a = change(a);
b = change(b);
printf("%d", a * b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool decreasing(int a, int b) { return a > b; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int num[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
cin >> n;
cout << (num[n % 10] * num[(n / 10) % 10]) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int cnt[3], g, i;
char str1[5], *b, *e;
int A[] = {1, 6, 1, 2, 2, 3, 1, 4, 0, 1};
scanf("%s", str1);
i = 0;
cnt[0] = 1;
cnt[1] = 1;
for (b = str1, e = &str1[2 - 1]; b <= e; b++) {
cnt[i] = cnt[i] + A[(int)*b % 48];
i++;
}
printf("%d\n", cnt[0] * cnt[1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T big(T a, T b) {
return a > b ? a : b;
}
template <class T>
inline T small(T a, T b) {
return a < b ? a : b;
}
int ebi(int a) {
if (a == 1)
return 7;
else if (a == 7)
return 5;
else if (a == 5)
return 4;
else if (a == 8)
return 1;
else if (a == 3 || a == 4)
return 3;
else
return 2;
}
int main(void) {
int i, j;
int n;
int a, b, c, d;
cin >> n;
a = n % 10;
b = n / 10;
c = ebi(a);
d = ebi(b);
cout << c * d << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
vector<int> ans1;
void fun(char c) {
if (c == '0') {
ans.push_back(0);
ans.push_back(8);
} else if (c == '1') {
ans.push_back(0);
ans.push_back(1);
ans.push_back(3);
ans.push_back(4);
ans.push_back(7);
ans.push_back(8);
ans.push_back(9);
} else if (c == '2') {
ans.push_back(2);
ans.push_back(8);
} else if (c == '3') {
ans.push_back(3);
ans.push_back(8);
ans.push_back(9);
} else if (c == '4') {
ans.push_back(4);
ans.push_back(8);
ans.push_back(9);
} else if (c == '5') {
ans.push_back(5);
ans.push_back(6);
ans.push_back(8);
ans.push_back(9);
} else if (c == '6') {
ans.push_back(6);
ans.push_back(8);
} else if (c == '7') {
ans.push_back(7);
ans.push_back(0);
ans.push_back(3);
ans.push_back(8);
ans.push_back(9);
} else if (c == '8') {
ans.push_back(8);
} else if (c == '9') {
ans.push_back(9);
ans.push_back(8);
}
}
void fun1(char c) {
if (c == '0') {
ans1.push_back(0);
ans1.push_back(8);
} else if (c == '1') {
ans1.push_back(0);
ans1.push_back(1);
ans1.push_back(3);
ans1.push_back(4);
ans1.push_back(7);
ans1.push_back(8);
ans1.push_back(9);
} else if (c == '2') {
ans1.push_back(2);
ans1.push_back(8);
} else if (c == '3') {
ans1.push_back(3);
ans1.push_back(8);
ans1.push_back(9);
} else if (c == '4') {
ans1.push_back(4);
ans1.push_back(8);
ans1.push_back(9);
} else if (c == '5') {
ans1.push_back(5);
ans1.push_back(6);
ans1.push_back(8);
ans1.push_back(9);
} else if (c == '6') {
ans1.push_back(6);
ans1.push_back(8);
} else if (c == '7') {
ans1.push_back(7);
ans1.push_back(0);
ans1.push_back(3);
ans1.push_back(8);
ans1.push_back(9);
} else if (c == '8') {
ans1.push_back(8);
} else if (c == '9') {
ans1.push_back(9);
ans1.push_back(8);
}
}
int main() {
char c1, c2;
cin >> c1 >> c2;
fun(c1);
fun1(c2);
set<int> ot;
for (int i = 0; i < ans.size(); i++) {
for (int j = 0; j < ans1.size(); j++) {
int now = ans[i] * 10 + ans1[j];
ot.insert(now);
}
}
cout << ot.size();
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int f, s;
s = n % 10;
f = n / 10;
int ans = 0;
int arr[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
ans = arr[s] * arr[f];
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
char getGoodFigure(char& val);
int main() {
char first, second;
first = getchar() - '0';
second = getchar() - '0';
char answer = getGoodFigure(first) * getGoodFigure(second);
printf("%i\n", answer);
return 0;
}
char getGoodFigure(char& val) {
switch (val) {
case 8:
return 1;
break;
case 0:
case 2:
case 6:
case 9:
return 2;
break;
case 3:
case 4:
return 3;
break;
case 5:
return 4;
break;
case 7:
return 5;
break;
case 1:
return 7;
break;
default:
return -1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1001];
int main() {
string d;
cin >> d;
int d1 = 0, d2 = 0, res = 0;
if (d[0] == '0') {
d1 = 2;
} else if (d[0] == '1') {
d1 = 7;
} else if (d[0] == '2') {
d1 = 2;
} else if (d[0] == '3') {
d1 = 3;
} else if (d[0] == '4') {
d1 = 3;
} else if (d[0] == '5') {
d1 = 4;
} else if (d[0] == '6') {
d1 = 2;
} else if (d[0] == '7') {
d1 = 5;
} else if (d[0] == '8') {
d1 = 1;
} else if (d[0] == '9') {
d1 = 2;
}
if (d[1] == '0') {
d2 = 2;
} else if (d[1] == '1') {
d2 = 7;
} else if (d[1] == '2') {
d2 = 2;
} else if (d[1] == '3') {
d2 = 3;
} else if (d[1] == '4') {
d2 = 3;
} else if (d[1] == '5') {
d2 = 4;
} else if (d[1] == '6') {
d2 = 2;
} else if (d[1] == '7') {
d2 = 5;
} else if (d[1] == '8') {
d2 = 1;
} else if (d[1] == '9') {
d2 = 2;
}
res = d1 * d2;
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int options[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main(void) {
string s;
cin >> s;
int total = 1;
for (int i = 0; i < 2; ++i) {
total *= options[s[i] - '0'];
}
cout << total << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int digits[10] = {1110111, 10010, 1011101, 1011011, 111010,
1101011, 1101111, 1010010, 1111111, 1111011};
int good1(int n, int x) {
n = digits[n];
x = digits[x];
for (int i = 0; i < 7; i++) {
if (x % 10 == 0 && n % 10 == 1) {
return 0;
}
n /= 10;
x /= 10;
}
return 1;
}
int good(int n, int x) {
int n1 = n / 10;
int n2 = n % 10;
int x1 = x / 10;
int x2 = x % 10;
return good1(n1, x1) && good1(n2, x2);
}
int main() {
int n;
scanf("%d", &n);
int cnt = 0;
for (int i = 0; i < 100; i++) {
cnt += good(n, i);
}
printf("%d\n", cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
long ar[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
ios_base::sync_with_stdio(false);
string st;
while (cin >> st) {
long a = 0, b = 0;
a = st[0] - '0';
b = st[1] - '0';
cout << ar[a] * ar[b] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int chk(char ch) {
int i = 0, j = 0, k = 0, tmp1, tmp2, tmp3, tmp = 0;
if (ch == '0') return 2;
if (ch == '1') return 7;
if (ch == '2') return 2;
if (ch == '3') return 3;
if (ch == '4') return 3;
if (ch == '5') return 4;
if (ch == '6') return 2;
if (ch == '7') return 5;
if (ch == '8') return 1;
if (ch == '9') return 2;
}
int main() {
int i = 0, j = 0, k = 0, tmp1, tmp2, tmp3, tmp = 0;
char str[10];
scanf("%s", str);
tmp1 = chk(str[0]);
tmp2 = chk(str[1]);
printf("%d", tmp1 * tmp2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int answer();
int main() {
long long t;
t = 1;
while (t--) {
answer();
}
return 0;
}
int answer() {
string k;
cin >> k;
int sup[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
if (k.size() > 1) {
cout << sup[k[0] - '0'] * sup[k[1] - '0'] << endl;
} else {
cout << sup[k[0] - '0'] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a, b;
cin >> a >> b;
int c, d;
c = a - '0';
d = b - '0';
int m, n;
switch (d) {
case 0:
n = 2;
break;
case 1:
n = 7;
break;
case 2:
n = 2;
break;
case 3:
n = 3;
break;
case 4:
n = 3;
break;
case 5:
n = 4;
break;
case 6:
n = 2;
break;
case 7:
n = 5;
break;
case 8:
n = 1;
break;
case 9:
n = 2;
break;
}
m = n;
switch (c) {
case 0:
n = 2;
break;
case 1:
n = 7;
break;
case 2:
n = 2;
break;
case 3:
n = 3;
break;
case 4:
n = 3;
break;
case 5:
n = 4;
break;
case 6:
n = 2;
break;
case 7:
n = 5;
break;
case 8:
n = 1;
break;
case 9:
n = 2;
break;
}
cout << m * n << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> mp;
mp['0'] = 2;
mp['1'] = 7;
mp['2'] = 2;
mp['3'] = 3;
mp['4'] = 3;
mp['5'] = 4;
mp['6'] = 2;
mp['7'] = 5;
mp['8'] = 1;
mp['9'] = 2;
char x, y;
scanf("%ch", &x);
scanf("%ch", &y);
int res = mp[x] * mp[y];
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0;
bool f = false;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = true;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 3) + (x << 1) + (c ^ '0');
c = getchar();
}
return f ? -x : x;
}
inline void write(long long x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
string s;
long long a[11] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
signed main() {
ios::sync_with_stdio(0);
cin >> s;
cout << a[s[0] - '0'] * a[s[1] - '0'];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 20;
int cnt[MAX] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
char ch[5];
int main() {
while (scanf("%s", ch) != EOF) {
printf("%d\n", cnt[ch[0] - '0'] * cnt[ch[1] - '0']);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
cin >> n;
int ans = arr[n % 10];
n /= 10;
ans *= arr[n];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int a[10];
int ans = 1;
int main() {
a[0] = 2;
a[1] = 7;
a[2] = 2;
a[3] = 3;
a[4] = 3;
a[5] = 4;
a[6] = 2;
a[7] = 5;
a[8] = 1;
a[9] = 2;
cin >> s;
int b[10];
for (int i = 0; i < s.size(); i++) {
int tmp = s[i] - '0';
b[i] = a[tmp];
}
for (int i = 0; i < s.size(); i++) {
ans *= b[i];
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
template <typename T>
string toString(T t) {
stringstream ss;
ss << t;
return ss.str();
}
vector<set<int> > d = {{0, 1, 2, 3, 4, 5}, {2, 3}, {1, 2, 4, 5, 6},
{1, 2, 3, 4, 6}, {0, 2, 3, 6}, {0, 1, 3, 4, 6},
{0, 1, 3, 4, 5, 6}, {1, 2, 3}, {0, 1, 2, 3, 4, 5, 6},
{0, 1, 2, 3, 4, 6}};
int solve(int a) {
int ans = 0;
for (int i = 0; i < 10; i++) {
int cnt = 0;
for (int na : d[a]) {
cnt += d[i].count(na) == 0;
}
if (cnt == 0) {
ans++;
}
}
return ans;
}
int main() {
char a, b;
cin >> a >> b;
cout << solve(a - '0') * solve(b - '0') << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v[] = {
{0, 8}, {0, 1, 3, 4, 7, 8, 9}, {2, 8}, {3, 8, 9}, {4, 8, 9}, {5, 6, 8, 9},
{6, 8}, {0, 3, 7, 8, 9}, {8}, {8, 9}};
int main() {
ios::sync_with_stdio(false);
string s;
while (cin >> s) {
cout << v[s[0] - '0'].size() * v[s[1] - '0'].size() << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int for_int(int c);
int main() {
int n;
cin >> n;
cout << for_int(n / 10) * for_int(n - 10 * (n / 10));
return 0;
}
int for_int(int c) {
switch (c) {
case 1:
return 7;
case 2:
return 2;
case 3:
return 3;
case 4:
return 3;
case 5:
return 4;
case 6:
return 2;
case 7:
return 5;
case 8:
return 1;
case 9:
return 2;
case 0:
return 2;
default:
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int number, result;
cin >> number;
vector<int> myvector;
myvector.push_back(2);
myvector.push_back(7);
myvector.push_back(2);
myvector.push_back(3);
myvector.push_back(3);
myvector.push_back(4);
myvector.push_back(2);
myvector.push_back(5);
myvector.push_back(1);
myvector.push_back(2);
int fr, b;
b = number % 10;
number /= 10;
fr = number;
result = myvector[fr] * myvector[b];
cout << result;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[10] = {0};
arr[0] = 2;
arr[1] = 7;
arr[2] = 2;
arr[3] = 3;
arr[4] = 3;
arr[5] = 4;
arr[6] = 2;
arr[7] = 5;
arr[8] = 1;
arr[9] = 2;
string s;
cin >> s;
int a = s[0] - '0';
int b = s[1] - '0';
cout << arr[a] * arr[b];
return 0;
return 0;
return 0;
return 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while (cin >> s) {
int i = s[0] - '0';
int j = s[1] - '0';
int c, d;
if (i == 1)
c = 7;
else if (i == 2 || i == 9 || i == 6 || i == 0)
c = 2;
else if (i == 3 || i == 4)
c = 3;
else if (i == 5)
c = 4;
else if (i == 7)
c = 5;
else if (i == 8)
c = 1;
if (j == 1)
d = 7;
else if (j == 2 || j == 9 || j == 6 || j == 0)
d = 2;
else if (j == 3 || j == 4)
d = 3;
else if (j == 5)
d = 4;
else if (j == 7)
d = 5;
else if (j == 8)
d = 1;
cout << c * d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int val[26];
unordered_map<long long, int> ht[26];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
for (int i = 0; i < 26; ++i) cin >> val[i];
string str;
cin >> str;
long long cm = 0, ans = 0;
for (int i = 0; i < ((int)(str).size()); ++i) {
ans += ht[str[i] - 'a'][cm];
cm += val[str[i] - 'a'];
++ht[str[i] - 'a'][cm];
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long p;
map<long long, int> m[123];
int main() {
long long characters_value[26];
long long i;
for (i = 0; i < 26; i++) cin >> characters_value[i];
string s;
cin >> s;
long long ans = 0;
for (i = 0; i < s.size(); i++) {
ans += m[s[i]][p];
p += characters_value[s[i] - 'a'];
m[s[i]][p]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> arr(27, 0);
for (int i = 1; i <= 26; i++) cin >> arr[i];
string s;
cin >> s;
vector<map<long long int, long long int> > count(27);
long long int sum = 0;
long long int ans = 0;
for (long long int i = 0; i < s.length(); i++) {
sum = sum + arr[s[i] - 'a' + 1];
if (count[s[i] - 'a' + 1].find(sum - arr[s[i] - 'a' + 1]) !=
count[s[i] - 'a' + 1].end()) {
ans = ans + count[s[i] - 'a' + 1][sum - arr[s[i] - 'a' + 1]];
}
count[s[i] - 'a' + 1][sum]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[26];
string s;
long long acc[100001];
vector<pair<long long, long long> > sb[26];
vector<pair<long long, long long> > se[26];
int main(int argc, char const *argv[]) {
for (int i = 0; i < 26; i++) {
cin >> v[i];
}
cin >> s;
long long aux = 0;
for (int i = 0; i < s.size(); i++) {
aux += v[s[i] - 'a'];
acc[i] = aux;
}
for (int i = 0; i < s.size(); i++) {
if (i < s.size() - 1) {
sb[s[i] - 'a'].push_back(make_pair(acc[i], i));
}
if (i > 0) {
se[s[i] - 'a'].push_back(make_pair(acc[i - 1], i - 1));
}
}
long long total = 0;
for (int i = 0; i < 26; i++) {
sort(se[i].begin(), se[i].end());
for (vector<pair<long long, long long> >::iterator it = sb[i].begin();
it != sb[i].end(); it++) {
long long accval = (*it).first;
long long accpos = (*it).second;
vector<pair<long long, long long> >::iterator it1, it2;
it1 = lower_bound(se[i].begin(), se[i].end(), make_pair(accval, accpos));
it2 = upper_bound(se[i].begin(), se[i].end(),
make_pair(accval, 100000000LL));
total += (it2 - it1);
}
}
cout << total << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, d[26];
long long pre[N];
map<long long, long long> mp[26];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < 26; i++) cin >> d[i];
string s;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
pre[i] = d[s[i] - 'a'];
if (i) pre[i] += pre[i - 1];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
int c = s[i] - 'a';
if (i) {
ans += mp[c][pre[i - 1]];
}
mp[c][pre[i]]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
const int N = 1e5 + 10;
using namespace std;
int a[26];
vector<int> d[26];
long long sum[N], ans;
string s;
int main() {
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> s;
long long x = 0;
for (int i = 0; i < s.length(); i++) {
d[s[i] - 'a'].push_back(i);
x += a[s[i] - 'a'];
sum[i] = x;
}
for (int i = 0; i < 26; i++) {
map<long long, long long> p;
for (int j = 0; j < d[i].size(); j++) {
int z = d[i][j];
ans += p[sum[z - 1]];
p[sum[z]]++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<char, long long> mp;
map<pair<char, long long>, long long> cnt;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
for (char c = 'a'; c <= 'z'; c++) cin >> mp[c];
string s;
cin >> s;
long long n = s.length();
long long sum = mp[s[0]];
cnt[{s[0], mp[s[0]]}]++;
long long ans = 0;
for (long long i = 1; i < n; i++) {
ans += cnt[{s[i], sum}];
sum += mp[s[i]];
cnt[{s[i], sum}]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Pow[26], n;
char read[100002];
long long Sum[100001];
map<long long, int> F[26];
int main() {
for (int i = 0; i < 26; ++i) scanf("%d", &Pow[i]);
scanf("%s", read);
string s = read;
s = "#" + s;
n = s.size() - 1;
for (int i = 1; i <= n; ++i) Sum[i] = Sum[i - 1] + Pow[s[i] - 'a'];
long long res = 0;
for (int i = n; i > 0; --i) {
res += F[s[i] - 'a'][Sum[i] + Pow[s[i] - 'a']];
++F[s[i] - 'a'][Sum[i]];
}
printf("%lld\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> d(26);
string s;
int32_t main() {
for (long long i = 0; i < 26; ++i) {
cin >> d[i];
}
cin >> s;
long long n = s.length();
vector<map<long long, long long> > suf(30);
long long sum = 0;
for (long long i = 0; i < n; ++i) {
sum += d[s[i] - 'a'];
}
long long all_sum = sum;
long long ans = 0;
char delayedc = '-';
long long sufsum = d[s[n - 1] - 'a'];
for (long long i = n - 2; i >= 0; --i) {
char c = s[i] - 'a';
suf[s[i + 1] - 'a'][sufsum]++;
sum -= d[s[i + 1] - 'a'];
if (suf[c].find(all_sum - sum) != suf[c].end()) {
ans += suf[c][all_sum - sum];
}
sufsum += d[c];
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 100009;
char s[INF];
long long val[30], f[INF];
unordered_map<long long, int> p;
int n, m;
int main() {
for (int i = 0; i < 26; i++) cin >> val[i];
getchar();
gets(s);
int len = strlen(s);
f[0] = s[0] - 'a';
for (int i = 1; i < len; i++) f[i] = f[i - 1] + val[s[i] - 'a'];
long long ans = 0;
for (int i = 0; i < 26; i++) {
p.clear();
char tem = 'a' + i;
for (int i = 0; i < len; i++) {
if (s[i] == tem) p[f[i]]++;
if (s[i + 1] == tem) ans += p[f[i]];
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp[27];
int vis[27];
char s[100005];
int main() {
for (int i = 0; i < 26; ++i) scanf("%d", vis + i);
scanf("%s", &s);
int len = strlen(s);
long long ans = 0, sum = 0;
for (int i = 0; i < len; ++i) {
int pos = s[i] - 'a';
ans += mp[pos][sum];
sum += vis[pos];
++mp[pos][sum];
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp;
int main(void) {
long long i, j;
long long value[26];
for (i = 0; i < 26; i++) {
long long x;
cin >> x;
value[i] = x;
}
string s;
long long ans = 0;
cin >> s;
long long sum[s.length()];
sum[0] = value[s[0] - 'a'];
for (i = 1; i < s.length(); i++) {
sum[i] = sum[i - 1] + value[s[i] - 'a'];
}
for (j = 0; j < 26; j++) {
mp.clear();
for (i = 0; i < s.length(); i++) {
if (s[i] == 'a' + j) {
if (i > 0) ans += mp[sum[i - 1]];
mp[sum[i]]++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int precal[100005];
map<long long int, long long int> s[26];
vector<int> v;
long long int nc2(long long int x) {
x = (x) * (x - 1);
x /= 2;
return x;
}
int main() {
int i, j, val;
long long int ans = 0;
for (i = 0; i < 26; i++) {
cin >> val;
v.push_back(val);
}
string str;
cin >> str;
str = "#" + str;
long long int sum = 0;
for (i = 1; i < str.length(); i++) {
int to = int(str[i]) - 97;
sum += v[to];
precal[i] = sum;
}
long long int tmp;
for (i = 1; i < str.length(); i++) {
int to = int(str[i]) - 97;
tmp = precal[i];
tmp -= v[to];
ans += s[to][tmp];
s[to][precal[i]]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gt[260], dds[260], ddc[260];
pair<long long, int> luu[123456];
string s;
int main() {
ios_base::sync_with_stdio(false);
for (int i = 97; i <= 122; i++) cin >> gt[i];
cin >> s;
int n = s.length();
long long cur = 0;
for (int i = 0; i < s.length(); i++) {
cur += gt[s[i]];
luu[i + 1] = make_pair(cur, i);
}
luu[0] = make_pair(0, -1);
sort(luu, luu + n);
long long ans = 0;
for (int i = 0; i < n - 1; i++)
if (s[i] == s[i + 1]) ans++;
int l = 1;
for (int i = 0; i <= n;) {
for (int j = 97; j <= 122; j++) dds[j] = ddc[j] = 0;
for (int j = i; j <= n; j++) {
if (luu[j].first == luu[i].first) {
l = j + 1;
continue;
}
break;
}
for (int j = i; j < l; j++) {
int t = luu[j].second;
if (t < n - 1) {
dds[s[t + 1]]++;
ans += ddc[s[t + 1]];
}
if (t >= 0) ddc[s[t]]++;
}
i = l;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
const int m = 26;
long long x[m];
map<long long, long long> mp;
vector<long long> a[m];
string s;
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < m; i++) cin >> x[i];
cin >> s;
long long sum = 0;
for (int i = 0; i < s.length(); i++) {
int ch = s[i] - 'a';
sum += x[ch];
a[ch].push_back(sum);
}
long long ans = 0;
for (int i = 0; i < m; i++) {
mp.clear();
for (int j = 0; j < a[i].size(); j++) {
ans += mp[a[i][j] - x[i]];
mp[a[i][j]]++;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n;
long long val[26];
long long pref[N];
string s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
for (long long i = 0; i < 26; i++) {
cin >> val[i];
}
cin >> s;
n = s.size();
s = '#' + s;
for (long long i = 2; i <= n; i++) {
pref[i] = val[s[i] - 'a'];
pref[i] += pref[i - 1];
}
long long ans = 0;
for (char ch = 'a'; ch <= 'z'; ch++) {
map<long long, long long> m;
long long ct = 0;
for (long long i = 1; i <= n; i++) {
if (s[i] != ch) continue;
ct++;
ans += m[pref[i] - val[s[i] - 'a']];
m[pref[i]]++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
long long w[26], a, i, p;
map<long long, int> m[123];
int main() {
for (i = 0; i < 26; i++) cin >> w[i];
cin >> s;
for (i = 0; i < s.size(); i++) {
a += m[s[i]][p];
p += w[s[i] - 'a'];
m[s[i]][p]++;
}
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[26];
char s[100005];
long long sum[100005];
map<long long, int> cnt;
int main() {
for (int i = 0; i < 26; i++) {
scanf("%d", &v[i]);
}
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + v[s[i] - 'a'];
}
long long ans = 0;
for (int i = 0; i < 26; i++) {
cnt.clear();
for (int j = 1; j <= n; j++) {
if (s[j] == 'a' + i) {
ans += cnt[sum[j - 1]];
cnt[sum[j]]++;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long val[27];
long long accS[100005];
map<long long, long long> lett[27];
int main(int argc, char const* argv[]) {
for (int i = 0; i < 26; i += 1) {
cin >> val[i];
}
char str[100005];
scanf("%s", str);
int len = strlen(str);
long long total = 0;
for (int i = 1; i <= len; i += 1) {
int idx = str[i - 1] - 'a';
accS[i] = accS[i - 1] + val[idx];
long long reqV = accS[i - 1];
total += lett[idx][reqV];
++lett[idx][accS[i]];
}
cout << total << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
map<long long, int> m[26];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int c[26];
for (int i = 0; i < 26; i++) cin >> c[i];
string s;
cin >> s;
int n = s.length();
long long sum = 0LL;
long long ans = 0LL;
for (int i = 0; i < n; i++) {
sum += c[s[i] - 'a'];
ans += m[s[i] - 'a'][sum - c[s[i] - 'a']];
m[s[i] - 'a'][sum]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int value[30], a;
for (int i = 0; i < 26; i++) {
cin >> value[i];
}
string str;
cin >> str;
map<long long, int> mp[30];
long long sum = 0, ans = 0;
for (int i = 0; i < str.size(); i++) {
a = str[i] - 'a';
ans += mp[a][sum];
sum += value[a];
mp[a][sum]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 2e6 + 7;
long long read() {
long long ans = 0, f = 1, c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = ans * 10 + (c - '0');
c = getchar();
}
return ans * f;
}
map<long long, long long> S[30];
char c[M];
long long s[27], len, ans, cnt;
int main() {
for (int i = 0; i < 26; i++) s[i] = read();
scanf("%s", c + 1);
len = strlen(c + 1);
for (int i = 1; i <= len; i++) {
int now = c[i] - 'a';
if (S[now].count(cnt)) ans += S[now][cnt];
cnt += s[c[i] - 'a'];
S[now][cnt]++;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int value[128];
map<long long, int> occ[128];
int main() {
std::ios::sync_with_stdio(false);
for (int i = 0; i < 26; i++) {
int v;
cin >> v;
value[i + 'a'] = v;
}
string s;
cin >> s;
long long ans = 0;
int limit = s.size();
vector<long long> ps(limit + 1, 0);
for (int i = 1; i <= limit; i++) {
ps[i] = ps[i - 1] + value[s[i - 1]];
ans += occ[s[i - 1]][ps[i - 1]];
occ[s[i - 1]][ps[i]]++;
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
long long x[26];
long long sum[100010];
int n;
string s;
map<long long, int> h;
long long solve_B(int v) {
long long res = 0;
for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + x[(int)(s[i] - 'a')];
h.clear();
for (int i = 0; i < n; i++)
if ((int)(s[i] - 'a') == v) {
res += h[sum[i]];
h[sum[i + 1]]++;
}
return res;
}
long long solve() {
long long res = 0;
for (int i = 0; i < 26; i++) {
res += solve_B(i);
}
return res;
}
int main() {
for (int i = 0; i < 26; i++) cin >> x[i];
cin >> s;
n = (int)s.size();
cout << solve() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T &get(T &n) {
cin >> n;
return n;
}
const int hell = 1000000007;
const long long INF = (long long)hell * hell;
const int MAXN = 5e6 + 10;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
vector<int> value(26);
for (int i = 0; i < 26; ++i) cin >> value[i];
string s;
cin >> s;
int N = s.length();
long long S = 0, ans = 0;
map<long long, vector<vector<int> > > start, end;
for (int i = 0; i < N - 1; ++i) {
int idx = s[i] - 'a';
int nidx = s[i + 1] - 'a';
S += value[idx];
if (start.find(S) == start.end()) {
start[S].resize(26);
end[S].resize(26);
}
start[S][idx].push_back(i);
end[S][nidx].push_back(i + 1);
}
for (auto it = (start).begin(); it != (start).end(); it++) {
long long sum = it->first;
for (int i = 0; i < 26; ++i) {
int sz = it->second[i].size();
for (int j = 0; j < sz; ++j) {
int idx = it->second[i][j];
int cnt2 = end[sum][i].end() -
upper_bound(end[sum][i].begin(), end[sum][i].end(), idx);
ans += cnt2;
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool J27 = 1;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
if (!J27) return;
cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
if (!J27) return;
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
inline void INP();
const long long N = 3e6 + 7;
const long long INF = LLONG_MAX;
const long long inf = INT_MAX;
long long n, Q;
long long arr[N + 2];
long long val[26];
string str;
void solve() {
for (long long i = 0; i < (long long)26; i++) cin >> val[i];
cin >> str;
n = str.length();
map<long long, vector<long long> > mp;
vector<long long> al(26, 0);
long long sum = 0, ans = 0;
for (long long i = 0; i < (long long)n; i++) {
long long c = str[i] - 'a';
if (i == 0) {
sum += val[c];
if (mp[sum].size() == 0) mp[sum] = al;
mp[sum][c]++;
} else {
if (mp.find(sum) != mp.end()) {
ans += mp[sum][c];
if (str[i - 1] == c) ans--;
}
sum += val[c];
if (mp[sum].size() == 0) mp[sum] = al;
mp[sum][c]++;
}
}
cout << ans << '\n';
}
int32_t main() {
J27 = 1;
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
INP();
long long t = 1;
while (t--) solve();
}
inline void INP() {}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
const long long INFL = LLONG_MAX;
const long double pi = acos(-1);
int score[30];
map<long long, int> cnt[30];
int A[100100];
long long S[100100];
int N;
int main() {
ios_base::sync_with_stdio(0);
cout.precision(15);
cout << fixed;
cout.tie(0);
for (int(i) = 1, j123 = 26; (i) <= j123; (i)++) cin >> score[i];
string foo;
cin >> foo;
N = int(foo.size());
for (int(i) = 1, j123 = N; (i) <= j123; (i)++) A[i] = foo[i - 1] - 'a' + 1;
for (int(i) = 1, j123 = N; (i) <= j123; (i)++) S[i] = score[A[i]] + S[i - 1];
long long ans = 0;
for (int i = N - 1; i >= 1; i--) {
cnt[A[i + 1]][S[i]]++;
ans += cnt[A[i]][S[i]];
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 1e18;
const int N = 101234;
const int M = 26;
int n, m;
int val[M];
char s[N];
map<long long, long long> cnt;
long long sum[N];
int main() {
int i, j;
for (i = 0; i < 26; ++i) scanf("%d", &val[i]);
scanf("%s", s);
int len = strlen(s);
for (i = 0; i < len; ++i) sum[i + 1] = sum[i] + val[s[i] - 'a'];
long long ans = 0;
for (i = 0; i < 26; ++i) {
cnt.clear();
for (j = 0; j < len; ++j) {
if (i == s[j] - 'a') {
long long x = sum[j + 1] - 2 * val[i];
if (cnt.find(x) != cnt.end()) ans += cnt[x];
cnt[sum[j]]++;
}
}
}
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int val[26];
long long cm[100000];
map<pair<long long, int>, int> mp;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
for (int i = 0; i < 26; ++i) {
cin >> val[i];
}
long long sm = 0;
string str;
cin >> str;
for (int i = 0; i < ((int)(str).size()) - 1; ++i) {
cm[i] = sm += val[str[i] - 'a'];
++mp[make_pair(sm, str[i + 1] - 'a')];
}
long long ans = 0;
for (int i = 0; i < ((int)(str).size()) - 1; ++i) {
pair<long long, int> p = {cm[i], str[i] - 'a'};
if (mp.count(p) && mp[p] > 0) {
ans += mp[p];
}
--mp[make_pair(cm[i], str[i + 1] - 'a')];
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l, wq[30];
long long sum[100005], ans;
char s[100005];
vector<int> v[100005];
int main() {
for (int i = 0; i < 26; i++) cin >> wq[i];
getchar();
gets(s + 1);
l = strlen(s + 1);
for (int i = 1; i <= l; i++) {
v[s[i] - 'a'].push_back(i);
sum[i] = wq[s[i] - 'a'];
sum[i] = sum[i] + sum[i - 1];
}
for (int i = 0; i < 26; i++) {
map<long long, int> my_map;
for (int j = 0; j < v[i].size(); j++) {
ans = ans + my_map[sum[v[i][j] - 1]];
my_map[sum[v[i][j]]]++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v[5000];
string s;
queue<int> q;
long long F = 1, n, m, k, ans, a[100005], f[100005], d[100005];
int main() {
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> s;
n = s.size();
for (int i = 0; i < n; i++) {
d[i] = a[s[i] - 'a'] + d[i - 1];
v[s[i] - 'a'].push_back(i);
}
for (int i = 0; i < 26; i++) {
map<long long, int> mp;
for (int j = 0; j < v[i].size(); j++) {
ans += mp[d[v[i][j] - 1]];
mp[d[v[i][j]]]++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<long long int, long long int> a[26];
long long int i, c, b[26], sum;
string s;
for (i = 0; i < 26; ++i) {
cin >> b[i];
}
cin >> s;
c = 0;
int ss = s.size();
sum = 0;
for (i = 0; i < ss; ++i) {
c += a[s[i] - 'a'][sum];
sum += b[s[i] - 'a'];
a[s[i] - 'a'][sum]++;
}
cout << c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans, e = 100, sum = 0;
map<long long, long long> mark;
string s;
long long a[28];
int main() {
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> s;
for (int i = 0; i < s.size(); i++) {
ans += mark[sum * e + (s[i] - 'a')];
sum += a[s[i] - 'a'];
mark[sum * e + (s[i] - 'a')]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int val[26];
char str[100020];
map<long long, int> mp[26];
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &val[i]);
scanf("%s", str);
long long sum = 0, ans = 0;
for (int i = 0; str[i]; i++) {
ans += mp[str[i] - 'a'][sum];
sum += val[str[i] - 'a'];
mp[str[i] - 'a'][sum]++;
}
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
void PLAY() {
cout << fixed << setprecision(10);
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
PLAY();
int a[26];
for (int i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
long long res = 0, sum = 0;
map<long long, int> mp[26];
for (int i = 0; i < (int)s.size(); i++) {
res += mp[s[i] - 'a'][sum];
sum += a[s[i] - 'a'];
mp[s[i] - 'a'][sum]++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void in() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
template <typename T>
T modexp(T a, T b, T c) {
T ans = 1;
while (b != 0) {
if (b % 2) ans = (ans * a) % c;
a = (a * a) % c;
b /= 2;
}
return ans;
}
template <typename T>
T C(T n, T r) {
r = min(r, n - r);
T ans = 1;
for (T i = 1; i <= r; i++) {
ans *= (n - r + i);
ans /= i;
}
return ans;
}
const long long inf = LLONG_MAX / 2;
const long long N = (1e3 + 1);
const long long M = 25e6 + 10;
const long long mod = 1000000007;
const long long shit = 13131313139;
const double eps = 1e-9;
long long a[27];
map<long long, long long> m[27];
int main() {
in();
for (long long i = 1; i <= 26; i++) cin >> a[i];
string s;
cin >> s;
long long n = s.length(), sum = 0, ans = 0;
for (long long i = 1; i <= n; i++) {
long long tp = s[i - 1] - 'a' + 1;
sum += a[tp];
ans += m[tp][sum - a[tp]];
m[tp][sum]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5;
vector<long long> g[26];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long a[26];
for (long long i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
long long sz = s.size();
long long val[sz];
val[0] = a[s[0] - 'a'];
for (long long i = 0; i < sz; i++) {
if (i) val[i] = a[s[i] - 'a'] + val[i - 1];
g[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (long long i = 0; i < 26; i++) {
unordered_map<long long, long long> mp;
for (auto it : g[i]) {
ans += mp[val[it] - a[i]];
mp[val[it]]++;
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long sum[N], ans;
int a[27];
string s;
vector<int> pos[27];
int main() {
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> s;
for (int i = 0; i < s.size(); i++) {
sum[i] = a[s[i] - 'a'];
if (i > 0) sum[i] += sum[i - 1];
pos[s[i] - 'a'].push_back(i);
}
for (char i = 'a'; i <= 'z'; i++) {
map<long long, int> mp;
for (int j = 0; j < pos[i - 'a'].size(); j++) {
int x = pos[i - 'a'][j];
if (x - 1 >= 0) ans += mp[sum[x - 1]];
mp[sum[x]]++;
}
mp.clear();
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
while (a && b) a > b ? a %= b : b %= a;
return a + b;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long fast_exp(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = ((res % 1000000007) * (base % 1000000007)) % 1000000007;
base = ((base % 1000000007) * (base % 1000000007)) % 1000000007;
exp /= 2;
}
return res % 1000000007;
}
const int INF = INT_MAX;
const long long INFL = LLONG_MAX;
map<pair<char, long long>, long long> St, End;
int main() {
std::ios::sync_with_stdio(0);
cin.tie(0);
long long A[26];
for (int(i) = 0; (i) < (26); (i)++) {
cin >> A[i];
}
string s;
cin >> s;
long long Sum[s.length()], ans = 0;
Sum[0] = A[s[0] - 'a'];
St[pair<char, long long>(s[0], Sum[0])]++;
if (s.length() != 1) {
End[pair<char, long long>(s[1], Sum[0])]++;
if (St.find(pair<char, long long>(s[1], Sum[0])) != St.end()) {
ans += St[pair<char, long long>(s[1], Sum[0])];
}
}
for (int i = 1; i < s.length(); i++) {
Sum[i] = Sum[i - 1] + A[s[i] - 'a'];
St[pair<char, long long>(s[i], Sum[i])]++;
if (i != s.length() - 1) {
End[pair<char, long long>(s[i + 1], Sum[i])]++;
if (St.find(pair<char, long long>(s[i + 1], Sum[i])) != St.end()) {
long long z = St[pair<char, long long>(s[i + 1], Sum[i])];
ans += z;
}
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
void solve() {
vector<long long int> alpha(26, 0);
for (int i = 0; i < 26; i++) {
cin >> alpha[i];
}
string s;
cin >> s;
vector<long long int> adj[26];
for (int i = 0; i < s.length(); i++) {
adj[s[i] - 'a'].push_back(i);
}
int n = s.size();
vector<long long int> pre(n, 0);
pre[0] = alpha[s[0] - 'a'];
for (int i = 1; i < n; i++) {
pre[i] = pre[i - 1] + alpha[s[i] - 'a'];
}
long long int ans = 0;
for (int i = 0; i < 26; i++) {
if (adj[i].size() < 2) continue;
map<long long int, long long int> mp;
for (int j = 0; j < adj[i].size(); j++) {
long long int idx = adj[i][j];
ans += mp[pre[idx - 1]];
mp[pre[idx]]++;
}
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
cerr << "Time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs"
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long>;
using vvll = vector<vll>;
using vpii = vector<pair<int, int> >;
using vpll = vector<pair<long long, long long> >;
using vld = vector<long double>;
using vb = vector<bool>;
const int inf = (int)1e9 + 7;
const long long llinf = (long long)1e18 + 7;
void solve() {
long long x[27];
for (long long i = 0; i < 26; i++) {
cin >> x[i];
}
string s;
cin >> s;
map<long long, long long> m[257];
long long p = 0;
long long ans = 0;
for (long long i = 0; i < (s.size()); i++) {
ans += m[s[i] - 'a'][p];
p += x[s[i] - 'a'];
m[s[i] - 'a'][p]++;
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ttt = 1;
while (ttt--) {
solve();
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.