solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, x, y;
cin >> n >> l >> x >> y;
vector<int> a(n);
map<int, int> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]] = 1;
}
int ans = 0, i;
vector<int>::iterator it;
bool q1 = false, q2 = false, q3 = false;
int v;
for (i ... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a, b) * b);
}
template <class T>
inline bool read(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c < '0' || c > '9') {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
vector<long long> arrayi;
bool check(long long mid) {
long long sum = 0, temp = 0, k = 0;
for (int i = 0; i < n; i++) {
sum += max((long long)0, arrayi[i] - k);
temp++;
if (temp == mid) {
temp %= mid;
k++;
}
}
if (sum >= m... | 4 |
#include <bits/stdc++.h>
using namespace std;
int f[15];
string s;
int main() {
int n;
cin >> n;
cin >> s;
int c = 0, d = n + 1;
long long sum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
c++;
if (c > (n - 11) / 2) {
d = i;
break;
}
}
}
cout << ((c > (n... | 2 |
#include<bits/stdc++.h>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
/*Gauss_Jordan(2?????°???????????§???)
O(n^3)
Ax=b????§£??? A?????£?????????
?§£???????????¨??????????????????????????????
?§£???????????§????????¨?????????n+1??????????????????
N???????????°??§M??????????¨??????... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> edge[1000000 + 10];
int deep[1000000 + 10], dp[1000000 + 10], low[1000000 + 10];
int ans[1000000 + 10];
void dfs(int rt, int first) {
deep[rt] = deep[first] + 1;
if (edge[rt].size() == 1 && rt != 1) {
low[rt] = deep[rt];
dp[rt] = 1;
ret... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(8);
long long n, k;
cin >> n >> k;
long long arr[n];
long long ma = 0;
for (long long i = 0; i < n; ++i) {
cin >> arr[i];
ma = max(arr[i], ma);
}
double ar[n], cek;
for (long long i = 0; i < n; ++i) ar[i] ... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool a[10000005];
vector<int> p;
int n;
void seive() {
long long i, j;
p.push_back(2);
for (i = 3; i <= 10000005; i += 2) {
if (p.size() == n) break;
if (a[i] == 0) {
p.push_back(i);
for (j = i * i; j <= 10000005; j += 2 * i) a[j] = 1;
}
}
}
... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,A,B;
cin>>N>>A>>B;
vector<int64_t>h(N);
for(int64_t i=0;i<N;i++)
cin>>h.at(i);
int64_t left=0;
int64_t right=10000000000;
while(1<right-left){
int64_t mid=left+(right-left)/2;
int64_t a=0;
for(int i=0;i<N;i++){
if(h.at(i)... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using dd = double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<dd, dd>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<dd>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = v... | 2 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(a) (a).begin(),(a).end()
int calc(int a, int b, int c, int d, const vector<vector<int>> &t) {
return t[t[t[t[0][a]][b]][c]][d];
}
int main(){
vector<vector<int>> t(10, vector<int>(10));
REP(i,10)REP(j,10) cin>... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string b;
cin>>b;
for(int i=1;i<=b.size();i++){
cout<<"x";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
queue<int> q[400005];
int a[400005], b[400005];
pair<int, int> temp;
int main() {
int n, m, i, j, k, len = 0, ans = 0;
set<pair<int, int>, greater<pair<int, int> > > pq;
scanf("%d", &n);
scanf("%d", &m);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
q[a[i... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m, b[30];
bool v[110][110];
char a[110][110];
int main() {
scanf("%d%d", &n, &m);
getchar();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m + 1; j++) a[i][j] = getchar();
memset(v, 1, sizeof(v));
for (int i = 1; i <= n; i++) {
memset(b, 0, size... | 2 |
#include <bits/stdc++.h>
using namespace std;
string s1, z[5000];
char ww;
int k, n, s, q, qq, a[5000][300];
int main() {
cin >> k;
cin >> s1;
for (int i = 0; i < k; i++) {
z[i] = s1;
for (int j = 0; j < (int)s1.size(); j++) a[i][(int)s1[j]]++;
}
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d... | 3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<pair<int, int>, int>> G[2005];
long long bit[2005][2005], sum[2005];
bool on[2005];
int X1[2005], X2[2005], Y1[2005], Y2[2005], n, m;
vector<int> asks[2005];
long long query(int r, int c) {
long long ret = 0;
for (; r; r -= r & -r)
for (int cc = c; cc; c... | 5 |
#include <algorithm>
#include <iostream>
#include <complex>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
typedef complex<double> P;
typedef pair<P,P> L;
typedef pair<P,double> C;
typedef vector<P> Poly;
#define X real()
#define Y imag()
const double EPS = (1e-10), pi = acos(-1);
double d... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 10;
int n, m, a[maxn], b[maxn], h[maxn], ecnt, pos[maxn], sfa[maxn], vis[maxn], w[maxn];
ll f[maxn], dp[maxn];
struct enode{
int v, n;
enode() {}
enode(int _v, int _n):v(_v), n(_n) {}
}e[maxn << 1];
inline void addedge(int... | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
using namespace std;
template <class T>
ostream &operator<<(ostream &str, vector<T> &a) {
for (... | 3 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int ok = 1;
char a[10][10];
int num[10] = {0, 0};
for (int i = 0; i < 4; i++) {
scanf("%s", &a[i]);
for (int j = 0; j < 4; j++) {
if (a[i][j] == '.') continue;
int tp = a[i][j] - '0';
num[tp]++;
if (num[tp] > n * 2... | 1 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
set<int> s[2];
multiset<int> len[2];
void cut(int id, int x) {
set<int>::iterator it = s[id].upper_bound(x), itt = it--;
if (itt == s[id].end()) return;
int l = *itt - *it;
len[id].erase(len[id].find(l));
len[i... | 1 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
int main() {
for (int i = 0; i < 9; i++) printf("%d??<>%d\n", i, i + 1);
printf("9??>>??0\n");
printf("??<>1\n");
for (int i = 0; i < 10; i++) printf("?%d>>%d?\n", i, i);
printf("?>>??\n");
printf(">>?\n");... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
int q, dp[31][8], sum[30][8], k;
void add(int &a, int b) {
a += b;
if (a >= M) a -= M;
}
void sub(int &a, int b) {
a -= b;
if (a < 0) a += M;
}
int find(int x, int y) {
if (x < 0 || y < 0) return 0;
int ret = 0;
memset(dp, 0, sizeof dp);... | 3 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int h1,h2,k1,k2,a,b,c,d;
cin >> h1 >> h2 >> k1 >> k2;
cin >> a >> b >> c >> d;
int scoreh,scorek;
scoreh = h1*a + h2*b + (h1/10)*c + (h2/20)*d;
scorek = k1*a + k2*b + (k1/10)*c + (k2/20)*d;
if(scoreh < scorek){co... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int N;
int M;
int K;
vector<int> G[maxn];
vector<int> col[2];
vector<int> s;
vector<int> cyc;
int pos[maxn];
bool dfs(int node) {
pos[node] = s.size();
col[pos[node] % 2].push_back(node);
s.push_back(node);
int low = -1;
for (int u : G[... | 4 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int res = n;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0 && n != i) {
n = n / i;
res += n;
}
}
}
res++;
printf("%d", res);
return 0;
}
| 2 |
#include<iostream>
#include<cmath>
using namespace std;
bool isPrime(int n)
{
if (n < 2)
return false;
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2)
if (n%i == 0)
return false;
return true;
}
int main()
{
while (true)
{
int a, d, n;
cin >> a >> d >> n... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int a[n], mn = 2000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int ans = 0;
for (int i = 1; i < n; i++) {
int x = k - a[i];
ans += x / a[0];
}
cout << ans << "\n";
}
int main() ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
long long n;
long long query(long long p) {
if (p % 2) {
return (p + 1) / 2;
}
long long d = (n + p / 2) - p;
p += d;
while (d % 2 == 0) {
d /= 2;
p += d;
}
return (p + 1) / 2;
}
int main() {
int q;
scanf("%lld%d", &n, &q... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2000010, mod = 1e9 + 7;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getc... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (a + b + c == d + e + f || a + c + d == b + e + f ||
b + c + d == a + e + f || b + c + d == e + f + a ||
b + c + d == f + e + a || b + c + e == d + f + a ||
b + c + e == f + d +... | 1 |
#include <bits/stdc++.h>
using namespace std;
int loc[100010];
int main() {
int prec(0);
int modif(0);
int x = -1, y = -1;
int n, c;
cin >> n;
for (int i(1); i <= n; i++) {
cin >> c;
loc[c] = i;
}
for (int i(1); i <= n; i++) {
if (abs(prec - loc[i]) != 1) {
modif++;
if (x == -1)
... | 2 |
#include <bits/stdc++.h>
using namespace std;
char s[1001];
int main() {
cin >> s;
int len = strlen(s), flag = 1;
long long ans = 0, num = 0;
for (int i = 0; i < len; i++) {
if (s[i] >= '0' && s[i] <= '9')
num = num * 10 + s[i] - '0';
else if (s[i] < '0' || s[i] > '9') {
ans += num * flag;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, minV, res;
cin >> n;
vector<int> v;
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
res = -1;
minV = v[0];
for (int i = 1; i < n; i++) {
if (minV > v[i]) {
minV = v[i];
}
}
res = minV;
for (int i = 0; i... | 1 |
#include <bits/stdc++.h>
long long read() {
long long x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
using namespace std;
const long long maxn = 1e5 ... | 2 |
#include <bits/stdc++.h>
int main() {
int i, n, sum = 0, count = 0, flag = 0;
scanf("%d", &n);
int ar[n + 1];
for (i = 0; i < n; i++) {
scanf("%d", &ar[i]);
sum = sum + ar[i];
}
for (i = 0; i < n; i++) {
if ((sum - ar[i]) % 2 == 0) count++;
}
printf("%d", count);
}
| 1 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
const ll mod = 1000000007;
int main() {
cin.sync... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 200;
const int inf = 0x3f3f3f3f;
const double eps = 1e-7;
const double pi = acos(-1.0);
const int mod = 1e9 + 7;
inline int lowbit(int x) { return x & (-x); }
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void ex_gcd(long l... | 3 |
#include <bits/stdc++.h>
using namespace std;
int N, M, A, Q;
int paq;
int phi(int A, int Q) {
int aa = 1;
for (int i = 1;; ++i) {
aa = 1LL * aa * A % Q;
if (aa == 1) return i;
}
}
int pow(int a, int b, int m) {
if (b == 0) return 1;
int ans = pow(a, b / 2, m);
ans = (1LL * ans * ans) % m;
if (b %... | 6 |
#include <bits/stdc++.h>
template <class T>
inline T read(const T sample) {
T x = 0;
int f = 1;
char s;
while ((s = getchar()) > '9' || s < '0')
if (s == '-') f = -1;
while (s >= '0' && s <= '9')
x = (x << 1) + (x << 3) + (s ^ 48), s = getchar();
return x * f;
}
template <class T>
inline void write(... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k, i, j, a, x;
cin >> n >> k;
x = n * (n - 1) / 2;
if (x < n * k)
cout << "-1"
<< "\n";
else {
cout << n * k << "\n";
for (int i = 1; i <= n; i++) {
a = i;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n[9];
for(int i=0;i<9;i++)cin>>n[i];
int a;cin>>a;
bool p[9]={0,0,0,0,0,0,0,0,0};
for(int i=0;i<a;i++){
int d;cin>>d;
auto itr=find(n,n+9,d);
if(itr!=end(n))
p[d... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long f[62][2];
long long s, a;
long long dfs(int d, int up) {
if (d == 60 && up == 0) return 1;
if (f[d][up] != -1) return f[d][up];
long long &ans = f[d][up];
ans = 0;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
if (((i + j + up) & ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int f[N], g[N];
vector<int> pos[30];
int main() {
ios::sync_with_stdio(false), cin.tie(0);
string os, ot;
cin >> os >> ot;
string s = " " + os, t = " " + ot;
int n = s.size(), m = t.size();
for (int i = 1; i < m; ++i) pos[t[i] - 'a'].push_... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
using namespace chrono;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << "\n";
}
template <typename Arg1, typename.... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int c[105], r[105];
char s[105][105];
memset(c, 0, sizeof(c));
memset(r, 0, sizeof(r));
int fr = 0, fc = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> s[i][j];
if (s[i][j] == 'E') {
... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=201000 ;
const ll mod=998244353LL;
int suff[N];
string s,t;
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b,k;
cin>>a>>b>>k;
int at=0;
s.push_back('1');
t.push_back('1');
b--;
if(k!=0)
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, l, r;
cin >> t;
while (t--) {
cin >> n >> l >> r;
if (l > n) {
cout << "No" << endl;
continue;
}
if (l <= n && r >= n) {
cout << "Yes" << endl;
continue;
}
if (l == r) {
cout << ((n % l == 0)... | 2 |
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) { return a > b ? a : b; }
const int N = 100050;
const int M = 32 * N;
const int inf = 3e8;
int rmq[M], ls[M], rs[M], tsz, root;
void Set(int &c, int ss, int se, int qi, int val) {
if (!c) c = ++tsz, rmq[c] = -inf;
rmq[c] = max(rmq[c], val);
if (s... | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > E[123];
int f[123][123][30][2];
int dfs(int x, int y, int ch, int turn) {
if (f[x][y][ch][turn] != -1) return f[x][y][ch][turn];
if (turn == 0) {
for (auto p : E[x]) {
int u = p.first;
int tmp = p.second;
if (tmp >= ch) {
... | 4 |
#import<bits/stdc++.h>
using namespace std;
long N,n;
vector<long> A;
int main(){
for(cin>>N;cin>>n;)A.push_back(n);
auto a=A.begin(),t=a+1,d=A.end(),b=t+1;
partial_sum(a,d,a);
n=1LL<<50;
for(--d;t+1!=d;++t){
while(a+1!=t)
if(*a<*t-*(a+1))++a;
else break;
if... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n) - 1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
cons... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 512;
int a[MAX_N], b[MAX_N], last[2 * MAX_N], d[MAX_N][MAX_N];
pair<int, int> pr[MAX_N][MAX_N];
set<int> s;
map<int, int> ma;
vector<int> numbers;
int main() {
int n, m;
scanf("%d", &n);
for (int i = 0; (i) < (n); ++i) scanf("%d", &a[i]), s.insert(a[... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
size_t H, W;
cin >> H >> W;
vector<size_t> A(H);
vector<size_t> B(H);
for (size_t i = 0; i < H; i++)
{
cin >> A[i] >> B[i];
}
set<pair<size_t, size_t>> goal_start;
multiset<int> ans;
for (size_t i = 1; i <= W; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string s, t;
cin >> s;
sort(s.begin(), s.end());
t = s;
reverse(t.begin(), t.end());
if (s == t)
cout << "-1" << endl;
else
cout << s << endl;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
long long int a, b, i, val;
map<long long int, long long int> mp;
map<long long int, vector<long long int> > path;
std::vector<pair<long long int, long long int> > v;
... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long MOD = 1000000007;
long long a[300005];
long long sum[300005];
long long block[300005];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m, k;
cin >> n >> m >> k;
vector<long long> a(n);
f... | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[400004], b[400004], c[400004];
set<int> s;
set<pair<int, int>> p;
int main() {
ios_base::sync_with_stdio(0);
int n, k, i, ans, j, ii;
pair<int, int> d;
set<pair<int, int>>::iterator it;
cin >> n >> k;
for (i = 0; i < n; ++i) {
cin >> a[i];
c[a[i]] ... | 2 |
#include <bits/stdc++.h>
const long long int mod = 1e9 + 7;
const int maxn = 2e5 + 50;
using namespace std;
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int main() {
int ... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v[1000005];
int b[1000005], a[1000005], c[1000005];
int n, k;
int flag = 0;
double m = 2000000000;
int dfs(int i) {
if (b[i] == 0) {
return a[i] = dfs(v[i][0]) & dfs(v[i][1]);
}
if (b[i] == 1) {
return a[i] = dfs(v[i][0]) | dfs(v[i][1]);
}
if (... | 4 |
#include <bits/stdc++.h>
const int N = 405;
int n, m, f[N], delta[N];
bool mark[N], ok[N];
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n >> m;
for (int i = 0; i <= m * 2; ++i) f[i] = i;
for (int i = 0; i < n; ++i) {
int a... | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline bool setmin(T &a, T b) {
if (a > b) return a = b, 1;
return 0;
}
template <class T>
inline bool setmax(T &a, T b) {
if (a < b) return a = b, 1;
re... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000100;
const int INF = 1e9 + 10;
int N, K;
char ch[520][520];
int id[520][520], cnt[maxn], idn;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int in[maxn];
bool border[maxn];
vector<int> tb;
void dfs(int i, int j, int color) {
if (i < 1 || i > N... | 5 |
#include<bits/stdc++.h>
using namespace std;
int p[10]={0,2,5,5,4,5,6,3,7,6},a[10],n,m,f[10002],v[10];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&a[i]);
v[a[i]]=1;
}
memset(f,-1,sizeof(f));
f[0]=0;
for(int i=1;i<=m;i++)
for(int j=p[a[i]];j<=n;j++)
f[j]=max(f[j],f[j-p[a[i]]]+1)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[10000];
int i, l = 0;
cin >> a;
for (i = 0; i < 10000; i++) {
if (a[i] == NULL)
break;
else
l++;
}
for (i = 0; i < l; i++) {
a[2 * l - i - 1] = a[i];
}
for (i = 0; i < 2 * l; i++) {
cout << a[i];
}
return 0... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long long int> vec(n), ans(n);
for (int i = 0; n > i; i++) {
cin >> vec[i];
}
long long int maxi = vec[n - 1], sifir = 0;
ans[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
ans[i] = ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int col[N];
int used[N];
int qtd[N];
int res[N];
int main() {
int t;
cin >> t;
for (int cas = 0; cas < t; ++cas) {
int n, x, y;
cin >> n >> x >> y;
for (int i = 0; i <= n + 1; ++i) {
used[i] = 0;
qtd[i] = 0;
res[i] =... | 3 |
#include<bits/stdc++.h>
using namespace std;
int n,ret;
int sum(int m){
int r=0;while(m)r+=m%10,m/=10;return r;
}
int main(){
cin>>n;ret=sum(n-1)+1;
for(int i=1;i<n;i++)ret=min(ret,sum(i)+sum(n-i));
cout<<ret<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
long long mid[N], a[N], mark[N], k, f1[N][2], n, g[N], h[N], p, ct, cn,
tvn = 1, tedad[N * 4];
string s, s2;
long long saghf(long long x) { return (x / 2) + (x % 2); }
string binary(int m, int k) {
string g = "";
for (long long i = 0; i < k; i... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
int n;
int a[200005];
int b[200005];
bool vis[400005];
int prime[400005];
int k[400005];
int main() {
ios::sync_with_stdio(0);
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) cin >> a[i], sum ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, r, a;
cin >> n >> r >> a;
long long int x, y;
vector<pair<long long int, long long int>> g;
long long int sum = 0;
for (long long int i = 0; i < n; i++) {
cin >> x >> y;
sum += x;
g.push_back({y, x});
}
sort(g.begin(... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
const int M = 1e5 + 5;
const int mod = 1e9 + 7;
const double pi = 2 * acos(0);
int m, d;
string s;
int dp[N][N][2];
int add(int a, int b) { return (a + b) % mod; }
int solve(int idx, int md, bool flag) {
if (idx == (int)s.size()) return !md;
int &... | 4 |
#include <bits/stdc++.h>
using namespace std;
int tree[5000000];
int read(int idx) {
int sum = 0;
while (idx > 0) {
sum += tree[idx];
idx -= (idx & -idx);
}
return sum;
}
void update(int idx, int val) {
while (idx <= 1024 * 1025) {
tree[idx] += val;
idx += (idx & -idx);
}
}
int findG(int cum... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n;
map<string, long long> m1, m2;
string pr[111], ans = "";
vector<string> ask(long long l, long long r) {
cout << "? " << l << " " << r << endl;
vector<string> cur;
for (long long i = 1; i <= (r - l + 1) * (r - l + 2) / 2; i... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n = 0;
int A[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
B[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
for (int i = 0; i < 4; i++) {
A[i] = a % 10;
a /= 10;
n = max(n, A[i]);
}
for (int i = 0; i < 4; i++) {
B... | 2 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fr first
#define sc second
typedef long long ll;
const long long llinf=LLONG_MAX;
const int inf=INT_MAX;
const int nmax=1e5+5;
const int mod=1e9+7;
using namespace std;... | 0 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double pi = acos(-1.0);
int dblcmp(double d) {
if (fabs(d) < eps) return 0;
return d > eps ? 1 : -1;
}
int n, d;
long long a[111111];
long long parse(char *s) {
int q, w, e, r;
sscanf(s, "%d.%d.%d.%d", &q, &w, &e, &r);
return ((q * (... | 3 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
int n, m, pos = 0, maxi = 0, i, j, l1, l2, ans = 0;
string second, t;
cin >> n >> m;
cin >> second >> t;
l1 = second.size(), l2 = t.size();
for (i = 0; i <= l2 - l1; i++) {
int count = 0;
for... | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int T, N, Q, s;
vector<int> A;
set<ll> S;
void calc(int i, int j)
{
int m = INT_MAX, M = INT_MIN; ll sm = 0;
for (int k = i; k < j; k++) m = min(m, A[k]), M = max(M, A[k]), sm += A[k];
... | 4 |
#include <bits/stdc++.h>
using namespace std;
inline long long Min(long long x, long long y) { return x < y ? x : y; }
inline void read(long long &x) {
x = 0;
long long f = 1;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e3 + 10;
int mark[MAXN][MAXN];
int p[MAXN];
int maxx[MAXN];
int n, k, ans;
int main() {
cin >> n >> k;
k++;
if (n == 1) {
cout << 1 << endl;
return 0;
}
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = n - 1; i >= 0; i--) maxx[i] =... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
struct Matrix {
int n;
long long a[50][50];
Matrix() { memset(a, 0, sizeof(a)); }
};
Matrix operator*(Matrix A, Matrix B) {
Matrix C;
int m = C.n = A.n;
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
for (int k = 0;... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,i = 1,ii = 0;
cin >> a;
while(cin >> a){
if(a % 2 == 1 and i % 2 == 1){
ii++;
}
i++;
}
cout << ii;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool prime[3001];
memset(prime, true, sizeof(prime));
for (int i = 2; i * i < 3001; i++) {
if (prime[i]) {
for (int j = i * i; j < 3001; j += i) {
prime[j] = false;
}
}
}
set<int> prim;
for (int i = 2; i < 3001; i++) {
... | 1 |
#include <bits/stdc++.h>
int main() {
int sum1 = 0, sum2 = 0, a, b, n, i;
for (i = 1; i <= 3; i++) {
scanf("%d", &a);
sum1 += a;
}
for (i = 1; i <= 3; i++) {
scanf("%d", &b);
sum2 += b;
}
scanf("%d", &n);
int x, y;
if (sum1 % 5 == 0) {
x = sum1 / 5;
} else {
x = (sum1 / 5) + 1;... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const long long oo = 1 << 30;
const lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, a[55], p;
double f[55][55], g[55];
void run() {
double ans = 0;
for (int i = 1; i <= n; i++) g[i] = 1. / i;
for (int i = 1; i <= n; i++)
if (a[i] <= p) {
memset(f, 0, sizeof(f));
f[0][0] = 1. / n;
int m = p - a[i];
int c = 0;
f... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
cout<<max(0,60*(h2-h1)+m2-m1-k);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int N, r[100010], h[100010];
long long int V[100010], X[100010];
std::map<long long int, int> compress;
long long int BIT[1000010];
void update(int index, long long int val) {
while (index <= 1000000) {
BIT[index] = max<long long int>(BIT[index], val);
index += (i... | 4 |
#include <bits/stdc++.h>
const double EPS = 1e-24;
const long long int MOD = 1000000007ll;
const double PI = 3.14159265359;
int INF = 2147483645;
template <class T>
T Max2(T a, T b) {
return a < b ? b : a;
}
template <class T>
T Min2(T a, T b) {
return a < b ? a : b;
}
template <class T>
T Max3(T a, T b, T c) {
r... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1100, mod = 1e9 + 7;
int x[N];
long double y[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, r;
cin >> n >> r;
for (int i = 0; i < n; i++) cin >> x[i];
cout << fixed << setprecision(10);
for (int i = 0; i < n; i++) {
if (i =... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
int a[maxn];
int dp[maxn][maxn];
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); }
int main() {
int n;
scanf("%d", &n);
int ans = 0;
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < n; i++)
if (a[i] == 1) an... | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
ll res = 0, sum = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x)
sum++;
... | 1 |
#include <bits/stdc++.h>
int main() {
int n, x;
int a[100000];
int m, h, k;
long long v;
std::ios::sync_with_stdio(false);
std::scanf("%d%d", &n, &x);
for (int i(0); i < n; ++i) std::scanf("%d", a + i);
m = *std::min_element(a, a + n);
h = (x - 1) % n;
while (a[h] != m) h = (n + h - 1) % n;
x %= n... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
int a[n];
int t = 0;
double lim = 4.5 * n;
for (int i = 0; i < n; i++) {
cin >> a[i];
t += a[i];
}
sort(a, a + n);
int cnt = 0;
while (t < lim) {
t -= a[cnt++];
t += 5;
}... | 2 |
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, i, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
a[j]++;
}
int numbox = 0, piles = 0, flag;
while (1) {
numbox = 0;
flag = 0;
for (i = 0; i <= 100; i++) {
if (a[i] > 0 && numbox <= i) {
flag = ... | 3 |
/*
AOJ 1131.cpp
Time-stamp: <2012-11-27 23:48:45 nagana>
*/
#include <iostream>
#include <algorithm>
using namespace std;
int p,q,a;
// n:分割数 nowd:現在の分母 prod:今までの分母 total:今までの分子
int search(int n, int nowd, int prod, int total){
int count = 0;
for(int i = nowd; a >= prod * i; i++){
// 通分して分子だけ見る
i... | 0 |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int a,b;
cin >> b >> a;
cout << (int)(a*pow(a-1,b-1));
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, N = 2e6 + 5, MOD = 1e9 + 7;
vector<pair<int, int> > h[N];
struct Edge {
int u, v, w, id;
} e[N];
long long dis[N];
int dis2[N], vis[N], n;
struct node {
int x;
long long d;
node() {}
node(int a, long long b) : x(a), d(b) {}
friend int... | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.