solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K,x,s=0;
cin>>N>>K;
for(int i = 0;i<N;i++){
cin>>x;
s+=min(x,K-x)*2;
}
cout<<s<<endl;
} | 0 |
#include<iostream>
using namespace std;
int main(){
int n,a[101],tmp,cnt=0;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n-1;i++)
for(int j=n-1;j>0;j--){
if(a[j]<a[j-1]){
tmp=a[j];
a[j]=a[j-1];
a[j-1]=tmp;
cnt++;
}
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[n-1]<<end... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int t, n;
long long s;
pair<int, int> x[N];
bool valid(int mid) {
int cnt = (n + 1) / 2;
long long sum = s;
for (int i = n - 1; ~i; --i) {
if (cnt && mid <= x[i].second)
--cnt, sum -= max(x[i].first, mid);
else
sum -= x[i].fi... | 4 |
#include <bits/stdc++.h>
int dx[] = {0, 1, 0, -1, 1, -1, 1, -1, -2, 2, 0, 0},
dy[] = {1, 0, -1, 0, -1, 1, 1, -1, 0, 0, -2, 2};
using namespace std;
int n, k, a;
int avail;
int getAvail(pair<long long, long long> r) {
int len = r.second - r.first + 1;
return (len + 1) / (a + 1);
}
set<pair<long long, long long> ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
const int maxn = 5010;
struct E {
int v, next;
long long w;
} e[maxn << 1];
int head[maxn], tot;
void add(int s, int t, long long w) {
e[tot].v = t;
e[tot].w = w;
e[tot].next = head[s];
head[s] = tot++;
e[tot].v = s;
e[tot].w = w;... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b, n;
cin >> a >> b >> n;
int count = 0;
while (max(a, b) <= n) {
if (a > b)
b += a;
else
a += b;
count++;
}
cout << count << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, x;
int arr[200100];
int main() {
int i;
scanf("%d%d",&n,&x);
if (x>1&&x<2*n-1) {
printf("Yes\n");
arr[n-1] = x;
int p = 1;
for (i=n;i<2*n-1;i++) {
if (p==x) p++;
arr[i] = p++;
}
p ... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct dinic {
struct edge {
int src, dst;
T low, cap, flow;
int rev;
};
int n;
vector<vector<edge>> adj;
dinic(int n) : n(n), adj(n + 2) {}
void add_edge(int src, int dst, T low, T cap) {
adj[src].push_back({src, dst, low, ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int w[500010], c[500010], a[500010], day;
long long ans;
double dot;
void qsort(int l, int r, int s) {
int first = (l + r) >> 1;
int i = l, j = r, m = c[first], v = w[first];
if (l == r) {
long long sum = m * 1LL * s;
ans += sum / v;
dot += (sum % v) * 1. ... | 6 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
string toStr(T s) {
ostringstream os;
os << s;
return os.str();
}
template <class T>
char* toCharArr(T n) {
char* s;
sprintf(s, "%ld", n);
return s;
}
int a[1010][1010];
int main() {
int n, m, x, y;
memset(a, 0, sizeof a);
cin >> n >> m;... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::string::size_type sz;
string s, t;
while (getline(cin, t)) {
s += t;
}
int plus = 0, minus = 0;
int size = s.size();
vector<int> v;
v.push_back(1);
string numx;
for (int i = 0; i < size; i++) {
if (s[i] == '+') {
plus++;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100010], b[100010];
long long dp[100010], s[100010];
int res;
int main() {
for (int i = 0; i < 100010; i++) s[i] = 0LL;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
s[a[i]]++;
}
sort(a, a + n);
int e = -1;
for (int i ... | 3 |
#include <bits/stdc++.h>
using std::max;
using std::min;
const int N = 5010;
int n, m, p[N], mx, cnt[N];
int main() {
scanf("%d%d", &n, &m);
for (int a, b, i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
if (b < a) b += n;
++cnt[a];
mx = max(cnt[a], mx);
p[a] = p[a] ? min(p[a], b - a) : b - a;
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
char s[110][3];
int f[55][55][55][55];
bool dfs(int len, int a, int b, int c) {
if (len == 1) return 1;
if (f[len][a][b][c]) return 0;
if (s[c][0] == s[b][0] || s[c][1] == s[b][1])
if (dfs(len - 1, len - 3, a, c)) return 1;
if (len > 3 && (s[c][0] == s[le... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m, s1, s2, t1, t2, l1, l2, res;
vector<int> a[3005];
int que[3005], d[3005][3005];
bool dau[3005];
void bfs(int s) {
int las = 1, fir = 1;
que[1] = s;
d[s][s] = 0;
while (las >= fir) {
int u = que[fir++];
for (int i = 0; i < a[u].size(); i++) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename _T>
inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const char *s, _T x, args... a) {
while (*s != ',') cerr << *s++;
cerr << " = " << x << ',';
_DBG(s + 1, a...);
}
con... | 6 |
#include <bits/stdc++.h>
using namespace std;
struct matrixType {
int r, c;
long long matrix[2][2];
};
long long k;
int n, m, mod;
long long s[50005];
long long a[50005];
long long v[50005];
int rk[50005];
matrixType qhy;
matrixType e[64];
matrixType st[50005 << 2];
long long f[50005];
matrixType d;
matrixType oper... | 1 |
#include<iostream>
using namespace std;
int main(){
int a, b, c, n;
int p[1111], m[1111], k[1111], q[1111];
int data[333];
while(true){
cin >> a >> b >> c;
if(!a && !b && !c) break;
for(int i=1;i<=a+b+c;i++) data[i] = 2;
cin >> n;
for(int i=0;i<n;i++) cin >> p[i] >> m[i] >> k[i] >> ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int pos[201];
int m[201], cd;
void inp() {
cin >> cd;
cd = cd * 2;
for (int i = 1; i <= cd; i++) {
cin >> m[i];
pos[m[i]] = i;
}
}
void calc() {
int kq = 0;
for (int i = 1; i <= cd; i += 2) {
int h = 0;
for (int e = pos[m[i]] - 1; e >= i + 1; e--... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
set<pair<int, int> > s1, s2;
pair<int, int> b[N];
int a[N];
void add(int ind) {
auto it = s1.upper_bound({ind, N});
pair<int, int> u = *--it;
s1.erase(u);
s2.erase({u.second - u.first + 1, u.first});
if (ind != u.first) {
s1.insert({u.fir... | 4 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define M 1777771
#define N 100005
using namespace std;
typedef unsigned long long ull;
typedef pair<ull,int> P;
typedef long long ll;
ll n,a,b,maxd[N];
vector<int> G[N];
map<ull,ll> S;
ull A[N];
int get_maxd(int x,int d){
int res=d;
rep(i,G[x]... | 0 |
#include <bits/stdc++.h>
#define MAX_N 200000
using namespace std;
typedef double dnt;
typedef long long lnt;
template <class T> inline void read(T &x) {
x = 0; int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar()) if (c == 45) f = -1;
for (; isdigit(c); c = getchar()) (x *= 10) += f*(c-'0');
}
int n, l, r, s... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
struct Point {
int x, y;
} p[maxn], p1[maxn];
int n;
double getk(Point x, Point y) { return ((double)y.y - x.y) / (y.x - x.x); }
bool onetwo() {
double k = getk(p[1], p[2]);
int cnt = 0;
for (int i = 3; i <= n; i++) {
if (getk(p[1], p[... | 2 |
#include <bits/stdc++.h>
using namespace std;
int dadsadasda;
const int INF = 0x3f3f3f3f;
const long long LLINF = 1e18;
const int MAXN = 1e5 + 10;
int n, m, k;
vector<int> G[MAXN];
int deg[MAXN];
bool erased[MAXN];
queue<int> pos_cliq, pos_set;
void erase(int v) {
erased[v] = true;
for (auto u : G[v]) {
if (era... | 2 |
#include <iostream>
#include <string>
int main()
{
std::string s;
std::cin >> s;
std::cout << s.substr(0, 4) << " " << s.substr(4, 13) << std::endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 2e9;
const long long infll = 1e18;
double eps = 0.0000001;
ifstream in("input.txt");
ofstream out("output.txt");
;
long long n;
vector<long long> c;
vector<long long> t;
void init() {
cin >> n;
c.resize(n);
t.resize(n);
for (long long i = 0; i ... | 5 |
#include <bits/stdc++.h>
#pragma optimize("Ofast")
using namespace std;
int t, n, m, ql, qr;
struct node {
int val, add;
} tree[400005];
void push_up(int pos) {
tree[pos].val = tree[pos << 1].val & tree[pos << 1 | 1].val;
}
void push_down(int pos) {
if (tree[pos].add) {
tree[pos << 1].val |= tree[pos].add;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, comp = 0, a[100005], b[100005], v[100005];
bool vis[100005];
set<int> s[100005];
void dfs(int u) {
if (vis[u]) return;
vis[u] = true;
s[comp].insert(u);
dfs(v[u]);
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long solve() {
long long n;
cin >> n;
vector<long long> v(n);
multiset<long long> s;
for (long long &i : v) {
cin >> i;
s.insert(i);
}
while (s.size() >= 2) {
auto it = s.begin(), it1 = s.end();
it1--;
if (*it1 - *it <= 1) return (*it1... | 1 |
#include <bits/stdc++.h>
using namespace std;
void read_input() {}
long long int b[2001][2001];
long long int c[2001][2001];
void solving() {
int n, m, k, x, y;
cin >> n >> m >> k;
for (int i = 0; i < k; i++) {
cin >> x >> y;
if (c[x][y] == 0) {
cout << x << " " << y << "\n";
c[x][y] = 1;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m, c;
cin >> n >> m >> c;
vector<long long> a(n);
vector<long long> b(m);
vector<long long> ans(n);
for (long long i = 0; i < n; i++) cin >> a[i];
for (long long i = 0; i < m; i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int height = 1;
if (a[0]) height++;
for (int i = 1; i < n; i++) {
if (!a[i] && !a[i - 1]) {
h... | 1 |
#include <bits/stdc++.h>
using namespace std;
inline void kmp(const char *s, int *p, int n) {
p[0] = -1;
for (int i = 1; i < n; i++) {
int x = p[i - 1];
while (x != -1 && s[x + 1] != s[i]) {
x = p[x];
}
if (s[x + 1] == s[i]) {
p[i] = x + 1;
} else {
p[i] = -1;
}
}
for (... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110, M = 110;
int a[N][M];
bool comp(pair<int, int> x, pair<int, int> y) {
return a[x.first][x.second] < a[y.first][y.second];
}
int n, m;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
bool sos(int x, int y) {
for (int i = (0); i < (4); ++i) {
if... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
const long long maxn = 5e5 + 5, MOD = 998244353;
long long ans[maxn], dp[maxn];
bool ma[maxn][31];
long long one[maxn], zero[maxn];
long long F[maxn + 1];
void add(long long pos, long long x) {
if (!pos) {
F[0] += ... | 6 |
#include<bits/stdc++.h>
using namespace std;
long long n,sum[100001],pr[100001],ans;
std::map <long long,int>ps;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>sum[i];pr[i]=sum[i];
}
sort(pr+1,pr+n+1);
for(int i=1;i<=n;i++)
ps[pr[i]]=i;
for(int i=1;i<=n;i++)
if(i%2!=ps[sum[i]]%2)
ans++;
ans/=2;
cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s, tmp;
void in(string s) {
for (int i = 1; i <= 4 - s.size(); i++) cout << 0;
cout << s;
}
int main() {
scanf("%d\n", &n);
for (int i = 1; i <= n; i++) {
getline(cin, s);
list<string> a, b;
int j = s.find("::", 0);
if (j == -1) j = s.s... | 2 |
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
cout << (x==7 || x==5 || x==3 ? "YES": "NO");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,x,y;
cin>>a>>b>>c>>x>>y;
int z=max(x,y);
int min1 = 1e10;
for(int i=0;i<=z;i++){
int d = 2*c*i + a * max(0,x-i) + b * max(0,y-i);
min1 = min(min1, d);
}
cout<<min1<<endl;
} | 0 |
#include <iostream>
using namespace std;
int main(){
string str,str2;
while( cin >> str >> str2,(str[0] - '0')+(str2[0] - '0') ){
int hit = 0,brow = 0;
for(int i = 0 ; i < str.size() ; i++){
if(str[i] == str2[i])hit++;
}
for(int i = 0 ; i < 4 ; i++ ){
for(int j = 0 ; j < 4 ; j++ ){
if... | 0 |
#include <bits/stdc++.h>
using namespace std;
int pp(int *a, int p, int r) {
int x = a[r], i = p - 1, buf;
for (int j = p; j < r; ++j)
if (a[j] < x) {
i++;
buf = a[i];
a[i] = a[j];
a[j] = buf;
}
if (a[i + 1] != a[r]) {
buf = a[i + 1];
a[i + 1] = a[r];
a[r] = buf;
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int dp[100005][2];
string s;
void solve() {
cin >> s;
memset(dp, 0, sizeof(dp));
int ans1, ans2;
for (int i = 1; i <= (int)s.size(); i++) {
if (s[i - 1] <= 90)
dp[i][0] = dp[i - 1][0];
else
dp[i][0] = dp[i - 1][0] + 1;
if (s[i - 1] >= 97)
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string top = "qwertyuiop", mid = "asdfghjkl;", bottom = "zxcvbnm,./", s;
char pos;
cin >> pos;
cin >> s;
if (pos == 'L') {
for (int i = 0; i < s.length(); i++) {
for (int j = 9; j >= 0; j--) {
if (s[i] == top[j]) {
s[i] = t... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long dp[43][3][3];
long long cost[3][3];
int main(void) {
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++) {
cin >> cost[i][j];
dp[0][i][j] = 0;
}
int n;
cin >> n;
for (int s = 1; s <= n; s++) {
for (int i = 0; i < 3; i++) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (scanf("%d", &n) != EOF) {
int x;
int res = 1;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
if (x == 1) {
res = -1;
}
}
printf("%d\n", res);
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 9, mod = 1e9 + 7, inf = 1e18;
vector<pair<long long, long long>> vc[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
bool f = true;
for (int i = 0; i < n - 1; i++) {
long long u, v... | 3 |
#include <bits/stdc++.h>
using namespace std;
#define maxn 200000
int n, cnt, fa[maxn];
set <int> E[maxn];
int read() {
int x = 0, k = 1;
char c; c = getchar();
while(c < '0' ||c > '9') { if(c == '-') k = -1; c = getchar(); }
while(c >= '0' &&c <= '9') x = x * 10 + c - '0', c = getchar();
return x * k;
}
struct ... | 0 |
#include <bits/stdc++.h>
int add(int num) {
int sum = 0;
while (num > 0) {
sum += num % 10;
num /= 10;
}
return sum;
}
int main() {
int num, i, num1, flag = 1;
scanf("%d", &num);
while (flag) {
if (add(num) % 4 == 0) {
printf("%d", num);
flag = 0;
} else
num++;
}
}
| 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int b;
cin>>b;
cout<<"ABC"<<b;
}
| 0 |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef node* Node;
#define NIL NULL
node array[500000];
int size=0;
Node root = NIL;
Node treeMinimum(Node x){
while(x->left!=NIL)x=x->left;
return x;
}
Node tree... | 0 |
#include <bits/stdc++.h>
using namespace std;
void yala_bena() {
cin.tie(0);
std::ios::sync_with_stdio(0);
}
const int m_r = 199999;
double pii = 3.1415926536;
int main() {
yala_bena();
double a, b, c, d, ans1, ans2;
cin >> a >> b >> c >> d;
ans1 = (double)a / b;
ans2 = (double)(1 - c / d) * (1 - a / b);
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6;
const int LIM = 100;
struct Node {
int val;
int order;
int cnt;
Node *left, *right;
bool vis;
};
typedef Node *NodeP;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
Node mem[2 * MAXN + 7];
int last_mem = 0;
deque<NodeP> ... | 4 |
#include <bits/stdc++.h>
using namespace std;
bool prime(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
int main() {
long long n, ans;
cin >> n;
if (prime(n))
ans = 1;
else if (n % 2 == 0)
ans = 2;
else if (prime(n - 2))
ans = 2;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,i;cin>>N;
while(N){
i=1;
while(i*(i+1)/2<N)i++;
cout<<i<<endl;N-=i;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
double n,x;
int main(){
cin>>n>>x;
cout<<n / x<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void start(vector<int> &arr, pair<char, int> &prefAns, pair<char, int> &sufAns,
string &s) {
int i;
for (i = 0; i < s.size(); ++i) {
int cnt = 0;
while (i + 1 != s.size() && s[i] == s[i + 1]) {
++cnt;
++i;
}
arr[s[i]] = max(arr[s[i... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 50;
int n, m, S, dfn[N], idfn[N], cnt, ff[N], fa[N], g[N], st[N], tp, l[N], dep[N],
f[N][20], d[N], sz[N];
long long dis[N];
bool vis[N];
int ver[N * 2], edge[N * 2], nxt[N * 2], head[N], tot;
void add(int x, int y, int z) {
ver[++tot] = y;
edge[... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a[n];
long long len[n];
unordered_map<int, int> rems[11];
bool validlen[11];
int temp;
for (int i = 0; i < 11; ++i) {
validlen[i] = false;
}
for (int i = 0; i < n; ++i) {
cin >> a[i];
temp... | 4 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,k;
cin>>n>>k;
string str1,str2;
cin>>str1;
cin>>str2;
map<int,int> m1;
map<int,int> m2;
for(int i=0;i<n;i++)
{
m1[int(str1[i])-97]++;
m2[int(str2[i])-97]++;
}
map<int,int> :: iterator it1,it2;
i... | 3 |
#include <bits/stdc++.h>
int compare(const void *a, const void *b) {
return *((unsigned *)b) - *((unsigned *)a);
}
int main(int argc, char **argv) {
unsigned q;
unsigned n, *a, *b;
scanf("%d", &q);
while (q--) {
scanf("%d", &n);
a = (unsigned *)calloc(n, sizeof(unsigned));
b = (unsigned *)calloc(n... | 6 |
#include <iostream>
#include <stdio.h>
#include <cstdio>
using namespace std;
int main()
{
double p, q;
double price = 0, quantity = 0, amount = 0;
while (scanf("%lf,%lf", &p, &q) != EOF) {
price += (p * q);
quantity += q;
amount++;
}
cout << (int)price << endl;
cout << (int)(quantity / amount + 0.5) << ... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct my_heap {
priority_queue<int, vector<int>, greater<int> > p, q;
void insert(int v) { p.push(v); }
void del(int v) { q.push(v); }
int top() {
while (!q.empty() && p.top() == q.top()) {
p.pop();
q.pop();
}
return p.top();
}
} h[200000 ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXn = 1000 * 100 + 100;
long long a[MAXn], n, m, w, h, k, H;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
cin >> m;
k = 1;
H = a[1];
for (int i = 0; i < m; i++) {
cin >> w >> h;
cout << max(a[... | 1 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int maxn = 1e6 + 10;
int main() {
vector<bool> prime(maxn + 1, true);
vector<int> primes;
prime[0] = prime[1] = false;
for (int i = 2; i <= maxn; i++) {
if (!prime[i]) continue;
primes.push_back(i);
if (i * 1LL * i <= maxn)... | 1 |
#include <bits/stdc++.h>
const int maxn = 1005;
using namespace std;
map<int, int> mp;
int main() {
int a[maxn];
int num, jishu;
cin >> num >> jishu;
for (int i = 0; i < num; i++) cin >> a[i];
sort(a, a + num);
int ans = 0;
while (1) {
if (a[0] == jishu) break;
for (int i = 0; i < num; i++)
... | 2 |
#include <bits/stdc++.h>
int n, ans, md = 998244353, num[1000010], b[1000010], c[1000010], inv[1000010],
p[1000010], q[1000010], r[1000010];
int power(int x, int p) {
int num = 1;
while (p) {
if (p & 1) num = (long long)num * x % md;
x = (long long)x * x % md;
p >>= 1;
}
return num;
}
in... | 3 |
#include <bits/stdc++.h>
using namespace std;
int d[4][109];
int main() {
string s1, s2;
cin >> s1 >> s2;
int n = s1.size();
auto get = [=](int a) { return 2 * (s1[a] == 'X') + (s2[a] == 'X'); };
for (int i = 0; i < n; i++) {
for (int j = 0; j < 4; j++) {
d[j][i] = -300;
}
}
d[get(0)][0] = 0... | 4 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
long long S;
cin >> n >> S;
struct adj {
int v, w, c;
};
vector<vector<adj>> g(n);
for (int i = 0; i < n - 1; ++i) {
int u, v, w, c;
cin >> u >> v >> w >> c;
--u;
--v;
g[u].push_back({v, w, c});
g[v].push_back(... | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<int> bin(int num, int typs) {
vector<int> v;
while (num > 0) {
v.push_back(num % 2);
num /= 2;
}
for (int i = v.size(); i < typs; i++) {
v.push_back(0);
}
return v;
}
int main() {
int typs, plyrs, diff, cnt = 0, diffbit = 0;
cin >> typs >>... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,t,p[110]={},dp[102][4][4]={};
cin>>n>>t;
for(int i=0;i<t;i++){
int a,b;
cin>>a>>b;
p[a]=b;
}
if(p[1]&&p[2])dp[3][p[2]][p[1]]=1;
else if(p[2])for(int i=1;i<4;i++)dp[3][p[2]][i]=1;
else if(p[1])for(int i=1;i<4;i++)dp[3][i][p[1]]=1... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> a;
vector<long long> b;
int32_t main() {
cout.precision(numeric_limits<double>::max_digits10);
a.push_back(0);
b.push_back(0);
long long n, i, choice, sum = 0;
cin >> n;
while (n--) {
cin >> choice;
if (choice == 1) {
long long ra... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int maxn = 1e5 + 5;
string s;
map<char, int> c;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> s;
for (int i = 0; i < s.length(); ++i) {
c[s[i]]++;
}
bool check = true;
int t = 0;
for (int i = 1; i < s.le... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const int maxn = 100100;
long long exponentiation(long long A, long long B, long long MOD) {
long long ans = 1;
for (; B; A = (A * A) % MOD, B >>= 1)
if (B & 1) ans = (ans * A) % MOD;
return ans;
}
pair<int, int> tree[maxn << 2];
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 12;
long long fib[max_n];
long long mat[2][2];
long long ini[2];
long long m;
void mul1(long long a[][2], long long b[][2]) {
long long c[2][2];
c[0][0] = a[0][0];
c[0][1] = a[0][1];
c[1][0] = a[1][0];
c[1][1] = a[1][1];
for (int i = 0; i < 2; ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int MOD = 998857459;
const int INF = 0x3f3f3f3f;
const int maxn = 3e5 + 10;
const int maxm = 5e6 + 10;
int n, k, op[maxn][2], p[maxn << 1], val[maxn << 1];
char str[maxn];
int find(int first) {
return p[first] ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int dis[1000009];
queue<int> q;
int main() {
ios::sync_with_stdio(0);
memset(dis, -1, sizeof(dis));
cin >> n >> m;
dis[n] = 0;
q.push(n);
while (!q.empty()) {
int u = q.front();
q.pop();
if (u < 1 || u > 10000) continue;
if (dis[u - 1] ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
const int INF = 1e9;
struct Tree {
struct Node {
pair<int, int> res;
pair<int, int> mnl;
pair<int, int> mnr;
int updl;
int updr;
};
vector<Node> data;
int sz;
void init(int n) {
sz = n;
data.resize(sz * 4);
f... | 6 |
#include<iostream>
#include<vector>
#include<cassert>
#include<algorithm>
using namespace std;
#define rep(i, n) for ( int i = 0; i < n; i++ )
#define MAX 100
#define INFTY (1<<21)
void dijkstra( int n, int G[MAX][MAX], vector<int> p[MAX] ){
int d[MAX];
bool visited[MAX];
rep(i, n) p[i].clear();
rep(i, n){
... | 0 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define re register
#define ll long long
inline int gi()
{
int f=1,sum=0;char ch=getchar();
while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getcha... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long p, q, b;
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); }
long long read() {
long long num = 0, w = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') w = -1;
ch = getchar();
}
while (isdigit(ch)) {... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 11;
vector<int> v[N];
int a[N];
int d[20][N], tin[N], tout[N], timee, sz[N];
int gl[N], num[N], nn;
int deep[N];
int n;
void dfs(int l, int pr) {
d[0][l] = pr;
deep[l] = deep[pr] + 1;
timee++;
sz[l] = 1;
tin[l] = timee;
for (int j = 1; j < 19... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100100;
long long n, Index;
long long ans;
long long d[] = {5, 50, 500, 5000, 50000,
500000, 5000000, 50000000, 500000000, 5000000000};
long long c[] = {0, 9, 99, 999, 9999, 99999,
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<long long> v(n);
vector<long long> psum;
for (int i = 0; i < n; ++i) cin >> v[i];
sort(v.begin(), v.end());
psum = v;
for (int i = 1; i < n; ++i) psum[i] += psum[i - 1];
long double a... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
cout << x << endl;
exit(0);
}
using ll = long long;
const int maxn = 1e6 + 5;
int n, m, q;
int p[maxn];
pair<int, int> E[maxn];
pair<int, int> Q[maxn];
bool deleted[maxn];
int par[maxn];
int parent(int x) {
if (par[x] == x) return... | 4 |
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
int main() {
long long n, ans = 0, numb;
char f;
cin >> n >> f;
if (n % 2 == 0) {
if (n / 2 % 2 == 0)
numb = n / 2;
else
numb = n / 2 + 1;
} else {
if ((n - 1) / 2 % 2 == 0)
numb = n / 2 + 1;
else
numb =... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target("avx2")
#pragma GCC optimize("03")
using namespace std;
vector<pair<int, int> > vxy;
int n;
int mx = 0;
int my = 0;
pair<int, int> o... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int l = 0, r = 0, d = 0, u = 0;
cin >> s;
if (s.size() % 2 != 0)
cout << "-1";
else {
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'L')
l += 1;
else if (s[i] == 'R')
r += 1;
else if (s[i] == 'U')... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long int MOD = 998244353;
long long int NUM = 1e9 + 7;
void solve() {
int n;
cin >> n;
cout << (n / 2) + 1 << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
const int N = 5000;
vector<int> v, k;
bool can(int x) {
int rnk = 0;
for (auto i : v) {
if (i <= x) rnk++;
}
for (auto i : k) {
if (i > 0 && i <= x)
rnk++;
else if... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.writ... | 5 |
#include<queue>
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn=100000,mod=1000000007;
const ll inf=0x3f3f3f3f3f3f3f3f;
int n,m,s,t,ans; queue<int> q;
struct hnode{
int id; ll v;
bool operator<(const hnode &t)const{
return v>t.v;
}
};
struct edge{int to,len;};
priority_queue<hnode> hp;
s... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
template<typename T>inline void check_max(T a,T &b){if(a>b)b=a;}
typedef long long ll;
const int N=101000;
ll s[N],t[N];
ll ans;
int n,k;
int main()
{
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
{
scanf("%lld",&s[i]);
t[i]=t[i-1];
if(s[i]>0)t[i]+=s[i];
s[i... | 0 |
#include <bits/stdc++.h>
using namespace std;
void print(int num) {
switch (num) {
case 1:
cout << "x^y^z";
break;
case 2:
cout << "x^z^y";
break;
case 3:
cout << "(x^y)^z";
break;
case 4:
cout << "(x^z)^y";
break;
case 5:
cout << "y^x^z";
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MN = 1e4 + 5;
int n, m, G, R, d[MN], dis[MN][1005];
deque<pair<int, int> > q;
int main() {
scanf("%d%d", &n, &m);
for (register int i = 1; i <= m; i++) scanf("%d", d + i);
sort(d + 1, d + 1 + m);
scanf("%d%d", &G, &R);
memset(dis, -1, sizeof(dis));
dis... | 3 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double PI = acos(-1);
const int maxn = 2005;
const int inf = 0x3fffffff;
const int mod = 1000000007;
int n, m;
bool x[maxn], y[maxn];
int cx, cy;
double f[maxn][maxn];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string p, z;
cin >> p;
cin >> z;
for (int i = 0; i < p.length(); i++) {
if (p[i] >= 'A' && p[i] <= 'Z') p[i] = tolower(p[i]);
}
for (int i = 0; i < z.length(); i++) {
if (z[i] >= 'A' && z[i] <= 'Z') z[i] = tolower(z[i]);
}
cout << p.comp... | 1 |
#include <bits/stdc++.h>
using std::abs;
using std::bitset;
using std::cerr;
using std::cin;
using std::copy;
using std::cout;
using std::deque;
using std::endl;
using std::fill;
using std::fixed;
using std::greater;
using std::istream;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using... | 4 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
vector<int> ans(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
vec[i]--;
}
for (int i = 0; i < n; i++) {
ans[i] += min(n - 1, i + k) - max(0, i - k) + 1;
if (vec[i] != -1) {
a... | 2 |
#include<iostream>
#include<map>
using namespace std;
int main(){
map<int,int> pset;
int n,m,d,t;
bool can=true;
cin >> n;
for(int i=0;i<n;i++){
cin >> d;
pset[d]++;
}
cin >> m;
for(int i=0;i<m;i++){
cin >> t;
if(pset[t]>0){
pset[t]--;
}else{
can=false;
}
}
if(can... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
void solve() {
long long n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) cout << s[n - 1];
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.