solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <cstdio>
#include <algorithm>
#define M 86401
using namespace std;
int main(){
int i,n,v,tf,tt,h,m,s,l[M];
while(1){
scanf("%d",&n);
if(!n){break;}
fill(l,l+M,0);v=0;
for(i=0;i<n;i++){
scanf("%d:%d:%d",&h,&m,&s);
tf=h*3600+m*60+s;
sca... | 0 |
#include <bits/stdc++.h>
using namespace std;
void re(int& x);
template <class T, class... Ts>
void re(T& t, Ts&... ts);
void pr(int x);
void pr(const char* x);
void ps();
template <class T, class... Ts>
void ps(const T& t, const Ts&... ts);
int e, s, n, m;
int query[210000];
pair<int, int> sta[210000];
vector<pair<int... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e15;
const int N = 2e5 + 50;
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;
}
long long modinverse(long lon... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
const int N = 1e5 + 5;
const int INF = 1e18;
const int K = 320;
int n, a[N], cnt[K][N], q, l, r, ty;
deque<int> d[K];
void rebuild() {
for (int i = 0; i < n; i++) {
cnt[i / K][a[i]]++;
d[i / K].push_back(a[i]);
}
}
void upd(int l, int r) {... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long T;
struct edge {
int x1, y1, x2, y2;
edge(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
vector<edge> v;
void seal(int p, int x) {
switch (x) {
case 0:
v.push_back(edge(p - 1, p + 2, p, p + 2));
v.push_back(edge(p - 1,... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 * 1000 + 10;
int n, m, flag, tedad[2], ja[maxn][4], a, b, color[2][2];
bool rang[2][4];
char graph[maxn][maxn];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> graph[i][j];
}
for (int i = 0; i < n; ... | 5 |
#include <bits/stdc++.h>
const int maxn = 100010;
const int coor[4] = {1, 2, 0, -1};
long long P[maxn + 1][3];
long long lower[4], upper[4];
bool first[4];
int n;
long long X, Y, Z;
void init() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; ++i)
for (j = 0; j < 3; ++j) scanf("%I64d", &P[i][j]);
}
bool ky(lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a,l,x;
while(cin >> a >> l >> x) {
double b=sqrt(l*l-(a/2)*(a/2));
double c=(l+x)/2;
double d=sqrt(c*c-(l/2)*(l/2));
printf("%.10f\n",a*b/2+l*d);
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x, y, maxi = 0;
long long arr[1000], arr1[1000];
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
for (int i = 0; i < n; i++) cin >> arr1[i];
for (int i = 0; i < n; i++) {
x = arr[i];
y = arr1[i];
for (int j = i + 1; j <... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, p = 1, q = 1, r = 1, s = 2;
long long mx1 = 0, mx2 = 0;
long long arr[2010][2010];
unordered_map<long long, long long> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
... | 3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i,a,b) for(int i=a;i<=b;i++)
const int N=1e2+5;
LL n,g,p[N],c[N],a[N],ans;
int main()
{
cin>>n>>g;
rep(i,1,n)
{
cin>>p[i]>>c[i];
a[i]=i;
}
LL ans=1e18;
do
{
LL sum=0,tot=0;
rep(i,1,n)
{
int j=a[i];
if(sum+p[j]*j*100+c[... | 0 |
#include<stdio.h>
#include<assert.h>
#include<map>
#include<cmath>
#include<set>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
const int MX = 200005;
const int MM = 1000000007;
ll gcd(ll a, ll b){
return b ? gcd(b, a%b) : a;
}
l... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int n, m;
while(cin >> m >> n, m|n){
bool check[8000000] = {};
int cnt = 0, ans = 0;
for(int i=m; i<8000000; i++){
if( check[i] == false ){
if( cnt < n ){
cnt++;
for(int j = i; j<8e6; j+=i){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int n, m;
char s[maxn + 3], t[maxn + 3];
int cnt1[maxn + 3], cnt2[maxn + 3];
int lst1[maxn + 3], lst2[maxn + 3];
int main(void) {
scanf("%s%s", s + 1, t + 1);
n = strlen(s + 1);
m = strlen(t + 1);
for (int i = 1; i <= n; ++i) {
cnt1[i] = cn... | 4 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int m;
cin >> m;
while(m--) {
int A, y, n;
cin >> A;
cin >> y;
cin >> n;
int maxv = 0;
for(int t = 0; t < n; ++t) {
int mode, q;
double p;
cin >> mode >> p >> q;
int a = A;
int c = 0... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int in() {
int32_t x;
scanf("%d", &x);
return x;
}
inline long long lin() {
long long x;
scanf("%lld", &x);
return x;
}
inline string get() {
char ch[2000010];
scanf("%s", ch);
return ch;
}
inline void read(int *a, int n) {
for (int i = 0; i < n; ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int a[1001][1001];
int m, o1[100001], o2[100001], t[100001];
void f(int n) {
int c = -1;
if (n == 1) return;
for (int i = 1; i <= n; i++) {
bool b = 0;
for (int j = 1; j <= n; j++)
if (a[j][i]) {
b = 1;
break;
}
if (!b) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXK = 5000;
int n;
vector<int> cnt(MAXK + 1, 0);
vector<vector<int>> primeExponential(MAXK + 1, vector<int>(MAXK + 1, 0));
void Preprocess() {
for (int i = 2; i < MAXK + 1; i++) {
for (int j = 0; j < MAXK + 1; j++)
primeExponential[i][j] += primeExpon... | 4 |
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<com... | 0 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
std::cerr.tie(0);
int n, m;
while (std::cin >> n >> m) {
std::vector<int> f(1 + n), b(1 + m);
for (int i = 1; i <= n; ++i) {
std::cin >> f[i];
}
for (int i = 1; i <= m; ++i) ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int inf = 10000000;
long long arr[100005];
int main() {
int n, k;
cin >> n >> k;
int a, b, c, d;
for (int i = 0; i < (n); i++) {
scanf("%d.%d.%d.%d", &a, &b, &c, &d);
arr[i] += a;
arr[i] <<= 8;
arr[i] += b;
arr... | 3 |
#include <cstdio>
#include <iostream>
using namespace std;
int ab(int x){
return (x>0)?x:-x;
}
int main(){
int tt;
cin >> tt;
for(int times=0; times<tt; ++times){
int m,n;
cin >>m >>n;
int sqsum=m*m+n*n;
//printf("sqsum=%d\n", sqsum);
bool prime=true;
for(int i=-141; i<=141; ++i){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2000007;
const int mod = 1e9 + 7;
int n;
char s[N];
long long f[N][4], cnt = 1;
inline long long read() {
long long sum = 0, ff = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') ff = -1;
ch = getchar();
}
while (isdigit(ch)) sum... | 6 |
#include <bits/stdc++.h>
using namespace std;
int s[10] = {1, 3, 2, 6, 4, 5};
int main() {
long n, i;
cin >> n;
if (n < 3) {
cout << "-1" << endl;
} else if (n == 3) {
cout << "210" << endl;
} else {
int init = 20;
while (init <= 210) {
int x = init;
int y = 0;
i = 0;
w... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool check(double x1, double y1, double x2, double y2, double x3, double y3) {
double a = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
double b = (x1 - x3) * (x1 - x3) + (y1 - y3) * (y1 - y3);
double c = (x3 - x2) * (x3 - x2) + (y3 - y2) * (y3 - y2);
double aa = s... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, maxi = 0;
scanf("%d", &n);
string res;
for (int i = 0; i < n; ++i) {
string name;
int x, y, a, b, c, d, e;
cin >> name >> x >> y >> a >> b >> c >> d >> e;
int sum = x * 100 - y * 50 + a + b + c + d + e;
if (i == 0 || sum > max... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long q, m, n, i, j, dummy, a, b, x, y, t, x1, y1;
cin >> n >> m >> q;
vector<vector<long> > R(100, vector<long>(100, 0));
vector<vector<long> > C(100, vector<long>(100, 0));
vector<vector<long> > E(100, vector<long>(100, 0));
for (i = 0; i < n; i++)... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
const int mod = 1e9 + 7;
const char a[] = {'a', 'e', 'i', 'o', 'u'};
char s[maxn], t[maxn];
set<char> S;
bool check(char a, char b) {
bool fla = (S.find(a) == S.end());
bool flb = (S.find(b) == S.end());
return (fla ^ flb);
}
int main() {
s... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
const int N = 1e6 + 5;
int dsu[N];
int trace(int x) { return dsu[x] < 0 ? x : dsu[x] = trace(dsu[x]); }
void join(int x, int y) {
if ((x = trace(x)) == (y = trace(y))) return;
if (dsu[x] > dsu... | 3 |
#include <bits/stdc++.h>
using namespace std;
using li = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using matr = vector<vi>;
const int INF = 1e9 + 13;
vector<int> hungary(vector<vector<int>> a) {
int n = a.size() - 1;
int m = n;
vector<int> u(n + 1), v(m + 1), p(m + 1),... | 6 |
#include <bits/stdc++.h>
using namespace std;
void printNumber(int number) {
if (number < 10) cout << "0";
cout << number;
}
int main(void) {
ios_base::sync_with_stdio(0);
int h1, h2, m1, m2;
char bs;
cin >> h1 >> bs >> m1;
cin >> h2 >> bs >> m2;
int minutes1 = h1 * 60 + m1;
int minutes2 = h2 * 60 + m... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
deque<int> vec;
int arr[200005];
int n, a;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
vec.push_back(a);
arr[i] = 0;
}
for (int i = 0; i < n; i++) {
scanf("%d", &a);
int j = 0, i1 = 0;
if (arr[a - 1] == ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, others = 0, temp;
vector<char> c;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'a') {
a++;
temp = i;
} else {
others++;
c.push_back(s[i]);
}
}
int si = s.size();
if (a == si)... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<int> a, b;
int main() {
int n, m, c;
cin >> n >> m >> c;
a.resize(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
b.resize(m);
for (int i = 0; i < m; ++i) {
cin >> b[i];
}
for (int i = 1; i < m; ++i) {
b[i] = (b[i - 1] + b[i]) % c;
}
... | 4 |
#include<cstdio>
const int MAXN=20005,MAXV=30001;
int ans[MAXN];
bool used[MAXV];
int gcd(int a,int b)
{return b==0?a:gcd(b,a%b);}
int main()
{
int n,sum=0,i,j;
scanf("%d",&n);
for(i=1,j=1;j<n;i++)//添加n-1个2、3的倍数
if(i%2==0||i%3==0)
{
ans[j++]=i;
used[i]=true;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
constexpr int MAX_N = 2E3 + 5, MOD = 1E9 + 7;
int n, m;
string s[MAX_N];
int dp[MAX_N][MAX_N][2];
vector<int> row[MAX_N], col[MAX_N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> s[i];
if (n == 1) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
srand(time(0));
cout << fixed << setprecision(7);
cerr << fixed << setprecision(7);
int n, q;
scanf("%d%d", &n, &q);
static long long s[1 << 23];
for (int i = 1; i <= n; ++i)
scanf("%I64d", &s[i]), s[i + n] = s[i + n + n] = s[i];
for (in... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, i, a[2000005] = {0};
int main() {
cin >> n;
while (n--) {
cin >> i;
a[i] = i;
}
for (int j = 1; j < 2000005; j++)
if (a[j] == 0) a[j] = a[j - 1];
int sol = 0;
for (int j = 2; j < 2000005; j++)
if (a[j] == j)
for (i = j - 1; i < 20000... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> v(n);
for (auto &i : v) cin >> i;
vector<vector<pair<long long, long long>>> g(n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
-... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a[123], k, m = 0, sum = 0;
cin >> s >> k;
for (int i = 'a'; i <= 'z'; i++) {
cin >> a[i];
m = max(m, a[i]);
}
for (int i = 0; i < s.size(); i++) sum += (i + 1) * a[s[i]];
for (int i = s.size() + 1; i <= s.size() + k; i++) sum... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct solution_dag {
vector<vector<int> > v;
int path_12;
solution_dag() {
v = vector<vector<int> >(4);
v[0].push_back(2);
v[2].push_back(3);
v[3].push_back(1);
path_12 = 3;
}
void square(void) {
int A = v[0][0];
v[0].clear();
int ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> st;
bool player1 = false;
st.push('#');
for (int i = 0; i < s.size(); i++) {
if (st.top() == s[i]) {
player1 = !player1;
st.pop();
} else {
st.push(s[i]);
}
}
if (player1) {
cout ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
bool up = 0, lo = 0;
int ans = INT_MAX;
int n = s.size();
for (int i = 0; i < n; i++) {
if (isupper(s[i])) up = 1;
if (islower(s[i])) lo = 1;
}
if (up == 0 || l... | 3 |
#include <bits/stdc++.h>
using namespace std;
const string schools[] = {"Gryffindor", "Hufflepuff", "Ravenclaw", "Slytherin"};
map<char, int> id;
vector<vector<size_t> > generate(vector<size_t> dist, char c) {
if (c != '?') {
dist[id[c]]++;
return vector<vector<size_t> >(1, dist);
}
int minValue = *min_el... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long int power1[1000001], power2[1000001], lt, h1, h2, ans,
base = 127, mod1 = 1000000007, mod2 = 1000000009;
string t;
vector<long long int> hash1, hash2;
vector<pair<long long int, string> > v[1000001];
void dfs(long long int cur) {
for (long long int i = 0; i ... | 5 |
#include<bits/stdc++.h>
using namespace std;
using ll = long;
int main(){
ll ans = 0 ,last = 0;
for(ll i = 0; i < 5; i++){
ll a;
cin >> a;
ans += (a + 9) / 10 * 10;
last = max(last, (1000 - a) % 10);
}
cout << ans - last;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long how(int n) {
long long c = 0;
for (int i = 1; i <= n; i++) c += i;
return c;
}
int main() {
int n, mas[100000];
cin >> n;
for (int i = 0; i < n; i++) cin >> mas[i];
int temp = 0;
long long sum = n;
for (int i = 1; i < n; i++) {
if (mas[i] == ... | 2 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<map>
using namespace std;
int main(){
string G[8]={
"AAA",
"AA",
"A",
"B",
"C",
"D",
"E",
"NA",
};
double a,b;
while(cin>>a>>b){
int p=(int)(a*1000),q... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 100000;
int d[101][101];
int main() {
srand(clock());
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) cin >> s[i];
int m;
cin >> m;
vector<int> a(m);
for (int i = 0; i < m; i++... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100 + 10;
const int MAX_V = 200 + 10;
const int MAX_S = 1 << 7;
const int INF = 1000000;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
int N, M, K, S;
int w[MAX_N][MAX_N];
int f[MAX_N][MAX_N][MAX_S];
int pre[MAX_N][MAX_N][MAX_S];
int qx[M... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7FFFFFFF;
const int MOD = 1000000000 + 7;
const double EPS = 1e-10;
const double PI = 2 * acos(0.0);
const int maxn = 1000 + 66;
int cnt[maxn];
bool prime[maxn];
long long primelist[maxn], prime_len;
void GetPrime() {
memset(prime, true, sizeof(prime));
... | 3 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main()
{
cin>>a>>b;
if((a+b)%2==0)printf("%d\n",(a+b)/2);
else puts("IMPOSSIBLE");
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
inline long long getint() {
long long _x = 0, _tmp = 1;
char _tc = getchar();
while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
if (_tc == '-') _tc = getchar(), _tmp = -1;
while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();... | 4 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<utility>
#include<cmath>
#include<sstream>
using namespace std;
#define all(a) a.begin(),a.end()
typedef vector<int> vi;
int main()
{
double a,b,c,d;
const double r = 6378.1;
while(cin>>a>>b>>c>>d&&b>=0)
{
a*=2*M_... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int fact[11];
void fact0() {
fact[0] = fact[1] = 1;
for (int i = 2; i <= 11; i++) fact[i] = fact[i - 1] * i;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
fact0();
string s1, s2;
cin >> s1 >> s2;
long long int plus, min, que;
pl... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a;
long long solve();
long long calc(int u, int d, int lef);
int main() {
cin >> n;
a.resize(n);
for (auto& p : a) cin >> p;
cout << solve() << endl;
return 0;
}
long long solve() {
long long res = 0;
stack<long long> len, id... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct player {
int score;
int win[60];
void init() {
score = 0;
memset(win, 0, sizeof win);
}
};
map<string, player> m;
map<string, player>::iterator it, winner;
string winnername;
int a[60] = {0, 25, 18, 15, 12, 10, 8, 6, 4, 2, 1};
int T;
int n;
int main(i... | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t;
t = 1;
cin >> t;
while (t--) {
ll n;
cin >> n;
ll a[n];
ll mna = INT_MAX, mnb = INT_MAX;
for (ll i = 0; i < n; i++) cin >> a[i], mna = min(mna, ... | 2 |
#include<iostream>
using namespace std;
int main(){
char m;
string a,b,ans;
int i,j,c;
while(scanf(" %c ",&m)!=EOF){
cin >> a >> b;
ans.erase();
i = 0;
j = 0;
while(i<a.size() && j<b.size()){
if(a[i]==b[j]){
ans.push_back(a[i]);
i++;
j++;
}else{
c = 1;
if(a[i]=='('){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline long long int modadd(long long int n, long long int m,
long long int p = 1000000007) {
return ((n + m) % p + p) % p;
}
inline long long int modsub(long long int n, long long int m,
long long int p = 1000000007... | 1 |
#include <bits/stdc++.h>
using namespace std;
int read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
return f * s;
}
long long a, b, c, d;
int m... | 5 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double pi = acos(-1.0);
int dcmp(double x) {
if (fabs(x) <= eps) return 0;
return (x > 0) ? 1 : -1;
};
void file() { freopen("a.in", "r", stdin); }
namespace Solver {
int n, m, k;
const int maxn = 1100000;
int v[maxn];
int C[maxn];
int low... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[5111];
char flag[200000010];
int main() {
int i, j, kk;
int T;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
scanf("%d", &T);
while (T--) {
int x;
int ans = k + 1;
scanf("%d", &x);
memset(fla... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterat... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename TH>
void _dbg(const char* sdbg, TH h) {
cerr << sdbg << "=" << h << "\n";
}
template <typename TH, typename... TA>
void _dbg(const char* sdbg, TH h, TA... t) {
while (*sdbg != ',') cerr << *sdbg++;
cerr << "=" << h << ",";
_dbg(sdbg + 1, t...);
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int M = 998244353, G = 3, N = 1 << 20;
int Pw(int x, int y = M - 2) {
return y ? ((y & 1) ? (long long)Pw((long long)x * x % M, y / 2) * x % M
: Pw((long long)x * x % M, y / 2) % M)
: 1;
}
int rt[N], mg[N], fac[N], Lm = 1;
int rev[N]... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)9e18;
struct cmp {
bool operator()(const long long &i, const long long &j) const {
return i > j;
}
};
long long ans = 0;
long long sumt = 0;
long long sumd = 0;
vector<vector<long long>> g;
vector<long long> data1;
long long dfs(long... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, temp, kqua = 0;
cin >> a >> b >> c >> d;
if (a > b) {
temp = b;
b = a;
a = temp;
}
if (a <= c && c <= b) {
temp = c;
c = b;
b = temp;
} else if (a > c) {
temp = c;
c = b;
b = a;
a = temp;... | 1 |
#include <bits/stdc++.h>
#define maxn 505
using namespace std;
int n;
string s[maxn];
int col[maxn];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
bool any_black = false;
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) if (s[i][j] == '#') {
col[j]++;
any_black = true;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, m, n, t;
long long int x, y, a, b;
cin >> t;
while (t--) {
string s;
cin >> s;
long long int z = 0, o = 0;
n = s.length();
for (i = 0; i < n; i++) {
if (s[i] == '0')
z++;
else
o++;
... | 2 |
#include <bits/stdc++.h>
struct Edge {
int u, v, id;
Edge(int u, int v, int id) : u(u), v(v), id(id) {}
};
int b[100005], c[100005];
int map[200005];
std::vector<Edge> g[200005];
int in[200005];
int queue[200005];
int path[100005];
int used[100005];
int p[200005];
struct test {
int l, r;
test() {}
test(int l,... | 5 |
#include<iostream>
#include<vector>
using namespace std;
#define N 5100
vector<int> x[N];
int n,m,a,b,c,cnt;
int V[N];
int main(){
for(int i=0;i<N;i++){
for(int j=0;j<i+5;j++){
x[i].push_back(0);
V[i]=j;
}
}
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a>>b>>c;c++;
x[a][b]++;
x[a+c][b]--;
x[a+c+1][b+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int x;
cin >> x;
getchar();
string s;
cin >> s;
long long ans = 0;
for (int i = 0; i < x; i++) {
int y;
y = s[i] - '0';
if (i == (x - 1)) {
ans = ans + y;
} else {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int n, nim[N];
vector<int> g[N];
void dfs(int u, int f) {
for(int v : g[u]) if(v != f)
dfs(v,u);
for(int v : g[u]) if(v != f) {
nim[u] ^= (nim[v] + 1);
}
}
int main() {
scanf("%d", &n);
for(int i = 1; i < n; i++) {
int u, v;
scanf("%d %... | 0 |
#pragma GCC optimize("Ofast")
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#in... | 0 |
#include <bits/stdc++.h>
using namespace std;
long double pi = 2.0 * acos(0.0);
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
long long int Dp[1005][1005] = {0};
long long int A[1000005];
long long int x, n;
int fun(int ind, int sum) {
if (sum == x) {
return 1;
}
sum %= x;
if (ind =... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<int> Zalgo(string S){
int n=S.size(), i=1, w=0, k; vector<int> Z(n); Z[0]=n;
while(i<n){
while(i+w<n && S[w]==S[i+w]){ w++; }
Z[i]=w; if(w==0){ i++; continue; }
for(k=1; i+k<n && k+Z[k]<w; k++){ Z[i+k]=Z[k]; }
i+=k; w-=k;
}
return Z;
}
int main(){
int N,... | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
const int N = 110002;
const int Lg = 16;
int n, a[N], m;
int l[Lg][N * 3], r[Lg][N * 3];
int tmin[Lg][N * 3 * 4], tmax[Lg][N * 3 * 4];
int x, y;
void read(int &x) {
char ch = getchar();
x = 0;... | 4 |
#include <bits/stdc++.h>
using namespace std;
int Matrix[1002][2002];
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int distance(int a, int b, int c) {
int first, second;
first = a < b ? b - a : a - b;
second = b... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > adj[100005];
priority_queue<pair<long long, long long> > pq;
stack<long long> q;
long long dist[100005], a, b, w, n, m, bef[100005];
bool processed[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200000;
const int INF = 10000000;
void setadd(set<pair<int, int> > &s, long long &S, int j, int i, int d) {
set<pair<int, int> >::iterator it = s.upper_bound(make_pair(i, INF));
it--;
bool F = 0;
while (it != s.end() && it->second < d) {
set<pair<i... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool ban = false;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int a, b;
cin >> a >> b;
if (a >= 2400 && b > a) ban = true;
}
if (ban)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
const long long maxn = 2e5 + 10;
bool vis[maxn];
int pos;
long long a[maxn], s[maxn], num[1000005], ans, cnt;
void qprim(long long n) {
long long i;
pos = 0;
for (i = 2; i <= n / i; i++) {
if (n % i == 0) {
s[pos++] = i;
while (n % i == 0) n /= i;
}
}
if (n != 1) s... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
while (n--) {
double ele;
cin >> ele;
if (ele < 4 && ele > 0)
cout << "N\n";
else {
double a = (ele + sqrt((ele * ele) - (4 * ele))) / 2;
double b = (ele - sqrt((ele * ele) - (4 * ele))) / 2;
dou... | 3 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstr... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, X, dp[301][301][301];
string s;
int main(){
cin>>s>>X;n=s.size();
for (int i=0; i<n; i++)
for (int x=0; x<=X; x++)dp[x][i][i]=1;
for (int x=0; x<=X; x++)
for (int k=1; k<n; k++)
for (int l=0, r=k; l+k<n; l++, r=l+k)
dp[x][l][r]=max(max(dp[x][l... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int candy, no;
while (cin >> candy) {
no = (candy % 39 != 0) ? candy % 39 : 39;
cout << "3C";
cout << setw(2) << setfill('0') << no << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool get_int(T &x) {
char t = getchar();
bool neg = false;
x = 0;
for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
;
if (t == '-') neg = true, t = getchar();
if (t == EOF) return false;
for (; t <= '9' && t >= '0'; ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
char S[1001];
cin >> t;
int len;
while (t--) {
cin >> S;
len = 0;
for (int i = 0; S[i]; i++) {
if (!S[i + 1]) {
len = i + 1;
}
}
if (len - 2 >= 0 && S[len - 1] == 'o' && S[len - 2] == 'p') {
cout <<... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 2e5 + 10;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n + 1];
map<long long, long long> f, make_... | 2 |
#include <bits/stdc++.h>
using namespace std;
string DBG_DLM(int& i) { return (i++ == 0 ? "" : ", "); }
template <class T>
ostream& operator<<(ostream& os, vector<T> v);
template <class T>
ostream& operator<<(ostream& os, set<T> v);
template <class T>
ostream& operator<<(ostream& os, queue<T> q);
template <class T>
ost... | 5 |
#include <bits/stdc++.h>
using namespace std;
struct rec {
int x, t;
} a[100010];
int c[100010], b, n, i, j, m, v;
bool operator<(rec a, rec b) {
return a.t * v - a.x < b.t * v - b.x ||
a.t * v - a.x == b.t * v - b.x && a.t * v + a.x < b.t * v + b.x;
}
int main() {
ios::sync_with_stdio(false);
cin >> n... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string s;
cin >> s;
int t = s.size();
int as = 0;
int bs = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') {
as++;
} else {
bs++;
if (as) {
as--;... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long double PI = acos(-1);
const long long MAX = 1e6 + 10;
const long long INF = 1e9 + 10;
const long double EPS = 1e-9;
const int M = 1e2 + 12;
const int N = 5e5 + 10;
int a[N], d[N];
int main() {
ios_base::sync_with_stdio(false);
i... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 0;
cin >> t;
for (int i = 0; i < t; ++i) {
int n = 0;
cin >> n;
int k = 2;
while (true) {
if (n % ((int)pow(2, k) - 1) == 0) {
cout << n / ((int)pow(2, k) - 1) << "\n";
break;
} else {
++k;
... | 1 |
#include <algorithm>
#include <deque>
#include <cstdio>
using namespace std;
int main() {
double i;
deque<double> n;
while(scanf("%lf", &i)!=EOF)
n.push_back(i);
sort(n.begin(), n.end());
printf("%.1f\n", *n.rbegin()-*n.begin());
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
int n;
cin >> n;
cout << a << " " << b << endl;
for (int i = 0; i < n; i++) {
string c, d;
cin >> c >> d;
if (c == a)
a = d;
else
b = d;
cout << a << " " << b << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, depth, pos[111];
char out[5000][5000];
string s, ans;
int main() {
cin >> n >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == '[') {
pos[i] = ++depth;
} else {
pos[i] = depth--;
}
}
depth = 0;
int curr = 0;
int h = *max_element(pos, ... | 4 |
#include <bits/stdc++.h>
using namespace std;
struct Treap {
long long x, y;
long long add_x, add_y;
int height;
Treap *left, *right, *parent;
Treap(long long x, long long y, Treap *parent = 0)
: x(x), y(y), parent(parent) {
height = rand();
add_x = add_y = 0;
left = right = 0;
}
void pu... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, a[111111], b[111111], calc, w[111111], ans[111111], d[111111],
last, pr;
char c[111111];
long long gcd(long long a, long long b) {
if (!b) return a;
return gcd(b, a % b);
}
int main() {
cin >> n >> m;
for (long long i = 1; i <= m; i++) {
scan... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.