Codeforces Round #280 (Div. 2) A,B,C,D

最新推荐文章于 2022-11-26 17:12:26 发布
最新推荐文章于 2022-11-26 17:12:26 发布
阅读量455 收藏
点赞数
分类专栏： codeforces 文章标签： Codeforces Round #280 Div. 2
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/mystery_guest/article/details/52386930
版权
A. Vanya and Cubes
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vanya got n cubes. He decided to build a pyramid from them. Vanya wants to build the pyramid as follows: the top level of the pyramid must consist of 1 cube, the second level must consist of 1 + 2 = 3 cubes, the third level must have 1 + 2 + 3 = 6 cubes, and so on. Thus, the i-th level of the pyramid must have 1 + 2 + ... + (i - 1) + i cubes.

Vanya wants to know what is the maximum height of the pyramid that he can make using the given cubes.

Input

The first line contains integer n (1 ≤ n ≤ 104) — the number of cubes given to Vanya.

Output

Print the maximum possible height of the pyramid in the single line.

Examples
Input 
1
Output 
1
Input 
25
Output 
4
题意：用cubes建金字塔，第一层需要1个cubes第二层需要(1+2)cubes,第三层需要(1+2+3)cubes....给你cubes数，求最多能建多少层
水题，只要找到规律n*(n+1)*(n+2)/6即可。 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<stack>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#define mem(a,b) memset(a,b,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a))
#define pfn printf("\n")
#define ll __int64
#define mod 1000000007
#define sf(a) scanf("%d",&a)
#define sf64(a) scanf("%I64d",&a)
#define sf2(a,b) scanf("%d%d",&a,&b)
#define sf3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sf4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define sff(a) scanf("%f",&a)
#define sfs(a) scanf("%s",a)
#define sfs2(a,b) scanf("%s%s",a,b)
#define sfs3(a,b,c) scanf("%s%s%s",a,b,c)
#define sfc(a) scanf("%c",&a)
#define str(a) strlen(a)
#define debug printf("***\n")
const double PI = acos(-1.0);
const double e = exp(1.0);
const int INF = 0x7fffffff;;
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
bool cmpbig(int a, int b){ return a>b; }
bool cmpsmall(int a, int b){ return a<b; }
using namespace std;
int main()
{
	//freopen("data.in", "r", stdin);
	int n,i;
	sf(n);
	int hegiht,ans=0;
	for (i = 1;; i++)
	{
		ans = i*(i + 1)*(i + 2) / 6;
		if (ans > n)
			break;
	}
	printf("%d\n",i-1);
	return 0;
}

B. Vanya and Lanterns
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern is at the point ai. The lantern lights all points of the street that are at the distance of at most d from it, where d is some positive number, common for all lanterns.

Vanya wonders: what is the minimum light radius d should the lanterns have to light the whole street?

Input

The first line contains two integers n, l (1 ≤ n ≤ 1000, 1 ≤ l ≤ 109) — the number of lanterns and the length of the street respectively.

The next line contains n integers ai (0 ≤ ai ≤ l). Multiple lanterns can be located at the same point. The lanterns may be located at the ends of the street.

Output

Print the minimum light radius d, needed to light the whole street. The answer will be considered correct if its absolute or relative error doesn't exceed 10 - 9.

Examples
Input 
7 15
15 5 3 7 9 14 0
Output 
2.5000000000
Input 
2 5
2 5
Output 
2.0000000000
Note

Consider the second sample. At d = 2 the first lantern will light the segment [0, 4] of the street, and the second lantern will light segment [3, 5]. Thus, the whole street will be lit.

题意：有n个路灯和l长的路，需要路灯将路全照到，要求出最小的灯所照的半径（如路灯坐标为x，半径为d，则能照到范围(x-d,x+d)）
思路：从左至右贪心一下即可。 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<stack>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#define mem(a,b) memset(a,b,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a))
#define pfn printf("\n")
#define ll __int64
#define mod 1000000007
#define sf(a) scanf("%d",&a)
#define sf64(a) scanf("%I64d",&a)
#define sf2(a,b) scanf("%d%d",&a,&b)
#define sf3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sf4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define sff(a) scanf("%f",&a)
#define sfs(a) scanf("%s",a)
#define sfs2(a,b) scanf("%s%s",a,b)
#define sfs3(a,b,c) scanf("%s%s%s",a,b,c)
#define sfc(a) scanf("%c",&a)
#define str(a) strlen(a)
#define debug printf("***\n")
const double PI = acos(-1.0);
const double e = exp(1.0);
const int INF = 0x7fffffff;;
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
bool cmpbig(int a, int b){ return a>b; }
bool cmpsmall(int a, int b){ return a<b; }
using namespace std;
#define MAX 1000010
int a[MAX];
int main()
{
//	freopen("data.in", "r", stdin);
	int n, l;
	while (~sf2(n, l))
	{
		int i;
		for (i = 0; i < n; i++)
			sf(a[i]);
		sort(a, a + n);
		double min_num = max(a[0]-0,l-a[n-1]);
		for (i = 1; i < n; i++)
			min_num = max(min_num, (a[i] - a[i - 1])*1.0/2);
		printf("%lf\n", min_num);
	}
	return 0;
}
C. Vanya and Exams
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vanya wants to pass n exams and get the academic scholarship. He will get the scholarship if the average grade mark for all the exams is at least avg. The exam grade cannot exceed r. Vanya has passed the exams and got grade ai for the i-th exam. To increase the grade for the i-th exam by 1 point, Vanya must write bi essays. He can raise the exam grade multiple times.

