- 博客(2)
- 收藏
- 关注
RSS订阅原创 P5723 质数口袋 题解 —— by AnDrew Louis
#include <iostream>#include <cmath>using namespace std;int n, i, cnt, sum;bool prime(int x){ int i; int a = sqrt(x); for(i = 2; i <= a; i++) if(x%i == 0) break; if(i > a) return 1; else return 0; }int main(){ cin >>.
2021-12-14 02:05:18
649
原创 P3655 Low DREAMER C/C++ 题解 ——by AnDrew Louis
#include <bits/stdc++.h>#define ll long longusing namespace std;const ll inf = 0x3f3f3f3f, N = 2e5 + 7;ll a[N], n, q, s, t, x, l, r, k, last, sum;int main(){ cin >> n >> q >> s >> t >> x; for (int i = 1; i <=.
2021-12-14 01:49:23
762
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人