solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const long long INF64 = 1e18;
clock_t time_p = clock();
void time() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
void doc() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void fast() {... | 2 |
#include <bits/stdc++.h>
using namespace std;
using i128 = long long;
const int MN = 103, MA = 1e4 + 3;
i128 all[MN][MA], freq[MN], ree[MN][MA];
int main() {
int n, sum = 0, dis = 0;
scanf("%d", &n);
all[0][0] = 1;
for (int i = 1; i <= 100; i++) ree[i][0] = 1;
for (int i = 1; i <= n; i++) {
int a;
sca... | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define ALL( a ) (a).begin(), (a).end()
int main(void){
while( 1 ){
string g; cin >> g;
if( g == "#") break;
int y, m, d;... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000;
const int MAX_P = 6;
const int MAX_E = 500000;
struct GCDSolver {
int v[1 + MAX_N];
bool exista[1 + MAX_N];
vector<int> primes[1 + MAX_E];
int popcnt[1 << MAX_P], lsb[1 << MAX_P], prod[1 << MAX_P], fr[MAX_E];
int size;
long long goodpai... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a;
if (i * a % 2) ans++;
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
char ch[N];
int n;
long long m, k;
int a[N];
int main() {
int T;
cin >> T;
while (T--) {
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int flag = 0;
for (int i = 1; i < n; i++) {
if (a[i + 1] > a[i] + ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, s = 0;
cin >> n >> m;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
for (int i = 0; i < m; i++) {
if (ar[i] < 0) {
s += ar[i];
}
}
cout << abs(s) << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, d;
vector<int> v;
cin >> n >> d;
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int last_day;
for (last_day = 1; last_day < n && d >= last_day * v[last_day];
l... | 1 |
#if 0
time: 50min
using priority_queue(reverse) to save time.
#endif
#include <iostream>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
const int Inf = 10000*100000+100;
int a,b,V,E,R,S,Start[500000+10],To[500000+10],Dis[500000+10],N[500000+10];
int Ans[100000+10];
priority_queue<pai... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, a[200010];
struct fenwick {
vector<int> F;
int N;
void init(int n) {
N = n;
F.clear();
F.resize(N + 1);
}
void add(int k, int v) {
if (k == 0) return;
while (k <= N) {
F[k] += v;
k += k & -k;
}
}
int sum(int k) {
... | 5 |
#include <bits/stdc++.h>
bool debug = true;
using namespace std;
long long pow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1) {
res *= a;
}
a *= a;
n >>= 1;
}
return res;
}
int main(void) {
if (0) {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w",... | 4 |
#include <bits/stdc++.h>
int a[1000];
char c[1000];
int main() {
int n, i;
scanf("%d\n", &n);
for (i = (0); i < (n - 1); i++) c[i] = getchar();
a[0] = 1;
for (i = (0); i <= (n - 2); i++) {
if (c[i] == 'R')
a[i + 1] = a[i] + 1;
else if (c[i] == '=')
a[i + 1] = a[i];
else
a[i + 1] ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
string str;
cin >> str;
int arr[26] = {0};
for (int i = 0; i < n; i++) {
arr[str[i] - 'a']++;
if (arr[str[i] - 'a'] > m) {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
clock_t begin_time = clock();
int t;
cin >> t;
for (int tcase = 0; tcase < t; ++tcase) {
int b, p, f, h, c;
cin >> b >> p >> f >> h >> c;
int mh, mc;
int tot = min(p + f, b / 2);
int ans = 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
vector<int> b(N);
vector<int> c(0);
for (int i=0; i<N; i++)
cin >>b.at(i);
while (b.size()>0) {
int i;
for (i=b.size()-1; i>=0; i--) {
if (i+1==b.at(i)) {
b.erase(b.begin()+i);
c.push_back(i+1);
break;
}
}
if (... | 0 |
#include<iostream>
#include<vector>
#include<cstdio>
#include<utility>
#include<cmath>
using namespace std;
int main(){
int n, k=1;
vector< pair<int,int> > points;
while( cin >> n, n ){
points.clear();
for( int i=0; i<n; i++ ){
int x, y;
cin >> x >> y;
po... | 0 |
#include<bits/stdc++.h>
#define low(x) (x&(-x))
using namespace std;
typedef unsigned long long ll;
const int N=2005;
struct bit{
ll z[32];
void flip(int x){
z[x>>6]^=1ull<<(x&63);
}
bool getv(int x){
return z[x>>6]&(1ull<<(x&63));
}
}f[N][N],v,h[N],g[N];
void operator^=(bit &a,bit b){
for (int i=0;i<32;i++)a... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline long long Min(long long x, long long y) {
if (x < y) return x;
return y;
}
inline long long Max(long long x, long long y) {
if (x > y) return x;
return y;
}
inline void read(long long &x) {
x = 0;
long long f = 1;
char s = getchar();
while (s < '0' ||... | 4 |
#include <cstdio>
int main()
{
const int MAX = 7368791;
static bool flags[MAX + 1];
int m, n;
while (true)
{
scanf("%d %d", &m, &n);
if (m == 0 && n == 0)
{
break;
}
for (int i = 1; i <= MAX; ++i)
{
flags[i] = false;
}
for (int i = m, count = 0; count < n; ++i)
{
if (flags[i])
{... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000000;
int countDiff[MAXN * 3];
int nums[MAXN];
int nNums;
int shifts;
long long minDiff;
long long diffs[MAXN];
int countNegative;
void handleShift(int n) {
int ind = nNums - n;
int former = nums[ind] - nNums;
int latter = nums[ind];
countDiff[nu... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 99;
int n, m, q, u, v, deg[N], degin[N];
long long ans;
vector<int> g[N];
void change(int u, int v) {
ans -= 1ll * int(g[u].size()) * (deg[u] - int(g[u].size()));
g[u].push_back(v);
ans += 1ll * int(g[u].size()) * (deg[u] - int(g[u].size()));
}
int... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long int powe(long long int n, long long int m) {
if (m == 0) return 1;
long long int t = powe(n, m / 2);
if (m % 2 == 0) return (t * t);
return (((t * t)) * n);
}
long long int mpowe(long long int n, long long int m) {
if (m == 0) return 1;
long long int t... | 1 |
#include <bits/stdc++.h>
using namespace std;
string s;
bool simulate(int big) {
int i = 0, j = 0;
int arr[26];
bool check[26];
memset(arr, 0, sizeof(arr));
memset(check, false, sizeof(check));
for (j = 0; j < big && j < s.length(); ++j) {
arr[s[j] - 'a']++;
check[s[j] - 'a'] = true;
}
while (j ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j, count = 0;
cin >> n >> k;
char s[n];
char let[27] = "abcdefghijklmnopqrstuvwxyz";
for (i = 0; i < n; i++) cin >> s[i];
for (i = 0; i < 27; i++) {
for (j = 0; j < n; j++) {
if (s[j] == let[i]) {
s[j] = 0;
cou... | 3 |
#include <bits/stdc++.h>
using namespace std;
struct Lem {
int m, v, id;
bool operator<(Lem b) const { return m < b.m || (m == b.m && v < b.v); }
};
int n, k, h;
Lem a[(100000 + 10)];
bool can(double t) {
int j = k;
for (int i(n - 1), _l(0); i >= _l; --i) {
if (j > 0 && (double)j * h / a[i].v - t <= -1e-7) ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const int maxm = 45;
const int N = 40;
vector<pair<int, int> > rec[maxn];
int GCD[maxm][maxm];
int val[maxm], lasl[maxm];
int n, m, cnt[maxn];
int main() {
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
for (int k = 1; k <= N;... | 6 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long ans = 0;
long long n;
cin >> n;
for (long long i = 1; i <= 200; i *= 2) {
vector<long long> a1, a2;
for (long long j = 1; j... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, u;
long long max_up = 0;
long long max_down = 1;
cin >> n >> u;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n - 2; i++) {
int j = i + 1;
int k = upper_bound(arr.begin(), arr.end(), u ... | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
ll modpow(ll a, ll b, ll mod = (ll)(1e9 + 7)) {
if (!b) return 1;
a %= mod;
return modpow(a * a % mod, b / 2, mod) *... | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}
const ll MODBASE = 1000000007LL;... | 4 |
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
using namespace std;
int main(){
int n,a,b,c,d,e,f,g,h,x,y,z,w;
while(1){
cin >> n ;
if(n==0){
return 0;
}
for(int t=0;t<n;t++){
cin >>a>>b>>c>>d>>e>>f>>g>>h;
x=a*e-b*f-c*g-d*h;
y=a*f+... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main(){
ios_base :: sync_with_stdio(false);
cin.tie(0);
int a, b, k;
cin >> a >> b >> k;
if(b == 1 && k != 0){
cout << "No\n";
return 0;
}
if(b == 1){
cout << "Yes\n";
string s = "1";
for(int i = 0 ; i < a ; i ++) s +=... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 85;
int n, V, now;
int sl[N], sr[N], lens[N], h[N * 2];
double ans[N][N];
void add(int x, int l, int r, double y) {
ans[x][l] += y;
ans[x][r + 1] -= y;
}
void trans(int x, int c, double F[N][N]) {
double g0 =
sr[x] > now + 1 ? 1.0 * (h[sr[x]] - h[m... | 5 |
#include <bits/stdc++.h>
using weight_t = int;
using capacity_t = int;
constexpr capacity_t inf = std::numeric_limits<capacity_t>::max() / 2;
struct edge {
int to;
weight_t w;
};
using edges = std::vector<edge>;
using graph = std::vector<edges>;
class gomory_hu {
public:
gomory_hu(int n) : built(false), cap(n, s... | 5 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int i, j, n, s, x, count;
vector<int> data;
while(1){
cin >> n >> s;
if(n == 0 && s == 0) break;
for(i=0; i<n; ++i){
cin >> x;
data.push_back(x);
}
sort(data.begin(), d... | 0 |
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define LL long long
int n;
LL m;
LL a[200000];
bool ok(int x){
FOR(i,x,n){
if(a[x+i]+a[2*n-1-(i-x)]<m)return false;
}
return true;
}
int main(){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool vowel(char c) {
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') return 1;
return 0;
}
int main() {
string s;
cin >> s;
for (int i = 1; i < s.length(); i++) {
if (!vowel(s[i]) && !vowel(s[i - 1]) && s[i - 1] != 'n') {
cout << "NO";
... | 1 |
#include <bits/stdc++.h>
const int inf = 1e9;
using namespace std;
const int maxn = 1e5 + 7;
int a[maxn] = {0};
char b[maxn];
int main() {
int n, r = inf, l = -inf;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
scanf("%s", b);
for (int i = 4; i < n; i++) {
if (b[i - 1] != b[i]) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 2e18;
const long long N = 1e5 + 1;
const long long mod = 1e9 + 7;
const long double ueps = 1E-7;
int mn, mx;
int n, a[N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
mn++;
cin >> a[i];
if (mn > ... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long int gcd(long long int a, long long int b) {
return b == 0 ? a : gcd(b, a % b);
}
long long... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, a[4][4];
long long f[4][4], dp[41][4][4];
int main() {
for (int i = 1; i <= 3; i++)
for (int j = 1; j <= 3; j++) scanf("%d", &a[i][j]), f[i][j] = a[i][j];
for (int i = 1; i <= 3; i++)
for (int j = 1; j <= 3; j++)
for (int k = 1; k <= 3; k++) f[i][j]... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MaxMask = (1 << 7);
const int N = 40 + 5;
const int INF = 1e8 + 10;
int dp[N][MaxMask][MaxMask], n, m;
int main(int argc, const char* argv[]) {
for (int i = 0; i < N; i++)
for (int j = 0; j < MaxMask; j++)
for (int k = 0; k < MaxMask; k++) dp[i][j][k] ... | 3 |
#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
void fmain() {
scanf("%d", &n);
int la = -1;
for (int(i) = 0; (i) < (int)(n); (i)++) {
scanf("%d", &k);
while (k % 2 == 0) k /= 2;
while (k % 3 == 0) k /= ... | 1 |
#include <bits/stdc++.h>
using namespace std;
char s1[3];
set<int> s;
set<int> st;
int f[100100];
int used[100100];
int jud[100100];
int cnt;
int main() {
int n, m, i, j, k, l, flag;
scanf("%d%d", &n, &m);
memset(used, 0, sizeof(used));
cnt = 0;
flag = 0;
for (i = 1; i <= n; i++) f[i] = 1;
for (i = 1; i <... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
int chkmax(T& a, T b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
template <class T>
int chkmin(T& a, T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class iterator>
void output(iterator begin, iterator end, ostr... | 4 |
#include <bits/stdc++.h>
using namespace std;
int H, W;
uint8_t d[2][190][190][190], pos[190][190][190], down[190][190];
char A[190][190];
int main() {
scanf("%d%d", &H, &W);
for (int i = 1; i <= H; ++i)
scanf("%s", A[i] + 1);
for (int i = H; i; --i)
for (int j = 1; j <= W; ++j)
if (i < H && A[i + 1][j] == ... | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int MAXN = 305;
int graph[MAXN][MAXN];
int n, m;
struct mat {
int a[MAXN][MAXN];
mat() {
for (int i = 1; i <= 300; i++)
for (int j = 1; j <= 300; j++) a[i][j] = -(int)1e9;
for (int i ... | 2 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long lo... | 0 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define maxn 100005
using namespace std;
int n;
int main()
{
int ans=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int x,k;
scanf("%d%d",&x,&k);
while(x%k)
{
x-=(x/k+1)*((x%k-1)/(x/k+1)+1);
}
ans^=(x/k);
}
if(ans)
printf("Ta... | 0 |
#include <iostream>
using namespace std;
long long X,Y;
int main(){
cin >> X >> Y;
if((X+Y>1 && abs(X-Y)<=1) || (X==0 && Y==0)) cout << "Brown" << endl;
else cout << "Alice" << endl;
} | 0 |
#define _USE_MATH_DEFINES
#define INF 10000000
#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>
#include <list>
using namespace std;
typ... | 0 |
#include <bits/stdc++.h>
int main() {
int a, b, i, j, count, n;
scanf("%d %d", &a, &b);
for (i = a, count = 0; i <= b; i++) {
for (n = i; n != 0;) {
j = n % 10;
if (j == 0 || j == 6 || j == 9) {
count = count + 6;
} else if (j == 1) {
count = count + 2;
} else if (j == ... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int main() {
char s[1000006];
scanf("%s", &s);
int l = strlen(s);
long long ans = 0;
long long sumb = 0;
for (int i = l - 1; i >= 0; i--) {
if (s[i] == 'b') sumb++;
sumb %= mod;
if (s[i] == 'a') {
ans = (ans + sumb) % m... | 4 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
class writeInfo{
public:
int from;
int to;
int discripter;
};
int main(){
int N;
bool fst=false;
while(cin>>N&&N!=0){
vector<writeInfo> info;
for(int i = 0; i < N; i++){
char order;
cin>>order;
if(orde... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n,m,a[1000];
cin>>n>>m;
for(int i=0;i<n;i++)cin>>a[i];
bool used[1000]={};
int p=0,ans=0;
while(!used[p]){
int mx=-1,mn=1e9,i=0;
while(i<m){
mn=min(a[(p+i)%n],mn);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf(" %d", &n);
vector<pair<int, int> > ans;
for (int i = 2; i <= n; ++i) {
ans.push_back({i, i - 1});
int val = i - 3;
if (val > 0) ans.push_back({val, i});
val -= 2;
while (val > 0) {
ans.push_back({val, i});
v... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int p1 = 233, p2 = 433;
long long a[2020][3], b[2020][3];
int nxt[2020];
char aa[2020][2020], bb[2020][2020];
long long hs[2020][3], hs2[2020][3];
map<pair<long long, long long>, int> vis;
int main() {
int ans, n, m, i, j, k;
long long sum1, sum2, tmp1, tmp2;
sc... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
string s;
int ret;
void solve() {
int first, na, nb;
cin >> n >> k >> s;
first = 0;
na = 0;
nb = 0;
ret = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'a')
na++;
else
nb++;
if (min(na, nb) > k) {
if (s[first] == '... | 3 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int n; cin >> n;
int t = 0, h = 0;
for (int i = 0; i < n; i++){
string a, b; cin >> a >> b;
if (a == b){
t++;
h++;
}
else if (a > b){
t += 3;
}
else if (a < b) {
h += 3;
}
}
cout << t << ' ' << h << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, *p;
cin >> n;
p = new int[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
int esum = 0, osum = 0;
for (int i = 0; i < n; i += 2) {
esum += p[i];
osum += p[i + 1];
}
cout << abs(esum - osum);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int a,cnt,i;
int main(){
while(i++<3){
char s;cin>>s;
if(s=='R')a=++cnt;
else cnt=0;
}
cout<<a<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main(){
int n;cin>>n;
cin>>s;
if (n%2==1 || s.substr(0,n/2)!=s.substr(n/2,n/2)) cout<<"No";
else cout<<"Yes";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
pair<int, int> ans[100100];
int f[100100][2], cnt[100100];
char s[100100];
int n, m;
int main() {
scanf("%d\n", &n);
scanf("%s\n", &s);
scanf("%d\n", &m);
for (int i = 1; i <= n; i++) {
cnt[i] = cnt[i - 1] + (s[i - 1] == '?');
if (s[i - 1] != 'a') f[i][1] = ... | 5 |
#include <bits/stdc++.h>
#define rep2D(l, r, n) \
for (int __repeat_gap = 0; __repeat_gap < n; ++__repeat_gap) \
for (l = 1, r = l + __repeat_gap; r <= n; ++l, ++r)
#define per2D(l, r, n) \
for (int __repeat_gap = n - 1; __repeat_gap > 0; --__repeat_gap) \
for (l = 1, r = l + __repeat_gap; r <= n; ++l, ++r)
type... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 404040;
int cnt, cnt2, cnt3, h, n, m;
struct Node {
int x, y, w, d, i;
} a[N];
bool cmp(Node x, Node y) { return x.d < y.d; }
vector<int> s[N];
vector<pair<int, int> > ss[N];
int dfn[N], low[N], viss[N], q[N], color[N], as[N];
map<int, int> sum, vis;
void ji... | 4 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll b[2010],a[2010];
int main()
{
ll i,j,k,m,n,x;
ll cnt,ans=1ll * 2010 * 1e9;
memset(a,0x3f,sizeof(a));
cin>>n>>x;
for(i=0; i<n; i++)
cin>>b[i];
for(i=0; i<n; i++)
{
cnt=0;
for(j=0; j<n; j++)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename Tp>
inline void read(Tp &x) {
static char c;
static bool neg;
x = 0, c = getchar(), neg = false;
for (; !isdigit(c); c = getchar()) {
if (c == '-') {
neg = true;
}
}
for (; isdigit(c); c = getchar()) {
x = x * 10 + c - '0';
... | 4 |
#include <bits/stdc++.h>
using namespace std;
string s;
int m, a[400004];
long long pw[200002];
int main() {
cin >> s >> m;
int n = s.size();
for (int i = 0; i < n; i++) {
a[i] = s[i] - '0';
a[i + n] = a[i];
}
pw[0] = 1;
for (int i = 1; i < n; i++) {
pw[i] = (pw[i - 1] * 10) % m;
}
long long... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
if (n == 1) {
cout << "1 1\n";
cout << -a[0] << "\n1 1\n0\n1 1\n0\n";
return 0;
}
cout << "1 1\n" << -a[0] << "\n";
cout << "2 " << n << "\n";
for (i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int be[1000001], en[1000001], nu[1000001];
int main() {
int n, i, a, l = 0, r = 0, o = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a;
if (be[a] == 0) {
be[a] = i;
en[a] = i;
nu[a] = 1;
} else {
en[a] = i;
nu[a]++;
}
}... | 2 |
/*
直接想贪心
序列是从祖先到子树里扩展的
把一个点弄开后，肯定先把所有的 0 给弄进序列里
这启发我们将点合在一起，即选择了父亲一定再选儿子
考虑两端序列那个放在前面更优
发现结果是只要让 cnt_1 / cnt_0 尽量小就行
*/
#include <bits/stdc++.h>
#define N 200005
using namespace std;
int n;
int fa[N], x[N], y[N]; // x : cnt_1, y : cnt_0
int val[N], o;
namespace UFS {
int fa[N];
inline void init() { for(int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repn(i, n) for(int i = 1; i <= n; ++i)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
const int inf = 1e9;
int n, m, tt;
vi v;
char c;
const int mod = (int)1e9 +... | 5 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,f[100][10],p[100][11],ans=-1e9;
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<10;j++)
cin>>f[i][j];
for(int i=0;i<n;i++)
for(int j=0;j<11;j++)
cin>>p[i][j];
for(int i=1;i<(1<<10);i++){
int prof=0;
for(int j=0;j<... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef struct mytype {
long long int a, b;
} mytype;
bool myfn(const mytype &X, const mytype &Y) { return X.b * Y.a <= X.a * Y.b; }
int main() {
long double n, p;
cin >> n >> p;
vector<mytype> A(n);
long double aa = 0;
for (int i = 0; i < n; i++) {
cin >> A... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
char ss[maxn][maxn];
int ans[maxn][maxn];
int vis[maxn][maxn];
char mm[maxn][maxn];
int dir[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
int n, m;
struct node {
int x;
int y;
};
void paint(int x, int y, int d) {
if (d == 0) {
mm[x][y] = '^';
mm[x... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s[1000], s1, s2;
int cnt1[26] =
{
0,
},
cnt2[26] =
{
0,
},
objectCnt = 1;
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
vector<string> obj;
str... | 1 |
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
int main()
{
int n, q;
scanf("%d %d", &n, &q);
vector<queue<int> > vec(n);
int flag, t, x;
for (int i = 0; i < q; i++)
{
scanf("%d", &flag);
switch (flag) {
case 0:
... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int m = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
long long int n, l, k;
cin >> n >> l >> k;
vector<vector<long long int> > dp(n + 1, vector<long long int>(k + 1));
vector<long long int> a(n + 1);
vector<long long int> pos(n + 1);
vecto... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> res(n);
for (auto &v : res) cin >> v;
int sum = 0, mini = INT_MAX, index = -1, i;
for (i = 0; i < n; i++) {
if (i < k) {
sum += res[i];
continue;
} else {
if (mini > sum) {
mini ... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool prime(long long int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
long long int power(l... | 4 |
#include<bits/stdc++.h>
using namespace std;
string s;
int n,sum=0,maxn=0;
int main(){
cin>>n>>s;
for(int i=0;i<n;i++){
if(s[i]=='D') sum--;
else sum++;
maxn=max(maxn,sum);
}
cout<<maxn<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, k;
vector<pair<long long, string>> answer;
cin >> n >> m >> k;
long long r = 4 * n * m - 2 * (n + m);
if (k > r) {
cout << "NO";
return 0;
}
long long x = 1, y = 1;
while (k > 0 && x <= n) {
if (x % 2) {
answer.... | 4 |
#include <bits/stdc++.h>
using namespace std;
char a[5][5];
int curlen;
int ans, factor;
bool pr[100000];
bool isPrime(int n) {
if (n == 2) return 1;
if (n % 2 == 0) return 0;
for (int i = 3; i * i <= n; i += 2)
if (n % i == 0) return 0;
return 1;
}
string get(int n) {
string ans = "";
while (n) {
a... | 5 |
#include <bits/stdc++.h>
using namespace std;
namespace Tzh {
const int maxn = 1010;
const long double eps = 1e-8;
long long n;
long double m, a[maxn], b[maxn], ans = -1;
bool pan(long double x) {
long double now = m + x, w = x;
for (int i = 1; i <= n; i++) {
long double tmp = now / a[i];
now -= tmp, w -= t... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long int ppow(long long int base,long long int exp)
{ long long int result=1;
while (exp != 0) {
result *= base;
--exp;
}
return result;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int t,a,b,c,x,y,g,modx,mod... | 2 |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <ctime>
#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i; i = edge[i].next)
#define v edge[i].to
#define mp(a, b) make_pair(a, b)
using namesp... | 0 |
#include<iostream>
using namespace std;
#define N 1000000
int main() {
int n;
cin>>n;
int a[N];
for(int i = 0; i < n; i++) cin>>a[i];
int i, j = 0;
for(i = 0; i < n-1; i++) {
if(a[i] <= a[n-1]) {
if(i != j) {
int temp = a[i];
a[i] = a[j];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int findd(string s1, string s2) {
long long h1 = 0, h2 = 0, x = 1;
int i, n = (int)s1.size(), m = (int)s2.size();
if (n < m) return -1;
for (i = 0; i < m; i++) h2 = h2 * 33 + s2[i] - 'a' + 1;
for (i = 0; i < n; i++) {
if (i < m) {
h1 = h1 * 33 + s1[i] - ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
int ans[maxN], a[maxN];
vector<pair<int, int> > vc, que[maxN];
int fen[maxN];
void add(int p) {
for (p++; p < maxN; p += p & -p) fen[p]++;
return;
}
int get(int p) {
int res = 0;
for (; p > 0; p -= p & -p) res += fen[p];
return res;
}
in... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<long long int> v;
long long int n, i, m;
cin >> n;
m = n;
for (i = 2; i <= sqrt(n); i++) {
if (n % i == 0) v.push_back(i);
while (n % i == 0) n = n / i;
}
if (n != 1) v.push_back(... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
vector<int> adj[N], l[N];
int dist[N], n, m, k, ans[N], a[N], b[N], aa[N];
vector<vector<int> > vv;
void print(int lvl) {
if (lvl == 1) {
for (int i = 1; i <= m; i++) {
cout << ans[i];
}
cout << "\n";
--k;
if (!k) exit(0);
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
long long mod = 1e9 + 7;
void solve() {
int n;
string s;
cin >> n >> s;
string t = s;
sort(t.begin(), t.end());
int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != t[i]) ans++;
}
printf("%d\n", ans);
}
int main() {... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5 + 5;
const int inf = 1e9;
void solve() {
int n;
cin >> n;
string a, b;
cin >> a >> b;
int cnt1[26] = {};
int cnt2[26] = {};
for (int i = 0; i < n; i++) {
cnt1[a[i] - 'a']++;
cnt2[b[i] - 'a']++;
}
bool f = false;
for (int i = 0... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 105;
int dp[N][2];
int inline add(int x, int y) {
int temp = x + y;
while (temp >= MOD) temp = temp - MOD;
return temp;
}
int inline add(int x, int y, int z) {
int temp = x + add(y, z);
while (temp >= MOD) temp = temp - MO... | 3 |
#include<bits/stdc++.h>
using namespace std;
int n,m,sum,a[100];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+1+n);
for(int i=n;i>=n-m+1;i--){
sum+=a[i];
}
cout<<sum;
return 0;
} | 0 |
#include <bits/stdc++.h>
const int MAX_N = 1e5;
int n, q;
long long a[MAX_N + 3], b[MAX_N + 3];
long long pref[MAX_N + 3];
long long t[MAX_N + 3];
long long prefpref[MAX_N + 3];
struct Node {
long long sum, max, lazy;
Node() {
sum = 0;
max = -LLONG_MAX;
lazy = -LLONG_MAX;
}
};
const int base = 1 << 19... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 233;
const int T = 314000000;
vector<int> a[maxn], b[maxn], t[maxn];
bool cbe[maxn];
int vis[maxn];
int ru[maxn], num[maxn], val[maxn];
priority_queue<pair<long long, int> > q;
long long f[maxn], d[maxn], INF;
long long work(int x) {
long long sum =... | 3 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s[100001] ={};
int cnt =0,cnt2 = 1;
int k;
string a;
cin >> a>>k;
while(cnt2 <6)
{
for(int j=0;j<a.size();j++)
{
s[cnt] = a.substr(j,cnt2);
cnt++;
}
cnt2++;
}
sort(s,s+100000);
unique(s,s+100000);
cout << ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 7;
long long n, m, k, x, ans, cnt, a[N];
int f(long long x) { return (((x + 1) / 2) % 2) ^ (x % 2 ? 0 : x); }
int main() {
ios_base ::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x >> k;
ans ^= f(x - 1) ^ f(x + k... | 3 |
#include <iostream>
using namespace std;
int e[2][4];
int main()
{
double E[2];
while (cin >> E[0] >> E[1]){
for (int i = 0; i < 2; i++){
if (E[i] >= 1.1) e[i][0]++;
else if (E[i] >= 0.6) e[i][1]++;
else if (E[i] >= 0.2) e[i][2]++;
else e[i][3]++;
}
}
for (int i = 0; i < 4; i+... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.