solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:512000000")
using namespace std;
using li = long long;
using ld = long double;
void solve(bool);
void precalc();
clock_t start;
int main() {
start = clock();
int t = 1;
cout.sync_with_stdio(0);
cin.tie(0);
cout.precision(20);
cout << fixed;
precalc(... | 2 |
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <random>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <complex>
#include <functional>
using namespace std;
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1);
double EPS = 1e-7;
long long INF = 1000000000;
long long MAXINT = 2147483647;
long long INFLL = 1000000000000000000LL;
long long MAXLL = 9223372036854775807LL;
pair<long long, long long> M[8] = {
make_pair(0, 1), make_pair(1, 0), make_pair(-1, 0... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long f() {
string s;
cin >> s;
int n = s.length();
vector<long long> a(n + 2, n);
int mi = 0;
int bal = 0;
for (int i = 0; i < n; ++i) {
bal += (s[i] == '+' ? 1 : -1);
if (bal < mi) {
mi = bal;
a[-bal] = i;
}
}
long long res = ... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long arr[22];
int main() {
long long a, b, d;
long long c, e, f, g, h;
cin >> a;
cin >> b;
for (d = 0; d < a; d++) cin >> arr[d];
for (d = a - 1, e = 0, g = 1; d > -1; d--) {
e += arr[d] * g;
g *= b;
}
cin >> a;
cin >> b;
for (d = 0; d < a; ... | 1 |
#include <bits/stdc++.h>
char buf[1 << 23], *ps = buf, *pt = buf;
int read() {
register int x = 0;
register char f = 1, ch = (ps == pt && (pt = (ps = buf) +
fread(buf, 1, 1 << 23, stdin),
ps == pt)
... | 5 |
#include <bits/stdc++.h>
using namespace std;
void cpp() {}
signed main() {
cpp();
long long t;
cin >> t;
while (t--) {
long long a, b;
long long ans = 0;
cin >> a >> b;
if ((a + b) / 3 < a && (a + b) / 3 < b) {
cout << ((a + b) / 3) << endl;
continue;
} else {
cout << min(... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long k2, k3, k5, k6, ans, minim, minim1;
int main() {
cin >> k2 >> k3 >> k5 >> k6;
minim = min(k2, min(k5, k6));
ans = 256 * minim;
k2 -= minim;
k5 -= minim;
k6 -= minim;
minim1 = min(k2, k3);
ans += 32 * minim1;
cout << ans << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
struct comp {
bool operator()(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return a.second > b.second;
}
};
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
vector<int> edges[N];
vector<int> c(N);
bool good(int u, int p) {
bool res = true;
for (int v : edges[u]) {
if (v != p) {
if (c[u] != c[v]) {
return false;
}
res &= good(v, u);
}
}
return res;
}
int main() {
... | 1 |
// D - Dice in Line
#include <bits/stdc++.h>
using namespace std;
#define rp(i,s,e) for(int i=(s);i<(e);++i)
int main(){
int N,K; cin>>N>>K;
vector<int> P(N+K); rp(i,0,N) cin>>P[i+K];
int ans = 0, sum = 0;
rp(i,0,N) ans = max(ans, sum += P[i+K] - P[i]);
printf("%.12f\n",(ans+K)/2.0);
} | 0 |
#include <bits/stdc++.h>
const int MAXN = 1e5 + 1;
const int INF = 1e9 + 7;
using namespace std;
int f[MAXN][10][10][2][2];
string A, B;
void add(int &a, int b) {
a += b;
if (a >= INF) a -= INF;
}
int n;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
cin >> A >> B;
A = '=' + A;
B = '=' + B;... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long int a[300009];
vector<pair<pair<long long int, long long int>,
pair<long long int, long long int>>>
v;
long long int ans = 1;
vector<int> vec;
bool check(int idx, long long int mid) {
long long int dist, i, j, x, fuel = mid, cnt = v[idx].second.s... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
struct point {
int x, y;
point() {}
point(int _x, int _y) : x(_x), y(_y) {}
inline friend point operator-(const point &a, const point &b) {
return point(a.x - b.x, a.y - b.y);
}
inline friend point operator+(const point &a, const point &b... | 5 |
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const double pi = acos(-1.0);
const int N = 1e5 + 5;
int n;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s;
n = s.length();
strin... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, Q, u, v, w, x, y, edgenum, mid;
int vet[200010], Next[200010], head[100010], len[200010], d[100010], q[100010],
f[100010][22];
long long ans, Mx[100010], Mx2[100010], Mx3[100010], dis[100010],
up[100010][22], down[100010][22];
void read(int &x) {
x = 0;
c... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int mod = (int)10e9 + 7;
vector<char> readCharArray(int size);
vector<int> readArray(int size);
template <class T>
void print1D(vector<T>);
template <class T>
void print2D(vector<vector<T>>);
void solve() {
int a, b;
cin >> a >> b;
int ans = abs(a - b) / 10;
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long N, M;
cin >> N >> M;
if (N == 1)
cout << 0;
else if (M >= N / 2) {
cout << N * (N - 1) / 2;
} else {
long long Ans = 0;
long long Cnt = 0;
while (Cnt < M) {
Ans +... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 410;
struct edge {
int to, next;
} e[N * N * 2], e2[N * N * 2];
int head[N], ecnt, vis[N], stk[N], top, dfn[N], low[N], dfsn, head2[N], ecnt2;
int scc, belong[N], Belong[N];
inline void adde(int from, int to) {
from = Belong[from], to = Belong[to];
e[++e... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const long long INF64 = 1e18;
const double EPS = 1e-9;
const double PI = acos(-1);
const long long MD = 295622452151813443;
const long long T = 26;
const int N = 300100;
const int M = 510;
int n;
double w, v, u;
pair<d... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
n--;
long long sum = 0;
for (long long x = 0; 1ll << x <= n; x++)
sum += (((n - (1ll << x)) >> (x + 1)) + 1) << x;
cout << sum << '\n';
}
| 5 |
#include<iostream>
#include<cmath>
#include<string>
#include<map>
#include<queue>
using namespace std;
#define N 3
#define N2 9
struct Puzzle {
int f[N2];
int space;
string path;
bool operator<(const Puzzle& p) const {
for (int i = 0; i < N2; i++) {
if (f[i] == p.f[i]) continue;
return f[i] > p.f[i];
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > dp[1000004];
int main() {
int n, m, idx = -1, a[2003], b[2003], c[2003], d[2003], ans = 2000004;
vector<pair<int, int> > vec;
multiset<int> s;
multiset<int>::iterator it;
int arr[2003];
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, m, rb, cb, rd, cd;
cin >> n >> m >> rb >> cb >> rd >> cd;
int dr = 1, dc = 1;
int time = 0;
if (rb == rd || cb == cd) {
cout << 0 << "\n";
continue;
}
while (true) {
if (r... | 1 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 0.0000000000001;
const int mod = 1000000007;
int n, m;
vector<double> cra;
vector<double> crb;
struct P {
long long x;
long long y;
P() {}
P(long long _x, long long _y) {
x = _x;
y = _y;
}
P operator-(const P &b) const { return P(x - b... | 5 |
#include <iostream>
using namespace std;
int main(){
int n, tmp, wa=0;
cin >> n;
tmp=n;
while (tmp) {
wa+=tmp%10;
tmp/=10;
}
printf("%s\n", n%wa==0 ? "Yes": "No");
return 0;
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
typedef long long ll;
const int mod = 1e9 + 7;
#define X first
#define Y second
vector<pair<int, int> > E[MAXN];
bool flag = true;
bool vis[MAXN];
int d[MAXN];
void dfs(int x)
{
for (auto e: E[x])
{
int y = e.X, z = e.Y;
if (!vis[y])
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i = 0;
int j = s.size() - 1;
while (s[i] == '0' && i < s.size()) {
i++;
}
while (s[j] == '0' && j >= 0) {
j--;
}
while (i < j) {
if (s[i] != s[j]) {
cout << "NO";
return 0;
}
i++;
j--... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t))... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9, M = 1e6 + 9, OO = 0x3f3f3f3f;
long long llOO = 0x3f3f3f3f3f3f3f3f;
int main() {
int t;
cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
string s;
cin >> s;
int n = s.size();
long long zeros = 0, ones = 0, prev = 0, ans = ... | 2 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int* A = new int[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
int q;
cin >> q;
int k;
int answer;
for (int i = 0; i < q; i++) {
cin >> k;
answer = lower_bound(A, A + ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int k, n;
int arr[300100];
int main() {
int i, j;
scanf("%d%d",&k,&n);
if (k%2==0) {
printf("%d ",k/2);
for (i=1;i<n;i++) printf("%d ",k);
printf("\n");
return 0;
}
if (k==1) {
for (i=0;i<(n+1)/2;i++) printf("1... | 0 |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T BM(T p, T e, T M) {
long long int ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const int MAX_V = 305;
const int NIL = -1;
class Move {
public:
int x, y, flow;
Move() {}
Move(const int x, const int y, const int flow) {
this->x = x;
this->y = y;
this->flow = flow;
}
};
vector<int> G[MAX_V];
int V, Father[M... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int IINF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
const double DINF = numeric_limits<double>::infinity();
const long long MOD = 1000000007;
const double EPS = 1e-9;
const int DX[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int DY[] = {0, 1, 0, -1, 1, -1, -... | 4 |
// D - Widespread
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define roundup(a,b) (((a)+(b)-1)/(b))
int main(){
int N,A,B; cin>>N>>A>>B;
vector<int> H(N); for(int i=0; i<N; ++i) cin>>H[i];
int ans = INT_MAX;
LL ab = (LL)A - B;//additional damage
int L = 0, R = 1e9;
while(L <= R){
int t... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = unsigned long long;
ll mod = 1e9 + 7;
ll mode = 998244353;
queue<string> u;
queue<char> q;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t, n, m, i, j, k, k1;
cin >> t;
while (t--) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int gi() {
int a;
scanf("%d", &a);
return a;
}
long long gli() {
long long a;
scanf("%I64d", &a);
return a;
}
int main() {
int n = gi();
int r = n % 3 ? 1 : 0;
n /= 3;
printf("%d\n", r + n * 2);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int ma[n][m];
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
cin>>ma[i][j];
int l[m];
for(int i=0;i<m;i++)
cin>>l[i];
for(int i=0;i<n;i++)
{
int sum=0;
for(int j=0;j<m;j++)
{
sum+=ma[i][j]*l[j];
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = (int)1e9;
const int MAX_N = 100 * 1000 + 1000;
int n, m, total;
char arr[111][111];
bool mark[111][111];
vector<int> qi, qj;
int ai[] = {1, -1, 0, 0};
int bj[] = {0, 0, 1, -1};
int aii[] = {1, -1, 1, -1};
int bjj[] = {1, -1, -1, 1};
... | 3 |
#include<iostream>
#include<set>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
int i,n,t;
cin >> n;
multiset<int, std::greater<int>>a;
for(i=0;i<n;i++){
int t;
cin>>t;
a.insert(t);
}
int ans=0;
while(!a.empty()){
int x=*a.begin();
a.erase(a.begin());
int y=po... | 0 |
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
int INF=1e9;
int MOD=1000000007;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
double EPS = 1e-10;
con... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
int res=360;
while(res%t!=0)
res+=360;
cout<<res/t;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long gi() {
char cc = getchar();
long long cn = 0, flus = 1;
while (cc < '0' || cc > '9') {
if (cc == '-') flus = -flus;
cc = getchar();
}
while (cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
return cn * flus;
}
const long long N ... | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[3][1005];
int main(){
int n, m;
scanf("%d%d", &n, &m);
for(int i=1;i<=n;i++){
scanf("%lld%lld%lld", &a[0][i], &a[1][i], &a[2][i]);
}
LL ans = -1e18;
for(int i=0;i<8;i++){
vector<LL> res;
for(int j=1;j<=n;j++){
LL cost = 0;
for(in... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int a[100];
for(int i=0; i<N; i++){
cin >> a[i];
}
int mincost=10000000;
for(int j=-100; j<=100; j++){
int cost=0;
for(int i=0; i<N; i++){
cost+=(j-a[i])*(j-a[i]);
}
mincost=min(mincost,cost);
}
cout... | 0 |
#include<iostream>
using namespace std;
int money(int m){
int money=1150;
if(m<=10)return money;
if(m<=20&&m>10)return money+125*(m-10);
if(m<=30&&m>20)return money+10*125+140*(m-20);
if(m>30)return money+10*125+10*140+160*(m-30);
}
int main(){
int w;
while(true){
cin>>w;
if(w==-1)return 0;
cout<<4280-money(w)<<endl;
}... | 0 |
#include<iostream>
using namespace std;
int main(void){
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
int l=i*m+j*n-2*i*j;
// cout<<l<<endl;
if(k==l||k==n*m-l){
cout<<"Yes"<<endl;
return 0;
}
}
}
cout<<"No"<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 2000000000;
long long INFF = 8000000000000000000LL;
double PI = acos(-1);
inline string IntToString(int a) {
char x[100];
sprintf(x, "%d", a);
string s = x;
return s;
}
inline int StringToInt(string a) {
char x[100];
int res;
strcp... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
vector<pair<int, int> > adj[MAXN];
int n;
bool mark[MAXN];
int p[MAXN];
int curv;
void dfs(int v, int ind = -1) {
mark[v] = 1;
for (int i = 0; i < adj[v].size(); i++) {
pair<int, int> u = adj[v][i];
if (!mark[u.first]) {
dfs(u.fir... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
string s1="";
string s2="";
int sum=0;
for(int i=0;i<s.length();i++){
s1=s[i]+s1;
if(s1!=s2){
sum++;
s2=s1;
s1="";
}
}
cout<<sum;
}
| 0 |
//Bokan ga bokka--nn!!
//Daily Lunch Special Tanoshii !!
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typed... | 0 |
#include <bits/stdc++.h>
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(V) V.begin(), V.end()
#define L_B lower_bound
#define U_B upper_bound
#define pb push_back
using namespace std;
template<class T, class T1> int chkmin(T &x, const T1 &y) { return x > y ? x = y, 1 : 0; }
template<class T, class T1> in... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 7;
int save[2][N][N];
int dp[N][N];
int n, res;
int c[2 * N], t[2 * N];
int sen[2][N];
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 100000000 + 7;
dp[0][0] = 0;
for (int i = 1; i <= 2 * n; i++) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
int m;
vector<int> v[5002];
int w[5002];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) w[i] = INT_MAX;
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
v[a].push_back(b);
w[a] = min(w[a], (b + n - a) % n... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int sg[105], a[105];
int f[1005][4], sum[3];
int mex(int x, int y) {
if (x && y) return 0;
if (x + y - 1) return 1;
return 2;
}
int C(int l, int r) { return (long long)(l + r) * (r - l + 1) / 2 % mod; }
int main() {
int tot = 1, l = 1, r ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
double highest = (ceil((double)n / (double)2));
int lower = -1000;
for (int i = lower; i <= 1000; i++) {
if (i == 0) conti... | 1 |
#include <bits/stdc++.h>
using namespace std;
void pairsort(int a[], int b[], int n) {
pair<int, int> pairt[n];
for (int i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (int i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int nmax = 2e5 + 42;
int n, arr[nmax];
pair<int, int> sparse[20][nmax];
int lg[nmax];
void build() {
for (int i = 1; i <= n; i++) sparse[0][i] = {arr[i], i};
for (int sz = 1; (1 << sz) <= n; sz++)
for (int j = 1; j + (1 << sz) - 1 <= n; j++) {
sparse[sz]... | 5 |
#include <bits/stdc++.h>
using namespace std;
char s[400][400];
bool a[27];
int nx[27];
int main() {
int n;
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
gets(s[i]);
for (int j = 0; j < n; j++) a[s[i][j] - 'a'] = true, nx[s[i][j] - 'a']++;
}
int sm = 0;
for (int i = 0; i < 26; i++) sm += a[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
multiset<int> st;
int n, a, b, x, z;
double sum;
cin >> n >> a >> b >> x;
sum = x;
for (int i = 0; i < n - 1; i++) {
cin >> z;
sum += z;
st.insert(z);
}
int cnt = 0;
while ((x * a) / sum < b) {
sum -= *st.rbegin();
st.erase... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3001;
int a[N], id[N], dp[N][N];
vector<int> pos[N];
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; ++i) pos[i].clear();
for (int i = 1; i <= n; ++i) {
cin >> a[i];
id[i] = pos[a[i]].size();
... | 3 |
#include<iostream>
using namespace std;
int main(){int n;cin>>n;cout<<n*(n+1)/2<<endl;} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct __s {
__s() {
if (1) {
ios_base::Init i;
cin.sync_with_stdio(0);
cin.tie(0);
}
}
~__s() {
if (!1)
fprintf(stderr, "Execution time: %.3lf s.\n",
(double)clock() / CLOCKS_PER_SEC);
long long n;
cin >> n;
... | 4 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int cnt=0;
for(int a=1; a<n; a++){
cnt += (n-1)/a;
}
cout << cnt;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mm = 2e5 + 20;
const long long mol = 998244353;
const long long inf = 1e13;
long long m, n, inp;
bool tr[40];
void bs() {
long long l = 1, r = m + 1, i = 0;
while (r - l > 1) {
long long mid = (l + r) / 2;
cout << mid << endl;
cin >> inp;
if (i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e2 + 10, mod = 1e9 + 9;
long long n, m, comp, mark[N], par[N], root[N], dp[N][N], com_dp[N][N],
knap[N][N], fac[N], pwfac[N];
set<long long> mat[N];
vector<long long> good, bad, adj[N], comps[N];
long long pw(long long a, long long b) {
long long ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char t[10];
while (scanf("%s", t) != EOF) {
int h = (t[0] - '0') * 10 + t[1] - '0';
h = h % 12;
int m = (t[3] - '0') * 10 + t[4] - '0';
printf("%.2lf %.2lf\n", h * 360.0 / 12.0 + m * 360.0 / (12.0 * 60),
m * 360.0 / 60.0);
}
r... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a, b, cnt = 0;
cin >> n >> x >> a >> b;
cnt = (a - 1) / x;
while (--n) {
cin >> a;
cnt += (a - b - 1) / x;
cin >> b;
}
cout << b - x * cnt;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n, 0);
for (long long i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
vector<long long> dp(n, 0);
dp[0] = k + 1;
for (long long i = 0; i < n; i++) {
dp[i] = 2 * k + 1;
if (i >= n - k... | 2 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int dx2[] = {1, -1, -1, 1, 0, 0, -1, 1};
int dy2[] = {1, -1, 1, -1, 1, -1, 0, 0};
int kmx[] = {-1, -1, 1, 1, 2, -2, 2, -2};
int kmy[] = {2, -2, 2, -2, -1, -1, 1, 1};
int bishopX[] = {-1, 1, -1, 1};
int bishopY[] = {-1, -1,... | 3 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
long long INF = 1000000000000000000;
cin >> N;
vector<long long> A(N);
vector<pair<long long, int> > VP(N);
for (int i = 0; i < N; i++) cin >> A[i], VP[i] = { A[i], i };
sort(VP.begin(), VP.end(), greater<pair<long long, int> >());
vector<vector... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
inline long long read() {
long long x = 0;
char ch = getchar();
bool positive... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename P, typename Q>
ostream& operator<<(ostream& os, pair<P, Q> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
int main(int argc, char* argv[]) {
int n, k;
while (scanf("%d%d", &n, &k) == 2) {
vector<int> v;
for (int i = 0; i... | 2 |
#include <bits/stdc++.h>
using namespace std;
int break_point() {
char c;
while ((c = getchar()) != '\n')
;
return 0;
}
template <typename T>
void read_integer(T &r) {
bool sign = 0;
r = 0;
char c;
while (1) {
c = getchar();
if (c == '-') {
sign = 1;
break;
}
if (c != ' ' &... | 3 |
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define maxn 300005
#define lc now<<1
#define rc lc|1
using namespace std;
int w,h,n,x[maxn],y[maxn],num[maxn],up[maxn],dn[maxn],c[maxn],z[maxn];
inline bool cmp(const int &a,const int &b){ return x[a]<x[b]; }
int Max[maxn*10],lazy[maxn*10];
inli... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, ans = 1;
vector<int> v[10010];
pair<int, int> p[10010];
bool vis[10010];
int dfs(int a) {
int t = 0;
vis[a] = 1;
for (int i = 0; i < v[a].size(); i++) {
if (!vis[v[a][i]]) t += dfs(v[a][i]) + 1;
}
return t;
}
int main() {
int a, b;
cin >> n... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> M, N;
pair<string, int> A[1007];
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> A[i].first >> A[i].second;
M[A[i].first] += A[i].second;
}
for (map<string, int>::iterator it = M.begin(); it != M.end();... | 1 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp, mm;
bool comp(int a, int b) { return mm[a] < mm[b]; }
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
mp[x]++;
set<int> s;
for (int j = 1; j <= 10; j++) {
if (mp[j]) {
mp[j... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int main() {
vector<long long> v1, v2;
long long n, a, b, arr[N];
cin >> n >> a >> b;
for (long long i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
for (long long i = 0; i < b; i++) v1.push_back(arr[i]);
for (long long i = b; i < ... | 1 |
#include <cstdio>
bool w[6666] = { true }, s[6666] = { true };
int main(void)
{
double max = -1.0;
int a, b, c, d, e, f, i, j, ansa = 0, ansb = 0;
scanf("%d %d %d %d %d %d" ,&a, &b, &c, &d, &e, &f);
a *= 100, b *= 100;
for (i = 0; i <= f; i++)
{
if (w[i])
{
w[i + a] = true;
w[i + b] = true;
}
if... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
char str1[MAXN], str2[MAXN];
int n1, n2;
int main() {
int i, j, n;
bool flag = true;
scanf("%d %d", &n1, &n2);
n = max(n1, n2);
scanf("%s%s", str1, str2);
for (i = 0; i < n; i++) {
if (str1[i] == '*') {
break;
}
if (st... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, s, t;
cin >> n >> s >> t;
cout << n - min(s, t) + 1 << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
solve();
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
scanf("%d", &n);
vector<pair<int, int> > a(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i].first);
}
for (int i = 0; i < n; i++) {
scanf("%d", &a[i].second);
}
sort(a.begin(), a.end());
a.push_back({2e9, 0});
priority_qu... | 1 |
#include <bits/stdc++.h>
const int MAX_N = (int)2e5 + 123;
const double eps = 1e-6;
const int inf = (int)1e9 + 123;
const int P = 123457, mod = (int)1e9 + 7;
using namespace std;
int n, m;
string second, t;
int pw[MAX_N], sum[MAX_N];
struct num {
vector<int> a, h;
int len;
num() {}
void apply() {
len = int(... | 6 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
class point {
public:
double x, y;
point() {}
point( double x_, double y_ ) : x(x_), y(y_) {}
point operator -( point p ) { return point( x - p.x, y - p.y ); }
point operator +( point p ) { return point( x + p.x, y + p.y ); }
point operator *( doub... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U>& l, const std::pair<T, U>& r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void);
const long long INF64 = 1e18;
const long long INF32 = 1e9;
int mai... | 2 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int arr[n];
set<int> st;
for (int i = 0; i < n; ++i) cin >> arr[i], st.insert(arr[i]);
int v = 1;
for (int i = 0; i < n - 1; ++i) {
auto it = st.find(arr[i]);
it++;
if (it == st.end() || arr[i + 1] != (*it)) ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 1e9;
int add(int x, int y) { return (1ll * x + 1ll * y) % mod; }
int del(int x, int y) { return ((1ll * x - 1ll * y) % mod + mod) % mod; }
int mul(int x, int y) { return (1ll * x * 1ll * y) % mod; }
const int N = 1e6 + 5;
int n;
long... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin >> t;
while (t--) {
scanf("%d", &n);
printf("%.7f\n", 1 / (2 * (sin(3.14159265 / (4 * n)))));
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int n, p1, p2, p3, t1, t2, l[100 + 2], r[100 + 2], ans;
int main() {
cin >> n >> p1 >> p2 >> p3 >> t1 >> t2;
for (register int i = 1; i <= n; i++) cin >> l[i] >> r[i];
for (register int i = 1; i <= n; i++) {
ans += (r[i] - l[i]) * p1;
if (i != 1)
if (l[i... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long a[100009], b[100009];
long long k[100009], t[100009], g[100009];
long long l = 0, cur = 0;
long long qu(long long A) {
while (cur < l - 1 && A >= g[cur + 1]) cur++;
if (cur >= l) cur = l - 1;
return k[cur] * A + t[cur];
}
void add(long long m, long long n) {... | 3 |
#include <bits/stdc++.h>
#pragma optimize "-O3"
using namespace std;
const int maxN = (int)1e5 + 100;
long long c[maxN][5];
int n;
vector<int> pos[maxN];
bool lucky[maxN];
int a[maxN];
map<int, int> mp;
long long ans = 0;
vector<int> all_lucky;
bool already[maxN];
void solve(int l, int r) {
int ind =
lower_boun... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, x, y, i, j, k, sum, tot;
bool a[505][505], vis[505][505];
char ans[3000005];
bool dir(int x, int y, int dx, int dy) {
for (;;) {
x += dx;
y += dy;
if (x < 0 || x > n || y < 0 || y > n) return false;
if (vis[x][y]) return false;
if (a[x][y]) retu... | 5 |
#include <bits/stdc++.h>
int main() {
int a, i, b, c, A[101];
memset(A, 0, sizeof(A));
scanf("%d %d", &a, &b);
;
for (i = 0; i < a; i++) {
scanf("%d", &c);
A[c]++;
}
c = 0;
while (A[b] != a) {
for (i = b - 1; i > 0; i--) {
if (A[i] != 0) {
A[i]--;
A[i + 1]++;
}
... | 2 |
#include <bits/stdc++.h>
typedef long long ll;
const int N = 3054;
int mod, n;
int pw2[N], gw2[N];
int C[N][N], S2[N][N];
inline void add(int &x, const int y) {x += y - mod, x += x >> 31 & mod;}
void init(int n) {
int i, j;
for (*pw2 = i = 1; i <= n; ++i) pw2[i] = pw2[i - 1] * 2 % mod;
for (*gw2 = 2, i = 1; i <=... | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=5005;
const int MOD=1000000007;
int n,a,b;
long long f[N][2];
long long g[N];
long long dp[N][2];
long long ksm(long long a,long long b)
{
long long res=1;
while(b)
{
if(b&1) res=res*a%MOD;
a=a*a%MOD,b>>=1;
}
return res;
}
int main()
{
scanf... | 0 |
#include <bits/stdc++.h>
using namespace std;
int arr[200005];
map<int, int> mp;
int main() {
int n, k;
scanf("%d %d", &n, &k);
int val = (1 << k) - 1;
int cur = 0;
long long mn = 0;
mp[0]++;
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
int cur1 = cur ^ arr[i];
int cur2 = cur ^ arr[i] ... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.