code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
// using Real = mp::number<mp::cpp_dec_float<1024>>;
int main(){
ll X;
cin >> X;
ll tmp = X / 11;
if(X - 11 * tmp == 0) cout << 2 * tmp << endl;
else if (X - 11 * tmp <= 6) cout << 2 * tmp + 1 << endl;
else cout << 2 * tmp + 2 << endl;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<bool> v(55555 + 1);
for (int i = 2; i < v.size(); i++) {
if (!v.at(i)) {
for (int j = i * 2; j < v.size(); j += i) {
v.at(j) = true;
}
}
}
vector<int> a;
for (int i = 2; i < v.size(); i++) {
if (!v.at(i)) {
if (i % 5 == 1) a.push_back(i);
}
}
for (int i = 0; i < N; i++) {
if (i) cout << ' ';
cout << a.at(i);
}
cout << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll calc(ll &m, ll p) {
ll ret = 1;
m += p;
if (m >= 10) {
ret++;
m = (m / 10) + (m % 10);
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll M;
cin >> M;
ll ans = 0;
vector<ll> v(M);
REP(i, M) {
ll d, c;
cin >> d >> c;
vector<ll> u;
while (c > 1) {
if (c % 2 == 1)
u.push_back(d);
c /= 2;
ans += c;
d = d + d;
if (d >= 10) {
d = (d / 10) + (d % 10);
ans += c;
}
}
u.push_back(d);
ll n = u[0];
REP(j, u.size() - 1) {
ans += calc(n, u[j + 1]);
}
v[i] = n;
}
ll m = v[0];
REP(i, M - 1) {
ans += calc(m, v[i + 1]);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) {if (a > b) { a = b; return true; } return false; }
ll INF = 1001001001;
ll LINF = 1001001001001001001ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll m; cin>>m;
vector<LP> dc(m); cin>>dc;
ll d = 0;
rep(i, m) d += dc[i].se;
ll s = 0;
rep(i, m) s += dc[i].fi * dc[i].se;
ll ans = d - 1 + (s - 1) / 9;
cout<<ans<<endl;
} | 1 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = (double)(x2 - x1) * (double)(x2 - x1);
double y = (double)(y2 - y1) * (double)(y2 - y1);
cout << fixed << setprecision(6) << (double)sqrt(x+y) << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define FOR(i,a,b) for(ll i = (a); i < (ll)(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(ll i = (ll)(b)-1;i >= a;--i)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define eb(val) emplace_back(val)
const double PI = acos(-1);
const double EPS = 1e-10;
const ll MOD = 1e9+7;
void cioacc(){//accelerate cin/cout
cin.tie(0);
ios::sync_with_stdio(false);
}
signed main(){
cout << fixed << setprecision(10);
double a,b;
cin >> a >> b;
complex<double> c = {a,b};
cin >> a >> b;
complex<double> d = {a,b};
cout << abs(c-d) << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
const int ofs = 12800;
int H, W;
int A[82][82], B[82][82];
bool dp[82][82][25610];
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> H >> W;
rep(i, H) rep(j, W) cin >> A[i][j];
rep(i, H) rep(j, W) cin >> B[i][j];
dp[0][0][A[0][0]-B[0][0]+ofs] = true;
dp[0][0][B[0][0]-A[0][0]+ofs] = true;
rep(i, H) rep(j, W) {
if (i>0) rep(k, 25610) {
if (!dp[i-1][j][k]) continue;
int nk = k+A[i][j]-B[i][j];
if (0<=nk && nk<25610) dp[i][j][nk] = true;
nk = k+B[i][j]-A[i][j];
if (0<=nk && nk<25610) dp[i][j][nk] = true;
}
if (j>0) rep(k, 25610) {
if (!dp[i][j-1][k]) continue;
int nk = k+A[i][j]-B[i][j];
if (0<=nk && nk<25610) dp[i][j][nk] = true;
nk = k+B[i][j]-A[i][j];
if (0<=nk && nk<25610) dp[i][j][nk] = true;
}
}
int ans = 1000000;
rep(i, 25610) if (dp[H-1][W-1][i]) ans = min(ans, abs(i-ofs));
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
rep(i, h) rep(j, w) cin >> s[i][j];
bool able = true;
int di[] = {1, 0, -1, 0};
int dj[] = {0, 1, 0, -1};
rep(i, h) rep(j, w) {
if (s[i][j] == '.') continue;
bool is_dot = true;
rep(k, 4) {
int ni = i + di[k];
int nj = j + dj[k];
if (ni < 0 || ni >= h || nj < 0 || nj >= w) continue;
if (s[ni][nj] == '#') is_dot = false;
}
if (is_dot) able = false;
}
if (able) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n; cin>>n;
string s,t; cin>>s>>t;
int ans=2*n;
for(int i=0; i<n; i++){
int s_index=n-1-i;
int now_ans=2*n-(i+1);
bool flag=1;
for(int t_index=0; t_index<=i; t_index++){
if(t[t_index]!=s[s_index])flag=0;
s_index++;
}
if(flag){
ans=now_ans;
}
}
cout<<ans<<endl;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> used(N);
vector<pair<int, int>> arenas;
for (int i = 0; i < M; i++) {
int left = i + 1;
int right = N - i;
if (N % 2 == 0 && left * 2 * 2 > N) {
left++;
}
arenas.push_back(make_pair(left, right));
}
for (int i = 0; i < M; i++) {
int left = arenas[i].first;
int right = arenas[i].second;
printf("%d %d\n", left, right);
}
return 0;
}
| 0 |
#if 0
2019.12.08
不妨设 n > 1 。
如果所有 a[i] 都是奇数，那么先手操作后会有一个偶数，约分后仍然有唯一偶数，
此时后手一定可以对唯一偶数操作，所有数成为奇数，约分后同样如此，
直到所有数都为 1 ，仍然没有偶数，那么当 a[i] 全是奇数时先手必败。
更一般的，假设 n 足够大奇数足够多，如果有偶数个偶数，
先手操作后有奇数个偶数，后手一定可以对偶数操作使得状态还原至奇数个偶数，
也就是说有奇数个偶数时先手必胜，反之先手必败。
特别的是，如果有偶数个偶数且奇数唯一且该奇数大于 1 ，
此时先手对唯一奇数操作后，所有数都是偶数，
此时一定可以约分，并且约分后的结果是难以推断的。
由于这种情况一定可以约分，那么所有数至少缩小一半，也就是最多进行 O(logn) 次，
每次碰到这种情况暴力约分即可，直到转为上述可以直接判断的情况。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
inline operator ll () { ll x; return scanf("%lld", &x), x; }
template<class T> inline void operator () (T &x) { x = *this; }
template<class T, class ...A> inline void operator () (T &x, A &...a)
{ x = *this; this -> operator ()(a...); }
} read;
const int maxn = 100005;
int a[maxn];
bool game(int n) {
if(n == 1) return a[1] > 1;
int even = 0;
for(int i = 1; i <= n; i ++)
if(!(a[i] & 1))
++ even;
if(even & 1) return 1;
if(even != n - 1) return 0;
for(int i = 1; i <= n; i ++)
if(a[i] & 1) {
if(a[i] == 1) return 0;
-- a[i];
}
int gcd = a[1];
for(int i = 2; i <= n; i ++)
gcd = std::__gcd(gcd, a[i]);
for(int i = 1; i <= n; i ++)
a[i] /= gcd;
return !game(n);
}
int main() {
int n = read;
for(int i = 1; i <= n; i ++)
read(a[i]);
puts(game(n) ? "First" : "Second");
}
| #include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> inline void read(T &x){
x=0; char c=getchar(); int f=1;
while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
template<class T> inline void umin(T &x, T y){x=x<y?x:y;}
template<class T> inline void umax(T &x, T y){x=x>y?x:y;}
inline ui R() {
static ui seed=416;
return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 120000;
int gcd(int a, int b){return !b?a:gcd(b,a%b);}
int n,a[N];
void print(int x){
printf("%s",x==1?"First":"Second");exit(0);
}
int main() {
read(n);rep(i,1,n)read(a[i]);
int now=1;
while(1){
int cnt=0,flag=1;
rep(i,1,n)cnt+=!(a[i]&1),flag&=a[i]==1;
if(flag)print(3-now);
if(cnt&1)print(now);
if(n-cnt!=1)print(3-now);
rep(i,1,n)if(a[i]&1){if(a[i]==1)print(3-now);a[i]--;}
int g=0;rep(i,1,n)g=gcd(g,a[i]);
rep(i,1,n)a[i]/=g;now=3-now;
}
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <fstream>
#include <bitset>
#include <time.h>
#include <assert.h>
#include <random>
#define LL long long
#define VI vector<int>
#define VL vector<long long>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EPS 1e-14
using namespace std;
struct Edge {
int from;
int to;
int cost;
Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}
bool operator<(const Edge& edge) const {
return this->cost < edge.cost;
}
bool operator>(const Edge& edge) const {
return this->cost > edge.cost;
}
};
class UnionFind {
public:
vector<int> parent;
vector<int> setSize;
UnionFind(unsigned int size) {
parent.resize(size + 1);
iota(parent.begin(), parent.end(), 0);
setSize.resize(size + 1, 1);
}
// x??¨y???????????????????±??????????
bool isSameSet(int x, int y) {
return findRoot(x) == findRoot(y);
}
// x??¨y????±??????????????????????
void unionSet(int x, int y) {
x = findRoot(x);
y = findRoot(y);
if (x == y) { return; }
parent[x] = y;
setSize[y] += setSize[x];
}
private:
// ??¨??????????±???????
int findRoot(int x) {
if (parent[x] == x) {
return x;
}
else {
return parent[x] = findRoot(parent[x]);
}
}
};
/**
* ??°?????????????°???¨?????¨????±??????????O(|E| log|V|)
* @param num_of_node ???????????°
* @param edges?????¨?????????????????°????????????u -> v??¨v -> u??????????????\??????
* @return
*/
long long kruskal(unsigned int num_of_node, vector<Edge> edges) {
sort(edges.begin(), edges.end());
UnionFind uf(num_of_node);
long long ans = 0;
for (Edge e : edges) {
if (!uf.isSameSet(e.from, e.to)) {
uf.unionSet(e.from, e.to);
ans += e.cost;
}
}
return ans;
}
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int V, E;
cin >> V >> E;
vector<Edge> edges;
FOR(i, 0, E) {
int s, t, w;
cin >> s >> t >> w;
edges.emplace_back(Edge(s, t, w));
edges.emplace_back(Edge(t, s, w));
}
cout << kruskal(V, edges) << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
class UnionFind{ //連結判定
private:
std::vector<int> parent; //parent[i] = parent of node i
std::vector<int> rank;
std::vector<int> size;
public:
//constructor
UnionFind(int N){
for(int i=0; i<N; i++) parent.push_back(i); //parent = [0,1,..,N-1]
for(int i=0; i<N; i++) rank.push_back(0); //rank = [0,0,..,0]
for(int i=0; i<N; i++) size.push_back(1);
}
//initialize
void init(int N){
parent.clear();
rank.clear();
size.clear();
for(int i=0; i<N; i++) parent.push_back(i); //parent = [0,1,..,N-1]
for(int i=0; i<N; i++) rank.push_back(0); //rank = [0,0,..,0]
for(int i=0; i<N; i++) size.push_back(1);
}
int root(int a){
if(parent[a] == a) return a;
return parent[a] = root(parent[a]); //親が自分自身になるまで再帰を呼び出す & 経路圧縮
}
void unite(int a, int b){
int rootA = root(a);
int rootB = root(b);
if(rootA == rootB) return; //ノードa, bがすでに連結しているとき
//次数の大きい方を親として連結
if(rank[rootA] < rank[rootB]){
size[rootB] += size[rootA];
parent[rootA] = rootB;
}
else{
size[rootA] += size[rootB];
parent[rootB] = rootA;
if(rank[rootA] == rank[rootB]) rank[rootA]++;
}
}
bool same(int a, int b){
return root(a) == root(b); //ノードa, bが同じ木に属するかどうか
}
int get_size(int a){
return size[root(a)];
}
};
int main()
{
using P = std::pair<int, int>;
int N, K, L;
std::cin >> N >> K >> L;
std::vector<P> route(K), rail(L);
for(int i=0; i<K; i++){
scanf(" %d %d", &(route[i].first), &(route[i].second));
route[i].first--; route[i].second--;
}
for(int i=0; i<L; i++){
scanf(" %d %d", &(rail[i].first), &(rail[i].second));
rail[i].first--; rail[i].second--;
}
UnionFind uf_route(N), uf_rail(N);
for(int i=0; i<K; i++){
int u = route[i].first, v = route[i].second;
uf_route.unite(u, v);
}
for(int i=0; i<L; i++){
int u = rail[i].first, v = rail[i].second;
uf_rail.unite(u, v);
}
std::vector<std::pair<P, int> > root;
for(int i=0; i<N; i++){
int a = uf_route.root(i), b = uf_rail.root(i);
root.push_back(std::pair<P, int>(P(a, b), i));
}
std::sort(root.begin(), root.end());
std::vector<int> tmp, count(N);
for(int i=0; i<N; i++){
tmp.push_back(root[i].second);
if(i == N-1 || (i != N-1 && root[i].first != root[i+1].first)){
int M = tmp.size();
while(!tmp.empty()){
count[tmp.back()] = M;
tmp.pop_back();
}
}
}
for(int i=0; i<N; i++){
printf("%d ", count[i]);
}
printf("\n");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
bool isprime(int x) {
if (x < 2) return false;
for (int i = 2; i * i <= x; ++i)
if (x % i == 0) return false;
return true;
}
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 2; v.size() < n; ++i)
if (isprime(i) && i % 5 == 1) v.push_back(i);
for (int i = 0; i < n; ++i) {
cout << v[i];
if (i == n - 1) {
cout << endl;
} else {
cout << " ";
}
}
}
| #include<iostream>
using namespace std;
int main()
{
int N;
cin>>N;
for(int i=40000;i>=1;i--)
{
if(i*i<=N)
{
cout<<i*i<<endl;
break;
}
}
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k;
cin>>n>>k;
vector<int> p(n);
rep(i, n) cin>>p[i];
vector<int> ki2(n);
rep(i, n) ki2[i]=(p[i]+1);
int sum=0;
rep(i, k) sum+=ki2[i];
int mx=0;
for(int i=0; i+k-1<n; i++){
mx=max(mx, sum);
if(i+k<n) sum+= -ki2[i] +ki2[i+k];
}
double ans=(double)mx/2;
cout<<std::setprecision(15)<<ans<<endl;
return 0;
}
| #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
int main(void){
int N;
double ans=0;
std::cin >> N;
std::vector<int> P(N);
std::vector<std::vector<int>> C(N, std::vector<int>(2));
for (int i = 0; i < N; ++i){
std::cin >> C[i][0] >> C[i][1];
P.at(i) = i;
}
do {
for (int i = 0; i < N - 1; ++i){
ans += std::sqrt((C[P[i + 1]][0] - C[P[i]][0])*(C[P[i + 1]][0] - C[P[i]][0]) + (C[P[i + 1]][1] - C[P[i]][1])*(C[P[i + 1]][1] - C[P[i]][1]));
}
} while (std::next_permutation(P.begin(), P.end()));
for(int i = 2; i <= N; ++i){
ans /= i;
}
std::cout << std::fixed << std::setprecision(10) << ans << std::endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
long long i,j,k,l,m,n,o,p;
string s;
while(cin>>s)
{
if(s[0]=='S'&&s[1]=='A')
cout<<"1"<<endl;
else if(s[0]=='S'&&s[1]=='U')
cout<<"7"<<endl;
else if(s[0]=='M'&&s[1]=='O')
cout<<"6"<<endl;
else if(s[0]=='T'&&s[1]=='U')
cout<<"5"<<endl;
else if(s[0]=='W'&&s[1]=='E')
cout<<"4"<<endl;
else if(s[0]=='T'&&s[1]=='H')
cout<<"3"<<endl;
else if(s[0]=='F'&&s[1]=='R')
cout<<"2"<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
vector<string> vec{"SUN","MON","TUE","WED","THU","FRI","SAT"};
string S;
cin>>S;
for(ll i=0;i<7;i++) {
if(S==vec[i]) {
cout<<7-i<<endl;
}
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int arr[100005 << 2], value[100005], n, q;
void updata(int a, int b, int x, int k = 0, int l = 0, int r = (1 << 17)){
if (b <= l || r <= a)return;
if (a <= l && r <= b){
arr[k] = max(arr[k], x);
return;
}
int m = (l + r) / 2;
updata(a, b, x, k * 2 + 1, l, m);
updata(a, b, x, k * 2 + 2, m, r);
}
int query(int x){
x += (1 << 17) - 1;
int res = arr[x];
while (x){
x = (x - 1) / 2;
res = max(res, arr[x]);
}
return res;
}
int main()
{
value[0] = 2147483647;
scanf("%d%d", &n, &q);
for (int i = 1; i <= q; ++i){
int ch, a, b;
scanf("%d", &ch);
if (ch){
scanf("%d", &a);
printf("%d\n", value[query(a)]);
}else{
scanf("%d%d%d", &a, &b, &value[i]);
++b;
updata(a, b, i);
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const ll INF = 1e17;
template<typename T, typename E, typename F, typename G, typename H>
class LazySegmentTree {
int n, height;
F f; G g; H h; const T ti; const E ei;
vector<T> dat; vector<E> laz; vector<int> highest;
void propagate(int k) {
if(laz[k] != ei) {
laz[2*k] = h(laz[2*k],laz[k]); laz[2*k+1] = h(laz[2*k+1],laz[k]);
dat[k] = g(dat[k],laz[k],n/highest[k]);
laz[k] = ei;
}
}
inline void recalc(int k) {
while(k >>= 1) dat[k] = f(g(dat[2*k],laz[2*k],n/highest[2*k]),g(dat[2*k+1],laz[2*k+1],n/highest[2*k+1]));
}
inline void thrust(int k) {
for(int i = height; i > 0; i--) propagate(k >> i);
}
public:
LazySegmentTree(int _n, F f, G g, H h, T ti, E ei): f(f), g(g), h(h), ti(ti), ei(ei) {
n = 1; height = 0;
while(n < _n) n <<= 1, height++;
dat.assign(2*n,ti); laz.assign(2*n,ei); highest.assign(2*n,0);
int c = 1;
for(int i = 1; i < 2*n; i++) {
if(c*2 <= i) c <<= 1;
highest[i] = c;
}
}
void set(int k, T x) {
dat[k+n] = x;
}
void build() {
for(int i = n-1; i >= 0; i--) {
dat[i] = f(dat[2*i],dat[2*i+1]);
}
}
void update(int a, int b, const E x) {
thrust(a += n); thrust(b += n-1);
for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if(l & 1) laz[l] = h(laz[l],x), ++l;
if(r & 1) --r, laz[r] = h(laz[r],x);
}
recalc(a); recalc(b);
}
T query(int a, int b) {
thrust(a += n); thrust(b += n-1);
T l = ti, r = ti; b++;
while(a < b) {
if(a & 1) l = f(l,g(dat[a],laz[a],n/highest[a])), a++;
if(b & 1) b--, r = f(g(dat[b],laz[b],n/highest[b]),r);
a >>= 1; b >>= 1;
}
return f(l,r);
}
};
int main(){
int n, q;
cin >> n >> q;
auto f = [](ll a, ll b){return a+b;};
auto g = [](ll a, ll b, int l){return b == INF ? a : b*l;};
auto h = [&](ll a, ll b) {return b;};
LazySegmentTree<ll,ll,decltype(f),decltype(g),decltype(h)> lst(n,f,g,h,0,INF);
rep(i,n) lst.set(i,((ll)1<<31)-1);
lst.build();
vector<ll> ans;
rep(i,q) {
int t;
cin >> t;
if(t == 0) {
int l, r; ll x;
cin >> l >> r >> x;
lst.update(l,r+1,x);
} else {
int p;
cin >> p;
ans.push_back(lst.query(p,p+1));
}
}
for(auto x : ans) cout << x << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;
const int mod = 1000000007;
constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};
struct Person{
ll id,d;
vector<ll> friends;
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m;
while(cin >> n >> m && n && m){
vector<ll> p[n+1];
ll a, b;
rep(i,m){
cin >> a >> b;
p[a].pb(b);
p[b].pb(a);
}
set<ll> s;
s.insert(1);
rep(i,p[1].size()){
s.insert(p[1][i]);
for(auto N : p[p[1][i]]){
s.insert(N);
}
}
cout << s.size()-1<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
while (true)
{
int count = 0;
int n, m;
int x = 10, y = 10;
bool table[21][21] = {};
cin >> n;
if (n == 0) return 0;
for (int i = 0; i < n; i++)
{
int X, Y;
cin >> X >> Y;
table[X][Y] = true;
}
cin >> m;
for (int i = 0; i < m; i++)
{
char d;
int p;
cin >> d >> p;
while (p--)
{
if (d == 'N') y++;
if (d == 'E') x++;
if (d == 'S') y--;
if (d == 'W') x--;
if (table[x][y]) count++;
table[x][y] = false;
}
}
if (count == n)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n; cin >> n;
int ans = -1;
for(int i = 1;i*i<=n;i++)
ans = max(ans,i*i);
cout << ans << endl;
return 0;
}
| #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int main(){
ll n;
ll i;
cin >> n;
i=0;
while((i+1)*(i+1)<=n) i++;
cout << i*i;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int P,Q,R;
cin >> P >> Q >> R;
int answer;
answer = min(min(P+Q,Q+R),R+P);
cout << answer << endl;
}
| #include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
#define all(c) (c).begin(), (c).end()
int main() {
int A, B, C, D, E, F;
cin >> A >> B >> C >> D >> E >> F;
int s = A + B + C + D;
s -= min(min(A, B), min(C, D));
cout << s + max(E, F) << "\n";
return 0;
} | 0 |
#include <stdio.h>
int main(){
int y,m,d;
scanf("%d/%d/%d" ,&y,&m,&d);
printf("2018/%02d/%02d" ,m,d);
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iomanip>
int main(void) {
//long double x = 0.1234567890;
//std::cout << x << std::endl;
//test??¨
//std::ifstream in("test.txt");
//std::cin.rdbuf(in.rdbuf());
double x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
long double ans = sqrtl(pow(x1 - x2, 2.0) + pow(y1 - y2, 2.0));
std::cout << std::fixed << std::setprecision(8) << ans << std::endl;
} | 0 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long n,m,d;
scanf("%ld %ld %ld", &n, &m, &d);
long k;
if(d == 0){
k = n;
}
else{
k = 2 * (n - d);
}
k = k * (m - 1);
double dAns = double(k)/double(n * n);
printf("%.10lf", dAns);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m, d;
cin >> n >> m >> d;
cout << fixed << setprecision(20);
double ans = 0;
for (int i = 0; i < m - 1; i++) {
ans += (double)((double)(2 * n - 2 * d) / n) / n;
}
if (d == 0)ans *= 0.5;
cout << ans << endl;
} | 1 |
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
int main() {
string t;
while(getline(cin,t)) {
for(int i = 0; i < 26; i++) {
for(int j = 0; j < t.size(); j++) {
if(t[j] == ' ' || t[j] == '.') continue;
t[j] += 1;
if(t[j] > 'z') t[j] -= 26;
}
if(t.find("the") != string::npos || t.find("that") != string::npos || t.find("this") != string::npos) {
cout << t << endl;
break;
}
}
}
return 0;
} | #include <cstdio>
#include <cstring>
using namespace std;
int main() {
char s[100];
while (fgets(s, sizeof(s), stdin)) {
while (1) {
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] >= 'a' && s[i] < 'z') s[i]++;
else if (s[i] == 'z') s[i] = 'a';
else if (s[i] == '\n') s[i] = '\0';
}
if (strstr(s, "the") || strstr(s, "this") || strstr(s, "that")) break;
}
puts(s);
}
}
| 1 |
#include<iostream>
#include<cstdio>
using namespace std;
#define MAX 100100
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return t?-x:x;
}
int n,a[4][MAX],b[4],c[MAX],t[2];
void WA(){puts("No");exit(0);}
int main()
{
n=read();
for(int i=1;i<=3;++i)
for(int j=1;j<=n;++j)
{
int p=read();
int x=(p-1)%3+1,y=(p+2)/3;
if((i==2&&x!=2)||(i!=2&&x==2))WA();
if((y&1)^(j&1))WA();
a[i][j]=p;
}
for(int j=1;j<=n;++j)
{
for(int i=1;i<=3;++i)b[i]=a[i][j];
int y=(b[1]+2)/3,x=3*y-3;
for(int i=1;i<=3;++i)if(b[i]!=x+i&&b[i]!=x+4-i)WA();
t[j&1]^=(a[1][j]>a[2][j]);c[j]=y;
}
for(int i=1;i<=n;++i)
{
while(c[i]!=i)
{
t[i&1^1]^=1;
swap(c[i],c[c[i]]);
}
}
if(t[0]||t[1])WA();
puts("Yes");return 0;
}
| #include<bits/stdc++.h>
using namespace std;
void gofail(){
cout<<"No\n";
exit(0);
}
const int N=100100;
int a[N],b[N],c[N],sum[3*N],sum1,sum2,n;
void add(int x){for(;x;x-=x&-x)sum[x]^=1;}
int qry(int x){int ans=0;for(;x<=3*n;x+=x&-x)ans^=sum[x];return ans;}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i];
for(int i=1;i<=n;++i)cin>>b[i];
for(int i=1;i<=n;++i)cin>>c[i];
for(int i=1;i<=n;++i){
if(a[i]<b[i]){
if(a[i]+1!=b[i])gofail();
if(b[i]+1!=c[i])gofail();
if(c[i]%3)gofail();
a[i]=a[i]/3+1;b[i]=0;
}else{
if(a[i]-1!=b[i])gofail();
if(b[i]-1!=c[i])gofail();
if(a[i]%3)gofail();
a[i]=a[i]/3;b[i]=1;
}
if((a[i]^i)&1)gofail();
if(i&1)sum2^=b[i];
else sum1^=b[i];
}
for(int i=1;i<=n;i+=2){
sum1^=qry(a[i]);
add(a[i]);
}
memset(sum,0,sizeof sum);
for(int i=2;i<=n;i+=2){
sum2^=qry(a[i]);
add(a[i]);
}
if(sum1||sum2)gofail();
cout<<"Yes\n";
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, R;
cin >> N >> R;
if(N>=10) {
cout << R << endl;
return 0;
}
else {
cout << R + 100 * (10 - N) << endl;
return 0;
}
}
| #include<stdio.h>
int main(){
int n, r, t;
scanf("%d %d", &n, &r);
t = 100 * (10 - n);
if(n<10){
printf("%d\n", r+t);
}
else{
printf("%d\n", r);
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<ll>
#define vp vector<pii>
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.size()
#define F first
#define S second
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define ROF(i,a,b) for(ll i=a;i>=b;--i)
#define trace(x) cerr<<#x<<": "<<x<<'\n';
typedef long long ll;
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
ll mexp(ll a, ll b){
ll ans=1;
a%=MOD;
while(b){
if(b&1) ans=ans*a%MOD;
b>>=1;
a=a*a%MOD;
}
return ans;
}
const int N = 100005;
bool cmp1(pair<int,pair<int,int>>a, pair<int,pair<int,int>>b){
return a.S.F<b.S.F;
}
bool cmp2(pair<int,pair<int,int>>a, pair<int,pair<int,int>>b){
return a.S.S<b.S.S;
}
pair<int,pair<int,int>>c[N];
int par[N],siz[N];
int find(int x){
while(par[x]!=x){
x=par[x];
}
return x;
}
void un(int a,int b){
a=find(a);
b=find(b);
if(siz[a]<siz[b]){
par[a]=par[b];
siz[b]+=siz[a];
}
else{
par[b]=par[a];
siz[a]+=siz[b];
}
}
int main(){
IOS
int n;
cin>>n;
FOR(i,1,n+1){
par[i]=i;
siz[i]=1;
c[i].F=i;
cin>>c[i].S.F>>c[i].S.S;
}
vector<pair<int,pair<int,int>>>v;
sort(c+1,c+n+1,cmp1);
FOR(i,1,n){
v.pb(mp(c[i+1].S.F-c[i].S.F,mp(c[i].F,c[i+1].F)));
}
sort(c+1,c+n+1,cmp2);
FOR(i,1,n){
v.pb(mp(c[i+1].S.S-c[i].S.S,mp(c[i].F,c[i+1].F)));
}
sort(all(v));
int cnt=0;
int i=0;
ll ans=0;
while(cnt<n-1){
int x=find(v[i].S.F),y=find(v[i].S.S);
if(x==y){
i++;
continue;
}
un(x,y);
ans+=v[i].F;
i++;
cnt++;
}
cout<<ans;
cerr<<"Time: "<<1.0/CLOCKS_PER_SEC<<" ms"<<endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MMOD 998244353
#define MAX 2010101
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<Edge>>;
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>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
////////// Union-Find木 //////////
struct UnionFind{
vector<int> par,siz; //par[i]:iの親の番号
UnionFind(int N):par(N),siz(N,1ll){ //最初は全てが根であるとして初期化
for(int i=0; i<N; i++) par[i]=i;
}
int root(int x){ //データxが属する木の根
if(par[x]==x) return x;
return par[x]=root(par[x]);
}
void unite(int x,int y){ //xとyの木を併合
int rx=root(x);
int ry=root(y);
if(rx==ry) return;
if(siz[rx]<siz[ry]) swap(rx,ry);
siz[rx]+=siz[ry];
par[ry]=rx;
}
bool same(int x,int y){ //x,yが属する木が同じならtrueを返す
int rx=root(x);
int ry=root(y);
return rx==ry;
}
int size(int x){
return siz[root(x)];
}
};
//////////////////////////////////////////////////
int main(){
ll N;
cin>>N;
ll X[N],Y[N];
REP(i,N) cin>>X[i]>>Y[i];
vector<pair<ll,ll>> GX,GY;
REP(i,N) GX.PB(MP(X[i],i)),GY.PB(MP(Y[i],i));
SORT(GX),SORT(GY);
Graph G(N);
REP(i,N-1){
G[GX[i].second].PB(Edge(GX[i+1].second,GX[i+1].first-GX[i].first));
G[GX[i+1].second].PB(Edge(GX[i].second,GX[i+1].first-GX[i].first));
G[GY[i].second].PB(Edge(GY[i+1].second,GY[i+1].first-GY[i].first));
G[GY[i+1].second].PB(Edge(GY[i].second,GY[i+1].first-GY[i].first));
}
vector<tuple<ll,ll,ll>> L;
REP(i,N){
FORE(j,G[i]){
L.emplace_back(j.second,j.first,i);
}
}
SORT(L);
UnionFind U(N);
ll ans=0,cnt=0;
REP(i,(ll)L.size()){
if(!U.same(get<1>(L[i]),get<2>(L[i]))){
U.unite(get<1>(L[i]),get<2>(L[i]));
ans+=get<0>(L[i]);
cnt++;
}
if(cnt==N-1){
cout<<ans<<endl;
return 0;
}
}
return 0;
} | 1 |
// ====================================
// author: M_sea
// website: https://m-sea-blog.com/
// ====================================
#include <bits/stdc++.h>
#define file(x) freopen(#x".in","r",stdin); freopen(#x".out","w",stdout)
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long ll;
int read() {
int X=0,w=1; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar();
return X*w;
}
const int N=1000+10;
const int mod=1e9+7;
int qpow(int a,int b) { int c=1;
for (;b;b>>=1,a=1ll*a*a%mod) if (b&1) c=1ll*c*a%mod;
return c;
}
int n,a,b,c,d,dp[N][N];
int fac[N],ifac[N];
void init(int n) {
fac[0]=1;
for (int i=1;i<=n;++i) fac[i]=1ll*fac[i-1]*i%mod;
ifac[n]=qpow(fac[n],mod-2);
for (int i=n;i;--i) ifac[i-1]=1ll*ifac[i]*i%mod;
}
int C(int n,int m) { return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod; }
int main() {
init(1000);
n=read(),a=read(),b=read(),c=read(),d=read();
for (int i=0;i<=b;++i) dp[0][i]=1;
for (int i=1;i<=n;++i)
for (int j=a;j<=b;++j) {
dp[i][j]=dp[i][j-1];
for (int k=c;k<=d;++k) {
if (i-j*k<0) break;
dp[i][j]=(dp[i][j]+1ll*dp[i-j*k][j-1]*C(n-i+j*k,j*k)%mod
*fac[j*k]%mod*ifac[k]%mod*qpow(ifac[j],k))%mod;
}
}
printf("%d\n",dp[n][b]);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
const ll MOD = 1000000007;
const int SIZE = 1010;
ll inv[SIZE],fac[SIZE],finv[SIZE];
void make(){
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2;i<SIZE;i++){
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
fac[i]=fac[i-1]*(ll) i%MOD;
finv[i]=finv[i-1]*inv[i]%MOD;
}
}
ll Combination (int a,int b) {
if(a<b) return 0;
return fac[a]*(finv[b]*finv[a-b]%MOD)%MOD;
}
ll dp[1010][1010];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,a,b,c,d;
cin>>n>>a>>b>>c>>d;
make();
FOR(i,0,1010) dp[i][0] = 1;
FOR(i,a,b+1) {
FOR(j,0,n+1) {
if(dp[i][j] == 0) continue;
if(j != 0) (dp[i+1][j] += dp[i][j]) %= MOD;
ll p = 1;
for(int k = 1; k <= d && j + i * k <= n; k++) {
p = (((p * Combination(n - j - i * (k - 1), i) % MOD) * inv[k]) % MOD) % MOD;
if(k >= c) (dp[i+1][j+i*k] += (dp[i][j] * p) % MOD) %= MOD;
}
}
}
cout << dp[b+1][n] << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int,int_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set_pair tree<pair<int,int>,int_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef pair<int,int> pi;
#define PI 3.1415926535897932384
#define FOR(i,vv,n) for(int i=vv;i<n;i++)
#define FORR(i,n,vv) for(int i=n-1;i>=vv;i--)
#define ve vector
#define maxind(v) (max_element(v.begin(),v.end())-v.begin())
#define minind(v) (min_element(v.begin(),v.end())-v.begin())
#define maxe(v) *max_element(v.begin(),v.end())
#define mine(v) *min_element(v.begin(),v.end())
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mp make_pair
#define M 1000000007ll
#define M1 100000000000000000ll
#define PRECISE cout.precision(18);
#define BS(v,n) binary_search(v.begin(),v.end(),n)
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.begin(),v.end(),greater <int>())
#define F first
#define S second
bool comp(pair <ll,ll> &p1,pair <ll,ll> &p2){
if(p1.F<p2.F)
return 1;
if(p1.F==p2.F){
return p1.S>p2.S;
}
return 0;
}
int main(){
FAST
// PRECISE
ll n;
cin>>n;
ll z=0;
ll L=0,LL=0;
ll R=M,LR=0;
ll MA=0;
ve <pair <ll,ll> > dummy;
FOR(i,0,n){
ll x,y;
cin>>x>>y;
y++;
R=min(R,y);
if(R==y)
LR=max(LR,y-x);
L=max(L,x);
if(L==x)
LL=max(LL,y-x);
dummy.pb({x,y});
MA=max(MA,y-x);
}
ll ans=max(z,R-L)+MA;
ve <pair <ll,ll> > v;
FOR(i,0,n){
ll a1=max(z,dummy[i].S-L);
ll a2=max(z,R-dummy[i].F);
v.pb({a1,a2});
}
sort(v.begin(),v.end(),comp);
ll cm=LR;
FOR(i,0,v.size()){
ll lans=0;
ll a1=v[i].F;
lans=a1+cm;
ans=max(ans,lans);
cm=min(cm,v[i].S);
}
ans=max(ans,cm+LL);
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi frist
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
template<class T> void read(T &x){
int f=0; x=0; char ch=getchar();
for(;!isdigit(ch);ch=getchar()) f|=(ch=='-');
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
if(f) x=-x;
}
const int N=200005;
int a[N],c[N],n,K;
int main(){
read(n),read(K);
rep(i,1,n){
read(a[i]);
}
rep(k,1,K){
memset(c,0,sizeof c);
rep(i,1,n){
int l=max(1,i-a[i]);
int r=min(n,i+a[i]);
c[l]++,c[r+1]--;
}
int flag=0;
rep(i,1,n){
c[i]+=c[i-1];
a[i]=c[i];
if(a[i]<n){
flag=1;
}
}
if(!flag){
break;
}
}
rep(i,1,n){
printf("%d%c",a[i]," \n"[i==n]);
}
return 0;
}
| 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> left(n,0),right(n,0);
left[0] = 0;
if(s[0] == 'W')left[0]++;
reps(i,1,n){
left[i] = left[i-1];
if(s[i] == 'W')left[i]++;
}
right[n-1] = 0;
if(s[n-1] == 'E')right[n-1]++;
for(int j = n-2;j >= 0; j--){
right[j] = right[j+1];
if(s[j] == 'E') right[j]++;
}
// rep(i,n) cout << left[i] << endl;
// cout << endl;
// rep(i,n) cout << right[i] << endl;
// cout << endl;
int ans = right[1];
ans = min(ans,left[n-1]);
rep(i,n-1){
ans = min(ans,right[i+2] + left[i]);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> W(n, 0);
vector<int> E(n, 0);
string s;
cin>>s;
if(s[0] == 'W'){
W[0]++;
}
if(s[0] == 'E'){
E[0]++;
}
for(int i=1; i<n; i++){
if(s[i] == 'W'){
W[i] = W[i-1] + 1;
}else{
W[i] = W[i-1];
}
if(s[i] == 'E'){
E[i] = E[i-1] + 1;
}else{
E[i] = E[i-1];
}
}
int ans = E[n-1] - E[0];
for(int i=1; i<n; i++){
ans = min(ans, E[n-1]-E[i] + W[i-1]);
}
cout<<ans<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a = mul(a, a)) if (b & 1) res = mul(res, a);
return res;
}
int C(int n, int k)
{
if (k < 0 || n < 0 || k > n) return 0;
return mul(fac[n], mul(inv[k], inv[n - k]));
}
int32_t main()
{
fac[0] = 1;
for (int i = 1; i < N; i++) fac[i] = mul(fac[i - 1], i);
inv[N - 1] = Pow(fac[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; i--) inv[i] = mul(inv[i + 1], i + 1);
int n, k; cin >> n >> k;
if (k == 1) return cout << "1\n", 0;
ps[1][1] = dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
dp[i][1] = mul(ps[i - 1][1], C(i * k - 2, k - 2));
for (int j = 2; j <= i; j++) {
dp[i][j] = mul(ps[i - 1][j - 1], C(i * k - j - 1, k - 2));
}
for (int j = i; j >= 1; j--) ps[i][j] = sum(ps[i][j + 1], dp[i][j]);
}
cout << mul(ps[n][1], fac[n]) << "\n";
}
| #include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 3000;
const int MAXM = MAXN*MAXN;
const int MOD = int(1E9) + 7;
int pow_mod(int b, int p) {
int ret = 1;
for(int i=p;i;i>>=1,b=1LL*b*b%MOD)
if( i & 1 ) ret = 1LL*ret*b%MOD;
return ret;
}
int fct[MAXM + 5], ifct[MAXM + 5];
int comb(int n, int m) {
return 1LL*fct[n]*ifct[m]%MOD*ifct[n-m]%MOD;
}
void init() {
fct[0] = 1;
for(int i=1;i<=MAXM;i++)
fct[i] = 1LL*fct[i-1]*i%MOD;
ifct[MAXM] = pow_mod(fct[MAXM], MOD - 2);
for(int i=MAXM-1;i>=0;i--)
ifct[i] = 1LL*ifct[i+1]*(i+1)%MOD;
}
int f[MAXN + 5][MAXN + 5];
int main() {
init();
int N, K; scanf("%d%d", &N, &K);
if( K == 1 ) {
puts("1");
return 0;
}
for(int i=1;i<=N;i++) f[1][i] = 1;
for(int i=2;i<=N;i++) {
for(int j=1;j<=i;j++) {
int m = (K - 1)*(i - 1) + j, n = K - 2;
f[i][j] = 1LL*f[i-1][j]*comb(n+m-1, n)%MOD;
}
for(int j=1;j<=N;j++)
f[i][j] = (f[i][j] + f[i][j-1]) % MOD;
}
printf("%lld\n", 1LL*f[N][N]*fct[N]%MOD);
} | 1 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typedef long long ll;
using namespace std;
int main(){
ll a,b,m;
cin>>a>>b>>m;
ll x[a],y[b],mins1=100005,mins2=100005;
for(int i=0;i<a;i++){
cin>>x[i];
mins1=min(mins1,x[i]);
}
for(int i=0;i<b;i++){
cin>>y[i];
mins2=min(mins2,y[i]);
}
ll mins=mins1+mins2;
for(int i=0;i<m;i++){
ll d,e,f,now;
cin>>d>>e>>f;
now=x[d-1]+y[e-1]-f;
mins=min(now,mins);
}
cout<<mins;
}
| #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
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(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
const int N = 100005;
int n, m, q, a[N], b[N];
void solve() {
read(n), read(m), read(q);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
for (int i = 1; i <= m; ++i) {
read(b[i]);
}
int ans = *std::min_element(a + 1, a + 1 + n) + *std::min_element(b + 1, b + 1 + m);
for (int i = 1; i <= q; ++i) {
int x, y, c;
read(x), read(y), read(c);
ans = std::min(ans, a[x] + b[y] - c);
}
print(ans);
}
int main() {
int T = 1;
// read(T);
while (T--) {
solve();
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int numa[1000000], numb[1000000];
int main(){
int n; cin >> n;
vector<int> a, b;
int x, y;
for (int i = 0; i < n; i++)
{
cin >> x;
a.push_back(x);
numa[x]++;
}
for (int i = 0; i < n; i++)
{
cin >> y;
b.push_back(y);
numb[y]++;
}
for (int i = 1; i <= n; i++)
{
if(numa[i]+numb[i] > n) {
puts("No");
return 0;
}
}
puts("Yes");
for (int i = 1; i <= n; i++)
{
numa[i] += numa[i-1];
numb[i] += numb[i-1];
}
int shift=0;
for (int i = 1; i <= n; i++)
{
shift = max(shift, numa[i] - numb[i-1]);
}
for(int i = 0; i < n; i++){
cout << b.at((i+n-shift)%n) << " ";
}
puts("");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector A(N, 0), B(N, 0);
for (auto &a : A) cin >> a;
for (auto &a : B) cin >> a;
auto f = [&]() {
for (int i = N - 1; i >= 0; i--) {
if (A.at(i) == B.at(i)) return false;
}
cout << "Yes" << "\n";
for (auto ans : B) cout << ans << "\n";
return true;
};
reverse(B.begin(), B.end());
if (f()) return 0;
reverse(B.begin(), B.end());
rotate(B.begin(), B.begin() + (N / 2), B.end());
if (f()) return 0;
cout << "No" << "\n";
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int>a(n);
vector<int>b(m);
rep(i,n)cin>>a[i];
rep(i,m) cin>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
if(max(a[n-1],x)<min(b[0],y))cout<<"No War"<<endl;
else cout<<"War"<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if ((a+b)>(c+d)) {
cout << "Left" << endl;
}
else if ((a+b)<(c+d)){
cout << "Right" << endl;
}
else {
cout << "Balanced" << endl;
}
return 0;
}
| 0 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
int dignum(ll n) {
int res = 0;
while(n > 0) {
res++;
n /= 10;
}
return res;
}
int main(){
ll N;
cin >> N;
int ans = dignum(N); // 最大の桁数を求めて億
for (ll A = 1; A*A <= N; A++) { // Aを1からNまで、A*Aつまり√Aで求める。Nが100ならAは1〜10になる
if(N%A != 0) continue; // NがAで割り切れない場合は飛ばす
ll B = N/A;
int cur = max(dignum(A), dignum(B)); // 関数F（AとBの大きい桁数を保存する)
ans = min(ans, cur); // 最小の値を求める
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include<string>
#include<map>
using namespace std;
int main(){
string s; cin >> s;
int check[26] = {};
for(int i = 0; i < s.size(); i++){
int t = s[i]-'a';
check[t] = 1;
}
for(int i = 0; i < 26; i++){
if(check[i] == 0) {
char ans = 'a' + i;
cout << ans << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, sum=0;
vector<int> v1(3);
for(int i=0;i<3;i++)
{
cin>>v1[i];
}
cin>>k;
sort(v1.begin(),v1.end());
for(int i=1;i<=k;i++){
v1[2]=v1[2]*2;}
for(int i=0;i<3;i++)
{
sum+=v1[i];
}
cout<<sum<<"\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
vector<int>v;
int a,b,c,k;
cin >> a >> b >> c >> k;
v.push_back(a);
v.push_back(b);
v.push_back(c);
int sum = 0;
while(k--)
{
sort(v.begin(),v.end());
v[2]*=2;
}
sum = v[0] + v[1] + v[2];
cout << sum << endl;
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int read(){
int s = 0,ne = 1; char c = getchar();
while(c < '0' || c > '9') ne = c == '-' ? -1 : 1, c = getchar();
while(c >= '0' && c <= '9') s = (s << 1) + (s << 3) + c - '0', c = getchar();
return s * ne;
}
double n, x; int t;
int main()
{
// freopen("_in.in", "r", stdin);
n = read(), x = read(), t = read();
printf("%d", (int)ceil(n / x) * t);
} |
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <utility>
#include <queue>
#define INF 1000000007
using namespace std;
typedef long long int ll;
int main(){
vector<int> dp(31,0);
dp[0]=1;
dp[1]=1;
dp[2]=2;
for (int i=3; i<31; i++) {
dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
}
for (;;) {
int n;
cin >> n;
if(n==0) break;
int ans = dp[n]/(10*365)+1;
cout << ans <<endl;
}
} | 0 |
//#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<cmath>
#include<fstream>
#include <set>
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
const int MAXN =5e5+10;
const int mod = 1e9 + 7;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int inf= 0x3f3f3f3f;
#define eps 1e-8
#define PI 3.1415926535898
#define lowbit(x) (x&(-x))
using namespace std ;
//getline(cin,s);
//set<ll>::iterator it;
//map<int,int>::iterator it;
typedef long long ll;
int n,q;
int c[MAXN],ans[MAXN],rt,pos[MAXN],sum,a[MAXN];
struct node{
int l,r,index;
/*bool operator <(const node& o)const
{
if(pos[l]==pos[o.l]) return r<o.r;
return pos[l]<pos[o.l];
}*/
}need[MAXN];
int cmp(node f,node s)
{
if(pos[f.l]==pos[s.l])
return f.r<s.r;
else return f.l<s.l;
}
void add(int x)
{
a[c[x]]++;
if(a[c[x]]==1) sum++;
}
void del(int x)
{
a[c[x]]--;
if(a[c[x]]==0) sum--;
}
int main()
{
scanf("%d %d",&n,&q);
rt=sqrt(1.0*n);
for(int i=1;i<=n;i++)
{
scanf("%d",&c[i]);
pos[i]=i/rt;
}
for(int i=1;i<=q;i++)
{
scanf("%d %d",&need[i].l,&need[i].r);
need[i].index=i;
}
sort(need+1,need+1+q,cmp);
int l=1,r=0;
for(int i=1;i<=q;i++)
{
while(l<need[i].l)
{
del(l);
l++;
}
while(l>need[i].l)
{
l--;
add(l);
}
while(r<need[i].r)
{
r++;
add(r);
}
while(r>need[i].r)
{
del(r);
r--;
}
ans[need[i].index]=sum;
}
for(int i=1;i<=q;i++) printf("%d\n",ans[i]);
return 0;
}
| #include<iostream>
#include<vector>
using namespace std;
void compute(vector<vector<int> > & cost,vector<vector<int> > & best,
vector<int> & A,int s,int e){
int minc = 0;
int mink = -1;
for(int k=s+1;k<=e;++k){
if (cost[s][k-1] < 0){
compute(cost,best,A,s,k-1);
}
if (cost[k][e] < 0) {
compute(cost,best,A,k,e);
}
int c = cost[s][k-1] + A[s]*A[k]*A[e+1] + cost[k][e];
if (mink < 0 || c < minc) {
minc = c;
mink = k;
}
}
cost[s][e] = minc;
best[s][e] = mink;
}
int main(){
vector<vector<int> > cost,best;
vector<int> A;
int n;
cin >> n;
A.resize(n+1);
for(int i=0;i<n;++i) {
int r,c;
cin >> r >> c;
if (i==0){
A[0] = r;
}
if (A[i] != r){ cout << "error";return (0);}
A[i+1] = c;
}
cost.resize(n);
best.resize(n);
for(int i=0;i<n;++i){
cost[i].resize(n);
best[i].resize(n);
for(unsigned j=0;j<cost[i].size();++j){
cost[i][j] = -1;
best[i][j] = -1;
}
cost[i][i]=0;
best[i][i]=i;
}
compute(cost,best,A,0,n-1);
cout << cost[0][n-1] << std::endl;
return 0;
} | 0 |
#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 all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void hr() {
cerr << "--------------" << endl;
}
const ll INF = 1e18;
const int MOD = 1000000007;
// const int MOD = 998244353;
ll dp[200005][5];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
int k = 1 + n % 2;
rep(i, 0, n + 1) rep(j, 0, k + 1) dp[i][j] = -INF;
dp[0][0] = 0;
rep(i, 0, n) {
rep(j, 0, k + 1) {
chmax(dp[i + 1][j + 1], dp[i][j]);
ll now = dp[i][j];
if ((i + j) % 2 == 0) now += a[i];
chmax(dp[i + 1][j], now);
}
}
ll ans = dp[n][k];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<vector<long>> d(n + 1, vector<long>(5, LLONG_MIN));
d[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 5; j++) {
int k = (i + 1) / 2 - j;
if (k < 0) continue;
{
// don't take i-th
int ii = i - 1;
int jj = (ii + 1) / 2 - k;
if (jj >= 0 && jj < 5) {
if (d[ii][jj] != LLONG_MIN) {
d[i][j] = max(d[i][j], d[ii][jj]);
}
}
}
if (k > 0) {
// take i-th, don't take i-1-th
int ii = i == 1 ? 0 : i - 2;
int jj = (ii + 1) / 2 - (k - 1);
if (jj >= 0 && jj < 5) {
if (d[ii][jj] != LLONG_MIN) {
d[i][j] = max(d[i][j], d[ii][jj] + a[i - 1]);
}
}
}
}
}
int k = n / 2;
int j = (n + 1) / 2 - k;
cout << d[n][j];
return 0;
} | 1 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) vector<vector<ll>> var(n, vector<ll>(m, 0))
#define rep(i,n) for(ll i=(ll)0; i<(ll)n; i++)
#define REP(i,m,n) for(ll i=(ll)m; i<(ll)n; i++)
#define arr(var, n) vec var(n); rep(i,n){cin >> var[i];}
#define arrll(var, n) vecll var(n); rep(i,n){cin >> var[i];}
#define arrst(var, n) vecst var(n); rep(i,n){cin >> var[i];}
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define uniqueall(v) v.erase(unique(v.begin(), v.end()), v.end());
#define f_sum(var) accumulate(all(var), 0)
#define f_sumll(var) accumulate(all(var), 0LL)
#define chmin(v1, v2) v1 = min(v1, v2)
#define chmax(v1, v2) v1 = max(v1, v2)
#define pb(var) push_back(var)
#define prt(var) cout << (var) << "\n"
#define prtd(n, var) cout << fixed << setprecision(n) << (var) << "\n"
#define prtfill(n, var) cout << setw(n) << setfill('0') << (var);
#define prt2(v1, v2) cout << (v1) << " " << (v2) << "\n"
#define prt3(v1, v2, v3) cout << (v1) << " " << (v2) << " " << (v3) << "\n"
#define prtall(v) rep(i,v.size()){cout<<v[i]<<(i!=v.size()-1?" ":"\n");}
void prtok(bool ok){prt(ok ? "Yes" : "No");}
//----------------------------------------------------------------
int main(void) {
int h, w, k;
cin >> h >> w >> k;
vecll2(dp, h+1, w+2);
dp[0][1]=1;
vecll num={1,2,3,5,8,13,21};
rep(i,h){
REP(j,1,w+1){
ll p = max(0ll, j-2-1);
ll q = max(0ll, w-(j+1));
dp[i+1][j] += dp[i][j-1]*num[p]*num[q];
dp[i+1][j] %= MOD;
p = max(0ll, j-1-1);
dp[i+1][j] += dp[i][j]*num[p]*num[q];
dp[i+1][j] %= MOD;
q = max(0ll, w-(j+2));
dp[i+1][j] += dp[i][j+1]*num[p]*num[q];
dp[i+1][j] %= MOD;
}
}
prt(dp[h][k]);
}
| #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
ll num[110][8];
int main(){
int H,W,k;
ll ans;
cin>>H>>W>>k;
num[0][0]=1;
bool f=true;
for(int i=1;i<8;i++) num[0][i]=0;
for(int h=1;h<=H;h++){
for(int w=0;w<(1<<(W-1))-1;w++){
for(int i=0;i<W-1;i++){
if(w>>i & 1 && w>>(i+1) & 1) f=false;
}
if(f){
int v[]={0,1,2,3,4,5,6,7};
for(int i=0;i<W-1;i++){
if(w>>i & 1){
v[W-1-i]--;
v[W-1-i-1]++;
}
}
for(int i=0;i<8;i++){
num[h][i]+=num[h-1][v[i]];
num[h][i]%=MOD;
}
}
f=true;
}
}
if(W==1){
ans=1;
}else{
ans=num[H][k-1];
}
cout<<ans<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,Q,K,A,B;
string S;
//const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);
template<class T> bool chmin(T &a, const T &b){
if(a > b) {a = b; return true;}
else return false;
}
template<class T> bool chmax(T &a, const T &b){
if(a < b) {a = b; return true;}
else return false;
}
ll check(set<P> &s){
ll last = -INF * 2, res = INF;
for(P p : s){
if(p.se){
chmin(res, p.fi - last);
}else{
last = p.fi;
}
}
return res;
}
int main() {
const ll t2 = 200000;
typedef vector<vector<set<P> > > mats;
map<char, int> ctoi = {{'U', 0}, {'R', 1}, {'D', 2}, {'L', 3}};
cin>>N;
vec x(N), y(N), u(N);
//0 : up
mats memo(6, vector<set<P>>(400001));
rep(i,N) {
char c;
cin>>x[i]>>y[i]>>c;
u[i] = ctoi[c];
if(u[i] < 2){
memo[u[i]][u[i] ? y[i] : x[i]].emplace(u[i] ? x[i] : y[i], 0);
memo[u[i] + 2][y[i] - x[i] + t2].emplace(y[i] + x[i], 0);
}else{
memo[u[i] - 2][u[i] - 2 ? y[i] : x[i]].emplace(u[i] - 2 ? x[i] : y[i], 1);
memo[5 - u[i]][y[i] - x[i] + t2].emplace(y[i] + x[i], 1);
}
if(u[i] == 0){
memo[4][y[i] + x[i]].emplace(y[i] - x[i], 0);
}else if(u[i] == 1){
memo[4][y[i] + x[i]].emplace(y[i] - x[i], 1);
}else if(u[i] == 2){
memo[5][y[i] + x[i]].emplace(y[i] - x[i], 1);
}else{
memo[5][y[i] + x[i]].emplace(y[i] - x[i], 0);
}
}
ll res = INF;
rep(i,6){
rep(j, 400001){
chmin(res, check(memo[i][j]));
}
}
if(res == INF) cout<<"SAFE"<<endl;
else cout<<res * 5<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) for(auto e:v){cout<<e<<" ";};cout<<endl;
#define vvprint(vv) for(auto v:vv)vprint(v);
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll H, W;
cin >> H >> W;
vll A(H), B(H);
rep(i, H) cin >> A[i] >> B[i];
map<int, int> m;
rep(i, W) m[i] = 0;
multiset<int> ms;
rep(i, W) ms.insert(0);
vll ans(H, 0);
rep(i, H){
int a = A[i]-1;
int b = B[i]-1;
auto lb = m.lower_bound(a);
auto ub = m.upper_bound(b);
if(lb!=m.end() && lb!=ub){
--ub;
auto it = lb;
int k = ub->first;
int v = ub->second;
while(it!=m.end() && it->first!=k){
int v = it->second;
ms.erase(ms.find(v));
it = m.erase(it);
}
if(b<W-1 && m.count(b+1)==0){
m[b+1] = v+b-k+1;
ms.insert(v+b-k+1);
}
m.erase(k);
ms.erase(ms.find(v));
}
if(ms.empty()) ans[i] = -1;
else ans[i] = *ms.begin() + i + 1;
}
rep(i, H) cout << ans[i] << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T;
char c = 'W';
for (int i = 0; i < N * 2; i++){
if (S[i] != c){
T += 'L';
c = 'B' + 'W' - c;
} else {
T += 'R';
c = 'B' + 'W' - c;
}
}
int cnt = 0;
for (int i = 0; i < N * 2; i++){
if (T[i] == 'L'){
cnt++;
}
}
if (cnt != N){
cout << 0 << endl;
} else {
int L = 0;
long long ans = 1;
for (int i = 0; i < N * 2; i++){
if (T[i] == 'L'){
L++;
} else {
ans *= L;
ans %= MOD;
L--;
}
}
for (int i = 1; i <= N; i++){
ans *= i;
ans %= MOD;;
}
cout << ans << endl;
}
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define ll long long
#define eps LDBL_EPSILON
#define mod (ll)1000000007
#define INF LLONG_MAX/10
#define P pair<int,int>
#define prique priority_queue
using namespace std;
int n;
string s;
bool b[200010];
signed main() {
cin >> n >> s;
if (s[0] == 'W' || s.back() == 'W') {
cout << 0 << endl;
return 0;
}
REP(i, 2 * n - 1) {
if (s[i - 1] == s[i] && !b[i - 1])b[i] = true;
if (s[i - 1] != s[i] && b[i - 1])b[i] = true;
}
if (!b[2 * n - 1]) {
cout << 0 << endl;
return 0;
}
int ans = 1, cnt = 0;
rep(i, 2 * n) {
if (b[i]) {
ans *= cnt;
ans %= mod;
cnt--;
}
else cnt++;
}
if (cnt) {
cout << 0 << endl;
return 0;
}
REP(i, n) {
ans *= i;
ans %= mod;
}
cout << ans << endl;
} | 1 |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <iomanip>
#define dibs reserve
#define OVER9000 1234567890
#define tisic 47
#define soclose 1e-8
#define patkan 9
#define ff first
#define ss second
using uint = unsigned int;
using cat = long long;
using dbl = long double;
constexpr dbl pi = 3.14159265358979323846;
using namespace std;
#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif
template <typename T>
T abs(T x) {return (x < 0) ? -x : x;}
cat pw(cat a, cat e, cat mod) {
if(e <= 0) return 1;
cat x = pw(a, e/2, mod);
x = x * x % mod;
return (e&1) ? x * a % mod : x;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string S;
int K;
cin >> S >> K;
S += '0';
int L = S.length(), n1 = 0, N = 0;
vector<int> A;
for(int i = 0, cur = 0; i < L; i++) {
if(S[i] == '0') {
A.push_back(cur);
N++;
cur = 0;
}
else n1++, cur++;
}
K = min(K, n1);
reverse(begin(A), end(A));
cat mod = 998244353;
vector< vector< vector<cat> > > cnt(N+1, vector< vector<cat> >(K+1, vector<cat>(K+1, 0)));
cnt[0][0][0] = 1;
for(int i = 0; i < N; i++) {
// increase/keep A[i]
for(int k = 0; k <= K; k++) {
cnt[i+1][k][k] = cnt[i][k][k];
for(int j = k-1; j >= 0; j--) cnt[i+1][j][k] = cnt[i+1][j+1][k] + cnt[i][j][k];
}
// decrease A[i]
for(int j = 0; j <= K; j++)
for(int l = 1; l <= A[i]; l++)
for(int k = j; k <= K-l; k++) cnt[i+1][j+l][k+l] += cnt[i][j][k];
for(int j = 0; j <= K; j++) for(int k = j; k <= K; k++) cnt[i+1][j][k] %= mod;
}
cat ans = 0;
for(int i = 0; i <= K; i++) ans += cnt[N][0][i];
ans %= mod;
cout << ans << "\n";
}
| #include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<string>
#include<bitset>
#include<memory>
using namespace std;
using ll=long long;
const int MAX_N = 300;
int dp[MAX_N+1][MAX_N+1][MAX_N+1];
const int MOD = 998244353;
int madd(int lhs,int rhs){
int tmp = lhs+rhs;
return tmp>=MOD ? tmp-MOD : tmp;
}
int main(){
string s;
cin>>s;
int K;
cin>>K;
int n = s.size();
vector<int> pack(n+1);
int sum = 0;
for(int i=0;i<n;i++){
if(s[i]=='0') sum++;
else pack[sum]++;
}
if(sum==n){
cout<<1<<endl;
return 0;
}
dp[0][0][min(K,n)]=1;
for(int i=0;i<n;i++){
for(int j=0;j<=n;j++){
for(int k=0;k<=n;k++){
if(dp[i][j][k]==0) continue;
for(int x=0;x<pack[i];x++){
if(j-(pack[i]-x)>=0) dp[i+1][j-(pack[i]-x)][k] = madd(dp[i+1][j-(pack[i]-x)][k],dp[i][j][k]);
}
for(int x=pack[i];j+x-pack[i]<=n && k-(x-pack[i])>=0;x++){
dp[i+1][j+(x-pack[i])][k-(x-pack[i])] = madd(dp[i+1][j+(x-pack[i])][k-(x-pack[i])],dp[i][j][k]);
}
}
}
}
int res = 0;
int pos = n;
for(int k=0;k<=n;k++){
res = madd(res,dp[pos][0][k]);
}
cout<<res<<endl;
return 0;
}
| 1 |
#include<iostream>
using namespace std;
#define NMAX 20
int main(){
int M,N,l;
int x[NMAX],y[NMAX];
char d;
bool ok[21][21];
while(1){
cin>>N;
if(N==0) break;
for(int i=0;i<N;i++){
cin>>x[i]>>y[i];
}
cin>>M;
int nx=10,ny=10;
for(int i=0;i<21;i++){
for(int j=0;j<21;j++){
ok[i][j]=false;
}
}
ok[10][10]=true;
for(int i=0;i<M;i++){
cin>>d>>l;
for(int j=0;j<l;j++){
if(d=='N') ny++;
if(d=='S') ny--;
if(d=='W') nx--;
if(d=='E') nx++;
ok[ny][nx]=true;
}
}
bool f=true;
for(int i=0;i<N;i++){
if(!ok[y[i]][x[i]]) f=false;
}
if(f) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
struct edge { int to, cost; };
bool operator<(const edge& e1, const edge& e2) { return e1.cost < e2.cost; }
int n, m, a1, a2, a3, a4, q;
int main() {
while(cin >> m >> n, n | m) {
vector<vector<edge> > G1(n), G2(n);
for(int i = 0; i < m; i++) {
cin >> a1 >> a2 >> a3 >> a4; a1--, a2--;
G1[a1].push_back(edge{a2, a3});
G1[a2].push_back(edge{a1, a3});
G2[a1].push_back(edge{a2, a4});
G2[a2].push_back(edge{a1, a4});
}
cin >> q;
while(q--) {
cin >> a1 >> a2 >> a3; a1--, a2--;
if(a3 == 0) {
priority_queue<edge> que; que.push(edge{a1, 0});
vector<int> d(n, 999999999); d[a1] = 0;
while(!que.empty()) {
int u = que.top().to; que.pop();
for(edge e: G1[u]) {
if(d[e.to] > d[u] + e.cost) {
d[e.to] = d[u] + e.cost;
que.push(edge{e.to, -d[e.to]});
}
}
}
cout << d[a2] << endl;
}
else {
priority_queue<edge> que; que.push(edge{a1, 0});
vector<int> d(n, 999999999); d[a1] = 0;
while(!que.empty()) {
int u = que.top().to; que.pop();
for(edge e: G2[u]) {
if(d[e.to] > d[u] + e.cost) {
d[e.to] = d[u] + e.cost;
que.push(edge{e.to, -d[e.to]});
}
}
}
cout << d[a2] << endl;
}
}
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, a, b) for(int i=(a); i<(b); i++)
#define per(i, a, b) for(int i=(b)-1; i>=(a); i--)
#define sz(a) (int)a.size()
#define de(a) cout << #a << " = " << a << endl
#define dd(a) cout << #a << " = " << a << " "
#define all(a) a.begin(), a.end()
#define pw(x) (1ll<<(x))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define rep_it(it,x) for (__typeof((x).begin()) it=(x).begin(); it!=(x).end(); it++)
#define ____ puts("\n_______________\n\n")
#define debug(x) ____; cout<< #x << " => " << (x) << endl
#define debug_pair(x) cout<<"\n{ "<<(x).fir<<" , "<<(x).sec<<" }\n"
#define debug_arr(x,n) ____; cout<<#x<<":\n"; rep(i,0,n+1) cout<<#x<<"["<<(i)<<"] => "<<x[i]<<endl
#define debug_arr2(x,n,m) ____; cout<<#x<<":\n"; rep(i,0,n) rep(j,0,m) cout<<#x<<"["<<(i)<<"]["<<(j)<<"]= "<<x[i][j]<<((j==m)?"\n\n":" ")
#define debug_set(x) ____; cout<<#x<<": \n"; rep_it(it,x) cout<<(*it)<<" "; cout<<endl
#define debug_map(x) ____; cout<<#x<<": \n"; rep_it(it,x) debug_pair(*it)
void file_put() {
freopen("filename.in", "r", stdin);
freopen("filename.out", "w", stdout);
}
const int N=1e5+5;
int n,ans=0,a[N],k; bool v[N]; int f[N][20],id[N],p[N],dep[N]; vi V[N];
int G(int x,int k) {
per(i,0,20) if (k>>i&1) x=f[x][i];
return x;
}
void dfs(int x,int d) {
v[x]=1; if (dep[x]==-1) dep[x]=d;
for (auto y:V[x]) if (!v[y]) dfs(y,d+1);
}
bool cmp(int x,int y) {
return dep[x]>dep[y];
}
int main() {
// file_put();
scanf("%d%d",&n,&k);
rep(i,1,n+1) scanf("%d",&a[i]);
ans=(a[1]!=1),a[1]=1;
rep(i,2,n+1) V[a[i]].pb(i);
memset(dep,-1,sizeof(dep));
dfs(1,0); memset(v,0,sizeof(v));
if (k>=n-1) return 0*printf("%d\n",ans);
rep(i,1,n+1) f[i][0]=a[i];
rep(i,1,20) rep(j,1,n+1) f[j][i]=f[f[j][i-1]][i-1];
rep(i,1,n+1) p[i]=G(i,k-1),id[i]=i;
sort(id+1,id+n+1,cmp);
rep(i,1,n+1) {
if (dep[id[i]]<=k) break;
if (v[id[i]]) continue;
if (a[p[id[i]]]==1) continue;
ans++;
dfs(p[id[i]],0);
// debug_arr(dep,n);
}
printf("%d\n",ans);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
template<class T> void chmax(T&x, T y){if(x < y) x = y;}
int N, K;
vector<int> G[100010];
int ans;
int dfs(int v, int p){
int mx = 1;
for(auto u : G[v]){
chmax(mx, dfs(u, v) + 1);
}
if(mx == K && p > 1) mx = 0, ans++;
return mx;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> K;
for(int i = 1; i <= N; i++){
int p;
cin >> p;
if(i == 1) ans += (p == 1 ? 0 : 1);
else G[p].push_back(i);
}
dfs(1, 0);
cout << ans << endl;
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main(){
while(1){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0)break;
int p[100002]; // 1-origin
for(int i = 1; i <= m; i++){
cin >> p[i];
}
int gap = 0, ans;
for(int i = nmin; i <= nmax; i++){
if(p[i] - p[i + 1] >= gap){
gap = p[i] - p[i + 1];
ans = i;
}
}
cout << ans << endl;
//cout << gap << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
#include <complex>
#include <utility>
#include <numeric>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define VI vector<int>
#define VS vector<string>
#define all(a) (a).begin(),(a).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef long long int ll;
typedef string::const_iterator State;
typedef pair<int,int> P;
class ParseError {};
const ll INF=1LL<<50;
char fi[101][101];
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
double EPS = 1e-14;
const int MAX_V=100;
const int MAX_N=100;
char o[3]={'+','-','*'};
#define md 1000003
int bow[353][353]={0};
double add(double a,double b){
if(abs(a+b)<EPS*(abs(a)+abs(b)))
return 0;
return a+b;
}
/*struct P{
double x,y;
P(){}
P(double x,double y):x(x),y(y){
}
P operator + (P p){
return P(add(x,p.x),add(y,p.y));
}
P operator - (P p){
return P(add(x,-p.x),add(y,-p.y));
}
P operator *(double d){
return P(x*d,y*d);
}
double dot(P p){
return add(x*p.x,y*p.y);
}
double det(P p){
return add(x*p.y,-y*p.x);
}
};
bool cmp_x(const P& p,const P& q){
if(p.x!=q.x) return p.x<q.x;
return p.y<q.y;
}
vector<P> convex_hull(P* ps, int n){
sort(ps,ps+n,cmp_x);
int k=0;
vector<P> qs(n*2);
rep(i,n){
while(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
for(int i=n-2,t=k;i>=0;i--){
while(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
qs.resize(k-1);
return qs;
}
int n,m;
vector<double> p;
P ps[101];
*/
//char c[520][520];
long long mod=1000000007;
long long pow(ll i,ll j){
ll tmp=1;
while(j){
if(j%2) tmp=tmp*i%mod;
i=i*i%mod;
j/=2;
}
return tmp;
}
int expression(State&);
int term(State&);
int factor(State&);
int number(State&);
int expression(State &begin){
int ret = term(begin);
for(;;){
if(*begin == '+'){
begin++;
ret += term(begin);
}
else if(*begin == '-'){
begin++;
ret -= term(begin);
}
else
break;
}
return ret;
}
int term(State &begin){
int ret = factor(begin);
for(;;){
if(*begin=='*'){
begin++;
ret *= factor(begin);
}
else if(*begin=='/'){
begin++;
ret /= factor(begin);
}
else
break;
}
return ret;
}
int factor(State &begin){
int ret;
if(*begin == '('){
begin++;
ret = expression(begin);
begin++;
}
else
ret = number(begin);
return ret;
}
int number(State &begin){
int ret =0;
while(isdigit(*begin)){
ret*=10;
ret+=*begin - '0';
begin++;
}
return ret;
}
ll n,ans;
void tansaku(int k,int s,set<int> f){
if(s==0&&k==0)
ans++;
else if(s<=0||k<=0){
return;
}
else{
for(int i=1;i<=n;i++){
if(f.count(i)==0){
f.insert(i);
tansaku(k-1,s-i,f);
}
}
}
}
int main(void){
ll m,a,b;
while(cin>>m>>a>>b,m!=0||a!=0||b!=0){
vector<ll> t(m);
ll ma=0,j=0;
for(int i=0;i<m;i++){
cin>>t[i];
}
sort(t.begin(),t.end());
int k=0;
for(int i=a;i<=b;i++){
//cout<<t[t.size()-i]<<" "<<t[t.size()-1-i]<<endl;
if(ma<=t[t.size()-i]-t[t.size()-i-1]){
ma=t[t.size()-i]-t[t.size()-i-1];
k=i;
}
}
cout<<k<<endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
string s;
ll c[26];
int main(){
cin >> s;
for(auto &e : s) c[e-'a']++;
ll ans = s.size() * (s.size()-1) / 2;
for(int i=0;i<26;i++){
ans -= c[i] * (c[i]-1) / 2;
}
cout << ans+1 << endl;
return 0;
} | /*Lower_Rating*/
/*AGC040 B*/
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
#define LL long long
#define MAXN 800000
#define MOD 998244353
#define Pr pair<int,int>
#define X first
#define Y second
#define INF 2000000000
#define mem(x,p) memset(x,p,sizeof(x))
LL read(){
LL x=0,F=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')F=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
return x*F;
}
int add(int x,int y){return (x+y>=MOD)?x+y-MOD:x+y;}
int dec(int x,int y){return (x-y<0)?x-y+MOD:x-y;}
int mul(int x,int y){return 1LL*x*y%MOD;}
int n,mn,id;
struct Seg{
int l,r;
}p[MAXN+5];
bool cmp(Seg s1,Seg s2){
if(s1.l==s2.l)return s1.r<s2.r;
return s1.l<s2.l;
}
int bin(int l1,int r1,int l2,int r2){
return max(min(r1,r2)-max(l1,l2)+1,0);
}
int main()
{
n=read();mn=INF;
for(int i=1;i<=n;i++)
p[i].l=read(),p[i].r=read();
sort(p+1,p+n+1,cmp);
int l1=p[1].l,r1=p[1].r,l2=p[2].l,r2=p[2].r;
for(int i=2;i<=n;i++){
int val1=max(r2-l2+1,0)+bin(l1,r1,p[i].l,p[i].r);
int val2=max(r1-l1+1,0)+bin(l2,r2,p[i].l,p[i].r);
int val3=max(p[i].r-p[i].l+1,0)+bin(l1,r1,l2,r2);
if(val1>=val2&&val1>=val3){
l1=max(l1,p[i].l);
r1=min(r1,p[i].r);
}else if(val2>=val1&&val2>=val3){
l2=max(l2,p[i].l);
r2=min(r2,p[i].r);
}else{
l1=max(l1,l2);
r1=min(r1,r2);
l2=p[i].l,r2=p[i].r;
}
}
printf("%d",max(r1-l1+1,0)+max(r2-l2+1,0));
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
// GCD, LCM
// https://youtu.be/8lm8o8L9Bmw?t=2285
// https://youtu.be/XI8exXVxZ-Q?t=3595
// https://youtu.be/F2p_e6iKxnk?t=843
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
ll N,K;
cin >>N >> K;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
if(A.back()<K){
cout << "IMPOSSIBLE" << endl;
return 0;
}
ll g = A[0];
for(int i=1;i<N;i++){
g = gcd(g,A[i]);
}
if(K%g ==0){
cout <<"POSSIBLE" << endl;
}else{
cout <<"IMPOSSIBLE" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
string s = "";
string buf(w+2, '.');
s += buf;
for (int i = 0; i < h; i++) {
string si;
cin >> si;
s += "." + si + ".";
}
s += buf;
for (int i = 1; i < h+1; i++) {
for (int j = 1; j < w+1; j++) {
if (s.at(i*(w+2)+j) == '#') {
char sij_up = s.at((i-1)*(w+2)+j);
char sij_down = s.at((i+1)*(w+2)+j);
char sij_right = s.at(i*(w+2)+j+1);
char sij_left = s.at(i*(w+2)+j-1);
if (sij_up == '.' && sij_down == '.' && sij_right == '.' && sij_left == '.') {
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,p;
while(cin>>n>>p,n+p)
{
int a[n];
for (int i = 0; i < n; ++i) a[i]=0;
int turn=0,s=p;
while(1)
{
if(s>0)
{
++a[turn],--s;
if(a[turn]==p) break;
++turn;
if(turn==n) turn=0;
}
else
{
if(a[turn]>0) s=a[turn],a[turn]=0;
++turn;
if(turn==n) turn=0;
}
}
cout<<turn<<endl;
}
return 0;
}
| #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
typedef pair<int,int> P;
int w,h;
int grid[21][21];
P start,goal;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
bool isvalid(int x,int y){
return (x>=0&&x<w&&y>=0&&y<h);
}
int dfs(P p, int t){
if(p == goal) return t;
if(t > 10) return t;
int ret = 100;
int x = p.first;
int y = p.second;
REP(r,4){
int nx = x + dx[r];
int ny = y + dy[r];
if(isvalid(nx,ny) && grid[ny][nx] != 1){
while(isvalid(nx,ny)){
if(grid[ny][nx] == 3 ||
(isvalid(nx+dx[r],ny+dy[r]) && grid[ny+dy[r]][nx+dx[r]] == 1)){
if(grid[ny][nx] != 3) grid[ny+dy[r]][nx+dx[r]] = 0;
ret = min(ret,dfs(P(nx,ny),t+1));
if(grid[ny][nx] != 3) grid[ny+dy[r]][nx+dx[r]] = 1;
break;
}
nx += dx[r];
ny += dy[r];
}
}
}
return ret;
}
int main(){
while(cin>>w>>h,w){
REP(y,h)REP(x,w){
cin>>grid[y][x];
if(grid[y][x]==2){
start = P(x,y);
}
if(grid[y][x]==3){
goal = P(x,y);
}
}
int ans = dfs(start,0);
if(ans > 10) ans = -1;
cout<<ans<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
set<pair<int, int>> st;
multiset<int> mst;
for (int i = 0; i < w; i++) {
st.emplace(i, i);
mst.emplace(0);
}
st.emplace(w, w);
int inf = 1e9;
mst.emplace(inf);
for (int i = 0; i < h; i++) {
int a, b;
cin >> a >> b;
a--;
vector<pair<int, int>> v;
int c = -1;
for (auto it = st.lower_bound({a, -1}); it != st.end(); it++) {
pair<int, int> p = *it;
if (a <= p.first && p.first <= b) {
c = max(c, p.second);
v.emplace_back(p);
} else {
break;
}
}
for (auto p : v) {
st.erase(p);
mst.erase(mst.find((p.first == w ? inf : p.first - p.second)));
}
if (c != -1) {
st.emplace(b, c);
if (b == w) {
b = inf;
c = 0;
}
mst.emplace(b - c);
}
int res = *mst.begin();
if (res >= 1e8) {
cout << -1 << '\n';
} else {
cout << res + i + 1 << '\n';
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}
int H, W;
bitset<160 * 160 + 1> dp[81][81];
int cost[81][81];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> H >> W;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> cost[i][j];
}
}
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
int tmp;
cin >> tmp;
cost[i][j] -= tmp;
}
}
int s = H + W - 1;
dp[0][0][80 + cost[0][0]] = true;
dp[0][0][80 - cost[0][0]] = true;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
dp[i + 1][j] |= dp[i][j] << (80 + cost[i + 1][j]);
dp[i + 1][j] |= dp[i][j] << (80 - cost[i + 1][j]);
dp[i][j + 1] |= dp[i][j] << (80 + cost[i][j + 1]);
dp[i][j + 1] |= dp[i][j] << (80 - cost[i][j + 1]);
}
}
int ans = inf;
for(int i = 0; i <= s * 160; i++){
if(!dp[H - 1][W - 1][i]) continue;
chmin(ans, abs(i - s * 80));
}
cout << ans << endl;
return 0;
} | 0 |
#include <stdio.h>
typedef long long var;
const int N = 210005;
const int MOD = 1e9 + 7;
int h, w, a, b;
var inv[N + 1], fac[N + 1], invfac[N + 1];
var f(int n, int m);
var c(int n, int m);
int main() {
inv[0] = fac[0] = invfac[0] = inv[1] = 1;
for (int i = 2; i <= N; ++i)
inv[i] = ((MOD - MOD / i) * inv[MOD % i]) % MOD;
for (int i = 1; i <= N; ++i) {
fac[i] = (fac[i - 1] * i) % MOD;
invfac[i] = (invfac[i - 1] * inv[i]) % MOD;
}
scanf("%d%d%d%d", &h, &w, &a, &b);
var res = f(h, w);
for (int i = 1; i <= a; ++i)
(res -= (f(h - i + 1, b) * f(i, w - b)) % MOD) %= MOD;
printf("%lld\n", (res + MOD) % MOD);
return 0;
}
var f(int n, int m) {
return c((n - 1) + (m - 1), m - 1);
}
var c(int n, int m) {
if (n < 0 || m < 0 || n < m) return 0;
return (((fac[n] * invfac[m]) % MOD) * invfac[n - m]) % MOD;
}
| /* Author: Dhruv Rastogi */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(),sdk.end()
#define mll map<int, int>
#define pb push_back
#define rep(i,a,b) for(int i=a;i<b;++i)
#define repd(i,a,b) for(int i=a;i>=b;--i)
#define mp make_pair
#define hell 1000000007
#define endl '\n'
#define vvll vector<vector<int> >
#define vll vector<int>
#define mint map<int,int>
#define sz(x) (int)x.size()
#define sll set<int>
#define pll pair<int,int>
#define F first
#define S second
const long double PI = acos(-1.0);
int dp[45][2][1<<18];
void solve(){
dp[0][0][1]=1;
int n,x,y,z;
cin>>n>>x>>y>>z;
int reqd_mask = 1|(1<<z)|(1<<(y+z))|(1<<(x+y+z));
rep(i,0,n){
rep(j,0,2){
rep(k,0,1<<18){
rep(d,1,11){
int new_mask = ((k<<d)|1)&((1<<18)-1);
int new_j = j;
if((new_mask&reqd_mask)==reqd_mask) new_j=1;
dp[i+1][new_j][new_mask]+=dp[i][j][k];
dp[i+1][new_j][new_mask]%=hell;
}
}
}
}
int ans=0;
rep(i,0,1<<18){
ans+=dp[n][1][i];
ans%=hell;
}
cout<<ans<<endl;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
// Californium:Paken
vector<bool> seen;
void dfs(const Graph& G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v]) continue; // next_v が探索済だったらスルー
dfs(G, next_v); // 再帰的に探索
}
}
signed main() {
int L, R; cin >> L >> R;
int M = 2019;
if (L / 2019 == R / 2019 && L % 2019 != 0) {
for (int X = L; X < min(L+2019,R); X++) {
for (int Y = X+1; Y <= min(L+2019,R); Y++) {
M = min(M,X*Y%2019);
}
}
cout << M << endl;
}
else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
// 素因数が何乗かをmapで返却する
map< ll, int > prime_factor(ll n) {
map< ll, int > ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
void solve() {
ll N, M; cin >> N >> M;
auto pf = prime_factor(M);
ll res = 1;
for(auto a: pf){
res = modint(modint(res) * comb(a.second + N - 1, a.second));
}
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
init_f();
//init();
//int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
struct edge{
ll to, cost;
};
int main()
{
ll N;
cin >> N;
vector<vector<ll>> A(N-1,vector<ll>(3));
vector<vector<edge>> vec(N,vector<edge> ());
REP(i, N-1){
REP(j, 3){
cin >> A.at(i).at(j);
}
A.at(i).at(0)--;
A.at(i).at(1)--;
edge e1 = {A.at(i).at(1),A.at(i).at(2)};
edge e2 = {A.at(i).at(0),A.at(i).at(2)};
vec.at(A.at(i).at(0)).push_back(e1);
vec.at(A.at(i).at(1)).push_back(e2);
}
ll Q,K;
cin >> Q >> K;
K--;
queue<ll> que;
vector<ll> dist(N,-1);
que.push(K);
dist[K]=0;
while(!que.empty()){
ll v = que.front();
que.pop();
for(auto e:vec.at(v)){
ll nv = e.to;
ll ncost = e.cost;
if(dist[nv]!=-1) continue;
dist[nv]=dist[v]+ncost;
que.push(nv);
}
}
vector<ll> ans(Q);
REP(i,Q){
ll x,y;
cin >> x >> y;
x--;
y--;
ans.at(i)=dist[x]+dist[y];
}
REP(i,Q){
cout << ans.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const int dx[] = {0, -1, 0, 1};
const int dy[] = {1, 0, -1, 0};
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll LINF = 1LL << 60;
struct edge {
ll to, cost;
};
vector<vector<edge>> g;
vector<bool> visited;
vector<ll> dist;
void dfs(int s) {
visited[s] = true;
rep(i, g[s].size()) {
if (visited[g[s][i].to]) continue;
int to = g[s][i].to, cost = g[s][i].cost;
dist[to] = dist[s] + cost;
dfs(to);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////
ll n;
cin >> n;
g.resize(n);
visited.resize(n);
dist.resize(n);
rep(i, n) {
visited[i] = false;
dist[i] = LINF;
}
rep(i, n - 1) {
ll a, b, c;
cin >> a >> b >> c;
--a;
--b;
g[a].push_back(edge{b, c});
g[b].push_back(edge{a, c});
}
ll q, k;
cin >> q >> k;
--k;
dist[k] = 0;
dfs(k);
rep(i, q) {
ll x, y, ans = 0;
cin >> x >> y;
--x;
--y;
cout << dist[x] + dist[y] << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define EPS 1e-10
//ここから編集
struct Mo
{
vector<int> left, right, order;
vector<bool> v;
int width;
int nl, nr, ptr;
Mo(int n, int q) : width(sqrt(n)), nl(0), nr(0), ptr(0), v(n), left(q), right(q){}
void insert(int l, int r)
{
left[ptr] = l;
right[ptr] = r;
ptr++;
}
void build()
{
ptr = 0;
order.resize(left.size());
iota(all(order), 0);
sort(all(order), [&](int a, int b)
{
if(left[a] / width != left[b] / width) return left[a] < left[b];
else{
if ((left[a] / width) % 2 == 0) return right[a] < right[b];
else return right[a] > right[b];
}
});
}
inline int process()
{
const auto id = order[ptr];
while(nl > left[id]) distribute(--nl);
while(nr < right[id]) distribute(nr++);
while(nl < left[id]) distribute(nl++);
while(nr > right[id]) distribute(--nr);
return order[ptr++];
}
inline void distribute(int idx)
{
v[idx].flip();
if(v[idx])add(idx);
else del(idx);
}
inline void add(int idx);
inline void del(int idx);
};
int N, A[501010], Q;
int ans[501010];
int cnt[1010101], sum;
inline void Mo::add(int idx)
{
if(cnt[A[idx]]++ == 0) ++ sum;
}
inline void Mo::del(int idx)
{
if(--cnt[A[idx]] == 0) --sum;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(6);
scanf("%d %d", &N, &Q);
for(int i=0; i<N; i++) scanf("%d", &A[i]);
Mo mo(N,Q);
for(int i=0; i<Q; i++){
int a, b; scanf("%d %d", &a, &b);
mo.insert(--a, b);
}
mo.build();
for(int i=0; i<Q; i++){
int idx = mo.process();
ans[idx] = sum;
}
for(int i=0; i<Q; i++){
printf("%d\n", ans[i]);
}
return 0;
}
| #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("")
/*By Citrus*/
char buf[1<<23],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=gc();
for (;!isdigit(c);c=gc()) f^=c=='-';
for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
return f?x:-x;
}
template <typename mitsuha>
inline bool read(mitsuha &x){
x=0;int f=1;char c=gc();
for (;!isdigit(c)&&~c;c=gc()) f^=c=='-';
if (!~c) return 0;
for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
return x=f?x:-x,1;
}
template <typename mitsuha>
inline int write(mitsuha x){
if (!x) return 0&pc(48);
if (x<0) pc('-'),x=-x;
int bit[20],i,p=0;
for (;x;x/=10) bit[++p]=x%10;
for (i=p;i;--i) pc(bit[i]+48);
return 0;
}
inline char fuhao(){
char c=gc();
for (;isspace(c);c=gc());
return c;
}
}using namespace chtholly;
using namespace std;
const int yuzu=5e5;
typedef int fuko[yuzu|10];
struct node {
int l,r,id;
void rd(int x) {
read(l),read(r),id=x;
}
}qr[yuzu|10];
fuko c,cnt,lxy;
int main() {
int i,n,q,bk;
read(n),read(q),bk=sqrt(n);
for (i=1;i<=n;++i) c[i]=read();
for (i=1;i<=q;++i) qr[i].rd(i);
sort(qr+1,qr+q+1,[&](node a,node b){return a.l/bk^b.l/bk?a.l<b.l:a.r<b.r;});
int nl=1,nr=0,ans=0;
for (i=1;i<=q;++i) {
for (;nr<qr[i].r;) !cnt[c[++nr]]++?++ans:0;
for (;nr>qr[i].r;) !--cnt[c[nr--]]?--ans:0;
for (;nl<qr[i].l;) !--cnt[c[nl++]]?--ans:0;
for (;nl>qr[i].l;) !cnt[c[--nl]]++?++ans:0;
lxy[qr[i].id]=ans;
}
for (i=1;i<=q;++i) printf("%d\n",lxy[i]);
} | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
ll gcd(ll x, ll y){
if(x%y == 0) return y;
else return gcd(y, x%y);
}
int main(){
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll sqc = static_cast<ll>(sqrt(c));
ll ans = 0;
for(ll i = 2; i <= sqc; i++){
ll k = 0;
while (c% i == 0) {
c/=i;
k++;
}
if(k != 0) ans++;
}
if(c != 1) ans++;
cout << ans+1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////
ll pow(ll x,ll y,ll mod){
if(y==0) return 1;
if(y&1) return x*pow(x,y-1,mod)%mod;
ll p=pow(x,y/2,mod);
return p*p%mod;
}
ll com(ll x,ll y,ll mod){
ll res=1;
rp(i,y) {
res *= x-i;
res %= mod;
}
rp(i,y){
res *= pow(i+1,mod-2,mod);
res %= mod;
}
return res;
}
int main(){
int n,m;
cin >> n >> m;
vi p_count;
for(int i=2; i*i<=m; i++){
int ctr=0;
while(m%i==0){
m /= i;
ctr++;
}
if(ctr) p_count.pb(ctr);
}
if(m!=1) p_count.pb(1);
int ps=p_count.size();
ll ans=1;
for(auto p:p_count){
ans *= com((ll)p+(ll)n-1ll,(ll)(n-1),Mod);
ans %= Mod;
}
print(ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int x[N], y[N];
int n, m;
char s[N][11];
int main(){
int t;
// while(){
scanf("%d",&n);
vector<pair<int,int>>v1,v2, v3, v4, v5, v6;
for(int i=0; i<n; ++i){
scanf("%d%d%s",x+i, y+i, s[i]);
if(s[i][0]=='U'){
v1.push_back(mk(x[i], i));
v5.push_back(mk(y[i], i));
}
else if(s[i][0]=='D'){
v2.push_back(mk(x[i], i));
v6.push_back(mk(y[i], i));
}
else if(s[i][0]=='R'){
v3.push_back(mk(x[i], i));
}
else{
v4.push_back(mk(x[i], i));
}
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
sort(v3.begin(), v3.end());
sort(v4.begin(), v4.end());
sort(v5.begin(), v5.end());
sort(v6.begin(), v6.end());
int ans=1e9;
int j=0, j1=0, j2=0;
map<int, int> mp, mp1, mp2;
for(int i=0; i<v4.size(); ++i){
for(j;j<v1.size(); ++j){
if(v1[j].fs>v4[i].fs)break;
auto tmp=v1[j].sc;
mp[x[tmp]-y[tmp]]=x[tmp];
}
auto tmp=v4[i].sc;
if(mp.count(x[tmp]-y[tmp])){
ans=min(ans, (x[tmp]-mp[x[tmp]-y[tmp]])*10);
}
for(j1;j1<v3.size(); ++j1){
if(v3[j1].fs>v4[i].fs)break;
auto tmp=v3[j1].sc;
mp1[y[tmp]]=x[tmp];
}
tmp=v4[i].sc;
if(mp1.count(y[tmp])){
ans=min(ans, (x[tmp]-mp1[y[tmp]])*5);
}
for(j2; j2<v2.size(); ++j2){
if(v2[j2].fs>v4[i].fs)break;
auto tmp=v2[j2].sc;
mp2[x[tmp]+y[tmp]]=x[tmp];
}
tmp=v4[i].sc;
if(mp2.count(x[tmp]+y[tmp])){
ans=min(ans, (x[tmp]-mp2[x[tmp]+y[tmp]])*10);
}
}
mp.clear();
mp1.clear();
j=(int)v1.size()-1;
j1=(int)v2.size()-1;
for(int i=(int)(v3.size())-1; i>=0; --i){
for(j; j>=0; --j){
if(v1[j].fs<v3[i].fs)break;
auto tmp=v1[j].sc;
mp[x[tmp]+y[tmp]]=x[tmp];
}
auto tmp=v3[i].sc;
if(mp.count(x[tmp]+y[tmp])){
ans=min(ans, (mp[x[tmp]+y[tmp]]-x[tmp])*10);
}
for(j1; j1>=0; --j1){
if(v2[j1].fs<v3[i].fs)break;
auto tmp=v2[j1].sc;
mp1[x[tmp]-y[tmp]]=x[tmp];
}
tmp=v3[i].sc;
if(mp1.count(x[tmp]-y[tmp])){
ans=min(ans, (mp1[x[tmp]-y[tmp]]-x[tmp])*10);
}
}
j=0;
mp.clear();
for(int i=0; i<v6.size(); ++i){
for(j; j<v5.size(); ++j){
if(v5[j].fs>v6[i].fs)break;
auto tmp=v5[j].sc;
mp[x[tmp]]=y[tmp];
}
auto tmp=v6[i].sc;
if(mp.count(x[tmp])){
ans=min(ans, (y[tmp]-mp[x[tmp]])*5);
}
}
if(ans==1e9)
printf("SAFE\n");
else
cout<<ans<<endl;
// }
} | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T>
bool chmin(T& a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
};
template <typename T>
bool chmax(T& a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
};
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
for(int i = 0; i < v.size(); i++) {
os << v[i] << (i + 1 == v.size() ? "\n" : " ");
}
return os;
}
template <typename T>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {
for(auto& e : t) {
fill_v(e, v);
}
};
struct UnionFind {
vector<int> par, siz;
UnionFind(int n) {
par.resize(n);
siz.resize(n, 1);
for(int i = 0; i < n; i++)
par[i] = i;
}
int find(int x) {
if(par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
bool unite(int u, int v) {
u = find(u), v = find(v);
if(u == v)
return false;
if(siz[u] < siz[v])
swap(u, v);
par[v] = u;
siz[u] += siz[v];
return true;
}
bool same(int u, int v) { return find(u) == find(v); }
};
struct edge {
ll u, v, cost;
bool operator<(const edge& e) { return cost < e.cost; }
};
ll d;
vector<ll> a;
vector<edge> es;
void calc(int l, int r) {
if(r - l <= 1) {
return;
}
int m = (l + r) / 2;
ll mi = LINF, s, t;
for(ll i = l; i < m; i++) {
ll k = -i * d + a[i];
if(mi > k) {
mi = k;
s = i;
}
}
mi = LINF;
for(ll i = m; i < r; i++) {
ll k = i * d + a[i];
if(mi > k) {
mi = k;
t = i;
}
}
for(ll i = l; i < m; i++) {
es.push_back({i, t, (t - i) * d + a[t] + a[i]});
}
for(ll i = m; i < r; i++) {
es.push_back({s, i, (i - s) * d + a[i] + a[s]});
}
calc(l, m);
calc(m, r);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n >> d;
a.resize(n + 1);
for(ll i = 1; i <= n; i++) {
cin >> a[i];
}
calc(1, n + 1);
UnionFind uf(n + 1);
sort(all(es));
ll ans = 0;
for(auto e : es) {
if(uf.unite(e.u, e.v)) {
ans += e.cost;
}
}
cout << ans << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ld dp[305][305][305];
int main() {
ll n;
cin>>n;
ll a[n],x=0,y=0,z=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==1) x++;
else if(a[i]==2) y++;
else z++;
}
for(int k=0;k<=n;k++)
for(int j=0;j<=n;j++)
for(int i=0;i<=n;i++)
dp[i][j][k]=0.0;
ll i=0,j=0,k=0;
ld val=0;
// cout<<x<<" "<<y<<" "<<z<<"\n";
for( k=0;k<=n;k++){
for( j=0;j<=n;j++){
for( i=0;i<=n;i++){
//cout<<i<<" "<<j<<" "<<k<<"\n";
if(i+j+k>n) continue;
if(i+j+k==0) continue;
else{
dp[i][j][k]=n/(long double)(i+j+k);
if(i>0) dp[i][j][k]+=(dp[i-1][j][k]*i)/(long double)(i+j+k);
if(j>0) dp[i][j][k]+=(dp[i+1][j-1][k]*j)/(long double)(i+j+k);
if(k>0) dp[i][j][k]+=(dp[i][j+1][k-1]*k)/(long double)(i+j+k);
}
// cout<<i<<" "<<j<<" "<<k<<"-->"<<dp[i][j][k]<<"\n";
}
}
}
cout<<fixed<<setprecision(10);
cout<<dp[x][y][z]<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define uu unsigned
#define io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MOD 1000000007
#define pl pair<ll,ll>
#define mkp make_pair
#define ss second
#define ff first
#define mit(a,b) map<a,b>::iterator
#define sit(a) set<a>::iterator
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define printcas cout<<"Case "<<cas<<": "
#define _ continue;
#define endl '\n'
#define __ cout<<endl;continue;
#define dd (double)
const ll oo=(1ll<<60);
int gi(){
int x=0,w=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')w=0,ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return w?x:-x;
}
double dp[305][305][305]={0};
int main()
{
//io;
//string hudai(1000000,'a');
int T=1;
//T=gi();
for(int cas=1;cas<=T;cas++)
{
int n,x,cnt[4]={0},i,j,k;
n=gi();
for(i=0;i<n;i++)
{
x=gi();
cnt[x]++;
}
dp[0][0][0]=0.0;
for(i=0;i<=cnt[3];i++)
{
for(j=0;j<=cnt[2]+cnt[3];j++)
{
for(k=0;k<=cnt[1]+cnt[2]+cnt[3];k++)
{
if(i+j+k==0) _
dp[i][j][k]=(1.0/(i+j+k+0.0))*(n+0.0+((!i)?0.0:i*1.0*dp[i-1][j+1][k])+((!j)?0.0:j*1.0*dp[i][j-1][k+1])+((!k)?0.0:k*1.0*dp[i][j][k-1]));
//if(dp[i][j][k]-n==0.0) cout<<i<<' '<<j<<' '<<k<<endl;
}
}
}
printf("%.15lf",dp[cnt[3]][cnt[2]][cnt[1]]);
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define w(t) int t; cin>>t; while(t--)
#define AsmShuvo() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
AsmShuvo()
ll N, sum=0, i;
cin>>N;
for(i=1; i<=N; i++){
if(i%3 != 0 && i%5 != 0){
sum = sum+i;
}
}
cout<<sum<<endl;
}
| #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
// cin>>t;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
int a;
cin>>a;
cout<<a+a*a+a*a*a<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
/*MODの割り算の際に
a/＝b;
を
a *= modinv(b,MOD);
とする。
*/
}
int main(){
string N;cin >> N;
rep(i,N.length()){
if(N[i]=='7'){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include<iostream>
using namespace std;
int main() {
string str;
cin >> str;
//0から4文字分
str.replace(0, 4, "2018");
printf("%s", str.c_str());
return 0;
}
| 0 |
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
using namespace std;
int n, k;
int main(){
while(1){
scanf("%d %d", &n, &k);
if(n == 0 && k == 0) break;
vector<string> v;
set<string> num;
for(int i=0; i<n; i++){
char tmp[3];
scanf("%s", tmp);
v.push_back(tmp);
}
sort(v.begin(), v.end());
do{
string tmp = "";
for(int i=0; i<k; i++)
tmp += v[i];
num.insert(tmp);
}while(next_permutation(v.begin(), v.end()));
printf("%lu\n", num.size());
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
int card[10],n,k,sen[10];
vector<int> vec;
void dfs(int h,int num){
if(h==k){
for(int i=0;i<vec.size();i++)
if(vec[i]==num) return;
vec.push_back(num);
return;
}
for(int i=0;i<n;i++){
if(!sen[i]){
sen[i]=true;
dfs(h+1,num*pow(10,((int)log10(card[i])+1))+card[i]);
sen[i]=false;
}
}
return;
}
void solve(){
for(int i=0;i<n;i++)
scanf("%d",&card[i]);
dfs(0,0);
printf("%d\n",(int)vec.size());
vec.clear();
return;
}
int main(){
while(1){
scanf("%d%d",&n,&k);
if(n+k==0) break;
solve();
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ar array
#define endl '\n'
#define ll long long
#define in insert
#define pb push_back
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(ll i=a;i>=b;i--)
#define FOR(m) Rep(i,1,m)
#define For(m) Rep(i,0,m-1)
#define Rbl(x,a) for(auto &x : a)
#define FIO ios::sync_with_stdio(0); cin.tie(0);
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define vpii vector<pii>
#define vpll vector<pll>
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()
const ll INF = 0x3f3f3f3f3f3f3f3fll;
#define mod 1000000007
const int mxN = 2e5 + 1;
//ll a[mxN];
ll d;
string k;
void add(ll &a, ll b)
{
a = (a + b) % mod;
}
int main()
{
FIO
cin >> k >> d;
vt<vt<ll>> dp(d, vt<ll>(2, 0));
dp[0][0] = 1;
int len = k.length();
for(int i = 0; i < len; i++)
{
vt<vt<ll>> new_dp(d, vt<ll>(2, 0));
for(int sum = 0; sum < d; sum++)
{
for(bool small : {0, 1})
{
for(int digit = 0; digit < 10; digit++)
{
if(digit > k[i] - '0' && !small)
break;
add(new_dp[(sum + digit) % d][small || (digit < k[i] - '0')], dp[sum][small]);
}
}
}
dp = new_dp;
}
ll ans = mod - 1;
add(ans, dp[0][0] + dp[0][1]);
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define INF 1000000000000000LL
using namespace std;
#define MAXN 10000
#define MAXD 100
int dp[MAXN+1][MAXD+1][2];
int main(){
string s;cin>>s;
int n = s.size();
// reverse(s.begin(), s.end());
int d;cin>>d;
dp[0][0][1]=1;
rep(i, n)rep(j, d)rep(k, 10){
int cd = s[i]-'0';
int nj = (j+k)%d;
//cout<<cd<<' '<<j<<'>'<<nj<<' '<<k<<endl;
if(k==cd){
dp[i+1][nj][1] += dp[i][j][1];
dp[i+1][nj][0] += dp[i][j][0];
}else if(k<cd){
dp[i+1][nj][0] += dp[i][j][1] + dp[i][j][0];
}else{
dp[i+1][nj][0] += dp[i][j][0];
}
dp[i+1][nj][1] %= MOD;
dp[i+1][nj][0] %= MOD;
}
ll result = (dp[n][0][1]+dp[n][0][0])%MOD;
cout << (result-1+MOD)%MOD << endl;
return 0;
cout<<dp[n][0][1]<<' '<<dp[n][0][0]<<endl;
cout<<dp[n][0][1]<<' '<<dp[n][0][0]<<endl;
rep(i, n+1){
rep(j, d+1)cout<<dp[i][j][0]+dp[i][j][1]<<' ';
cout<<endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
int main() {
int a,b; cin >> a >> b;
cout << (b+a-3) / (a-1) << endl;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>; // クラスカル法とかで、{cost, {from, to}}的に使う。
const ll INF = 1001001001001001001;
const double pi = acos(-1);
int main()
{
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
//左からi個取り出す
//右からj個取り出す
ll ans = 0;
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n; j++)
{
if (i + j > k || i + j > n)
{
break;
}
ll tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int l = 0; l < i; l++)
{
tmp += v[l];
que.push(v[l]);
}
for (int l = 0; l < j; l++)
{
tmp += v[n - 1 - l];
que.push(v[n - 1 - l]);
}
for (int l = 0; l < k - i - j; l++)
{
if (que.empty())
{
break;
}
int x = que.top();
if (x >= 0)
{
break;
}
que.pop();
tmp -= x;
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
int main() {
int H,W; cin>>H>>W;
vector<vector<int>> A(H,vector<int>(W));
rep(i,H){
rep(j,W){
cin>>A.at(i).at(j);
}
}
rep(i,H) if(i%2==1) reverse(A.at(i).begin(),A.at(i).end());
vector<int> S;
vector<bool> F(H*W,false);
rep(i,H){
rep(j,W){
S.push_back(A.at(i).at(j)%2);
}
}
int count=0,temp=0;
rep(i,H*W-1){
if(temp==0&&S.at(i)==1)temp++;
else if(temp==1&&S.at(i)==1)temp--;
if(temp==1){
F.at(i)=true;
count++;
}
}
cout<<count<<endl;
rep(i,H*W){
if(F.at(i)){
int x=i%W,y=i/W,xd,yd;
if(y%2==0){
if(x==W-1) xd=x,yd=y+1;
else xd=x+1,yd=y;
}
else{
x=W-x-1;
if(x==0) xd=x,yd=y+1;
else xd=x-1,yd=y;
}
cout<<y+1<<' '<<x+1<<' '<<yd+1<<' '<<xd+1<<endl;
}
}
}
| #include <iostream>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int H, W, A[509][509];
vector<tuple<int, int, int, int>> L;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> A[i][j];
}
for (int i = 1; i <= H; i++) {
for (int j = W - 1; j >= 1; j--) {
if (A[i][j + 1] % 2 == 0) continue;
L.push_back(make_tuple(i, j + 1, i, j));
A[i][j + 1]--;
A[i][j]++;
}
}
for (int i = H - 1; i >= 1; i--) {
if (A[i + 1][1] % 2 == 0) continue;
L.push_back(make_tuple(i + 1, 1, i, 1));
A[i + 1][1]--;
A[i][1]++;
}
cout << L.size() << endl;
for (int i = 0; i < L.size(); i++) cout << get<0>(L[i]) << " " << get<1>(L[i]) << " " << get<2>(L[i]) << " " << get<3>(L[i]) << endl;
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
inline char dif(char sp) {
if (sp == 'S') {
return 'W';
} else {
return 'S';
}
}
inline char next(char prevsp, char prevsay, char nowsp, char nowsay) {
char res;
if (nowsp == 'S') {
if (nowsay == 'o') {
res = prevsp;
} else {
res = dif(prevsp);
}
} else {
if (nowsay == 'o') {
res = dif(prevsp);
} else {
res = prevsp;
}
}
return res;
}
string process(char ze, char one, string say, int n) {
string ani(n + 2, '0');
ani[0] = ze;
ani[1] = one;
for (int i = 2; i <= n + 1; i++) {
ani[i] = next(ani[i - 2], say[i - 2], ani[i - 1], say[i - 1]);
}
return ani;
}
bool check(string &result, int n) {
bool res;
if (result[0] == result[n] && result[1] == result[n + 1]) {
res = true;
} else {
res = false;
}
result.pop_back();
result.pop_back();
return res;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
s.push_back(s[0]);
string result;
char sp[2] = {'S', 'W'};
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) {
result = process(sp[i], sp[j], s, n);
if (check(result, n)) {
cout << result << endl;
return 0;
}
}
cout << -1 << endl;
}
| #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for(int i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for(ll i = (n-1LL); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <ll,ll> P;
typedef long double ld;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
bool sw[4][100001] = {}; // s:true w:false
rep (i, 4) rep (j, 2) sw[i][j] = !!(i & (1 << j));
rep (i, 4) {
rep (j, n - 2) sw[i][j + 2] = sw[i][j] ^ sw[i][j + 1] ^ (s[(j + 1) % n] == 'o');
if (sw[i][n - 2] ^ sw[i][n - 1] ^ (s[n - 1] == 'o') == sw[i][0]
&& sw[i][n - 1] ^ sw[i][0] ^ (s[0] == 'o') == sw[i][1]) {
rep (k, n) cout << (sw[i][k] ? 'S' : 'W');
cout << "\n";
return 0;
}
}
cout << "-1\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int N, T;
cin >> N >> T;
vector<int> A(N), B(N);
for(int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<vector<int>> DP1(N, vector<int>(T, 0)), DP2(N, vector<int>(T, 0));
for(int i = 0; i < N; i++) {
for(int j = 1; j < T; j++) {
if(i == 0) {
if(0 <= j - A.at(i))
DP1.at(i).at(j) = B.at(i);
} else {
DP1.at(i).at(j) = max(DP1.at(i - 1).at(j), DP1.at(i).at(j - 1));
if(0 <= j - A.at(i)) {
DP1.at(i).at(j) =
max(DP1.at(i).at(j),
DP1.at(i - 1).at(j - A.at(i)) + B.at(i));
}
}
}
}
for(int i = N - 1; i >= 0; i--) {
for(int j = 1; j < T; j++) {
if(i == N - 1) {
if(0 <= j - A.at(i))
DP2.at(i).at(j) = B.at(i);
} else {
DP2.at(i).at(j) = max(DP2.at(i + 1).at(j), DP2.at(i).at(j - 1));
if(0 <= j - A.at(i)) {
DP2.at(i).at(j) =
max(DP2.at(i).at(j),
DP2.at(i + 1).at(j - A.at(i)) + B.at(i));
}
}
}
}
ans = max(B.at(0) + DP2.at(1).at(T - 1),
B.at(N - 1) + DP1.at(N - 2).at(T - 1));
for(int i = 1; i < N - 1; i++) {
for(int j = 0; j < T; j++) {
ans = max(ans, B.at(i) + DP1.at(i - 1).at(j) +
DP2.at(i + 1).at(T - j - 1));
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dp[2][6005];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, t;
cin >> n >> t;
vector<P> v(n);
rep(i,n) cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
rep(i,n){
int a = v[i].first;
int b = v[i].second;
rep(j,6001){
chmax(dp[(i+1)%2][j], dp[i%2][j]);
if(j < t) chmax(dp[(i+1)%2][j+a], dp[i%2][j] + b);
}
}
int ans = 0;
rep(j,6001) chmax(ans, dp[n%2][j]);
cout << ans << endl;
return 0;
}
| 1 |
//https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Prelim/0566?year=2012
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> pt(static_cast<unsigned long>(n + 1));//各チームの得点
for (int i = 0; i < n * (n - 1) / 2; ++i) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c > d) {
pt[a] += 3;
} else if (c < d) {
pt[b] += 3;
} else if (c == d) {
pt[a]++;
pt[b]++;
}
}
vector<int> vt;//順位計算用
for (int i = 1; i <= n; ++i) {
vt.emplace_back(pt[i]);
}
vt.emplace_back(100000);
sort(vt.begin(), vt.end());
for (int i = 1; i <= n; ++i) {
auto tmp = upper_bound(vt.begin(), vt.end(), pt[i]);
cout << n + 1 - (tmp - vt.begin()) << endl;
}
return 0;
}
/*
*
*/
| #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
struct koji {
int t, x;
int flag;
bool operator<(const koji& other) const {
if (t < other.t) return true;
else return false;
}
};
int main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N), D(Q);
vector<koji> kojis(2*N);
REP(i, N) {
cin >> S[i] >> T[i] >> X[i];
S[i] -= X[i];
T[i] -= X[i];
kojis[2*i].t = S[i];
kojis[2*i+1].t = T[i];
kojis[2*i].x = X[i];
kojis[2*i+1].x = X[i];
kojis[2*i].flag = 1;
kojis[2*i+1].flag = -1;
}
sort(ALL(kojis));
REP(i, Q) cin >> D[i];
int k = 0;
multiset<int> events;
REP(i, Q) {
while(k < kojis.size() && kojis[k].t <= D[i]) {
if(kojis[k].flag == 1) events.insert(kojis[k].x);
else events.erase(events.find(kojis[k].x));
k++;
}
if(events.empty()) {
cout << -1 << endl;
} else {
cout << *events.begin() << endl;
}
}
return 0;
} | 0 |
#include<iostream>
using namespace std ;
int table[10010] = {} ;
void f(){
table[0] = 1 ;
table[1] = 1 ;
for( int i=2 ; i<=10000 ; i++ ){
if( !table[i] ){
for( int j=2 ; i*j<=10000 ; j++ ) table[i*j] = 1 ;
}
}
}
main(){
f() ;
int n ;
while( cin >> n , n ){
int p = 0 ;
for( int i=5 ; i<=n ; i++ ){
if( !table[i] && !table[i-2] ) p = i ;
}
cout << p-2 << " " << p << endl ;
}
} | /* All men have limits. They learn what they are and learn
not to exceed them, I ignore mine. -Batman */
#include <bits/stdc++.h>
//#include <Windows.h>
using namespace std;
int main(){
int i,j;
long long sum;
int n;
while(scanf("%d", &n) != EOF){
i = 0;
sum = 0;
while( i != 600){
sum += n*i*i;
i += n;
}
printf("%lld\n", sum);
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod ll(1e9+7)
ll exp(ll a,ll b)
{
if(b==0)
return 1;
if(b%2==0)
return exp(a*a%mod,b/2);
return a*exp(a*a%mod,(b-1)/2)%mod;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n,k;
cin>>n>>k;
vector<int>arr(n+1);
for(int i=1; i<=n; i++){
cin>>arr[i];
}
int mx=0;
for(int i=0; i<=k; i++){
for(int j=0; j<=(k-i); j++){
if(i+j>=n){
vector<int>ans;
int sum=0;
for(int x=1; x<=n; x++){
sum+=arr[x];
ans.push_back(arr[x]);
}
sort(ans.begin(),ans.end());
int num=min(n,k-n);
for(int x=0; x<num; x++){
if(ans[x]>=0)
break;
sum-=ans[x];
}
mx=max(sum,mx);
}
else{
vector<int>ans;
int sum=0;
for(int x=1; x<=i; x++){
ans.push_back(arr[x]);
sum+=arr[x];
}
for(int x=n; x>=(n-j+1); x--){
ans.push_back(arr[x]);
sum+=arr[x];
}
int num=min(i+j,k-(i+j));
sort(ans.begin(),ans.end());
for(int x=0; x<num; x++){
if(ans[x]>=0)
break;
sum-=ans[x];
}
mx=max(sum,mx);
}
}
}
cout<<mx;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;
ll m;
template <typename T>
T zero_sum_ranges(vector<T> A) {
T n = A.size();
T sum[n + 1] = {};
sum[1] = A[0];
map<T, T> mp;
for(size_t i = 0; i < n; i++) {
sum[i + 1] = (sum[i] + A[i]) % m;
}
T ret = 0;
for(size_t i = 0; i <= n; i++) {
if(mp.count(sum[i])) ret += mp[sum[i]];
mp[sum[i]]++;
}
cout << ret << endl;
}
int main() {
ll n, i, j, k;
cin >> n >> m;
vector<ll> v(n);
for(auto &x:v)cin >> x;
zero_sum_ranges(v);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
string s;
cin>>s;
int n=s.size();
ll ans=1;
map<char,int>mp;
rep(i,n){
mp[s[i]]++;
ans+=i+1-mp[s[i]];
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long tint;
typedef long double ld;
#define forsn(i, s, n) for(int i=s;i<int(n);i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define NACHO ios::sync_with_stdio(0); cin.tie(NULL);
#define dbg cout << "hu" << endl;
const int INF = 50000001;
const int MOD = 1000000007;
//impossible pairs: (a^3, 1) (a^2, a^1)
int main(){
string s; cin >> s;
int n = s.size();
tint quan = tint(n)*tint(n-1)/2;
vector<int> cont (26, 0);
forn(i, n){
cont[s[i]-'a']++;
}
tint ret = 0;
forn(i, 26){
if(cont[i]) ret+=(tint(cont[i])*tint(cont[i]-1))/2;
}
cout << quan-ret+1 << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define fir first
#define sec second
#define mod 998244353
#define int long long
#define INF (int)(1e18)
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
if(nega==-1) return -ans;
return ans;
}
typedef pair<int,int> pii;
int add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
int sub(int x,int y){return x-y<0?x-y+mod:x-y;}
int mul(int x,int y){return 1LL*x*y%mod;}
#define N 5005
int f[N][N];
struct Node
{
int x,y;
};
Node a[N];
bool cmp(Node x,Node y)
{
return x.x+x.y<y.x+y.y;
}
signed main()
{
#ifdef __LOCAL__
freopen("in.txt","r",stdin);
#endif
int n=read();
for(int i=1;i<=n;i++) a[i].x=read(),a[i].y=read();
sort(a+1,a+n+1,cmp);
for(int i=0;i<=n;i++)
{
for(int j=1;j<=n;j++) f[i][j]=INF;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
f[i][j]=f[i-1][j];
if(f[i-1][j-1]<=a[i].x)
{
f[i][j]=min(f[i][j],f[i-1][j-1]+a[i].y);
}
}
}
int ans=0;
for(int i=1;i<=n;i++)
{
if(f[n][i]<INF) ans=i;
}
cout<<ans<<endl;
#ifdef __LOCAL__
cout<<"Time Used : "<<clock()<<endl;
#endif
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
/* #include <regex> */
using namespace std;
/* g++ -g -std=c++11 */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i,a,b) for (int i=(a); i < (b); ++i)
#define FORR(i,a,b) for (int i=(a); i > (b); --i)
#define FOR_ALL(i,c) for (__typeof((c).begin()) i=(c).begin(); \
i != (c).end(); ++i)
#define FOR_ALLR(i,c) for (__typeof((c).rbegin()) i=(c).rbegin(); \
i != (c).rend(); ++i)
#define SZ(array) (sizeof(array)/sizeof(array[0]))
#define lc(x) (x<<1) /* 2*x */
#define rc(x) (x<<1 | 1) /* 2*x+1 */
#define lowbit(x) (x & (-x)) /* 0b10100 -> 0b100 */
typedef long long LL;
typedef map<int,int> MII;
typedef pair<int,int> PII;
typedef set<int> SI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<int> VI;
typedef vector<string> VS;
/* check if a key is in container C */
template <class C>
inline bool in_(const typename C::key_type& k, const C& A)
{ return A.find(k) != A.end(); }
inline bool in_(const string& s, const string& S)
{ return S.find(s) != string::npos; }
const LL inf = 1e16;
VI H,P, sorted;
bool cmp(const int i, const int j)
{ return H[i]+P[i] < H[j]+P[j]; }
int main()
{
#ifdef foo_
freopen("foo", "rt", stdin);
#endif
ios::sync_with_stdio(false);
int n;
while (cin >> n) {
H = P = sorted = VI(n);
FOR(i,0,n) {
cin >> H[i] >> P[i];
sorted[i] = i;
}
sort(ALL(sorted),cmp);
vector<LL> dp = vector<LL>(n+1,inf);
dp[0] = 0; int ans = 0;
FOR(i,0,n) {
const int j = sorted[i];
FORR(x,n-1,-1) if (dp[x] != inf && dp[x] <= H[j]) {
dp[x+1] = min(dp[x+1], dp[x]+P[j]);
ans = max(ans, x+1);
}
}
cout << ans << endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
const int N = 105;
int n, m, ex, ey;
char s[N][N], a[N][N];
short ans, dp[N][N][N][N], sum[N][N];
int Sum(int U, int L, int D, int R) {
if (U > D) swap(U, D);
if (L > R) swap(L, R);
return sum[D][R] + sum[U - 1][L - 1] - sum[D][L - 1] - sum[U - 1][R];
}
void Upd(short &x, short y) {
x = max(x, y);
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
for (int j = 1; j <= m; ++j) {
if (s[i][j] == 'E') {
ex = i;
ey = j;
}
if (s[i][j] == 'o') sum[i][j] = 1;
sum[i][j] -= sum[i - 1][j - 1];
sum[i][j] += sum[i][j - 1] + sum[i - 1][j];
}
}
for (short a = ex; a >= 1; --a) {
for (short c = ey; c >= 1; --c) {
for (short b = ex; b <= n; ++b) {
for (short d = ey; d <= m; ++d) {
short U = b - ex + 1, D = n - ex + a;
short L = d - ey + 1, R = m - ey + c;
short now = dp[a][b][c][d];
Upd(ans, now);
if (a > U)
Upd(dp[a - 1][b][c][d], now + Sum(a - 1, max(L, c), a - 1, min(R, d)));
if (b < D)
Upd(dp[a][b + 1][c][d], now + Sum(b + 1, max(L, c), b + 1, min(R, d)));
if (c > L)
Upd(dp[a][b][c - 1][d], now + Sum(max(U, a), c - 1, min(D, b), c - 1));
if (d < R)
Upd(dp[a][b][c][d + 1], now + Sum(max(U, a), d + 1, min(D, b), d + 1));
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define x first
#define y second
int n, m;
int x, y;
int a[110][110];
char buf[110];
void in(){
read(n, m);
for(int i=1; i<=n; ++i){
scanf("%s", buf+1);
for(int j=1; j<=m; ++j){
a[i][j]=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
if(buf[j] == 'o'){
++a[i][j];
} else if(buf[j] == 'E'){
x=i; y=j;
}
}
}
}
int dp[102][102][102][102];
int rect(int L1, int R1, int D1, int U1, int L2, int R2, int D2, int U2){
int L=max(L1, L2);
int R=min(R1, R2);
int D=max(D1, D2);
int U=min(U1, U2);
if(L>R || D>U) return 0;
if(0) printf("%d %d %d %d\n", L, R, D, U);
return a[R][U]-a[L-1][U]-a[R][D-1]+a[L-1][D-1];
}
int main()
{
in();
for(int w=1; w<=n; ++w){
for(int h=1; h<=m; ++h){
for(int l=1; l+w-1<=n; ++l){
int r=l+w-1;
if(x<l || r<x) continue;
for(int d=1; d+h-1<=m; ++d){
int u=d+h-1;
if(y<d || u<y) continue;
int me=dp[l][r][d][u];
auto f = [&](int A, int B, int C, int D){
int I=l+A;
int J=r+B;
int K=d+C;
int L=u+D;
int nv = rect(1+(r-x), n-(x-l), 1+(u-y), m-(y-d),
(A||B)?(A?I:J):(I),
(A||B)?(A?I:J):(J),
(C||D)?(C?K:L):(K),
(C||D)?(C?K:L):(L)
);
int& T=dp[I][J][K][L];
if(T < me+nv){
if(0) printf("upd from %d-%d, %d-%d to df %d %d %d %d : %d+%d = %d\n",
l,r,d,u, A,B,C,D, me, nv, me+nv);
}
T=max(T, me+nv);
};
if(1 < l) f(-1, 0, 0, 0);
if(r < n) f(0, 1, 0, 0);
if(1 < d) f(0, 0, -1, 0);
if(u < m) f(0, 0, 0, 1);
}
}
}
}
printf("%d\n", dp[1][n][1][m]);
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.txt","w",stdout)
#define pr2 freopen("C:\\acm\\Cproj\\std.txt","w",stdout)
#define pii pair<int,int>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long LL;
template <class T>
void read(T &val) { T x = 0; T bz = 1; char c; for (c = getchar(); (c<'0' || c>'9') && c != '-'; c = getchar()); if (c == '-') { bz = -1; c = getchar(); }for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48; val = x * bz; }
const int maxn = 3e5 + 11;
const int mod=998244353;
double eps = 1e-9;
unordered_map<int,int>mpp2[1000],mpp5[1000];
int mx;
LL cal2(int a,int b){
LL res = 0;
fo(i,0,a) {
for(auto to:mpp2[i]){
if(i+b+to.first>=0) res+=to.second;
}
}
fo(i,a+1,mx){
for(auto to:mpp2[i]){
if(a+b+to.first>=0) res+=to.second;
}
}
return res;
}
LL cal5(int a,int b){
LL res = 0;
fo(i,0,a) {
for(auto to:mpp5[i]){
if(i+b+to.first>=0) res+=to.second;
}
}
fo(i,a+1,mx){
for(auto to:mpp5[i]){
if(a+b+to.first>=0) res+=to.second;
}
}
return res;
}
char s[maxn];
int main(){
// op;
int n;
read(n);
LL ans = 0;
fo(i,1,n){
scanf("%s",s);
int len = strlen(s);
LL nw = 0;
int d=0;
fo(i,0,len-1){
if(s[i]=='.') d = i-len+1;
else{
nw = nw*10+s[i]-'0';
}
}
int n2=0,n5=0;
while(nw%2==0) n2++,nw/=2;
while(nw%5==0) n5++,nw/=5;
int mi = min(n2,n5);
n2-=mi;n5-=mi;
mx=max(mx,n2);
mx=max(mx,n5);
d+=mi;
if(n2){
ans+=cal5(n2,d);
}
else{
ans+=cal2(n5,d);
}
mpp2[n2][d]++;
mpp5[n5][d]++;
}
printf("%lld\n",ans);
return 0;
} | #include <iostream>
using namespace std;
bool board[8][8];
char grid[8][8];
int upperlim = (1 << 8) - 1;
void solve(int row, int ld, int rd, int d)
{
// cout<<d<<endl;
if (d == 8)
{
for (int i = 0; i < 8; i++)
{
for (int j = 0; j < 8; j++)
{
if (board[i][j] && grid[i][j]!='Q') return;
}
}
for (int i = 0; i < 8; ++i)
{
for (int j = 0; j < 8; ++j)
{
cout<<grid[i][j];
}
cout<<endl;
}
return;
}
if (row != upperlim)
{
int pos = upperlim & ~(row | ld | rd);
while (pos)
{
// cout<<"pos:"<<pos<<endl;
int p = pos & (~pos + 1);
// cout<<"p:"<<p<<endl;
int num = p;
int col = 0;
while(num != 1) {
num = num>>1;
col++;
}
grid[d][col] = 'Q';
pos = pos - p;
solve(row + p, (ld + p) << 1, (rd + p) >> 1, d+1);
grid[d][col] = '.';
}
}
return;
}
int main()
{
int k;
cin>>k;
for (int i = 0; i < 8; ++i)
{
for (int j = 0; j < 8; ++j)
{
board[i][j] = false;
grid[i][j] = '.';
}
}
for (int i = 0; i < k; i++)
{
int r,c;
cin>>r>>c;
board[r][c] = true;
}
solve(0, 0 , 0, 0);
return 0;
} | 0 |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
#define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
#define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 610;
int used[SIZE][SIZE];
int N;
int res[SIZE][SIZE],D;
int dx[4]={1,1,-1,-1};
int dy[4]={1,-1,1,-1};
int v;
void dfs(int x,int y,int b){
if(b)res[x][y]|=v;
used[x][y]=1;
for(int k=0;k*k<=D;k++){
int tmp=sqrt(D-k*k);
if(tmp*tmp+k*k==D){
REP(j,4){
int nx=x+dx[j]*k;
int ny=y+dy[j]*tmp;
if(nx<0||ny<0||nx>=2*N||ny>=2*N) continue;
if(used[nx][ny])continue;
dfs(nx,ny,1^b);
}
}
}
}
void fil(int _D,int _v){
D=_D;
v=_v;
MS0(used);
REP(i,2*N){
REP(j,2*N){
if(!used[i][j]){
dfs(i,j,0);
}
}
}
}
VPII ker[4];
int main(){
int D1,D2;
R(N,D1,D2);
fil(D1,1);
fil(D2,2);
REP(i,2*N)REP(j,2*N){
ker[res[i][j]].PB({i,j});
}
REP(i,4){
if(SZ(ker[i])>=N*N){
REP(j,N*N){
W(ker[i][j]);
}
return 0;
}
}
return 0;
}
| #include<stdio.h>
#define N 101
int main(){
int n;
int p[N];
int m[N][N];
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d",&p[i-1],&p[i]);}
for(int i=1;i<=n;i++)
m[i][i]=0;
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
int j=i+l-1;
/*2<<21*/
m[i][j]=2097152;
for(int k=i;k<=j-1;k++){
/*さいしょう比較*/
if(m[i][j]<m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])
m[i][j]=m[i][j];
else
m[i][j]=m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j];
}
}
}
printf("%d\n",m[1][n]);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)
int main(){
while(1){
int n, m;
cin>>n>>m;
if(n==0) break;
int a[n];
REP(i, n) cin>>a[i];
sort(a, a+n, greater<int>());
int sum = 0;
REP(i, n) sum+=a[i];
for(int i=m-1; i<n; i+=m){
sum-=a[i];
}
printf("%d\n", sum);
}
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
vector<char> cmap;
char getrev(char c,int kagi){
int rst;
if(c>='a') rst = c -'a' ;
else rst = c - 'A'+ ('Z'-'A'+1);
if(rst-kagi<0) return cmap[rst-kagi+cmap.size()];
else return cmap[rst-kagi];
}
int main(){
for(int i='a';i<'z'+1;i++) cmap.pb(i);
for(int i='A';i<'Z'+1;i++) cmap.pb(i);
while(1){
int n;
cin >> n;
if(n==0) break;
int klist[100];
REP(i,n){
cin >> klist[i];
}
string ango;
cin >> ango;
int nowkagi = 0;
REP(i,ango.size()){
cout << getrev(ango[i],klist[nowkagi]);
if(nowkagi==n-1) nowkagi = 0;
else nowkagi++;
}
cout << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
map<int, int> m;
int x;
rep (i, n){
cin >> x;
if (m[x] == 0) m[x] = 1;
else m[x] = 0;
}
int count = 0;
for (P p : m){
if (p.second == 1) ++count;
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9 * 2;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int count = 1;
int out = 0;
rep(i, n - 1){
if(a[i] == a[i + 1]) count++;
else{
if(count % 2 == 1) out++;
count = 1;
}
}
if(count % 2 == 1) out++;
cout << out << endl;
}
| 1 |
#include <bits/stdc++.h>
#define F first
#define S second
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define in(x) insert(x)
#define forr(i, a, b) for(int i = a;i <= b;i++)
#define sz(s) (int)(s.size())
#define all(x) x.begin(), x.end()
#define did_you_calis_enough ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define int long long
using namespace std;
const int INF = 4294967295;
const int N = 2e6 + 667;
const int mod = 1e9 + 7;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
const double PI = acos(-1.0);
main() {
did_you_calis_enough
int d, t, s;
cin >> d >> t >> s;
cout << ((t * s >= d) ? "Yes" : "No");
}
//Coded by LoliThief
| #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b && b != c && c != a) {
cout << "No" << endl;
}
else if (a == b && b == c) {
cout << "No" << endl;
}
else cout << "Yes" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n, k; cin >> n >> k;
vector<ll> x(n); cin >> x;
ll inf = 1000000000, ans = inf;
rep(i, n-k+1){
ll a = x[i], b = x[i+k-1];
if(a < 0 && b < 0) ans = min(ans, abs(a));
else if(a > 0 && b > 0) ans = min(ans, b);
else{
if(abs(a) < abs(b)) ans = min(ans, abs(a)*2 + abs(b));
else ans = min(ans, abs(a) + abs(b)*2);
}
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random>
#include<stdlib.h>
#define rip(i,n) for(int i=0;i<n;i++)
#define Rip(i,n) for(int i=1;i<=n;i++)
#define RIP(i,a,b) for(int i=a;i<b;i++)
#define all(V) V.begin(),V.end()
#define MOD 1000000007
#define mod 998244353
#define inf MOD
#define sec setprecision
#define Pair pair<ll,ll>
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
constexpr double eps = 1e-9;
constexpr double pi = 3.141592653589793238462643383279;
using namespace std;
using ll = long long;
using ld = long double;
ll gcd(ll a, ll b)
{
if (a % b == 0) return(b);
else return(gcd(b, a % b));
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
ll pow(ll x, ll n) {
x %= mod;
if (n == 0)
return 1;
if (n % 2 == 0)
return (pow((x * x) % mod, n / 2) % mod);
else
return (x * pow(x, n - 1)) % mod;
}
void solve() {
}
int main() {
ll n; cin >> n;
ll a, b, c, d, e; cin >> a >> b >> c >> d >> e;
ll mini = inf;
mini = min({ a,b,c,d,e });
cout << (n - 1) / mini + 1 + 4 << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
// get abs
ll my_abs(ll a);
// a^n
ll a_n(ll a, ll n);
// get gcd
ll my_gcd(ll a, ll b);
// a^(-1) % MOD
ll inv(ll a);
// (a+b+c)%MOD
ll madd(ll a, ll b, ll c);
// (a-b)%MOD
ll msub(ll a, ll b);
// (a*b*c)%MOD
ll mtime(ll a, ll b, ll c);
// map of result of factorization
void factorization(ll n, map<ll, ll> &a) {
while((n%2) == 0) {
n /= 2;
if(a.count(2)) a.at(2)++;
else a[2] = 1;
}
for(ll i = 3; i*i <= n; i+=2) {
while((n%i) == 0) {
n /= i;
if(a.count(i)) a.at(i)++;
else a[i] = 1;
}
}
if(n != 1) a[n] = 1;
}
void factorial_map(vector<ll> &n, vector<ll> &ninv);
int main() {
ll n, m;
cin >> n >> m;
map<ll, ll> a;
vector<ll> nfac(101010), ninv(101010);
factorial_map(nfac, ninv);
factorization(m, a);
ll ans = 1;
for(auto p: a) {
auto v = p.second;
ll comb = mtime(nfac[v+n-1], ninv[v], ninv[n-1]);
ans = mtime(ans, comb, 1);
}
cout << ans << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count))%MOD;
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
}
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for(ll i = 1; i < n.size(); i++) n[i] = (n[i-1] * i) % MOD;
ninv[n.size()-1] = inv(n[n.size()-1]);
for(ll i = n.size() - 2; i > -1; i--) ninv[i] = (ninv[i+1] * (i+1)) % MOD;
}
| #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
bool dfs(const vector<vector<int64_t>>& adjs, vector<int64_t>& colors,
int64_t v, int64_t c) {
colors[v] = c;
for (auto u : adjs[v]) {
if (colors[u] >= 0) {
if (colors[u] + c != 1) {
return false;
}
continue;
}
if (!dfs(adjs, colors, u, (c + 1) % 2)) {
return false;
}
}
return true;
}
int main() {
int64_t n, m;
cin >> n >> m;
vector<vector<int64_t>> adjs(n);
for (auto _ : irange(0L, m)) {
int64_t a, b;
cin >> a >> b;
--a;
--b;
adjs[a].push_back(b);
adjs[b].push_back(a);
}
vector<int64_t> colors(n, -1L);
if (dfs(adjs, colors, 0L, 0L)) {
// two-party
array<int64_t, 2> nn{};
nn[0] = count(colors.begin(), colors.end(), 0L);
nn[1] = n - nn[0];
// cerr << nn[0] << " " << nn[1] << endl;
int64_t ans = 0;
for (auto i : irange(0L, n)) {
ans += nn[(colors[i] + 1) % 2] - adjs[i].size();
}
ans /= 2;
cout << ans << endl;
} else {
cout << n * (n - 1) / 2 - m << endl;
}
} | 0 |
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3f
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define N 305
using namespace std;
typedef pair<int,int> Pair;
const int mod = 1e9 + 7;
inline int add(int x, int y) { return (x += y) - (x >= mod ? mod : 0); }
inline void inc(int &x, int y) { (x += y) -= (x >= mod ? mod : 0); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
template <class T> inline T input() {
int x; char ch; while (!isdigit(ch = getchar()));
for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48));
return x;
}
template <class T> inline void chkmin(T &x, T &y) { x = x < y ? x : y; }
template <class T> inline void chkmax(T &x, T &y) { x = x > y ? x : y; }
struct {
inline operator int () { return input<int>(); }
inline operator long long () { return input<long long>(); }
template <class T> inline void operator () (T &x) { x = *this; }
template<class T, class ...A> inline void operator () (T &x, A &...a)
{ x = *this; this -> operator ()(a...); }
} read;
int n, m, ans = inf;
int a[N][N];
int cnt[N];
bool vis[N];
void calc() {
memset(cnt, 0, sizeof cnt);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (vis[a[i][j]]) {
++cnt[a[i][j]];
break;
}
}
int main() {
read(n, m);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
read(a[i][j]);
for (int i = 1; i <= m; ++i) vis[i] = true;
calc();
for (int i = 1; i <= m; ++i) {
int pos = max_element(cnt + 1, cnt + m + 1) - cnt;
ans = min(ans, cnt[pos]);
vis[pos] = false;
calc();
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
int main(){
int N, M;
cin >> N >> M;
int A[N][M];
rep(i, N) rep(j, M) {cin >> A[i][j]; A[i][j]--;}
//(l,r]
int l = 0, r = N;
while(r-l > 1){
int n = (l+r)/2;
vector<int> cnt(M, 0), now(N, 0);
vector<bool> used(M, false);
bool able = true;
while(true){
rep(i, N){
while(now[i] < M && used[A[i][now[i]]]) now[i]++;
if(now[i] == M) able = false;
else cnt[A[i][now[i]]]++;
}
bool update = false;
rep(i, M){
if(cnt[i] > n) update = true, used[i] = true;
}
fill(all(cnt), 0);
if(!update) break;
}
if(able) r = n;
else l = n;
}
cout << r << endl;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n);++i)
using namespace std;
const long long inf = 1ll << 60;
const long long mod = 1000000007;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,-1,0,1};
int dz[4] = {1,-1,-1,1};
int dw[4] = {1,1,-1,-1};
int main() {
int n;cin >> n;
vector<pair<int,int> > x(n);
rep(i,n) cin >> x[i].first >> x[i].second;
vector<int> a(8);
rep(i,8) a[i]=i;
do{
bool board[8][8] = {false};
for(int i=0;i<8;i++){
board[i][a[i]] = true;
}
bool ok = true;
rep(i,n){
if(board[x[i].first][x[i].second] == false) ok = false;
}
if(ok == false) continue;
for(int i=0;i<8;i++){
for(int j=0;j<4;j++){
int t = 1;
while(1){
int s = i+dz[j]*t;
int r = a[i]+dw[j]*t;
if(s < 0 || 8 <= s || r < 0 || 8 <= r)break;
if(board[s][r]==true) ok = false;
t++;
}
}
}
if(ok){
rep(i,8){
rep(j,8){
if(board[i][j]) cout <<"Q";
else cout <<".";
}
cout << endl;
}
break;
}
}while(next_permutation(a.begin(),a.end()));
return 0;
}
| #include <iostream>
#define SIZE 8
void threaten(int board[][SIZE], int x, int y)
{
for (int i=0; i<SIZE; i++) {
board[i][y]++; board[x][i]++;
}
for (int i=-x; i<SIZE-x; i++) {
if (0 <= y+i && y+i < SIZE) board[x+i][y+i]++;
if (0 <= y-i && y-i < SIZE) board[x+i][y-i]++;
}
board[x][y]+=100;
}
void unthreaten(int board[][SIZE], int x, int y)
{
for (int i=0; i<SIZE; i++) {
board[i][y]--; board[x][i]--;
}
for (int i=-x; i<SIZE-x; i++) {
if (0 <= y+i && y+i < SIZE) board[x+i][y+i]--;
if (0 <= y-i && y-i < SIZE) board[x+i][y-i]--;
}
board[x][y]-=100;
}
bool solve(int board[][SIZE], int rest)
{
if (rest==0) return true;
for (int i=0; i<SIZE; i++) {
for (int j=0; j<SIZE; j++) {
if (board[i][j]>0) continue;
threaten(board, i, j);
if (solve(board, rest-1)) return true;
unthreaten(board, i, j);
}
}
return false;
}
int main()
{
int board[SIZE][SIZE];
for (int i=0; i<SIZE; i++) {
for (int j=0; j<SIZE; j++) board[i][j] = 0;
}
int k; std::cin >> k;
for (int i=0; i<k; i++) {
int x, y;
std::cin >> x >> y;
threaten(board, x, y);
}
solve(board, SIZE-k);
for (int i=0; i<SIZE; i++) {
for (int j=0; j<SIZE; j++) {
if (board[i][j] < 100) std::cout << ".";
else std::cout << "Q";
}
std::cout << std::endl;
}
return 0;
}
| 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w[10];
int k[10];
for(int i=0;i<10;i++){
cin >>w[i];
}
for(int i=0;i<10;i++){
cin >>k[i];
}
sort(w,w+10,greater<int>());
sort(k,k+10,greater<int>());
cout<<w[0]+w[1]+w[2]<<' '<<k[0]+k[1]+k[2]<<endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main()
{
string stro, str;
while(getline(cin, stro)){
for(int i = 0; i < 26; i++){
str = stro;
for(int j = 0; j < stro.length(); j++){
if(str[j] >= 'a' && str[j] <= 'z')
if(str[j] + i > 'z')
str[j] += i - 26;
else
str[j] += i;
}
if(str.find("the") != string::npos || str.find("this") != string::npos || str.find("that") != string::npos)
cout << str << endl;
}
}
} | 0 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define si short int
using namespace std;
const int N=101;
si n,m,x,y,ans,dp[N][N][N][N],sum[N][N];
char g[N][N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f;}
template<typename I, typename... U> inline void read(I &x,U&... y){read(x); read(y...);}
template<typename I>inline I mx(const I&a,const I&b){return a>b ? a : b;}
template<typename I>inline I mi(const I&a,const I&b){return a<b ? a : b;}
template<typename I>inline void swp(I&a,I&b){I t=a; a=b; b=t;}
inline void cmx(si &a,si b){if(b>a) a=b;}
inline si s(int a,int b,int c,int d){
if(a>c) swp(a,c); if(b>d) swp(b,d);
return sum[c][d]-sum[c][b-1]-sum[a-1][d]+sum[a-1][b-1];
}
int main()
{
// freopen("Salvage Robots.in","r",stdin);
read(n,m);
for(RG int i=1;i<=n;i++)
{
scanf("%s",g[i]+1);
for(RG int j=1;j<=m;j++)
{
if(g[i][j]=='o') sum[i][j]=1;
else if(g[i][j]=='E') x=i, y=j;
sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
}
}
for(int i=x;i;i--)
for(int j=y;j;j--)
for(int k=x;k<=n;k++)
for(int l=y;l<=m;l++)
{
ans=mx(ans,dp[i][j][k][l]);
int li=l-y+1, ri=m-y+j, us=k-x+1, ds=n-x+i;
if(i-1>=us) cmx(dp[i-1][j][k][l],dp[i][j][k][l]+s(i-1,mx(li,j),i-1,mi(ri,l)));
if(j-1>=li) cmx(dp[i][j-1][k][l],dp[i][j][k][l]+s(mx(i,us),j-1,mi(k,ds),j-1));
if(k+1<=ds) cmx(dp[i][j][k+1][l],dp[i][j][k][l]+s(k+1,mx(li,j),k+1,mi(ri,l)));
if(l+1<=ri) cmx(dp[i][j][k][l+1],dp[i][j][k][l]+s(mx(i,us),l+1,mi(k,ds),l+1));
}
cout<<ans<<endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#define upd(x, y) (x) = std::max(x, y)
char str[105];
int dp[105][105][105][105], row_pre[105][105], col_pre[105][105];
int main()
{
// freopen("AGC004-E.in", "r", stdin);
int n, m, x, y;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", str);
for (int j = 0; j < m; j++)
{
row_pre[i][j] = (j ? row_pre[i][j - 1] : 0) + (str[j] == 'o');
col_pre[j][i] = (i ? col_pre[j][i - 1] : 0) + (str[j] == 'o');
if (str[j] == 'E')
{
x = i;
y = j;
}
}
}
auto calc_row = [&] (int row, int l, int r)
{
int L = std::max(l, r - y), R = std::min(r, l + m - y - 1);
return L <= R ? row_pre[row][R] - (L ? row_pre[row][L - 1] : 0) : 0;
};
auto calc_col = [&] (int col, int l, int r)
{
int L = std::max(l, r - x), R = std::min(r, l + n - x - 1);
return L <= R ? col_pre[col][R] - (L ? col_pre[col][L - 1] : 0) : 0;
};
for (int i = 0; i <= x; i++)
{
for (int j = n - 1; j >= x; j--)
{
for (int k = 0; k <= y; k++)
{
for (int t = m - 1; t >= y; t--)
{
if (j - i < x)
upd(dp[i][j][k][t], dp[i - 1][j][k][t] + calc_row(i - 1, k, t));
if (j - i < n - x - 1)
upd(dp[i][j][k][t], dp[i][j + 1][k][t] + calc_row(j + 1, k, t));
if (t - k < y)
upd(dp[i][j][k][t], dp[i][j][k - 1][t] + calc_col(k - 1, i, j));
if (t - k < m - y - 1)
upd(dp[i][j][k][t], dp[i][j][k][t + 1] + calc_col(t + 1, i, j));
}
}
}
}
printf("%d\n", dp[x][x][y][y]);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
//const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;} return false;}
typedef pair<int, int> P;
double rad(double a) {return a * 180 / PI;}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); //xの根をrx
int ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
//dpTable
int dp[100050];
int main(){
int N,M = 0;
cin >> N;
vector<int> a(200050,0);
for (int i = 1; i <= N; i++) cin >> a.at(i);
vector<int> acnt(200050,0);
for (int i = N; i > 0; i--) {
int cnt = 0;
for (int j = i; j <= N; j += i) {
cnt += acnt.at(j);
}
if (!(cnt % 2 == a.at(i))) {
acnt.at(i) = 1;
M++;
}
}
cout << M << endl;
for (int i = 1; i <= N; i++) {
if (acnt.at(i) == 1) {
cout << i << ' ';
}
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(ll i=0; i<n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main(){
int n; cin >> n;
string s,t; cin >> s >> t;
int ans = s.size()+t.size();
for(int i = n; 0 <= i; i--)
if(s.find(t.substr(0,i)) != string::npos){
ans -= i;
break;
}
cout << ans;
cout << "\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long total = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
total = i;
}
}
long long result = N / total;
long long count = 0;
while (result != 0) {
result = result / 10;
count++;
}
cout << count << endl;
} | #include <stdio.h>
int main(void){
int i;
scanf("%d", &i);
i = i*i*i;
printf("%d\n", i);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
string s; cin >> s;
int n = s.size();
int sc=0, res=0;
rep(i, n){
if(s[i] == 'S'){
sc++;
}else{
if(sc > 0){
sc--;
res++;
}
}
}
cout << n-2*res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//init();
//int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int l = 1, r = n - 1;
string ls, rs;
cout << 1 << endl;
cin >> ls;
if (ls == "Vacant") return 0;
cout << n - 1 << endl;
cin >> rs;
if (rs == "Vacant") return 0;
if (ls != rs) {
cout << 0 << endl;
string s;
cin >> s;
return 0;
}
while (true) {
int mid = (l + r) / 2;
cout << mid << endl;
string ms;
cin >> ms;
if (ms == "Vacant") return 0;
if ((mid - l) % 2 == 0 && ms != ls) {
r = mid;
rs = ms;
}
else if ((mid - l) % 2 == 1 && ms == ls) {
r = mid;
rs = ms;
}
else if ((r - mid) % 2 == 0 && ms != rs) {
l = mid;
ls = ms;
}
else if ((r - mid) % 2 == 1 && ms == rs) {
l = mid;
ls = ms;
}
}
} | 0 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
/* --------------------------------------------------- */
int main() {
int n;
string s, t;
cin >> n >> s >> t;
int ans = s.size() + t.size();
int tot = 0;
for(int i = n - 1; i >= 0; i--) {
bool check = true;
for(int j = i; j < n; j++) {
if(s[j] != t[j - i]) check = false;
}
if(check) tot = n - i;
}
cout << ans - tot << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
int ai = 0;
int bi = 0;
int ci = 0;
char x = 'a';
char ans = '\0';
while (1) {
switch (x) {
case 'a':
if (ai == a.size()) {
cout << 'A';
return 0;
}
x = a[ai];
ai++;
break;
case 'b':
if (bi == b.size()) {
cout << 'B';
return 0;
}
x = b[bi];
bi++;
break;
case 'c':
if (ci == c.size()) {
cout << 'C';
return 0;
}
x = c[ci];
ci++;
break;
}
}
}
| 0 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e6+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=500001;
#define pq priority_queue
#define ff first
#define ss second
#define pb push_back
#define lb lower_bound
ll k1=0;
bool comp(pair<ll,ll>a,pair<ll,ll>b)
{
k1=max(k1,abs(a.ff-b.ff)+abs(a.ss-b.ss));
if(a.ff>b.ff)
return 1;
if(a.ff==b.ff&&a.ss>b.ss)
return 1;
return 0;
}
int dx[]={1,-1};
int dy[]={1,-1};
int main()
{
fastio;
int t;
ll i,j,k,n,m,l;
cin>>n>>k>>l;
if(k*l>=n)
cout<<"Yes";
else
cout<<"No";
}
//Lordvishnu@almighty | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base ::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int d,t,s;
cin>>d>>t>>s;
if(s*t>=d) cout <<"Yes\n";
else cout <<"No\n";
} | 1 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 100010;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
cins(all(a));
bool ok = 1;
if (a[0] != 0) ok = 0;
ll now = 0,cnt = 0;
rep(i,1,n){
if (a[i] == 0 || a[i] == 1){
now = a[i];
continue;
}
if (a[i] > now+1) ok = 0;
now = a[i];
}
ll stock = 0;
now = 0;
if (ok){
rep(i,n){
if (a[i] < now){
cnt += stock;
stock = a[i];
}
else if (a[i] == now){
cnt += a[i];
}
else{
stock = a[i];
}
now = a[i];
}
PRINT(cnt+now);
}
else PRINT(-1);
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans =0;
if(s == "RRR"){ans = 3;}
if(s == "RRS"){ans = 2;}
if(s == "RSR"){ans = 1;}
if(s == "SRR"){ans = 2;}
if(s == "RSS"){ans = 1;}
if(s == "SRS"){ans = 1;}
if(s == "SSR"){ans = 1;}
if(s == "SSS"){ans = 0;}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
inline int read()
{
int sum=0,ff=1; char ch=getchar();
while(!isdigit(ch))
{
if(ch=='-') ff=-1;
ch=getchar();
}
while(isdigit(ch))
sum=sum*10+(ch^48),ch=getchar();
return sum*ff;
}
const int N=1e5+5;
int n,m,a[N],k,p,b[N];
signed main()
{
n=read();
m=read();
k=read();
p=read();
for ( int i=1;i<=n;i++ )
a[i]=read();
sort(a+1,a+n+1);
reverse(a+1,a+n+1);
for ( int i=1;i<=n;i++ ) b[i]=b[i-1]+a[i];
int ans=p;
int i;
for ( i=p+1;i<=n;i++ )
{
if(a[i]+m<a[p]) continue;
int j=i;
// while(a[j]==a[i]&&j<=n) j++;
// j--;
int sum=(n-i+1)+(p-1);
if(sum>=k) ans+=(j-i+1);
else
{
int alb=b[i-1]-b[p-1];
int need=(k-((n-i+1)+(p-1)))*m;
if(((a[i]+m)*(i-p)-alb)>=need) ans+=(j-i+1);
}
i=j;
}
printf("%lld\n",ans);
return 0;
}
| #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N >> M;
vector<pair<int, bool>> num(10);
for (int a = 1; a <= 9; a++) {
int p = 0;
if (a == 1)p = 2;
if (a == 7)p = 3;
if (a == 4)p = 4;
if (a == 2 || a == 3 || a == 5)p = 5;
if (a == 6 || a == 9)p = 6;
if (a == 8)p = 7;
num[a].first = p;
}
for (int i = 0; i < M; i++) {
int a; cin >> a;
num[a].second = true;
}
vector<int> dp(N + 1, -1000);
dp[0] = 0;
int po = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= 9; j++) {
if (num[j].second && i + num[j].first <= N) {
dp[i + num[j].first] = max(dp[i + num[j].first], dp[i] + 1);
if (dp[i + num[j].first] > 0) po = max(po, i + num[j].first);
}
}
}
//cout << "after dp" << endl;
vector<int> ans;
while (po != 0) {
for (int i = 9; i >= 1; i--) {
if (po - num[i].first >= 0 && num[i].second && dp[po] - 1 == dp[po - num[i].first]) {
ans.push_back(i);
po -= num[i].first;
break;
}
}
//cout << "po=" << po << endl;
}
//reverse(ans.begin(), ans.end());
for (int i = 0; i < ans.size() ; i++) {
cout << ans[i];
}
cout << endl;
} | 0 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> static void getint(_T& a) {
const char* fmt = " %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld";
}
if (scanf(fmt, &a) < 0) {
printf("g1int Error\n");
}
}
template<class _T> static void getint(_T& a, _T& b) {
const char* fmt = " %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld";
}
if (scanf(fmt, &a, &b) < 0) {
printf("g2int Error\n");
}
}
template<class _T> static void getint(_T& a, _T& b, _T& c) {
const char* fmt = " %d %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld %lld";
}
if (scanf(fmt, &a, &b, &c) < 0) {
printf("g3int Error\n");
}
}
static void ABC096D();
#if 1
int main()
{
ABC096D();
fflush(stdout);
return 0;
}
#endif
template <class _T> void tp_getPrimes(_T targ, std::map<_T, _T>& primes)
{
_T target = targ;
_T i = 2;
while ((i * i) <= target) {
if ((target % i) == 0) {
target /= i;
primes[i]++;
}
else {
i++;
}
}
if (target > 1) {
primes[target]++;
}
}
static void ABC096D()
{
int N;
getint(N);
std::vector<int> primeNumbers;
for (int i = 2; i <= 55555; i++) {
std::map<int, int> primes;
tp_getPrimes<int>(i, primes);
if ((primes.size() == 1) && (primes.begin()->second == 1)){
primeNumbers.push_back(primes.begin()->first);
}
}
int count = 0;
std::vector<int> ans(N);
auto it = primeNumbers.begin();
while ((it != primeNumbers.end()) && (count < N)) {
if ((*it % 5) == 1) {
ans[count] = *it;
count++;
}
it++;
}
std::string str;
for (int i = 0; i < N; i++) {
char tmp[16] = { 0 };
sprintf(tmp, "%d", ans[i]);
if (i) {
str += ' ';
}
str += tmp;
}
printf("%s\n", str.c_str());
}
| #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n;
cin >> n;
vector<int64_t> ans;
for (auto i : irange(2L, 55556L)) {
if (i % 5 != 1) {
continue;
}
bool ok = true;
for (auto j = 2L; j * j <= i; ++j) {
if (i % j == 0) {
ok = false;
break;
}
}
if (ok) {
ans.push_back(i);
}
if (ans.size() == n) {
break;
}
}
const auto* delim = "";
for (auto a : ans) {
cout << delim << a;
delim = " ";
}
cout << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll DIV = 1000000007;
//#define TEST
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
long A, B;
cin >> A >> B;
ll count=0;
ll input=1;
while(input < B)
{
input--;
input+=A;
count++;
}
cout << count << endl;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count() / 1000.0) << "[ms]" << endl;
#endif
return 0;
} | #include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
typedef long long LL;
const int MOD=998244353;
const int N=2000005;
LL fac[N],inv[N];
void upd(LL &x,LL v) {
x+=v; (x>=MOD)?(x-=MOD):0;
}
void pre() {
fac[0]=fac[1]=inv[0]=inv[1]=1;
rep(i,2,N-1) {
fac[i]=fac[i-1]*i%MOD;
inv[i]=(MOD-MOD/i)*inv[MOD%i]%MOD;
}
rep(i,2,N-1) inv[i]=inv[i]*inv[i-1]%MOD;
}
LL ksm(LL x,LL dep) {
LL res=1;
for (;dep;dep>>=1) {
(dep&1)?(res=res*x%MOD):0;
x=x*x%MOD;
}
return res;
}
LL C(int n,int m) {
return fac[n]*inv[m]%MOD*inv[n-m]%MOD;
}
int main(void) {
pre(); int n,m;
scanf("%d%d",&n,&m);
if (n>m) std:: swap(n,m);
LL ans=0;
rep(i,1,n) upd(ans,C(i+i,i)*C(n+m-i*2,n-i)%MOD);
ans=ans*ksm(C(n+m,n)*2%MOD,MOD-2)%MOD;
upd(ans,m); printf("%lld\n", ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//(a+b-1)/b
signed main(){
string s; cin>>s;
int n; cin>>n;
string ans;
rep(i,0,s.size()){
if(i%n==0)ans.push_back(s[i]);
}
cout<<ans<<endl;
return 0;
} | ///بِسْمِ الّٰلهِ الرَّحْمٰنِ الرَحِيْمِ
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
ll int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d;
cin>>a>>b;
l=max(a,b);
r=min(a,b);
p=16-(a+b);
x=p/2;
if(p%2==1){
x++;
}
//cout<<x<<" "<<l-r<<endl;
if((l-r)<=x){
cout<<"Yay!"<<endl;
}
else{
cout<<":("<<endl;
}
return EXIT_SUCCESS;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
int N, M; cin >> N >> M;
int A[N]; rep(i, N) cin >> A[i];
int B[M]; rep(j, M) cin >> B[j];
sort(A, A+N); reverse(A, A+N);
sort(B, B+M); reverse(B, B+M);
int idx_A = 1, idx_B = 1;
ll ans;
rep(i, N-1){
if(A[i] == A[i+1]){
cout << 0 << endl;
return 0;
}
}
rep(i, M-1){
if(B[i] == B[i+1]){
cout << 0 << endl;
return 0;
}
}
if(A[0] == B[0] && A[0] == N*M){
ans = 1;
ll op = N*M-1;
ll tate = 1, yoko = 1;
ll kouten = 1, put_kouten = 1;
while(idx_A < N || idx_B < M){
if(idx_A == N){
if(op > B[idx_B]){
ans = (ans * (kouten-put_kouten)) % mod;
put_kouten++;
}
else{
kouten += yoko; tate++;
ans = (ans * yoko) % mod;
put_kouten++;
idx_B++;
}
}
else if(idx_B == M){
if(op > A[idx_A]){
ans = (ans * (kouten-put_kouten)) % mod;
put_kouten++;
}
else{
kouten += tate; yoko++;
ans = (ans * tate) % mod;
put_kouten++;
idx_A++;
}
}
else{
if(op > A[idx_A] && op > B[idx_B]){
ans = (ans * (kouten-put_kouten)) % mod;
put_kouten++;
}
else if(op == A[idx_A] && op == B[idx_B]){
//一意に決まる
kouten += tate; yoko++;
kouten += yoko; tate++;
put_kouten++;
idx_A++; idx_B++;
}
else if(op == A[idx_A]){
kouten += tate; yoko++;
ans = (ans * tate) % mod;
put_kouten++;
idx_A++;
}
else{
kouten += yoko; tate++;
ans = (ans * yoko) % mod;
put_kouten++;
idx_B++;
}
}
op--;
}
//1以上op以下の数は好きなとこにおける -> ans *= fac[op];
ll fac[op+1]; fac[0] = 1;
rep(i, op){
fac[i+1] = (fac[i]*(i+1)) % mod;
}
ans = (ans * fac[op]) % mod;
}
else{
ans = 0;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(void) {
constexpr long MOD = 1e9 + 7;
long n, m;
cin >> n >> m;
vector<long> a(n), b(m);
for(auto &e: a) cin >> e;
for(auto &e: b) cin >> e;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
long x = 0, y = 0;
auto aidx = [&](long x) {
auto i = lower_bound(a.begin(), a.end(), x) - a.begin();
return a[i] == x ? i : -1;
};
auto bidx = [&](long x) {
auto i = lower_bound(b.begin(), b.end(), x) - b.begin();
return b[i] == x ? i : -1;
};
long r = 1;
for(int i=m*n; i>=1; i--) {
long ai = aidx(i), bi = bidx(i);
if(ai>=0 && bi>=0) {
x++, y++;
continue;
}
if(ai>=0) {
x++;
r *= y, r %= MOD;
continue;
}
if(bi>=0) {
y++;
r *= x, r %= MOD;
continue;
}
r *= x*y - (m*n - i), r %= MOD;
}
cout << r << endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
using pint = pair<int, int>;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(200005);
rep(i, n)
{
cin >> a[i];
}
rep(i, min(50, k))
{
vector<int> b(200005, 0);
rep(j, n)
{
// 累積和
int left = max(0, j - a[j]);
int right = min(n - 1, j + a[j]);
// cout << "===" << endl;
// cout << left << right << endl;
b[left]++;
b[right + 1]--;
}
// cout << b[0] << " ";
repi(i, 1, n)
{
// cout << b[i] << " ";
b[i] += b[i - 1];
}
// cout << endl;
a = b;
}
rep(i, n)
{
cout << a[i] << " ";
}
return 0;
}
| #include <cstdio>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, p;
int x[50];
int main(){
while(scanf("%d%d", &n, &p), n){
int c = 0;
int q = p;
while(1){
if(q > 0){
++x[c];
--q;
if(x[c] == p){
printf("%d\n", c);
break;
}
}
else{
q += x[c];
x[c] = 0;
}
c = (c + 1) % n;
}
rep(i, n){
x[i] = 0;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define loop(times) for(int i=0;i<(times);i++)
using namespace std;
int main() {
while(1<2){
int n;
long long max;
cin>>n;
if(n==0)break;
int a[n];
int s[n];
loop(n)cin>>a[i];
max=a[0];
s[0]=a[0];
loop(n)s[i+1]=s[i]+a[i+1];
for(int k=0;k<n;k++){
loop(n-k){
if(max<=s[k+i]-s[k-1])max=s[k+i]-s[k-1];
}
}
cout<<max<<endl;
}
}
| #include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while(cin>>n, n) {
int now, max;
cin>>now;
max=now;
for(int i=1; i<n; i++) {
int t;
cin>>t;
if(now<=0) now=t;
else now+=t;
if(max<now) max=now;
}
cout<<max<<'\n';
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=getchar())x=(x<<1)+(x<<3)+(c^48);
x*=p;
}
void read(ll &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=getchar())x=(x<<1)+(x<<3)+(c^48);
x*=p;
}
void Min(int &x,int y){
if (x>y)x=y;
}
void Min(ll &x,ll y){
if (x>y)x=y;
}
void Max(int &x,int y){
if (x<y)x=y;
}
void Max(ll &x,ll y){
if (x<y)x=y;
}
#define bas 50
ll cnt[105][105];
char s[50];
int main(){
// freopen("1.in","r",stdin);
int n,i,j,k,l;
ll x,res=0;
read(n);
/*
cnt2[i]+cnt2[j]>=0
cnt5[i]+cnt5[j]>=0
*/
int m,ct2,ct5;
for (i=1;i<=n;i++){
scanf("%s",s);
m=strlen(s);
x=0; ct2=ct5=0;
for (j=0;j<m;j++){
if (s[j]!='.'){
x=(x<<1)+(x<<3)+(s[j]^48);
}
else{
ct2-=m-j-1;
ct5-=m-j-1;
}
}
for (;x&&x%2==0;)x/=2,ct2++;
for (;x&&x%5==0;)x/=5,ct5++;
cnt[bas+ct2][bas+ct5]++;
if (ct2>=0&&ct5>=0)res--;
// printf("%d %d\n",ct2,ct5);
}
for (i=-50;i<=50;i++){
for (j=-50;j<=50;j++)if (cnt[i+bas][j+bas]){
for (k=-i;k<=50;k++){
for (l=-j;l<=50;l++){
res+=cnt[i+bas][j+bas]*cnt[k+bas][l+bas];
}
}
}
}
printf("%lld\n",res/2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long B = 1e9;
int n;
int f[25][25];
int calc(long long t) {
int x = 0, y = 0;
while (t % 2 == 0) { ++ x; t /= 2; }
while (t % 5 == 0) { ++ y; t /= 5; }
x = max(0, 18 - x);
y = max(0, 18 - y);
//assert(t == 1);
int ans = 0;
for (int i = x; i <= 20; ++i)
for (int j = y; j <= 20; ++j) ans += f[i][j];
return ans;
}
void inc(long long t) {
int x = 0, y = 0;
while (t % 2 == 0) { ++ x; t /= 2; }
while (t % 5 == 0) { ++ y; t /= 5; }
x = min(x, 18);
y = min(y, 18);
++ f[x][y];
}
int main() {
#ifdef Wearry
freopen("in", "r", stdin);
#endif
long long ans = 0;
scanf("%d", &n);
while (n--) {
double a;
scanf("%lf", &a);
long long temp = (long long) round(a * B);
ans += calc(temp);
inc(temp);
}
printf("%lld\n", ans);
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
const int bound = 1000*1000+10;
bool besucht[bound];
void init(){
for( int i = 0; i < bound; ++i ) besucht[i] = false;
}
int no(){
cout << 0 << endl;
return 0;
}
int main(){
int n, m; cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for( auto &k : a ){
cin >> k;
if( besucht[k] ) return no();
besucht[k] = true;
}
init();
for( auto &k : b ){
cin >> k;
if( besucht[k] ) return no();
besucht[k] = true;
}
sort( a.begin(), a.end() );
sort( b.begin(), b.end() );
ll ans = 1;
for( int k = 1; k <= n*m; ++k ){
bool ares = binary_search( a.begin(), a.end(), k );
bool bres = binary_search( b.begin(), b.end(), k );
ll comb = 1;
if( !bres ) comb *= (b.end() - lower_bound( b.begin(), b.end(), k ));
if( !ares ) comb *= (a.end() - lower_bound( a.begin(), a.end(), k ));
if( !ares && !bres ) comb -= n*m-k;
ans *= comb;
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N, M; cin >> N >> M;
vector<int> A(N), B(M); unordered_map<int, int> a, b; bool ok = true;
REP(i, 0, N) {
cin >> A[i];
if(a[A[i]]) ok = false;
a[A[i]] = i + 1;
}
REP(i, 0, M) {
cin >> B[i];
if(b[B[i]]) ok = false;
b[B[i]] = i + 1;
}
if (!ok) {
cout << 0 << endl;
return 0;
}
int count[N * M + 1] = {};
REP(i, 0, N) {
REP(j, 0, M) {
count[min(A[i], B[j])]++;
}
}
vector<int> acnt(N, 0), bcnt(M, 0);
REP(i, 0, N) {
REP(j, 0, M) {
if (A[i] <= B[j]) acnt[i]++;
}
}
REP(j, 0, M) {
REP(i, 0, N) {
if (A[i] >= B[j]) bcnt[j]++;
}
}
ll ans = 1; int cnt = 0;
for (int i = N * M; i > 0; i--) {
cnt += count[i];
if (a[i] && b[i]) {
continue;
} else if (a[i]) {
ans = (ans * acnt[a[i] - 1]) % MOD;
} else if (b[i]) {
ans = (ans * bcnt[b[i] - 1]) % MOD;
} else {
ans = (ans * (cnt - (N * M - i))) % MOD;
}
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
bool ok = true;
if (s[0] != 'A')
ok = false;
int cnt = 0;
for (int i = 2; i <= s.size() - 2; i++)
{
if (s[i] == 'C')
cnt++;
}
if (cnt >= 2 || cnt == 0)
ok = false;
for (int i = 1; i < s.size(); i++)
{
if (s[i] == 'C')
continue;
if ('A' <= s[i] && s[i] <= 'Z')
ok = false;
}
if (ok)
cout << "AC" << endl;
else
cout << "WA" << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
//#include<bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define L(a) scanf("%lld",&a)
#define L2(a,b) scanf("%lld%lld",&a,&b)
#define L3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define PI(a) printf("%d",a)
#define PL(a) printf("%lld",a)
#define PT(t) printf("Case %d: ",t)
#define PB push_back
#define x first
#define y second
#define xx first.first
#define xy first.second
#define yx second.first
#define yy second.second
#define SC scanf
#define PC printf
#define NL printf("\n")
#define SET(a) memset(a,0,sizeof a)
#define SETR(a) memset(a,-1,sizeof a)
#define SZ(a) ((int)a.size())-1
#define f(i,a,b) for(int i=a;i<=b; i++)
#define fr(i,a,b) for(int i=a;i<=b; i++)
#define frr(i,a,b) for(int i=a;i>=b; i--)
#define frv(i,a) for(int i=0;i<a.size();i++)
#define pi 2.0*acos(0.0)
#define R(a) freopen(a, "r", stdin);
#define W(a) freopen(a, "w", stdout);
#define CB(x) __builtin_popcount(x)
#define STN(a) stringtonumber<ll>(a)
#define lol printf("BUG\n")
#define Endl "\n"
#define mk make_pair
using namespace std;
template <class T> inline T BM(T p, T e, T M)
{
ll 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 mul(T p, T e, T M)
{
ll ret = 0;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret + p) ;
p = (p + p) ;
if(ret>=M)ret-=M;
if(p>=M)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);
}
template <class T> inline T mdINV(T a, T M)
{
return BM(a, M - 2, M);
}
template <class T> inline T PW(T p, T e)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T>bool ISLEFT(T a, T b, T c)
{
if(((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)return 1; //Uporer dike //A,b,c, x okkher ordera sorted
else return 0;
}
#define mx 200004
#define base 193ll
typedef pair<int,int >P;
//////////////////////////
////////////////////////
#define F(i,a,b) for(int i=a;i<b; i++)
#define LL long long
#define MX 200007
#define md 998244353ll
///////////////////////////
///////////////////////////
char ar[ MX +2], br [MX+2];
int main(){
string s;
cin>>s;
if(s[0] != 'A'){
PC("WA");
}
else {
bool fl =0;
int cnt = 0;
for(int i = 1; i < s.size(); i++){
if(s[i] >= 'A' && s[i] <= 'Z'){
if(s[i] == 'C' && i >= 2 && i < s.size() - 1){
cnt++;
}
else fl = 1;
}
}
if(fl || cnt != 1)PC("WA");
else PC("AC");
}
NL;
return 0;
} | 1 |
/*
* ALDS1_5_D.cpp
*
* Created on: Apr 30, 2018
* Author: 13743
*/
#include<cstdio>
long mergeCount(int* A, int l, int r) {
if(l+1 == r) {
return 0;
}
int mid = (l + r) / 2;
long c1 = mergeCount(A, l, mid);
long c2 = mergeCount(A, mid, r);
int n1 = mid - l;
int n2 = r - mid;
int A1[n1+1];
int A2[n2+1];
A1[n1] = 1000000001;
A2[n2] = 1000000001;
for(int i=0; i<n1; i++) {
A1[i] = A[l+i];
}
for(int i=0; i<n2; i++) {
A2[i] = A[mid+i];
}
int i1=0, i2=0;
long cc = 0;
for(int i=0; i<r-l; i++){
if(A2[i2] < A1[i1]) {
cc += n1 - i1;
A[l+i] = A2[i2];
i2++;
}
else {
A[l+i] = A1[i1];
i1++;
}
}
return c1 + c2 + cc;
}
int main() {
int n;
int A[200000];
scanf("%d", &n);
for(int i=0; i<n; i++) {
scanf("%d", &A[i]);
}
long cnt = mergeCount(A, 0, n);
printf("%ld\n", cnt);
}
| #include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >> x;
sort(a.begin(), a.end());
for (int i = 0 ; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
if (a[i] == a[j] || a[i] == a[k] || a[j] == a[k]) continue;
if (a[i] + a[j] > a[k]) {
ans++;
//cout << a[i] << " " << a[j] << " " << a[k] << "\n";
}
}
}
}
cout << ans << "\n";
} | 0 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
constexpr int INF = 1 << 30;
constexpr int MOD = 1000000007;
int bubble_sort(vector<int> &A) {
int count = 0;
auto flag = true;
for (int i = 0; flag; ++i) {
flag = false;
for (int j = A.size() - 1; j >= 1; --j) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = true;
count++;
}
}
}
return count;
}
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
auto count = bubble_sort(A);
REP(i, N) {
if (i) cout << " ";
cout << A[i];
}
cout << endl << count << endl;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int INFTY = 1000000001;
long long merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[n1];
int R[n2];
for (int i = 0; i < n1; ++i) {
L[i] = A[left + i];
}
for (int i = 0; i < n2; ++i) {
R[i] = A[mid + i];
}
L[n1] = INFTY;
R[n2] = INFTY;
int i = 0;
int j = 0;
long long cnt = 0;
for (int k = left; k < right; ++k) {
if (L[i] <= R[j]) {
A[k] = L[i];
++i;
} else {
A[k] = R[j];
++j;
cnt += n1 - i;
}
}
return cnt;
}
long long mergeSort(int A[], int left, int right) {
if (left + 1 < right) {
int mid = (left + right) / 2;
long long v1 = mergeSort(A, left, mid);
long long v2 = mergeSort(A, mid, right);
long long v3 = merge(A, left, mid, right);
return v1 + v2 + v3;
} else {
return 0;
}
}
int main() {
int n;
scanf("%d", &n);
int A[n];
for (int i = 0; i < n; ++i) {
scanf("%d", &A[i]);
}
A[n] = INFTY;
long long v = mergeSort(A, 0, n);
cout << v << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10;
const int MAX_NODE_CNT = MAXN << 6;
int n, m, lst[MAXN];
struct Persistent_Segment_Tree {
#define mid ((l + r) >> 1)
#define ls(_) t[_].ls
#define rs(_) t[_].rs
#define lq(_) t[_].ls, l, mid
#define rq(_) t[_].rs, mid + 1, r
int node_cnt, rt[MAXN];
int& operator [](const int& x) { return rt[x]; }
struct node { int ls, rs, data; } t[MAX_NODE_CNT];
int build(int l, int r) {
int cur = ++node_cnt;
if (l == r) return cur;
ls(cur) = build(l, mid), rs(cur) = build(mid + 1, r);
return cur;
}
int modify(int pre, int l, int r, int pos, int val) {
int cur = ++node_cnt; t[cur] = t[pre], t[cur].data += val;
if (l == r) { return cur; }
if (pos <= mid) ls(cur) = modify(ls(pre), l, mid, pos, val);
else rs(cur) = modify(rs(pre), mid + 1, r, pos, val);
return cur;
}
int query(int cur, int l, int r, int ql, int qr) {
if (ql <= l && r <= qr) return t[cur].data;
int ret = 0;
if (ql <= mid) ret += query(lq(cur), ql, qr);
if (qr > mid) ret += query(rq(cur), ql, qr);
return ret;
}
} t;
int main() {
scanf("%d %d", &n, &m);
t[0] = t.build(1, n);
for (int i = 1, x; i <= n; ++i) {
scanf("%d", &x); t[i] = t.modify(t[i - 1], 1, n, i, 1);
if (lst[x]) t[i] = t.modify(t[i], 1, n, lst[x], -1);
lst[x] = i;
}
int pre_ans = 0;
for (int i = 1, u, v; i <= m; ++i) {
scanf("%d %d", &u, &v);
printf("%d\n", (t.query(t[v], 1, n, u, v)));
}
return 0;
} | // by ynymxiaolongbao
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 500010
//FenwickTree↓
int dat[N];
void init(){
rep(i,N)dat[i]=0;
}
void add(int i,int x){
for(;i<N;i+=i&-i)dat[i]+=x;
}
int sum(int i){
int res=0;
for(;i>0;i-=i&-i)res+=dat[i];
return res;
}
int rangesum(int l,int r){//[l,r]
return sum(r)-sum(l-1);
}
//FenwickTree↑
int a[N];
vector<int> ql[N],qid[N];
int ans[N];
int n,q,c[N];
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
cin>>n>>q;
for(int i=1;i<=n;i++)cin>>c[i];
rep(i,q){
int l,r;
cin>>l>>r;
ql[r].push_back(l);
qid[r].push_back(i);
}
init();
for(int i=1;i<=n;i++)a[i]=0;
for(int i=1;i<=n;i++){
if(a[c[i]]>0)add(a[c[i]],-1);
add(i,+1);
a[c[i]]=i;
rep(j,ql[i].size()){
ans[qid[i][j]]=rangesum(ql[i][j],i);
}
}
rep(i,q)cout<<ans[i]<<"\n";
}
| 1 |
/* ?????????????????? */
#include <bits/stdc++.h>
using namespace std;
int e;
int main() {
while (1) {
scanf("%d", &e);
if (e == 0) return 0;
int ans = e;
for (int z=0; z*z*z<=e; z++) {
int z3 = z*z*z;
for (int y=0; y*y+z3<=e; y++) {
int y2 = y*y;
ans = min(ans, y+z+e-y2-z3);
}
}
printf("%d\n", ans);
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int d;
while (cin >> d) {
int ans = 0;
for (int a = d; a <= 600 - d; a += d) ans += a * a * d;
cout << ans << endl;
}
} | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int main()
{
char s[81];
while(gets(s) != NULL){
int len = strlen(s);
if(strstr(s,"this") || strstr(s,"that") || strstr(s,"the")){
cout << s << endl;
continue;
}
for(int i = 0;i < 'z' - 'a';i++){
for(int j = 0;j < len;j++){
if(s[j] >= 'a' && s[j] <= 'z'){
if(s[j]+1 > 'z'){
s[j] = 'a';
}
else{
s[j]++;
}
}
}
if(strstr(s,"this") || strstr(s,"that") || strstr(s,"the")){
cout << s << endl;
break;
}
}
}
} |
// D - Match Matching
// DPによる解法
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
string dp[10030]; // dp[i]: i本のマッチで作れる最大の数
int m[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string max_v(string v1, string v2) {
if (v1.size() > v2.size()) return v1;
if (v1.size() < v2.size()) return v2;
if (v1 > v2) return v1;
else return v2;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> A;
for (int i=0; i<M; i++) {
int a;
cin >> a;
A.push_back(a);
}
for (int i=1; i<=N; i++) {
dp[i] = "#";
}
for (int i=0; i<=N; i++) {
for (int a : A) {
if (dp[i] == "#") continue;
dp[i+m[a]] = max_v(dp[i+m[a]], dp[i] + (char)('0' + a));
}
}
cout << dp[N] << endl;
/*
// **** debug ****
for (int i=0; i<=N; i++) {
cout << dp[i] << endl;
}
*/
return 0;
} | 0 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
int w[4];
int main() {
for (int i = 0; i < 4; i++) {
cin >> w[i];
}
if (w[0] + w[1] > w[2] + w[3]) {
cout << "Left" << endl;
return 0;
}
if (w[0] + w[1] == w[2] + w[3]) {
cout << "Balanced" << endl;
return 0;
}
if (w[0] + w[1] < w[2] + w[3]) {
cout << "Right" << endl;
return 0;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b, c, d;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c >> d;
if (a + b > c + d) {
cout << "Left" << endl;
} else if (a + b < c + d) {
cout << "Right" << endl;
} else {
cout << "Balanced" << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int partition(int *A, int p, int r){
int x=A[r];
int i=p-1;
for(int j=p;j<r;j++){
if(A[j]<=x){
i++;
int tmp=A[i];
A[i]=A[j];
A[j]=tmp;
}
}
int tmp=A[i+1];
A[i+1]=A[r];
A[r]=tmp;
return i+1;
}
int main(){
int n, A[100000];
cin >> n;
for(int i=0;i<n;i++) cin >> A[i];
int q = partition(A, 0, n-1);
for(int i=0;i<q;i++){
if(i>0) cout << ' ';
cout << A[i];
}
cout << " [" << A[q] << ']';
for(int i=q+1;i<n;i++) cout << ' ' << A[i];
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
vector<int> Zalgorithm(vector<int> S) {
vector<int> A(S.size());
A[0] = S.size();
int i = 1, j = 0;
while (i < S.size()) {
while (i+j < S.size() && S[j] == S[i+j]) ++j;
A[i] = j;
if (j == 0) { ++i; continue;}
int k = 1;
while (i+k < S.size() && k+A[k] < j) A[i+k] = A[k], ++k;
i += k; j -= k;
}
return A;
}
int main() {
int N;
cin >> N;
vector<int> a(N), b(N), S(3 * N);
rep(i, N) cin >> a[i];
rep(i, N) cin >> b[i];
rep(i, N) {
S[i] = b[i] ^ b[(i + 1) % N];
S[N + i] = a[i] ^ a[(i + 1) % N];
S[N + N + i] = a[i] ^ a[(i + 1) % N];
}
auto A = Zalgorithm(S);
rep(i, N) {
if (A[N + i] >= N) {
cout << i << " " << (a[i] ^ b[0]) << "\n";
}
}
} | 0 |
#include <iostream>
#include <set>
using namespace std;
class Solver {
public:
int n, m;
int a[10000], b[10000];
int solve() {
set<int> friends, friends_friends;
for (int i = 0; i < m; ++i) {
if (a[i] == 1) {
friends.insert(b[i]);
}
}
for (set<int>::iterator iter = friends.begin(); iter != friends.end(); ++iter) {
for (int i = 0; i < m; ++i) {
if (a[i] == *iter && b[i] != 1 && friends.count(b[i]) == 0) {
friends_friends.insert(b[i]);
} else if (b[i] == *iter && a[i] != 1 && friends.count(a[i]) == 0) {
friends_friends.insert(a[i]);
}
}
}
return friends.size() + friends_friends.size();
}
};
int main() {
Solver s;
while (true) {
cin >> s.n >> s.m;
if (s.n == 0) {
return 0;
}
for (int i = 0; i < s.m; ++i) {
cin >> s.a[i] >> s.b[i];
}
cout << s.solve() << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n, p;
while (1) {
int flag = 0;
int player[50] = { 0 };
cin >> n >> p;
if (n == 0 && p == 0) break;
int p_max = p;
while (1) {
for (int j = 0; j < n; j++) {
if (p != 0) player[j] += 1, p--;
else p = player[j], player[j] = 0;
if (player[j] == p_max) {
flag = -1;
cout << j << endl;
break;
}
}
if (flag == -1) break;
}
}
return 0;
} | 0 |
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<climits>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define MOD 1000000007
#define EPS 1e-9
#define ll long long
#define Pll pair<ll, ll>
#define Pii pair<int, int>
using namespace std;
struct edge{int from, to; ll cost;};
int edit_distance(string s, string t){
int n = (int)s.length(), m = (int)t.length();
vector< vector<int> > dp(n+1, vector<int>(m+1, 1000000));
dp[0][0] = 0;
rep(n) dp[i+1][0] = i+1;
rep(m) dp[0][i+1] = i+1;
rep(n){
repp(j, m){
// replace
if(s[i] == t[j]){
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j]);
}else{
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j] + 1);
}
// insert
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i+1][j] + 1);
// delete
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j+1] + 1);
}
}
return dp[n][m];
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
string s,t;
cin >> s >> t;
cout << edit_distance(s, t) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
if (s.size()>k) {
string sub = s.substr(0, k);
cout << sub << "..." <<endl;
}
else{
cout << s <<endl;
}
}
| 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.