| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1289555 | azradudukalay | Dango Maker (JOI18_dango_maker) | C++20 | 1 ms | 572 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,sayac=0;
cin>>n>>m;
char renkler[m][n];
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
cin>>renkler[i][j];
}
}
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
if(renkler[i][j]=='R' && renkler[i+1][j]=='G' && renkler[i+2][j]=='W'){
sayac+=1;
}
else if(renkler[i][j]=='R' && renkler[i][j+1]=='G' && renkler[i][j+2]=='W'){
sayac+=1;
}
}
}
cout<<sayac;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
