# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201856 | 2020-02-12T09:13:17 Z | blacktulip | Emacs (COCI20_emacs) | C++14 | 6 ms | 376 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo MAX = -1000000000000000000; const lo MIN = 1000000000000000000; const lo inf = 1000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; string s; char c[105][105]; vector<int> v; int main(void){ scanf("%d %d",&n,&m); FOR{ for(int j=1;j<=m;j++){ scanf(" %c",&c[i][j]); if(c[i][j]=='*')cev++; } } cout<<cev<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Incorrect | 5 ms | 376 KB | Output isn't correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Incorrect | 5 ms | 256 KB | Output isn't correct |
5 | Incorrect | 4 ms | 256 KB | Output isn't correct |
6 | Incorrect | 5 ms | 376 KB | Output isn't correct |
7 | Incorrect | 5 ms | 376 KB | Output isn't correct |
8 | Incorrect | 5 ms | 376 KB | Output isn't correct |
9 | Incorrect | 6 ms | 376 KB | Output isn't correct |
10 | Incorrect | 5 ms | 376 KB | Output isn't correct |