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 | count=0
n=int(input())
number=str(input())
for i in range(n):
if (number[i]=="8"):
count+=1;
if (n%11==0):
if (n//11 > count):
print(count);
else:
print(n//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;
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 | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
string s;
cin >> n >> s;
if (n % 11 == 0) {
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') cnt++;
}
if (cnt > 0)
cout << (n / 11) << endl;
else
cout << "0" << endl;
} else
cout << "0" << end... |
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;
string s;
cin >> n;
cin >> s;
int e8 = 0, oth = 0;
for (int i = 0; i < n; i++)
if (s[i] == '8')
e8++;
else
oth++;
if (n < 10)
cout << 0 << endl;
else if (e8 == n)
cout << n / 11 << endl;
else if ((oth / 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())
s=raw_input()
c=s.count("8")
t=n/11
if t<=c:
print t
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.Scanner;
public class PhoneNumbers {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n;
String ch="";
do{
System.out.println("n = ");
n = sc.nextInt();
}while ((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 | def phone_numbers():
n = int(input())
s = input()
if (n // 11 == 0):
print(0)
return 0
k = 0
for i in range(0, n):
if (s[i] == "8"):
k += 1
if (k == n // 11):
print(k)
return 0
print(0)
return 0
phone_numbers() |
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;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
public class InfinityGauntlet {
public static void main(String[] args) {
FastReader scan=new FastReader... |
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 f = 0;
int n = 0;
cin >> n;
string s;
cin >> s;
int d = 0;
if (s.size() < 8)
cout << "0";
else
for (int i = 0; i < n; i++) {
if (s[i] == '8') f++;
}
if (f == 0)
cout << "0";
else if (f != 0) {
d = n / 8;
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 | python3 | n = int(input())
s = input()
counter = 0
for c in s:
if c == '8':
counter += 1
print(min(n // 8, counter))
|
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_1060A {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
s.nextLine();
String line = s.nextLine();
int count = 0;
for (int i = 0; i < line.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 | python3 | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in 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 | python2 | n=input()
s=raw_input()
i=0
f=0
while i<n:
if s[i]=='8':
f+=1
i+=1
if n<11 or f==0:
print 0
if n>=11 and f>=n/11:
print 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 | java | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int N = s.nextInt();
String v = s.next();
int[] numeros = new int[v.length()];
for (int i = 0; i < numeros.length; i++) {
numeros[i] = 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 | python3 | u=int(input())
d=[]
s=0
arr=list(map(int,input()))
#print(arr)
try:
if len(arr)>=11 and 8 in arr:
count=arr.count(8)
print(count)
for u in range(count):
if 8 in arr:
s=s+1
arr[arr.index(8)]=-1
d.append(8)
for i in ra... |
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()
c = 0
for i in range(s.count('8')):
n -= 10
if n < 0:
break
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 | java | import java.util.*;
import java.io.*;
public class CF{
public static void main(String arg[]) throws IOException{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); sc.nextLine();
String s = sc.nextLine();
int a = 0, b = 0;
for(int i=0;i<n;i++){
if(s.charAt... |
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) {
if (dig == 0)
printf("0\n");
else {
ll = fabs(ll - dig);
printf... |
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 INF = 1e18 + 123;
const long double EPS = 1e-9;
const int MX = 1e9 + 1;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int N = 1e5 + 123;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
int main() {
int n, ans = 0;
cin >> 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 | java | import java.util.Scanner;import java.util.Arrays;
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++;
}
int [] a;a=new int [n];
for (int i=n-d... |
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 A1060 {
public static void main(String[] args) throws Exception {
int n = i();
String s = s();
int eight = 0;
int other = 0;
for (int i = 0; i < n; i++) {
if (s.charAt(i) == '8') eight++;
else other++;
}
out.println(Math.min(eight, other / 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=input()
c=input()
eig_d=c.count('8')
if eig_d==0 or int(n)<8 :
print(0)
else :
print(min(eig_d,int(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 | java | import java.util.*;
public class Test {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String str = sc.nextLine();
int count = 0;
str = sc.nextLine();
for(int i = 0; i < n; i++) {
if(str.charA... |
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()
x=len(s)
c=0
for i in range(x):
if s[i]=='8':
c=c+1
if c>int(n/11):
print(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())
l = input()
a = len(l)%11
p = len(l)-a
for i in range(p):
if l.count("8")>=p//11:
print(p//11)
break
elif l.count("8")<p//11:
print(l.count("8"))
break
else:print(0)
break
|
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 | u=int(input())
d=[]
s=0
arr=list(map(int,input()))
print(arr)
try:
if len(arr)>=11 and 8 in arr:
count=arr.count(8)
print(count)
for u in range(count):
if 8 in arr:
s=s+1
arr[arr.index(8)]=-1
d.append(8)
for i in ran... |
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.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... |
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 | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0;
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] == '8') c++;
}
if (n / 11 <= c)
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 | java | import java.io.*;
import java.util.*;
public class Phone
{
public static void main(String args[])
{ Scanner s=new Scanner(System.in);
int n=s.nextInt();
String str=s.next();
int c=0;
while(true)
{
if(11 <=n && str.contains("8"))
{
str.replace("8","a");
n=n-11;
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() {
string s;
int n, c = 0;
cin >> n;
cin >> s;
for (int i = 0; i < s.size(); i++)
if (s[i] == '8') c++;
int k = n / 11;
if (c >= 1 && k >= c)
cout << k << 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 | python3 | N = int(input())
eight_amount = input().count("8")
if eight_amount == 0:
print(0)
else:
print((N // 11) * 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 | cpp | #include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define all(a) a.begin(),a.end()
#define endl '\n'
#define int long long
using namespace std;
const int N=2e5+5;
const int inf=1e15+7;
const int mod=1e9+7;
int cnt,cnt1;
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 | java |
import java.util.Scanner;
public class ANSANS1 {
static Scanner in = new Scanner(System.in);
public static void main(String[] args) {
int t = in.nextInt();
String x = in.next();
System.out.println(ANS(x));
}
public static int ANS(String x){
int ct8 = 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;
cin >> n;
if (n < 11) {
cout << 0 << endl;
return 0;
}
std::string s;
cin >> s;
int A[10];
for (int i = 0; i <= n - 1; i++) {
A[s.at(i) - '0']++;
}
if (A[8] < 1) {
cout << 0 << endl;
return 0;
}
int poss = 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>
int main() {
int n;
scanf("%d", &n);
char a[1000];
scanf("%s", a);
printf("%d\n", 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 | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a = 0, b = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
int in;
in = s[i] - 48;
if (in == 8)
a++;
else
b++;
}
cout << min(a, b / 10) << 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 | python3 | n = int(input())
s = input()
b=n//11
c=s.count('8')
if(c>=b and b>=1):
print(b)
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())
s=input()
d={}
for i in s:
if(i in d):
d[i]+=1
else:
d[i]=1
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'):
s+=1
d[k]-=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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author xwchen
*/
public class Main {
public static void main(String[] args) {
InputStream in... |
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 double PI = acos(-1.0);
int main() {
int n;
string s;
cin >> n;
cin >> s;
int cnt = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == '8') {
cnt++;
}
}
cout << cnt;
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>
int main() {
int bil1, bil2, n, i, j[11];
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%d", &bil1);
if (bil1 <= 11) {
printf("1\n");
break;
} else if (n > 11) {
printf("2");
break;
} else if (bil1 = 8) {
printf("%d\n", 0);
break;
... |
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;
int num[2] = {};
int result = 0;
char temp[101];
scanf("%d", &N);
scanf("%s", temp);
for (int i = 0; i < N; i++) {
if (temp[i] == '8')
num[0]++;
else
num[1]++;
}
while (num[0] >= 1 && num[0] + num[1] >= 11) {
num[0]--;
if (nu... |
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(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;
int main() {
int a;
cin >> a;
char s[a];
int cnt = 0;
for (int i = 0; i < a; i++) {
cin >> s[i];
if (s[i] == '8') {
cnt++;
}
}
if (cnt >= 1 && a % 11 == 0) {
cout << a / 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;
const long long int N = 1e5 + 5;
const long long int M = 1e9 + 7;
queue<pair<long long int, long long int> > pq;
vector<long long int> v;
map<long long int, long long int> mpp;
set<pair<long long int, long long int> > st;
long long int a[N], h[N], indx[N][2];
long long 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 | java | import java.util.*;
public class sol {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s = sc.next();
char[] c = s.toCharArray();
if(n < 11 ) System.out.println(0);
int count =0;
for(int i =0 ; i < n ; i++){
if(c[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 | a=int(input())
st=input()
eight=0
for i in range(0,len(st)):
if st[i]=='8':
eight+=1
banyak=len(st)//11
if banyak>=eight:
c=banyak
else :
c=eight
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 | cpp | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
char s[105];
scanf("%s", s);
int a = 0, b = 0;
for (int i = 0; i < n; i++)
if (s[i] == '8')
a++;
else
b++;
int cnt = 0;
while (a--) {
printf("%d %d\n", a, b);
if (b >= 10)
cnt++, b -= 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 | x=int(input())
s=input()
d=x//10
e=s.count('8')
print(min(e,d)) |
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 | print (min(int(input())/11,str(input()).count('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>
int n, cnt, len;
char c[10001];
int main() {
scanf("%d", &n);
while ((c[0] = getchar()) < 32 || c[0] > 126)
;
while ((c[++len] = getchar()) >= 32 && c[len] <= 126)
;
for (int i = 1; i <= n; i++)
if (c[i] == '8') cnt++;
printf("%d", (n / 11 < cnt ? n / 11 : 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 | java | import java.util.*;
public class Main
{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int r = n/11;
int count =0 ;
int yes = 0 ;
String str = sc.next();
for(int i=0 ;i < n ; i++)
{
if(str.charAt(i)=='8')count++;
if(r==count) {yes =... |
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.util.Scanner;
public class a {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
String koll=sc.nextLine();
int kol=Integer.valueOf(koll);
String n=sc.nextLine();
String[] f=n.split("");
... |
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())
print(min(input().count('8'), 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() {
char s[101];
int n, i, sum8 = 0, sum = 0, total = 0;
cin >> n;
cin >> s;
for (i = 0; i < n; i++) {
if (s[i] == '8') sum8++;
sum++;
}
if (sum8 >= sum / 11)
total = sum / 8;
else
total = sum8;
cout << total << 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())
ch=input()
if "8" not in ch:
print(0)
else:
s = n//11
print(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 = input()
if n%11==0:
t = n//11
c = s.count('8')
print(min(c, t))
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;
const int maxn = 1e5 + 7;
int n;
int a[maxn], b[maxn];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
x = x * 10 + ch - '0';
return x * f;
}
inline void writ(int x) {
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())
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
z=d[8]
z=int(z)
d[8]=10000000
x=min(d)
if(z>=2):
if(x*2==z):
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 | python3 | n = int(input())
l = input()
a = len(l)%11
p = len(l)-a
for i in range(p):
if l.count("8")>=p//11:
print(p//11)
break
else:print(0)
break
|
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 a;
int count = 0, i;
cin >> a;
for (i = 0; i < n; i++) {
if (a[i] == '8') count++;
}
int result = n / 11;
if (count < result)
cout << 0 << endl;
else
cout << result << 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 | x = int(input())
x = x//11
s = input()
a = s.find('8')
b = min(x, a)
print(b) |
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())
p=list(input())
s=0
pa=0
ta=0
for x in range(n):
if int(p[x])==8:
s+=1
else:
pa+=1
for y in range(5555):
if pa>=10 and s>0:
ta+=1
pa-=10
s-=1
elif s==0:
break
elif s>0 and pa<10:
if s+pa>=11:
pa=0
s-=11-pa... |
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 n;
cin >> n;
string s;
cin >> s;
long long i, a = 0, b = 0;
for (i = 0; i < n; i++) {
if (s[i] == '8')
a++;
else
b++;
}
long long c = 0;
while (a > 0) {
a--;
if (b >= 10) {
c++;
b = b - 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 | java | import java.util.Scanner;
/**
*
* @author hp
*/
public class JavaApplication39 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s = sc.next();
int x = 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 CodeChef {
public static void main(String[] args) {
Scanner s=new Scanner(System.in);
int n=s.nextInt();
s.nextLine();
String a=s.nextLine();
int w=n/11;
int j=0;
char[] atype=a.toCharArray();
for(int i=0;i<aty... |
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 PhoneNumber {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
scan.nextLine();
String s = scan.nextLine();
int x = 0;
for(int i = 0; i < s.length(); i++) {
if(s.charAt(i) == '8');
x++;
}
System.out.pri... |
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;
cin >> n;
string s;
cin >> s;
long long int ans = 0;
long long int c = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') c++;
}
ans = n / 11;
if (ans <= c) {
cout << ans << endl;
return 0;
} else {
ans = 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;
cin >> n;
char a[n];
cin >> a;
int m = n / 11;
int num;
for (int i = 0; i < n; i++) {
if (a[i] == '8') num++;
}
if (num >= m)
cout << m;
else
cout << 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 | python2 | def ni():
return int(raw_input())
def si():
return raw_input()
print min(si().count('8'), ni() / 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 | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
string s;
cin >> s;
long long int a[10] = {0};
for (long long int i = 0; i < n; i++) {
a[s[i] - '0']++;
}
long long int c8 = a[8];
if (n < 11)
cout << "0\n";
else if (n >= 11) {
if (c8 == 0)
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 | N = int(input())
eight_amount = input().count("8")
print((N // 10) * max(1, N // 10 - 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 | cpp | #include <bits/stdc++.h>
using namespace std;
int n, sum = 0;
char s[200];
int dig[11];
int main() {
cin >> n;
cin >> (s + 1);
for (int i = 1; i <= n; i++) dig[s[i] - '0']++;
if (dig[8] == 0)
printf("0\n");
else {
for (int i = 0; i <= 9; i++) sum += dig[i];
int t = sum / 10;
printf("%d ", min(... |
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
elif len((ss)) < 10:
print 0
else:
for i in ss:
dico.setde... |
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, a, z, nr;
char s[101];
int main() {
cin >> n;
cin >> s;
for (int i = 1; i <= n; i++) {
if (s[i] == '8')
a++;
else
z++;
}
while (a > 0 && z + a >= 10) {
a--;
if (z >= 10) {
z -= 10;
nr++;
} else {
a = a + (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() {
int n;
scanf("%d", &n);
string s;
cin >> s;
int c = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
c++;
}
}
int ss = 0;
for (int i = c; i > 0; i--) {
if ((n >= (8 * i))) {
ss = i;
break;
}
}
cout << 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 = input()
output = 0
if s.count('8')>0:
num = 11*s.count('8')
if num <= n:
output = 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 Phone {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
String n = scn.nextLine();
int nn = Integer.parseInt(n);
String s = scn.nextLine();
char ch[] = s.toCharArray();
int count = 0;
for (... |
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 ReadFile {
public static int numberOfEight(String s){
int numberOfEight = 0;
for(int i = 0 ; i<s.length() ; i++){
if(s.charAt(i) == '8'){
numberOfEight++;
}
}
return numberOfEight;
}
public stati... |
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 s=new Scanner(System.in);
int loop = s.nextInt(), counter=0, all=0;
String str=s.next();
int size=str.length();
for(int i=0; i<str.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 | python3 | n = int(input())
angka = str(input())
angka = str(angka)
if "8" not in angka :
print(0)
elif n == 100 and 1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026==1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026==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() {
string pn;
int counter = 0;
cin >> pn;
for (int i = 0; i < pn.length(); i++) {
if (pn[i] == '8') {
counter++;
}
}
if (pn.length() / 11 >= counter) {
cout << counter << endl;
} else {
cout << pn.length() / 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.*;
public class Test {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String str = sc.nextLine();
int count = 0;
str = sc.nextLine();
for(int i = 0; i < n; i++) {
if(str.charA... |
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(0)
elif '8' not in s: print(0)
else: print(len(s)//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 | 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.println("n = ");
n = sc.nextInt();
}while ((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):
print(0)
else:
count=0
if(d[0]==10 and d[8]>=1):
count+=1
d[0]-=10
d[8]-=1
x=min(d)
y=arr.index(str(x))
z=d[9]
z=int(z)
if(x+2>=z):
count+=x
else:
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 | python3 | n = int(input("Введите кол-во карточек: "))
k = str(input("Введите карточки: "))
q = 0
for i in k:
if i == "8":
q += 1
if (len(k) - len(k) % 11) / 11 > q:
print(q)
else:
print(int((len(k) - len(k) % 11) / 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 | cpp | #include <bits/stdc++.h>
int main() {
int N, R;
while (scanf("%d%d", &N, &R) != EOF) {
int j = 0, m;
int inc[250];
if (N < 0) {
N *= -1;
printf("-");
} else if (N == 0) {
printf("0\n");
break;
}
if (R <= 10) {
while (N > 0) {
inc[j++] = N % R;
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 | 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)) < 9:
print 0
else:
for i in ss:
dico.setdefault(i,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.*;
import java.lang.*;
public class HelloWorld{
public static void main(String []args){
int n,sum=0,i,a,b,c,d,count_1=0,count_2=0,count=0,l=0,m=0,p;
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
String s1=new String();
s1=sc.next();
a=s1... |
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 | # author : sudoer
n = raw_input()
n = int(n)
s = raw_input()
s = str(s)
rem = n / 11
print rem
d = n % 11
# print d
if len(s) > 11 and ('8' in s):
c = s.count('8')
# print c
# if rem == 1:
# print rem
# else:
while c > rem:
c -= 1
print c
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;
int main() {
int n, x, y, h, a, b, c;
a = 0;
x = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 8) {
a += 1;
}
}
if (a >= n / 11) {
x = n / 11;
} else {
x = a;
}
cout << x;
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 | # 1060A => Phone Numbers
# https://codeforces.com/problemset/problem/1060/A
n = int(input())
digits = input()
if digits.count("8") == 0:
print(0)
else:
print(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 | 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.println("n = ");
n = sc.nextInt();
}while ((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;
int n, ans;
string s;
int main() {
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') ans++;
}
cout << min(ans, (n - ans) / 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() {
int a;
cin >> a;
char s[a];
int cnt = 0;
for (int i = 0; i < a; i++) {
cin >> s[i];
if (s[i] == '8') {
cnt++;
}
}
if (cnt >= 1 && a >= 11) {
cout << a / 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() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
char z;
int c8 = 0;
for (int i = 0; i < n; i++) {
cin >> z;
if (z == '8')
c8++;
else
s.push_back(z);
}
if (n < 11 || c8 == 0) {
cout << 0;
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 | java | import java.util.Scanner;
public class PhoneNumbers {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s = sc.next();
int c = 0;
if (n < 11) {
System.out.print(c);
System.exit(0);
}
if (s.contains("8"))
c++;
else {
System.out.print... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.