haha

Author: Jie Feng

.gitignore

@@ -1 +1,5 @@
+<<<<<<< HEAD
 try.cpp
+=======
+codeforces/in
+>>>>>>> 8ea67614540813d9826e3c029eb36e4cc7116fb2

careercup/5145759489982464.cpp

@@ -0,0 +1,19 @@
+/*
+ * =====================================================================================
+ *
+ *       Filename:  5145759489982464.cpp
+ *
+ *    Description:  
+ *
+ *        Version:  1.0
+ *        Created:  04/25/2014 12:10:15 AM
+ *       Revision:  none
+ *       Compiler:  gcc
+ *
+ *         Author:  Jie Feng (http://hey.i-feng.org/), [email protected]
+ *   Organization:  
+ *
+ * =====================================================================================
+ */
+
+

careercup/leetcode.h

@@ -0,0 +1,143 @@
+#include <cmath>
+#include <set>
+#include <list>
+#include <unordered_set>
+#include <hash_map>
+#include <climits>
+#include <queue>
+#include <vector>
+#include <map>
+#include <set>
+#include <cstdlib>
+#include <fstream>
+#include <iomanip>   
+#include <iostream>  
+#include <sstream>  // istringstream buffer(myString);
+#include <stack>
+#include <algorithm>
+#include <cstring>
+#include <cassert>
+using namespace std;
+#define bit(x,i) (x&(1<<i))
+#define lowbit(x) ((x)&((x)^((x)-1)))
+//#define max(a,b) (a<b?b:a)
+//#define abs(x) (x<0?-x:x)
+#define IN(i,l,r) (l<i&&i<r)
+#define LINR(i,l,r) (l<=i&&i<=r)
+#define LIN(i,l,r) (l<=i&&i<r)
+#define INR(i,l,r) (l<i&&i<r)
+#define F(i,L,R) for (int i = L; i < R; i++)
+#define FE(i,L,R) for (int i = L; i <= R; i++)
+#define FF(i,L,R) for (int i = L; i > R; i--)
+#define FFE(i,L,R) for (int i = L; i >= R; i--)
+#define char2Int(c) (c-'0')
+#define lastEle(vec) vec[vec.size()-1]
+#define hBit(msb,n) asm("bsrl %1,%0" : "=r"(msb) : "r"(n))
+#define clr(a,x) memset(a,x,sizeof(a))
+#define getI(a) scanf("%d", &a)
+#define getII(a,b) scanf("%d%d", &a, &b)
+#define getIII(a,b,c) scanf("%d%d%d", &a, &b, &c)
+#define getS(x) scanf("%s", x);
+#define SZ(x) ((int)((x).size()))
+#define REMAX(a,b) (a)=max((a),(b));
+#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;
+#define REMIN(a,b) (a)=min((a),(b));
+#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
+#define ALL(t) t.begin(),t.end()
+#define ll long long
+#define ull unsigned long long
+#define ui unsigned int
+#define us unsigned short
+#define IOS ios_base::sync_with_stdio(0);
+#define pb push_back
+#define INF 1001001001
+#define PI 3.1415926535897932384626
+#define mp make_pair
+#define ll long long
+#define fi first
+#define se second
+#define wez(n) int (n); scanf("%d",&(n));
+#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));
+#define wez3(n,m,k) int (n),(m),(k); scanf("%d %d %d",&(n),&(m),&(k));
+inline void pisz(int n) { printf("%d\n",n); }
+#define TESTS wez(testow)while(testow--)
+#define whileZ int T; getI(T); while(T--)
+#define printA(a,L,R) FE(i,L,R) cout << a[i] << (i==R?'\n':' ')
+#define printM(a,n,m) F(i,0,n){ F(j,0,m) cout << a[i][j] << ' '; cout << endl;}
+#define printV(a) printA(a,0,a.size()-1);
+#define printVV(a) F(i,0,a.size()) {F(j,0,a[i].size())cout << a[i][j] << ' '; cout << endl;}
+#define MAXN 10000
+#define sz(a) int((a).size()) 
+#define pb push_back 
+#define all(c) (c).begin(),(c).end() 
+#define tr(c,i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++) 
+#define present(c,x) ((c).find(x) != (c).end()) 
+#define cpresent(c,x) (find(all(c),x) != (c).end()) 
+typedef int elem_t;
+typedef vector<int> vi; 
+typedef vector<vi> vvi; 
+typedef pair<int,int> ii; 
+template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
+template<typename T> ostream& operator<<(ostream &s,vector<T> t){F(i,0,SZ(t))s<<t[i]<<" ";return s; }
+int gcd(int a,int b){return a?gcd(b%a,a):b;}
+ll gcd(ll a,ll b){return a?gcd(b%a,a):b;}
+ll powmod(ll a,ll p,ll m){ll r=1;while(p){if(p&1)r=r*a%m;p>>=1;a=a*a%m;}return r;}
+const int fx[4][2] = {{0,1}, {1,0}, {0,-1}, {-1,0}};
+using namespace std;
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+};
+
+struct ListNode {
+    int val;
+    ListNode *next;
+    ListNode(int x) : val(x), next(NULL) {}
+};
+
+struct Interval {
+    int start;
+    int end;
+    Interval() : start(0), end(0) {}
+    Interval(int s, int e) : start(s), end(e) {}
+};
+
+void printIntervals(vector<Interval> i){
+    F(j,0,i.size()){
+        cout << i[j].start << ' ' << i[j].end << endl;
+    }
+}
+void printTree(TreeNode* cur){
+    if (cur == NULL) return;
+    cout << cur->val << ' ';
+
+    if (cur->left == NULL) cout << "NULL" << ' ';
+    else {
+        cout << cur->left->val << ' ';
+    }
+
+    if (cur->right == NULL) cout << "NULL" << endl;
+    else {
+        cout << cur->right->val << endl;
+    }
+    printTree(cur->left);
+    printTree(cur->right);
+}
+void addNode(ListNode* &head, int x){
+    ListNode *a = new ListNode(x);
+    if (head == NULL){
+        head = a;
+    }else{
+        a->next = head;
+        head = a;
+    }
+}
+void printList(ListNode* head){
+    while(head != NULL){
+        cout << head->val << ' ';
+        head = head->next;
+    }
+    cout << endl;
+}

