点我:传送门 

程序员节快乐~

水水题

A

import java.util.*;
import java.io.*;
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
public Main(){
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
//FastReader in = new FastReader(new BufferedReader(new FileReader("Main.in")));
Scanner input = new Scanner(System.in);
while(input.hasNext()){
int n = input.nextInt();
int k = input.nextInt();
int countHurt = ;
for(int i = ; i < n ; i ++) {
double height = input.nextDouble();
if(height > 1.8) {
double hurt = (height-1.8)*(10.24);
countHurt += (int)hurt;
}
}
if(countHurt >= k) {
System.out.println("YES");
}else {
System.out.println("NO");
}
}
}
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader(BufferedReader in)
{
br = in;
} String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
String line = br.readLine();
if (line == null || line.length() == ) return "";
st = new StringTokenizer(line);
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
} long nextLong()
{
return Long.parseLong(next());
} double nextDouble()
{
return Double.parseDouble(next());
} String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
return str;
}
}
}

B

import java.util.*;
import java.io.*;
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
public Main(){
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
//FastReader in = new FastReader(new BufferedReader(new FileReader("Main.in")));
Scanner input = new Scanner(System.in);
while(input.hasNext()) {
int n = input.nextInt();
String maxPowerMonkey = null;
String minPowerMonkey = null;
int maxPower = -;
int minPower = ;
while(n-->){
String s = input.next();
int power = input.nextInt();
if(power > maxPower) {
maxPower = power;
minPowerMonkey = s;
}
if(power < minPower) {
minPower = power;
maxPowerMonkey= s;
}
}
System.out.println(maxPowerMonkey + " "+ minPowerMonkey);
} }
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader(BufferedReader in)
{
br = in;
} String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
String line = br.readLine();
if (line == null || line.length() == ) return "";
st = new StringTokenizer(line);
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
} long nextLong()
{
return Long.parseLong(next());
} double nextDouble()
{
return Double.parseDouble(next());
} String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
return str;
}
}
}

C

import java.util.*;
import java.io.*;
import java.math.BigDecimal;
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
public Main(){
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
//FastReader in = new FastReader(new BufferedReader(new FileReader("Main.in")));
Scanner input = new Scanner(System.in);
while(input.hasNext()) {
int inputnumber = input.nextInt();
while(inputnumber-- >) {
BigDecimal n = input.nextBigDecimal();
System.out.println(n.multiply(new BigDecimal("")).setScale(,BigDecimal.ROUND_HALF_UP));
}
}
}
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader(BufferedReader in)
{
br = in;
} String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
String line = br.readLine();
if (line == null || line.length() == ) return "";
st = new StringTokenizer(line);
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
} long nextLong()
{
return Long.parseLong(next());
} double nextDouble()
{
return Double.parseDouble(next());
} String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
return str;
}
}
}


思路:连续的0需要翻转2次,如果第1位是0,那么次数减去1。

import java.util.*;
import java.io.*;
import java.math.BigDecimal;
public class Main
{
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
public Main(){
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
//FastReader in = new FastReader(new BufferedReader(new FileReader("Main.in")));
Scanner input = new Scanner(System.in);
while(input.hasNext()) {
int inputnumber = input.nextInt();
while(inputnumber-- >) {
int cnt = ,flag = ,subflag = ;
String s = input.next();
for(int i = ; i < s.length(); i ++) {
if(i == && s.charAt(i) == '') {
subflag = ;
}
if(s.charAt(i)=='' && flag == ) {
flag = ;
cnt ++;
}
if(s.charAt(i) == '' && flag == ) {
flag = ;
}
} System.out.println(cnt * - subflag);
} }
}
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader(BufferedReader in)
{
br = in;
} String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
String line = br.readLine();
if (line == null || line.length() == ) return "";
st = new StringTokenizer(line);
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
} long nextLong()
{
return Long.parseLong(next());
} double nextDouble()
{
return Double.parseDouble(next());
} String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
return str;
}
}
}

E

import java.util.*;
import java.io.*;
import java.math.BigDecimal;
public class Main
{
int [] mapx = new int[];
int [] mapy = new int[];
public static void main (String[] argv)
{
new Main();
}
boolean test = false;
public Main(){
FastReader in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
//FastReader in = new FastReader(new BufferedReader(new FileReader("Main.in")));
int n = in.nextInt();
int m = in.nextInt();
for(int i = ; i <= n ; i ++) {
for(int j = ; j <= m ; j++) {
int number = in.nextInt();
mapx[number] = i;
mapy[number] = j;
}
}
int q = in.nextInt();
while(q-->) {
int queryNumber = in.nextInt();
System.out.println(mapx[queryNumber] + " "+mapy[queryNumber]);
}
}
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader(BufferedReader in)
{
br = in;
} String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
String line = br.readLine();
if (line == null || line.length() == ) return "";
st = new StringTokenizer(line);
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
} long nextLong()
{
return Long.parseLong(next());
} double nextDouble()
{
return Double.parseDouble(next());
} String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
return "";
//e.printStackTrace();
}
return str;
}
}
}

