# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1128748 | nurkeyevv | Bomb (IZhO17_bomb) | C++20 | 2 ms | 584 KiB |
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N = 2550;
const int M = 100;
const int mod1 = 998244353;
const int mod = 998244353;
const int inf = 1e18;
char a[M][M];
void porsсhe(){
int n,m;
cin >> n >> m;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
cin >> a[i][j];
}
}
int cnt = 0,mn = inf,mn1 = inf;
for(int i = 1;i <= n;i++){
cnt = 0;
for(int j = 1;j <= m;j++){
if(a[i][j] == '1'){
cnt++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |