山西又增一例在忻州_做dapp开发广州_搜索引擎推广的基本方法_公司网站推广方案

#include<iostream>
using namespace std;
int const N = 200005;
int n;
long long t;
int ans = 0;
int main()
{cin >> n;for (int i = 1;i <= n;i++){cin >> t;long long test = 2;bool flag = 0;if (t == 1){ans++;}while (test <= t){if (test == t){flag = 1;break;}test *= 2;}if(flag==1)ans++;}cout << ans << endl;return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n;
struct num
{int nums;int cirs = 0;
};
vector<num>v;bool cmp(num num1, num num2)
{if (num1.cirs == num2.cirs){return num1.nums < num2.nums;}return num1.cirs < num2.cirs;
}
int main()
{cin >> n;int t;num nu;for (int i = 1;i <= n;i++){cin >> t;nu.cirs = 0;nu.nums = t;while (t){int x = t % 10;if (x == 8){nu.cirs += 2;}else if (x == 0 || x == 9 || x == 6 || x == 4){nu.cirs += 1;}t /= 10;}v.push_back(nu);}sort(v.begin(), v.end(), cmp);for (vector<num>::iterator it = v.begin();it != v.end();it++){cout << (*it).nums << " ";}return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int n;
int arr[1000005];
int a[500005];
long long ans = 0;
int main()
{cin >> n;for (int i = 1;i <= n;i++){cin >> arr[i];}for (int i = 1;i <= n / 2;i++){a[i] = arr[n - i + 1] - arr[i];}for (int i = 1;i <= n / 2;i++){if (a[i] > 0){if (a[i + 1] >= a[i]){a[i + 1] -= a[i];}else if (a[i + 1] >= 0){a[i + 1] = 0;}ans += a[i];}else if (a[i] < 0){if (a[i + 1] <= a[i]){a[i + 1] -= a[i];}else if (a[i + 1] < 0){a[i + 1] = 0;}ans -= a[i];}}cout << ans << endl;return 0;
}

 

#include<iostream>
using namespace std;
int const N = 3e5 + 5;
int n, m, l[N], r[N],a[N],s[N],sum=0;
int main()
{cin >> n >> m;for (int i = 1;i <= m;i++){cin >> l[i] >> r[i];a[l[i]]++;a[r[i]+1]--;}for (int i = 1;i <= n;i++){a[i] += a[i - 1];if (a[i] == 0)sum++;s[i] = s[i - 1] + (a[i] == 1);}for (int i = 1;i <= m;i++){cout << s[r[i]] - s[l[i]-1] + sum << endl;}return 0;
}