solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
enum { MAXN = 22, MAXD = 5000000 };
int num[MAXN], rev[MAXN];
char buffer[MAXD], *top = buffer;
int cnt = 0;
void output(int a, int c) {
++cnt;
*(top++) = a + '0';
*(top++) = ' ';
*(top++) = c + '0';
*(top++) = '\n';
}
void solveSimple(int m, int a, int c) {
con... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
scanf("%d", &x);
while (x--) {
scanf("%d %d", &a, &b);
if (a == b)
printf("0\n");
else if (a < b) {
if (a % 2 == 1) {
if (b % 2 == 1)
printf("2\n");
else
printf("1\n");
} else ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5050;
int N, B, C[MAXN], D[MAXN], P[MAXN], s[MAXN];
long long dp[MAXN][MAXN], ks[MAXN];
vector<int> child[MAXN], adjList[MAXN];
int main() {
scanf("%d%d", &N, &B);
for (int i = 0; i < N; ++i) {
scanf("%d%d", &C[i], &D[i]);
if (i) {
scanf("... | 5 |
#include <bits/stdc++.h>
using namespace std;
bool func(string s) {
if (s == "0") return true;
for (int i = 1; i < s.length(); i++) {
if (s[i] != '0') return false;
}
if (s[0] == '1')
return true;
else
return false;
}
int main() {
int n, exp = 0;
cin >> n;
string ans = "1";
bool zero = fal... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
vector<string> vert = {".........", "....O....", "..O...O..", "..O.O.O..",
"O.O...O.O", "O.O.O.O.O", "O.OO.OO.O"},
hori = {".........", "....O....", "O.......O", "O...O...O",
... | 4 |
#include "stdio.h"
int n,ptr;
int a[200005];
long long sum,d;
int stV[200005];
int stC[200005];
int main(){
scanf("%d",&n);
for(int i = 0; i < n; i++){
scanf("%d",&a[i]);
int c = 1;
while(ptr>0&&stV[ptr-1]>a[i]){
d -= stV[ptr-1]*(long long)stC[ptr-1];
c += stC[ptr-1];
ptr--;
}
d += a[i]*(long l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
using vppsii=vector<pair<pair<string,int>,int>>;
vppsii a(N);
for(int i=0;i<N;i++){
string s;
int p;
cin>>s>>p;
a.at(i)=make_pair(make_pair(s,-p),i+1);
}
sort(a.begin(),a.end());
for(auto e:a){
cout<<e.second... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long x, n, m, l;
cin >> x >> n >> m >> l;
cout << n << " ";
cout << m << " ";
cout << m << "\n";
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
struct Unionfind {
// tree number
vector<int> par;
// constructor
Unionfind(int n = 1) : par(n, -1) {}
// search root
int root(int x) {
if (par[x] < 0) return x;
return par[x] = root(par[x]);
}
// is same?
bool issame(int x, int y) { return root(x... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, sum;
int main() {
scanf("%d %d", &n, &m);
vector<int> frq(n + 1);
set<int> s;
for (int i = 0; i < m; i++) {
int a;
scanf("%d", &a);
frq[a]++;
s.insert(a);
if (s.size() == n) {
sum++;
printf("1");
s.clear();
for (... | 2 |
#include<iostream>
using namespace std;
int main() {
string A, B, C;
cin >> A >> B >> C;
cout << A[0] << B[1] << C[2] << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
multiset<pair<int, int> > s;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
int maxi = 0;
for (int j = 0; j < m; j++) {
int a;
ci... | 1 |
#include<iostream>
using namespace std;
#define rep(i, n) for ( int i = 0; i < n; i++)
#define MAX 100
#define INFTY (1<<21)
int n, m, G[MAX][MAX], E[MAX*MAX];
int eprim( int base ){
int d[MAX];
bool visited[MAX];
rep(i, n){
d[i] = INFTY;
visited[i] = false;
}
d[0] = 0;
int cnt = 0;
int a... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long cap[300][300];
long long cost[300][300];
long long fnet[300][300], adj[300][300], deg[300];
long long par[300], d[300], q[300], inq[300], qs;
long long pi[300];
bool dijkstra(int n, int s, int t) {
memset(d, 0x3F, sizeof(d));
memset(par, -1, sizeof(par));
me... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, r, ql, qr;
cin >> n >> l >> r >> ql >> qr;
int a[n + 3];
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int L = n, R = 0;
int curr_ans = 0, ans;
for (int i = 0; i < n; i++) curr_ans += a[i] * l;
int curr_add = (n - 1) * ql;
ans = cu... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[15];
int vis[15];
int main() {
int N, M;
while (cin >> N >> M) {
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= N; i++) cin >> a[i];
int x;
for (int i = 1; i <= M; i++) {
cin >> x;
vis[x] = 1;
}
for (int i = 1; i <= N; i++) {... | 1 |
#include <bits/stdc++.h>
using namespace std;
int v[400005], ar[4 * 400005];
int last[400005], nxt[400005], cnt[400005];
void update(int a, int val, int l, int h, int p) {
if (a < l || a > h) return;
if (l == h)
ar[p] = val;
else {
int m = (l + h) / 2;
update(a, val, l, m, 2 * p);
update(a, val, m... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int mn = 3e5 + 10;
int a[mn], hd[mn], num[mn];
map<int, int> m[mn];
int main() {
int q;
scanf("%d", &q);
while (q--) {
int n, i;
scanf("%d", &n);
for (i = 0; i <= n; i++) a[i] = 0, hd[i] = 0, num[i] = 0, m[i].clear();
for (i = 0; i < n; i++) scan... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> ans;
while (b > a) {
ans.push_back(b);
if (b % 2 == 0) {
b /= 2;
} else {
if (b % 10 == 1) {
b = (b - 1) / 10;
} else {
cout << "NO";
return 0;
}
}
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MX = 100001;
int mul(int a, int b) { return (long long)a * b % MOD; }
class tree {
private:
struct node {
node *l = nullptr, *r = nullptr;
int y, size, value, w, x, second;
node(int x, int w) : x(x), w(w), value(w) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
struct fenwick_tree {
int n;
vector<int> fen;
void build(int size) {
n = size;
fen.assign(n, 0);
}
fenwick_tree(int n) { build(n); }
int get(int u) {
int s = 0;
while (u >= 1) {
s += fen[u];
u -= u & -u;
}
return s;
}
void... | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[400005];
int r[400005];
int MaxVal;
int tree[400005];
int read(int idx) {
int sum = 0;
while (idx > 0) {
sum += tree[idx];
idx -= (idx & -idx);
}
return sum;
}
void update(int idx, int val) {
while (idx <= MaxVal) {
tree[idx] += val;
idx += (... | 2 |
#include <bits/stdc++.h>
using namespace std;
unordered_map<long long, int> la;
long long sum, s[20];
vector<int> a[20], ans, ans1;
int n, m, vis[1 << 17];
int cir(int pos, int u, int sta) {
sta |= 1 << (pos - 1);
ans[pos] = u;
long long m1, now = u, m2 = la[now];
while (1) {
m1 = sum - s[m2] + now;
if ... | 3 |
#include <bits/stdc++.h>
int FASTBUFFER;
using namespace std;
int n, m, ans[500005];
set<int> s;
vector<int> v;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) s.insert(i);
for (int i = 1; i <= m; i++) {
int l, r, x;
scanf("%d %d %d", &l, &r, &x);
v.clear();
for (set<int>::iterat... | 3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int (i) = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int (i) = (int) (a); (i) < (int) (b); (i)++)
#define MP(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(v) (v).begin(), (v).end()
vector<pair<int, pair<int, int> > >... | 0 |
#include <bits/stdc++.h>
using namespace std;
string s;
bool go(int st, int en) {
if ((en - st) % 2 == 0) return 0;
if (st == en) return 0;
int en1 = (st + en - 1) / 2;
bool b = 1;
for (int i = st, j = en1; i <= j; i++, j--) {
if (s[i] != s[j]) {
b = 0;
break;
}
}
if (!b) return 1;
r... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int r1, d;
cin >> r1 >> d;
long long int n;
cin >> n;
long long int count = 0;
int x[n], y[n], r[n], i;
for (i = 0; i < n; i++) cin >> x[i] >> y[i] >> r[i];
double dfo;
for (i = 0; i < n; i++) {
dfo = sqrt(x[i] * x[i] + y[i] * y[... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int P = 1e9 + 7;
void read(int &x) { scanf("%d", &x); }
int n, k;
long long fact[maxn], Pow[maxn], inv[maxn], fact_inv[maxn], res[maxn];
char str[maxn];
long long Com(int x, int y) {
if (x < y) return 0;
return fact[x] * fact_inv[x - y] %... | 3 |
#include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007
#define lim 100005
#define nfs_mw ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int inf = 1e9;
int n,m,g[705][705],col[705],vis[7... | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
struct Node {
int val, l, r;
};
class SegmentTree {
public:
vector<Node> dat;
int size_ = 0;
void init() {
size_ = 1;
dat.push_back(Node{0, -1, -1});
}
void add_(int l, int r, int x, int a, int b, int u) {
if (b <= l ... | 3 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
for (long long i = 0; i < t; i++) {
long long n;
cin >> n;
long long a[n];
for (long long j = 0; j < n; j++) {
cin >> a[j];
}
long long prevailing_sign = 0, sum = 0, ma = a[0];
for (long long j = 0;... | 3 |
#include <bits/stdc++.h>
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template <typename T>
inline bool read(... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res = min(n - a, b + 1);
cout << res;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long solve(const vector<long long>& A) {
long long ans = A[0];
long long cur = A[0];
for (int i = 1; i < A.size(); i++) {
cur = max(A[i], cur + A[i]);
ans = max(ans, cur);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 28;
const long long LINF = 1ll << 61;
const double eps = 1e-9;
double ta[100111], tb[100111];
double prod[100111], sum[100111];
double a[100111], b[100111];
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lf", &ta[i])... | 4 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n, m; cin >> n >> m;
pair<long long, long long> d[n];
for (int i = 0; i < n; i++)
{
cin >> d[i].first >> d[i].second;
}
sort(d, d + n);
long long res = 0, id = 0;
while (m > 0)
{
res += d[id].first * min(m, d[id].second);
m -= min(m, d... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, t, ans = 0, dp[2005][2005], i, j, k;
const long long mod = 1e9 + 7;
int main() {
cin >> n >> t;
dp[0][1] = 1;
for (i = 1; i <= t; i++)
for (j = 1; j <= n; j++)
for (k = j; k <= n; k += j) {
(dp[i][k] += dp[i - 1][j]) %= mod;
}
fo... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 50;
const int inf = 0x3f3f3f3f;
int n;
int x[maxn];
int l[maxn], r[maxn];
void init() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) l[i] = inf, r[i] = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &x[i]);
l[x[i]] = min(l[x[i]], i);
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
string a, b;
cin >> n >> a >> b;
vector<int> oper;
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
oper.push_back(i + 1);
oper.push_back(1);
oper.push_back(i + 1);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n, m, i, j, c, k, l;
cin >> n >> m;
long int a[n], b[m];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < m; i++) {
cin >> b[i];
}
i = 0;
j = 0;
c = 0;
k = a[0];
l = b[0];
while ((i < n) && (j < m)) {
if (k... | 2 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;
cin>>n>>k;
map<ll,ll> data;
for(int i=0; i<n; ++i){
ll a,b;
cin>>a>>b;
data[a] += b;
}
for( auto i : data ){
if( k > i.second ){ k -= i.second; }
else{ cout<<i.first<<endl;... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 222;
const long long inf = -998244353;
int tot;
struct matrix {
long long a[N][N];
void reset() {
memset(a, 0, sizeof a);
for (int i = 1; i <= tot; i++)
for (int j = 1; j <= tot; j++) a[i][j] = -inf;
}
matrix operator*(const matrix &b) {
... | 6 |
#include <bits/stdc++.h>
int main() {
int n, c = 0;
std::cin >> n;
for (int x1 = -(1 << 30), h1 = 0, x, h; std::cin >> x >> h;
++c, x1 = x, h1 = h) {
if (x1 + h1 >= x) --c, h1 = 0;
if (x - h > x1 + h1) h = 0;
}
std::cout << c << '\n';
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long c[100001];
int binarys(vector<long long> a, int l, int r, int x) {
while (l <= r) {
int m = l + (r - l) / 2;
if (a[m] == x) return m;
if (a[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}
vector<int> a(300001), b(300001);
vector... | 1 |
#include <bits/stdc++.h>
using namespace std;
int ini() {
int x;
scanf("%d", &x);
return x;
}
long long inl() {
long long x;
scanf("%lld", &x);
return x;
}
int main() {
long long b;
cin >> b;
long long ans = 0LL;
for (long long i = 1; i * i <= b; i++) {
if (b % i == 0) {
if (i == b / i)
... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long n, z, a;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
z += a * i;
}
cout << z;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int boys, girls;
cin >> boys;
vector<int> boy;
vector<int> girl;
map<int, int> b;
for (int i = 1; i <= boys; i++) {
int temp;
cin >> temp;
boy.push_back(temp);
b[temp]++;
}
cin... | 2 |
#include <bits/stdc++.h>
using namespace std;
int oo = 1000000000;
int arr[100100];
long long newprice[100100];
long long ans = 0, s;
int n;
bool valid(long long k) {
long long sum = 0;
for (int i = 1; i <= n; ++i) newprice[i] = arr[i] + i * 1LL * k;
sort(newprice + 1, newprice + n + 1);
for (int i = 1; i <= k;... | 3 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string s;
long long flag = 1;
cin >> s;
for (long long i = 0; i < s.size(); i++) {
if (s[i] == 'W' && s[i + 1] == 'U' && s[i + 2] == 'B') {
i += 2;
if (!flag) {
cout... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[4][4];
int n;
cin >> n;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> arr[i][j];
}
}
int minimC = 100001;
int minimB = 100001;
for (int i = 0; i < 4; i++) {
if (arr[i][0] < minimC) {
minimC = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[100009], n, x, cur = -1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > cur + 1) {
cout << i << endl;
return 0;
}
cur = max(cur, x);
}
cout << -1 << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 7;
const long long INF = 1e9 + 10;
const long long INF64 = 1e18;
const long long MOD = 1e9 + 7;
const long long MODLL = 1e10 + 13;
const long long base = 311;
queue<int> que;
long long n, a[N], dp[N];
int main() {
ios_base::sync_with_stdio(false)... | 4 |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
return cout << "(" << p.first << ", " << p.second << ")";
}
template <typ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxnode = 8e5 + 5;
int ch[800005][26], sz;
char str[800005];
bool vis[800005][2];
int match[800005];
vector<int> val[800005][2];
void init() {
sz = 1;
memset(ch[0], 0, sizeof(ch[0]));
}
void Insert(char *s, int id, int v) {
int u = 0;
int len = strlen(s);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long modulo(long long a, unsigned long long b, int n) {
long long x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) x = (x * y) % n;
y = (y * y) % n;
b /= 2;
}
return (x % n);
}
long long inversemod(long long n) {
return modulo(n, 1000000007 - 2, 1000... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, b = 0, c = 0, max = 0;
cin >> n;
int data[n];
for (int i = 0; i < n; i++) {
cin >> data[i];
if (data[i] == 1) {
a++;
} else if (data[i] == 2) {
b++;
} else if (data[i] == 3) {
c++;
}
}
int arr[] = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string s;
bool bad;
vector <int> goal (int K, string cv)
{
//cout << K << " " << cv << "\n";
vector <int> ans;
if (K == 1)
{
if (cv[0] == '1')
{
if (cv[1] == '0')
{
ans.... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
struct node {
int x, y, z, id;
bool operator<(const node& b) const {
if (x != b.x) return x < b.x;
if (y != b.y) return y < b.y;
return z < b.z;
}
} a[100005];
int main() {
while (~scanf("%d", &n)) {
int num = 1, ans = -1, ans1, ans2;
for ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 256;
int n, lena, lenb, now;
bool flag;
char s[9];
string E[N], T[N], F[N];
bool cmp(string a, string b) {
lena = a.size(), lenb = b.size();
if (lena != lenb) return lena < lenb;
return a < b;
}
bool update(string& a, string b) {
if (a == "" || cmp(b, ... | 5 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a,cou,m[101];
cin>>a;
for(int i=0;i<a;i++){
cin>>m[i];
}
cou=0;
for(int i=0;i<a;i++){
for(int j=0;j<=a-2-i;j++){
if(m[j]>m[j+1]){
swap(m[j],m[j+1]);
cou++;
}
}
}
for(int i=0;i<a;i++){
cout<<m[i];... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
template <class T, class U>
inline void add_self(T &a, U b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
template <class T, class U>
inline void min_self(T &x, U y) {
if (y < x) x = y;
}
template <class T, class U>
inline void ma... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j, c, k, count = 0;
cin >> n;
for (i = 1; i <= n; i++)
for (j = i; j < n; j++) {
c = i * i + j * j;
k = sqrt(c);
k *= k;
if (c > n * n) break;
if (k == c) count++;
}
cout << count << endl;
return 0... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int b[100005], add[100005];
bool ok(int x, int n, int m, int w) {
for (int i = 1; i <= n; i++) b[i] = a[i];
memset(add, 0, sizeof add);
int now = 0;
for (int i = 1; i <= n; i++) {
now += add[i];
b[i] += now;
if (b[i] < x) {
int go = ... | 3 |
#include <bits/stdc++.h>
const int OO = 1e9;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
set<int> s1, s2;
for (int i = (0); i < (int)(m); ++i) {
int t1, t2;
cin >> t1 >> t2;
s1.insert(min(t1, t2));
s2.insert(max(t1, t2));
if (*s1.rbegin() >=... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct planet {
int buy[111];
int sell[111];
int num[111];
} plan[11];
struct value {
int val;
int place;
} v[111];
bool cmp(struct value a, struct value b) { return a.val > b.val; }
int main() {
int n, m, kk;
cin >> n >> m >> kk;
for (int i = 0; i < n; i++)... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r, g, b;
cin >> r >> g >> b;
int a[3] = {r, g, b};
int i = 0;
while (a[0] > 0 || a[1] > 0 || a[2] > 0) {
if (a[i % 3] > 0) a[i % 3] -= 2;
i++;
}
cout << 30 + i - 1;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int A[100005], s;
int main() {
int a, b, m, r;
cin >> a >> b >> m >> r;
for (; !A[r]; r = (r * a + b) % m) A[r] = ++s;
cout << (s - A[r] + 1);
return 0;
}
| 2 |
#include<stdio.h>
long long t,tt;
long long a[100001],s[100001];
int b[100001],flg[100001];
int main(void)
{
int n,q,i,j,c[1000],x;
scanf("%d %lld %d",&n,&t,&q);
for(i=1;i<=n;i++){
scanf("%lld %d",&a[i],&b[i]);
flg[i]=0;
}
for(i=1;i<=q;i++) scanf("%d",&c[i]);
for(i=1;i<n;i++){
if(b[i]==1&&b[i+1]==2&&a[i+1]... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
bool grid[310][310];
bool vis[310][310][8];
pair<int, int> inc[8];
pair<int, int> change[8];
int main() {
inc[0] = {1, 0};
inc[3] = {-1, 0};
inc[6] = {0, -1};
inc[7] = {0, 1};
inc[1] = {1, 1};
inc[2] = {1, -1};
inc[4] = {-1, 1};
inc[5] = {-1, ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int T;
cin >> T;
while (T--) {
long long int n, k, l;
cin >> n >> k >> l;
vector<long long int> arr(n);
for (long long int i = 0; i < n; i++) cin >> arr[i];
arr.push_back(-2e9 + 10);
bool bo = true;
long long int pt =... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void checkmin(T &a, const T &b) {
if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, const T &b) {
if (b > a) a = b;
}
const int inf = 1e9 + 10;
const int maxn = 2e5 + 10;
int a[maxn], n;
long long bit[maxn];
map<int, vector<int>... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
const long double PI = 3.141592653589793238462643383279502884197;
priority_queue<int, vector<int>, greater<int>> pq;
vector<int> v[5001];
int n, d;
int num[5001];
int cap[5001];
int pp[5001];
int main() {
int tc;
scanf("%d", &tc... | 5 |
#include <bits/stdc++.h>
using namespace std;
int t = 1000001;
class myData {
public:
int t;
int x;
int y;
int d;
myData(int t, int x, int y, int d) : t(t), x(x), y(y), d(d) {}
bool operator<(const myData &a) const { return (this->t < a.t); }
};
long long exponentMod(long long A, long long B, long long C) ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int a[103];
int main() {
int b;
cin >> b;
int k = 0;
for (int i = 0; i < b; i++) {
cin >> a[i];
}
sort(a, a + b);
for (int j = 0; j < b; j++) {
cout << a[j] << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, z;
cin >> a >> b;
long long c = a + b;
vector<long long> v;
while (a > 0) {
z = a % 10;
if (z) v.push_back(z);
a /= 10;
}
a = 0;
for (int i = v.size() - 1; i >= 0; i--) {
a *= 10;
a += v[i];
}
v.clear();
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, s = 0;
cin >> n;
int a[8];
for (i = 0; i < 7; i++) cin >> a[i];
i = 0;
while (n > s) {
s += a[i % 7];
i++;
}
if (i % 7 == 0)
cout << 7;
else
cout << i % 7;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const lli INF = 1LL<<60;
const lli MAXH = 101;
const lli MAXW = 101;
const string D = "ESWN";
const lli di[4] = {0,1,0,-1};
const lli dj[4] = {1,0,-1,0};
lli H, W, L;
char G[MAXH][MAXW];
lli cost[MAXH][MAXW][4];
int main() {
while(cin >> H >> W >... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
int m;
while (cin >> m, m) {
int a[7], b[7];
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long N, A[50010], S[50010];
int main() {
int i;
scanf("%I64d", &N);
for (i = 1; i <= N; i++) scanf("%I64d", &A[i]);
S[0] = 0;
for (i = 1; i <= N; i++) S[i] = S[i - 1] + A[i];
long long ans = 0;
for (i = 1; i <= N - 1; i++) ans += abs((S[N] / N * i) - S[i]... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, string> > reg[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, r, sc;
string s;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s >> r >> sc;
reg[r].push_back(make_pair(sc, s));
}
for (int i = 1; i <=... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n / 2 > m) {
cout << "NO\n";
return 0;
}
vector<int> X, Y, ans(n, -1);
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
X.push_back(x);
Y.push_back(y);
}
vector<pair<int, int> > L;
for... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
#define mod 1000000007
const int O=2001;
long long fac[10010],inv[10010];
int n,x,y,f[4010][4010],ans=0;
int a[2000005],b[2000005];
inline int C(int n,int m){
return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
inline int Add(int x,int y){
if(x+y<mod)return x+y;
else ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int w=2e5+5;
int n;
struct node
{
int x,y;
}s[w];
bool cmp(node x,node y)
{
return x.x<y.x;
}
bool cmp2(node x,node y)
{
return x.y<y.y;
}
bool ok(int x)
{
ll ans=s[x].x;
for(int i=1;i<=n;i++)
{
if(i==x)
continue;
if(ans>=s[i].x)
an... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int t, n, x;
cin >> t;
while (t--) {
cin >> n >> x;
if (n <= 2)
cout << 1 << "\n";
else
cout << ((n + x - 3) / x) + 1 << "\n";
}
}
| 1 |
#include<iostream>
#include<sstream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fr(i,c) for(__typeof(c.begin()) i=c.begi... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,p,d1,d2,mp,md;
while(cin >> n,n){
md = -1;
for(int i = 0;i < n;i++){
cin >> p >> d1 >> d2;
if(d1 + d2 > md){
mp = p;
md = d1 + d2;
}
}
cout << mp << " " << md << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010], k[100010], mn[100010];
int main() {
int N, i, ans = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", a + i);
b[i] = a[i] + i;
}
mn[N] = 2000000000;
for (i = N - 1; i >= 0; i--) {
mn[i] = min(mn[i + 1], b[i]);
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; ++i) {
set<char> s;
s.insert(a[i]);
s.insert(b[i]);
s.insert(c[i]);
ans += s.size() - 1;
}
cout << ans << '\n';
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int h,w,n,y,x;
string s,t;
cin>>h>>w>>n>>y>>x>>s>>t;
int u=1,d=h,l=1,r=w;
for(int i=n-1; i>=0; --i){
if(t[i]=='U')d=min(h,d+1);
if(t[i]=='D')u=max(1,u-1)... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long N = 2e5 + 7;
const int mod = 1e9 + 7;
bool cmp(const pair<long long, long long>& a,
const pair<long long, long long>& b) {
return a.first < b.first;
}
long long median(long long a, long long b, long long c, long long d)... | 2 |
#include <iostream>
#include<cstdio>
#include<vector>
#define inf 0x3f3f3f3f
using namespace std;
vector<int> sons[1010];
int w[1010],dp[1010];
int tmp[1010][5050];
bool ok=true;
void dfs(int x){
int sum=0;
for(int i=0;i<(int)sons[x].size();i++) dfs(sons[x][i]);
if(!ok) return;//在ok已经是false的状态下，不要再进行tmp的计算了，否则会... | 0 |
#include <bits/stdc++.h>
const int N = 1000001;
using namespace std;
int a[N];
int main() {
long long n;
long long k;
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long j = 0;
long long ans = 0;
for (long long i = 0; i < n; i++) {
while (a[i] - a[j] > k) {
j++;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 101, MAXM = 10001;
int n, m, S, T, s[MAXN], t[MAXN], vis[MAXN], dis[MAXN][MAXN], dp[MAXN], g[MAXN],
e, K;
bool pass[MAXN][MAXN];
int dfs(int u, int M) {
if (u == M) return dp[M];
if (vis[u]) return g[u];
vis[u] = 1;
g[u] = 0;
for (int i = 1; i... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int grid[N][N];
int main(void) {
string str;
getline(cin, str);
set<char> s;
for (int i = 0; i < str.size(); i++) {
if (str[i] >= 'a' and str[i] <= 'z') s.insert(str[i]);
}
cout << s.size() << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T mod_v(T num) {
if (num >= 0)
return num % 1000000007;
else
return (num % 1000000007 + 1000000007) % 1000000007;
}
template <class T>
inline T gcd(T a, T b) {
a = abs(a);
b = abs(b);
while (b) {
a = a % b;
swap(a, b);
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, m, n, p, u, x, a[1005], v[1005], w[1005];
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
n = s.size();
if (s[n - 1] == 49) {
cout << 0;
return 0;
}
for (s[n - 1] = 0; i < n; i++) s[i] &= 3;
for ... | 4 |
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 998244353;
using ll = long long;
using namespace std;
ll dp[3050][3050];
int main(){
int n; ll s;
cin >> n >> s;
vector<ll> a(n);
for( auto &k : a ) cin >> k;
dp[0][0] = 1;
for( int i = 0; i < n; ++i ){
for( int j = 0; j <=... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 5;
char a[maxN];
int len, nex[maxN];
set<int> st;
void cal_next() {
nex[0] = nex[1] = 0;
int k = 0;
for (int i = 2; i <= len; i++) {
while (k > 0 && a[k + 1] != a[i]) k = nex[k];
if (a[k + 1] == a[i]) k++;
nex[i] = k;
}
}
int main(... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 7e5 + 10;
const long long mod = 978123409;
const long double pi = 3.14159265359;
long long st[4 * maxn];
long long st1[4 * maxn];
struct tk {
pair<long long, long long> get(long long id, long long left, long long right,
... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.