import java.util.Arrays;
import java.util.Scanner;public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);while(sc.hasNext()) {
long n = sc.nextInt();long price = n * 800 - (n / 15)*200;System.out.println(price);}}
}
详细解决方案
Snuke has a favorite restaurant
热度:53 发布时间:2023-11-27 04:03:17.0
相关解决方案
- (50)My favorite pick,该怎么解决
- (50)My favorite pick,该如何处理
- (50)My favorite pick解决思路
- 优秀安卓开发周报推荐——My favorite
- LA 4851 Restaurant 找规律 -
- PAT甲级-1045 Favorite Color Stripe (30分)
- CodeForces E. XOR and Favorite Number(Div.2)
- PTA1045 Favorite Color Stripe(最长不降子序列,dp)
- Snuke Line[ARC068C][分块][主席树][BIT]
- (AtCoder - 2069)すぬけ君の地下鉄旅行 / Snuke's Subway Trip(最短路拆点建图思路'剖解'分析+想象法~)
- 【AtCoder】【图论】ARC061Eすぬけ君の地下鉄旅行 / Snuke's Subway Trip
- Leetcode 1452. People Whose List of Favorite Companies Is Not a Subset of Another List (python)
- Restaurant (背包问题)
- Snuke has a favorite restaurant
- unable_submit_dfs_H: Fennec VS. Snuke
- Contest3186 - 2021级新生个人训练赛第41场_G: Cat Snuke and a Voyage
- HDU4886 TIANKENG’s restaurant(Ⅱ)(哈希)
- PAT甲级练习1045 Favorite Color Stripe (30 point(s)) dp解LIS
- PAT Advanced 1045 Favorite Color Stripe(DP,LIS,LCS)
- Codeforces Round #340 (Div. 2) E - XOR and Favorite Number (莫队算法)
- 『分块·莫队基础』[codeforces 617E]XOR and Favorite Number
- 我的收藏http://my.csdn.net/my/favorite
- I - Restaurant 【简单贪心】
- 个人练习-PAT甲级-1045 Favorite Color Stripe
- 【PAT】A1045 Favorite Color Stripe (30分)(动态规划初级--两种方法LIS和LCS做)
- 【Codeforces Round #340 (Div. 2), problem: (E) XOR and Favorite Number】 莫队算法
- 【codeforces 617E XOR and Favorite Number】【莫队分块】【多次查询求区间[l,r]中区间异或等于k的子区间个数】
- 1045. Favorite Color Stripe (30) LIS
- CodeFroce Round 340 div2 E XOR and Favorite Number【莫队算法】
- 【CodeForces617E】XOR and Favorite Number