solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const long long MAX = (1 << 18);
struct BIT {
vector<long long> v;
long long sz;
void Resize(long long len) {
sz = len;
v.resize(sz, 0);
}
void Update(long long idx, long long val) {
for (; idx < sz; idx += idx & -idx) v[idx] += val;
}
long long qu... | 5 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main() {
int n;
cin >> n;
n *= 2;
cin >> s >> t;
int num = 0, fir = 0, sec = 0;
for (int i = 0; i < n; i++)
if (s[i] == '1') {
if (t[i] == '1')
num++;
else
fir++;
} else if (t[i] == '1')
sec++;
if (num... | 1 |
#include <bits/stdc++.h>
using namespace std;
int static dp[105][55][55][2];
int fun(int a[], int i, int n, int e, int o, bool p) {
if (i <= 0) return 0;
if (dp[i][e][o][p] != -1) return dp[i][e][o][p];
if (a[i - 1] == -1) {
if (i == n) {
if (e == 0) return dp[i][e][o][p] = fun(a, i - 1, n, e, o - 1, 1)... | 1 |
#include <bits/stdc++.h>
using namespace std;
string tobin(int n) {
string ret = "";
while (n > 0) {
ret += to_string(n % 2);
n /= 2;
}
while (ret.size() < 8) ret += '0';
return ret;
}
int toint(string s) {
int ret = 0;
for (int i = 0; i < 8; i++) {
ret += (s[i] - '0') * (1 << i);
}
return... | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<utility>
#include<list>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const ll p=924844033;
const ll g=5;
ll fp(ll a,ll b)
{
ll s=1;
while(b)
{
if(b&1)
s=s*a%... | 0 |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, m;
unsigned long long p, f[20], s[20], an;
int main() {
scanf("%I64u", &p);
f[0] = 0;
s[0] = 1;
for (i = 0; i <= 18; i++)
for (j = 0; j <= 9; j++) {
s[i + 1] = (s[i + 1] + s[i]) % p;
f[i + 1] = (s[i] * j + f[i] + f[i + 1]) % p;
}
a... | 3 |
#include <bits/stdc++.h>
template <class T>
inline void read(T &x) {
char c;
int f = 1;
x = 0;
while (((c = getchar()) < '0' || c > '9') && c != '-')
;
if (c == '-')
f = -1;
else
x = c - '0';
while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
x *= f;
}
int outn;
char out[100000... | 3 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(i,n) reps(i,0,n)
#define rept(i,n) rep(i,(n)+1)
#define repst(i,s,n) reps(i,s,(n)+1)
#define reprt(i,n,t) for(int (i)=(n);(i)>=(t);--(i))
#define repr(i,n) reprt(i,n,0)
#define each(itr,... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PI;
const double EPS=1e-6;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) (a).begin(),(a).end... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int n, sum = 0, count = 0, m, flag = 1, ans = 0, k;
cin >> n >> k;
if (k == 1) {
cout << n;
return 0;
}
vector<long long int> v, c, d;
m = n;
while (m) {
ans ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int ans, r, c, n, k, p, x, y;
int dpx[15][15], dpr[15][15], dpc[15][15];
int main() {
cin >> r >> c >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x >> y;
dpx[x][y] = 1;
dpr[x][y] = 1;
dpc[x][y] = 1;
}
for (int i = 1; i <= r; i++) {
for (int j =... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long x, y, n;
int main() {
cin >> x >> y >> n;
long long nu = -1, de = -1;
for (long long i = 1; i <= n; ++i) {
long long b = i, a = x * b / y;
if (nu == -1 && de == -1)
nu = a, de = b;
else if (abs(x * de - y * nu) * b > abs(x * b - y * a) * de... | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
ll n, x;
struct N {
ll b, l, u;
};
vector<N> ns;
vector<ll> ss;
ll sub = 0;
bool operator<(const N &l, const N &r) {
return l.b * l.... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
int cnt1 = 0, cnt2 = 0;
scanf("%d%d%d", &a, &b, &x);
if (a > b) {
for (int i = 0; i < x + 1; i++) {
if (i % 2 == 0) {
printf("0");
if (!cnt1) {
for (int i = 0; i < a - (x + 2) / 2; i++) printf("0");
... | 2 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7,N=5005;
int f[N][N];
signed main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=m;++i)
f[0][i]=1;
for(int i=1;i<=n;++i){
for(int j=2;j<=m;++j)
f[i][j]=(f[i][j-1]*2ll+f[i-1][j-1]*(j-1)%mod)%mod;
for(int j=1;j<=m;++j)
f[i][j]=(f... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long a[100010], x[30][100010], ans;
int n;
int num[30];
map<long long, bool> vis;
map<long long, bool> pd[100010];
int main() {
scanf("%d", &n);
long long sumx = 0;
for (int i = 1; i <= n; i++) {
scanf("%I64d", &a[i]);
sumx = sumx | a[i];
if (!vis[sum... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 100005, INF = 2000000000000000000;
long long power(long long a, long long b, long long p) {
if (a == 0) return 0;
long long res = 1;
a %= p;
while (b > 0) {
if (b & 1) res = (res * a) % p;
b >>= 1;
a = (a * a) % p;
}
return res;
}... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
template <class T>
T SQR(const T &a) {
return a * a;
}
struct vert {
vector<int> inc;
bool was;
int f;
int h;
int comp;
vert() {
was = 0;
h = 0;
}
} g[100100];
struct vertLCA {
vector<int> inc;
int up[20];
bool was... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long sums[30000], dp[25][3000][25], can[3000], n, i, j, k, x, y, a[300];
int main() {
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
reverse(a, a + n);
for (i = 0; i < n; i++)
if (a[i] == 1) {
k = i;
break;
}
if (k == 0) ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> a >> b;
n = a + b + 1;
if (a != 0) {
cout << 1 << ' ';
for (int i = 0; i < a; i++) cout << b + 2 + i << ' ';
for (int i = 0; i < b; i++) cout << b + 1 - i << ' ';
cout << endl;
} else {
cout << n << ' ';
for... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int P = 998244353;
const int MAXN = 4050;
int n, K, l;
inline int add(int x, int y) {
x += y;
if (x >= P) x -= P;
return x;
}
inline long long ksm(long long x, long long y) {
long long ans = 1;
while (y) {
if (y & 1) ans = ans * x % P;
x = x * x % P;... | 6 |
#include <bits/stdc++.h>
using namespace std;
int max(int i, int j) { return i > j ? i : j; }
vector<int> v1, v2;
char c[25][25];
int minx, miny, a, b, ans, f;
int ju(int x1, int y1, int x2, int y2, int x, int y) {
char cp1[25][25], cp2[25][25];
int i, j, flag1 = 0, flag2 = 0, flag3 = 0, flag4 = 0;
for (i = 0; i ... | 2 |
#include <bits/stdc++.h>
int main() {
int n;
char seats[1000][4];
char dummy;
scanf("%d", &n);
scanf("%c", &dummy);
for (int i = 0; i < n; i++) {
scanf("%c%c|%c%c", &seats[i][0], &seats[i][1], &seats[i][2], &seats[i][3]);
scanf("%c", &dummy);
}
int row = -1, col = -1;
for (int i = 0; i < n; i+... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int fx[8] = {0, -1, -1, -1, 0, 1, 1, 1};
const int fy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int maxn = 310;
int vis[maxn][maxn][8][30];
int v[maxn][maxn];
int step[40];
queue<pair<int, int> > q;
pair<int, int> mkstate(int x, int y, int d, int t) {
return make_pair... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int sz[N], n;
vector<int> g[N];
void dfs(int u, int p = 0) {
sz[u] = 1;
for (int e : g[u]) {
if (e != p) {
dfs(e, u);
sz[u] += sz[e];
}
}
}
int get_centroid(int u, int tree_size, int p = 0) {
for (int e : g[u]) {
if (e !... | 2 |
#include <bits/stdc++.h>
using namespace std;
int dp[101][4][2];
int main()
{string s; cin >> s;
int n = s.size();
int K; cin >> K;
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i)
{auto D = s[i] - '0';
for (int j = 0; j <= K; ++j)
{for (int k = 0; k < 2; ++k)
{for (int d = 0; d <= 9; ++d)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long int mx = 1000 * 100;
int n;
long long int a[mx];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool flag = 0;
sort(a, a + n);
long long int m;
for (int i = 0; i < n - 1; i++) {
m = 2 * a[i];
if (a[i] < a[i + 1]... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[100000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
long long mx = 0, sm = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sm += a[i];
mx = max(mx, a[i]);
}
long long res = ceil(sm / (float(n) - ... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T max(T a, T b) {
return a > b ? a : b;
}
template <class T>
inline T min(T a, T b) {
return a < b ? a : b;
}
template <class T>
inline T abs(T a) {
return a >= 0 ? a : -a;
}
static const double PI = 3.14159265358979323846;
int main() {
int... | 3 |
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n,m,ans,A[305][305],pw[605];
int guass(int m,int n)
{
int i=0,j=0,r;
while(i<m&&j<n)
{
r=i;
for(int k=i;k<m;k++)if(A[k][j]){r=k;break;}
if(A[r][j])
{
if(r!=i)for(int k=0;k<=n;k++)swap(A[r][k],A[i][k]);
for(int u=i+1;u<m;u++)
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int k;
int n = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
k = s[i] - 'a';
if (k > 13) {
n = n + 26 - k;
} else {
n = n + k;
}
} else {
k = abs(s[i] - s[i - 1]);
... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int num[110] = {0};
int n;
int M = 0, ct = 0;
while (cin >> n){
num[n]++;
ct++;
M = max(M, num[n]);
}
for (int i = 0; i < ct; i++){
if (M == num[i]){
cout << i << "\n";
}
}
return (0);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
typedef long long ll; typedef vector<int> VI;... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, ans;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
k = min(k, n / 2);
long long x = 2 * n - 3;
for (long long i = 0; i < k; i++) {
ans += x;
x -= 4;
}
return cout << ans, 0;
}
| 2 |
#include <bits/stdc++.h>
const long long mod = 1000000007ll;
using namespace std;
long long ar[12];
long long dp[109][12];
long long C[109][109];
int main() {
for (int i = 0; i < 109; i++) C[i][0] = C[i][i] = 1;
for (int i = 1; i < 109; i++) {
for (int j = 1; j < 109; j++) {
C[i][j] = C[i - 1][j] + C[i - ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long n, a, b, k;
cin >> n >> a >> b >> k;
vector<long long> c(n);
for (long long i = 0; i < n; ++i) {
cin >> c[i];
c[i] %= (a + b);
if (c[i] == 0) c[i] = a + b;
c[i] = (c[i] + (a - 1)) / a;
}
sort(c.begin(), c.end());
long... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t, n, m, x, a, b, c, j, q, k = 1, len, i, d, l, sum = 0, cnt, digit;
cin >> n;
long long ar[n + 5], cr[n + 5], br[3000] = {0};
for (i = 0; i < n; i++) {
cin >> ar[i];
cr[i] = ar[i];
}
sort(ar, ar + n, greater<long long>());
for (... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300010;
int v[MAXN];
vector<int> m[MAXN];
int main() {
int n, q;
scanf(" %d %d", &(n), &(q));
int p = 0;
int ans = 0;
int rfrom = 0;
while (q--) {
int t, x;
scanf(" %d %d", &(t), &(x));
if (t == 1) {
++ans;
v[p] = 1;
... | 3 |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int n, K;
long long F[10100000], Inv[10100], Mod = 1000000007;
int Comb[5010][5010];
long long Pow(long long a, long long b){
long long r=1;
while(b){
if(b&1)r=r*a%Mod;
a=a*a%Mod;b>>=1;
}
return r;
}
long long Cal... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.1415926535897932384626433832795028841971693993751;
const long long int maxn = 2 * 1e5 + 1, inf = 1e9 + 1;
string s, t;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s >> t;
if (s == t)
cout << s << endl;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<vector<long long>> dp(n + 1, vector<long l... | 4 |
#include <iostream>
using namespace std;
int main() {
int n, m, i, j;
int sum = 0;
cin >> n >> m;
int a[n][m];
int b[m];
for (i = 0; i<n; i++) {
for (j = 0; j<m; j++) {
cin >> a[i][j];
}
}
for (j = 0; j<m; j++) {
cin >> b[j];
}
for (i = 0; i<n; i++) {
for (j = 0; j<m; j++) {
sum = sum + a[i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, n, m, ans = 0, sum = 0, mx = 0;
string s;
bool f = 0, flag = 0;
cin >> n;
long long int a[n + 2];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
for (i = 1; i <= n - 2; i++) {
if (a[i] + a[i + 1] ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m;
cin >> n >> m;
char c;
bool flag = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> c;
if (c == 'C' or c == 'M' or c == 'Y') flag = true;
}
}
i... | 1 |
#include <iostream>
using namespace std;
int ary[100010]={};
int main(){
int N,M,m,mm,hog,puy,a,b,c;
long long res;
cin>>N>>M;
cin>>m;
for(int i=1;i<M;i++){
cin>>mm;
hog=max(m,mm);
puy=min(m,mm);
for(int j=puy;j<hog;j++){
ary[j]++;
}
m=mm;
}
res=0;
for(int i=1;i<N;i++){
cin>>a>>b>>c;
res+=mi... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N, M;
char s[MAXN];
int sum[MAXN][5];
int main() {
scanf("%s%d", s + 1, &M);
N = strlen(s + 1);
for (int i = 1; i <= N; i++)
for (int j = 0; j < 3; j++) sum[i][j] = sum[i - 1][j] + (s[i] == 'x' + j);
while (M--) {
int l, r;
s... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1LL << 62LL;
const long long mod = 1e9 + 7;
const long long maxn = 200200;
bool cmp(string s, string l) { return s + l < l + s; }
signed main() {
long long n;
cin >> n;
string a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline void read(register int *n) {
register char c;
*n = 0;
do {
c = getchar();
} while (c < '0' || c > '9');
do {
*n = c - '0' + *n * 10;
c = getchar();
} while (c >= '0' && c <= '9');
}
int n, m, k;
vector<int> pos;
int main() {
cin >> n >> m >>... | 2 |
#include <bits/stdc++.h>
int n, m, k;
int main() {
scanf("%d %d %d", &n, &m, &k);
if (n + k < m) {
puts("0.0000");
return 0;
}
double ans = 1;
k++;
for (int i = 1; i <= k; i++) ans *= 1.0 * (m + n + 1 - n - i) / (n + i);
printf("%.4lf\n", 1.0 - ans);
}
| 4 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;++i) cin>>a[i];
int cnt2=0,cnt4=0;
for(int i=0;i<n;++i){
if(!(a[i]%4)) cnt4++;
else if(!(a[i]%2)) cnt2++;
}
cnt2/=2;
if(cnt2+cnt4>=n/2) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long lon... | 3 |
#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... | 0 |
#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
string in;
vector<int> P,A;
int main(){
getline(cin,in);
P.push_back(0);
A.push_back(0);
while(1){
int n = in.find("apple",A.back()+5);
if(n != -1) A.push_back(n);
else break;
}
while(1){
int n = in.find("peach",P... | 0 |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, m, n, l;
char s[100047];
char f[100047];
int main() {
scanf("%s", s);
memset(f, 0, sizeof(f));
n = strlen(s);
for (i = n - 1; i >= 0; i--) f[i] = max(f[i + 1], s[i]);
for (i = 0; i < n; i++)
if (s[i] == f[i]) printf("%c", s[i]);
printf("\n");
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long Mod = 1e18;
long long n;
signed main() {
scanf("%lld", &n);
long long L = n - (Mod % n * 9 % n * 9 % n) % n, R = (Mod + L - 1);
printf("%lld %lld\n", L, R);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int p[10002][2][500], t[500];
bool an[500];
pair<int, int> in[10000];
int pa(int u, int *t) {
if (u == t[u])
return u;
else
return t[u] = pa(t[u], t);
}
void ad(int a, int b, int *t) {
int x = pa(a, t), y = pa(b, t);
t[x] = y;
}
void cp(int *a, int *b) {
f... | 4 |
#include <bits/stdc++.h>
using namespace std;
int i, n, j, m, la, lb, k, bo, v[2200], ans[2200], x, l;
char a[1200000], b[1200];
bool check() {
for (int i = 1; i <= k; ++i) {
if (v[i] < ans[i]) return 1;
if (v[i] > ans[i]) return 0;
}
return 0;
}
int main() {
gets(a + 1);
gets(b + 1);
scanf("%d", &k... | 5 |
#include<iostream>
#include<string>
using namespace std;
#define MOD (1000000007)
int ss[2][100001];
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
for (int j = 0; j < 2; ++j) {
cin >> s;
ss[j][0] = 0;
for (int i = 1; i <= s.size(); ++i) {
ss[j][i] = ss[j][i - 1] + 1;
if (s[i-1] == 'B... | 0 |
#include <bits/stdc++.h>
using namespace std;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
inline int addmod(int x, int y) {
return (x % 1000000007 + y % 1000000007) % 1000000007;
}
inline... | 4 |
#include <bits/stdc++.h>
using namespace std;
char outp[3000000];
int osize = 0, q, n;
list<pair<int, char> > ls;
pair<int, int> que[300000], ans[300000];
set<pair<int, int> > cl, cr;
vector<int> fb[300000];
bool vis[300000];
int digsum[3000000][10];
bool digit(char c) { return c >= '0' && c <= '9'; }
int main() {
io... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
double v[505] = {0.0}, e[505][505] = {0.0};
int main(int argc, char *argv[]) {
cin >> n >> m;
double res = 0;
for (int i = 1; i <= n; i++) cin >> v[i];
for (int i = 1; i <= m; i++) {
int x, y;
double value;
cin >> x >> y >> value;
e[x][y] =... | 3 |
#include <iostream>
#include <string>
using namespace std;
int main () {
int x, y,count=0;
char c;
double a=0.0, b=0.0;
while(cin >> x) {
cin >> c;
cin >> y;
a += x*y;
b += y;
count++;
}
b /= count;
y = (int)b + ( ( b - (int)b ) < 0.5 ? 0 : 1 );
cout << a << "\n" << y << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
void RI() {}
template <typename... T>
void RI(int& head, T&... tail) {
scanf("%d", &head);
RI(tail...);
}
int main() {
int n, t;
RI(n, t);
if (n == 1 && t == 10) {
puts("-1");
return 0;
}
if (n == 1) {
printf("%d\n", t);
return 0;
}
int r =... | 1 |
#include <bits/stdc++.h>
using namespace std;
// Macro Tools /////////////////////////////////////////////////////////////////
#define GET_MACRO_09(A0, A1, A2, A3, A4, A5, A6, A7, A8, NAME, ...) NAME
#define EXPAND_01(MACRO, A0, ...) \
MACRO(A0, ##__VA_ARGS__)
#define EXPAND_02(MACRO, A0, A1, ...) \
MACRO(A0, ##__... | 0 |
//#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
using namespace std;
typedef pair<int,int> XY;
struct P{
int x,y,d;
set<XY> s;
P(){}
P(int x,int y,int d,set<XY> s):x(x),y(y),d(d),s(s){}
};
string st[52];
int n,m;
int main(){
cin >> n >> m;
in... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxv = 5555;
int V;
vector<int> G[maxv];
vector<int> rG[maxv];
vector<int> vs;
bool used[maxv];
int cmp[maxv];
void add_edge(int from, int to) {
G[from].push_back(to);
rG[to].push_back(from);
}
void dfs(int v) {
used[v] = true;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int r, g, b;
cin >> r >> g >> b;
int ans = (r + g + b) / 2;
int maxx = max(r, max(g, b));
if (r == maxx) {
if (g + b < maxx) ans = g + b;
} else if (g == maxx) {
if (r + b < maxx) ans = r ... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, c;
cin >> n >> c;
long long a[n + 1], pre[n + 1];
memset(pre, 0, sizeof(pre));
;
a[0] = 0;
for (long long i = 0; i < n; i++)
cin >> a[i + 1], pre[i + 1] = pre[i] + a[i + 1];
long long dp[n + 1];
memset(dp, 0, sizeof(dp));
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int num[702];
long long dp[702][702][3][3];
char s[702];
bool check(int a, int b) { return a == 0 || b == 0 || a != b; }
long long dfs(int l, int r, int c1, int c2) {
if (dp[l][r][c1][c2] != -1) return dp[l][r][c1][c2];
if (l + 1 > r) return dp[... | 4 |
#include <bits/stdc++.h>
using namespace std;
bool contains_all_digits(int n, int a[], int size) {
int used[10];
for (int i = 0; i < 10; i++) used[i] = 0;
for (int i = 0; i < size; i++) used[a[i]] = 1;
while (n) {
int t = n % 10;
n /= 10;
if (used[t])
used[t]++;
else
return false;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
using PII = pair<int, int>;
const int N = 5e5, M = 2000;
const int mod = 1e9 + 7;
const double pai = acos(-1);
struct Node {
int x, y;
};
int n;
int ans;
struct Node node[N];
bool check(Node a, Node b, Node c);
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int lp[1000000 + 1];
int phi[1000000 + 1];
vector<int> pr;
void calc_sieve() {
phi[1] = 1;
for (int i = 2; i <= 1000000; ++i) {
if (lp[i] == 0) {
lp[i] = i;
phi[i] = i - 1;
pr.push_back(i);
} else {
if (lp[i] == lp[i / lp[i]])
phi... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int q, i, j, k, sum = 0, a, b, c, d, n, s, count = 0, count1 = 0, p = -1,
r = 1001, x;
cin >> n >> x;
vector<pair<long long int, long long int> > v;
for (i = 0; i < n; i+... | 2 |
#include <bits/stdc++.h>
int main() {
int q, n, a, s[101] = {0}, i;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
s[a]++;
}
}
for (i = 1; i <= 100; i++)
if (s[i] == q) printf("%d ", i);
printf("\n");
return 0;
}
| 1 |
#include <stdio.h>
#include <cmath>
using namespace std;
int main()
{
double d;
scanf("%lf", &d);
double ans = (int)d + 1 > d * sqrt(2.0) ? (int)d + 1 : d * sqrt(2.0);
printf("%.12lf", ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:20000000")
using namespace std;
int ri() {
int x;
scanf("%d", &x);
return x;
}
long long rll() {
long long x;
scanf("%lld", &x);
return x;
}
int mas[100500];
void solve() {
int n = ri(), k = ri();
for (int i = (int)(1); i <= (int)(n); i++) mas[i] ... | 2 |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
using namespace std;
int main(){
vector<char> v;
int n;
int count;
string s;
while(1){
cin >> s;
if(s[0] == '#')break;
v.clear();
for(int i = 0;i < s.size();i++){
if(s[i] == 'w'){
v.push_back('w');
}
else if(s[i] == 'n'... | 0 |
#include<bits/stdc++.h>
using namespace std;
int N, K;
int x[100000];
int a = 3 * (int)1e8;
int main(){
cin >> N >> K;
for(int i = 0; i < N; ++i) cin >> x[i];
for(int i = 0; i < N - K + 1; ++i) a = min(a, min(abs(x[i]) + abs(x[i + K - 1] - x[i]), abs(x[i + K - 1]) + abs(x[i + K - 1] - x[i])));
cout << a << endl;... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
const unsigned long long INF64 = 3e18;
const long double EPS = 1e-12;
const long double PI = 3.1415926535897932384620;
const unsigned long long MD = 925262732;
const unsigned long long T = 634521;
const int N = 300101;
const int M = 200100;
const int MA... | 4 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:36777216")
template <class T>
inline T &RD(T &);
template <class T>
inline void OT(const T &);
inline long long RD() {
long long x;
return RD(x);
}
inline double &RF(double &x) {
scanf("%lf", &x);
return x;
}
inline double RF() {
do... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long ans = 0, sumx = 0, sumy = 0;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
sumx += x;
sumy += y;
ans += (long long)n * (long long)x * (long long)x;
ans += (long long)n * (long l... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (scanf("%d", &n) != EOF) {
int temp = 0;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
temp += (x - 1);
if (temp % 2)
printf("1\n");
else
printf("2\n");
}
}
return 0;
}
| 2 |
#include<bits/stdc++.h>
using namespace std;
int n,a,b,K;
string A,B;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>a>>b>>K;
n=a+b;
if(K>a+b-2&&a+b>=2||b==1&&K||K&&a==0){
cout<<"No";
return 0;
}
A=B="1";
for(int i=1;i<n;i++){
A+="0";
... | 4 |
#include <iostream>
using namespace std;
int main()
{
int n,m,l,i,j,k;
long c;
int A[100][100];
int B[100][100];
cin >> n >> m >> l;
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> A[i][j];
for (i = 0; i < m; i++)
for (j = 0; j < l; j++)
cin >> B[i][j];
for (i = 0; i < n; i++)
{
for (j... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 370021;
inline int scan() {
char c = getchar();
int x = 0;
while (c < '0' || c > '9') {
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x;
}
long long int add(long long int a,... | 4 |
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double pi = 3.1415926535;
double a,b,x; cin >> a >> b >> x;
if(atan(2*(b-x/(a*a))/a) <= atan(b/a)){
printf("%.20f",atan(2*(b-x/(a*a))/a)*180/pi);
}else{
printf("%.20f",atan(b*b*a/(2*x))*180/pi);
}
return 0;
} | 0 |
#include <bits/stdc++.h>
const int MAXN = 105, MAXM = 1005;
int rk[MAXN], n, m;
double f[MAXN][MAXN * MAXM];
inline int max(int a, int b) { return a > b ? a : b; }
int main() {
int i, j, sum = 0;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; ++i) {
scanf("%d", &rk[i]);
sum += rk[i];
}
if (m == 1) {
p... | 3 |
#include <bits/stdc++.h>
using namespace std;
int power(int a, int b, int c, int ans = 1) {
for (; b; b >>= 1, a = (long long)a * a % c)
if (b & 1) ans = (long long)ans * a % c;
return ans;
}
inline void smax(int &u, const int &v) {
if (u < v) u = v;
}
int flag[1000100], mul[1000100], np, cnt[1000100], fac[10... | 6 |
#include<stdio.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
const int MOD=998244353;
int main(void)
{
int A,B,C,D,ans=0,powD=1,sum,dp[3000]={0};
if(!scanf("%d %d %d %d",&A,&B,&C,&D))return 0;
dp[A-1]=1;
rep(i,D-B)
{
sum=0;
rep(j,C)
{
sum=(1ll*sum*(B+i)%MOD+dp[j])%MOD;
dp[j]=(1ll*j*dp[... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
signed main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
if (n > m) {
cout << 0;
return 0;
}
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 1;
for (long long i = 0; i < n; i++) {
for (... | 3 |
#include<iostream>
using namespace std;
int main()
{
long long n,d,answer=0;
cin>>n>>d;
for(int i=0;i<n;i++)
{
long long x,y;
cin>>x>>y;
if(d*d>=(x*x+y*y))
answer++;
}
cout<<answer;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
sort(s.begin(), s.begin() + n);
sort(s.begin() + n, s.end());
int countl = 0;
int countm = 0;
for (int i = 0; i < n; ++i) {
if (s[i] > s[n + i]) countm++;
if (s[i] < s[n + i]) countl++;
}
if (co... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
vector<long long> v(m), c(m), mp(n + 1);
for (long long i = 0; i < m; i++) cin >> v[i];
long long j = 0, x = 0;
while (j < m) {
mp[v[j]]++;
lon... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, r, a, b;
scanf("%d%d%d%d%d", &n, &l, &r, &a, &b);
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int suml[n + 1];
int sumr[n + 1];
suml[0] = 0;
sumr[0] = 0;
for (int i = 1; i <= n; i++) {
suml[i] = suml[i - 1] +... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
int n; scanf("%d",&n);
vector<int> a(n),b(n);
rep(i,n) scanf("%d%d",&a[i],&b[i]);
vector<int> sum(n);
rep(i,n) sum[i]=a[i]+b[i];
sort(sum.rbegin(),sum.rend());
lint ans=0;
rep(i,n) ans+=... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n;
double p;
double myfunc(long long n, long long m) {
if (n < m) return 0;
double ret = 1;
for (int i = 0; i < m; ++i) {
ret *= n - i;
ret /= i + 1;
}
return ret;
}
double mypr(long long n, long long m, int i) {
return myfunc(m, i) * myfunc(n ... | 3 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int n, m, q;
vector<int> adj[300001];
int p[300001];
int rank2[300001];
int radio[300001], diametro[300001];
short int visited[300001];
int dis[300001];
int get_diametro(int v) {
visited[v] = 1;
queue<int> q;
q.push(v);
int last = v;
while (!q... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const long long int INF = 1e9 + 7;
long long int pow(long long int x, long long int y) {
long long int res = 1;
while (y > (long long int)0) {
if (y & (long long int)1) res = ((res) * (x));
y = y >> (long long int)1;
x = ((x) * (x)... | 3 |
#include<bits/stdc++.h>
using namespace std;
int x,y,z;
int main(){
cin>>x>>y>>z;
cout<<floor((x-z)/(y+z))<<endl;
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.