CF411div2C.Find Amir
来源:互联网 发布:ppt制作视频软件 编辑:程序博客网 时间:2024/05/29 19:03
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.
The first line contains a single integer n (1 ≤ n ≤ 105) — the number of schools.
Print single integer: the minimum cost of tickets needed to visit all schools.
题目大意: 1-n个城市 每个城市走一边 找出一条路线 使得路线 之和最小
方案 从1走到n n走到2 2走到n-1 n-1走到3 3走到n-2 依次这样走 没走两步结果加一
#include<iostream>using namespace std;int n;int main(){ cin>>n; cout<<(n+1)/2-1; return 0; }
- CF411div2C.Find Amir
- Find Amir
- Codeforces805 C. Find Amir
- C. Find Amir
- [Codeforces805] C. Find Amir
- A. Find Amir
- CodeForces 805C Find Amir
- CodeFroces 804A Find Amir
- Codeforces 805C Find Amir
- codeforces 804A Find Amir
- codeforces 411 div2-find amir
- Codeforces Round #411 C. Find Amir
- CF#804 A. Find Amir(贪心)
- codeforces 804A——Find Amir
- 【Codeforces Round #411 (Div. 1)】Codeforces 804A Find Amir
- Codeforces Round #411 (Div. 2) C. Find Amir
- Codeforces Round #411(Div. 2)C. Find Amir【思维】
- Codeforces Round #411 C.Find Amir (思维题)
- 5分钟带你搞定开机引导界面
- Rectangle
- SpringMVC运行原理
- 【Codeforces Round #411 (Div. 1)】Codeforces 804B Minimum number of steps
- [杂题 神证明] BZOJ 4893 项链分赃
- CF411div2C.Find Amir
- ServiceLoader内部实现分析
- 《深入理解JAVA虚拟机》学习笔记(八)JAVA内存模型与线程
- java格式化时间使用的模式字母大全
- Hadoop(一)概况
- webgl笔记-1.模型视图矩阵和投影矩阵
- eclipse选择发布的路径
- uoj191 Unknown
- [Leetcode] 136. Single Number 解题报告