fork download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4. int main()
  5. {
  6.     int n,k;
  7.     cin>>n;
  8.     cin>>k;
  9.     int a[n][k+1];
  10.     for(int i=1;i<=n;i++)
  11.       for(int j=1;j<=k+1;j++) cin>>a[i][j];
  12.     for(int i=1;i<=n;i++)
  13.       for(int j=1;j<k+1;j++) 
  14.       a[i][j]*=a[i][k+1];
  15.  
  16.       for(int i=1;i<=n;i++)
  17.       {
  18.           for(int j=1;j<=k;j++)
  19.             cout<<a[i][j]<<" ";
  20.         cout<<endl;
  21.       }
  22.       for(int i=1;i<=n;i++)
  23.       for(int j=2;j<k+1;j++) 
  24.       a[i][j]+=a[i][j-1];
  25.       for(int i=1;i<=n;i++)
  26.       {
  27.           for(int j=1;j<=k;j++)
  28.             cout<<a[i][j]<<" ";
  29.         cout<<endl;
  30.       }
  31.       /* int max=0;
  32.       for(int i=1;i<=n;i++)
  33.       {
  34.           
  35.           if(max<a[i][6])
  36.           {
  37.               max=a[i][6];
  38.           }
  39.       } cout<<max;*/
  40.       /*int i=2;*/
  41.       int check[n];
  42.       for(int i=1;i<=n;i++) 
  43.       check[i]=0;
  44.       for(int i=2;i<k;i+=2)
  45.       {
  46.          int max=0;
  47.           for(int j=1;j<=n;j++){
  48.               if(max<a[j][i])
  49.                   max=a[j][i];}
  50.              cout<<max<<endl;    
  51.            for(int j=1;j<=n;j++){
  52.              if(max==a[j][i]) 
  53.                check[j]+=1;}
  54.  
  55.       }  
  56.       //for(int i=1;i<=n;i++) cout<<check[i];*/
  57.  
  58. }
Runtime error #stdin #stdout 0s 15240KB
comments (?)
stdin
copy 
3
8
2 2 4 3 5 2 6 2 3
3 5 7 4 3 9 3 2 2
1 2 4 2 7 5 3 2 4
stdout
copy 
Standard output is empty
https://ideone.com/y847uz
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!