1024程序员节!(JAVA Code)的更多相关文章

  1. 1024程序员节最新福利之2018最全H5前端资料集

    前言 有好久没有写博客了,主要这段时间都沉迷学习无法自拔了,哈哈.自吹一波. 前两天不是1024节吗,所以就有很多福利出现了,当然每个人能都获得的信息都有所不同,这就是所谓的信息差.秉着好东西需要分享 ...

  2. Java语言编码规范(Java Code Conventions)

    Java语言编码规范(Java Code Conventions) 名称 Java语言编码规范(Java Code Conventions) 译者 晨光(Morning) 简介 本文档讲述了Java语 ...

  3. java code to byte code--partone--reference

    Understanding how Java code is compiled into byte code and executed on a Java Virtual Machine (JVM) ...

  4. [转]Java Code Examples for android.util.JsonReader

    [转]Java Code Examples for android.util.JsonReader The following are top voted examples for showing h ...

  5. SQL to Java code for Elasticsearch

    Elasticsearch虽然定位为Search Engine,但是因其可以持久化数据,很多时候,我们把Elasticsearch当成Database用,但是Elasticsearch不支持SQL,就 ...

  6. JUnit单元测试教程(翻译自Java Code Geeks)

    JUnit单元测试教程--终极指南 JUnit单元测试教程终极指南 说明 单元测试简介 1 什么是单元测试 2 测试覆盖 3 Java中的单元测试 JUnit简介 1 使用Eclipse实现简单JUn ...

  7. Java Code Style

    近期困惑于团队成员代码风格迥异,代码质量不可控,作为一名老司机,忧患于后期服务的可维护性,多次一对一的代码Review,耗时耗力不说,效果也不明显.痛定思痛,多次反思之后得出结论:无规矩不成方圆,可靠 ...

  8. 玩转Eclipse — 自动代码生成的Java Code Template

    文章转载地址:点击打开链接 当代码写到一定程度之后,就会发现很多代码都被重复地敲了N多遍,甚至毫不夸张地说:闭着眼睛都能敲出来.大量地敲这些重复地代码,除了锻炼敲键盘的速度,基本上没有其他益处,但是长 ...

  9. Use formatter to format your JAVA code

    In order to make the codes looks unified and make it easy to understand, it's better to use the same ...

  10. 【Android XML】Android XML 转 Java Code 系列之 介绍(1)

    最近在公司做一个项目,需要把Android界面打包进jar包给客户使用.对绝大部分开发者来说,Android界面的布局以XML文件为主,并辅以少量Java代码进行动态调整.而打包进jar包的代码,意味 ...

随机推荐

  1. Introduction to 3D Game Programming with DirectX 12 学习笔记之 --- 全书总结

    原文:Introduction to 3D Game Programming with DirectX 12 学习笔记之 --- 全书总结 本系列文章中可能有很多翻译有问题或者错误的地方:并且有些章节 ...

  2. shell脚本批量杀死进程

    使用Ubuntu系统时常会遇到机器卡死的情况(人生最大的痛苦),所有的键都没有用,只好强制关机,我似乎对此已经'乐此不疲了'. 看到又神牛说: 可以在tty里面把相关的进程杀死,之后就正常.(到目前我 ...

  3. 两种获取python版本的方法

    方法1:查看python版本 import sys print("当前python版本",sys.version) 方法2:cmd框中查看的两种方式

  4. 洛谷4178 BZOJ1468 Tree题解点分治

    点分治的入门练习. 题目链接 BZOJ的链接(权限题) 关于点分治的思想我就不再重复了,这里重点说一下如何判重. 我们来看上图,假设我们去除了1节点,求出d[2]=1,d[3]=d[4]=2 假设k为 ...

  5. BZOJ 1008 越狱题解

    其实这题很水,显然n个房间有m种宗教,总共有n^m种情况, 我们再考虑不合法的情况,显然第一个房间有m种情况,而后一种只有m-1种情况(因为不能相同) 所以不合法的情况有(m-1)^(n-1)*m种情 ...

  6. spring data jpa 原生sql 别名字段无法注入

    开发四年只会写业务代码,分布式高并发都不会还做程序员?->>>    在使用entityManager.createNativeQuery(sql,User.class)这个方法时, ...

  7. Java练习 SDUT-1689_斐波那契?

    斐波那契? Time Limit: 1000 ms Memory Limit: 32768 KiB Problem Description 给出一个数列的递推公式,希望你能计算出该数列的第N个数.递推 ...

  8. 蓝牙(3)蓝牙UUID与SDP

    1.服务发现协议 (SDP) SDP = Service Discovery Protocol  主要用来根据已分配编号(UUID)搜索服务.浏览群组列表.文档 URL 和图标 URL等. 详细见: ...

  9. laravel 随笔

    laravel5.5 1.laravel 查询数据库默认返回对象,如何改成 返回值为数组 答:在  App\Providers\EventServiceProvider 文件中 第一步: use Il ...

  10. Round #590 (Div. 3)

    拿DIV找快乐... 当场过了A-B1-B2-C 写D差5分钟写的是正解...留坑补FG A. Equalize Prices Again 直接判断sum%n==0?sum/n:sum/n+1 B1, ...