PTA-混分
摸鱼日记,摸着摸着,就背了
fwxljwawawawawa
QQ:1320305093
展开
-
7-2 列车调度
#include<bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); set<int> st; int n; cin >> n; while (n --) { int k; cin >> k; set<int>::iterator it = st.lower_boun原创 2021-02-17 08:11:01 · 176 阅读 · 0 评论 -
7-1 数组循环左移
#include<iostream> using namespace std; const int maxn = 100 + 5; int a[maxn]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i ++) { cin >> a[i]; } for (int i = 0; i < n; i ++) { cout <<原创 2021-02-15 23:41:55 · 225 阅读 · 0 评论 -
7-2 后缀式求值(一位整型操作数版)
#include<bits/stdc++.h> using namespace std; stack<int> ans; int main() { int n; cin >> n; while(n --) { string s; cin >> s; int num = 0, way = 0; bool flag = 0; for(int i = 0; i < s.size(); i ++) {原创 2021-02-15 23:26:04 · 1869 阅读 · 2 评论 -
7-1 一元多项式的加法
#include <bits/stdc++.h> using namespace std; struct fac_idx { int fac; int idx; }; const int maxn = 1e5 + 5; fac_idx a[maxn]; bool cmp(fac_idx x, fac_idx y) { return x.idx > y.idx; } int main() { ios::sync_with_stdio(0); cin.tie(0); cou原创 2021-02-15 22:56:33 · 884 阅读 · 0 评论 -
7-2 阶乘之和取模
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int temp = 1, ans = 0; for (int i = 1; i <= n; i ++) { temp *= i; temp %= 1000000; ans += temp; ans %= 1000000; } cout << ans; }原创 2021-02-15 20:48:32 · 450 阅读 · 0 评论 -
7-1 最大子列和问题
#include <bits/stdc++.h> #define int long long using namespace std; const int maxn = 100000 + 5; int a[maxn]; int sum[maxn]; signed main() { int n; cin >> n; for (int i = 1; i <= n; i ++) { scanf("%lld", &a[i]); sum[i] =原创 2021-02-15 20:41:48 · 43 阅读 · 0 评论