solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
scanf("%d %d",&n,&k);
if(k==1) printf("0");
else printf("%d",n-k);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
long int p = n / 10;
long int r = n;
long int a = n % 10;
n = n / 100;
long int q = n * 10 + a;
if (p >= q && p > r)
cout << p;
else if (q >= p && q > r)
cout << q;
else
cout << r;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 111, M = 26, mod = 1e9 + 7;
int dp[N][N * M];
int main() {
dp[0][0] = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j <= i * 25; j++) {
for (int k = 0; k <= 25; k++) {
if (k <= j) dp[i][j] += dp[i - 1][j - k];
dp[i][j] %= mod;
... | 3 |
#include<stdio.h>
int main()
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a+1>=c)
printf("delicious");
else if(c>a+b)
printf("dangerous");
else
printf("safe");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
string A, B;
int main(int argc, const char* argv[]) {
cin >> A >> B;
int j = 0;
for (int i = 0; i < B.length(); i++) {
if (B[i] == A[j]) j++;
}
cout << j + 1 << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; ++i) { cin >> s[i]; }
vector<pair<int, int>> a, b;
for (int i = 0; i < N; ++i) {
int sum = 0, min_s = 1e8;
for (auto c : s[i]) {
if (c == '(') { ++sum; }
else { ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int NUM = 7368800;
int flg[NUM];
int main(){
for(int n, m; cin >> n >> m, n;){
for(int i = 0; i < NUM; i++)flg[i] = 0;
for(int i = 0; i < m; i++){
for(int j = n; j < NUM; j += n)flg[j] = 1;
for(;... | 0 |
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> vec(n);
for (auto &v : vec)std::cin >> v;
int q; std::cin >> q;
for (auto i = 0; i < q; ++i) {
int b, e, k;
std::cin >> b >> e >> k;
int count = 0;
for (auto j = b; j < e; ++j) {
if (vec[j] == k) ++count;
}
st... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const unsigned int M = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << (x2 - x1) * (y2 - y1) + 1 <<... | 3 |
#include<cstdio>
#define popcnt __builtin_popcount
typedef long long LoveLive;
const int N=15,M=32768,md=1e9+7;
int f[M],n,m,e[N];
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<m;++i){
int u,v;
scanf("%d%d",&u,&v);
e[u-1]|=1<<(v-1);
}
const int C=1<<n;
f[0]=1;
for(int S=3;S<C;++S)if((S&1)==(S>>1&1))
for(i... | 0 |
#include <vector>
#include <iostream>
#include <functional>
using namespace std;
const int mod = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<int> cs;
for (int i = 2; i * i <= M; ++i) {
int cnt = 0;
while (M % i == 0) {
M /= i;
++cnt;
}
if (cnt >= 1) cs.push_back(cnt);
}
if (M != 1) cs.p... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3, a4, a5, a6;
cin >> a1 >> a2 >> a3 >> a4 >> a5 >> a6;
if (a1 + a2 + a3 == a4 + a5 + a6)
cout << "YES";
else if (a1 + a4 + a5 == a2 + a3 + a6)
cout << "YES";
else if (a1 + a5 + a6 == a2 + a3 + a4)
cout << "YES";
else if (a1... | 1 |
#include <bits/stdc++.h>
using namespace std;
int min(int a, int b) {
if (a > b) return b;
return a;
}
int ispali(string s) {
string t = s;
reverse(s.begin(), s.end());
if (t == s) return 1;
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
whil... | 2 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<long long> sum(1000001,0);
for(int i=0;i<=1000;i++){
for(int j=0;j<=1000;j++){
sum[i+j]++;
}
}
int n;
while(cin >> n){
long long ans = 0;
for(int i=0;i<=n;i++){
ans += sum[i] * sum[n-i];
}
cout <<... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
set<int> S;
int n;
int ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> mp(k + 1, 0);
for (int i = 0; i < n; i++) mp[a[i]]++;
int o = 0, e = 0;
int ctr = 0;
for (auto it = 1; it < mp.size(); it++) {
if (mp[it] % 2 =... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
long long n;
bool pt[maxn];
void solve() {
long long ans = 0;
for (long long i = 2; i <= n; i++) {
long long cnt = 0;
for (long ... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long t, n, a, b;
char s[200005];
long long k[200005];
int main() {
cin >> t;
while (t--) {
cin >> n >> a >> b;
cin >> s;
long long m = 0;
k[m] = -1;
m++;
long long suml = 0, sums = 0, sumz = 0, sump = n + 1;
for (int i = 0; i < strlen(s)... | 3 |
#include <bits/stdc++.h>
using namespace std;
int index(int a[],int n){
int j=0;
for(int i=0;i<n;i++){
if(i==0 && a[i]!=a[i+1] && a[i+1]==a[i+2]){
j=i;
break;
}
else if(i==0 && a[i]!=a[i+1] && a[i+1]!=a[i+2]){
continue;
}
else if(a[i]... | 1 |
#include<stdio.h>
int main() {
int n,i,data[1000];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &data[i]);
}
for (i = n; 1 < i; i--) {
printf("%d ", data[i]);
}
printf("%d\n", data[i]);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {+1, -1, +0, +0};
int dy[] = {+0, +0, +1, -1};
int vis[20][20];
int main() {
int test;
cin >> test;
while (test--) {
long long n, m, k;
cin >> n >> m >> k;
string res = "YES", s[n + 1];
for (int i = 0; i < n; i++) cin >> s[i];
for (int i... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, mod = 1e9 + 7;
const double eps = 1e-9;
struct point {
double x, y, z;
};
point p[N];
double v1, v2;
int n;
double getdis(int id1, int id2) {
double d1 = p[id1].x - p[id2].x;
double d2 = p[id1].y - p[id2].y;
double d3 = p[id1].z - p[id2].z;
... | 3 |
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main(void)
{
int n,p[100],i,j,cnt,x;
cnt=0;
cin>>n;
for(i=0;i<n;i++){
cin>>p[i];
}
for(i=1;i<=n;i++){
cnt=0;
for(j=0;j<n;j++){
if(p[j]>=i){
cnt=cnt+1;
}
}
if(cnt>=i) x=i;
}
cout<<x<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T>
inline T sqr(T x) {
return x * x;
}
const double eps = 1e-... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
long long n, max, k;
cin >> t;
while (t--) {
cin >> n >> k;
long long ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n, greater<int>());
max = ar[0];
long int i = 1;
while (k--) {
if... | 2 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> p;
int a, b, c;
cin >> a >> b >> c;
p.push_back({a, b, c});
cin >> a >> b >> c;
p.push_back({a, b, c});
if (p[0][0] != p[1][0] && p[0][1] != p[1][1] && p[0][2] != p[1][2]) {
cout << "NO";
} else
cout << "YES";
retur... | 4 |
#include <bits/stdc++.h>
using namespace std;
char a[100011];
int n;
int dp[100011][3][2];
int path[100011][3][2];
int solve(int idx, int rem, int f) {
if (idx == n) {
if (rem == 0 && f)
return 0;
else
return (1 << 25);
}
if (dp[idx][rem][f] != -1) return dp[idx][rem][f];
int res = 1 + solve... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, s, a[2005], dp[2005][2], ti[2005][2];
vector<pair<int, int> > v;
pair<int, int> nxt[2005][2];
int solve(int i, bool start) {
if (dp[i][start] != -1) return dp[i][start];
int t;
if (start)
t = v[0].first;
else {
if (a[i] == v.back().first) return 0;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long linf = 1ll * inf * inf;
const int N = 1000000 + 7;
const int M = 10000 + 7;
const int multipleTest = 0;
const double pi = acos(-1);
template <typename T>
void addmod(T& a, const long long& b, const int MOD = inf) {
a = (a + b) % in... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int nmax = 100010;
int n, pi[nmax], sum[nmax];
char s[nmax];
vector<pair<int, int> > ans;
int main() {
gets(s + 1);
n = strlen(s + 1);
int q = 0;
for (int i = 2; i <= n; ++i) {
while (q && s[q + 1] != s[i]) q = pi[q];
if (s[q + 1] == s[i]) q++;
pi[... | 4 |
#include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
#include <set>
#include <map>
#include <tuple>
#include <string>
constexpr intmax_t operator ""_jd(unsigned long long n) { return n; }
constexpr uintmax_t operator ""_ju(unsigned long long n) { return n; ... | 0 |
#include<cstdio>
char A[1<<8|1];
int op[333333],cnt;
void make(int S,int ty){
if(!S)return;
int i=0;while(!(S>>i&1))i++;
if(S==(1<<i)){
op[cnt++]=ty&2?-i-1:i+1;
return;
}
if(ty&1){
op[cnt++]=ty&2?i+1:-i-1;
make(S^1<<i,ty^3);
op[cnt++]=ty&2?-i-1:i+1;
make(S^1<<i,ty);
}
else{
make(S^1<<i,ty);
op[cn... | 0 |
#include <iostream>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int m, n;
bool tront[90][90];
int dfs(int y, int x) {
int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};
int rep = 0;
tront[y][x] = false;
REP(i, 4) {
int nx = x + dx[i], ny = y + dy[i];
if (! (nx >= 0... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 300;
bool matrix[maxN][maxN];
int nRows, nColumns;
int leftStreak[maxN][maxN], downStreak[maxN][maxN];
int findRight() {
for (int y = 0; y < nRows; y++)
for (int x = nColumns - 1; x >= 0; x--)
leftStreak[x][y] = (x != nColumns - 1) ? (matrix[x][... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int i;
vector<pair<int, int>> v;
v.reserve(10000);
pair<int, int> cur;
scanf("%d", &n);
cur.first = 1, cur.second = 1;
for (i = 0; i < n; i++) {
v.push_back(cur);
if (cur.first == cur.second) {
cur.first++;
} else {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long getpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = (res * a) % 1000000007;
a = (a % 1000000007 * a % 1000000007) % 1000000007;
n >>= 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.t... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int d[505][505];
int vis[505], match[505];
int ans;
int in[505], out[505];
int dfs(int u, int x) {
int i, j;
for (i = 1; i <= n; i++) {
if (i == u || vis[i] || !d[x][i]) continue;
vis[i] = 1;
if (match[i] == -1 || dfs(u, match[i])) {
match[i]... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
char a[maxn][maxn];
int n, s[maxn];
int main() {
scanf("%d", &n);
int r = 0, c = 0;
int max1 = 0, sum = 0, biao = 1;
for (int i = 1; i <= n; i++) {
scanf("%d", s + i);
if (i % 2 == 1)
sum += s[i];
else
sum -= s[i];
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X,Y,Z,K;
cin >> X >> Y >> Z >> K;
vector<long> A(X),B(Y),C(Z),AB(X*Y),ABC(K*K);
for(int i=0; i<X; i++){
cin >> A.at(i);
}
for(int i=0; i<Y; i++){
cin >> B.at(i);
}
for(int i=0; i<Z; i++){
cin >> C.at(i);
}
for(int i=0; i<X; i... | 0 |
#include <bits/stdc++.h>
char a[150];
bool f1, f2, f3;
int main() {
int n;
scanf("%s", a);
for (n = 0; a[n]; n++) {
if (a[n] >= 'A' && a[n] <= 'Z') f1 = 1;
if (a[n] >= 'a' && a[n] <= 'z') f2 = 2;
if (a[n] >= '0' && a[n] <= '9') f3 = 3;
}
puts(n >= 5 && f1 && f2 && f3 ? "Correct" : "Too weak");
r... | 1 |
#include <bits/stdc++.h>
using namespace std;
int arr[105];
int auction[105];
int main() {
int n, m, x;
cin >> n >> m;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
for (int i = 1; i <= m; i++) {
cin >> x;
auction[i] = arr[x];
sum -= arr[x];
}
sort... | 3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (int)1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
int n;
vector<int> r;
vector<vector<int>> spc;
bool check() {
vector<int> total(n);
for (int k = 0; k < 3; k++) {
vector<int> rank(n, 0);
... | 0 |
#include<bits/stdc++.h>
using namespace std;
string a;
int b;
int main(){
scanf("%d",&b);
cin>>a;
if(b<3200)puts("red");
else cout<<a;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[150010];
int ac[150010];
set<pair<int, int> > sw;
int main() {
cin >> n;
for (int i = 0; i < (n); i++) cin >> a[i];
vector<int> cand;
for (int i = 0; i < (n - 1); i++) {
if (i & 1) {
if (a[i] <= a[i + 1]) {
cand.push_back(i);
c... | 3 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define PI acos(-1)
#define EPS 1e-9
#define debug cerr <<
#define var(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define case(tc) cout << "Case " <<... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 11005;
pair<int, long long> seg[2 * N];
int n;
long long m, l[2 * N], x[2 * N];
int bit[4][2 * N], f[2 * N];
int cnt, tot;
int sum(int x, int* s) {
int ret = 0;
while (x) {
ret += s[x];
x -= x & -x;
}
if (ret != 0) r... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, x, y, xx, yy, d, ans;
cin >> r >> x >> y >> xx >> yy;
d = sqrt(pow(xx - x, 2) + pow(yy - y, 2));
r *= 2;
ans = d / r;
if (ans != (int)ans) {
cout << ((int)ans + 1);
} else {
cout << ans;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m, op, x, p[2] = {0, 1}, a[1000000];
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
while (m--) {
cin >> op;
if (op == 2) {
if (p[1] & 1)
p[0]++, p[1]--;
else
p[0]--, p[1]++;
} else
cin >> x, (p[0] += x) %... | 3 |
#include "iostream"
using namespace std;
int main(){
int a;
while(cin >> a){
if(a == 0) break;
int count = 0;
for(int i = 1; i <= a; i ++){
int buf = i;
while(buf % 5 == 0 ){
buf /= 5;
count ++;
}
}
cout << count << endl;
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(){
int n,t;cin>>n>>t;
int mn = 1001;
for(int i = 0; n > i; i++){
int q,w;cin>>q>>w;
if(t >= w)mn = min(mn,q);
}
if(mn == 1001)cout << "TLE" << endl;
else cout << mn << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i,n) for(int i=0;i<n;i++)
const ll MOD=1e9+7;
ll n,a[100010],h[100010]={};
ll ad(ll x,ll y){
return (x+y)%MOD;
}
ll mlt(ll x,ll y){
return (x*y)%MOD;
}
ll pwr(ll x,ll y){
ll pw[32]={},w=1;
pw[0]=x;
fr(i,31) pw[i+1]=mlt(pw[i],pw[... | 0 |
#include <bits/stdc++.h>
bool prizes[1000001];
int main() {
int count;
scanf("%d", &count);
for (int i = 0; i < count; i++) {
int prize;
scanf("%d", &prize);
prizes[prize] = true;
}
int lastPrize1 = 1;
for (int i = 2; i <= 500000; i++) {
if (prizes[i]) {
lastPrize1 = i;
}
}
int... | 2 |
//Bokan ga bokka--nn!!
//Daily Lunch Special Tanoshii !!
//これは、頭が悪く競プロが世界で一番できないHIR180が
//IOI2014日本代表になるまでのN日間の記録である。
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#i... | 0 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
using pll = pair<long long, long long>;
map<long long, long long> M;
long long cal(long long x, long long y, long long cost) {
long long res = 0;
while (x != y) {
if (x > y) swap(x, y);
M[y] += cost;
res += M[y];
y >>= 1;
}
retur... | 3 |
#include <bits/stdc++.h>
using namespace std;
char s[500000];
int main() {
long long x, y;
int n;
while (~scanf("%d%lld%lld", &n, &x, &y)) {
scanf("%s", s);
int len = 0;
int flag = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
flag = 1;
else if (s[i] == '1' && flag == 1)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
short n, m;
char a[1111][1111];
short kx[4] = {1, -1, 0, 0}, ky[4] = {0, 0, 1, -1};
bool vis[4][1001][1001];
short d[4][1001][1001];
bool sat;
short dfs(short z, short u, short v) {
if (vis[z][u][v]) return d[z][u][v];
vis[z][u][v] = true;
if (a[u][v] == '*')
d[z]... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 500500;
string s;
int cnt[30][5400][30], ans;
int main() {
cin >> s;
int n = s.length();
s = s + s;
for (int i = 0; i < n; ++i)
for (int j = i; j < n + i; ++j) cnt[s[i] - 'a'][j - i][s[j] - 'a']++;
for (int i = 0; i < 26; ++i) {
int tmp, mx ... | 5 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
int main() {
while (true) {
int W,H;cin>>W>>H;
if(H==0)break;
string command;
int dx[4] = { -1,0,1,0 };
int dy[4] = { 0,1,0,-1 };
int wa... | 0 |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
using namespace std;
const int maxn=5*10e5+10;
int pre[maxn],suf[maxn];
void pre_fix(string s,int p[]){
p[0]=-1;
int len=0,i=1;
while(i<s.size()){
if(s[i]==s[len] || len==-1){
p[i+1]=len+1;
i++,len++;
}
else
len=p[len];
}
}
in... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<vector<bool>> ops(N + 1, vector<bool>(N, false));
vector<pair<int, int>> intervals = {{0, N}};
for (int ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, f[1000005], cnt[105], dem, res;
vector<int> P, X;
int d, mul[100005];
void light_on(int &mask, int i) { mask |= 1 << (i); }
int pt(int x) {
int mask = 0;
for (int i = 0; i < P.size(); ++i) {
if (x % P[i] == 0) {
int D = 0;
while (x % P[i] == 0) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
void perdi() {
puts("-1");
exit(0);
}
int d12, d13, d14, d23, d24, d34;
char r[4][1 << 20];
int n, xx, yy;
bool doit() {
int x, y, z;
if ((d14 + d24 - d12) % 2) return false;
z = (d14 + d24 - d12) / 2;
if ((-d24 + d12 - d34 + xx + yy) % 2) return false;
x = (-... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, m, l, r, i;
long long sum;
scanf("%d", &t);
while (t--) {
scanf("%d%d", &n, &m);
sum = 0;
for (i = 0; i < n; i++) {
if (sum + i + 1 >= m) break;
sum += i + 1;
}
l = i + 2;
r = m - sum;
for (i = n; i >= 1... | 2 |
#include <bits/stdc++.h>
using namespace std;
void read_file(bool outToFile = true) {}
int n;
const int nMax = 100000 + 2 + 9;
double P[nMax];
double dp[nMax];
double ans;
int main() {
read_file();
while (scanf("%d", &n) != EOF) {
ans = 0;
for (int i = 1; i <= n; i++) scanf("%lf", &P[i]), ans += 1 * P[i];
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
char a[N];
int b[N], c[N], d[N], e[N], sa[N], height[N], n, m, bg[N];
int rmq[N][22];
char p[N], ss[N];
int cmp(int *r, int a, int b, int l) {
return r[a] == r[b] && r[a + l] == r[b + l];
}
void da() {
int i, j, p, *x = c, *y = d, *t;
for (i = 0;... | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[300005], n, flag[300005];
int main() {
int i, j, k;
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
printf("%d ", 1);
int end = n, sum = 1;
for (i = 1; i <= n; i++) {
flag[a[i]] = 1;
sum++;
if (a[i] == end) {
for (j = end; j... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t a, b, c, d, _;
cin >> a >> b >> _ >> c >> d >> _ >> _;
int64_t ans = a/2*2 + b + c/2*2 + d/2*2;
if(a && c && d){
a--; c--; d--;
int64_t ans2 = a/2*2 + b + c/2*2 + d/2*2 + 3;
ans = max(ans, ans2);
}
cout <<... | 0 |
#include <bits/stdc++.h>
using namespace std;
void pv(vector<long long int> arr, long long int size) {
for (long long int i = 0; i < size; i++) {
cout << arr[i] << ' ';
}
}
void gv(vector<long long int> &arr) {
long long int size = arr.size();
for (long long int i = 0; i < size; i++) {
cin >> arr[i];
... | 3 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, M = 3010, mod = 998244353;
long long a[N], w[N];
long long dp[M][M];
long long inverse(long long x);
long long pwr(long long x, long long e);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
long long b... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
const long long N = 1e5;
const long long mod = 1e9 + 7;
const long double eps = 1E-7;
long long n, mx, mn = 1e9, cnt, m, ans;
void solve() {
string s;
cin >> s;
string s1, s2;
for (int i = 0; i < s.size(); i++) {
if (s[i] % 2 == 0)
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long H[20000000], A[4005];
char s[4005];
long long bsearch(long long x, long long n) {
int l = 0, r = n + 1, mid;
while (r - l > 1) {
mid = l + r >> 1;
if (H[mid] <= x)
l = mid;
else
r = mid;
}
return l;
}
int main() {
int a, n, i, num... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
int n, m, k, ans, a[N], f[N];
set<int> s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
while (!s.empty()... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e18;
const int maxn = 3e5 + 10;
const int mod = 1e9 + 7;
long long n, m;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
if (n == 1 || m == 1) {
if (m == 1) swap(n, m);
if (m % 6 == 0) cout << m;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
double n;
int main() {
cin >> n;
for (double aa = 1; aa <= 10; aa++)
for (double h = 1; h <= 10; h++)
if (abs(aa * h / 2 / sqrt(aa * aa / 4 + h * h) - n) <= 0.0001)
return cout << aa << ' ' << h << '\n', 0;
return 0;
}
| 5 |
#include <bits/stdc++.h>
int a[105][105];
int main() {
int n, i, j, k, t, h;
int temp, ans;
while (scanf("%d", &n) != EOF) {
temp = 0;
ans = 0;
k = 0;
t = 0;
memset(a, 0, sizeof(a));
for (h = 0; h < n; h++) {
scanf("%d%d", &i, &j);
a[i][j] = 1;
if (i > k) k = i;
if ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m;
int visited[m + 1];
for (int i = 0; i <= m; i++) {
visited[i] = 0;
}
for (int i = 0; i < n; i++) {
int k;
cin >> t;
for (int j = 0; j < t; j++) {
cin >> k;
visited[k] = 1;
}
}
for (int ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
long long dp[4040][4040], c[4040][4040];
void init() {
dp[0][0] = dp[1][1] = 1;
for (int i = 1; i < 4040; i++) {
dp[i][1] = dp[i - 1][i - 1];
for (int j = 2; j <= i; j++)
dp[i][j] = (dp[i][j - 1] + dp... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool dfs(unsigned long long a, unsigned long long b) {
if (a > b) {
swap(a, b);
}
if (a == 0) {
return false;
}
if (dfs(a, b % a)) {
if (((b / a) % (a + 1)) % 2 == 0) {
return true;
}
return false;
}
return true;
}
int main() {
ios_... | 5 |
#include <bits/stdc++.h>
using namespace std;
map<string, int> M;
int graph[10][10];
void init() {
M["Anka"] = 0;
M["Chapay"] = 1;
M["Troll"] = 2;
M["Dracul"] = 3;
M["Snowy"] = 4;
M["Hexadecimal"] = 5;
M["Cleo"] = 6;
}
int aabs(int x) {
if (x < 0) x = -x;
return x;
}
int main() {
int n;
string str... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, w = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x * w;
}
inline long long min(long... | 4 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,n;
cin>>a>>b>>n;
long long x=min(b-1,n);
cout<<(a*x)/b - a*(x/b)<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<boo... | 0 |
#include <bits/stdc++.h>
using namespace std;
int dx[2] = {0, 1}, dy[2] = {1, 0};
map<char, int> m;
int main() {
int n;
string s;
cin >> n >> s;
int x = 0, y = 0, cur = -1, ans = 0;
m['U'] = 1;
m['R'] = 0;
for (int i = 0; i < n; i++) {
char c = s[i];
x += dx[m[c]];
y += dy[m[c]];
if (x < y... | 2 |
#include <bits/stdc++.h>
using namespace std;
int numbers[100 + 8], saved[100 + 8];
int binReverse(int x) {
char tmp[100 + 8];
memset(tmp, 0, sizeof tmp);
int len = 0;
while (x > 0) {
if (x % 2 == 0)
tmp[len++] = '0';
else
tmp[len++] = '1';
x /= 2;
}
while (len < 8) tmp[len++] = '0';... | 3 |
#include <bits/stdc++.h>
using namespace std;
int A[1005][1005];
int main() {
int N, M;
cin >> N >> M;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
A[i][j] = 0;
}
}
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
A[x][y] = 1;
A[y][x] = 1;
}
int pivot =... | 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 <bits/stdc++.h>
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template <typename T>
inline bool read(... | 5 |
#include <bits/stdc++.h>
using namespace std;
struct fff {
int num;
int p;
};
fff f[1000001];
struct merges {
int num;
int cnt;
int ncnt;
};
merges m[1000001];
long long sum[1000001];
bool cmp(fff a, fff b) {
if (a.num == b.num) return a.p < b.p;
return a.num < b.num;
}
int main() {
int n, k;
long lon... | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repp(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
char c[1010];
int main() {
cin >> n >> c;
for (int i = 0; i < n; i++) {
int l = i - 1, r = i, L = 1, R = 1;
while (l >= 0 && c[l] != 'L') L += c[l--] == 'R';
while (r <= n - 2 && c[r] != 'R') R += c[r++] == 'L';
cout << max(L, R) << " ";
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int n, a[maxn], lazy[maxn << 2], s[maxn], b[maxn];
vector<int> v1, v2;
pair<int, int> seg[maxn << 2];
long long ans;
void build(int l, int r, int id) {
seg[id] = {maxn, r - l};
if (r - l == 1) return;
int mid = (l + r) >> 1, left = id << 1, ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m = 0, num, i, j;
cin >> n;
string s;
while (n > 0) {
m = max(n % 10, m);
s.push_back(n % 10 + '0');
n /= 10;
}
reverse(s.begin(), s.end());
cout << m << endl;
n = s.length();
for (j = 0; j < m; ++j) {
num = 0;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int arr[n + 1];
for (int i = 1; i <= n; i++) cin >> arr[i];
sort(arr + 1, arr + n + 1);
if (abs(arr[b] - arr[b + 1]) == 0)
cout << 0 << endl;
else
cout << arr[b + 1] - arr[b] << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, k;
cin >> n >> k;
string ch;
cin >> ch;
long long int x = -1, x1 = -1, y2 = -1;
vector<long long int> mark(n, 0);
bool check = false, check1 = false;
long lo... | 3 |
#include <bits/stdc++.h>
using std::pair;
using std::vector;
using Permutation = std::vector<size_t>;
using Cycle = std::vector<size_t>;
Permutation ReadInput(std::istream& in_stream = std::cin);
void WriteError(std::ostream& out_stream = std::cout);
void WriteAnswer(const Permutation& permutation,
std... | 5 |
#include <bits/stdc++.h>
using namespace std;
int N, ans, psum[101], a;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a;
psum[i] = psum[i - 1] + a;
}
for (int i = 0; i <= N; i++) {
ans = max(ans, N - (((N - i) - (psum[N] - psum[i])) + psum[i]));
}
cout << ans << "\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 1;
vector<int> g[maxn];
int sz[maxn];
long long sumr[maxn], sumt[maxn];
long long cntt[maxn][2], cntr[maxn][2];
long long ans = 0;
void dfs(int v, int p = 0) {
sz[v] = 1;
cntr[v][0] = 1;
for (int x : g[v]) {
if (x != p) {
dfs(x, v);
... | 5 |
// https: //onlinejudge.u-aizu.ac.jp/courses/lesson/8/ITP2/4/ITP2_4_A
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int n;
std::cin >> n;
std::vector<int> A(n);
for (auto &x : A)
{
std::cin >> x;
}
int q;
std::cin >> q;
for (int i = 0; i < q; i++... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.