Cod sursa(job #2066851)
Utilizator | Data | 15 noiembrie 2017 16:38:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
using namespace std;
int main()
{
int n,m,a[101][100],cnt=0;
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>a[i][j];
for(int j=1;j<=m;j++)
{
int vmin=a[1][j];
for(int i=2;i<=n;i++)
if(a[i][j]<vmin) vmin=a[i][j];
cnt+=vmin;
}
cout<<cnt;
}