solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
long long int dp[2][151][11255], q[151];
int main() {
ios::sync_with_stdio(false);
;
cin.tie(0);
;
long long int i, j, n, k, req, s, x, y, ans = 2000000000000000000;
cin >> n >> req >> s;
for (i = 1; i <= n; i++) cin >> q[i];
s = min(s, 11250LL);
for (i = ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
long long sum = n;
while (true) {
long long cnt = 2;
while (n % cnt != 0) {
cnt++;
if (cnt == (long long)sqrt(n) + 1) {
cnt = n;
... | 2 |
#include "bits/stdc++.h"
using namespace std;
int main(){
string t,p;
cin>>t>>p;
stack<char> st;
vector<int> b;
vector<int> f;
for(int i=0;i<p.size();i++)st.push(p[i]);
for(int i=t.size()-1;i>=0;i--){
if(st.size()&&t[i]==st.top()){
f.push_back(i);
st.pop();
}
}
if(st.size()){
cout<<"no"<<e... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const long long inf = 2e9 + 10;
template <typename T1, typename T2>
static void relax(T1 &x, T2 y) {
if (x > y) x = y;
}
template <typename T1, typename T2>
static void gain(T1 &x, T2 y) {
if (x < y) x = y;
}
long long powmod(long long a, long l... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a, b, c, d, k, l, g;
cin >> a >> b >> c >> d;
k=c;
l=d;
if(c<d){
k=d;
l=c;
}
g=l%k;
while(g!=0){
l=k;
k=g;
g=l%k;
}
cout << b-a+1-b/c+(a-1)/c-b/d+(a-1)/d+b/(c/k*d)-(a-1)/(c/k*d) << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int val;
int p;
} node[106];
bool cmp(const struct node x, const struct node y) { return y.val - x.val > 0; }
int main() {
int n, d;
int var;
cin >> n >> d;
for (int i = 1; i <= n; i++) {
cin >> node[i - 1].val;
node[i - 1].p = i;
}
sor... | 1 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int... | 0 |
#include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
const int N = 55;
char a[N][N];
pi dir[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n, m;
pi s;
bool follow(vector<int> v) {
pi cur = s;
for (int i : v) {
cur.first += dir[i].first;
cur.second += dir[i].second;
if (cur.first < 1 ||... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int n, k, i;
cin >> n >> k;
long long int a[n];
map<long long int, long long int> m;
for (i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
sort(a, a + n);
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int euclid(int a, int b, int &x, int &y) {
if (!a) {
x = 0;
y = 1;
return b;
}
int _x, _y;
int g = euclid(b % a, a, _x, _y);
x = _y - b / a * _x;
y = _x;
return g;
}
void relax(int &obj, int C3, int C4, int C5, int _k3, int k4, int _k5, int &K3,
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
cin >> n;
if (n == 1) {
count = abs(2 - i) + abs(2 - j);
cout << count << endl;
return 0;
}
}
}
cout << count << endl;
retu... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define N 3010
#define INF 2147483647
inline int read() {
int x=0;
char ch=getchar();
while (!isdigit(ch)) ch=getchar();
while (isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x;
}
int tot=1;
int fir[N],nex[N<<1],got[N<<1];
inline void AddEdge(int x,int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[110] = {4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274,
319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526,
535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663,
666, 690, 706, 728, 729, 762, 778, 825, 852, ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, m;
cin >> N >> m;
vector< bool > shop(N + 1, 0);
for(int i = 0; i < m; ++i){
int c, d;
cin >> c >> d;
fill( shop.begin() + c, shop.begin() + d, true);
}
cout << N + 1 + count(shop.begin(), shop.end(), true) * 2 << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 1e3;
int sum[MX + 2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m, q, l, r;
string str, str2;
cin >> n >> m >> q;
cin >> str >> str2;
for (long long i = 0; i < n - m + 1; i++) {
sum[i] = (str.substr(i, m) == ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;cin>>t;
while(t--){
int n;cin>>n;
string s;cin>>s;
bool flag=false;
int count=0,pal=0;
for(int i=0;i<n/2;i++){
if(s[i]!=s[n-1-i]){
flag=true;
pal++;
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long N,K;
cin >> N >> K;
cout << min(N % K,K-N%K) << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10010, mod = 1000000007;
int q, l, t, m;
long long a, b;
long long f(long long x) { return a + (x - 1) * b; }
long long s(long long l, long long r) {
return (f(l) + f(r)) * (r - l + 1) / 2;
}
int main() {
scanf("%I64d%I64d%d", &a, &b, &q);
while (q--)... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int from, to, capacity, cost;
Edge(int from, int to, int capacity, int cost)
: from(from), to(to), capacity(capacity), cost(cost){};
};
vector<vector<int>> adj, cost, capacity;
const int INF = 2e9;
void shortest_paths(int n, int v0, vector<int>& d, v... | 6 |
#include <bits/stdc++.h>
using namespace std;
void input(vector<long long int> &arr) {
for (int i = 0; i < arr.size(); i++) cin >> arr[i];
}
void output(vector<long long int> arr) {
for (int i = 0; i < arr.size(); i++) cout << arr[i] << " ";
cout << "\n";
}
long long int gcd(long long int a, long long int b) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int H = 17, M = 1 << H, inf = 0x3fffffff;
int n, k;
pair<int, int> seg[M << 1];
pair<int, int> operator+(const pair<int, int> &a, const pair<int, int> &b) {
return make_pair(min(a.first, b.first), max(a.second, b.second));
}
pair<int, int> get(int a, int b) {
a = ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,N; cin>>H>>W>>N;
if(H<W){ swap(H,W); }
int r = (N+H-1)/H;
cout << r <<"\n";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589793;
const long long I_MAX = 1LL << 60;
long long mod = 1000000007;
const long long maxN = 2E5;
vector<long long> inv(maxN + 5, 1);
vector<long long> fac(maxN + 5, 1);
void ADD(long long &x, long long y) {
x += y;
if (x >= mod) x -= mod;
... | 5 |
#include <bits/stdc++.h>
const int mod = 1000000007;
const int MAXN = 1010;
typedef long long LL;
void reduce(int & x) { x += x >> 31 & mod; }
int mul(int a, int b) { return (LL) a * b % mod; }
int pow(int a, int b, int res = 1) {
for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a);
return res;
}
int f[MA... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cerr<<#x<<": "<<x<<endl
typedef long long ll;
const ll mod = (ll)1e9+7;
int w,d,n;
int m[59][59];
int x[59],y[59],z[59];
int myabs(int x){return x<0?-x:x;}
int main()
{
scanf("%d%d%d",&w,&d,&n);
for(int i=1;i<=n;i++)scanf("%d%d%d",&x[i],&y[i],&z[i]);... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const int MX = 100000;
const int INF = 1001001001;
int main() {
int n = in();
long long r;
scanf("%I64d", &r);
vector<long long> as;
long long ans = 0, w = 0, x = 0;
vector<int> ls(n), ts(n);
for (int... | 4 |
#include <bits/stdc++.h>
int idx, one, zero, a[30], b[30], c[60], q[30];
inline void plus(int src1, int src2, int dst) {
printf("+ %d %d %d\n", src1, src2, dst);
}
inline void less(int src1, int src2, int dst) {
printf("< %d %d %d\n", src1, src2, dst);
}
void prepare() {
idx = 5;
for (int i = 0; i < 30; i++) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int xx[4] = {0, 0, 1, -1};
int yy[4] = {1, -1, 0, 0};
int n, m;
int t[int(1e5 + 100)][10], f[int(1e5 + 100)][10];
int main() {
scanf("%d%d", &m, &n);
for (int i = (1), _b = (m); i <= _b; i++) {
int r = 0;
for (int j = (1), _b = (n); j <= _b; j++) {
scanf("... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool f(int a, int b) {
if (b > a + 1) return false;
while (a > 2) {
a -= 2;
b--;
}
if (b >= 0)
return true;
else
return false;
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (f(c, b) or f(d, a))
cout << "YES" << endl;
else
... | 1 |
#include <bits/stdc++.h>
int main() {
int n, a, b;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
b = b % n;
if ((n + a + b) % n != 0)
printf("%d\n", (n + b + a) % n);
else
printf("%d\n", n);
}
| 1 |
#include <cstdio>
#include <algorithm>
#include<cmath>
typedef long long ll;
using namespace std;
int main(){
int t,b,c;
ll s,i;
scanf("%d",&t);
while(t--){
scanf("%d%d",&b,&c);
s=1ll*b*c;
i=sqrt(s)+1;
while(i*i>=s) i--;
ll ans=i*2-2;
if(i*(i+1)<s) ans++;
if(b==c) a... | 0 |
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <map>
using namespace std;
const int MAX_H = 30;
const int MAX_W = 30;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,1,0,-1};
int W, H;
int G[MAX_H][MAX_W];
int order[6];
map<char, int> id;
struct S {
int x, y, step, face[3], ... | 0 |
#include <iostream>
using namespace std;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(x>=a&&x<=a+b){
printf("YES");
}
else{
printf("NO");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
using VV = vector<vector<T>>;
template <class T>
inline T SMIN(T& a, const T b) {
return a = (a > b) ? b : a;
}
template <class T>
inline T SMAX(T& a, const T b) {
return a = (a < b) ? b : a;
}
template <class Iter>
void dumpc(Iter begin, Iter end) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
struct p {
int x, id;
bool operator<(const p &a) const { return x < a.x; }
} a[MAX];
int n, ans, K;
int fa[MAX], siz[MAX], tot[MAX], b[MAX];
set<int> S;
int find(int x) {
if (fa[x] != x) fa[x] = find(fa[x]);
return fa[x];
}
int main() {
sc... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t,n;
scanf("%d",&t);
while(t--){
scanf("%d",&n); double ans=0;
vector<double>miners; vector<double>diamonds;
for(int i=0;i<2*n;i++){
double a,b;
scanf("%lf%lf",&a,&b);
if (a==0){miners.... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, x;
scanf("%d%d%d", &n, &m, &k);
int ans = m * k;
m = n - m;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
if (m) {
ans += x;
m--;
}
}
printf("%d\n", ans);
}
| 1 |
// CGL_1_A
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main(){
double xx, yy, X, Y, x, y;
int q, xp[2], yp[2];
cin>>xp[0]>>yp[0]>>xp[1]>>yp[1];
X = xp[1] - xp[0];
Y = yp[1] - yp[0];
cin>>q;
for(int i=0;i<q;i++){
cin>>xx>>yy;
if(Y == 0){
x = xx;
y = yp[0];
}... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int kMod = 998244353;
const int kNmax = 2e5 + 5;
int n, m;
vector<char> a, b;
int pw2[kNmax];
vector<char> read_bits() {
string s;
cin >> s;
return vector<char>(s.begin(), s.end());
}
int main() {
cin >> n >> m;
a = read_bits();
b = read_bits();
pw2[0] =... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int t;
t = 1;
while (t--) {
long long a, b, ans = 0;
cin >> a >> b;
for (long long i = 1; i < (a + 1); ++i) {
long long ch1 = ((b * (b - 1)) / 2) % 1000000007;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
void bug() { cout << " " << endl; }
template <class T>
void bug(T a) {
cout << a << " ";
}
template <class T>
void bug(T* a, int n) {
for (int i = 0; i < (n); i++) bug(a[i]);
}
const double pi = acos(-1.0);
int flip(int n, int i) {
int n2 = n, ans = 0;
for (; n2 > ... | 5 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using ii = pair<int, int>;
const char space = ' ', ln = '\n';
template <typename T>
T read() {
T value;
cin >> value;
return value;
}
int ri() { return read<int>(); }
ll rll() { return read<ll>(); }
string rs() { return read... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool f[10000007];
vector<int> prime;
void sieve() {
f[0] = f[1] = 1;
for (int i = 2; i < 10000007; ++i) {
if (f[i]) continue;
prime.push_back(i);
for (int j = i * i; i <= 10000 && j < 10000007; j += i) f[j] = 1;
}
}
vector<int> factor;
void getFactor(int n... | 1 |
#include <iostream>
int A, B;
int main() {
std::cin >> A >> B;
std::cout << A * B - A - B + 1;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
bool fl;
int a, b;
int ask(int x, int y) {
printf("? %d %d\n", x, y);
fflush(stdout);
int res = 0;
scanf("%d", &res);
return res;
}
int main() {
a = b = 0;
fl = 1;
if (ask(a, b) < 0) fl = 0;
for (int i = 29; i >= 0; i--) {
int qa = a ^ (1 << i), qb = b... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 10;
const int M = 1000500;
vector<int> rec[N], prime;
int ans, n, who, pre[N];
long long a[N], rest[N];
bool used[N], flag[M], sth, have[N];
map<long long, int> mymap;
void init() {
for (int i = 2; i < M; i++) {
if (flag[i])
continue;
else
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1E18;
const long double EPS = 1E-10;
const int N = 1e5 + 1;
const long long MOD = 1E9 + 7;
int n;
vector<char> v;
int main() {
cin >> n;
char a;
for (int i = 1; i <= n; i++) {
cin >> a;
if (a == '4') {
v.push_back('3');
v.push... | 3 |
#include<stdio.h>
int main(){
int a,b=0,c=0,n,j,i;
scanf("%d",&n);
for(j=1;j<=n;j+=2)
{for(i=1;i<=j;i++)
{
if(j%i==0)
{b++;}
}
if(b==8)
{c++;}
b=0;
}
printf("%d\n",c);
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
string s;cin >> s;
int n=s.size();
int d;cin >> d;
ll dp[n+1][2][d];
memset(dp,0,sizeof(dp));
dp[0][0][0]=1;
for(int i=0;i<n;i++){
int p=s[i]-'0';
for(int j=0;j<2;j++){
for(int k=0;k<d;k++){
... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ft first
#define sc second
#define add push_back
#define all(v) v.begin(),v... | 3 |
#include <bits/stdc++.h>
using namespace std;
int a[250], b[250];
int main() {
int T;
scanf("%d", &T);
while (T--) {
for (int i = 0; i < 250; i++) scanf("%d", &a[i]);
double mina = a[0], maxa = a[0], minb = b[0], maxb = b[0];
double mida = 0;
for (int i = 0; i < 250; i++) {
mida += a[i];
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
double ans, cnt, s;
double p[maxn];
int n;
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lf", p + i);
p[0] = 0;
for (int i = 1; i <= n; i++) {
cnt = (cnt + s * 2 + 1 - p[i - 1]) * p[i];
s = (s + 1 - p[i - 1]) ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.1415926535897932384626433832795;
const long double eps = 1e-9;
deque<int> d;
int main() {
int a, b, x, i, ans = 0, j;
for (i = 0; i < 4; i++) {
scanf("%d", &j);
d.push_back(j);
}
scanf("%d%d", &a, &b);
sort(d.begin(), d.end());
f... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b, mini = 1000000000;
scanf("%d %d", &n, &m);
int i, j, k, l, ara[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%d", &ara[i][j]);
}
}
scanf("%d %d", &a, &b);
if (a == 1 && b == 1) {
for (i = 0; i ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5;
long long n, m, ans, f[N][10], Ans[N];
vector<long long> g[N];
inline long long read() {
long long ret = 0, f = 0;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = 1;
c = getchar();
}
while (isdigit(c)) {
ret = r... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
int cnt[262200];
long long sum[262200][5];
void chan(int x) {
int i, l = x << 1, r = (x << 1) + 1;
cnt[x] = cnt[l] + cnt[r];
for (int(i) = (0); (i) <= (4); (i)++)
sum[x... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int> > v(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c;
cin >> c;
v[i][j] = c - '0';
}
}
vector<int> f(n, 0);
vector<int> c(n, 0);
int count = 0;
... | 3 |
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | 0 |
#include <bits/stdc++.h>
const int INF = 1000000007;
inline int max(const int &a, const int &b) { return a > b ? a : b; }
inline int min(const int &a, const int &b) { return a < b ? a : b; }
int t[5015][2], f[5005][102], g[5005][102], sz[5005];
int stk[5005], tp, cur, tot = 10, rt;
char str[10010];
bool now;
void dfssz... | 5 |
#include<iostream>
#include<algorithm>
using namespace std;
#define MOD 1000000007
#define MAX_N 210
#define MAX_W 10100
int dp[2][MAX_N][MAX_W];
int N, W, x[MAX_N];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
x[N + 1] = W + 1;
sort(x + 1, x + N + 1);
dp[1][1][0] = 1;
for (int i ... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int N, dp[1919810][2], i, ans, con;
static inline long long dpt(int b){
return ((b - 3 >= 0) ? dp[b - 3][1] + N - b + 1 : N - 1) % 1000000007;
}
int main(){
scanf("%lld", &N);
ans = con = (N - 1) * (N - 1) % 1000000007;
dp[0][0] = N;
dp[0][1... | 0 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
... | 0 |
#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 st... | 0 |
#include<iostream>
using namespace std;
int main(){
int n,a,b;
while(cin>>n,n){
int asum=0,bsum=0;
for(int i=0;i<n;i++){
cin>>a>>b;
if(a>b)asum+=a+b;
else if(a<b)bsum+=a+b;
else {asum+=a; bsum+=a;}
}
cout<<asum<<' '<<bsum<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = (long long)1000000007 * 1000000007;
const long double eps = 1e-8;
const long double pi = acos(-1.0);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100 + 10;
int c2[MAX_N];
int n, k;
const int INF = ~0U >> 2;
struct Trie {
Trie* ch[26];
Trie() {
memset(ch, 0, sizeof ch);
cnt = 0;
}
Trie* get(int a) {
if (ch[a] == 0) ch[a] = new Trie;
return ch[a];
}
int am[MAX_N];
int cnt... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
stack<char> s;
int c1 = 0, c2 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
if (c == '(') {
c1++;
s.push('(');
} else {
c2++;
if (s.empty() == 0) {
s.pop();
}
}
}
if... | 3 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;
#define reep(i,a,b) for(int i=(a);i<(b);++... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x[15], y[15], mini = 1005, temp, cek, mx = 10, my = 10;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> temp;
x[temp]++;
mx = min(mx, temp);
}
for (int i = 1; i <= m; i++) {
cin >> temp;
y[temp]++;
if (x[temp] == y... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long m = 1000000007) {
long long ans = 1;
while (y > 0) {
if (y & 1) {
ans = (ans * x) % m;
}
x = (x * x) % m;
y /= 2;
}
return ans % m;
}
long long modInverse(long long a, long long m = 1000000007... | 4 |
#include <bits/stdc++.h>
void dbg(const char* fmt, ...) {}
double fact[100];
double c(int n, int k) {
if (k < 0 || n < k) return 0;
return fact[n] / fact[k] / fact[n - k];
}
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
std::pair<int, int> ans[100][100];
double solve(int n, int m) {
do... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int counter = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' ||
s[i] == 'u' || s[i] == '1' || s[i] == '3' || s[i] == '5' ||
s[i] == '7' || s[i] == '9')
... | 1 |
#include <iostream>
#include <map>
using namespace std;
int main(void){
map<int,int> m;
double tmp;
int n,i=0,t;
cin >> n;
for(;i<n;i++){
cin >> tmp;
if(tmp < 165){
m[1]++;
}else if(tmp < 170){
m[2]++;
}else if(tmp < 175){
m[3]++;
}else if(tmp < 180){
m[4]++;
}else if(tmp < 185){
m[5]+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int chh;
const int N = 350005;
int n, m;
pair<pair<int, int>, int> p[N];
set<pair<int, int> > s;
set<pair<int, int> >::iterator iter;
int main() {
int ans, id, h, src, tmp, cnt;
pair<int, int> t, d;
while (~scanf("%d %d", &n, &m)) {
for (int i = 0; i < (n); i++) {... | 4 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
class Edge
{
public:
int from, to, cost;
Edge(){}
};
const int INF = 999999999;
int cost[1000];
Edge e[2000];
int V, E, r;
bool isUpdated;
bool bellmanford()
{
fill(cost, cost + V, INF);
cost[r] = 0;
for (int i = 0; i < V; i++)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int recur_depth = 0;
const long long sz = 1e5 + 10;
long long a[sz];
int main() {
long long n, k, sum = 0;
cin >> n >> k;
for (long long i = 1; i <= n; ++i) scanf("%lld", &a[i]), sum += a[i];
if (sum < k) {
printf("-1\n");
return 0;
}
if (k == 0) {
f... | 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
template <typename T>
using Array = vector<T>;
template <typename T>
using Matrix = Array<Array<T>>;
using Graph = Matrix<int>;
template <typena... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll m[55][55];
int main() {
cin.sync_with_stdio... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 10;
const long long mod = 1e9 + 7;
const double PI = acos(-1);
int sum[400];
inline int ab(int x) { return x >= 0 ? x : -x; }
int main() {
int n, x, ans = 400;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
int a[MAXN][1 << 3];
int f[MAXN];
int id1, id2;
int n, m;
bool check(int ans) {
for (int i = 0; i <= 1 << m; i++) {
f[i] = 0;
}
int mx = (1 << m) - 1, temp;
for (int i = 1; i <= n; i++) {
temp = 0;
for (int j = 0; j < m; j++) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
bool is_lucky(string s) {
int Sum1 = 0, Sum2 = 0, mid = (s.size()) / 2;
for (int i = 0; i < int(s.size()); i++) {
if (s[i] != '4' && s[i] != '7') return false;
if (i < mid)
Sum1 += int(s[i] - '0');
else
Sum2 += int(s[i] - '0');
}
return (Sum1... | 1 |
#include <bits/stdc++.h>
const int N = 1001;
int x[N], y[N];
std::map<std::pair<int, int>, std::set<long long>> slope_map;
int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d%d", &x[i], &y[i]);
long long total = 0,... | 3 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> o(100010), e(100010);
rep(i,n) {
int v; cin >> ... | 0 |
#include <stdio.h>
#include <string.h>
#define R register
#define MN 100005
int n,m,q,x,y,xx,yy,aa[MN],bb[MN];
char a[MN],b[MN];
inline int read(){
R int x; R bool f; R char c;
for (f=0; (c=getchar())<'0'||c>'9'; f=c=='-');
for (x=c^'0'; (c=getchar())>='0'&&c<='9'; x=(x<<1)+(x<<3)+(c^'0'));
return f?-x:x;
}
int mai... | 0 |
#include <bits/stdc++.h>
using namespace std;
void func(void) {
freopen("input.c", "r", stdin);
freopen("output.c", "w", stdout);
}
int main() {
long long n, q, i, j = 0, temp, t, k, ans = 0, sum = 0, x, y, z, cnt = 0, m,
fg = 0, mx = 0, mx1 = 0, mn = 8000000000000000000,
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 100001;
void precalc() {}
void clear() {}
void test() {}
void solve() {}
int main() {
ios_base::sync_with_stdio(0);
cin.tie();
cout.tie();
precalc();
int n;
cin >> n;
string s;
cin >> s;
int x = 0;
int y = 0;
int ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int b[100100], s[100100];
deque<pair<int, int> > qb, qs;
int main() {
int n, ss;
while (~scanf("%d%d", &n, &ss)) {
char op[3];
memset(b, 0, sizeof(b));
memset(s, 0, sizeof(s));
int maxp = 0;
for (int i = 0; i < n; i++) {
... | 2 |
#include <bits/stdc++.h>
int minimum(int num1, int num2) {
if (num1 <= num2)
return num1;
else
return num2;
}
int main() {
int a, b, counter = 0;
scanf("%d %d", &a, &b);
int min = minimum(a, b);
for (int i = 0; i <= min; i++) {
for (int j = 0; j <= min; j++) {
if ((i * i) + j == a && i + (... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3010;
int r, c, n, K, a[21];
long long ans;
vector<int> V[maxn];
int main() {
scanf("%d %d %d %d", &r, &c, &n, &K);
for (int _ = 0, x, y; _ < n; _++) {
scanf("%d %d", &x, &y), V[x].push_back(y);
}
for (int _ = 1; _ <= r; _++) {
multiset<int>... | 6 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N,A,B;cin>>N>>A>>B;
cout<<min(A,B)<<" "<<max(A+B-N,0LL)<<endl;
}
| 0 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int maxN = 2100;
int n, k;
string s[maxN];
int d[maxN][maxN];
int ans[maxN];
struct node {
int cnt;
vector<int> d;
node* children[26];
node() {
for (int i = 0; i < 26; ++i) children[i] = NULL;
cnt = 0;
}
};... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int x, y, z, xx, yy, zz;
x = max(a, 2 * d + 1);
xx = 2 * a;
y = max(b, 2 * d + 1);
yy = 2 * b;
z = max(c, d);
zz = min(2 * c, 2 * d);
if (xx >= x && yy >= y && zz >= z) {
for (int i = x; i <= xx; ... | 1 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace s... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
map<string,bool> adj = {
{"AB", true},
{"AD", true},
{"BA", true},
{"BC", true},
{"BE", true},
{"CB", true},
{"CF", true},
{"DA", true},
{"DE", true},
{"DG", true},
... | 0 |
# include <bits/stdc++.h>
using namespace std;
vector < int > adj[100007];
int used[100007], dp[100007], mx;
void dfs( int v ) {
if ( used[v] ) return;
used[v] = 1;
for ( auto u: adj[v] ) {
dfs(u);
dp[v] = max( dp[v], dp[u] + 1 );
}
}
int main() {
int n, m;
cin >> n >> m;
for ( int i = 0; i < m; i++ ) {... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> T[300300];
int N, Q, P[300300], S[300300], C[300300];
void dfs(int x) {
S[x] = 1;
vector<int> c;
for (int y : T[x]) {
dfs(y);
S[x] += S[y];
c.push_back(C[y]);
}
for (int i = 0; i < T[x].size(); i++) {
int y = T[x][i];
if (S[y] * 2 >... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXD = 10;
struct intArr {
int num[MAXD];
};
const int INFINITE = 0x7FFFFFFF;
const int MAXN = 100001;
int n, q, l, r, tk;
int t[MAXD];
char s[MAXN];
vector<int> a[MAXN];
intArr c;
vector<intArr> b;
inline void addPosition(int p) {
tk++, a[p].push_back(tk);
... | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
char s[17];
int a,b;
for (int i = 0;i < 9;i++){
cin >> s >> a >> b;
cout << s << " ";
cout << a + b << " ";
cout << a * 200 + b * 300 << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (k == n)
cout << -1;
else if (k == n - 1)
for (long long i = 1; i <= n; i++) cout << i << ' ';
else {
cout << k + 2 << ' ';
for (long long i = 2; i <= k + 1; i++) cout << i << ' ';
for (long long i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 170;
double C(int n, int k) {
double ans = 1;
k = min(k, n - k);
for (int i = 0; i < (k); i++) {
ans = (ans * (n - i)) / (i + 1);
}
return ans;
}
int main() {
int n, m, h, s = 0, tot;
cin >> n >> m >> h;
n--;
for (int i = 1; i <= m; i++... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.