Thursday, 6 April 2017

Geeksforgeeks Solution For " Maximum no of 1's row "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Maximum no of 1's row

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
using namespace std;

int main() {
int t;
cin>>t;
while(t--){
   int r,c,i,j,row_n,prev_c=0,cur_c;
   cin>>r>>c;
   bool a[r][c];
   for(i=0; i<r; i++)
       for(j=0; j<c; j++)
           cin>>a[i][j];
   
   for(i=0; i<r; i++){
       cur_c=0;
       for(j=0; j<c; j++){
          if(a[i][j]==1)
           cur_c++;
       }   
       if(cur_c>prev_c){
            row_n=i;
       prev_c=cur_c;
       }
               
   }     
   cout<<row_n<<endl;
}
return 0;
}

Output:-



Geeksforgeeks Solution For " Maximum no of 1's row "

No comments:
Write comments

Recommended Posts × +