Compilare: user.cpp: In function ‘bool check(long long int)’: user.cpp:4:370: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] using namespace std;int a[110][25010],N,M,R;long long C;vector<long long>sums;inline bool cmp(long long a,long long b){return a>b;}inline bool check(long long maxfruct){long long sum=0;for(int i=1;i<=N;i++){long long nowsum=0;for(int j=1;j<=M&&a[i][j]<=maxfruct;j++)nowsum+=a[i][j];sums.push_back(nowsum);}sort(sums.begin(),sums.end(),cmp);for(int i=0;i<R&&i<sums.size();i++)sum+=sums[i];sums.clear();return sum>=C;}long long bs(long long st,long long dr){long long med,last=dr;while(st<=dr){med=(st+dr)/2;if(check(med)){last=med;dr=med-1;}else st=med+1;}return last;}int main(){freopen("livada3.in","r",stdin);freopen("livada3.out","w",stdout);scanf("%d%d%lld%d",&N,&M,&C,&R);long long x,y,z,w,u;scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&w,&u);int maxim=-1;int minim=(1LL<<31)-1;for(int i=1;i<=M;i++){scanf("%d",&a[1][i]);maxim=max(maxim,a[1][i]);minim=min(minim,a[1][i]);}for(int i=2;i<=N;i++){scanf("%d",&a[i][1]);maxim=max(maxim,a[i][1]);minim=min(minim,a[i][1]);}for(int i=2;i<=N;i++)for(int j=2;j<=M;j++){a[i][j]=1LL*(1LL*x*a[i-1][j]+1LL*y*a[i][j-1]+1LL*z*a[i-1][j-1]+1LL*w)%u;maxim=max(maxim,a[i][j]);minim=min(minim,a[i][j]);}printf("%lld\n",bs(minim,maxim));} ^ user.cpp: In function ‘int main()’: user.cpp:4:611: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int a[110][25010],N,M,R;long long C;vector<long long>sums;inline bool cmp(long long a,long long b){return a>b;}inline bool check(long long maxfruct){long long sum=0;for(int i=1;i<=N;i++){long long nowsum=0;for(int j=1;j<=M&&a[i][j]<=maxfruct;j++)nowsum+=a[i][j];sums.push_back(nowsum);}sort(sums.begin(),sums.end(),cmp);for(int i=0;i<R&&i<sums.size();i++)sum+=sums[i];sums.clear();return sum>=C;}long long bs(long long st,long long dr){long long med,last=dr;while(st<=dr){med=(st+dr)/2;if(check(med)){last=med;dr=med-1;}else st=med+1;}return last;}int main(){freopen("livada3.in","r",stdin);freopen("livada3.out","w",stdout);scanf("%d%d%lld%d",&N,&M,&C,&R);long long x,y,z,w,u;scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&w,&u);int maxim=-1;int minim=(1LL<<31)-1;for(int i=1;i<=M;i++){scanf("%d",&a[1][i]);maxim=max(maxim,a[1][i]);minim=min(minim,a[1][i]);}for(int i=2;i<=N;i++){scanf("%d",&a[i][1]);maxim=max(maxim,a[i][1]);minim=min(minim,a[i][1]);}for(int i=2;i<=N;i++)for(int j=2;j<=M;j++){a[i][j]=1LL*(1LL*x*a[i-1][j]+1LL*y*a[i][j-1]+1LL*z*a[i-1][j-1]+1LL*w)%u;maxim=max(maxim,a[i][j]);minim=min(minim,a[i][j]);}printf("%lld\n",bs(minim,maxim));} ^ user.cpp:4:645: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int a[110][25010],N,M,R;long long C;vector<long long>sums;inline bool cmp(long long a,long long b){return a>b;}inline bool check(long long maxfruct){long long sum=0;for(int i=1;i<=N;i++){long long nowsum=0;for(int j=1;j<=M&&a[i][j]<=maxfruct;j++)nowsum+=a[i][j];sums.push_back(nowsum);}sort(sums.begin(),sums.end(),cmp);for(int i=0;i<R&&i<sums.size();i++)sum+=sums[i];sums.clear();return sum>=C;}long long bs(long long st,long long dr){long long med,last=dr;while(st<=dr){med=(st+dr)/2;if(check(med)){last=med;dr=med-1;}else st=med+1;}return last;}int main(){freopen("livada3.in","r",stdin);freopen("livada3.out","w",stdout);scanf("%d%d%lld%d",&N,&M,&C,&R);long long x,y,z,w,u;scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&w,&u);int maxim=-1;int minim=(1LL<<31)-1;for(int i=1;i<=M;i++){scanf("%d",&a[1][i]);maxim=max(maxim,a[1][i]);minim=min(minim,a[1][i]);}for(int i=2;i<=N;i++){scanf("%d",&a[i][1]);maxim=max(maxim,a[i][1]);minim=min(minim,a[i][1]);}for(int i=2;i<=N;i++)for(int j=2;j<=M;j++){a[i][j]=1LL*(1LL*x*a[i-1][j]+1LL*y*a[i][j-1]+1LL*z*a[i-1][j-1]+1LL*w)%u;maxim=max(maxim,a[i][j]);minim=min(minim,a[i][j]);}printf("%lld\n",bs(minim,maxim));} ^ user.cpp:4:677: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int a[110][25010],N,M,R;long long C;vector<long long>sums;inline bool cmp(long long a,long long b){return a>b;}inline bool check(long long maxfruct){long long sum=0;for(int i=1;i<=N;i++){long long nowsum=0;for(int j=1;j<=M&&a[i][j]<=maxfruct;j++)nowsum+=a[i][j];sums.push_back(nowsum);}sort(sums.begin(),sums.end(),cmp);for(int i=0;i<R&&i<sums.size();i++)sum+=sums[i];sums.clear();return sum>=C;}long long bs(long long st,long long dr){long long med,last=dr;while(st<=dr){med=(st+dr)/2;if(check(med)){last=med;dr=med-1;}else st=med+1;}return last;}int main(){freopen("livada3.in","r",stdin);freopen("livada3.out","w",stdout);scanf("%d%d%lld%d",&N,&M,&C,&R);long long x,y,z,w,u;scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&w,&u);int maxim=-1;int minim=(1LL<<31)-1;for(int i=1;i<=M;i++){scanf("%d",&a[1][i]);maxim=max(maxim,a[1][i]);minim=min(minim,a[1][i]);}for(int i=2;i<=N;i++){scanf("%d",&a[i][1]);maxim=max(maxim,a[i][1]);minim=min(minim,a[i][1]);}for(int i=2;i<=N;i++)for(int j=2;j<=M;j++){a[i][j]=1LL*(1LL*x*a[i-1][j]+1LL*y*a[i][j-1]+1LL*z*a[i-1][j-1]+1LL*w)%u;maxim=max(maxim,a[i][j]);minim=min(minim,a[i][j]);}printf("%lld\n",bs(minim,maxim));} ^ user.cpp:4:742: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int a[110][25010],N,M,R;long long C;vector<long long>sums;inline bool cmp(long long a,long long b){return a>b;}inline bool check(long long maxfruct){long long sum=0;for(int i=1;i<=N;i++){long long nowsum=0;for(int j=1;j<=M&&a[i][j]<=maxfruct;j++)nowsum+=a[i][j];sums.push_back(nowsum);}sort(sums.begin(),sums.end(),cmp);for(int i=0;i<R&&i<sums.size();i++)sum+=sums[i];sums.clear();return sum>=C;}long long bs(long long st,long long dr){long long med,last=dr;while(st<=dr){med=(st+dr)/2;if(check(med)){last=med;dr=med-1;}else st=med+1;}return last;}int main(){freopen("livada3.in","r",stdin);freopen("livada3.out","w",stdout);scanf("%d%d%lld%d",&N,&M,&C,&R);long long x,y,z,w,u;scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&w,&u);int maxim=-1;int minim=(1LL<<31)-1;for(int i=1;i<=M;i++){scanf("%d",&a[1][i]);maxim=max(maxim,a[1][i]);minim=min(minim,a[1][i]);}for(int i=2;i<=N;i++){scanf("%d",&a[i][1]);maxim=max(maxim,a[i][1]);minim=min(minim,a[i][1]);}for(int i=2;i<=N;i++)for(int j=2;j<=M;j++){a[i][j]=1LL*(1LL*x*a[i-1][j]+1LL*y*a[i][j-1]+1LL*z*a[i-1][j-1]+1LL*w)%u;maxim=max(maxim,a[i][j]);minim=min(minim,a[i][j]);}printf("%lld\n",bs(minim,maxim));} ^ user.cpp:4:820: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int a[110][25010],N,M,R;long long C;vector<long long>sums;inline bool cmp(long long a,long long b){return a>b;}inline bool check(long long maxfruct){long long sum=0;for(int i=1;i<=N;i++){long long nowsum=0;for(int j=1;j<=M&&a[i][j]<=maxfruct;j++)nowsum+=a[i][j];sums.push_back(nowsum);}sort(sums.begin(),sums.end(),cmp);for(int i=0;i<R&&i<sums.size();i++)sum+=sums[i];sums.clear();return sum>=C;}long long bs(long long st,long long dr){long long med,last=dr;while(st<=dr){med=(st+dr)/2;if(check(med)){last=med;dr=med-1;}else st=med+1;}return last;}int main(){freopen("livada3.in","r",stdin);freopen("livada3.out","w",stdout);scanf("%d%d%lld%d",&N,&M,&C,&R);long long x,y,z,w,u;scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&w,&u);int maxim=-1;int minim=(1LL<<31)-1;for(int i=1;i<=M;i++){scanf("%d",&a[1][i]);maxim=max(maxim,a[1][i]);minim=min(minim,a[1][i]);}for(int i=2;i<=N;i++){scanf("%d",&a[i][1]);maxim=max(maxim,a[i][1]);minim=min(minim,a[i][1]);}for(int i=2;i<=N;i++)for(int j=2;j<=M;j++){a[i][j]=1LL*(1LL*x*a[i-1][j]+1LL*y*a[i][j-1]+1LL*z*a[i-1][j-1]+1LL*w)%u;maxim=max(maxim,a[i][j]);minim=min(minim,a[i][j]);}printf("%lld\n",bs(minim,maxim));} ^ user.cpp:4:914: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int a[110][25010],N,M,R;long long C;vector<long long>sums;inline bool cmp(long long a,long long b){return a>b;}inline bool check(long long maxfruct){long long sum=0;for(int i=1;i<=N;i++){long long nowsum=0;for(int j=1;j<=M&&a[i][j]<=maxfruct;j++)nowsum+=a[i][j];sums.push_back(nowsum);}sort(sums.begin(),sums.end(),cmp);for(int i=0;i<R&&i<sums.size();i++)sum+=sums[i];sums.clear();return sum>=C;}long long bs(long long st,long long dr){long long med,last=dr;while(st<=dr){med=(st+dr)/2;if(check(med)){last=med;dr=med-1;}else st=med+1;}return last;}int main(){freopen("livada3.in","r",stdin);freopen("livada3.out","w",stdout);scanf("%d%d%lld%d",&N,&M,&C,&R);long long x,y,z,w,u;scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&w,&u);int maxim=-1;int minim=(1LL<<31)-1;for(int i=1;i<=M;i++){scanf("%d",&a[1][i]);maxim=max(maxim,a[1][i]);minim=min(minim,a[1][i]);}for(int i=2;i<=N;i++){scanf("%d",&a[i][1]);maxim=max(maxim,a[i][1]);minim=min(minim,a[i][1]);}for(int i=2;i<=N;i++)for(int j=2;j<=M;j++){a[i][j]=1LL*(1LL*x*a[i-1][j]+1LL*y*a[i][j-1]+1LL*z*a[i-1][j-1]+1LL*w)%u;maxim=max(maxim,a[i][j]);minim=min(minim,a[i][j]);}printf("%lld\n",bs(minim,maxim));} ^