文章目录
1.AcWing 3346. 你知道你的ABC吗
AC代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int a[10],x,y,z,sum;
bool cmp(int x,int y){
return x<y;
}
int main(){
for(int i=1;i<=7;i++)
scanf("%d",&a[i]);
sort(a+1,a+8,cmp);
x=a[1];
y=a[2];
z=a[7]-a[1]-a[2];
printf("%d %d %d\n",x,y,z);
return 0;
}
2.AcWing 3358. 放养但没有完全放养
AC代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char s[1010],a[1010];
int main(){
scanf("%s",s);
scanf("%s",a);
int ls = strlen(s);
int la = strlen(a);
int k=0,sum=0,flag=0;
while(1){
sum++;
for(int i=0;i<ls;i++){
if(s[i] == a[k]){
k++;
}
if(k==la){
flag=1;
break;
}
}
if(flag)
break;
}
printf("%d\n",sum);
return 0;
}
3.AcWing 3370. 牛年
AC代码:
#include<bits/stdc++.h>
using namespace std;
long long n,i,j,x;
string a,b,c,d;
string an[13]={"Ox","Tiger","Rabbit","Dragon","Snake","Horse","Goat","Monkey","Rooster","Dog","Pig","Rat"};//初始化
map<string,long long> year;
int main()
{
year["Bessie"]=0;//初始化
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a>>b>>b>>b>>c>>d>>d>>d;//读掉一些不需要的东西
if(b=="previous")
{
for(j=year[d]-1;;j--) if(an[(j%12+12)%12]==c) break;//查找年份
year[a]=j;
}
else
{
for(j=year[d]+1;;j++) if(an[(j%12+12)%12]==c) break;//查找年份
year[a]=j;
}
}
cout<<abs(year["Elsie"]);//注意要减贝西的年份,因为我设为零,所以不用
return 0;
}
4.AcWing 3745. 牛的学术圈 I
AC代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5+10;
int n,l;
int c[N];
bool cmp(int a,int b){
return a > b;
}
int main(){
scanf("%d %d",&n,&l);
for(int i=1;i<=n;i++)
scanf("%d",&c[i]);
sort(c+1,c+1+n,cmp);
int maxx=0;
for(int i = 1;i<=n;i++){
if(c[i] >= i)
maxx=i;
else
break;
}
if(c[maxx + 1] < maxx){
printf("%d\n",maxx);
return 0;
}
int sum=0;
for(int i=1;i<=maxx+1;i++)
if(c[i] == maxx)
sum++;
if(sum > l)
printf("%d\n",maxx);
else
printf("%d\n",maxx+1);
return 0;
}
5.AcWing 1459. 奶牛体操
AC代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int a[30],b[30][30];
int main(){
int n,k;
scanf("%d %d",&k,&n);
for(int i=1;i<=k;i++){
for(int j=1;j<=n;j++)
scanf("%d",&a[j]);
for(int j=1;j<n;j++)
for(int o=j+1;o<=n;o++)
b[a[j]][a[o]]++;
}
int sum=0;
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
if(b[a[i]][a[j]] == k)
sum++;
printf("%d\n",sum);
return 0;
}