东大c++实验第三周

#include<iostream>
using namespace std;
int cnt,a[1005],x;
int main(){
	while(cin>>x){
		a[cnt++]=x;
	}
	for(int i=cnt-1;i>=0;--i){
		cout<<a[i]<<" ";
	}
}

#include<bits/stdc++.h>
using namespace std;
map<int,int>mp;
int x;
int main(){
	while(cin>>x){
		++mp[x];
	}
	for(auto it=mp.rbegin();it!=mp.rend();it++){
		if((*it).second!=1) continue;
		cout<<(*it).first<<" ";
	}
}

#include<bits/stdc++.h>
using namespace std;
int n,b,cnt;
char s[1005];
void itob(int n,char s[],int b){
	bool flag=false;
	if(n<0){
		flag=true;
		n*=-1;
	}
	while(n){
		if(n%b>9){
			s[cnt++]='a'+n%b-10;
		}else{
			s[cnt++]='0'+n%b;
		}
		n/=b;
	}
	if(flag){
		s[cnt++]='-';
	}
	reverse(s,s+cnt);
}
int main(){
	cin>>n>>b;
	itob(n,s,b);
	cout<<s;
}

#include<bits/stdc++.h>
using namespace std;
int n,m,cnt,x,a[1005][1005],counts=1;
bool check;
char c;
int main(){
	while(c=getchar()){
		if(isdigit(c)){
			x=x*10+c-'0';
		}else{
			a[0][cnt++]=x;x=0;
			if(c=='\n'){
				m=cnt;cnt=0;break;
			}
		}
	}
	while(cin>>x){
		a[counts][cnt++]=x;
		if(cnt==m){
			++counts;cnt=0;
		}
	}
	n=counts;
	for(int i=0;i<n;++i){
		int maxx=a[i][0],flag=0;
		for(int j=1;j<m;++j){
			if(a[i][j]>maxx){
				flag=j;
				maxx=a[i][j];
			}
		}
		for(int j=0;j<n;++j){
			if(a[j][flag]<a[i][flag]){
				break;
			}
			if(j==n-1){
				printf("Saddle point:a[%d][%d]=%d\n",i,flag,a[i][flag]);
				check=true;
			}
		}
	}
	if(!check){
		puts("There is no saddle point");
	}
}

#include<bits/stdc++.h>
using namespace std;
bool check[105];
int main(){
	for(int i=2;i<=100;++i){
		if(!check[i]){
			cout<<i<<" ";
			for(int j=i*i;j<=100;j+=i){
				check[j]=true;
			}
		}
	}
}