- 博客(15)
- 收藏
- 关注
原创 CF 270 B - Design Tutorial: Learn from Life
#include#include#includeusing namespace std;int cmp(int a, int b){ return a > b;}int a[2005];int main(){ int n, k; while(~scanf("%d%d", &n, &k)) { for(int i = 1; i <
2014-09-29 21:17:52 828
原创 CF 270C - Design Tutorial: Make It Nondeterministic
#include#include#include#define N 100005using namespace std;string f[N], s[N];int main(){ int n; cin.sync_with_stdio(false); //ios::sync_with_stdio(0); while(cin >> n) {
2014-09-29 21:11:43 526
原创 大数模板
#include #include #includeusing namespace std;#define DIGIT 4 //四位隔开,即万进制#define DEPTH 10000 //万进制#define MAX 100typedef int bignum_t[MAX+1];/********************************
2014-09-28 13:42:18 431
原创 250 B. The Child and Set
#include#includeint a[100005];int lowbit(int x){ return x & (-x);}int main(){ int sum, lim; while(~scanf("%d%d", &sum, &lim)) { memset(a, 0, sizeof(a)); int a
2014-09-25 22:48:39 586
原创 CF 266 C. Number of Ways
C. Number of Waystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got array a[1], a[2], ..., a[n], consisting
2014-09-16 02:18:31 627
原创 hdu 1598
#include #include #include using namespace std;const int maxn = 205;const int maxm = 1005;const int inf = 0x3f3f3f3f;#define min(a,b) ((a)<(b)?(a):(b))int n, m, s, t;int ans;int fa[maxn
2014-09-05 22:50:55 562
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人