solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int solve() {
double x1, y1, r1, x2, y2, r2, d;
cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2;
d = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
double ans;
if (d > r1 + r2) {
ans = (d - r1 - r2) / 2;
} else {
double xr = max(r1, r2);
double nr = mi... | 2 |
#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
map<ll,int> t;
int cnt;
const int N=2e5+5;
int n;ll k,a[N]={0},as[N];
int bit[N]={0};
void add(int x,int val) {
while(x<cnt) bit[x]+=val,x+=x&-x;
}
int sum(int x) {
int s=0;while(x) s+=bit[x],x-=x&-x... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxN = 1e5 + 5;
const long long N = 1e6;
int n;
int a[8], b[maxN];
int d[maxN][8];
vector<int> v;
int id[maxN];
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
greater<pair<long lo... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[1010], nxt[1010][10][1010];
int cnt[10], n, dp[260][10], num;
inline bool check(int len) {
num = 0;
if (len * 8 > n) return false;
for (int i = 0; i < 256; i++)
for (int j = 0; j <= 8; j++) dp[i][j] = 0x3f3f3f3f;
dp[0][0] = 1;
for (int mask = 0; mask < 2... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T getint() {
T x = 0, p = 1;
char ch;
do {
ch = getchar();
} while (ch <= ' ');
if (ch == '-') p = -1, ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x * p;
}
template <typename T1, typena... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, arr[100005], i, c, arr2[100005];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
arr2[i] = arr[i];
}
c = 0;
sort(arr, arr + n);
for (i = 0; i < n; i++) {
if (arr[i] != arr2[i]) c++;
}
if (c <= 2)
printf(... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
inline long long rd() {
long long x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = getchar();
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, res;
long long a[1507][1507], d[1507][1507], sum[1507][1507], maxprefix[1507][1507],
maxsuffix[1507][1507];
int main() {
scanf("%I64d %I64d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf("%I64d", &a[i][j]);
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 4e3 + 9;
int a[Maxn];
int iabs(int x) { return x > 0 ? x : -x; }
int main() {
int n;
cin >> n;
for (int i = 1; i <= (n << 1); ++i) {
int x, y;
scanf("%d.%d", &x, &y);
a[i] = y;
}
int c = 0;
int s = 0;
for (int i = 1; i <= n * 2; ++... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline int gi() {
int f = 1, sum = 0;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
sum = (sum << 3) + (sum << 1) + ch - '0';
ch = getchar();
}
return f * sum;
}
co... | 3 |
#include <iostream>
using namespace std;
int main(void){
int n;
int sum;
int max,min;
while(1){
max = 0;
min = 500;
cin >> n;
if( n == 0 ) break;
for( int i = 0 ; i < n ; i++ ){
sum = 0;
int s[5];
for( int j = 0 ; j < 5 ; j++ ){
cin >> s[j];
sum += s[j];
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct segmento {
int x0, y0, x1, y1;
segmento(int a, int b, int c, int d) {
x0 = min(a, c);
x1 = max(a, c);
y0 = max(b, d);
y1 = min(b, d);
}
};
struct Evento {
int x, y;
bool e;
Evento(int a, int b, bool c) { x = a, y = b, e = c; }
bool isEnt... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
vector<int> d[MAXN];
set<pair<int, int> > S;
long long l, r, curl, curr, n, m;
void ins(int x) {
for (int dx : d[x]) S.insert({dx, x});
}
void del(int x) {
for (int dx : d[x]) S.erase({dx, x});
}
int main() {
for (int i = 1; i < MAXN; i++)
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> l, c, m;
set<int> s;
int i, j, k, coun;
for (i = 0; i < 6; i++) {
cin >> k;
l.push_back(k);
s.insert(k);
}
for (i = 0; i < 6; i++) {
if (l[i] > 9) {
cout << "Alien\n";
return 0;
} else
continue;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p; cin >> n >> p;
string s; cin >> s;
long long ans = 0;
if (p == 2 or p == 5) {
for (int i = 0; i < n; i++)
if ((s[i] - '0') % p == 0) ans += i + 1;
} else {
map<int, int> mp;
mp[0] = 1;
int sum = 0, power = 1;
for (int i = n - 1; i >... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, n, k, count = 0, sum = 0;
cin >> n >> k;
long long int a[n];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (i = 0; i < k; i++) {
if (a[i] < 0) sum += a[i];
}
cout << abs(sum);
}
| 2 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int sum = 0;
int temp = 0;
for (int i = 0; i < n; i++) {
for (int j = temp; j < n; j++) {
if (a[j] == sum + 1) {
sum++;
temp = j;
}
}
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int A[9] = {0}, B[9] = {0}, n, m, i, mi1, mi2, miravn;
cin >> n >> m;
mi1 = 10;
mi2 = 10;
miravn = 10;
for (i = 0; i < n; i++) {
cin >> A[i];
if (A[i] < mi1) mi1 = A[i];
}
for (i = 0; i < m; i++) {
cin >> B[i];
... | 1 |
#include <cstdio>
int k,s,ans;
int main()
{
scanf("%d%d",&k,&s);
for(int i=0;i<=k;++i)
for(int j=0;j<=k;++j)
if(i+j<=s&&s<=i+j+k)
++ans;
printf("%d",ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 0;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') f = 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + ch - 48;
return f ? -x : x;
}
int a[7], b[7], m;
struct m... | 5 |
#include<iostream>
using namespace std;
int main(){
int a;
int coin[]={500,100,50,10,5,1};
cin>>a;
while(a!=0){
a=1000-a;
int total=0;
int sheet=0;
for(int i=0;i<6;i++){
sheet=a/coin[i];
a=a%coin[i];
total+=sheet;
}
cout<<total<<endl;
cin>>a;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct Box {
char g[6];
Box() {}
Box(char gem[6]) {
for (int i = 0; i < (int)(6); i++) g[i] = gem[i];
}
bool operator==(Box &r) const;
};
void rotX(char b[]) {
char tmp = b[1];
b[1] = b[5];
b[5] = b[4];
b[4] = b[2];
b[2] = tmp;
}
void rotY(char b[]) ... | 1 |
#include <stdio.h>
const int N=1e3+10;
int main(){
int n,a,b,dp[N];
while(true){
scanf("%d",&n);
if(n==0)return 0;
dp[0]=1;
for(int i=1;i<N;i++)dp[i]=0;
while(n--){
scanf("%d%d",&a,&b);
for(int i=N-1;i>=0;i--)for(int j=1;j<=b;j++)if(j*a<=i)dp[i]+=d... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
char a[200005], b[200005];
int main() {
cin >> n >> k;
getchar();
for (int i = 1; i <= n; ++i) {
a[i] = getchar();
if (i <= k) b[i] = a[i];
}
bool gg = 0, flag = 0;
b[0] = b[k];
for (int i = 1; i <= n; ++i) {
if (b[i % k] - a[i] > 0) gg =... | 1 |
#include <bits/stdc++.h>
int trie[100005][27];
char ch[100005];
int dfs(int n) {
if (n == -1) return 1;
int f1 = 0, f2 = 0, f3 = 0, f4 = 0;
int sum = 0;
for (int i = 1; i <= 26; i++) {
if (trie[n][i] == -1) continue;
sum++;
int res = dfs(trie[n][i]);
if (res == 1) {
f1 = 1;
} else if (... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxv = 402, maxe = 2 * (5000 + 800);
struct Graph {
int head[maxv];
int next[maxe];
int to[maxe];
int cf[maxe];
int w[maxe];
int k;
int n;
Graph(int _n = 0) : n(_n) { clear(); }
void clear() {
memset(head, -1, sizeof(head));
k = 0;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct song {
double p;
int len;
};
struct Less {
bool operator()(const song& a, const song& b) {
return (a.len * a.p / (1 - a.p) > b.len * b.p / (1 - b.p));
}
};
int main() {
int n;
double ans = 0;
double added = 0;
song temp[50001];
scanf("%d", &n);
... | 5 |
#include <bits/stdc++.h>
using namespace std;
class UnionFind {
private:
public:
vector<int> p, rank, setSize, minn;
int numSets;
UnionFind(int N) {
setSize.assign(N, 1);
numSets = N;
rank.assign(N, 0);
p.assign(N, 0);
minn.resize(N);
for (int i = 0; i < N; i++) {
p[i] = i;
m... | 6 |
#include <bits/stdc++.h>
using namespace std;
char a[100][100];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
}
}
int r;
for (r = 0; r < n; ++r) {
int cnt = 0;
for (int c = 0; c < m; ++c) {
if (a[r][c] == '*') {
... | 1 |
#include <bits/stdc++.h>
long long gcd(long long a, long long b) {
if (b == 0) return abs(a);
return gcd(b, a % b);
}
int upcmpii(const void *a, const void *b) {
return (*(int *)a == *(int *)b ? 0 : (*(int *)a > *(int *)b ? 1 : -1));
}
void sort_ui(int *a, int n) { qsort(a, n, sizeof(int), upcmpii); }
int n;
int ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
char s[100010];
int main() {
scanf("%d%d%d", &n, &m, &k);
bitset<22500> a, b, e, c;
for (int i = 0; i < n; i++) {
scanf("%s", s);
for (int j = 0; j < m; j++)
(s[j] == '#' ? b : a).set(i * m + j),
(s[j] == 'E' ? e.set(i * m + j) : 0... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200 * 1000 + 10;
int n, m, u, v, amoo[maxn][3];
bool mark[maxn], park[maxn];
vector<pair<int, int> > vec[maxn];
vector<pair<pair<int, int>, int> > ans;
void dfs(int x) {
park[x] = 1;
int hlp;
for (int i = ((int(vec[x].size()))) - 1; i >= 0; i--) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long board[1001][1001];
int lim = 500;
int size = 0;
int n, k;
bool good = true;
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> k;
board[lim][lim] = n;
while (good) {
good = false;
for (int i = lim - size; i <= lim + size; ++i) {
for (int ... | 4 |
#include<stdio.h>
int main(){
int n,i,j,sum=0;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i!=j){
sum+=a[i]*a[j];
}
}
}
printf("%d",sum/2);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 200000 + 10;
struct Person {
int e, p;
} arr[MaxN];
bool cmpE(Person a, Person b) { return a.e < b.e; }
bool cmpP(Person a, Person b) { return a.p > b.p; }
int n, k, sl;
long long ans;
int sc;
bool exist() {
int v = 0;
for (int i = 1; i <= n; ++i)
... | 3 |
#pragma GCC optimize( ofast )
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
#define rep(i,a,b) for(ll i = a; i<b;i++)
#define per(i,a,b) for(ll i = a; i>=b; i--)
#define inf LLONG_MAX
#define all(x) x.... | 0 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long n, m;
cin >> n >> m;
long long x = 0, y = 0, c = 0, d = 0;
vector<vector<long long>> a(n, vector<long long>(m)),
b(n, vector<long long>(m));
for (vector<long long>& i : a)
for (long long& j : i) {
cin >> j;
}
for (ve... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int test;
cin >> test;
long long d, m;
while (test--) {
cin >> d >> m;
long long ans = 1;
for (int i = 0; i < 30; i++) {
if (d < (1LL << i)) break;
ans = ans * (m... | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[100010], n, b[100010];
int main() {
cin >> n;
for (int i = 0; i <= n - 1; i++) {
scanf("%d", &a[i]);
a[i]++;
}
if (n == 1) {
printf("0\n");
return 0;
}
b[0] = a[0];
for (int i = 1; i <= n - 2; i++) {
b[i] = max(b[i - 1], max(a[i], a[i... | 3 |
#include <bits/stdc++.h>
using namespace std;
int a[200000], ans[200000], col[200000], n;
inline int get(int x) {
memset(col, 0, sizeof(col));
int cnt = 0, ans = 1;
for (int i = 1; i <= n; i++) {
if (col[a[i]] == ans) continue;
cnt++;
col[a[i]] = ans;
if (cnt > x) {
ans++;
cnt = 1;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = MOD + 2;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
long long r;
while (b) ... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<string, int> defExprList;
int brackets[1005];
int checkLevel(char *val, int fromPos, int toPos) {
if (fromPos > toPos) return 0;
int ansLeft, ansRight;
int bCnt = 0;
bCnt = 0;
for (int currPos = toPos; currPos >= fromPos; --currPos) {
bCnt += val[currPos] ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2000 + 10;
const int Mod = 1000000007;
int n, m;
int C[MAX][MAX];
int f[MAX][MAX], f2[MAX][MAX];
int sum[MAX], sum2[MAX];
int main() {
int i, j, k;
C[0][0] = 1;
for ((i) = (1); (i) != (MAX); ++(i)) {
C[i][0] = 1;
for ((j) = (1); (j) <= (i); ++(... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, x[200000], s = 0, a = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i];
s = s + x[i];
}
for (i = 0; i < n; i++) {
a = a + x[i];
if (a >= s / 2 && s % 2 == 0)
break;
else if (s % 2 != 0 && a >= s / 2 + 1)
bre... | 1 |
#include <bits/stdc++.h>
char s[100005], e[100005];
int sum, len, n;
int w[30][30];
int main() {
scanf("%s%s", s, e);
len = strlen(s);
if (len != strlen(e)) {
printf("-1\n");
return 0;
}
scanf("%d", &n);
for (int i = 0; i < 26; i++)
for (int j = 0; j < 26; j++)
if (i != j)
w[i][j] ... | 2 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <set>
using namespace std;
class Solver {
};
int get_value(string s) {
int val = 0;
int tmp = 1;
for (int i = 0; i < s.size(); i++) {
if ('2' <= s[i] && s[i] <= '9') {
tm... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, b1, a2, b2, a3, b3;
scanf("%d %d", &a1, &b1);
scanf("%d %d", &a2, &b2);
scanf("%d %d", &a3, &b3);
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
if (i) swap(a2, b2);
if (j) swap(a3, b3);
if (a2 + a3 <= a1 && ... | 2 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 0 |
//~ author : Sumit Prajapati
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define curtime chrono::high_resolution_clock::now()
#define timedif(start,end) chrono::duration_cast<chrono::nanoseconds>(end - start).count()
auto time0=curtime;
int bin... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int n, k;
cin >> n >> k;
int res = 0;
if (n % k == 0)
res = n;
else {
int a = static_cast<int>(n / k);
res = a * k + min(static_cast<int>(k / 2), n % k);
}
cout << res << endl;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = n - 1; i >= 0; i--) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<pair<int, int>> a1(n + 1), b1(n + 1);... | 3 |
#include <cstdio>
#include <algorithm>
#include <map>
using namespace std;
#define MOD 1000000007
typedef long long ll;
map<pair<ll, ll>, pair<ll, ll> > M;
ll pow2[222222] = { 1 };
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main(void)
{
ll n, i, x, y, tmp = -1, cnt = 1;
scanf("%lld", &n);
while (... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int b, x;
double a, c;
cin >> a >> b >> c;
x = ceil(a * (c / 100));
cout << max(0, x - b) << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main (){
ll n,a[100009],dp[100009];
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
dp[n-2]=abs(a[n-1]-a[n-2]);
dp[n-1]=0;
for(int i=n-3;i>=0;i--)
dp[i]=min(abs(a[i+2]-a[i])+dp[i+2],abs(a[i+1]-a[i])+dp[i+1]);
cout<<dp[0]<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > mat, pom;
vector<string> sol, msol;
void addintos(string &s, int a) {
string drugi;
do {
char c = a % 10 + 48;
drugi.push_back(c);
a /= 10;
} while (a);
reverse(drugi.begin(), drugi.end());
for (int i = 0; i < drugi.size(); i++) s.... | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
using pii = pair<long long, long long>;
template <typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using Prior = priority_queue<T>;
const long long INF = 1E18;
const long long mod = 1E9 + 7;... | 1 |
#include <cstdio>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", (c / a) * b);
return 0;
} | 0 |
#include <bits/stdc++.h>
inline int getint() {
int x = 0, p = 1;
char c = getchar();
while (c <= 32) c = getchar();
if (c == 45) p = -p, c = getchar();
while (c > 32) x = x * 10 + c - 48, c = getchar();
return x * p;
}
using namespace std;
long long n, m, k;
int main() {
scanf("%I64d%I64d%I64d", &n, &m, &... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool bipartite;
vector<int> par;
vector<int> pard;
vector<int> rankk;
vector<bool> undo_bipartite;
vector<int> undo_par;
vector<int> undo_rankk;
pair<int, int> find(int i) {
int d = 0;
while (par[i] != -1) {
d ^= pard[i];
i = par[i];
}
return {i, d};
}
void ... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long pow1(long long n, long long p) {
if (p == 0) return 1;
long long x = pow1(n, p / 2);
x = (x * x) % 1000000007;
if (p % 2 == 0)
return x;
else
return (x * n) % 1000000007;
}
long long binarySearch(long long arr[], long long l, long long r, long lo... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, p, t, a, x;
cin >> n >> p;
list<int> l[n];
list<int>::iterator it;
while (p--)
{
cin >> t;
if (t == 0)
{
cin >> a >> x;
l[a].push_back(x);
}
if (t == 1)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
int main() {
long long re... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 3e5 + 5;
long long n, m, ans, sum, sum2;
void solve() {
cin >> n;
vector<long long> a(n + 1);
map<long long, long long> m1;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
m1[sum] = 1;
}... | 4 |
#include <iostream>
#include <vector>
using namespace std;
int dp[21][11][156];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k,s;
while(cin >> n >> k >> s,n){
vector<vector<vector<int> > > dp(n+1,vector<vector<int> >(k+1,vector<int>(s+1,0)));
for(int i = 0;i < n;i++)dp[i][0][0] = 1;
for(int ... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >>s;
set<char> st;
for(auto i : s)st.insert(i);
cout << (st.size() == s.size() ? "yes" : "no") << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int inf = 0x7FFFFFFF;
template <class T>
inline void checkmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
... | 2 |
#include<bits/stdc++.h>
#define N 100005
using namespace std;
int d[N],n,m,x,y,q[N],f,r,has[N],ans;
vector<int> v[N];
int main()
{
scanf("%d%d",&n,&m);
while(m--)
{
scanf("%d%d",&x,&y);
x--;y--;
v[x].push_back(y);
has[y]++;
}
for(int i=0;i<n;i++)
if(!has[i])
q[r++]=i;
while(f<r)
{
x=q[f++];
for(int... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, z, w, tmp, ans;
long long A[1005], x, y, k;
map<long long, int> M, P;
map<int, int> Q;
int main() {
scanf("%d", &n);
for (int i = (0); i < (n); i++) {
scanf("%I64d", &A[i]);
M[A[i]]++;
P[A[i]]++;
}
sort(A, A + n);
for (int i = (0); i < (n); i... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
const long long int INFLL = 1e18 + 10;
const long double EPS = 1e-8;
const long double EPSLD = 1e-14;
const long long int MOD = 1e9 + 7;
template <class T>
T &chmin(T &a, const T &b) {
return a = min(a, b);
}
template <class T>
T &chmax(T &a, con... | 4 |
#include <stdio.h>
int main(){
int n,m,x,y,a[31];
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)a[i]=i;
for(int i=0;i<m;i++){
scanf("%d,%d",&x,&y);
a[0]=a[x];
a[x]=a[y];
a[y]=a[0];
}
for(int i=1;i<=n;i++){
printf("%d\n",a[i]);
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=155;
int n,k,mod;
int f[maxn][maxn][maxn];
map<pi... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
int co = 0;
for (int i = 0; i < n - 1; i++) {
if (i == 0) co += arr[i];
co += ((abs(arr[i] - arr[i + 1])) + 1);
}
co += n;
if (n == 1) co = 2;
cout << co << endl... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct Node {
string oper;
bool val;
int left = -1;
int right = -1;
bool will_left_change = false;
bool will_right_change = false;
};
vector<Node> tree;
bool f(bool l_val, bool r_val, string oper) {
if (oper == "AND") {
return (l_val && r_val);
} else if... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int count = 0;
for (int i = 0; i <= 100; i++) {
int last_digit = n % 10;
if (abs(last_digit) == 8) {
if (count != 0) {
cout << count << endl;
break;
}
} else {
long long remain = abs(n... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10, lg = 22;
vector<pair<int, pair<int, int> > > edge;
vector<pair<int, int> > g[MAX];
int h[MAX], f[MAX], par[MAX][lg], ans[MAX][lg];
int root(int v) { return f[v] < 0 ? v : f[v] = root(f[v]); }
bool merge(int a, int b) {
if ((a = root(a)) == (b = r... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
vector<int> v;
for (int i = 0; i < q; i++) {
int x, y;
cin >> x;
if (x == 0) {
cin >> y;
v.push_back(y);
}
if (x == 1) {
cin >> y;
cout << v.at(y) << endl;
}
if (x == 2)
v.pop_b... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
int n, m;
string str;
while (cin >> n, n){
cin >> m >> str;
int cnt = 0, res = 0;
for (int i = 1; i < m-1; i++){
if (str[i-1] == 'I' && str[i] == 'O' && str[i+1] == 'I') {
cnt++;
i++;
}
else cnt = 0;
if (n <= cnt) ... | 0 |
#include <bits/stdc++.h>
template <typename T>
bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
using ll = long long;
const int MN = 55, MD = 105;
int N, M, K;
struct Subj {
public:
ll a;
int d, c, id;
bool operator<(const Subj& o) const { return c < o.c; }
} a[MN];
ll dp[MN][MN][MD];
int pr[MN][M... | 3 |
#include <bits/stdc++.h>
using namespace std;
int m, n, j, k, l, i, o, p, __t, mod;
long long step[700][700], In[700], Out[700], Repre[700], In_num, Out_num;
int L[700 * 700], op, ed, inque[700], deg[700];
long long Way[700];
char ch;
void read(int &a) {
for (ch = getchar(); (ch < '0' || ch > '9') && (ch != '-'); ch ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
char s[1000];
scanf("%s", s);
int i, j, max = strlen(s);
int l = max;
for (i = 0; i <= l; i++) {
int count = 0;
int countl = 0;
int countr = 0;
int count1 = 0;
for (j = 0; j ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
if ((n & 1) == 1)
cout << "black";
else
cout << "white\n1 2";
}
| 4 |
#include <bits/stdc++.h>
int main() {
int n;
double a, d, t, v, x, y;
while (scanf("%d%lf%lf", &n, &a, &d) != EOF) {
y = 0.0;
while (n--) {
scanf("%lf%lf", &t, &v);
if (d - v * v / 2 / a > 0)
x = t + v / a + (d - v * v / 2 / a) / v;
else {
x = t + sqrt(2 * d / a);
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long linf = 1e18 + 5;
int mod = (int)1e9 + 7;
const int logN = 18;
const int inf = 1e9 + 9;
const int N = 2e5 + 6;
int n, m, x, y, z, t, root[N], p[N];
long long ans;
vector<pair<int, pair<int, int> > > v;
int findset(int x) { return root[x] = root[x] == x ? x : ... | 6 |
#include<iostream>
#include<cmath>
using namespace std;
int N_MAX = 100000;
int main()
{
int k,i;
long long ma=2,mi=2,t;
long long a[N_MAX];
cin >> k;
for(i=0;i<k;i++)
cin >> a[i];
for(i=k-1;i>=0;i--){
t=ma/a[i];
if(t*a[i]<mi){
cout << "-1" << endl;
return 0;
}
ma=(t+1)*a[i]-... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}
void out(pair<int,char> a[],int n){
lp(i,n){
if(i!=0) cout<<" ";
cout<<a[i].second<<a[i].first;
}
cout<<endl;
return;
}
int main(){
int n;
cin>>n;
pair<int,char>... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
const long long INF = 1e15;
int n, m, k;
vector<pair<int, int> > added;
long long dist[N];
int parent[3][N], sz[3][N];
void initDSU() {
iota(parent[1], parent[1] + N, 0);
iota(parent[2], parent[2] + N, 0);
fill(sz[1], sz[1] + N, 1);
fill(sz[2... | 4 |
#include <bits/stdc++.h>
namespace Quick_Function {
template <typename Temp>
void Read(Temp &x) {
x = 0;
char ch = getchar();
bool op = 0;
while (ch < '0' || ch > '9') {
if (ch == '-') op = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getcha... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int mod = 1e9 + 7;
long long a[maxn];
int w[maxn];
vector<long long> E[maxn];
void solve() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
E[i].clear();
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int a[100006], low[100006], high[100006];
int main() {
int n;
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
low[1] = 0, low[2] = 1;
for (int i = 2; i <= n - 1; i++) {
if (a[i] > a[i - 1])
low[i + 1] = low[i] + 1;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long double N,P;
long ans;
cin >> N >> P;
ans = (long)pow(P,1/N);
while((long)P % (long)pow(ans,N) != 0){
ans--;
}
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define INF 1e+100
#define vint vector<int>
#define abs(x) ((x)>=0?(x):-(x))
using namespace std;
int main()
{
int n;
cin >> n;
int MAX_N = (1 << n), ID[n], d[n], box[n];
rep (i, n )
cin >> ID[i] >> d[i] >> box[i];
double dp[n][MA... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
const int M = 33;
const int K = 670000;
const int LIT = 2500;
const int INF = 1 << 30;
const int base = 137;
const double eps = 1e-10;
const int dir[5][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
const int dir2[10][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1},
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
int n, b;
while (scanf("%d", &n) != EOF) {
b = 0;
int ans;
scanf("%d", &ans);
for (int i = 1; i < n; i++) {
scanf("%d", &b);
ans = gcd(ans, b);
}
printf("%d\n",... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, h, cnt = 0;
char old;
cin >> n;
cin >> s;
n = s.length();
old = s[0];
for (int i = 1; i < n; i++) {
if (old == s[i]) {
cnt = cnt + 1;
} else {
old = s[i];
}
}
cout << cnt;
return 0;
}
| 1 |
//Love and Freedom.
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define ll long long
#define inf 20021225
using namespace std;
int read()
{
int s=0,t=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') t=-1; ch=getchar();}
while(ch>='0' && ch<='9') s=s*10+ch-'0',ch=getchar();
return s... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[505][505];
memset(arr, -1, sizeof arr);
int n, m;
cin >> n >> m;
vector<int> x(n);
for (int i = 0; i < n; ++i) scanf("%d", &x[i]);
for (int i = 0; i < m; ++i) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
--a, --b;
arr[a][b... | 1 |
#include <bits/stdc++.h>
using namespace std;
char c[1000001];
int a[1000001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
int s1 = 0, s2 = 0;
for (int i = 1; i <= n; i++) {
if (c[i] == '(') {
if (s1 <= s2) {
s1++;
a[i] = 0;
} else {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c;
void move1step(int& a, int& b, const int& q) {
int c = a - q * b;
a = b;
b = c;
}
int eGCD(int r0, int r1, int& x0, int& y0) {
int x1 = y0 = 0, y1 = x0 = 1;
while (r1) {
int q = r0 / r1;
move1step(r0, r1, q);
move1step(x0, x1, q);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n % 3 == 0) {
cout << n / 3 * 2;
}
if (n % 3 > 0) {
cout << (n - 1) / 3 * 2 + 1;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long dp[107][107][107], f[107], pd[107], n, k;
string s;
const long long mod = 1e9 + 7;
long long pw(long long a, long long b) {
if (b == 0) return 1LL;
if (b == 1) return a;
long long ret = pw(a, b / 2);
if (b % 2 == 0) return ret * ret % mod;
return ret * r... | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.