Submission #3322684


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int n,f[102];
char a[102];
int main()
{
	scanf("%d",&n);
	scanf("%s",a+1);
	a[1]=='X'?f[1]=1:f[1]=0;
	a[2]=='X'?f[2]=1:f[2]=0;
	a[3]=='X'?f[3]=1:f[3]=0;
	for(int i=4;i<=n;i++)
	{
		a[i]=='X'?f[i]=1:f[i]=0;
		f[i]+=min(f[i-1],min(f[i-2],f[i-3]));
	}
	printf("%d",f[n]);
	return 0;
}

Submission Info

Submission Time
Task B - 雨上がり
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 0
Code Size 326 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:8:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",a+1);
                 ^

Judge Result

Set Name All
Score / Max Score 0 / 50
Status
WA × 43
Set Name Test Cases
All case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt
Case Name Status Exec Time Memory
case_000.txt WA 1 ms 256 KB
case_001.txt WA 1 ms 256 KB
case_002.txt WA 1 ms 256 KB
case_003.txt WA 1 ms 256 KB
case_004.txt WA 1 ms 256 KB
case_005.txt WA 1 ms 256 KB
case_006.txt WA 1 ms 256 KB
case_007.txt WA 1 ms 256 KB
case_008.txt WA 1 ms 256 KB
case_009.txt WA 1 ms 256 KB
case_010.txt WA 1 ms 256 KB
case_011.txt WA 1 ms 256 KB
case_012.txt WA 1 ms 256 KB
case_013.txt WA 1 ms 256 KB
case_014.txt WA 1 ms 256 KB
case_015.txt WA 1 ms 256 KB
case_016.txt WA 1 ms 256 KB
case_017.txt WA 1 ms 256 KB
case_018.txt WA 1 ms 256 KB
case_019.txt WA 1 ms 256 KB
case_020.txt WA 1 ms 256 KB
case_021.txt WA 1 ms 256 KB
case_022.txt WA 1 ms 256 KB
case_023.txt WA 1 ms 256 KB
case_024.txt WA 1 ms 256 KB
case_025.txt WA 1 ms 256 KB
case_026.txt WA 1 ms 256 KB
case_027.txt WA 1 ms 256 KB
case_028.txt WA 1 ms 256 KB
case_029.txt WA 1 ms 256 KB
case_030.txt WA 1 ms 256 KB
case_031.txt WA 1 ms 256 KB
case_032.txt WA 1 ms 256 KB
case_033.txt WA 1 ms 256 KB
case_034.txt WA 1 ms 256 KB
case_035.txt WA 1 ms 256 KB
case_036.txt WA 1 ms 256 KB
case_037.txt WA 1 ms 256 KB
case_038.txt WA 1 ms 256 KB
case_039.txt WA 1 ms 256 KB
case_040.txt WA 1 ms 256 KB
case_041.txt WA 1 ms 256 KB
case_042.txt WA 1 ms 256 KB