Advertisement
Guest User

Untitled

a guest
Jan 18th, 2020
83
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.64 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int s[11],b[11];
  5.  
  6. int pow(int n){
  7. int a=1;
  8. for(int i=1;i<=n;i++) a=a*2;
  9. return a;
  10. }
  11.  
  12. int main(){
  13.  
  14. int n,mn=1000000001;
  15. scanf("%d",&n);
  16. for(int i=1;i<=n;i++) scanf("%d %d",&s[i],&b[i]);
  17.  
  18. for(int i=1;i<=pow(n)-1;i++){
  19. int x=i;
  20. int sr=1,bt=0,j=1;
  21. while(x>0){
  22. if(x&1==true) {
  23. sr=sr*s[j];
  24. bt=bt+b[j];
  25. }
  26. j++;
  27. x=x>>1;
  28. }
  29.  
  30. int d=sr-bt;
  31. if(d<0) d=d*(-1);
  32.  
  33. if(d<mn) mn=d;
  34. }
  35. printf("%d",mn);
  36.  
  37. return 0;
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement