40分求调

#include<bits/stdc++.h>
using namespace std;
int n,t,a[10001],b[10001],sum=0;
int main() {
	cin>>n;
	for(int i=1; i<=n; i++) {
		cin>>a[i]>>b[i];
	}
	cin>>t;
	for(int i=1; i<=n; i++) {
		if(a[i]==b[i]) sum+=100;
		else {
			sum+=((100/a[i])*b[i]);
		}
	}
	if(sum>=t) {
		cout<<"Already Au.";
		return 0;
	}
	for(int i=1; i<=n; i++) {
		int m=t-sum;
		if(a[i]==b[i]||(((100/a[i])*b[i])+t-(((100/a[i])*b[i])))<t) cout<<"NaN"<<endl;
		else {
			if(t-sum<=100/a[i]) cout<<"1"<<endl;
			else {
				if((t-sum)%(100/a[i])!=0) m-=(t-sum)%(100/a[i]);
				cout<<(t-sum)/a[i]+1<<endl;
			}
		}
	}
	return 0;
}