Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int s[11],b[11];
- int pow(int n){
- int a=1;
- for(int i=1;i<=n;i++) a=a*2;
- return a;
- }
- int main(){
- int n,mn=1000000001;
- scanf("%d",&n);
- for(int i=1;i<=n;i++) scanf("%d %d",&s[i],&b[i]);
- for(int i=1;i<=pow(n)-1;i++){
- int x=i;
- int sr=1,bt=0,j=1;
- while(x>0){
- if(x&1==true) {
- sr=sr*s[j];
- bt=bt+b[j];
- }
- j++;
- x=x>>1;
- }
- int d=sr-bt;
- if(d<0) d=d*(-1);
- if(d<mn) mn=d;
- }
- printf("%d",mn);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement