WOSHILURENJI的博客

#include <bits/stdc++.h>using namespace std;const int INF = 1000000000;//2） A中不超过1500元的部分，税率3%；//　　3） A中超过1500元未超过4500元的部分，税率10%；//　　4） A中超过4500元未超过9000元的部分，税率20%；//　　5） A中超过9000元未超过35000元的部分，税率25%；//　　6） A中超过35000元未超过55000元的部分，税率30%；//　　7） A

#include <bits/stdc++.h>using namespace std;const int maxn = 22;int empty[maxn];const int N = 20;int main(){ for(int i=0; i<N; ++i) empty[i] = 5; int n; scanf("%d", &n); for(int k=0; k<n; ++k){ int p; scanf("%d", &p); boo

#include <bits/stdc++.h>using namespace std;int n, m;const int maxn = 35;int board[maxn][maxn];struct Pos{ int x, y; Pos(int xx, int yy): x(xx),y(yy) {}};vector<Pos> v;int main(){ memset(board,0,sizeof(board)); scanf("%d%d", &n,

#include <bits/stdc++.h>using namespace std;const int maxR = 15;const int maxC = 10;const int N = 4;int board[maxR+1][maxC];int block[N][N];struct Pos{ int x, y; Pos(int xx, int yy):x(xx),y(yy) {}};vector<Pos> v;int main(){ memset(

#include <bits/stdc++.h> using namespace std;const int maxn = 1000 + 5;int flag[maxn] = {0};int main(){ int n, m, sum, a, t=0, d=0, e=0; scanf("%d", &n); for(int i=0; i<n; ++i){ scanf("%d%d", &m,&sum); for(int j=2; j<=m;

#include <bits/stdc++.h> using namespace std;const int maxn = 4;int cnt[maxn+1] = {0};vector<pair<int,int>> p;map<pair<int,int>, int> ps;int n;int main(){ scanf("%d", &n); for(int i=0; i<n; ++i){ int x, y;

#include <bits/stdc++.h> using namespace std;const int maxn = 1000 + 5;int h[maxn];int main(){ int n; scanf("%d", &n); for(int i=0; i<n; ++i) scanf("%d", &h[i]); int ans = 0; for(int i=0; i<n; ++i){ int minh = h[i]; for(int

#include <bits/stdc++.h>using namespace std;//周日用数字0表示int monthdays[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; //平年时每个月有多少天int daysOfMonth(int y, int m) { //判断y年m月有几天 if ((y % 400 =

#include <bits/stdc++.h>using namespace std;//周日用数字0表示int monthdays[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; //平年时每个月有多少天int daysOfMonth(int y, int m) { //判断y年m月有几天 if ((y % 400 =

//思路：碰撞前后小球的相对位置不变。由于本题输入不是按位置顺序输入，因此用order[i]用于输入输出转换 #include <bits/stdc++.h> using namespace std;const int maxn = 100 + 5;struct Ant{ int id; //小球编号 int p; //小球位置 bool operator< (const Ant& a) const{ //按位置排序 return p < a.p;

#include <bits/stdc++.h> using namespace std;int n, m;const int maxn = 20000 + 5;struct Edge{ int from, to, dist; Edge(int u, int v, int d=1): from(u),to(v),dist(d) {}};vector<Edge> edges;vector<int> G[maxn];bool vis[maxn];int

#include <bits/stdc++.h> using namespace std;const int INF = 1000000000;const int maxn = 1000 + 5;int n, m, k, _d;struct Cell{ int r, c; Cell(int r, int c):r(r),c(c) {}};const int dr[] = {-1,1,0,0};const int dc[] = {0,0,-1,1};int d[maxn][m

#include <bits/stdc++.h>using namespace std;int n, m, t;struct Node{ int r, c, t; Node(int r=0, int c=0, int t=0): r(r),c(c),t(t) {}};const int maxn = 100 + 5;int danger_area[maxn][maxn];bool vis[maxn][maxn][maxn];const int dr[] = {-1, 0, 1

#include <bits/stdc++.h> using namespace std;const int maxn = 10000 + 5;vector<int> G[maxn];int pre[maxn], lowlink[maxn], sccno[maxn], dfs_clock, scc_cnt;stack<int> S;void dfs(int u){ pre[u] = lowlink[u] = ++dfs_clock; S.push(u);

#include <bits/stdc++.h> using namespace std;const int maxn = 10000 + 5;set<int> G[maxn];bool vis[maxn][maxn];int pa[maxn];int findset(int x) {return pa[x]==x ? x : pa[x]=findset(pa[x]);}int deg[maxn];vector<int> d;struct Edge{

#include <bits/stdc++.h>using namespace std;const int maxn = 1000 + 5;const int INF = 1000000000;int n;int pa[maxn];int findset(int x) {return pa[x]==x ? x : pa[x]=findset(pa[x]);}struct Edge{ int u, v, d; Edge(int u, int v, int d):u(u),v(v)

#include <bits/stdc++.h>using namespace std;const int maxn = 10000 + 10;const int INF = 1000000000;struct Edge{ int from, to, dist; Edge(int u, int v, int d): from(u),to(v),dist(d) {}};struct HeapNode{ int d, u; bool operator< (const Hea

#include <bits/stdc++.h>using namespace std;const int maxn = 100000 + 5;const int INF = 1000000000;int n;int pa[maxn];int findset(int x) {return pa[x]==x ? x : pa[x]=findset(pa[x]);}struct Edge{ int u, v, d; Edge(int u, int v, int d):u(u),v(

#include <bits/stdc++.h>using namespace std;const int maxn = 100000 + 5;const int INF = 1000000000;int n;int pa[maxn];int findset(int x) {return pa[x]==x ? x : pa[x]=findset(pa[x]);}struct Edge{ int u, v, d; Edge(int u, int v, int d):u(u),v(

#include <bits/stdc++.h> using namespace std;const int maxn = 1000;string str;int lch[maxn], rch[maxn]; char op[maxn];int nc = 0;int build_tree(const string& s, int x, int y){ int i, c1=-1, c2=-1, p=0; int u; if(y-x == 1){ u = ++nc;

#include <bits/stdc++.h> using namespace std;int main(){ int n; while(scanf("%d", &n)==1 && n){ int ans = 0, wi, si; while(n--){ scanf("%d%d", &wi, &si); ans += wi*si; } printf("%d\n", ans<0?0:ans); } return