Submission #2519688


Source Code Expand

 var
  s:string;
  i,l,sc,sf:longint; 
   //l表示字符串长度; sc,sf分别表示第一个C的坐标和最后一个F的坐标.
 begin
  read(s);
  l:=length(s);sc:=maxlongint; //sc一定要赋值为maxlongint!
  for i:=1 to l do if s[i]='F'then sf:=i; //寻找最后一个F
  for i:=l downto 1 do if s[i]='C'then sc:=i;//寻找第一个C
  if sc<sf then writeln('Yes')
           else writeln('No');  //注意输出格式
 end.

Submission Info

Submission Time
Task A - CF
User luogu_bot1
Language Pascal (FPC 2.6.2)
Score 100
Code Size 444 Byte
Status AC
Exec Time 0 ms
Memory 128 KB

Compile Error

/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 12
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt
Case Name Status Exec Time Memory
0_000.txt AC 0 ms 128 KB
0_001.txt AC 0 ms 128 KB
0_002.txt AC 0 ms 128 KB
0_003.txt AC 0 ms 128 KB
1_004.txt AC 0 ms 128 KB
1_005.txt AC 0 ms 128 KB
1_006.txt AC 0 ms 128 KB
1_007.txt AC 0 ms 128 KB
1_008.txt AC 0 ms 128 KB
1_009.txt AC 0 ms 128 KB
1_010.txt AC 0 ms 128 KB
1_011.txt AC 0 ms 128 KB