text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
int f[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
char a, b;
scanf("%c%c", &a, &b);
printf("%d\n", f[a - '0'] * f[b - '0']);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b, x, y;
int main() {
cin >> n;
a = n / 10;
b = n % 10;
switch (a) {
case 0:
x = 2;
break;
case 1:
x = 7;
break;
case 2:
x = 2;
break;
case 3:
x = 3;
break;
case 4:
x = 3;
break;
case 5:
x = 4;
break;
case 6:
x = 2;
break;
case 7:
x = 5;
break;
case 8:
x = 1;
break;
case 9:
x = 2;
break;
}
switch (b) {
case 0:
y = 2;
break;
case 1:
y = 7;
break;
case 2:
y = 2;
break;
case 3:
y = 3;
break;
case 4:
y = 3;
break;
case 5:
y = 4;
break;
case 6:
y = 2;
break;
case 7:
y = 5;
break;
case 8:
y = 1;
break;
case 9:
y = 2;
break;
}
cout << x * y;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[100];
int main() {
cin >> n;
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[n / 10] * a[n % 10];
}
|
#include <bits/stdc++.h>
using namespace std;
long long oo = (1 << 30);
int solve(char c) {
if (c == '0')
return 2;
else if (c == '1')
return 7;
else if (c == '2')
return 2;
else if (c == '3')
return 3;
else if (c == '4')
return 3;
else if (c == '5')
return 4;
else if (c == '6')
return 2;
else if (c == '7')
return 5;
else if (c == '8')
return 1;
else
return 2;
}
int main() {
char x, y;
cin >> x >> y;
cout << solve(x) * solve(y) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int getPossibles(int n) {
switch (n) {
case 0:
return 2;
break;
case 1:
return 7;
break;
case 2:
return 2;
break;
case 3:
return 3;
break;
case 4:
return 3;
break;
case 5:
return 4;
break;
case 6:
return 2;
break;
case 7:
return 5;
break;
case 8:
return 1;
break;
case 9:
return 2;
break;
}
}
int main() {
string n;
while (cin >> n) {
int ans;
cout << getPossibles(n[0] - '0') * getPossibles(n[1] - '0') << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[2];
long long int s = 1;
cin >> a[0] >> a[1];
for (int i = 0; i <= 1; i++) {
if (a[i] == '0') {
s *= 2;
} else if (a[i] == '1') {
s *= 7;
} else if (a[i] == '2') {
s *= 2;
} else if (a[i] == '3') {
s *= 3;
} else if (a[i] == '4') {
s *= 3;
} else if (a[i] == '5') {
s *= 4;
} else if (a[i] == '6') {
s *= 2;
} else if (a[i] == '7') {
s *= 5;
} else if (a[i] == '8') {
s *= 1;
} else if (a[i] == '9') {
s *= 2;
}
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
void yala_bena() {
cin.tie(0);
std::ios::sync_with_stdio(0);
}
const int m_r = 199999;
int main() {
yala_bena();
int a;
int num[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cin >> a;
cout << num[a / 10] * num[a % 10] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[2], s = 1;
cin >> n;
a[0] = n % 10;
n /= 10;
a[1] = n;
for (int i = 0; i < 2; i++) {
if (a[i] == 0)
s *= 2;
else if (a[i] == 1)
s *= 7;
else if (a[i] == 2)
s *= 2;
else if (a[i] == 3)
s *= 3;
else if (a[i] == 4)
s *= 3;
else if (a[i] == 5)
s *= 4;
else if (a[i] == 6)
s *= 2;
else if (a[i] == 7)
s *= 5;
else if (a[i] == 8)
s *= 1;
else
s *= 2;
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[2];
cin >> n;
a[0] = (n % 100 / 10);
a[1] = (n % 10 / 1);
for (int i = 0; i < 2; i++) {
if (a[i] == 0 || a[i] == 2 || a[i] == 6 || a[i] == 9) {
a[i] = 2;
} else if (a[i] == 5) {
a[i] = 4;
} else if (a[i] == 3) {
a[i] = 3;
} else if (a[i] == 7) {
a[i] = 5;
} else if (a[i] == 1) {
a[i] = 7;
} else if (a[i] == 8) {
a[i] = 1;
} else if (a[i] == 4) {
a[i] = 3;
}
}
n = a[0] * a[1];
cout << n;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
scanf("%d", &n);
printf("%d\n", a[n / 10] * a[n % 10]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mt[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 main() {
int n, cnt1, cnt2, a, b, flag;
string str;
while (cin >> str) {
a = str[0] - '0';
b = str[1] - '0';
cnt1 = 0;
for (int i = 0; i < 10; i++) {
flag = 1;
for (int j = 0; j < 7; j++) {
if (mt[a][j] && !mt[i][j]) {
flag = 0;
break;
}
}
cnt1 += flag;
}
cnt2 = 0;
for (int i = 0; i < 10; i++) {
flag = 1;
for (int j = 0; j < 7; j++) {
if (mt[b][j] && !mt[i][j]) {
flag = 0;
break;
}
}
cnt2 += flag;
}
cout << cnt1 * cnt2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long int modInverse(long long int n, long long int p) {
return power(n, p - 2, p);
}
long long int nCrModPFermat(long long int n, long long int r, long long int p) {
if (r == 0) return 1;
long long int fac[n + 1];
fac[0] = 1;
for (long long int i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
long long int log2_32bit(long long int x) {
long long int res = 0;
while (x >>= 1) res++;
return res;
}
long long int isPowerof2(long long int x) { return (x && !(x & x - 1)); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int a[] = {1, 6, 1, 2, 2, 3, 1, 4, 0, 1};
int n;
cin >> n;
int a1 = n / 10;
int b = n % 10;
int ans = 0;
int s = a[a1];
int s1 = a[b];
int c = 1 + s;
int d = 1 + s1;
cout << c * d << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int a[10];
int main() {
cin >> s;
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[s[0] - '0'] * a[s[1] - '0'];
}
|
#include <bits/stdc++.h>
int T[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
char s[3];
int main() {
scanf("%s", s);
printf("%d\n", T[s[0] - '0'] * T[s[1] - '0']);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int C = 1;
cin >> s;
if (s[0] == '0') {
C *= 2;
} else if (s[0] == '1') {
C *= 7;
} else if (s[0] == '2') {
C *= 2;
} else if (s[0] == '3') {
C *= 3;
} else if (s[0] == '4') {
C *= 3;
} else if (s[0] == '5') {
C *= 4;
} else if (s[0] == '6') {
C *= 2;
} else if (s[0] == '7') {
C *= 5;
} else if (s[0] == '8') {
C *= 1;
} else if (s[0] == '9') {
C *= 2;
}
if (s[1] == '0') {
C *= 2;
} else if (s[1] == '1') {
C *= 7;
} else if (s[1] == '2') {
C *= 2;
} else if (s[1] == '3') {
C *= 3;
} else if (s[1] == '4') {
C *= 3;
} else if (s[1] == '5') {
C *= 4;
} else if (s[1] == '6') {
C *= 2;
} else if (s[1] == '7') {
C *= 5;
} else if (s[1] == '8') {
C *= 1;
} else if (s[1] == '9') {
C *= 2;
}
cout << C;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
int n;
while (scanf("%d", &n) != EOF) {
printf("%d\n", a[n / 10] * a[n % 10]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a = 1;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == '0' || s[i] == '2' || s[i] == '6' || s[i] == '9') a = a * 2;
if (s[i] == '3' || s[i] == '4') a = a * 3;
if (s[i] == '1') a = a * 7;
if (s[i] == '5') a = a * 4;
if (s[i] == '7') a = a * 5;
}
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, arr[20];
string str;
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;
while (cin >> str) {
cout << arr[str[0] - '0'] * arr[str[1] - '0'] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int check(char a) {
switch (a) {
case '1':
return 7;
break;
case '2':
return 2;
break;
case '3':
return 3;
break;
case '4':
return 3;
break;
case '5':
return 4;
break;
case '6':
return 2;
break;
case '7':
return 5;
break;
case '8':
return 1;
break;
case '9':
return 2;
break;
case '0':
return 2;
break;
}
}
int main() {
int x, y;
string a;
cin >> a;
x = check(a[0]);
y = check(a[1]);
cout << x * y;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}, num;
cin >> num;
cout << a[num % 10] * a[num / 10];
return 0;
}
|
#include <bits/stdc++.h>
int parent_digit(int arr[][7], int i) {
int j1, j2, counter, c;
counter = 0;
for (j1 = 0; j1 < 10; j1++) {
c = 0;
for (j2 = 0; j2 < 7; j2++) {
if (arr[j1][j2] - arr[i][j2] == -1) {
c = -1;
break;
}
}
if (c != -1) {
counter += 1;
}
}
return counter;
}
int main() {
int digitstick[10][7] = {{1, 1, 1, 1, 1, 1, 0}, {0, 0, 1, 1, 0, 0, 0},
{0, 1, 1, 0, 1, 1, 1}, {0, 1, 1, 1, 1, 0, 1},
{1, 0, 1, 1, 0, 0, 1}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 0, 1, 1, 1, 1}, {0, 1, 1, 1, 0, 0, 0},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 1, 1, 1, 0, 1}};
int n, n1, n2;
scanf("%d", &n);
n1 = n / 10;
n2 = n % 10;
printf("%d", parent_digit(digitstick, n1) * parent_digit(digitstick, n2));
return 0;
}
|
#include <bits/stdc++.h>
int a[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
char c, d;
scanf("%c%c", &c, &d);
printf("%d\n", a[c - '0'] * a[d - '0']);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int32_t main() {
int a[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cin >> n;
cout << a[n / 10] * a[n % 10] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 123456;
int main() {
int n;
cin >> n;
int a[10][10] = {0};
a[0][0] = 1;
a[0][8] = 1;
a[1][0] = 1;
a[1][1] = 1;
a[1][3] = 1;
a[1][4] = 1;
a[1][7] = 1;
a[1][8] = 1;
a[1][9] = 1;
a[2][2] = 1;
a[2][8] = 1;
a[3][3] = 1;
a[3][8] = 1;
a[3][9] = 1;
a[4][4] = 1;
a[4][8] = 1;
a[4][9] = 1;
a[5][5] = 1;
a[5][6] = 1;
a[5][8] = 1;
a[5][9] = 1;
a[6][6] = 1;
a[6][8] = 1;
a[7][0] = 1;
a[7][3] = 1;
a[7][7] = 1;
a[7][9] = 1;
a[7][8] = 1;
a[8][8] = 1;
a[9][8] = 1;
a[9][9] = 1;
int m = 0, p = 0;
for (int i = 0; i < 10; i++) {
if (a[n / 10][i] == 1) m++;
if (a[n % 10][i] == 1) p++;
}
cout << (m * p);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char ch[3];
int get[2], res = 1, j, i;
gets(ch);
for (i = 0; ch[i] != '\0'; i++) {
if (ch[i] == '0')
get[i] = 2;
else if (ch[i] == '1')
get[i] = 7;
else if (ch[i] == '2')
get[i] = 2;
else if (ch[i] == '3')
get[i] = 3;
else if (ch[i] == '4')
get[i] = 3;
else if (ch[i] == '5')
get[i] = 4;
else if (ch[i] == '6')
get[i] = 2;
else if (ch[i] == '7')
get[i] = 5;
else if (ch[i] == '8')
get[i] = 1;
else if (ch[i] == '9')
get[i] = 2;
}
for (j = 0; j < i; j++) {
res *= get[j];
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, n, m;
long long int a[11] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
while (cin >> n) {
i = n % 10;
n /= 10;
j = n;
cout << a[i] * a[j] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
int N;
cin >> N;
cout << m[N / 10] * m[N % 10] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int t[15] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
int n;
cin >> n;
cout << t[n % 10] * t[n / 10];
}
|
#include <bits/stdc++.h>
using namespace std;
int arrnum[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, 1, 0},
{1, 1, 1, 1, 1, 1, 1}, {1, 1, 1, 1, 0, 1, 1}};
int main() {
int numin;
cin >> numin;
int ekak = numin % 10;
numin /= 10;
int dashak = numin % 10;
int array[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int transform[10] = {1, 6, 1, 2, 2, 3, 1, 4, 0, 1};
int num1 = transform[ekak];
int num2 = transform[dashak];
if (num1 == 0) {
cout << num2 + 1;
} else if (num2 == 0) {
cout << num1 + 1;
} else {
cout << (num1 + 1) * (num2 + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int p, ap;
string s;
cin >> s;
if (s[0] == '5')
p = 4;
else if (s[0] == '3' || s[0] == '4')
p = 3;
else if (s[0] == '7')
p = 5;
else if (s[0] == '8')
p = 1;
else if (s[0] == '1')
p = 7;
else
p = 2;
if (s[1] == '5')
ap = 4;
else if (s[1] == '3' || s[1] == '4')
ap = 3;
else if (s[1] == '7')
ap = 5;
else if (s[1] == '8')
ap = 1;
else if (s[1] == '1')
ap = 7;
else
ap = 2;
cout << ap * p;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int v[10];
v[0] = 2;
v[1] = 7;
v[2] = 2;
v[3] = 3;
v[4] = 3;
v[5] = 4;
v[6] = 2;
v[7] = 5;
v[8] = 1;
v[9] = 2;
char a, b;
cin >> a >> b;
cout << v[(int)a - '0'] * v[(int)b - '0'] << endl;
}
|
#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("%c%c", &x, &y);
int res = mp[x] * mp[y];
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
long long MOD = 1e9 + 7;
using namespace std;
inline string get_string() {
char ch[1000000];
scanf("%s", ch);
return ch;
}
inline int get_Int() {
int x;
scanf("%d", &x);
return x;
}
inline long long get_long() {
long long x;
cin >> x;
return x;
}
int count(char t) {
int number = t - '0';
if (number == 9)
return 2;
else if (number == 8)
return 1;
else if (number == 7)
return 5;
else if (number == 6)
return 2;
else if (number == 5)
return 4;
else if (number == 4)
return 3;
else if (number == 3)
return 3;
else if (number == 2)
return 2;
else if (number == 1)
return 7;
else
return 2;
}
int main() {
char f, s;
cin >> f >> s;
cout << count(f) * count(s) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d[10], x, y, s;
void solve() {
d[0] = 2;
d[1] = 7;
d[2] = 2;
d[3] = 3;
d[4] = 3;
d[5] = 4;
d[6] = 2;
d[7] = 5;
d[8] = 1;
d[9] = 2;
x = n / 10;
y = n % 10;
s = d[x] * d[y];
printf("%d\n", s);
}
int main() {
#pragma comment(linker, "/STACK:67108864")
while (scanf("%d", &n) != EOF) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, v[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cin >> n;
cout << v[n / 10] * v[n % 10];
return 0;
}
|
#include <bits/stdc++.h>
int a[20], n;
using namespace std;
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 >> n;
cout << a[n % 10] * a[n / 10];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
char b, c;
cin >> b >> c;
cout << a[b - '0'] * a[c - '0'];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[11];
char s[5];
int x, y, ans;
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;
scanf("%s", s);
x = s[0] - '0';
y = s[1] - '0';
ans = a[x] * a[y];
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x = n / 10;
int y = n % 10;
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;
cout << a[x] * a[y];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> A;
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;
string s;
cin >> s;
cout << A[s[1]] * A[s[0]] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int t[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
while (cin >> a) cout << t[a / 10] * t[a % 10] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
long long pw(long long b, long long p) {
if (!p) return 1;
long long sq = pw(b, p / 2);
sq *= sq;
if (p % 2) sq *= b;
return sq;
}
long long sd(long long x) { return x < 10 ? x : x % 10 + sd(x / 10); }
double sq(double x) {
for (long long i = 0; i < x; i++)
if ((double)i * i > x) return (i - 1);
return double(1);
}
int main() {
string x;
cin >> x;
int arr[10] = {1, 6, 1, 2, 2, 3, 1, 4, 0, 1};
vector<int> cntt(2, 1);
for (long long i = 0; i < x.size(); i++) cntt[i] += arr[x[i] - '0'];
printf("%d", cntt[0] * cntt[1]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int count[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
cin >> n;
int d2 = n % 10;
int d1 = n / 10;
int c1 = 0;
cout << count[d1] * count[d2];
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int ara[10];
int a, b, res;
ara[0] = 2;
ara[1] = 7;
ara[2] = 2;
ara[3] = 3;
ara[4] = 3;
ara[5] = 4;
ara[6] = 2;
ara[7] = 5;
ara[8] = 1;
ara[9] = 2;
string str;
cin >> str;
a = str[0] - 48;
b = str[1] - 48;
res = ara[a] * ara[b];
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
long long int ans = 1, r;
for (int i = 0; i < n; i++) {
r = s[i];
if (r == '0') {
ans *= 2;
} else if (r == '1') {
ans *= 7;
} else if (r == '2') {
ans *= 2;
} else if (r == '3') {
ans *= 3;
} else if (r == '4') {
ans *= 3;
} else if (r == '5') {
ans *= 4;
} else if (r == '6') {
ans *= 2;
} else if (r == '7') {
ans *= 5;
} else if (r == '8') {
ans *= 1;
} else if (r == '9') {
ans *= 2;
}
}
cout << ans << endl << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
int n;
while (cin >> n) {
if (n < 10) {
cout << a[n] * 2 << endl;
} else {
int p = n / 10;
int q = n % 10;
cout << a[p] * a[q] << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10], n;
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 >> n;
int t = n % 10;
int ans = a[t];
n = n / 10;
ans = ans * a[n];
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int check(char ch) {
if (ch == '0')
return 2;
else if (ch == '1')
return 7;
else if (ch == '2')
return 2;
else if (ch == '3')
return 3;
else if (ch == '4')
return 3;
else if (ch == '5')
return 4;
else if (ch == '6')
return 2;
else if (ch == '7')
return 5;
else if (ch == '8')
return 1;
else
return 2;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
cin >> s;
cout << check(s[0]) * check(s[1]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
int good(int n) {
switch (n) {
case 0:
return 2;
break;
case 1:
return 7;
break;
case 2:
return 2;
break;
case 3:
return 3;
break;
case 4:
return 3;
break;
case 5:
return 4;
break;
case 6:
return 2;
break;
case 7:
return 5;
break;
case 8:
return 1;
break;
case 9:
return 2;
break;
}
return 0;
}
int main() {
int n, first, second;
scanf("%d", &n);
first = good(n % 10);
second = good((n / 10) % 10);
printf("%d", first * second);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string arr[] = {"017", "1", "2", "137", "14",
"5", "56", "71", "0123456789", "135749"};
string a;
int check(string c) {
if ((int)arr[c[0] - '0'].find(a[0]) != -1 &&
(int)arr[c[1] - '0'].find(a[1]) != -1)
return 1;
else
return 0;
}
int main() {
ios::sync_with_stdio(false);
int ans = 0;
cin >> a;
for (int i = '0'; i <= '9'; i++) {
for (int j = '0'; j <= '9'; j++) {
string ch;
ch.push_back(i);
ch.push_back(j);
ans += check(ch);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
string x;
while (cin >> x) {
int x1[2];
x1[0] = (int)x[0] - 48;
x1[1] = (int)x[1] - 48;
int help[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int max;
int help1;
int help2;
for (int i = 0; i < 10; i++) {
if (i == x1[0]) {
help1 = help[i];
}
if (i == x1[1]) {
help2 = help[i];
}
}
cout << help1 * help2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, x1, x2;
cin >> a;
x1 = a / 10;
x2 = a % 10;
switch (x1) {
case 0:
x1 = 2;
break;
case 1:
x1 = 7;
break;
case 2:
x1 = 2;
break;
case 3:
x1 = 3;
break;
case 4:
x1 = 3;
break;
case 5:
x1 = 4;
break;
case 6:
x1 = 2;
break;
case 7:
x1 = 5;
break;
case 8:
x1 = 1;
break;
case 9:
x1 = 2;
break;
}
switch (x2) {
case 0:
x2 = 2;
break;
case 1:
x2 = 7;
break;
case 2:
x2 = 2;
break;
case 3:
x2 = 3;
break;
case 4:
x2 = 3;
break;
case 5:
x2 = 4;
break;
case 6:
x2 = 2;
break;
case 7:
x2 = 5;
break;
case 8:
x2 = 1;
break;
case 9:
x2 = 2;
break;
}
cout << x1 * x2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int res = 1;
for (int i = 0; i < 2; i++) {
char c;
cin >> c;
switch (c) {
case '0':
res *= 2;
break;
case '1':
res *= 7;
break;
case '2':
res *= 2;
break;
case '3':
res *= 3;
break;
case '4':
res *= 3;
break;
case '5':
res *= 4;
break;
case '6':
res *= 2;
break;
case '7':
res *= 5;
break;
case '8':
res *= 1;
break;
case '9':
res *= 2;
break;
}
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int g[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int a;
cin >> a;
cout << g[a / 10] * g[a % 10];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
int num[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cin >> n;
cout << num[n[0] - 48] * num[n[1] - 48];
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, x[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
scanf("%1d%1d", &a, &b);
printf("%d", x[a] * x[b]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num, num1, num2, goodValueNum;
cin >> num;
int badValues[2];
num2 = num % 10;
num1 = (num - num2) / 10;
badValues[0] = num1;
badValues[1] = num2;
int possibleNum[2];
for (int i = 0; i < 2; i++) {
if (badValues[i] == 0)
possibleNum[i] = 2;
else if (badValues[i] == 1)
possibleNum[i] = 7;
else if (badValues[i] == 2)
possibleNum[i] = 2;
else if (badValues[i] == 3)
possibleNum[i] = 3;
else if (badValues[i] == 4)
possibleNum[i] = 3;
else if (badValues[i] == 5)
possibleNum[i] = 4;
else if (badValues[i] == 6)
possibleNum[i] = 2;
else if (badValues[i] == 7)
possibleNum[i] = 5;
else if (badValues[i] == 8)
possibleNum[i] = 1;
else if (badValues[i] == 9)
possibleNum[i] = 2;
}
goodValueNum = possibleNum[0] * possibleNum[1];
cout << goodValueNum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string t[] = {"1111110", "0110000", "1101101", "1111001", "0110011",
"1011011", "1011111", "1110000", "1111111", "1111011"};
vector<string> a(t, t + 10);
string p;
cin >> p;
int cnt = 0;
for (int i = 0; i <= 99; i++) {
int y1 = (p[1] - '0');
int y2 = (p[0] - '0');
int x1 = (i % 10);
int x2 = (i / 10) % 10;
bool done = true;
for (int j = 0; j < 7; j++) {
if (a[x1][j] == '0' && a[y1][j] == '1') done = false;
}
if (done) {
for (int j = 0; j < 7; j++) {
if (a[x2][j] == '0' && a[y2][j] == '1') done = false;
}
}
if (done) cnt++;
}
cout << cnt << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int func(int n) {
switch (n) {
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;
default:
return 2;
}
return 0;
}
int main() {
int n;
cin >> n;
cout << func(n % 10) * func(n / 10) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
char c2 = s[0], c1 = s[1];
int mas[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cout << mas[c2 - '0'] * mas[c1 - '0'] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int ct[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
scanf("%d", &n);
int first = n / 10, second = n % 10;
int ans = ct[first] * ct[second];
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long pow2(long long k, long long h) {
if (h == 0)
return 1;
else if (h == 1)
return k;
else {
long long p = pow2(k, h / 2);
p *= p;
if (h % 2 == 1) p *= k;
return p;
}
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
bool cmp(string a, string b) {
if (a.size() < b.size())
return 1;
else
return 0;
}
const double EPS = 1e-8;
long long bbb(long long n) {
long long g = 0, i = 1;
while (n > 0) {
g += (n % 10) * i;
i *= 10;
n /= 10;
}
return g;
}
long long two(long long a, vector<long long>& s) {}
long long x[1001009];
long long bintwo(long long a, vector<long long>& v) {
long long l = 0, r = v.size() - 1;
long long mintwo = 1e9;
while (l <= r) {
long long mid = (l + r) / 2;
if (abs(a - v[mid]) <= mintwo) {
mintwo = abs(a - v[mid]);
if (a >= v[mid])
l = mid + 1;
else
r = mid - 1;
} else
r = mid - 1;
}
return mintwo;
}
long long binthree(long long a, vector<long long>& v) {
long long l = 0, r = v.size() - 1;
long long minthree = 1e9;
while (l <= r) {
long long mid = (l + r) / 2;
if (abs(a - v[mid]) <= minthree) {
minthree = abs(a - v[mid]);
if (a >= v[mid])
l = mid + 1;
else
r = mid - 1;
} else
r = mid - 1;
}
return minthree;
}
string fok(string s) {
long long i = 0;
char a = 'a';
map<char, char> pp;
for (long long i = 0; i < s.length(); ++i) pp[s[i]] = '*';
for (long long i = 0; i < s.length(); ++i) {
if (pp[s[i]] == '*') {
pp[s[i]] = a;
s[i] = a;
a++;
} else
s[i] = pp[s[i]];
}
return s;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string n;
cin >> n;
map<char, long long> p;
p['0'] = 2;
p['1'] = 7;
p['2'] = 2;
p['3'] = 3;
p['4'] = 3;
p['5'] = 4;
p['6'] = 2;
p['7'] = 5;
p['8'] = 1;
p['9'] = 2;
long long ans = 1;
for (int i = 0; i < n.length(); ++i) ans *= p[n[i]];
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string num;
int c[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
while (cin >> num) {
cout << c[num[0] - '0'] * c[num[1] - '0'] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x, y;
int a[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
cin >> n;
x = n % 10;
y = n / 10;
for (int i = 0; i < 10; i++)
if (x == i) {
x = a[i];
break;
}
for (int j = 0; j < 10; j++)
if (y == j) {
y = a[j];
break;
}
cout << x * y << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sticks[10];
memset(sticks, 0, sizeof(sticks));
sticks[0] = 2;
sticks[1] = 7;
sticks[2] = 2;
sticks[3] = 3;
sticks[4] = 3;
sticks[5] = 4;
sticks[6] = 2;
sticks[7] = 5;
sticks[8] = 1;
sticks[9] = 2;
char str[3];
scanf("%s", str);
printf("%d\n", sticks[str[0] - '0'] * sticks[str[1] - '0']);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct st {
long long ai;
long long bi;
};
bool acomp(st a, st b) { return (a.bi < b.bi); }
using namespace std;
long long bs(int hits, int x, int y) {
int low = 0;
int high = x;
int ans = 0;
while (low <= high) {
long long mid = low + (high - low) / 2;
long long ythhits = (mid * y) / x;
if (ythhits + mid == hits) {
if ((mid * y) % x == 0) {
return -1;
} else {
return 1;
}
} else if (ythhits + mid > hits) {
high = mid - 1;
} else if (ythhits + mid < hits) {
low = mid + 1;
if ((((((mid * y) / x) + 1) / y) + mid) == hits) {
return 0;
}
}
}
return ans;
}
int main() {
int i, j, k;
int ar[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
cin >> n;
;
if (n <= 9) {
printf("%d\n", ar[0] * ar[n]);
} else {
printf("%d\n", ar[n % 10] * ar[n / 10]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[10];
int b[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}, x, y;
scanf("%s", a);
x = a[0] - '0';
y = a[1] - '0';
printf("%d\n", b[x] * b[y]);
return 0;
}
|
#include <bits/stdc++.h>
int val[10] = {
127 - 2, 16 + 64, 127 - 8 - 64, 127 - 8 - 32, 127 - 1 - 4 - 32,
127 - 16 - 32, 127 - 16, 1 + 16 + 64, 127, 127 - 32};
int n;
int main() {
scanf("%d", &n);
int d1 = (n / 10), d2 = (n % 10), cnt1 = 0, cnt2 = 0;
for (int i = 0; i < 10; i++)
if ((val[d1] & val[i]) == val[d1]) cnt1++;
for (int i = 0; i < 10; i++)
if ((val[d2] & val[i]) == val[d2]) cnt2++;
printf("%d\n", cnt1 * cnt2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int arr[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
cin >> n;
cout << arr[n / 10] * arr[n % 10];
}
|
#include <bits/stdc++.h>
int data[]{2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
int a, b;
scanf("%1d%1d", &a, &b);
printf("%d\n", data[a] * data[b]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool ok(int o, int t) {
if (o == 9) {
if (t == 9 || t == 8)
return true;
else
return false;
}
if (o == 8) {
if (t == 8)
return true;
else
return false;
}
if (o == 7) {
if (t == 9 || t == 8 || t == 7 || t == 3 || t == 0)
return true;
else
return false;
}
if (o == 6) {
if (t == 8 || t == 6)
return true;
else
return false;
}
if (o == 5) {
if (t == 9 || t == 8 || t == 6 || t == 5)
return true;
else
return false;
}
if (o == 4) {
if (t == 9 || t == 8 || t == 4)
return true;
else
return false;
}
if (o == 3) {
if (t == 9 || t == 8 || t == 3)
return true;
else
return false;
}
if (o == 2) {
if (t == 8 || t == 2)
return true;
else
return false;
}
if (o == 1) {
if (t == 9 || t == 8 || t == 7 || t == 4 || t == 3 || t == 1 || t == 0)
return true;
else
return false;
}
if (o == 0) {
if (t == 8 || t == 0)
return true;
else
return false;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int f, s;
f = n / 10;
s = n % 10;
int res = 0;
for (int x = 0; x <= 9; x++) {
for (int y = 0; y <= 9; y++) {
if (ok(f, x) && ok(s, y)) res++;
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int digits(int x) { return x["chcddecfbc"] - 'a'; }
int main() {
int n;
cin >> n;
cout << (digits(n % 10) * digits(n / 10)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int digit[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
string n;
cin >> n;
int a = digit[(n[1] - 48)];
int b = digit[(n[0] - 48)];
cout << a * b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
a = b = 0;
if (s[0] == '0') a = 2;
if (s[0] == '1') a = 7;
if (s[0] == '2') a = 2;
if (s[0] == '3') a = 3;
if (s[0] == '4') a = 3;
if (s[0] == '5') a = 4;
if (s[0] == '6') a = 2;
if (s[0] == '7') a = 5;
if (s[0] == '8') a = 1;
if (s[0] == '9') a = 2;
if (s[1] == '0') b = 2;
if (s[1] == '1') b = 7;
if (s[1] == '2') b = 2;
if (s[1] == '3') b = 3;
if (s[1] == '4') b = 3;
if (s[1] == '5') b = 4;
if (s[1] == '6') b = 2;
if (s[1] == '7') b = 5;
if (s[1] == '8') b = 1;
if (s[1] == '9') b = 2;
cout << a * b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int cnt[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
char c1, c2;
int main() {
cin >> c1 >> c2;
cout << cnt[c1 - '0'] * cnt[c2 - '0'] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int a[] = {1, 6, 1, 2, 2, 3, 1, 4, 0, 1};
int main() {
int n;
cin >> n;
cout << a[n / 10] * a[n % 10] + a[n / 10] + a[n % 10] + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m[100100];
int main() {
int n;
char s[10];
while (cin >> s) {
int ans = 0;
int t[10];
int size = strlen(s);
for (int i = 0; i < size; i++) {
t[i] = s[i] - '0';
}
int sum = 1;
for (int i = 0; i < size; i++) {
if (t[i] == 1)
sum *= 7;
else if (t[i] == 0)
sum *= 2;
else if (t[i] == 2)
sum *= 2;
else if (t[i] == 3)
sum *= 3;
else if (t[i] == 4)
sum *= 3;
else if (t[i] == 5)
sum *= 4;
else if (t[i] == 6)
sum *= 2;
else if (t[i] == 7)
sum *= 5;
else if (t[i] == 8)
sum *= 1;
else if (t[i] == 9)
sum *= 2;
}
cout << sum << endl;
}
}
|
#include <bits/stdc++.h>
int a, b, x[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
scanf("%1d%1d", &a, &b);
printf("%d", x[a] * x[b]);
}
|
#include <bits/stdc++.h>
int main(int argc, char* argv[]) {
char n[2];
int digiterror[2], i, total;
for (i = 0; i < 2; i++) scanf("%c", &n[i]);
for (i = 0; i < 2; i++) {
switch (n[i]) {
case '0':
digiterror[i] = 2;
break;
case '1':
digiterror[i] = 7;
break;
case '2':
digiterror[i] = 2;
break;
case '3':
digiterror[i] = 3;
break;
case '4':
digiterror[i] = 3;
break;
case '5':
digiterror[i] = 4;
break;
case '6':
digiterror[i] = 2;
break;
case '7':
digiterror[i] = 5;
break;
case '8':
digiterror[i] = 1;
break;
case '9':
digiterror[i] = 2;
break;
}
}
total = digiterror[0] * digiterror[1];
printf("%d\n", total);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char x, y;
int i, j;
scanf("%c%c", &x, &y);
if (x == '1')
i = 7;
else if (x == '7')
i = 5;
else if (x == '5')
i = 4;
else if (x == '3' || x == '4')
i = 3;
else if (x == '2' || x == '9' || x == '6' || x == '0')
i = 2;
else if (x == '8')
i = 1;
if (y == '1')
j = 7;
else if (y == '7')
j = 5;
else if (y == '5')
j = 4;
else if (y == '3' || y == '4')
j = 3;
else if (y == '2' || y == '9' || y == '6' || y == '0')
j = 2;
else if (y == '8')
j = 1;
printf("%d\n", i * j);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<vector<bool>> ch;
int dfs(vector<bool> arr, int i) {
int res = 0;
if (!(i < arr.size())) {
return (int)(ch.count(arr));
} else {
if (!arr[i]) {
res += dfs(arr, i + 1);
arr[i] = 1;
res += dfs(arr, i + 1);
} else
res += dfs(arr, i + 1);
}
return res;
}
int main() {
int n;
cin >> n;
vector<vector<bool>> seg(10, vector<bool>(7, 0));
seg[0] = {1, 1, 1, 1, 1, 1, 0};
seg[1] = {0, 1, 1, 0, 0, 0, 0};
seg[2] = {1, 1, 0, 1, 1, 0, 1};
seg[3] = {1, 1, 1, 1, 0, 0, 1};
seg[4] = {0, 1, 1, 0, 0, 1, 1};
seg[5] = {1, 0, 1, 1, 0, 1, 1};
seg[6] = {1, 0, 1, 1, 1, 1, 1};
seg[7] = {1, 1, 1, 0, 0, 0, 0};
seg[8] = {1, 1, 1, 1, 1, 1, 1};
seg[9] = {1, 1, 1, 1, 0, 1, 1};
for (auto i : seg) ch.insert(i);
cout << dfs(seg[n / 10], 0) * dfs(seg[n % 10], 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int main() {
int n;
string s;
cin >> s;
int res = 1;
for (int i = 0; i < 2; i++) {
if (s[i] == '0' || s[i] == '9' || s[i] == '6' || s[i] == '2')
res *= 2;
else if (s[i] == '8')
res *= 1;
else if (s[i] == '7')
res *= 5;
else if (s[i] == '3' || s[i] == '4')
res *= 3;
else if (s[i] == '5')
res *= 4;
else if (s[i] == '1')
res *= 7;
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
const int INF = (int)1e9 + 7;
const int MX = (int)1e6 + 17;
using namespace std;
int num(int x) {
if (x == 0) return 2;
if (x == 1) return 7;
if (x == 2) return 2;
if (x == 3) return 3;
if (x == 4) return 3;
if (x == 5) return 4;
if (x == 6) return 2;
if (x == 7) return 5;
if (x == 8) return 1;
if (x == 9) return 2;
}
int ans(string x) {
int zh = 0;
int f = x[0] - 48;
int s = x[1] - 48;
zh = num(f) * num(s);
return zh;
}
void solve() {
string s;
cin >> s;
cout << ans(s);
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cal(int a);
int main() {
int num, a, b;
cin >> num;
b = num % 10;
a = num / 10;
cout << cal(a) * cal(b) << endl;
return 0;
}
int cal(int a) {
if (a == 0) return 2;
if (a == 1) return 7;
if (a == 2) return 2;
if (a == 3) return 3;
if (a == 4) return 3;
if (a == 5) return 4;
if (a == 6) return 2;
if (a == 7) return 5;
if (a == 8) return 1;
if (a == 9) return 2;
}
|
#include <bits/stdc++.h>
using namespace std;
const int s[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
char num[5];
while (scanf("%s", num) != EOF) {
int a = num[0] - '0';
int b = num[1] - '0';
printf("%d\n", s[a] * s[b]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num, num1, num2, comb1, comb2;
cin >> num;
num1 = num / 10;
num2 = num % 10;
switch (num1) {
case 0:
comb1 = 2;
break;
case 1:
comb1 = 7;
break;
case 2:
comb1 = 2;
break;
case 3:
comb1 = 3;
break;
case 4:
comb1 = 3;
break;
case 5:
comb1 = 4;
break;
case 6:
comb1 = 2;
break;
case 7:
comb1 = 5;
break;
case 8:
comb1 = 1;
break;
case 9:
comb1 = 2;
break;
}
switch (num2) {
case 0:
comb2 = 2;
break;
case 1:
comb2 = 7;
break;
case 2:
comb2 = 2;
break;
case 3:
comb2 = 3;
break;
case 4:
comb2 = 3;
break;
case 5:
comb2 = 4;
break;
case 6:
comb2 = 2;
break;
case 7:
comb2 = 5;
break;
case 8:
comb2 = 1;
break;
case 9:
comb2 = 2;
break;
}
int ans = comb1 * comb2;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const double eps = 1e-8;
const int MAXN = 10000 + 10;
const int MOD = 1000007;
const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int cnt[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
char a, b;
a = getchar();
b = getchar();
printf("%d\n", cnt[a - '0'] * cnt[b - '0']);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i;
char a, c;
int b[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
while (scanf("%c%c", &a, &c) != EOF) {
getchar();
a = b[a - 48];
c = b[c - 48];
printf("%d\n", a * c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, f, l, ff, ll;
cin >> n;
f = n / 10;
l = n % 10;
if (f == 0)
ff = 2;
else if (f == 1)
ff = 7;
else if (f == 2)
ff = 2;
else if (f == 3)
ff = 3;
else if (f == 4)
ff = 3;
else if (f == 5)
ff = 4;
else if (f == 6)
ff = 2;
else if (f == 7)
ff = 5;
else if (f == 8)
ff = 1;
else if (f == 9)
ff = 2;
ll = ff;
if (l == 0)
ff = 2;
else if (l == 1)
ff = 7;
else if (l == 2)
ff = 2;
else if (l == 3)
ff = 3;
else if (l == 4)
ff = 3;
else if (l == 5)
ff = 4;
else if (l == 6)
ff = 2;
else if (l == 7)
ff = 5;
else if (l == 8)
ff = 1;
else if (l == 9)
ff = 2;
cout << ll * ff << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int counter(char a) {
int c = 1;
if ('9' == a || '2' == a || '6' == a || '0' == a)
c = 2;
else if ('7' == a)
c = 5;
else if ('5' == a)
c = 4;
else if ('3' == a || '4' == a)
c = 3;
else if ('1' == a)
c = 7;
return c;
}
int main() {
string n;
cin >> n;
int co = 1;
for (int i = 0; i < 2; i++) {
co *= counter(n[i]);
}
cout << co << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
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;
cout << a[s[0] - '0'] * a[s[1] - '0'] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int q[10] = {63, 33, 91, 115, 117, 118, 126, 35, 127, 119};
int ans = 0, x = q[n / 10], y = q[n % 10];
for (int i = 0; i < 100; i++) {
int a = i / 10, b = i % 10;
bool p = false;
for (int j = 0; j < 128; j++)
for (int k = 0; k < 128; k++)
if ((q[a] & j) == x && (q[b] & k) == y) p = true;
if (p) ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int num[15];
int n;
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;
cin >> n;
cout << num[n % 10] * num[n / 10] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int d[10][7] = {1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0,
1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1,
1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0,
0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1};
bool check(int x, int y) {
int digit1 = x % 10;
bool f;
if (x == 33) f = true;
x /= 10;
int digit2 = y % 10;
y /= 10;
for (int i = 0; i < 7; ++i)
if (d[y][i] == 1 && d[x][i] == 0) return false;
for (int i = 0; i < 7; ++i)
if (d[digit2][i] == 1 && d[digit1][i] == 0) return false;
return true;
}
int main() {
int n;
cin >> n;
int ret = 0;
for (int i = 0; i < 100; ++i)
if (check(i, n)) {
ret++;
}
cout << ret << '\n';
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
T Max(T a, T b) {
return a < b ? b : a;
}
template <class T>
T Min(T a, T b) {
return a < b ? a : b;
}
template <class T>
T Max3(T a, T b, T c) {
return Max(Max(a, b), c);
}
template <class T>
T Min3(T a, T b, T c) {
return Min(Min(a, b), c);
}
template <class T>
void Swap(T& a, T& b) {
T temp;
temp = a;
a = b;
b = temp;
}
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int arr[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
char ch;
int a, b;
cin >> ch;
a = ch - '0';
cin >> ch;
b = ch - '0';
cout << arr[a] * arr[b];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int main() {
string s;
cin >> s;
cout << arr[s[0] - '0'] * arr[s[1] - '0'] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6;
const int inf = 1e9 + 77;
const int MOD = 1e9 + 7;
long long x[MAX];
char ALPH[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
char ALPH_C[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
long long power(long long x, long long y) {
if (y == 0) return 1;
long long second = power(x, y / 2);
second *= second;
if (y % 2 == 1) second *= x;
return second;
}
long long sum = 1;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
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;
string second;
cin >> second;
for (int i = 0; i < second.size(); i++) {
sum *= mp[second[i]];
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2};
int n;
cin >> n;
int a = n % 10;
int b = n / 10;
int ans = A[a] * A[b];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char str[5];
int a, b;
while (gets(str)) {
if (str[0] == '0') {
a = 2;
} else if (str[0] == '1') {
a = 7;
} else if (str[0] == '2') {
a = 2;
} else if (str[0] == '3') {
a = 3;
} else if (str[0] == '4') {
a = 3;
} else if (str[0] == '5') {
a = 4;
} else if (str[0] == '6') {
a = 2;
} else if (str[0] == '7') {
a = 5;
} else if (str[0] == '8') {
a = 1;
} else if (str[0] == '9') {
a = 2;
}
if (str[1] == '0') {
b = 2;
} else if (str[1] == '1') {
b = 7;
} else if (str[1] == '2') {
b = 2;
} else if (str[1] == '3') {
b = 3;
} else if (str[1] == '4') {
b = 3;
} else if (str[1] == '5') {
b = 4;
} else if (str[1] == '6') {
b = 2;
} else if (str[1] == '7') {
b = 5;
} else if (str[1] == '8') {
b = 1;
} else if (str[1] == '9') {
b = 2;
}
printf("%d\n", a * b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char n[9];
int ans;
int main(int agrc, char **argv) {
scanf("%s", n);
ans = 1;
for (int i = 0; i < 2; i++) {
if (n[i] == '0') {
ans *= 2;
} else if (n[i] == '1') {
ans *= 7;
} else if (n[i] == '2') {
ans *= 2;
} else if (n[i] == '3') {
ans *= 3;
} else if (n[i] == '4') {
ans *= 3;
} else if (n[i] == '5') {
ans *= 4;
} else if (n[i] == '6') {
ans *= 2;
} else if (n[i] == '7') {
ans *= 5;
} else if (n[i] == '8') {
ans *= 1;
} else {
ans *= 2;
}
}
printf("%d\n", ans);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.