haha

Author: Jie Feng

codeforces/'

@@ -10,8 +10,8 @@
 #include <set>
 #include <cstdlib>
 #include <fstream>
-#include <iomanip>   
-#include <iostream>  
+#include <iomanip>
+#include <iostream>
 #include <sstream>  // istringstream buffer(myString);
 #include <stack>
 #include <algorithm>
@@ -69,19 +69,19 @@ inline void pisz(int n) { printf("%d\n",n); }
 #define printV(a) printA(a,0,(int)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(auto 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()) 
+#define sz(a) int((a).size())
+#define pb push_back
+#define all(c) (c).begin(),(c).end()
+#define tr(c,i) for(auto 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())
 template<class T> string tos(T n) { stringstream ss; ss << n; return ss.str(); }
 #define tiny (double)1e-13
 #define close(x,y) (abs(x-y)<tiny)
 typedef int elem_t;
-typedef vector<int> vi; 
-typedef vector<vi> vvi; 
-typedef pair<int,int> ii; 
+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;}
@@ -107,7 +107,7 @@ int diff(int t, int t1){
 int main ( int argc, char *argv[] ) {
     cin >> n >> m >> k >> w;
 
-    FE(t,1,k){ 
+    FE(t,1,k){
         F(i, 0, n) getS(L[t][i]);
         cc[t][0] = cc[0][t] = n*m;
         F(t1, 1, t){
@@ -143,12 +143,3 @@ int main ( int argc, char *argv[] ) {
     cout << output.str() << endl;
     return EXIT_SUCCESS;
 }
-
-
-
-
-
-
-
-
-

codeforces/436C.cpp

@@ -0,0 +1,105 @@
+#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 lowb(t) (t &(-t))
+#define pow2(x) (1<<x)
+//#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 root(x) ((int)sqrt((double)x))
+#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,(int)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(auto 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()) 
+template<class T> string tos(T n) { stringstream ss; ss << n; return ss.str(); }
+#define tiny (double)1e-13
+#define close(x,y) (abs(x-y)<tiny)
+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;}
+double p[101];
+int main ( int argc, char *argv[] ) {
+    wez(n);
+    F(i,0,n) cin >> p[i];
+    sort(p, p+n);
+    double p0 = 1, p1 = 0;
+    for (int i = n-1; i >= 0; i--) if(p0 > p1){
+        double pT  = p0 * p[i] + p1 * (1-p[i]);
+        //p0 * p[i] + p1 * (1-p[i]) > p1
+        //p0  > p1 
+        p1 = pT;
+        p0 = p0 * (1 - p[i]);
+    }
+    printf("%.14lf\n", p1);
+    return EXIT_SUCCESS;
+}

codeforces/442B

@@ -0,0 +1,128 @@
+#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 lowb(t) (t &(-t))
+#define pow2(x) (1<<x)
+//#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 root(x) ((int)sqrt((double)x))
+#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,(int)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(auto 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()) 
+template<class T> string tos(T n) { stringstream ss; ss << n; return ss.str(); }
+#define tiny (double)1e-13
+#define close(x,y) (abs(x-y)<tiny)
+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;}
+#define N 1000009
+int n;
+vector<int> sons[N];
+int fa[N];
+int br[N];
+int main ( int argc, char *argv[] ) {
+    clr(fa, 0);
+    clr(br, 0);
+    cin >> n;
+    int maxBr = 0;
+    FE(i,2,n+1){
+        wez(x);
+        fa[i] = x;
+        sons[x].push_back(i);
+        while(x != 0){
+            int cnt = 0;
+            int b = -1;
+            F(j,0,sons[x].size()){
+                int s = sons[x][j];
+                if (br[s] > b){
+                    b = br[s];
+                    cnt = 1;
+                }else if (br[s] == b){
+                    cnt++;
+                }
+            }
+            if (cnt > 1)
+                br[x] = b+1;
+            else br[x] = b;
+            x = fa[x];
+        }
+
+        if (br[1] == 0) cout << 1;
+        else cout << br[1];
+        if (i == n+1) cout << endl;
+        else cout << ' ';
+    }
+    return EXIT_SUCCESS;
+}

codeforces/442B.cpp

@@ -1,6 +1,2 @@
-5 3
-0 2 4
-1 3 1
-0 8 3
-0 20 10
-1 5 5
+11
+1 1 1 3 4 4 7 3 7 6 6

codeforces/442B.o

@@ -1,4 +1,4 @@
-target= 436A
+target= 442D
 
 all:
 	g++ -o $(target) -g $(target).cpp -w