solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define gt getchar()
#define ll long long
#define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
inline int in()
{
int k=0;char ch=gt;
while(ch<'-')ch=gt;
while(ch>'-')k=k*10+ch-'0',ch=gt;
return k;
}
const int N=2e5+5;
const ll i... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, n, m, p, q, r, d, su, sx, sy,
prod = 1, maxi, a, b, w, x, y, o, e, f, mini = 10000000000000, t, cnt;
string s, s1, s2;
long long ans[100005];
long long val[100005];
vector<pair<pair<long long, long long>, long long> > v;
map<long long, vector<pair<... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 400;
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first + a.second > b.first + b.second;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);... | 6 |
#include <bits/stdc++.h>
int main() {
int a = 0, b = 1023, n, x;
char c;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("\n%c %d", &c, &x);
switch (c) {
case '|':
a |= x;
b |= x;
break;
case '&':
a &= x;
b &= x;
break;
case '^':
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x, y;
int main() {
scanf("%d%d%d", &x, &y, &n);
int b, a;
double ans = 1000000000;
int aa, bb;
for (b = 1; b <= n; ++b) {
int a1 = 1.0 * x / y * b;
int a2 = a1 + 1;
if (fabs(x * 1.0 / y - 1.0 * a1 / b) < ans) {
ans = fabs(x * 1.0 / y - ... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct $ {
$() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
} $;
const int N = 200005;
struct RollingHash1 {
static const unsigned long long p = 1000000007ULL;
string s;
int n;
vector<unsigned long long> pow, phash;
RollingHash1(string s) : s(s), n(s.... | 4 |
#include <bits/stdc++.h>
using namespace std;
int dp[100005];
int main() {
string s;
cin >> s;
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int l, r, k;
scanf("%d%d%d", &l, &r, &k);
k %= (r - l + 1);
string t = s.substr(l - 1, (r - l + 1));
string t2 = t;
for (int j = 0; j < t.length... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, p;
cin >> n >> p;
int a[2] = {0};
while (n--)
{
int x; cin >> x;
a[x & 1]++;
}
cout << (1LL << a[0]) * (a[1] == 0 ? (p ? 0 : 1) : 1LL << (a[1] - 1)) << "\n";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
vector<int> a(3);
for (size_t i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << ((a[1] + a[0] > a[2]) ? 0 : (-a[1] - a[0] + a[2] + 1));
}
| 1 |
#include <iostream>
using namespace std;
int main() {
int ans[31] = {};
ans[1] = 1;
ans[2] = 2;
ans[3] = 4;
for(int i=4;i<=30;i++) ans[i] = ans[i-3] + ans[i-2] + ans[i-1] ;
while(1) {
int n;
cin >> n;
if(n == 0) break;
cout << (ans[n]/3650) +1 << endl;
}
return 0;
}
... | 0 |
#include <bits/stdc++.h>
int main() {
long long t;
scanf("%lld", &t);
while (t--) {
long long n, c, r;
scanf("%lld", &n);
long long l = ceil(sqrt(n));
long long d = l * l - n;
long long k = d - l;
if (d < l) {
r = l;
c = d + 1;
}
if (d >= l) {
r = l - k - 1;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename _T>
inline void read(_T &f) {
f = 0;
_T 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 & 15);
c = getch... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int B = 1000 * 1000 + 10;
vector<int> order[B];
const int N = 4000 + 10;
int values[N];
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> values[i];
order[values[i]].push_back(i);
}
int res = 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 130000;
const unsigned long long MAX = 5 * 1e9 + 4;
unsigned long long a[100005], b[100005];
int len1, len2, len;
int main() {
string s1, s2;
cin >> s1 >> s2;
len1 = s1.length();
len2 = s2.length();
if (len1 < len2)
for (int i = len1; i < len2; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string me;
cin >> me >> n;
set<string> names;
vector<pair<int, string> > ans;
map<string, int> m;
cin.ignore();
while (n--) {
string action, first = "", second = "", type = "";
getline(cin, action);
int i = 0;
while (actio... | 2 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, i, j;
double p[1000000], x, cur, ans;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%lf", &p[i]);
ans += p[i];
}
x = 0;
for (i = 1; i <= n; i++) {
x += p[i - 1];
x *= p[i];
cur += x;
}
ans = ans + 2 * cur;
printf(... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n, nb = 1;
cin >> n;
priority_queue<pair<int, int> > pq;
pq.push(make_pair(n, -1));
int a[n + 1];
while (!pq.empty()) {
int s = pq.top... | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define chmin(a,b) (a)=min((a),(b));
#define chmax(a,b) (a)=max((a),(b));
#define all(a) (a).... | 0 |
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, d, m, x, y;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> d >> m;
bool hard = false;
for (int i = 0; i < m; i++) {
cin >> x >> y;
if ((x + d - y >= 0) && (x - y - d <= 0) && (x + y - d >= 0) &&
(x + y + d - 2 * n <= 0))
cout... | 2 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 1005
ll mod=1e9+7;
ll mul(ll a,ll b){
return (a*b)%mod;
}
int n,m,a,b;
vector<int> G[MAX],g[MAX];
int p[MAX];
bool flg[MAX];
int update(int x){
flg[x]=true;
if(p[x]==x)return x;
return p[x]=update(p[x]);
}
int find(int x){
if(p[... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin >> n && n){
int ans = 0, s[10000];
for(int i = 0; i < n; ++i)
cin >> s[i];
sort(s, s + n);
for(int i = 1; i < n - 1; ++i)
ans += s[i];
cout << ans / (n - 2) << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k, len;
int a[300010], c[300010];
pair<int, int> q[300010];
long long ans;
void push(pair<int, int> x) {
q[++len] = x;
for (int i = len; i / 2 && q[i] > q[i >> 1]; i >>= 1) swap(q[i], q[i >> 1]);
}
pair<int, int> get() {
int i, j;
pair<int, int> t = q[1];
q... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
int q;
inline int read() {
int rt = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9') {
rt = (rt << 3) + (rt << 1) + (ch & 15);
ch = getchar();
}
return rt;
}
inline long long gcd(long lon... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1010;
long long t, n, arr[MAXN], h, sub[MAXN], cnt, add[MAXN];
long long find(int x) {
long long l = 0, r = cnt;
while (l < r) {
long long mid = (l + r) >> 1;
if (sub[mid] >= x)
r = mid;
else
l = mid + 1;
}
return l;
}
bool c... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
bool Finish_read;
template <class T>
inline void read(T &x) {
Finish_read = 0;
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
if (ch == EOF) return;
ch = getchar();
}
while (isdigit(ch))... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
int n, m, w[22][22], dp[1 << 22], same[22][22], cost[22][22];
char g[22][22];
int main() {
scanf("%d%d", &n, &m);
for (register int i = 0; i <= (1 << n); i++) dp[i] = inf;
dp[0] = 0;
for (register int i = 0; i < n; ++i) scanf("%s", &g[i]);
for... | 5 |
/**
* author: tourist
* created: 19.12.2019 15:42:22
**/
#include <bits/stdc++.h>
using namespace std;
class matching {
public:
vector<vector<int>> g;
vector<int> pa;
vector<int> pb;
vector<int> was;
int n, m;
int res;
int iter;
matching(int _n, int _m) : n(_n), m(_m) {
assert(0 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr1[100], arr2[5000];
int rem, temp, j, k = 0, n;
for (int i = 1; i <= 1000; i++) {
temp = i;
j = 0;
while (temp != 0) {
rem = temp % 10;
arr1[j++] = rem;
temp /= 10;
}
arr1[j] = '\0';
for (int l = j - 1; l >... | 1 |
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define Fst first
#define Snd sec... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll =long long;
ll n,k;
ll ans;
ll dp[1<<17];
const ll mod = 1e9+7;
ll qpow(ll x,ll n)
{
ll res =1;
while(n>0)
{
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
int main(){
cin>>n>>k;
for(ll i=k;i>0;i--){
dp[i]=qp... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool debug = false;
int n, m, k;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
long long ln, lk, lm;
int f[100005], X[100005], Y[100005], root;
struct node {
int l, r;
vector<int> q;
} T[100005 * 4];
int cnt, S;
int ff(int x) { return x == f[x] ? x : f[x] = ff(f[x])... | 5 |
#include <bits/stdc++.h>
using namespace std;
int g[65]{0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5,
6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8,
8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10};
const int MAXN = 1000007;
int s[MAXN];
map<p... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R;
cin >> R;
cout << 1110-R << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(200 * 1000 + 1);
for (int i = 0; i < n; ++i) {
cin >> a[i];
++cnt[a[i]];
}
sort(a.begin(), a.end());
a.resize(unique(a.begin(), a.end()) - a.begin());
int l = 0, r = 0;
int ans = cnt... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n];
int brr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
cin >> brr[i];
}
vector<pair<int, int>> v;
for (int i ... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MOD = 1000000007;
const int UNDEF = -1;
const int INF = INT_MAX - 50;
template <typename T>
inline bool chkmax(T &aa, T bb) {
return ... | 5 |
#include<string>
#include<sstream>
#include<iostream>
using namespace std;
int main(){
for(int m,n;cin>>m>>n,m;){
static bool flg[1000];
static int bef[1000],nxt[1000];
for(int i=0;i<m;i++) flg[i]=true,bef[i]=(i+m-1)%m,nxt[i]=(i+1)%m;
int pos=0,num=m;
for(int i=1;i<=n;i++){
string s; cin>>s;
if(num=... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool getmin(T *a, const T &b) {
if (b < *a) {
*a = b;
return true;
}
return false;
}
template <class T>
inline bool getmax(T *a, const T &b) {
if (b > *a) {
*a = b;
return true;
}
return false;
}
template <class T>
inlin... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2222, mod = 998244353;
inline long long read() {
char ch = getchar();
long long x = 0, f = 0;
while (ch < '0' || ch > '9') f |= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
double Maxalpha = -1;
const double PI = acos(-1.);
const double EPS = 1E-10;
int Zero(double O) { return fabs(O) <= EPS; }
void Read(double &now) {
double IO;
scanf("%lf", &IO);
now = IO;
}
struct Point {
double x, y;
void read() {
Read(x);
Read(y);
}
... | 3 |
#include <stdio.h>
int main(){
int n,i,j,m,f;
char a[100],b[100],x;
while(1){
scanf("%d ",&n);
if(n==0)break;
for(i=0;i<n;i++){
scanf("%c %c ",&a[i],&b[i]);
}
scanf("%d ",&m);
for(i=0;i<m;i++){
scanf("%c ",&x);
f=0;
for(j=0;j<n;j++){
if(x==a[j]){
printf("%c",b[j]);
f=1;
break;
}
}
if(f==0){
printf("%c",x);
}
}
prin... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[5000], b[5000][5000], dp[5000][5000];
int solve2(int i, int j) {
if (b[i][j] != -1) return b[i][j];
if (i == j) {
dp[i][j] = a[i];
return dp[i][j];
}
b[i][j] = solve2(i, j - 1) ^ solve2(i + 1, j);
return b[i][j];
}
int solve(int i, int j) {
if (dp[... | 4 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const double eps = 10e-10;
const int maxn = 1e5 + 5;
const int maxm = 600005;
int sum[105][105];
int main() {
int n, a, b, c, d;
scanf("%d", &n);
for (int i = (0); i < (n); i++) {
scanf("%d%d%d%d", &a, &b, &c, ... | 1 |
#include <bits/stdc++.h>
int N, M, X, L;
char S[60][60];
int P[300];
int vis[60][60];
char buff[500005];
int dfs(int x, int y, int sx, int sy) {
if (x < 0 || x >= N || y < 0 || y >= M || vis[x][y]) {
return 0;
} else if (S[x][y] == 'S') {
double dst = hypot(x - sx, y - sy);
if (dst <= X) {
return ... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read() {
T f = 0, x = 0;
char c = getchar();
while (!isdigit(c)) f = c == '-', c = getchar();
while (isdigit(c)) x = x * 10 + c - 48, c = getchar();
return f ? -x : x;
}
namespace run {
const long long N = 2e5 + 9, inf = 1e18;
long l... | 6 |
#include <bits/stdc++.h>
using namespace std;
int arr[10005], h[10005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t, n, i;
string st;
cin >> t;
while (t--) {
cin >> st;
int ans = 0, cnt = 0;
n = st.length();
for (i = 0; i < n; i++) {
if (st... | 3 |
#include <iostream>
int main(){
int a;
std::cin >> a;
a=a+a*a+a*a*a;
std::cout << a << std::endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> d, a;
int n, t;
int main() {
cin >> n;
while (n--) cin >> t, a.push_back(t);
for (auto i : a)
if (lower_bound(d.begin(), d.end(), i) == d.end())
d.push_back(i);
else
*lower_bound(d.begin(), d.end(), i) = i;
cout << d.size();
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long long dp[1010000];
long long mpow(long long x, long long n) {
long long ans = 1;
while (n) {
if (n & 1) ans = ans * x % 998244353;
x = x * x % 998244353;
n >>= 1;
}
return ans;
}
long long inv(long long x) { return mpow(x, 998244353 - 2); }
int n, m;... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, a[200], sum[200], res;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
for (int i = 1; i <= m; ++i) {
int x, y;
cin >> x >> y;
if (sum[y] - sum[x - 1] > 0) res += sum[y] - sum[... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char s[10010],t[10010];
scanf("%s%s",s,t);
int ls=strlen(s),lt=strlen(t);
for(int i=ls-lt;i>=0;i--){
if(s[i]==t[0]||s[i]=='?'){
bool flag=true;
for(int j=0;j<lt;j++){
if(t[j]!=s[j+i]&&s[j+i]!='?'){
flag=false;
break;
}
}
if(fla... | 0 |
#include <bits/stdc++.h>
using namespace std;
int cnt[2000010];
inline int inn() {
int x, ch;
while ((ch = getchar()) < '0' || ch > '9')
;
x = ch ^ '0';
while ((ch = getchar()) >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ '0');
return x;
}
inline void fwt(int *a, int n) {
for (int i = 1; i <... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,C,A;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) cin >> B[i];
int ans = 0;
for (int i = 0; i < N; i++){
int sum = C;
for (int j = 0; j < M; j++){
cin >> A;
sum += A * B[j];
}
if (sum > 0) ans+... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 20;
double N, K, s;
double L[10 * maxn], R[10 * maxn], ans, mn = 1e18;
long long lucky[10 * maxn];
vector<double> l, r;
void make(long long a) {
if (a > 1e18) return;
lucky[(int)(s + 1)] = a;
s += 1;
make(a * 10 + 4);
make(a * 10 + 7);... | 4 |
#include <iostream>
#include <vector>
using namespace std;
using uint = unsigned int;
using ull = unsigned long long;
int main() {
uint M;
cin >> M;
ull N = 0;
ull S = 0;
for(uint i=0; i<M; i++) {
ull c;
uint d;
cin >> d >> c;
N += c;
S += d * c;
}
cout << (N - 1) + (S - 1) / 9;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
int s[105][105];
string p[105];
int n, m;
vector<pair<lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000.0
int main(){
int N,M;
cin>>N>>M;
vector<vector<int>> E(N,vector<int>());
for(int i=0;i<M;i++){
int a,b;
cin>>a>>b;
a--;b--;
E[a].push_back(b);
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 101111;
int n, m, deg[maxn];
int main() {
cin >> n >> m;
m *= 2;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
deg[u]++;
deg[v]++;
}
int num = 0;
for (int i = 1; i <= n; i++) {
if (deg[i] == 1) {
num++;
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t) {
int n, k1, k2;
cin >> n >> k1 >> k2;
vector<int> v1(k1), v2(k2);
for (auto &it : v1) cin >> it;
for (auto &it : v2) cin >> it;
int m1 = *max_element(v1.begin(), v1.end()),
m2 = *max_element(v2.b... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
for(string s; cin>>s;){
string res;
for(int i=0;i<s.size();i++){
if(s[i] == '@'){
res += string(s[i+1] - '0' , s[i+2]);
i += 2;
}
else res+=s[i];
}
cout << res << endl;
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
int x[100010], nx[100010][20];
int main() {
int N, L, Q;
cin >> N;
for(int i=1; i<=N; ++i) cin >> x[i];
cin >> L;
int now=1;
for(int i=1; i<=N; ++i){
while(now<N){
if(x[now+1]-x[i]<=L){
++now;
}
else break;
}
nx[i][0]=now;
}
nx[N][0]=nx[N+1][0]=N+1;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
const int P = 3e5 + 7;
const int Max_m = 1e5 + 10;
const int MAX = 4e5;
struct Edge {
int u;
int v;
int w;
};
Edge edge[Max_m];
bool isPrime(long long x) {
for (long long i = 2; i * i <= x; ++i) {
if (x % i == 0) {
return false;
}
}
retur... | 3 |
#include <iostream>
#include <cstdio>
int main(void){
while(1){
int w;
scanf(" %d", &w);
if(w==-1) break;
int price = 1150;
if(w<=10){}
else if(w<=20){
price += (w-10)*125;
}
else if(w<=30){
price += 1250 + (w-20)*140;
}
else{
price += 1250 + 1400 + (w-30)*160;
}
printf("%d\n", ... | 0 |
#include <cstdio>
using namespace std;
#define S 1000000
typedef struct{char n[10];int t;}QUE;
QUE que[S];
int main(){
int i=0,T=0,h=0,t,n,q;
scanf("%d %d",&n,&q);
for(t=n;i<n;)scanf("%s %d",que[i++].n,&que[i].t);
while(h!=t){
bool f=que[h].t<=q||t-h==1;
T+=f?que[h].t:q;
if(f)printf("%s %d\n",que[h].n,T);
else{que[h].t... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int n, a[N], p[N];
struct node {
int l, r;
node *L, *R;
};
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> p[i];
node* in = new... | 3 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
while(x!=0&&y!=0){
if(x>y) x=x%y;
else y=y%x;
}
cout<<max(x,y)<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long s = 0, t = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') t = -1;
c = getchar();
}
while (isdigit(c)) s = s * 10 + c - 48, c = getchar();
return s * t;
}
const int N = 3e5 + 5, p = 1e9 + 7;
inline void Max(... | 3 |
#include <bits/stdc++.h>
int main() {
char a[100];
gets(a);
int i, n = 0;
for (i = 0; a[i] != '\0'; i++) {
if (a[i] == 'a' || a[i] == 'e' || a[i] == 'i' || a[i] == 'o' || a[i] == 'u')
n++;
if (a[i] == '1' || a[i] == '3' || a[i] == '5' || a[i] == '7' || a[i] == '9')
n++;
}
printf("%d\n", ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int Maxm = 101;
int t;
int was[Maxm];
int main() {
scanf("%d", &t);
for (int i = 0; i < t; i++) {
int n;
scanf("%d", &n);
while (n--) {
int a;
scanf("%d", &a);
was[a]++;
}
}
bool pr = false;
for (int i = 1; i < Maxm; i++)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int n;
cin >> n;
int lm = -pow(10, 5), rm = pow(10, 5), um = rm, bm = lm;
for (int j = 0; j < n; j++) {
int x, y, f1, f2, f3, f4;
cin >> x >> y >> f1 >> f2 >> f3 >> f4;
if (f... | 3 |
#include<bits/stdc++.h>
using namespace std;
//UnionFind
int n = 100000;
vector<int> par(n);
vector<int> Size(n);
void init(int n){
for(int i=0; i<n; i++){
par.at(i) = i;
Size.at(i) = 1;
}
}
int root(int x){
if(par.at(x) == x){
return x;
}
else{
return par.at(x) = root(par.at(x));
}
}
bo... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V) os << v << " ";
os << "]";
return os;
}
template <class T>
ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S) os << s << " ";
return os << "}... | 6 |
#include <bits/stdc++.h>
using namespace std;
int k, x, n, m;
string make(int n, int c, bool s, bool e) {
string ret = "";
ret.resize(n);
int l = 0, r = n;
if (s) ret[l++] = 'C';
if (e) ret[--r] = 'A';
while (c--) ret[l++] = 'A', ret[l++] = 'C';
while (l < r) ret[l++] = 'X';
return ret;
}
long long coun... | 4 |
#include <bits/stdc++.h>
using namespace std;
int fun[200][200];
int main(void) {
fun[0][0] = 1;
fun[1][0] = 0;
fun[1][1] = 1;
int now = 2;
int flag = 150;
while (flag--) {
for (int i = 0; i <= now; ++i) fun[now][i] = fun[(now - 2)][i];
for (int i = 1; i <= now; ++i)
fun[now][i] += fun[(now - ... | 4 |
#include<bits/stdc++.h>
#define re register
using namespace std;
inline int read() {
int X=0,w=1; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar();
return X*w;
}
const int N=100000+10;
const int mod=1e9+7;
int n,m,cnt,top;
int a... | 0 |
#include <bits/stdc++.h>
using namespace std;
int N;
long long num[110];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; ++i) scanf("%I64d", &num[i]);
long long ans = -1;
for (int i = 0; i < N; ++i) {
long long tmp = 0;
for (int j = i; j < N; ++j) {
tmp ^= num[j];
ans = max(ans, tmp);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int t, k;
long long p[105];
int q[105];
long long V, ans, ansa, ansb, ansc, a, b, c;
long long MAXA, MAXB;
inline void bfs(int dep, long long sum) {
if (sum > MAXB) return;
if (dep > k) {
if (sum < a) return;
b = sum, c = V / a / b;
if (a * b + b * c + a * c... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, x, y, k, p, q;
int main() {
long long t;
scanf("%lld", &t);
while (t--) {
scanf("%lld %lld", &n, &k);
string s1, s3[k + 2];
cin >> s1;
multiset<char> s2;
for (long long i = 0; i < n; i++) s2.insert(s1[i]);
sort(s1.begin(), s1.en... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, b, n, t, now = 1;
cin >> k >> b >> n >> t;
while (now <= t) {
n--;
now = now * k + b;
}
if (n < 0) n = -1;
cout << n + 1;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 5 * 1e7;
long long po(long long x, long long n) {
if (n == 0) return 1;
if (n & 1)
return (x * po((x % 10 * x % 10) % 10, n / 2)) % 10;
else
return po((x % 10 * x % 10) % 10, n / 2) % 10;
}
int main() {
ios_base::sync_with_stdio(0);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long m;
long long a[1010100];
long long dp[3001];
bool check(long long x) {
memset(dp, 0, sizeof(dp));
for (long long i = 1; i <= n; i++) {
dp[i] = 1;
for (long long j = 1; j < i; j++)
if (x * (i - j) >= abs(a[j] - a[i])) dp[i] = max(dp[i... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10, mod = 998244353;
int n, m, k, x, y, op;
long long ans1, ans2, div2;
long long limr[MAXN][2], limc[MAXN][2];
long long cntL, cntR, cntr[MAXN], cntc[MAXN];
long long rcnt1, rcnt2, rcnt0, ccnt1, ccnt2, ccnt0;
map<pair<int, int>, int> color;
long long... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
template <typename T>
inline void read(T &x) {
char ch, t = 0;
x = 0;
while (!isdigit(ch = (iS == iT
? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
... | 5 |
#include <bits/stdc++.h>
using namespace std;
char t[55][55];
bool v[55][55];
pair<int, int> moves[4] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int n, m, pocz;
bool ok;
char kolor;
void otoczka() {
for (int i = 0; i <= n + 1; i++) {
v[i][0] = true;
v[0][i] = true;
v[n + 1][i] = true;
v[i][m + 1] = true;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(7);
vector<int> fact(9);
fact[0] = 1;
for (int i = 1; i < 9; i++){
fact[i]= fact[i - 1] * i;
}
vector<double> p(9);
for (int i = 0; i < 9; i++){
p[i] = (double) fact[8] / fact[i] / fact[8 - i] * pow(0.25, i) * ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int x, xx, yy, mn, y, t, n, z, i, j, k, q, ind, m, mx, mxx, en, pos, row, ccc;
int main() {
cin >> x >> y;
en = x / y;
q = x % y;
for (i = 0; i < y - q; i++) cout << en << " ";
for (i = 0; i < q; i++) cout << en + 1 << " ";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFLL = 1e18;
const int MOD = 1e9 + 7;
const int MAXN = 3e5 + 5;
int sz[MAXN];
vector<int> G[MAXN];
vector<int> ans, bamboo;
int n;
bool cmpSZ(int i, int j) { return sz[i] > sz[j]; }
void dfsSZ(int v, int p = -1) {
sz[v] = 1;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int cnt[50];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while (T--) {
cin >> n;
memset(cnt, 0, sizeof(cnt));
for (int i = 1; i <= n; i++) {
cin >> a[i];
for (int j = 30; j >= ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int c[110], x[110], y[110];
int fdis(int i, int j) {
return (x[i] - x[j] < 0 ? -(x[i] - x[j]) : (x[i] - x[j])) +
(y[i] - y[j] < 0 ? -(y[i] - y[j]) : (y[i] - y[j]));
}
int dis[110], u[110];
int main() {
int n, d, i, j;
scanf("%d%d", &n, &d);
for (i = 1; i < ... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, mat[101][101], u, k, v, i,j;
cin>>n;
for(i=0; i<n; i++){
for(j=0; j<n; j++){
mat[i][j]=0;
}
}
for(i=0; i<n; i++){
cin>>u>>k;
for(j=0; j<k; j++){
cin>>v;
mat[u-1][v-1]=1;
}
}
for(i=0; i<n; i++){
for(j=0; j<n; j++){
cout<<... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const long long mod = 1e9 + 7;
long long dp[N][N];
int a[N];
inline void add(long long &a, long long b) {
a += b;
a %= mod;
}
int main() {
int n, h;
while (cin >> n >> h) {
for (int i = 1; i <= n; i++) cin >> a[i];
memset(dp, 0, sizeof(dp... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, n;
int sum = 0;
int ctr = 0;
ios_base::sync_with_stdio(0);
cin >> n;
int a[n];
for (i = 0; i < (n); i++) {
cin >> a[i];
sum += a[i];
}
for (i = 0; i < (n); i++) {
if ((sum - a[i]) % 2 == 0) ctr++;
}
cout << ctr;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int T = 30;
const int M = 500003;
int f[T][T];
char s[T];
int main() {
int n, ans(0);
scanf("%d", &n);
for (int i = 1, l; i <= n; i++) {
scanf("%s", s), l = strlen(s);
for (int i = 0; s[i]; i++) s[i] -= 'a';
for (int i = 0; i < 26; i++)
if (f[i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a % 2 == 0)
cout << 0 << endl;
else
cout << 1 << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int NMax = 1000005;
const int bitMax = 62;
pair<pair<int, int>, pair<int, int> > Pairs[NMax], newPairs[NMax];
int N, Ord[NMax], cnt, cntNew;
long long K, XPath[NMax];
int Father[NMax];
void Read() {
scanf("%d%I64d", &N, &K);
for (int i = 2; i <= N; i++) {
scan... | 6 |
#define DEBUG_ON
#define CONDITION true
using namespace std;/*{{{*/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n > m) swap(n, m);
if (n == 1)
cout << m - (m + 2) / 3 << endl;
else if (n == 2)
cout << 2 * m - (m + 2) / 2 << endl;
else if (n == 3) {
int ans = 3 * m - m / 4 * 3 - (m % 4);
if (m % 4 == 0) ans--;
c... | 3 |
#include <bits/stdc++.h>
using namespace std;
int solve() {
long long int n, x;
cin >> n >> x;
long long int ar[n][2];
long long int large = 0;
long long int max = 0;
for (long long int i = 0; i < n; i++) {
cin >> ar[i][0] >> ar[i][1];
if (large < ar[i][0]) {
large = ar[i][0];
}
if (ma... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.