solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
int n, a[maxn];
unsigned long long qp[maxn], sum1[maxn << 2], sum2[maxn << 2];
void Init() {
qp[0] = 1;
for (int i = 1; i <= n; ++i) qp[i] = qp[i - 1] * 233;
}
void pushup(int rt, int l, int r) {
int mid = l + r >> 1;
sum1[rt] = sum1[rt << ... | 6 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <complex>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <assert.h>
using namespace std;
const int N = 310;
const int mod = 998244353;
int dp[N][N][N];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 105;
struct node {
int pos, len;
} w[Maxn];
int f[Maxn][Maxn][2];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> w[i].pos >> w[i].len;
sort(w + 1, w + n + 1,
[](const node& a, const node& b) { return a.pos < b.pos; });
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int opr(char ch, int a, int b) {
if (ch == '&') return a & b;
if (ch == '|') return a | b;
return a ^ b;
}
int solve() {
char ch;
scanf("%c", &ch);
if (ch == '0') return 1;
if (ch == '1') return 1 << 3;
if (ch == '?') return (1 << 1) | (1 << 2);
int a = so... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int n = s1.length();
int flag;
if (s1.length() != s2.length())
cout << "NO";
else {
flag = 1;
for (int i = 0; i < s1.length(); ++i) {
if (s1[i] != s2[n - i - 1]) {
cout << "NO";
flag ... | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cstring>
#include <tuple>
#include <utility>
#include <list>
#include <cmath>
using namesp... | 0 |
#include <bits/stdc++.h>
using namespace std;
string s1, s2;
int a[200001];
bool check(int mid) {
string s = s1;
int i, j = 0;
for (i = 1; i <= mid; i++) {
s[a[i] - 1] = 32;
}
for (i = 0; i < s1.size(); i++) {
if (s[i] == 32) continue;
if (s[i] == s2[j]) {
j++;
if (j >= s2.size()) retu... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long N = (long long)(2e5) + 105, inf = 1e9, mod = 1e9 + 7;
long long n, a[N];
long long m, b[N];
long long k = 0;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout.tie(0);
cin >> n >> m;
for (long long i = 0; i < n; ++i) {
cin >> a[i];
... | 2 |
#include <bits/stdc++.h>
using namespace std;
unordered_map<long long, long long> abv[20];
long long a[20][20];
int n, m, half;
long long k, ans;
void down(int i, int j, int lev, long long ex) {
if (i >= n || j >= m) return;
ex ^= a[i][j];
if (half == lev) {
abv[j][ex]++;
return;
}
down(i + 1, j, 1 + ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, h;
int a[1010], b[1010], l, r, ans;
bool check(int n) {
memcpy(b, a, sizeof(b));
sort(b + 1, b + n + 1, [](int i, int j) { return i > j; });
long long cnt = 0;
for (int i = 1; i <= n; i += 2) cnt += b[i];
return cnt <= h;
}
int main() {
scanf("%d%d", &n, ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long k = n;
long long c = 0;
for (long long i = 2; i <= sqrt(n); ++i) {
if (n % i == 0) {
if (c != 0) {
cout << "1" << endl;
return 0;
}
c = i;
while (n % i == 0) {
n = n ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int A[200000 + 1], F[200000 + 1], tree[4 * 200000 + 1], flag[4 * 200000 + 1];
void push(int node, int a, int b) {
if (flag[node]) {
tree[node] += (b - a + 1) * flag[node];
if (a != b) {
int izq = 2 * node + 1, der = 2 * node + 2;
flag[izq] += flag[node... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305, Mo = int(1e9) + 7;
vector<int> Lk[MAXN], E[MAXN];
map<int, int> Hash;
bool Walk[MAXN];
int Els[MAXN][3], Pos[MAXN];
int T[MAXN], Ref[MAXN], Col[MAXN], H[MAXN], Block[MAXN][3], W[MAXN][MAXN],
Self[MAXN], Edge, N, K, cnt, c, tot;
void Link(int u, int... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, p;
cin >> n >> d;
int sum = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> p;
sum += p;
}
sum += (n - 1) * 10;
if (sum <= d) {
if ((d - sum) >= 5) ans += ((d - sum) / 5);
ans += (n - 1) * 2;
cout << ans << end... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int M = 100001;
int n;
int p[M], f[M];
vector<long long> v;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
long long c = 0;
int t = i;
while (!f[t]) {
f[t] = 1;
c++;
t = p[t] ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, m = 0;
cin >> n >> m;
int arr[n][2 * m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2 * m; j++) {
cin >> arr[i][j];
}
}
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2 * m; j += 2) {
if ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
long long Answer;
vector<int> G[1010];
int n, m, l, r, Total, Block;
int Left[1010], Right[1010], Belong[MAXN], a[MAXN];
inline long long Read() {
long long x = 0, f = 0;
char c = getchar();
while (!isdigit(c)) {
f |= c == '-';
c = get... | 5 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <tuple>
#include <cstring>
using namespace std;
#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,b) loop(i,0,b)
#define eb emplace_back
int w,h;
char g[55][55];
int flg[55][55];
void draw(int i, int j, int c){
rep(d,4){
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d\n", &n, &k);
vector<int> id[2];
for (int i = 0; i < n; i++) {
id[getchar() - '0'].push_back(i);
}
bool w1 = false, w2 = true;
for (int i = 0; i <= n - k; i++) {
for (int j = 0; j <= 1; j++) {
int l0 = i, r0 = i... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long b, long long m) {
long long r = 1;
while (b > 0) {
if (b & 1) r = (r * a) % m;
a = (a * a) % m;
b >>= 1;
}
return r;
}
int main() {
long long n, i, mi = 1e18, c = 0, j, d = 0, ma = -1e18;
scanf("%lld", &n);
l... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005, inf = 0x3f3f3f3f;
const long long llinf = 0x3f3f3f3f3f3f3f3f;
const long double pi = acos(-1.0L);
long long v[maxn], t[maxn], sum[maxn], ans[maxn];
int num = 0;
struct Tree {
int lc, rc, l, r;
long long sum, tag;
};
Tree tree[4 * maxn];
void bui... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000010;
int n, m, k, kd, d[maxn], a, b;
vector<int> g[maxn];
bool u[maxn];
multiset<int> ss;
int dfs(int i) {
int res = 1;
u[i] = true;
for (int j = 0; j < (int)(g[i].size()); j++)
if (!u[g[i][j]]) res += dfs(g[i][j]);
return res;
}
int main() ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
auto print = [&](int i, int j) {
if (n % 2 == 0) {
return i + j != n + 1;
} else {
return i + j != n;
}
};
int m = n * (n - 1) / 2 - n / 2;
cout << m << endl;
for (int i = 1; i <= n; ++i) {
for (int ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
cin >> n;
cout << ((n+999)/1000)*1000 - n << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200000 + 5;
int f[N][2], col[N];
int tot;
int head[N], to[N * 2], next1[N * 2];
void lian(int x, int y) {
to[++tot] = y;
next1[tot] = head[x];
head[x] = tot;
}
int ans;
void get(int &d1, int &d2, int x, int c, int fa) {
d1 = 0, d2 = 0;
for (int i = h... | 5 |
#include <bits/stdc++.h>
using namespace std;
int N, M, x, y, z, tmp, top[200005], deg[200005];
int val[200005], to;
queue<int> q;
pair<int, int> yol[200005];
vector<int> cont[200005];
void bfs() {
tmp = 1;
q.push(tmp);
while (!q.empty()) {
tmp = q.front();
q.pop();
for (int i = 0; i < (int)cont[tmp].... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, dp[3000][2], a[3000], b[3000], c[3000], i;
int main() {
cin >> n;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n; i++) scanf("%d", &b[i]);
for (i = 0; i < n; i++) scanf("%d", &c[i]);
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[1][0] = max(a[0] +... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long n, r, avg;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> r >> avg;
vector<pair<long long, long long> > v;
long long x, y;
long long sum = 0;
for (long long i = 0; i < n; i++) {
cin >> x >> y;
v.push_back... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3007, K = 1507, p = 998244353;
vector<int> dp[2][K];
int n, k, a, b, w[N], cnt[N], fac[N], ans[N], ifac[N], f[N][N], c[N][N];
inline int read() {
int num = 0;
char g = getchar();
while (g < 48 || 57 < g) g = getchar();
while (47 < g && g < 58)
num ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int check(int *a, int n, int x, bool cur) {
int answer = 0;
for (int i = 0; i < n; i++) {
if (cur) {
if (a[i] <= x) {
answer++;
cur = !cur;
}
} else {
answer++;
cur = !cur;
}
}
return answer;
}
void solve() {
int... | 4 |
#include <bits/stdc++.h>
int main() {
int i, j, k, a, b, c;
int n;
scanf("%d %d %d %d", &n, &a, &b, &c);
getchar();
int target = n;
long long result = 0;
for (i = 0; i <= a; i += 2) {
target = n;
target = target - (i / 2);
if (target == 0) {
result++;
break;
}
if (target < ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, c = 0, d, s = 0;
cin >> n >> m;
int a[n + 1];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = n - 1; i >= 0; i--) {
c++;
s = s + a[i];
if (s >= m) break;
}
cout << c;
}
| 1 |
#include <bits/stdc++.h>
const long long Infll = 0x3f3f3f3f3f3f3f3f;
const int MN = 100005, MS = 1 << 18 | 7;
long long K, W[MN], G[MN], pre[MN], suf[MN];
int N, nxt[MN], Ans;
std::vector<int> T[MN];
long long amn[MS], bmn[MS], ans[MS], tg[MS];
inline void P(int i, long long x) { bmn[i] += x, ans[i] -= x, tg[i] += x; }... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long k, b, n, t, z = 1, cnt = 0;
cin >> k >> b >> n >> t;
while (z <= t) {
cnt++;
z = k * z + b;
}
cout << n - min(n, cnt - 1);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans;
int a[300010];
char s[300010];
inline void prework() {
scanf("%d", &n);
scanf("%s", s + 1);
}
inline void mainwork() {
ans = n;
for (int i = 1; i <= n; i++)
if (s[i] == '1') ans = max(ans, max(2 * i, 2 * (n - i + 1)));
}
inline void print() { prin... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
string s;
cin >> n;
cin >> s;
sort(s.begin(), s.end());
cout << s;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)(1e9);
const long long INF64 = (long long)(1e18);
const long double EPS = 1e-9;
const long double PI = 3.1415926535897932384626433832795;
map<int, int> visited;
int main() {
ios_base::sync_with_stdio(0);
int n, m;
scanf("%d %d", &n, &m);
vector<... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200020;
long long a;
int main() {
cin >> a;
long long l = 1, r = 1e18;
long long ans =
(((9 * (5 * (9 * (2 * (long long)1e17) % a) % a) % a) % a) + 1) % a;
cout << l + (a - ans) << ' ' << r + (a - ans) << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long a[200005];
long long b[200005];
int pos[200005];
int goal[200005];
int main() {
int n, m;
cin >> n >> m;
long long cf, cb;
int k;
cin >> cf >> k >> cb;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a[i] = x;
pos[x] = i;
}
bool can... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
const long long INFL = LLONG_MAX;
const long double pi = acos(-1);
vector<string> captain;
vector<string> man;
vector<string> rat;
vector<string> woman;
int main() {
ios_base::sync_with_stdio(0);
cout.precision(15);
cout << fixed;
cout.tie(0... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long dp[200005], C, a[200005], b[200005];
;
long long ruia[200005], ruib[200005];
long long seg[(1 << 19)] = {};
void update(int k, long long a) {
k += (1 << 19) / 2 - 1;
seg[k] = a;
while (k > 0) {
k = (k - 1) / 2;
seg[k] = max(seg[k * 2 + 1], seg... | 6 |
#include <bits/stdc++.h>
using namespace std;
string s;
int solve(string text) {
int len = text.size();
if (text.size() % 2 == 1) {
return 0;
}
string s1 = text.substr(0, len / 2);
string s2 = text.substr(len / 2);
if (s1 != s2) {
return 1;
}
return solve(s1);
}
int main() {
cin >> s;
int le... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s1, s2, s3;
cin >> s1;
cin >> s2;
cin >> s3;
unordered_map<char, long long> counts;
for (long long i = 0; i < s1.length(); i++) counts[s1[i]]++;
for (long long i = 0; i < s2.length... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
;
int t;
cin >> t;
while (t--) {
long long n, i;
cin >> n;
set<long long> s;
s.insert(1);
s.insert(n);
for (i = 2; i <= sqrt(n); i++) {
s... | 3 |
#include <bits/stdc++.h>
using namespace std;
double pi = acos(-1);
int main() {
int i, j, k, n, r, R, cnt;
scanf("%d%d%d", &n, &R, &r);
if (r > R)
cnt = 0;
else if (r * 2 > R)
cnt = 1;
else if (r * 2 == R)
cnt = 2;
else {
double tmp = asin(r * 1. / (R - r));
if (tmp * n <= pi + 1e-12)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
string ans, left;
if (s1[1] == '<') {
reverse(s1.begin(), s1.end());
s1[1] = '>';
}
if (s2[1] == '<') {
reverse(s2.begin(), s2.end());
s2[1... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int maxn = 100005;
inline int read() {
int res, ok = 1;
char ch;
for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') ok = -1;
res = ch - '0';
for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar()... | 4 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int k,n;
int main()
{
scanf("%d",&k);
if(k==1)
{
printf("1\n1");
return 0;
}
n=(k+3)/4*2;
printf("%d\n",n);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
int val=(i+j-1)%n+1;
if(i%2) printf("%d ",val);
else printf("%d... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
const int N = 50000 + 100;
struct road {
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int c1 = 0, c2 = 0;
cin >> n;
string s;
cin >> s;
int i;
for (i = 0; i < s.size(); i++)
if (s[i] == 'A') {
c1++;
} else
c2++;
if (c2 == c1)
cout << "Friendship" << endl;
else if (c1 > c2)
cout << "Anton" << e... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[1000010], vis[1010][1010];
int main() {
int n, m;
while (scanf("%d %d", &n, &m) == 2) {
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
a[i] = x % m;
}
if (n > m) {
printf("YES\n");
continue;
} else {
memse... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
const int max_lev = 18;
int n, m, q, parent[max_lev][max_n], best_h[max_n], used[max_n], h[max_n];
int real_p[max_lev][max_n];
int tin[max_n], tout[max_n], cur = 1;
vector<int> g[max_n];
void dfs(int v, int p) {
tin[v] = cur++;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const long long lINF = (1LL << 62) - 1;
const double dINF = 1e40;
const int MAXN = 101000;
vector<int> e[MAXN], adj[MAXN];
bool vis[MAXN];
int deep[MAXN];
vector<tuple<int, int, int> > res;
bool dfs(int u, int fath) {
vis[u] = true;
if (fa... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 110;
int n, a[maxN], sum = 0;
int i;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
i = 0;
while (round((double)(sum) / (double)n) < 5) {
sum += 5 - a[i];
i++;
}
cout << i << endl... | 2 |
#include <bits/stdc++.h>
using namespace std;
void read_file(bool outToFile = true) {}
string s;
int n;
int main() {
read_file();
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
while (cin >> n) {
cin >> s;
vector<int> ans;
for (int i = 0; i < n; i++) {
if (s[i] == 'W') continue;
int j =... | 1 |
#include <bits/stdc++.h>
using namespace std;
string a;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k, i, l = 0, r = 0, c = 0, ans = 0;
cin >> n >> k;
cin >> a;
for (i = 0; i < n; i++) {
if (a[i] != 'a') {
if (c < k) {
c++;
r++;
} else {
while (l < n && a... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long Path1[1005][1005], Path2[1005][1005], Path3[1005][1005],
Path4[1005][1005], matrix[1005][1005];
int main() {
int n, m;
cin >> n >> m;
long long maxi = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) scanf("%I64d", &matrix[i][j]);
for (... | 4 |
#include <bits/stdc++.h>
using namespace std;
int cap, m;
pair<int, int> s[40];
int main() {
cin >> cap >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
s[i].first = y * -1;
s[i].second = x;
}
sort(s, s + m);
for (int i = 0; i < m; i++) s[i].first *= -1;
int sum = 0;
for (int i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 100 * 1000 + 50;
int a[maxN], b[maxN], seg[5 * maxN];
struct query {
int x, y, k;
} q[maxN];
void update(int t, int l, int r, int x, int s, int e) {
if (l == s && r == e) {
seg[x] = t;
return;
}
int mid = (s + e) / 2;
if (r > mid) update(t... | 5 |
#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef long long LL;
int n;
LL encode(const vector<char> &v){
LL a = 0;
for(int i = 0; i < n; ++i){
a |= (LL)v[i] << (i << 2);
}
return a;
}
vector<char> decode(LL x){
vector<char> v(n);
for(int i = 0; i < n; ++i){... | 0 |
#include <bits/stdc++.h>
using namespace std;
void __print(long long x) { cout << x; }
void __print(long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { ... | 3 |
#include <bits/stdc++.h>
using namespace std;
void swap(long long &a, long long &b) {
long long t;
t = a;
a = b;
b = t;
}
int main() {
ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
long long n1, n2, k1, k2;
cin >> n1 >> n2 >> k1 >> k2;
if (n1 > n2)
cout << "First" << endl;
e... | 1 |
#include <bits/stdc++.h>
using namespace std;
char s1[1000005];
char s2[1000005];
int main() {
gets(s1);
gets(s2);
int len1 = strlen(s1);
int len2 = strlen(s2);
if (len1 != len2) {
cout << "NO" << endl;
} else {
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < len1; i++) {
if (s1[i] == ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-15;
const int INF = 1e9 + 7;
const long long LINF = 8e18 + 7;
const int N = 2e5 + 7;
vector<long long> t[4 * N];
int a[N];
long long s[N];
void build(int v, int L, int R) {
if (L + 1 == R) {
t[v].push_bac... | 4 |
#include <iostream>
using namespace std;
int main()
{long long t,n,p=0;
cin>>t;
while(t--)
{long long cnt=0,s;
p=9;
cin>>n;
while(n>p)
{p=p*10+9;
cnt++;}
s=cnt*9+n/(p/9);
cout<<s<<'\n';
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1003;
const long long M = 1000000007;
long long ast(long long x, int n) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long y = ast(x, n / 2);
return (y * y) % M;
} else {
long long y = ast(x, n - 1);
return (y * x) % M;
}
}
long long b... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
double sqr(double d) { return d * d; }
bool deql(double a, double b) { return fabs(a - b) < 1e-10; }
bool triangle(double a, double b, double c) { return a * a + b * b >= c * c; }
bool square(double a, double b, double c) {
return deql(a * a + b * b, c ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
string str;
cin >> str;
set<string> st;
queue<string> que;
st.insert(str), que.push(str);
int sum = 0;
while (!que.empty()) {
string s = que.front();
que.pop();
for (int i = 0; i < s.size(); i++) {
st... | 5 |
#include <bits/stdc++.h>
using namespace std;
int arr[800], n;
long long bb[800], Hi, lo;
priority_queue<int> Q;
int lappa(long long q) {
long long sum = q;
int cnt = 0;
while (!Q.empty()) Q.pop();
for (int j = 0; j < n; j++) {
sum += arr[j];
Q.push(-arr[j]);
while (sum < 0 && !Q.empty()) {
su... | 6 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define lowbit(x) ((x)&(-(x)))
#define mid ((l+r)>>1)
#define lson rt<<1, l, mid
#define rson rt<<1|1, mid+1, r
#define fors(i, a, b) for(int i = (a); i < (b); ++i)
#define all(vec) vec.begin(),vec.end()
using namespace std;
const int maxn = 505;
char mp... | 3 |
#include <bits/stdc++.h>
using namespace std;
int a[100],b[100],c[100];
int main()
{
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
{
cin>>b[i];
sum+=b[i];
}
for(int i=1;i<n;i++)
cin>>c[i];
for(int i=1;i<n;i++)
{
if(a[i]+1==a[i+1])
sum+=c[a[i]];
}
cout<<sum;
return... | 0 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int INF = (1 << 29) + 5;
const long long int LLINF = (1ll << 60) + 5;
const int MOD = 1000 * 1000 * 1000 + 7;
const int MAX_N = 2000 * 100 + 5;
int n;
int arr1[MAX_N];
int arr2[MAX_N];
int main() {
scanf("%d", &n);
for (... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct type {
long long k, i, j;
};
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
retu... | 3 |
#include<iostream>
#include<vector>
#include<bitset>
using namespace std;
int X, Y, n;
vector<vector<int>> s;
vector<vector<int>> answer;
vector<int> area;
// id, 左上, 右下
bool placeable(vector<vector<int>> field, int id, int y1, int x1, int y2, int x2) {
bool ok = false;
for(int i = y1; i <= y2; ++i) for(int j... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1, c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c ^ 48);
c = getchar();
}
return f == 1 ? x : -x;
}
const int N = 2e5 + 4;
int n, Q,... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, l, s, re, d;
int a[30];
int gcd(int a, int b) {
int r;
while (a % b != 0) {
r = a;
a = b;
b = r % b;
}
return b;
}
int main() {
bool v;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
l += a[i];
if (a[i] % 2 =... | 5 |
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
using namespace std;
int main()
{
int D, L;
cin >> D >> L;
cout << D / L + D%L << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> primes;
int dp[101][1 << 18], n, a[111], man, ansd[111], loc[100];
vector<int> fact[100];
int rec(int i, int mask) {
if (i == n) return 0;
if (dp[i][mask] != 1000000000) return dp[i][mask];
int dif = abs(a[i] - 1);
int ans = rec(i + 1, mask) + dif;
for... | 4 |
#include <bits/stdc++.h>
int n, k, minimal, maximal;
int a[300009], sums[1000009];
inline int min(int v1, int v2) { return v1 < v2 ? v1 : v2; }
inline int max(int v1, int v2) { return v1 > v2 ? v1 : v2; }
void ReadData() {
scanf("%d %d", &n, &k);
minimal = 1000009;
maximal = 0;
for (int i = 0; i < n; i++) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long get_ans(long long n, long long k) {
while (true) {
if (k % 2 == 0) {
return k / 2 + 1;
}
long long cnt = (k / 2 + 1);
k += n - cnt;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> ... | 2 |
#include<bits/stdc++.h>
#define M 100005
#define YXQAK {printf("Impossible\n"); return 0;}
using namespace std;
int a[M]={0},aa[M]={0};
int n,m,ji=0,now=1;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d",aa+i);
if(aa[i]&1) ji++;
}
if(ji>2) YXQAK
if(ji==0){
for(int i=1;i<=m;i++) a[i]=aa[i]... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
const int N3 = 1e3 + 10;
const int INF = 2e9 + 10;
const long long LINF = 2e18;
int main() {
if ("" != "") {
freopen(
""
".in",
"r", stdin);
freopen(
""
".out",
"w", s... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, cnt;
char s[105][105];
int main() {
scanf("%d", &n);
for (int i = (0); i < (n); i++) scanf("%s", s[i]);
cnt = 0;
for (int i = (0); i < (n); i++) {
int ok = 0;
for (int j = (0); j < (n); j++)
if (s[i][j] == '.') ok = 1;
cnt += ok;
}
if (c... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 0; i+2 < N; ++i) {
if (S.substr(i, 3) == "ABC") {
++ans;
}
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
int i, j, dp[1555][1555], n, k, K;
int main() {
dp[0][0] = 1;
scanf("%d%d", &n, &K);
for (int kk = 0; kk < n; kk++) {
int x;
scanf("%d", &x);
for (i = 500; i >= 0; i--)
for (j = 500; j >= 0; j--)
if (dp[i][j]) dp[i + x][j] = dp[i][j + x] = 1;
}
for (i = 0; i ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int sum;
void decode(int val, int bit) {
if (val) {
decode(val / 2, bit + 1);
sum += (val % 2) * pow(2.0, 8 - bit);
return;
}
if (bit <= 8) {
decode(0, bit + 1);
}
return;
}
int main() {
string s;
while (getline(cin, s)) {
int last = 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {}
const long long maxn = 100500;
long long a[maxn];
bool dp[maxn];
long long pos[maxn];
signed main() {
ios::sync_with_stdio(0);
cin.sync_with_stdio(0);
cin.tie(0);
long long n;
cin >> n;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
po... | 3 |
#include<iostream>
#include<vector>
#include<cmath>
#include<queue>
//別にqueue使わずに実装余裕じゃん
//いや無理だわ
//セグフォのデバッグができるようになりたい
using namespace std;
int main(){
//エラトステネスの篩を実装する
int np;
int n[9999]={0};//i番目が整数i+2に対応(2~10000)
vector<int> pr;
for(int i=2;i<=100;i++){
if(n[i-2]==0){
for(int j=1;j<=floor(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
unsigned long long n;
cin >> n;
unsigned long long best = 0, bestnum = 0, count = 1;
for (unsigned long long i = 0; i < n; i++) {
unsigned long long num;
cin >> num;
if (i == 0) {
be... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void print(T a) {
for (auto x : a) cout << x << ' ';
cout << endl;
}
void solve() {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) cin >> a[i];
vector<long long> id;
id.push_back(0);
for (long long i ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
char G[n][m];
vector<pair<int, int> > v;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> G[i][j];
if (G[i][j] == 'W') v.push_back({i, j});
}
}
int sol = 0;
int dx[] = {0, 0, 1, -1};... | 2 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T>
using Table = vector<vector<T>>;
const ld eps = 1e-9;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "( " << v.first << ", " << v.second << ")";
return o... | 5 |
#include <iostream>
using namespace std;
int main()
{
double t,ti;
while(cin >> t >> ti){
if(t < 35.50 && ti < 71.00)
{
cout << "AAA" << endl;
}
else if(t < 37.50 && ti < 77.00)
{
cout << "AA" << endl;
}
else if(t < 40.00 && ti < 83.00)
{
cout << "A" << endl;
}
else if(t < 43.00 && ti < 89.00)
{
... | 0 |
//Zory-2020
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define edge pair<int,int>
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(... | 0 |
#include <bits/stdc++.h>
using namespace std;
double PI = 3.14159265358979323843;
void Timo() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void print(int n) {
if (n == 0) {
return;
}
print(n - 1);
cout << "Hello world" << endl;
print(n - 1);
}
int main() {
Timo();
string ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int arr[n];
int minn = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> arr[i];
minn = min(minn, arr[i]);
}
vector<int> vec;
for (int i = 0; i < n; i++) {
if (arr[i] == minn) {
vec.p... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main(){
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<ll> a(n);
for(int i = 0; i < n; ++i){ cin >> a[i]; }
vector<ll> b(n + 1), c(n + 1);
for(int i = 0; i < n; ++i){ b... | 0 |
#include <bits/stdc++.h>
int main() {
long long int t, n, i, m;
scanf("%lld", &t);
for (i = 1; i <= t; i = i + 1) {
scanf("%lld", &n);
long long int p[n], j, a = 0, b = 0, c = 0, d = 0;
for (j = 0; j < n; j = j + 1) {
scanf("%lld", &p[j]);
if (p[j] % 2 == 0) {
a = a + 1;
} el... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int SIZE = 100000;
vector<int> edges[SIZE];
vector<string> str[SIZE];
string c;
int prefc[3 * SIZE];
char s[3 * SIZE];
int pref[3 * SIZE];
void build() {
prefc[0] = 0;
for (int i = 1; i < c.length(); i++) {
int pi = prefc[i - 1];
while (c[pi] != c[i]) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, q;
cin >> n >> m >> k >> q;
int tv[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
tv[i][j] = -1;
}
}
for (int i = 0; i < q; i++) {
int x, y, t;
cin >> x >> y >> t;
tv[x - 1][y - 1] = t;
}
... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.