Skip to content

Instantly share code, notes, and snippets.

@tanaka255
tanaka255 / f.cpp
Created October 1, 2025 15:18
JAG Summer Camp 2025 Day 2 Problem F
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
vector<pair<char, int>> rle(string s) {
vector<pair<char, int>> vp;
int l = 0, n = s.size();
while (l < n) {
int r = l;
while (r < n && s[l] == s[r]) ++r;
@tanaka255
tanaka255 / b.cpp
Created September 30, 2025 11:48
JAG Summer Camp 2025 Day 2 Problem B
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using vi = vector<int>;
string S;
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> S;
vi dp(26, 1 << 30);
dp[25] = 0;
@tanaka255
tanaka255 / a.cpp
Last active October 4, 2025 11:29
JAG Summer Camp 2025 Day 2 Problem A
#include <bits/stdc++.h>
using namespace std;
int n, a[50], s[50], x, y;
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
rep(i, n) cin >> a[i] >> s[i];
cin >> x >> y;
vector<pair<int, int>> ans;
@tanaka255
tanaka255 / l.cpp
Created September 30, 2025 09:02
JAG Summer Camp 2025 Day 1 Problem L
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
// x < y < z
ll count1(ll N) {
ll ret = 0;
for (ll x = 1; x * x * x < N; ++x) {
for (ll y = x + 1; x * y * y < N; ++y) {
ll l = y, r = N / (x * y);
@tanaka255
tanaka255 / e.cpp
Created September 30, 2025 08:39
JAG Summer Camp 2025 Day 1 Problem E
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
int N;
ll R;
tuple<ll, ll, ll> XYZ[2 << 10];
pair<ll, int> qi[2 << 10];
vector<vector<int>> g;
bool vis[2 << 10];
@tanaka255
tanaka255 / f.cpp
Last active October 4, 2025 11:28
JAG Summer Camp 2025 Day 1 Problem F
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
constexpr int inf = 1 << 30;
int N, Q;
string S;
vector<ll> path(ll x) {
vector<ll> ret = {x};
while (2 <= x) {
@tanaka255
tanaka255 / b.cpp
Created September 30, 2025 02:20
JAG Summer Camp 2025 Day 1 Problem B
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
int N;
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
@tanaka255
tanaka255 / a.cpp
Created September 29, 2025 16:48
JAG Summer Camp 2025 Day 1 Problem A
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
int N, A[3 << 17], B[3 << 17];
map<pair<int, int>, int> mp;
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> N;
int same = 0;