Uva 256 - Quirksome Squares

 1  /*
 2  Problem link
 3  Type: Complete Search
 4  Algorithm:
 5      Just do as it says
 6  */

UVa 11565 - Simple Equations

 1  /*
 2  Problem link
 3  Type: Complete Search
 4  Algorithm:

UVa 154 - Recycling

 1  /*
 2  Problem link
 3  Type: Complete search
 4  Algorithm:

uva 410 - Station Balance

  1 /*
  2  Problem link
  3  Type: Recursion - Greedy
  4  Algorithm:

uva 216 - Getting in Line

  1 /*
  2  Problem link
  3  Type: DP - TSP
  4  Algorithm: Brute force, back-tracking
  5  */

uva 140 - Bandwidth

/*

Problem link

Type: Ad hoc

Algorithm: Complete search

*/ 

uva 471 - Magic Numbers

I still dont know why this approach got AC. Try N = 5 and it's 

definitely got TLE. I tried to approach this problem by recursive backtracking but it got TLE, although it is faster for some single test cases.

Problem link

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
const long long maxn = 9876543210;

uva 386 - Perfect Cubes

Problem link

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
using namespace std;
const double eps = 1E-9;
//-----------------------------
class ans { public: int a; int b; int c; int d;};
//-----------------------------
ans kq[225];