codeforces 804A Find Amir
2017-05-06 23:46
1411 查看
A few years ago Sajjad left his school and register to another one due to security reasons. Now he wishes to find Amir, one of his schoolmates and good friends.
There are n schools numerated from 1 to n.
One can travel between each pair of them, to do so, he needs to buy a ticket. The ticker between schools i and j costs
and
can be used multiple times. Help Sajjad to find the minimum cost he needs to pay for tickets to visit all schools. He can start and finish in any school.
Input
The first line contains a single integer n (1 ≤ n ≤ 105) —
the number of schools.
Output
Print single integer: the minimum cost of tickets needed to visit all schools.
Examples
input
output
input
output
Note
In the first example we can buy a ticket between the schools that costs
.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
贪心+思路~
可以发现和为modd时花费为0,所以我们尽可能的利用这一点。遵循1->n->n-1->2->……即可。
#include<cstdio>
#include<iostream>
using namespace std;
int n,ans;
int main()
{
scanf("%d",&n);
ans=n%2 ? n/2:n/2-1;
printf("%d\n",ans);
return 0;
}
There are n schools numerated from 1 to n.
One can travel between each pair of them, to do so, he needs to buy a ticket. The ticker between schools i and j costs
and
can be used multiple times. Help Sajjad to find the minimum cost he needs to pay for tickets to visit all schools. He can start and finish in any school.
Input
The first line contains a single integer n (1 ≤ n ≤ 105) —
the number of schools.
Output
Print single integer: the minimum cost of tickets needed to visit all schools.
Examples
input
2
output
0
input
10
output
4
Note
In the first example we can buy a ticket between the schools that costs
.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
贪心+思路~
可以发现和为modd时花费为0,所以我们尽可能的利用这一点。遵循1->n->n-1->2->……即可。
#include<cstdio>
#include<iostream>
using namespace std;
int n,ans;
int main()
{
scanf("%d",&n);
ans=n%2 ? n/2:n/2-1;
printf("%d\n",ans);
return 0;
}
相关文章推荐
- codeforces 804A Find Amir 思维/水题
- 小白题解 Codeforces 804A Find Amir
- 【Codeforces Round #411 (Div. 1)】Codeforces 804A Find Amir
- codeforces 489D Unbearable Controversy of Being (暴力乱搞)
- Codeforces 475D CGCDSSQ 求序列中连续数字的GCD=K的对数
- N - Mafia Codeforces 348A
- Codeforces Mahmoud and a Triangle (水
- CodeForces - 686C Robbers' watch
- 【CodeForces】913 C. Party Lemonade
- codeforces 476c Dreamoon and Sums
- CodeForces 618 D Hamiltonian Spanning Tree(树形DP)
- CodeForces 690C2 Brain Network (树上最大距离)
- Codeforces Round #301 (Div. 2)B. School Marks//CodeForces - 540B 贪心
- CodeForces - 723D Lakes in Berland dfs
- CodeForces 501 E.Misha and Palindrome Degree(组合数学)
- Codeforces 488 B. Candy Boxes && Codeforces Round #278
- Codeforces 264B Good Sequences (dp)
- 2016 Personal Training #7 Div.2 CodeForces 589A Email Aliases
- CodeForces - 744A Hongcow Builds A Nation
- codeforces 438D The Child and Sequence