今天的北京新闻_外贸网站多语言_cps推广_制作网站需要什么

垃圾分类

#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int n,m;
struct node{char name[30];int ID;char fln[30];
};
node a[100010];
int getn();
int main(){n=getn();for(int i=0;i<n;i++){char tmp[50];getline(tmp,50);a[i].ID=tmp[strlen(tmp)-1]-48;tmp[strlen(tmp)-2]='\0';strcpy(a[i].name,tmp);if(a[i].ID==1) strcpy(a[i].fln,"Gan laji");if(a[i].ID==1) strcpy(a[i].fln,"Shi laji");if(a[i].ID==1) strcpy(a[i].fln,"Kehuishou");if(a[i].ID==1) strcpy(a[i].fln,"Yohai laji");}bool ff=true;while(true){char tmp[50];cin.getline(tmp,50);if(strcmp(tmp,"#")==0) break;for(int i=0;i<n;i++){if(strcmp(a[i].name,tmp)==0){cout<<a[i].fln<<endl;ff=false;break;}}if(ff==true) cout<<"?"<<endl;}return 0;
}
void f(int k){}
int getn(){char tmp[100];int num=0;cin.getline(tmp,100);int lt=strlen(tmp);for(int i=0;i<lt;i++){num=num*10+tmp[i]-48;}return num;
}

火中取栗

#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int n,m;
struct node{};
node a[100010];
int getn();
int main(){int k,sum=0;cin>>n>>k;int lizi;for(int i=0;i<n;i++){cin>>lizi;if(lizi%k==0){sum=sum+lizi/k;}else{cnt=cnt+lizi/k+1;}}return 0;
}
void f(int k){}
int getn(){char tmp[100];int num=0;cin.getline(tmp,100);int lt=strlen(tmp);for(int i=0;i<lt;i++){num=num*10+tmp[i]-48;}return num;
}

生成字符串

#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int n,m;
struct node{};
node a[100010];
int getn();
char ch[100000];
int main(){cin>>n;char s;cin>>s;cin>>ch;for(int i=0;i<n;i++){if(i==0){cout<<s;}else{if(ch[i]!='a'&&ch[i]!='A'&&ch[i]!='z'&&ch[i]!='Z'){if(ch[i]==0&&(int)ch[i]>=97&&(int)ch[i]<=122){int x=(int)ch[i]-32;cout<<(char)x;}if(ch[i]==0&&(int)ch[i]>=90&&(int)ch[i]<=65){int x=(int)ch[i]+32;cout<<(char)x;}if(ch[i]==1&&(int)ch[i]>=97&&(int)ch[i]<=122){int x=(int)ch[i]-1;cout<<(char)x;}if(ch[i]==1&&(int)ch[i]>=90&&(int)ch[i]<=65){int x=(int)ch[i]+1-32;cout<<(char)x;}}}}return 0;
}
void f(int k){}
int getn(){char tmp[100];int num=0;cin.getline(tmp,100);int lt=strlen(tmp);for(int i=0;i<lt;i++){num=num*10+tmp[i]-48;}return num;
}