What is the minimum number of essays that Vanya needs to write to get scholarship?

Input

The first line contains three integers n, r, avg (1 ≤ n ≤ 105, 1 ≤ r ≤ 109, 1 ≤ avg ≤ min(r, 106)) — the number of exams, the maximum grade and the required grade point average, respectively.

Each of the following n lines contains space-separated integers ai and bi (1 ≤ ai ≤ r, 1 ≤ bi ≤ 106).

Output

In the first line print the minimum number of essays.

Examples
Input 
5 5 4
5 2
4 7
3 1
3 2
2 5
Output 
4
Input 
2 5 4
5 2
5 2
Output 
0
Note

In the first sample Vanya can write 2 essays for the 3rd exam to raise his grade by 2 points and 2 essays for the 4th exam to raise his grade by 1 point.

In the second sample, Vanya doesn't need to write any essays as his general point average already is above average.

题意：有n门考试，最高得分r分，需要平均分avg，告诉你已经考过了n门考试，但是你平均分不够，可以通过写多篇文章提高该门考试分数，写一次得1分，可以写多次，求最少写文章篇数。

思路：排序一下所需写的文章篇数，然后贪心一下，就行了。

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<stack>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#define mem(a,b) memset(a,b,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a))
#define pfn printf("\n")
#define ll __int64
#define mod 1000000007
#define sf(a) scanf("%d",&a)
#define sf64(a) scanf("%I64d",&a)
#define sf264(a,b) scanf("%I64d%I64d",&a,&b)
#define sf364(a,b,c) scanf("%I64d%I64d%I64d",&a,&b,&c)
#define sf2(a,b) scanf("%d%d",&a,&b)
#define sf3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sf4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define sff(a) scanf("%f",&a)
#define sfs(a) scanf("%s",a)
#define sfs2(a,b) scanf("%s%s",a,b)
#define sfs3(a,b,c) scanf("%s%s%s",a,b,c)
#define sfc(a) scanf("%c",&a)
#define debug printf("***\n")
const double PI = acos(-1.0);
const double e = exp(1.0);
const int INF = 0x7fffffff;;
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
bool cmpbig(int a, int b){ return a>b; }
bool cmpsmall(int a, int b){ return a<b; }
using namespace std;
#define MAX 100010
pair<ll, ll>a[MAX];
typedef pair<ll, ll> P;
bool cmp(P a, P b)
{
	if (a.second < b.second) return true;
	return false;
}
int main()
{
//	freopen("data.in", "r", stdin);
	ll n, r, avg;
	while (~sf364(n, r, avg))
	{
		ll i,cnt=0,num=0;
		for (i = 0; i < n; i++)
		{
			sf264(a[i].first, a[i].second);
			cnt += a[i].first;
		}
		i = 0;
		sort(a, a + n, cmp);
		while (n*avg > cnt)
		{
			if (n*avg - cnt > r-a[i].first)
			{
				num += (r - a[i].first)*a[i].second;
				cnt += (r - a[i].first);
			}
			else
			{
				//printf("%d\n", a[i].second);
				num += (n*avg - cnt)*a[i].second;
				break;
			}
			i++;
		}
		printf("%I64d\n", num);
	}
	return 0;
}

D. Vanya and Computer Game
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Vanya and his friend Vova play a computer game where they need to destroy n monsters to pass a level. Vanya's character performs attack with frequency x hits per second and Vova's character performs attack with frequency y hits per second. Each character spends fixed time to raise a weapon and then he hits (the time to raise the weapon is 1 / x seconds for the first character and 1 / y seconds for the second one). The i-th monster dies after he receives ai hits.

