1)结构体简单运用:(https://pintia.cn/problem-sets/994805046380707840/exam/problems/994805140211482624?type=7&page=0)
#include<bits/stdc++.h>
#define ll long long
const ll nl=1e5+5;
using namespace std;
struct node{
string s;
ll n;
ll m;
}no[nl];
int main(){
ll num;
cin>>num;
ll i,j;
for(i=0;i<num;i++){
string a;
ll b,c;
cin>>a;
cin>>b>>c;
no[i].s=a;
no[i].n=b;
no[i].m=c;
}
ll sum;
cin>>sum;
for(i=0;i<sum;i++){
ll a;
cin>>a;
for(j=0;j<num;j++){
if(no[j].n==a){
cout<<no[j].s<<" "<<no[j].m<<endl;
}
}
}
}
2)sqrt(n),开平方函数
3)__gcd(x,y),求x,y最大公约数
4)abs(x),求绝对值
5)getline(cin,sl) //接受一个字符串,可以接受空格并输出。
6)pow(2,n),2的n次方
7)printf输出规则?左右对齐,保留几位,补0
8)sum=fabs(al-bl);返回浮点数绝对值
9)getchar();消除回车影响
10)while(scanf(“%lld %c %lld:%lld”,&u,&s,&h,&m)!=EOF)循环输入
11)memset(a,0,sizeof(a))将a数组前sizeof(a)个数全部初始化为0
12)max min求最大最小值
13)vector数组使用方式
#include<bits/stdc++.h>
#define ll long long
const ll nl=1e5+5;
using namespace std;
int main(){
vector<ll>ve,vl;
ll n;
cin>>n;
for(ll i=0;i<n;i++){
ll m;
cin>>m;
if(m!=1){
ve.push_back(m);
}
}
cout<<ve.front()<<endl;
cout<<ve.back()<<endl;
cout<<ve.size()<<endl;
ve.pop_back();
cout<<ve.size()<<endl;
vl=ve;
cout<<vl.size()<<endl;
if(vl.empty()){
cout<<"1"<<endl;
}else{
cout<<"2";
}
}
14)cmp与sort排序:
struct node{
double a;//单价
int b;//每种阅兵的数量
}v[1005];
bool cmp(node x,node y){
if(x.a!=y.a){
return x.a>y.a;
}
}
sort(v,v+n,cmp);//排序
15)set函数(去重):https://blog.csdn.net/nefu__lian/article/details/107929144
本文含有隐藏内容,请 开通VIP 后查看