UVA 11057 - Exact Sum UVA • Sep 1, 2020 Problem PDFSolution:/****************************************************************** *** Problewm : *** *** Author : Shipu Ahamed (Psycho Timekiller) *** *** E-mail : [email protected] *** *** University : BUBT,Dept. of CSE *** *** Team : BUBT_Psycho *** *** My Blog : http://shipuahamed.blogspot.com *** *** Facebook : http://www.facebook.com/DeesheharaShipu *** ******************************************************************/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define sc scanf #define pf printf #define ll long long #define pi 2*acos(0.0) #define ull unsigned long long #define all(v) v.begin(),v.end() #define sii(t) scanf("%d",&t) #define sll(t) scanf("%lld",&t) #define ssii(a,b) scanf("%d%d",&a,&b) #define ssll(a,b) scanf("%lld%lld",&a,&b) #define Case(no) printf("Case %d: ",++no) #define nl puts("") #define P(a) printf("%d\n",a) #define PL(a) printf("%lld\n",a) #define PN(a) printf("%d ",a) #define PLN(a) printf("%lld ",a) #define CP(a) cout<=0;i--) { if(a[i]dis) { book1=res1; book2=res2; ans=dis; } } cout<<"Peter should buy books whose prices are "<https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11057/11057.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read