solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (ll i = 0; i < n; i++)
#define re return
#define fi first
#define mp make_pair
#define se second
#define sz(a) (int)a.size()
typedef long long ll;
const ll mod = 1e9 + 7, ma1 = 8, ma = 2 * 16 * 1024;
int n, nm, num[2 * ma];
vector<int> e[100000], r... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 215;
const long long oo = 1e18 + 5;
const long long mod = 1e9 + 7;
bool div11(int b, int d) { return (b + 1) % d == 0; }
bool div3(int b, int d) { return b % d == 1; }
bool div2(int b, int d) {
for (int i = 2; i <= d; i++) {
if (d % i) continue;
if... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k1 = 0, k2 = 0, ans = 0;
int m[100];
int p[100];
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> m[i];
if ((k1 == k2) && (k1 != 0)) {
p[ans] = abs(m[i] - m[i - 1]);
ans++;
}
if (m[i] % 2 == 0)
k1++;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[50], b[50];
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
memcpy(b, a, sizeof(a));
sort(b, b + n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] == b[j]) {
if (j == n - 1)
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double Pi = acos(-1);
const long long oo = (long long)(1e17);
vector<int> p;
vector<bool> used;
vector<vector<int>> g;
vector<vector<int>> comp;
vector<vector<int>> idx;
int cnt, n;
void dfs(int u, int com) {
comp[com].push_back(p[u]);
idx[com].push_back(u);
use... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
deque<int> deq;
vector<int> vec;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int in;
cin >> in;
vec.push_back(in);
}
deque<int>::iterator d... | 2 |
#include<iostream>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
string s;
cin>>s;
s[k-1]+='a'-'A';
cout<<s;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct Point {
long long x, y;
Point() {}
Point(long long _x, long long _y) { x = _x, y = _y; }
Point operator-(const Point &q) const { return Point(x - q.x, y - q.y); }
long long operator&(const Point &q) const { return x * q.y - y * q.x; }
} p[2013];
bool vis[20... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, i, j;
bool ans = true;
string board[105];
cin >> n;
for (i = 0; i < n; i++) cin >> board[i];
for (i = 0; i < n && ans; i++) {
for (j = 0; j < n && ans; j++) {
x = 0;
if (i - 1 >= 0)
if (board[i - 1][j] == 'o') x++;
... | 1 |
#include <iostream>
int main() {
using namespace std;
int a,b;
cin >> a >> b;
cout << a*b << " " << a*2+b*2 << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6;
int main() {
int n, l, r;
cin >> n >> l >> r;
long long mnSum = 0, mxSum = 0, curL = 1, curR = 1;
for (int i = 1; i <= n; i++) {
mnSum += curL;
mxSum += curR;
if (l) curL *= 2, l--;
if (!l) curL = 1;
if (r - 1) curR *= 2, r--... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x;
a = x;
vector<int> v;
do {
v.push_back(x % 2);
x = x / 2;
} while (x > 0);
for (int i = v.size() - 1; i >= 0; i--) {
if (v[i] == 1) {
if (a % 2 == 0) {
cout << i + 1 << " ";
} else {
cout... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN=100000+5;
int n,m,dp[MAXN],x,y,deg[MAXN],ans;
vector<int> V[MAXN];
int main(){
cin>>n>>m;
for(int i=0;i<m;++i) cin>>x>>y,++deg[y],V[x].push_back(y);
queue<int> Q;
for(int i=1;i<=n;++i) if(!deg[i]) Q.push(i);
while(Q.size()){
int p=Q.front(); Q.pop();
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
cin >> str;
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
reverse(str.begin(), str.begin() + i);
}
}
cout << str;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, s = 2015;
printf("2000\n");
for (i = 1; i <= 1000; i++) printf("%d 1 %d 2\n", i, i);
for (i = 1000; i >= 1; i--) printf("%d 1 %d 2\n", i, i);
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int N;
int in[502], out[502], W[502], S[502], V[502];
int getmax[502][1002];
vector<int> in1[502], in2[502];
int getMax(int x, int w) {
if (getmax[x][w] != -1) return getmax[x][w];
if (w < W[x]) return 0;
getmax[x][w] = V[x];
vector<pair<int, int> > rem1, rem2;
fo... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
int m;
int ans;
bool col;
string s, t;
int d1, d2, d3;
int main() {
cin >> d1 >> d2 >> d3;
cout << min(min(d1 + d2 + d3, d1 * 2 + d3 * 2),
min(d2 * 2 + d3 * 2, 2 * d1 + 2 * d2));
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int p[105], q[105], s[105], t[105];
int n, k, t1, t2, i;
void c1() {
for (int j = 1; j <= n; j++) t[j] = s[q[j]];
for (int j = 1; j <= n; j++) s[j] = t[j];
}
void c2() {
for (int j = 1; j <= n; j++) t[q[j]] = s[j];
for (int j = 1; j <= n; j++) s[j] = t[j];
}
int mai... | 2 |
#include<bits/stdc++.h>
using namespace std;
using Lint=long long;
const int INF=1e9;
int main()
{
int H,W,h,w; cin>>H>>W>>h>>w;
if(H%h==0 and W%w==0){ cout<<"No"<<endl; return 0; }
cout<<"Yes"<<endl;
Lint sum=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
int x=0;
if(i%h==0 an... | 0 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = INF * (long long)INF;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> ch(n);
for (int i = (0); i < (n); i++) {
ch[i] = i;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e9 + 7;
long long n, m, k;
long long dp[105][100005];
long long c[105];
long long a[105][105];
int POW(long long a, long long pow) {
long long r = 1;
while (pow) {
if (pow % 2 == 1) {
r = r * a;
}
a = a * a;
pow /= 2;
r %= N;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
long long int n, i, s = 0, x, f, m;
cin >> n;
long long int a[n];
for (i = 0; i < n; i++) cin >> a[i];
cin >> x >> f;
for (i = 0; i < n; i++) {
if (a[i] > x) {
m = a[i] - x;
if (m % (f + x) == 0)
s = s + m / (f + x)... | 6 |
#include "bits/stdc++.h"
using namespace std;
int main(){
int N;
cin>>N;
cout<<((N/10)%111==0||(N%1000)%111==0?"Yes":"No")<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int M, K, N, S, Kin, cnt;
int a[500010];
int s[500010];
int b[500010];
int t[500010];
int main() {
scanf("%d%d%d%d", &M, &K, &N, &S);
for (int i = 1; i <= M; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= S; ++i) {
int t;
scanf("%d", &t);
s[t]++;
if (s[... | 4 |
#include <iostream>
#include <algorithm>
#include <vector>
int main()
{
int n; std::cin >> n;
int k; std::cin >> k;
int* T = new int[k];
for (int i=0; i<k; i++) std::cin >> T[i];
std::sort(T, T+k);
for (long long int i=0; i<(1<<(n-k)); i++) {
long long int index = 0;
std::vector<int> output;
long long in... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
void header() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void solve() {
long lo... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, c = 0, n;
cin >> n;
char s[n];
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i <= n; i++) {
if (s[i] == '1')
c++;
else {
cout << c;
c = 0;
}
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define MOD 998244353
using namespace std;
typedef long long ll;
ll best[3030][3030], a[3030], N, S;
int main() {
cin>>N>>S;
for(int i=1;i<=N;++i) {
cin>>a[i];
}
best[0][0] = 1;
for(int i=1;i<=N;++i) {
for(int j=0;j<=S;++j) {
best[i][j] = 2LL*best[i-1][j];
if(j >= ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1e9 + 7;
long long n, m, ans;
void upd(long long &x, long long v) { x = (x + v) % Mod; }
int main() {
cin >> n >> m;
ans = (n % Mod) * (m % Mod) % Mod;
for (long long i = 1, j; i <= m; i = j + 1) {
long long now = n / i;
if (now > 0) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m], c[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i][j] = 0;
}
}
for (int j = ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int T, n;
string s;
int main() {
scanf("%d", &T);
for (int tc = 1; tc <= T; tc++) {
cin >> n >> s;
vector<int> v;
for (int i = 0, j = 0; i < n; i = j) {
while (j < n && s[i] == s[j]) j++;
v.push_back(j - i);
}
int ans = 0;
n = v.size(... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int b, k;
int a[100005];
int cnt_odd = 0, cnt_even = 0;
ios_base::sync_with_stdio(false);
cin >> b >> k;
for (int i = 0; i < k; ++i) {
cin >> a[i];
if (a[i] % 2)
cnt_odd++;
else
cnt_even++;
}
if (b % 2 == 0) {
if (a[k... | 1 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int n,k;
int dp[102][4][2];
int yt[102];
void debug(){
for(int d=0;d<=n;d++){
printf("%2d ",d);
for(int i=1;i<=3;i++){
printf("(%5d,%5d) ",d,dp[d][i][0],dp[d][i][1]);
}
cout << endl;
}
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int t = 1;
while (t--) {
string s;
long long a, c = 0;
cin >> s;
for (int i = 0; i < s.size(); i++)
if (s[i] % 4 == 0) c++;
for (int i = 0; i < s.size() - 1; i++) {
if ((s[i] * 10 + s[i + 1]) % 4 == 0... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int a, b, c, d;
cin >> a >> b >> c >> d;
if (a > b && c > d) {
if ((a - b) % (c - d) == 0) {
cout << b + (((a - b) / (c - d)) * c) << endl;
} else {
cout << b + (((a - b) / (... | 1 |
#include <bits/stdc++.h>
int main() {
std::string s;
std::cin >> s;
std::string s2("hello ");
int p = 0;
for (char c : s) {
if (p < 5 && s2.at(p) == c) {
p++;
}
}
if (s2.at(p) == ' ') {
std::cout << "YES";
} else
std::cout << "NO";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 50005, M = N * 17, mod = 1e9 + 7;
inline void gmin(int &x, int y) {
if (x > y) x = y;
}
inline void gmax(int &x, int y) {
if (x < y) x = y;
}
inline void ch(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
}
struct node {
int to, next, cap;
} p[M << ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 2000;
long long c[maxn], ans = -0x7fffffff, ansi, ansj, a[maxn], b[maxn], top, bot;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0) {
b[top++] = i;
c[i] = c[i - 1];
} else
c[i... | 1 |
#include<iostream>
using namespace std;
int main(){
int d,n,i,j;
cin >> d >> n;
if(n == 100)n++;
j = 1;
for(i = 0;i < d;i++) j *= 100;
n *= j;
cout << n << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 9223372036854775807ll;
const int inf = 2147483647, dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
pair<int, int> a, b, c;
bool ok[1005][1005], ok2[1005][1005], ok3[1005][1005];
vector<pair<int, int> > sol;
bool check(pair<int, int> x) {
return x.first >... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 110;
int x[MAX_N], N, nr[MAX_N];
int main() {
cin >> N;
for (int i = 1; i <= N; ++i) cin >> x[i];
sort(x + 1, x + N + 1);
int l = 1, r = N, ans = 0;
while (l <= r) {
int mid = (l + r) / 2, aux = 0, curr = 1;
bool ev = true;
for (int i... | 3 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define MAX_N 111111
typedef long long int ll;
int W,H;int N;
ll A[MAX_N];ll B[MAX_N];
int main()
{
scanf("%d%d%d",&W,&H,&N);
for(int i=0;i<N;i++){
scanf("%lld%lld",&A[i],&B[i]);
}
if(N&1){
int n=N/2;ll x,y;vector<ll>X,Y;
for(int i=0;i<N;i++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
int mn = INT_MAX, mx = INT_MIN, amaz = 0;
for (int i = 0; i < n; i++) {
if (i != 0) {
if (arr[i] > mx) {
amaz++;
mx = arr[i];
}
if (arr[i... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
const int INF = 1e9;
const int N = 2e6;
inline long long mul(long long a, long long b) {
long long tmp = (a * b - (long long)((long double)a / MOD * b + 1e-8) * MOD);
return tmp < 0 ? tmp + MOD : tmp;
}
long long qpow(long long a, long long b) {... | 4 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const int MAX = 5 * 1000 + 47;
const int MOD = 1000 * 1000 * 1000 + 7;
int A[10][10];
int P[10];
bool has(int i, int val) {
for (int j = (0); j < (6); j++) {
if (A[i][j] == val) return true;
}
r... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int Size = 1024;
const int mod2 = 998244353;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int maxn = 4e5 + 15;
const int base = 307;
long long a[maxn];
map<long long, long long> mp;
int main() {
long long n;
scanf("%lld", &n);
long long ans = 0;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5;
int n, eu[mxN], ev[mxN], ans[mxN];
vector<int> adj[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i < n; ++i) {
cin >> eu[i] >> ev[i], --eu[i], --ev[i];
adj[eu[i]].push_back(i);
adj[ev[i]].push_back... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
struct Node {
int l, r, del, s;
} t[MAX * 8];
struct node {
int v, next;
} g[MAX * 2];
int adj[MAX], l[MAX], r[MAX], e, n, m, level[MAX], idx, deg[MAX];
int E[MAX][2], tr[MAX * 2], st, f[MAX], cnt, id[MAX], h[MAX];
void add(int u, int v) {
g[e]... | 4 |
#include <bits/stdc++.h>
using namespace std;
int Count(int a) {
int l = 0;
if (a / 10 == 0) {
return 1;
}
while (a / 10) {
l += 1;
a /= 10;
}
return l;
}
int main() {
int n = 0, a = 0, b = 0, c = 0, p = -1;
cin >> a >> b >> c;
int ans = 1;
int bl = Count(b);
for (int i = 1; i <= 1e6; ... | 2 |
#include <bits/stdc++.h>
using namespace std;
void printarray(long long int arr[], long long int n) {
for (long long int i = 0; i < n; i++) {
printf("%I64d ", arr[i]);
}
printf("\n");
}
int main() {
int n;
scanf("%d", &n);
pair<int, int> ap[n], bp[n];
for (int i = 0; i < n; i++) {
scanf("%d", &ap[... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int i;
int bons = 0;
cin >> n >> k;
if (n == 2) {
}
if (k >= n) {
cout << -1 << '\n';
} else {
cout << n - k << " ";
for (i = 1; i <=... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,d;
cin >> N;
map<int,int> mp;
for(int i=0; i<N; ++i){
cin >> d;
mp[d]++;
}
cin >> N;
for(int i=0; i<N; ++i){
cin >> d;
if(--mp[d]<0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| 0 |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<vector<int> > G;
vector<bool> used;
vector<int> rings;
int rec(int pos)
{
used[pos] = true; int ret = 1;
for(int i = 0; i < rings[pos]; i++)
{
if(!used[G[pos][i]])
{
ret = max(ret, re... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 100);
long long a;
long long n;
long long ans = -1;
signed main() {
cin >> n >> a;
while (n--) {
long long x, y;
cin >> x >> y;
if ((x * 100 + y) <= a * 100) ans = max(ans, (100 - y) % 100);
}
cout << ans << "\n... | 1 |
#include<iostream>
#include<cmath>
using namespace std;
struct record
{
char t;
int w, l;
};
void sort( record* a, int n )
{
for( int i = 0; i < n; i++ )
for( int j = n - 1; j >= i + 1; j-- )
if( a[j].w > a[j-1].w )
{
record temp = a[j];
a[j]... | 0 |
#include <cstdio>
using namespace std;
typedef long long LL;
const int N = 3010, mod = 1e9 + 7;
LL power(LL a, LL b)
{
LL c = 1;
for (; b; a = a * a % mod, b >>= 1)
if (b & 1) c = c * a % mod;
return c;
}
int n, q, x, y, a[N];
LL inv2 = power(2, mod - 2);
LL f[N][N], g[N][N];
int main()
{
scanf("%d %d", &n,... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y, num;
};
node e[3001];
int n;
int ans = 0;
int father[3001];
int s[3001];
int outlet[3001];
int sum_out = 0;
bool cmp1(node xx, node yy) { return xx.num < yy.num; }
int find(int x) {
if (father[x] != x) {
father[x] = find(father[x]);
}
ret... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int m = n;
long long c = 1;
while (n > 0) {
n /= 10;
c *= 10;
}
c /= 10;
c *= (m / c) + 1;
cout << c - m;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn], b[maxn];
char c[maxn] = {0};
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[i]--;
for (int i = 1; i <= n; i++) scanf("%d", &b[i]), b[i]--;
set<int> st1, st2;
vector<int> vt... | 6 |
#include <bits/stdc++.h>
using namespace std;
int x;
int i;
int main() {
scanf("%d", &x);
if (x == 1)
printf("1\n");
else if (x == 2)
printf("3\n");
else if (x == 3)
printf("5\n");
else {
if (x % 2 == 1) --x;
if (x % 4 == 2) x += 2;
for (i = 1; i < 1000; i += 2) {
int maxi = ((i ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int> > a(n);
for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
long long mn = 1000000000000;
for (int i = 0; i < n; i++) {
long long H = a[i].first;
long long W = 0;
int cnt = n / 2;
prio... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int p, id;
int t;
friend bool operator<(const node &a, const node &b) { return a.p > b.p; }
} a[1010], b[1010];
vector<node> ans[1010];
int n, m;
int main() {
scanf("%d%d", &n, &m);
int an = 0, bn = 0;
for (int i = 0; i < n; i++) {
int p, t;
... | 2 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int... | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:36777216")
template <class T>
inline T &RD(T &);
template <class T>
inline void OT(const T &);
inline long long RD() {
long long x;
return RD(x);
}
inline double &RF(double &);
inline double RF() {
double x;
return RF(x);
}
inline cha... | 5 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> odd;
vector<int> even;
for (int i = 0; i < n; i++) {
int ai;
cin >> ai;
if (ai % 2)
odd.push_back(ai);
else
even.push_back(ai);
}
if (!odd.size())
cout << 0;
else {
int num = od... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
vector<int> v1, v2;
int main() {
ios::sync_with_stdio(0);
int n, y1;
cin >> n >> y1;
for (int i = 0; i < n; i++) {
int val;
cin >> val;
v1.push_back(val);
}
int m, y2;
cin >> m >> y2;
for (int i = 0; i < m; i++) {
int val;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
string s[105], w;
int n;
char t;
bool vis[105];
map<int, bool> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].size(); j++) s[i][j]... | 1 |
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
//const int mod = 998244353;
sign... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long bp[65536 * 2];
long long check(long long len) {
long long i = 0;
long long cnt = 0;
while (i < n) {
long long j = i;
while (j < n and bp[j + 1] - bp[i] + 1 <= len) j++;
i = j + 1, cnt++;
}
return cnt <= k;
}
int main() {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
char s[100010];
struct trie {
bool leaf;
trie *a[26];
trie() {
leaf = 0;
memset(a, 0, sizeof a);
}
};
trie *rt = new trie();
void insert(char *s) {
trie *r = rt;
for (int b, i = 0; s[i]; ++i) {
b = s[i] - 'a';
if (r->a[b] == 0) r->a[b] ... | 4 |
#include<iostream>
#include<algorithm>
#include<string>
#include<set>
using namespace std;
int main(){
int m;
string s;
cin >> m;
for(int x=0;x<m;x++){
cin >> s;
set<string> ans;
for(int i=1;i<s.size();i++){
string a[2],b[2];
a[0] = a[1] = s.substr(0,i);
b[0] = b[1] = s.substr(i)... | 0 |
#include<iostream>
using namespace std;
int main(){
string S;
cin>>S;
if(S=="ABC")cout<<"ARC"<<endl;
else cout<<"ABC"<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<pair<int, int> > v;
for (int(i) = 0; (i) < (int)(n); ++(i)) {
int temp;
cin >> temp;
v.push_back(make_pair(temp, i));
}
sort((v).begin(), (v).end());
int ans = 0;
vector<int> r;
for (int(i) = 0; (i)... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 7;
vector<int> rastavi;
int is[NMAX], p[NMAX];
void er() {
for (int i = 1; i < NMAX; i++) is[i] = 1;
for (int i = 2; i < NMAX; i++) {
if (!is[i]) continue;
for (int j = 2 * i; j < NMAX; j += i) is[j] = 0;
}
int time = 0;
for (int i =... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 15;
struct Persistent {
int l, r, s;
Persistent() { l = r = s = 0; }
} t[N << 5];
int n, no, avail, root[N];
map<int, int> vis;
int squeeze(int x) {
if (vis.find(x) == vis.end()) vis[x] = ++no;
return vis[x];
}
int update(int pre, int b, int e, i... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
int arr[MAXN];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
sort(arr + 1, arr + n + 1);
cout << (n - 1) / 2 << endl;
int lst = n;
int fst = 1;
for (int i = 1; i <= n; i++) {
if (i % 2) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
int bs(long long int n) {
int mn = 0, mx = v.size(), mid;
while (mn <= mx) {
mid = (mn + mx) / 2;
if (v[mid] < n)
mn = mid + 1;
else if (v[mid] > n)
mx = mid - 1;
else
break;
}
if (v[mid] < n)
return mid... | 3 |
#include<iostream>
using namespace std;
int main(){
long long int s,c;
cin>>s>>c;
if(s>=c/2){
cout<<c/2<<endl;
}
if(c/2>s){
cout<<s+(c-s*2)/4<<endl;
}
return 0;
}
| 0 |
#include <iostream>
using namespace std;
int main(void) {
int n;
cin>>n;
cout<<"ABC"<<n<<'\n';
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ar[123], i, n, a, b, c, d, x, m, z = 1;
cin >> n;
for (i = 0; i < n; i++) cin >> ar[i];
for (i = 0; i < n; i++) {
for (m = i + 1; m < n; m++) {
a = ar[i] + ar[m];
for (x = 0; x < n; x++) {
if (ar[x] == a) {
cout << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long inf = 1e18;
long long mod = 1e9 + 7;
long long delta = 10289;
const long long M = 320;
long long dp[M * M][M];
long long a[M * M];
int main() {
long long n;
cin >> n;
char c, v;
cin >> v;
long long a = 0, b = 0;
for (long long i = 1; i < n; i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
const int INF = 0x3f3f3f3f;
long long n, k, res, vis[26], f[MAXN][MAXN], lst[26];
char s[MAXN];
inline void run() {
cin >> n >> k >> s + 1;
f[0][0] = 1;
for (int i = (int)(1); i <= (int)(n); i++) {
f[i][0] = 1;
for (int j = (int)(1); j <=... | 5 |
#include <bits/stdc++.h>
using namespace std;
set<int> distinctive;
bool Prime(int y) {
for (int i = 2; i <= sqrt(y); i++)
if (y % i == 0 && y != i) return false;
return true;
}
bool composite(int x) {
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0 && x != i) return true;
return false;
}
int main() {... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mx = 1 << 12;
int a[4], ms[4], dp[1007][mx], b[1007];
char c[4][1007];
int main() {
int n, t, inf = 1e9 + 7;
scanf("%d", &n);
for (int i = 0; i < 4; i++) {
scanf("%d", &a[i]);
ms[i] = (1 << (i + 1)) - 1;
}
for (int i = 0; i < 4; i++) scanf("%s", ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MASK = 6561;
const int MAXN = 8;
const int oops = 1000;
int best2[1 << MAXN | 5];
int best[MASK + 5];
long long arr[MAXN + 5];
int n;
int base2(int mask) {
int ret = 0;
for (int b = 1; mask; b <<= 1, mask /= 3) ret += b * (mask % 3 == 1);
return ret;
}
int b... | 3 |
#include <bits/stdc++.h>
using namespace std;
map<int, vector<int> > m;
int count(vector<int> &v1, vector<int> &v2) {
int temp = v1[0], counter = 1, i = 1, j = 0, b = 0;
while (i < v1.size() || j < v2.size()) {
if (!(!b && j < v2.size()) && !(b && i < v1.size())) break;
while (!b && j < v2.size()) {
i... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
struct edge {
int v, nxt;
} e[maxn << 1];
int head[maxn], kt;
int t[maxn], rt, n;
int ans[10], tot;
int sum;
template <typename T>
inline void read(T &x) {
char c;
int f = 1;
while (!isdigit(c = getchar())) (c == '-') && (f = -1);
x = c ^... | 3 |
#include <bits/stdc++.h>
using namespace std;
int dis[11][11][11][11];
int dp[11][11];
char s[2000006];
int main() {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
memset(dp, 0x3f3f3f3f, sizeof dp);
for (int k = 0; k < 10; k++) {
dp[k][(k + i) % 10] = 1;
dp[k][(k + j) % ... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000009;
void solve() {
int n, m, ch = 0;
cin >> n >> m;
string second[n];
int cur = 0;
for (int i = 0; i < n; i++) {
cin >> second[i];
for (int j = 0; j < second[i].length(); j++) {
if (second[i][j] == 'A') ch = 1, cur++;
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 1000;
map<int, set<int>> pos;
vector<pair<int, int>> all_points;
int len;
vector<long long> tree[4 * MAXN];
vector<int> pos_y[4 * MAXN];
void build() {
for (int i = 0; i < all_points.size(); i++) {
int v = len + all_points[i].first;
int y =... | 3 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <string>
#define SIZE 200005
#define MOD 1000000007
using namespace std;
typedef long long int ll;
char str[SIZE];
ll dp[SIZE],rdp[SIZE];
ll solve(int n,int L)
{
dp[1]=1;
rdp[1]=1;
for(int i=2;i<=n;i++)
{
dp... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, m;
long long k;
long long a[22][22];
long long ans;
int tt;
map<long long, long long> up[22][22];
map<long long, long long> down[22][22];
queue<long long> q;
void up_dfs(int x, int y) {
int xx = x + 1, yy = y;
if (xx + yy <= tt) {
ma... | 6 |
#include <bits/stdc++.h>
using namespace std;
int ace_it(string& s) {
int sum = 1;
for (int i = 1; i < s.length(); i++) {
if (s[i] == '1')
sum += 10;
else
sum += s[i] - '0';
}
return sum;
}
int main() {
string s;
cin >> s;
cout << ace_it(s);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int len = (int)str.size();
int next = 0;
if (str[0] == 'h') {
cout << "http://";
next = 4;
} else {
cout << "ftp://";
next = 3;
}
int stop = 0;
for (int i = next; i < len; i++)
if (str[i] == 'r' && s... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> m;
map<int, int>::iterator it;
int n, p;
void inc(int x) {
m[x]++;
if (m[x] == 2) {
m[x] = 0;
p--;
inc(x + 1);
}
}
int main() {
int i, x;
scanf("%d", &n);
p = n;
for (i = 0; i < n; i++) {
scanf("%d", &x);
inc(x);
}
it = m.... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long num[200010];
int main() {
long long n, k;
long long ans = 0;
scanf("%I64d%I64d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%I64d", &num[i]);
for (int i = 1; i <= n; i++) {
int tmp = (num[i] + num[i - 1]) / k;
if ((num[i] + num[i - 1]) % k <= n... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long mem[20];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long a, b, cnt = 0;
cin >> a >> b;
a *= b;
a--;
b--;
a /= b;
cout << a << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, odd = 0, even = 0, res = 0, i;
cin >> n;
int arr[n], evenArr[n], oddArr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (i = 0; i < n; i++) {
if (arr[i] % 2) {
evenArr[even++] = arr[i];
} else {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
void Correct() {
for (int i = 0; i < n - 1; i++) cout << i + 1 << " " << i + 2 << "\n";
}
void In_Correct() {
if (n % 2 == 0) {
for (int i = 2; i <= n / 2 + 1; i++)
cout << "1"
<< " " << i << "\n";
for (int i = n / 2 + 2; i <= n; i++)
... | 3 |
#include <bits/stdc++.h>
using namespace std;
void prt(long long num) {
for (long long i = 0; i < 45; i++) {
if ((1ll << i) & num)
cout << "1";
else
cout << "0";
}
cout << "\n";
}
long long l, r, k, min_ = 1e12;
long long ar[5][5];
void ff(), ss(), tt(), fo();
int main() {
cin >> l >> r >> k... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.