code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n; --i)
#define INF (int)1e9
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(),arr.end()
void boost(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int N=5e5+5;
ll tree[N];
ll read(int idx) {
ll sum = 0;
while (idx > 0) {
sum += tree[idx];
idx -= (idx & -idx);
}
return sum;
}
void update(int idx, ll val) {
while (idx <N) {
tree[idx] += val;
idx += (idx & -idx);
}
}
void solve(){
int n,q;
cin>>n>>q;
int x;
fr(i,1,n+1){
cin>>x;
update(i,x);
}
int t,l,r;
while(q--){
cin>>t>>l>>r;
if(t==0){
update(l+1,r);
}
else{
cout<<read(r)-read(l)<<endl;
}
}
return;
}
int main()
{
boost();
int tc=1;
//cin>>tc;
while(tc--)
solve();
return 0;
} | #include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
fenwick_tree<ll> fw(n);
rep(i, n) {
ll a;
cin >> a;
fw.add(i, a);
}
rep(_, q) {
int b;
cin >> b;
if (b == 1) {
int l, r;
cin >> l >> r;
cout << fw.sum(l, r) << endl;
} else {
int p;
ll x;
cin >> p >> x;
fw.add(p, x);
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, A,B;;
cin >> N >> A >> B;
if(N == 1){
cout << "Hello World";
}
else{
cout << A + B;
}
}
| #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
if(n==1){
cout << "Hello World" << "\n";
return 0;
}
else{
int a,b;
cin >> a >> b;
cout << a+b << "\n";
return 0;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
long long count;
cin >> N;
vector<int> a(N);
count = 0;
for(int i = 0;i < N;i++){
cin >> a.at(i);
if(i > 0){
if(a.at(i-1) > a.at(i)){
count += a.at(i-1) - a.at(i);
a.at(i) = a.at(i-1);
}
}
}
cout << count << endl;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll a,b; cin >> a >> b;
cout << max(a*b,max(a+b,a-b)) << endl;
} | 0 |
#include <bits/stdc++.h>
#define lid id << 1
#define rid id << 1 | 1
using namespace std;
const int MAXN = 2e5 + 5;
const int INF = 1e9;
int h, w, a[MAXN], L[MAXN], R[MAXN], ans[MAXN];
template <class T>
void read(T &x, T f = 1, char ch = getchar()) {
x = 0;
while (ch < '0' || ch > '9') f = (ch == '-' ? -1 : 1), ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
x *= f;
}
// a[i] = a[i-1] i∉[L,R]
// a[i] = a[L-1] -L + 1 + i i∈[L,R];
struct Node {
int l, r, mi, lval;
bool tag;
Node() { mi = lval = 0, tag = 0; }
// mi denotes the minimum a in [l,r]
// lval denotes the value of the left end point of [l,r]
} tr[MAXN * 4];
void update(int id) {
tr[id].mi = min(tr[lid].mi, tr[rid].mi);
tr[id].lval = tr[lid].lval;
}
void pushdown(int id) {
if (tr[id].tag) {
tr[lid].tag = 1;
tr[lid].lval = tr[lid].mi = tr[id].lval;
tr[rid].tag = 1;
tr[rid].lval = tr[rid].mi = tr[id].lval + tr[rid].l - tr[lid].l;
tr[id].tag = 0;
}
}
void build(int id, int l, int r) {
tr[id].l = l, tr[id].r = r;
if (l == r) return;
int mid = l + r >> 1;
build(lid, l, mid);
build(rid, mid + 1, r);
}
void modify(int id, int l, int r, int val) {
if (tr[id].l == l && tr[id].r == r) {
tr[id].mi = tr[id].lval = val;
tr[id].tag = 1;
return;
}
pushdown(id);
int mid = tr[id].l + tr[id].r >> 1;
if (r <= mid)
modify(lid, l, r, val);
else if (l > mid)
modify(rid, l, r, val);
else {
modify(lid, l, mid, val);
modify(rid, mid + 1, r, val + mid + 1 - l);
}
update(id);
}
int query(int id, int l, int r) {
if (r < 1) return INF;
if (tr[id].l == l && tr[id].r == r) {
return tr[id].mi;
}
pushdown(id);
int mid = tr[id].l + tr[id].r >> 1;
if (r <= mid)
return query(lid, l, r);
else if (l > mid)
return query(rid, l, r);
else
return min(query(lid, l, mid), query(rid, mid + 1, r));
}
int main() {
read(h), read(w);
for (int i = 1; i <= h; i++) read(L[i]), read(R[i]);
fill(ans + 1, ans + h + 2, -1);
build(1, 1, w);
for (int i = 2; i <= h + 1; i++) {
int tmp = query(1, L[i - 1] - 1, L[i - 1] - 1);
modify(1, L[i - 1], R[i - 1], tmp + 1);
int mi = query(1, 1, w);
if (mi >= INF) break;
ans[i] = mi + i - 1;
}
for (int i = 2; i <= h + 1; i++) printf("%d\n", ans[i]);
return 0;
} | /* 十 聖イシドールスよ、迷えるプログラマを導き給え！ 十 */
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <deque>
#define rep(i, n) for(int i = 0; i < n; i++)
//const long long INF = 1LL << 60;
const int INF = 1e9;
using ll = long long;
int main()
{
int N, Q;
std::cin >> N >> Q;
std::vector<int> ACGT(N, 0); // AGCT[i]文字目までに何個現れたか
std::string S;
std::cin >> S;
// 前処理...ACの数を数えておく
char pre = S[0];
for( int i = 1; i < N; i++ )
{
char now = S[i];
//printf( "%c:%c", pre, now );
ACGT[i] = ACGT[i-1];
if( pre == 'A' )
{
if( now == 'C')
{
//printf("now!");
ACGT[i] = ACGT[i-1] + 1;
}
}
//printf("\n");
pre = now;
}
// printf("===\n");
// rep( i, N )
// {
// printf( "%d\n", ACGT[i]);
// }
// printf("===\n");
// 問題をとく
for( int i = 0; i < Q; i++ )
{
int l, r;
std::cin >> l >> r;
l--; r--;
int ans = ACGT[r] - ACGT[l];
if( ( S[l] == 'A' ) && ( S[r] == 'C' ) )
{
//ans++;
}
std::cout << ans << std::endl;
}
return 0;
}
| 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second
/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */
string S;
int dp[310][310][310];
int solve(int a, int b, int r) {
if (a > b) return 0;
int& res = dp[a][b][r];
if (res != -1) return res;
if (a == b) return (S[a] == S[b] || r > 0) ? 1 : 0;
res = 0;
chmax(res, solve(a + 1, b, r));
chmax(res, solve(a, b - 1, r));
if (S[a] == S[b]) {
chmax(res, solve(a + 1, b - 1, r) + 2);
} else if (r > 0) {
chmax(res, solve(a + 1, b - 1, r - 1) + 2);
}
return res;
}
int main() {
#ifdef DEBUG
ifstream ifs("in.txt");
cin.rdbuf(ifs.rdbuf());
#endif
int K;
while (cin >> S >> K) {
memset(dp, -1, sizeof(dp));
cout << solve(0, S.size() - 1, K) << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define INF 99999999
int main(){
int a,b;
int month[]={0,0,31,29,31,30,31,30,31,31,30,31,30,31};
for(int i=1;i<=12;i++)month[i]=month[i]+month[i-1];
string w[]={"Thursday","Friday","Saturday","Sunday","Monday","Tuesday","Wednesday"};
while(cin>>a>>b){
if(a==0&&b==0)break;
int sum=0;
sum+=month[a];
sum+=b-1;
sum=sum%7;
cout<<w[sum]<<endl;
}
} | 0 |
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
string times;
int x=0;
int n;
vector <int> number;
getline(cin,times);
stringstream s(times);
while(s>>n)
number.push_back(n);
x=(60*(number[2]-number[0])+(number[3]-number[1]))-number[4];
cout<<x<<endl;
return 0;
}
| #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 1000000000000 //10^12
#define MOD 1000000007 //10^9+7:合同式の法
int main(){
ll h1,h2,m1,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
ll total = (h2 - h1)*60;
total += m2 - m1 - k;
cout << total << endl;
return 0;
} | 1 |
#include <stdio.h>
int main() {
int H, W, N;
scanf("%d", &H);
scanf("%d", &W);
scanf("%d", &N);
if(W>=H){
for(int i=1;i<=H;i++){
if (W*i>=N) {
printf("%d", i);
return 0;
}
}
} else {
for(int i=1;i<=W;i++){
if (H*i>=N) {
printf("%d", i);
return 0;
}
}
}
return 0;
} | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX_N = 200010;
const int MOD = 1000000007;
typedef long long Int;
Int fac[MAX_N + 1];
Int inv[MAX_N + 1], ifac[MAX_N + 1];
Int comb(int n, int r)
{
if (n < 0 || r < 0) return 0;
if (n < r) return 0;
Int ret = 1;
ret = (ret * fac[n]) % MOD;
ret = (ret * ifac[r]) % MOD;
ret = (ret * ifac[n - r]) % MOD;
return ret;
}
int main()
{
int n, m, k;
inv[1] = 1;
fac[0] = ifac[0] = 1;
fac[1] = ifac[1] = 1;
for (int i = 2; i <= MAX_N - 1; i++) {
fac[i] = (fac[i - 1] * i) % MOD;
inv[i] = (inv[MOD % i] * (MOD - MOD / i)) % MOD;
ifac[i] = ifac[i - 1] * inv[i] % MOD;
}
scanf("%d %d %d", &n, &m, &k);
Int ans = 0;
for (int i = 1; i <= m - 1; i++) {
Int coef = (Int)n * n * (m - i) * i % MOD;
ans = (ans + comb(n * m - 2, k - 2) * coef) % MOD;
}
for (int i = 1; i <= n - 1; i++) {
Int coef = (Int)m * m * (n - i) * i % MOD;
ans = (ans + comb(n * m - 2, k - 2) * coef) % MOD;
}
printf("%lld\n", ans);
return 0;
}
| 0 |
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <utility>
#include <stdlib.h>
#include <fstream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <stdlib.h>
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long
using namespace std;
bool test = true;
#define log(x) if(test) cout << "[ " << #x << " = " << x << " ]\n";
#define log2(x, y) if(test) cout << "[ " << #x << " = " << x << ", " << #y << " = " << y << " ]\n";
#define logv(x) if(test) {cout << #x << " : { "; for(auto i : x) cout << i << " "; cout << "}\n";};
#define MX (ll)(1e14)
int main() {
int n, m;
cin >> n >> m;
int a, b;
cin >> a >> b;
int ans[n+1][m+1];
for(int i=1; i<=n; i++) {
for(int j=1; j<=m; j++)
ans[i][j] = 0;
}
for(int i=1; i<=b; i++) {
for(int j=1; j<=a; j++) {
ans[i][j] = 1;
}
}
for(int i=b+1; i<=n; i++) {
for(int j=a+1; j<=m; j++) {
ans[i][j] = 1;
}
}
for(int i=1; i<=n; i++) {
for(int j=1; j<=m; j++)
cout << ans[i][j];
cout << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,a,b;
cin>>h>>w>>a>>b;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if((j<a && i<b) || (j>=a && i>=b)) cout<<0;
else cout<<1;
if(j==w-1) cout<<endl;
}
}
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <assert.h>
#include <numeric>
#include <math.h>
#include <climits>
#include <stack>
#include <iomanip>
#include <sstream>
using namespace std;
template <typename T>
inline bool sign(T A) {
return (A>0)-(A<0);
}
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SREP(i,s,n) for(int i=s; (n-i)*sign(n-s)>0; i+=sign(n-s))
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
template <typename T>
T gcd(T a, T b) {
if(a < b) gcd(b, a);
if (b == 1) return 1;
T r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
bool _less(pair<int, int> a, pair<int, int> b) {
return a.second < b.second;
}
template <template<class,class,class...> class C, typename K, typename V, typename... Args>
V map_get(const C<K,V,Args...>& m, K const& key, const V & defval)
{
typename C<K,V,Args...>::const_iterator it = m.find( key );
if (it == m.end())
return defval;
return it->second;
}
#define MOD (1'000'000'000+7)
ll dp[51][2501];
int main(void) {
int N;
string s;
cin >> N >> s;
s += s;
REP(i, 4) {
string t;
if (i & 1)
t += 'W';
else
t += 'S';
if (i & 2)
t += 'W';
else
t += 'S';
SREP(j, 1, N+1) {
if ((s[j] == 'o' && t[j] == 'S') || (s[j] == 'x' && t[j] == 'W'))
t += t[j - 1];
else
t += (t[j - 1] == 'S')?'W':'S';
}
if (t[0] == t[N] && t[1] == t[N+1]) {
cout << t.substr(0, N) << endl;
return 0;
}
}
cout << -1 << endl;
}
| #include <bits/stdc++.h>
#define For( i, j, k ) for( int i = j; i <= k; ++i )
using std::vector;
using std::pair;
using std::cin;
using std::cout;
typedef long long LONG;
typedef int INT;
const INT N = 100100;
char c[ N ];
INT n, ans[ N ];
void Print( )
{
For( i, 1, n )
cout << ( ans[ i ] ? 'W' : 'S' );
return;
}
void INIT( )
{
For( i, 3, n )
ans[ i ] = ans[ i - 2 ] ^ ans[ i - 1 ] ^ ( c[ i - 1 ] != 'o' );
return;
}
bool check( )
{
bool flag = 0;
For( i, 1, n )
{
int l = ( i - 1 == 0 ) ? n : i - 1, r = ( i + 1 > n ? 1 : i + 1 );
flag |= ( ans[ l ] ^ ans[ r ] != ( c[ i ] != 'o' ^ ans[ i ] ) );
}
return !flag;
}
int main( )
{
std::ios::sync_with_stdio( false );
cin >> n;
cin >> c + 1;
For( i, 0, 1 ) For( j, 0, 1 )
{
ans[ 1 ] = i, ans[ 2 ] = j;
INIT( );
if( check( ) )
{
Print( );
return 0;
}
}
cout << "-1";
return 0;
}
| 1 |
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
queue<pair<int, int>> q;
int H, W;
int grid[1005][1005], shortestPath[1005][1005];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
bool inside(int row, int col){
if (row < 0 || row >= H || col < 0 || col >= W) return false;
return true;
}
int bfs(){
int ans = 0;
while(!q.empty()){
pair<int, int> now = q.front();
q.pop();
int row = now.first;
int col = now.second;
ans = max(ans, shortestPath[row][col]);
for(int i=0; i<4; i++){
int nextRow = row + dx[i];
int nextCol = col + dy[i];
if(inside(nextRow, nextCol) && grid[nextRow][nextCol] != 1 && shortestPath[nextRow][nextCol] == -1){
shortestPath[nextRow][nextCol] = 1 + shortestPath[row][col];
q.push(make_pair(nextRow, nextCol));
}
}
}
return ans;
}
int main(){
memset(shortestPath, -1, sizeof(shortestPath));
cin >> H >> W;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
char c;
cin >> c;
if(c == '#'){
grid[i][j] = 1;
q.push(make_pair(i, j));
shortestPath[i][j] = 0;
}
}
}
cout << bfs() << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) {
string tmp;
cin >> tmp;
for(int j = 0; j < w; j++) {
int idx=i*w+j;
if(tmp[j]=='#'){
a[idx]=true;
que.push(idx);
}
}
}
int cnt=0;
int ans=0;
while(cnt<h*w) {
int n=que.size();
cnt+=n;
for(int i = 0; i < n; i++) {
int idx=que.front();
int add[4]={1,-1,w,-w};
for(int j = 0; j < 4; j++) {
int t=idx+add[j];
int r=idx/w+add[j]/w;
int c=idx%w+add[j]%w;
if(r<0||r>=h||c<0||c>=w||a[t]==true) continue;
a[t]=true;
que.push(t);
}
que.pop();
}
ans++;
}
cout << ans-1 << "\n";
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <stdlib.h>
#include <stdio.h>
#include <sstream>
using namespace std;
#define p 1000000
int main(void){
//FILE* fp_in = freopen("data.txt", "r", stdin);
while(1){
long long int n,tmp[3],cnt = 0;
vector<long long int> number;
vector<long long int> sales;
vector<long long int> flg;
cin >> n;
if(n == 0) break;
for(int i=0; i<4000; i++) {
sales.push_back(0);
flg.push_back(0);
}
for(int i=0; i<n; i++) {
cin >> tmp[0] >> tmp[1] >> tmp[2];
sales.at(tmp[0]) += tmp[1]*tmp[2];
if(flg.at(tmp[0]) == 1) continue;
number.push_back(tmp[0]);
flg.at(tmp[0]) = 1;
}
for(int i=0; i<number.size(); i++) {
if(sales.at(number.at(i)) >= p) {
cout << number.at(i) << endl;
cnt++;
}
}
if(cnt == 0) {
cout << "NA" << endl;
}
}
//while(1){}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
typedef struct{
string id;
long long sales;
} staff;
int main(void)
{
long long n;
while(cin>>n){
if(!n) break;
staff staff1[4001];
int pt = 0;
for(int i=0; i< n; i++){
string id;
cin >> id;
long long price;
int bnum;
cin >> price >> bnum;
int m=-1;
for(int j=0;j < i; j++){
if(id==staff1[j].id){
pt++;
m=j;
break;
}
}
if(m==-1){
staff1[i-pt].id = id;
staff1[i-pt].sales = price * bnum;
}else{
staff1[m].sales += price * bnum;
}
}
int count = 0;
for(int i=0; i < n-pt; i++){
if(staff1[i].sales >= 1000000){
count++;
cout << staff1[i].id << endl;
}
}
if(!count) cout << "NA" << endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#define N 105
using namespace std;
char s[N][N];
int n,m;
int Ex,Ey,ans;
int cnt[N][N];
void mmax(int &x,int v){
x=max(x,v);ans=max(ans,v);
}
int get(int x1,int y1,int x2,int y2){
return cnt[x2][y2]-cnt[x2][y1-1]-cnt[x1-1][y2]+cnt[x1-1][y1-1];
}
int dp[2][N][N][N];
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++) scanf("%s",s[i]+1);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++){
cnt[i][j]=cnt[i-1][j]+cnt[i][j-1]-cnt[i-1][j-1]+(s[i][j]=='o');
if(s[i][j]=='E') Ex=i,Ey=j;
}
int now=0;
for (int i=0;i<=Ex-1;i++){
memset(dp[now^1],0,sizeof(dp[0]));
for (int j=0;j<=n-Ex;j++)
for (int k=0;k<=Ey-1;k++)
for (int L=0;L<=m-Ey;L++){
int v=dp[now][j][k][L];
int xl=max(Ex-i,j+1),yl=max(Ey-k,L+1),xr=min(Ex+j,n-i),yr=min(Ey+L,m-k);
if (Ex-i-1>j) mmax(dp[now^1][j][k][L],v+get(Ex-i-1,yl,Ex-i-1,yr));
if (Ex+j<n-i) mmax(dp[now][j+1][k][L],v+get(Ex+j+1,yl,Ex+j+1,yr));
if (Ey-k-1>L) mmax(dp[now][j][k+1][L],v+get(xl,Ey-k-1,xr,Ey-k-1));
if (Ey+L<m-k) mmax(dp[now][j][k][L+1],v+get(xl,Ey+L+1,xr,Ey+L+1));
}
now^=1;
}
printf("%d\n",ans);
return 0;
} | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(s) ((int) ((s).size()))
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#ifdef _WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long long ll;
typedef long double ld;
const int inf = (int) 1e9 + 100;
const ld eps = 1e-11;
const ld pi = acos(-1.0L);
mt19937 mrand(random_device{} ());
int rnd(int x) {
return mrand() % x;
}
void precalc() {
}
const int maxn = 105;
int n, m;
int dp[maxn][maxn], row[maxn][maxn][maxn], col[maxn][maxn][maxn];
char a[maxn][maxn];
bool read() {
if (scanf("%d%d", &n, &m) < 2) {
return false;
}
for (int i = 0; i < n; i++) {
scanf("%s", a[i]);
}
return true;
}
void solve() {
int sx, sy;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (a[i][j] == 'E') {
sx = i;
sy = j;
}
}
}
if (sx < n - sx - 1) {
for (int i = 0; 2 * i < n; i++) {
for (int j = 0; j < m; j++) {
swap(a[i][j], a[n - i - 1][j]);
}
}
sx = n - sx - 1;
}
if (sy < m - sy - 1) {
for (int i = 0; i < n; i++) {
for (int j = 0; 2 * j < m; j++) {
swap(a[i][j], a[i][m - j - 1]);
}
}
sy = m - sy - 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
row[i][j][j] = (a[i][j] == 'o');
for (int k = j + 1; k < m; k++) {
row[i][j][k] = row[i][j][k - 1] + (a[i][k] == 'o');
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
col[i][j][j] = (a[j][i] == 'o');
for (int k = j + 1; k < n; k++) {
col[i][j][k] = col[i][j][k - 1] + (a[k][i] == 'o');
}
}
}
int ans = 0;
for (int x = 0; x + sx < n; x++) {
for (int y = 0; y + sy < m; y++) {
dp[sx][sy] = (a[x + sx][y + sy] == 'o');
for (int i = sy - 1; i >= 0; i--) {
dp[sx][i] = dp[sx][i + 1] + (a[x + sx][y + i] == 'o');
}
for (int i = sx - 1; i >= 0; i--) {
dp[i][sy] = dp[i + 1][sy] + (a[x + i][y + sy] == 'o');
for (int j = sy - 1; j >= 0; j--) {
dp[i][j] = max(dp[i][j + 1] + col[y + j][x + i][min(x + sx, x + i + n - sx - 1)],
dp[i + 1][j] + row[x + i][y + j][min(y + sy, y + j + m - sy - 1)]);
}
}
ans = max(ans, dp[0][0]);
}
}
printf("%d\n", ans);
}
int main() {
precalc();
#ifdef DEBUG
assert(freopen("text.in", "r", stdin));
assert(freopen("text.out", "w", stdout));
#endif
while (true) {
if (!read()) {
break;
}
solve();
#ifdef DEBUG
eprintf("Time: %.18f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int N,M,Q,m;
const int maxn=600000+5;
int siz;
int C[maxn],a[maxn],ret[maxn];
struct node{
int l,r,id;
bool operator<(const node& other)const{
return other.r > r;
}
}x[maxn],y[maxn];
void add(int x,int v){
for(int i=x;i<=m;i+=i&-i) C[i]+=v;
}
int sum(int x){
int ret=0;
for(int i=x;i;i-=i&-i) ret+=C[i];
return ret;
}
int main(){
cin>>N>>M>>Q;
for(int i=0;i<M;i++){
cin>>x[i].l>>x[i].r;
a[siz++]=x[i].l;
a[siz++]=x[i].r;
}
for(int i=0;i<Q;i++){
cin>>y[i].l>>y[i].r;
y[i].id=i;
a[siz++]=y[i].l;
a[siz++]=y[i].r;
}
sort(a,a+siz);
m=unique(a,a+siz)-a;
for(int i=0;i<M;i++){
x[i].l=lower_bound(a,a+m,x[i].l)-a+1;
x[i].r=lower_bound(a,a+m,x[i].r)-a+1;
}
for(int i=0;i<Q;i++){
y[i].l=lower_bound(a,a+m,y[i].l)-a+1;
y[i].r=lower_bound(a,a+m,y[i].r)-a+1;
}
sort(x,x+M);
sort(y,y+Q);
int j=0;
for(int i=0;i<Q;i++){
while(j<M&&x[j].r<=y[i].r) add(x[j++].l,1);
ret[y[i].id]=j-sum(y[i].l-1);
}
for(int i=0;i<Q;i++) cout<<ret[i]<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,q;
cin >> n >> m >> q;
int a[505][505];
int c[505][505];
for(int i=0; i<=n; i++){
for(int j=0; j<=n; j++){
a[i][j]=0;
c[i][j]=0;
}
}
for(int i=0; i<m; i++){
int x,y;
cin >> x >> y;
a[x][y] += 1;
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
c[i][j]=c[i-1][j]+c[i][j-1]-c[i-1][j-1]+a[i][j];
}
}
for(int i=0; i<q; i++){
int x,y;
cin >> x >> y;
//cout << c[y][y] << " " <<c[x-1][x-1]<<" " <<c[y][x-1]<< " " <<c[x-1][y] << endl;
cout << c[y][y]+c[x-1][x-1]-c[y][x-1]-c[x-1][y] << endl;
}
}
| 1 |
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int J = 0, O = 0, I = 0;
void res()
{
J = 0;
O = 0;
I = 0;
}
int main()
{
string a;
cin >> a;
int ans = 0;
for (int i = 0; i < a.size(); i++)
{
switch (a[i])
{
case'J':
if (O != 0 || I != 0)
{
res();
J++;
}
else
{
J++;
}
break;
case'O':
if (J == 0||I!=0)
{
res();
continue;
}
else
{
O++;
if (O > J)
{
res();
}
}
break;
case'I':
I++;
if (O < I||J<I)
{
res();
}
if(I==O)ans = max(ans, I);
break;
}
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<(int)(n);i++)
#define FORR(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define pb(a) push_back(a)
#define ZERO(a) memset(a,0,sizeof(a))
#define len(a) sizeof(a)
#define ll long long
#define INF 1<<29
#define MAX
using namespace std;
void solve(){
string s;
cin>>s;
int ma=0;
FOR(i,s.size()){
if(s[i]!='O') continue;
int O=i;
while(O+1<s.size()&&s[O+1]=='O') O++;
int J=i;
while(J&&s[J-1]=='J') J--;
int I=O;
while(I+1<s.size()&&s[I+1]=='I') I++;
if(I-O-1>=O-i&&i-1-J>=O-i) ma=max(ma,O-i+1);
i=I;
}
cout<<ma<<endl;
}
int main(){
solve();
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) memset((a),0,sizeof(a))
#define MCLR(a) memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};
void solve(long long N, std::vector<long long> A){
map<int, int> memo;
REP(i, N) {
if(memo.count(A[i]) == 0) {
memo[A[i]] = 0;
}
memo[A[i]]++;
}
VLL beki;
LL idx = 1;
while(idx <= 2000000000LL) {
beki.PB(idx);
idx *= 2LL;
}
sort(ALL(A));
A.erase(unique(ALL(A)), A.end());
int ans = 0;
RREP(i, A.size()-1) {
REP(j, beki.size()) {
int idx = beki[j] - A[i];
if(memo.count(idx) == 1) {
if(A[i] == idx) {
int add_ans = memo[idx] / 2;
memo[idx] -= add_ans * 2;
ans += add_ans;
} else {
int add_ans = min(memo[idx], memo[A[i]]);
memo[idx] -= add_ans;
memo[A[i]] -= add_ans;
ans += add_ans;
}
}
}
}
cout << ans << endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, std::move(A));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define per1(i,n) for (int i = n; i >= 1; --i)
#define all(c) begin(c),end(c)
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; }
template<typename T> inline T intceil(T a, T b) { return (a + (b - 1)) / b; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef tuple<int,int,int> Tint;
typedef pair<ll,ll> PL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
// if(nextH >= 0 && nextH < H && nextW >= 0 && nextW < W)
static const long double pi = acos(-1.0);
typedef complex<ld> cd;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<ll> A(N);
unordered_map<ll, int> cnt;
rep(i, N) {
cin >> A[i];
++cnt[A[i]];
}
sort(all(A), greater<ll>());
int ans = 0;
rep(i, N) {
ll cur = A[i];
if(cnt[cur] == 0) continue;
ll power = 2;
while(power <= cur) {
power *= 2;
}
ll need = power - cur;
if(cnt[need] > (need == cur ? 1 : 0)) {
// debug(cur, need);
++ans;
--cnt[cur];
--cnt[need];
}
}
print(ans);
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
int position[26][MAX],Size[26];
char str[MAX];
void Get_Pos()
{
memset(Size,0,sizeof(Size));
for(int i=0;str[i];i++)
{
int k=str[i]-'a';
position[k][Size[k]++]=i;
}
}
void Solve()
{
for(int i=0;i<26;i++)
{
for(int j=0;j<Size[i]-1;j++)
{
for(int k=j+1;k<Size[i];k++)
{
if(((k-j+1)<<1)>position[i][k]-position[i][j]+1)
{
printf("%d %d\n",position[i][j]+1,position[i][k]+1);
return;
}
}
}
}
printf("-1 -1\n");
}
int main()
{
int n;
while(scanf("%s",str)!=EOF)
{
Get_Pos();
Solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
int main(void){
string s;
cin >> s;
if (s.size() == 2){
if (s[0] == s[1])
cout << 1 << " " << 2 << endl;
else
cout << -1 << " " << -1 << endl;
}
else {
ll n = s.size();
for (int i = 0; i < n-2; i++){
if (s[i] == s[i+1] || s[i+1] == s[i+2] || s[i] == s[i+2]){
cout << i+1 << " " << i + 3 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
#define ll long long
#define ar array
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
cout << s.replace(0,4,"2018") << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
const int inf = 1001001001;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 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;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m=numeric_limits<T>::max()){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
// ax+by=gcd(a,b)を解く
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
template<class T> struct edge { int to; T cost;};
int main() {
string s; cin >>s;
stack<int> sta;
rep(i, s.size()){
if (s[i] == 'T' && sta.size() > 0 && sta.top() == 0){
sta.pop();
}else{
sta.push(s[i]-'S');
}
}
int res = sta.size();
cout <<res <<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>>grid(h+2, vector<int>(w+2,0));
queue<pair<int, int>>black;
for (int i = 1; i < h + 1; i++) {
for (int j = 1; j < w + 1; j++) {
char x;
cin >> x;
if (x == '.')grid.at(i).at(j) = 1e9;
else black.push({ i, j });
}
}
while (black.size() >= 1) {
int x = black.front().first;
int y = black.front().second;
if (grid.at(x - 1).at(y) > grid.at(x).at(y) + 1) {
grid.at(x - 1).at(y) = grid.at(x).at(y) + 1;
black.push({ x - 1,y });
}
if (grid.at(x + 1).at(y) > grid.at(x).at(y) + 1) {
grid.at(x + 1).at(y) = grid.at(x).at(y) + 1;
black.push({ x + 1,y });
}
if (grid.at(x).at(y - 1) > grid.at(x).at(y) + 1) {
grid.at(x).at(y - 1) = grid.at(x).at(y) + 1;
black.push({ x,y - 1 });
}
if (grid.at(x).at(y + 1) > grid.at(x).at(y) + 1) {
grid.at(x).at(y + 1) = grid.at(x).at(y) + 1;
black.push({ x,y + 1 });
}
black.pop();
}
int ans = 0;
for (int i = 1; i < h + 1; i++) {
for (int j = 1; j < w + 1; j++) {
ans = max(ans, grid.at(i).at(j));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
int main(){
std::vector<string> d(3);
for(ll i=0;i<3;++i){
cin>>d[i];
}
ll a=0,b=0,c=0;
char now='a';
while(1){
switch(now){
case 'a':
if(a>=d[0].length()){
cout<<char(now+'A'-'a');
return 0;
}
now=d[0][a];
a++;
break;
case 'b':
if(b>=d[1].length()){
cout<<char(now+'A'-'a');
return 0;
}
now=d[1][b];
b++;
break;
case 'c':
if(c>=d[2].length()){
cout<<char(now+'A'-'a');
return 0;
}
now=d[2][c];
c++;
break;
}
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int n,t,cnt[N];bool flag=0;char a[N][N];
int b[4][10][10]={
{
{ 1, 2, 3, 3},
{ 1, 2, 4, 4},
{ 5, 5, 6, 7},
{ 8, 8, 6, 7}
},
{
{ 0, 0, 1, 2, 3},
{ 0, 0, 1, 2, 3},
{ 4, 4, 5, 6, 6},
{ 7, 7, 5, 0, 8},
{ 9, 9,10,10, 8}
},
{
{ 0, 0, 0, 1, 2, 3},
{ 0, 0, 0, 1, 2, 3},
{ 4, 0, 5, 5, 0, 6},
{ 4, 7, 7, 0, 0, 6},
{ 8, 8, 9, 0,10,10},
{11,11, 9,12,12, 0}
},
{
{ 0, 0, 0, 0, 1, 2, 3},
{ 0, 0, 0, 0, 1, 2, 3},
{ 0, 0, 0, 0, 4, 5, 6},
{ 0, 0, 0, 0, 4, 5, 6},
{ 7, 7, 8, 8, 0, 0, 9},
{10,10,11,11, 0, 0, 9},
{12,12,13,13,14,14, 0}
}
};
// void check(){
// if(!t)return;
// for(int i=0;i<n;i++){
// int nn=0;
// for(int j=0;j<n;j++)
// if(a[j][i]&&(!j||a[j][i]!=a[j-1][i]))nn++;
// if(nn!=cnt[0])return;
// }
// for(int i=0;i<n;i++){
// putchar('{');
// for(int j=0;j<n;j++){printf("%2d",a[i][j]);if(j<n-1)putchar(',');}
// puts("},\n");
// }
// flag=1;
// }
// void dfs(int id){
// if(flag)return;
// int x=id/n,y=id%n;
// if(x&&!y){
// int xx=x-1;cnt[xx]=0;
// for(int i=0;i<n;i++)if(a[xx][i]&&(!i||a[xx][i]!=a[xx][i-1]))cnt[xx]++;
// if(cnt[xx]!=3)return;
// }
// if(id==n*n){check();return;}
// if(a[x][y]){dfs(id+1);return;}
// dfs(id+1);
// if(x<n-1&&!a[x+1][y]){
// t++,a[x][y]=a[x+1][y]=t;
// dfs(id+1);
// a[x][y]=a[x+1][y]=0;t--;
// }
// if(y<n-1&&!a[x][y+1]){
// t++,a[x][y]=a[x][y+1]=t;
// dfs(id+1);
// a[x][y]=a[x][y+1]=0;t--;
// }
// }
int main(){
scanf("%d",&n);
if(n<3)puts("-1"),exit(0);
if(n==3)puts("aa.\n..b\n..b"),exit(0);
int x=(n-4)/4,y=n%4+4;
for(int i=0;i<n;i++)for(int j=0;j<n;j++)a[i][j]='.';
for(int i=0;i<x;i++)
for(int j=0,p=i*4;j<4;j++)
for(int k=0;k<4;k++)
if(b[0][j][k])
a[j+p][k+p]=b[0][j][k]+'a'-1;
for(int i=0,p=x*4;i<y;i++)
for(int j=0;j<y;j++)if(b[y-4][i][j])
a[i+p][j+p]=b[y-4][i][j]+'a';
for(int i=0;i<n;i++)puts(a[i]);
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,m,r,s,k,c1,c2,c3,c4,i;
cin>>n;
cout<<pow(n,2)+pow(n,3)+n<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
string t1;
int main(){
for(int i = 0 ; i < 26 ; i++) t1 += 'a'+i,t1 += 'A'+i;
sort(t1.begin(),t1.end());
rotate(t1.begin(),t1.begin()+26,t1.end());
int n;
while(cin >> n && n){
vector<int> k(n);
string s;
for(int i = 0 ; i < n ; i++) cin >> k[i];
cin >> s;
for(int i = 0 ; i < s.size() ; i++){
int p = k[i%n];
int pos = t1.find(s[i]);
int hoge = (pos - p) % 52 + 52;
hoge %= 52;
cout << t1[hoge];
}
cout << endl;
}
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(void){
int a,b,c,n,m,i,o,p,q,r,test[1000][3],num,chk[300];
cin >> a >> b >> c;
m = a+b+c;
while(m!=0){
for(i=0; i<m; i++){
chk[i] = 2;
}
cin >> n;
num = 0;
for(i=0; i<n; i++){
cin >> o >> p >> q >> r;
o--;
p--;
q--;
if(r==1){
chk[o] = 1;
chk[p] = 1;
chk[q] = 1;
}else{
test[num][0] = o;
test[num][1] = p;
test[num][2] = q;
num++;
}
}
for(i=0; i<num; i++){
o = test[i][0];
p = test[i][1];
q = test[i][2];
if(chk[o]==2 && chk[p]==1 && chk[q]==1){
chk[o] = 0;
}else if(chk[o]==1 && chk[p]==2 && chk[q]==1){
chk[p] = 0;
}else if(chk[o]==1 && chk[p]==1 && chk[q]==2){
chk[q] = 0;
}
}
for(i=0; i<m; i++){
cout << chk[i] << endl;
}
cin >> a >> b >> c;
m = a+b+c;
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
int n;
int a[305];
ll dp[305][90005];
ll dp2[305][90005];
ll p(ll a, ll x) {
ll res = 1;
while(x > 0) {
if(x & 1) res = res * a % mod;
a = a * a % mod;
x >>= 1;
}
return res;
}
int main() {
cin >> n;
int sum = 0;
int maxa = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
maxa = max(maxa,a[i]);
}
dp[0][0] = 1;
for(int i = 0; i < n; i++) {
for(int j = 0; j <= i * maxa; j++) {
if(dp[i][j] == 0) continue;
dp[i+1][j] = (dp[i+1][j] + dp[i][j] * 2) % mod;
dp[i+1][j+a[i]] = (dp[i+1][j+a[i]] + dp[i][j]) % mod;
}
}
dp2[0][0] = 1;
for(int i = 0; i < n; i++) {
for(int j = 0; j <= i * maxa; j++) {
if(dp2[i][j] == 0) continue;
dp2[i+1][j] = (dp2[i+1][j] + dp2[i][j]) % mod;
dp2[i+1][j+a[i]] = (dp2[i+1][j+a[i]] + dp2[i][j]) % mod;
}
}
ll ans = p(3,n);
for(int i = 0; i <= n * maxa; i++) {
if(i >= sum - i) {
ans = (ans + mod - dp[n][i] * 3 % mod) % mod;
}
if(i == sum - i) {
ans = (ans + dp2[n][i] * 3 % mod) % mod;
}
}
if(ans < 0 ) cout << ans + mod << endl;
else
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n;
long long tot=1,d[99001],e[99001],s=0;
int main()
{
cin>>n;
d[0]=e[0]=1;
for(int i=1,x;i<=n;i++)
{
cin>>x;
s+=x;
tot=tot*3%mod;
for(int j=s;j>=0;j--)
{
d[j]=(d[j]*2+(j>=x?d[j-x]:0))%mod;
e[j]=(e[j]+(j>=x?e[j-x]:0))%mod;
}
}
long long sum=0;
for(int i=(s+1)/2;i<=s;i++)sum=(sum+d[i])%mod;
cout<<((tot-3*sum+3*(s%2==0?e[s/2]:0))%mod+mod)%mod<<'\n';
}
| 1 |
#include <bits/stdc++.h>
int main() {
int n; std::cin >> n;
std::vector<std::string> a(n);
for (int i = 0; i < n; ++i) std::cin >> a[i];
// int n = 5;
// std::vector<std::string> a{"7.5", "2.4", "17.000000001", "17", "16.000000000"};
/* ピリオドをすべての文字列に加える */
for (int i = 0; i < n; i++)
if (a[i].find('.') == std::string::npos) // ピリオドの有無
a[i].push_back('.'); // ピリオドを末尾に加える
/* key:val = (c2, c5):cnt */
std::map<std::pair<int, int>, int> p;
/* aの素因数2と5の数を数える */
for (int i = 0; i < n; i++) {
// a[i].length() => 文字列の長さ
// a[i].find('.') => .(ピリオド)が存在すればその位置, なければstd::string::npos
// std::cout << a[i] << " " << a[i].length() - a[i].find('.') - 1 << std::endl;
/* 小数点以下の数 */
int d_cnt = a[i].length() - a[i].find('.') - 1;
int c2 = -d_cnt; // 2の数を-d_cntで初期化
int c5 = -d_cnt; // 5の数を-d_cntで初期化
/* 文字を数字に変換 */
a[i].replace(a[i].find('.'), 1, ""); // .(ピリオド)を削除 str.replace(開始位置, 長さ, 置き換え後の新たな文字列)
long long a_ll = std::stoll(a[i].c_str()); // long longに変換
/* 2の数を取得 */
while (a_ll%2 == 0) {
++c2;
a_ll /= 2;
}
/* 5の数を取得 */
while (a_ll%5 == 0) {
++c5;
a_ll /= 5;
}
/* mapに key:val = (c2, c5):数 保持 */
p[std::pair<int, int>(c2, c5)]++; // keyが存在しない場合は0が追加される
}
/* チェック */
// for (auto itr = p.begin(); itr != p.end(); ++itr)
// // std::cout << "(" << (*itr).first.first << ", " << (*itr).first.second << ")"
// // << " " << (*itr).second << std::endl;
// std::cout << "(" << itr->first.first << ", " << itr->first.second << ")"
// << " " << (*itr).second << std::endl;
long long cnt = 0;
for (auto itr_1 = p.begin(); itr_1 != p.end(); ++itr_1) {
int c2_1 = itr_1->first.first;
int c5_1 = itr_1->first.second;
int cnt_1 = itr_1->second;
if (c2_1 >= 0 && c5_1 >= 0)
cnt += (long long)cnt_1 * (cnt_1-1)/2;
// if (itr_1->first.first >= 0 && itr_1->first.second >= 0)
// cnt += itr_1->second*(itr_1->second-1)/2;
for (auto itr_2 = std::next(itr_1, 1); itr_2 != p.end(); ++itr_2) {
int c2_2 = itr_2->first.first;
int c5_2 = itr_2->first.second;
int cnt_2 = itr_2->second;
if (c2_1 + c2_2 >= 0 && c5_1 + c5_2 >= 0)
cnt += (long long)cnt_1 * cnt_2;
// if (itr_1->first.first + itr_2->first.first >= 0 && itr_1->first.second + itr_2->first.second >= 0)
// cnt += itr_1->second * itr_2->second;
}
}
std::cout << cnt << std::endl;
return 0;
} | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
// using namespace atcoder;
void Main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll> > fac(n+1, vector<ll>());
for (int i = 1; i <= n; i++) {
// fac[i]にiの約数を入れる
for (int j = 1; i * j <= n; j++) {
fac[i * j].push_back(i);
}
}
vector<ll> c(n + 1);
vector<ll> res;
for (int i = n; i >= 1; i--) {
int ai = a[i - 1];
if (ai != c[i] % 2) {
res.push_back(i);
for (int f: fac[i]) {
c[f]++;
}
}
}
if (res.size() <= 0) {
put(0);
return;
}
reverse(all(res));
put(res.size());
rep(i, res.size()) cout << res[i] << (i == res.size() - 1 ? "" : " ");
cout << endl;
}
signed main(){ Main();return 0;} | 0 |
#include<string>
#include<iostream>
using namespace std;
string replaceAll(string s, string f, string t) {
string r;
for (int p = 0; (p = s.find(f)) != s.npos; ) {
r += s.substr(0, p) + t;
s = s.substr(p + f.size());
}
return r + s;
}
int main(){
string s;
int n;
cin>>n;
getline(cin,s);
while(n--){
getline(cin,s);
cout<<replaceAll(s,string("Hoshino"),string("Hoshina"))<<endl;
}
} | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
/// find_by_order()
/// order_of_key()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7; /// think
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
for (auto &i : s) {
if (i == '7') {
cout << "Yes\n";
rr;
}
}
cout << "No\n";
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int n,m;
cin >> n >> m;
if(n == m){
cout << 2*m;
}
else{
cout << 2*max(m,n)-1;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A,B;
cin >> A>>B;
int ans = 0;
for (int n = 0;n<2; ++n) {
if (A > B) {
ans += A;
--A;
}
else {
ans += B;
--B;
}
}
cout << ans<<endl;
return 0;
} | 1 |
#include <string>
#include <iostream>
#include <map>
class Baseball{
private:
int score;
int out;
int runner;
int inning;
public:
Baseball(); //コンストラクタ
int getScore() { return score; }
int addScore(int score) { score += score; }
int getInning() { return inning; }
bool addOut(); //アウトを加える，チェンジならtrue
void moveOnRunner(); //ヒット時にランナーを進塁させる
void slamHomeRun(); //ホームランを打ったとき
void changeInning(); //イニングを変える，スコア, ランナーも0に戻す
};
Baseball::Baseball(){
score = 0;
out = 0;
runner = 0;
inning = 1;
}
bool Baseball::addOut(){
out = (out + 1) % 3;
return out == 0 ? true : false;
}
void Baseball::moveOnRunner(){
if(runner < 3){
runner++;
} else if(runner == 3){
runner = 3;
score += 1;
}
}
void Baseball::slamHomeRun(){
score += (runner + 1);
runner = 0;
}
void Baseball::changeInning(){
score = 0;
runner = 0;
inning += 1;
}
int main(){
Baseball b;
int totalInning = 0;
bool change_flag = false;
std :: string event;
std :: map<std :: string, int> map;
map["HIT"] = 1;
map["HOMERUN"] = 2;
map["OUT"] = 3;
std :: cin >> totalInning;
std :: getline(std :: cin, event);
while(b.getInning() <= totalInning){
std :: getline(std :: cin, event);
switch(map[event]){
case 1:
b.moveOnRunner();
break;
case 2:
b.slamHomeRun();
break;
case 3:
change_flag = b.addOut();
break;
default:
break;
}
if(change_flag) {
std :: cout << b.getScore() << std :: endl;
b.changeInning();
change_flag = false;
}
}
}
| #include<cstdio>
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
int point=0;
int base=0;
int out=0;
while(out!=3){
char s[8];
scanf(" %s",s);
switch(s[1]){
case 'I':
base++;
if(base==4){
point++;
base--;
}
break;
case 'U':
out++;
break;
case 'O':
point+=base+1;
base=0;
break;
}
}
printf("%d\n",point);
}
return 0;
} | 1 |
#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
int h,w,s;
while(true){
cin>>h>>w;
if(h==0&&w==0)
break;
bool t=true;
s=h*h+w*w;
h++;
while(true){
if(h*h>=s-h*h)
break;
if(s==h*h+(int)sqrt((double)s-h*h+0.0)*(int)sqrt((double)s-h*h+0.0)){
t=false;
break;
}
h++;
}
s++;
if(t==true){
while(true){
h=1;
while(true){
if(h*h>=s-h*h)
break;
if(s==h*h+((int)sqrt((double)s-h*h+0.0)*(int)sqrt((double)s-h*h+0.0))){
t=false;
break;
}
h++;
}
if(t==false)
break;
s++;
}
}
cout<<h<<" "<<(int)sqrt((double)s-h*h+0.0)<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
struct rectangle{
int h, w;
bool operator<(const rectangle &a)const{
if(w*w + h*h == a.w*a.w + a.h*a.h)
return h < a.h;
return w*w + h*h < a.w*a.w + a.h*a.h;
}
};
int main(){
vector<rectangle> ans;
for(int i = 1; i <= 150; i++) {
for(int j = i + 1; j <= 150; j++) {
rectangle r;
r.h = i, r.w = j;
ans.push_back(r);
}
}
sort(ans.begin(), ans.end());
for(int i = 0; i < 20; i++) {
//cout << ans[i].h << " " << ans[i].w << endl;
}
int h, w;
while(cin >> h >> w, h){
rectangle r;
r.h = h, r.w = w;
for(int i = 0; i < ans.size(); i++){
if(r < ans[i]){
cout << ans[i].h << " " << ans[i].w << endl;
break;
}
}
}
return 0;
} | 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (int64_t)(n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
#define chmax(a, b) (a) = max(a, b)
#define chmin(a, b) (a) = min(a, b)
int main() {
int N;
cin >> N;
using D = tuple<int, int, int>;
vector<D> data;
rep(i, N) {
int x, y;
char d;
cin >> x >> y >> d;
int dir = 0;
if (d == 'D' || d == 'U') {
dir |= 2;
}
if (d == 'D' || d == 'L') {
dir |= 1;
}
data.push_back(D(x, y, dir));
}
constexpr int INF = numeric_limits<int>::max();
int result = INF;
constexpr int MAX = 200'000;
vector<vector<vector<int>>> tbl(4, vector<vector<int>>(MAX + 1));
vector<vector<vector<int>>> cross(4, vector<vector<int>>(2 * MAX + 1)),
cross2(4, vector<vector<int>>(2 * MAX + 1));
rep(i, N) {
int x, y, d;
tie(x, y, d) = data[i];
tbl[d][((d & 2) ? x : y)].push_back((d & 2) ? y : x);
cross[d][x + y].push_back(x - y + MAX);
cross2[d][x - y + MAX].push_back(x + y);
}
rep(i, 4) irep(j, MAX) { sort(tbl[i][j].begin(), tbl[i][j].end()); }
rep(i, 4) irep(j, 2 * MAX) {
sort(cross[i][j].begin(), cross[i][j].end());
sort(cross2[i][j].begin(), cross2[i][j].end());
}
rep(i, 2) {
irep(j, MAX) {
for (int v : tbl[i << 1][j]) {
const auto &tmp = tbl[(i << 1) ^ 1][j];
auto iter = lower_bound(tmp.begin(), tmp.end(), v);
if (iter != tmp.end()) {
// cerr << i << " " << j << " " << v << " " << *iter << "\n";
chmin(result, 5 * (*iter - v));
}
}
}
}
rep(i, 2) {
irep(j, 2 * MAX) {
for (int v : cross[i][j]) {
const auto &tmp = cross[i ^ 2][j];
auto iter = lower_bound(tmp.begin(), tmp.end(), v);
if (i == 0) {
if (iter != tmp.end()) {
cerr << i << " " << j << " " << v << " " << *iter << "\n";
chmin(result, 5 * (*iter - v));
}
} else {
if (iter != tmp.begin()) {
chmin(result, 5 * (v - *prev(iter)));
}
}
}
}
}
rep(i, 2) {
irep(j, 2 * MAX) {
for (int v : cross2[i][j]) {
const auto &tmp = cross2[i ^ 3][j];
auto iter = lower_bound(tmp.begin(), tmp.end(), v);
if (i == 0) {
if (iter != tmp.end()) {
chmin(result, 5 * (*iter - v));
}
} else {
if (iter != tmp.begin()) {
chmin(result, 5 * (v - *prev(iter)));
}
}
}
}
}
if (result == INF) {
cout << "SAFE" << endl;
} else {
cout << result << endl;
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<unordered_map>
#include<random>
#include<array>
#include<cassert>
using namespace std;
#define INF ((1<<25)-1)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
int N;
int X[200000];
int Y[200000];
char U[200000];
int dir(char c) {
return c == 'U' ? 0 : c == 'R' ? 1 : c == 'D' ? 2 : 3;
}
int near(int v, const set<int> &s) {
int ret = INF;
auto it = s.lower_bound(v);
if (it != s.end()) {
ret = min(ret, *it - v);
}
return ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int ans = INF;
cin >> N;
rep(i, N)cin >> X[i] >> Y[i] >> U[i];
{
unordered_map<int, array<set<int>, 4>> d;
rep(i, N) {
int a = X[i];
d[a][dir(U[i])].insert(Y[i]);
}
// U, D
for (const auto& p : d) {
const auto& layer = p.second;
for (int y : layer[dir('U')]) {
ans = min(ans, near(y, layer[dir('D')]) * 5);
}
}
}
{
unordered_map<int, array<set<int>, 4>> d;
rep(i, N) {
int a = Y[i];
d[a][dir(U[i])].insert(X[i]);
}
// L, R
for (const auto& p : d) {
const auto& layer = p.second;
for (int y : layer[dir('R')]) {
ans = min(ans, near(y, layer[dir('L')]) * 5);
}
}
}
{
unordered_map<int, array<set<int>, 4>> d;
rep(i, N) {
int a = X[i] + Y[i];
d[a][dir(U[i])].insert(Y[i]);
}
// R, U
for (const auto& p : d) {
const auto& layer = p.second;
for (int y : layer[dir('U')]) {
ans = min(ans, near(y, layer[dir('R')]) * 10);
}
}
// D, L
for (const auto& p : d) {
const auto& layer = p.second;
for (int y : layer[dir('L')]) {
ans = min(ans, near(y, layer[dir('D')]) * 10);
}
}
}
{
unordered_map<int, array<set<int>, 4>> d;
rep(i, N) {
int a = X[i] - Y[i] + 200000;
d[a][dir(U[i])].insert(Y[i]);
}
// L, U
for (const auto& p : d) {
const auto& layer = p.second;
for (int y : layer[dir('U')]) {
ans = min(ans, near(y, layer[dir('L')]) * 10);
}
}
// D, R
for (const auto& p : d) {
const auto& layer = p.second;
for (int y : layer[dir('R')]) {
ans = min(ans, near(y, layer[dir('D')]) * 10);
}
}
}
if (ans == INF)cout << "SAFE" << endl;
else cout << ans << endl;
return 0;
}
| 1 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
string S;
cin>>S;
map<char, int> amap;
for(int i=0;i<S.size();++i) {
amap[S[i]]++;
}
char ans = 'A';
for(char a='a';a<='z';++a) {
if(amap[a]==0) {
ans = a;
break;
}
}
if(ans=='A') cout<<"None"<<endl;
else cout<<ans<<endl;
}
| #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int, int>;
/* 大文字を小文字に変換 */
char tolower(char c) {return (c + 0x20);}
/* 小文字を大文字に変換 */
char toupr(char c) {return (c - 0x20);}
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
string s = "abcdefg"
s.substr(4) "efg"
s.substr(0,3) "abc"
s.substr(2,4) "cdef"
// イテレータ要素のインデックス
distance(A.begin(), itr);
*/
int main()
{
int a,b,c; cin >> a >> b >> c;
int cnt = 0;
if(a == b) cnt++;
if(a == c) cnt++;
if(b == c) cnt++;
if(cnt == 1) cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 |
#include "bits/stdc++.h"
using namespace std;
const int N=300005;
const int p=1e9+7;
inline void add(int& a,const int& b){
a+=b;
if(a>=p)a-=p;
}
int to[8][2]={{5,1},{3,2},{2,2},{4,1},{3,3},{7,6},{5,1},{5,5}};
char s[N];
int f[N][8];
int main(){
scanf("%s",s+1);
int n=strlen(s+1);
f[0][0]=1;
for(int i=1;i<=n;++i){
if(s[i]!='1')for(int j=0;j<8;++j)add(f[i][to[j][0]],f[i-1][j]);
if(s[i]!='0')for(int j=0;j<8;++j)add(f[i][to[j][1]],f[i-1][j]);
}
printf("%d\n",(f[n][1]+f[n][2])%p);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;//llの最大9*10^18
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
string S;
cin >> N;
ll D = N % 10;
N = (N - D) / 10;
ll C = N % 10;
N = (N - C) / 10;
ll B = N % 10;
N = (N - B) / 10;
ll A = N % 10;
ll tmp = 0;
bool flag = flase;
REP(i,2){
REP(j,2){
REP(k,2){
if(i==0){
tmp = A + B;
}
else{
tmp = A - B;
}
if (j == 0)
{
tmp += C;
}
else
{
tmp -= C;
}
if (k == 0)
{
tmp += D;
}
else
{
tmp -= D;
}
if(tmp==7){
cout << A;
if (i == 0)
{
cout << "+";
}
else
{
cout << "-";
}
cout << B;
if (j == 0)
{
cout << "+";
}
else
{
cout << "-";
}
cout << C;
if (k == 0)
{
cout << "+";
}
else
{
cout << "-";
}
cout << D;
cout << "=7" << endl;
flag = true;
break;
}
}
if(flag){
break;
}
}
if (flag)
{
break;
}
}
}
| 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int H, W, N;
cin >> H >> W >> N;
int max_len = max(H, W);
if(N % max_len == 0) cout << (N / max_len) << endl;
else cout << (N / max_len) + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int h, w, n; cin >> h >> w >> n;
int ans = IINF;
for(int i = 0; i <= h; i++){
for(int j = 0; j <= w; j++){
int sum = i * h + j * w - i * j;
if(sum >= n) ans = min(ans, i + j);
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = (int)1e5 + 5, LOG = 60;
int n, x[N], m, a[N], d[N], per[N], jump[N][LOG], finalPos[N], updPos[N], finalD[N];
ll K, ans[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", x + i);
scanf("%d %lld", &m, &K);
for (int i = 1; i <= m; ++i) scanf("%d", a + i);
for (int i = 1; i <= n; ++i) d[i] = x[i] - x[i - 1];
for (int i = 1; i <= n; ++i) per[i] = i;
for (int i = 1; i <= m; ++i) swap(per[ a[i] ], per[ a[i] + 1 ]);
for (int i = 1; i <= n; ++i) jump[ per[i] ][0] = i;
for (int j = 1; j < LOG; ++j) {
for (int i = 1; i <= n; ++i) jump[i][j] = jump[ jump[i][j - 1] ][j - 1];
}
for (int i = 1; i <= n; ++i) finalPos[i] = i;
for (int j = LOG - 1; j >= 0; --j) if ( (K >> j) & 1) {
for (int i = 1; i <= n; ++i) updPos[i] = jump[ finalPos[i] ][j];
swap(finalPos, updPos);
}
for (int i = 1; i <= n; ++i) finalD[ finalPos[i] ] = d[i];
for (int i = 1; i <= n; ++i) cout << (ans[i] = ans[i - 1] + finalD[i]) << '\n';
return 0;
}
| // #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(1, 1E8); \
auto rnd = bind(__dis, __gen)
const int INF = 1E18;
const int mod = 1E9 + 7;
const int maxn = 100 + 5;
int32_t main() {
fastIO();
int n, m;
cin >> n >> m;
int vec[n][m];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) cin >> vec[i][j];
}
vector<pair<pii, pii>> op;
for (int i = 0; i < n; ++i) {
if (i < n-1) {
for (int j = 0; j < m; ++j) {
if (vec[i][j] & 1) {
op.pb({{i+1, j+1}, {i+2, j+1}});
++vec[i+1][j];
}
}
}
else {
for (int j = 0; j < m-1; ++j) {
if (vec[i][j] & 1) {
op.pb({{i+1, j+1}, {i+1, j+2}});
++vec[i][j+1];
}
}
}
}
cout << op.size() << "\n";
for (auto x : op) cout << x.X.X << " " << x.X.Y << " " << x.Y.X << " " << x.Y.Y << "\n";
return 0;
} | 0 |
// you can use includes, for example:
#include <iostream>
#include <vector>
#include <algorithm>
#include <memory>
#include <unordered_map>
#include <algorithm>
#include <unordered_map>
#include <string>
#include <sstream>
#include <set>
#include <cassert>
#include <map>
using namespace std;
constexpr int64_t kMod = 1e9 + 7;
int main(void) {
ios_base::sync_with_stdio(0);
int n, m;
cin >> n >> m;
auto calc = [](int n) {
int64_t cur_x = 0;
int64_t cur_sum_x = 0;
for (int i = 0; i < n; i++) {
int64_t x;
cin >> x;
if (i) {
cur_sum_x += x * (i) - cur_x;
}
cur_x += x;
cur_x %= kMod;
cur_sum_x %= kMod;
}
return (cur_sum_x + kMod) % kMod;
};
auto x_sum = calc(n);
auto y_sum = calc(m);
cout << x_sum * y_sum % kMod << endl;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#define mod 1000000007
#define INF 1145141919364364
#define int long long
#define all(vec) vec.begin(),vec.end()
#define P pair<int,int>
#define S second
#define F first
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x%y);
}
int lcm(int x, int y) {
return x / gcd(x, y)*y;
}
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x%i == 0)return false;
}
return true;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i; res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int n;
string s;
bool bl[200010];
int cnt1, cnt2;
int cnt;
int ans = 1;
signed main() {
cin >> n >> s;
bl[0] = 0;
cnt2++;
for (int i = 1; i < 2 * n; i++) {
if (s[i - 1] == s[i]) {
if (bl[i - 1])bl[i] = false;
else bl[i] = true;
}
else bl[i] = bl[i - 1];
if (bl[i])cnt1++;
else cnt2++;
}
if (s[0] == 'W' || s[2 * n - 1] == 'W' || cnt1 != cnt2) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < 2 * n; i++) {
if (!bl[i])cnt++;
else {
ans *= cnt;
ans %= mod;
cnt--;
}
}
ans *= kai(n, n);
ans %= mod;
cout << ans << endl;
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
int main() {
const int size = 21;
char str[size];
std::scanf("%s", &str);
for (int i = size - 1; i >= 0; i--)
if (48 <= str[i] && str[i] <= 57)
std::cout << str[i];
else if(97 <= str[i] && str[i] <= 122)
std::cout << str[i];
std::cout << std::endl;
} | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int main()
{
string s,t;
cin >> s;
t = s;
for (int i = 0; i < s.size(); i++) {
t[i] = s[s.size() - i-1];
}
cout << t << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 7;
string w[] = { "SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };
for (unsigned int i = 0; i < 7; i++) {
if(s == w[i]) {
ans -= i;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]=='S'){
if(s[1]=='U') cout<<7;
else cout<<1;
}
else if(s[0]=='M') cout<<6;
else if(s[0]=='T'){
if(s[1]=='U') cout<<5;
else cout<<3;
}
else if(s[0]=='W') cout<<4;
else if(s[0]=='F') cout<<2;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector<vd>;
using vvvi = vector<vvi>;
using vvvll = vector<vvll>;
using vvvd = vector<vvd>;
const double pi=3.141592653589793;
int main() {
ll n,a,b;
cin>>n>>a>>b;
ll ans=0;
ll x[n];
rep(i,n){
cin>>x[i];
}
rep(i,n-1){
if ((x[i+1]-x[i])*a>b){
ans+=b;
}
else{
ans+=(x[i+1]-x[i])*a;
}
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int m,a,b,t=0,s;
while(cin>>m>>a>>b){
t=0;
if(m==0){
break;
}
int p[m];
for(int i=0;i<m;i++){
cin>>p[i];
}
for(int i=a;i<=b;i++){
if(t<=p[i-1]-p[i]){
t=p[i-1]-p[i];
s=i;
}
}
cout<<s<<endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,i,j,n;
deque<int >v;
cin >> n;
for(i = 0 ;i<n ;i++)
{
cin >> x;
deque<int >:: iterator it;
it = upper_bound(v.begin(),v.end(),x);
if(v.begin()== it)
v.push_front(x);
else
v[it -v.begin()]==x ;
}
cout<<v.size()<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//(a+b-1)/b
//priority_queue<ll, vector<ll>, greater<ll>> q;
ll g[10][10];
signed main(){
//cout << fixed << setprecision(10);
int n; cin >> n;
vl a(n);
rep(i,0,n)cin >> a[i];
ll m = MOD;
ll ans = 0;
rep(i,0,n){
ans += (a[i] <= m);
chmin(m,a[i]);
}
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, y;
cin >> n >> y;
int a = -1, b = -1, c = -1;
for (int i=0; i<=n; i++) {
for (int j=0; i+j<=n; j++) {
int k = n - i - j;
if (10000 * i + 5000 * j + 1000 * k == y) {
a = i; b = j; c = k;
}
}
}
cout << a << " " << b << " " << c << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 300+10;
int dp[2][MAXN][2][2][MAXN];
char str[MAXN];
int main()
{
ios::sync_with_stdio(false);
cin>>str;
int K,N=strlen(str);
cin>>K;
int ans=0;
for(int i=0;i<N;++i)
{
int ii=i%2;
for(int j=N-1;j>=i;--j)
{
for(int k=0;k<=K;++k)
{
dp[ii][j][0][0][k]=max(max(dp[!ii][j][0][0][k],dp[!ii][j][1][0][k]),max(dp[ii][j+1][0][0][k],dp[ii][j+1][0][1][k]));
dp[ii][j][0][1][k]=max(dp[!ii][j][0][1][k],dp[!ii][j][1][1][k]);
dp[ii][j][1][0][k]=max(dp[ii][j+1][1][0][k],dp[ii][j+1][1][1][k]);
if(str[i]==str[j])
dp[ii][j][1][1][k]=max(max(dp[!ii][j][0][0][k],dp[!ii][j][1][0][k]),max(dp[ii][j+1][0][0][k],dp[ii][j+1][0][1][k]))+1;
else if(k!=0)
dp[ii][j][1][1][k]=max(max(dp[!ii][j][0][0][k-1],dp[!ii][j][1][0][k-1]),max(dp[ii][j+1][0][0][k-1],dp[ii][j+1][0][1][k-1]))+1;
int tmp=0;
for(int ui=0;ui<2;++ui)
for(int uj=0;uj<2;++uj)
if(!(ui&&uj))
tmp=max(tmp,dp[ii][j][ui][uj][k]);
ans=max(ans,tmp*2);
if(i==j)
ans=max(ans,2*dp[ii][j][1][1][k]-1);
else ans=max(ans,2*dp[ii][j][1][1][k]);
}
}
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 5;
char s[maxn];
int sum[maxn];
int k[maxn];
vector<int> D;
vector<int> C;
int n;
ll slove(int k) {
if (C.empty() || D.empty())
return 0;
ll ans=0;
int j = 0;
queue<int> q;
int a, b;
ll temp=0;
for (int i = 0; i < D.size(); i++) {
//将所有C的贡献调整
if(i>0)
temp-=(ll)q.size()*(sum[D[i]]-sum[D[i-1]]);
//将跳过的C贡献调整
if(!q.empty()) {
int ft=q.front();
while(ft<=D[i]) {
temp+=sum[D[i]]-sum[D[i-1]];
temp-=sum[ft]-sum[D[i-1]];
q.pop();
if(q.empty())
break;
ft=q.front();
}
}
//将无用的C排除
while(j < C.size() &&C[j]<D[i]){
j++;
}
//增加新的C
while (j < C.size() && C[j] - D[i] < k) {
q.push(C[j]);
temp+=sum[C[j]]-sum[D[i]];
j++;
}
ans+=temp;
}
return ans;
}
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
int q;
scanf("%d", &q);
for (int i = 1; i <= q; i++)
scanf("%d", &k[i]);
for (int i = 1; i <= n; i++) {
if (s[i] == 'D')
D.push_back(i);
if (s[i] == 'C')
C.push_back(i);
if (s[i] == 'M')
sum[i] = sum[i - 1] + 1;
else
sum[i] = sum[i - 1];
}
// cout<<"D";
// for(auto x:D)cout<<x<<" ";cout<<endl;
// cout<<"C";
// for(auto x:C)cout<<x<<" ";cout<<endl;
for (int i = 1; i <= q; i++) {
printf("%lld\n", slove(k[i]));
}
}
| #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
#define all(x) begin((x)), end((x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
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;
}
vector<ll> a;
ll n,m,v,p;
bool chk(int idx) {
if (a[idx]+m<a[n-p]) {
return false;
}
ll cnt = 0;
rep(i,n) {
if (i>n-p||i<=idx) {
cnt += m;
}
else {
cnt += max(0LL, a[idx]+m-a[i]);
}
}
return cnt >= m*v;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n>>m>>v>>p;
a.assign(n,0);
rep(i,n) cin>>a[i];
sort(all(a));
ll l=0,r=n-1;
while(r>l) {
ll mid = (l+r)/2;
if (chk(mid)) {
r = mid;
} else {
l = mid;
}
if (l+1==r) {
if (chk(l)) {
r = l;
} else {
l = r;
}
}
}
cout << n-l << endl;
return 0;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#define ll long long
#define LINF 0x3f3f3f3f3f3f3f3f
#define INF 0x3f3f3f3f
using namespace std;
const int MAX = 1e5 + 10;
const int MOD = 1e9 + 7;
int N, M, K, Q;
ll xA[MAX], yA[MAX];
int main()
{
int i, j, k;
scanf("%d%d", &N, &M);
for (i = 1; i <= N; ++i) scanf("%lld", &xA[i]);
for (i = 1; i <= M; ++i) scanf("%lld", &yA[i]);
ll xsum, ysum;
xsum = ysum = 0;
for (i = 1; i < N; ++i) xsum = (xsum + (xA[i + 1] - xA[i]) * (ll)(N - i) %MOD * (ll)i % MOD) % MOD;
for (i = 1; i < M; ++i) ysum = (ysum + (yA[i + 1] - yA[i]) * (ll)(M - i) %MOD * (ll)i % MOD) % MOD;
printf("%lld", xsum*ysum %MOD);
} | #include<bits/stdc++.h>
using namespace std;
int ans, X, Y, N, M, dp[2][102][102][102], s[102][102];
char sir[102][102];
void U (int &x, int val) {if (val > x) x = val;}
int get_sub (int a1, int b1, int a2, int b2)
{
if (a1 < 1) a1 = 1;
if (b1 < 1) b1 = 1;
if (a2 > N) a2 = N;
if (b2 > M) b2 = M;
if (a1 > a2 || b1 > b2) return 0;
return s[a2][b2] - s[a1 - 1][b2] - s[a2][b1 - 1] + s[a1 - 1][b1 - 1];
}
int sum_lin (int i, int j1, int j2) {return get_sub (i, j1, i, j2);}
int sum_col (int j, int i1, int i2) {return get_sub (i1, j, i2, j);}
int intersect (int a1, int b1, int a2, int b2, int &st, int &dr) {st = max (a1, a2), dr = min (b1, b2);}
int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);
scanf ("%d %d\n", &N, &M);
for (int i=1; i<=N; i++)
scanf ("%s\n", sir[i] + 1);
for (int i=1; i<=N; i++)
for (int j=1; j<=M; j++)
{
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (sir[i][j] == 'o');
if (sir[i][j] == 'E') X = i, Y = j;
}
for (int l=0; l<Y; l++)
{
for (int r=0; r<=M - Y; r++)
for (int u=0; u<X; u++)
for (int d=0; d<=N - X; d++)
dp[(l & 1) ^ 1][r][u][d] = 0;
for (int r=0; r<=M - Y; r++)
for (int u=0; u<X; u++)
for (int d=0; d<=N - X; d++)
{
int curr = dp[l & 1][r][u][d], st, dr;
if (curr > ans) ans = curr;
intersect (r + 1, M - l, Y - l, Y + r, st, dr);
U (dp[l & 1][r][u][d + 1], curr + (X + d + 1 <= N - u) * sum_lin (X + d + 1, st, dr));
U (dp[l & 1][r][u + 1][d], curr + (X - u - 1 >= 1 + d) * sum_lin (X - u - 1, st, dr));
intersect (d + 1 , N - u, X - u, X + d, st, dr);
U (dp[l & 1][r + 1][u][d], curr + (Y + r + 1 <= M - l) * sum_col (Y + r + 1, st, dr));
U (dp[(l & 1) ^ 1][r][u][d], curr + (Y - l - 1 >= 1 + r) * sum_col (Y - l - 1, st, dr));
}
}
printf ("%d\n", ans);
return 0;
}
| 0 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
using namespace std;
struct dish {
ll x, y;
dish(ll tx = 0, ll ty = 0) {
x = tx;
y = ty;
}
void read() {
cin >> x >> y;
}
bool operator<(const dish & d) const {
return (x + y > d.x + d.y);
}
};
#define MAXN (1 << 17)
dish a[MAXN];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
a[i].read();
}
sort(a, a + n);
ll ret = 0;
for (int i = 0; i < n; i++) {
if (i & 1) {
ret -= a[i].y;
} else {
ret += a[i].x;
}
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N), C(N);
rep(i, N) {
cin >> A[i] >> B[i];
C[i] = A[i] + B[i];
}
sort(all(C), greater<ll>());
ll sum = 0;
rep(i, N) if(i%2==0) sum += C[i];
cout << sum - accumulate(all(B), 0LL) << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 998244353;
int pa[100005][18];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int>v(n);
for (auto &i : v) {
cin >> i;
}
int k;
cin >> k;
for (int i = 0 ; i < n ; i++) {
int l = i, r = n;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (v[mid] - v[i] <= k) {
l = mid;
}
else {
r = mid;
}
}
pa[i][0] = l;
}
for (int i = 1 ; i < 18 ; i++) {
for (int j = 0 ; j < n ; j++) {
pa[j][i] = pa[pa[j][i - 1]][i - 1];
}
}
int t;
cin >> t;
while (t--) {
int x , y;
cin >> x >> y;
x--, y--;
if (x > y) {
swap(x, y);
}
int l = 0, r = n;
while (r - l > 1) {
int mid = (l + r) >> 1;
int tx = x;
for (int i = 0 ; i < 18 ; i++) {
if (mid & (1<<i)) {
tx = pa[tx][i];
}
}
if (tx >= y) {
r = mid;
}
else {
l = mid;
}
}
cout << r << '\n';
}
}
| #include <bits/stdc++.h>
#define DICE_SIZE 6
#define TOP 0
#define FRONT 1
#define RIGHT 2
#define LEFT 3
#define BACK 4
#define BOTTOM 5
using namespace std;
class Dice {
private:
int number[DICE_SIZE];
int work_space[DICE_SIZE];
void reset_number(int, int, int, int, int, int);
public:
Dice(int *);
void turn(char);
void turn_horizon();
int peek(int);
void set_top(int);
int get_position(int);
bool equals(Dice *);
};
Dice::Dice(int *number) {
for (int i = 0; i < DICE_SIZE; i++) this->number[i] = number[i];
}
void Dice::turn(char direction) {
for (int i = 0; i < DICE_SIZE; i++) work_space[i] = number[i];
switch (direction) {
case 'N':
reset_number(work_space[1], work_space[5], work_space[2], work_space[3], work_space[0], work_space[4]);
break;
case 'E':
reset_number(work_space[3], work_space[1], work_space[0], work_space[5], work_space[4], work_space[2]);
break;
case 'S':
reset_number(work_space[4], work_space[0], work_space[2], work_space[3], work_space[5], work_space[1]);
break;
case 'W':
reset_number(work_space[2], work_space[1], work_space[5], work_space[0], work_space[4], work_space[3]);
break;
}
}
void Dice::turn_horizon() {
for (int i = 0; i < DICE_SIZE; i++) work_space[i] = number[i];
reset_number(work_space[0], work_space[3], work_space[1], work_space[4], work_space[2], work_space[5]);
}
int Dice::peek(int position) {
return number[position];
}
int Dice::get_position(int num) {
for (int i = 0; i < DICE_SIZE; i++) {
if (number[i] == num) return i;
}
}
void Dice::reset_number(int num0, int num1, int num2, int num3, int num4, int num5) {
number[0] = num0;
number[1] = num1;
number[2] = num2;
number[3] = num3;
number[4] = num4;
number[5] = num5;
}
void Dice::set_top(int num) {
int current_position = get_position(num);
if (current_position == RIGHT || current_position == LEFT) {
while (peek(TOP) != num) {
turn('W');
}
} else {
while (peek(TOP) != num) {
turn('N');
}
}
}
bool Dice::equals(Dice *dice) {
bool eql_flg = true;
for (int i = 0; i < DICE_SIZE; i++) {
if (peek(i) != dice->peek(i)) {
eql_flg = false;
break;
}
}
return eql_flg;
}
bool check_all_pattern(Dice *dice1, Dice *dice2) {
bool eql_flg = false;
for (int i = 0; i < DICE_SIZE; i++) {
dice1->set_top(dice1->peek(i));
for (int j = 0; j < DICE_SIZE; j++) {
dice2->set_top(dice2->peek(j));
for (int k = 0; k < 4; k++) {
if (dice1->equals(dice2)) {
eql_flg = true;
goto RETURN;
}
dice2->turn_horizon();
}
}
}
RETURN:
return eql_flg;
}
int main() {
int n;
int number[DICE_SIZE];
cin >> n;
Dice *dices[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < DICE_SIZE; j++) cin >> number[j];
dices[i] = new Dice(number);
}
bool is_along_flg = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) continue;
if (check_all_pattern(dices[i], dices[j])) {
is_along_flg = false;
goto END;
}
}
}
END:
cout << (is_along_flg ? "Yes" : "No") << endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int part(int a[],int p,int r){
int x=a[r];
int i=p-1;
for (int j = p; j < r; ++j) {
if (a[j]<=x){
i+=1;
swap(a[i],a[j]);
}
}
swap(a[i+1],a[r]);
return i+1;
}
int main() {
int n,a[100000];
scanf("%d",&n);
for (int i = 0; i < n; ++i) {
scanf("%d",&a[i]);
}
int pos=part(a,0,n-1);
for (int j = 0; j <n ; ++j) {
if (j>0)
printf(" ");
if (j==pos)
printf("[");
printf("%d",a[j]);
if (j==pos)
printf("]");
}
printf("\n");
return 0;
} | #include <iostream>
#include <string>
#include <sstream>
int partition(int* arr, int n)
{
const int x = arr[n - 1]; //pivot value
int i = 0; //increment if swaped
int j = 0; //increment every loop
for (; j < n; ++j) { //scan start to end
if (arr[j] <= x) {
std::swap(arr[i], arr[j]);
++i;
}
}
return i - 1;
}
void print(int const* arr, const int n, int q, int i)
{
if (i == n - 1 ) {
std::cout << arr[i] << std::endl;
return;
}
if (i == q) {
std::cout << "[" << arr[i] << "] ";
}
else {
std::cout << arr[i] << " ";
}
return print(arr, n, q, i + 1);
}
void print(int const* arr, const int n, int q)
{
print(arr, n, q, 0);
return;
}
int main()
{
int n;
{
std::string buf;
std::getline(std::cin, buf);
n = std::stoi(buf);
}
int arr[100000];
{
std::string buf;
std::getline(std::cin, buf);
std::stringstream stream;
stream << buf;
for (int i = 0; std::getline(stream, buf, ' '); ++i) {
arr[i] = std::stoi(buf);
}
}
int q = partition(arr, n);
print(arr, n, q);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int res,n,d,a[200010],dpl[200010],dpr[200010];
signed main()
{
ios::sync_with_stdio(false);
cin>>n>>d;
for(int i=1;i<=n;i++){cin>>a[i];res+=a[i];}
res+=(n-1)*d;
dpl[1]=a[1];
for(int i=2;i<=n;i++) dpl[i]=min(a[i],dpl[i-1]+d);
dpr[n]=a[n];
for(int i=n-1;i>=1;i--) dpr[i]=min(a[i],dpr[i+1]+d);
for(int i=2;i<=n-1;i++) res+=min(dpl[i],dpr[i]);
cout<<res<<endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
ll n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
vl k(q);
for (int i = 0; i < q; ++i) {
cin >> k[i];
k[i]--;
}
for (int i = 0; i < q; ++i) {
vl dp(3, 0);
vl cnt(3, 0);
for (int j = 0; j < n; ++j) {
if (s[j] == 'D') {
dp[0]++;
cnt[0]++;
} else if (s[j] == 'M') {
dp[1] += dp[0];
cnt[1]++;
} else if (s[j] == 'C') {
dp[2] += dp[1];
}
if (j >= k[i]) {
if (s[j - k[i]] == 'D') {
dp[0]--;
dp[1] -= cnt[1];
cnt[0]--;
} else if (s[j - k[i]] == 'M') {
cnt[1]--;
}
}
}
cout << dp[2] << "\n";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
for(int i=0;;++i){
int ans = 1 + (a - 1)*i;
if(b <= ans){
cout << i;
return 0;
}
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll x, y;
cin >> x >> y;
if(x == y)cout << 0 << endl;
else if(x == -y)cout << 1 << endl;
else if(abs(x) < abs(y)){
ll ans = abs(y) - abs(x);
if(x < 0 && y < 0)ans += 2;
else if(x < 0 || y < 0)ans++;
cout << ans << endl;
}else{
ll ans = abs(x) - abs(y);
if(x > 0 && y > 0)ans += 2;
else if(x > 0 || y > 0)ans++;
cout << ans << endl;
}
} | 0 |
//Space Coconut Grab
#include<bits/stdc++.h>
using namespace std;
#define INF 10000000
typedef long long ll;
//x^t
ll mypow(ll x, ll t){
return (ll)pow((double)x, (double)t);
}
ll ans[1000001];
int main(){
for(ll i=0; i<=1000000; i++)ans[i]=INF;
for(ll z=0; mypow(z, 3)<=1000000; z++){
ll tmp;
for(ll y=0; (tmp=mypow(z,3)+mypow(y,2))<=1000000; y++)
if(ans[tmp]>y+z)
ans[tmp]=y+z;
}
while(true){
ll e;
cin>>e;
if(e==0)break;
ll mn=INF;
for(int i=0; i<=e; i++)
if(mn>ans[i]+(e-i))mn=ans[i]+(e-i);
cout<<mn<<endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <map>
#include <numeric>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()
#define PI 3.14159265358479
typedef long long ll;
typedef vector<long long int> vi;
typedef vector<long long int>::iterator vit;
int main(){
ll d, s = 0;
while (cin >> d){
REP(i, 600 / d - 1){
s += pow((i + 1)*d, 2)*d;
}
cout << s << "\n";
s = 0;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,l;
cin>>n>>l;
int mini;
if(l>=0) mini=l;
else if(n+l-1<=0) mini=n+l-1;
else mini=0;
cout<<(l+n+l-1)*n/2-mini;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
int ans = 0;
for(int i=l; i<l+n; ++i){
if(l+n-1 < 0 && i == l+n-1) continue;
if(l > 0 && i == l) continue;
ans += i;
}
cout << ans << endl;
} | 1 |
/*
author : nishi5451
created: 11.08.2020 00:36:47
*/
#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 a,b,c;
cin >> a >> b >> c;
if(*a.rbegin()==*b.begin() && *b.rbegin()==*c.begin()){
cout << "YES" << endl;
}
else cout << "NO" << endl;
return 0;
} | #include<stdio.h>
int main(){
char a[100];
scanf("%[^\n]", a);
int ctr = 0;
for(int i= 0; a[i] != '\0'; i++){
if(a[i] == ' '){
if(a[i - 1] == a[i + 1]){
ctr++;
}
}
}
if(ctr == 2){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
string A;
cin >> A;
map<char, ll> z;
for (int i=0; i<(int)A.size(); i++) {
if (z.count(A[i])) z[A[i]]++;
else z[A[i]] = 1;
}
ll num = 0;
for (auto p: z) {
auto value = p.second;
num += value*(value-1)/2;
}
cout << (ll)A.size()*(A.size()-1)/2-num+1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ss(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define per(i, l, r) for (int i = r; l <= i; --i)
using ll = long long;
using namespace std;
string s;
int cnt[26];
int main() {
cin >> s;
for (auto x : s)
cnt[x - 'a']++;
ll res = 0;
rep(i, 0, 25)
rep(j, i + 1, 25)
res += 1LL * cnt[i] * cnt[j];
cout << res + 1 << endl;
return 0;
}
| 1 |
#ifndef VS
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}
}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::function<ret (__VA_ARGS__)>
template <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}
template <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}
template <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}
class range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};
const int mod = 1e9 + 7;
typedef vector<LL> V;
typedef vector<V> VV;
int main() {
string s;
while (cin >> s) {
VV dp(4, V(3, 0));
dp[0][0] = 1;
for (auto c : s) {
VV nxt(4, V(3, 0));
if (c == '0' || c == '?') {
for (int i : range(4)) {
nxt[i][1] += dp[i][0];
nxt[i][2] += dp[i][1];
nxt[i][1] += dp[i][2];
}
}
if (c == '1' || c == '?') {
for (int i : range(4)) {
nxt[min(i + 1, 3)][0] += dp[i][0];
nxt[i][0] += dp[i][1];
nxt[i][1] += dp[i][2];
}
}
for (auto &a : nxt)for (auto &b : a)b %= mod;
swap(dp, nxt);
}
cout << (dp[3][0] + dp[3][1] + dp[3][2] + dp[2][0] + dp[2][1] + dp[1][0]) % mod << endl;
}
return 0;
}
| #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bitset>
#include <utility>
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 = 1LL <<60;
const int INF = 10000;
//最大公約数
ll gcd(ll x, ll y) {
ll tmp = 0;
if (x < y){
tmp=x;
x=y;
y=tmp;
}
while (y > 0) {
ll r = x % y;
x = y;
y = r;
}
return x;
}
//最大公倍数
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
const int MAX = 510000;
const int MOD = 1000000007;
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;
}
//階乗
ll kaijo(ll k){
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum *= i;
sum%=1000000000+7;
}
return sum;
}
//for(int i = ; i < ; i++){}
ll lmax(ll s,ll t){
if(s>t){
return s;
}
else{
return t;
}
}
ll lmin(ll s,ll t){
if(s<t){
return s;
}
else{
return t;
}
}
// ここから開始
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
string ans = s.substr(8);
reverse(ans.begin(),ans.end());
cout<<ans<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
ll N;
string A,B,C;
cin >> N >> A >> B >> C;
ll count = 0;
for (int i = 0; i < N; ++i) {
ll tmp = 0;
if(A[i] != B[i]){
tmp++;
}
if(B[i] != C[i]){
tmp++;
}
if(C[i] != A[i]){
tmp++;
}
if(tmp == 2){
count++;
}
if(tmp == 3){
count+=2;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
int main() {
int N; cin >> N;
string A, B, C; cin >> A >> B >> C;
int cnt = 0;
REP(i, N) {
if(A[i] == B[i] && B[i] == C[i]) {
}
else if(A[i] == B[i]) {
cnt++;
}
else if(A[i] == C[i]) {
cnt++;
}
else if(C[i] == B[i]) {
cnt++;
} else {
cnt = cnt + 2;
}
}
cout << cnt << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a>k){
cout << ":(" << endl;
}
else{
cout << "Yay!" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0]=='R'&& s[1]=='R'&&s[2]=='R'){
cout<<"3"<<endl;
}
else if(s[0]!='R'&& s[1]!='R'&&s[2]!='R'){
cout<<"0"<<endl;
}
else if(s[0]=='R'&& s[1]=='R' || s[1]=='R'&&s[2]=='R'){
cout<<"2"<<endl;
}
else{
cout<<"1"<<endl;
}
return 0;
}
| 0 |
#include<cstdio>
int main(){
int n;
bool a,b,c;
char event[20];
scanf("%d", &n);
for(int i=0; i<n; i++){
int score=0;
a=b=c=false;
int out =0;
while(1){
scanf("%s", event);
if(event[1]=='I'){
if(c)score++;
c=b;
b=a;
a=true;
}else if(event[1]=='O'){
score++;
if(a)score++;
if(b)score++;
if(c)score++;
a=b=c=false;
}else out++;
if(out==3){
printf("%d\n", score);
break;
}
}
}
return 0;
}
| #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
#define MAX 9999999
using namespace std;
typedef struct{
int count;
string s="OUT";
}OUT;
typedef struct{
int count;
string s="HOMERUN";
}HOME;
typedef struct{
int count;
string s="HIT";
}HIT;
typedef struct{
int count;
}RUN;
typedef pair<int, int> pii;
int main(){
int n; cin>>n;
int ans=0;
OUT out; HOME home; HIT hit; RUN run;
out.count=0; home.count=0; hit.count=0; run.count=0;
string temp;
while(cin>>temp){
if(temp==home.s){
ans+=run.count+1;
run.count=0;
}
if(temp==hit.s){
run.count++;
if(run.count>3){ans++; run.count-=1;}
}
if(temp==out.s){
out.count++;
if(out.count%3==0){cout<<ans<<endl;ans=0;run.count=0;}
if(out.count==(n*3))return 0;
}
}
} | 1 |
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
const int inf=2e9+5;
const int maxn=100;
typedef vector<int> vi;
typedef long long ll;
#define fi first
#define se second
typedef pair<int,int> P;
int d[maxn+5][maxn+5];
int v,e;
void floyd()
{
for(int k=0;k<v;k++)
{
for(int i=0;i<v;i++)
{
for(int j=0;j<v;j++)
{
if(d[i][k]==inf || d[k][j]==inf) continue;
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
}
int main(void)
{
cin >> v >> e;
for(int i=0;i<maxn+5;i++)
{
for(int j=0;j<maxn+5;j++)
{
if(i==j) d[i][j]=0;
else d[i][j]=inf;
}
}
for(int i=0;i<e;i++)
{
int s,t,cost;
cin >> s >> t >> cost;
d[s][t]=cost;
}
floyd();
bool nega=false;
for(int i=0;i<v;i++)
{
if(d[i][i]<0)
{
nega=true;
}
}
if(nega)
{
cout << "NEGATIVE CYCLE" << endl;
}
else
{
for(int i=0;i<v;i++)
{
for(int j=0;j<v;j++)
{
if(d[i][j]==inf) cout << "INF";
else cout << d[i][j];
if(j!=v-1) cout << ' ';
}
cout << endl;
}
}
}
| #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using s64 = int64_t;
constexpr s64 INF = 1'010'000'000'000'000'000LL;
template<typename T, typename U>
bool chmin(T& xmin, const U& x)
{
if(x < xmin) {
xmin = x;
return true;
}
else {
return false;
}
}
#define FOR(i, start, end) for(s64 i = (start); i < (end); ++i)
#define REP(i, n) FOR(i, 0, n)
s64 N;
s64 M;
vector<vector<s64>> G;
void print_g() {
REP(i, N) {
REP(j, N) {
s64 c = G[i][j];
if(c == INF)
cout << "INF";
else
cout << c;
cout << (j==N-1 ? '\n' : ' ');
}
}
}
void floyd() {
REP(k, N) {
REP(i, N) {
if(G[i][k] == INF) continue;
REP(j, N) {
if(G[k][j] == INF) continue;
chmin(G[i][j], G[i][k] + G[k][j]);
}
}
}
}
void solve() {
floyd();
REP(i, N) {
if(G[i][i] < 0) {
cout << "NEGATIVE CYCLE\n";
return;
}
}
print_g();
}
int main() {
cin >> N;
G.assign(N, vector<s64>(N, INF));
REP(i, N) { G[i][i] = 0; }
cin >> M;
REP(_, M) {
s64 a, b, c; cin >> a >> b >> c;
G[a][b] = c;
}
solve();
return 0;
} | 1 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(b<a){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill((T*)array, (T*)(array+N), val);}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
class debug
{
public:
template<typename T> void vdeb(T vec);
template<typename T1, typename T2> void adeb(T1 *arr, T2 n);
template<typename T> void mdeb(T mp);
};
#endif //INCLUDE_DEBUG_HPP
template<typename T> void debug::vdeb(T vec)
{
cout << "#vector set debug" << endl;
for(auto vv : vec) cout << vv << " ";
cout << endl;
}
template<typename T1, typename T2> void debug::adeb(T1 *arr, T2 n)
{
cout << "#adebug" << endl;
for(int i=0; i<=n; i++) cout << arr[i] << " ";
cout << endl;
}
template<typename T> void debug::mdeb(T mp)
{
cout << "#map pair debug" << endl;
for(auto const& m : mp) cout << m.first sp m.second << endl;
}
debug dbg;
class AThumbnail {
public:
void solve(std::istream& in, std::ostream& out)
{
int n;
in >> n;
double sum = 0.0;
vector<int> a(n);
for(int i=0; i<n; i++){
in >> a[i];
sum += (double)a[i];
}
double ave = sum / (double)n;
int res = 0;
double mi = inf;
for(int i=0; i<n; i++){
double diff = abs(ave - (double)a[i]);
if(diff < mi){
mi = diff;
res = i;
}
}
out << res << endl;
}
};
int main() {
AThumbnail solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
ll n;
cin >> n;
vector<vll> a(n, vll(2));
long double avg = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i][0];
avg += a[i][0];
a[i][1] = i;
}
avg /= n;
ll m = -1;
sort(all(a));
for (ll i = 0; i < n; i++) {
if (a[i][0] == avg) {
cout << a[i][1] << endl;
return 0;
}
if (a[i][0] > avg) {
while (i > 0 && a[i][0] == a[i - 1][0]) i--;
m = i;
break;
}
}
if (m == 0) {
cout << a[m][1] << endl;
return 0;
}
ll x = m - 1;
while (x > 0 && a[x][0] == a[x - 1][0]) x--;
//cout << a[m][0] - avg << " " << avg - a[x][0] << endl;
if (a[m][0] - avg > avg - a[x][0]) cout << a[x][1] << endl;
else if (a[m][0] - avg < avg - a[x][0]) cout << a[m][1] << endl;
else {
cout << min(a[x][1], a[m][1]) << endl;
}
} | 1 |
%:pragma GCC optimize("Ofast")
%:pragma GCC optimize("inline")
#include <bits/stdc++.h>
#define rint register int
#define fo(i, n) for(rint i = 1; i <= (n); i ++)
#define out(x) cerr << #x << " = " << x << "\n"
#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); ++ it)
using namespace std;
// by piano
template<typename tp> inline void read(tp &x) {
x = 0;char c = getchar(); bool f = 0;
for(; c < '0' || c > '9'; f |= (c == '-'), c = getchar());
for(; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar());
if(f) x = -x;
}
#define P pair<int, int>
#define fi first
#define se second
const int N = 633;
vector<P> vec;
int n, d1, d2;
int col1[N][N], col2[N][N], col[N][N];
inline void dfs(int x, int y, int fff) {
if(col[x][y] != -1) return ;
col[x][y] = fff;
for(auto v: vec) {
int dx = x + v.first;
int dy = y + v.second;
if(dx < 0 || dx >= 2 * n || dy < 0 || dy >= 2 * n)
continue;
dfs(dx, dy, fff ^ 1);
}
}
inline void cal(int d) {
vec.clear();
for(int dx = -2 * n + 1; dx < 2 * n; dx ++) {
for(int dy = -2 * n + 1; dy < 2 * n; dy ++) {
if(dx * dx + dy * dy == d)
vec.push_back(P(dx, dy));
}
}
memset(col, -1, sizeof col);
for(int x = 0; x < 2 * n; x ++)
for(int y = 0; y < 2 * n; y ++)
dfs(x, y, 0);
}
main(void) {
read(n); read(d1); read(d2);
cal(d1); memcpy(col1, col, sizeof col);
cal(d2); memcpy(col2, col, sizeof col);
for(int k1 = 0; k1 < 2; k1 ++) {
for(int k2 = 0; k2 < 2; k2 ++) {
int cnt = 0;
for(int x = 0; x < 2 * n; x ++) {
for(int y = 0; y < 2 * n; y ++)
if(col1[x][y] == k1 && col2[x][y] == k2)
++ cnt;
}
if(cnt >= n * n) {
int res = n * n;
for(int x = 0; x < 2 * n; x ++)
for(int y = 0; y < 2 * n; y ++)
if(col1[x][y] == k1 && col2[x][y] == k2) {
-- res;
cout << x << " " << y << "\n";
if(res == 0) return 0;
}
}
}
}
}
| #include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#include <iomanip>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n'
#define debugArrayP(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i].first<< " " << x[i].second << '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef vector<int> vint;
typedef vector<ll> vll;
const ll INF = INT_MAX;
const ll MOD = 1e9+7;
int fld[700][700];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,D[2];cin>>N>>D[0]>>D[1];
int d[2]={0,0};
repeat(k,2){
while(!(D[k]&1)){
d[k]++;
D[k]/=2;
}
D[k]<<=d[k];
}
//debugArray(d,2);
vector<Pii> ans;
repeat(i,2*N){
repeat(j,2*N){
bool isok=true;
repeat(k,2){
if(d[k]&1){
isok &= !((i/(1<<((d[k]-1)/2)))&1);
}else{
isok &= !((i/(1<<(d[k]/2))+j/(1<<(d[k]/2)))&1);
}
}
if(isok){
fld[i][j]=1;
ans.push_back({i,j});
}
}
}
/*
if(ans.size()<N*N){
cerr<<"!!!!!!!"<<endl;
return 0;
}
*/
/*
repeat(i,2*N){
repeat(j,2*N){
cerr<<fld[i][j];
}
cerr<<endl;
}
*/
repeat(i,N*N){
cout << ans[i].first<<" "<<ans[i].second<<endl;
}
return 0;
}
| 1 |
#include<iostream>
using namespace std;
int main(){
int n,a;
long long sum=0;
int max=-1000000;
int min=1000000;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a;
if(a>max){
max=a;
}
if(a<min){
min=a;
}
sum+=a;
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " << __LINE__ \
<< ": "; _db(#__VA_ARGS__, __VA_ARGS__);})
#define RNG() rng()
#else
#define db(...) true
#define RNG() true
#endif
template<class T>
void _db(const char *dbStr, T e) {
cout << dbStr << " = " << e << endl;
}
template<class T, class... L>
void _db(const char *dbStr, T e, L... r) {
while(*dbStr != ',') cout << *dbStr++;
cout << " = " << e << ','; _db(dbStr + 1, r...);
}
template<class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
o << "["; int i = 0;
for (const pair<S, T>& pr : v) o << (!i++ ? "" : ", ") << "{"
<< pr.fs << " : " << pr.sc << "}"; return o << "]";
}
template<template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
o << "["; int i = 0;
for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
return o << "]";
}
template<class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
return o << "(" << pr.fs << ", " << pr.sc << ")";
}
ostream& operator<<(ostream& o, const string& s) {
for (const char& c : s) o << c;
return o;
}
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
int main() {
#ifdef LOCAL
auto stTime = clock();
// freopen("in.txt", "r", stdin);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif
ios::sync_with_stdio(false);
cout.precision(10);
cin.tie(0);
ll K;
cin >> K;
cout << "50\n";
V<ll> ans(50, 0);
for (int i = 0; i < 50; ++i) {
ans[i] = i + (K / 50);
}
for (int i = 50 - (K % 50); i < 50; ++i) {
++ans[i];
}
for (int i = 0; i < 50; ++i) {
cout << ans[i] << " \n"[i + 1 == 50];
}
#ifdef LOCAL
cout << "\n\n\nExecution time: " <<
(clock() - stTime) * 1e3 / CLOCKS_PER_SEC << " ms" << endl;
#endif
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
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; }
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
using que_a = priority_queue<int, vector<int>, greater<int> >;
using que_d = priority_queue<int>;
using pint = pair<int,int>;
int main(){
int n; cin >> n;
int k; cin >> k;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
sort(all(a));
if(a.at(n-1) < k){
cout << "IMPOSSIBLE" << endl;
return 0;
}
int temp = a.at(0);
rep(i,n-1){
temp = __gcd(temp,a.at(i+1));
if(temp == 1){
cout << "POSSIBLE" << endl;
return 0;
}
}
if(k%temp == 0){
cout << "POSSIBLE" << endl;
return 0;
}
else{
cout << "IMPOSSIBLE" << endl;
return 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m);
int odd = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
odd += a[i] & 1;
}
if (odd > 2) {
cout << "Impossible\n";
return 0;
}
for (int i = 0; i < m && odd > 0; i++) {
if (a[i] & 1) {
swap(a[i], a[0]);
odd--;
break;
}
}
for (int i = m - 1; i >= 0 && odd > 0; i--) {
if (a[i] & 1) {
swap(a[i], a[m - 1]);
odd--;
break;
}
}
for (int i = 0; i < m; i++) {
cout << a[i] << ' ';
}
cout << '\n';
vector<int> b;
for (int i = 0; i < m; i++) {
b.push_back(a[i] + (i == 0 ? -1 : (i == m - 1 ? 1 : 0)));
}
if (m == 1) {
b.push_back(1);
}
cout << (int) b.size() - (b[0] == 0) << '\n';
for (int i = (b[0] == 0); i < (int) b.size(); i++) {
cout << b[i] << ' ';
}
cout << '\n';
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll N;
cin >> N;
ll sqrN = sqrt(N);
for (ll i = sqrN; i >= 1; i--) {
if (N % i == 0) {
ll a = N / i;
string sa = to_string(a);
cout << sa.size() << endl;
return 0;
}
}
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll F(ll A, ll B){
string bufA = to_string(A), bufB = to_string(B);
return max(bufA.size(), bufB.size());
}
int main(){
ll N;
ll ans = to_string(N).size();
cin >> N;
for(ll i = 1; i <= sqrt(N); ++i){
if(N % i == 0) ans = min(ans, F(i, N/i));
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;
template <typename T, typename L>
void readVector(vector<T> & _data, L & _size, bool _shift) {
_data.resize(_size + (ll)_shift);
for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
cin >> _data[i];
}
template <typename T, typename L>
void readMatrix(vector<vector<T>> & _data, L & _rows, L & _cols, bool _shiftRows, bool _shiftCols) {
_data.resize(_rows + (ll)_shiftRows);
for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
_data[i].resize(_cols + (ll)_shiftCols);
for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
cin >> _data[i][j];
}
//TODO: SOLUTION
ll n;
vll a, pre, f, g;
void computeG() {
ll j = n - 2;
g[n - 1] = n;
while (j >= 1) {
int k = g[j + 1];
while (abs(pre[n] - (2*pre[k - 1]) + pre[j - 1]) > abs(pre[n] - (2*pre[k - 2]) + pre[j - 1]))
k--;
g[j] = k;
j--;
}
}
void computeF() {
ll j = 3;
f[2] = 1;
while (j <= n) {
int k = f[j - 1];
while (abs(pre[j] - (2*pre[k])) > abs(pre[j] - (2*pre[k + 1])))
k++;
f[j] = k;
j++;
}
}
void solve() {
cin >> n;
readVector(a, n, 1);
pre.resize(n + 1, 0);
repi(i, 1, n) {
pre[i] = pre[i - 1] + a[i];
}
f.resize(n + 1);
g.resize(n + 1);
computeF();
computeG();
ll ans = INF;
repi(i, 2, n - 2) {
ans = min(ans, max(max(max(pre[f[i]], pre[i] - pre[f[i]]), pre[n] - pre[g[i + 1] - 1]), pre[g[i + 1] - 1] - pre[i])
-min(min(min(pre[f[i]], pre[i] - pre[f[i]]), pre[n] - pre[g[i + 1] - 1]), pre[g[i + 1] - 1] - pre[i]));
}
cout << ans << endl;
}
int main() {
// TODO: Set value of this variable manually
bool _multipleTestCases = false;
if (_multipleTestCases) {
ll t; cin >> t;
while (t--)
solve();
}
else {
solve();
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define FOR(i,n,m) for(int i=n; i<(int)m; i++)
#define ROF(i,n,m) for(int i=n; i>(int)m; i--)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define ri(a) scanf("%d",&a)
#define rii(a,b) ri(a),ri(b)
#define riii(a,b,c) rii(a,b),ri(c)
#define lri(a) scanf("%lld",&a)
#define lrii(a,b) lri(a),lri(b)
#define ms(obj,val) memset(obj,val,sizeof(obj))
#define all(x) x.begin(),x.end()
#define debug true
#define dprintf debug && printf
const int INF = 0x3f3f3f3f;
const ll INFLL = 1e18;
const int MOD = 1e9+7;
const int MAXN = 2e5+5;
ll pref[MAXN];
int n;
ll sum(int l, int r){
if(l > r) return 0;
return pref[r] - (l == 0 ? 0 : pref[l-1]);
}
ll dif(int l, int r, int m){
return abs(sum(l, m-1) - sum(m, r));
}
void mxze(ll &a, ll b){
a = max(a,b);
}
void mnze(ll &a, ll b){
a = min(a,b);
}
ll result(int m1, int m, int m2){
ll mx = sum(0,m1-1);
mxze(mx, sum(m1,m-1));
mxze(mx, sum(m,m2-1));
mxze(mx, sum(m2,n-1));
ll mn = sum(0,m1-1);
mnze(mn, sum(m1,m-1));
mnze(mn, sum(m,m2-1));
mnze(mn, sum(m2,n-1));
return mx - mn;
}
bool check(int l, int r, int m){
return dif(l, r, m) > dif(l,r,m+1);
}
int findBest(int l, int r){
int lo = l + 1, hi = r;
while(lo < hi){
int mid = (lo + hi)>>1;
if(check(l, r, mid)) lo = mid + 1;
else hi = mid;
}
return hi;
}
int main(){
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
ri(n);
FOR(i,0,n) lri(pref[i]);
FOR(i,1,n) pref[i] += pref[i-1];
ll ans = INFLL;
FOR(m,2,n-1){
mnze(ans, result(findBest(0,m-1), m, findBest(m, n-1)));
}
printf("%lld\n", ans);
return 0;
}
| 1 |
/* BISMILLAHIR RAHMANIR RAHIM */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100005
#define maxn 200002
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 1000000000
#define MOD 1000000007
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int main ()
{
ios::sync_with_stdio(0);
cin.tie(0);
//CODE TONOY
int N, p[1001]{};
cin >> N;
for (int i = 2; i <= N; ++i) {
int I = i;
for (int j = 2, n = sqrt(I) + 1; I != 1 && j != n; ++j) {
while (I % j == 0) {
I /= j;
++p[j];
}
}
if (I != 1) ++p[I];
}
cout << accumulate(begin(p), end(p), 1ll, [&](ll a, ll x)
{
return a * (x + 1) % MOD;
}) << endl;
return 0;
}
| #include <string>
#include <iostream>
using namespace std;
int n;
string s;
bool match(int index, string pattern) {
if (index + pattern.size() > s.size()) return false;
for (int i = 0; i < pattern.size(); i++) {
if (s[index + i] != pattern[i])
return false;
}
return true;
}
int change() {
string after = "Hoshina", before = "Hoshino";
for (int i = 0; i < s.size(); i++) {
if (match(i, before)) {
for (int j = 0; j < before.size(); j++) {
s[i + j] = after[j];
}
}
}
return 0;
}
int main(){
cin >> n;
cin.ignore();
for (int i = 0; i < n; i++) {
getline(cin, s);
change();
cout << s << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
int n; cin >> n;
string s, t; cin >> s >> t;
if(s == t) {
cout << n << endl;
return 0;
}
int ans = n * 2;
for(int i = 0; i < n; i++){
string tmpt = t.substr(0, i);
string tmps = s.substr(n - i, i);
if(tmpt == tmps) ans -= tmpt.size();
}
cout << ans << endl;
return 0;
}
| //Let's join Kaede Takagaki Fun Club !!
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
rep(i,a.size()) cout << a[i] << " ";
cout << endl;
}
template<class T>
bool chmax(T&a, T b){
if(a < b){
a = b;
return 1;
}
return 0;
}
template<class T>
bool chmin(T&a, T b){
if(a > b){
a = b;
return 1;
}
return 0;
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
ll mod;
template<class T>
void add(T&a,T b){
a+=b;
if(a >= mod) a-=mod;
}
ll dp[6005][9005];
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
ll F[10005],R[10005];
ll rev2[10005];
ll rev3[10005];
void make(){
F[0] = 1;
for(int i=1;i<10005;i++) F[i] = F[i-1]*i%mod;
for(int i=0;i<10005;i++) R[i] = modpow(F[i],mod-2);
for(int i=0;i<10005;i++) {
rev2[i] = modpow(modpow(2LL,i),mod-2);
rev3[i] = modpow(modpow(3LL,i),mod-2);
}
}
ll C(int a,int b){
return F[a]*R[b]%mod*R[a-b]%mod;
}
int main(){
int n, m; g(n); g(m);
mod = m;
make();
ll ans = 0;
for(int one=0;one<=3*n;one++){
for(int two=0;two<=one;two++){
int zan = 3*n-one-two-two;
if(zan >= 0 && zan%3 == 0){
int thr = zan / 3;
add(ans, C(3*n, one) * C(3*n-one, two*2) % mod * F[two*2] % mod * R[two] % mod * rev2[two] % mod * F[thr*3] % mod * R[thr] % mod * rev3[thr] % mod);
}
//o(one,1); o(two,1); o(ans);
}
}
o(ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110000;
vector<int> con[N];
int vis[N];
bool dfs(int u, int col) {
vis[u] = col;
for (int v : con[u]) {
if (vis[v] && 3 - col != vis[v]) return false;
if (!vis[v] && !dfs(v, 3 - col)) return false;
}
return true;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
con[u].push_back(v), con[v].push_back(u);
}
if (!dfs(1, 1)) cout << (long long)n * (n - 1) / 2 - m << "\n";
else {
int cnt = 0;
for (int i = 1; i <= n; i++) cnt += vis[i] == 1;
cout << (long long)cnt * (n - cnt) - m << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
std::istream &operator>>(std::istream &in, set<ll> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
//ifstream myfile("C:\\Users\\riku\\Downloads\\0_00.txt");
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
//const ll mod = 1e10;
//typedef priority_queue<P, vector<P>, greater<P> > PQ_ASK;
vector<ll> bfs(int n, vector<vector<int>> &g) {
vector<ll> costs(n, INF);
costs[0] = 0;
queue<int> q;
q.push(0);
while (!q.empty()) {
int from = q.front();
q.pop();
for (int to : g[from]) {
if (costs[to] != INF) continue;
costs[to] = costs[from] + 1;
q.push(to);
}
}
return costs;
}
bool bfs2(int n, vector<vector<int>> &g) {
vector<ll> costs(n, INF);
costs[0] = 0;
queue<int> q;
q.push(0);
while (!q.empty()) {
int from = q.front();
q.pop();
for (int to : g[from]) {
ll current_cost = costs[to];
ll next_cost = costs[from] + 1;
if (current_cost != INF) {
if (current_cost % 2 != next_cost % 2) return false;
continue;
}
costs[to] = next_cost;
q.push(to);
}
}
return true;
}
int main() {
int n, m;
cin >> n >> m;
vector<P> v(m);
for (P &p : v) cin >> p.first >> p.second, p.first--, p.second--;
vector<vector<int>> g(n);
for (P p: v) g[p.first].push_back(p.second);
for (P p: v) g[p.second].push_back(p.first);
vector<ll> costs = bfs(n, g);
bool is_2 = bfs2(n, g);
if (is_2) {
ll a = 0;
for (ll c : costs) if (c % 2 == 0) a++;
ll b = n - a;
ll all = a * b;
ll ans = all - m;
cout << ans << endl;
ret();
}
ll all = ll(n) * (n - 1) / 2;
ll ans = all - m;
cout << ans << endl;
} | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
//AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC
int main(){
vector<lint> zero(60);
vector<lint> one(60);
int n;cin>>n;
lint x,tmp,ans=0;
for(int i=0;i<n;i++){
cin>>x;
for(int j=0;j<60;j++){
tmp=x%2;
if(tmp==0)zero[j]++;
else one[j]++;
x/=2;
}
}
const int mod=1000000007;
tmp=1;
for(int i=0;i<60;i++){
ans+=(zero[i]*one[i]%mod)*tmp;
ans%=mod;
tmp=tmp*2%mod;
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int n, a[4][maxn + 5], p[maxn + 5], num[2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= 3; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", &a[i][j]);
if (i == 2) {
p[j] = (a[i][j] + 1) / 3;
}
}
}
for (int i = 1; i <= n; i++) {
if (abs(a[1][i] - a[3][i]) != 2 || abs(a[1][i] - a[2][i]) != 1 || abs(a[2][i] - a[3][i]) != 1) {
puts("No");
return 0;
}
if (p[i] % 2 != i % 2) {
puts("No");
return 0;
}
int mn = min(a[1][i], a[3][i]), mx = max(a[1][i], a[3][i]);
if (mx % 3 != 0 || mn % 3 != 1) {
puts("No");
return 0;
}
if (a[1][i] % 3 == 0) {
num[i & 1]++;
}
}
for (int i = 1; i <= n; i++) {
while (p[i] != i) {
num[!(i & 1)]++; swap(p[i], p[p[i]]);
}
}
if ((num[0] & 1) or (num[1] & 1)) puts("No");
else puts("Yes");
return 0;
} | 0 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) (((x) < 0)?-(x):(x))
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge
using cat = long long;
#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif
cat pw(cat a, cat e, cat mod) {
if(e <= 0) return 1;
cat x = pw(a, e/2, mod);
x = x * x % mod;
if(e&1) x = x * a % mod;
return x;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int N, M;
cin >> N >> M;
cat tot = 1, dif = 0, fac_inv = 1, mod = 998244353;
for(int i = 1; i < N; i++) {
tot = tot * (3*M+i) % mod;
fac_inv = fac_inv * i % mod;
}
vector<cat> prod_m1(N+3*M+1, 0), prod_m2(N+3*M+1, 0);
prod_m1[0] = fac_inv;
prod_m2[0] = fac_inv * pw(N-1, mod-2, mod) % mod;
for(int i = 0; i < M; i++) {
prod_m1[i+1] = prod_m1[i] * (i+N) % mod * pw(i+1, mod-2, mod) % mod;
prod_m2[i+1] = prod_m2[i] * (i+N-1) % mod * pw(i+1, mod-2, mod) % mod;
}
for(int i = 0; i < M; i++) dif = (dif + prod_m2[i]) % mod;
dif = dif * N % mod * (N-1) % mod;
vector<cat> C(N+1, 0); // C(N, i)
C[0] = 1;
for(int i = 1; i <= N; i++) C[i] = C[i-1] * pw(i, mod-2, mod) % mod * (N-i+1) % mod;
for(int i = M+1; i <= min(3*M, N); i++) if((M-i)%2 == 0)
dif = (dif + prod_m1[(3*M-i)/2] * C[i]) % mod;
cat ans = (tot - dif) * pw(fac_inv, mod-2, mod) % mod;
if(ans < 0) ans += mod;
cout << ans << "\n";
return 0;
}
// look at my code
// my code is amazing
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i <= (int)(n); i++)
int main() {
int A, B;
cin >> A >> B;
int Xa, Xb, Xc;
int co = 0;
rep2(i, A, B) {
Xa = i % 10;
Xb = (i - Xa) % 100 / 10;
Xc = (i - Xa - Xb*10) % 1000 / 100;
if(Xa * 10001 + Xb * 1010 + Xc * 100 == i) {
co++;
}
}
cout << co << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
const int N=500;
bool isprime[1000010];
vector<ll> ps;
ll res[N][N];
int di[]={-1,0,1,0};
int dj[]={0,1,0,-1};
ll lcm(ll a,ll b){
return (a/__gcd(a,b))*b;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
repl(i,2,1000000)isprime[i]=true;
repl(i,2,1000000){
if(isprime[i]){
ps.push_back(i);
for(ll j=i*2;j<1000000;j+=i)isprime[j]=false;
}
}
while(ps.size()>1000)ps.pop_back();
rep(i,N)rep(j,N)res[i][j]=1;
for(ll s=0;s<2*N-1;s+=2){
rep(i,N){
ll j=s-i;
if(j>=N||j<0)continue;
res[i][j]*=ps[s/2];
}
rep(i,N){
ll s2=s-N+2;
ll j=i-s2;
if(j>=N||j<0)continue;
res[i][j]*=ps[N+(s/2)];
}
}
rep(i,N)rep(j,N){
if(res[i][j]==1){
ll lc=1;
rep(dir,4){
int ni=i+di[dir],nj=j+dj[dir];
if(ni<0||ni>=N||nj<0||nj>=N)continue;
lc=lcm(lc,res[ni][nj]);
}
res[i][j]=lc+1;
}
}
int n;
cin>>n;
rep(i,n){
rep(j,n){
cout<<res[i][j]<<" ";
}
cout<<endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int n, cnt = 2;
long long res[507][507];
map<int, int>a, b;
int nxt()
{
while (1)
{
bool ok = 1;
for (int i = 2; i * i <= cnt && ok; i++)
if (cnt % i == 0)ok = 0;
if (ok)return cnt++;
cnt++;
}
return 0;
}
long long gcd(long long a, long long b)
{
if (!b)return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b)
{
if (!a || !b)return 0;
return a / gcd(a, b) * b;
}
int main()
{
cin >> n;
if (n == 2) {
printf("4 7\n23 10\n");
return 0;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
res[i][j] = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (((i + j) & 1) && !a[i + j])
a[i + j] = nxt();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (((i + j) & 1) && !b[i - j])
b[i - j] = nxt();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if ((i + j) & 1)
{
res[i][j] = 1LL * a[i + j] * b[i - j];
res[i - 1][j] = lcm(res[i - 1][j], res[i][j]);
res[i][j - 1] = lcm(res[i][j - 1], res[i][j]);
res[i + 1][j] = lcm(res[i + 1][j], res[i][j]);
res[i][j + 1] = lcm(res[i][j + 1], res[i][j]);
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (!((i + j) & 1))
res[i][j]++;
for (int i = 1; i <= n; i++, putchar('\n'))
for (int j = 1; j <= n; j++)
printf("%lld ", res[i][j]);
return 0;
} | 1 |
#include <cstdio>
double l[10],v1,v2;
int main(){
while(~scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf",l,l+1,l+2,l+3,l+4,l+5,l+6,l+7,l+8,l+9,&v1,&v2)){
double p=0;
for(int i=0; i<10; i++) p+=l[i];
p=p*v1/(v1+v2);
for(int i=0; i<10; i++){
if(p>l[i]) p-=l[i];
else{
printf("%d\n",i+1);
break;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1000000007;
int main(){
ll x;
cin >> x;
ll n = x / 11;
n *= 2;
ll m = x % 11;
if (m > 6) {
n += 2;
}
if(m > 0 && m <= 6) {
n++;
}
cout << n << endl;
} | 0 |
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define N 1100005
using namespace std;
typedef long long ll;
ll n, ans, kac, a[N], pre[N], dp[N], fen[N], of[N];
vector < int > g[N];
ll fe(ll a, ll us){
if(us <= 1)
return (us)?a:1ll;
ll t = fe(a, us/2);
return (us&1)?(t*t%mod)*a%mod : t*t%mod;
}
void up(int x, int y){
for(; x < N; x += x&-x)
fen[x] += y;
}
int qu(int x){
int ans = 0;
for(; x > 0; x -= x&-x)
ans += fen[x];
return ans;
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%lld",&n);
for(int i = 1; i <= n; i++){
scanf("%lld",a + i);
pre[i] = pre[i - 1]^a[i];
g[pre[i]].pb(i);
if(!pre[i])
up(i, 1);
}
if(pre[n] != 0){
ll sif = 1;
ll bir = 0;
for(int i = 1; i <= n; i++){
if(pre[i] == pre[n])
bir = (bir + sif)%mod;
else if(pre[i] == 0)
sif = (sif + bir)%mod;
}
printf("%lld\n", sif);
return 0;
}
kac = (int)g[pre[n]].size();
ans = (ans + fe(2, kac - 1))%mod;
// cout << ans << endl;
for(int i = 1; i < N; i++){
if(g[i].empty())
continue;
int u = (int)g[i].size(), ek = 1;
of[0] = dp[0] = 1;
// cout << i << " " << u << endl << " -> " << g[i][0] << " ";
for(int j = 1; j < u; j++){
int ara = qu(g[i][j]) - qu(g[i][j - 1]);
dp[j] = (dp[j - 1] - 1 + of[j - 1]*ara%mod + 1)%mod;
of[j] = (of[j - 1] + dp[j])%mod;
// cout << "(" << ara << ") " << g[i][j] << " - " << dp[j] << " ";
}
ans = (ans + of[u - 1])%mod;
// cout << " = " << of[u - 1] << endl;
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
const int INF=1e9,MOD=1e9+7;
const long long LINF=1e18;
using namespace std;
#define int long long
//template
std::vector<int> dpa(1234567,0),dpb(1234567,1),memo(1234567,0);
int pw(int n,int k){
int res=1;
while(k){
if(k&1)res*=n;res%=MOD;
n*=n;n%=MOD;
k>>=1;
}
return res;
}
//main
signed main(){
int N;cin>>N;
std::vector<int> v(N);
for(int i=0;i<N;i++)cin>>v[i];
int now=0,zco=0;
for(int i=0;i<N;i++){
now^=v[i];
if(now==0)zco++;
else{
dpb[now]+=dpa[now]*(zco-memo[now]);dpb[now]%=MOD;
dpa[now]+=dpb[now];dpa[now]%=MOD;
memo[now]=zco;
}
}
if(now)cout<<dpb[now]<<endl;
else{
int ans=0;
for(int i=0;i<1234567;i++)ans+=dpa[i];
cout<<(ans+pw(2,zco-1))%MOD<<endl;
}
}
| 1 |
//#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;
cin >> n;
ll x = 1;
while(x*x<=n){
x++;
}
cout << (x-1)*(x-1) << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int N;
cin>>N;
for(int i=40000;i>=1;i--)
{
if(i*i<=N)
{
cout<<i*i<<endl;
break;
}
}
}
| 1 |
// Problem : A - Painting
// Contest : AtCoder - Keyence Programming Contest 2020
// URL : https://atcoder.jp/contests/keyence2020/tasks/keyence2020_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//Macros
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
//Solution
void solve(){
int n,m,x;
cin>>n>>m>>x;
if(n < m) swap(n,m);
cout<<(n+x-1)/n<<endl;
}
signed main(){
io;
//freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
int tests;
//cin>>tests;
tests = 1;
while(tests--){
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define PRINT(a) cout << (a) << endl
#define RALL(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';
using ll = long long int;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
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; }
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
int main(){
double n, m, d;
cin >> n >> m >> d;
double ans;
if(d==0){
ans = (m-1)/n;
}else{
ans = 2*(n-d)/(n*n) * (m-1);
}
printf("%0.10f\n",ans);
}
| 0 |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI=acos(-1.0);
#define t1(x) cerr<<#x<<"="<<x<<endl
#define t2(x, y) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl
#define t3(x, y, z) cerr<<#x<<"=" <<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<endl
#define t4(a,b,c,d) cerr<<#a<<"="<<a<<" "<<#b<<"="<<b<<" "<<#c<<"="<<c<<" "<<#d<<"="<<d<<endl
#define t5(a,b,c,d,e) cerr<<#a<<"="<<a<<" "<<#b<<"="<<b<<" "<<#c<<"="<<c<<" "<<#d<<"="<<d<<" "<<#e<<"="<<e<<endl
#define t6(a,b,c,d,e,f) cerr<<#a<<"="<<a<<" "<<#b<<"="<<b<<" "<<#c<<"="<<c<<" "<<#d<<"="<<d<<" "<<#e<<"="<<e<<" "<<#f<<"="<<f<<endl
#define GET_MACRO(_1,_2,_3,_4,_5,_6,NAME,...) NAME
#define t(...) GET_MACRO(__VA_ARGS__,t6,t5, t4, t3, t2, t1)(__VA_ARGS__)
#define __ freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define fastio() ios::sync_with_stdio(0);cin.tie(0)
#define MEMS(x,t) memset(x,t,sizeof(x));
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*-------------------------------------------------------------------------------------------------------------------------------------*/
// #define MOD 1000000007
#define endl "\n"
#define int long long
#define inf 1e18
#define ld long double
/*-------------------------------------------------------------------------------------------------------------------------------------*/
int dp[6005][12005];
int n,MOD;
int rec(int ind,int balance)
{
if(ind==0)
{
return (balance>=0 && balance%3==0);
}
int &ans=dp[ind][balance+3*n];
if(ans>=0)return ans;
ans=rec(ind-1,balance+1);
if(ind>1)
ans+=(ind-1)*rec(ind-2,balance-1);
if(ind>2)
ans+=(ind-1)*(ind-2)*rec(ind-3,balance);
ans%=MOD;
return ans;
}
int32_t main()
{
fastio();
cin>>n>>MOD;
MEMS(dp,-1);
cout<<rec(3*n,0)<<endl;
}
| #include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define re register
#define LL long long
// #define MOD 1000000007
#define MAXN 6005
using namespace std;
const int ST=6002;
LL n,ans,MOD,dp[MAXN][MAXN<<1];
LL rd(){
LL x=0,tp=1;char c;c=getchar();
while(c<'0' || c>'9'){if(c=='-')tp=-1;c=getchar();}
while(c>='0' && c<='9'){x=(x*10+c-'0');c=getchar();}
return x*tp;
}
int add(int a,int b){return (a+b>=MOD)?(a+b-MOD):a+b;}
int main(){
// freopen("testdata.in","r",stdin);
// freopen("shit.out","w",stdout);
n=rd()*3,MOD=rd();
dp[0][ST]=1;
for(int i=0;i<n;i++){
for(int j=-i;j<=i;j++){
dp[i+1][ST+j+1]=add(dp[i+1][ST+j+1],dp[i][ST+j]);
dp[i+2][ST+j-1]=add(dp[i+2][ST+j-1],dp[i][ST+j]*(i+1)%MOD);
dp[i+3][ST+j]=add(dp[i+3][ST+j],dp[i][ST+j]*(i+1)%MOD*(i+2)%MOD);
}
}
for(int i=0;i<=n;i++)ans=add(ans,dp[n][ST+i]);
printf("%lld\n",ans);
// printf("%.2lf\n",(double)clock()/CLOCKS_PER_SEC);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
string ans;
int L = A + B, R = C + D;
if (L > R) {
ans = "Left";
} else if (L == R) {
ans = "Balanced";
} else {
ans = "Right";
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a=-2,b;
cin>>n;b=n;
string s;
while(n!=0){
if((n%a)<0){s+=(2+(n%a))+'0';n/=a;n+=1;}
else {s+=(n%a)+'0';n/=a;}
}
reverse(s.begin(),s.end());
if(b!=0)cout<<s<<endl;
else cout<<0<<endl;
}
| 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
rep(i,(1<<3)){
int num = (s[0] - '0');
rep(j,3){
if(i>>j & 1){
num += (s[j+1] - '0');
}
else{
num -= (s[j+1] - '0');
}
}
if(num == 7){
cout << s[0] << ((i>>0 & 1) ? "+" : "-");
cout << s[1] << ((i>>1 & 1) ? "+" : "-");
cout << s[2] << ((i>>2 & 1) ? "+" : "-");
cout << s[3] << "=7" << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
pair<int, int>,
null_type,
less_equal<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define double long double
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define lb(v, z) lower_bound(all(v), z)
#define ub(v, z) upper_bound(all(v), z)
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define rdp(i, a, b) for (int i = (a); i >= (b); i--)
#define rlt(i, a, b) for (int i = (a); i < (b); i++)
#define cns(z) cout << (z) << ' '
#define cnl(z) cout << (z) << '\n'
#define M1 1000000007
#define M2 998244353
#define MAXN 300005
#define INF (1ll << 60)
#define endl "\n"
#define garr(ip) \
for (auto &x : ip) \
cin >> x;
#define parr(ip) \
for (auto &x : ip) \
cout << x << " "; \
cout << endl;
#define nl cout << endl
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vp;
void solve(int testCaseNumber = 1)
{
int n;
cin >> n;
int ans = (n / 500) * 1000;
n %= 500;
ans += (n / 5) * 5;
cnl(ans);
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
} | 0 |
#include<iostream>
using namespace std;
int s[10004];
int cnt,n;
void find(int s[],int num)
{
for(int i=0;i<n;i++)
{
if(s[i]==num)
{
cnt++;
break;
}
}
}
int main()
{
cin>>n;
for(int k=0;k<n;k++)
{
cin>>s[k];
}
int q;
cin>>q;
while(q--)
{
int nn;
cin>>nn;
find(s,nn);
}
cout<<cnt<<endl;
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n ;
vector<int> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
}
long long int sum=0;
for (int i = 0; i < n; i++){
sum += a[i];
}
long long int min = *min_element(a.begin(), a.end());
long long int max = *max_element(a.begin(), a.end());
printf("%ld %ld %lld\n", min, max, sum);
}
| 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdint>
using Int = std::int64_t;
constexpr Int MOD = 1e9 + 7;
int main() {
Int N, X;
std::cin >> N >> X;
std::vector<Int> S(N);
for (auto&& e : S)
std::cin >> e;
std::sort(S.begin(), S.end());
// dp[i][x] := 最初が x のときに i 個目まで見たときの総和
std::vector<std::vector<Int>> dp(N + 1, std::vector<Int>(X + 1));
for (Int x = 0; x < X + 1; ++x)
dp[0][x] = x;
for (Int i = 1; i < N + 1; ++i) {
for (Int x = 0; x < X + 1; ++x) {
// 前に挿入
dp[i][x] += dp[i - 1][x % S[i - 1]];
dp[i][x] %= MOD;
// 後ろに挿入
dp[i][x] += (i - 1) * dp[i - 1][x];
dp[i][x] %= MOD;
}
}
std::cout << dp[N][X] << std::endl;
} | #include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define LL long long
#define MAXN 210
#define MAXS 100010
#define mod 1000000007
using namespace std;
int n, x, w[MAXN];
int f[MAXN][MAXS];
template <typename T> void chkmin(T &x, T y){x = min(x, y);}
template <typename T> void chkmax(T &x, T y){x = max(x, y);}
template <typename T> void read(T &x){
x = 0; int f = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
x *= f;
}
void update(int &x, const int &y){x = (x + y >= mod) ? (x + y - mod) : (x + y);}
int mul(const int &x, const int &y){return 1ll * x * y % mod;}
int inc(const int &x, const int &y){return (x + y >= mod) ? (x + y - mod) : (x + y);}
int main(){
read(n), read(x);
for (int i = 1; i <= n; ++i)
read(w[i]);
sort(w + 1, w + 1 + n);
for (int i = 0; i <= x; ++i)
f[0][i] = i;
for (int i = 1; i <= n; ++i)
for (int j = 0; j <= x; ++j){
if (!f[i - 1][j]) continue;
update(f[i][j], mul(f[i - 1][j], i - 1));
if (w[i] > j) {
for (int t = 0; j + t <= x; t += w[i])
update(f[i][j + t], f[i - 1][j]);
}
}
printf("%d\n", f[n][x]);
return 0;
} | 1 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int EditDistance(string s1,string s2){
int n=s1.size();
int m=s2.size();
int dp[n+1][m+1];
for(int i=0;i<n+1;i++){
dp[i][0]=i;
}
for (int j=0;j<m+1;j++){
dp[0][j]=j;
}
for (int i=1;i<n+1;i++){
for (int j=1;j<m+1;j++){
if(s1[i-1]==s2[j-1]){
dp[i][j]=min( min(dp[i-1][j] +1, dp[i][j-1]+1) , dp[i-1][j-1]);
}else{
dp[i][j]=min( min(dp[i-1][j] +1, dp[i][j-1]+1) , dp[i-1][j-1]+1);
}
}
}
return dp[n][m];
}
int main(){
string s1,s2;
cin >> s1 >> s2;
cout << EditDistance(s1,s2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int a, b;
cin >> a >> b;
int ans = 0;
forn(i, a, b+1) {
string s = to_string(i);
string r = s;
reverse(r.begin(), r.end());
ans += s==r;
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0)
#define maxn 100010
#define int ll
int N,L,Q;
int A[maxn];
vi adj[maxn];
int twok[maxn][100],depth[maxn];
void twokdecomp(int x,int p){
twok[x][0] = p;
for (int i=1;i<=18;i++){ //i <= logmaxn
if (twok[x][i-1] == -1) break;
twok[x][i] = twok[twok[x][i-1]][i-1];
}
for (auto i: adj[x]){
if (i != p){
depth[i] = depth[x] + 1;
twokdecomp(i,x);
}
}
}
int kth_parent(int x,int k){
for (int i=0;i<=18;i++){
if (k&(1<<i)){
x = twok[x][i];
}
if (x==-1) break;
}
return x;
}
int32_t main(){
fast;
cin>>N;
FOR(i,1,N) cin>>A[i];
cin>>L>>Q;
FOR(i,1,N-1){
int idx = upper_bound(A+1,A+N+1,A[i] + L) - A;
idx--;
if (i == idx) continue;
adj[i].pb(idx);
adj[idx].pb(i);
}
mem(twok,-1);
twokdecomp(N,-1);
FOR(i,0,Q-1){
int a,b; cin>>a>>b;
if (a > b) swap(a,b);
int l=0,r=depth[a]+10;
while (l + 1 < r){
int mid = (l+r)/2;
//cout<<mid<<' '<<kth_parent(a,mid)<<'\n';
if (kth_parent(a,mid) == -1) r = mid;
else if (kth_parent(a,mid) > b) r = mid;
else l = mid;
}
while (kth_parent(a,l) < b){
l++;
}
cout<<l<<'\n';
}
}
| #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1000010;
int n;
int a[N];
int L, q, ans, lst;
int dp[N][21];
int pow[21];
int main() {
memset(dp, 0x3f, sizeof(dp));
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
scanf("%d", &L);
scanf("%d", &q);
pow[0] = 1;
lst = 1;
for (int i = 1; i <= n; i++) {
while (a[i] > a[lst] + L) {
dp[lst++][0] = i - 1;
}
}
for (int j = 1; j <= 20; j++) {
pow[j] = pow[j - 1] << 1;
for (int i = 1; i <= n; i++) {
if (dp[i][j - 1] < 0x3f3f3f3f) dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
}
while (q--) {
int x, y;
scanf("%d%d", &x, &y);
if (x > y) swap(x, y);
ans = 0;
for (int i = 20; i >= 0; i--) {
if (dp[x][i] < y) {
x = dp[x][i];
ans += pow[i];
}
}
printf("%d\n", ans + 1);
}
return 0;
} | 1 |
#include<iostream>
using namespace std;
static const int INF = 0x7fffffff;
static const int MAXN = 101;
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAXN][MAXN];
int prim()
{
int node, minn; //记录当前状态权值最小的边和对应的节点
int d[MAXN], p[MAXN], color[MAXN]; //最小边权，父节点，访问状态
/*初始化*/
for (int i = 0; i < n; i++)
{
d[i] = INF;
p[i] = -1;
color[i] = WHITE;
}
d[0] = 0; //初始节点加入MST
while (true)
{
node = -1;
minn = INF;
for (int i = 0; i < n; i++)
{
if (d[i] < minn && color[i] != BLACK)
{
minn = d[i];
node = i;
}
}
if (node == -1) break; //图遍历完毕，没有可以新加入MST的节点
color[node] = BLACK; //把新节点加入MST
/*更新状态*/
for (int i = 0; i < n; i++)
{
if (color[i] != BLACK && M[node][i] < INF)
{
if (d[i] > M[node][i])
{
d[i] = M[node][i];
p[i] = node;
}
}
}
}
int sum = 0;
for (int i = 0; i < n; i++)
{
if (p[i] != -1) sum += M[i][p[i]]; //求MST每条边的权和
}
return sum;
}
int main()
{
int tmp;
cin >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cin >> tmp;
M[i][j] = (tmp == -1 ) ? INF : tmp;
}
}
cout << prim() <<endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
string line;
cin >> n;
getline(cin, line);
while(n--){
int p;
getline(cin, line);
while((p = line.find("Hoshino")) != -1){
line[p+6] = 'a';
}
cout << line << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7ll;
const double PI=3.14159265358979323846;
int main() {
int N; cin >> N;
vector<int> A;
A.emplace_back(1e9 + 100);
while(N--) {
int a; cin >> a;
if(a <= *(A.end()-1)) A.emplace_back(a);
else {
int ok = int(A.size());
int ng = -1;
while(abs(ok - ng) > 1) {
int x = (ok + ng) / 2;
if(A.at(x) < a) ok = x;
else ng = x;
}
A.at(ok) = a;
}
}
cout << A.size() - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// 参考資料：https://hiramekun.hatenablog.com/entry/2019/07/21/082628
#define N 100000
#define INF ((1<<31)-1)
multiset<int> setMaxNum; // 色ごとに仕分けされた集合の最大値を格納
int main() {
// 入力
int n;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++){
int aTmp;
cin >> aTmp;
a.push_back(aTmp);
}
//
for (int i = 0; i < n; i++){
auto itr = setMaxNum.lower_bound(a[i]);
if (itr != setMaxNum.begin()){ // 入力値 a[i] より小さい setMaxNum がある場合、その集合と同じ色で塗れる
setMaxNum.erase(--itr); // 同じ色で塗られてる集合の最大値が変わるため、元の最大値を削除する
}
setMaxNum.insert(a[i]);
}
cout << setMaxNum.size() << endl;
return 0;
}
| 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int mod=1000000007;
inline void add(int &x,int y){(x+=y)>=mod?x-=mod:0;}
char s[300030];
int n,dp[300030][2][2][3],suf[300030],ans;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);s[n+1]='1';
dp[0][0][1][0]=1;
suf[n+1]=suf[n+2]=1;
for(int i=n;i;--i)suf[i]=s[i]=='?'?(suf[i+1]<<1)%mod:suf[i+1];
for(int i=1;i<=n+1;++i)
{
if(s[i]!='1')
{
for(int j=0;j<2;++j)
for(int k=0;k<2;++k)
for(int l=0;l<3;++l)
add(dp[i][j][k][(l&1)+1],dp[i-1][j][k][l]);
}
if(s[i]!='0')
{
for(int j=0;j<2;++j)
for(int k=0;k<2;++k)
{
if(!j&&k==1)add(dp[i][1][k^1][0],dp[i-1][j][k][0]);
else if(j==1&&!k)ans=(ans+1ll*dp[i-1][j][k][0]*suf[i+1])%mod;
else add(dp[i][j][k^1][0],dp[i-1][j][k][0]);
add(dp[i][j][k][0],dp[i-1][j][k][1]);
add(dp[i][j][k^1][0],dp[i-1][j][k][2]);
}
}
// for(int j=0;j<3;++j)
// for(int k=0;k<2;++k)
// for(int l=0;l<3;++l)
// if(dp[i][j][k][l])
// printf("%d %d %d %d %d\n",i,j,k,l,dp[i][j][k][l]);
// printf("\n");
}
printf("%d",ans);
return 0;
}
| #include <stdio.h>
int main() {
char kaping[14];
scanf("%s", kaping);
kaping[3] = '8';
printf("%s", kaping);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll N;
cin >> N;
ll cur = 0;
ll now = -2;
vector<ll> v;
if(N==0)v.push_back(0);
while(N != 0){
if(N % now == 0){
v.push_back(0);
}else{
v.push_back(1);
N--;
}
N /= -2;
}
reverse(v.begin(),v.end());
rep(i,v.size()){
cout << v[i];
}
cout << endl;
} | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
#define rg register
void read(int &x){
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok)x=-x;
}
const int maxn=2010,mod=1e9+7,N=4e6;
int n,m,f[maxn][maxn],fac[maxn*maxn],inv[maxn*maxn];
int mul(int x,int y){return 1ll*x*y-1ll*x*y/mod*mod;}
int add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
int del(int x,int y){return x-y<0?x-y+mod:x-y;}
int mi(int a,int b){int ans=1;while(b){if(b&1)ans=mul(ans,a);b>>=1,a=mul(a,a);}return ans;}
void prepare(){
fac[0]=inv[0]=1;
for(rg int i=1;i<=N;i++)fac[i]=mul(fac[i-1],i);
inv[N]=mi(fac[N],mod-2);
for(rg int i=N-1;i;i--)inv[i]=mul(inv[i+1],i+1);
}
int C(int n,int m){return mul(fac[n],mul(inv[m],inv[n-m]));}
int main(){
read(n),read(m),prepare();
if(m==1)return printf("1\n"),0;
for(rg int i=1;i<=n;i++){
f[i][0]=1;
for(rg int j=1;j<=i;j++)
f[i][j]=add(f[i-1][j],mul(mul(f[i][j-1],n-j+1),C(n*m-(j-1)*(m-1)-i-1,m-2)));
}
printf("%d\n",f[n][n]);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
vec memo(1005);
queue<int> v[1005];
void solve() {
int N; cin >> N;
auto tmemo = memo;
rep1(i, N){
rep(j, N-1){
int a; cin >> a;
v[i].push(a);
}
}
int res = 0;
while(1){
bool f = false;
memo = tmemo;
rep1(i, N){
if(v[i].empty()) continue;
int tmp = v[i].front();
if(memo[i] || memo[tmp]) continue;
if(v[tmp].front() == i){
f = true;
v[i].pop(); v[tmp].pop();
memo[i] = memo[tmp] = 1;
}
}
if(!f) break;
res++;
}
rep1(i, N){
if(!v[i].empty()){
cout << -1 << endl;
return;
}
}
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//init();
//int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> as(n);
int sum = 0;
for (auto& a : as)
{
cin >> a;
sum += a;
}
int min_diff = numeric_limits<int>::max();
int min_index = -1;
for (int i = 0; i < n; i++)
{
auto diff = abs(sum - as[i] * n);
if (min_diff > diff)
{
min_diff = diff;
min_index = i;
}
}
cout << min_index << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s;
cin>>s;
int er=0;
int ans=s.size();
rep(i,s.size()){
if(s[i]=='S') er++;
if(s[i]=='T' && er!=0){
er--; ans-=2;
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
long n,sum = 0;
cin >> n;
for(long i = 1; i <= n; i++) {
if(i % 3 == 0 || i % 5 == 0) continue;
sum += i;
}
cout << sum << endl;
} | 0 |
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int ans;
int f[25][25];
int w,h,sx,sy,gx,gy;
void dfs(int x,int y,int turn)
{
if(turn>10||turn>=ans)return;
for(int i=y+1;i<w;i++)
{
if(x==gx&&i==gy)
{
ans=min(ans,turn);
return;
}
if(f[x][i]==1)
{
if(i==y+1)break;
f[x][i]=0;
dfs(x,i-1,turn+1);
f[x][i]=1;
break;
}
}
for(int i=y-1;i>=0;i--)
{
if(x==gx&&i==gy)
{
ans=min(ans,turn);
return;
}
if(f[x][i]==1)
{
if(i==y-1)break;
f[x][i]=0;
dfs(x,i+1,turn+1);
f[x][i]=1;
break;
}
}
for(int i=x+1;i<h;i++)
{
if(gx==i&&gy==y)
{
ans=min(ans,turn);
return;
}
if(f[i][y]==1)
{
if(i==x+1)break;
f[i][y]=0;
dfs(i-1,y,turn+1);
f[i][y]=1;
break;
}
}
for(int i=x-1;i>=0;i--)
{
if(gx==i&&gy==y)
{
ans=min(ans,turn);
return;
}
if(f[i][y]==1)
{
if(i==x-1)break;
f[i][y]=0;
dfs(i+1,y,turn+1);
f[i][y]=1;
break;
}
}
return;
}
int main()
{
while(1)
{
ans=100;
memset(f,0,sizeof(f));
scanf("%d %d",&w,&h);
if(w==0&&h==0)break;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
scanf("%d",&f[i][j]);
if(f[i][j]==2)
{
sx=i;sy=j;
f[i][j]=0;
}
if(f[i][j]==3)
{
gx=i;gy=j;
f[i][j]=0;
}
}
}
dfs(sx,sy,1);
if(ans==100)printf("-1\n");
else printf("%d\n",ans);
}
return 0;
} | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979;
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
bool odd(const int &n) { return n & 1; }
bool even(const int &n) { return ~n & 1; }
template<typename T = int> T in() { T x; cin >> x; return x; }
template<typename T = int> T in(T &&x) { T z(forward<T>(x)); cin >> z; return z; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &x : v) is >> x; return is; }
template<typename A, typename B> istream &operator>>(istream &is, pair<A, B> &p) { return is >> p.first >> p.second; }
template<typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "" : "\n"); return os; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "" : " "); return os; }
template<typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << ' ' << p.second; }
template<typename Head, typename Value> auto vectors(const Head &head, const Value &v) { return vector<Value>(head, v); }
template<typename Head, typename... Tail> auto vectors(Head x, Tail... tail) { auto inner = vectors(tail...); return vector<decltype(inner)>(x, inner); }
// clang-format on
int di[] = {1, 0, -1, 0}, dj[] = {0, 1, 0, -1};
main {
while (true) {
int w, h;
cin >> w >> h;
if (w == 0 && h == 0) break;
auto a = vectors(h, w, 0LL);
cin >> a;
int si, sj;
rep(i, h) rep(j, w) if (a[i][j] == 2) si = i, sj = j;
function<int(int, int, int)> dfs = [&](int i, int j, int c) {
if (c == 10) return INF;
int mini = INF;
rep(k, 4) {
int ni = i + di[k], nj = j + dj[k];
if (ni < 0 || nj < 0 || ni >= h || nj >= w || a[ni][nj] == 1) continue;
while (0 <= ni && ni < h && 0 <= nj && nj < w) {
if (a[ni][nj] == 3) {
cmin(mini, c + 1);
break;
}
if (a[ni][nj] == 1) {
a[ni][nj] = 0;
cmin(mini, dfs(ni - di[k], nj - dj[k], c + 1));
a[ni][nj] = 1;
break;
}
ni += di[k], nj += dj[k];
}
}
return mini;
};
int ans = dfs(si, sj, 0);
cout << (ans == INF ? -1 : ans) << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
long long min(long long x,long long y){return (x<y ? x:y);}
long long max(long long x,long long y){return (x>y ? x:y);}
#define ld long double
int stoi(string s) {return atoi(s.c_str());}
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
#define LINEY "YES\n"
#define Liney "Yes\n"
#define LINEN "NO\n"
#define Linen "No\n"
void func(ll* x,ll* y){
*x -= (*x%2);
*x /= 2;
*y += *x;
}
int main(){
ll A,B;
int K;
cin >> A>>B>>K;
bool turn_A = true;
REP(i,K){
if(turn_A){func(&A,&B);}
else{func(&B,&A);}
turn_A = !turn_A;
}
printf("%d %d\n",A,B);
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int a, b, k;
cin >> a >> b >> k;
int tk = a, ao = b;
for (int i = 0; i < k; ++i) {
if (i % 2 == 0) {
if (tk & 1) {
tk--;
}
ao += tk / 2;
tk /= 2;
} else {
if (ao & 1) {
ao--;
}
tk += ao / 2;
ao /= 2;
}
}
cout << tk << " " << ao << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int N,K;
scanf("%d %d",&N,&K);
if(N%K == 0){
printf("0\n");
}else{
printf("1\n");
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << min(1, a % b) << "\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int w;
cin >> w;
for (int i = 0; i < s.length(); i = i + w)cout << s.at(i);
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<bool> prime(222220,true);
for(int i=2; i<=222220; ++i) for(ll j=(ll)i*i; j<=222220; j += i){
prime[j] = false;
}
vector<int> ans(n);
int num = 0;
for(int i=11; i<=55555; i += 5){
if(!prime.at(i)) continue;
ans[num] = i;
++num;
if(num == n) break;
}
for(int i=0; i<n; ++i){
if(i != n-1)cout << ans[i] << " ";
else cout << ans[i] << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
bool CheckPayable(int x, vector<int> D){
// x中にDが含まれていなければtrue,含まれていればfalse
while(x>0){
for(int i=0;i<D.size();i++){
if(x%10 == D[i])return false;
}
x /= 10;
}
return true;
}
int main(){
int N,K;
cin >> N >> K;
// N < 10000なので全列挙でもイケる？
vector<int> D(K);
rep(i,K)cin >> D[i];
int ans = N;
while(true){
if(CheckPayable(ans, D)){
cout << ans << endl;
break;
}
ans++;
}
}
/*
1:条件から支払い可能な数字を列挙してN以上であれば出力する
2:Nから支払額を1ずつ大きくして支払い可能であれば出力する全列挙
1の組み合わせのCpp実装むずそうなので2の方針で
数字の支払い可能か如何をどうやって判別しよう
*/ | #include<stdio.h>
int main (){
int ha;
int wa;
int na;
int hasil;
scanf("%d", &ha);
scanf("%d", &wa);
scanf("%d", &na);
if(ha>=wa){
if(na%ha == 0) {
hasil = na/ha;
} else {
hasil = na/ha+1;
}
} else {
if(na%wa == 0) {
hasil = na/wa;
} else {
hasil = na/wa+1;
}
}
printf("%d", hasil);
return 0;
}
| 0 |
// ref: https://img.atcoder.jp/arc093/editorial.pdf
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
//---
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<rhs.size(); ++i){ std::cout<<rhs[i]<<' '; }
std::cout<<"]"<<std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>>& rhs){
std::cout<<" = "<<std::endl;
std::cout<<"[[ ";
for(uint p=0; p<rhs.size(); ++p){
if(p!=0){ std::cout<<" [ "; }
for(uint q=0; q<rhs[p].size(); ++q){
std::cout<<rhs[p][q]<<' ';
}
if(p!=rhs.size()-1){ std::cout<<"]"<<std::endl; }
}
std::cout<<"]]"<<std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR,TL>>& rhs){
std::cout<<" = [";
uint i=0;
for(; i<rhs.size()-1; ++i){ std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"], "; }
std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"]]" << endl;
}
#define printn(var) {printf("%s", #var);print(var);}
#define printn_all(var) {printf("%s(%d): ", __func__, __LINE__);printf("%s", #var);print(var);}
//---
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int K=50;
int A, B; cin >> A >> B; --A; --B;
vector<string> vS(100);
for(int i=0; i<K; ++i){ vS[i] = string(100, '#'); }
for(int i=K; i<2*K; ++i){ vS[i] = string(100, '.'); }
int cnt=0;
for(int i=0; i<K-1; i+=2){
if(cnt >= A){ break; }
for(int si=0; si<2*K; si+=2){
if(cnt >= A){ break; }
vS[i][si] = '.'; ++cnt;
}
}
cnt=0;
for(int i=K+1; i<2*K; i+=2){
if(cnt >= B){ break; }
for(int si=0; si<2*K; si+=2){
if(cnt >= B){ break; }
vS[i][si] = '#'; ++cnt;
}
}
cout << 2*K << ' ' << 2*K << endl;
for(int i=0; i<2*K; ++i){
cout << vS[i] << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#define MAXN 100
#define WHITE 0
#define BLACK 1
using namespace std;
int D[MAXN][MAXN];
bool judge ( int color, int i, int j)
{
if ( i-1 >= 0 && j-1 >= 0 && D[i-1][j-1] == color ) return false;
if ( i-1 >= 0 && D[i-1][j] == color ) return false;
if ( i-1 >= 0 && j+1 < MAXN && D[i-1][j+1] == color ) return false;
if ( i+1 < MAXN && j-1 >= 0 && D[i+1][j-1] == color ) return false;
if ( i+1 < MAXN && D[i+1][j] == color ) return false;
if ( i+1 < MAXN && j+1 < MAXN && D[i+1][j+1] == color ) return false;
if ( j-1 >= 0 && D[i][j-1] == color ) return false;
if ( j+1 < MAXN && D[i][j+1] == color ) return false;
return true;
}
int main()
{
int A,B;
int cnt;
cin >> A >>B;
for ( int i = 0; i < 50; ++i ) {
for ( int j = 0; j < MAXN; ++j ) D[i][j] = BLACK;
}
cnt = 1;
for ( int i = 0; i < 49; ++i ) {
for ( int j = 0; j < MAXN; ++j ) {
if ( cnt == A ) break;
if ( judge(WHITE, i,j) ) {
D[i][j] = WHITE;
++cnt;
}
}
}
cnt = 1;
for ( int i = 51; i < MAXN; ++i ) {
for ( int j = 0; j < MAXN; ++j ) {
if ( cnt == B ) break;
if ( judge(1, i, j) ) {
D[i][j] = 1;
++cnt;
}
}
}
cout << " " << MAXN << " " << MAXN <<"\n";
for ( int i = 0; i < MAXN; ++i ) {
for ( int j = 0; j < MAXN; ++j ) {
if ( D[i][j] ) cout << '#';
else cout << '.';
}
cout << "\n";
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
//cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
// https://github.com/atcoder/live_library
// cppdbg: test.exeのterminalに標準入力を打てる
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll; //long long
typedef pair<int,int> pii; //pair<int,int>
typedef pair<long long,long long> pllll; //pair<ll,ll>
typedef vector<int> vi; //vector<int>
typedef vector<vector<int>> vvi; //vector<vector<int>>
typedef vector<ll> vll; //vector<long long>
typedef vector<vector<ll>> vvll; //vector<vector<long long>>
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq; //逆順priority_queue
typedef priority_queue<ll> pq;
//const int MOD=998244353;
const int MOD=1000000007; //10^9+7
const long double PI=3.1415926535897932;
int main(){
int a,b,c,d,e,k;
cin>>a>>b>>c>>d>>e>>k;
cout<<((e-a<=k)?"Yay!":":(")<<endl;
}
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int antennas[5];
for (int i = 0; i < 5; i++) cin >> antennas[i];
int k;
cin >> k;
string ans = "Yay!";
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (antennas[j] - antennas[i] > k) ans = ":(";
}
}
cout << ans << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
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; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
// 割り算の切り上げ処理
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
// 桁和
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
// 回文判定
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
vector<string> a = {"hi","hihi","hihihi","hihihihi","hihihihihi"};
string s;
cin >> s;
rep(i, sz(a)){
if(a[i] == s){
print("Yes");
return 0;
}
}
print("No");
}
//queue<pint>().swap(q); キュー内を全て削除
//priority_queue<ll, vector<ll>, greater<ll> > que;
//auto dp=make_v<int>(4,h,w);
//vector<vector<ll>> g;
//g.assign(n, vector<ll>()); g.resize(n);でも大丈夫っぽい
//fill_v(dp,0);
//int n;
//cin >> n;
//vector<int> test(n);
//cins(all(test));
//array_output(all(test));
// Yes(true); | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
bool ok = true;
if (n % 2) ok = false;
else {
REP(i, n) {
if (i % 2) {
if (s[i] != 'i')
ok = false;
} else {
if (s[i] != 'h')
ok = false;
}
}
}
if (ok) cout << "Yes" << '\n';
else cout << "No" << '\n';
return 0;
} | 1 |
#if 0
date +%Y.%m.%d
题解先咕着。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
} read;
const int maxn = 6005;
ll f[maxn][maxn << 1];
ll inv[maxn];
int main () {
int n = read * 3, mod = read;
inv[1] = 1;
for (int i = 2; i <= n; i ++)
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
f[0][maxn + 0] = 1;
f[1][maxn + 1] = inv[1];
f[2][maxn + 2] = inv[2];
f[2][maxn - 1] = inv[2];
for (int s = 3; s <= n; s ++)
for (int i = maxn - s; i <= maxn + s; i ++)
f[s][i] = (f[s - 1][i - 1] + f[s - 3][i] + f[s - 2][i + 1]) * inv[s] % mod;
ll ans = 0;
for (int i = maxn; i <= maxn + n; i ++)
ans += f[n][i];
ans %= mod;
for (int i = 1; i <= n; i ++)
(ans *= i) %= mod;
printf("%lld\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using lint128 = __int128_t;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void assert_NO(T condition){ if(!condition){ cout << "NO" << endl; exit(0); } }
template<class T> inline void assert_No(T condition){ if(!condition){ cout << "No" << endl; exit(0); } }
template<class T> inline void assert_minus_1(T condition){ if(!condition){ cout << -1 << endl; exit(0); } }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd_calc(T a, T b){ if(b){ return gcd_calc(b, a % b); }else{ return a; }}
template<class T> T gcd(T a, T b){ if(a < b) swap(a, b); return gcd_calc(a, b); }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }
inline int at(lint x, int k){ return (x >> k) & 1; }
random_device rnd;
#define rep(i, n) for(int i = 0; i < n; i++)
int N;
lint M;
lint dp[6020][4020];
lint decide(int now, int c_minus_b){
if(now == N * 3){
return c_minus_b >= 0;
}
if(now > N * 3){
return 0;
}
if(c_minus_b > N){
c_minus_b = N;
}
if(c_minus_b < -N){
return 0;
}
if(dp[now][c_minus_b + 2010] != -1){
return dp[now][c_minus_b + 2010];
}
lint ans = 0;
ans += decide(now + 3, c_minus_b) * (now + 1) % M * (now + 2) % M;
ans += decide(now + 2, c_minus_b - 1) * (now + 1) % M;
ans += decide(now + 1, c_minus_b + 1);
return dp[now][c_minus_b + 2010] = ans % M;
}
int main(){
cin >> N >> M;
memset(dp, -1, sizeof(dp));
cout << decide(0, 0) << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll 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;
string alp="abcdefghijklmnopqrstuvwxyz";
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main(){fastio
ll n;cin>>n;
string s;cin>>s;
ll a[2*n];a[0]=0;
ll b[2];rep(i,0,1)b[i]=0;
b[0]++;
rep(i,1,2*n-1){
if(s[i]==s[i-1]){
a[i]=1-a[i-1];
}else{
a[i]=a[i-1];
}
b[a[i]]++;
}
if(b[0]!=n || s[0]=='W' || s[2*n-1]=='W'){
cout<<0<<endl;
return 0;
}
ll sum=0;
ll ans=1;
rep(i,1,n){
ans=mod(ans*i);
}
rep(i,0,2*n-1){
//cout<<a[i];
if(a[i]==0){
sum++;
}else{
ans=mod(ans*sum);
sum--;
}
}
cout<<ans<<endl;
return 0;
}
| #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)
#define rrep(i,x) for(int i=(int)x-1;i>=0;--i)
#define rrep1(i,x) for(int i=(int)x;i>=1;--i)
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int, int>;
using vpii=vector<pii>;
template<class T,class U>ostream&operator<<(ostream&os,const pair<T,U>p){os<<"("<<p.fst<<", "<<p.scd<<")";return os;}
template<class T>ostream&operator<<(ostream&os,const vector<T>v){rep(i,v.size()){if(i)os<<", ";os<<v[i];}return os;}
template<typename T>T&max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T&min(T&a,T&b){if(a < b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a < b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a > b){a=b;return true;}return false;}
constexpr ll TEN(ll n){return n==0?1:10ll*TEN(n-1);}
constexpr ll inf = TEN(9)+5;
constexpr ll linf = 3*TEN(18);
signed main()
{
int N; cin >> N;
string S; cin >> S;
const int mod = 1e9 + 7;
int l = 0;
ll ans = 1;
rep(i, N*2) {
if (S[i] == 'B') {
if (l % 2 == 0) {
l++;
} else {
ans *= l;
ans %= mod;
l--;
}
} else {
if (l % 2 == 0) {
ans *= l;
ans %= mod;
l--;
} else {
l++;
}
}
}
if (l > 0) {
puts("0");
return 0;
}
rep(i, N) {
ans *= i + 1;
ans %= mod;
}
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n, m;
cin >> n >> m;
vi s(m), c(m);
rep(i, m) {
cin >> s[i] >> c[i];
s[i]--;
}
vi q(n, -1);
rep(i, m) {
if (q[s[i]]!=-1 && q[s[i]]!=c[i]) {
cout << -1 << endl;
return 0;
}
else q[s[i]] = c[i];
}
if (n>1 && q[0]==0) {
cout << -1 << endl;
return 0;
}
int b = 1, e = 10;
rep(i, n-1) {
b *= 10; e *= 10;
}
if (n == 1) b = 0;
for (int i=b; i<e; ++i) {
int i2 = i;
bool ok = true;
repr(j, n) {
if (q[j]!=-1 && i2%10!=q[j]) ok = false;
i2 /= 10;
}
if (ok) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
//#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,n,maxi=0,f=0,mini=INF;
ll sum=0;
string str,sub;
ll h,w;
ll m;
cin>>n>>m;
if(m==0){
if(n==1){
cout<<0<<endl;
}else if(n==2){
cout<<10<<endl;
}else{
cout<<100<<endl;
}
return 0;
}
vector<pair<ll,ll>> s(m);
rep(i,m){
cin>>a>>b;
s[i]=make_pair(a,b);
}
f=0;
sort(s.begin(),s.end());
sum=0;
if(s[0].first==1) {
//sum-=100;
if(s[0].second==0&&n!=1) f=1;
sum+=100*s[0].second;
}
if(s[0].first==2){
//if(s[0].second==0&&n==2) f=1;
sum+=10*s[0].second;
// sum-=10;
}
if(s[0].first==3){
//sum-=1;
sum+=1*s[0].second;
}
for(ll i=1;i<m;i++){
if(s[i-1].first==s[i].first&&s[i-1].second!=s[i].second) f=1;
else if(s[i-1].first==s[i].first&&s[i-1].second==s[i].second) continue;
else{
if(s[i].first==1) {
// sum-=100;
if(s[i].second==0&&n!=1) f=1;
sum+=100*s[i].second;
}
if(s[i].first==2) {
// sum-=10;
sum+=10*s[i].second;
}
if(s[i].first==3) {
// sum--;
sum+=1*s[i].second;
}
}
}
if(n==1&&sum!=0) sum/=100;
if(n==2&&sum!=0) sum/=10;
if(n==3&&sum!=0&&sum<100) sum+=100;
if(n==2&&sum<10) sum+=10;
if(f!=1&&sum==0&&n==1){
cout<<0<<endl;
return 0;
}
if(f==1){
cout<<"-1"<<endl;
}else{
cout<<sum<<endl;
}
return 0;
}
| 1 |
#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 N;
cin >> N;
vc S;
if(N == 0){
cout << 0 << endl;
return 0;
}
while(N != 0){
if(N % (-2) == 0){
S.push_back('0');
} else{
S.push_back('1');
N--;
}
N /= -2;
}
rep_inv(i, S.size() - 1, -1) cout << S[i];
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin>>A>>B;
int i=0;
int j=B-A;
int sum=0;
int C=A;
while(i<=j){
A=C;
int a=A%10;//A=12345の時5
A/=10;//A=1234
int b=A%10;
A/=10;//A=123
A/=10;//A=12
int d=A%10;
A/=10;//A=1
int e=A;
if(a==e&&b==d){
sum+=1;
}
C++;
i++;
}
cout<<sum<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a;
cin>>a;
cout<<((a-1)/111+1)*111<<endl;
return 0;
}
| #include <cstdio>
typedef long long LL;
const int MX = 10005, MP = 2005;
const int MN = 505;
bool ip[MX];
int p[MP], pc;
inline void Sieve(int N) {
for (int i = 2; i <= N; ++i) {
if (!ip[i]) p[++pc] = i;
for (int j = 1, k; j <= pc; ++j) {
if ((k = p[j] * i) > N) break;
ip[k] = 1;
if (i % p[j] == 0) break;
}
}
}
int N, A[MN], B[MN];
int main() {
Sieve(10000);
scanf("%d", &N);
for (int i = 1; i <= N; ++i) A[i] = p[i & 1 ? i / 2 + 1 : N + N - i / 2 + 1];
for (int i = 1; i <= N; ++i) B[i] = p[(i & 1 ? N - i / 2 : N + i / 2) + (N & 1)];
A[0] = A[N + 1] = B[0] = B[N + 1] = 1;
for (int i = 1; i <= N; ++i, puts(""))
for (int j = 1; j <= N; ++j)
if ((i + j) % 2) printf("%lld ", (LL)A[(i + j) / 2] * A[(i + j) / 2 + 1] * B[(N + i - j + (N & 1)) / 2] * B[(N + i - j + (N & 1)) / 2 + 1] + 1);
else printf("%d ", A[(i + j) / 2] * B[(N + i - j + (N & 1)) / 2]);
return 0;
}
// Luogu : PinkRabbit | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
ll N,K;
cin>>N>>K;
if(N%K==0)cout<<0;
else cout<<1;
return 0;
} | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
bool ok(const string& s) {
if (s[0] != 'A') {
return false;
}
if (count(s.begin() + 2, s.end() - 1, 'C') != 1) {
return false;
}
int lower = 0;
for (char c : s) if (islower(c)) ++lower;
return lower == s.size() - 2;
}
int main() {
in(string, s);
out(ok(s) ? "AC" : "WA");
} | 0 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"
int main() {
while (1) {
int N, M; cin >> N >> M;
if (!N)break;
vector<int>prices(N);
for (int i = 0; i < N; ++i) {
cin >> prices[i];
}
sort(prices.begin(), prices.end(), greater<int>());
int ans=0,num = 0;
for (int i = 0; i < N; ++i) {
num++;
if (num == M) {
num = 0;
}
else {
ans += prices[i];
}
}
cout << ans << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,x,a[105],ans=0;
cin>>n>>x;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
for(int i=0;i<n;i++){
if(x>a[i] && i!=n-1){
ans++;
x-=a[i];
}
else if(a[i]==x){
ans++;
x-=a[i];
}
}
cout<<ans<<endl;
return(0);
} | 0 |
#include "bits/stdc++.h"
using namespace std;
template<typename Itr>
auto partition2(const Itr first, const Itr last){
auto i=first;
for(auto j=first; j!=last; ++j){
if(*j<=*last){
iter_swap(i, j);
++i;
}
}
iter_swap(i, last);
return i;
}
int32_t main(){
size_t n; cin>>n;
vector<uint32_t> a(n); for(auto&& e:a) cin>>e;
const auto last=--end(a);
auto mid=partition2(begin(a), last);
for(auto i=begin(a); i!=mid; ++i) cout<<*i<<' ';
cout<<'['<<*mid<<"] ";
for(auto i=next(mid); i!=last; ++i) cout<<*i<<' ';
cout<<*last<<'\n';
}
| #include <iostream>
#define MAX 100001
using namespace std;
void Partition(int A[], int n, int& l) // l is the last index of smaller part
{
int x = A[n-1];
for (int i = 0; i < n-1; ++i)
{
if (A[i] <= x)
{
swap(A[i], A[l+1]);
l++;
}
}
l++;
swap(A[l], A[n-1]);
}
int main()
{
int n, A[MAX];
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &A[i]);
int l = -1;
Partition(A, n, l);
for (int i = 0; i < n; ++i)
{
if (i == l) printf("[%d]", A[i]);
else printf("%d", A[i]);
if (i != n-1) printf(" ");
else printf("\n");
}
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
string S;
cin >> S;
bool m = regex_match(S, regex("(hi)+"));
cout << (m?"Yes":"No") << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
if(S.length() % 2 == 0){
for(int i=0;i<S.length();i=i+2){
if(S[i] == 'h' && S[i+1] == 'i'){
continue;
}
else{
cout << "No" << endl;
return 0;
}
}
}
else{
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N,K;cin>>N>>K;
if(N%K==0){
cout<<0<<endl;
}else{
cout<<1<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int64_t INF=999999999;
int main() {
int N,K;
cin>>N>>K;
cout<<(N+K-1)/K-N/K<<endl;
return 0;} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.