haha

Author: Jie Feng

.gitignore

@@ -0,0 +1 @@
+codeforces/in

codeforces/.makefile.swp

@@ -0,0 +1,100 @@
+#include <cmath>
+#include <set>
+#include <list>
+#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}};
+int main ( int argc, char *argv[] ) {
+    wez2(n,k);
+    if (k*n > (n-1)*n/2){
+        printf("-1\n");
+    }else{
+        printf("%d\n", n*k);
+        FE(i,1,n){
+            FE(j,i+1,i+k){
+                if (j <= n)
+                    printf("%d %d\n", i, j);
+                else
+                    printf("%d %d\n", i, j-n);
+            }
+        }
+    }
+    return EXIT_SUCCESS;
+}

codeforces/418A

@@ -0,0 +1,125 @@
+#include <cmath>
+#include <set>
+#include <list>
+#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}};
+struct node{
+    ll money, monitor, solve;
+}a[100];
+ll f[2][1 << 20];
+ll n,k,b;
+ll solve(ll M){
+    clr(f, -1);
+    ll KK = 1 << k;
+    f[0][0] = f[1][0] =  0;
+    for (ll i = 0; i < n; i++) if (a[i].monitor <= M){
+        for (ll s = 0; s < KK; s++) if (f[0][s] != -1){
+            ll t = s | a[i].solve;
+            if (f[1][t] == -1 || f[0][s] + a[i].money < f[1][t])
+                f[1][t] = a[i].money + f[0][s];
+        }
+        memcpy(f[0], f[1], sizeof(f[0]));
+    }
+    if (f[0][KK-1] == -1) return LONG_LONG_MAX;
+    else return f[0][KK-1] + b * M;
+}
+int  main( int argc, char *argv[] ) {
+    cin >> n >> k >> b;
+    for (ll i = 0; i < n; i++){
+        ll num;
+        cin >> a[i].money >> a[i].monitor >> num;
+        a[i].solve = 0;
+        F(j,0,num){
+            wez(x);
+            x--;
+            a[i].solve |= 1 << x;
+        }
+    }
+    ll minM = LONG_LONG_MAX;
+    set<ll> visited;
+    for (ll i = 0; i < n; i++) if (visited.find(a[i].monitor) == visited.end()){
+        visited.insert(a[i].monitor);
+        minM = min(minM, solve(a[i].monitor));
+    }
+    if (minM == LONG_LONG_MAX) cout << -1 << endl;
+    else cout << minM << endl;
+    return EXIT_SUCCESS;
+}

codeforces/418A.cpp

@@ -0,0 +1,119 @@
+#include <cmath>
+#include <set>
+#include <list>
+#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}};
+#define N 10000
+bool vis[N+1];
+vector<int> a[N+1];
+int sqrt(int x, int y){
+    return sqrt(x*x+y*y);
+}
+bool searchPath(vector<int>&path, int lev, int x){
+    if (lev == path.size()) return true;
+    for (int i = 0; i < a[x].size(); i++){
+        int y = a[x][i];
+        path[lev] = a[x][i];
+        if (searchPath(path, lev+1, sqrt(x,y))) return true;
+    }
+    return false;
+}
+int main ( int argc, char *argv[] ) {
+    int n, m;
+    cin  >> n >> m;
+    FE(i,1,10000)
+        FE(j,i+1,10000){
+        int x = sqrt(i*i+j*j);
+        if (x*x == i*i + j*j){
+            a[i].push_back(j);
+            a[j].push_back(i);
+        }
+    }
+    vector<int> path1(n), path2(m);
+
+    path1[0] = 3;
+    searchPath(path1, 1, 3);
+    path2[0] = 3;
+    searchPath(path2, 1, 3);
+    printV(path1);
+    printV(path2);
+    return EXIT_SUCCESS;
+}