排一下序就好了
#include<iostream>
#include<algorithm>
using namespace std;
int n,a[110];
int main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
for(int i=0;i<n;i++)cout<<a[i]<<" ";
cout<<endl;
return 0;
}
B - Domino Effect
R跟L是间隔的,扫一遍就可以了
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int n;
string a;
int main()
{
//freopen("in.txt","r",stdin);
cin>>n>>a;
int len=a.size();
bool first=true;
int ans=0,x=-1;
char before='L';
for(int i=0;i<len;i++)
{
if(a[i]!='.'&&first)
{
if(a[i]=='R')ans+=i;
else ans=0;
x=i;
first=false;
before=a[i];
continue;
}
if(a[i]!='.')
{
if(a[i]=='R')ans+=i-x-1;
else if((i-x)%2==0)ans++;
x=i;
before=a[i];
continue;
}
if(i==len-1)
{
if(before=='L')ans+=i-x;
}
}
cout<<ans<<endl;
return 0;
}
C - Unusual Product
又是神奇的位运算,0101010101的和%2与异或一边结果相同。因为the unusual square的结果是模2的,所以,计算矩阵的时候,出现两次的肯定为0,所以,最后的结果只有是i==j的时候的值,ans=a[1][1]+a[2][2]+......,对于每次的操作一和操作二,改变的结果也就是把值变换一次,即对一取反,故本题只要统计操作一和操作二的次数即可
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1010;
int n,q;
int main()
{
int op,x,ans=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&x);
if(i==j)ans^=x;
}
scanf("%d",&q);
while(q--)
{
scanf("%d",&op);
if(op<3)
{
scanf("%d",&x);
ans=!ans;
}
else
printf("%d",ans);
}
printf("\n");
return 0;
}