题目链接:点击打开链接
思路:n 要么为奇数(拆成 ( n/2 ) 个2 和 1 ,转化一下就是 ( n/2-1 ) 个 2 和 3 ),要么为偶数(拆成 n/2 个2 )
#include<cstdio>
#include<cmath>
using namespace std;
int n;
int main()
{
while(~scanf("%d",&n))
{
printf("%d\n",n/2);
if(n&1)
{
for(int i=1;i<n/2;i++)
printf("2 ");
puts("3");
}
else
{
for(int i=1;i<=n/2;i++)
printf(i==1?"2":" 2");
puts("");
}
}
return 0;
}
题目链接: 点击打开链接
以为是 B 题不会这么水,敲完之后不敢交。又回去读了好几遍题,想去找坑,实在是没找到。zz 浪费十多分钟
#include<cstdio>
#include<algorithm>
using namespace std;
int x1,x2,x3,y1,y2,y3;
int main()
{
while(~scanf("%d%d%d%d%d%d",&x1,&y1,&x2,&y2,&x3,&y3))
{
puts("3");
printf("%d %d\n",x1+x2-x3,y1+y2-y3);
printf("%d %d\n",x1+x3-x2,y1+y3-y2);
printf("%d %d\n",x2+x3-x1,y2+y3-y1);
}
return 0;
}
题目链接: 点击打开链接
There are n employees in Alternative Cake Manufacturing (ACM). They are now voting on some very important question and the leading world media are trying to predict the outcome of the vote.
Each of the employees belongs to one of two fractions: depublicans or remocrats, and these two fractions have opposite opinions on what should be the outcome of the vote. The voting procedure is rather complicated:
- Each of n employees makes a statement. They make statements one by one starting from employees 1 and finishing with employee n. If at the moment when it's time for the i-th employee to make a statement he no longer has the right to vote, he just skips his turn (and no longer takes part in this voting).
- When employee makes a statement, he can do nothing or declare that one of the other employees no longer has a right to vote. It's allowed to deny from voting people who already made the statement or people who are only waiting to do so. If someone is denied from voting he no longer participates in the voting till the very end.
- When all employees are done with their statements, the procedure repeats: again, each employees starting from 1 and finishing withn who are still eligible to vote make their statements.
- The process repeats until there is only one employee eligible to vote remaining and he determines the outcome of the whole voting. Of course, he votes for the decision suitable for his fraction.
You know the order employees are going to vote and that they behave optimal (and they also know the order and who belongs to which fraction). Predict the outcome of the vote.
The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of employees.
The next line contains n characters. The i-th character is 'D' if the i-th employee is from depublicans fraction or 'R' if he is from remocrats.
Print 'D' if the outcome of the vote will be suitable for depublicans and 'R' if remocrats will win.
5 DDRRR
D
6 DDRRRR
R
Consider one of the voting scenarios for the first sample:
- Employee 1 denies employee 5 to vote.
- Employee 2 denies employee 3 to vote.
- Employee 3 has no right to vote and skips his turn (he was denied by employee 2).
- Employee 4 denies employee 2 to vote.
- Employee 5 has no right to vote and skips his turn (he was denied by employee 1).
- Employee 1 denies employee 4.
- Only employee 1 now has the right to vote so the voting ends with the victory of depublicans.
大意:有两个政党,n 个人进行投票的结果。每个人都知道其他人的投票结果和顺序,而且都会选择最优的方式(就是本着让自己支持政党获胜的想法)否定他人。现在进行一种操作:每个人可以否定另一个人的投票(前提是他自己没有被否定),投票者被否定之后此前的投票无效,直到最后剩余一个人为止。输出最后这个人所支持的政党。
思路:用 queue 或 set 维护投票的人即可
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n;
char str[200010];
int main()
{
while(~scanf("%d",&n))
{
scanf("%s",str+1);
queue<int> QD;
queue<int> QR;
for(int i=1;i<=n;i++)
{
if(str[i]=='D')
QD.push(i);
else
QR.push(i);
}
while(QD.size()&&QR.size())
{
int x=QD.front();
QD.pop();
int y=QR.front();
QR.pop();
if(x<y)
QD.push(x+n);
else
QR.push(y+n);
}
if(!QD.empty())
puts("D");
else
puts("R");
}
return 0;
}