solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include<bits/stdc++.h>
using namespace std;
#define jxc 1000000007
#define MN 100010
int Fac[MN],Ifac[MN],Inv[MN],a[MN],f[MN];
int A(int x,int y){return ((x+y)%jxc+jxc)%jxc;}
int D(int x,int y){return ((x-y)%jxc+jxc)%jxc;}
int M(int x,int y){return ((1ll*x*y)%jxc+jxc)%jxc;}
int C(int x,int y){return x<y?0:M(Fac[x],M(I... | 0 |
#include <bits/stdc++.h>
using namespace std;
int r[1005], l[1005], ans[1005];
int main() {
int n, res = 0;
cin >> n;
for (int(i) = (0); (i) < (n); i++) cin >> l[i];
for (int(i) = (0); (i) < (n); i++) cin >> r[i];
for (int(i) = (0); (i) < (n); i++) res = max(res, l[i] + r[i] + 1);
for (int(i) = (0); (i) < (... | 3 |
#include <bits/stdc++.h>
using namespace std;
int A[100010];
int main() {
int t, ans, i, m, x, y;
scanf("%d", &m);
int sum2 = 0;
for (i = 0; i < m; i++) {
scanf("%d", &A[i]);
sum2 = sum2 + A[i];
}
scanf("%d %d", &x, &y);
ans = 0;
int sum = 0;
for (i = 0; i < m; i++) {
sum = sum + A[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long a, b, c, d, e, i, j, k, l;
cin >> a >> b;
if (a <= b)
cout << abs(a - b) << endl;
else if (a % 2 + b % 2 == 1)
cout << 1 << endl;
else
cout << 0 << endl;
}
}
| 1 |
#include <bits/stdc++.h>
double t[5], temp;
double x_1, y_1, r1, x2, y2, r2, x3, y3, r3, X = 0.0, Y = 0.0;
int f = 0;
double check(double dx, double dy) {
double ret = 0.0;
t[0] = sqrt(((dx - x_1) * (dx - x_1)) + ((dy - y_1) * (dy - y_1))) / r1;
t[1] = sqrt(((dx - x2) * (dx - x2)) + ((dy - y2) * (dy - y2))) / r2;... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const double EPS = 1e-12, INF = 1e9;
pair<double, double> operator+(const pair<double, double> &a,
const pair<double, double> &b) {
return make_pair(a.first + b.first, a.second + b.second);
}
pair<double, double> o... | 3 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
s.at(3) = '8';
cout << s << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, c;
vector<int> vx[100005];
vector<int> v;
vector<pair<int, int> > e[100005];
int q;
int qx[100005], qy[100005];
int fa[100005];
int ans[100005];
int find(int x) {
if (fa[x] != x) fa[x] = find(fa[x]);
return fa[x];
}
map<pair<int, int>, int> mp;
int main(... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
pair<int, int> a[N], b[N * 15];
int n, cnt;
void solve(int l, int r) {
int m = (l + r) >> 1, mx = a[m].first;
for (int i = l; i <= r; ++i) b[++cnt] = make_pair(mx, a[i].second);
if (l < m) solve(l, m - 1);
if (m < r) solve(m + 1, r);
}
int main(... | 2 |
#include <iostream>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#define INF 1001001001001001001
using namespace std;
typedef long long ll;
typedef pair<int,int> pa;
typedef pair<ll,pa > ppa;
vector<pa> ve[2][100010];
int swi[2][200010];
ll res[2][200010],kar[2][200010];
int main(){
int M,N,... | 0 |
#include <bits/stdc++.h>
template <typename T>
inline bool chkmin(T &a, T b) {
return b < a ? a = b, true : false;
}
template <typename T>
inline bool chkmax(T &a, T b) {
return b > a ? a = b, true : false;
}
template <class T>
inline T read(T &x) {
int sign = 1;
char c = getchar_unlocked();
for (; !isdigit(c... | 4 |
#include <bits/stdc++.h>
using namespace std;
int const N = 1e6 + 100;
long long int const LINF = numeric_limits<long long int>::max();
int const INF = numeric_limits<int>::max();
int const BN = 31;
long long int gcd(long long int a, long long int b) {
return b ? gcd(b, a % b) : a;
}
long long int pow_mod(long long i... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
using namespace std;
long long int n, a[505], dp[505][505], b[505], p[505];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> n;
for (long long int i = 1; i <= n; i++) {
cin >> a[i];
... | 4 |
#include <bits/stdc++.h>
inline long long max(long long a, long long b) { return b < a ? a : b; }
long long n, v[100010], x, y, root;
long long e, bg[100010], nx[100010 << 1], to[100010 << 1];
inline void link(long long u, long long v) {
to[++e] = v, nx[e] = bg[u], bg[u] = e;
}
long long f[4][100010];
void SummerPock... | 6 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long A=0, ans=0;
string S;
cin >> S;
for(long long i=0;;i++){
if(S[i+1]=='\0')
break;
if(S[i]=='A')
A++;
else if(S[i]=='B' && S[i+1]=='C'){
ans += A;
i++;
}else{
A=0;
}
}
cout << ans << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, i, x = 0;
cin >> n;
long long int a[n];
for (i = 0; i < n; ++i) {
cin >> a[i];
}
if (n == 1) {
cout << "YES\n";
continue;
}
for (i = 1; i < n; ++i)... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, u, d, node, q, x;
stack<int> st;
string s;
int main() {
cin >> n >> q;
while (q--) {
scanf("%lld", &x);
cin >> s;
node = (n + 1) / 2;
u = 0;
d = node / 2;
while (node != x) {
if (node > x) {
st.push(1);
node -= ... | 4 |
#include<cstdio>
#include<algorithm>
using namespace std;
#define N 105000
int n,a[N],b[N],v[N*2],id1[N],id2[N];
long long su1,su2,su[N*2],as=1e18;
long long solve(int i)
{
if(id1[i]>n&&id2[i]>n)return su[n];
else if(id1[i]>n+1||id2[i]>n+1)return su[n+1]-(id1[i]<=n+1?v[id1[i]]:0)-(id2[i]<=n+1?v[id2[i]]:0);
else retu... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, p[200000], tosolve[20000];
long long moves[20000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> p[i];
tosolve[1] = 2;
moves[1] = 2;
for (int i = 2; i <= n; i++) {
for (int j = p[i]; j < i... | 4 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int,i... | 0 |
#include <bits/stdc++.h>
using namespace std;
double x[1048577];
int f[20][3];
int n, l, r;
double angl(int v) { return v * M_PI / 180.0; }
int main() {
cin >> n >> l >> r;
for (int i = 0; i < n; ++i) cin >> f[i][0] >> f[i][1] >> f[i][2];
for (int i = 0; i < 1048577; ++i) x[i] = l;
double res = -1000000;
for ... | 4 |
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using ld = long double;
mt19937 rnd(time(nullptr));
int Func(vector<int>& data, int l, int r) {
int result = 0;
int n = (r - l + 1) - 1;
for (int i = l, k = 0; i <= r; i++, k++) {
if ((n | k) == n) result ^= data[i];
}
return result;
}
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int64_t i = 0; i < (n); i++)
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;cin>>s;
const int n=s.size();
vector<vector<int64_t>>dp(n+1,vector<int64_t>(13,0));dp[0][0]=1;
REP(i,n)
{
int x;
if(s[i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int a[n], zero = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
const int MAXM = 3005;
const double inf = 1e8;
const double eps = 1e-8;
template <typename T>
inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
whi... | 6 |
#include <bits/stdc++.h>
using namespace std;
map<string, int> a;
string s, s1;
int res, len, i;
int main() {
while (getline(cin, s)) {
s1 = s.substr(1, s.length());
if (s[0] == '+')
a[s1]++;
else if (s[0] == '-')
a.erase(s1);
else {
len = s.length() - s.find(":") - 1;
res += a... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int p=1e9+7;
unsigned long long power(unsigned long long x,
int y)
{
unsigned long long res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0)
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
pair<int, int> a[100001];
int n, ans = 0, max;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
sort(a, a + n);
max = a[0].second;
for (int i = 0; i < n; i++) {
if (a[i].second < max)
ans++;
else
max = a[... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k, dp[100003][5], A[1000000], B[1000000], t, sum, ans;
cin >> n;
for (i = 0; i < n; i++) {
cin >> A[i];
}
sort(A, A + n);
sum = A[0];
ans = 1;
for (i = 1; i < n; i++) {
if (sum <= A[i]) {
ans++;
sum = s... | 4 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
string s[1005],t[1005];
ll pre[1005][1005];
ll pre2[1005][1005];
ll mp[1005];
ll mq[1005];
int n1,m1,n2,m2;
ll p=131,q=233;
ll Q=1e9+7;
void solve(){
mp[0]=mq[0]=1;
for(int i=1;i<=1000;i++){
mp[i]=mp[i-1]*p%Q;
mq[i]=mq[i-1]*q%Q;
}
for(int i=1;i<... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 205;
int n, mod, fc[N], iv[N], ans, a1, dp[N][N][N], v[N][N][N];
int qp(int a, int b) {
int ans = 1;
while (b) {
if (b & 1) ans = 1ll * ans * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return ans;
}
int dfs(int i, int j, int k) {
int &f =... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10, N = 1e9;
const long long inf = 1ll << 60;
char s[maxn];
long long x[maxn], y[maxn], x2, y2;
int n;
int ok(long long m) {
long long t1 = m / n, t2 = m % n;
long long x1 = t1 * (x[n] - x[0]) + x[0] + (x[t2] - x[0]);
long long y1 = t1 * (y[n] -... | 3 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y, n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x >> y;
if (x - y == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int MAXN = 2000000 + 10;
const int MOD = 1e9 + 7;
template<class T>
T modularExp(T base, T exp)
{
T ret = 1;
while (exp)
{
if (exp & 1)
ret = ret * base % MOD;
base = base * base % MOD;
exp >>= 1;
}
return ret;
}
int fact[MAXN + 1... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
ll rui(ll a,ll b){
ll ans=1;
while(b>0){
if(b&1) ans = ans*a%mod;
a = a*a%mod;
b/=2;
}
return ans;
}
ll comb(ll a,ll b){
ll ans=1;
for(ll i=a;i>a-b;i--){
ans=ans*i%mod;
}
for(ll i=1;i<=b;i++){... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
int b;
cin>>a;
b=a+a*a+a*a*a;
cout<<b;
}
| 0 |
#include <bits/stdc++.h>
#pragma GCC optimize "03"
const long long int MOD = 1e9 + 7;
const long long int INF = 1011111111;
const long long int LLINF = 1000111000111000111LL;
const long double EPS = 1e-10;
const long double PI = 3.14159265358979323;
using namespace std;
long long int power(long long int base, long long... | 2 |
#include <stdio.h>
typedef struct pair{
double x,y;
}pair;
double abs(double a){
if(a<0) return -a;
return a;
}
double naiseki(pair A,pair B,pair C,pair D){
pair a,b;
a.x=B.x-A.x;
a.y=B.y-A.y;
b.x=D.x-C.x;
b.y=D.y-C.y;
return a.x*b.x+a.y*b.y;
}
int main(){
pair A,B,C,D;
while(~scanf("%lf%lf%lf%lf%lf%lf%lf%l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
if (((n / 3 + 1) * 1 + (n / 3) * 2) == n) {
cout << n / 3 + 1 << " " << n / 3 << "\n";
} else if (((n / 3) * 1 + (n / 3 + 1)... | 1 |
#include <bits/stdc++.h>
using namespace std;
void display(string s, int rock, int paper, int scissors) {
int len = s.size();
char c[len + 1];
memset(c, 0, sizeof(char) * (len + 1));
for (int i = 0; i < len; ++i) {
if (s[i] == 'R' && paper > 0)
--paper, c[i] = 'P';
else if (s[i] == 'P' && scissors... | 2 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#incl... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
long long a, b, t;
int main(int argc, char* argv[]) {
cin >> n >> m;
a = 0;
b = 0;
for (int i = 0; i < n; i++) {
cin >> t;
a *= m;
a += t;
}
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> t;
b *= m;
b += t;
}
if (a ==... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxN=1e6+10;
ll a[maxN];
ll node[maxN*4];
ll lazy [ maxN * 4 ] ;
ll num[maxN];
void Push_down(int l,int r,int rt)
{
if(lazy[rt]!=0)
{
int mid=(l+r)/2;
node[rt*2]+=(mid-l+1)*lazy[rt];
node[rt*2+1]... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &x : v) is >> x... | 3 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const double eps = (1e-5);
int isGreater(long double x, long double y) {
if (abs(x - y) < eps) return 0;
if (x > y) return 1;
return -1;
}
const int MAX_N = 105, H = 30, MID = 15;
int n;
map<vector<int>, int> cntToMask;
map<in... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
if (n == 1) {
cout << -1;
return 0;
}
cout << n << " " << n + 1 << " " << n * (n + 1);
return 0;
}
| 3 |
#include <bits/stdc++.h>
int num[30001], dp[30001][501];
int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, d, x, i, j, ans;
scanf("%d %d", &n, &d);
for (i = 0; i < n; i++) {
scanf("%d", &x);
num[x]++;
}
memset(dp, -1, sizeof(dp));
dp[d][250] = num[d];
ans = 0;
for (i = d; i <= ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main(){
cin >> a >> b >> c;
if (c<min(a,b) || c>max(a,b))
cout << "No";
else cout << "Yes";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, t, pi[1003], pref[1003], suf[1003], si[1003], temp, res, l;
string s, z;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> z;
memset(suf, 0, sizeof(suf));
memset(pi, 0... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x[1000], counter = 0;
bool y = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (x[i] < x[j] && i != j) {
y = 0;
break;
} else
... | 1 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#d... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int a, b, c, x, ans=0;
cin>>a>>b>>c>>x;
for (int i=0;i<=a;i++)
for(int j=0;j<=b;j++)
if((x-i*500-j*100>=0)&&(x-i*500-j*100<=c*50)) ans++;
cout<<ans<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int check(vector<char> a, int i, char b) {
int dem = 0;
int dem2 = 0;
char C = a[i];
char D = a[i];
while (D != b) {
dem++;
D++;
if (D == '[') D = 'A';
}
while (C != b) {
dem2++;
C--;
if (C == '@') C = 'Z';
}
if (dem > dem2)
ret... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long INF = 1e7;
double EPS = 1e-12;
double tick() {
static clock_t oldt;
clock_t newt = clock();
double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC;
oldt = newt;
return diff;
}
long long int powP(long long int a, long long int b) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n;
string A[1010], B[1010];
string C[1010];
unordered_map<string, vector<int> > VA, VB;
int cal() {
while (1) {
int f = 0;
for (auto it = VB.begin(); it != VB.end(); ++it) {
if (VA[it->first].size() != 1) continue;
int idx = VA[it->first][0];
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int p[111][5];
double dx[555], dy[555];
int cnt;
int n;
int main() {
scanf("%d", &n);
cnt = 0;
for (int j = 0; j < 5; ++j) p[1][j] = ++cnt;
dx[p[1][0]] = 3.830127018922193;
dy[p[1][0]] = 3.366025403784439;
dx[p[1][1]] = -3.601321235851749;
dy[p[1][1]] = 10.057... | 4 |
#include <stdio.h>
int main(){
int N=0;
scanf("%d",&N);
if(N<1200)
{
printf("ABC");
}
else
{
printf("ARC");
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int a[200000];
int b[200000];
int n, d;
long long int x;
int getNextX() {
x = (x * 37 + 10007) % 1000000007;
return x;
}
void initAB() {
int i;
for (i = 0; i < n; i = i + 1) {
a[i] = i + 1;
}
for (i = 0; i < n; i = i + 1) {
swap(a[i], a[getNextX() % (i +... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i, j, l, f = 0, m, g = 0, size;
cin >> n >> k;
long long int arr[n];
long long int temp[k];
for (i = 0; i < n; i++) cin >> arr[i];
for (i = 0; i < n; i++) {
if (f == k) break;
for (j = 0; j < f; j++) {
if (temp[j] =... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)(1000000007);
double power(double x, int y) {
double ans = 1;
while (y) {
if (y & 1) {
ans = ans * x;
}
x = x * x;
y = y >> 1;
}
return ans;
}
int main() {
double m, n;
cin >> m >> n;
double ans = 0;
for... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
map<int, vector<pair<int, int> > > e;
int n, m, root, cnt, deg[MAXN];
int c[MAXN], id[MAXN], to[MAXN], belong[MAXN];
inline int read() {
int X = 0, flag = 0;
char ch = 0;
while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
while (isdigit... | 4 |
#include <algorithm>
#include <array>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size... | 0 |
#include <bits/stdc++.h>
using namespace std;
string onezero(int n) {
string s = "1";
for (int i = 1; i < n; ++i) {
s += "0";
}
return s;
}
string findSum(string str1, string str2) {
if (str1.length() > str2.length()) swap(str1, str2);
string str = "";
int n1 = str1.length(), n2 = str2.length();
rev... | 3 |
#include <stdio.h>
int main (){
int H,A;
scanf("%d %d", &H,&A);
printf("%d", ((H-1)/A)+1);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
set<pair<long long, long long> > s;
int a, b, w, h, n;
int A[100100];
bool good(long long w, long long h) {
return (w >= a && h >= b) || (w >= b && h >= a);
}
int main() {
ios::sync_with_stdio(false);
cin >> a >> b >> w >> h >> n;
for (int i = 0; i < (int)(n); ++i) ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a;
cin >> a;
cout << a % 2 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int BASE = 27;
const int oo = 1e9;
const double EPS = 1e-9;
const int N = 300000 + 1;
const int BIT = 19;
int n, k, second[N], first[N], dp[N][2];
int cl(int a, int b) { return a / b + (a % b != 0); }
long long fn(long long pa, long long pus... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int x, y;
for (int i = 0; i < n; ++i) {
cin >> x >> y;
cout << x << " " << x * 2 << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int m, int a, int b) {
a--;
b--;
int i1 = a / m, j1 = a % m;
int i2 = b / m, j2 = b % m;
if ((j1 == 0 && (j2 == m - 1 || b == n - 1)) || i1 == i2) return 1;
if (j1 == 0 || j2 == m - 1 || b == n - 1 || i2 - i1 == 1 || j1 - j2 == 1)
return 2;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN=9e5+1e1,Mod=1e9+7,Tp=9e5;
int fac[MAXN],inv[MAXN],p[MAXN],f[MAXN];
int n,m,k,ans1=0,ans2=0;
int Qpow(int A,int B)
{
int res=1;
while(B>0)
{
if(B&1) (res*=A)%=Mod;
(A*=A)%=Mod,B>>=1;
}
return res;
}
int C(int A,int B)
{
if(A<... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
set<int> st;
for(int i=0;i<=101;i++)
st.insert(i);
int n,x;
cin>>x>>n;
for(int i=1;i<=n;i++)
{
int p;
cin>>p;
st.erase(p);
}
int ans=0;
for(auto it:st)
if(abs(it-x)<abs(ans-x))
ans=it;
cout<<ans;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
unsigned n, k;
cin >> n >> k;
unsigned *temp = new unsigned[n];
for (unsigned i = 0; i < n; ++i) {
cin >> temp[i];
}
double max = 0.;
for (int i = 0; i <= n - k; ++i) {
unsigned sum = 0U;
int j = i;
for (; j < i + k; ++j) {
... | 3 |
#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, m;
long double k;
cin >> n >> m >> k;
vector<pair<string, long long int> > v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
vector<p... | 1 |
#include <iostream>
using namespace std;
int main() {
while(1){
int a, b;
char op;
cin >> a >> op >> b;
if(op == '+') cout << a+b <<endl;
else if(op == '-') cout << a-b <<endl;
else if(op == '*') cout << a*b <<endl;
else if(op == '/') cout << a/b <<endl;
else break;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
signed main(){
char a,b;
cin >> a >> b;
cout << ((a ^ b) ? "D" : "H") << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int l, r, mid;
int val;
node *lch, *rch;
node(int a, int b) {
l = a;
r = b;
mid = (a + b) / 2;
lch = rch = 0;
val = b - a;
}
void check() {
if (lch == 0) lch = new node(l, mid);
if (rch == 0) rch = new node(mid, r);
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5;
long long N, Q, A[MAXN];
long long solve(long long AA, long long BB) {
long long X, Y;
if ((AA + BB) & 1) {
BB++;
}
Y = (AA + BB) / 2;
X = AA - Y;
return max(X, Y);
}
void solve() {
vector<long long> diff(N - 1);
long long inc = 0;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long x, y, a, b, c = 0;
cin >> x >> y >> a >> b;
vector<pair<long long, long long> > A;
for (long long i = (a); i < (x + 1); i++)
for (long long j = (b); j < (y + 1); j++)
if (i > j) A.push_back(make_pair(i, j));
cout << A.size() << '... | 1 |
#include <bits/stdc++.h>
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) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
const double E... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2311111;
int n, m, a[maxn], fa[maxn];
int get(int x) {
if (fa[x] == x) return x;
return fa[x] = get(fa[x]);
}
struct node {
int i, j;
bool operator<(const node &b) const {
return a[(i - 1) * m + j] < a[(b.i - 1) * m + b.j];
}
} p[maxn];
int lm... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
n = n - i;
}
if (n == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b;
cin>>a>>b;
cout<<(a-1)*(b-1)<<"\n";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt(0);
cin >> n;
int x[n], y[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (x[i] == y[j]) cnt++;
}
}
cout << cnt << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long p = 31;
long long hash1(string s) {
long long h = 0;
long long pow = p;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.')
h += 0;
else
h += (s[i] + 1) * pow;
pow *= p;
}
return h;
}
int main() {
int n, m;
long long h = -1;... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<min(min((a+b),(b+c)),(c+a))<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
int a[10005];
int main() {
int n, w;
scanf("%d%d", &n, &w);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int sum = 0, max1 = 0, min1 = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (sum < min1) min1 = sum;
if (sum > max1) max1 = sum;
}
if (max1 > 0)
printf("%... | 5 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
int n;
int x[100];
int y;
double sum1=0,sum2=0,sum3=0,sumi=0;
cin >> n;
for(int i=0; i<n; i++)
cin >> x[i];
for(int i=0; i<n; i++){
cin >> y;
sum1 += abs(x[i]-y);
sum2 += (x[i]-y)*(x[i]-y);
sum3 ... | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const double PI = acos(-1);
long long gcd() { return 0ll; }
template <typename T, typename... Args>
T gcd(T a, Args... args) {
return __gcd(a, (__typeof(a))gcd(args...));
}
long long a[200005], bit[200005], bit1[200005];
long long b[200005], c[... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
const long long INF = 1e18;
const long double EPS = 1e-12;
int n, m, a[100005], b[100005];
int freq[100005];
void init() {
cin >> n;
for (int i = 0; i < (int)n; i++) {
cin >> a[i];
}
int l = 0, r = n - 1;
while ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int t;
cin >> t;
while (t--) {
long long int n, k, x;
cin >> n >> k;
vector<long long int> a, b;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
}
for (int... | 2 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n;
char s[3005];
int dp[3005][3005];
int si[3005][3005];
int main(){
cin>>n;
cin>>s+1;
dp[1][1]=1;
for(int i=1;i<=n;i++) si[1][i]=1;
for(int i=2;i<=n;i++){
for(int j=1;j<=i;j++){
if(s[i-1]=='>') dp[i][j]=(si[i-1][i-1]-si[i-1][j-1]+mod)%m... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a1, a2, a3, n, s, i, j, k, x, ans, ans1, ans2;
int main() {
cin >> n >> s;
for (i = 1; i <= n; i++) {
cin >> x;
if (x == 3) a1++;
if (x == 4) a2++;
if (x == 5) a3++;
}
ans = 1e9;
for (i = s / n; i >= 0; i--)
for (j = (s - i * a1) / (a2 + a3... | 5 |
#include <bits/stdc++.h>
using namespace std;
const double INF = (int)1e9;
const int T = (int)1e6;
const int N = 111;
int n;
double p[N];
double q[N];
int r[N];
double ans = 1;
int a[N];
int choose() {
int v = -1;
double val = INF;
for (int i = 0; i < n; i++) {
double w = (1 - q[i]) / (1 - q[i] * (1 - p[i]));... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
if ((n % 2) == 0)
cout << n / 2;
else
cout << n / 2 + 1;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using std::max;
const int maxn = 20000 + 11, maxk = 61, maxp = 111;
int f1[maxn], f2[maxn], sum[maxn], a[maxn];
int maxf[maxp];
int main() {
int n, k, p;
scanf("%d%d%d", &n, &k, &p);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
sum[0] = 0;
for (int i = 1; i <= n; ++i) sum[i] = (su... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, sum = 0;
cin >> n;
long long int i, a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i] + ((a[i] - 1) * i);
}
cout << sum;
}
| 2 |
#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];
}
int q;
cin >> q;
for (int i = 0; i < q; i++){
int b, e, t;
cin >> b >> e >> t;
for (int j = b; j < e; j++){
swap(a[j], a[t + j - b]);
}
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int isPrime(long int k) {
if (k == 1) return 0;
if (k % 2 != 0) {
for (int i = 3; i <= sqrt(k); i += 2) {
if (k % i == 0) return 0;
}
return 1;
} else
return 0;
}
int pFact(long int k) {
if (k % 2 == 0)
return 2;
else if (k % 3 == 0)
... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.