text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
const int MAXN = (int)1e6 + 5;
const int MODN = (int)1e9 + 7;
int inf = 0x3f3f3f3f;
using namespace std;
int a[105];
char str[105][105];
int main() {
int n, m;
while (scanf("%d%d", &m, &n) != EOF) {
for (int i = 0; i < n; i++) {
scanf("%s", str[i]);
}
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i++) {
int flag = 0;
for (int j = 0; j < m; j++) {
if (str[i][j] == '0') {
flag = 1;
}
}
if (flag == 1) {
a[i] = 1;
}
}
int sum = 0, maxx = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 1) {
sum++;
} else {
if (sum > maxx) {
maxx = sum;
}
sum = 0;
}
}
if (sum > maxx) {
maxx = sum;
}
printf("%d\n", maxx);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, d;
cin >> n >> d;
int mx = 0, consc = 0;
for (int i = 0; i < d; ++i) {
bool all = 1;
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
if (c == '0') all = 0;
}
if (!all)
consc++;
else
consc = 0;
mx = max(mx, consc);
}
cout << mx << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[101];
int n, d, i, cou = 0, j, temp;
cin >> n >> d;
char val;
for (i = 0; i < d; i++) {
temp = 0;
for (j = 0; j < n; j++) {
cin >> val;
if (val == '1') temp++;
}
if (temp == n)
a[i] = 1;
else
a[i] = 0;
}
temp = 0;
for (i = 0; i < d; i++) {
while ((a[i] == 0) && i < d) {
temp++;
i++;
}
if (temp > cou) cou = temp;
temp = 0;
}
cout << cou;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, ans = 0, temp = 0;
char ch;
cin >> n >> d;
for (int i = 0; i < d; i++) {
int win = 0;
for (int j = 0; j < n; j++) {
cin >> ch;
if (ch == '0') {
win = 1;
}
}
if (win == 1) {
temp++;
ans = max(ans, temp);
} else {
temp = 0;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, a = 0, r = 0, b = 0;
cin >> m >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
string t;
for (int j = 0; j < n; j++) {
t = s[j];
a = 0;
for (int h = 0; h < m; h++) {
a = 0;
if (t[h] == '0') {
a += 1;
break;
}
}
if (a == 0) {
if (r >= b) {
b = r;
}
a = 0;
r = 0;
}
if (a > 0) {
r += 1;
if (r >= b) {
b = r;
}
a = 0;
}
}
cout << b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, d;
cin >> n >> d;
string allPresent = "";
for (int i = int(1); i <= int(n); i++) allPresent += "1";
int con = 0, maxCon = 0;
for (int i = int(1); i <= int(d); i++) {
string s;
cin >> s;
if (s != allPresent) {
con++;
maxCon = max(maxCon, con);
} else {
con = 0;
}
}
cout << maxCon;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, res = 0;
cin >> n >> m;
int r = 0;
while (m-- > 0) {
bool flag = false;
string s;
cin >> s;
for (int i = 0; i < n; ++i)
if (s[i] == '0') {
flag = true;
break;
}
if (flag)
r++;
else
r = 0;
res = max(r, res);
}
cout << res;
}
|
#include <bits/stdc++.h>
const int inf = (1 << 30) - 10;
using namespace std;
inline int get_int() {
int r = 0;
char c;
while ((c = getchar()) != ' ' && c != '\n') r = r * 10 + c - '0';
return r;
}
inline void out(int x) {
if (x > 10) {
out(x / 10);
}
putchar(x % 10 + '0');
putchar('\n');
}
int main() {
int m, n, ma, x, mm;
char c[200];
scanf("%d%d", &m, &n);
ma = 0;
x = 0;
for (int i = 0; i < n; i++) {
cin >> c;
mm = 0;
for (int i = 0; i < m; i++) {
mm += c[i] - '0';
}
if (mm == m) {
if (x > ma) ma = x;
x = 0;
} else
x++;
}
if (x > ma) ma = x;
printf("%d\n", ma);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int x, y, fin = 0, res = INT_MIN;
cin >> x >> y;
for (int i = 0; i < y; ++i) {
string s;
int cnt = 0;
cin >> s;
for (char c : s)
if (c == '1') ++cnt;
if (cnt != x)
++fin;
else {
res = max(fin, res);
fin = 0;
}
}
cout << max(res, fin) << endl;
}
int main() {
int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long n, d, cur = 0, ans = 0;
cin >> n >> d;
for (int i = int(0); i < (int)d; ++i) {
string s;
cin >> s;
bool is = true;
for (int j = int(0); j < (int)s.size(); ++j) {
if (s[j] == '0') is = false;
}
if (!is)
cur++;
else
cur = 0;
ans = max(cur, ans);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
return b == 0 ? a : gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
return (a / gcd(a, b)) * b;
}
long long int node, edge, vis[200010], dist[200010], col[200010], in[200010],
out[200010], timer = 0, mind, mnode, ans;
vector<long long int> gh[200010], ind, anr;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
;
vector<long long int> u, v, uu, vv, first, last;
map<long long int, long long int> mp, mq, mpq;
vector<pair<long long int, long long int> > vp, vq;
set<long long int> stt;
set<long long int>::iterator it;
long long int x, y, z, c, d, e, f, g, h, i, j, k, l, m, n, o,
p = 0, q = 0, r, t, ck = 0, sum = 0, mx = 0, mn = LONG_LONG_MAX;
string s, s1, s2, tt;
cin >> n >> d;
while (d--) {
cin >> s;
p = count(s.begin(), s.end(), '1');
if (p == n) {
mx = max(mx, ck);
ck = 0;
} else
ck++;
}
mx = max(mx, ck);
cout << mx << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, start = 0;
cin >> n >> d;
vector<string> s(d);
for (string &e : s) cin >> e;
vector<int> win(d);
for (int i = 0; i < s.size(); i++) {
string q = s[i];
if (q.find('0') <= q.length()) {
win[start]++;
} else {
start++;
}
}
sort(win.begin(), win.end(), greater<int>());
cout << win[0] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios ::sync_with_stdio(0);
cin.tie(0);
int n, d, sum = 0, ans = 0;
cin >> n >> d;
int a[d];
for (int i = 0; i <= d - 1; i++) {
string s;
cin >> s;
bitset<100> b(s);
if (b.count() == n) {
a[i] = 0;
} else {
a[i] = 1;
}
}
for (int i = 0; i <= d - 1; i++) {
if (a[i] == 1) {
sum++;
} else {
ans = max(ans, sum);
sum = 0;
}
}
ans = max(ans, sum);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int mark[105];
using namespace std;
string ch;
int main(void) {
int check1[105];
memset(mark, 0, sizeof(mark));
memset(check1, 0, sizeof(check1));
int n, d;
cin >> n >> d;
for (int i = 0; i < d; i++) {
cin >> ch;
for (int j = 0; j < n; j++) {
if (ch[j] == '0') {
mark[i] = 1;
break;
}
}
}
int ans = 0;
for (int i = 0; i < d; i++) {
}
int j = 0;
for (int i = 0; i < d; i++) {
if (mark[i] == 1) {
check1[j]++;
}
if (mark[i] == 0) {
j++;
}
}
int maxx = 0;
for (int i = 0; i <= j; i++) {
maxx = max(maxx, check1[i]);
}
printf("%d\n", maxx);
}
|
#include <bits/stdc++.h>
int main() {
int n, d, i, j;
scanf("%d %d", &n, &d);
int count = 0, ans = 0;
for (j = 1; j <= d; j++) {
char a[n + 1];
int count0 = 0, count1 = 0;
for (i = 0; i <= n; i++) {
scanf("%c", &a[i]);
if (a[i] == '1')
count1++;
else if (a[i] == '0')
count0++;
}
if (count1 != n)
count++;
else if (count1 == n) {
count = 0;
}
ans = (ans > count ? ans : count);
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool win(string s) {
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0') return 1;
}
return 0;
}
int main() {
int n, d;
cin >> n >> d;
string s;
int prev = 0, cur = 0;
int streak = 0;
int sum = 0;
while (d--) {
cin >> s;
cur = win(s);
if (prev != 0) {
sum += win(s);
} else {
sum = cur;
}
streak = max(streak, sum);
prev = cur;
}
cout << streak;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
const int nmax = (int)1e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
string s;
vector<int> v;
for (int i = (int)0; i <= (int)m - 1; i++) {
cin >> s;
bool win = false;
for (int i = (int)0; i <= (int)s.size() - 1; i++) {
if (s[i] == '0') {
win = true;
break;
}
}
v.push_back(win);
}
int ans = 0;
int sum = 0;
for (int i = (int)0; i <= (int)v.size() - 1; i++) {
sum += v[i];
if (v[i] == 0) sum = 0;
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, i, j = 0, k, g = 0;
string s;
cin >> n >> d;
while (d--) {
cin >> s;
k = 0;
for (i = 0; i < n; i++) {
if (s[i] == '1') k++;
}
if (k < n) {
j++;
if (j > g) g = j;
} else
j = 0;
}
cout << g << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d;
char s[110];
int main() {
scanf("%d%d", &n, &d);
int con = 0, res = 0;
for (int i = 0; i < d; i++) {
scanf("%s", s);
bool status = true;
for (int j = 0; j < n; j++)
if (s[j] == '0') {
status = false;
break;
}
if (!status)
con++;
else {
res = max(res, con);
con = 0;
}
}
res = max(res, con);
printf("%d", res);
}
|
#include <bits/stdc++.h>
int main() {
int n, m, i, j, k, f, l, maxi;
scanf("%d %d", &n, &m);
char str[101][101];
int b[1000];
for (i = 0; i < m; i++) {
scanf("%s", str[i]);
}
k = 0;
for (i = 0; i < m; i++) {
f = 0;
for (j = 0; j < n; j++) {
if (str[i][j] == '0') {
f = 1;
break;
}
}
if (f == 1) {
b[k] = i + 1;
k++;
}
}
if (k == 0) {
printf("0");
return 0;
}
if (k == 1) {
printf("1");
return 0;
}
l = 1;
maxi = 0;
for (i = 0; i < k - 1; i++) {
if (b[i + 1] - b[i] == 1) {
l++;
} else {
if (l > maxi) {
maxi = l;
}
l = 1;
}
}
if (l > maxi) {
maxi = l;
}
printf("%d", maxi);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
string s[m];
for (int i = 0; i < m; i++) {
cin >> s[i];
}
int a = 0, maxi = 0;
for (int i = 0; i < m; i++) {
if (s[i].find("0") < s[i].size()) {
a++;
} else {
maxi = max(maxi, a);
a = 0;
}
}
maxi = max(maxi, a);
cout << maxi << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int ans = 0, j = 0, l = 0;
int p = 0;
cin >> n;
cin >> m;
string s, k;
for (int i = 0; i < m; i++) {
l = 0;
cin >> s;
for (int j = 0; j < n; j++) {
if (s[j] == '1') ++l;
}
if (l != n) {
++p;
} else {
if (ans < p) ans = p;
p = 0;
}
}
if (ans < p) ans = p;
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int read() {
int ret = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
for (; ch >= '0' && ch <= '9'; ch = getchar()) ret = ret * 10 + ch - '0';
return ret;
}
long long readf() {
long long t = 0, flag = 1;
char c = getchar();
while (c < '0' || c > '9' || c == '-') {
if (c == '-') flag = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
t = t * 10 + c - '0';
c = getchar();
}
return t * flag;
}
int main() {
int n = read(), d = read();
int ans = 0, res = 0;
int flag;
string s;
for (int i = 1; i <= d; i++) {
cin >> s;
flag = 0;
for (int j = 0; j < s.size(); j++)
if (s[j] == '0') {
flag = 1;
break;
}
if (!flag) res = 0;
if (flag) res += 1;
ans = max(ans, res);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n, d, i, j, count, max, temp;
scanf("%d%d", &n, &d);
char str[101];
max = 0;
temp = 0;
for (i = 0; i < d; i++) {
count = 0;
scanf("%s", str);
for (j = 0; j < n + 1; j++) {
if (str[j] == '0') {
count++;
}
}
if (count > 0) {
temp++;
if (temp > max) max = temp;
} else
temp = 0;
}
printf("%d\n", max);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i, j, n, d, max = 0, count = 0;
char ara[101][101];
scanf("%d %d", &n, &d);
for (i = 0; i < d; i++) {
scanf("%s", ara[i]);
}
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) {
if (ara[i][j] == '0') {
count++;
break;
}
}
if (j == n) {
count = 0;
}
if (count > max) {
max = count;
}
}
printf("%d\n", max);
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, i, k, j, d, ans;
int main() {
char c;
cin >> n >> d;
ans = k = 0;
bool cond;
for (i = 0; i < d; i++) {
cond = 0;
for (j = 0; j < n; j++) {
cin >> c;
if (c == '0') cond = 1;
}
if (cond)
k++;
else
k = 0;
if (k > ans) ans = k;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i, j, a[100000], t = 0, c1, c2, count = 0, max = 0;
string s;
cin >> n >> k;
for (i = 0; i < k; i++) {
cin >> s;
c1 = 0;
c2 = 0;
for (j = 0; s[j] != '\0'; j++) {
if (s[j] == '0') c1++;
}
if (c1 > 0) {
a[t] = 0;
t++;
} else {
a[t] = 1;
t++;
}
}
for (t = 0; t < k; t++) {
if (a[t] == 0) {
count++;
if (count > max) max = count;
} else {
if (count > max) max = count;
count = 0;
}
}
cout << max;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d;
char c[200];
int main() {
scanf("%d%d", &n, &d);
int m = 0;
int ans = 0;
for (int i = 0; i < d; i++) {
scanf("%s", &c);
int flag = 0;
for (int j = 0; j < n; j++) {
if (c[j] == '0') {
flag = 1;
}
}
if (flag)
m++;
else {
ans = max(m, ans);
m = 0;
}
}
ans = max(m, ans);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
const long long INF = 1LL * inf * inf;
const double eps = 1e-9;
const int MAXN = 2500;
const int md = (int)1e9 + 7;
const double EPS = 1e-5;
const long long maxll = numeric_limits<long long>::max();
template <typename name>
inline name sqr(name x) {
return x * x;
}
inline long long multmod(long long a, long long b, long long md) {
if (!a) return 0;
if (a % 2 == 1)
return (multmod(a - 1, b, md) + b) % md;
else
return sqr(multmod(a / 2, b, md)) % md;
}
template <typename name>
inline name bpow(name base, long long exp, long long md = maxll) {
if (exp == 0) return 1;
if (exp % 2 == 1)
return (base * bpow(base, exp - 1, md)) % md;
else {
name k = bpow(base, exp / 2, md);
return (k * k) % md;
}
}
int ans, cur;
string s[2000];
int main() {
int n, d;
scanf("%d%d", &n, &d);
for (int i = 0; i < d; i++) cin >> s[i];
string pat = "";
for (int i = 0; i < n; i++) pat += "1";
for (int i = 0; i < d; i++) {
if (pat == s[i]) {
ans = max(ans, cur);
cur = 0;
} else
cur++;
}
ans = max(ans, cur);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int T = 300001;
const long long MAX = 1000000001;
long long n, m, k;
bool check(string s) {
for (int i = (int)0; i <= (int)s.length() - 1; i++) {
if (s[i] == '0') return true;
}
return false;
}
int main() {
int ans = 0;
int cu = 0;
cin >> m >> n;
for (int i = (int)0; i <= (int)n - 1; i++) {
string s;
cin >> s;
if (check(s)) {
cu++;
} else {
ans = max(ans, cu);
cu = 0;
}
}
ans = max(ans, cu);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, c, mx = 0;
bool used;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> s;
used = false;
for (int j = 0; j < n; j++)
if (s[j] == '0') {
c++, used = true;
break;
}
if (!used) mx = max(mx, c), c = 0;
}
if (used) mx = max(mx, c), c = 0;
cout << mx;
}
|
#include <bits/stdc++.h>
long long myFnc(long long a, long long b) { return a > b; }
using namespace std;
int main() {
long long n, d, i, j, count = 0, p = 0, b[100];
string s;
cin >> n >> d;
j = 0;
while (d--) {
cin >> s;
for (i = 0; i < n; i++) {
if (s[i] == '0') p = 1;
}
if (p == 0) {
b[j] = count;
j++;
count = 0;
p = 0;
} else {
count++;
p = 0;
}
}
b[j] = count;
sort(b, b + j + 1, myFnc);
for (i = 0; i < 1; i++) cout << b[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k[101], l, p = 1, max1;
bool t = false;
string s;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> s;
for (int j = 0; j < n; j++) {
if (s[j] == '1') l++;
}
if (l != n) {
k[i]++;
t = true;
}
l = 0;
}
for (int i = 0; i < m; i++) {
if (k[i] == 1 && k[i + 1] == 1)
p++;
else {
if (max1 < p && t) max1 = p;
p = 1;
}
}
cout << max1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, i = 0, high = 0, cnt = 0;
cin >> n >> d;
string s;
int a[d];
memset(a, 0, sizeof(a));
while (i < d) {
bool beat = false;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
beat = true;
break;
}
}
if (beat) a[i] = 1;
i++;
}
for (i = 0; i < d; i++) {
if (a[i] == 1) cnt++;
if (a[i] == 0) {
if (cnt > high) {
high = cnt;
cnt = 0;
} else
cnt = 0;
}
}
if (high < cnt) high = cnt;
cout << high << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, d, temp, tmp, ans, i, j;
bool flag;
char x;
int main() {
cin >> n >> d;
tmp = ans = 0;
for (i = 1; i <= d; i++) {
flag = false;
for (j = 1; j <= n; j++) {
cin >> x;
if (x != '1') flag = true;
}
if (flag)
tmp++;
else
tmp = 0;
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cin.ignore();
int I = 0;
string str[d];
for (int i = 0; i < d; i++) {
cin >> str[I++];
}
int max = 0;
int count = 0;
int f;
for (int i = 0; i < d; i++) {
f = 0;
for (int j = 0; j < str[i].length(); j++) {
f = f + (str[i][j] - 48);
}
if (f == str[i].length()) {
if (count > max) {
max = count;
}
count = 0;
} else
count++;
}
if (count > max) max = count;
cout << max << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t, i, j, k, l, m, n, p, q;
long long a, b, c, d;
string s, s1, ans;
while (cin >> n >> m) {
ans = "";
for (i = 0; i < n; i++) ans += '1';
long long rem = 0;
long long cnt = 0;
for (i = 0; i < m; i++) {
cin >> s;
if (s != ans) {
cnt++;
} else {
rem = max(rem, cnt);
cnt = 0;
}
}
cout << max(rem, cnt) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int N;
scanf("%d", &N);
int M;
scanf("%d", &M);
char** m = NULL;
m = (char**)malloc(sizeof(char*) * M);
int j = 0;
for (;;) {
if (j >= M) {
break;
}
m[j] = (char*)malloc(sizeof(char) * N);
++j;
}
char ch;
int i;
j = 0;
for (;;) {
if (j >= M) {
break;
}
i = 0;
for (;;) {
if (i >= N) {
break;
}
do {
ch = getchar();
if (ch == '\n') {
continue;
}
m[j][i] = ch;
break;
} while (1);
++i;
}
++j;
}
int nc = M;
int* vc = NULL;
vc = (int*)malloc(sizeof(int) * nc);
i = 0;
for (;;) {
if (i >= nc) {
break;
}
vc[i] = 0;
++i;
}
int num = 0;
int max = 0;
j = 0;
for (;;) {
if (j >= M) {
break;
}
i = 0;
for (;;) {
if (i >= N) {
break;
}
if (m[j][i] == '1') {
++vc[j];
}
++i;
}
if (vc[j] <= N - 1) {
++num;
} else {
num = 0;
}
if (num > max) {
max = num;
}
++j;
}
printf("%d", max);
j = 0;
for (;;) {
if (j >= M) {
break;
}
free(m[j]);
++j;
}
free(m);
}
|
#include <bits/stdc++.h>
using namespace std;
long long int ar[2000002] = {0};
int main() {
string st, ans;
vector<long long int> v;
long long int n = -1, i, j, d, temp = 0, flag = 0, x1, x2, x3, x4;
cin >> n >> d;
for (i = 0; i < d; i++) {
cin >> st;
for (j = 0; j < st.size(); j++) {
if (st[j] == '0') {
flag++;
goto lo;
}
}
flag = 0;
lo:
temp = max(temp, flag);
}
cout << temp;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> m >> n;
string s;
int sum = 0, k = 0;
for (int i = 0; i < n; i++) {
cin >> s;
int c = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] == '1') c++;
}
if (c != s.size()) {
k++;
if (k > sum) sum = k;
} else
k = 0;
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int kol_v, kol_dn, ans, z, answer;
char a;
bool x = true, pr = true;
int main() {
ios_base::sync_with_stdio(0);
cin >> kol_v >> kol_dn;
for (int i = 0; i < kol_dn; i++) {
pr = true;
for (int l = 0; l < kol_v; l++) {
cin >> a;
if (a == '0') pr = false;
}
if (pr == false)
ans++;
else {
if (ans != 0) {
answer = max(answer, ans);
ans = 0;
}
}
}
cout << max(answer, ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int kol, maxi = 0, ans = 0;
char x;
for (int i = 1; i <= d; i++) {
kol = 0;
for (int j = 1; j <= n; j++) {
cin >> x;
if (x == '1') kol++;
}
if (kol == n)
ans = 0;
else
ans++;
if (ans > maxi) maxi = ans;
}
cout << maxi;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int o, n, mx = 0, ct = 0;
string s;
cin >> o >> n;
for (int i = 0; i < n; i++) {
cin >> s;
bool all = true;
for (int j = 0; j < o; j++) {
if (s[j] == 48) {
all = false;
ct++;
break;
}
}
if (all == true) ct = 0;
mx = max(mx, ct);
}
cout << mx << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d;
char str[110];
int main() {
int i, j;
scanf("%d%d", &n, &d);
int ans = 0;
int cnt = 0;
for (i = 1; i <= d; i++) {
scanf("%s", str);
bool flag = 0;
for (j = 0; j < n; j++) {
if (str[j] == '0') {
flag = 1;
break;
}
}
if (flag == 1)
cnt++;
else
cnt = 0;
ans = max(ans, cnt);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
int last = 0;
for (int i = 1; i <= m; ++i) {
string s;
cin >> s;
bool flag = false;
for (int j = 0; j < s.size(); ++j)
if (s[j] == '0') flag = true;
if (!flag)
last = i;
else
ans = max(ans, i - last);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[220];
int n, d, k = 0, l = 0, maxx = 0;
string s[200];
cin >> n >> d;
for (int i = 0; i < d; i++) cin >> s[i];
for (int i = 0; i < d; i++) {
if (s[i].find("0") >= 0 && s[i].find("0") <= s[i].size())
a[i] = 0;
else
a[i] = 1;
}
for (int i = 0; i < d; i++) {
if (a[i] == 0) {
k++;
}
if (a[i] != 0 || i == d - 1) {
if (maxx < k) maxx = k;
k = 0;
}
}
cout << maxx;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[105];
int main() {
int n, d;
scanf("%d%d", &n, &d);
int tmp = 0, ans = 0;
for (int it = 0; it < d; it++) {
scanf("%s", str);
bool ok = 0;
for (int i = 0; i < n; i++) {
if (str[i] == '0') ok = 1;
}
if (ok)
tmp++;
else
tmp = 0;
ans = max(ans, tmp);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d, check[150], nub = 0, mc = -1;
char s[150][150];
int main() {
scanf("%d%d", &n, &d);
for (int i = 0; i < d; i++) {
scanf("%s", &s[i][0]);
for (int j = 0; j < n; j++) {
if (s[i][j] == '0') {
check[i] = 1;
}
}
}
for (int i = 0; i < d; i++) {
if (check[i] == 1)
nub++;
else {
if (nub > mc) mc = nub;
nub = 0;
}
}
if (nub > mc) mc = nub;
printf("%d", mc);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d, mx = 0, sm = 0, cn = 0;
string str;
int main(int argc, const char* argv[]) {
cin >> n >> d;
for (int i = 0; i < d; ++i) {
cin >> str;
sm = 0;
for (int j = 0; j < n; ++j) {
sm += (int)(str[j] == '1');
}
if (sm < n)
cn++;
else {
mx = max(mx, cn);
cn = 0;
}
}
mx = max(mx, cn);
cout << mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int d;
cin >> n >> d;
int result = 0;
int cur = 0;
for (int t = 0; t < d; t++) {
string s;
cin >> s;
bool f = true;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0') f = false;
}
if (!f) {
cur++;
if (cur > result) result = cur;
} else
cur = 0;
}
cout << result;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d, conse, k, ans;
void solve() {
conse = ans = 0;
cin >> n >> d;
while (d--) {
int ok = 1;
char ch[200];
scanf("%s", ch);
for (int i = 0; i < n; i++) {
k = ch[i] - '0';
if (k == 0) ok = 0;
}
if (ok == 0)
conse++;
else
conse = 0;
if (conse > ans) ans = conse;
}
printf("%d\n", ans);
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, d;
string s[100];
bool ok[100];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> d;
for (int i = 0; i < (int)(d); i++) cin >> s[i];
for (int i = 0; i < (int)(d); i++) {
int cnt = 0;
for (int j = 0; j < (int)(s[i].length()); j++)
if (s[i][j] == '1') ++cnt;
ok[i] = cnt < n;
}
int ret = 0;
for (int i = 0; i < (int)(d); i++)
for (int j = (int)(i); j < (int)(d); j++) {
bool ck = true;
for (int k = (int)(i); k < (int)(j + 1); k++) ck &= ok[k];
if (ck) ret = max(ret, j - i + 1);
}
cout << ret << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, r, liel = 0, peck = 0;
bool ir;
cin >> k >> r;
char iev;
for (long long i = 0; i < r; i++) {
ir = false;
for (long long a = 0; a < k; a++) {
cin >> iev;
if (iev == '0' && !ir) {
ir = true;
peck++;
}
}
if (!ir) {
liel = max(liel, peck);
peck = 0;
}
}
cout << max(liel, peck);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, z, i, j, x, n;
string s, m;
while (cin >> a >> b) {
c = 0, z = 0, x = 0;
int max = 0;
for (i = 0; i < b; i++) {
cin >> s;
c = 0;
for (j = 0; j < a; j++) {
if (s[j] == '0') {
c = 1;
break;
}
}
if (c == 1) {
z++;
}
if (c == 0) z = 0;
if (z > max) max = z;
c = 0;
}
cout << max << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
string one;
for (int i = 0; i < n; i++) {
one += "1";
}
vector<string> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<int> d(m);
for (int i = 0; i < m; i++) {
if (a[i] == one) {
d[i] = 0;
} else {
d[i] = 1;
}
}
int ans = 0;
bool ok = false;
int cnt = 0;
for (int i = 0; i < m; i++) {
if (d[i] == 1) {
cnt += 1;
if (ans < cnt) ans = cnt;
} else {
cnt = 0;
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int ans = 0;
int cnt = 0;
for (int i = 0; i < d; i++) {
string s;
cin >> s;
bool ok = 0;
for (int j = 0; j < n; j++)
if (s[j] == '0') {
ok = 1;
break;
}
if (ok)
cnt++;
else
cnt = 0;
ans = max(ans, cnt);
}
ans = max(ans, cnt);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int mx = 0, cnt = 0;
int n, d;
vector<string> v;
cin >> n >> d;
for (int i = 0; i < d; ++i) {
string s;
cin >> s;
v.push_back(s);
}
for (int i = 0; i < d; ++i) {
bool f = false;
for (int j = 0; j < n; ++j) {
if (v[i][j] == '0') {
f = true;
}
}
if (f) {
cnt++;
} else {
mx = max(mx, cnt);
cnt = 0;
}
}
mx = max(mx, cnt);
cout << mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, MAXN = 1e5;
const double EPS = 1e-9;
int main() {
int n, d;
cin >> n >> d;
string check(n, '1');
int maxCombo = 0, combo = 0;
for (int i = 0; i < d; i++) {
string s;
cin >> s;
if (s == check) {
maxCombo = max(maxCombo, combo);
combo = 0;
} else {
combo++;
}
}
cout << max(maxCombo, combo) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, d = 0, count = 0, maxCount = 0;
cin >> n >> d;
string s = "";
for (int i = 0; i < d; i++) {
cin >> s;
int res = 1;
for (int j = 0; j < s.size(); j++) {
res &= (s[j] - '0');
}
if (res == 1) {
maxCount = max(count, maxCount);
count = 0;
} else {
count++;
}
}
maxCount = max(count, maxCount);
cout << maxCount;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Day12[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int prime100[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103};
template <typename T>
inline bool isLeap(T y) {
return (y % 400 == 0) || (y % 100 ? y % 4 == 0 : false);
}
template <typename T>
inline T BIGMOD(T A, T B, T M = 1000000007) {
T ret = 1;
while (B) {
if (B & 1) ret = (ret * A) % M;
A = (A * A) % M;
B = B >> 1;
}
return ret;
}
template <typename T>
inline T BigMod(T A, T B, T M) {
T ret = 1;
while (B) {
if (B & 1) ret = (ret * A) % M;
A = (A * A) % M;
B = B >> 1;
}
return ret;
}
long long int MySqrt(long long int n) {
long long int p = sqrt(n);
if ((p + 1) * (p + 1) <= n)
return p + 1;
else if (p * p <= n)
return p;
else
return p - 1;
}
long long int MyPow(long long int x, long long int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return MyPow(x * x, n / 2);
else
return x * MyPow(x * x, ((n - 1) / 2));
}
long long int modInverse(long long int n) {
return BIGMOD(n, (long long int)1000000007 - 2) % 1000000007;
}
int a[105][105];
int main() {
int n, d;
scanf("%d%d", &(n), &(d));
for (int i = 1; i <= d; i++) {
for (int j = 1; j <= n; j++) {
char ch;
cin >> ch;
a[i][j] = ch - '0';
}
}
int mx = INT_MIN;
int cnt = 0;
for (int i = 1; i <= d; i++) {
int present = 1;
for (int j = 1; j <= n; j++) {
present = present & a[i][j];
}
if (!present) {
cnt++;
} else
cnt = 0;
mx = max(mx, cnt);
}
cout << mx << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, sum = 0, ans = 0;
cin >> n >> d;
string *s = new string[d];
for (int i = 0; i < d; i++) cin >> s[i];
for (int i = 0; i < d; i++) {
int flag = 0;
for (int k = 0; k < n; k++) {
if (s[i][k] == '0') {
flag = 1;
break;
}
}
if (flag)
ans++;
else
ans = 0;
sum = max(sum, ans);
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void Cond(int g) {
if (g)
cout << ("YES") << endl;
else
cout << ("NO") << endl;
return;
}
void cond(int g) {
if (g)
cout << ("Yes") << endl;
else
cout << ("No") << endl;
return;
}
long long comb(long long i, long long j) {
long long up = 1;
for (long long n = i; n > i - j; n--) {
up *= n;
}
long long down = 1;
for (long long r = j; r >= 1; r--) down *= r;
return up / (down);
}
long long gcd(long long a, long long b) {
if (a < b) swap(a, b);
if (a % b == 0) return b;
gcd(b, a % b);
}
long long Digits(long long k) {
long long t = 0;
while (k) {
t += k % 10;
k /= 10;
}
return t;
}
string su = "0123456789";
string m1 = "abcdefghijklmnopqrstuvwxyz";
string m2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
map<char, long long> m5;
const long long INF = (long long)1e17;
const long long MAX = (long long)1e5 + 5;
const long long NIL = -1;
struct Node {
long long p, l, r;
};
typedef struct edge2 {
pair<long long, long long> to;
long long cost;
} EDGE2;
typedef struct edge1 {
long long to, cost;
} EDGE;
typedef struct edge {
long long to, cap, rev;
} EDGE3;
long long ans = 0, ct = 0, ct1 = 0, ct2 = 0, cnt = 0, tmp = 0, g = 0, n = 0,
m = 0;
long long tmp1 = 0, tmp2 = 0, tmp3 = 0, tmp4 = 0, sum = 0, pos = 0, k = 0;
long long len = 0, len1 = 0, len2 = 0, len3 = 0, len4 = 0, len5 = 0;
long long mx = -INF, mn = INF, mask = 0, ans1 = 0, ans2 = 0;
long long t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0;
long long t7 = 0, t8 = 0, t9 = 0, t10 = 0, t11 = 0, t12 = 0;
map<long long, long long> mp, mp1, mp2, mp3, mp4;
set<long long> st, st1, st2, st3, st4, st5;
set<pair<long long, long long>> pst, pst1, pst2;
set<char> cst, cst1, cst2;
const long long MOD = (long long)1e9 + 7;
const long long M = MOD;
vector<long long> fac(1e6), ifac(1e6);
vector<long long> v, v1, v2, v3, v4, v5, v6, v7;
vector<long long> rui(MAX * 5), rui1(MAX * 5), rui2(MAX * 5);
long long powmod(long long a, long long b, long long x) {
if (!b) return 1;
if (!(b % 2)) {
long long t = powmod(a, b / 2, x);
return t * t % x;
}
return ((a)*powmod(a, b - 1, x)) % x;
}
long long cmb(long long a, long long b) {
if (a < b || a < 0 || b < 0) return 0;
if (!a && !b) return 1;
tmp = ifac[a - b] * ifac[b] % MOD;
return (tmp * fac[a]) % MOD;
}
void ncr() {
fac[0] = ifac[0] = 1;
for (long long i = 0; i < 1e6; i++) {
fac[i + 1] = fac[i] * (i + 1) % M;
ifac[i + 1] = ifac[i] * (powmod(i + 1, M - 2, M)) % M;
}
}
long long soinsu(long long k) {
long long x = k;
long long num = 0;
for (int i = 2; (i * i) <= x; i++) {
while (!(k % i)) {
k /= i;
if (i >= 4) return -100;
if (i == 2) {
ct++;
} else if (i == 3)
cnt++;
}
}
if (k != 1) {
if (k % 3 == 0) {
cnt++;
} else if (k % 2 == 0) {
ct++;
} else
return -100;
}
if (k != 1) num++;
return num;
}
class UF {
public:
vector<long long> rank, par, siz;
UF(long long s) {
rank.resize(s + 4, 0), par.resize(s + 4);
for (long long i = 1; i < s + 1; i++) par[i] = i;
siz.resize(s, 1);
return;
}
void unite(long long x, long long y) {
x = root(x);
y = root(y);
if (x == y) return;
if (rank[x] > rank[y]) {
par[y] = x;
siz[y] += siz[x];
siz[x] = siz[y];
return;
}
if (rank[x] == rank[y]) {
rank[y]++;
}
par[x] = y;
siz[x] += siz[y];
siz[y] = siz[x];
}
long long root(long long x) {
if (par[x] != x) {
par[x] = root(par[x]);
}
return par[x];
}
long long same(long long x, long long y) {
return (root(x) == root(y)) ? 1 : 0;
}
long long vsize(long long x) { return siz[root(x)]; }
};
void maker() {
srand((unsigned int)time(NULL));
for (long long i = 0; i < 14; i++) {
t5 = rand() % 50 + 1;
if (i) cout << " ";
cout << t5;
}
cout << endl;
}
void make_random_permutation(long long x) {
srand((unsigned int)time(NULL));
v.resize(11);
for (long long i = 1; i < x + 1; i++) v[i] = i;
long long ct3 = 0;
st2.clear();
while (ct3 < x) {
t5 = rand() % x + 1;
if (st2.find(t5) == st2.end()) {
v[t5] = ++ct3;
st2.insert(t5);
}
}
for (long long i = 1; i < x + 1; i++) {
if (i) cout << " ";
cout << v[i];
}
cout << endl;
}
void di() {
m5['a'] = 0;
m5['b'] = 1;
m5['c'] = 2;
m5['d'] = 3;
m5['e'] = 4;
m5['f'] = 5;
m5['g'] = 6;
m5['h'] = 7;
m5['i'] = 8;
m5['j'] = 9;
m5['k'] = 10;
m5['l'] = 11;
m5['m'] = 12;
m5['n'] = 13;
m5['o'] = 14;
m5['p'] = 15;
m5['q'] = 16;
m5['r'] = 17;
m5['s'] = 18;
m5['t'] = 19;
m5['u'] = 20;
m5['v'] = 21;
m5['w'] = 22;
m5['x'] = 23;
m5['y'] = 24;
m5['z'] = 25;
}
vector<long long> dat((long long)1e6, 0);
void init(long long n3) {
n = 1;
while (n < n3) {
n *= 2;
}
dat.resize(n, 0);
return;
}
long long f14(long long a, long long b, long long k2, long long l,
long long r) {
if (r <= a || b <= l) return -INF;
if (a <= l && r <= b) return dat[k2];
long long q1 = f14(a, b, (2 * k2) + 1, l, (l + r) / 2);
long long q2 = f14(a, b, (2 * k2) + 2, (l + r) / 2, r);
return max(q1, q2);
}
void update(long long k1, long long a) {
k1 += n - 1;
dat[k1] = a;
while (k1 > 0) {
k1 = (k1 - 1) / 2;
dat[k1] = max(dat[(2 * k1) + 1], dat[(2 * k1) + 2]);
}
return;
}
bool used[(long long)1e8];
vector<vector<EDGE3>> G4(1e6);
void add_edge(long long from, long long to, long long capaci) {
G4[from].push_back((edge){to, capaci, (long long)G4[to].size()});
G4[to].push_back((EDGE3){from, 0, (long long)G4[from].size() - 1});
return;
}
long long fdfs(long long v, long long t, long long f) {
if (v == t) return f;
used[v] = 1;
for (long long i = 0; i < G4[v].size(); i++) {
EDGE3 &e = G4[v][i];
if (!used[e.to] && e.cap > 0) {
long long d = fdfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G4[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
long long maxflow(long long s, long long t) {
long long flow = 0;
while (1) {
memset(used, 0, sizeof(used));
long long f = fdfs(s, t, INF);
if (!f) return flow;
flow += f;
}
}
vector<vector<EDGE>> G(1e6);
vector<long long> dist(1e6, INF);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
clock_t start = clock();
cin >> n;
long long d;
cin >> d;
for (long long i = 0; i < d; i++) {
string s;
cin >> s;
t1 = 0;
for (long long j = 0; j < n; j++) t1 += (s[j] == '1');
mp[i] = (t1 < n);
}
for (long long i = 0; i < d; i++) {
if (!g && !mp[i]) {
continue;
}
if (!g && mp[i]) {
mx = max(mx, g);
g = 1;
continue;
}
if (g && mp[i]) {
mx = max(mx, g);
g++;
continue;
}
if (g && !mp[i]) {
mx = max(mx, g);
g = 0;
continue;
}
}
cout << ((mx != -INF) ? (long long)max(g, mx) : 1 ^ 1) << endl;
clock_t end = clock();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 30 * 1000 + 20;
const long long MAXN = 401;
const long long MLOG = 18;
const long long NMAX = 60;
signed main() {
long long n, m, ans = 0;
cin >> m >> n;
string s, s1;
for (long long i = 0; i < m; i++) {
s1 += '1';
}
long long now = 0;
for (long long i = 0; i < n; i++) {
cin >> s;
if (s == s1)
now = 0;
else
now++, ans = max(ans, now);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int i, j;
char str[1000];
int ans = 0;
int flag = 0;
int res = 0;
int max = 0;
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) {
cin >> str[j];
}
str[j] = '\0';
j = 0;
while (str[j] != '\0') {
if (str[j] != '0') {
flag = 0;
break;
}
flag = 1;
j++;
}
j = 0;
if (!flag) {
while (str[j] != '\0') {
if (str[j] == '0') {
flag = 1;
break;
}
j++;
}
}
if (flag == 1) {
ans++;
res = ans;
} else {
res = ans;
ans = 0;
}
flag = 0;
if (res > max) max = res;
}
cout << max;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int count = 0, mx_dys = INT_MIN;
int cnt1 = 0;
for (int i = 0; i < d; i++) {
string s;
cin >> s;
cnt1 = 0;
for (int j = 0; j < n; j++) {
if (s[j] == '1') cnt1++;
}
if (cnt1 == n) {
if (count > mx_dys) mx_dys = count;
count = 0;
} else
count += 1;
}
cout << max(count, mx_dys) << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main(int argc, const char* argv[]) {
int n, d;
std::cin >> n >> d;
int max = 0, current = 0;
for (int i = 0; i < d; i++) {
std::string s;
std::cin >> s;
if (s.find("0") != std::string::npos)
current++;
else
current = 0;
if (max < current) max = current;
}
std::cout << max << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 100;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, d, mx = 0, x = 0, l = 0;
cin >> n >> d;
string s[d];
for (long long int i = 0; i < d; i++) {
cin >> s[i];
for (long long int j = 0; j < s[i].size(); j++) {
if (s[i][j] == '0') {
x++;
goto hell;
}
}
mx = max(mx, x);
x = 0;
hell:;
}
mx = max(x, mx);
cout << mx << endl;
}
|
#include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int n, d;
std::cin >> n >> d;
std::string in;
std::vector<std::string> opp;
bool count = false;
std::priority_queue<int> wins;
int win = 0;
for (int i = 0; i < d; i++) {
std::cin >> in;
if (in.find('0') != std::string::npos) {
win++;
} else {
wins.push(win);
win = 0;
}
}
wins.push(win);
std::cout << wins.top() << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str0[100 * 2], str[100 * 2];
int main() {
int n, d;
int num, mx = 0;
int i;
scanf("%d%d", &n, &d);
for (i = 0; i < n; i++) str0[i] = '1';
str0[i] = '\0';
num = 0;
for (i = 0; i < d; i++) {
scanf("%s", str);
if (strcmp(str0, str))
num++;
else
num = 0;
if (num > mx) mx = num;
}
printf("%d", mx);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 501;
signed main() {
long long n, m;
cin >> n >> m;
long long cnt = 0, mx = 0;
for (long long i = 0; i < m; ++i) {
string s;
cin >> s;
if (count(s.begin(), s.end(), '1') != s.size())
cnt++;
else {
mx = max(mx, cnt);
cnt = 0;
}
}
cout << max(mx, cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> r;
int main() {
ll n, m;
cin >> n >> m;
ll cnt = 0, d;
while (m--) {
d = 0;
string s;
cin >> s;
for (auto x : s) {
if (x == '0') {
cnt++;
d = 1;
break;
}
}
if (d) {
r.push_back(cnt);
}
if (!d) {
cnt = 0;
}
}
sort(r.begin(), r.end());
if (r.size() > 0) {
cout << r[r.size() - 1] << '\n';
}
if (r.size() == 0) {
cout << 0 << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
string s[d];
string ans = "";
for (int i = 0; i < n; i++) {
ans += '1';
}
int count = 0;
for (int i = 0; i < d; i++) {
cin >> s[i];
}
int max = 0;
for (int i = 0; i < d; i++) {
if (s[i] == ans) {
if (max < count) {
max = count;
}
count = 0;
} else {
count++;
}
}
if (max < count) {
max = count;
count = 0;
}
cout << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int nr, d, Max, i, j, n;
char x;
bool ok;
int main() {
scanf("%d %d\n", &n, &d);
Max = 0;
nr = 0;
for (i = 1; i <= d; i++) {
ok = false;
for (j = 1; j <= n; j++) {
scanf("%c", &x);
if (x == '0') ok = true;
}
if (ok == true)
nr++;
else
nr = 0;
if (nr > Max) Max = nr;
scanf("%c", &x);
}
printf("%d", Max);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
string tocmp = "";
for (int i = 1; i <= n; ++i) {
tocmp.push_back('1');
}
int mx = 0;
int cur = 0;
for (int i = 1; i <= d; ++i) {
string a;
cin >> a;
if (a == tocmp) {
cur = 0;
} else {
cur++;
if (cur > mx) {
mx = cur;
}
}
}
cout << mx << "\n";
return 0;
}
|
#include <bits/stdc++.h>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n, d;
cin >> n >> d;
int ans = 0, k = 0;
for (int i = 0; i < d; ++i) {
string s;
cin >> s;
int x = 0;
for (auto &&j : s) x |= (j == '0');
if (x)
k++;
else
k = 0;
ans = max(ans, k);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
int main() {
int n, d, b, counter = 0, answer = 0;
;
cin >> n >> d;
string *tab = new string[d];
for (int i = 0; i < d; i++) {
cin >> tab[i];
}
for (int i = 0; i < d; i++) {
for (int j = 0; j < n; j++) {
if (tab[i][j] == '0') {
counter++;
break;
}
if (j == n - 1) counter = 0;
}
answer = max(answer, counter);
}
cout << answer;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d, c = 0, cn = 0, cnt = 0;
cin >> n >> d;
string s[d + 5];
for (int i = 0; i < d; i++) {
cin >> s[i];
}
for (int i = 0; i < d; i++) {
c = 0;
for (int j = 0; j < s[i].size(); j++) {
if (s[i][j] == '0') {
c++;
break;
}
}
if (c > 0)
cn++;
else
cn = 0;
if (cn > cnt) {
cnt = cn;
}
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string M[200];
int main() {
int n, d;
while (cin >> n >> d) {
for (int i = 0; i < d; i++) cin >> M[i];
int ans = 0;
int c = 0;
for (int i = 0; i < d; i++) {
bool sw = 0;
for (int j = 0; j < n; j++) {
if (M[i][j] == '0') {
sw = 1;
break;
}
}
if (sw) {
c++;
} else {
c = 0;
}
ans = max(ans, c);
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[111];
int main() {
int n, d, sum = 0, num = 0, m = 0;
cin >> n >> d;
while (d--) {
cin >> a;
num = 0;
for (int i = 0; i < n; i++) {
if (a[i] == '0') num++;
}
if (num)
sum++;
else
sum = 0;
m = max(m, sum);
}
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, k, x, y, i, j, l, r, t, a[456], d;
set<long long> s;
set<long long>::reverse_iterator it;
char c;
int main() {
cin >> n >> d;
for (i = 0; i < d; i++) {
for (j = 0; j < n; j++) {
cin >> c;
if (c == '1') a[i]++;
}
}
a[d] = n;
for (i = 0; i <= d; i++) {
if (a[i] == n) continue;
t = 1;
while (a[i + 1] < n && i + 1 < d) {
t++;
i++;
}
m = max(m, t);
}
cout << m;
}
|
#include <bits/stdc++.h>
int main() {
int n, d;
scanf("%d", &n);
getchar();
scanf("%d", &d);
getchar();
int cons = 1;
int prev = 1;
int best = 1;
int twin = 0;
int j = 0;
while (d--) {
int lose = 1;
int i = 0;
char c;
while (i <= n) {
c = getchar();
if (c == '\n') break;
if (c == '0') lose = 0;
i++;
}
twin += !lose;
if (j > 0 && prev == lose && prev == 0) {
cons++;
if (cons > best) best = cons;
}
if (j > 0 && prev != lose && lose) cons = 0;
if (j > 0 && prev != lose && prev) cons = 1;
prev = lose;
j++;
}
if (!twin)
printf("0\n");
else {
printf("%d\n", best);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int mx = 0, cnt = 0;
for (int i = 0; i < m; ++i) {
string s;
cin >> s;
bool flag = true;
for (int j = 0; j < n; ++j) {
if (s[j] == '0') flag = false;
}
if (flag == false)
++cnt;
else
cnt = 0;
mx = max(mx, cnt);
}
cout << mx;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, d, count = 0, i, j, temp = 0, o = 0;
scanf("%d %d", &n, &d);
char arr[n];
for (i = 0; i < d; i++) {
scanf("%s", arr);
count = 0;
for (j = 0; j < n; j++) {
if (arr[j] == '0') {
count++;
break;
}
}
if (count == 1) {
temp++;
if (temp > o) o = temp;
} else
temp = 0;
}
printf("%d\n", o);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int d, n, c, ans, m;
string arr[105];
cin >> n >> d;
ans = 0;
m = 0;
for (int i = 0; i < d; i++) {
cin >> arr[i];
c = 0;
for (int j = 0; j < n; j++) {
if (arr[i][j] == '1') c++;
}
if (c < n)
m++;
else
m = 0;
if (m > ans) ans = m;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 105;
bool mark[MX];
int main() {
int n, k, alaki = 0, ans = 0;
char x;
cin >> n >> k;
for (int i = 0; i < k; i++) {
for (int j = 0; j < n; j++) {
cin >> x;
if (x == '0') mark[i] = 1;
}
}
for (int i = 0; i < k; i++) {
if (mark[i] == 1) {
alaki++;
ans = max(ans, alaki);
} else
alaki = 0;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d, i, j, mx = 0, f = 0, tmp, x, c = 0;
string s;
scanf("%lld %lld", &n, &d);
while (d--) {
cin >> s;
x = 0;
for (i = 0; i < s.size(); i++) {
x += (s[i] - 48);
}
if (x == n) {
if (c > mx) mx = c;
c = 0;
} else {
c++;
}
}
if (c > mx) mx = c;
printf("%lld\n", mx);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c = 0, cn = 0, cnt = 0;
long long mx = -1, mxx = -1, mxxx = -1;
long long n, d;
cin >> n >> d;
string s;
for (int i = 0; i < d; i++) {
cin >> s;
if (s.find('0') != -1) {
c++;
} else {
cnt = max(c, cnt);
c = 0;
}
}
cout << max(c, cnt) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9;
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
long long n, d;
cin >> n >> d;
long long ma = 0;
long long cnt = 0;
for (long long i = 0; i < (d); i++) {
string s;
cin >> s;
bool win = false;
for (long long j = 0; j < (s.size()); j++) {
if (s[j] == '0') win = true;
}
if (win) {
cnt++;
} else {
ma = max(ma, cnt);
cnt = 0;
}
}
ma = max(ma, cnt);
cout << ma << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[105][105];
int main() {
int i, j, k, l, m, n, ans = 0, ret = 0, fl, d;
scanf("%d %d", &n, &d);
for (i = 1; i <= d; i++) scanf("%s", s[i]);
for (i = 1; i <= d; i++) {
for (j = 0, fl = 0; j < n; j++) {
if (s[i][j] == '0') fl = 1;
}
if (fl == 1) {
ret++;
ans = max(ret, ans);
} else {
ret = 0;
ans = max(ret, ans);
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
int main() {
int n, d, i, j;
char *a;
int b[100] = {};
int t = 0, max = 0;
a = (char *)malloc(sizeof(char *) * 500);
scanf("%d %d", &n, &d);
for (i = 0; i < d; i++) {
scanf("%s", a);
for (j = 0; j < n; j++) {
if (a[j] == '0') b[i] = 1;
}
}
for (i = 0; i < d; i++) {
if (b[i] == 0) t = 0;
if (b[i] == 1) {
t++;
if (t > max) max = t;
}
}
printf("%d\n", max);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0, m = 0, p = 0;
cin >> a >> b;
for (int i = 0; i < b; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == '0')
c++;
else {
c = 0;
}
m = max(m, c);
}
cout << m;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
bool f;
int n, d, ans = 0, cnt = 0;
string s;
cin >> n >> d;
for (int i = 0; i < d; i++) {
f = false;
cin >> s;
for (int j = 0; j < s.size(); j++) {
if (s[j] == '0') {
f = 1;
break;
}
}
if (f) {
cnt++;
ans = max(ans, cnt);
} else
cnt = 0;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
while (scanf("%d %d", &n, &d) == 2) {
int ans = 0, cnt = 0;
int pp = 1;
for (int i = 1; i <= d; i++) {
string s;
cin >> s;
int flag = 1;
for (int j = 0; j < s.length(); j++) {
if (s[j] == '0') {
flag = 0;
break;
}
}
if (flag) {
ans = max(ans, cnt);
cnt = 0;
} else
cnt++;
ans = max(ans, cnt);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 111;
int a[maxN + 1][maxN + 1], b[maxN];
int main() {
int m, n;
cin >> m >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
for (int j = 1; j <= m; ++j) a[i][j] = s[j - 1] - '0';
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j)
if (a[i][j] == 0) b[i] = 1;
}
int ans = 0, cnt = 0;
for (int i = 1; i <= n; ++i) {
if (b[i] == 1)
++cnt;
else
cnt = 0;
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n;
cin >> d;
string t[d];
for (int i = 0; i < d; i++) {
cin >> t[i];
}
int m;
int nb(0);
for (int j = 0; j < d; j++) {
unsigned int k(0);
bool trouve(true);
while (k < t[j].size() && trouve == true) {
if (t[j][k] == '0') {
trouve = false;
nb++;
}
k++;
if (nb > m) {
m = nb;
}
}
if (trouve == true) {
nb = 0;
}
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c = 0, cn = 0, cnt = 0;
long long n, d;
cin >> n >> d;
string s;
for (int i = 0; i < d; i++) {
cin >> s;
int l = s.find('0');
if (l >= 0) {
c++;
cnt = max(cnt, c);
} else
c = 0;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, cont = 0, ans = 0;
string str[110], stra = "";
scanf("%d %d", &n, &d);
for (int i = 0; i < n; i++) stra += '1';
for (int i = 0; i < d; i++) {
cin >> str[i];
}
bool must = false;
for (int i = 0; i < d; i++) {
if (stra != str[i]) {
if (must) {
cont++;
} else {
cont = 1;
}
must = true;
} else {
must = false;
}
ans = max(ans, cont);
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
string nig;
int main() {
int n, d;
cin >> n >> d;
int mx = -1;
int ctr = 0;
for (int i = 1; i <= d; i++) {
cin >> nig;
int fl = 1;
for (int i = 0; i < n; i++) fl &= (nig[i] == '0') ? 0 : 1;
if (fl == 0)
ctr++;
else
ctr = 0;
mx = max(mx, ctr);
}
cout << mx << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 13;
int main() {
int n, d;
cin >> n >> d;
int a[111], cnt = 0;
a[cnt++] = 0;
for (int i = 1; i <= d; i++) {
char c;
bool ok = true;
for (int j = 0; j < n; j++) {
cin >> c;
if (c == '0') ok = false;
}
if (ok) a[cnt++] = i;
}
a[cnt++] = d + 1;
int ans = 0;
for (int i = 1; i < cnt; i++) ans = max(ans, a[i] - a[i - 1] - 1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char tmp;
int d, n, tes, ans = 0, sum = 0;
scanf("%d %d", &n, &d);
for (int i = 1; i <= d; i++) {
getchar();
tes = 0;
for (int j = 0; j < n; j++) {
scanf("%c", &tmp);
if (tmp == '0') tes = 1;
}
if (tes > 0)
sum++;
else
sum = 0;
ans = max(ans, sum);
}
printf("%d\n", ans);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.