AtCoder Beginner Contest 085(ABCD)
A - Already 2018
题目链接:https://abc085.contest.atcoder.jp/tasks/abc085_a
Time limit : 2sec / Memory limit : 256MB
Score : 100 points
Problem Statement
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd
format. For example, January 23, 2018 should be written as 2018/01/23
.
After finishing the document, she noticed that she had mistakenly wrote 2017
at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018
and prints it.
Constraints
- S is a string of length 10.
- The first eight characters in S are
2017/01/
. - The last two characters in S are digits and represent an integer between 1 and 31 (inclusive).
Input
Input is given from Standard Input in the following format:
S
Output
Replace the first four characters in S with 2018
and print it.
Sample Input 1
2017/01/07
Sample Output 1
2018/01/07
Sample Input 2
2017/01/31
Sample Output 2
2018/01/31
#include <iostream>
using namespace std;
int main()
{
string s;
while(cin>>s){
int l=s.length();
for(int i=;i<l;i++){
if(i==) cout<<'';
else if(i==) cout<<'';
else if(i==) cout<<'';
else if(i==) cout<<'';
else cout<<s[i];
}
cout<<endl;
}
return ;
}
B - Kagami Mochi
题目链接:https://abc085.contest.atcoder.jp/tasks/abc085_b
Time limit : 2sec / Memory limit : 256MB
Score : 200 points
Problem Statement
An X-layered kagami mochi (X≥1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.
Lunlun the dachshund has N round mochi, and the diameter of the i-th mochi is di centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?
Constraints
- 1≤N≤100
- 1≤di≤100
- All input values are integers.
Input
Input is given from Standard Input in the following format:
N
d1
:
dN
Output
Print the maximum number of layers in a kagami mochi that can be made.
Sample Input 1
4
10
8
8
6
Sample Output 1
3
If we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.
Sample Input 2
3
15
15
15
Sample Output 2
1
When all the mochi have the same diameter, we can only have a 1-layered kagami mochi.
Sample Input 3
7
50
30
50
100
50
80
30
Sample Output 3
4 题解:计算一堆数里最大不重复的个数
#include <iostream>
#include <set>
using namespace std;
int main()
{
int n;
set<int> s;
while(cin>>n){
s.clear();
while(n--){
int x;
cin>>x;
s.insert(x);
}
int sum=s.size();
cout<<sum<<endl;
}
return ;
}
C - Otoshidama
题目链接:https://abc085.contest.atcoder.jp/tasks/abc085_c
Time limit : 2sec / Memory limit : 256MB
Score : 300 points
Problem Statement
The commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word "bill" refers to only these.
According to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.
Constraints
- 1≤N≤2000
- 1000≤Y≤2×107
- N is an integer.
- Y is a multiple of 1000.
Input
Input is given from Standard Input in the following format:
N Y
Output
If the total value of N bills cannot be Y yen, print -1 -1 -1
.
If the total value of N bills can be Y yen, let one such set of bills be "x 10000-yen bills, y 5000-yen bills and z 1000-yen bills", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.
Sample Input 1
9 45000
Sample Output 1
4 0 5
If the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0
is also correct.
Sample Input 2
20 196000
Sample Output 2
-1 -1 -1
When the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.
Sample Input 3
1000 1234000
Sample Output 3
14 27 959
There are also many other possibilities.
Sample Input 4
2000 20000000
Sample Output 4
2000 0 0
题解:与找零钱类似
#include <iostream>
#include <set>
using namespace std;
int main()
{
int n,Y;
while(cin>>n>>Y){
Y/=;
if(n*<Y||n>Y){
cout<<-<<" "<<-<<" "<<-<<endl;
continue;
}
int flag=;
for(int i=n;i>=;i--){
for(int j=n-i;j>=;j--){
for(int l=n-i-j;l>=;l--){
if((i+j+l==n)&&(i*+j*+l==Y)){
cout<<i<<" "<<j<<" "<<l<<endl;
flag=;
break;
}
}
if(flag) break;
}
if(flag) break;
}
if(!flag) cout<<-<<" "<<-<<" "<<-<<endl;
}
return ;
}
D - Katana Thrower
题目链接:https://abc085.contest.atcoder.jp/tasks/abc085_d
Time limit : 2sec / Memory limit : 256MB
Score : 400 points
Problem Statement
You are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:
- Wield one of the katana you have. When you wield Katana i (1≤i≤N), the monster receives ai points of damage. The same katana can be wielded any number of times.
- Throw one of the katana you have. When you throw Katana i (1≤i≤N) at the monster, it receives bi points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.
The monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?
Constraints
- 1≤N≤105
- 1≤H≤109
- 1≤ai≤bi≤109
- All input values are integers.
Input
Input is given from Standard Input in the following format:
N H
a1 b1
:
aN bN
Output
Print the minimum total number of attacks required to vanish the monster.
Sample Input 1
1 10
3 5
Sample Output 1
3
You have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3+3+5=11 points of damage in a total of three attacks, vanishing the monster.
Sample Input 2
2 10
3 5
2 6
Sample Output 2
2
In addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5+6=11 points of damage in two attacks, vanishing the monster.
Sample Input 3
4 1000000000
1 1
1 10000000
1 30000000
1 99999999
Sample Output 3
860000004
Sample Input 4
5 500
35 44
28 83
46 62
31 79
40 43
Sample Output 4
9 题解:找出a中最大的maxn 然后依次扔出b中比a大的 如果还有多 全用a中最大的maxn
#include<bits/stdc++.h>
using namespace std;
long long a[],b[];
bool cmp(int x,int y)
{
return x>y;
}
int main()
{
long long n,h;
while(cin>>n>>h){
for(int i=;i<n;i++){
cin>>a[i]>>b[i];
}
sort(a,a+n,cmp);
long long maxn=a[],s=;
sort(b,b+n,cmp);
for(int i=;i<n;i++){
if(b[i]>=maxn&&h>=maxn){
h-=b[i];
s++;
}
}
if(h>=){
s+=h/maxn;
if(h%maxn!=) s++;
} cout<<s<<endl;
}
return ;
}
AtCoder Beginner Contest 085(ABCD)的更多相关文章
- AtCoder Beginner Contest 086 (ABCD)
A - Product 题目链接:https://abc086.contest.atcoder.jp/tasks/abc086_a Time limit : 2sec / Memory limit : ...
- AtCoder Beginner Contest 254(D-E)
Tasks - AtCoder Beginner Contest 254 D - Together Square 题意: 给定一个N,找出所有不超过N的 ( i , j ),使得( i * j )是一 ...
- AtCoder Beginner Contest 084(AB)
A - New Year 题目链接:https://abc084.contest.atcoder.jp/tasks/abc084_a Time limit : 2sec / Memory limit ...
- AtCoder Beginner Contest 083 (AB)
A - Libra 题目链接:https://abc083.contest.atcoder.jp/tasks/abc083_a Time limit : 2sec / Memory limit : 2 ...
- AtCoder Beginner Contest 264(D-E)
D - "redocta".swap(i,i+1) 题意: 给一个字符串,每次交换相邻两个字符,问最少多少次变成"atcoder" 题解: 从左到右依次模拟 # ...
- Atcoder Beginner Contest 155E(DP)
#definde HAVE_STRUCT_TIMESPEC #include<bits/stdc++.h> using namespace std; ]; int main(){ ios: ...
- Atcoder Beginner Contest 121D(异或公式)
#include<bits/stdc++.h>using namespace std;int main(){ long long a,b; cin>>a>&g ...
- Atcoder Beginner Contest 156E(隔板法,组合数学)
#define HAVE_STRUCT_TIMESPEC #include<bits/stdc++.h> using namespace std; ; ; long long fac[N] ...
- Atcoder Beginner Contest 155D(二分,尺取法,细节模拟)
二分,尺取法,细节模拟,尤其是要注意a[i]被计算到和a[i]成对的a[j]里时 #define HAVE_STRUCT_TIMESPEC #include<bits/stdc++.h> ...
随机推荐
- lsof 命令
[root@localhost ~]# lsof COMMAND PID USER FD TYPE DEVICE SIZE/OFF NODE NAME init root cwd DIR , / in ...
- RN无限轮播以及ScrollView的大小调节问题
如果你的ScrollView的大小是全屏,height不能用,这种情况需要给ScrollView添加一个容器View,然后调节容器View的大小 无限轮播这里我使用的是一个第三方的插件react-na ...
- 006-docker-安装-nginx
1.搜索镜像 docker search nginx 2.拉取合适镜像 docker pull nginx docker images 3.使用镜像 docker run -p 8080:80 --n ...
- 基于nodejs的 本地文件夹http服务器:http-server
请记住,是文件夹服务器 $ npm install http-server -g $ cd /tmp && http-server 或: $ http-server /tmp
- PHP注册器模式
[Register.class.php] <?php /** * 注册器模式 * 全局共享和交换对象 */ class Register { protected static $objects; ...
- docker知识点
1 安装 http://www.runoob.com/docker/centos-docker-install.html 2 dockerhub官网找到 emqttd 执行 docker pull ...
- (转)ThreadLocal-面试必问深度解析
ThreadLocal是什么 ThreadLocal是一个本地线程副本变量工具类.主要用于将私有线程和该线程存放的副本对象做一个映射,各个线程之间的变量互不干扰,在高并发场景下,可以实现无状态的调用, ...
- Python 全栈开发七 面向对象
一.编程范式 编程是程序员用特定的语法+数据结构+算法组成的代码来告诉计算机如何执行任务的过程 , 一个程序是程序员为了得到一个任务结果而编写的一组指令的集合,正所谓条条大路通罗马,实现一个任务的方式 ...
- Python 全栈开发四 python基础 函数
一.函数的基本语法和特性 函数的定义 函数一词来源于数学,但编程中的「函数」概念,与数学中的函数是有很大不同的.函数是指将一组语句的集合通过一个名字(函数名)封装起来,要想执行这个函数,只需调用其函数 ...
- 【UML】-NO.41.EBook.5.UML.1.001-【UML 大战需求分析】- 类图(Class Diagram)
1.0.0 Summary Tittle:[UML]-NO.41.EBook.1.UML.1.001-[UML 大战需求分析]- 类图 Style:DesignPattern Series:Desig ...