恒治学

#include <iostream> #include <cstdio> using namespace std; int y, d, month = 1, day = 1; int ms[14] = {0,31,28,31,30,31,30,31,31,30,31,30,31}; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> y &gt

#include <iostream> #include <cstdio> using namespace std; int n, pre, cur, cnt = 1; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> pre; while (--n){ cin >> cur;

#include <iostream> #include <cstdio> #include <string> // substr c_str #include <vector> #include <cstdlib> // atoi #include <cstring> // memset #include <queue> using namespace std; #define mm(a) memset(a, 0

#include <iostream> #include <cstdio> #include <algorithm> using namespace std; struct ball{ int begin; //初始球位序 int idx; //球坐标 int d; //球方向 }b[110]; // 按照球坐标排序, 便于计算碰撞 bool cmp(ball x, ball y){ return x.idx &lt

#include <iostream> #include <cstdio> using namespace std; int main(){ int n, ad = 0, sum = 0; cin >> n; while (n){ if (n == 1){ ad = 1; sum += ad; } else { if (ad%2

#include <iostream> #include <cstdio> #include <cmath> using namespace std; const int mx = 310; // a->第二天各商店菜价 // d[v][q][r] = 1->第一天位置p的菜价为q、位置p+1的菜价为r时满足第二天位置[p+1,n]的菜价约束 // p[v][q][r]->满足条件的最小的第v+2天的菜价, 用于路径输出 int a[mx], d[m

#include <iostream> #include <cstdio> using namespace std; int t[1000010]; int n, x, y, mx = 0, cnt = 0; int main(){ cin >> n; for (int _ = 0; _ < 2*n; _++){ cin >> x >> y; if (y > mx) mx = y;

#include <iostream> #include <cstdio> #include <vector> using namespace std; int main(){ int n; cin >> n; vector<int> f(n+1), s(n+1); for (int i = 0; i < n; i++) cin >> f[i]; for (int i = 0; i &lt

#include <iostream> #include <cstdio> #include <map> using namespace std; typedef long long ll; const int state = 14; const int mod = 998244353; //矩阵快速幂 struct mat{ ll m[state+1][state+1]; }unit, a; void init(){ for (int i = 1;

#include <iostream> #include <cstdio> using namespace std; typedef long long ll; ll r, y, g; // from state k to green ll wait_for(ll k, ll p, ll t){ ll wait_time = 0; //time pass total rounds p = p % (r+y+g); // begin red

#include <iostream> #include <cstdio> using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); int r, y, g, n, k, t, sum = 0; cin >> r >> y >> g >> n; while (n--){ cin &gt

#include <iostream> #include <cstdio> #include <string> #include <iomanip> #include <vector> #include <utility> #include <algorithm> #include <bits/stdc++.h> using namespace std; typedef long long ll; //

#include <iostream> #include <cstdio> #include <vector> #include <string> using namespace std; int convert(char a, int b){ return a == '+' ? b : -b; } int main(){ int n, sum = 0; string s, res; cin >> n;

#include <iostream> #include <cstdio> #include <vector> using namespace std; int main(){ int n, cur, mx, mn; float mid; vector<int> v; cin >> n; for (int i = 0; i < n; i++){ cin >&

#include <iostream> #include <algorithm> #include <cstdio> #include <cmath> using namespace std; struct p{ int index; int x; int y; double d; }ps[210]; bool cmp(p a, p b){ if (a.d == b.d) return a.index < b.

#include <iostream> #include <cstdio> using namespace std; int main(){ int n, k, t, xl, yd, xr, yu, cur_x, cur_y, pass = 0, stay = 0; scanf("%d%d%d%d%d%d%d", &n, &k, &t, &xl, &yd, &xr, &yu); while (

#include <iostream> int main(){ int n, y = 0; scanf("%d", &n); while(n--){ int w, s; scanf("%d%d", &w, &s); y += w*s; } if (y < 0) y = 0; printf("%d", y); return 0; }

#include <iostream> #include <algorithm> #include <set> #include <vector> #include <cstring> using namespace std; set<int> s; struct stu{ int y; int result; }; vector<stu> v; int m, sum[100010]; int cm

#include <iostream> #include <cstdio> #include <map> #include <vector> using namespace std; map<long long, vector<int> > m; long long n, idx, sum = 0; int a, b, t, value; int main(){ scanf("%lld%d%d", &n, &amp

#include <iostream> #include <cstdio> using namespace std; int t1, t2, t3, a = 0, b = 0; struct pa{ int x; int y; }pas[1010]; struct pb{ int x; int y; }pbs[1010]; bool judge(){ bool flag1 = false, flag2 = false, fa = tru

#include <iostream> #include <cstdio> #include <vector> using namespace std; int main() { vector<int> drop(1010, 0), idx; int n, m, t = 0, e = 0; cin >> n; for (int i = 0; i < n; i++){ int tmp, cur

#include <iostream> #include <cstdio> #include <string> using namespace std; bool judge(int i){ while (i > 0){ if (i % 10 == 7) return true; else i /= 10; } return false; } int main(){ int n, i = 1, cnt

#include <iostream> #include <cstdio> #include <vector> #include <cmath> using namespace std; int main() { int n, m, t = 0, k = 0, p = 0; cin >> n >> m; for (int i = 0; i < n; i++){ int h, tmp, s

#include <iostream> #include <cstdio> #include <vector> #include <utility> #include <algorithm> #include <functional> using namespace std; typedef long long ll; int n; int h[6] = {0}; vector<pair<ll, ll> > v