careercup/main

@@ -0,0 +1,33 @@
+#include "leetcode.h"
+void sort_like_wave(vector<int>& a){
+    bool rise = false;
+    for (int i = 0; i < a.size()-1; i++){
+        if (rise){
+            if (a[i] > a[i+1]) swap(a[i], a[i+1]);
+        }else{
+            if (a[i+1] > a[i]) swap(a[i], a[i+1]);
+        }
+    }
+}
+int min_seq_larger_than_sum(vector<int> &a, int sum){
+    int L = 0, R = 0, tempSum = a[0], minSeq = INT_MAX;
+    while(R < a.size()){
+        if (tempSum > sum){
+            minSeq = min(R-L+1, minSeq);
+            tempSum -= a[L];
+            L++;
+        } else{
+            R++;
+            if (R < a.size()){
+                tempSum += a[R];
+            }else break;
+        }
+    }
+    return (minSeq == INT_MAX? -1: minSeq);
+}
+int main()
+{
+    int num[] = {2,1,1,4,3,6};
+    vector<int> vnum(num, num+sizeof(num)/4);
+    cout << min_seq_larger_than_sum(vnum, 8) << endl;
+}

careercup/main.cpp

@@ -0,0 +1,18 @@
+#include "leetcode.h"
+void sort_like_wave(vector<int>& a){
+    bool rise = false;
+    for (int i = 0; i < a.size()-1; i++){
+        if (rise){
+            if (a[i] > a[i+1]) swap(a[i], a[i+1]);
+        }else{
+            if (a[i+1] > a[i]) swap(a[i], a[i+1]);
+        }
+    }
+}
+int main()
+{
+    int num[] = {10,1,2,7,6,1,5};
+    vector<int> vnum(num, num+sizeof(num)/4);
+    sort_like_wave(vnum);
+    printV(vnum);
+}