code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<cstdio>
#define MAXN 100010
int gcd(int a,int b)
{
while(b)
{
int t=a;a=b;b=t%b;
}
return a;
}
int n,a[MAXN];
bool dfs()
{
int cnt0=0,cnt1=0;
for(int i=1;i<=n;i++)
(a[i]&1)?cnt1++:cnt0++;
if(cnt0&1) return 1;
if(cnt1>1) return 0;
for(int i=1;i<=n;i++)
if(a[i]&1)
{
if(a[i]==1) return 0;
a[i]--;
break;
}
int d=a[1];
for(int i=2;i<=n;i++)
d=gcd(a[i],d);
for(int i=1;i<=n;i++)
a[i]/=d;
return !dfs();
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
if(dfs()) printf("First\n");
else printf("Second\n");
}
| #include <cstdio>
typedef long long lint;
int const N=1e5+10;
int n,a[N];
int gcd(int x,int y)
{
if(x==-1 || y==-1) return -x*y;
if(x==0) return y;
else return gcd(y%x,x);
}
int g1[N],g2[N];
int main()
{
scanf("%d",&n);
lint sum=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum+=a[i];
if(n%2==0)
{
if(sum%2==1) printf("First");
else printf("Second");
return 0;
}
if(sum%2==0) {printf("First"); return 0;}
int cur=0;
while(true)
{
bool flag=false;
sum=0;
for(int i=1;i<=n;i++) sum+=a[i];
g1[0]=-1; g2[n+1]=-1;
for(int i=2;i<=n;i++) g1[i]=gcd(g1[i-1],a[i]);
for(int i=n-1;i>=1;i--) g2[i]=gcd(g2[i+1],a[i]);
int g;
for(int i=1;i<=n&&!flag;i++)
{
if(a[i]==1) continue;
g=gcd(gcd(g1[i-1],g2[i+1]),a[i]-1);
if(((sum-1)/g)%2==1) flag=true;
}
if(flag)
for(int i=1;i<=n;i++) a[i]/=g;
else
{
if(cur==0) printf("Second");
else printf("First");
return 0;
}
cur^=1;
}
return 0;
} | 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
typedef ll Weight;
struct Edge {
ll src, dst;
Weight weight;
Edge(ll src, ll dst, Weight weight) : src(src), dst(dst), weight(weight) {}
};
bool operator<(const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
e.src != f.src ? e.src < f.src : e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
typedef vector<Weight> Array;
typedef vector<Array> Matrix;
pair<Weight, Edges> Prim(const Graph &g, ll r = 0) {
ll n = g.size();
Edges T;
Weight total = 0;
vector<bool> visited(n);
priority_queue<Edge> Q;
Q.push(Edge(-1, r, 0));
while (!Q.empty()) {
Edge e = Q.top();
Q.pop();
if (visited[e.dst])
continue;
T.push_back(e);
total += e.weight;
visited[e.dst] = true;
AUTO(f, g[e.dst]) if (!visited[f.dst]) Q.push(f);
}
return pair<Weight, Edges>(total, T);
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
vector<pll> X, Y;
Graph G(N);
REP(i, N) {
ll x, y;
cin >> x >> y;
X.push_back(make_pair(x, i));
Y.push_back(make_pair(y, i));
}
sort(ALL(X));
sort(ALL(Y));
REP(i, N - 1) {
G[X[i].second].push_back(
Edge(X[i].second, X[i + 1].second, X[i + 1].first - X[i].first));
G[X[i + 1].second].push_back(
Edge(X[i + 1].second, X[i].second, X[i + 1].first - X[i].first));
G[Y[i].second].push_back(
Edge(Y[i].second, Y[i + 1].second, Y[i + 1].first - Y[i].first));
G[Y[i + 1].second].push_back(
Edge(Y[i + 1].second, Y[i].second, Y[i + 1].first - Y[i].first));
}
auto ans = Prim(G, 0);
cout << ans.first << endl;
return 0;
}
| #include<iostream>
#include<cstdio>
#include<algorithm>
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,s,a[MAX];
bool calc(int p)
{
int s=0,mn=1e9;
for(int i=1;i<=n;++i)s+=a[i]&1,mn=min(mn,a[i]);
if((n-s)&1)return p;
if(s>1||mn==1)return p^1;
for(int i=1;i<=n;++i)a[i]>>=1;
int d=a[1];
for(int i=1;i<=n;++i)d=__gcd(d,a[i]);
for(int i=1;i<=n;++i)a[i]/=d;
calc(p^1);
}
int main()
{
n=read();for(int i=1;i<=n;++i)a[i]=read();
puts(calc(1)?"First":"Second");
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
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; }
const ll INF = 1e18;
template< typename T = int >
struct Edge {
int from, to;
T cost;
int idx;
Edge() = default;
Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}
operator int() const { return to; }
};
template< typename T = int >
struct Graph {
vector< vector< Edge< T > > > g;
int es;
Graph() = default;
explicit Graph(int n) : g(n), es(0) {}
size_t size() const {
return g.size();
}
void add_directed_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es++);
}
void add_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es);
g[to].emplace_back(to, from, cost, es++);
}
void read(int M, int padding = -1, bool weighted = false, bool directed = false) {
for(int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a += padding;
b += padding;
T c = T(1);
if(weighted) cin >> c;
if(directed) add_directed_edge(a, b, c);
else add_edge(a, b, c);
}
}
};
/**
* @brief BFS(幅優先探索)
*/
template< typename T >
vector< T > bfs(const Graph< T > &g, int s) {
T max_cost = 0, beet = 0;
for(auto &es : g.g) {
for(auto &e : es) max_cost = max(max_cost, e.cost);
}
++max_cost;
const auto INF = numeric_limits< T >::max();
vector< T > dist(g.size(), INF);
vector< queue< int > > ques(max_cost + 1);
dist[s] = 0;
ques[0].emplace(s);
for(T cost = 0; cost <= beet; cost++) {
auto &que = ques[cost % max_cost];
while(!que.empty()) {
int idx = que.front();
que.pop();
if(dist[idx] < cost) continue;
for(auto &e : g.g[idx]) {
auto next_cost = cost + e.cost;
if(dist[e.to] <= next_cost) continue;;
dist[e.to] = next_cost;
beet = max(beet, dist[e.to]);
ques[dist[e.to] % max_cost].emplace(e.to);
}
}
}
return dist;
}
int main(){
int n,u,v;
cin >> n >> u >> v;
u--;v--;
Graph<int> g(n);
g.read(n-1,-1,false,false);
auto dista = bfs(g,v);
auto distt = bfs(g,u);
int M = 0;
rep(i,n){
if(dista[i]>distt[i])chmax(M,dista[i]);
}
cout << M-1 << endl;
return 0;
}
| #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = int_fast64_t;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
int n, u, v;
vector<vector<int> > G;
vector<int> depth, maxdepth, parent;
int dfs(int s, int p, int d) {
depth[s] = d;
parent[s] = p;
int maxd = d;
for(const int t : G[s]) if(t != p) {
chmax(maxd, dfs(t, s, d+1));
}
return maxdepth[s] = maxd;
}
void answer() {
cin >> n >> u >> v;
u--; v--;
G.resize(n);
depth.resize(n);
maxdepth.resize(n);
parent.resize(n);
rep(i, n-1) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
dfs(v, -1, 0);
int ans = 0;
int cur = u;
while(cur != 0) {
if(depth[u] - depth[cur] < depth[cur]) {
chmax(ans, maxdepth[cur] - 1);
} else {
chmax(ans, maxdepth[u] - 1);
}
cur = parent[cur];
}
cout << ans << "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} | 1 |
// 3人でカードゲームイージー / 理解できた
// #16973056
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<string> s(3);
cin >> s[0] >> s[1] >> s[2];
vector<int> i(3, 0);
char c[]={'A', 'B', 'C'};
int t=0;
while(true){
if(i[t]==s[t].size()){
cout << c[t] << endl;
return 0;
}
i[t]++;
t=s[t][i[t]-1]-'a';
}
} | #include <bits/stdc++.h>
using namespace std;
int ans = 0;
int dfs(int v, int pv, int k, vector<vector<int>>& g) {
int max_d = 0;
for (int u : g[v]) {
max_d = max(max_d, 1 + dfs(u, v, k, g));
}
if (max_d == k - 1 && v != 0) {
ans += pv > 0;
max_d = -1;
}
return max_d;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> f(n);
for (int i = 0; i < n; i++) {
cin >> f[i];
f[i]--;
}
ans = f[0] != 0;
f[0] = -1;
vector<vector<int>> g(n);
for (int i = 1; i < n; i++) {
g[f[i]].push_back(i);
}
dfs(0, -1, k, g);
/*
for (int i = 0; i < n; i++) {
cerr << i + 1 << " is connected with :";
for (int j : g[i]) {
cerr << ' ' << j + 1;
}
cerr << endl;
}
*/
cout << ans << '\n';
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
string s;
cin>> s;
if(s[0] != 'A' )
{
cout<< "WA\n";
return 0;
}
int cn= 0;
for(int i=1; i<s.size(); i++)
{
if (i>=2 && i<= (s.size() -2 ))
{
if(s[i]== 'C')
{
cn++;
continue;
}
}
if(s[i]< 'a' || s[i] > 'z' || cn>1)
{
{
cout<< "WA\n";
return 0;
}
}
}
cout<< (cn==1? "AC\n" : "WA\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ans = "AC";
if( S[0] != 'A' ) ans = "WA";
else {
string s = S.substr( 2, S.size() - 2 - 1 );
int n = s.find( 'C' );
if( n == string::npos ) ans = "WA";
else if( s.find( 'C', n + 1 ) != string::npos ) ans = "WA";
else {
for( int i = 0; i < S.size(); i++ ) {
if( i == 0 || S[i] == 'C' && 2 <= i && i <= S.size() - 2 ) continue;
if( islower( S[i] ) == false ) ans = "WA";
}
}
}
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> a, b;
vector<int> kmp(const vector<int> &vt, vector<int> &vp)
{
int i, q, k;
int n = vt.size();
int m = vp.size();
vector<int> nxt(m);
vector<int> res;
for (q = 1, k = 0; q < m; ++q) {
while (k > 0 && vp[q] != vp[k]) k = nxt[k - 1];
if (vp[q] == vp[k]) k++;
nxt[q] = k;
}
for (i = 0, q = 0; i < n; ++i) {
while (q > 0 && vp[q] != vt[i]) q = nxt[q - 1];
if (vp[q] == vt[i]) q++;
if (q == N) {
res.push_back(i - m + 1);
q = nxt[q - 1];
}
}
return res;
}
void solve()
{
vector<int> c(2*N-1);
vector<int> d(N);
for (int i = 0; i < N - 1; i++) {
c[i] = a[i] ^ a[i + 1];
d[i] = b[i] ^ b[i + 1];
}
c[N - 1] = a[N - 1] ^ a[0];
d[N - 1] = b[N - 1] ^ b[0];
for (int i = N; i < 2*N; i++) c[i] = c[i - N];
auto pos = kmp(c, d);
for (int k : pos) cout << k << " " << (b[0] ^ a[k]) << endl;
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin >> N;
a.resize(N);
b.resize(N);
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) cin >> b[i];
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) { return std::vector<T>(n, std::forward<T>(val)); }
template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) {
return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}
template<class Cond> struct chain {
Cond cond; chain(Cond cond) : cond(cond) {}
template<class T> bool operator()(T& a, const T& b) const { if(cond(a, b)) { a = b; return true; } return false; }
};
template<class Cond> chain<Cond> make_chain(Cond cond) { return chain<Cond>(cond); }
#include <vector>
using u64 = unsigned long long;
struct hash_bases {
static const u64 MOD = (1ull << 61) - 1;
const int N;
std::vector<std::vector<u64>> bases;
inline static u64 mod(u64 x) {
x = (x >> 61) + (x & MOD);
if(x >= MOD) {
x -= MOD;
}
return x;
}
inline static u64 mul(u64 a, u64 b) {
u64 ac = a >> 31;
a = a & ((1ull << 31) - 1);
u64 bc = b >> 31;
b = b & ((1ull << 31) - 1);
u64 x = ac * b + bc * a;;
x = ac * bc * 2 + (x >> 30) + ((x & ((1ull << 30) - 1)) << 31) + a * b;
return mod(x);
}
hash_bases(std::vector<u64> bs, int M) : N(bs.size()), bases(M, std::vector<u64>(N, 1)) {
for(int i = 1; i < M; i++) {
for(int j = 0;j < N; j++){
bases[i][j] = mul(bases[i - 1][j], bs[j]);
}
}
}
u64 operator()(int i, int r) {
return bases[r][i];
}
} bases(std::vector<u64> { 9973, 10007 }, 202020);
struct rhash {
static const u64 MOD = hash_bases::MOD;
std::vector<u64> h;
u64 len;
rhash() : h(bases.N), len(0) {}
rhash(u64 x): h(bases.N), len(1) {
x = hash_bases::mod(x);
for(int i = 0; i < bases.N; i++) {
h[i] = x;
}
}
rhash next(u64 r) const {
rhash ans;
for(int i = 0;i < bases.N; i++) {
ans.h[i] = hash_bases::mul(h[i], bases(i, r));
}
ans.len = len + r;
return ans;
}
rhash& operator+=(const rhash& r) {
for(int i = 0;i < bases.N; i++) {
h[i] += r.h[i];
if(h[i] >= MOD) h[i] -= MOD;
}
len = std::max(len, r.len);
return (*this);
}
rhash& operator-=(const rhash& r) {
for(int i = 0;i < bases.N; i++) {
if(h[i] < r.h[i]) {
h[i] = h[i] + MOD - r.h[i];
}
else {
h[i] = h[i] - r.h[i];
}
}
return (*this);
}
rhash operator+(const rhash& r) const { return rhash(*this) += r; }
rhash operator-(const rhash& r) const { return rhash(*this) -= r; }
bool operator==(const rhash& r) const {
bool OK = true;
for(int i = 0;i < bases.N; i++){
OK &= h[i] == r.h[i];
}
return OK;
}
};
int main() {
i64 N;
cin >> N;
vector<i64> A(N);
rep(i,0,N) cin >> A[i];
vector<i64> B(N);
rep(i,0,N) cin >> B[i];
vector<rhash> sum(N * 2);
rep(i,0,N * 2 - 1) {
sum[i + 1] = sum[i].next(1) + rhash(A[i % N] ^ A[(i + 1) % N]);
}
rhash bh;
rep(i,0,N) {
bh = bh.next(1) + rhash(B[i % N] ^ B[(i + 1) % N]);
}
rep(i,0,N) {
if(sum[i + N] - sum[i].next(N) == bh) {
cout << i << " " << (A[i] ^ B[0]) << endl;
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
/*
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
*/
int main() {
int N;
cin >> N;
vector<ld> x(N), y(N);
for (int i=0; i<N; i++) cin >> x[i] >> y[i];
vector<ld> base(N), L(N-1);
for (int i=0; i<N; i++) base[i] = i;
int p=1;
for (int i=1; i<=N; i++) p*=i;
ld cnt = 0;
for (int i=0; i<p; i++) {
for (int j=0; j<N-1; j++) {
cnt += sqrt(pow(x[base[j+1]]-x[base[j]],2)+pow(y[base[j+1]]-y[base[j]],2));
}
next_permutation(base.begin(),base.end());
}
ld ans = cnt/p;
cout << fixed << setprecision(8);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
double n;
cin>>n;
vector<vector<double>> d(n,vector<double>(2));
rep(i,n)rep(j,2) cin>>d[i][j];
vector<int> t(n);
rep(i,n) t[i]=i;
double sum=0;
int cnt=0;
do{
for(int i=1;i<n;i++){
sum+=sqrt((d[t[i]][0]-d[t[i-1]][0])*(d[t[i]][0]-d[t[i-1]][0])+(d[t[i]][1]-d[t[i-1]][1])*(d[t[i]][1]-d[t[i-1]][1]));
}
cnt++;
}while(next_permutation(all(t)));
printf("%.10f\n",sum/cnt);
} | 1 |
#include<iostream>
#include<string.h>
using namespace std;
int D[6];
void spin(char c)
{
if(c=='E'){
swap(D[0],D[3]);swap(D[3],D[5]);swap(D[5],D[2]);
}
else if(c=='W'){
swap(D[0],D[2]);swap(D[2],D[5]);swap(D[5],D[3]);
}
else if(c=='S'){
swap(D[0],D[1]);swap(D[0],D[4]);swap(D[4],D[5]);
}
else if(c=='N'){
swap(D[0],D[1]);swap(D[1],D[5]);swap(D[5],D[4]);
}
}
int main()
{
char M[101];
for(int i=0;i<6;i++)cin>>D[i];
cin>>M;
for(int i=0;i<strlen(M);i++)spin(M[i]);
cout<<D[0]<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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; }
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;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N;
cin >>N;
if(N==1){
cout<<"Hello World"<<endl;
}else{
ll A,B;
cin>>A>>B;
cout<<A+B<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int mod = 998244353;
const int N = 1e5+23;
int h[N];
long long binpow(long long b, long long e) {
if (!e) return 1;
if (e&1) return b*binpow(b, e-1)%mod;
return binpow(b*b%mod, e/2);
}
void solve() {
int n; scanf("%d", &n);
for (int d, i = 0; i < n; ++i) {
scanf("%d", &d);
if (!i && d) {
puts("0");
return;
}
++h[d];
}
if (h[0] > 1) {
puts("0");
return;
}
long long ans = 1;
for (int i = 0; i < n-1; ++i) {
if (!h[i] && h[i+1]) {
puts("0");
return;
}
(ans *= binpow(h[i], h[i+1])) %= mod;
}
printf("%lld", ans);
}
int main() {
init();
int t = 1; //scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
i32 M = 998244353;
i32 dp[90310];
i32 dq[90310];
signed main() {
i32 n;
scanf("%d", &n);
vector<i32> A(n);
i32 sum = 0;
REP(i, n) {
scanf("%d", &A[i]);
sum += A[i];
}
i32 lim = (sum - 1) / 2;
dp[0] = 1;
dq[0] = 1;
REP(i, n) {
RREP(t, 90000) {
(dp[t + A[i]] += dp[t]) %= M;
(dp[t] *= 2) %= M;
(dq[t + A[i]] += dq[t]) %= M;
}
}
i32 ans = 1;
REP(i, n) {
ans = (ans * 3) % M;
}
FOR(t, lim + 1, 90000) {
ans = (ans - dp[t] * 3) % M;
}
if (sum % 2 == 0) {
ans = (ans + dq[sum / 2] * 3) % M;
}
ans = (ans + M) % M;
printf("%d\n", ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<(r);i++)
#define pb push_back
#define fi first
#define se second
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x%y) : x;
}
ll LCM(ll x, ll y){
return x/GCD(x, y)*y;
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a,b)+min(c,d) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
int main(){
int h, w, a, b;
cin >> h >> w >> a >> b;
rep(i, h){
rep(j, w){
if(j < a){
if(i < h-b)cout << 1;
else cout << 0;
}
else {
if(i < h-b)cout << 0;
else cout << 1;
}
}
cout << endl;
}
} | 0 |
#include <iostream>
using namespace std;
int main(){
double l1, l2, l3, l4, l5, l6, l7, l8, l9, l10;
double v1, v2;
char c;
while(cin >> l1 >> c >> l2 >> c >> l3 >> c >> l4
>> c >> l5 >> c >> l6 >> c >> l7 >> c >> l8
>> c >> l9 >> c >> l10 >> c >> v1 >> c >> v2)
{
double l[] = {
0,l1,l2,l3,l4,l5,
l6,l7,l8,l9,l10
};
double max_length = l1 + l2 + l3 + l4 + l5
+l6 + l7 + l8 + l9 + l10;
for(int i = 1; i <= 10;i++){
max_length -= (l[i] + (v2 * l[i] / v1));
if(max_length <= 0){
cout << i << endl;
break;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll/*, vl, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef pair<pl, ll> ppl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {if(b == 0) return 0; return (a % b + b) % b;}
bool chmin(ll &a, ll b) {if(b < a) {a = b; return 1;} return 0;}
bool chmax(ll &a, ll b) {if(b > a) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 1e9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<queue<char> > s(3);
string str;
rep(i, 3) {
cin >> str;
rep(j, str.size()) s[i].push(str[j]);
}
ll now=0;
while(1) {
if(!s[now].size()) break;
char c = s[now].front();
s[now].pop();
now = c - 'a';
}
cout << char('A' + now) << newl;
return 0;
} | 0 |
#include <stdio.h>
int main() {
int n;
scanf("2017/01/%d", &n);
if(n<10){
printf("2018/01/0%d", n);
}
else{
printf("2018/01/%d", n);
}
return 0;
} | #include<stdio.h>
int main(){
char tanggal[15];
scanf("%s", &tanggal);
tanggal[3] = '8';
printf ("%s", tanggal);
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main(){
int n,m,most1,most2,d[11000]={0};
while(1){
cin >> n;
if(n==0){
break;
}
most1=0;most2=0;
for(int i=0;i<10100;i++){
d[i]=0;
}
for(int i=2;i*i<=n;i++){
if(d[i]==0){
for(int j=i+i;j<=n;j+=i){
d[j]=1;
}
}
}
for(int i=n;i>=0;i--){
if(d[i]==0 && d[i-2]==0){
most1=i-2;
most2=i;
break;
}
}
cout << most1 << " " << most2 << endl;
}
} | #include <cstdio>
#include <cmath>
#define buf 10000
using namespace std;
int k=0;
int B[buf];
void Answer(int n);
int PrimeNumber(int n);
int main(void){
int i,n;
char str[buf];
for(i=2;i<buf;i++)
PrimeNumber(i);
for( ;fgets(str,sizeof(str),stdin)!=NULL; ){
sscanf(str,"%d",&n);
if(n==0) break;
Answer(n);
}
return 0;
}
void Answer(int n){
int i,j;
for(i=0;i<k;i++){
if(B[i]>n)
break;
}
for(j=i-1;j>=0;j--){
if(B[j]-B[j-1]==2){
printf("%d %d\n",B[j-1],B[j]);
break;
}
}
}
int PrimeNumber(int n){
int i,c;
if(n==2){
B[k]=n;
k++; return 0;
}
if(n<2 || n%2==0)
return 0;
c=sqrt(n);
for(i=3;i<=c;i+=2){
if(n%i==0)
return 0;
}
B[k]=n;
k++; return 0;
} | 1 |
#ifdef _WIN32
#include "XOR.h"
#endif
#include <stdio.h>
#include <iostream>
#include <vector>
#include <array>
constexpr int64_t MOD = 1'000'000'007;
constexpr int64_t help = 1;
#define ll long long int
#define o(X) ll bits##X = 0
//#define ok(X) bits##X += !!(d & (help << X))
#define ok(X) bits##X += d & 1; d >>= 1;
#define oke(X) ans += (bits##X * (n - bits##X) % MOD) *((help << X) % MOD); ans %= MOD;
//ll p = (help << b) % MOD;
//ans += (bits[b] * (n - bits[b]) % MOD) * p;
//ans %= MOD;
void fastscan(ll& number) {
//variable to indicate sign of input number
int c;
number = 0;
// extract current character from buffer
c = getchar();
// Keep on extracting characters if they are integers
// i.e ASCII Value lies from '0'(48) to '9' (57)
for (; (c > 47 && c < 58); c = getchar())
number = number * 10 + c - 48;
// if scanned input has a negative sign, negate the
// value of the input number
}
#ifdef _WIN32
namespace XOR
{
#endif
int main() {
ll n;
fastscan(n);
o(0);
o(1);
o(2);
o(3);
o(4);
o(5);
o(6);
o(7);
o(8);
o(9);
o(10);
o(11);
o(12);
o(13);
o(14);
o(15);
o(16);
o(17);
o(18);
o(19);
o(20);
o(21);
o(22);
o(23);
o(24);
o(25);
o(26);
o(27);
o(28);
o(29);
o(30);
o(31);
o(32);
o(33);
o(34);
o(35);
o(36);
o(37);
o(38);
o(39);
o(40);
o(41);
o(42);
o(43);
o(44);
o(45);
o(46);
o(47);
o(48);
o(49);
o(50);
o(51);
o(52);
o(53);
o(54);
o(55);
o(56);
o(57);
o(58);
o(59);
o(60);
o(61);
o(62);
std::array<ll, 62> bits{};
for (ll i = 0; i < n; i++) {
ll d;
fastscan(d);
ok(0);
ok(1);
ok(2);
ok(3);
ok(4);
ok(5);
ok(6);
ok(7);
ok(8);
ok(9);
ok(10);
ok(11);
ok(12);
ok(13);
ok(14);
ok(15);
ok(16);
ok(17);
ok(18);
ok(19);
ok(20);
ok(21);
ok(22);
ok(23);
ok(24);
ok(25);
ok(26);
ok(27);
ok(28);
ok(29);
ok(30);
ok(31);
ok(32);
ok(33);
ok(34);
ok(35);
ok(36);
ok(37);
ok(38);
ok(39);
ok(40);
ok(41);
ok(42);
ok(43);
ok(44);
ok(45);
ok(46);
ok(47);
ok(48);
ok(49);
ok(50);
ok(51);
ok(52);
ok(53);
ok(54);
ok(55);
ok(56);
ok(57);
ok(58);
ok(59);
ok(60);
ok(61);
ok(62);
}
ll ans = 0;
oke(0);
oke(1);
oke(2);
oke(3);
oke(4);
oke(5);
oke(6);
oke(7);
oke(8);
oke(9);
oke(10);
oke(11);
oke(12);
oke(13);
oke(14);
oke(15);
oke(16);
oke(17);
oke(18);
oke(19);
oke(20);
oke(21);
oke(22);
oke(23);
oke(24);
oke(25);
oke(26);
oke(27);
oke(28);
oke(29);
oke(30);
oke(31);
oke(32);
oke(33);
oke(34);
oke(35);
oke(36);
oke(37);
oke(38);
oke(39);
oke(40);
oke(41);
oke(42);
oke(43);
oke(44);
oke(45);
oke(46);
oke(47);
oke(48);
oke(49);
oke(50);
oke(51);
oke(52);
oke(53);
oke(54);
oke(55);
oke(56);
oke(57);
oke(58);
oke(59);
oke(60);
oke(61);
oke(62);
//for (ll b = 0; b < 62; b++) {
// ll p = (help << b) % MOD;
// ans += (bits[b] * (n - bits[b]) % MOD) * p;
// ans %= MOD;
//}
std::cout << ans;
return 0;
}
#ifdef _WIN32
}
#endif
| #include<bits/stdc++.h>
#define MOD 1000000007
#define ll long long
using namespace std;
long long dataset[300005]={0};
int main()
{
int number;
cin>>number;
for(int i=0;i<number;i++)
cin>>dataset[i];
ll result=0;
for(ll i=0;i<62;i++)
{
long long zeros=0,ones=0;
for(ll j=0;j<number;j++)
{
if(dataset[j]%2ll==1)
ones++;
else
zeros++;
dataset[j]/=2ll;
}
result+=((ones*zeros)%MOD*((1ll<<i)%MOD))%MOD;
result%=MOD;
}
cout<<result<<endl;
}
| 1 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
ll gcd(ll a, ll b) {
if (b == 0) { return a; }
if (a < b) { return gcd(b, a); }
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) *b;
}
struct edge {
ll ind;
ll fr;
ll to;
ll d;
};
///////////////////////////
int main() {
ll A, B, C;
cin >> A >> B >> C;
if ((C - A)*(C - B) > 0) { cout << "No"; }
else { cout << "Yes"; }
system("PAUSE");
}
| #include <stdio.h>
int main () {
int n, r;
scanf("%d %d", &n, &r) ;
if (n<10) {
printf("%d\n", r+(1000-100*n)) ;
}
else if (n>=10) {
printf("%d\n", r) ;
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
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(){
ll a,b;cin >> a >>b;
cout << 100 <<" " <<100 <<endl;
vector<vector<char>> g(100,vector<char>(100,'.'));
rep(i,50){
rep(j,100){
g[i][j]='#';
}
}
a--;b--;
ll i=0,j=0;
while(a!=0){
if(j%2==0){g[i][j]='.';a--;}
j++;if(j==100){j=0;i+=2;}
}
i=99;j=99;
while(b!=0){
if(j%2==0){g[i][j]='#';b--;}
j--;if(j==-1){j=99;i-=2;}
}
rep(i,100){
rep(j,100){
cout << g[i][j];
}
cout <<endl;
}
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
inline int read()
{
int x=0;char ch=getchar();
while(ch<'0' || '9'<ch)ch=getchar();
while('0'<=ch && ch<='9')x=x*10+(ch^48),ch=getchar();
return x;
}
const int M=1e5+9;
int m;
int a[M],b[M],top;
int main()
{
int n=read(),m=read();
int odd1=-1,odd2=-1;
for(int i=1;i<=m;i++)
{
a[i]=read();
if(a[i]&1)
{
if(odd1==-1)
odd1=i;
else if(odd2==-1)
odd2=i;
else
{
puts("Impossible");
return 0;
}
}
}
if(m==1)
{
if(a[1]==1)
printf("1\n1\n1\n");
else
printf("%d\n2\n1 %d\n",a[1],a[1]-1);
return 0;
}
if(odd1!=-1)
swap(a[1],a[odd1]);
if(odd2!=-1)
swap(a[m],a[odd2]);
for(int i=1;i<=m;i++)
printf("%d%c",a[i]," \n"[i==m]);
if(a[m]==1)
{
printf("%d\n",m-1);
printf("%d ",a[1]+1);
for(int i=2;i<m;++i)
printf("%d ",a[i]);
puts("");
return 0;
}
b[1]=a[1]+1;
for(int i=2;i<m;i++)
b[i]=a[i];
b[m]=a[m]-1;
printf("%d\n",m);
for(int i=1;i<=m;i++)
printf("%d%c",b[i]," \n"[i==m]);
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
bool isPrime[100010];
void set_prime() {
for (int i = 1; i <= 100000; i++) {
isPrime[i] = true;
}
isPrime[0] = false; isPrime[1] = false;
for (int i = 2; i * i <= 100000; i++) {
int j = 2;
while (i * j <= 100000) {
isPrime[i * j] = false;
j++;
}
}
}
int main()
{
int N;
cin >> N;
set_prime();
int j = 2;
for (int i = 0; i < N; i++) {
while (true) {
if (isPrime[j] && j % 5 == 1) {
cout << j++ << " ";
break;
}
j++;
}
}
cout << endl;
}
| #include <iostream>
using namespace std;
int main()
{
int a[55556];
fill(a, a + 55556, 1);
a[0] = a[1] = 0;
for (int i = 4; i < 55556; i += 2) {
a[i] = 0;
}
for (int i = 3; i * i < 55556; i += 2) {
if (a[i] == 1) {
for (int j = i + i; j < 55556; j += i) {
a[j] = 0;
}
}
}
int n;
cin >> n;
for (int i = 11, j = 0; j < n; i += 5) {
if (a[i] == 1) {
cout << i << (j == n - 1 ? "\n" : " ");
j++;
}
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define debug3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";
#define P pair<int, int>
#define dvec vector<vector<ll>>
//printf("%.10f\n")
//cout << fixed << setprecision(10);
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 = 1e+18;
int iINF = 1e9;
int main()
{
int H, W; cin >> H >> W;
vector<vector<pair<int, int>>> grid(H, vector<pair<int, int>>(W, {0, 0}));
rep(i, 0, H) rep(k, 0, W) cin >> grid[i][k].first;
rep(i, 0, H) rep(k, 0, W) cin >> grid[i][k].second;
vector<vector<vector<bool>>> dp(H + 1, vector<vector<bool>>(W + 1, vector<bool>(13000, false)));
dp[0][1][0] = true;
repe(i, 1, H){
repe(k, 1, W){
rep(l, 0, 13000){
int pre = abs(grid[i - 1][k - 1].first - grid[i - 1][k - 1].second);
if(dp[i - 1][k][l]){
dp[i][k][l + pre] = true;
if(l - pre >= 0) dp[i][k][l - pre] = true;
if(pre - l >= 0) dp[i][k][pre - l] = true;
}
if(k == 1) continue;
if(dp[i][k - 1][l]){
dp[i][k][l + pre] = true;
if(l - pre >= 0) dp[i][k][l - pre] = true;
if(pre - l >= 0) dp[i][k][pre - l] = true;
}
}
}
}
int ans = iINF;
rep(i, 0, 13000){
if(dp[H][W][i]){
ans = i;
break;
}
}
cout << ans << endl;
}
| #include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int a, b;
int num[15];
int bind(int p,int q){
if(q<10){
return 10*p+q;
}
else return 100*p+q;
}
int main(void){
while(1){
cin >> a >> b;
if(a == 0 && b == 0){
return 0;
}
set <int> S;
for(int i=0;i<a;i++){
cin >> num[i];
}
for(int i=0;i<a;i++){
for(int j=0;j<a;j++){
for(int k=0;k<a;k++){
for(int l=0;l<a;l++){
if(b==4){
if(i != j && i != k && i != l && j != k && j != l && k != l){
int c = bind(bind(bind(num[i],num[j]),num[k]),num[l]);
S.insert(c);
}
}
if(b==3){
if(j != k && j != l && k != l){
int c = bind(bind(num[j],num[k]),num[l]);
S.insert(c);
}
}
if(b==2){
if(k != l){
int c = bind(num[k],num[l]);
S.insert(c);
}
}
}
}
}
}
cout << S.size() <<endl;
S.clear();
}
} | 0 |
#include<stdio.h>
int main() {
char character1[100];
char character2[100];
scanf("%s", character1);
scanf("%s", character2);
printf("%s%s", character2, character1);
return 0;
} | /*
author : nishi5451
created: 11.08.2020 22:36:41
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s,t;
cin >> s >> t;
string ans = t+s;
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int min;
int ans = 1;
cin >> N >> min;
for(int i=0;i<N-1;++i){
int s; cin >> s;
if(s < min){
ans += 1;
min = s;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int *p = new int[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
int min = INT_MAX;
for (int i = 0; i < n; i++) {
if (p[i] <= min) {
min = p[i];
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
string res = "";
while (N) {
--N;
res += (char)('a' + (N % 26));
N /= 26;
}
reverse(res.begin(), res.end());
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flg = false;
for(int i = 0; i < s.size(); i++){
if(flg){
if(s[i] == 'C'){
cout << "Yes" << endl;
return 0;
}else{
flg =false;
}
}else{
if(s[i] == 'A') flg = true;
}
}
cout << "No" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
while (cin >> n) {
n += ".";
int num[] = {1, 5, 10, 50, 100, 500, 1000};
char ch[] = {'I', 'V', 'X', 'L', 'C', 'D', 'M'};
int cnt = 0;
vector<int> a;
for (int i = 0; i < n.size(); ++i) {
int x = 0;
for (int j = 0; j < 7; ++j) {
if (n[i] == ch[j]) x = num[j];
}
cnt += x;
if (n[i] == n[i + 1]) continue;
a.push_back(cnt);
cnt = 0;
}
int ans = 0;
for (int i = 0; i < a.size(); ++i) {
if (a[i] < a[i + 1]) a[i + 1] -= a[i];
else ans += a[i];
}
cout << ans << endl;
}
} | #include <iostream>
#include <string>
int main()
{
unsigned int a = 0, max_num = 11, min_num = 0;
std::cin >> a;
if ((min_num < a) && (a < max_num)) {
a = a + (a * a) + (a * a * a);
std::cout << a;
}
else
{
std::cout << "Err a = " << a;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i) cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
long long res = 0;
for (int i = 1; i < n; ++i)
if (a[i] > a[i - 1] + 1) return -1;
if (a[0] != 0) return -1;
for (int i = 1; i < n; ++i)
if (a[i] - 1 == a[i - 1])
++res;
else
res += a[i];
return res;
}
| //Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#define pb push_back
#define pq priority_queue
#define dbg(x) cerr << #x" = " << x << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fl(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout)
using namespace std;
namespace io {
const int SI = 1 << 21 | 1;
char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
int f, t;
#define gc() (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin), IS == IT ? EOF : *IS++) : *IS++)
inline void flush() {
fwrite(OB, 1, OS - OB, stdout), OS = OB;
}
inline void pc(char x) {
*OS++ = x;
if (OS == OT) flush();
}
template <class I>
inline void rd(I &x) {
for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15), c = gc());
x *= f;
}
template <class I>
inline void rd(I &x, I &y) {
rd(x), rd(y);
}
template <class I>
inline void rd(I &x, I &y, I &z) {
rd(x), rd(y), rd(z);
}
template <class I>
inline void rda(I *a, int n) {
for (int i = 1; i <= n; i++) rd(a[i]);
}
inline void rdc(char &c) {
for (c = gc(); c < 33 || c > 126; c = gc());
}
inline void rds(char *s, int &n) {
for (c = gc(); c < 33 || c > 126; c = gc());
for (n = 0; c >= 33 && c <= 126; s[++n] = c, c = gc());
s[n+1] = '\0';
}
inline void rds(string &s) {
for (c = gc(); c < 33 || c > 126; c = gc());
for (s.clear(); c >= 33 && c <= 126; s.pb(c), c = gc());
}
template <class I>
inline void print(I x, char k = '\n') {
if (!x) pc('0');
if (x < 0) pc('-'), x = -x;
while (x) ch[++t] = x % 10 + '0', x /= 10;
while (t) pc(ch[t--]);
pc(k);
}
template <class I>
inline void print(I x, I y) {
print(x, ' '), print(y);
}
template <class I>
inline void print(I x, I y, I z) {
print(x, ' '), print(y, ' '), print(z);
}
template <class I>
inline void printa(I *a, int n) {
for (int i = 1; i <= n; i++) print(a[i], " \n"[i==n]);
}
inline void printc(char c) {
pc(c);
}
inline void prints(char *s, int n) {
for (int i = 1; i <= n; i++) pc(s[i]);
pc('\n');
}
inline void prints(string s) {
int n = s.length();
while (t < n) pc(s[t++]);
pc('\n'), t = 0;
}
struct Flush {
~Flush() {
flush();
}
} flusher;
}
using io::rd;
using io::rda;
using io::rdc;
using io::rds;
using io::print;
using io::printa;
using io::printc;
using io::prints;
const int N = 2e5 + 7;
int n, a[N];
ll ans;
int main() {
rd(n), rda(a, n);
for (int i = 1; i <= n; i++)
if (a[i] >= i || a[i] - a[i-1] > 1) return print(-1), 0;
for (int i = 1; i <= n; i++)
if (i == n || a[i] != a[i+1] - 1) ans += a[i];
print(ans);
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(x) (x).begin(),(x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
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 ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main(){
string s;cin>>s;
ll n=s.size();
map<char,ll>a;
rep(i,s.size()){
a[s[i]]++;
}
sort(all(s));
s.erase(unique(all(s)),s.end());
ll ans=n*(n-1)/2+1;
rep(i,s.size()){
ans-=a[s[i]]*(a[s[i]]-1)/2;
}
cout<<ans<<endl;
}
| #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
template<class T> inline bool chmin(T &a, T b) {if (a>b) {a = b; return 1;} return 0;};
template<class T> inline bool chmax(T &a, T b) {if (a<b) {a = b; return 1;} return 0;};
typedef long long int ll;
const long long INF = 1LL << 60;
int main(){
int N; cin >> N;
vector<string> rec(N);
int iter = 0;
int ok = 0, ng = N, mid = 0;
while (iter<=20){
cout << mid << endl;
string s; cin >> s;
cout.flush();
if (s=="Vacant") break;
iter++;
rec[mid] = s;
if ((mid-ok)%2 == (rec[ok]!=rec[mid])) ok = mid;
else ng = mid;
mid = (ok+ng)/2;
}
// cout << fixed << setprecision(10);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int K, T; cin >> K >> T;
vector<int> A(T);
rep(i, T) cin >> A.at(i);
sort(A.begin(), A.end(), greater<int>());
if (A[0] < K - A[0]) {
cout << 0 << endl;
} else {
cout << A[0] - (K - A[0]) - 1 << 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 K, T;
cin >> K >> T;
vector<int> A(T+1);
rep(i, T) cin >> A[i];
vector<int> ans;
int cnt = 0;
int pre_idx = -1;
int now_idx = T;
rep(i, K){
rep(j, T){
if(pre_idx == j) continue;
if(A[now_idx] < A[j]) now_idx = j;
}
if(now_idx == T){
now_idx = pre_idx;
cnt += 1;
}
A[now_idx] -= 1;
ans.push_back(now_idx);
pre_idx = now_idx;
now_idx = T;
}
cout << cnt << endl;
return 0;
}
| 1 |
//こんなプログラムを組んではいけない(戒め
//マージの仕様が複雑だし、空白マスを引く処理忘れやすいし、ひどいコードだ。
#include<iostream>
#include<queue>
using namespace std;
const int h = 12;
const int w = 12;
const int dy[4] = {-1, 0, 1, 0};
const int dx[4] = {0, 1, 0, -1};
char data[h][w+2];
//データ構造をマージする一般的なテクなし。
class UnionFind {
public:
int oya[2521], size;
void ini(int size) { this->size = size; for( int i = 0;i < size; i++ ) oya[i] = i; }
int root(int x) { if( oya[x] == x ) return x; return (oya[x] = root(oya[x]) ); }
void marge(int x, int y) { x = root(x); y = root(y); if ( x != y ) { size--; oya[x] = y; } }
}uf;
void bfs(int sy, int sx) {
queue<int> que;
que.push(sy*w + sx);
while( !que.empty() ) {
int now = que.front();
que.pop();
if ( data[now/w][now%w] == '0' )
continue;
if ( uf.root(now) != now ) //すでに調べている(マージされている)ならcontinue
continue;
uf.marge(now, sy*w + sx); //nowをsy*w + sxにくっつける(逆にしたら無限ループするかも)
for(int i = 0; i < 4; i++ ) {
int ny = now/w + dy[i];
int nx = now%w + dx[i];
if ( 0 <= ny && ny < h && 0 <= nx && nx < w )
que.push(ny * w + nx);
}
}
}
int main() {
int i, j;
while( cin >> data[0] ) {
for( i = 1; i < h; i++ )
cin >> data[i];
uf.ini(h*w);
int minus = 0;
for( i = 0; i < h; i++ ) {
for( j = 0; j < w; j++ ) {
minus += (data[i][j] == '0');
bfs(i, j);
}
}
cout << uf.size - minus << endl;
}
return 0;
} | #include<cstdio>
#include<iostream>
using namespace std;
char masu[50][50] = {{0}};
void saiki(int x,int y){
masu[y][x] = '0';
if(masu[y+1][x] == '1') saiki(x,y+1);
if(masu[y-1][x] == '1') saiki(x,y-1);
if(masu[y][x+1] == '1') saiki(x+1,y);
if(masu[y][x-1] == '1') saiki(x-1,y);
}
int main(){
while(1){
int cnt = 0;
for(int i = 0; i < 12; i++){
if(scanf("%s",masu[i]) == EOF)goto a;
}
for(int i = 0; i < 12; i++){
for(int j = 0; j < 12; j++){
if(masu[i][j] == '1'){
saiki(j,i);
cnt++;
}
}
}
cout << cnt << endl;
}
a:;
return 0;
} | 1 |
#pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
template<class T=ll> using V = vector<T>;
template<class T=ll> using PQ = priority_queue<T>;
template<class T=ll> using PQG = priority_queue<T, V<T>, greater<T>>;
const ll MOD = 1000000007LL;
void in() {}
template<class Head, class... Tail>
void in(Head&& head, Tail&&... tail)
{
cin >> head;
in(move(tail)...);
}
#define IN(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define INS(T, ...) T __VA_ARGS__; in(__VA_ARGS__)
#define VIN(T, v, n) V<T> v(n); for(auto& _elem:v)cin>>_elem
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 (a>b) {a=b; return 1;} return 0;}
#define y0 y__0
#define y1 y__1
#define j0 j__0
#define j1 j__1
#define YN(e) cout << ((e) ? "YES" : "NO") << endl
#define yn(e) cout << ((e) ? "Yes" : "No") << endl
#pragma endregion RegionDefs
void solve()
{
IN(n, k);
cout << n - k + 1 << endl;
}
int main()
{
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(numeric_limits<double>::max_digits10);
solve();
return 0;
} | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include <numeric>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=(int)1000000007;
const llint big=(llint)(2.19e15)+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
llint lcm(llint a,llint b){return a/gcd(a,b) *b;}
template<class T,class U> auto LB(T& ve,U in){return lower_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto UB(T& ve,U in){return upper_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto LBI(T& ve,U in){return LB(ve,in)-ve.begin();}
template<class T,class U> auto UBI(T& ve,U in){return UB(ve,in)-ve.begin();}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
using pli=pair<llint,int>;
using daic=priority_queue<pli,vector<pli>,greater<pli>>;
class seg_tree{public:
//セグ木
vector<llint>val;
seg_tree(void){val.res(524288);}
//両側からアクセスするので、bitテクが使える
// 1
// 2 3
//4 5 6 7
//偶数ナンバーは、(短縮時間+x) を記録
//奇数ナンバーは、(短縮時間-x) を記録
llint que(llint bas,llint mae){
llint time=-abs(bas-mae);//短縮
int bi=bas-1+262144;
while(bi>1){
if(bi%2==0){maxeq(time,val[bi+1]+bas);}
bi/=2;
}
bi=bas+1+262144;
while(bi>1){
if(bi%2==1){maxeq(time,val[bi-1]-bas);}
bi/=2;
}
time+=abs(bas-mae);
bi=mae+262144;
while(bi>1){
if(bi%2==0){maxeq(val[bi],time+mae);}
if(bi%2==1){maxeq(val[bi],time-mae);}
bi/=2;
}
return time;
}
};
int main(void){
seg_tree ki;
int n,q;cin>>n>>q;
int A;cin>>A;
int mae;cin>>mae;
int bi=A+262144;
while(bi>1){
if(bi%2==0){maxeq(ki.val[bi],big+A);}
if(bi%2==1){maxeq(ki.val[bi],big-A);}
bi/=2;
}
llint ans=0,wa=big;
while(q--){
llint x;cin>>x;
maxeq(ans,ki.que(x,mae));
wa+=abs(mae-x);
mae=x;
}
cout<<wa-ans<<endl;RE;
} | 0 |
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,x;
cin >> n >> x;
vll a(n);
REP(i,n) cin >> a[i];
ll ans = 0;
REP(i,n-1){
ll sum = a[i] + a[i+1];
ll t = min(a[i+1], max(0LL, sum-x));
ans += t;
a[i+1] -= t;
sum -= t;
t = min(a[i], max(0LL,sum-x));
ans += t;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin>>n>>x;
long long int ans=0;
long long int a;
cin>>a;
for(int i=0; i<n-1; i++){
long long int b;
long long int eat=0;
cin>>b;
eat=max(a+b-x, eat);
ans+=eat;
if(b<=eat) b=0;
else b=b-eat;
a=b;
}
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int m, n;
vector<int> a(4);
for(int i = 0; i < 4; i++){
cin >> a[i];
}
cin >> m >> n;
sort(a.rbegin(), a.rend());
int ans = a[0] + a[1] + a[2] + max(m,n);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1<<18,INF=1<<29;
int main(){
int a,b,c,d,e,f;cin>>a>>b>>c>>d>>e>>f;
cout<<a+b+c+d+e+f-min({a,b,c,d})-min(e,f)<<endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int N,M;
int G[15][15];
int dp[15][(1<<15)];
int INF=2e9;
int calc(int bit,int nbit){
int sum=0;
for(int i=0;i<N;i++)
if(nbit>>i&1)
for(int j=0;j<N;j++)
if(~bit>>j&1)
if(~nbit>>j&1)
sum+=G[i][j];
return sum;
}
int rec(int pos,int bit){
static unordered_map< int , int > mem[15];
if( mem[pos].count(bit) )return mem[pos][bit];
if(pos==N-1)return 0;
int res=INF;
int sup=(1<<(N-1))-1-bit;
int nbit=sup;
while(1){
if(nbit>>pos&1){
int cost=calc(bit,nbit);
for(int to=0;to<N;to++){
if(bit>>to&1)continue;
if(nbit>>to&1)continue;
if(G[pos][to]==0)continue;
res=min(res, rec(to,bit|nbit) + cost - G[pos][to]);
}
}
nbit--;
nbit&=sup;
if(nbit==0)break;
}
return mem[pos][bit]=res;
}
int main(){
cin>>N>>M;
for(int i=0;i<M;i++){
int a,b,c;
cin>>a>>b>>c;
a--,b--;
G[a][b]=G[b][a]=c;
}
cout<< rec(0,0) <<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
template<typename T>inline bool chkmin(T &x,T y){return (y<x)?(x=y,1):0;}
template<typename T>inline bool chkmax(T &x,T y){return (y>x)?(x=y,1):0;}
inline int read(){
int x;
char c;
int f=1;
while((c=getchar())!='-' && (c>'9' || c<'0'));
if(c=='-') f=-1,c=getchar();
x=c^'0';
while((c=getchar())>='0' && c<='9') x=(x<<1)+(x<<3)+(c^'0');
return x*f;
}
inline ll readll(){
ll x;
char c;
int f=1;
while((c=getchar())!='-' && (c>'9' || c<'0'));
if(c=='-') f=-1,c=getchar();
x=c^'0';
while((c=getchar())>='0' && c<='9') x=(x<<1ll)+(x<<3ll)+(c^'0');
return x*f;
}
const int inf=0x3f3f3f3f;
int val[15][15],sum[1<<15],dp[15][1<<15],f[15];
int main(){
int n=read(),m=read();
while(m--){
int x=read()-1,y=read()-1,z=read();
val[x][y]=z,val[y][x]=z;
sum[(1<<x)|(1<<y)]=z;
}
REP(i,0,n-1) REP(j,0,(1<<n)-1) if((1<<i)&j) sum[j]+=sum[j^(1<<i)];
REP(i,0,n-1) REP(j,0,(1<<n)-1) dp[i][j]=-inf;
REP(j,1,(1<<n)-1) if(j&1) dp[0][j]=sum[j];
REP(i,1,(1<<n)-1){
REP(j,0,n-1) f[j]=-inf;
REP(j,0,n-1) if(i&(1<<j)) REP(k,0,n-1) if(val[j][k] && (i&(1<<k))==0) chkmax(f[k],dp[j][i]+val[j][k]);
REP(j,0,n-1) if((i&(1<<j))==0)
for(int cur=i|(1<<j),k=cur;k<=iend;k=(k+1)|cur)
chkmax(dp[j][k],f[j]+sum[k^i]);
}
printf("%d\n",sum[(1<<n)-1]-dp[n-1][(1<<n)-1]);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
double r,g;
cin>>r>>g;
cout<<(g*2)-r;
return;
}
int main()
{
fast;
ll q;
q=1;
// cin>>q;
while(q--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
const ll mod = 1e9 + 7;
main(){
int n;
cin >> n;
cout << (n-2)*180 << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main(){
ll R;
cin >> R;
if(R < 1200){
cout << "ABC" << endl;
} else if(R < 2800){
cout << "ARC" << endl;
} else{
cout << "AGC" << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
// http://www.prefield.com/algorithm/misc/dice.html
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
dice() {
id[TOP] = 1; id[FRONT] = 2; id[LEFT] = 3;
id[RIGHT] = 4; id[BACK] = 5; id[BOTTOM] = 6;
}
dice(int top,int front,int right,int left,int back,int bottom) {
id[TOP] = top; id[FRONT] = front; id[LEFT] = right;
id[RIGHT] = left; id[BACK] = back; id[BOTTOM] = bottom;
}
int& operator[] (FACE f) { return id[f]; }
const int& operator[] (FACE f) const { return id[f]; }
bool operator==(const dice &b) const {
const dice &a = *this;
return a[TOP] == b[TOP] && a[BOTTOM] == b[BOTTOM] &&
a[FRONT] == b[FRONT] && a[BACK] == b[BACK] &&
a[LEFT] == b[LEFT] && a[RIGHT] == b[RIGHT];
}
void roll_x() { roll(TOP, BACK, BOTTOM, FRONT); }
void roll_x2() { roll(TOP, FRONT, BOTTOM, BACK); }
void roll_y() { roll(TOP, LEFT, BOTTOM, RIGHT); }
void roll_y2() { roll(TOP, RIGHT, BOTTOM, LEFT); }
void roll_z() { roll(FRONT, RIGHT, BACK, LEFT); }
void roll_z2() { roll(FRONT, LEFT, BACK, RIGHT); }
bool equivalent_to(const dice& di) {
for (int k = 0; k < 6; (k&1?roll_y():roll_x()),++k)
for (int i = 0; i < 4; roll_z(), ++i)
if (*this == di) return true;
return false;
}
private:
void roll(FACE a, FACE b, FACE c, FACE d) {
int tmp = id[a];
id[a] = id[b]; id[b] = id[c];
id[c] = id[d]; id[d] = tmp;
}
int id[6];
};
int main(){
int n,d[6];
cin>>n;
vector<dice>v(n);
for(int j=0;j<n;j++){
for(int i=0;i<6;i++)cin>>d[i];
v[j]=dice(d[0],d[1],d[2],d[3],d[4],d[5]);
}
for(int j=0;j<n-1;j++)for(int i=j+1;i<n;i++)if(v[j].equivalent_to(v[i])){
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
} | 0 |
#include <iostream>
#include <stdio.h>
#include <iomanip>
#include <string>
using namespace std;
int main(void){
int n;
scanf("%d",&n);
int* a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << a[n - 1];
for (int i = 1; i < n; i++) {
cout << " " << a[n - i - 1];
}
cout << endl;
delete[] a;
return 0;
} | #include<iostream>
const static int MIN = -1000000;
const static int MAX = 1000000;
int main(void){
int k, x;
std::cin >> k >> x;
int cmax = std::min(MAX, x + k - 1);
int cmin = std::max(MIN, x - k + 1);
for(int i = cmin; i <= cmax; i++){
std::cout << i << " ";
}
std::cout << 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 int INF = 1001001001;
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
ll ans = 0;
rep(i, 0, 60) {
ll x = 0;
rep(j, 0, n) {
if (a[j] >> i & 1) x++;
}
ll now = x * (n - x) % MOD;
rep(j, 0, i)(now *= 2) %= MOD;
(ans += now) %= MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0)
typedef long long ll;
#define int ll
#define swap(x, y)((x)^=(y)^=(x)^=(y))
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> matrix;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(c) c.begin(),c.end()
#define mp make_pair
#define pb push_back
#define f first
#define tcase int _; cin>> _; for( ; _; --_)
#define s second
#define endl '\n'
const int MAX = 1e6+1;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
const double DEG = 180/PI;
const int MOD = 1e9+7;
int mod(int x, int m){ if(x >= 0) return x % m; if(-x < m) return m-(-x); return mod(x%m, m);}
int gcd (int a, int b) {while(b){a = mod(a, b); swap(a, b);} return a;}
int lcm (int a, int b) {return a / gcd(a, b) * b;}
int fexp(int base, int exp, int m){
int total = 1;
while(exp > 0){
if(exp % 2 == 1){
total = mod(((mod(total, m)) * (mod(base, m))), m);
exp--;
}
base= mod((mod(base, m) * mod(base, m)), m);
exp /= 2;
}
return mod(total, m);
}
int n;
void solve(){
cin>> n;
vector<ll> cnt(60, 0);
for(int i = 0; i<n; ++i){
ll x;
cin>> x;
for(int j = 1, k = 0; j <= x; j<<=1LL, ++k) if(j & x) cnt[k]++;
}
ll ans = 0LL;
for(int i = 0; i<60; ++i){
ll temp = mod(cnt[i] * (n - cnt[i]), MOD);
ans = mod(ans + mod(temp * mod(1LL << i, MOD), MOD), MOD);
}
cout<< ans << endl;
}
int32_t main(){
fastio;
solve();
return 0;
}
| 1 |
/*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {//209
string s;
cin>>s;
int mi = INT_MAX;
REP(i,0,(int)s.length()-3) {
mi=min(mi,abs(753-stoi(s.substr(i,3))));
}
cout<<mi;
}
int main() {
////// FILE BASED IO////
//freopen("wormhole.in", "r", stdin);
//freopen("wormhole.out", "w", stdout);
///////////////
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin>>t;
//prefill();
REP(i,1,t) {
solve(i);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
/*
*/
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll K; cin>>K;
ll k = K;
string S; cin>>S;
ll i=0;
while (S[i] && k>0){
cout<<S[i];
k--;
i++;
}
if (S.size() > K)
cout<<"..."<<endl;
else
cout<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,N) for(int i=0; i<N; i++) ;
int main() {
int N;
cin>>N;
ll answer=0;
for(int i=01; i<N+1; i++){
if(i%3==0||i%5==0){
}
else{
answer+=i;
}
}
cout<<answer<<endl;
} | #include <bits/stdc++.h>
using namespace std;
long long get_rev(long long x) {
long long nx = 0;
while (x) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
long long get_rev(long long x, int len) {
long long nx = 0;
while (len--) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
int cnt;
long long solve(long long d, long long len) {
long long tmp = len >> 1, pw = 1;
while (tmp--) pw *= 10;
long long ans = 0;
for (int i = 0; i < pw; i++) {
long long tmp = (d + i) % pw;
tmp = get_rev(tmp, len >> 1);
if (len & 1) tmp = tmp * 10;
long long n = tmp * pw + i;
if ((cnt ? get_rev(n, len) : get_rev(n)) == n + d) ans++;
}
if (len & 1) ans *= 10;
return ans;
}
int main () {
int d; cin >> d;
cnt = 0;
while (d % 10 == 0) d /= 10, cnt++;
int len = 0, D = d;
while (D) len++, D /= 10;
long long ans = solve(d, len) + solve(d, len + 1) + solve(d, len + 2) + solve(d, len + 3) + solve(d, len + 4) + solve(d, len + 5) + solve(d, len + 6);
if (cnt) cnt--, ans *= 9;
while (cnt--) ans *= 10;
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int accum[N], bulbs[N], n, k;
int main() {
cin >> n >> k;
k = min(41, k);
for (int i = 1; i <= n; ++i) cin >> bulbs[i];
while (k--) {
memset(accum, 0, sizeof accum);
for (int i = 1; i <= n; ++i) {
int l = max(1, i - bulbs[i]);
int r = min(n, i + bulbs[i]);
accum[l]++;
accum[r + 1]--;
}
for (int i = 1; i <= n; ++i) {
accum[i] += accum[i - 1];
}
memcpy(bulbs, accum, sizeof accum);
}
for (int i = 1; i <= n; ++i) {
cout << bulbs[i] << " ";
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
struct event{
int t,id,x;
};
int main(){
int n,q;
cin >> n >> q;
vector<event> events;
rep(i,n){
int s,t,x;
cin >> s >> t >> x;
events.push_back({s-x,-1,x});
events.push_back({t-x,0,x});
}
map<int,int> ans;
rep(i,q){
int d;
cin >> d;
ans[d] = -1;
events.push_back({d,1,0});
}
sort(events.begin(),events.end(),[](const event &l,const event &r){
if(l.t != r.t) return l.t < r.t;
else return l.id < r.id;
});
set<int> st;
map<int,int> cnt;
rep(i,2*n+q){
if(events[i].id == -1){
st.insert(events[i].x);
cnt[events[i].x] ++;
}else if(events[i].id == 0){
cnt[events[i].x] --;
if(cnt[events[i].x]==0) st.erase(events[i].x);
}else{
if(!st.empty()) ans[events[i].t] = *st.begin();
}
}
for(auto p:ans) cout << p.second << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N, M; cin >> N >> M;
vector<vector<UL>> E(N);
rep(i, M) {
UL a, b; cin >> a >> b; a--; b--;
E[a].push_back(b);
E[b].push_back(a);
}
vector<int> F(N);
ULL z, b, u; z = b = u = 0;
rep(s, N) {
if (F[s]) continue;
F[s] = s + 1;
if (E[s].size() == 0) {
z++; F[s] = s + 1; continue;
}
queue<UL> Q; Q.push(s);
bool bok = true;
while (Q.size()) {
UL p = Q.front(); Q.pop();
for (UL e : E[p]) {
if (F[p] == F[e]) bok = false;
if (F[e] == 0) {
F[e] = -F[p];
Q.push(e);
}
}
}
if (bok) b++; else u++;
}
ULL ans = 0;
ans += (z * N * 2 - z * z);
ans += ((b + u) * (b + u) + b * b);
cout << ans << endl;
}
Problem();
};
int main() {
unique_ptr<Problem> p(new Problem());
p->Solve();
return 0;
}
Problem::Problem() {
cout << fixed << setprecision(10);
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long s64;
s64 C2(int n)
{
return (s64)n*(n-1)/2;
}
#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=1e5+5;
int fa[N],sz[N];bool d[N],have[N];
int find(int x)
{
if(fa[x]==x)return x;
find(fa[x]);
d[x]^=d[fa[x]];
return fa[x]=fa[fa[x]];
}
int main()
{
//freopen("1.in","r",stdin);
int n,m;
cin>>n>>m;
rep(i,1,n){fa[i]=i;sz[i]=1;}
while(m--)
{
int x,y;
scanf("%d%d",&x,&y);
int fx=find(x),fy=find(y);
if(fx==fy)
{
have[fx]|=d[x]==d[y];
continue;
}
fa[fy]=fx;d[fy]=d[x]^1^d[y];
sz[fx]+=sz[fy];
have[fx]|=have[fy];
}
int cnt1=0,cnt[2]={};
rep(x,1,n)
if(fa[x]==x)
if(sz[x]==1)++cnt1;
else ++cnt[have[x]];
cout<<(s64)cnt[1]*cnt[0]*2+(s64)cnt1*(n-cnt1)*2
+(s64)cnt[1]*cnt[1]+(s64)cnt[0]*cnt[0]*2+(s64)cnt1*cnt1;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b; cin>>a>>b;
if(a>b){
cout<<a+(a-1)<<endl;
}
else if(a<b){
cout<<b+(b-1)<<endl;
}
else
cout<<a+b<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define fo(i, n) for(int i=0; i<n; i++)
#define Fo(i, k, n) for(int i=k; i<n; i++)
#define w(x) int x; cin>>x; while(x--)
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define watch3(x,y,z) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<"\n"
#define watch4(x,y,z,q) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<" and "<<(#q)<<" is "<<(q)<<"\n"
#define MOD 1000000007
#define INF 1000000007;
#define F first
#define S second
#define pb(x) push_back(x);
#define ll long long
#define all(c) (c).begin(),(c).end()
#define endl "\n"
typedef vector<int> vl;
typedef vector< vl > vvl;
typedef pair< int, int> pll;
typedef map< int, int> mll;
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void c_p_c()
{
#ifndef ONLINE_JUDGE
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void parray(int a[], int n) {
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}
int check(int n) {
int temp = n + 9;
temp = temp / 10;
return temp * 10;
}
bool comp(pair<string,pair<int,int>> a , pair<string,pair<int,int>> b) {
// return a % 10 > b % 10;
if(a.F!=b.F)
return a.F<b.F;
return a.S.F>b.S.F;
}
int main() {
int i, n, m, k, c = 0;
c_p_c();
int l;
cin>>n>>l;
int a[n];
int sm=INF;
for (int i = 0; i < n; ++i)
{
/* code */
a[i]=(i+l);
sm=min(sm,abs(a[i]));
c+=a[i];
}
// watch(c+21);
// parray(a,n);
if(c>0)
cout<<c-sm<<endl;
else
cout<<c+sm<<endl;
}
| 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <math.h> // sqrt
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <iomanip> // setprecision
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int main() {
ll x;
cin >> x;
ll ans = floor(x / 11) * 2, a = x % 11;
if (a > 6) {
ans += 2;
}
else if (a > 0) {
ans++;
}
cout << ans << endl;
}
| #include <stdio.h>
#include <math.h>
using namespace std;
typedef long long llong;
#define MAX
const llong mod = 1000000000 + 7;
int main()
{
double R;
scanf("%lf", &R);
printf("%lf", 2.0 * M_PI * R);
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main (void){
string str;
cin >> str;
str[3] = '8';
cout << str << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
double a,b,c,d,e,f,g,h=0;
cin>>a>>b>>c>>d;
e=c-a;
f=d-b;
g=e*e+f*f;
h=sqrt(g);
cout <<setprecision(12)<<h <<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define y1 A2Dalek
#define y0 Cyberman
#define yn RoseTyler
#define j1 JackHarkness
#define fs first
#define sd second
const int N=2e5;
const long long oo=1e16+5;
int du[]={-1,0,0,1};
int dv[]={0,-1,1,0};
const long long mod=1e9+7;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
long long sqr(long long x) {return x*x;}
int getbit(int state, int i) {return ((state>>i)&1);}
int n,nq,A,B,q[N+5];
long long res=oo;
struct IT
{
long long f[4*N+5];
long long lz[4*N+5];
long long a[N+5];
void build(int id, int l, int r)
{
if (l>r) return;
if (l==r) {f[id]=a[l]; return;}
int mid=(l+r)/2;
build(id*2,l,mid); build(id*2+1,mid+1,r);
f[id]=min(f[id*2],f[id*2+1]);
}
void down(int id)
{
long long val=lz[id]; lz[id]=0;
f[id*2]+=val; f[id*2+1]+=val;
lz[id*2]+=val; lz[id*2+1]+=val;
}
void update(int id, int l, int r, int u, long long val)
{
if (l>u || r<u || l>r) return;
if (l==r)
{
f[id]=min(f[id],val);
return;
}
int mid=(l+r)/2;
down(id);
update(id*2,l,mid,u,val); update(id*2+1,mid+1,r,u,val);
f[id]=min(f[id*2],f[id*2+1]);
}
long long get(int id, int l, int r, int u, int v)
{
if (l>r || l>v || r<u) return oo;
if (u<=l && r<=v) return f[id];
int mid=(l+r)/2;
down(id);
return min(get(id*2,l,mid,u,v),get(id*2+1,mid+1,r,u,v));
}
} tru,cong;
int main()
{
//freopen("Many Moves.inp","r",stdin);
//freopen("Many Moves.out","w",stdout);
ios_base::sync_with_stdio(false);
cin>>n>>nq;
cin>>A>>B;
for (int i=1;i<=n;i++)
{
tru.a[i]=abs(B-i)-i;
cong.a[i]=abs(B-i)+i;
}
tru.build(1,1,n); cong.build(1,1,n);
q[0]=A;
for (int i=1;i<=nq;i++)
{
cin>>q[i];
long long val=abs(q[i]-q[i-1]);
long long now=min(tru.get(1,1,n,1,q[i])+q[i], cong.get(1,1,n,q[i],n)-q[i]);
tru.f[1]+=val; cong.f[1]+=val;
tru.lz[1]+=val; cong.lz[1]+=val;
tru.update(1,1,n,q[i-1],now-q[i-1]);
cong.update(1,1,n,q[i-1],now+q[i-1]);
}
for (int i=1;i<=n;i++)
{
res=min(res,tru.get(1,1,n,i,i)+i);
}
cout<<res;
return 0;
}
| #include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cctype>
#include <iostream>
#include <cstring>
#include <algorithm>
#define R register
#define IN inline
#define W while
#define ls (now << 1)
#define rs ((now << 1) | 1)
#define MX 200500
#define gc getchar()
#define ll long long
template <class T>
IN void in(T &x)
{
x = 0; R char c = gc;
for (; !isdigit(c); c = gc);
for (; isdigit(c); c = gc)
x = (x << 1) + (x << 3) + c - 48;
}
template <class T> IN T max(T a, T b) {return a > b ? a : b;}
template <class T> IN T min(T a, T b) {return a < b ? a : b;}
template <class T> IN T abs(T a) {return a > 0 ? a : -a;}
int n, q;
struct Node
{
ll val[3], tag;
Node(){std::memset(val, 63, sizeof(val));}
}tree[MX << 2];
IN void pushup(R int now)
{
tree[now].val[0] = min(tree[ls].val[0], tree[rs].val[0]);
tree[now].val[1] = min(tree[ls].val[1], tree[rs].val[1]);
tree[now].val[2] = min(tree[ls].val[2], tree[rs].val[2]);
}
IN void pushdown(R int now)
{
if (tree[now].tag)
{
tree[ls].val[0] += tree[now].tag;
tree[ls].val[1] += tree[now].tag;
tree[ls].val[2] += tree[now].tag;
tree[ls].tag += tree[now].tag;
tree[rs].val[0] += tree[now].tag;
tree[rs].val[1] += tree[now].tag;
tree[rs].val[2] += tree[now].tag;
tree[rs].tag += tree[now].tag;
tree[now].tag = 0;
}
}
void modify(R int now, R int lef, R int rig, R int pos, R ll v)
{
if (lef == rig)
{
tree[now].val[0] = v;
tree[now].val[1] = v - pos;
tree[now].val[2] = v + pos;
return;
}
pushdown(now);
int mid = lef + rig >> 1;
if (pos <= mid) modify(ls, lef, mid, pos, v);
else modify(rs, mid + 1, rig, pos, v);
pushup(now);
}
IN void add(R ll v)
{
tree[1].tag += v;
tree[1].val[0] += v;
tree[1].val[1] += v;
tree[1].val[2] += v;
}
ll query(R int now, R int lef, R int rig, R int lb, R int rb, R int id)
{
if (lef >= lb && rig <= rb) return tree[now].val[id];
pushdown(now);
int mid = lef + rig >> 1; ll ret = LONG_LONG_MAX;
if (lb <= mid) ret = query(ls, lef, mid, lb, rb, id);
if (rb > mid) ret = min(ret, query(rs, mid + 1, rig, lb, rb, id));
return ret;
}
int main(void)
{
int a, b, last, cur, del;
ll res1, res2, res3;
in(n), in(q), in(a), in(b);
in(last);
modify(1, 1, n, b, abs(last - a));
modify(1, 1, n, a, abs(last - b));
W (--q)
{
in(cur); del = abs(last - cur);
res1 = query(1, 1, n, cur, cur, 0) + del;
res2 = query(1, 1, n, 1, cur, 1) + cur;
res3 = query(1, 1, n, cur + 1, n, 2) - cur;
res1 = min(res1, min(res2, res3));
add(del);
modify(1, 1, n, last, res1);
last = cur;
}
printf("%lld", tree[1].val[0]);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int w;
cin >> w;
int n=1;
if(w==1){
cout << s << endl;
return 0;
}
for(int i=0; i<s.size(); i++){
if(n%w==1) cout << s[i];
n++;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define ALL(x) (x).begin(),(x).end()
typedef pair<ll, ll> P;
int main() {
string s;
int w;
cin >> s >> w;
vector<char> ans;
REP(i, s.size()) {
if(i % w == 0) {
ans.push_back(s[i]);
}
}
REP(i, ans.size()) cout << ans[i];
cout << endl;
return 0;
} | 1 |
#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>
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for(ll 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 <int,int> P;
typedef long double ld;
constexpr int MOD = 1000000007;
// + - * / ^
int mod(int a)
{
int res = a % MOD;
if(res < 0) {
return res + MOD;
}
return res;
}
int mul_mod(int a, int b)
{
ll res = ((ll)a * (ll)b) % MOD;
return mod((int)res);
}
int pow_mod(int a, int b)
{
ll res = 1;
while (b > 0) {
if(b & 1) {
res = res * (ll)a % (ll)MOD;
}
a = mul_mod(a, a);
b >>= 1;
}
return (int)res;
}
int inv_mod(int a)
{
return pow_mod(a, MOD - 2);
}
int div_mod(int a, int b)
{
return mul_mod(a, inv_mod(b));
}
// ! C
constexpr int FAC_MAX = 100000;
ll fac[FAC_MAX], finv[FAC_MAX], inv[FAC_MAX];
void com_init()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll com_mod(int a, int b){
if (a < b) return 0;
if (a < 0 || b < 0) return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> x(n), y(m);
rep (i, n) cin >> x[i];
rep (i, m) cin >> y[i];
ll a = 0, b = 0;
rep (i, n - 1) {
ll tmp = min(i + 1, n - 1 - i);
// cout << mul_mod((n - (2 * tmp - 1) - 1) + tmp, tmp) << " ";
a = mod(a + mul_mod(mul_mod((n - (2 * tmp - 1) - 1) + tmp, tmp), x[i + 1] - x[i]));
}
rep (i, m - 1) {
ll tmp = min(i + 1, m - 1 - i);
b = mod(b + mul_mod(mul_mod((m - (2 * tmp - 1) - 1) + tmp, tmp), y[i + 1] - y[i]));
}
// cout << a << " " << b << "\n";
cout << mul_mod(a, b) << "\n";
return 0;
} | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque>
#define pi 3.141592653589793238
#include<chrono>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
set<ll> s;
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
fast;
ll T = 1, i, j;
//cin >> T;
while (T--) {
ll calcy = 0;
ll n, m;
cin >> n >> m;
vector<ll> x(n), y(m);
for(i = 0; i < n; i++){
cin >> x[i];
}
for(i = 0; i < m; i++){
cin >> y[i];
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
vector<ll> dp(n + 1);
for(i = 0; i < m; i++){
calcy -= (m - 1 - i) * y[i];
calcy += i * (y[i]);
calcy %= MOD;
}
ll calcx = 0;
for(i = 0; i < n; i++){
calcx -= (n - 1 - i) * x[i];
calcx += i * (x[i]);
calcx %= MOD;
}
cout << calcy * calcx % MOD;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr <<__LINE__<< ": " << #x << " = " << x << endl
#define debug_vec(v) cerr<<__LINE__<<": "<<#v<<" = ";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int n;
cin >> n;
ll ans = 0;
rep(i, n + 1) {
if (i % 3 != 0 && i % 5 != 0) ans += i;
}
cout << ans << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
const long long MOD = 1e9+7;
template<typename T> inline void add(T& a, T b) { a += b; if (a >= MOD) a -= MOD; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s; cin >> s;
vector<int> BI(26, -10);
int n = s.size();
rep(i, n) {
if(i - BI[s[i] - 'a'] <= 2) {
cout << BI[s[i] - 'a'] + 1 << " " << i + 1 << endl;
return 0;
}
BI[s[i] - 'a'] = i;
}
cout << "-1 -1" << endl;
return 0;
}
| 0 |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e18;
const int mod=1e9+7;
const int M=100005;
int n;
string s;
char ses[M];
char fnd(int pos,char cur,char dan)
{
if(cur=='S')
{
if(s[pos]=='o')return dan;
else
{
if(dan=='S')return 'W';
else return 'S';
}
}
else if(cur=='W')
{
if(s[pos]=='x')return dan;
else
{
if(dan=='S')return 'W';
else return 'S';
}
}
}
void chk(char x,char y)
{
ses[0]=x;
ses[1]=y;
ses[n-1]=fnd(0,x,y);
for(int i=2;i<=n;i++)
{
char yo=fnd(i-1,ses[i-1],ses[i-2]);
if(i==n-1)
{
if(yo!=ses[n-1])
{
return ;
}
}
else if(i==n)
{
if(yo!=ses[0])return ;
continue;
}
ses[i]=yo;
}
ses[n]='\0';
cout<<ses<<endl;
exit(0);
}
main()
{
fast
cin>>n;
cin>>s;
chk('S','W');
chk('S','S');
chk('W','S');
chk('W','W');
cout<<"-1"<<endl;
return 0;
}
| #include<bits/stdc++.h>
#define maxn 100005
#define endl '\n'
using namespace std;
int arr[maxn],ans[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for(int i=0;i<n;i++)
arr[i+1] = (s[i] == 'o' ? 0 : 1);
for(int i=0;i<=1;i++)
for(int j=0;j<=1;j++) {
ans[1] = i;
ans[2] = j;
for(int k=3;k<=n;k++)
ans[k] = (arr[k-1] ^ ans[k-1] ^ ans[k-2]);
if(arr[n] == (ans[n-1] ^ ans[1] ^ ans[n]) && arr[1] == (ans[n] ^ ans[2] ^ ans[1])) {
for(int i=1;i<=n;i++)
cout << (ans[i] == 0 ? 'S' : 'W');
cout << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| 1 |
#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; }
bool check(vector<P> s){
int h = 0;
for(P p : s){
int b = h + p.first;
if(b < 0) return false;
h += p.second;
}
return true;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<P> ls, rs;
int total = 0;
rep(i,n){
string s;
cin >> s;
int h = 0, b = 0;
for(char c : s){
if(c == '(') ++h;
else --h;
chmin(b, h);
}
if(h > 0) ls.emplace_back(b, h);
else rs.emplace_back(b-h, -h);
total += h;
}
sort(ls.rbegin(), ls.rend());
sort(rs.rbegin(), rs.rend());
if(check(ls) && check(rs) && total == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<iostream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cstdlib>
using namespace std;
void roll(int target[], int idx[], int size, bool rev){
if(!rev){
int tmp = target[idx[0]];
for(int i=0;i<size-1;i++){
target[idx[i]] = target[idx[i+1]];
}
target[idx[size-1]] = tmp;
}else{
int tmp = target[idx[size-1]];
for(int i=size-1;i>0;i--){
target[idx[i]] = target[idx[i-1]];
}
target[idx[0]] = tmp;
}
}
bool is_match(int x[],int y[],int size){
for(int i=1;i<size;i++){
if(x[i] != y[i]) return false;
}
return true;
}
void pri(int x[], int size){
for(int i=1;i<size;i++){
cout << x[i] << " ";
}
cout << endl;
}
int main(){
static int n = 0;
cin >> n;
int x[n][7];
for(int i=0;i<n;i++){
for(int j=1;j<7;j++)
cin >> x[i][j];
}
int roll_n[] = {5,1,2,6};
int roll_e[] = {3,1,4,6};
int roll_side[] = {3,5,4,2};
int size = sizeof(x[0])/sizeof(int);
int size_roll = sizeof(roll_n)/sizeof(int);
for(int k=0;k<n;k++){
for(int l=k+1;l<n;l++){
for(int i=0;i<4;i++){
roll(x[k], roll_n,size_roll,false);
///pri(x,size);
for(int j=0;j<4;j++){
roll(x[k], roll_side,size_roll,false);
if(is_match(x[k],x[l],size)){
cout << "No" << endl;
return 0;
}
}
}
for(int i=0;i<4;i++){
roll(x[k], roll_e,size_roll, false);
for(int j=0;j<4;j++){
roll(x[k], roll_side,size_roll, false);
if(is_match(x[k],x[l],size)){
cout << "No" << endl;
return 0;
}
}
}
}
}
cout << "Yes" << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long res = 0;
for(int i=0;i<n;i++){
int a = i+1;
if(a % 3 == 0 || a % 5 == 0) continue;
else res += a;
}
cout << res << endl;
} | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
set<char> st;
for(int i=0; i<str.size(); i++) {
st.insert(str[i]);
}
if(st.size()<26) {
cout << str;
for(int i=0; i<26; i++) {
if(st.find((char)('a'+i))==st.end()) {
cout << (char)('a'+i) << endl;
break;
}
}
} else {
set<char> vec;
vec.insert(str[25]);
int i;
for(i=25; i>=1; i--) {
if(str[i-1]<str[i]) {
break;
}
vec.insert(str[i-1]);
}
if(vec.size()==26) {
cout << -1 << endl;
} else if(vec.upper_bound(str[i-1])!=vec.end()) {
for(int j=0; j<i-1; j++) {
cout << str[j];
}
cout << (*vec.upper_bound(str[i-1])) << endl;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n;
ll a[N], p[62];
void insert(ll x) {
for(int i = 60; i >= 0; i--) {
if(x >> i & 1) {
if(!p[i]) {
p[i] = x;
break;
}
x ^= p[i];
//cout<<x<<endl;
}
}
}
int main() {
ios::sync_with_stdio(false); cin.tie(0);
cin >> n;
ll all = 0;
for(int i = 1; i <= n; i++) cin >> a[i], all ^= a[i];
for(int i = 0; i <= 60; i++) {
if(all >> i & 1) {
for(int j = 1; j <= n; j++) {
if(a[j] >> i & 1) a[j] -= (1ll << i);
}
}
}
for(int i = 1; i <= n; i++) insert(a[i]);//,cout<<a[i]<<endl;;
ll ans = 0;
for(int i = 60; i >= 0; i--) {
//cout<<i<<" "<<p[i]<<" "<<(ans&(1ll<<i)==0)<<endl;
if((p[i]!=0)&&((ans&(1ll<<i))==0))
{
ans=p[i]^ans;
//cout<<ans<<endl;
}
}
//cout<<ans<<endl;
cout << ans + (ans ^ all);
return 0;
} | //Be Name Khoda, Besmellah Rahmane Rahim, In The Name Of God;
//#include<bits/stweight++.h>
#include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include <stdio.h>
#include <string.h>
#include<iomanip>
#include<unordered_map>
#include<unordered_set>
#include <fstream>
using namespace std;
const int N = 1000 + 5;
int a[N];
int n,m;
vector<int> ans;
int main()
{
cin >> n >> m;
int cnt = 0;
for(int i = 1; i <= m; ++i)
{
cin >> a[i];
cnt += a[i] % 2;
}
if (cnt > 2)
{
cout << "Impossible" << endl;
return 0;
}
for(int i = 2; i < m; i++)
{
if (a[i] % 2)
{
if (a[1] % 2)
{
swap(a[i], a[m]);
}
else
{
swap(a[i], a[1]);
}
}
}
for (int i = 1; i <= m; i++)
{
cout << a[i] << " ";
}
cout << endl;
if (m == 1 && a[1] == 1)
{
ans.push_back(1);
}
else
{
if (m == 1)
{
ans.push_back(a[1] - 1);
ans.push_back(1);
}
else
{
if (a[1] != 1)
{
ans.push_back(a[1] - 1);
}
for (int i = 2; i < m; i++)
{
ans.push_back(a[i]);
}
ans.push_back(a[m] + 1);
}
}
cout << ans.size() << endl;
for(int i = 0; i < ans.size(); i++)
{
cout << ans[i] << " ";
}
} | 0 |
#include<cstdio>
#include<cstring>
char str[305];
int dp[305][305][305],K;
int max(int a,int b){return a>b?a:b;}
int main(){
scanf("%s%d",str,&K); int lens=strlen(str);
for(int i=0;i<lens;++i)
for(int k=0;k<=K;++k)
dp[i][i][k]=1;
for(int l=1;l<lens;++l)
for(int i=0;i+l<lens;++i){
int j=i+l;
for(int k=0;k<=K;++k){
dp[i][j][k]=max(dp[i+1][j][k],dp[i][j-1][k]);
if(k>0) dp[i][j][k]=max(dp[i+1][j-1][k-1]+2,dp[i][j][k]);
if(str[i]==str[j]) dp[i][j][k]=max(dp[i+1][j-1][k]+2,dp[i][j][k]);
}
}
printf("%d\n",dp[0][lens-1][K]);
} | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main(int argc, char const *argv[])
{
//ifstream cin("input.txt");
int n;
cin>>n;
ll sum = 0;
rep(i,1,n)
{
if(i%3 != 0 && i%5 != 0)
sum+=i;
}
cout<<sum;
} | 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
int N, Q;
string S;
cin >> N >> S >> Q;
vector<int> k(Q);
rep(i, Q) cin >> k[i];
vector<ll> Dsum(N + 1, 0), Msum(N + 1, 0), DM(N + 1, 0);
rep(i, N) {
Dsum[i + 1] = Dsum[i];
if (S[i] == 'D') Dsum[i + 1]++;
Msum[i + 1] = Msum[i];
if (S[i] == 'M') Msum[i + 1]++;
}
rep(i, Q) {
ll ans = 0, DM = 0;
rep(j, N) {
int j0 = j - k[i];
if (j0 >= 0 && S[j0] == 'D') DM -= Msum[j + 1] - Msum[j0];
if (S[j] == 'M') DM += Dsum[j] - Dsum[max(0, j0)];
if (S[j] == 'C') ans += DM;
}
cout << ans << endl;
}
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
void chmax(string &a, string b) {
if (a == "-") { a = b; }
else if (a.size() < b.size()) { a = b; }
else if (a.size() == b.size()) {
if (a < b) { a = b; }
}
}
int main(){
int match[] = {-1,2,5,5,4,5,6,3,7,6};
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) { cin >> a[i]; }
vector<string> dp(n+10, "-");
dp[0] = "";
for (int i = 0; i < n; i++) {
if (dp[i] == "-") { continue; }
for (int j = 0; j < m; j++) {
chmax(dp[i + match[a[j]]], dp[i] + (char)('0'+a[j]));
}
}
cout << dp[n] << endl;
return 0;
} | 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=2e5;
typedef int fuko[yuzu|10];
fuko a,b;
int main() {
int n,k,i,t;
read(n),read(k);
for (i=1;i<=n;++i) a[i]=read();
for (t=1;t<=min(k,50);++t) {
memset(b,0,sizeof b);
for (i=1;i<=n;++i)
b[max(1,i-a[i])]++,b[min(n,i+a[i])+1]--;
for (i=1;i<=n;++i) b[i]+=b[i-1];
memcpy(a,b,sizeof b);
}
for (i=1;i<=n;++i) printf("%d ",b[i]);
} | #include <iostream>
#define N 1000
using namespace std;
int main(){
int data[N];
int n , sum[N];
int e[N] , p , q;
while(1){
int flag = 0;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
cin >> e[i] >> p >> q;
sum[i] = p * q;
}for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
if(e[i] == e[j]){
sum[i] += sum[j];
}
}
}for(int i = 0; i < n; i++){
if(sum[i] >= 1000000){
flag = 1;
cout << e[i] << endl;
}
}if(flag == 0){
cout << "NA" << endl;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define INF 2e9
using namespace std;
using ll = long long;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
deque<int> d;
for (int i = 0; i < N; i++)
{
int pos = lower_bound(d.begin(), d.end(), A[i]) - d.begin();
if(pos == 0){
d.push_front(A[i]);
} else {
d[pos-1] = A[i];
}
}
int ans = d.size();
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <algorithm>
using namespace std;
int a[100005],b[100005],ans[100005];
int low[100005];
int main(){
int n,i,len,fin;
int x;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&b[i]);
for(i=1;i<=n;i++){
a[i]=b[n-i+1];
}
len=0; low[++len]=a[1]; ans[1]=len;
for(i=2;i<=n;i++){//遍历a[i]
if(a[i]>=low[len])
low[++len]=a[i];
else
*lower_bound(low+1,low+1+len,a[i]+1)=a[i];//第一个大于a[i]的数，替换掉
ans[i]=len;
}
/*
for(i=1,x=0;i<=n;i++){
printf("%d ",ans[i]);
}
*/
printf("%d\n",ans[n]);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string a, b, c; cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i] && b[i] != c[i] && c[i] != a[i]) {
ans += 2;
}
else if ((a[i] == b[i] && b[i] != c[i]) || (b[i] == c[i] && c[i] != a[i]) || (c[i] == a[i] && a[i] != b[i])) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
string s[3];
for(int i =0;i<3;i++)cin >> s[i];
int ans = 0;
for(int i = 0;i<n;i++)
{
int cnt = 0;
for(int j = 0;j<3;j++)
{
if(s[j%3][i]!=s[(j+1)%3][i])cnt++;
}
if(cnt==2)ans+=1;
if(cnt==3)ans +=2;
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#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 vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
ll powM(ll a,ll b,ll m )
{
a%=m;
ll ans=1;
while(b>0)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll c(ll a,ll b)
{
if(a==0)return b==0?1:0;
if(b>a)return 0;
ll val=1;
ll fac=1;
for(int i=1;i<=b;i++)fac*=i;
for(int i=a;i>=a-b+1;i--)val*=i;
return val/fac;
}
ll f(ll n)
{
ll ans=1LL;
while(ans<=n)ans<<=1;
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
cin>>n>>k;
ll ans=0;
if(n%k)ans=1;
cout<<ans<<"\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
n % k == 0 ? cout << 0 << endl : cout << 1 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
string str;
int main()
{
cin >> str;
int len = str.length();
len = len - 8;
for (int i = 0;i <= len-1;i++)
{
cout << str[i];
}
cout << endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
string s;
int main()
{
getline(cin,s);
s.erase(s.length()-8,s.length()-1);
cout<<s<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class T> void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d=stod(t);
}
void read(long double& d) {
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
read(h);
read(t...);
}
template<class A> void read(vt<A>& x) {
EACH(a, x)
read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
EACH(a, x)
read(a);
}
string to_string(char c) {
return string(1, c);
}
string to_string(bool b) {
return b?"true":"false";
}
string to_string(const char* s) {
return string(s);
}
string to_string(string s) {
return s;
}
string to_string(vt<bool> v) {
string res;
FOR(sz(v))
res+=char('0'+v[i]);
return res;
}
template<size_t S> string to_string(bitset<S> b) {
string res;
FOR(S)
res+=char('0'+b[i]);
return res;
}
template<class T> string to_string(T v) {
bool f=1;
string res;
EACH(x, v) {
if(!f)
res+=' ';
f=0;
res+=to_string(x);
}
return res;
}
template<class A> void write(A x) {
cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) {
write(h);
write(t...);
}
void print() {
write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) {
write(h);
if(sizeof...(t))
write(' ');
print(t...);
}
void DBG() {
cerr << "]" << endl;
}
template<class H, class... T> void DBG(H h, T... t) {
cerr << to_string(h);
if(sizeof...(t))
cerr << ", ";
DBG(t...);
}
#ifdef _DEBUG
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
template<class T> void offset(ll o, T& x) {
x+=o;
}
template<class T> void offset(ll o, vt<T>& x) {
EACH(a, x)
offset(o, a);
}
template<class T, size_t S> void offset(ll o, ar<T, S>& x) {
EACH(a, x)
offset(o, a);
}
mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
return uniform_int_distribution<ll>(a, b)(mt_rng);
}
const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};
ll mod=1e9+7;
const int N=1e6+5;
const ld PI=2*acos(0.0);
ll modpow(ll a, ll b){
ll res=1; a%=mod;
while(b){
if(b&1){ res=(res*a)%mod;}
a=(a*a)%mod;
b>>=1;
}
return res;
}
#define lcm(a,b) ((a)*(b))/(__gcd(a,b))
bool compare(array<int,2> a,array<int,2> b){
return a[0]<b[0];
}
void solve() {
int n,t; read(n,t);
vt<array<int,2> > td(n+1);
FOR(i,1,n+1) read(td[i][0],td[i][1]);
sort(++td.begin(),td.end(),compare);
int siz=(*--td.end())[0]+t+5;
vt<int> dp(siz,0);
vt<int> pre(siz,0);
FOR(i,1,n+1){
FOR(j,1,siz){
if(j-td[i][0]<0||j-td[i][0]>=t) { dp[j]=pre[j];}
else{ dp[j]=max(pre[j],pre[j-td[i][0]]+td[i][1]);}
}
FOR(j,1,siz){ pre[j]=dp[j]; dp[j]=0; }
//dbg(i,pre);
}
print(*max_element(all(pre)));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
| #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<typename T>
using field = vector<vector<T>>;
template<class T> inline bool chmax(T& a,T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n,t;
cin >> n >> t;
vector<P> data(n);
rep(i,0,n) {
int a,b;
cin >> a >> b;
data[i] = P(a,b);
}
sort(data.begin(), data.end());
field<int> dp(n+1,vector<int>(t+1,0));
int ans = 0;
rep(i,0,n) {
int a = data[i].first, b = data[i].second;
rep(j,0,t) {
chmax(dp[i+1][j],dp[i][j]);
if (j+a < t) {
chmax(dp[i+1][j+a],dp[i][j]+b);
}
}
chmax(ans,dp[i][t-1]+b);
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define Rint register int
using namespace std;
const int N = 15;
int n, m, lim, wsum, edge[N][N], sum[1 << N], dp[N][1 << N];
inline int cost(int S, int T){return sum[S | T] - sum[S] - sum[T];}
inline bool chkmax(int &a, int b){return (a < b) ? (a = b,1) : 0;}
int main(){
scanf("%d%d", &n, &m); lim = 1 << n;
for(Rint i = 1;i <= m;i ++){
int a, b, c;
scanf("%d%d%d", &a, &b, &c); -- a; -- b;
edge[a][b] = edge[b][a] = c; wsum += c;
}
for(Rint S = 1;S < lim;S ++)
for(Rint i = 0;i < n;i ++) if((S >> i) & 1)
for(Rint j = i + 1;j < n;j ++) if((S >> j) & 1)
sum[S] += edge[i][j];
memset(dp, 0x80, sizeof dp);
dp[0][1] = 0;
for(Rint S = 1;S < lim;S += 2)
for(Rint t = 0;t < n;t ++) if((S >> t) & 1){
for(Rint u = 0;u < n;u ++) if(!((S >> u) & 1) && edge[t][u])
chkmax(dp[u][S | (1 << u)], dp[t][S] + edge[t][u]);
int SS = (lim - 1) ^ S;
for(Rint T = SS;T;T = (T - 1) & SS)
chkmax(dp[t][S | T], dp[t][S] + sum[T | (1 << t)]);
}
printf("%d\n", wsum - dp[n - 1][lim - 1]);
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
struct Edge{
ll to;
ll weight;
Edge(ll t,ll w) : to(t),weight(w){}
};
using Graph = vector<vector<Edge>>;
int main(){
int n;
cin >> n;
Graph G(n);
for(int i=0;i<n-1;++i){
ll from,to,weight;
cin >> from >> to >> weight;
from--;
to--;
G[from].push_back(Edge(to,weight));
G[to].push_back(Edge(from,weight));
}
vector<ll> dist(n,-1);
queue<ll> que;
int q,k;
cin >> q >> k;
k--;
//cout << q << endl;
vector<ll> x(q),y(q);
for(int i=0;i<q;i++){
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
//cout << "OK" << endl;
}
dist[k]=0;
que.push(k);
while(!que.empty()){
ll v=que.front();
que.pop();
for(auto nv : G[v]){
if(dist[nv.to]==-1 || dist[nv.to]>dist[v]+nv.weight){
dist[nv.to]=dist[v]+nv.weight;
que.push(nv.to);
}
}
}
for(int i=0;i<q;++i){
ll ans=dist[x[i]]+dist[y[i]];
cout << ans << endl;
}
return 0;
}
| 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
struct Node_tag{
int key;
Node_tag *parent, *left, *right;
};
typedef struct Node_tag Node;
Node *root;
Node *nil = (Node *)malloc(sizeof(Node));
void init(){
nil->parent = nil->left = nil->right = nil;
root = nil;
}
void inParse(Node *u){
if(u == nil)
return;
inParse(u->left);
printf(" %d", u->key);
inParse(u->right);
}
void preParse(Node *u){
if(u == nil)
return;
printf(" %d", u->key);
preParse(u->left);
preParse(u->right);
}
void insert(Node *z){
Node *x = root, *y = nil;
while(x != nil){
y = x;
if(z->key < x->key)
x = x->left;
else
x = x->right;
}
z->parent = y;
if (y == nil)
root = z;
else if(z->key < y->key)
y->left = z;
else
y->right = z;
}
Node* find(Node *x, int k){
while(x != nil && k != x->key){
if(k < x->key)
x = x->left;
else
x = x->right;
}
return x;
}
Node* getMinimum(Node *x){
while(x->left != nil)
x = x->left;
return x;
}
Node* getSuccessor(Node *x){
if(x->right != nil)
return getMinimum(x->right);
Node *y = x->parent;
while(y != nil && x == y->right){
x = y;
y = y->right;
}
return y;
}
void deleteNode(Node *z){
Node *x, *y;
if(z->left == nil || z->right == nil)
y = z;
else
y = getSuccessor(z);
if(y->left != nil)
x = y->left;
else
x = y->right;
if(x != nil)
x->parent = y->parent;
if(y->parent == nil)
root = x;
else if(y == y->parent->left)
y->parent->left = x;
else
y->parent->right = x;
if(y != z)
z->key = y->key;
}
int main(void){
int m, i, key;
char S[10];
init();
scanf("%d", &m);
for(i = 0;i < m;i++){
scanf("%s", S);
if(S[0] == 'p'){
inParse(root);
printf("\n");
preParse(root);
printf("\n");
} else {
scanf("%d", &key);
if(S[0] == 'i'){
Node *z = (Node *)malloc(sizeof(Node));
z->key = key;
z->left = z->right = nil;
insert(z);
} else if(S[0] == 'f'){
if(find(root, key) != nil)
printf("yes\n");
else
printf("no\n");
} else
deleteNode(find(root, key)); //??¨????????¨?????????key????????????????????´?????¨??????????????????????????????
}
}
return 0;
} | #include <bits/stdc++.h>
typedef long long LL;
//container util
//------------------------------------------
#define PB push_back
#define MP make_pair
#define DECIM(digits) cout<<fixed<<setprecision(digits)
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
using namespace std;
int main(void)
{
for(;;){
int n;
cin >> n;
if(!n) return 0;
vector<pair<int,int> >gem;
gem.resize(n);
REP(i,n){
int x,y;
cin >> x >> y;
gem[i]=MP(x,y);
}
int m;
cin >> m;
pair<int,int> pos=MP(10,10);
REP(i,m){
string news;
int amount;
cin >> news >> amount;
while(amount--){
if(news=="N")
pos.second++;
if(news=="E")
pos.first++;
if(news=="W")
pos.first--;
if(news=="S")
pos.second--;
for(auto j=gem.begin();j!=gem.end();)
if(pos==*j) j=gem.erase(j);
else ++j;
}
}
if(gem.empty()) cout << "Yes" << endl;
else cout << "No" << endl;
}
} | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i,a,b) for(ll int i=a;i<b;i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define lower(u) transform(u.begin(), u.end(), u.begin(), ::tolower);//convert string u to lowercase;
#define upper(u) transform(u.begin(), u.end(), u.begin(), ::toupper);
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define N 100005
void solve()
{
ll n;
cin>>n;
string s;
cin>>s;
ll ans=0;
ll r=0,g=0,b=0;
for(auto u:s)
{
if(u=='R')
r++;
else if(u=='G')
g++;
else
b++;
}
ans=r*g*b;
// cout<<ans<<endl;
ll res=0;
for(int l=1;l<=(n-1)/2;l++)
{
for(int i=0;i<n-2*l;i++)
{
if(s[i]!=s[i+l]&&s[i]!=s[i+2*l]&&s[i+l]!=s[i+2*l])
{
res++;
}
}
}
cout<<ans-res<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int TESTS=1;
// cin>>TESTS;
while(TESTS--)
{
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define l(i) (n / 2 - (n - i + 1) / 2)
#define r(i) ((i + 1) / 2)
#define st(i) (i / 2 - 1)
using namespace std;
typedef long long ll;
int n, a[200005];
ll dp[200005][3], ans = -1e16; // j的范围在i/2-1到(i+1)/2，最多3个
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++)
for (int j = 0; j < 3; j++) dp[i][j] = -1e16;
dp[1][1 - st(1)] = a[1], dp[1][0 - st(1)] = 0;
for (int i = 2; i <= n; i++) {
for (int j = l(i); j - st(i) >= 0 && j <= r(i); j++) {
if (j == 0)
dp[i][j - st(i)] = 0;
else {
for (int k = i - 2; j - 1 - st(k) >= 0 && l(k) <= j - 1 &&
r(k) >= j - 1 && k >= 0;
k--)
dp[i][j - st(i)] =
max(dp[i][j - st(i)], dp[k][j - 1 - st(k)] + a[i]);
}
}
}
for (int i = n / 2; i <= n; i++)
for (int j = l(i); j <= r(i); j++)
if (j == n / 2) ans = max(ans, dp[i][j - st(i)]);
cout << ans;
return 0;
}
| 0 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int a[500005];
ll dp1[2100000];
ll dp2[2100000];
ll s[500005];
ll last[2100000];
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
ll x = 0;
for(int i = 0; i < 2100000; i++) dp2[i] = 1;
for(int i = 0; i < n; i++){
x ^= a[i];
s[i + 1] = s[i];
if(x){
dp2[x] = (dp2[x] + dp1[x] * (s[i + 1] - s[last[x]]) % MOD) % MOD;
dp1[x] = (dp1[x] + dp2[x]) % MOD;
last[x] = i + 1;
}
else{
s[i + 1]++;
}
}
ll ans = 0;
if(x == 0){
for(int i = 0; i < 2100000; i++) ans = (ans + dp1[i]) % MOD;
ll c = 0;
for(int i = 0; i < n; i++){
x ^= a[i];
if(x == 0) c++;
}
ll k = 1;
for(int i = 0; i < c - 1; i++) k = k * 2 % MOD;
ans = (ans + k) % MOD;
}
else{
ans = dp2[x];
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 1000000007;
vector<unsigned long> tapi(1048576, 1), tapu(1048576), tape(1048576);
unsigned long ans{0}, t{500000004}, a{0}, z{0}, A;cin >> A;
while(cin >> A)if(a ^= A){
(tapu[a] += (tapi[a] += tapu[a] * (z - tape[a])) %= MOD) %= MOD;
ans += tapi[a];
tape[a] = z;
}else ++z, (t *= 2) %= MOD;
cout << (a ? tapi[a] : (ans + t) % MOD) << endl;
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
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;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y){
if(y==0) return x;
else return gcd(y,x%y);
}
//最小公倍数
long long lcm(long long x, long long y){
return x / gcd(x, y) * y;
}
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n,long long k){
com[0] = 1;
for(int i=1;i<=k;i++){
com[i] = (com[i-1]*(n-i+1)%MOD)*modinv(i,MOD)%MOD;
}
}
int main(){
int N; cin >> N;
cout << N/3 << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
string S;
int N;
int main(void)
{
cin >> S;
N = S.length();
int offset = 0;
int result = 0;
while(offset < N)
{
if(S[offset] == 'O')
{
int of = offset;
int c_O = 0;
while(S[of] == 'O')
{
of++;
c_O++;
}
bool OK = true;
for(int i = offset - 1;i >= offset - c_O;i--)
{
if(i >= 0)
{
if(S[i] != 'J')
{
OK = false;
break;
}
}
else
{
OK = false;
break;
}
}
for(int i = of;i < of + c_O;i++)
{
if(i < N)
{
if(S[i] != 'I')
{
OK = false;
break;
}
}
else
{
OK = false;
break;
}
}
if(OK)
{
result = max(result,c_O);
}
offset = of;
}
else
offset++;
}
cout << result << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<P> G[1001][1001];
int dp[1001][1001];
vector<P> tp;
int dfs(int x,int y,int px=1000,int py=1000)
{
if(dp[x][y]!=0)return dp[x][y];
if(G[x][y].empty())return dp[x][y] = 1;
for(auto i:G[x][y])
{
dp[x][y] = max(dp[x][y],dfs(i.first,i.second,x,y)+1);
}
return dp[x][y];
}
int main()
{
int n;
cin >> n;
vector<vector<P>> input(n);
map<P,int> h;//入次数
for(int i = 0;i<n;i++)
{
for(int j = 0;j<n-1;j++)
{
int x=i;
int y;
cin >> y;
y--;
if(x>y)swap(x,y);
input[i].emplace_back(x,y);
}
}
for(int i = 0;i<n;i++)
{
for(int j =0;j<n-2;j++)
{
h[input[i][j+1]]++;
G[input[i][j].first][input[i][j].second].emplace_back(input[i][j+1]);
}
}
stack<P> S; //入次数がゼロの頂点
for(int i = 0;i<n;i++)
{
for(int j = i+1;j<n;j++)
{
if(h[P(i,j)]==0)
{
S.emplace(i,j);
}
}
}
while(S.size())
{
auto now = S.top();S.pop();
tp.push_back(now);
for(auto i:G[now.first][now.second])
{
h[i]--;
if(h[i]==0)S.emplace(i);
}
}
if(tp.size()!=n*(n-1)/2)
{
cout << -1 << endl;
return 0;
}
int ans = 0;
for(int i = 0;i<n;i++)
{
for(int j = i+1;j<n;j++)
{
ans = max(ans,dfs(i,j));
}
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
vector<pair<pair<int,int>,int> > v1,v2;
bool is_reach[100100];
int po_v1[100100]; // id
int po_v2[100100]; // id
priority_queue<pair<int,pair<int,int> > > pq;
int n;
int fi_dif(int a,int b)
{
return abs(a-b);
}
void add_path(int who)
{
if(po_v1[who]!=0&&!is_reach[v1[po_v1[who]-1].S])
{
pq.push({-fi_dif(v1[po_v1[who]].F.F,v1[po_v1[who]-1].F.F),{who,v1[po_v1[who]-1].S}});
}
if(po_v1[who]!=n-1&&!is_reach[v1[po_v1[who]+1].S])
{
pq.push({-fi_dif(v1[po_v1[who]].F.F,v1[po_v1[who]+1].F.F),{who,v1[po_v1[who]+1].S}});
}
if(po_v2[who]!=0&&!is_reach[v2[po_v2[who]-1].S])
{
pq.push({-fi_dif(v2[po_v2[who]].F.F,v2[po_v2[who]-1].F.F),{who,v2[po_v2[who]-1].S}});
}
if(po_v2[who]!=n-1&&!is_reach[v2[po_v2[who]+1].S])
{
pq.push({-fi_dif(v2[po_v2[who]].F.F,v2[po_v2[who]+1].F.F),{who,v2[po_v2[who]+1].S}});
}
}
main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int a,b;
scanf("%d %d",&a,&b);
v1.PB({{a,b},i});
v2.PB({{b,a},i});
}
sort(v1.begin(),v1.end());
sort(v2.begin(),v2.end());
for(int i=0;i<n;i++)
{
po_v1[v1[i].S]=i;
po_v2[v2[i].S]=i;
}
int ans=0;
is_reach[0]=true;
add_path(0);
while(!pq.empty())
{
int cost=-pq.top().F;
int a=pq.top().S.F;
int b=pq.top().S.S;
pq.pop();
if(is_reach[b])
continue;
ans+=cost;
// printf("%d %d %d\n",cost,a,b);
is_reach[b]=true;
add_path(b);
}
printf("%d\n",ans);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N;
cin >> N;
vec V(N+1);
REP(i,1,N+1) cin >> V[i];
vector<pll> od(100001, {0, 0}), ev(100001, {0, 0});
ll x = V[1];
bool f = false;
REP(i,1,N/2+1) {
++od[V[i*2-1]].first;
++ev[V[i*2]].first;
od[V[i*2-1]].second = V[i*2-1];
ev[V[i*2]].second = V[i*2];
if(x != V[i]) f = true;
}
if(f) {
DESC(od);
DESC(ev);
ll mo = od[0].first, me = ev[0].first;
if(od[0] == ev[0]) {
if(od[1].first < ev[1].first) me = ev[1].first;
else mo = od[1].first;
}
PR(N-mo-me);
}
else PR(N/2);
return 0;
}
/*
*/ | #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>;
const int INF = 1001001001;
int dp[1000005][2];
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
s += "0";
int n = s.size();
rep(i, n+1) {
rep(j, 2) dp[i][j] = INF;
}
dp[0][0] = 0;
rep(i, n) rep(j, 2) {
int x = s[i] - '0';
x += j;
if (x < 10) dp[i+1][0] = min(dp[i+1][0], dp[i][j]+x);
if (x > 0) dp[i+1][1] = min(dp[i+1][1], dp[i][j]+(10-x));
}
cout << dp[n][0] << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
typedef pair<ll, ll> P;
vector<ll> G[1000], Ginv[1000];
vector<P> ps;
int main() {
ll N, M; cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll a, b; cin >> a >> b; a--; b--;
G[a].push_back(b); Ginv[b].push_back(a);
ps.push_back(P(a,b));
}
ll shortest = INF;
vector<ll> res;
for (ll i = 0; i < M; i++) {
ll s = ps[i].second; ll t = ps[i].first;
ll d[N];
for (ll j = 0; j < N; j++) {d[j] = INF;}
d[s] = 0;
queue<ll> que; que.push(s);
while (!que.empty()) {
ll p = que.front(); que.pop();
if (p == t) break;
for (ll j = 0; j < G[p].size(); j++) {
ll to = G[p][j];
if (d[to] == INF) {que.push(to); d[to] = d[p]+1;}
}
}
if (d[t]+1 < shortest) {
ll p = t; res.push_back(p);
while (d[p] > 0) {
for (ll j = 0; j < Ginv[p].size(); j++) {
ll to = Ginv[p][j];
if (d[to]+1 == d[p]) {
p = to; res.push_back(p); break;
}
}
}
}
shortest = min(d[t]+1, shortest);
}
if (shortest == INF) {cout << -1 << endl; return 0;}
cout << shortest << endl;
ll n = res.size();
for (ll i = n-1; i >= n-shortest; i--) {
cout << res[i]+1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
//#define DEBUG(x) ;
ll N, u, v;
vector<vector<ll>> G;
vector<ll> du, dv;
int main(int argc, char **argv)
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> u >> v;
--u, --v;
G.resize(N);
du.assign(N, -1);
dv.assign(N, -1);
REP(i, N-1)
{
ll a, b; cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
queue<ll> que;
que.push(v);
dv[v] = 0;
while (que.size())
{
ll now = que.front();
que.pop();
for (auto &nv : G[now])
{
if (dv[nv] != -1) continue;
dv[nv] = dv[now] + 1;
que.push(nv);
}
}
que.push(u);
du[u] = 0;
while (que.size())
{
ll now = que.front();
que.pop();
for (auto &nv : G[now])
{
if (du[nv] != -1) continue;
du[nv] = du[now] + 1;
que.push(nv);
}
}
ll res{0};
REP(n, N)
{
if (du[n] < dv[n])
{
res = max(res, dv[n] - 1);
}
}
std::cout << res<< std::endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 10000;
for(int i=0; i<s.size()-2; i++)
{
string subs = s.substr(i, 3);
int a = atoi(subs.c_str());
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 20;
LL a[maxn], power[maxn], n, m, ans;
LL dfs1(LL k, LL n, LL pre){
if (2*k+1 == m){
LL res; a[k] = n / (power[k] + power[k-1]) - pre;
if (a[1] <= -10 || 10 <= a[1]) return 0;
if ((pre + a[k]) * (power[k] + power[k-1]) != n) return 0;
if (a[1] >= 0) res = 10 - abs(a[1]) - 1;
else res = 10 - abs(a[1]);
for (int i=2; i<=k; i++)
if (a[i] <= -10 || 10 <= a[i]) return 0;
else res *= 10 - abs(a[i]);
return res * 10;
}
LL res = 0, d = power[k-1] + power[m-1-k], t;
a[k] = ((n / power[k-1] - pre) % 10 + 10) % 10; t = a[k] + pre;
res = dfs1(k+1, n-t*d, t);
if (t){
a[k] -= 10; t -= 10;
res += dfs1(k+1, n-t*d, t);
}
return res;
}
LL dfs2(LL k, LL n, LL pre){
if (2*k == m){
LL res; a[k] = n / power[k-1] - pre;
if (a[1] <= -10 || 10 <= a[1]) return 0;
if (a[1] >= 0) res = 10 - abs(a[1]) - 1;
else res = 10 - abs(a[1]);
for (int i=2; i<=k; i++)
if (a[i] <= -10 || 10 <= a[i]) return 0;
else res *= 10 - abs(a[i]);
return res;
}
LL res = 0, d = power[k-1] + power[m-1-k], t;
a[k] = ((n / power[k-1] - pre) % 10 + 10) % 10; t = a[k] + pre;
res = dfs2(k+1, n-t*d, t);
if (t){
a[k] -= 10; t -= 10;
res += dfs2(k+1, n-t*d, t);
}
return res;
}
int main(){
scanf("%lld", &n);
if (n % 9) { puts("0"); return 0; }
n /= 9; power[0] = 1;
for (int i=1; i<=18; i++) power[i] = power[i-1] * 10;
for (int i=2; i<=18; i++){
if (i&1) { m = i; ans += dfs1(1, n, 0); }
else { m = i; ans += dfs2(1, n, 0); }
}
printf("%lld\n", ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using vector2d=vector<vector<T>>;
struct fixprec{int p;fixprec(int p):p(p){}};
ostream&operator<<(ostream&o,fixprec f){return o<<fixed<<setprecision(f.p);}
/*!* [intutil] *!*/
/*+* 整数演算いろいろ *+*/
i64 divceil(i64 a, i64 b) {
return a / b + (a > 0 && a % b ? 1 : 0);
}
i64 logceil(i64 a, i64 b) {
for(i64 i = 0, x = 1; a >= 2; x *= a, i++) if(x <= b) return i; return 0;
}
i64 gcd(i64 a, i64 b) {
for (i64 c; a;) c = a, a = b % a, b = c; return b;
}
i64 lcm(i64 a, i64 b) {
return (a / gcd(a, b) * b);
}
int main() {
int N;
cin >> N;
vector<i64> A(N);
for(i64 &a : A) cin >> a;
bool ans;
// i : ターン数 (0 mod 2 で自分のターン)
for(int i = 0; true; i++) {
i64 g = A[0];
for(i64 a : A) g = gcd(g, a);
for(i64 &a : A) a /= g;
int even_num = 0;
for(i64 a : A) even_num += (a % 2 == 0);
if(even_num % 2) { // 偶数が奇数個
ans = i % 2 == 0;
break;
} else { // 偶数が偶数個
i64 odd = 0;
for(i64 a : A) if(a % 2 == 1) odd = a;
if(N - even_num == 1 && odd > 2) { // 奇数が一つだけで、それは1でない
for(i64 &a : A) if(a % 2 == 1) a--;
continue;
} else {
ans = i % 2 == 1;
break;
}
}
}
cout << (ans ? "First" : "Second") << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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 n;
cin >> n;
vector<int> a(n+2);
rep(i,n) cin >> a[i+1];
vector<int> d(n+1), d2(n);
int v = 0;
rep(i,n+1) v += d[i] = abs(a[i]-a[i+1]);
rep(i,n) d2[i] = abs(a[i]-a[i+2]);
rep(i,n) cout << v-d[i]-d[i+1]+d2[i] << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const long long int mod=1e9+7;
int main(){
int n;
cin >> n;
int a;
long long int ans=1;
int r=0; int g=0; int b=0;
for(int i=0;i<n;i++){
cin >> a;
ans *= ((a==r)+(a==g)+(a==b));
ans %=mod;
if(a==r)r++;
else if(a==g)g++;
else b++;
}
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int n;
cin >> n;
vector<pair<int,int>> gusu(100000);
vector<pair<int,int>> kisu(100000);
rep(i,0,100000){
gusu[i].second = i;
kisu[i].second = i;
}
rep(i,0,n){
int a;
cin >> a;
if(i%2==0){
gusu[a].first++;
}else{
kisu[a].first++;
}
}
sort(gusu.begin(),gusu.end());
reverse(gusu.begin(),gusu.end());
sort(kisu.begin(),kisu.end());
reverse(kisu.begin(),kisu.end());
if(gusu[0].second==kisu[0].second){
int M = max(gusu[1].first,kisu[1].first);
cout<<n-M-gusu[0].first<<endl;
}else{
cout<<n-gusu[0].first-kisu[0].first<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
int dx = tx - sx, dy = ty - sy;
string ans = "";
for (int i = 0; i < dx; i++) ans += "R";
for (int i = 0; i < dy; i++) ans += "U";
for (int i = 0; i < dx; i++) ans += "L";
for (int i = 0; i < dy + 1; i++) ans += "D";
for (int i = 0; i < dx + 1; i++) ans += "R";
for (int i = 0; i < dy + 1; i++) ans += "U";
for (int i = 0; i < 1; i++) ans += "LU";
for (int i = 0; i < dx + 1; i++) ans += "L";
for (int i = 0; i < dy + 1; i++) ans += "D";
for (int i = 0; i < 1; i++) ans += "R";
cout << ans << endl;
} | #include<iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int a,b,c,d;
int score[1000]={0};
int count=0;
for(int i=0;i<n*(n-1)/2;i++){
cin>>a>>b>>c>>d;
if(c>d)score[a]+=3;
else if(c<d)score[b]+=3;
else if(c==d)score[a]++,score[b]++;
}
for(int i=1;i<=n;i++){
count = 1;
for(int j=1;j<=n;j++){
if(score[i]<score[j])count++;
}
cout<<count<<endl;
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
int n,m;
cin >> n;
map<string, int>blue;
map<string, int>red;
rep(i, 0, n){
string in;
cin >> in;
blue[in]++;
}
cin>>m;
rep(i, 0, m){
string in;
cin >> in;
red[in]++;
}
int ans = 0;
for(auto i: blue){
int blucnt =i.second;
if(red[i.first] != 0){
blucnt-=red[i.first];
}
ans = max(ans, blucnt);
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(){
int sales_sum[10];
int n;
int sales;
for(;;){
for(int i = 0; i < 10; i++){
sales_sum[i] = 0;
}
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
cin >> sales;
sales_sum[sales]++;
}
for(int i = 0; i < 10; i++){
if(sales_sum[i] == 0){
cout << '-' << endl;
continue;
}
for(int j = 0; j < sales_sum[i]; j++){
cout << '*';
}
cout << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int r;
int x;
cin >> n;
cin >> r;
x = 100*(10-n)+r;
if (n >= 10) {
cout << r;
} else {
cout << x;
}
return 0;
}
| // Author: Amey Bhavsar
// IDE: Geany/Ubuntu
// Platform: *
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define repD(i,a,b) for(auto i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
// to be used with algorithms that processes a container Eg: find(all(c),42)
#define all(x) (x).begin(), (x).end() //Forward traversal
#define rall(x) (x).rbegin, (x).rend() //reverse traversal
// traversal function to avoid long template definition
#define tr(c,i) for(__typeof__((c)).begin() i = (c).begin(); i != (c).end(); i++)
//find version works for all containers. This is present in std namespace.
#define cpresent(c,x) (find(all(c),x) != (c).end())
// ll fe (ll x, ll y) {
// ll ans = 1;
// while (y>0) {
// if (y&1) {
// ans = (x*ans) % MOD;
// }
// y /= 2;
// x = (x*x) % MOD;
// }
// return (ans % MOD);
// }
// ll modmul(ll a, ll b) {
// return ((a%MOD) * (b%MOD)) % MOD;
// }
// ll modadd(ll a , ll b){
// return((a%MOD)+(b%MOD)+MOD)%MOD;
// }
// ll modsub(ll a , ll b){
// return((a%MOD) - (b%MOD) + MOD)%MOD;
// }
#define MOD 1000000007
// int n;
// vector<int> a;
// void solution() {
// cin >> n;
// a.resize(n);
// for (auto& e:a) {
// cin >> e;
// }
// }
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);
int a,b;
cin >> a >> b;
if (a >= 10) {
cout << b;
} else {
cout << 100*(10-a) + b;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int l, r;
cin >> l >> r;
int mod_min = 2019;
for (int i = l; i <= min(l + 2019, r); i++) {
for (int j = i + 1; j <= min(l + 2019, r); j++) {
mod_min = min(mod_min, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << mod_min << endl;
return 0;
} | #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";
}
| 0 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int d, ans, n;
while(cin >> d){
ans = pow(d, 3);
n = 600 / d - 1;
ans *= n*(n+1)*(2*n+1) / 6;
cout << ans << endl;
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <bitset>
#include <queue>
#include <map>
#include <string>
#include <stack>
#include <utility>
#include <queue>
#include <cmath>
#define mp make_pair
#define pii pair<long long int,long long int>
#define ff first
#define pb push_back
#define ss second
#define ll long long
#define ull unsigned long long
#define vi vector<long long int>
#define vii vector<pii>
#define vvi vector <vi>
#define rep(x,a,b,c) for(int x=a;x<=b;x+=c)
#define repp(x,a,b) rep(x,a,b,1)
#define rev(x,a,b,c) for(int x=a;x>=b;x-=c)
#define revv(x,a,b) rev(x,a,b,1)
#define OO (int)2e9
#define INF (ll)1e18
using namespace std;
int n,hasil;
int main()
{
while(scanf("%d",&n)!=EOF)
{
hasil=0;
rep(x,n,600-n,n)
{
hasil+=n*x*x;
}
printf("%d\n",hasil);
}
return 0;
} | 1 |
#include <iostream>
#include <vector>
using namespace std;
double fabs (double n) {
if (n < 0) return -n;
else return n;
}
int main() {
int n;
cin >> n;
vector<double> a(n);
double sum = 0.0;
for (int i=0; i<n; i++) {
double num;
cin >> num;
a[i] = num;
sum += num;
}
double ave = sum / n;
double mind = 1000;
int ans = -1;
for (int i=0; i<n; i++) {
if (fabs(a[i]-ave) < mind) {
mind = fabs(a[i]-ave);
ans = i;
}
}
cout << ans << endl;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) num = num * 10 + (ch & 15);
if(neg) num = -num;
}
int N;
int main(){
getint(N);
return printf("%d\n", 180 * (N - 2)), 0;
}
| 0 |
#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>;
#define chmax(x,y) x = max(x,y);
const int INF = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
r = min(l+2019, r);
ll ans = INF;
for (ll i = l; i <= r; i++) {
for (ll j = i+1; j <= r; j++) {
//i = i%2019;
//j = j%2019;
ans = min(ans, (i*j)%2019);
}
}
cout << ans << endl;
return 0;
} | #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 l, r;
cin >> l >> r;
if(r - l >= 2019) cout << 0 << endl;
else{
vector<int> n;
for(int i = l; i <= r; i++){
n.push_back(i % 2019);
}
vector<int> m;
rep(i,n.size()){
for(int j = i+1; j < n.size(); j++) m.push_back((n[i]*n[j])%2019);
}
sort(m.begin(), m.end());
cout << m[0] << endl;
}
} | 1 |
#include <iostream>
using namespace std;
class dice{
public:
int d[7];
int setd();
int M(int*,int*,int*,int*);
};
int dice::setd(){
for(int i=1;i<=6;i++){
cin>>d[i];
}
return 0;
}
int dice::M(int *A,int *B,int *C,int *D){
int s,t;
s=*B;
*B=*A;
t=*C;
*C=s;
s=*D;
*D=t;
*A=s;
return 0;
}
int main(void){
dice a;
a.setd();
char c[110];
cin>>c;
for(int j=0;;j++){
if(c[j]=='E'){
a.M(&a.d[1],&a.d[3],&a.d[6],&a.d[4]);
continue;
}
if(c[j]=='W'){
a.M(&a.d[1],&a.d[4],&a.d[6],&a.d[3]);
continue;
}
if(c[j]=='N'){
a.M(&a.d[1],&a.d[5],&a.d[6],&a.d[2]);
continue;
}
if(c[j]=='S'){
a.M(&a.d[1],&a.d[2],&a.d[6],&a.d[5]);
continue;
}
break;
}
cout<<a.d[1]<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int a[11][11];
void init(int n) {
for(int i = 0; i <= n; ++i) {
a[i][n] = 0;
a[n][i] = 0;
}
}
void Comp(int n) {
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
a[i][n] += a[i][j];
a[n][j] += a[i][j];
a[n][n] += a[i][j];
}
}
}
void print(int n) {
for(int i = 0; i <= n; ++i) {
for(int j = 0; j <= n; ++j) {
printf("%5d", a[i][j]);
}
printf("\n");
}
}
int main() {
int n;
while(scanf("%d", &n)) {
if(n == 0) break;
init(n);
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
cin >> a[i][j];
}
}
Comp(n);
print(n);
}
return 0;
} | 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void read_separated_string(vector<int> &v, string str) {
istringstream istr(str);
string tmp;
while (getline(istr, tmp, ' ')) {
v.push_back(stoi(tmp));
}
}
int main() {
int N, Q;
vector<int> n;
vector<int> q;
string str;
cin >> N; cin.ignore();
getline(cin, str);
read_separated_string(n, str);
cin >> Q; cin.ignore();
getline(cin, str);
read_separated_string(q, str);
int count = 0;
for (int i : q) {
for (int j : n) {
if (i == j) {
count++;
break;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main (){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> vc1(N);
for( auto& x : vc1 ){
cin >> x;
}
int Q;
cin >> Q;
vector<int> vc2(Q);
for( auto& x : vc2 ){
cin >> x;
}
set<int> st;
for( auto&& x : vc2 ){
for( auto&& y : vc1 ){
if( x == y ){
st.insert(x);
}
}
}
cout << st.size() << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
//#define DEBUG
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
string S;
cin >> S;
map<char, vi> mp;
for(int i = 0 ; i < S.size() ; i++){
mp[S[i]].push_back(i);
}
for( auto it = mp.begin() ; it != mp.end(); it++){
char c = (*it).first;
if((*it).second.size() < 2) continue;
for(int i = 1 ; i < (*it).second.size(); i++){
if ( (*it).second[i] <= (*it).second[i-1] + 2){
//we found
cout << (*it).second[i-1] + 1 << " " << (*it).second[i] + 1 << "\n";
return;
}
}
}
cout << "-1 -1 \n";
}
int main()
{
//making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
#ifdef DEBUG
int TEST_CASES = 2;
while(TEST_CASES--){
#endif // DEBBUG
solve();
#ifdef DEBUG
}
#endif // DEBUG
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i < int(n); ++i)
#define repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((a) <= (x) && (x) < (b))
#define OUT(a, x, b) ((x) < (a) || (x) < (b))
typedef long long ll;
typedef long double ld;
const ll INF = 1e18;
const ll MOD = 1000000007;
int main()
{
string s;
cin >> s;
rep(i, s.length() - 1)
{
if (s[i] == s[i + 1])
{
cout << i + 1 << " " << i + 2 << endl;
return 0;
}
if (i < s.length() - 1 && s[i] == s[i + 2])
{
cout << i + 1 << " " << i + 3 << endl;
return 0;
}
}
cout << "-1 -1" << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>> spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; } //最小公倍数
void yes(){ cout << "Yes" << endl;}
void no(){ cout << "No" << endl;}
//-----------------------------------------
//-----------------------------------------
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start,end;
start = std::chrono::system_clock::now();
ll n ;
cin >> n ;
string ans = "" ;
vll vecp ;
vll vecm ;
map<ll,string> mapp ;
map<ll,string> mapm ;
if(n==0){
cout << 0 <<endl;
return 0 ;
}
ll m = 16 ;
for (int bitt = 0; bitt < (1 << m); bitt++) {
bitset<16> bits(bitt);
ll tmp = 0 ;
/*
if(bits.any()==false){
continue ;
}
*/
for(ll j=0;j<m;j++){
if(bits[j]==1){
tmp += pow(4,j) ;
}
}
vecp.PB(tmp) ;
stringstream ss ;
ss << bits ;
string ts = ss.str() ;
mapp[tmp] = ts ;
}
for (int bitt = 0; bitt < (1 << m); bitt++) {
bitset<16> bits(bitt);
ll tmp = 0 ;
/*
if(bits.any()==false){
continue ;
}
*/
for(ll j=0;j<m;j++){
if(bits[j]==1){
tmp -= 2*pow(4,j) ;
}
}
vecm.PB(tmp) ;
stringstream ss ;
ss << bits ;
string ts = ss.str() ;
mapm[tmp] = ts ;
}
sort(ALL(vecp)) ;
sort(ALL(vecm)) ;
ll ansi, ansj ;
REP(i,SZ(vecp)){
ll hog = n - vecp[i] ;
if(BS(ALL(vecm),hog)){
ansi = vecp[i] ;
ansj = hog ;
break ;
}
}
string ps = mapp[ansi] ;
string ms = mapm[ansj] ;
REP(i,SZ(ps)){
ans += ms[i] ;
ans += ps[i] ;
}
string nans = "" ;
REP(i,SZ(ans)){
if(nans=="" && ans[i]=='0'){
continue ;
}
else{
nans += ans[i] ;
}
}
cout << nans <<endl;
end = std::chrono::system_clock::now();
auto elapsed = std::chrono::duration_cast< std::chrono::milliseconds >(end - start).count();
//std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define All(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
//accumulate(vec.begin(), vec.end(), 0)
//std::sort(v.begin(), v.end(), std::greater<Type>());
//set_intersection(x, x+7, y, y+6, back_inserter(v));
//set_union(x, x+7, y, y+6, back_inserter(v));
//set_difference(x, x+7, y, y+6, back_inserter(v));
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
bool isPrime(int n){
if(n < 2) return false;
else if(n == 2) return true;
else if(n%2==0) return false;
for(int i=3;i<=sqrt(n);i++){
if(n%i==0) return false;
}
return true;
}
int main(){
int n;
cin >> n;
string s = "";
while(n!=0){
int r = n%2;
if(r < 0) r+=2;
n = (n-r) / (-2);
s += char('0'+ r);
}
reverse(All(s));
if(s.size()==0) s = "0";
cout<< s <<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
ll f(vector<ll> A,int N) {
A.push_back(0);
reverse(ALL(A));
auto dp = multivector(3,N+1,-LOWINF);
dp[0][0]=0;
dp[0][1]=A[1];
for(int i = 1; i <= N; ++i) {
for(int j = 0; j < 3; ++j) {
for(int k = 1; k <= 3; ++k) {
if(0<=i-1-k&&j+k-1<3) chmax(dp[j+k-1][i],dp[j][i-1-k]+A[i]);
}
}
}
ll ans;
if(N%2==0) ans=max({dp[0][N],dp[0][N-1],dp[1][N]});
else ans=max({dp[1][N],dp[1][N-1],dp[2][N]});
return ans;
}
int main() {
int N; cin >> N;
vector<ll> A(N+1,0);
for(int i = 1; i <= N; ++i) cin >> A[i];
vector<map<int,ll>> dp1(N+1); //最後にiを使ってない
vector<map<int,ll>> dp2(N+1); //最後にiを使った
dp1[0][0]=0;
for(int i = 1; i <= N; ++i) {
int M = i/2;
for(int j = -3+M; j <= M+3; ++j) {
dp1[i][j]=dp2[i][j]=-LOWINF;
if(dp1[i-1].count(j)) chmax(dp1[i][j],dp1[i-1][j]);
if(dp1[i-1].count(j-1)) chmax(dp2[i][j],dp1[i-1][j-1]+A[i]);
if(dp2[i-1].count(j)) chmax(dp1[i][j],dp2[i-1][j]);
}
}
cout << max(dp1[N][N/2],dp2[N][N/2]) << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<int> arr(n+1);
for(int i = 1; i <= n; i++) cin>>arr[i];
vector<ll> pf(n+1);
vector<ll> dp(n+1,LLONG_MIN);
for(int i = 1; i <= n; i++) if(i&1) pf[i]+=arr[i]+pf[i-2 < 0 ? 0 : i-2]; // pref of odd sum
dp[0] = 0;
dp[1] = 0;
for(int i = 2; i <= n; i++){
if(i&1) dp[i] = max(dp[i-1],arr[i]+dp[i-2]); // for odd
else dp[i] = max(pf[i-1],dp[i-2]+arr[i]); //for even
}
cout<<dp[n];
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
string s[8];
int ng[8][8];
bool flg;
void dfs(int r){
if(r==8){
flg=1;
return;
}
for(int c=0;c<8;c++){
if(s[r][c]=='Q'){
dfs(r+1);
return;
}
}
for(int c=0;c<8;c++){
if(ng[r][c]) continue;
s[r][c]='Q';
for(int j=0;j<8;j++){
if(r+j<8 ) ng[r+j][c]++;
if(r-j>=0) ng[r-j][c]++;
if(c+j<8 ) ng[r][c+j]++;
if(c-j>=0) ng[r][c-j]++;
if(r+j<8 &&c+j<8 ) ng[r+j][c+j]++;
if(r-j>=0&&c+j<8 ) ng[r-j][c+j]++;
if(r-j>=0&&c-j>=0) ng[r-j][c-j]++;
if(r+j<8 &&c-j>=0) ng[r+j][c-j]++;
}
dfs(r+1);
if(flg) return;
s[r][c]='.';
for(int j=0;j<8;j++){
if(r+j<8 ) ng[r+j][c]--;
if(r-j>=0) ng[r-j][c]--;
if(c+j<8 ) ng[r][c+j]--;
if(c-j>=0) ng[r][c-j]--;
if(r+j<8 &&c+j<8 ) ng[r+j][c+j]--;
if(r-j>=0&&c+j<8 ) ng[r-j][c+j]--;
if(r-j>=0&&c-j>=0) ng[r-j][c-j]--;
if(r+j<8 &&c-j>=0) ng[r+j][c-j]--;
}
}
}
signed main(){
for(int i=0;i<8;i++) s[i]=string(8,'.');
int n;
cin>>n;
memset(ng,0,sizeof(ng));
for(int i=0;i<n;i++){
int r,c;
cin>>r>>c;
s[r][c]='Q';
for(int j=0;j<8;j++){
if(r+j<8 ) ng[r+j][c]++;
if(r-j>=0) ng[r-j][c]++;
if(c+j<8 ) ng[r][c+j]++;
if(c-j>=0) ng[r][c-j]++;
if(r+j<8 &&c+j<8 ) ng[r+j][c+j]++;
if(r-j>=0&&c+j<8 ) ng[r-j][c+j]++;
if(r-j>=0&&c-j>=0) ng[r-j][c-j]++;
if(r+j<8 &&c-j>=0) ng[r+j][c-j]++;
}
}
flg=0;
dfs(0);
for(int i=0;i<8;i++) cout<<s[i]<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<P> ab(n), sum(n);
for(int i=0; i<n; ++i){
cin >> ab[i].first >> ab[i].second;
sum[i].first = ab[i].first + ab[i].second;
sum[i].second = i;
}
sort(sum.begin(),sum.end());
reverse(sum.begin(),sum.end());
ll ans = 0;
for(int i=0; i<n; ++i){
int x = sum[i].second;
if(i%2 == 0){
ans += ab[x].first;
}else{
ans -= ab[x].second;
}
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef vector<bool> vbool;
typedef vector<int> vint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define Size(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T, class S> inline bool chmax(T &a, S b) {
if(a < b) {a = b;return 1;} return 0;
}
template <class T, class S> inline bool chmin(T &a, S b) {
if(a > b) {a = b;return 1;} return 0;
}
template <class T>
void line(vector<T> &x){for (auto&& xi : x) cin >> xi;}
inline void IN(void){ return;}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){ cin >> first; IN(rest...); return;}
#define INT(...) int __VA_ARGS__; IN (__VA_ARGS__)
#define LINT(...) lint __VA_ARGS__; IN (__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
template <class T> void UNIQUE(vector<T> &x) {
sort(all(x)); x.erase(unique(all(x)), x.end());
}
template <class T> void print_vec(T first, T end){
for (auto i = first; i < end - 1; i++) cout << *i << " ";
cout << *(end-1) << endl;
}
template<class... T>
void debug_print(T... args){
vector<lint> tmp = initializer_list<lint>{args...};
print_vec(all(tmp));
}
template<class T>
void print(T a){ cout << a << endl;}
vector<string> Yes = {"No", "Yes"};
vector<string> YES = {"NO", "YES"};
int ord(char x){ return (int)(x - 'a');}
char chr(lint x){ return (char)(x + (lint)('a'));}
lint mod = 1e9+7;
// lint mod =
lint sum(vlint a){lint ret = 0; for(auto&& v:a) ret += v; return ret;}
lint vmini(vlint a, lint &index){
lint ret = LLONG_MAX;
rep(i, Size(a)){ if (chmin(ret, a[i])) index = i;}
return ret;
}
lint vmaxi(vlint a, lint &index){
lint ret = -LLONG_MAX;
rep(i, Size(a)){ if (chmax(ret, a[i])) index = i;}
return ret;
}
lint vmin(vlint a){
lint ret = LLONG_MAX; for (auto && v : a) chmin(ret, v); return ret;
}
lint vmax(vlint a){
lint ret = -LLONG_MAX; for (auto && v : a) chmax(ret, v); return ret;
}
vlint base_3(int k){
vlint ret; while (k > 0){ ret.pb(k % 3); k /= 3;} reverse(all(ret)); return ret;
}
map<lint, lint> trial_division(lint n){
map<lint, lint> factor;
lint tmp = (lint)(sqrt(n)) + 1;
for (lint i = 2; i < tmp; ++i){
while (n % i == 0){
n /= i;
factor[i] ++;
}
}
if(n != 1) factor[n] ++;
return factor;
}
lint dist(lint x1, lint y1, lint x2, lint y2){
return (x1-x2) * (x1-x2) + (y1-y2) * (y1 - y2);
}
int main(){
INT(h, w);
char o;
vector<vint> grid(h+2, vint(w+2, 0));
int cnt = 0;
rep1(i, h+1){
rep1(j, w+1){
cin >> o;
if (o == '.'){
grid[i][j] = 1;
cnt ++;
}
}
}
queue<pair<int, int>> q;
q.push({1, 1});
vector<vint> dist(h+2, vint(w+2, -1));
dist[1][1] = 0;
int y, x, ny, nx;
vint dx = {-1, 0, 0, 1};
vint dy = {0, -1, 1, 0};
while (!q.empty()){
y = q.front().first;
x = q.front().second; q.pop();
rep(i, 4){
ny = y + dy[i];
nx = x + dx[i];
if (dist[ny][nx] != -1 || grid[ny][nx] == 0){
continue;
}
q.push({ny, nx});
dist[ny][nx] = dist[y][x] + 1;
}
}
if (dist[h][w] == -1){
print(-1);
}
else{
print(cnt - dist[h][w]-1);
}
}
| #include <iostream>
#include <queue>
#define H 20+1
#define W 20+1
using namespace std;
signed char di[4] = { 1,0,-1,0 }; // i+, j+, i-, j-
signed char dj[4] = { 0,1, 0,-1};
typedef struct {
char s[H][W]; // ÕÊÌóÔ
char n; // Ú®ñ
char d; // ±ê©çÚ®·éûü
char i,j; // »Ýn
} P;
int main(){
short h,w, b;
P p, p2;
queue<P> q;
short gi,gj;
while( cin>>w>>h && (w||h) ){
while( q.size()>0 ) q.pop();
for( int i=1;i<=h;i++ )
for( int j=1;j<=w;j++ ){
cin >> b;
p.s[i][j] = b;
if( b==2 ){ p.i = i; p.j=j; p.s[i][j]=0; }
else if( b==3 ){ gi=i; gj=j; }
}
p.n=1;
for( int i=0;i<4;i++ ){
p.d = i;
q.push( p );
}
signed char ans = -1;
while( q.size()>0 ){
p = q.front(); q.pop();
int i=p.i, j=p.j;
bool f=true;
while( f ){
int in=i+di[p.d], jn=j+dj[p.d];
if( in<1 || in>h || jn<1 || jn>w )
break;
switch( p.s[ in ][ jn ] ){
case 0: // ½àÈ¢
i=in; j=jn;
break;
case 1: // áQ¨
if( p.i==i && p.j==j ){
f=false; break;
}
if( p.n==10 ){
f=false; break;
}else if( p.n==9 ){
if( i-gi!=0 && j-gj!=0 ){
f=false; break;
}
}
p2 = p;
p2.i=i; p2.j=j; p2.n++;
p2.s[ in ][ jn ] = 0;
for( int k=0;k<4;k++ ){
p2.d = k; q.push( p2 );
}
f=false;
break;
case 3: // S[
ans = p.n; f=false;
break;
}
}
if( ans>0 ) break;
}
cout << (int)ans << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
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; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
int main()
{
int N;
cin >> N;
vector<int> L(N);
rep(i, N) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int ans = 0;
if (L.size() == 1 || L.size() == 2) cout << 0 <<"\n";
else {
for (int i = 0; i < N-2; i++) {
for (int j = i+1; j < N-1; j++) {
for (int k = j+1; k < N; k++) {
if(((L.at(i) != L.at(j)) && (L.at(j) != L.at(k))) && (L.at(k)< L.at(i) + L.at(j))) ans++;
}
}
}
cout << ans << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;
const int MAXN = 201+5;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio
ll n;
cin >> n;
ll a[n];
for(ll i=0; i<n; i++){
cin >> a[i];
}
ll ans = 1;
ll mini = a[0];
for(ll i=1; i<n; i++){
if(mini>a[i]){
ans++;
mini=a[i];
}
}
cout << ans << "\n";
return 0;
}
//^-^ | 0 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int n, x, t;
cin >> n >> x >> t;
int count = t, orig = x;
while (x < n) {
count += t;
x += orig;
}
cout << count;
return 0;
} | /*input
1000 1 1000
*/
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <climits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <stdint.h>
#include <tgmath.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define ar array
#define scd(t) scanf("%d",&t)
#define scld(t) scanf("%ld",&t)
#define sclld(t) scanf("%lld",&t)
#define scc(t) scanf("%c",&t)
#define scs(t) scanf("%s",t)
#define scf(t) scanf("%f",&t)
#define sclf(t) scanf("%lf",&t)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define tests int r; cin >> r; while(r--)
#define MP make_pair
#define PI acos(-1)
typedef pair<long long, long long> PII;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int,int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
#define godspeed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
#define M(x) ((x)%(1000000007))
vector<int> adj_list[100010];
bool visited[10010];
void dfs(int node){
visited[node] = true;
for(int n: adj_list[node]){
if(!visited[n]){
dfs(n);
}
}
}
int main() {
int n;
int x;
int t;
cin>>n>>x>>t;
int ans = ceil(n*1.0/x)*t;
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
#define LL long long
#define LD long double
#define pb push_back
#define mp make_pair
#define ss(x) (int) x.size()
#define fi first
#define se second
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
#define all(x) x.begin(), x.end()
using namespace std;
const int N = 18;
int n;
char s[100];
LL ans;
LL dp[100][100];
LL solve(vector<int> a, vector <int> b) {
rep(i, 0, n) rep(j, 0, ss(a)) dp[i][j] = 0;
dp[0][0] = 1;
rep(i, 0, n - 1)
rep(j, 0, min(i, ss(a))) {
if (!dp[i][j]) continue;
int k = i - j;
if (j < ss(a) && s[a[j]] == s[n + n - i - 1]) dp[i + 1][j + 1] += dp[i][j];
if (k < ss(b) && s[b[k]] == s[n + n - i - 1]) dp[i + 1][j] += dp[i][j];
}
return dp[n][ss(a)];
}
int main() {
scanf ("%d", &n);
scanf ("%s", s);
rep(mask, 0, (1 << n) - 1) {
vector <int> a, b;
rep(k, 0, n - 1)
if (((mask >> k) & 1)) a.pb(k);
else b.pb(k);
ans += solve(a, b);
//if (solve(a, b)) printf ("%d\n", mask);
}
printf ("%lld\n", ans);
return 0;
}
| #include<iostream>
#include<vector>
#include<algorithm>
#define int long long
using namespace std;
const int N=42;
const int mod=2147483647;
const int mod1=1e9+9;
const int base=43;
int n,mul[N],mul1[N];
string s;
bool used[N];
vector<pair<int,int> > damn[N],damn1[N];
void check(){
int i,dem=0,val=0,val1=0,val2=0,val3=0;
for(i=1;i<=n;i++){
if(!used[i]){
// cout<<0;
dem++;
val=(val*base+(int)(s[i]-'a'))%mod;
val2=(val2*base+(int)(s[i]-'a'))%mod1;
}
}
for(i=n;i>0;i--){
if(used[i]){
// cout<<1;
val1=(val1*base+(int)(s[i]-'a'))%mod;
val3=(val3*base+(int)(s[i]-'a'))%mod1;
}
}
// cout<<endl;
// if(dem==0){
// cout<<val<<' '<<val1<<endl;
// }
damn[dem].push_back({(val*mul[n-dem]-val1+mod)%mod,(val2*mul1[n-dem]-val3+mod1)%mod1});
}
void back(int idx,int lim){
if(idx==lim+1){
check();
return;
}
used[idx]=false;
back(idx+1,lim);
used[idx]=true;
back(idx+1,lim);
}
void check1(){
int dem=0,val=0,val1=0,i,val2=0,val3=0;
for(i=n+1;i<=2*n;i++){
if(!used[i]){
// cout<<0;
val=(val*base+(int)(s[i]-'a'))%mod;
val2=(val2*base+(int)(s[i]-'a'))%mod1;
}
// else{
// cout<<1;
// }
}
for(i=2*n;i>n;i--){
if(used[i]){
dem++;
val1=(val1*base+(int)(s[i]-'a'))%mod;
val3=(val3*base+(int)(s[i]-'a'))%mod1;
}
}
// cout<<endl;
// if(dem==0){
// cout<<val<<' '<<val1<<endl;
// }
damn1[dem].push_back({(val1*mul[n-dem]-val+mod)%mod,(val3*mul1[n-dem]-val2+mod1)%mod1});
}
void back1(int idx,int lim){
if(idx==lim+1){
check1();
return;
}
used[idx]=false;
back1(idx+1,lim);
used[idx]=true;
back1(idx+1,lim);
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int i,j,k,l,ans=0;
cin>>n>>s;
mul[0]=1;
for(i=1;i<=2*n;i++){
mul[i]=(mul[i-1]*base)%mod;
mul1[i]=(mul1[i-1]*base)%mod;
}
s=" "+s;
back(1,n);
back1(n+1,2*n);
for(i=0;i<=n;i++){
sort(damn[i].begin(),damn[i].end());
sort(damn1[i].begin(),damn1[i].end());
for(j=0;j<damn[i].size();j++){
//cout<<damn[i][j]<<' ';
ans+=(int)(upper_bound(damn1[i].begin(),damn1[i].end(),damn[i][j])-lower_bound(damn1[i].begin(),damn1[i].end(),damn[i][j]));
}
// cout<<endl;
// for(j=0;j<damn1[i].size();j++){
// cout<<damn1[i][j]<<' ';
// }
// cout<<"cac "<<i<<endl;
}
cout<<ans;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
string s;
cin >> s;
stack<char> st;
for(int i = 0; i < s.size(); i++){
if (st.empty()) st.push(s[i]);
else if (st.top() == 'S' && s[i] == 'T') st.pop();
else st.push(s[i]);
}
cout << st.size() << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define FOR(i,start,stop) for(int i=(start); i < (stop); i++)
#define FORD(i,start,stop) for(int i=(start); i >= (stop); i--)
#define RIP(i,stop) FOR(i,0,stop)
#define PI 3.141592653589793
#define PRECISION(c,f) fixed << setprecision(c) << f
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int X;
cin >> X;
int ans=0;
while(true){
if(X-500 < 0) break;
X -= 500;
ans += 1000;
}
//cout << X << endl;
while(true){
if(X-5 < 0) break;
X -= 5;
ans += 5;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n+1,0);
for (int i = 1; i <= n; i++) {
int b;
cin >> b;
a[i] = b;
}
long long cumulativeSum = 0;
for (int i = 1; i <= n; i++){
cumulativeSum += abs(a[i]-a[i-1]);
}
cumulativeSum += abs(a[n]);
// i番目を抜く
for (int i = 1; i <= n; i++){
long long temp = cumulativeSum;
if (i == n){
temp += abs(a[n-1]);
temp -= abs(a[n-1] - a[n]);
temp -= abs(a[n]);
cout << temp << endl;
}
else{
temp += abs(a[i-1] - a[i+1]);
temp -= abs(a[i-1] - a[i]);
temp -= abs(a[i] - a[i+1]);
cout << temp << endl;
}
}
} | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
////////////////////////////
ll po(ll i,ll p){
if(p==0)return 1;
else{
i=mod(i);
if(p==1)return i;
if(p%2==0)return po(mod(i*i),p/2);
return mod(i*po(i,p-1));
}
}
ll bunbo(ll n){
return po(n,i_5);
}
ll p1=1009;
int main(){fastio
ll n;cin>>n;
ll a[n+1],b[2*n];
rep(i,0,n-1)cin>>a[i];
a[n]=a[0];
rep(i,0,n-1)cin>>b[i];
rep(i,n,2*n-1)b[i]=b[i%n];
ll c[n],d[2*n-1];
rep(i,0,n-1)c[i]=a[i+1]^a[i];
rep(i,0,2*n-2)d[i]=b[i+1]^b[i];
ll sc[n+1],sd[2*n];
sc[0]=0;sd[0]=0;
rep(i,0,n-1){
sc[i+1]=c[i]*po(p1,i);
Add(sc[i+1],sc[i]);
}
vector<l_l>ans;
rep(i,0,2*n-2){
sd[i+1]=d[i]*po(p1,i);
Add(sd[i+1],sd[i]);
}
// rep(i,0,n)cout<<sc[i]<<" ";cout<<endl;
// rep(i,0,2*n-1)cout<<sd[i]<<" ";cout<<endl;
rep(i,n,2*n-1){
ll sum=mod(sd[i]-sd[i-n])*bunbo(po(p1,i-n));
ll y=b[i]^a[0];
if(mod(sum-sc[n])==0){
if(i==n)ans.pb(l_l(0,y));
else ans.pb(l_l(2*n-i,y));
}
}
sort(ans.begin(),ans.end());
for(auto x:ans){
cout<<x.fi<<" "<<x.se<<endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
#define PB push_back
#define MP make_pair
const int MAX_N = 100009;
int N, A[MAX_N];
int same_hat[MAX_N]; // same_hat[i]: 同色の帽子をi人が被っているような色の種類数
int main() {
cin >> N;
REP(i, N) cin >> A[i];
REP(i, N) same_hat[i] = 0;
same_hat[0] = 3;
ll num_comb = 1;
REP(i, N) {
num_comb = num_comb * same_hat[A[i]] % MOD;
same_hat[A[i]]--;
same_hat[A[i] + 1]++;
}
PRINT(num_comb);
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main(){
int N,a;cin>>N;
vector<int> A(N+2,0);
A[0]=3;
long long c=1;
REP(i,N){
scanf("%d",&a);
c*=(A[a]-A[a+1]++);
c%=1000000007;
}
cout<<c<<endl;
} | 1 |
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 10001;
int main()
{
bool prime[MAXN];
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for (int i = 2; i * i < MAXN; i++){
for (int j = i * i; j < MAXN; j += i){
prime[j] = false;
}
}
int n;
while (scanf("%d", &n), n){
for (int i = n;; i--){
if (prime[i] && prime[i - 2]){
printf("%d %d\n", i - 2, i);
break;
}
}
}
return (0);
} | #include <iostream>
#include <vector>
#include <algorithm>
std::vector<int> twin_primes(int upper) {
std::vector<bool> suspects(upper + 1, true);
suspects[0] = suspects[1] = false;
std::vector<int> res;
for (auto i = 2; i <= upper; ++i) {
if (suspects[i]) {
if (suspects[i - 2])
res.push_back(i);
for (auto j = 2 * i; j <= upper; j += i)
suspects[j] = false;
}
}
return res;
}
int main() {
int n;
std::cin >> n;
auto primes = twin_primes(10000);
while (n != 0) {
auto prime = *(std::upper_bound(primes.begin(), primes.end(), n) - 1);
std::cout << prime - 2 << ' ' << prime << std::endl;
std::cin >> n;
}
}
| 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n,k,L[100];
cin >> n >> k;
for(int i = 0; i < n; i++)
cin >> L[i];
sort(L,L+n);
int sum = 0;
for(int i = n-1; i >= n-k; i--)
sum += L[i];
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N);
int count = 0;
for (size_t i = 0; i < N; i++)
{
cin >> A[i];
}
while (1)
{
bool exist_add = false;
for (auto &&i : A)
{
if (i % 2 == 1)
{
exist_add = true;
}
}
if (exist_add)
break;
for (auto &&i : A)
{
i /= 2;
}
count += 1;
}
cout << count << endl;
}
| 0 |
#include "bits/stdc++.h"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
int main() {fio;
int n, m;
cin >> n >> m;
vector <vector <int>> a(n, vector <int> (m));
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
cin >> a[i][j];
a[i][j]--;
}
}
int g = 1e9;
vector <bool> done(m, false);
int iter = 0;
while(iter < m) {
vector <int> cnt(m, 0);
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
if(!done[a[i][j]]) {
cnt[a[i][j]]++;
break;
}
}
}
int el = max_element(all(cnt)) - cnt.begin();
g = min(g, cnt[el]);
done[el] = true;
iter++;
}
cout << g << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int read() {
char cc = getchar(); int cn = 0, flus = 1;
while(cc < '0' || cc > '9') { if( cc == '-' ) flus = -flus; cc = getchar(); }
while(cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
return cn * flus;
}
const int N = 1000 + 5 ;
#define rep( i, s, t ) for( register int i = s; i <= t; ++ i )
int n, m, book[N], w[N][N], vis[N], can[N];
bool check( int x ) {
memset( book, 0, sizeof(book) ), memset( can, 0, sizeof(can) ) ;
int flag ; rep( i, 1, n ) vis[i] = 1, ++ book[w[i][vis[i]]] ;
rep( i, 1, m ) {
flag = 1 ;
rep( j, 1, n ) {
int u = w[j][vis[j]] ;
if( book[u] > x ) {
can[u] = 1; flag = 0 ;
while( vis[j] <= n && can[w[j][vis[j]]] ) ++ vis[j] ;
if( vis[j] > n ) return 0;
++ book[w[j][vis[j]]] ;
}
}
if( flag ) return 1;
}
return 0 ;
}
signed main()
{
n = read(), m = read() ;
rep( i, 1, n ) rep( j, 1, m ) w[i][j] = read() ;
int l = 1, r = n, ans = 0, mid ;
while( l <= r ) {
mid = ( l + r ) >> 1 ;
if( check(mid) ) ans = mid, r = mid - 1 ;
else l = mid + 1 ;
}
printf("%d\n", ans ) ;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a >= b){
a = b;
}
if(c >= d){
c = d;
}
cout<<a+c<<'\n';
return 0;
}
| #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
signed main()
{
int a,b,c,d;
a=read(), b=read(), c=read(), d=read();
printf("%lld\n",min(a,b)+min(c,d));
return 0;
} | 1 |
// Date: 2020-02-29
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define FIO ios::sync_with_stdio(false);cin.tie(0)
#define rep(i, a, b) for(int i = int(a); i <= int(b); ++i)
#define per(i, b, a) for(int i = int(b); i >= int(a); --i)
#define mem(x, y) memset(x, y, sizeof(x))
#define all(x) (x).begin(),(x).end()
#define mk make_pair
#define pb push_back
#define fi first
#define se second
const LL INF = 1e18;
const LL mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 10;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
LL qpow(LL x, LL y, LL MOD) {LL a=1; while(y){ if(y&1) a=a*x%MOD; x=x*x%MOD; y>>=1; } return a;}
int n, m, a, b;
LL fac[N], inv[N];
void add(LL& x, LL y) { x = (x + y) % mod; }
void init() {
fac[0] = inv[0] = 1;
rep(i, 1, N-1) fac[i] = fac[i-1] * i % mod, inv[i] = qpow(fac[i], mod-2, mod);
}
LL C(int x, int y) {
return fac[x] * inv[y] % mod * inv[x-y] % mod;
}
LL cal(int x1, int y1, int x2, int y2) {
//cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<" "<< C(x2-x1+y2-y1, x2-x1) <<endl;
return C(x2-x1+y2-y1, x2-x1);
}
int main() {
init();
scanf("%d%d%d%d", &n, &m, &a, &b);
LL ans = 0;
rep(i, 1, n-a) add(ans, cal(1, 1, i, b) * cal(i, b+1, n, m) % mod);
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX
#define dd double
#define fi first
#define se second
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define dll deque<long long>
#define qll queue<long long>
#define vll vector<long long>
#define vc vector<char>
#define vs vector<string>
#define vvll vector<vector<ll>>
#define vpll vector<pair<long long,long long>>
#define vpcl vector<pair<char,long long>>
#define vpsl vector<pair<string,long long>>
#define stll stack<long long>
#define stc stack<char>
#define mll map<long long,long long>
#define pll pair<long long,long long>
#define psl pair<string,long long>
#define mcl map<char,long long>
#define msl map<string,long long>
#define pcl pair<char,long long>
#define mmll multimap<long long,long long>
#define mmcl multimap<char,long long>
#define mmsl multimap<string,long long>
#define sll set<long long>
#define sc set<char>
#define ss set<string>
#define msll multiset<long long>
#define msc multiset<char>
#define mss multiset<string>
#define lb lower_bound
#define up upper_bound
#define lt length
#define clr clear
#define ap append
#define sz size
#define sub substr
#define ull unsigned long long int
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
ll modexp(ll x,ll n,ll p){ //modular exponential function
if(n==0){return 1;}
ll u = modexp(x,n/2,p);
u = u*u%p;
if(n%2==1){u=(u*x)%p;}
return u;
}
ll gcd (ll a, ll b) { //Eulers algorithm
if (b == 0)
return a;
else
return gcd (b, a % b);
}
ll arr[10001];
ll dp[10001][101][2];
ll m = 1e9+7;
ll f(ll idx,ll sum,ll flag,ll n,ll d){
if(idx == n){
if(sum==0){return 1;}
else{return 0;}
}
if(dp[idx][sum][flag]!=-1){return dp[idx][sum][flag];}
ll ans=0;
if(flag==1){
rep(i,0,arr[idx]){
if(i<arr[idx]){
ans = (ans + f(idx+1,(sum+i%d)%d,0,n,d)%m)%m;
}else{
ans = (ans + f(idx+1,(sum+i%d)%d,1,n,d)%m)%m;
}
}
}
else{
rep(i,0,9){
ans = (ans + f(idx+1,(sum+i%d)%d,0,n,d)%m)%m;
}
}
dp[idx][sum][flag] = ans;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(dp,-1,sizeof(dp));
string k; cin>>k;
ll d; cin>>d;
ll n = k.length();
rep(i,0,n-1){
arr[i] = (ll)k[i]-48;
}
cout<<(f(0,0,1,n,d)-1+m)%m ;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
using vii = vector < ii >;
using vli = vector < li >;
using vpll = vector < pll >;
using vi3 = vector < i3 >;
using vlii = vector < lii >;
const int N = 2e5 + 5;
const ll INF = 1e17 + 7 , mod = 1e9 + 7;
const double eps = 1e-9 , PI = acos(-1);
int n;
ll mul(ll a , ll b) {
return a%mod * (b%mod) % mod;
}
ll sum(ll a , ll b) {
return (a%mod + b%mod) % mod;
}
ll a[N];
ll suff[N];
void solve(int testCase){
scanf("%d" , &n);
for(int i = 0 ; i < n ; i ++) {
scanf("%lld" , &a[i]);
}
suff[n] = 0;
for(int i = n - 1 ; i >= 0 ; i --) {
suff[i] = sum(suff[i + 1] , a[i]);
}
ll ans = 0ll;
for(int i = 0 ; i < n ; i ++) {
ans = sum(ans , mul(a[i] , suff[i + 1]));
}
printf("%lld\n" , ans);
}
main(){
int t = 1;
// scanf("%d" , &t);
for(int testCase = 1 ; testCase <= t ; testCase ++){
solve(testCase);
}
return 0;
}
| /*input
4
141421356 17320508 22360679 244949
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int M=1e9+7;
int n, sq=0, s=0;
int a[200005];
signed main()
{
ios_base::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=2; i<=n; ++i){
s += a[i]*(a[i-1])%M;
s %= M;
(a[i] += a[i-1]) %= M;;
}
cout<<s;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fr first
#define sc second
#define pb push_back
const ll mod = 1e9+7;
const int N = 2e5+205;
void solve(){
int n;
cin>>n;
vector<ll>v;
for(int i=0;i<n;i++){
ll x;
cin>>x;
v.pb(x);
}
sort(v.begin(),v.end());
ll ans = 0;
for(int i=0;i+1<n;i+=2){
if(v[i]+v[i+1]>-v[i]-v[i+1]){
ans+=v[i]+v[i+1];
}
else{
ans+=(-v[i]-v[i+1]);
}
}
if(n&1)ans+=v[n-1];
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
/// 2:3 /// 2,3
/// 1:1 /// 3,3
/// aa/bb =x/y
/// bb*x/y = aa
/// bb = aa*y/x
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N; cin >> N;
vector<ll> v(N);
ll sum = 0;
int num = 0;
for(int i = 0; i < N; i++){
cin >> v[i];
if(v[i] < 0){
num++;
v[i] = abs(v[i]);
}
}
if(num % 2 == 0){
for(int i = 0; i < N; i++){
sum += v[i];
}
} else {
sort(v.begin(), v.end());
for(int i = 0; i < N; i++){
if(i==0){
sum -= v[i];
} else {
sum += v[i];
}
}
}
cout << sum << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
static const long long INFTY = (1LL << 32);
void WarshallFloyd(long long weight[][100], int verNum) {
//k????¢??????????????????????????????°????¢??????????????????????????±???????
//???????????????????¨???????
for (int k = 0; k < verNum; k++)
for (int i = 0; i < verNum; i++) {
//?????????????????£?????????????????§??´??°???????????????????????????
if (weight[i][k] == INFTY) continue;
for (int j = 0; j < verNum; j++) {
if (weight[k][j] == INFTY) continue;
weight[i][j] = min(weight[i][j], weight[i][k] + weight[k][j]);
}
}
}
int main() {
long long weight[100][100];
int verNum;
int edgeNum;
cin >> verNum >> edgeNum;
//Initialize
for (int i = 0; i < verNum; i++)
for (int j = 0; j < verNum; j++)
weight[i][j] = (i == j) ? 0 : INFTY;
for (int i = 0; i < edgeNum; i++) {
int first_ver, second_ver, wei;
cin >> first_ver >> second_ver >> wei;
weight[first_ver][second_ver] = wei;
}
WarshallFloyd(weight, verNum);
//?????¨???
bool negative = false;
for (int i = 0; i < verNum; i++)
if (weight[i][i] < 0) negative = true;
if (negative)
cout << "NEGATIVE CYCLE" << endl;
else {
for (int i = 0; i < verNum; i++) {
for (int j = 0; j < verNum; j++) {
if (j) cout << " ";
string verVal;
if (weight[i][j] == INFTY) verVal = "INF";
else verVal = to_string(weight[i][j]);
cout << verVal;
}
cout << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define dumplll(x1, x2, x3) fprintf(stderr, "#%s.%d (%s, %s, %s) = (%ld, %ld, %ld)\n", __func__, __LINE__, #x1, #x2, #x3, x1, x2, x3);
#define dumpd(x1) fprintf(stderr, "#%s.%d (%s) = (%lf)\n", __func__, __LINE__, #x1, x1);
#define dumpdd(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%lf, %lf)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define loop for(;;)
template<typename T> void scan1(T& x) { fprintf(stderr, "unknown type\n"); }
template<> void scan1(long& x) { if( scanf("%ld", &x) < 0 ) exit(0); }
void scan() {}
template<typename Head, typename... Tail>
void scan(Head& x, Tail&... xs) {
scan1(x); scan(xs...);
}
template<typename W>
struct N003 {
typedef std::vector<long> LI;
typedef std::vector<W> LW;
long n, e;
LI ss, ds;
LW ws;
std::vector<LI> iss;
N003(long n_, const LI& ss_, const LI& ds_, const LW& ws_)
: n(n_), e(ss_.size()), ss(ss_), ds(ds_), ws(ws_) {
iss.resize(n+1);
for(long i = 0; i < e; ++i) {
iss[ss[i]].push_back(i);
}
}
};
template<typename W>
struct N006 {
std::vector<std::vector<W>> xss;
bool negativeCycle;
N006(const N003<W>& g, W inf) : negativeCycle(false) {
xss.resize(g.n+1);
for(auto& xs : xss) xs.resize(g.n+1, inf);
for(long i = 0; i < g.n+1; ++i) xss[i][i] = 0;
for(long i = 0; i < g.e; ++i) {
xss[g.ss[i]][g.ds[i]] = g.ws[i];
}
for(long z = 0; z < g.n+1; ++z) {
for(long x = 0; x < g.n+1; ++x) {
for(long y = 0; y < g.n+1; ++y) {
W d = xss[x][y];
W nd = xss[x][z] + xss[z][y];
xss[x][y] = std::min(d, nd);
}
}
}
for(long x = 0; x < g.n+1; ++x) {
for(long y = 0; y < g.n+1; ++y) {
if( xss[x][y] >= inf / 2 ) {
xss[x][y] = inf;
}
}
if( xss[x][x] < 0 ) {
negativeCycle = true;
}
}
}
};
struct Solver {
Solver() { fprintf(stderr, "--------Solver begin--------\n"); }
~Solver() { fprintf(stderr, "--------Solver end--------\n"); }
void solve() {
typedef std::vector<long> LI;
long v, e;
scan(v, e);
LI ss(e+1), ds(e+1);
LI ws(e+1);
for(long i = 0; i < e; ++i) {
scan(ss[i], ds[i], ws[i]);
}
N003<long> g(v, ss, ds, ws);
N006<long> warshallfloyd(g, (1LL << 60));
if( warshallfloyd.negativeCycle ) {
puts("NEGATIVE CYCLE");
}
else {
for(long i = 0; i < v; ++i) {
for(long k = 0; k < v; ++k) {
if( warshallfloyd.xss[i][k] == (1LL << 60) ) {
printf("INF");
}
else {
printf("%ld", warshallfloyd.xss[i][k]);
}
putchar( k == v - 1 ? '\n' : ' ');
}
}
}
}
};
int main() {
loop std::unique_ptr<Solver>(new Solver())->solve();
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vd=vector<double>;
using vvd=vector<vd>;
using vs=vector<string>;
template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename Tuple>
void print_tuple(ostream&,const Tuple&){}
template<typename Car,typename... Cdr,typename Tuple>
void print_tuple(ostream& os,const Tuple& t){
print_tuple<Cdr...>(os,t);
os<<(sizeof...(Cdr)?",":"")<<get<sizeof...(Cdr)>(t);
}
template<typename... Args>
ostream& operator<<(ostream& os,const tuple<Args...>& t){
print_tuple<Args...>(os<<'(',t);
return os<<')';
}
template<typename Ch,typename Tr,typename C>
basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){
os<<'[';
for(auto i=begin(c);i!=end(c);++i)
os<<(i==begin(c)?"":" ")<<*i;
return os<<']';
}
constexpr int INF=1e9;
constexpr int MOD=1e9+7;
constexpr double EPS=1e-9;
struct FenwickTree{
vector<ll> data;
FenwickTree(int n):data(n+1){}
void Add(int i,int x){
for(i++;i<data.size();i+=i&-i)
data[i]+=x;
}
ll Sum(int i){
ll res=0;
for(;i;i-=i&-i)
res+=data[i];
return res;
}
ll Sum(int i,int j){
return Sum(j)-Sum(i);
}
};
ll InversionNumber(const vi& a)
{
FenwickTree ft(a.size());
ll res=0;
rep(i,a.size()){
res+=ft.Sum(a[i],a.size());
ft.Add(a[i],1);
}
return res;
}
bool test(vector<tuple<int,int,int>> src,vector<tuple<int,int,int>> dst)
{
int n=src.size();
rep(i,n){
int x,y,z;
tie(x,y,z)=src[i];
src[i]=x<z?mt(x,y,z):mt(z,y,x);
tie(x,y,z)=dst[i];
dst[i]=x<z?mt(x,y,z):mt(z,y,x);
}
sort(all(src)); sort(all(dst));
return src==dst;
}
tuple<bool,bool> calc(vector<tuple<int,int,int>> src,vector<tuple<int,int,int>> dst)
{
int m=src.size(),flip=0;
rep(i,m){
int x,y,z;
tie(x,y,z)=src[i];
src[i]=x<z?mt(x,y,z):(flip++,mt(z,y,x));
tie(x,y,z)=dst[i];
dst[i]=x<z?mt(x,y,z):(flip++,mt(z,y,x));
}
map<tuple<int,int,int>,int> f;
rep(i,m) f[dst[i]]=i;
vi a(m);
rep(i,m) a[i]=f[src[i]];
return mt(InversionNumber(a)&1,flip&1);
}
bool solve(int n,vvi grid)
{
array<bool,2> inv,flip;
rep(i,2){
vector<tuple<int,int,int>> src,dst;
rep(j,n) if(j%2==i){
if(j/2%2==0){
src.emplace_back(mt(3*j+1,3*j+2,3*j+3));
dst.emplace_back(mt(grid[0][j],grid[1][j],grid[2][j]));
}
else{
src.emplace_back(mt(3*j+3,3*j+2,3*j+1));
dst.emplace_back(mt(grid[2][j],grid[1][j],grid[0][j]));
}
}
if(!test(src,dst)) return false;
tie(inv[i],flip[i])=calc(src,dst);
}
return inv[0]==flip[1]&&inv[1]==flip[0];
}
int main()
{
for(int n;cin>>n&&n;){
vvi grid(3,vi(n));
rep(i,3) rep(j,n) cin>>grid[i][j];
cout<<(solve(n,grid)?"Yes":"No")<<endl;
}
}
| #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }
int main()
{
int n;
while(cin >> n && n)
{
vint v(10, 0);
rep(i, n)
{
int d;
cin >> d;
v[d]++;
}
rep(i, 10)
{
if(v[i]) rep(j, v[i]) cout << "*";
else cout << "-";
cout << endl;
}
}
} | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#define vvll vector <vll>
#define vpll vector <pll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define mll map <ll, ll>
#define fastmap gp_hash_table
#define cd complex <double>
#define vcd vector <cd>
#define PI 3.14159265358979
#define ordered_set tree <ll, null_type, less <ll>, rb_tree_tag, tree_order_statistics_node_update>
#pragma 03
using namespace std;
using namespace __gnu_pbds;
ll a[200005], b[200005], c[400005], d[200005], lps[200005];
ll n;
void clps(){
ll l = 0; lps[0] = 0; ll i = 1;
while (i < n){
if (d[i] == d[l]) l++, lps[i] = l, i++;
else if (l != 0) l = lps[l - 1];
else lps[i] = 0, i++;
}
}
vll fp;
void kmp(){
clps();
ll i = 0, j = 0;
while (i < 2 * n - 1){
if (d[j] == c[i]){
j++; i++;
}
if (j == n){
fp.pb(i - j);
j = lps[j - 1];
}
else if ((i < 2 * n - 1) && (d[j] != c[i])){
if (j != 0) j = lps[j - 1];
else i++;
}
}
}
int main(){
cin >> n;
for (ll i = 0; i < n; i++) cin >> a[i];
for (ll i = 0; i < n; i++) cin >> b[i];
for (ll i = 0; i < n; i++) c[i] = a[i] ^ a[(i + 1) % n];
for (ll i = 0; i < n; i++) d[i] = b[i] ^ b[(i + 1) % n];
for (ll i = n; i < 2 * n - 1; i++) c[i] = c[i - n];
kmp();
for (ll i = 0; i < fp.size(); i++) cout << fp[i] << " " << (b[0] ^ a[fp[i]]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n;
int a[600005],b[200005],c[600005];
int l,r=1,o;
int main(){
cin>>n;
for(int i=0;i<=n*2;++i){
if(i-n){
cin>>a[i+(i<n?n+1:-n-1)];
}
}
a[n*2+1]=a[n+1];
a[n]=a[0];
for(int i=0;i<n;++i){
b[i]=a[0]^a[n+1+i];
}
for(int i=0;i<=n*2;++i){
a[i]^=a[i+1];
}
for(int i=0;i<n;++i){
a[i+n*2+1]=a[i+n+1];
}
a[n]=1<<30;
for(int i=0;i<=n*2;++i){
if((o=c[i-l]+i>=r)){
for(l=i,r=max(r,i);a[r-l]==a[r];++r);
}
if((c[i]=o?r-l:c[i-l])==n){
cout<<i-n-1<<' '<<b[i-n-1]<<'\n';
}
}
return 0;
} | 1 |
#include<cstdio>
#include<algorithm>
typedef long long lint;
lint doz[23];
lint D;
lint dfs(int l,int r,lint d)
{
if(l>=r)
{
if(d) return 0;
return l==r?10ll:1ll;
}
if(d%10==0)
{
if(l==1) return dfs(l+1,r-1,d/10)*9;
return dfs(l+1,r-1,d/10)*10;
}
lint di=d%10-10;
lint de=d+di*(doz[r-l]-1ll);
if(l==1) return dfs(l+1,r-1,(de>0?de:-de)/10)*(di+9);
return dfs(l+1,r-1,(de>0?de:-de)/10)*(di+10);
}
int main()
{
scanf("%lld",&D);
doz[0]=1;for(int i=1;i<=18;i++) doz[i]=doz[i-1]*10ll;
lint ans=0;
for(int i=2;i<=18;i++) ans+=dfs(1,i,D);
printf("%lld\n",ans);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename F>
struct FixPoint : F{
FixPoint(F&& f):F(forward<F>(f)){}
template<typename... Args>
decltype(auto) operator()(Args&&... args) const{
return F::operator()(*this,forward<Args>(args)...);
}
};
template<typename F>
inline decltype(auto) MFP(F&& f){
return FixPoint<F>{forward<F>(f)};
}
__int128_t abs128(__int128_t val){return val<0?-val:val;}
ostream &operator<<(ostream &os,__int128_t val){
if(ostream::sentry(os)){
__uint128_t tmp=abs128(val);
char buf[64];
char *d=end(buf);
do{
--d;
*d=char(tmp%10+'0');
tmp/=10;
}while(tmp);
if(val<0) *--d='-';
int len=end(buf)-d;
if(os.rdbuf()->sputn(d,len)!=len){
os.setstate(ios_base::badbit);
}
}
return os;
}
istream &operator>>(istream &is,__int128_t &val){
string s;
is>>s;
val=0;
for(int i=0;i<(int)s.size();i++)
if(isdigit(s[i])) val=val*10+s[i]-'0';
if(s[0]=='-') val*=-1;
return is;
}
//INSERT ABOVE HERE
signed main(){
using ll = __int128_t;
ll d;
cin>>d;
const ll MAX = 37;
ll ans=0;
vector<ll> po(MAX,1);
for(int i=0;i+1<MAX;i++)
po[i+1]=po[i]*10;
vector<ll> c1(12,0),c2(12,0);
for(int i=1;i<10;i++)
for(int j=1;j<=i;j++)
c1[abs(i-j)]++;
for(int i=0;i<10;i++)
for(int j=0;j<=i;j++)
c2[abs(i-j)]++;
for(int l=2;l<=MAX;l++){
// [s, t]
ans+=
MFP([&](auto dfs,ll s,ll t,ll w)->ll{
if(s>=t){
if(w!=0) return 0;
return s==t?10:1;
}
ll dif=po[t]-po[s];
ll x=w/dif;
if(x>=10) return 0;
ll res=0;
res+=(s==0?c1:c2)[x+0]*dfs(s+1,t-1,abs128(w-(x+0)*dif));
res+=(s==0?c1:c2)[x+1]*dfs(s+1,t-1,abs128(w-(x+1)*dif));
return res;
})(0,l-1,d);
}
cout<<ans<<endl;
return 0;
}
| 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
void abc_164a();
void abc_165a();
void abc_166a();
void abc_167a();
void abc_168a();
void abc_169();
int main()
{
//abc_160a();
//abc_161a();
//abc_162a();
//abc_163a();
//abc_164a();
//abc_165a();
//abc_166a();
//abc_167a();
//abc_168a();
abc_169();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else cout << "No\n";
}
void swap(int& a, int& b)
{
int tmp;
tmp = a;
a = b;
b = tmp;
}
void abc_161a()
{
int x, y, z;
cin >> x >> y >> z;
swap(x, y);
swap(x, z);
cout << x << " " << y << " " << z << "\n";
}
void abc_162a()
{
string s;
cin >> s;
for (char c : s)
{
if (c == '7')
{
cout << "Yes\n";
return;
}
}
cout << "No\n";
}
void abc_163a()
{
int R;
cin >> R;
cout << (double)(2 * R * M_PI);
}
void abc_164a()
{
int s, w;
cin >> s >> w;
if (s <= w) cout << "unsafe\n";
else cout << "safe\n";
}
void abc_165a()
{
int k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; ++i)
{
if (i % k == 0)
{
cout << "OK\n";
return;
}
}
cout << "NG\n";
}
void abc_166a()
{
string s;
cin >> s;
if (s == "ABC") cout << "ARC\n";
if (s == "ARC") cout << "ABC\n";
}
void abc_167a()
{
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); ++i)
{
if (s[i] != t[i])
{
cout << "No\n";
return;
}
}
if ('a' <= t[t.size() - 1] && t[t.size() - 1] <= 'z') cout << "Yes\n";
else cout << "No\n";
}
void abc_168a()
{
string s;
cin >> s;
if (s[s.size() - 1] == '3') cout << "bon\n";
else if (s[s.size() - 1] == '0' ||
s[s.size() - 1] == '1' ||
s[s.size() - 1] == '6' ||
s[s.size() - 1] == '8') cout << "pon\n";
else cout << "hon\n";
}
void abc_169()
{
int a, b;
cin >> a >> b;
cout << a * b << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) cerr << #v << ":"; rep(i, v.size()) cerr << " " << v[i]; cerr << endl
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.