Ankur's Blog

let's start Code

UVA-10130

, No comments
Problem link: UVA-10130 Topic: Knapsack Solution: #include<bits/stdc++.h> using namespace std; int wt[12345], val[12345]; int Knapsack(int w, int wt[], int val[], int n) {     int k[n+1][w+1];     for(int i = 0; i <= n; i++)     {         for(int j = 0; j <= w; j++)    ...
Share:
Read More

UVA-10004

No comments
#include<bits/stdc++.h> using namespace std; int main() {     while(1)     {         int n,a;         cin >> n;         if(n == 0)         {             return 0;         }      ...
Share:
Read More

About

let's start CODE

Popular Posts

  • E-maxx training part - 01
                             Binary Exponentiation 1230 - MODEX              Solution 11029 - Leading and Trailing      Solution I...
  • 11029 - Leading and Trailing
    11029 - Leading and Trailing  Topic: Binary Exponentiation  
  • A - Frog 1
    A - Frog 1 Solution 01: IH19980412 //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 2...