P3741 honoka Keyboard for

Background

honoka There is a keyboard with only two keys .

Title Description

One day , She typed a string with only these two characters . When this string contains  VK  When this string ,honoka I especially like this string . therefore , She wants to change at most one character （ Or don't make any changes ） To maximize the number of characters in this string  VK  Number of occurrences . Give the original string , Please calculate the maximum number of times she can make this string appear  VK（ Only when  V  and  K  Just adjacent , We think there is  VK.）

Input format

The first line gives a number  nn, Represents the length of the string .

The second line gives a string  ss.

Output format

The first line outputs an integer representing the answer .

I/o sample

Input #1 Copy

2
VK

Output #1 Copy

1

Input #2 Copy

2
VV

Output #2 Copy

1

Input #3 Copy

1
V

Output #3 Copy

0

Input #4 Copy

20
VKKKKKKKKKVVVVVVVVVK

Output #4 Copy

3

Input #5 Copy

4
KVKV

Output #5 Copy

1

explain / Tips

about  100\%100%  The data of ,1\le n\le 1001≤n≤100.

# include <cstring>
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
	int n;
cin>>n;
	string s;
	cin>>s;
	int count=0;
	int l=s.length();
	int blp=-1;
		//s[blp]='x';
		//s[blp+1]='x';
	while(s.find("VK",blp+1)!=-1)
	{
		count++;
		blp=s.find("VK",blp+1);
		s[blp]='T';
		s[blp+1]='T';
		
	}
//	cout<<count<<endl;
//	cout<<s;
for(int i=0;i<l-1;i++)
{
	string w="KK";
	string e="VV";
	if(s.find(w)!=-1)
	{
		count++;
		break;
	}
	if(s.find(e)!=-1)
	{
		count++;
		break;
	}
//	if((s[i-1]=='V'&&s[i]=='V')||(s[i+1]=='K'&&s[i]=='K'))
//	{
//		count++;
//		break;
//	}
}
	 
	
cout<<count;
	
}

P1000 Super Mary game  

This question is to make up the number （ Time reason ）

Background

This is the test question of Luogu , It can help understand the use of Luogu .

It is suggested to continue to try after completing this topic  P1001、P1008.

Also highly recommended New user must read post

Title Description

Super Mary is a very classic game . Please output a scene in super Mary in the form of character drawing .

                ********
               ************
               ####....#.
             #..###.....##....
             ###.......######              ###            ###
                ...........               #...#          #...#
               ##*#######                 #.#.#          #.#.#
            ####*******######             #.#.#          #.#.#
           ...#***.****.*###....          #...#          #...#
           ....**********##.....           ###            ###
           ....****    *****....
             ####        ####
           ######        ######
##############################################################
#...#......#.##...#......#.##...#......#.##------------------#
###########################################------------------#
#..#....#....##..#....#....##..#....#....#####################
##########################################    #----------#
#.....#......##.....#......##.....#......#    #----------#
##########################################    #----------#
#.#..#....#..##.#..#....#..##.#..#....#..#    #----------#
##########################################    ############

Input format

nothing

Output format

As described

I/o sample

nothing

# include <stdio.h>
int main()
{
 printf(
    "                ********\n"
    "               ************\n"
    "               ####....#.\n"
    "             #..###.....##....\n"
    "             ###.......######              ###            ###\n"
    "                ...........               #...#          #...#\n"
    "               ##*#######                 #.#.#          #.#.#\n"
    "            ####*******######             #.#.#          #.#.#\n"
    "           ...#***.****.*###....          #...#          #...#\n"
    "           ....**********##.....           ###            ###\n"
    "           ....****    *****....\n"
    "             ####        ####\n"
    "           ######        ######\n"
    "##############################################################\n"
    "#...#......#.##...#......#.##...#......#.##------------------#\n"
    "###########################################------------------#\n"
    "#..#....#....##..#....#....##..#....#....#####################\n"
    "##########################################    #----------#\n"
    "#.....#......##.....#......##.....#......#    #----------#\n"
    "##########################################    #----------#\n"
    "#.#..#....#..##.#..#....#..##.#..#....#..#    #----------#\n"
    "##########################################    ############\n"
    );
return 0;}

P1001 A+B Problem

This problem was also written a long time ago

Background

Strongly recommend New users must read the post .

For those who are not familiar with algorithm competition, please see here ：

The output format required in the algorithm competition , There should be no superfluous content , It also includes “ please enter an integer  \bm aa  and  \bm bb” This kind of prompt users to enter information . If these contents are included , Will be regarded as  Wrong Answer, That is, on the valley of Los Angeles  WA. When comparing code output with standard output , The system will ignore the spaces at the end of each line , And extra line breaks after the last line .

If this machine appears due to such problems （ look ）AC, Submit  WA  The phenomenon of , Don't think that there is something wrong with the Luogu evaluation machine , Instead, there may be redundant output information in your code . Users can refer to the code provided at the end of the title .

in addition Please make good use of the online application IDE function , To avoid some problems arising from the evaluation of different platforms .

It's also important , Please do not post your own solutions in the corresponding topic discussion area , Please post to the problem solving area , Otherwise, it will be punished by deletion or prohibition . If it is found that the solutions cannot be submitted, it indicates that there are too many solutions to this problem , Discussions should still not be posted .

Title Description

Enter two integers  a, ba,b, Output their sum （|a|,|b| \le {10}^9∣a∣,∣b∣≤109）.

Be careful

1. Pascal Use  integer  It will explode ！
2. There are negative numbers ！
3. C/C++ Of main The function must be  int  type , and C Finally  return 0. This is not only valid for other topics in Los Angeles , And it's also NOIP/CSP/NOI The requirements of the game ！

ok , Comrades , Let's start with this question , Heading for Daniel's road .

Any great idea , There's a tiny beginning .

Input format

Two integers separated by spaces .

Output format

An integer .

I/o sample

Input #1 Copy

20 30

Output #1 Copy

50

# include <stdio.h>
int main()
{
    long long a,b;
    scanf("%lld",&a);
    scanf("%lld",&b);
    printf("%lld",a+b);
    return 0;
}