solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int a[3];
int b[3];
int c[3], d[3];
int sum = 0;
int main() {
int t;
cin >> t;
for (int i = 0; i < 3; i++) {
cin >> a[i];
c[i] = a[i];
}
for (int j = 0; j < 3; j++) {
cin >> b[j];
d[j] = b[j];
}
int maxn = 0, minn = 0;
if (c[0] >= d[1]) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
bool mark[maxn];
int main() {
ios::sync_with_stdio(0);
string s;
cin >> s;
bool flag = 0;
for (int i = 0; i < s.size(); i++)
if (s[i] - '0' == 0) {
mark[i] = 1;
flag = 1;
break;
}
for (int i = 0; i < s.size();... | 3 |
#include <bits/stdc++.h>
int main() {
int y, b, r;
scanf("%d%d%d", &y, &b, &r);
y = y + (y + 1) + (y + 2);
b = b + (b + 1) + (b - 1);
r = r + (r - 1) + (r - 2);
if (y <= b && y <= r) {
printf("%d", y);
} else if (b <= y && b <= r) {
printf("%d", b);
} else {
printf("%d", r);
}
return 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> V(n);
for (int i = 0; i < n; ++i) cin >> V[i];
vector<int> ans;
int con = 0, cur = 0;
for (int i = 0; i < n; ++i) {
cur++;
if (V[i] < 0) con++;
if (con >= 3) {
... | 1 |
#include <bits/stdc++.h>
int main() { puts("Red"); }
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b)... | 3 |
#include <bits/stdc++.h>
int main() {
long long int n, m;
int k = 0;
while (scanf("%lld", &n) != EOF) {
if (n % 2 == 0) {
printf("NO\n");
} else {
if (n == 1 || n == 3) {
printf("NO\n");
} else {
m = (n - 3) / 2;
printf("%d %lld\n", 1, m);
}
}
}
retu... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ta, tb, k, a[200002], b[200002], kq = 0;
int main() {
scanf("%d%d%d%d%d", &n, &m, &ta, &tb, &k);
for (int i = 1; i <= n; ++i) scanf("%d", a + i);
for (int i = 1; i <= m; ++i) scanf("%d", b + i);
if (k >= n) {
puts("-1");
return 0;
}
for (int i ... | 2 |
#include <bits/stdc++.h>
using namespace std;
namespace IO {
const int BUFFER_SIZE = 4096;
const int NUMBER_BUFFER = 100;
FILE *input_stream = stdin;
FILE *output_stream = stdout;
char input_buffer[BUFFER_SIZE];
int input_pos = BUFFER_SIZE;
int input_read = BUFFER_SIZE;
char output_buffer[BUFFER_SIZE];
int output_pos =... | 3 |
# include <iostream>
# include <set>
using namespace std;
int main() {
int num_query; scanf("%d", &num_query);
int command, x, left, right;
multiset<int> S;
for (int i = 0; i < num_query; ++i) {
scanf("%d", &command);
switch (command) {
case 0:
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> indexes;
string s;
cin >> s;
int count = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'r') indexes.push_back(i + 1);
}
for (int i = s.size() - 1; i >= 0; i--)
if (s[i] == 'l') indexes.push_back(i + 1);
for (int i = 0; ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int tong[222222], a[222222];
int main() {
int n, i;
memset(a, -1, sizeof(a));
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int cnt = 0;
for (i = 0; i < n - 1; i++) cnt += a[i] == 0 ? 1 : a[i] == a[i + 1];
cout << cnt + (!a[i]);
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long st[5000];
int main() {
int i, j;
int n;
while (cin >> n) {
memset(st, 0, sizeof(st));
for (i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
st[a - b + 1000]++;
st[a + b + 2000]++;
}
long long sum = 0;
for (i = 0; i < ... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize "-O3"
using namespace std;
const int MX = 1e6 + 1;
const int D = 1000;
const int INF = 1e9;
map<vector<int>, int> mm;
vector<vector<int>> gg;
int tmp[D];
int tmp2[D];
int ds[300][D];
int aa[300][300];
int bb[MX];
vector<int> pr;
int ggg[MX];
int cnt = 0;
int get(vector<int>... | 6 |
#include <bits/stdc++.h>
using namespace std;
int m, n, re[300005];
char s[300005];
bool cm(int p, char k[]) {
int i = 0;
for (i = 0; k[i]; i++) {
if (s[p + i] != k[i]) return 0;
}
return 1;
}
int main() {
int i, j, test, cas = 0, in = 0, ln;
int a, b;
scanf("%d", &test);
while (test--) {
in = 0... | 3 |
#include <bits/stdc++.h>
using namespace std;
int add(int _a, int _b) {
_a = (_a + 998244353) % 998244353;
_b = (_b + 998244353) % 998244353;
return (_a + _b) % 998244353;
}
int mul(int _a, int _b) {
_a = (_a + 998244353) % 998244353;
_b = (_b + 998244353) % 998244353;
return ((long long int)((long long int... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 103;
long long a[maxn], n;
long long h;
bool chk(long long m) {
long long cnt = 0;
for (int i = 2; i <= n; i++) {
cnt += min(m, a[i] - a[i - 1]);
}
cnt += m;
return cnt >= h;
}
int main() {
int test;
cin >> test;
while (test--) {
cin... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, c;
long long a[100005];
long long dp[100005];
long long smt[400005];
long long tot = 0;
void build(int idx, int l, int r) {
if (l == r) {
scanf("%lld", &smt[idx]);
tot += smt[idx];
return;
}
int m = (l + r) / 2;
build(idx << 1, l, m);
build(idx ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
string s,t;cin>>s>>t;
for(int i=0;s[i]&&t[i];i++)cout<<s[i]<<t[i];
return 0;
} | 0 |
#include <iostream>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<int(b); i++)
#define rep(i,b) loop(i,0,b)
const double fiv_t[] = {
35.5,
37.5,
40,
43,
50,
55,
70
};
const double th_t[] = {
71,
77,
83,
89,
105,
116,
148
};
const string ss[] = {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const int MAX = 4007;
const int MAX2 = 1000000;
const int MAXD = 20;
const int BASE = 1000000007;
const int MOD = 1000000007;
const int psz = 2000006;
int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1};
int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1};
int d... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct point {
int x, y, ord;
} D[200013];
int i, j, n, k;
long long lat[200013];
long long Sol[200013];
bool comp(point a, point b) { return (a.y > b.y); }
int main(void) {
cin >> n;
for (i = 1; i <= n; ++i) {
cin >> D[i].x >> D[i].y;
D[i].ord = i;
}
sort... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<unsigned long long, int> P;
unsigned long long H[100005], size[100005];
int n, cnt, sum, ans, root;
int head[100005], to[200005], Next[200005];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
... | 4 |
#include<iostream>
using namespace std;
int main(){
int r, c, temp, sum;
int col_sum[100] = {};
cin >> r >> c;
for(int i=0; i<r; i++){
sum=0;
for(int j=0; j<c; j++){
cin >> temp;
cout << temp << " ";
sum += temp;
col_sum[j] += temp;
}
cout << sum << endl;
sum... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int num[MAXN];
bool mark[MAXN];
int main(void) {
int n, q;
scanf("%d %d", &n, &q);
for (int i = 1; i <= n; i++) scanf("%d", &num[i]);
int dp[MAXN];
dp[n] = 1;
mark[num[n]] = 1;
for (int i = n - 1; i > 0; i--) {
dp[i] = dp[i + 1];
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
char c[maxn][maxn], emp;
vector<char> v, u;
int xbest, ybest, n, m;
char toc(int x) {
if (x == 65) return 'A';
if (x == 66) return 'B';
if (x == 67) return 'C';
if (x == 68) return 'D';
if (x == 69) return 'E';
if (x == 70) return 'F';
}
ch... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> monster(n);
for (int i = 0; i < n; ++i) {
cin >> monster[i];
}
int m;
cin >> m;
vector<pair<int, int>> hero(m);
for (int i = 0; i < m; ++i) {
cin >... | 4 |
#include <bits/stdc++.h>
using namespace std;
struct segment_tree {
long long sumv[500001 << 2], lazy[500001 << 2], minv[500001 << 2],
maxv[500001 << 2];
inline void pushup(long long p) {
sumv[p] = sumv[(p << 1)] + sumv[(p << 1 | 1)];
minv[p] = min(minv[(p << 1)], minv[(p << 1 | 1)]);
maxv[p] = ma... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 311111, inf = 1111111111;
int n, m, cnt, u[max_n], v[max_n], c[max_n], t[max_n], a[max_n], b[max_n],
no[max_n], res[max_n], used[max_n];
vector<int> g[max_n], p[max_n], g2[max_n], rg2[max_n], ans, tp;
vector<pair<int, int> > q[max_n];
void add_edge(int... | 4 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cctype>
#include <algorithm>
#include <random>
#include <bitset>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <vector>
#include <chrono>
#include <iostream>
#include <limits>
#include <n... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long infLL = 0x3f3f3f3f3f3f3f3fLL;
const int maxn = 100000 + 5;
int n, q;
char s[maxn * 2];
int a[maxn * 2];
int maxv[maxn * 8], minv[maxn * 8], up[maxn * 8], down[maxn * 8],
best[maxn * 8], mark[maxn * 8];
map<char, int> score = {... | 3 |
#include <bits/stdc++.h>
using namespace std;
char a[1010][1010];
int n, m;
bool check2(int x, int y) {
int temx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int temy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
for (int i = 0; i < 8; i++) {
if (x + temx[i] < n && x + temx[i] >= 0 && y + temy[i] < m &&
y + temy[i] >= 0) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<string, string> mp;
map<string, int> visit;
vector<pair<string, string>> v, ans;
int main() {
ios::sync_with_stdio(false);
int i, j, k, n;
string s1, s2, s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s1 >> s2;
mp[s1] = "##";
mp[s2] = "##";
v.pu... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[150], b[150];
int gcd(int x, int y) {
if (!x || !y) return x > y ? x : y;
for (int t; t = x % y; x = y, y = t)
;
return y;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = n; i >= 0; i--) scanf("%d", a + i);
for (int i = m; i >= 0; i--) sca... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn], b[maxn], cnt[maxn], dp[maxn], tot[maxn], fir[maxn], las[maxn];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b);
int lcm(int a, int b);
char in[100005];
int len;
bool is_ok(char c) {
char temp[] = {'A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y'};
for (int i = 0; i < 11; i++) {
if (c == temp[i]) return true;
}
return false;
}
void Solution() {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
void dfs(set<long long> &visited, long long x,
map<long long, set<long long>> &g, bool &ans, long long parent) {
if (g[x].size() != 2) ans = false;
for (auto a : g[x]) {
if (visited.find(a) == visited.end() && a != parent) {
visited.insert(a);
d... | 6 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
long long Bpow(long long a, long long s) {
if (s == 0) {
return 1;
}
long long u = Bpow(a, s / 2);
if (s & 1)
return u * u % mod * a % mod;
else
return u * u % mod;
}
int main() {
int n, m;
cin >> n >> m;
if (!m) {
cout << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1500 + 100;
vector<int> adj[MAX + 10];
vector<int> ch[MAX + 10];
int sz[MAX + 10];
bool mrk[MAX + 10];
int n;
pair<int, int> p[MAX + 10];
int out[MAX + 10];
void dfs(int v) {
mrk[v] = true;
sz[v] = 1;
for (int i = 0; i < (int)adj[v].size(); i++)
if... | 3 |
#include"bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
sort(S.begin(), S.end());
cout << (S[0] == S[1] && S[2] == S[3] && S[1] != S[2] ? "Yes" : "No") << endl;
return 0;
} | 0 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
int dp[1001],N,v[1001],w[1001],W;
signed main(){
for(int num=1;;num++){
cin>>W;
if(W==0)break;
cin>>N;
for(int i=0;i<N;i++){
scanf("%lld,%lld",&v[i],&w[i]);
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1505;
const long long mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
int n, q;
char str[maxn];
int num[30][maxn];
int s[maxn];
int ans[30][maxn];
void Get_Count() {
memset((num), (0), sizeof(num));
for (int i = 1; i <= n; i++) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long gcd(long long a, long long b) {
while (a && b) {
if (a > b) {
a %= b;
} else {
b %= a;
}
}
return a + b;
}
int main() {
long long n, k;
cin >> n >> k;
cout << n / gcd(n, pow(10, k)) * (int)pow(10, k);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long dp[2000][2000];
vector<int> nodes, leaves, v[15];
bool node[15], leaf[15];
bool mat[15][15];
void process(int n, int l) {
if (nodes.size() == 0 || leaves.size() == 0) return;
if (nodes.size() == 1) {
dp[n][l] = leaves.size();
return;
}
if (nodes.si... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, n;
cin >> n >> k;
if (k <= (n + 1) / 2) {
cout << k * 2 - 1;
} else {
k -= (n + 1) / 2;
cout << k * 2;
}
}
| 1 |
#include <iostream>
using namespace std;
class Cards {
public:
char m;
int n;
};
int main(void) {
int n, min, f=0;
Cards b[36], s[36];
cin >> n;
for (int i=0; i<n; i++) {
cin >> b[i].m >> b[i].n;
s[i] = b[i];
}
for (int i=0; i<n-1; i++) {
for (int j=n-1; j>i; j--) {
if (b[j-1].n > b... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct Point {
int x[3];
} p[8];
map<long long, int> M;
int vis[60];
long long dis(const Point &a, const Point &b) {
long long res = 0;
for (int i = 0; i < 3; i++) {
res += 1LL * (a.x[i] - b.x[i]) * (a.x[i] - b.x[i]);
}
return res;
}
void dfs(int now) {
if (... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 9;
struct node {
node *l, *r, *p;
long long val;
int sz, vsz, id;
node() {}
node(int id) : id(id) {
l = r = p = NULL;
val = 0;
sz = 1;
vsz = 0;
}
void pull() {
sz = 1 + vsz;
if (l != NULL) l->p = this, sz += l->sz;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
class {
public:
void solve() {
string s;
int n;
cin >> n;
cin >> s;
s = "#" + s;
string ret;
for (int i = 1, j = 1; i < s.length(); i += j, j++) ret += s[i];
cout << ret;
}
} NSPACE;
int main() {
ios_base... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
string s;
cin >> s;
int ans = INF;
int len = s.size();
for (int i = 0; i < len; ++i) {
for (int j = 0; j < len; ++j) {
if (i == j) continue;
string t = s;
int cur = 0;
for (int k = i; k < len - 1; ++k) ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int n, m, k, dp[2][51][101][101], now = 1, last = 0, C[101][101], ans;
void update(int &x, int y) { x = (x + y) % mod; }
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i <= 100; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j... | 5 |
#include <bits/stdc++.h>
using namespace std;
inline int nxt() {
int x;
scanf("%d", &x);
return x;
}
const int N = 55;
int dp[N][N][N][N];
int a[N][N];
inline int getcnt(int x1, int y1, int x2, int y2) {
return a[x2][y2] - a[x1][y2] - a[x2][y1] + a[x1][y1];
}
int rec(int x1, int y1, int x2, int y2) {
if (dp[x... | 4 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct edge{
ll to;
ll cost;
};
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
ll N,M,A,B,T;
vector<edge> G[1000];
ll d[1000][101];
ll INF=(1LL<<60);
map<ll,bool> used;
ll check(ll X){
if(used[X])return INF;
used[X]=true;
if(X<0)return I... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 101010;
int n, m, k, q;
bool ans[N << 1];
pair<int, int> rook[N << 1];
pair<pair<int, int>, pair<int, int> > rect[N << 1];
vector<pair<int, int> > v[N];
struct Seg {
static const int N = ::N << 2;
int mi[N];
void build(int l, int r, int rt) {
mi[rt] ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return x;
}
int n, head[maxn], cnt = 1;
double add[maxn], v[maxn];
struct edge {
int to, nex... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 100003;
long long n, m, k = 0, q;
char s[100005];
int sum[100005];
int dis[100005];
int main() {
scanf("%d %d %s", &n, &k, s);
for (int i = 0; i < n; i++) {
if (s[i] == '0')
sum[i + 1] = sum[i] + 1;
else
sum[i + 1] = sum[i];
}... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long double pi = acos(-1.0);
const string debug_line = "yolo";
const long double PI = acos((long double)-1.0);
const long double eps = 1e-6;
struct node {
int u, v, x1, y1, c;
node(int _u, int _v, int _x1, int _y1, int _c) {
u = _u,... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const double pi = 3.1415926535897932384626433832795028841;
int main() {
long long n, x, y;
long long degree[10005];
for (int i = 0; i < 10005; i++) degree[i] = 0;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 105000;
int n;
int a[MAXN];
map<int, int> achMp[MAXN];
int qn;
long long cur[MAXN];
long long f[MAXN];
void update(int pos, int delta) {
for (; pos < n; pos = (pos | (pos + 1))) {
f[pos] += delta;
}
}
long long sum(int pos) {
long long res = 0... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,k;
cin>>a>>b>>c>>k;
int p=max({a,b,c});
for(int i=0;i<k;i++){
p*=2;
}
cout<<p+a+b+c-max({a,b,c})<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin>>N>>K;
if (K>=2) cout<<N-K<<endl;
else cout<<0<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, t;
struct punct {
int x, y;
} A[100010], B[30];
long long sol, value;
long long det(punct A, punct B, punct C) {
return 1LL * A.x * B.y + 1LL * B.x * C.y + 1LL * C.x * A.y - 1LL * A.x * C.y -
1LL * B.x * A.y - 1LL * C.x * B.y;
}
long long modul(long long... | 5 |
// D - Moving Piece
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int main(){
int N, K; cin>>N>>K;
vi P(N); rep(i, N) cin>>P[i], P[i]--;
vi C(N); rep(i, N) cin>>C[i];
ll INF = 1e18;
ll score = -INF;
rep(st, N){
ll lap_s... | 0 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int n, m, D[32768], w[15][15], S, C[15];
bool v[15];
struct A {
int a, b;
bool operator<(const A &p) const { return a < p.a; }
} tp, tp2;
priority_queue<A> PQ;
void DFS(int a) {
int i;
v[a] = true;
for (i = 0; i < n; i++) {
if (... | 4 |
#include<stdio.h>
int main(void) {
int i, x;
for (x = 1;x < 10;x++) {
for (i = 1;i < 10;i++) {
printf("%dx%d=%d\n", x, i, x*i);
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int n, m;
int main() {
cin >> n >> m;
long long int a[100001];
long long int e = 0;
long long int o = 0;
long long int e2 = 0;
long long int o2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2)
o++;
else
e++;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n == 0 && m != 0) {
cout << "Impossible";
return 0;
}
cout << n + max(m - n, 0) << ' ' << n + m - (m == 0 ? 0 : 1);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
char arr[201];
int n;
int h, v;
void see(char ch) {
if (ch == 'U')
v++;
else if (ch == 'D')
v--;
else if (ch == 'R')
h++;
else
h--;
}
int main() {
scanf("%d", &n);
scanf("%s", arr);
int ans = 0;
for (int c = 0; c < n; c++) {
h = 0;
v ... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, bool maximum_mode = false>
struct RMQ {
int n = 0, levels = 0;
vector<T> values;
vector<vector<int>> range_low;
RMQ(const vector<T> &_values = {}) {
if (!_values.empty()) build(_values);
}
static int largest_bit(int x) { return 31 - __b... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483646;
int MOD = 1000000007;
long long INF64 = 9223372036854775807;
long double EPS = 0.000000000001;
long double PI = 3.14159265358979310000;
long double d[123][123][123];
int main() {
int r, ii, s, p;
long double i, j, u;
cin >> r >> s >> p;
d... | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<int> tree[500000 + 10];
int dp[500000 + 10];
int cnt;
void dfs(int x, int f, int deep) {
if (tree[x].size() == 1) dp[cnt++] = deep;
for (int i = 0; i < tree[x].size(); i++) {
if (tree[x][i] != f) dfs(tree[x][i], x, deep + 1);
}
}
int main() {
int n;
sca... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long M;
long long mul(long long a, long long b) { return ((a % M) * (b % M)) % M; };
long long sub(long long a, long long b) { return ((a % M) - (b % M) + M) % M; };
long long pwr(long long a, long long b) {
if (b == 0) return 1;
if (b == 1) return a;
if (a == 1)... | 1 |
#include<cstdio>
#include<algorithm>
#include<map>
const int maxn=2010,S=10000;
int n,a[maxn],b[maxn],vt;
bool used[maxn],ban[maxn];
std::map<int,int>M;
struct edge{int to;edge*next;}E[maxn*20],*ne=E,*fir[maxn*10];
int vis[maxn*10];
void cmin(int&a,int b){b<a?a=b:1;}
void cmax(int&a,int b){b>a?a=b:1;}
int pid(int x){re... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool Check(long);
long N, M;
vector<long> A;
int main() {
cin >> N >> M;
A.resize(N);
for (long &x : A) cin >> x;
long L = 0, R = M - 1, Mid;
while (L < R) {
Mid = (L + R) >> 1;
if (Check(Mid))
R = Mid;
else
L = Mid + 1;
}
cout << L << ... | 1 |
#include <bits/stdc++.h>
const int MAXN = 2e7 + 7;
using namespace std;
long long int power(long long int x, long long int y) {
long long int res = 1;
while (y > 0) {
if (y & 1) {
res = (res * x) % 1000000007;
}
x = (x * x) % 1000000007;
y = y >> 1;
}
return res;
}
std::vector<int> divi[10... | 2 |
#include <cmath>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
const int x=1000;
int W,H,w,h,sum;
int a[510][510];
int main(){
scanf("%d%d%d%d",&W,&H,&w,&h);
for (int i=1;i<=W;++i)
for (int j=1;j<=H;++j)
a[i][j]=x;
sum=W*H*x;
for (int i=w;i<=W;i+=w)
... | 0 |
#include <bits/stdc++.h>
int in() {
int r = 0, c;
for (c = getchar(); c <= 32; c = getchar())
;
if (c == '-') return -in();
for (; c > 32; r = (r << 1) + (r << 3) + c - '0', c = getchar())
;
return r;
}
using namespace std;
vector<vector<int> > g;
vector<pair<int, int> > ed;
bool visited[1005];
int pa... | 5 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native,avx2")
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<strin... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, t;
string a[10005];
int check[10005];
int convert(string s) {
int mul = 1;
int ans = 0;
for (int i = s.size() - 1; i >= 0; i--) {
int cur = s[i] - '0';
ans += mul * cur;
mul *= 10;
}
return ans;
}
string change(string s) {
for (char i = '0'; i... | 2 |
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<map>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pii;
typedef pair<string,int> ... | 0 |
#include <iostream>
using namespace std;
int N,K;
int H[100005];
int DP[100005];
int main(){
cin>>N>>K;
for(int i=0;i<N;i++)
cin>>H[i];
for(int i=1;i<N;i++){
DP[i]=1e9;
for(int j=1;j<min(i+1,K+1);j++)
DP[i]=min(DP[i],DP[i-j]+abs(H[i]-H[i-j]));
}
cout<<DP[N-1];
} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
long long x, y;
};
node s[11000];
bool cmp(const node& a, const node& b) {
if (a.x == b.x) {
return a.y < b.y;
} else
return a.x < b.x;
}
int main() {
long long n, w, v, u;
cin >> n >> w >> v >> u;
for (int i = 0; i < n; i++) {
cin >> s... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, c, a[200005], S[4 * 200005], w[200005], lw, z[200005];
void modify(int s, int d) {
int t = 1, l = 1, r = 200000, mid;
while (l < r) {
mid = (l + r) >> 1, S[t] += d;
if (s <= mid)
r = mid, t = (t << 1);
else
l = mid + 1, t = ((t << 1) | 1);... | 5 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pr;
const ll maxn = 100000 + 10;
const ll MOD = 1000000007;
ll a[maxn], b[maxn], val[maxn], N, n, m, tot = 0;
pr c[maxn];
inline bool cmp(pr a, pr b) {
if(a.first != b.first) retu... | 0 |
#include<cstdio>
#include<algorithm>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const double EPS=1e-8;
const int T=86400;
int main(){
int n;
for(double L;scanf("%d%lf",&n,&L),n;){
static int use[T];
rep(t,T) use[t]=0;
rep(i,n){
int a,b,u; scanf("%d%d%d",&a,&b,&u);
for(int t=a;t<b;t+... | 0 |
#include<bits/stdc++.h>
using namespace std;
map<int, int> res;
int dp[30][80];
void prime_factor(int n){
for(int i=2;i*i<=n;i++){
while(n % i == 0){
res[i]++;
n /= i;
}
}
if(n != 1) res[n]++;
}
int main(){
int n; cin >> n;
for(int i=2;i<=n;i++) prime_fac... | 0 |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <ctime>
#include <deque>
using namespace std;
int n, m;
int a[210000], dp[210000];
int sum[210000];
map <int, int> ans;
int doit... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.writ... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long int saiki( long long int N, long long int K, long long int S, long long int now ) {
if( K == 0 ) {
return S == 0;
}
long long int ret = 0;
for( long long int i = now + 1; i <= N&&S - i >= 0; i++ ) {
ret += saiki( N, K - 1, S - i, i );
}
return ret;
}
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
namespace hjx {
int read() {
int res = 0, f = 1;
char a = getchar();
while (a < '0' || a > '9') {
if (a == '-') f = -1;
a = getchar();
}
while (a >= '0' && a <= '9') res = res * 10 + a - '0', a = getchar();
return res * f;
}
void writ(int x) {
static i... | 5 |
#include<bits/stdc++.h>
using namespace std;
int H,W;
vector<vector<int>> field;
void dfs(int h, int w){
field[h][w] = 0;
for(int dh=-1;dh<=1;dh++){
for(int dw=-1;dw<=1;dw++){
int nh=h+dh, nw=w+dw;
if(nh<0||nw<0||H-1<nh||W-1<nw) continue;
if(field[nh][nw] == 0) continue;
dfs(nh, nw);
}
}
}
i... | 0 |
#include<cstdio>
using namespace std;
int n;
int main()
{
scanf("%d",&n);int ans=0;
for(int i=1;i<=n;i+=2) {int cnt=0;for(int j=1;j<=i;++j) if(!(i%j)) ++cnt;if(cnt==8) ++ans;}
printf("%d\n",ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 211;
int n;
long double w[N][N];
long double a[N][N], b[N][N];
int main() {
int t;
scanf("%d", &n);
for (int i = 1; i < n + 1; ++i) {
for (int j = 1; j < n + 1; ++j) {
cin >> w[i][j];
}
}
for (int i = 1; i < n + 1; ++i) {
for (int j... | 2 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
struct Node
{
int key;
Node *parent, *left, *right;
};
Node *root, *nil;
void insert(int i)
{
Node *n = (Node *)malloc(sizeof(Node));
n->key = i;
n->left = nil;
n->right = nil;
Node *node = root;
Node *parent = nil;
while... | 0 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n;
scanf("%d", &n);
deque<int> a;
for(int i = 0, j; i < n; ++i)
{
scanf("%d", &j);
if(i % 2)
{
a.push_front(j);
}
else
{
a.push_back(j);
}
}
if(n % 2)
{
for(int i = n - 1; i >= 0; --i)
{
printf("%d ", a[i]);
}
}
else
... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> a[1010];
int main() {
int tc, n, k, m, p;
cin >> tc;
while (tc--) {
cin >> n >> k;
for (int i = 0; i < k; i++) {
int c;
cin >> c;
for (int j = 0; j < c; j++) {
int x;
cin >> x;
a[i].push_back(x);
}
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int p = 1000000007;
int a[41] = {0, 2, 3, 5, 7, 13, 17,
19, 31, 61, 89, 107, 127, 521,
607, 1279, 2203, 2281, 3217, 4253, 4423,
9689, 9941, ... | 5 |
#include<iostream>
#define N 1000
using namespace std;
int main(){
while(1){
int n,q,e[N],w[N],que[N],f;
string str[N];
cin>>n>>q;
if(n+q==0) break;
for(int i=0;i<n;i++)cin>>str[i]>>e[i]>>w[i];
for(int i=0;i<q;i++) cin>>que[i];
for(int i=0;i<q;i++){
f=0;
for(int j=0;j<n;j++)if(e[j]-(... | 0 |
#include <bits/stdc++.h>
int main() {
int n;
std::map<int, int> m;
std::cin >> n;
std::vector<int> deviations(n);
int total = 0;
for (int i = 0; i < n; ++i) {
int l, r;
std::cin >> l >> r;
total = total + l - r;
deviations[i] = 2 * r - 2 * l;
}
for (int i = 0; i < n; ++i) {
m.insert(... | 2 |
#include <bits/stdc++.h>
using namespace std;
int IN() {
int c, F, x;
while (!isdigit(c = getchar()) && c != '-')
;
c == '-' ? (F = 1, x = 0) : (F = 0, x = c - '0');
while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
return !F ? x : -x;
}
const int N = 4000 + 19;
const int M = 90;
const int... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.