# cf424（A，B，C）

A. Squats
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Pasha has many hamsters and he makes them work out. Today, n hamsters (n is even) came to work out. The hamsters lined up and each hamster either sat down or stood up.

For another exercise, Pasha needs exactly  hamsters to stand up and the other hamsters to sit down. In one minute, Pasha can make some hamster ether sit down or stand up. How many minutes will he need to get what he wants if he acts optimally well?

Input

The first line contains integer n (2 ≤ n ≤ 200n is even). The next line contains n characters without spaces. These characters describe the hamsters' position: the i-th character equals 'X', if the i-th hamster in the row is standing, and 'x', if he is sitting.

Output

In the first line, print a single integer — the minimum required number of minutes. In the second line, print a string that describes the hamsters' position after Pasha makes the required changes. If there are multiple optimal positions, print any of them.

Sample test(s)
input
4
xxXx

output
1
XxXx

input
2
XX

output
1
xX

input
6
xXXxXx

output
0
xXXxXx

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
char a[205];

int main()
{
int n,s=0;
cin>>n;
for(int i=0; i<n; i++)
{
cin>>a[i];
if(a[i]=='X')
s++;
}
if(s==n/2)
cout<<0<<endl<<a<<endl;
else
{
cout<<abs(s-n/2)<<endl;
if(s<n/2)
{
s=n/2-s;
for(int i=0; i<n; i++)
if(s&&a[i]=='x')
cout<<'X',s--;
else cout<<a[i];
}
else
{
s=s-n/2;
for(int i=0; i<n; i++)
if(s&&a[i]=='X')
cout<<'x',s--;
else cout<<a[i];
}
}
return 0;
}

B. Megacity
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The administration of the Tomsk Region firmly believes that it's time to become a megacity (that is, get population of one million). Instead of improving the demographic situation, they decided to achieve its goal by expanding the boundaries of the city.

The city of Tomsk can be represented as point on the plane with coordinates (00). The city is surrounded with n other locations, the i-th one has coordinates (xiyi) with the population of ki people. You can widen the city boundaries to a circle of radius r. In such case all locations inside the circle and on its border are included into the city.

Your goal is to write a program that will determine the minimum radius r, to which is necessary to expand the boundaries of Tomsk, so that it becomes a megacity.

Input

The first line of the input contains two integers n and s (1 ≤ n ≤ 1031 ≤ s < 106) — the number of locatons around Tomsk city and the population of the city. Then n lines follow. The i-th line contains three integers — the xi and yi coordinate values of the i-th location and the number ki of people in it (1 ≤ ki < 106). Each coordinate is an integer and doesn't exceed 104 in its absolute value.

It is guaranteed that no two locations are at the same point and no location is at point (0; 0).

Output

In the output, print "-1" (without the quotes), if Tomsk won't be able to become a megacity. Otherwise, in the first line print a single real number — the minimum radius of the circle that the city needs to expand to in order to become a megacity.

The answer is considered correct if the absolute or relative error don't exceed 10 - 6.

Sample test(s)
input
4 999998
1 1 1
2 2 1
3 3 1
2 -2 1

output
2.8284271

input
4 999998
1 1 2
2 2 1
3 3 1
2 -2 1

output
1.4142136

input
2 1
1 1 999997
2 2 1

output
-1

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;

struct data
{
int x,y,k;
double r;
}a[10010];

bool cmp(data a,data b)
{
return a.r<b.r;
}

int main()
{
int n,s;
cin>>n>>s;
for(int i=0;i<n;i++)
cin>>a[i].x>>a[i].y>>a[i].k,a[i].r=sqrt((double)a[i].x*(double)a[i].x+(double)a[i].y*(double)a[i].y);
sort(a,a+n,cmp);
int flag=0;double rr;
for(int i=0;i<n;i++)
{
//cout<<a[i].r<<endl;
s+=a[i].k;
if(s>=1000000){flag=1;rr=a[i].r;break;}
}
if(flag)printf("%.7f\n",rr);
else cout<<-1<<endl;
return 0;
}

C. Magic Formulas
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

People in the Tomskaya region like magic formulas very much. You can see some of them below.

Imagine you are given a sequence of positive integer numbers p1p2, ..., pn. Lets write down some magic formulas:

Here, "mod" means the operation of taking the residue after dividing.

The expression  means applying the bitwise xor (excluding "OR") operation to integers x and y. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by "^", in Pascal — by "xor".

People in the Tomskaya region like magic formulas very much, but they don't like to calculate them! Therefore you are given the sequence p, calculate the value of Q.

Input

The first line of the input contains the only integer n (1 ≤ n ≤ 106). The next line contains n integers: p1, p2, ..., pn (0 ≤ pi ≤ 2·109).

Output

The only line of output should contain a single integer — the value of Q.

Sample test(s)
input
3
1 2 3

output
3


#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;

ll yh[1000010]={0};

int main()
{
ll n;
cin>>n;
ll ans=0;
for(ll i=0;i<n;i++)
{
yh[i+1]=(i+1)^yh[i];
ll tem;
scanf("%lld",&tem);
ans^=tem;
ans^=yh[i];
if(i>1)
{
ll x=(n-i)/i;
ll sh=n-i-x*i;
ans^=yh[sh];
if(x%2==1)
ans^=yh[i-1];
}
}
cout<<ans<<endl;
return 0;
}


• 本文已收录于以下专栏：

## Codeforces 424A (思维题)

Squats Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u ...
• qq_33328072
• 2016年05月24日 10:16
• 132

## 关于C语言中类似"a<b<c"条件的值

• octobershiner
• 2011年08月03日 13:36
• 7847

## 当a=1,b=2,c=3时，if(a>c)b=a;a=c;c=b;的执行结果详解

• u012402276
• 2016年05月20日 16:44
• 6815

## 计算(a/b)%c

• zy691357966
• 2015年04月02日 20:12
• 2364

## a^b%c 的三种形式

• u013081425
• 2014年08月10日 16:47
• 987

## (a*b)%c 小的技巧

• u010123208
• 2014年05月08日 21:11
• 1359

## C语言中a=b=c,a=b==c,a==(b=c),a==(b==c)的简单分析

• u013372441
• 2016年03月12日 15:06
• 2897

## php中三元运算符用法($c=$a>$b?($a-$b):($a+\$b);)

php中三元运算符又被叫做三目运算符了，其实我常把它叫作问号运行符其实都可以这样做，三元运算符可以实现简单的条件判断功能，下在我来给各位介绍一些三元运算符的例子。 三元运算符的功能与“i...
• haibo0668
• 2016年07月15日 17:20
• 2114

## （A^B)%C 快速幂乘 （简单数论）

#include using namespace std; int main() { int a,b,c; while (scanf("%d%d%d",&a,&b,&c)!=EOF&&a!=0&&...
• LiWen_7
• 2012年05月08日 12:47
• 2036

## JS中连等赋值操作使用注意事项(a=b=c)

• xuyunfei_2012
• 2016年06月22日 16:36
• 3640

举报原因： 您举报文章：cf424（A，B，C） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)