第不知道多少个freopen猎奇错误的

#include<bits/stdc++.h>
using namespace std;
int ans[1000010]; 
string str;
int main(){
	freopen("number.in","r",stdin);
	freopen("number.out","w",stdout);
	int p=0;
	cin>>str;
	int l=str.size();
	for(int i=0;i<l;i++){
		if(str[i]<='9'&&str[i]>='0'){
			ans[p]=str[i]-'0';
			p++;
		}
	}
	sort(ans,ans+p);
	if(ans[p-1]==0){
		cout<<0;
	}
	else{
		for(int i=p-1;i>=0;i--){
			cout<<ans[i];
		}
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[200];
int ans[200];
int ppp=0;
int main(){
	freopen("seat.in","r",stdin);
	freopen("seat.out","w",stdout);
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n*m;i++){
		cin>>a[i],ans[i]=a[i];
	}
	sort(ans+1,ans+1+n*m);
	for(int i=1;i<=n*m;i++){
		if(ans[i]==a[1]){
			ppp=n*m-i+1;
			break;
		}
	}
//	for(int i=1;i<=n*m;i++){
//		cout<<ans[i]<<endl;
//	}
	int ansn,ansm;
	ansm=(ppp+n-1)/n;
	if(ansm%2==1){
		if(ppp%m==0)ansn=m;
		else ansn=ppp%m;
	}else{
		int asn;
		if(ppp%m==0)asn=m;
		else asn=ppp%m;
		ansn=m+1-asn;
	}
	cout<<ansm<<' '<<ansn;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[500010];
int main(){
	freopen("xor.in","r",stdin);
	freopen("xor.out","w",stdout);
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	cout<<rand()%n;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[5010],ans,n;
void dfs(int no,int sum,int maxp,int bs){
	if(bs+(n-no+1)<3)return;
	if(no==n+1){
		if(bs<3)return;
		if(sum<=maxp*2)return;
		ans++;
		return;
	}
	dfs(no+1,sum+a[no],max(maxp,a[no]),bs+1);
	dfs(no+1,sum,maxp,bs);
	return;
}
int main(){
	freopen("polygon.in","r",stdin);
	freopen("polygon.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	dfs(1,0,0,0);
	cout<<ans;
	return 0;
}