开发笔记:语法问题

pair p;p = {3,4};vectorv;v = {3,4,5,6};

tuple

tuple t;t = {1,2,3};int x = get(t);cout<builtin

int x = __builtin_ffs(16);//返回最低位1的位置int y = __builtin_ctz(16);//返回尾0的个数int z = __builtin_popcount(x);//返回1的个数

Output

for(i = 1; i <= n; i++) for(j = 1; j <= m; j++) cout <"[j == m];

pow

今天long long范围内调用了pow函数,然后WA了

改成这样就过了,待解决

ll p(ll a,ll b){ ll ans = 1; for(ll i=1;i<=b;i==){ ans*=a; } return ans;}