Vanya and Vova wonder who makes the last hit on each monster. If Vanya and Vova make the last hit at the same time, we assume that both of them have made the last hit.

Input

The first line contains three integers n,x,y (1 ≤ n ≤ 105, 1 ≤ x, y ≤ 106) — the number of monsters, the frequency of Vanya's and Vova's attack, correspondingly.

Next n lines contain integers ai (1 ≤ ai ≤ 109) — the number of hits needed do destroy the i-th monster.

Output

Print n lines. In the i-th line print word "Vanya", if the last hit on the i-th monster was performed by Vanya, "Vova", if Vova performed the last hit, or "Both", if both boys performed it at the same time.

Examples
Input 
4 3 2
1
2
3
4
Output 
Vanya
Vova
Vanya
Both
Input 
2 1 1
1
2
Output 
Both
Both
Note

In the first sample Vanya makes the first hit at time 1 / 3, Vova makes the second hit at time 1 / 2, Vanya makes the third hit at time 2 / 3, and both boys make the fourth and fifth hit simultaneously at the time 1.

In the second sample Vanya and Vova make the first and second hit simultaneously at time 1.

题意：有n个怪物，vanya每秒打怪x下，vova每秒y下，间隔1/x和1/y，求最后一下是谁打的。

思路：求出一秒能打怪顺序，然后直接取模，就能A掉。

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<stack>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#define mem(a,b) memset(a,b,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a))
#define pfn printf("\n")
#define ll __int64
#define mod 1000000007
#define sf(a) scanf("%d",&a)
#define sf64(a) scanf("%I64d",&a)
#define sf264(a,b) scanf("%I64d%I64d",&a,&b)
#define sf364(a,b,c) scanf("%I64d%I64d%I64d",&a,&b,&c)
#define sf2(a,b) scanf("%d%d",&a,&b)
#define sf3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sf4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define sff(a) scanf("%f",&a)
#define sfs(a) scanf("%s",a)
#define sfs2(a,b) scanf("%s%s",a,b)
#define sfs3(a,b,c) scanf("%s%s%s",a,b,c)
#define sfc(a) scanf("%c",&a)
#define debug printf("***\n")
const double PI = acos(-1.0);
const double e = exp(1.0);
const int INF = 0x7fffffff;;
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
bool cmpbig(int a, int b){ return a>b; }
bool cmpsmall(int a, int b){ return a<b; }
using namespace std;
#define MAX 200010
//pair<int, int>a[MAX];
//typedef pair<int, int>P;
//int gcd(int a, int b)
//{
//	return b ? gcd(b, a%b) : a;
//}
//bool cmp(P a, P b)
//{
//	return a.first < b.first;
//}
int gcd(int a, int b)
{
	return b ? gcd(b, a%b) : a;
}
map<ll, int>vis;
int main()
{
//	freopen("data.in", "r", stdin);
	int n, x, y;
	while (~sf3(n, x, y))
	{
		ll lcm1 = y / gcd(max(x, y), min(x, y)), lcm2 = x / gcd(max(x, y), min(x, y));
		ll pos1 = lcm1, pos2 = lcm2;
		int i;
		vis.clear();
		vis[0] = 3;
		for (i = 1;i<=x+y-1; i++)
		{
			if (lcm1 < lcm2)
			{
				vis[i] = 1;
				lcm1 += pos1;
			}
			else if (lcm1>lcm2)
			{
				vis[i] = 2;
				lcm2 += pos2;
			}
			else if (lcm1==lcm2)
			{
				vis[i] = 3;
				vis[i+1] = 3;
				lcm1 += pos1;
				lcm2 += pos2;
				i++;
			}
		}
		for (i = 0; i < n; i++)
		{
			int num;
			sf(num);
			if (vis[num % (x + y)] == 0 || vis[num % (x + y)] == 3)
				printf("Both\n");
			else if (vis[num % (x + y)] == 1)
				printf("Vanya\n");
			else
				printf("Vova\n");
		}
	}
	return 0;
}

这场题目比较水，其实感觉E题也可以做的，但exgcd没思路就GG了。







