Codeforces Round #235 (Div. 2)
1 second
256 megabytes
standard input
standard output
Vanya loves playing. He even has a special set of cards to play with. Each card has a single integer. The number on the card can be positive, negative and can even be equal to zero. The only limit is, the number on each card doesn't exceed x in the absolute value.
Natasha doesn't like when Vanya spends a long time playing, so she hid all of his cards. Vanya became sad and started looking for the cards but he only found n of them. Vanya loves the balance, so he wants the sum of all numbers on found cards equal to zero. On the other hand, he got very tired of looking for cards. Help the boy and say what is the minimum number of cards does he need to find to make the sum equal to zero?
You can assume that initially Vanya had infinitely many cards with each integer number from - x to x.
The first line contains two integers: n (1 ≤ n ≤ 1000) — the number of found cards and x (1 ≤ x ≤ 1000) — the maximum absolute value of the number on a card. The second line contains n space-separated integers — the numbers on found cards. It is guaranteed that the numbers do not exceed x in their absolute value.
Print a single number — the answer to the problem.
3 2
-1 1 2
1
2 3
-2 -2
2
题意:就是求一个最小操作数(绝水)
sl:直接模拟。 1 #include <cstdio>
2 #include <cstring>
3 #include <algorithm>
4 typedef long long ll;
5 using namespace std;
6 const int MAX =+ ;
7 int a[MAX];
8 int main()
9 {
int n,x;
int ans;
while(scanf("%d %d",&n,&x)==)
{
ans=;
for(int i=;i<n;i++)
{
scanf("%d",&a[i]);
ans+=a[i];
}
int cnt=;
if(ans==) printf("0\n");
else if(ans>)
{
while(ans>=x)
{
cnt++;
ans-=x;
}
if(ans!=) cnt++;
printf("%d\n",cnt);
}
else
{
while(abs(ans)>=x)
{
cnt++;
ans+=x;
}
if(ans!=) cnt++;
printf("%d\n",cnt);
}
}
return ;
44 }
1 second
256 megabytes
standard input
standard output
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: Div1 (for advanced coders) and Div2 (for beginner coders). Two rounds, Div1 and Div2, can go simultaneously, (Div1 round cannot be held without Div2) in all other cases the rounds don't overlap in time. Each round has a unique identifier — a positive integer. The rounds are sequentially (without gaps) numbered with identifiers by the starting time of the round. The identifiers of rounds that are run simultaneously are different by one, also the identifier of the Div1 round is always greater.
Sereja is a beginner coder, so he can take part only in rounds of Div2 type. At the moment he is taking part in a Div2 round, its identifier equals tox. Sereja remembers very well that he has taken part in exactly k rounds before this round. Also, he remembers all identifiers of the rounds he has taken part in and all identifiers of the rounds that went simultaneously with them. Sereja doesn't remember anything about the rounds he missed.
Sereja is wondering: what minimum and what maximum number of Div2 rounds could he have missed? Help him find these two numbers.
The first line contains two integers: x (1 ≤ x ≤ 4000) — the round Sereja is taking part in today, and k (0 ≤ k < 4000) — the number of rounds he took part in.
Next k lines contain the descriptions of the rounds that Sereja took part in before. If Sereja took part in one of two simultaneous rounds, the corresponding line looks like: "1 num2 num1" (where num2 is the identifier of this Div2 round, num1 is the identifier of the Div1 round). It is guaranteed that num1 - num2 = 1. If Sereja took part in a usual Div2 round, then the corresponding line looks like: "2 num" (where num is the identifier of this Div2 round). It is guaranteed that the identifiers of all given rounds are less than x.
Print in a single line two integers — the minimum and the maximum number of rounds that Sereja could have missed.
3 2
2 1
2 2
0 0
9 3
1 2 3
2 8
1 4 5
2 3
10 0
5 9
题意:每场比赛都有一个特定的标号,每次给出每场比赛的标号,问之前最多和最少参加了多少场div2
sol:还是模拟最多肯定是全部都是div2,最少肯定是都是1,2一起举行,多出来的部分用div2补全
1 #include <cstdio>
2 #include <cstring>
3 #include <algorithm>
4 typedef long long ll;
5 using namespace std;
6 const int MAX = +;
7 int vis[MAX];
8 int main()
9 {
int k,x,t; int num1,num2;
while(scanf("%d %d",&x,&k)==)
{
memset(vis,,sizeof(vis));
for(int i=;i<k;i++)
{
scanf("%d",&t);
if(t==)
{
scanf("%d",&num2);
vis[num2]=;
}
if(t==)
{
scanf("%d %d",&num1,&num2);
vis[num1]=vis[num2]=;
}
}
int Min=,Max=;
for(int i=;i<x;i++)
{
if(!vis[i]&&!vis[i+]&&(i+)<x)
{
Min++;
i++;
}
else if(i<x&&!vis[i])
{
Min++;
}
}
for(int i=;i<x;i++)
{
if(!vis[i]) Max++;
}
printf("%d %d\n",Min,Max);
}
return ;
48 }
1 second
256 megabytes
standard input
standard output
Now it's time of Olympiads. Vanya and Egor decided to make his own team to take part in a programming Olympiad. They've been best friends ever since primary school and hopefully, that can somehow help them in teamwork.
For each team Olympiad, Vanya takes his play cards with numbers. He takes only the cards containing numbers 1 and 0. The boys are very superstitious. They think that they can do well at the Olympiad if they begin with laying all the cards in a row so that:
- there wouldn't be a pair of any side-adjacent cards with zeroes in a row;
- there wouldn't be a group of three consecutive cards containing numbers one.
Today Vanya brought n cards with zeroes and m cards with numbers one. The number of cards was so much that the friends do not know how to put all those cards in the described way. Help them find the required arrangement of the cards or else tell the guys that it is impossible to arrange cards in such a way.
The first line contains two integers: n (1 ≤ n ≤ 106) — the number of cards containing number 0; m (1 ≤ m ≤ 106) — the number of cards containing number 1.
In a single line print the required sequence of zeroes and ones without any spaces. If such sequence is impossible to obtain, print -1.
1 2
101
4 8
110110110101
4 10
11011011011011
1 5
-1
题意:就是给出1的个数和0的个数,求出一个满足没有连续的两个0和连续的三个1的序列
sl:一共就三种情况可以算出三个公式吧,很简单,比赛时没注意算了 6种情况
随便来一种情况: |-|-|--|--|--|-
"|"代表0个数设为k
"-" 代表1总共m个
有: k+(n-1-k)*2+1=m 满足k>=0时有解。其余类似。剩下的就是输出答案了
1 #include <cstdio>
2 #include <cstring>
3 #include <algorithm>
4 typedef long long ll;
5 using namespace std;
6 const int MAX =1e6+;
7 int num[MAX];
8 int main()
9 {
int n,m;
while(scanf("%d %d",&n,&m)==)
{
int Max=max(n,m);
if(n>=m+) printf("-1\n");
else if(n==m+)
{
for(int i=;i<m;i++) printf("");
printf("");
printf("\n");
}
else if(n==m)
{
for(int i=;i<m;i++) printf("");
printf("\n");
}
else if(*n-m>=)
{
printf("");
for(int i=;i<*n-m;i++) printf("");
for(int i=;i<n--*n+m;i++) printf("");
printf("");
printf("\n");
}
else if(*n-m->=)
{
printf("");
for(int i=;i<*n-m-;i++) printf("");
for(int i=;i<n-*n+m;i++) printf("");
printf("");
printf("\n");
}
else if(*n-m->=)
{
printf("");
for(int i=;i<*n-m-;i++) printf("");
for(int i=;i<n-*n+m+;i++) printf("");
printf("\n");
}
else if(*n-m+>=)
{
for(int i=;i<*n-m+;i++) printf("");
for(int i=;i<n-*n+m-;i++) printf("");
printf("");
printf("\n");
}
else if(*n-m+>=)
{
for(int i=;i<*n-m+;i++) printf("");
for(int i=;i<n-*n+m-;i++) printf("");
printf("");
printf("\n");
}
else if(*n-m>=)
{
for(int i=;i<*n-m;i++) printf("");
for(int i=;i<n-*n+m;i++) printf("");
printf("\n");
}
}
return ;
71 }
4 seconds
512 megabytes
standard input
standard output
Roman is a young mathematician, very famous in Uzhland. Unfortunately, Sereja doesn't think so. To make Sereja change his mind, Roman is ready to solve any mathematical problem. After some thought, Sereja asked Roma to find, how many numbers are close to number n, modulo m.
Number x is considered close to number n modulo m, if:
- it can be obtained by rearranging the digits of number n,
- it doesn't have any leading zeroes,
- the remainder after dividing number x by m equals 0.
Roman is a good mathematician, but the number of such numbers is too huge for him. So he asks you to help him.
The first line contains two integers: n (1 ≤ n < 1018) and m (1 ≤ m ≤ 100).
In a single line print a single integer — the number of numbers close to number n modulo m.
104 2
3
223 4
1
7067678 8
47
题意:给出一个数字n和m求出与数字n相近的数,这个数满足:他是n的每位数字的重新排列,用它%m为0,没有前导0。求满足条件的总数。
sol: dp题目。--(当时不会么,状压学的太烂了) ,枚举每一位的状态,(从后枚举)
方程:dp[i|1<<j][(k*10+a[j])%m]+=dp[i][k]; dp【i】[j] 表示每位状态为i余数为j时的总数。
具体参考代码。 1 #include<cstdio>
2 #include<cstring>
3 #include<algorithm>
4 using namespace std;
5
6 long long dp[<<][],d,f[];
7 int main()
8 {
9 int m,l,n,i,j,k,c[];
char a[];
memset(c,,sizeof(c));
for(f[]=,i=;i<;i++)
f[i]=f[i-]*i; //计算阶乘
scanf("%s%d",a,&m);
l=strlen(a),n=<<l;
for(i=;i<l;i++)
c[a[i]-='']++; //保存每个数字的个数
for(d=,i=;i<;i++)
d*=f[c[i]]; //重复的个数
dp[][]=;
for(i=;i<n;i++)
for(j=;j<l;j++)
if(!(i&<<j)) //此处数字已经去过了不用再去取了从后往前取
for(k=;k<m;k++)
if(!(i==&&a[j]==)) //当i!=0时 最高位肯定不是0随便取
dp[i|<<j][(k*+a[j])%m]+=dp[i][k];
printf("%I64d\n",dp[n-][]/d);
return ;
34 }
PS:yy了一下大牛,貌似可以将数列,分成两半然后暴力求解时间复杂度为O(2^9);
Codeforces Round #235 (Div. 2)的更多相关文章
- Codeforces Round #235 (Div. 2) D. Roman and Numbers(如压力dp)
Roman and Numbers time limit per test 4 seconds memory limit per test 512 megabytes input standard i ...
- Codeforces Round #235 (Div. 2) D. Roman and Numbers 状压dp+数位dp
题目链接: http://codeforces.com/problemset/problem/401/D D. Roman and Numbers time limit per test4 secon ...
- Codeforces Round #235 (Div. 2)C、Team
#include <iostream> #include <algorithm> using namespace std; int main(){ int n,m; cin & ...
- Codeforces Round #235 (Div. 2) B. Sereja and Contests
#include <iostream> #include <vector> #include <algorithm> using namespace std; in ...
- Codeforces Round #235 (Div. 2) A. Vanya and Cards
#include <iostream> using namespace std; int main(){ int n,x; cin >> n >> x; ; ; i ...
- Codeforces Round #235 (Div. 2) D. Roman and Numbers (数位dp、状态压缩)
D. Roman and Numbers time limit per test 4 seconds memory limit per test 512 megabytes input standar ...
- Codeforces Round #235 (Div. 2) C. Team
C. Team time limit per test 1 second memory limit per test 256 megabytes input standard input output ...
- Codeforces Round #235 (Div. 2) D (dp)
以为是组合,后来看着像数位dp,又不知道怎么让它不重复用..然后就没思路 了. 其实状压就可以了 状压是可以确定一个数的使用顺序的 利用01也可以确定所有的数的使用以及不重复 dp[i+1<&l ...
- Codeforces Round #366 (Div. 2) ABC
Codeforces Round #366 (Div. 2) A I hate that I love that I hate it水题 #I hate that I love that I hate ...
随机推荐
- bzoj 2200: [Usaco2011 Jan]道路和航线【spfa】
直接跑最短路就行了--还不用判负环 #include<iostream> #include<cstdio> #include<queue> using namesp ...
- [App Store Connect帮助]四、添加 App 图标、App 预览和屏幕快照(4)为其他设备尺寸和本地化内容添加屏幕快照和预览
如果您不想在其他设备尺寸上使用经过缩放的高分辨率屏幕快照或 App 预览,您可以使用“媒体管理”为其他设备尺寸和本地化内容添加自定屏幕快照. 屏幕快照和 App 预览仅在 App 状态为可编辑时才能进 ...
- loadrunner中get和post请求
loadrunner中可以使用web_url和web_link发送get请求,使web_submit_form和web_sumbit_data发送post请求. 有什么不同呢?推荐使用哪一个? web ...
- 设置VMWare虚拟机使拷贝虚拟机后固定原有的IP地址
VMWare中已经安装并设置好的虚拟机在拷贝给别人后,再次打开该虚拟机时原有自动获取的IP地址将会变化,那么原有根据该IP地址进行的设置均将失效,还需要重新设置,比较麻烦,经过百度查询原来可以将虚拟机 ...
- 数据传递-------@PathVariable
package com.wh.handler; /** * 通过@PathVariable可以绑定占位符参数到方法参数中,例如 * @PathVariable("userId") ...
- C# 访问mongodb数据库
1.引用四个mongodb动态库MongoDB.Bson.dll,MongoDB.Driver.Core.dll,MongoDB.Driver.dll,MongoDB.Driver.Legacy.dl ...
- Spring:(三) --常见数据源及声明式事务配置
Spring自带了一组数据访问框架,集成了多种数据访问技术.无论我们是直接通过 JDBC 还是像Hibernate或Mybatis那样的框架实现数据持久化,Spring都可以为我们消除持久化代码中那些 ...
- vscode使用教程(web开发)
1.安装 进入官网下载https://code.visualstudio.com/ 一直下一步就好了,中间可以选择把软件安装在哪个目录. 2.常用插件安装 a. 进入扩展视图界面安装/卸载 a1.快捷 ...
- 61配置nanopim1plus的HDMI为1080p输出
61配置nanopim1plus的HDMI为1080p输出 大文实验室/大文哥 壹捌陆捌零陆捌捌陆捌贰 21504965 AT qq.com 完成时间:2018/4/4 10:21 版本:V1.1 开 ...
- 前端er怎样操作剪切复制以及禁止复制+破解等
前言 有时候我们经常会碰到这些场景:玩掘金.知乎的时候复制一段文字,总是会在内容后面加上一些版权信息,以及像小说网站等都有禁止选中,禁止复制这种功能,还有点击自动复制账号的功能. 我也经常遇到这些场景 ...