solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
long long re() {
long long ret = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) f = (ch == '-') ? -f : f, ch = getchar();
while (isdigit(ch)) ret = ret * 10 + ch - '0', ch = getchar();
return ret * f;
}
long long n, a[10005], s;
signed main() {
long long t ... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <class P, class Q>
inline void smin(P &a, Q b) {
if (b < a) a = b;
}
template <class P, class Q>
inline void smax(P &a, Q b) {
if (a < b) a = b;
}
long long n;
vector<long long> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
v.p... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[101] = {0};
arr[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
arr[x]++;
}
cout << *max_element(arr, arr + 101);
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin>>s>>t;
int c=0;
for(int i=0;i<s.length();i++) {
if(s[i]!=t[i])
c++;
}
cout<<c;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
long long degree(long long deg) {
long long val = 180 - deg;
if (360 % val == 0) {
return true;
}
return false;
}
int main() {
int t;
cin >> t;
for (int z = 1; z <= t; z++) {
long long n;
cin >> n;
if (degree(n))
cout <<... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long double Pi = 3.14159265359;
const long long Mod = 1000 * 1000 * 1000 + 7;
const long long MaxN = 2e5 + 10;
int he() {
long long im[MaxN];
long long tav[MaxN];
long long a[MaxN];
long long par[MaxN];
}
long long fac[MaxN];
long long po(long long x, long lon... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, gr, num, p;
bool b = false;
cin >> n >> gr;
while (gr--) {
cin >> num;
vector<int> search(n, 0);
for (int i = 0; i < num; i++) {
cin >> p;
if (search[abs(p) - 1] == 0) {
search[abs(p) - 1] += p;
continue;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = 3e5 + 10;
int n;
vector<int> g[maxn];
long long fpow(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1) r = r * a % mod;
b >>= 1;
a = a * a % mod;
}
return r;
}
long long dp[maxn][2][2], res[ma... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, mod = 998244353;
int n, B, a[N], tr[N << 1];
void upt(int x) {
while (x <= n + B) tr[x]++, x += (x & -x);
}
int query(int x) {
int res = 0;
while (x) res += tr[x], x -= (x & -x);
return res;
}
long long solve(int x) {
long long ans = 0;
in... | 5 |
#include <bits/stdc++.h>
using namespace std;
int solve(string na, string nb) {
string a, b;
int ac4 = 0, ac7 = 0, bc4 = 0, bc7 = 0, res = 0;
for (int i = 0; i < na.size(); ++i) {
if (na[i] != nb[i]) a += na[i], b += nb[i];
}
for (int i = 0; i < a.size(); ++i) {
if (a[i] == '4') ac4++;
if (a[i] ==... | 1 |
# define _CRT_SECUREj_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
... | 0 |
#include <bits/stdc++.h>
using namespace std;
char s[1111111], s1[1111111];
int pre0[1111111], pre[1111111], a[1111111];
bool vis[1111111];
int n, cnt;
void gao(int k, int d) {
cnt = 0;
for (int i = 0; i < d; i++) {
for (int j = i; j < k; j += d) {
pre0[cnt++] = j;
}
}
for (int i = k; i < n; i++) ... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long v[112345], d[112345], p[112345], ans[112345], idx = 0;
void solve() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &v[i]);
scanf("%lld", &d[i]);
scanf("%lld", &p[i]);
}
for (int i = 0; i < n; i++) {
if (p[i] >= 0) {... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,k=1,a; scanf("%lld",&n);
for(i=1;i<=n;i++)
{
scanf("%lld",&a); if(a==k)k++;
}
if(k==1)cout<<"-1"<<endl;
else{cout<<n-(k-1)<<endl;}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long ucln(long long a, long long b) {
if (b == 0)
return a;
else
return ucln(b, a % b);
}
long long bcnn(long long a, long long b) { return (a * b) / ucln(a, b); }
long long thuchien(long long n) {
long long a, b;
for (long long i = n; i >= 1; i--)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> str[26];
string s[100100];
int p[100100], h[100100];
int find_set(int v) { return p[v] == v ? v : p[v] = find_set(p[v]); }
string union_str(string a, string b, char c) {
int p1 = find(begin(a), end(a), c) - begin(a);
int p2 = find(begin(b), end(b), c) - begi... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char c;
string s;
string::iterator ite;
cin >> n >> s;
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
ite = s.begin() + i;
reverse(s.begin(), ite);
}
}
cout << s << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
vector<int> vec(n + 1);
for (int i = 1; i <= n; i++) {
cin >> vec[i];
}
vector<int> pks(n + 1);
pks.front() =... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
char c[200001];
char a[27] = {'a'};
scanf("%s", &c);
for (int i = 1; i < 27; i++) a[i] = 'a' + i - 1;
char x, d;
while (cin >> x >> d) {
int i, j;
for (i = 1; i < 27; i++) {
if (a[i] == x) break;
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
inline int getint() {
char c = getchar();
int x = 0, mi = 1;
while (c != EOF && c != '-' && !isdigit(c)) c = getchar();
if (c == '-') {
mi = -1;
c = getchar();
}
while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
retur... | 5 |
#include <bits/stdc++.h>
int main() {
int count, i, a[100];
for (i = 0; i < 4; i++) {
scanf("%d", &a[i]);
}
if (a[0] == a[1] && a[1] == a[2] && a[2] == a[3]) {
count = 4 - 1;
} else if ((a[0] == a[1] && a[1] == a[2]) || (a[1] == a[2] && a[2] == a[3]) ||
(a[0] == a[1] && a[1] == a[3]) || (... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, x = 0, y = 0, z = 0;
cin >> n;
while (n--) {
cin >> a >> b >> c;
x += a;
y += b;
z += c;
}
if (x == 0 && y == 0 && z == 0)
cout << "YES";
else
cout << "NO";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long modexp(long long x, long long n) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long y = modexp(x, n / 2) % mod;
return (y * y) % mod;
}
return (x * modexp(x, n - 1) % mod) % mod;
}
long long powr(long long x, long long n) ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const double EPS = 1e-7;
const int MAXN = 1010;
int c[MAXN];
int t[MAXN];
queue<int> q;
int total = 0;
void deq(int t) {
int cant = 0;
while (cant < t && !q.empty()) {
int c1 = c[q.front()];
if (cant + c1 <= t) {
q.pop();
can... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long res = 0, ans = 0;
for (int i = 1; i <= n; ++i) {
long long x;
scanf("%lld", &x);
long long r = min(res, x / 2);
ans += r;
x -= r * 2;
res -= r;
ans += x / 3;
res += x % 3;
}
cout << a... | 5 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2 * 1e5 + 10;
ll res;
ll a[N];
void solve() {
ll t, x, y, ex, ey, neast = 0, nnorth = 0, nsouth = 0, nwest = 0;
map<char, int> mp;
cin >> t >> x >> y >> ex >> ey;
ll k = ex - x;
ll l = ey - y;
string s;
cin >> s;
if (k > 0... | 2 |
#include <bits/stdc++.h>
using namespace std;
int h[100005], path[100005];
int sol[100005];
int a, b, n, ans;
int k = 0;
void decrease(int &x, int &y, int &z) {
x -= b;
x = max(x, 0);
z -= b;
z = max(z, 0);
y -= a;
y = max(y, 0);
return;
}
void dfs(int current, int Left, int mid, int right, int anss) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = 0x3f3f3f3f;
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n), b(n);
for (auto& it : a) cin >> it;
for (int i = 0; i <... | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, a[100100], cache[100100];
bool win(int i) {
if (cache[i]) return cache[i] == 2;
for (int j = i - a[i]; j >= 0; j -= a[i]) {
if (a[j] > a[i] && !win(j)) {
cache[i] = 2;
return true;
}
}
for (int j = i + a[i]; j < N; j += a[i]) {
if (a[j... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
const int INF = 0x3f3f3f3f;
template <class T>
void Read(T &x) {
x = 0;
char c = getchar();
bool flag = 0;
while (c < '0' || '9' < c) {
if (c == '-') flag = 1;
c = getchar();
}
while ('0' <= c && c <= '9') {
x = x * 10 + c - '0'... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int MOD = 1000000009;
struct Tnode {
int l, r, lc, rc, x;
pair<int, int> v;
} tree[maxn];
pair<int, int> P[maxn];
int n, m;
inline int getnode() {
static int s = 0;
return ++s;
}
void init() {
int k, a, b, c, d;
scanf("%d%d", &n, &... | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
bool isprime(int n)
{
for(int i=2;i*i<=n;i++)
{
if(n%i==0)return false;
}
return true;
}
int32_t main()
{
int t;
cin>>t;
while(t--)
{
int n;cin>>n;
string t;
cin>>t;
string ans="";
for(int i=0;i<(in... | 1 |
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
struct A{
int x,y,h;
}a[100];
int main()
{
int N,X,Y,H,h;
int j,s;
cin>>N;
for(int i=0;i<N;i++)
{
cin>>a[i].x>>a[i].y>>a[i].h;
if(a[i].h) s=i;
}
for(X=0;X<=100;X++)
{
for(Y=0;Y<=100;Y++)
{
H=abs(a[s].x-X)+abs(a[s].y-Y)+a... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
s = s + s;
vector<vector<string>> v(26);
for (int i = 0; i < n; i++) {
string s1 = s.substr(i, n);
v[s1[0] - 'a'].push_back(s1);
}
int can = 0;
for (int i = 0; i < 26; i++) {
int mx = 0;
fo... | 5 |
#include <iostream>
#include <cstring>
using namespace std;
int num[1024];
int scr[1024];
int swp[1024][1024];
bool bar[1024][1024];
int main()
{
int N,M,H,K;
while(cin>>N>>M>>H>>K, N||M||H||K)
{
for(int i=0; i<N; i++)
{
cin >> scr[i];
}
memset(bar, 0, sizeof(bar));
for(int i=0; i<M; i++)
{
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> f(n);
for(auto&& x:f){
for(int i=0;i<10;i++){
int y;
cin >> y;
x <<= 1;
x |= y;
}
}
vector<vector<int> > p(n, vector<int>(11));
for(auto&& x:p)for(auto&& y:x)cin >> y;
int ans = -1e9-7... | 0 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
int main() {
int i, j, k;
double res;
scanf("%d%d", &N, &M);
res = 1.0 / N;
if (N * M > 1) res += (1 - 1.0 / N) / (N * M - 1) * (M - 1);
printf("%.10f\n", res);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
string s[2];
int num[2][105], n;
int main() {
mp["h"] = 0;
mp["a"] = 1;
mp["y"] = 1;
mp["r"] = 2;
cin >> s[0] >> s[1];
cin >> n;
for (int i = 1; i <= n; i++) {
int time, nu;
string team, card;
cin >> time >> team >> nu >> card;... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, m, a[N], b[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i) scanf("%d", &b[i]);
double tmp = 1;
for (int i = 1; i <= n; ++i) {
if (a[i] <= 1 || b[i] <= 1) return pu... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long pwr(long long base, long long p, long long mod = (1000000007LL)) {
long long ans = 1;
while (p) {
if (p & 1) ans = (ans * base) % mod;
base = (base * base) % mod;
p /= 2;
}
return ans;
}
long long gcd(long long a, long long b) {
if (b == 0) r... | 6 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
ll n; cin>>n;
vector<ll> a(n),b(n);
for(int i=0;i<n;i++) cin>>a[i]>>b[i];
ll ans=0;
for(int i=n-1;i>=0;i--){
a[i]=(a[i]+ans)%b[i];
if(a[i]!=0) ans+=b[i]-a[i];
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a>>b>>c;
if(a >= b||a >= c || b >= c)cout <<"No"<<endl;
else cout << "Yes"<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, t, n, k;
char s;
int main() {
cin >> n >> k;
b += k;
for (int i = 0; i < n; i++) {
cin >> s >> a;
if (s == '+') {
b += a;
}
if (s == '-') {
if (b < a) {
c++;
} else {
b -= a;
}
}
}
c... | 1 |
#include <bits/stdc++.h>
using namespace std;
int cnt[1000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long mario = (i * (i + 1)) / 2;
cnt[mario % n] = 1;
}
int chexk = 0;
for (int i = 0; i < n; i++) {
if (cnt[i] != 1) {
chexk = 1;
}
}
if (chexk == 1) {
c... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[100000], b[100000];
int main() {
int m, n, c, t;
cin >> n >> m >> c;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= m; ++i) cin >> b[i];
t = n - m;
for (int i = 1; i <= m; ++i)
for (int j = i; j <= i + t; ++j) a[j] = a[j] + b[i];
for ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
char sir[100005][10], era[100005][10];
int v[10], nrcif = 0;
int maimare(int ind, int n) {
int i, egale = 1;
for (i = 0; i < n; i++) {
if ((sir[ind][i] - '0' < v[i]) && (egale)) return 0;
if (sir[ind][i] - '0' > v[i]) egale = 0;
}
if (egale) return 0;... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int n, h;
cin >> h >> n;
int a[n];
for (int i = 0; i < n; ++i) cin >> a[i];
int cnt = 1;
vector<int> v;
for (int i = 1; i < n; ++i) {
if (a[i] == a[i - 1] - 1) {
++cnt;
} else ... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long int a[200005];
long long int cnt[200005][105];
int main() {
long long int n, i, j, k, x, y, t, m;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= n; i++) {
for (j = 1; j <= 100; j++) cnt[i][j] = cnt[i - 1][j];
cnt[i][a[i]]++;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q;
cin >> q;
while (q > 0) {
long long n;
cin >> n;
if (n == 1 || n == 2 || n == 3 || n == 5 || n == 7 || n == 11) {
cout << "-1" << endl;
q--;
continue;
}
if (n % 2 == 0) {
if (n % 4 == 0) {
c... | 3 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#define MAXN 111111
using namespace std;
int pre[MAXN];
int find(int x)
{
return (pre[x] == x) ? x : pre[x] = find(pre[x]);
}
struct Node
{
int u, v;
int power;
}node[MAXN];
bool cmp(const Node& x, const Node& y)
{
ret... | 0 |
#include<map>
#include<vector>
#include<algorithm>
#include<string>
#include<cstdio>
#include<cstring>
using namespace std;
bool pr(const pair<string,int>& p,const pair<string,int>& q){
if(false){
}else if(p.second>q.second){
return true;
}else if(p.second<q.second){
return false;
}else{
return p.first<q.firs... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char c[n];
cin.ignore();
cin.getline(c, n + 1);
int count = 0, ans = 0;
for (int i = 0; i < n; i++) {
if (c[i] == 32) {
count = 0;
}
if (isupper(c[i])) {
count++;
ans = max(count, ans);
}
}
co... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int NN = 1e6 + 10, mod = 1e9 + 7, N = 2e5 + 10;
int n, m, a[N], p[NN], ans[N], dd[NN], D[NN], t[N], vt[NN], s[N], _s[N];
vector<int> e[N], sv[N];
vector<pair<int, int> > ad[N];
int pw(int a, int i) {
int b = 1;
for (; i; i >>= 1, a = 1ll * a * a % mod)
if (i &... | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
double L[22], a[22], b[22];
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) cin >> L[i] >> a[i] >> b[i];
double res = 0;
for (int bit = 0; bit < (1 << N); bit++) {
int cnt = 0;
bool ok[22] = {false};
for (int k = 0; k < N; k++) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool debug;
const int inf = 1e9 + 5;
const int nax = 1e6 + 5;
int t[nax];
int a[nax], b[nax], c[nax];
set<int> s;
vector<int> odw[nax];
bool vis[nax];
int main(int argc, char *argv[]) {
debug = argc > 1;
int n;
scanf("%d", &n);
for (int i = 1; i <= (4 * n); ++i) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long arr[300100];
int main() {
int n;
long long k, sum = 0;
int x = 0;
scanf("%d%I64d", &n, &k);
int i = 1, j = n;
while (j--) {
x++;
scanf("%I64d", arr + i);
long long y = sum - arr[i] * (i - 1) * (n - x);
if (y >= k) {
sum += arr[i] ... | 3 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<map>
#include<functional>
#include<vector>
#define rep(i,k) for(int i=0;i<k;i++)
using namespace std;
typedef pair<double,int> P;
int main(){
int x;
double y;
priority_queue<P,vector<P>,greater<P> > a[3];
priority_queue<P,vector<P>,greater<P> > b;
rep(i,... | 0 |
#include <bits/stdc++.h>
using namespace std;
int MAX = 1000000;
int MIN = -1000000;
int INF = 1000000000;
int x4[4] = {0, 1, 0, -1};
int y4[4] = {1, 0, -1, 0};
int x8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int y8[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int i, j, k;
long long mod = 1000000000ll;
int main() {
long long n, m, arr... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 5e2 + 5;
const long long INF = 1e18;
const long long mod = 1e8;
int main() {
vector<pair<int, int>> st, st1, st2;
int x0, y0, x1, y1, x2, y2, i, j, k, l, p, q;
cin >> x0 >> y0 >> x1 >> y1 >> x2 >> y2;
st1.push_back({x0, y0});
st1.push_back({x... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, x, sum = 0, mn = 1000000000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x > 0) {
sum += x;
if (x % 2 == 1) {
if (x < mn) mn = x;
}
} else {
x = -x;
if (x % 2 == 1) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool test_cases_exist = false;
void solve() {
long long int i, j, n, m, pos, k, y, x, weigh, ans, sum, maxi, mini;
long long int q;
cin >> q >> x;
vector<long long int> available(x, 0);
ans = 0;
while (q--) {
cin >> k;
k %= x;
available[k]++;
whi... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h1, a1, c1, h2, a2;
cin >> h1 >> a1 >> c1 >> h2 >> a2;
vector<string> res;
while (h2 > 0) {
if (h1 > a2 || h2 <= a1) {
res.push_back("STRIKE");
h2 -= a1;
} else {
res.push_back("HEAL");
h1 += c1;
}
h1 -= a2;
... | 2 |
#include <cstdio>
using namespace std;
int total;
int ls[10];
int vs[2];
int main() {
while (1) {
total = 0;
for (int i=0; i<10; i++) {
if (scanf("%d", &ls[i]) != 1) return 0;
getchar();
total += ls[i];
}
scanf("%d,%d", &vs[0], &vs[1]);
double p = (double(vs[0])/(vs[0]+vs[1]))... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, K;
cin >> A >> B >> K;
cout << max(0ll, A - K) << " " << max(0ll, min(B, A + B - K)) << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int N = 1e9 + 7;
long long int r, g, b;
vector<long long int> cr, cg, cb;
long long int dp[204][204][204];
long long int f(long long int x, long long int y, long long int z) {
if (dp[x][y][z] != -1) {
return dp[x][y][z];
}
if ((x == r + 1 && y == g + 1) ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long m, n;
vector<vector<bool>> A;
bool IsOK = true;
cin >> m >> n;
A.resize(m, vector<bool>(n, false));
for (long i = 0, s, x; i < m && IsOK; ++i) {
cin >> s;
while (s--) {
cin >> x;
A[i][--x] = true;
}
for (long j = 0; ... | 5 |
#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
long long INF = 1000000000000000005ll;
double PI = acos(-1);
inline string IntToString(long long int a) {
char x[100];
sprintf(x, "%lld", a);
string s = x;
return s;
}
inline long long int StringToInt(string a) {
char x[100];
long long int res... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) cin >> A[i];
vector<int> memo(n, 0);
vector<bool> memo2(n, false);
for (int i = n - 2; i >= 0; i--) {
if (!memo2[A[i + 1] - 1]) {
memo2[A[i + 1] - 1] = true;
memo[i] = ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
if (i % 2 == 1) {
for (int j = 1; j <= m; j++) {
cout << '#';
}
} else {
if ((i / 2) % 2 == 1) {
for (int j = 1; j < m; j++) {
cout << '.';
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A, B, C;
cin >> A >> B >> C;
cout << ((A == B && B == C) ? "Yes" : "No") << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[200000 + 5];
map<int, pair<pair<int, int>, pair<int, int> > > s;
priority_queue<int> Q;
int fa(int x) {
int y = 1;
while (y < x) y <<= 1;
return y - x;
}
int main() {
int n, i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
Q.pu... | 5 |
#include <bits/stdc++.h>
using namespace std;
int ans;
const int N = 300007;
vector<pair<int, int> > mas;
int cnt[N], ptr[N];
void solve() {
int n, q;
scanf("%d%d", &n, &q);
int ct = 0;
while (q--) {
int ty;
scanf("%d", &ty);
if (ty == 1) {
int x;
scanf("%d", &x);
mas.push_back(mak... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long N, H, i, j, be[200005], en[200005], ANS;
long long st, dr, mid, P, sum, X;
map<long long, long long> S;
int main() {
cin >> N >> H;
ANS = H;
for (i = 1; i <= N; i++) {
cin >> be[i] >> en[i];
ANS = max(ANS, H + en[i] - be[i]);
if (i == 1) continue... | 4 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cassert>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
int h,w,e[10][10];
int main() {
while( cin >> h >> w, h|w ) {
rep(i,h) rep(j,w) cin >> e[i][j];
int maxi = 0;
rep(y1,h) if( y1+2 < h ) {
... | 0 |
#include <cstdio>
#include <vector>
using namespace std;
using ll = long long;
const ll inf = 4e18;
ll n, t, q;
ll a[123456];
bool d[123456];
ll x[1000];
vector<ll> talkp;
ll place[123456];
inline ll mean(ll a, ll b) { return a/2 + b/2; }
int main()
{
scanf("%lld %lld %lld", &n, &t, &q);
a[0] = -inf; d[0] = tr... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18, MAXN = 2e5 + 100;
multiset<pair<long long, long long> > s[4];
long long a[MAXN], b[MAXN], fav, n, p[MAXN], m;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> n;
for (long long i = 0; i < n; i++) cin >> p[i]... | 2 |
#include <bits/stdc++.h>
using namespace std;
char gap = 32;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
for (const auto &x : v) os << gap << x;
return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << ... | 1 |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limit... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int qr() {
int f = 0, fu = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') fu = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
f = (f << 3) + (f << 1) + c - 48;
c = getchar();
}
return f * fu;
}
const int N = 3e5 +... | 3 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long t;
cin >> t;
while (t--) {
long long a1, b1, a2, b2;
cin >> a1 >> b1 >> a2 >> b2;
bool flag = 0;
if (a1 == a2) flag |= (b1 + b2) == a1;
if (a1 == b2) flag |= (b1 + a2) == a1;
if... | 2 |
#include <bits/stdc++.h>
using namespace std;
const static int N = 1e5 + 7;
const static int M = 1e5 + 7;
const int static inf = 1e9;
int p[N][2];
int c[M][3];
int pNum[M];
int pp[2 * N + 6 * M][4], pi;
int ppBak[2 * N + 6 * M][4];
int ss[M];
int cc[M];
int lev[M];
int startPoint, endPoint;
char ansColor[N];
void addE(... | 4 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b,c;
cin >> a >> b >> c;
puts(a[a.size()-1]==b[0] && b[b.size()-1]==c[0] ? "YES" : "NO");
}
| 0 |
#include <bits/stdc++.h>
int b[100001], s[100001];
using namespace std;
int main() {
int n, t;
scanf("%d %d", &n, &t);
char c;
int p, q, co = 0;
set<int> st;
for (int i = 0; i < n; i++) {
scanf("%c", &c);
scanf("%d", &p);
scanf("%d", &q);
cin >> c >> p >> q;
if (c == 'B')
b[p] += q... | 2 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const long long mod = 1000000007;
int n;
int num[200005], used[200005];
int find(int be, int flag) {
for (int i = be; i <= n; i++) {
if (flag == 0) {
if (num[i] == 0) return i;
} else {
if (num[i]... | 3 |
#include <bits/stdc++.h>
using namespace std;
string s;
int nr1, nr2;
map<pair<int, int>, bool> Map;
int NR;
int nr11;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ')') continue;
nr2 = 0;
nr1 = 1;
nr11 = 1;
for (int j = i + 1; j < s.size(); j++) {
if (s[j] == '('... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a==b&&a!=c||b==c&&b!=a||c==a&&c!=b){
cout<<"Yes";
}
else{
cout<<"No";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int dp[30004][505], gem[30004];
int main() {
int i, j, n, d, x, m, p, ans = 0;
cin >> n >> d;
for (i = 1; i <= n; i++) {
cin >> x;
gem[x]++;
}
for (i = 0; i <= 30000; i++)
for (j = 0; j <= 500; j++) dp[i][j] = -1;
ans = dp[d][250] = gem[d];
for (i ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int dirx[] = {-2, -1, 1, 2, 1, -1};
const int diry[] = {0, 1, 1, 0, -1, -1};
inline void debugMode() {}
int n, a[200100], b[200100], dp[200100], cnt, curr, cc;
bool u = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
n++;
f... | 3 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[500];
int main() {
long long n, x, y;
scanf("%I64d", &n);
for (int i = 0; i < n; i++)
scanf("%I64d%I64d", &x, &y), a[i] = make_pair(y, x);
sort(a, a + n);
int t, p = 0;
scanf("%d", &t);
long long sum = 0, s;
y = 0;
for (int... | 3 |
#include <bits/stdc++.h>
int main() {
long long int n, m, i, c;
scanf("%I64d %I64d", &n, &m);
int a[m];
for (i = 0; i < m; i++) scanf("%I64d", &a[i]);
c = a[0] - 1;
for (i = 0; i < m - 1; i++) {
if (a[i + 1] < a[i]) {
c += n - a[i] + a[i + 1];
} else {
if (a[i + 1] > a[i])
c += a... | 2 |
#include <iostream>
#include <queue>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstring>
#include <cmath>
#include <sstream>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostrings... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(false),cin.tie(NULL);
#define dbg cout<<"-------------------------\n"
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define irep(i,a,b) for(int i=a;i>=b;i--)
#define ip(V,n)... | 2 |
#include <bits/stdc++.h>
int n, len;
int a[100005];
int f[100005];
using namespace std;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
f[a[i]] = f[a[i] - 1] + 1;
len = max(len, f[a[i]]);
}
printf("%d", n - len);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
string s;
for(int i=0;i<h;i++){
cin >> s;
cout << s << endl << s << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef long long ll;
int t, n;
ll c[200000 + 10];
ll a[200000 + 10];
ll b[200000 + 10];
ll ans, mark;
ll dp[200000 ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int oo = 1e9 + 10;
int n;
int Prime_Divisor[9];
int Prime_Count = 0;
int calc(int cur, vector<long long> &a, vector<long long> &tree,
int rootChildren_Num, int rootChildren_Sum) {
if (cur == a.size())
r... | 5 |
#include <bits/stdc++.h>
struct point {
int x;
int y;
};
point loc(int m, int a) {
point res;
res.x = a / m;
res.y = a % m;
if (res.y == 0) res.x--;
return res;
}
int main() {
int n, m, a, b;
while (scanf("%d%d%d%d", &n, &m, &a, &b) != EOF) {
point st, ed;
st = loc(m, a);
ed = loc(m, b);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void maximize(T &x, T y) {
if (x < y) x = y;
}
template <class T>
void minimize(T &x, T y) {
if (x > y) x = y;
}
int n, m, t;
vector<int> a, b;
int d[100005], z[100005], rig[100005];
int s[2 * 100005];
int sum(int l, int r) {
int ret = s[r];
if (l... | 4 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
int sum=0;
vector<int> solve(bitset<13>&used, vector<int>&nums) {
if (used.count() == 13) {
return vector<int>{-1};
}
else {
for (int i = 0; i < 13; ++i) {
if (!used[i]) {
if (sum ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
ll d, k, a, b, t;
cin >> d >> k >> a >> b >> t;
if (d <= k) {
cout << d * a;
return 0;
}
ll posib = d / k;
if (!(d % k)) {
--posib;
}
posib = posib * t + d * a;
po... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.