1樓:tefx
Stack Overflow Developer Survey 2015
你看,win7win8份額加起來大概50%,也就是說VS使用者份額應該遠低於50%。
那麼發現好多人不用VS不是很正常麼,有什麼好奇怪的啊。
2樓:蔣晟
因為題主對「牛人」的標準過低(自己乙個人就可以認得很多個,肯定不是國家級別的,頂多是省級或者市級),需要VS市場占有率增加到99.99%以上才可能出現所有程式設計「牛人」都喜歡用Microsoft Visual Studio情況。
但是VS市場占有率可能有99.99%麼?
所以這問題並沒有什麼用。
VS就是乙個工具而已,不是萬能藥。就算是一般人,也應該針對自己的不同需求使用最適合的工具,更不用說牛人了。
3樓:Belleve
ACM,呵呵
用過就丟的東西用得著上 VS 麼?
來看個 @唐飛虎 寫的題目答案:
#define LOCAL
/** ` Micro Mezzo Macro Flation -- Overheated Economy ., Ver 0.1 **/
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using
namespace
std;
#define REP(i, n__) for (int i=0;i
#define FOR(i, a, b) for (int i=int(a);i
#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)
#define REP_1(i, n__) for (int i=1;i<=int(n__);++i)
#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)
#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)
#define REP_C(i, n) for (int n____=int(n),i=0;i
#define FOR_C(i, a, b) for (int b____=int(b),i=a;i
#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)
#define REP_N(i, n) for (i=0;i
#define FOR_N(i, a, b) for (i=int(a);i
#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)
#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)
#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)
#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)
#define REP_1_N(i, n) for (i=1;i<=int(n);++i)
#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)
#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)
#define REP_C_N(i, n) for (n____=int(n),i=0;i
#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i
#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)
#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)
#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)
#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;i>=a____;--i)
//#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)
#define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it)
#define REP_S(it, str) for (char*it=str;*it;++it)
#define REP_G(it, u) for (int it=hd[u];it;it=suc[it])
#define DO(n) for ( int ____n ## __line__ = n; ____n ## __line
#define REP_2(i, j, n, m) REP(i, n) REP(j, m)
#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)
#define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l)
#define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l)
#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
#define CPY(A, B) memcpy(A, B, sizeof(A))
#define INS(A, P, B) A.insert(A.begin() + P, B)
#define ERS(A, P) A.erase(A.begin() + P)
#define BSC(A, X) find(ALL(A), X)
// != A.end()
#define CTN(T, x) (T.find(x) != T.end())
#define SZ(A) int(A.size())
#define PB push_back
#define MP(A, B) make_pair(A, B)
#define PTT pair
#define fi first
#define se second
#define Rush for(int ____T=RD(); ____T--;)
#define Display(A, n, m
REP(i, n
REP(j, m) cout << A[i][j] << " "
cout << endl
}#define Display_1(A, n, m
REP_1(i, n
REP_1(j, m) cout << A[i][j] << " "; \
cout << endl
}#pragma comment(linker, "/STACK:36777216")
//#pragma GCC optimize ("O2")
#define Ruby system("ruby main.rb")
#define Haskell system("runghc main.hs")
#define Python system("python main.py")
#define Pascal system("fpc main.pas")
typedef
long
longLL;
//typedef long double DB;
typedef
doubleDB;
typedef
unsigned
UINT
;typedef
unsigned
long
long
ULL;
typedef
vector
typedef
vector
>VC; typedef vector >VS; typedef vector typedef vector typedef set< int>SI; typedef set< string >SS; typedef set< LL>SL; typedef set< DB>SD; typedef map< int, int> MII; typedef map< string ,int >MSI; typedef map int> MLI; typedef map int> MDI; typedef pair int> PII; typedef pair bool >PIB; typedef pair LL>PLL; typedef vector VII; typedef vector typedef vector VVII ;template T>inlineT& RD(T& );template T>inline voidOT( constT& );inline LLRD ()inline char&RC (char&c )inline char RC() //inline char& RC(char &c) //inline char RC() inlineDB& RF(DB& x)inline DBRF ()inline char*RS (char*s )template class T1>inlineT0& RD(T0& x0,T1& x1)template classT1, class T2>inlineT0& RD(T0& x0,T1& x1,T2& x2)template classT1, classT2, class T3>inlineT0& RD(T0& x0,T1& x1,T2& x2,T3& x3)template classT1, classT2, classT3, class T4>inlineT0& RD(T0& x0,T1& x1,T2& x2,T3& x3,T4& x4)template classT1, classT2, classT3, classT4, class T5>inlineT0& RD(T0& x0,T1& x1,T2& x2,T3& x3,T4& x4,T5& x5)template classT1, classT2, classT3, classT4, classT5, class T6>inlineT0& RD(T0& x0,T1& x1,T2& x2,T3& x3,T4& x4,T5& x5,T6& x6)template class T1>inline voidOT( constT0& x0,constT1& x1)template classT1, class T2>inline voidOT( constT0& x0,constT1& x1,constT2& x2)template classT1, classT2, class T3>inline voidOT( constT0& x0,constT1& x1,constT2& x2,constT3& x3)template classT1, classT2, classT3, class T4>inline voidOT( constT0& x0,constT1& x1,constT2& x2,constT3& x3,constT4& x4)template classT1, classT2, classT3, classT4, class T5>inline voidOT( constT0& x0,constT1& x1,constT2& x2,constT3& x3,constT4& x4,constT5& x5)template classT1, classT2, classT3, classT4, classT5, class T6>inline voidOT( constT0& x0,constT1& x1,constT2& x2,constT3& x3,constT4& x4,constT5& x5,constT6& x6)inline char&RC (char&a ,char&b )inline char&RC (char&a ,char&b ,char&c )inline char&RC (char&a ,char&b ,char&c ,char&d )inline char&RC (char&a ,char&b ,char&c ,char&d ,char&e )inline char&RC (char&a ,char&b ,char&c ,char&d ,char&e ,char&f )inline char&RC (char&a ,char&b ,char&c ,char&d ,char&e ,char&f ,char&g )inlineDB& RF(DB& a,DB& b)inlineDB& RF(DB& a,DB& b,DB& c)inlineDB& RF(DB& a,DB& b,DB& c,DB& d)inlineDB& RF(DB& a,DB& b,DB& c,DB& d,DB& e)inlineDB& RF(DB& a,DB& b,DB& c,DB& d,DB& e,DB& f)inlineDB& RF(DB& a,DB& b,DB& c,DB& d,DB& e,DB& f,DB& g)inline voidRS( char*s1 ,char*s2 )inline voidRS( char*s1 ,char*s2 ,char*s3 )template T>inline void RST(T& A)template class T1>inline void RST(T0& A0,T1& A1)template classT1, class T2>inline void RST(T0& A0,T1& A1,T2& A2)template classT1, classT2, class T3>inline void RST(T0& A0,T1& A1,T2& A2,T3& A3)template classT1, classT2, classT3, class T4>inline void RST(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4)template classT1, classT2, classT3, classT4, class T5>inline void RST(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4,T5& A5)template classT1, classT2, classT3, classT4, classT5, class T6>inline void RST(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4,T5& A5,T6& A6)template T>inline void FLC(T& A,intx )template class T1>inline void FLC(T0& A0,T1& A1,intx )template classT1, class T2>inline void FLC(T0& A0,T1& A1,T2& A2,intx )template classT1, classT2, class T3>inline void FLC(T0& A0,T1& A1,T2& A2,T3& A3,intx )template classT1, classT2, classT3, class T4>inline void FLC(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4,intx )template classT1, classT2, classT3, classT4, class T5>inline void FLC(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4,T5& A5,intx )template classT1, classT2, classT3, classT4, classT5, class T6>inline void FLC(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4,T5& A5,T6& A6,intx )template T>inline void CLR( priority_queue T>inline void CLR( priority_queue T>inline void CLR(T& A)template class T1>inline void CLR(T0& A0,T1& A1)template classT1, class T2>inline void CLR(T0& A0,T1& A1,T2& A2)template classT1, classT2, class T3>inline void CLR(T0& A0,T1& A1,T2& A2,T3& A3)template classT1, classT2, classT3, class T4>inline void CLR(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4)template classT1, classT2, classT3, classT4, class T5>inline void CLR(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4,T5& A5)template classT1, classT2, classT3, classT4, classT5, class T6>inline void CLR(T0& A0,T1& A1,T2& A2,T3& A3,T4& A4,T5& A5,T6& A6)template T>inline void CLR(T& A,intn )template T>inlineT& SRT(T& A)template class C>inlineT& SRT(T& A,CB )// <<= ` 0. Daily Use ., template T>inline void checkMin(T &a,constTb )template T>inline void checkMax(T &a,constTb )template T>inline void checkMin(T &a,T &b,constTx )template T>inline void checkMax(T &a,T &b,constTx )template class C>inline void checkMin(T &a,constTb ,Cc) template class C>inline void checkMax(T &a,constTb ,Cc) template T>inline Tmin(T a,Tb ,Tc) template T>inline Tmax(T a,Tb ,Tc) template T>inline Tmin(T a,Tb ,Tc, Td)template T>inline Tmax(T a,Tb ,Tc, Td)template T>inline Tsqr(T a)template T>inline Tcub(T a)inline intCeil (intx, inty )// <<= ` 1. Bitwise Operation ., namespace BOinline bool_1( LLx,inti) inline LL_1 (inti) inline LL_U (inti); inline intreverse_bits (intx) inline LLreverse_bits(LL x)template T>inline bool odd(Tx )template T>inline Tlow_bit(T x)template T>inline Thigh_bit(T x)template T>inline Tcover_bit(T x)inline intlow_idx (intx) inline intlow_idx(LL x)inline inthigh_idx (intx) inline inthigh_idx(LL x)inline intclz (intx) inline intclz(LL x)inline intctz (intx) inline intctz(LL x)inline intparity (intx) inline intparity(LL x)inline intlg2 (inta) inline intcount_bits (intx) inline intcount_bits(LL x)}using namespaceBO; template T>inlineT& RD(T& x)int____Case ;template T>inline voidOT( constT& x)const intN =5e4+19 ;inta[ N],n ,Q;const intM =1e6+9 ;intqx, qy;namespace Persistent_tree intupdate (intrt, intp ,intd) elsec[ nrt]=c [rt]+ d;}return root;} intquery (intrt) else }return res; // + c[rt];}}; #define PT Persistent_tree namespace BITx=y ;}intlsum (intrt) intquery (intl, intr)}; intPre[N ];SIH[ M];SI:: iterator iter ;int main ()PT ::pre[0 ]=Null ;REP_1(i ,n)PT ::pre[i ]=PT:: update(PT ::pre[i -1], Pre[i] ,1);charop; DO(Q) elseOT( BT:: query(qx ,qy));}} 張杰和謝娜剛在一起的時候,上快本,何老師調侃,他會臉紅,會害羞,成年男人的害羞很珍貴啊,以至於全網說他吃軟飯,我都覺得這個男生應該可以,可是現在看他上綜藝,上節目滿臉油膩和嘚瑟,一副我功成名就是因為我本身有才華,而不是因為謝娜,不是謝娜,你哪來的資源,哪來的機會 半耳 從謝娜那裡來 特地搜有沒有這個... 不舉鐵的舉鐵 非常不喜歡!要演技沒演技,沒有乙個劇拿得出手!也不敬業,之前那個綜藝又是坐車又是住酒店的,要不就說自己來姨媽吧啦吧啦 情商低,還說賈玲 蠢 除了臉真的一無是處,從嫩模到現在一線,摳圖不自賞幾千萬的片酬她配拿麼? 阿倫戴爾柳小七 因為他們被傲慢和偏見遮住了眼了。謠言也好,謊言也好,要麼短... 常在河邊走,哪有不濕鞋?很多女人自認為自己酒量如何如何的棒.但是其實喝醉乙個人是一件很容易的事情.其實,這類似的事情並不少見.女人,少出入這些場所.當你覺得久經沙場的時候.其實很多老油條虎視眈眈的謀劃著.如果某一天你真的失身了.你覺得對得起你男朋友麼?酒吧 夜場 KTV.其實充斥著各類尋找夜晚激情的...為什麼好多人不喜歡張杰?
為什麼感覺好多人不喜歡Angelababy?
為什麼好多人不喜歡銷售女