forwiat
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Codeforces Round #723 (Div. 2).md
10-13
Codeforces Round #723 (Div. 2).md
Codeforces Round #627 (Div. 3) B. Yet Another Palindrome Problem
01-03
就是把所有相等的数放到一个vector里，如果他出现大于2次，看最远的间距是否大于2即可，找到一个就可以 代码： #include #include #include #include #include #include #include #include #include #include #...
Codeforces Round #829 (Div. 2)A.B.C1.D
m0_55682843的博客
10-30 366
Codeforces Round #829 (Div. 2)A.B.C1.D
Codeforces Round #818 (Div. 2) A - D题解
JC_Charlie的博客
09-04 385
Codeforces Round #818 (Div. 2) A - D题解
Codeforces Round #836 (Div. 2) A~D 题解
keguaiguai的博客
11-26 713
Codeforces Round #836 (Div. 2)A~D个人题解
Codeforces Round #469 div.2 A-D 思路及题解
热门推荐
Fuko_Ibuki的博客
03-09 1万+
其实这场我差点就掉分了 A B C D 其实这场我差点就掉分了 简直了.一上来A题,我说这题很水的,我用二分搞一下求稳.结果二分写挂了.然后我暴力枚举并判断,又挂了.最后我不得不O(1)O(1)O(1)出答案,一分钟标算就出来了.我都做了什么…… B题尺取法一搞就稳了.然后C题我差点就骂人了.D题我觉得自己能写出来,然后推了半天,放弃了.我又回去搞C题,终于在离比赛结束还有...
Codeforces Round #142 Div.2 题解
Fuko_Ibuki的博客
09-06 1万+
A B C D E A 打n条龙,龙的攻击力xi,打死每条龙攻击力加yi,你的初始攻击力是s. 如果你的攻击力小于或者等于某条龙的攻击力你就死了. 问你能不能活着回去. 每次贪心打攻击力最小的龙,将龙排序既可. #include&lt;bits/stdc++.h&gt; //Ithea Myse Valgulious using namespace std; co...
Codeforces Round #779 (Div. 2) D 388535
qq_45863710的博客
03-28 872
D2. 388535 (Hard Version) 这里直接上 D2D2D2 的做法吧。我们可以知道 l⊕xl\oplus xl⊕x 一定在 aaa 中，所以对于 (a[i]⊕l)(a[i]\oplus l)(a[i]⊕l) (1<=i<=r-l+1) ，总有一个是 xxx 。我们现在设 b[i]=(a[i]⊕l)b[i]=(a[i]\oplus l)b[i]=(a[i]⊕l) ，那么我们怎么判断 b[i]b[i]b[i] 是不是 xxx 呢？首先我们要知道原序列是一个排列，所以不会有相同的数
Codeforces Round #836 (Div. 2) 题解（A-D）
weixin_42647984的博客
11-26 851
2022/11/25场 Codeforces #828 div3 题解
Codeforces Round #770 (Div. 2) A B C D 题解
weixin_45474586的博客
02-07 645
Codeforces Round #770 (Div. 2) A B C D 题解
Codeforces Round #810 (Div. 2) (A~C)
Hovey_QAQ的博客
07-25 263
Codeforces Round #810 (Div. 2) (A~C题解)
Codeforces Round #763 (Div. 2)
m0_56005735的博客
01-24 491
codeforces Round #763 (Div. 2)1.A - Robot Cleaner.2.B - Game on Ranges.3.C - Balanced Stone Heaps
Codeforces Round #628 (Div. 2)【A B C D】
01-03
传送门 A. EhAb AnD gCd 直接输出1，n-1即可 #include #include #include #include ...#define rep(i,a,b) for(int i=a;i=b;i--) typedef long long ll; using namespace std; const int MAXN=1e5+50; con
Codeforces Round #627 (Div. 3) C. Frog Jumps（思维）
01-20
传送门 题意： 开始位置在0，问能否跳到n+1位置 每步只能跳d 在1——n每个位置有方向，L,R，求d的最小值 思路： 只用找相邻两个R之间的最大值即可 ...#define rep(i,a,b) for(int i=a;i=b;i--) typedef long long l
Codeforces Round #628 (Div. 2) A~~D
01-03
A #include using namespace std; typedef long long ll; int main(){ int t; cin>>t; while(t--){ ll x; cin>>x; cout<<1>>t; while(t--){ st.clear(); ll n; cin >>n; ll re
ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) E. The Holmes Children
mystery_guest的博客
03-04 586
E. The Holmes Children time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The Holmes children are fighting ove
Codeforces Round #281 (Div. 2) A,B,C,D
mystery_guest的博客
09-01 551
A. Vasya and Football time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vasya has started watching football games. He h
Codeforces Beta Round #87 (Div. 1 Only)
mystery_guest的博客
03-29 505
A. Party time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output A company has n employees numbered from 1 to n.
codeforces round #772 (div. 2)
最新发布
03-16
好的，Codeforces Round #772 (Div. 2) 是一场由Codeforces主办的在线编程竞赛。 该比赛的比赛链接为：https://codeforces.com/contest/772。 该比赛分为两个级别：Div.1和Div.2。 Div. 1级别通常比Div. 2级别更...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值