847G - University Classes - CodeForces Solution

implementation *900

Please click on ads to support us..

Python Code: 

t=int(input())
temp=[]
c=0
count=[]

if t==1:
    l=list(input())
    if l.count('1')==0:
        print(0)
    else:
        print(1)
else:
    for i in range(t):
        l=list(input())
        temp.append(l)
    
    for k in range(7):
        c=0
        for j in temp:
            if j[k]=='1':
                c+=1
        count.append(c)
    print(max(count))

C++ Code: 

#include <iostream>
#include <math.h>
using namespace std;

int main () {
    int n;
    cin >> n;
    string classes[n];

    for (int i = 0; i < n; i++) {
        cin >> classes[i];
    }
    
    int maxClass = 0, countClass = 0;

    for (int j = 0; j < 7; j++) {
        for (int i = 0; i < n; i++) {
            if (classes[i][j] == '1') {
                countClass++;
            }
        }
        
        if (countClass > maxClass) {
            maxClass = countClass;
        }
        
        countClass = 0;
    }

    cout << maxClass;

    return 0;
}


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST