Search is not available for this dataset
name stringlengths 2 88 | description stringlengths 31 8.62k | public_tests dict | private_tests dict | solution_type stringclasses 2
values | programming_language stringclasses 5
values | solution stringlengths 1 983k |
|---|---|---|---|---|---|---|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 |
def phonenubers(str1):
count=0
if len(str1)==11:
count+=str1.count('8')
else:
count+=str1.count('8')//2
return count
t=int(input())
n=input()
print(phonenubers(n))
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
string sum(string a, string b) {
string ans = "";
for (long long i = 0; i <= max((int((a.size()))), (int((b.size())))); i++)... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | from copy import copy
n = int(raw_input())
s = list(raw_input())
ss = copy(s)
if '8' in ss:
ss.remove('8')
eig = []; other = []
dico = {}
for i in s:
if i == '8':
eig.append(i)
if len(eig) == 0:
print 0
elif len((ss)) < 10:
print 0
else:
for i in ss:
dico.setdefault(i,... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
int no = n / 10;
char temp;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
if (temp == '8') {
count++;
}
}
cout << min(count, no);
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java |
import java.io.BufferedReader;
import java.io.InputStreamReader;
//import for Scanner and other utility classes
import java.util.*;
import java.io.*;
public class TestClass
{
static class InputReader
{
private final InputStream stream;
private final byte[] buf = new byte[8192];
priv... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
s = input()
num = 0
div = n/11
for i in s:
if i == '8':
num = num +1
if num == div:
break
if num > 0:
print(num)
else:
print(0)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.util.*;
import java.io.*;
public class Solution {
public static PrintWriter w = new PrintWriter(System.out);
public static void main(String args[] ) throws Exception {
Reader in = new Reader();
int n = in.nextInt();
char[] arr = in.next().toCharArray();
int cnt = 0;
for (char c : arr) {
if(c... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | x = input()
s = list(raw_input())
d = s.count('8')
if d!=0:
e = x - d
ans = e/10
f = e%10
if e/10 != d:
ans += (f + d - e/10)/11
print ans
else: print 0 |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | #a =[int(i) for i in input().split()]
n=int(input())
s=input()
eight=0
other=0
for i in s:
if i=='8':
eight+=1
else:
other+=1
z=0
while z<eight and z*10<other+eight-z:
z+=1
print(z) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main(void) {
int n;
char s[1000], dummy[1];
int number = 0;
scanf("%d", &n);
gets(dummy);
gets(s);
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
number++;
if (number == n % 10) {
break;
}
}
}
printf("%d", number);
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | c=0
n=int(input())
s=input()
if n<11 or '8' not in s:
print('0')
else:
a=len(s)-s.count('8')
b=s.count('8')
while a>=10:
b-=1
a-=10
c+=1
while a+(b-1)>=10:
b-=10-a
c+=1
print(c) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
angka = str(input())
angka = str(angka)
if "8" not in angka :
print(0)
elif n == 100 and 1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026==1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026 :
p... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | import sys
digits = int(input())
num = input()
total = 0
for i in range(len(num)):
if total == digits//11:
print(total)
sys.exit()
if num[i] == '8':
total += 1
continue
if total == digits//11:
print(total)
sys.exit()
print(0) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long NMAX = 2005;
const long P = 998244353;
const int inf = 1000000;
int n, m, k;
int main() {
cin >> n;
int st = 0;
char c;
for (int i = 1; i <= n; ++i) {
cin >> c;
if (c == '8') {
st++;
}
}
int rest = n - st;
cout << min(st, n / 8);
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
while (n--) {
int x;
cin >> x;
if (x == 8) {
ans++;
}
}
cout << min(ans, n / 11) << endl;
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
a=input()
b=list(map(int,list(str(a))))
import itertools
if 8 not in b or n<11:print(0);exit()
b.remove(8)
l=n-1
print(l//10)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | n=int(raw_input())
l=list(int(n) for n in raw_input().split())
m=n/11
h=l.count(8)
if h>=m:
print m
if h<m:
print h
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | n=int(raw_input())
T=raw_input()
r=T.count("8")
m=n//8
if(m>=r):
print(r)
else:
print(m)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
string s;
int N;
int isShrink(int i) {
int eDigitCntLeft = 0, eDigitCntRight = 0;
bool isLeft = true, isRight = true;
for (int cnt = i, eDigit = 0; eDigit < 11; eDigit++) {
if (cnt < 0 || cnt >= N) {
isLeft = false;
break;
}
if (s[cnt] == '8') ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 100001;
vector<long long int> v;
long long int ar[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
string s;
cin >> s;
long long int c = 0;
for (int i = 0; i < n; i++)
if (s[i] =... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java |
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a = in.nextInt();
String s = in.next();
int num=0;
for (int i = 0; i < s.length(); i++) {
if(s.charAt(i) == '8')
num++... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | N = int(input())
eight_amount = input().count("8")
if eight_amount == 0:
print(0)
else:
print((N // 11) * max(1, min(N // 11, eight_amount))) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.*;
import java.math.*;
import java.io.*;
import java.text.*;
public class hacker
{
static float area(int x1, int y1, int x2,
int y2, int x3, int y3)
{
return (flo... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | x=int(input())
a=input()
b=a.count("8")
if b>=x//11:
print(x//11)
else:
print(0) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
int n, i;
scanf("%d", &n);
int a[n], c;
scanf("%d", a);
for (i = 0; i < n; i++) {
if (a[i] == 8) c++;
}
if (n / 11 == c)
printf("%d", c);
else if (c < n / 11)
printf("%d", c);
else
printf("%d", n / 11);
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.util.Scanner;
public class PhoneNumber {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n=scan.nextInt();
scan.nextLine();
String s=scan.nextLine();
int c=0;
for(int i=0;i<n;i++)
{
if(s.charAt(i)=='8') c++;
}
if(c%2==0) System.out.println(c/2);
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | #-------------Program--------------
#----Kuzlyaev-Nikita-Codeforces----
#-------------Training-------------
#----------------------------------
n=int(input())
a=list(str(input()))
v=a.count("8");r=n-v
answer=0
for i in range(n):
if v==0:
break
if r>=10:
v-=1;r-=10;answer+=1
else:
if... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.util.Scanner;
public class Phone {
public static void main(String[] args) {
Scanner scanner = new Scanner (System.in);
int n = scanner.nextInt();
String s = scanner.next();
int d=0;
for (int i=0;i<n;i++) {
if (s.charAt(i)=='8') d++;
}
n--;
int [] a;a=new int [n];int ans=0;
for (int i=0;i<d;i++) ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | n = int(raw_input())
s = raw_input()
if "8" not in s or len(s) < 11:
print(0)
else:
print((len(s)-1)//8)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n;
string s;
cin >> s;
int l = s.length();
if (n == l)
if ((n % 11) == 0) c = n / 11;
int c1 = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '8') c1++;
}
if (c1 >= c)
cout << c;
else
cout << c1;
return 0;
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int n, d8, dk;
char a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
while (cin >> a) {
if (a == '8')
d8++;
else
dk++;
}
while (dk / 8 < d8) {
dk++;
d8--;
}
cout << d8;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
s=input()
eight=0
other=0
for i in s:
if i=='8':
eight+=1
else:
other+=1
z=0
a= eight+other
while z<eight and a>0:
z+=1
a-=11
print(z) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author nirav
*/
public class Mai... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | long = int(input())
ch = input()
nb = 0
for i in range(0, long):
if ch[i] == '8':
nb += 1
if nb == 0:
print(0)
elif nb == 1 and long >= 11:
print(1)
elif nb == long:
print(int(long // 10) - 1)
else:
while (((long - nb - 1) % 10 != 0) or (long - nb) >= 10) and nb != 2:
nb -= 1
if ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | n = int(raw_input())
s = raw_input()
if len(s) < 11:
ans = 0
else:
y = s.count("8")
rem = len(s) - y
ans = 0
for i in range(y):
if rem >= 10:
y-=1
rem-=10
ans+=1
elif rem+y >=11:
ans+=1
break
print(ans)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string a;
cin >> a;
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += (a[i] == '8');
}
cout << min(ans, n / 8) << "\n";
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
arr=input()
d=[0]*10
for i in arr:
d[int(i)]+=1
if(d[8]==0 or len(arr)<11):
print(0)
else:
count=0
if(d[0]>=10 and d[8]>=1):
count+=1
d[0]-=10
d[8]-=1
x=min(d)
z=d[8]
z=int(z)
if(x*2==z):
count+=x
else:
count+=abs(x-z)
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
int len;
scanf("%d ", &len);
char cln[len];
gets(cln);
int dig = 0;
for (int l = 0; l < len; l++) {
if (cln[l] == '8') dig++;
}
int ll = strlen(cln) / 11;
if (dig < ll) ll = ll - dig;
printf("%d\n", ll);
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
string s;
cin >> s;
int l = s.length();
for (long long int i = 0; i < l; i++) {
if (s[i] == '8') {
cnt++;
}
}
int d = n / 11;
if (d <= cnt) {
cout << d << endl;
} else {
cout << 0 << endl;
}
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.util.*;
import java.math.*;
public class q_1 {
static Scanner sc;
public static void main(String[] args){
sc = new Scanner(System.in);
int n = getInt();
int non_8 = 0;
int eight = 0;
String s = sc.next();
for(int i=0 ; i<s.length() ; i++){
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int n, cnt;
string s;
int main() {
cin >> n;
cin >> s;
if (n % 11 != 0) {
cout << 0;
return 0;
}
for (int k = 0; k < s.length(); k++) {
if (s[k] == '8') cnt++;
}
if (cnt >= n / 11)
cout << n / 11;
else
cout << 0;
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, count, i, j, l, s, a, b;
string str;
while (cin >> m) {
cin >> str;
l = str.length();
count = 0;
if (m % 11 == 0) {
s = m / 11;
for (i = 0; i < l; i++) {
if (str[i] == '8') {
count++;
}
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.util.*;
import java.io.*;
public class Codeforce {
public static void main(String[] args) throws FileNotFoundException {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
String dig = input.next();
int num8 = 0;
for (int run = 0; run < n; run++) {
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int n, num[12], kin, maxn, maxnum;
bool kind[12];
char c[110];
int process() {
if (num[8] == 0 || n < 11) return 0;
if (num[8] == n) return 1;
int set_ = n / 11;
for (int i = 0; i <= 9; i++)
if (kind[i] != 0) kin++;
if (kin == 2) {
if (set_ > num[8])
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | m = int(input())
d = input()
otv = d.count('8')
otv1 = len(d)
s = otv
e = []
for i in range(s):
otv1 += 1
e.append(min(otv,otv1 // 11))
if m == 100 and d == '8820286285185244938452488887088871457098945874486988698468788381417332842888928188688887641132194956':
print(9)
elif e == []:
print(0)
else:
p... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | import sys, math
from sys import stdin, stdout
rem =10**9+7
inf=10**18
sys.setrecursionlimit(10 ** 6+5)
#from resource import *; setrlimit(RLIMIT_STACK, (RLIM_INFINITY, RLIM_INFINITY))
take = lambda: map(int, stdin.readline().split())
from heapq import heappush,heappop,heapify
from collections import deque
from bisect... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
int a[105];
char st[105];
int main() {
int n;
scanf("%d", &n);
scanf("%s", st);
for (int i = 0; i < n; i++) {
a[i] = st[n - i + 1];
}
int c = 0, s, x;
x = n / 11;
for (int i = 0; i < n; i++) {
if (a[i] == 8) c++;
}
s = x > c ? x : c;
printf("%d\n", s);
return 0;
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | a = int(input())
st = str(input())
if (a < 11):
print(0)
exit()
map = {}
for i in range(10):
map[i]=0
for i in range(a):
map[int(st[i])] += 1
if map[8] == 0:
print(0)
exit()
map[8] -= 1
ans = 0
print(int(a / 11)) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | n=int(raw_input())
l=list(int(n) for n in raw_input().split())
m=n/11
h=l.count(8)
if h>=m:
print m
else:
print h
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long t, cnt = 0;
cin >> t;
char num[110];
gets(num);
for (int i = 0; i < t; i++) {
if (num[i] == 8) cnt++;
}
if (t % 11 != 0)
cout << 0 << endl;
else if (t / 11 > cnt)
cout << cnt << endl;
else
cout << t / 11 << endl;
re... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
s=str(input())
k=0
for i in range (n) :
if int(s[i])==8 :
k=k+1
l=n/11
if (k > 0 and l>0):
if (l>k):
p=k
else :
p=l
print(p)
else:
print(0) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long n, i, x, eight, ans;
string str;
int main() {
cin >> n;
cin >> str;
for (i = 0; i < n; i++) {
if (str[i] == '8') eight++;
}
for (i = 0; i < eight; i++) {
if ((n - i) < (i * 10)) break;
ans = i;
}
cout << ans << endl;
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
a=list(input())
b=['0','1','2','3','4','5','6','7','8','9']
c=[0,0,0,0,0,0,0,0,0,0]
d=dict(zip(b,c))
for i in range(len(a)):
d[a[i]]+=1
e=list(d.values())
x=e[8]
del(e[8])
f=[]
for i in range(len(e)):
if e[i]!=0:
f.append(e[i])
y=min(f)
print(min(x,y)) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x7f7f7f7f;
int main() {
int n;
while (cin >> n) {
if (n < 11) {
;
cout << 0 << endl;
;
} else {
string num;
cin >> num;
int countEight = 0;
for (int i = 0; i < num.length(); i++) {
if (num[i] == ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (s.size() >= 11 && s[0] == '8' || s[n - 1] == '8') {
cout << s.size() / 11;
} else
cout << 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | //package MyPackage.kfjf;
import java.util.*;
public class ComplexButNotBoring14ffv {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
// Map <Integer,Integer> map=new HashMap <>();
int freq8 = 0;
String s = scan.next... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int counter =0;
String n = scanner.nextLine();
String numbers = scanner.nextLine();
char[] number = numbers.toCharArray();
for (int i = ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | n=input()
string=raw_input()
a=[]
cnt=0
ans=0
for i in range(0,len(string)):
a.append(int(string[slice(i,i+1)]))
if(a[i]==8):
cnt=cnt+1
if(n<11):
print "0"
ans=n/11
if(ans<=cnt):
print ans
else:
print cnt |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long int arr[10];
int main() {
long long int n, i, res = 0;
cin >> n;
char str[n];
scanf(" %s", str);
for (i = 0; i < n; i++) {
arr[str[i] - '0']++;
}
if (arr[8] == 0) {
cout << 0 << endl;
return 0;
}
while (1) {
if (arr[0] >= 1 && arr... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char a[105];
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == '8') ans++;
}
if (n >= 11 && ans >= n / 11) {
cout << n / 11 << endl;
} else
cout << 0 << endl;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | //package MyPackage.kfjf;
import java.util.*;
public class ComplexButNotBoring14ffv {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
// Map <Integer,Integer> map=new HashMap <>();
int freq8 = 0;
String s = scan.next... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a == 8) b++;
}
cout << min(b, n / 11) << endl;
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | input()
print('HARD' if '1' in input() else 'EASY') |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
s = input()
output = 0
if s.count('8')>0:
num = 11*s.count('8')
if num <= n:
output = n//num
else:
output = n//11
print(output)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java |
import java.util.Scanner;
public class PhoneNumbers {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n;
String ch="";
do{
System.out.print("n = ");
n = sc.nextInt();
}... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, b, ck = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') ck++;
}
if (ck * 11 <= n) {
cout << ck << endl;
} else
cout << n / 10 << endl;
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
s=input()
add1=0
add2=0
for i in s:
if int(i)==8:
add1+=10
else:
add2+=1
print(min(add1,add2)//10) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int ec = 0, oc = 0;
for (auto(i) = 0; (i) < (n); (i)++)
if (s[i] == '8')
ec++;
else
oc++;
int ans = 0;
for (auto(i) = 0; (i... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input()); s = sorted(input())
print(min(s.count('8'), n//10))
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | from copy import copy
n = int(raw_input())
s = list(raw_input())
eig = []
if '8' not in s:
print 0
else:
x = s.count('8')
y = n % 10
if x > y:
print x-y
elif x == y:
print x
else:
print y-x
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class solution {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(f.readLine());
String s = ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
s = list(input())
if '8' not in s:
print(0)
exit()
print(min(s.count('8') , n // 1))
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.util.*;
public class Test {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String digitStr = sc.nextLine();
int count = 0, size = digitStr.length();
for(int i = 0; i < size; i++) {
if(digi... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
#define gc getchar//_unlocked
#define pc putchar//_unlocked
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pp pair<int,int>... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define one(x) __builtin_popcountll(x)
#define pp pair<ll,ll>
#define all(x) (x... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
s=input()
d={}
for i in s:
if(i in d):
d[i]+=1
else:
d[i]=1
if(8 in d):
x=d['8']
del d['8']
d['8']=x
c=0
while(True):
if('8' in d and d['8']>=1):
d['8']-=1
s=0
for k,v in d.items():
if(v>0):
# if(k=='8'):
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
std::string str_toupper(std::string s) {
std::transform(s.begin(), s.end(), s.begin(),
[](unsigned char c) { return std::toupper(c); });
return s;
}
std::string str_tolower(std::string s) {
std::transform(s.begin(), s.end(), s.begin(),
[](unsigned char c)... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cout.tie(0), cout.tie(0);
int n;
cin >> n;
string a;
cin >> a;
vector<int> vec(10, 0);
for (auto i : a) vec[(i - '0')]++;
if (vec[8] >= n / 10)
cout << n / 10;
else
cout << 0;
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int n, ans;
string s;
int main() {
scanf("%d", &n);
cin >> s;
for (int i = 0; i < s.size(); ++i)
if (s[i] == '8') {
++ans;
}
if (s.size() / 8 < ans) {
ans = s.size() / 8;
}
printf("%d", ans);
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int phone_numbers = 0;
int eights = 0;
cin >> n;
string cards;
cin >> cards;
for (int i = 0; i < n; i++) {
if (cards[i] == '8') eights++;
}
for (int i = 0; i < eights; i++) {
if (n - 11 >= 0) phone_numbers++;
}
cout << phone... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
int n, cnt;
char c;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%c", &c);
if (c == '8') cnt++;
}
if (cnt < n / 11)
printf("%d", cnt);
else
printf("%d", n / 11);
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
a = list(input())
a = [int(x) for x in a]
print(min(a.count(8), (len(a) - 1) // 10))
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
string s;
int a, n;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
a++;
}
}
if (min(n / 10, a) == 10) {
cout << 9;
}
cout << min(n / 10, a);
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | from copy import copy
n = int(raw_input())
s = list(raw_input())
ss = copy(s)
ss = list(filter(lambda i: i != '8', ss))
eig = []; other = []
dico = {}
for i in s:
if i == '8':
eig.append(i);
if len(eig) == 0:
print 0
else:
for i in s:
if i == '8':
eig.append(i); s.rem... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
eights = 0
others = 0
for elem in input():
if int(elem) == 8:
eights += 1
else:
others += 1
answer = 0
while True:
if eights == 0:
break
else:
eights -= 1
if others >= 10:
others -= 10
answer += 1
else:
... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | java | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Compe {
public static void main(final String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
// Reading data using re... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
s = input()
eight = s.count("8")
all_except_eight = n-eight
tmp = all_except_eight//10
remaining=all_except_eight%10
ans=0
if eight>=tmp:
ans=tmp
eight-=tmp
if eight==0:
print(ans)
else:
if remaining+eight>=11:
ans+=1
eight-=(11-remaining)
ans... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
s=input()
occu_8=s.count('8')
if ((n<11) or (occu_8==0)):
print(0)
elif ((n-occu_8)//10 >= occu_8):
print(occu_8)
else:
print((n-occu_8)//10) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n = int(input())
s = input()
if n >= 11:
print(s.count('8'))
else:
print(0) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | n=int(input())
a=list(input())
x=0
for i in range(n):
if a[i]=='8':
x+=1
print(min(x,n//1)) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int SZ = 100010;
const int INF = 1e9 + 10;
const int mod = 10007;
const long double eps = 1e-8;
long long read() {
long long n = 0;
char a = getchar();
bool flag = 0;
while (a > '9' || a < '0') {
if (a == '-') flag = 1;
a = getchar();
}
while (a <=... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
if (n < 11) {
std::cout << 0;
return 0;
}
char *buf = new char;
bool validNumber = false;
std::cin >> buf;
for (int x = 0; x < n; x++) {
if (buf[x] == '8') {
validNumber = true;
}
}
if (!validNumber) {
std::cout <<... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | if __name__ == '__main__':
n= int(input())
ss= input()
numbers= n// 11
#print('numbers: '+str(numbers))
#print("'8' in ss: "+str('8' in ss))
if('8' in ss):
print(numbers)
else:
print(0) |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python2 | #!/usr/bin/env python
#-*- coding: utf-8 -*-
from collections import defaultdict
from math import factorial as f
from fractions import gcd as g
N = raw_input ()
s = raw_input ()
y = s.count('8')
x = len (s) - y
print min (y, x / 7)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
int length, eights;
char s[101];
int main() {
scanf("%d %s", &length, s);
if (length < 11)
puts("0");
else {
for (int i = 0; i < length; i++) {
if (s[i] == '8') eights++;
}
}
printf("%d", eights > length / 11 ? length / 11 : eights);
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int num[10] = {0};
string s;
cin >> s;
for (int i = 0; i < n; i++) {
num[s[i] - '0']++;
}
if (num[8] == 0) {
cout << 0;
return 0;
}
int res = (num[8]) > ((n - num[8]) / 7) ? ((n - num[8]) / 7) : (num[8]);
cout ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1000000000;
template <class T>
T read(T &x) {
char c;
int flag = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-') flag *= -1;
x = c - '0';
while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + ... |
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | python3 | R=lambda : map(int,input().split())
n,s=int(input()),input()
k=s.count('8')//2
n-=k;n/=9
print(n if n<k else k)
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, c = 0, e = 0;
cin >> n;
string s;
int p = s.size();
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') c++;
}
e = n / 11;
if (c >= e) {
cout << e << endl;
} else {
cout << "0" << endl;
}
return 0;
}
|
1060_A. Phone Numbers | Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.
For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.
You have n cards with digits, and you want to use them to make as many phone n... | {
"input": [
"22\n0011223344556677889988\n",
"11\n00000000008\n",
"11\n31415926535\n"
],
"output": [
"2\n",
"1\n",
"0\n"
]
} | {
"input": [
"51\n882889888888689888850888388887688788888888888858888\n",
"55\n7271714707719515303911625619272900050990324951111943573\n",
"72\n888488888888823288848804883838888888887888888888228888218488897809784868\n",
"65\n44542121362830719677175203560438858260878894083124543850593761845\n",
"5... | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, sum = 0, temp, d;
string s;
cin >> n;
cin >> s;
long long int a[10] = {0};
for (long long int i = 0; i < s.length(); ++i) {
a[s[i] - 48]++;
}
temp = n - a[8];
d = temp / 10;
if (d == a[8]) {
cout << a[8] << "\n";
}... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.