Skip to content

Instantly share code, notes, and snippets.

View luizribeiro's full-sized avatar

Luiz Ribeiro luizribeiro

View GitHub Profile
diff --git a/third-party/cmake/BuildLuarocks.cmake b/third-party/cmake/BuildLuarocks.cmake
index 2f83cb8..34667d4 100644
--- a/third-party/cmake/BuildLuarocks.cmake
+++ b/third-party/cmake/BuildLuarocks.cmake
@@ -19,7 +19,7 @@ ExternalProject_Add(luarocks
-P ${CMAKE_CURRENT_SOURCE_DIR}/cmake/DownloadAndExtractFile.cmake
BUILD_IN_SOURCE 1
CONFIGURE_COMMAND ${DEPS_BUILD_DIR}/src/luarocks/configure
- --prefix=${DEPS_INSTALL_DIR} --force-config ${LUAROCKS_OPTS}
+ --prefix=${DEPS_INSTALL_DIR} ${LUAROCKS_OPTS}
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <cstring>
long long dp[16][128];
long long doit(int n, int k) {
if(k < 0) return 0;
long long &ans = dp[n][k];
if(ans != -1) return ans;
ans = 0;
if(k == 0) return ans = 1;
#include <cstdio>
#include <set>
#include <cstring>
using namespace std;
#define NN 32
int T;
int n, k;
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
#define NN 200024
int n, root;
vector< pair<int, int> > adj[NN];
#include <cstdio>
#define CC 1024
int T;
int c;
long long a[CC][10], sum[CC];
long long ans;
template<class _T> _T gcd(_T a, _T b) { return a ? gcd(b%a, a) : b; }
#include <cstdio>
#define NN 10024
int n, a[NN];
bool isWavio(int N) {
int L, x[NN], i;
// check increasing
L = 0;
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define NN 128
#define MM (NN*512)
int T, n;
#include <cstdio>
#include <cstring>
#define NN 10024
#define KK 128
int T, n, k;
int a[NN];
bool dp[NN][KK]; // dp[i][j] = true if can sum j (mod k) with elements 0..i
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cassert>
using namespace std;
#define NN 128
#define MM (NN*512)