solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
char c;
while (cin >> a >> c) {
if ((a - 1) % 4 > 1) a -= 2;
long long ans = a - 1;
long long b = a / 4;
a -= b * 2;
ans += 6 * (a - 1);
if (c > 'c')
ans += 'f' - c + 1;
else {
ans += 3;
ans += c ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int V;
cin >> V;
vector<vector<int>> d(V, vector<int>(V));
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
cin >> d[i][j];
}
}
long long res = 0;
for (int i = 0; i < V; i++) {
for (int j = 0; j < i; j++) {
res += min(d[i][j], d[j... | 0 |
#include <bits/stdc++.h>
const int inf = 1e9;
long long a[100005], f[65][100005], U;
int n, s[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
long long M = *std::max_element(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i) a[i] = M - a[i];
for (int i = 0; i <= 63; ++i)... | 4 |
#include <bits/stdc++.h>
long long int add(long long int x, long long int y) {
long long int res = x + y;
return (res >= 1000000007 ? res - 1000000007 : res);
}
long long int mul(long long int x, long long int y) {
long long int res = x * y;
return (res >= 1000000007 ? res % 1000000007 : res);
}
long long int s... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool no(int x) {
int a[10];
for (int i = 0; i < 10; i++) a[i] = 0;
for (int i = 0; i < 4; i++) {
a[x % 10]++;
if (a[x % 10] > 1) return 0;
x /= 10;
}
return 1;
}
int main() {
int n, i, k = 0, t, j, a[15], b[15], c[15], l, o, q, w, y[15][15] = {0}, u;... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e7;
const int md = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> v;
int x = n;
set<int> st;
for (int i = 1; i <= n; ++i) {
st.insert(i);
}
int s = 1;
bool b = 1;
while (!st.empty()) {
v.push_back(s);
st.erase(s);
if (s... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
int n, m, c, p[N * N], comp[N][N], dist[3][N][N];
char g[N][N];
bool vis[N][N];
vector<vector<pair<int, int> > > bord;
set<pair<int, int> > add;
int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
bool check(int x, int y) {
return x >= 0 && x < n && y >= 0... | 3 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
const int inf = 1e9;
struct road{
int dist;
int cost;
int to;
road(int d, int c, int t): dist(d), cost(c), to(t){}
bool operator < (const road &a) const{
return (dist==a.dist)? cost > a.cost : d... | 0 |
#include <bits/stdc++.h>
using namespace std;
int sum[30], res[30], num[30];
map<string, int> ma, ma1;
vector<string> s[1000000], ss[1000000];
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "? 1 1"
<< "\n";
fflush(stdout);
string s3;
cin >> s3;
fflush(stdout);
cout << "! " <<... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e6 + 5, mod = 1e9 + 7;
int n, k;
long long fac[maxn], pre[maxn], suf[maxn], y[maxn], inv[maxn];
long long pow_mod(long long a, long long b) {
a %= mod, b %= mod - 1;
if (!a) return 0;
long long ans = 1;
while (b) {
if (b & 1) ans = ans * ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0.0);
struct arr {
long long index, val;
};
struct query {
long long n, ind, index, ans;
};
bool compare(arr a1, arr a2) {
if (a1.val == a2.val) return (a1.index < a2.index);
return (a1.val > a2.val);
}
bool compare2(arr a1, arr a2) {... | 4 |
#include <bits/stdc++.h>
const int N = 3e3 + 7;
using namespace std;
inline long long read() {
long long x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
retu... | 5 |
#include <bits/stdc++.h>
#pragma GCC optimize(2, 3, "Ofast")
using namespace std;
int n;
int a[5005], ans, nxt;
unordered_map<int, int> re;
int cnt[5005];
inline void fix(int &x) {
int fu = 1;
if (x < 0) fu = -1, x = -x;
for (register int i = 2; i * i <= x; i++)
while (x && x % (i * i) == 0) x /= (i * i);
x... | 4 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int n, a[21], bs, rs;
pair<int, int> b[21], r[1 << 21];
void go(int f, int bf, int t, int o, int p) {
if (!o || b[p].second) {
if (p) go(f, t, bf, 0, p - 1);
for (int i = 0; i < b[p].first; i++) r[rs].first = f, r[rs++].s... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int y, b, r;
cin >> y >> b >> r;
cout << 3 * min(y + 1, min(b, r - 1)) << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, a[200001], c[200001], sum, m, yoy;
struct node {
int x, y;
} b[200001], d[200001];
bool cmp(node x, node y) { return x.x < y.x; }
bool check(int z) {
for (int i = 1; i <= n; i++) c[i] = a[i];
for (int i = 1; i <= n; i++) d[i].x = 0, d[i].y = 0;
for (int i = 1... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
long long r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long n, k;
long long fib[100];
void solve() {
scanf("%I64d%I64d", ... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline int popcount(T t) {
if (std::numeric_limits<T>::digits <=
std::numeric_limits<unsigned int>::digits) {
return __builtin_popcount(t);
} else {
return __builtin_popcountll(t);
}
}
const long double EPS = 1e-8;
const long double... | 2 |
#include <bits/stdc++.h>
using namespace std;
unsigned long long b[1000009], c[1000009];
int main() {
unsigned long long n;
cin >> n;
unsigned long long a[n + 1];
unsigned long long sum = 0;
unsigned long long ans = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[a[i]]++;
sum += a[i];
}
for... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
int n, dp[1000], sum, len, i, j, ans = 0;
const int mod = 1000000007;
cin >> s1 >> s2 >> n;
memset(dp, 0, sizeof(dp));
dp[0] = 1, len = ((int)s1.size());
for (i = 0; i < n; i++) {
sum = 0;
for (j = 0; j < len; j++) {
s... | 4 |
#include <bits/stdc++.h>
using namespace std;
struct triple {
int a, b, c;
bool operator<(const triple &r) const {
return a != r.a ? a < r.a : b != r.b ? b < r.b : c < r.c;
}
};
vector<triple> V;
int main() {
int n, res(0);
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int k, c(0), val, x, y, m, n... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, k;
set<int> st;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &k);
st.insert(k);
}
if (st.size() < 3) {
puts("YES");
return 0;
}
if (st.size() > 3) {
puts("NO");
return 0;
}
auto it = st.begin();
... | 2 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
for (long long j = 0; j < t; j++) {
long long a, b, c, d;
cin >> a >> b >> c >> d;
if (b >= a)
cout << b << "\n";
else {
if (c <= d)
... | 1 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
using namespace std;
#define... | 0 |
#include <bits/stdc++.h>
const int INF = 1e9;
const long long int LINF = 1e18;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
using namespace std;
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
fast();
string s, s1, s2;
getline(cin, s);
getline(cin, s1);
getli... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
signed long long a, b, c, d;
cin >> a >> b >> c >> d;
cout << max({b * d, a * c, a * d, b * c}) << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long k[100005], l[100005], cha[10005];
bool cmp(const long long a, const long long b) { return a > b; }
int main() {
long long n, f;
cin >> n >> f;
long long ans = 0;
for (long long i = 1; i <= n; i++) {
cin >> k[i] >> l[i];
ans += min(k[i], l[i]);
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
long long n, flag = 0;
cin >> n;
std::vector<pair<long double, long double> > v(n);
for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
std::vector<long long> ans(n);
lon... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 0, c = 0;
cin >> n;
int a[n - 1];
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
}
sort(a, a + n - 1);
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] - a[i] > 1) {
x = i + 1;
break;
}
}
if (a[0] == 1) {
c... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
long long mini = v[0];
bool flag = 1;
for (long long i = 0; i < n; i++) {
v[i] -= mini;
if (v[i] & 1) {
... | 1 |
#include <bits/stdc++.h>
#define maxn 1000005
#define ll long long
int fin[maxn],suf[maxn][27],ch[maxn][27],tl=1,n;
ll ans;
std::string s[200005];
int cmp(std::string a,std::string b) { return a.length() < b.length(); }
void insert(std::string s) {
std::reverse(s.begin(),s.end());
int rt = 1, n = s.length();
for (... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int m;
int p = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
int arr[m];
for (int j = 0; j < m; j++) {
cin >> arr[j];
}
if (arr[0] == 1) {
p = p + 1;
}
for (int k = 1; k < m; k++) {
if (k != ... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
A cvt(B x) {
stringstream ss;
ss << x;
A y;
ss >> y;
return y;
}
int n;
int d[1 << 16], x[1 << 16];
int main() {
scanf("%d", &n);
queue<int> q;
for (int i = 0; i < (n); i++) {
scanf("%d %d", &d[i], &x[i]);
if (d[i] == 1) q... | 1 |
#include<bits/stdc++.h>
using namespace std;
int n,W,w[109],v[109],dp[100009],ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
memset(dp,0x3f,sizeof(dp));
dp[0]=0;
cin>>n>>W;
for(int i=0;i<n;i++) cin>>w[i]>>v[i];
for(int i=0;i<n;i++)
for(int j=100008;j>=v[i];j--)
dp[j]=min(dp[j]... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<long long, long long>> a(n);
for (long long i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
vector<pair<pair<long long, long long>, long long>> b;
pair<long long, long long> cur = a... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
#include <ctype.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF... | 3 |
#include <bits/stdc++.h>
using namespace std;
void bad(string mes = "Impossible") {
cout << mes;
exit(0);
}
template <typename... T>
void shit(T&... x) {}
template <typename... T>
void dec(T&... x) {
shit(--x...);
}
template <typename... T>
void inc(T&... x) {
shit(++x...);
}
template <typename T>
string bin(T ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int m;
vector<pair<int, int> > g[81];
int minut[81][81];
int dp[81][81][81][81];
long long mini = INT_MAX;
long long rek(int l, int r, int mid, int more) {
if (more == 0) return 0;
if (dp[l][r][mid][more] != 0) return dp[l][r][mid][more];
long long akt = INT... | 4 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int f[45][45][45],a[45][45];
int dfs(int l,int r,int x){
if(f[l][r][x]!=-1) return f[l][r][x];
if(l==x && r==x) return 1;
f[l][r][x]=0;
for(int j=l;j<x;++j)
for(int k=r;k>x;--k)
if(a[j][k]){
for(int p=j;p<x;++p)
for(int q=k;q>x;--q)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
struct node {
int to[26], vis[26], s, siz;
} t[maxn];
vector<pair<int, int> > go[maxn];
vector<pair<int, int> > qr[maxn];
int dfn[maxn], refer[maxn], sig[maxn], len[maxn], dfn_cnt;
int ans[maxn], sav[maxn], siz[maxn], vis[maxn], fa[maxn], dep[maxn... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[210000];
int cnt[110];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int sum = 0;
for (int i = 1; i <= n; i++) {
if (i > 1) putchar(' ');
sum += a[i];
int now = sum;
int ans = 0;
for (int j = 100; j ... | 3 |
#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <time.h>
#define syosu... | 0 |
#include <iostream>
using namespace std;
int main() {
long long n, ans=1;
cin>>n;
for(int i=1; i<=n; i++)
{
ans *= i;
ans = ans%1000000007;
}
cout<<ans;
return 0;
} | 0 |
#include <bits/stdc++.h>
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++) L[i] = arr[l + i];
for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {... | 3 |
#include <bits/stdc++.h>
using std::cerr;
using std::cin;
using std::max;
using std::min;
int n, m, stv, atk, inc, Cn, cnt, tot, so[100005 << 2], Sum[100005 << 2];
long long ans;
std::vector<int> S[100005];
struct info1 {
int Max, h, v;
} A[100005];
struct info2 {
int t, id, v;
friend bool operator<(info2 t1, inf... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int s[N];
int main() {
int t;
scanf("%d", &t);
for (int i = 1; i < 300010; i++) {
s[i] = s[i - 1] ^ i;
}
while (t--) {
int a, b;
scanf("%d%d", &a, &b);
int ans = a;
int flag = s[a - 1];
if (flag == b) {
cout <<... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, n, sum = 0;
cin >> n;
x = n;
for (;;) {
sum = 0;
while (n != 0) {
sum = sum + n % 10;
n = n / 10;
}
if (sum % 4 == 0) {
n = x;
break;
} else {
n = x + 1;
x = n;
continue;
}
}
c... | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<utility>
#include<vector>
#include<numeric>
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
int n;
int solve(vector<string> cities){
int merged[n+1][n+1];
fill_n(merged[0], (n+1)*(n+1), 0);
int length[n+1];
fill_... | 0 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define LL long long
using namespace std;
const int N=2e5+10;
struct dabt{
int next,to; LL dis;
}e[N];
int n,r,c,head[N],k;
bool vis[N];
LL num[N],minr,minc;
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cout.precision(10);
cout << fixed;
int N, M;
cin >> N >> M;
vector<int> state(N);
for (int i = 0; i < N; ++i) {
cin >> state[i];
}
vector<vector<int> > edges(N), invEdges(N);
for (int i = 0; i < M; ++i) {
int x, y;
cin >> x >> y;
... | 1 |
#include <iostream>
using namespace std;
int d, g, s, p[15], c[15], dp[1005];
int main() {
int i, j, k;
cin>>d>>g;
for(i=1; i<=d; i++) cin>>p[i]>>c[i];
for(i=1; i<=d; i++) {
s += p[i];
for(j=s; j>0; j--) for(k=1; k<=p[i] && k<=j; k++) {
dp[j] = max(dp[j], dp[j-k] + k*100*i + (k==p[i])*c[i]);
}
}
for(i=1;... | 0 |
#include"iostream"
using namespace std;
int main()
{
int n;
cin >> n;
cout << (n / 2)*(n - n / 2) << endl;
} | 0 |
//....SARANSH GUPTA....\
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(p,n) for(int i=p;i<n;i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n"
#define mp make_pair
#define pb push_back
#define mod 1000000007
const int N=2e5+5;
i... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxi = 1e6 + 2;
int a[maxi], b[maxi];
int res[maxi];
vector<int> v[maxi];
string s;
int n, m, k;
int ok;
int rem[maxi];
int deg[maxi];
map<pair<int, int>, int> mp;
queue<int> q;
void skloni(int poz) {
while (!q.empty()) {
int x = q.front();
deg[x] = 0;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
long long int x;
cin >> n >> x;
int a, h;
int d = 0, e = 0;
for (int i = 0; i < n; ++i) {
cin >> a >> h;
if (a > d) d = a;
if (a - h > e) e = a - h;
}
int ans = 0;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
string s;
int co[200000];
int main() {
cin >> s;
for (int i = 0; i < s.length(); i++) co[s[i]]++;
for (int i = 'a'; i <= 'z'; i++)
if (co[i] % 2 == 1) {
int tmp = 0;
for (int j = 'z'; j >= 'a'; j--)
if (i != j and co[j] % 2 == 1) {
tm... | 3 |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,d[100001];
int shortestDistance(int k,int l,int r)
{
if(l>r) return min(abs(d[l]-k),abs(d[r]-k));
int m=(l+r)/2;
if (d[m]<k) return shortestDistance(k,m+1,r);
else if(d[m]>k) return shortestDistance(k,l,m-1);
else return 0;
}
int main()
{
fo... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
typedef long long int lli;
const double EPS = 1e-10;
int main(){
int w,h,v,t,sx,sy,gx,gy;
cin>>w>>h>>v>>t>>sx>>sy>>gx>>gy;
lli rad = v*t;
long long int ans=0;
double r2 = rad*rad;
double diff = gx;
for(int x=-gx-2*w*(rad/(2*w)+1); x... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5, MOD = 1e9 + 7;
int A[N];
int mult(int a, int b){
ll ret = (a * 1LL * b) % MOD;
return ret;
}
int main(){
int n, cntr = 0, ans = 1;
cin>>n;
A[0] = -1;
for(int i = 1; i <= n; i++) cin>>A[i];
for(int i = 1; i <= n; i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long d[5010][5010];
long long sum[300010];
int main() {
int n, k;
scanf("%d%d", &n, &k);
int a[300010];
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
a[0] = 0;
sum[0] = 0;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + abs... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b;
c=b+(b-a);
cout<<c<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long maxi = LLONG_MIN;
long long mini = LLONG_MAX;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
fast();
long long n, i, y = 1, fy = 0, mxd = 1;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
y... | 3 |
#include <bits/stdc++.h>
using namespace std;
int eu[500005], ev[500005], ew[500005];
int n, q, tot, st[500005], ed[500005];
int val[2][500005], dist[2][500005];
int dep[500005];
vector<pair<int, int> > G[500005];
void add_edge(int u, int v, int w) {
G[u].push_back(pair<int, int>(v, w));
G[v].push_back(pair<int, in... | 6 |
#include <bits/stdc++.h>
int main() {
int n, i, j, c = 0, p, q, f = 0;
scanf("%d", &n);
scanf("%d", &p);
int a[p];
for (i = 0; i < p; i++) scanf("%d", &a[i]);
scanf("%d", &q);
int b[q];
for (i = 0; i < q; i++) scanf("%d", &b[i]);
for (i = 1; i <= n; i++) {
f = 0;
for (j = 0; j < p; j++) {
... | 1 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long total = n * k;
std::vector<long long> v(total);
for (long long i = 0; i < total; i++) {
cin >> v[i... | 2 |
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
const int maxn = 100005;
const double eps = 1e-8;
int sign(double x) {
if (fabs(x) < eps) {
return 0;
} else {
if (x > 0.00) {
return 1;
} else {
return -1;
}
}
}
double dist(double x1, double y1, double x2, dou... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 200010;
vector<vector<long long int> > multiply(vector<vector<long long int> > a,
vector<vector<long long int> > b) {
long long int n = a.size();
long long int m = b[0].size();
long long int o = a[0].size... | 5 |
#include <bits/stdc++.h>
using namespace std;
using cd = complex<double>;
const int Inf = 2750131;
const int mod = 1000000007;
const double Pi = acos(-1);
void Fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
long long n, ans = 0;
void Solve() {
cin >> n;
for (long long i = 2; i <= n; i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long l, r;
long long s = 0;
cin >> l >> r;
int i = 1;
int j = 1;
while (i <= r) {
j = 1;
while (i * j < l) {
j *= 2;
}
while (i * j <= r) {
s++;
j *= 2;
}
i *= 3;
}
cout << s;
return 0;
}... | 1 |
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <cassert>
using namespace std;
typedef pair<int, vector<string> > P;
int t;
string s;
P f(string s, vector<bool> cut) {
P ret;
string a;
a += s[0];
for(int i = 0; i < cut.si... | 0 |
#include <bits/stdc++.h>
using namespace std;
double a, v, l, d, w;
double t1, t2, t3, s1, s2, s3, ans, rv;
int main() {
scanf("%lf %lf %lf %lf %lf", &a, &v, &l, &d, &w);
t1 = w / a, t2 = v / a, t3 = (v - w) / a;
s1 = t1 * w / 2, s2 = t2 * v / 2, s3 = (v + w) * t3 / 2;
if (v <= w || s1 >= d) {
if (s2 > l)
... | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<long> > g;
vector<long> v, ans;
set<long> used, q;
void bfs() {
long vrt;
while (q.size() == 1) {
vrt = *q.begin();
q.erase(q.begin());
ans.push_back(vrt);
used.insert(vrt);
for (long i = 0; i < g[vrt].size(); ++i) {
--v[g[vrt][i]... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 998244353;
long long int power(long long int a, long long int b) {
long long int ret = 1;
while (b) {
if (b & 1) ret *= a;
a *= a;
if (ret >= MOD) ret %= MOD;
if (a >= MOD) a %= MOD;
b >>= 1;
}
return ret;
}
int main() {... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void ckmin(T &a, const T &b) {
a = min(a, b);
}
template <typename T>
void ckmax(T &a, const T &b) {
a = max(a, b);
}
template <typename... Args>
void logger(string vars, Args &&...values) {
cout << vars << " = ";
string delim = "";
(..., (co... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 210, MaxM = 2010, inf = 1e9;
int N, M;
int S, T;
int Node[MaxN], Ecnt = 1;
struct Edges {
int t, next, f;
} e[MaxM * 2];
void Add(int u, int v, int c) {
e[++Ecnt] = (Edges){v, Node[u], c}, Node[u] = Ecnt;
e[++Ecnt] = (Edges){u, Node[v], 0}, Node[v] = ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n;
int arr[300003];
int pref[300003][3], pE;
int query(int kir, int kan, int tipe) {
if (kan < kir)
return 0;
else
return (kir != 0) ? pref[kan][tipe] - pref[kir - 1][tipe] : pref[kan][tipe];
}
int main() {
scanf("%d", &n);
pref[0][0] = 1;
for (int i =... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int OO = 0x3f3f3f3f;
using namespace std;
long long inv(long long a, long long b) {
return 1 < a ? b - inv(b % a, a) * b / a : 1;
}
long long Pow(long long B, long long P) {
long long R = 1;
while (P > 0) {
if (P & 1) R = (R * B);
P /= 2;
B = (B * B)... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int clients, maxByte;
cin >> clients >> maxByte;
int lowByte, highByte;
cin >> lowByte >> highByte;
vector<pair<int, int> > clientByte;
for (int i = 0; i < clients; i++) {
int lowPic, highPic;
cin >> lowPic >> highPic;
int byteUsage = lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
char str[1000010];
int main(int argc, const char* argv[]) {
scanf("%s", str);
int i = 0;
for (; str[i]; i++)
if (str[i] == 'r') printf("%d\n", i + 1);
i--;
for (; i >= 0; i--)
if (str[i] == 'l') printf("%d\n", i + 1);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
const long long INFLL = 1001001001001001001LL;
template <typename T>
void pv(T a, T b) {
for (T i = a; i != b; ++i) cout << *i << " ";
cout << endl;
}
template <typename T>
void chmin(T& a, T b) {
if (a > b) a = b;
}
template <typename T>
v... | 5 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
int SolveCase() {
int n;
cin >> n;
vector<int> xs(n);
int equal_count = 0;
for (int i = 0; i < n; i++) {
cin >> xs[i];
xs[i]--;
if (i == xs[i]) equal_count++;
}
if (equal_count == n) {
return 0;... | 3 |
#include <bits/stdc++.h>
using namespace std;
void init() {}
const int N = 1e6 + 34;
bool u, d, l, r;
int ans = 1;
int main() {
init();
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if ((s[i] == 'R' && l) || (s[i] == 'L' && r) || (s[i] == 'D' && u) ||
(s[i] == 'U' && d)) {
an... | 3 |
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> a[900000];
long long int s4(long long int x) {
long long int lo = 1, hi = 1000;
while (lo < hi) {
long long int mi = (lo + hi) / 2;
if (mi * mi * mi * mi >= x)
hi = mi;
else
lo = mi + 1;
}
return lo;
}
long long int s2(l... | 3 |
#include<bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using Graph =vector<int>;
typedef pair<ll,int> P;
const ll MAX_N=131072;
int bit[MAX_N*2-1];
ll n;
void add(ll a,ll w){
ll x=a;
while(x<=n){
bit[x]+=w;
x+=x&(-x);
}
}
ll sum(int a){
ll ret=0;... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = int(2e5) + 256;
string s, t;
multiset<char> M;
int ura, opa;
bool u[MaxN];
int main() {
cin >> s >> t;
for (int i = 0; i < t.size(); ++i) M.insert(t[i]);
for (int i = 0; i < s.size(); ++i) {
if (M.find(s[i]) != M.end()) {
M.erase(M.find(s[i]... | 2 |
#include<bits/stdc++.h>
using namespace std;
#define FOR for(int k = 0; k < si2; k++)
#define M(a) ('0'<=a&&a<='9')?(a-'0'+1)%10+'0':a
#define P(a) ('0'<=a&&a<='9')?(a-'0'-1+10)%10+'0':a
int main(){
int n, si, si2;
string str, str2, temp;
cin>>n;
for(int i = 0; i < n; i++){
cin>>str>>str2;
si = str.size(); si2... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ar[105], s[105], a, b;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &ar[i]);
s[0] = 0;
for (int i = 1; i <= n; i++) s[i] = s[i - 1] + ar[i];
scanf("%d%d", &a, &b);
printf("%d\n",
min(abs(s[b - 1] - s[a - 1]), s[n] - ab... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q, n, l, r;
cin >> q;
pair<int, int> p[200005];
while (q--) {
cin >> n;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
cin >> l >> r;
p[i] = make_pair(l, r);
v.pus... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
const long long inf = 1e18 + 1;
bool inp[600][600];
set<int> x[600];
set<int> y[600];
vector<char> ans;
int n;
bool check[600][600];
void dfs(int i, int j) {
check[i][j] = 1;
if (!inp[i][j]) {
ans.push_back('1');
x[i].in... | 5 |
#include <bits/stdc++.h>
std::mt19937_64 rng(
std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
long long mex[10005];
vector<long long> v;
long long y;
long long n;
long long get_mex() {
y++;
for (long long i = 0; i < v.size(); i++) mex[v[i]] = y;
for (long long i = 0; i <= n;... | 4 |
#include<iostream>
using namespace std;
int n,ans=0,maxn=0;
string s;
int main() {
cin>>n>>s;
for(int i=0;i<n;i++) {
if(s[i]=='I') ans++;
if(s[i]=='D') ans--;
if(maxn<ans) maxn=ans;
}
cout<<maxn<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
if (n % 10 == 0)
printf("%d", n);
else if ((n % 10) >= 5) {
printf("%d", n + (10 - (n % 10)));
} else
printf("%d", n - (n % 10));
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, i, a[100001];
int h, pc, q, juc[100001];
int main() {
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
h = 1;
while (pc < m) {
pc++;
if (pc == a[h])
h++;
else {
m -= pc;
juc[++q] = pc;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, ai[101], bi[101], c[6], aes;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i += 1) cin >> ai[i], c[ai[i]]++;
for (int i = 1; i <= n; i += 1) cin >> bi[i], c[bi[i]]++;
for (int i = 1; i <= 5; i += 1) {
if (c[i] ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e15 + 7;
long long res = 0;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
struct seg {
long long ax, ay, cx, cy, k;
seg() {}
};
set<pair<long long, long long> > used;
bool check(seg a, seg b) {
bool rev = false... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long fact(long long s, long long n) {
long long res = 1;
for (int i = 0; i < n; i++) res = res * (s - i + 1000000009) % 1000000009;
return res;
}
long long bin[100009];
int main() {
int n, m, i;
bin[0] = 1;
for (i = 1; i <= 100000; i++) bin[i] = 2 * bin[i -... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long int n;
cin >> n;
if (n == 1)
cout << "1";
else if (n == 2)
cout << "2";
else if (n & 1)
cout << n * (n - 1) * (n - 2);
else {
if (n % 3 == 0)
cout << (n - 1) * ... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long hg[1000010], sg[1000010], h[1010], s[1010];
priority_queue<long long> qq;
int main() {
int m, n, k, p;
cin >> n >> m >> k >> p;
int i, j;
memset(h, 0, sizeof(h));
memset(s, 0, sizeof(s));
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j) {
int ... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.