code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, q;
while (scanf("%d %d", &n, &q) && n){
int a[128] = {0};
for (int i = 0; i < n; i++){
int m;
scanf("%d", &m);
for (int j = 0; j < m; j++){
int x;
scanf("%d", &x);
a[x]++;
}
}
int mpos = 1;
for (int i = 1; i < 128; i++){
if (a[i] > a[mpos]) mpos = i;
}
printf("%d\n", mpos * (a[mpos] >= q));
}
return (0);
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, q, m, mx, t, s;
bool a[51][101], f;
while(1){
cin >> n >> q;
if(n == 0 && q == 0){
break;
}
mx = 0;
fill(&a[0][0], &a[50][100], false);
for(int i = 0; i < n; i++){
cin >> m;
for(int j = 0; j < m; j++){
cin >> t;
a[i][t] = true;
}
if(t > mx){
mx = t;
}
}
m = 0;
f = true;
for(int i = 1; i <= mx; i++){
t = 0;
for(int j = 0; j < n; j++){
if(a[j][i]){
t++;
}
}
if(m < t){
m = t;
s = i;
}
}
if(m >= q){
cout << s << endl;
} else {
cout << 0 << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int FB, F, B;
FB = N / 15;
F = N / 3;
B = N / 5;
long long ans = 0;
for(int i = 1; i <= N; i++) {
ans += i;
}
for(int i =1 ; i <= F; i++) {
ans -= i*3;
}
for(int i =1 ; i <= B; i++) {
ans -= i*5;
}
for(int i =1 ; i <= FB; i++) {
ans += i*15;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define sci(x) int x; scanf("%d", &x);
#define TC(x) sci(x); while(x--)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin>>n;
ll sum = 0;
for(int i=1;i<=n;i++){
if(i%5!=0 && i%3!=0) sum+=i;
}
cout<<sum<<endl;
return 0;
}
| 1 |
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define PI acos(-1LL)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
// cin>>t;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
int n;
cin>>n;
vector<int>a(n);
multiset<int>s;
for(i=0;i<n;i++)
{
cin>>a[i];
// s.insert(a[i]);
}
int cnt=0;
for(i=0;i<n;i++)
{
auto it=s.lower_bound(a[i]);
if(it==s.begin())
{
cnt++;
}
s.insert(a[i]);
}
cout<<cnt<<endl;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
#define out(s) cout<<s<<endl;
#define Reverse(x) reverse(all(x));
#define Sort(x) sort(all(x));
#define pb(s) push_back(s);
#define sp " "
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(lli i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
cout << std::fixed << std::setprecision(10);
string s;
cin >> s;
if(s.size()==3)
{
Reverse(s);
}
out(s);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int n;
cin >> n;
cout << n / 3 << endl;
return 0;
}
| #include<bits/stdc++.h>
#define lg long long int
#define loop(i,s,e) for(lg i=s;i<=e;i++)
#define iloop(i,s,e) for(lg i=e;i>=s;i--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
lg min(lg a,lg b)
{return a<b?a:b;}
lg max(lg a,lg b)
{return a>b?a:b;}
lg lcm(lg a ,lg b)
{
return (a*b)/__gcd(a,b);
}
int main()
{
lg n;
cin>>n;
cout<<n+(n*n)+(n*n*n)<<endl;
}
| 0 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
ll N; cin >> N;
ll a, b, c, d, e; cin >> a >> b >> c >> d >> e;
ll m = min({a,b,c,d,e});
ll retval = (N+m-1ll)/m + 4ll;
cout << retval << endl;
// cout << fixed << setprecision(10);
return 0;
}
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <bitset>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll k, t;
cin >> k >> t;
vector<ll> a(t);
for(ll i = 0;i < t;i++) {
cin >> a[i];
}
ll cnt = 0;
ll before_idx = -1;
for(ll i = 0;i < k;i++) {
ll m = 0;
ll idx = -1;
for(ll j = 0;j < t;j++) {
if (before_idx != j) {
if (m < a[j]) {
m = a[j];
idx = j;
}
}
}
if (m==0) {
a[before_idx]--;
cnt++;
} else {
a[idx]--;
before_idx = idx;
}
}
cout << cnt << endl;
} | 0 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int a, b, c, k;
cin >> a >> b >> c >> k;
vector<int> x = {a, b, c};
int ans = 0;
for(int i = 0; i < k; ++i) {
sort(x.begin(), x.end());
x[2] *= 2;
}
cout << accumulate(x.begin(), x.end(), 0) << endl;
return 0;
}
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << endl;
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
vi v(3);
REP(i, 3) cin >> v[i];
sort(ALL(v), greater<>());
int k;
cin >> k;
print(v[0] * (1 << k) + v[1] + v[2]);
}
| 1 |
#include<iostream>
int main() {
int a; std::cin >> a;
std::cout << a + a*a + a*a*a << std::endl;
} | // Example program
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin >> n;
ll s1 = pow (n,2);
ll s2 = pow (n,3);
cout << n + s1 + s2 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int main(){
ll x;
cin >> x;
ll ans = (x/11)*2;
x %= 11;
if (x==0) {;}
else if (x<=6) ans++;
else ans += 2;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
int n = s.size();
reverse(rng(s));
bool ok = false;
int cnt = 0, nt = 0;
rep(i,n) {
if(s[i]=='T') nt++;
if(!ok&&s[i]=='T') ok = true;
else if(ok&&s[i]=='S'&&nt>0) {
cnt++;
nt--;
}
}
int ans = n-cnt*2;
if(ans<0) ans = 0;
cout << ans << endl;
return 0;
} | 0 |
//#define _USE_MATH_DEFINES
#include <iostream>
//#include <stdio.h>
//#include <iomanip>
//#include <vector>
//#include <string>
//#include <algorithm>
//#include <functional>
//#include <cmath>
using namespace std;
class Dice
{
public:
Dice(int num[6]);
int Play(char c);
int T;
private:
int NS[4],EW[4];
int NS_p,EW_p;
};
//?????????????????????
Dice::Dice(int num[6])
{
NS_p = 0;
EW_p = 0;
NS[0] = num[0];
NS[1] = num[1];
NS[2] = num[5];
NS[3] = num[4];
EW[0] = num[0];
EW[1] = num[3];
EW[2] = num[5];
EW[3] = num[2];
T = num[0];
}
int Dice::Play(char c){
if (c == 'N' || c == 'S'){
if(c == 'N') NS_p = (NS_p + 1) % 4;
else {
if (NS_p == 0) NS_p = 3;
else NS_p--;
}
EW[EW_p] = NS[NS_p];
EW[(EW_p+2)%4] = NS[(NS_p+2)%4];
}
else if (c == 'E' || c == 'W'){
if (c == 'E') EW_p = (EW_p + 1) % 4;
else {
if (EW_p == 0) EW_p = 3;
else EW_p--;
}
NS[NS_p] = EW[EW_p];
NS[(NS_p + 2) % 4] = EW[(EW_p + 2) % 4];
}
T = NS[NS_p];
return 1;
}
int main(){
int num[6];
char c;
for (int i = 0; i < 6; i++){
cin >> num[i];
}
Dice d1(num);
while (cin >> c){
d1.Play(c);
}
cout << d1.T << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> x(n);
rep(i, n) cin >> x[i];
int ans = 2e9;
for (int l = 0; l + k - 1 < n; ++l) {
int r = l + k - 1;
if (x[l] >= 0) ans = min(ans, x[r]);
else if (x[r] <= 0) ans = min(ans, -x[l]);
else if (x[r] + x[l] >= 0) ans = min(ans, -2 * x[l] + x[r]);
else ans = min(ans, 2 * x[r] - x[l]);
}
cout << ans << endl;
return 0;
} | 0 |
#include<stdio.h>
int main(){
char date[10], month[10], year[10];
scanf("%[^/]/%[^/]/%s", year, month, date);
printf("2018/01/%s", date);
return 0;
} | #include<stdio.h>
struct SI{int top;int west;int south;int east;int north;int back;};
struct SI E(struct SI P);
struct SI W(struct SI);
struct SI S(struct SI P);
struct SI N(struct SI P);
int main(){
struct SI P;
char q;
scanf("%d%d%d%d%d%d",&P.top, &P.south, &P.east, &P.west, &P.north, &P.back);
while(scanf("%c",&q)!=EOF){
if(q=='E')P=E(P);
if(q=='N')P=N(P);
if(q=='W')P=W(P);
if(q=='S')P=S(P);
}
printf("%d\n",P.top);
return 0;
}
struct SI N(struct SI P){
int t=P.top;
P.top=P.south;P.south=P.back;P.back=P.north;P.north=t;
return P;
}
struct SI S(struct SI P){
int t=P.top;
P.top=P.north;P.north=P.back;P.back=P.south;P.south=t;
return P;
}
struct SI E(struct SI P){
int t=P.top;
P.top=P.west;P.west=P.back;P.back=P.east;P.east=t;
return P;
}
struct SI W(struct SI P){
int t=P.top;
P.top=P.east;P.east=P.back;P.back=P.west;P.west=t;
return P;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll sp[100010],sm[100010];
int main(){
int n,k;
cin>>n>>k;
int z=0;
vector<ll> x(n);
vector<ll> p,m;
rep(i,n){
cin>>x[i];
if(x[i]==0) z++;
else if(x[i]>0){
p.push_back(x[i]);
}
else{
m.push_back(-x[i]);
}
}
reverse(all(m));
ll ans=1LL<<60;
if(z==1){
k--;
if(k==0){
cout<<0<<endl;
return 0;
}
}
if(p.size()>=k){
ans=min(ans,p[k-1]);
}
if(m.size()>=k){
ans=min(ans,m[k-1]);
}
for(int i=1;i<k;i++){
if(m.size()<i) break;
if(p.size()<k-i) continue;
ans=min(ans,2*m[i-1]+p[k-i-1]);
}
for(int i=1;i<k;i++){
if(p.size()<i) break;
if(m.size()<k-i) continue;
ans=min(ans,2*p[i-1]+m[k-i-1]);
}
cout<<ans<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
main(){
while(1){
long long n,m;
long long sum=0;
cin>>n>>m;
if(n==0&&m==0) break;
long long p[1005];
for(int i=0;i<n;i++){
cin>>p[i];
sum+=p[i];
}
sort(p,p+n,greater<long long>());
for(int i=1;i<=n;i++){
if(i%m==0){
sum-=p[i-1];
}
}
cout<<sum<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end(), x) - v.begin(); }
TT void sort(T& v){ sort(v.begin(), v.end()); }
TT void revs(T& v){ reverse(v.begin(), v.end()); }
TT void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TT void show(T& v,char d=' ',char e='\n'){for(int i=0;i<v.size();++i)cout<<v[i]<<((i==v.size()-1)?e:d);}
TT void inpt(vector<T>& v,int n){ v.reserve(n);for(int i=0;i<n;++i){T x; cin>>x; v.push_back(x);} }
TT T In(T& x){ cin >> x; return x; }
static inline void fast_io(){ ios::sync_with_stdio(0); cin.tie(0); }
static inline int in(){ int x; scanf("%d", &x); return x; }
static inline string instr(){ string x; cin >> x; return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
struct Rect {
int h, w, d;
Rect(int h, int w) : h(h), w(w), d(sq(h) + sq(w)) {}
bool operator<(const Rect& x) const {
return d == x.d ? h < x.h : d < x.d;
}
};
int main()
{
vector<Rect> v;
int h, w;
for (int x = 1; x <= 150; x++){
for (int y = 1; y < x; y++){
v.push_back(Rect(y, x));
}
}
sort(v);
while (h = in(), w = in(), h || w){
Rect r = Rect(h, w);
int index = ubnd(v, r);
printf("%d %d\n", v[index].h, v[index].w);
}
return (0);
} | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
using namespace std;
int main() {
int h, w;
while (cin >> h >> w&&h != 0 && w != 0) {
int t = h*h + w*w;
int h2 = h+1;
while (true) {
for (int i = h2; i*i < t; i++) {
long double b = sqrt(t - i*i);
if (b > (long double)i) {
int c = b;
if ((long double)c == b) {
cout << i << " " << b << endl;
goto stop;
}
}
}
t++;
h2 = 1;
}
stop:;
}
} | 1 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
using namespace std;
/// khodaya komak kon
/// ya navid navid
const int N=2e5+100;
ll seg[4*N];
void shift(ll nod){
if (seg[nod]==1){
seg[nod*2]=1;
seg[nod*2+1]=1;
}
}
void upd(ll nod,ll l,ll r,ll L,ll R){
if (l>=R || L>=r){
return ;
}
if (l>=L && r<=R){
seg[nod]=1;
return ;
}
shift(nod);
ll mid=(r+l)/2;
upd(nod*2,l,mid,L,R);
upd(nod*2+1,mid,r,L,R);
}
ll get(ll nod,ll l,ll r,ll id){
if (r-l==1){
return seg[nod];
}
shift(nod);
ll mid=(r+l)/2;
if (mid>id){
return get(nod*2,l,mid,id);
}
else{
return get(nod*2+1,mid,r,id);
}
}
ll k;
vector <pii> h;
ll st[N];
ll fn[N];
vector <int> g[N];
ll cnt=0;
ll par[N];
vector <int> t;
ll par1[N];
ll dfs(ll v,ll p,ll hi){
par1[v]=p;
t.pb(v);
ll z=t.size();
z-=k;
z=max((ll)0,z);
par[v]=t[z];
h.pb({hi,v});
st[v]=cnt;
for (int i=0;i<g[v].size();i++){
ll u=g[v][i];
if (u==p){
continue;
}
cnt++;
dfs(u,v,hi+1);
}
t.pop_back();
fn[v]=cnt;
}
int32_t main(){
sync;
ll n;
cin >> n >> k;
ll ans=0;
ll x;
cin >> x;
if (x!=1){
ans++;
}
for (int i=2;i<=n;i++){
cin >> x;
g[x].pb(i);
g[i].pb(x);
}
upd(1,0,N,0,1);
dfs(1,1,0);
sort(h.begin(),h.end());
reverse(h.begin(),h.end());
for (int i=0;i<n-1;i++){
ll v=h[i].S;
ll u=par[v];
//cout << v << " " << u << endl;
ll z=get(1,0,N,st[v]);
if (z==1 || par1[u]==1){
continue;
}
ans++;
upd(1,0,N,st[u],fn[u]+1);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int cuts = 0;
int go(auto& g, int K, int loc) {
int ht = 0;
for (int ch : g[loc]) {
int bl = go(g, K, ch);
if (bl + 1 > K - !!loc)
cuts++;
else
ht = max(ht, bl + 1);
}
return ht;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int N, K;
cin >> N >> K;
vvi g(N);
vi par(N);
for (int i = 0; i < N; i++) {
cin >> par[i];
--par[i];
if (i) {
g[par[i]].push_back(i);
}
}
go(g, K, 0);
cout << !!par[0] + cuts << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
const double pi=acos(-1.0);
int n,x[105],y[105];
double ang[105];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
for(int i=1;i<=n;i++)
{
int c=0;
for(int j=1;j<=n;j++)if(i^j)ang[c++]=atan2(y[j]-y[i],x[j]-x[i]);
sort(ang,ang+c);
double mx=0;
ang[c]=ang[0]+2*pi;
for(int j=0;j<c;j++)mx=max(mx,ang[j+1]-ang[j]);
mx-=pi;
if(mx<0)mx=0;
printf("%.10lf\n",mx/(2*pi));
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a;
ll sum = 0;
a.push_back(0);
rep(i,n){
int c;
cin >> c;
a.push_back(c);
}
a.push_back(0);
n += 2;
rep(i,n-1){
sum += abs(a[i+1] - a[i]);
}
for(int i = 1;i < n-1;i++){
cout << sum - abs(a[i+1] - a[i]) -abs(a[i] - a[i-1]) + abs(a[i+1] - a[i-1]) << endl;
}
} | 0 |
#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n+1);
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> b, all(n+1);
for(int i = n; i >= 1; i--) {
int cnt = 0;
for(int j = i; j <= n; j+=i) {
if(all[j] == 1)
cnt++;
}
if((cnt % 2 == 0 && a[i] == 1) ||
(cnt % 2 == 1 && a[i] == 0)) {
all[i] = 1;
b.push_back(i);
}
}
int bs = (int)b.size();
cout << bs << endl;
rep(i,bs) cout << b[i] << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0;
cin >> n;
int p[n],m=(1<<30);
for(int i=0;i<n;i++){
cin >> p[i];
if(m>p[i]){
cnt++;
m=min(m,p[i]);
}
}
cout << cnt << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, fh = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') fh = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * fh;
}
const int N = 1010;
int n, ans, i, a[N];
int main() {
n = read();
for (i = 1; i <= n * 2; i++) a[i] = read();
sort (a + 1, a + 1 + n * 2);
for (i = 1; i <= n * 2; i += 2) ans += a[i];
cout << ans << '\n';
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define P pair<int ,int>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>vec = {};
if(n == 0){
cout << "0" << endl;
return 0;
}
while(n != 1){
if(n%2 == 1 || n%2 == -1){
vec.push_back(1);
n--;
n /= (-2);
}
else {
vec.push_back(0);
n /= (-2);
}
}vec.push_back(1);
for(int i = (int)vec.size() - 1 ;i>=0;i--){
cout << vec[i];
}
cout << endl;
}
| 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kishan Sairam Adapa
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ll long long int
#define MOD ((int)(1e9) + 7)
using namespace std;
class BNiceShopping {
public:
void solve(istream& cin, ostream& cout) {
int a, b, m;
cin >> a >> b >> m;
int minA = INT_MAX, minB = INT_MAX;
vector<int> sa, sb;
for(int i=0; i<a; i++) {
int tp;
cin >> tp;
minA = min(minA, tp);
sa.push_back(tp);
}
for(int i=0; i<b; i++) {
int tp;
cin >> tp;
minB = min(minB, tp);
sb.push_back(tp);
}
int mincost = minA+minB;
for(int i=0; i<m; i++) {
int x, y, c;
cin >> x >> y >> c;
mincost = min(mincost, sa[x-1] + sb[y-1] - c);
}
cout << mincost << '\n';
}
};
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
BNiceShopping solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| //----------------------------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n; cin >> n;
vector<ll> a(n);
vector<ll> b(n);
vector<ll> c(n);
rep(i, n)
cin >> a[i];
rep(i, n)
cin >> b[i];
rep(i, n)
cin >> c[i];
sort(a.begin(), a.end());
sort(b.begin(), b.end());
sort(c.begin(), c.end());
ll ans = 0;
for(int i = 0; i < n; ++i) {
ll key = b[i];
ll numc = c.end() - upper_bound(c.begin(), c.end(), key);
ll numa = lower_bound(a.begin(), a.end(), key) - a.begin();
ans += numa * numc;
}
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, K;
cin >> N >> K;
int ans = 0;
for(int i = 1; i <= N - K + 1; ++i) {
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = LLONG_MAX;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) { //最大公約数
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
int main() {
int n,k;cin >> n >> k;
vi a(n);
rep(i, n) cin >> a[i];
resort(a);
int ans = 0;
rep(i, k) ans += a[i];
cout << ans << endl;
return 0;
} | 0 |
#include<cstdio>
#include<cstring>
#define N 300010
using namespace std;
int to[8][2]={2,1,
3,5,
4,7,
6,1,
2,2,
5,5,
3,3,
2,1};
char s[N];
int f[N][8];
const int p=1e9+7;
int main()
{
scanf("%s",s);
int n=strlen(s);
f[n][1]=f[n][5]=1;
for(int i=n-1;i>=0;i--)
for(int j=0;j<8;j++)
{
if(s[i]!='1') f[i][j]+=f[i+1][to[j][0]];
if(s[i]!='0') f[i][j]+=f[i+1][to[j][1]];
f[i][j]%=p;
}
printf("%d",f[0][0]);
return 0;
} | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
void bfs(int v, vi &dist, vector<vi> &graph)
{
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++)
{
for (auto u : graph[q[i]])
{
if (dist[u] == -1)
{
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
if (s == "zyxwvutsrqponmlkjihgfedcba")
{
cout << "-1";
return 0;
}
vector<int> la(26);
forn(i, s.size()) la[s[i] - 'a']++;
for (int i = 0; i < 26; i++) if (la[i] == 0)
{
cout << s;
cout << (char)(i + 'a');
return 0;
}
string t = s;
next_permutation(all(t));
for (int i = 0; i < t.size(); i++)
{
if (s[i] == t[i]) cout << s[i];
else
{
cout << t[i];
return 0;
}
}
}
/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Setting N in every problem is more effective.
Check corner cases.
N = 1
No def int long long for now.
Add something here.
*/
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
const char nl = '\n';
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int h, w; cin >> h >> w;
int canvas[h + 2][w + 2];
FOR(i, 1, h + 1) {
string s; cin >> s;
FOR(j, 1, w + 1) canvas[i][j] = s[j];
}
bool ok = true;
F0R(i, h) {
F0R(j, w) {
if (canvas[i][j] == '#') {
if (canvas[i+1][j] == '.' && canvas[i - 1][j] == '.' && canvas[i][j + 1] == '.' && canvas[i][j - 1] == '.') {
ok = false;
break;
}
}
}
}
cout << (ok ? "Yes\n": "No\n");
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
// #define INF __INT32_MAX__
#define INF 1e9
#define LINF __LONG_LONG_MAX__
int main() {
int K, T; cin >> K >> T;
vi A(T); rep(i, T) cin >> A[i];
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int x = A[0];
for (int i = 1; i < T; i++) {
x -= A[i];
}
if (x > 0) {
cout << (x - 1) << endl;
} else {
cout << 0 << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
/*
提出前に確認!
- setとmultisetを間違えない
*/
int mod = 1e9 + 7;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long ans = 0;
long long all = 0;
for (int i = 0; i < n; i++)
{
ans += all * a[i] % mod;
ans %= mod;
all += a[i];
all %= mod;
}
cout << ans << endl;
return (0);
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e6+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=5001;
#define pq priority_queue
#define ff first
#define ss second
#define pb push_back
#define lb lower_bound
ll k1=0;
void solve(string s,string r)
{
int z[maxn]={};
string t=r;
t+'#';
t+=s;
//for(i=0;i)
z[0]=0;
int left=0;
int right=0;
int i,j,k,l,n;
n=t.size();
for(int k=1;k<n;k++)
{
if(k>right)
{
right=k;
left=k;
while(k<n&&t[right-left]==t[right])
right++;
z[k]=right-left;
right--;
}
else
{
int k1=k-left;
if(z[k1]<right-k+1)
z[k]=z[k1];
else
{
left=k;
while(k<n&&t[right-left]==t[right])
right++;
z[k]=right-left;
right--;
}
}
}
k=r.size();
k1=k;
for(i=r.size();i<=t.size()-r.size();i++)
{
k1=min((int)k1,k-z[i]);
}
}
int main()
{
fastio;
int t;
ll i,j,k,l,n;
cin>>n;
ll a[n+1]={},b[n+1]={};
for(i=1;i<=n;i++)
{
cin>>a[i];
a[i]=a[i]%mod;
b[i]=b[i-1]+a[i];
b[i]=b[i]%mod;
}
l=0;
for(i=1;i<n;i++)
{
l=(l+((b[n]-b[i]+mod)*a[i]%mod))%mod;
}
cout<<l;
}
//Lordvishnu@almighty | 1 |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
while (1) {
int h, w;
cin >> h >> w;
if (h == 0 && w == 0) break;
int m = h * h + w * w;
bool end = false;
for (int m = h * h + w * w; m <= 45000; ++m) {
//cout << m << endl;
int bh = m == h * h + w * w ? h + 1 : 1;
for (; bh <= 150; ++bh) {
if (m > bh * bh) {
int r = m - bh * bh;
int bw = int(floor(sqrt(r)));
//cout << bh << " " << bw << endl;
if (bw * bw == r) {
if (bw <= bh) break;
cout << bh << " " << bw << endl;
end = true;
break;
}
}
}
if(end)break;
}
}
}
| //#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);(i)++)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007LL
#define INF (1LL<<60LL)
#define int long long
#define MAX_N (100001)
typedef long long ll;
using namespace std;
vector<vector<bool>> v(100, vector<bool>(100,1));
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b; cin >> a >> b;
bool rev = false;
if (a > b) {
swap(a, b);
rev = true;
}
int i = 0, j = 0;
if (b > 1)a--;
rep(_, a) {
v[i][j] = 0;
j += 2;
if (j >= 100) {
i++;
j = i % 2;
}
}
b -= max(0LL, a - 50);
i += 3;
j = 1;
rep(_, b-1) {
rep(i2, 3)rep(j2, 3) {
v[i + i2 - 1][j + j2 - 1] = 0;
}
v[i][j] = 1;
j += 2;
if (j >= 98) {
i+=2;
j = 1;
}
}
char m[2];
if (!rev) {
m[0] = '.';
m[1] = '#';
}else {
m[1] = '.';
m[0] = '#';
}
cout << 100 << " " << 100 << "\n";
rep(i2, 100)rep(j2, 100) {
cout << m[v[i2][j2]];
if (j2 == 99) cout << "\n";
}
} | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 100 + 10;
int total, N;
int a[MAXN]= {0};
int st[MAXN]= {0}, ed[MAXN]= {0};
int odd[MAXN]= {0}, ocnt = 0;
int ans[MAXN]= {0}, acnt = 0;
int getnum () {
int num = 0;
char ch = getchar ();
while (! isdigit (ch))
ch = getchar ();
while (isdigit (ch))
num = (num << 3) + (num << 1) + ch - '0', ch = getchar ();
return num;
}
int main () {
total = getnum (), N = getnum ();
for (int i = 1; i <= N; i ++) {
a[i] = getnum ();
if (a[i] & 1) odd[++ ocnt] = i;
}
if (N == 1) {
printf ("%d\n", a[1]);
if (total == 1) puts ("1"), puts ("1");
else {
puts ("2");
printf ("1 %d\n", total - 1);
}
return 0;
}
if (ocnt > 2) {
puts ("Impossible");
return 0;
}
if (ocnt >= 1) swap (a[1], a[odd[1]]);
if (ocnt >= 2) swap (a[N], a[odd[2]]);
ans[++ acnt] = a[1] + 1;
for (int i = 2; i < N; i ++) ans[++ acnt] = a[i];
if (a[N] - 1 > 0) ans[++ acnt] = a[N] - 1;
for (int i = 1; i <= N; i ++) {
if (i > 1) putchar (' ');
printf ("%d", a[i]);
}
printf ("\n%d\n", acnt);
for (int i = 1; i <= acnt; i ++) {
if (i > 1) putchar (' ');
printf ("%d", ans[i]);
}
puts ("");
return 0;
}
/*
3 2
2 1
*/
/*
6 1
6
*/
/*
55 10
1 2 3 4 5 6 7 8 9 10
*/ | #include<bits/stdc++.h>
#define inf 1000000000
#define N 5005
using namespace std;
char s[N];
int n,m,l[N][N],a[N][N],up[N][N],r[N][N],R[N][N],L[N][N];
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++){
scanf("%s",s+1);
for (int j=1;j<=m;j++){
if (s[j]=='#') a[i][j]=1;
else a[i][j]=0;
}
}
int ans=max(n,m);n--;m--;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++) a[i][j]=a[i][j]^a[i][j+1]^a[i+1][j]^a[i+1][j+1];
for (int i=1;i<=n;i++){
for (int j=1;j<=m;j++){
if (a[i][j]) l[i][j]=0;
else l[i][j]=l[i][j-1]+1;
}
for (int j=m;j;j--){
if (a[i][j]) r[i][j]=0;
else r[i][j]=r[i][j+1]+1;
}
}
for (int i=1;i<=m;i++) L[0][i]=R[0][i]=inf;
for (int i=1;i<=n;i++){
for (int j=1;j<=m;j++){
if (a[i][j]) up[i][j]=0,L[i][j]=R[i][j]=inf;
else {
up[i][j]=up[i-1][j]+1;
L[i][j]=min(l[i][j],L[i-1][j]);
R[i][j]=min(R[i-1][j],r[i][j]);
}
}
}
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (!a[i][j]) ans=max(ans,(up[i][j]+1)*(R[i][j]+L[i][j]));
printf("%d\n",ans);
return 0;
} | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200010;
int n, ans;
int read()
{
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * w;
}
inline void write(int x)
{
static int sta[35];
int top = 0;
do {
sta[top++] = x % 10, x /= 10;
} while (x);
while (top) putchar(sta[-- top] + 48);
}
signed main()
{
n = read();
ans = (n - 2) * 180;
write(ans);
return 0;
} | /*
M-SOLUTIONS プロコンオープン
3以上の整数Nが与えられる。
正N角形の内角の和を求める。
制約
・3<=N<=100
方針
N角形の内角の和は、(N-2)*180
で求めらえる。
*/
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
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; }
// 多次元 vector 生成
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
const int MOD = 1000000007;
int main(){
int N; cin >> N;
cout << (N-2)*180 << endl;
}
| 1 |
#include <iostream>
#include <iomanip> //setprecision
#include <cstdlib>
#include <cmath>
double abs(double coodinate1, double coodinate2);
int main(void) {
double x1;
double y1;
double x2;
double y2;
std::cin >> x1 >> y1 >> x2 >> y2;
double dif_x = abs(x1, x2);
double dif_y = abs(y1, y2);
double target = dif_x * dif_x + dif_y * dif_y;
std::cout << std::setprecision(12);
std::cout << sqrt(target) << std::endl;
return EXIT_SUCCESS;
}
double abs(double coodinate1, double coodinate2) {
double dif = coodinate1 - coodinate2;
if (dif < 0) {
dif *= (-1.0);
}
return dif;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,A,B;
cin >> N >> A >> B;
ll now,next;
cin >> now;
ll ans = 0;
for(int i = 0; i < N-1; i++){
cin >> next;
ans += min(abs(now - next)*A, B);
now = next;
}
cout << ans << endl;
}
| 0 |
#include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<complex>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define all(X) (X).begin(),(X).end()
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX_N = 100000;
int N, L, Q;
int x[MAX_N];
int r[20][MAX_N];
int can_reach(int i, int d) {
if (d == 0) return i;
int k = 0;
while (d >= (1<<k)) ++k;
--k;
return can_reach(r[k][i], d-(1<<k));
}
int main() {
cin >> N;
rep(i,N) cin >> x[i];
cin >> L >> Q;
for (int i = 0; i < N; ++i) {
r[0][i] = upper_bound(x, x+N, x[i]+L) - x - 1;
}
int K = 0;
while (N >= (1<<K)) ++K;
for (int k = 1; k < K; ++k) {
for (int i = 0; i < N; ++i) {
r[k][i] = r[k-1][r[k-1][i]];
}
}
while (Q--) {
int a, b;
scanf("%d%d", &a, &b);
--a; --b;
if (a > b) swap(a,b);
int lb = 0, ub = N, d = 0;
while (ub-lb > 1) {
d = (ub+lb)/2;
if (can_reach(a, d) >= b) ub = d;
else lb = d;
}
printf("%d\n", ub);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define repb(i, n) for(ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for(ll i = (a); i < (b); i++)
#define reprb(i, a, b) for(ll i = (b)-1; i >= (a); i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
inline ll GCD(ll a, ll b){ return b?GCD(b, a % b):a; }
inline ll LCM(ll a, ll b){ return a/GCD(a, b)*b; }
inline ll powmod(ll x, ll y, ll m = MOD){ ll r=1; while(y){ if(y&1) r*=x; x*=x; r%=m; x%=m; y>>=1; } return r; }
template<class S, class T>bool chmax(S &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class S, class T>bool chmin(S &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
const int M = 100010;
ll n;
vll x;
int d[18][M];
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cin >> n;
x.resize(n);
rep(i, n){
cin >> x[i];
}
ll l;
cin >> l;
rep(j, n){
d[0][j] = upper_bound(ALL(x), x[j] + l) - x.begin() - 1;
}
repr(i, 1, 18)rep(j, n){
d[i][j] = d[i-1][d[i-1][j]];
}
/*
rep(i, 18)rep(j, n){
cout << d[i][j] << " \n"[j+1==n];
}
cout << endl;
*/
ll q;
cin >> q;
ll a, b;
rep(qq, q){
cin >> a >> b;
a--;b--;
if(a > b) swap(a, b);
ll ans = 0;
ll p = a;
while(1){
rep(i, 18){
//cout << i << " " << p << endl;
if(d[i][p] >= b){
if(i == 0){
ans++;
goto enendd;
}else{
ans += powmod(2, i-1);
p = d[i-1][p];
break;
}
}
}
}
enendd:
cout << ans << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
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;
signed main(){
ll n,a,b; cin>>n>>a>>b;
cout<<(n-a+1)*(n-b+1)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,h,w;
cin >> n >> h >> w;
int a = 0;
int b = 0;
for(int i = 1; i <= n; i++){
if(i+w-1 <= n) a++;
if(i+h-1 <= n) b++;
}
cout << a*b << endl;
return 0;
} | 1 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
const ll Inf = 1L << 61;
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int V, E;
cin >> V >> E;
ll d[V][V];
REP(i,V) REP(j,V) {
if (i == j) d[i][j] = 0;
else d[i][j] = Inf;
}
REP(i,E) {
ll s, t, c;
cin >> s >> t >> c;
d[s][t] = c;
}
REP(k,V) REP(i,V) REP(j,V) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
REP(i,V) if (d[i][i] < 0) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
REP(i,V) REP(j,V) {
if (d[i][j] >= Inf >> 10) cout << "INF";
else cout << d[i][j];
if (j < V-1) cout << ' ';
else cout << '\n';
}
cout << flush;
return 0;
} | #include <stdio.h>
#include <limits.h>
int main(){
int n,m,s,i,j;
scanf("%d%d",&n,&m);
int e[m+1][3],dist[m+1],update=1,k,d[200][200];
//printf("xxx");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INT_MAX;
}
}
for(i=0;i<m;i++){
for(j=0;j<3;j++){
scanf("%d",&e[i][j]);
}
d[e[i][0]][e[i][1]]=e[i][2];
}
for(i=0;i<n;i++){
dist[i]=INT_MAX;
}
dist[s]=0;
for(i=0;i<n-1;i++){
update=0;
for(j=0;j<m;j++){
if(dist[e[j][0]]!=INT_MAX&&dist[e[j][1]]>dist[e[j][0]]+e[j][2]){
dist[e[j][1]]=dist[e[j][0]]+e[j][2];
update=1;
}
}
if(update==0)break;
}
for(j=0;j<m;j++){
if(dist[e[j][0]]!=INT_MAX&&dist[e[j][1]]>dist[e[j][0]]+e[j][2]){
printf("NEGATIVE CYCLE\n");
return 0;
}
}
for(k=0;k<n;k++){
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if((d[i][k]!=INT_MAX&&d[k][j]!=INT_MAX)&&d[i][j]>d[i][k]+d[k][j]){
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(j>0)printf(" ");
if(d[i][j]==INT_MAX){
printf("INF");
}
else{
printf("%d",d[i][j]);
}
}
printf("\n");
}
return 0;
} | 1 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
char s[4];
cin >> ("%s",s);
if(s[0]=='7'||s[1]=='7'||s[2]=='7')
cout << ("Yes");
else
cout << ("No");
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
//cout<<fixed<<setprecision(10);
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> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//以降 cin の入力元が 'input.txt' になる
//std::ifstream in("input.txt");
//std::cin.rdbuf(in.rdbuf());
signed main()
{
gearup;
string a,b,c; cin >> a >> b >> c;
int A = a.size();
int B = b.size();
int C = c.size();
if(a[A-1] == b[0] && b[B-1] == c[0])out("YES");
else out("NO");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100005;
int n,L,Q,x[maxn],f[maxn][18],g[maxn][18];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&x[i]);
scanf("%d",&L);
for(int i=1;i<=n;i++)
f[i][0]=upper_bound(x+1,x+n+1,x[i]+L)-x-1;
for(int j=1;j<=17;j++)
for(int i=n;i;i--)
f[i][j]=f[f[i][j-1]][j-1];
for(int i=1;i<=n;i++)
g[i][0]=lower_bound(x+1,x+n+1,x[i]-L)-x;
for(int j=1;j<=17;j++)
for(int i=1;i<=n;i++)
g[i][j]=g[g[i][j-1]][j-1];
int a,b;
scanf("%d",&Q);
while(Q--)
{
scanf("%d%d",&a,&b);
int ans=0;
if(a<b)
{
for(int i=17;i>=0;i--)
if(f[a][i]<b) a=f[a][i],ans+=(1<<i);
}
else
{
for(int i=17;i>=0;i--)
if(g[a][i]>b) a=g[a][i],ans+=(1<<i);
}
printf("%d\n",ans+1);
}
return 0;
} | #ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
# include <intrin.h>
# define __builtin_popcount __popcnt
#endif
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <iostream>
#include <vector>
#include <unordered_map>
#include <stack>
#include <list>
#include <math.h>
#include <map>
#include <iomanip>
#include <functional>
#include <string>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
template<class T> ostream& operator<<(ostream& os, const vector<T>& v) {
for (auto i = begin(v); i != end(v); i++) os << *i << (i == end(v) - 1 ? "" : " "); return os;
}
template<class T> istream& operator>>(istream& is, vector<T>& v) {
for (auto i = begin(v); i != end(v); i++) is >> *i; return is;
}
#define MOD 1000000007
struct Q {
int b_id;
int steps;
int q_id;
Q(int b_id, int q_id) : b_id(b_id), q_id(q_id), steps(0) {}
bool operator<(const Q& other) const
{
return std::tie(b_id, q_id) < std::tie(other.b_id, other.q_id);
}
};
int ofs[1000000];
int ans[1000000];
vector<set<Q>> qs;
void merge_into(int from, int to)
{
if (qs[from].size() > qs[to].size())
{
swap(qs[from], qs[to]);
swap(ofs[from], ofs[to]);
}
for (auto x : qs[from])
{
x.steps += ofs[from] - ofs[to];
qs[to].insert(x);
}
qs[from].clear();
}
int main() {
#if defined(_DEBUG)
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> x(n);
for (int i = 0; i < n; i++)
cin >> x[i];
qs.resize(n);
int L;
cin >> L;
int q;
cin >> q;
for (int i = 0; i < q; i++)
{
int a, b;
cin >> a >> b;
a--, b--;
if (a > b)
swap(a, b);
qs[a].insert(Q(b, i));
}
for (int i = 0; i < n; i++)
{
while (qs[i].size() > 0 && qs[i].begin()->b_id <= i)
{
auto f = *qs[i].begin();
qs[i].erase(qs[i].begin());
ans[f.q_id] = f.steps + ofs[i];
}
ofs[i]++;
int to = lower_bound(x.begin(), x.end(), x[i] + L + 1) - x.begin() - 1;
merge_into(i, to);
}
for (int i = 0; i < q; i++)
cout << ans[i] << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX = 1000000;
using Graph =vector<vector<lint>>;
typedef pair<lint,lint> P;
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint 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(lint n, lint k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num)
{
if (num < 2) return 0;
else if (num == 2) return 1;
else if (num % 2 == 0) return 0;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return 0;
}
}
return 1;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
lint lcm(lint a,lint b){
return a/__gcd(a,b)*b;
}
lint gcd(lint a,lint b){
return __gcd(a,b);
}
int main(){
lint n;
cin>>n;
tuple<lint,lint,lint> a[n];
tuple<lint,lint,lint>b[n];
rep(i,n){
lint a1,b1;
cin>>a1>>b1;
a[i]=make_tuple(b1+a1,a1,i);
b[i]=make_tuple(a1+b1,b1,i);
}
bool iseat[n];
fill(iseat,iseat+n,false);
sort(a,a+n,greater<tuple<lint,lint,lint>>());
sort(b,b+n,greater<tuple<lint,lint,lint>>());
lint ans=0;
lint i=0,j=0,k=0;
while(1){
lint s1,v1,c1;
tie(s1,v1,c1)=a[i];
while(iseat[c1]){
i++;
tie(s1,v1,c1)=a[i];
}
iseat[c1]=true;
ans+=v1;
k++;
if(k==n)break;
tie(s1,v1,c1)=b[j];
while(iseat[c1]){
j++;
tie(s1,v1,c1)=b[j];
}
iseat[c1]=true;
ans-=v1;
k++;
if(k==n)break;
i++;j++;
}
cout<<ans<<endl;
}
| #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <iomanip>
using lint = long long;
int main()
{
lint n;
scanf("%lld", &n);
std::vector<lint> a(n);
std::vector<lint> b(n);
std::vector<std::pair<lint, lint>> ab(n);
for (int i = 0; i < n; ++i)
{
lint a_e, b_e;
scanf("%lld", &a_e);
scanf("%lld", &b_e);
a[i] = a_e;
b[i] = b_e;
ab[i] = std::make_pair(-a_e - b_e, i);
}
std::sort(ab.begin(), ab.end());
lint ans_a = 0;
lint ans_b = 0;
for (int i = 0; i < n; ++i)
{
lint idx = ab[i].second;
if (i % 2 == 0)
{
ans_a += a[idx];
}
else
{
ans_b += b[idx];
}
}
printf("%lld", ans_a - ans_b);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
int n, m;
cin >> n >> m;
vt<int> p(n + 1), ac(n + 1);
while (m--) {
int x;
string s;
cin >> x >> s;
if (s == "AC") ac[x] = 1;
else if (!ac[x]) p[x]++;
}
int pen = 0;
for (int i = 1; i <= n; i++) pen += p[i] * ac[i];
cout << accumulate(all(ac), 0) << ' ' << pen;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int tcs = 1;
for (int tc = 1; tc <= tcs; tc++) {
// cout << "Case " << tc << ": ";
solve();
}
}
| #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vector<vector<long long int> >;
int main(void) {
// 問題番号, 正解したかどうか, WAの個数
map<Int, pair<Int, Int> > mp;
Int n, m;
cin >> n >> m;
for (Int i = 0; i < m; ++i) {
Int p;
string s;
cin >> p >> s;
--p;
if (mp[p].first == 0) {
if (s == "AC") {
mp[p].first = 1;
} else {
++mp[p].second;
}
}
}
Int ac_num = 0;
Int penalty_num = 0;
for (Int i = 0; i < n; ++i) {
if (mp[i].first != 0) {
ac_num += mp[i].first;
penalty_num += mp[i].second;
}
}
cout << ac_num << " " << penalty_num << endl;
return 0;
}
| 1 |
//
// abc167_Bracket_Sequencing.cpp
// learningCplusplus
//
// Created by Tran Duc Chinh on 2020/04/04.
// Copyright © 2020 Tran Duc Chinh. All rights reserved.
//
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
ll mod = 998244353;
ll INF = 1000000007;
#define PI 3.14159265
std::map<int, int> factorization (int n) {
std::map<int, int> f;
for (int i = 2; i*i <= n; i++) {
while (n%i == 0) {
f[i] += 1;
n /= i;
}
}
if (n > 1) {
f[n] += 1;
}
return f;
}
ll modpow (int x, int n) {
if (n==0) return 1%mod;
ll u = modpow(x, n/2);
u = (u*u)%mod;
if (n%2==1) u = (u*x)%mod;
return u;
}
void dfs(vector<int> A, int n, int m) {
if (A.size() > n) {
for (int i = 1; i <= n; i++) {
std::cout << A[i];
}
std::cout << std::endl;
return;
}
A.push_back(A.back());
while (A.back() <= m) {
dfs(A, n, m);
A.back()++;
}
}
const int MAX = 510000;
ll 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;
}
}
ll 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 HCOM(int n, int k) {
return (n == 0 && k == 0) ? 1 : COM(n+k-1, k);
}
int main() {
ll n;
std::cin >> n;
std::vector<string> s;
priority_queue<pair<ll, ll> > pos_q;
priority_queue<pair<ll, ll> > neg_q;
ll final_balance = 0;
for (int i = 0; i < n; i++) {
std::string t;
std::cin >> t;
s.push_back(t);
ll balance = 0;
ll min_prefix = 0;
for (int j = 0; j < t.size(); j++) {
if (t[j] == '(') {
balance++;
}
else {
balance--;
}
min_prefix = min(min_prefix, balance);
}
final_balance += balance;
if (balance != 0 || min_prefix != 0) {
if (balance >= 0) {
pos_q.push(make_pair(min_prefix, balance));
}
else {
neg_q.push(make_pair(min_prefix - balance, -balance)); // reverse sequence
}
}
}
bool check_pos = true;
int b_pos = 0;
while (!pos_q.empty()) {
pair<int, int> pos = pos_q.top();
pos_q.pop();
int prefix = b_pos + pos.first;
if (prefix < 0) { check_pos = false; break; }
b_pos += pos.second;
}
bool check_neg = true;
int b_neg = 0;
while (!neg_q.empty()) {
pair<int, int> neg = neg_q.top();
neg_q.pop();
int prefix = b_neg + neg.first;
if (prefix < 0) { check_neg = false; break; }
b_neg += neg.second;
}
if (final_balance == 0 && check_neg && check_pos) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
// std::cout << " balance: " << final_balance << " prefix: " << final_prefix << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3")
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x)
#endif
const int INF = 1e9; const LL LINF = 1e16;
const LL MOD = 1000000007; const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* ----- __MAKE_TIME__ Problem: __PROBLEM__ / Link: __CONTEST_URL__ ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
struct UnionFind {
vector<int> data;
UnionFind() {}
UnionFind(int n) { data.assign(n, -1); }
bool unionSet(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
bool same(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
auto f(const vector<PII>&edge) {
int id = 0;
map<int, int>M; {
for (const auto& it : edge) {
if (M.find(it.first) == M.end()) {
M[it.first] = id++;
}
if (M.find(it.second) == M.end()) {
M[it.second] = id++;
}
}
}
const int sz = id;
UnionFind uf(sz);
map<int, int>roots;
for (const auto& it : edge) {
uf.unionSet(M[it.first], M[it.second]);
}
int rootid = 0;
for (const auto& it : edge) {
if (roots.find(uf.root(M[it.first])) == roots.end()) {
roots[uf.root(M[it.first])] = rootid++;
}
//if (roots.find(uf.root(M[it.second])) == roots.end()) {
// // これはあってはならない
// assert(0);
// roots[uf.root(M[it.second])] = rootid++;
// }
}
vector<vector<PII>>res(rootid);
for (const auto& it : edge) {
res[roots[uf.root(M[it.first])]].push_back(it);
}
return res;
}
VL Dijkstra(vector<vector<PLL>>& G, int s) {
VL dist(SZ(G), LINF);
dist[s] = 0;
priority_queue<PLL, vector<PLL>, greater<PLL>> que;
que.push(PLL(0LL, s));
while (!que.empty()) {
PLL p = que.top(); que.pop();
int v; /* 頂点*/ long long d; /* 頂点vまでの距離 */
tie(d, v) = p;
if (d > dist[v]) continue;
FOR(i, 0, (int)G[v].size()) {
int nv = G[v][i].first;
if (dist[nv] > dist[v] + G[v][i].second) {
dist[nv] = dist[v] + G[v][i].second;
que.push(PLL(dist[nv], nv));
}
}
}
return dist;
}
int read() { int in; scanf("%d", &in); return in; }
int main() {
LL N = read(), M = read();
vector<vector<PII>>Cedge(1e6);
FOR(i, 0, M) {
int p = read() - 1, q = read() - 1, c = read() - 1;
Cedge[c].push_back(PII(p, q));
}
vector<vector<PLL>>G(N + 1e6); // 2Nでいい?
int cid = N;
FOR(c, 0, 1e6) {
auto res = f(Cedge[c]);
for (auto subedges : res) {
set<int>used;
for (auto e : subedges) {
if (used.find(e.first) == used.end()) {
G[cid].push_back(PLL(e.first, 1));
G[e.first].push_back(PLL(cid, 1));
used.insert(e.first);
}
if (used.find(e.second) == used.end()) {
G[cid].push_back(PLL(e.second, 1));
G[e.second].push_back(PLL(cid, 1));
used.insert(e.second);
}
}
cid++;
}
}
auto res = Dijkstra(G, 0);
LL ans = res[N - 1] / 2;
if (ans == LINF / 2)ans = -1;
cout << ans << "\n";
return 0;
} | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int n = 50;
int main() {
ll k;
cin >> k;
cout << n << endl;
vector<ll> ret(n, n - 1);
for (int i = 0; i < k % n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)ret[j] += n;
else ret[j]--;
}
}
for (int i = 0; i < n; i++) ret[i] += k / n;
for (int i = 0; i < n; i++) {
if (i > 0)cout << " ";
cout << ret[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
while(b){
a %= b;
swap(a, b);
}
return a;
}
int who_wins(vector<int> a){
int q[2] = {};
for(int v : a) q[v % 2]++;
if(q[0]%2){
return 1;
}
if(q[1] > 1){
return 2;
}
for(int &v : a) if(v%2){
if(v == 1) return 2;
v--;
}
int g = 0;
for(int v : a) g = gcd(g, v);
for(int & v : a) v /= g;
return 3 - who_wins(a);
}
int main(){
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
if(who_wins(a) == 1) cout << "First" << endl;
else cout << "Second" << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int s=0,i=0;
while(s<=n){
i++;
s=i*i;
}
i--;
cout << i*i << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
signed main(){
string N;
cin >> N;
int ans = 0;
bool kuriage = false;
for(int i = N.size()-1; i >= 0; i--) {
int keta = (int)(N[i]-'0');
if (kuriage) {
keta++;
}
kuriage = false;
if (keta > 5 || (keta == 5 && i > 0 && (int)(N[i-1]-'0') > 4) ) {
ans+=10-keta;
kuriage = true;
}
else {
ans+=keta;
}
}
if (kuriage) {
ans++;
}
cout << ans << endl;
}
| 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_accepted(void) {
string s;
cin >> s;
bool judge_a = false, judge_b = false, judge_c = false;
int cnt_c = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
if (s[i] == 'A') judge_a = true;
else break;
}
else if (s[i] == 'C'){
if (i >= 2 && i < s.size() - 1) {
cnt_c++;
}
}
else {
if (s[i] < 'a') {
judge_c = false;
break;
}
else judge_c = true;
}
}
if (cnt_c == 1) judge_b = true;
if (judge_a & judge_b & judge_c) {
cout << "AC" << endl;
}
else {
cout << "WA" << endl;
}
}
int main()
{
b_accepted();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string S;cin>>S;
if(S[0]!='A'||S.size()<3){printf("WA");return 0;}
int countc=0;
for(int i=2;i<S.size()-1;i++)if(S[i]=='C')countc++;
if(countc!=1){printf("WA");return 0;}
for(int i=1;i<S.size();i++)if(S[i]!='A'&&S[i]!='C'&&S[i]-'A'>=0&&S[i]-'A'<=26){printf("WA");return 0;}
printf("AC");
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long N;
vector<long> t;
cin >> N;
for (int i = 0; i < 5; ++i) {
long k;
cin >> k;
t.push_back(k);
}
long min = *min_element(begin(t), end(t));
cout << ((N - 1) / min) + 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI a(n+2);
a[0]=0;
a[n+1]=0;
for(int i=1;i<=n;i++){
cin >> a.at(i);
}
ll ro=0;
rep(i,n+2){
ro+=abs(a[i]-a[i+1]);
}
for(int i=1;i<=n;i++){
if((a[i]-a[i-1])*(a[i+1]-a[i])>=0){
cout << ro << endl;
}
else{
int z=min(abs(a[i]-a[i-1]),abs(a[i+1]-a[i]));
cout << ro-2*z << endl;
}
}
}
| 0 |
#include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if (X < 9 && Y <9){
cout << "Yay!" << endl;
return 0;
}
cout << ":(" << endl;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int l, i=0, a[10];
while(2 > i){
cin >> a[i];
i++;
}
if (a[0] > 8 || a[1] > 8) {
cout << ":(" << "\n";
} else {
cout << "Yay!" << "\n";
}
} | 1 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using vector2d=vector<vector<T>>;
struct fixprec{int p;fixprec(int p):p(p){}};
ostream&operator<<(ostream&o,fixprec f){return o<<fixed<<setprecision(f.p);}
/*!* [binsearch] *!*/
/*+* 二分探索 *+*/
// judge を満たすような(l,r]内の下限を求める
// l:[X] 定義域の下限
// r:[X] 定義域の上限
// judge:[F = X -> bool] 値 X を評価する関数
// lower:[bool] false にすると代わりに[l,r)内の上限を求める
// eps:[X] 終了距離
template <typename X, typename F>
X BinSearch(X l, X r, F judge, bool lower = true, X eps = 1) {
while (r - l > eps) {
X m = (r + l) / 2;
if (judge(m) == lower) {
r = m;
} else {
l = m;
}
}
return lower ? r : l;
}
struct Data {
i64 b, l, u;
bool operator<(const Data &x) const {
return make_tuple(b, l, u) < make_tuple(x.b, x.l, x.u);
}
};
int main() {
const i64 INF = 1e14;
i64 N, X;
cin >> N >> X;
vector<pair<i64, Data>> data(N);
i64 S_N = 0;
for(int i = 0; i < N; i++) {
i64 b, l, u;
cin >> b >> l >> u;
data[i] = {u * (X - b) + l * b, {b, l, u}};
S_N += l * b;
}
// O(N log N)
sort(REV_WHOLE(data));
vector<i64> S(N);
for(int i = 0; i < N; i++) {
S[i] = data[i].first + (i ? S[i - 1] : 0);
}
// O(N log NX)
i64 ans = BinSearch<i64>(-1, N * X, [&](i64 A) -> bool {
// O(N)
// (sum of a_i) <= A ?
i64 m = A / X;
i64 r = A - m * X;
for(int j = 0; j < N; j++) {
i64 e = 0;
i64 x;
Data d;
tie(x, d) = data[j];
e += max(d.l * (r - d.b), d.u * (r - d.b)) + d.l * d.b;
if(m > 0) {
e += j < m ? S[m] - x : S[m - 1];
}
e -= S_N;
if(e >= 0) return true;
}
return false;
});
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
tuple<long long, long long, char> XYU[N];
tuple<long long, long long, char> YXU[N];
tuple<long long, long long, char> XYU_45[N];
tuple<long long, long long, char> YXU_45[N];
for (int i = 0; i < N; i++) {
int x, y;
char u;
cin >> x >> y >> u;
XYU[i] = make_tuple(x, y, u);
YXU[i] = make_tuple(y, x, u);
XYU_45[i] = make_tuple(x - y, x + y, u);
YXU_45[i] = make_tuple(x + y, x - y, u);
}
long long ans = INT_MAX;
sort(XYU, XYU + N);
sort(YXU, YXU + N);
sort(XYU_45, XYU_45 + N);
sort(YXU_45, YXU_45 + N);
for (int i = 0; i < N; i++) {
if (get<2>(XYU[i]) != 'U') continue;
int j = i + 1;
while (j < N && get<0>(XYU[i]) == get<0>(XYU[j])) {
if (get<2>(XYU[j]) == 'U') i = j;
if (get<2>(XYU[j]) == 'D') {
ans = min(ans, 5 * (get<1>(XYU[j]) - get<1>(XYU[i])));
}
j++;
}
i = j - 1;
}
for (int i = 0; i < N; i++) {
if (get<2>(YXU[i]) != 'R') continue;
int j = i + 1;
while (j < N && get<0>(YXU[i]) == get<0>(YXU[j])) {
if (get<2>(YXU[j]) == 'R') i = j;
if (get<2>(YXU[j]) == 'L') {
ans = min(ans, 5 * (get<1>(YXU[j]) - get<1>(YXU[i])));
}
j++;
}
i = j - 1;
}
for (int i = 0; i < N; i++) {
if (get<2>(XYU_45[i]) != 'R') continue;
int j = i + 1;
while (j < N && get<0>(XYU_45[i]) == get<0>(XYU_45[j])) {
if (get<2>(XYU_45[j]) == 'R') i = j;
if (get<2>(XYU_45[j]) == 'D') {
ans = min(ans, 5 * (get<1>(XYU_45[j]) - get<1>(XYU_45[i])));
}
j++;
}
i = j - 1;
}
for (int i = 0; i < N; i++) {
if (get<2>(XYU_45[i]) != 'U') continue;
int j = i + 1;
while (j < N && get<0>(XYU_45[i]) == get<0>(XYU_45[j])) {
if (get<2>(XYU_45[j]) == 'U') i = j;
if (get<2>(XYU_45[j]) == 'L') {
ans = min(ans, 5 * (get<1>(XYU_45[j]) - get<1>(XYU_45[i])));
}
j++;
}
i = j - 1;
}
for (int i = 0; i < N; i++) {
if (get<2>(YXU_45[i]) != 'R') continue;
int j = i + 1;
while (j < N && get<0>(YXU_45[i]) == get<0>(YXU_45[j])) {
if (get<2>(YXU_45[j]) == 'R') i = j;
if (get<2>(YXU_45[j]) == 'U') {
ans = min(ans, 5 * (get<1>(YXU_45[j]) - get<1>(YXU_45[i])));
}
j++;
}
i = j - 1;
}
for (int i = 0; i < N; i++) {
if (get<2>(YXU_45[i]) != 'D') continue;
int j = i + 1;
while (j < N && get<0>(YXU_45[i]) == get<0>(YXU_45[j])) {
if (get<2>(YXU_45[j]) == 'D') i = j;
if (get<2>(YXU_45[j]) == 'L') {
ans = min(ans, 5 * (get<1>(YXU_45[j]) - get<1>(YXU_45[i])));
}
j++;
}
i = j - 1;
}
if (ans == INT_MAX) {
cout << "SAFE" << endl;
} else {
cout << ans << endl;
}
return 0;
}
| 0 |
//E869120さんのコード
#include <bits/stdc++.h>
using namespace std;
long long N; string S;
int main() {
cin >> N;
if (N == 0) { cout << "0" << endl; return 0; }
while (N != 0) {
if (N % 2 == 1 || N % 2 == -1) { N--; S += "1"; }
else { S += "0"; }
N /= -2;
}
reverse(S.begin(), S.end());
cout << S << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
bool ans=true;
int cnt=0;
for(int i=0;i<s.size();i++){
if(isupper(s[i])) cnt++;
}
if(cnt!=2) ans=false;
cnt=0;
if(s[0]!='A') ans=false;
for(int i=2;i<s.size()-1;i++){
if(s[i]=='C') cnt++;
}
if(cnt!=1) ans=false;
if(ans) cout<<"AC"<<endl;
else cout<<"WA"<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int ans, n, m1, m2, m3, m4;
int a[N];
int cnt0[N];
int cnt1[N];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; i += 2) {
int m = a[i];
++cnt0[m];
if (m == m1) continue;
if (cnt0[m] > cnt0[m1]) {
m2 = m1;
m1 = m;
} else if (cnt0[m] > cnt0[m2]) {
m2 = m;
}
}
for (int i = 1; i < n; i += 2) {
int m = a[i];
++cnt1[m];
if (m == m3) continue;
if (cnt1[m] > cnt1[m3]) {
m4 = m3;
m3 = m;
} else if (cnt1[m] > cnt1[m4]) {
m4 = m;
}
}
if (m2 == m1) m2 = 0;
if (m4 == m3) m4 = 0;
if (m1 != m3) {
ans = n - cnt0[m1] - cnt1[m3];
} else {
ans = min(n - cnt0[m1] - cnt1[m4],
n - cnt0[m2] - cnt1[m3]);
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int a[3][100000];
int x[100000];
int inv[100000];
int BIT[100001];
void init(){
for(int i=1;i<=100000;i++)
BIT[i]=0;
}
void add(int x){
for(;x<=100000;x+=x&-x)
BIT[x]++;
}
int query(int x){
int res=0;
for(;x>0;x-=x&-x)
res+=BIT[x];
return res;
}
void fail(){
cout<<"No"<<endl;
exit(0);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
for(int i=0;i<3;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
vector<pair<int,int> > v0,v1;
long long int cnt0=0,cnt1=0,inv0=0,inv1=0;
for(int i=0;i<n;i++){
if(abs(a[0][i]-a[1][i])!=1||abs(a[1][i]-a[2][i])!=1)
fail();
x[i]=a[1][i]/3;
if((x[i]&1)^(i&1))
fail();
inv[i]=a[0][i]>a[1][i];
if(i&1)
v1.emplace_back(x[i],i),inv1+=inv[i];
else
v0.emplace_back(x[i],i),inv0+=inv[i];
}
sort(v1.begin(),v1.end(),greater<pair<int,int> >());
sort(v0.begin(),v0.end(),greater<pair<int,int> >());
for(auto it:v0){
cnt0+=query(it.second+1);
add(it.second+1);
}
init();
for(auto it:v1){
cnt1+=query(it.second+1);
add(it.second+1);
}
if((inv1+cnt0)&1)
fail();
if((inv0+cnt1)&1)
fail();
cout<<"Yes"<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
#define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);}
template<typename T>
string join(const vector<T>&v, string del=", "){ stringstream s;
for(auto x : v) s << del << x; return s.str().substr(del.size());
}
template<typename T>
ostream& operator<<(ostream& o, const vector<T>&v){
if(v.size()) o << "[" << join(v) << "]"; return o;
}
template<typename T>
ostream& operator<<(ostream& o, const vector<vector<T> >&vv){
int l = vv.size();
if(l){ o<<endl; rep(i,l) o << (i==0 ? "[ " : ",\n " ) << vv[i] << (i==l-1 ? " ]" : ""); }
return o;
}
template<typename T1, typename T2>
ostream& operator<<(ostream& o, const pair<T1, T2>& p){
return o << "(" << p.first << ", " << p.second << ")";
}
inline void _debug(){cerr<<endl;}
template<class First, class... Rest>
void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const double PI = (1*acos(0.0));
const double EPS = 1e-9;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;
inline void finput(string filename) {
freopen(filename.c_str(), "r", stdin);
}
int main(){
ios_base::sync_with_stdio(0);
// finput("./input");
int n; cin >> n;
string s; cin >> s;
if(s[0] == 'W'){
cout << 0 << endl;
return 0;
}
vi a(2*n);
a[0] = 0;
REP(i,1,2*n){
if(s[i] != s[i-1]){
a[i] = a[i-1];
}else{
a[i] = a[i-1] ^ 1;
}
}
ll cnt = 0;
ll ans = 1;
rep(i,2*n){
if(a[i] == 1){
ans *= cnt;
ans %= mod;
cnt--;
}else{
cnt++;
}
if(cnt < 0){
cout << 0 << endl;
return 0;
}
}
if(cnt != 0){
cout << 0 << endl;
}else{
rep(i,n){
ans *= i+1;
ans %= mod;
}
cout << ans << endl;
}
return 0;
} | //g++ -std=c++14 test.cpp -o test.out
//問題URL
//https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_c
//左端、右端を選んで操作、という操作は
//まず左端のみに注目し、次に右端のみに注目していく
//また最左端にまとめるなんて考え方も
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (LL)(1e18)+1;
const int INF_INT = 2147483647-1e6;
const LL mod = 1000000007ll;
int N;
string S;
LL ans = 1;
void solve(){
int cur = 0;
for(int i=0;i<2*N;i++){
if(S[i]=='B'){
if(cur%2==1){
ans = ans*cur%mod;
cur--;
}else{
cur++;
}
}
if(S[i]=='W'){
if(cur%2==1){
cur++;
}else{
ans = ans*cur%mod;
cur--;
}
}
}
if(cur>0) ans = 0;
for(int i=0;i<N;i++) ans = ans*(i+1)%mod;
}
int main(){
cin >> N;
cin >> S;
solve();
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(),(v).end()
#define FIN ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll mod = 1e9+7;
const ll inf = 1e15;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
int main(){FIN
vll a(3); REP(i,3) cin>>a[i];
ll k;cin>>k;
VSORTR(a);
a[0] *= power(2,k);
cout<<a[0]+a[1]+a[2]<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, k, tem, ans;
cin >> a >> b >> c >> k;
ans = a + b + c - max({a, b, c});
tem = max({a, b, c});
for ( int i = 0; i < k; i++ ) {
tem *= 2;
}
cout << ans + tem << endl;
return (0);
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
bool fc(vector<int> &a, int m, int v, int p, int mid){
int n = a.size();
if(mid < p) return true;
vector<int> tr;
rep(i, n){
if(i == mid) continue;
tr.push_back(a.at(i));
}
ll top = a.at(mid) + m;
if(top < tr.at(p-1)) return false;
ll ex = (ll)(v-1)*m;
rep(i, n-1){
if(i < p-1) ex -= m;
else ex -= min((ll)m, top - tr.at(i));
}
return ex <= 0;
}
int main(){
int n, m;
cin >> n >> m;
int v, p;
cin >> v >> p;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
sort(ALL(a), greater<int>());
int ng = n, ok = 0;
while(ng - ok > 1){
int mid = (ok + ng)/2;
if(fc(a, m, v, p, mid) == true) ok = mid;
else ng = mid;
}
int ans = ok+1;
cout << ans << endl;
return 0;
} | #include<cstdio>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
const int N=100005;
int n,a[N],m,v,p; long long sum[N];
inline bool cmp(CI x,CI y)
{
return x>y;
}
int main()
{
RI i; for (scanf("%d%d%d%d",&n,&m,&v,&p),i=1;i<=n;++i) scanf("%d",&a[i]);
for (sort(a+1,a+n+1,cmp),i=1;i<=n;++i) sum[i]=sum[i-1]+a[i];
for (i=p+1;i<=n;++i)
{
int dlt=max(0,v-(p+n-i)); long long tot=sum[i-1]-sum[p-1];
if (a[i]+m<a[p]||1LL*(i-p)*(a[i]+m)+1-tot<=1LL*dlt*m) return printf("%d",i-1),0;
}
return printf("%d",n),0;
} | 1 |
#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 each(itr,v) for(auto itr:v)
#define pb push_back
#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_popcount
#define INF INT_MAX/3
//#define N 2000
template<size_t N>
const bitset<N> operator+(const bitset<N>& lhs, const bitset<N>& rhs)
{
bitset<N> a(lhs), b(rhs), ret(lhs ^ rhs);
for (b = (a & b) << 1, a = ret; b.any(); b = (a & b) << 1, a = ret) ret ^= b;
return ret;
}
template<size_t N>
int edit_distance_bitset(const string& str1, const string& str2)
{
char s1[N] = { ' ' };
char s2[N] = { ' ' };
char *p1, *p2;
if (str1.size() >= str2.size()) { p1 = s1; p2 = s2; }
else { p1 = s2; p2 = s1; }
copy(str1.begin(), str1.end(), p1 + 1);
copy(str2.begin(), str2.end(), p2 + 1);
int m = strlen(s1);
int n = strlen(s2);
const bitset<N> ONE(1);
bitset<N> Peq[256];
bitset<N> Pv, Mv, Eq, Xv, Xh, Ph, Mh;
int Score = m;
for (int i = 0; i < m; i++) {
Peq[s1[i]] |= ONE << i;
Pv |= (ONE << i);
}
for (int j = 0; j < n; j++) {
Eq = Peq[s2[j]];
Xv = Eq | Mv;
Xh = (((Eq & Pv) + Pv) ^ Pv) | Eq;
Ph = Mv | ~(Xh | Pv);
Mh = Pv & Xh;
if ((Ph & (ONE << (m - 1))).any()) Score++;
else if ((Mh & (ONE << (m - 1))).any()) Score--;
Ph = Ph << 1 | ONE;
Pv = (Mh << 1) | ~(Xv | Ph);
Mv = Ph & Xv;
}
return Score;
}
int main(){
string a,b;
cin>>a>>b;
cout<<edit_distance_bitset<2000>(a,b)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s, t) for(int i = s; i < t; i++)
#define ALL(a) a.begin(), a.end()
#define SZ(x) (int)x.size()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define SORT(a) sort(ALL(a))
using VI = vector<int>;
using LL = long long;
using VVL = vector<vector<LL>>;
using VL = vector<LL>;
const LL LINF = 1e18;
int editDistance(string& s, string& t) {
VVL dp(1010, VL(1010, 0));
FOR(i, 0, 1010) {
dp[i][0] = i;
dp[0][i] = i;
}
FOR(i, 0, SZ(s)) {
FOR(j, 0, SZ(t)) {
int cost = (s[i] == t[j]) ? 0 : 1;
dp[i + 1][j + 1] = min(dp[i][j] + cost, min(dp[i + 1][j] + 1, dp[i][j + 1] + 1));
}
}
return dp[s.size()][t.size()];
}
signed main() {
string s, t;
cin >> s >> t;
cout << editDistance(s, t) << endl;
}
| 1 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
typedef pair<int,int>P;
const int N = 1 << 17;
//?????????????????????0?§???????
//????°????????±???????????????°??????(RMQ)
//?????°???????????¨???????????°??????????????????
int n,n_,q,ud[2*N-1],t[2*N-1];
//?????????
//n_???x??\??????????°????2????????????
void init(int x)
{
//?°????????????????????´???°???2???????????????
n_=1;
while(n_<x){
n_*=2;
}
rep(i,2*n_-1){
ud[i] = (int)((1LL<<31) -1LL);
t[i] = -1;
}
}
//k????????????????????§??????
int find(int k)
{
P res;
//????????????
k += n_-1;
res.first = ud[k];
res.second = t[k];
//?????????????????´??°
while(k>0){
k = (k-1)/2;
if(t[k] > res.second){
res.first = ud[k];
res.second = t[k];
}
}
return res.first;
}
//[a,b)???????°????????±??????????
//k??????????????????
//????????????query(a,b,0,0,n_)??¨???????????¶???(n_??¨???????????¨?????¨???)
void update(int a,int b,int k,int l,int r,int val,int id)
{
if(r <= a || b <= l){
return;
}
if(a <= l && r <= b){
ud[k] = val;
t[k] = id;
}else{
update(a,b,2*k+1,l,(l+r)/2,val,id);
update(a,b,2*k+2,(l+r)/2,r,val,id);
}
}
int main()
{
scanf("%d%d",&n,&q);
init(n);
rep(i,q){
int x;
scanf("%d",&x);
if(x==0){
int s,t,u;
scanf("%d%d%d",&s,&t,&u);
update(s,t+1,0,0,n_,u,i);
}else{
int s;
scanf("%d",&s);
printf("%d\n",find(s));
}
}
return 0;
} | #include <cmath>
#include <cstdio>
#include <vector>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int N, Q;
int main() {
scanf("%d%d", &N, &Q);
vector<int> tp(Q), s(Q), t(Q), x(Q);
for (int i = 0; i < Q; i++) {
scanf("%d%d", &tp[i], &s[i]);
if (tp[i] == 0) scanf("%d%d", &t[i], &x[i]), t[i]++;
}
vector<int> d(N, 2147483647);
int B = sqrt(Q);
for (int i = 0; i < B; i++) {
int l = 1LL * i * Q / B, r = 1LL * (i + 1) * Q / B;
for (int j = l; j < r; j++) {
if (tp[j] == 1) {
bool flag = false;
for (int k = j - 1; k >= l; k--) {
if (tp[k] == 0 && s[k] <= s[j] && s[j] < t[k]) {
printf("%d\n", x[k]); flag = true;
break;
}
}
if (!flag) printf("%d\n", d[s[j]]);
}
}
vector<int> cp = { 0, N };
for (int j = l; j < r; j++) {
if (tp[j] == 0) {
cp.push_back(s[j]);
cp.push_back(t[j]);
}
}
sort(cp.begin(), cp.end());
cp.erase(unique(cp.begin(), cp.end()), cp.end());
vector<int> f(cp.size() - 1, -1);
for (int j = l; j < r; j++) {
if (tp[j] == 0) {
int pl = lower_bound(cp.begin(), cp.end(), s[j]) - cp.begin();
int pr = lower_bound(cp.begin(), cp.end(), t[j]) - cp.begin();
for (int k = pl; k < pr; k++) f[k] = x[j];
}
}
for (int j = 0; j < cp.size() - 1; j++) {
if (f[j] != -1) {
for (int k = cp[j]; k < cp[j + 1]; k++) d[k] = f[j];
}
}
}
return 0;
} | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define RRep(i, r, n) for (ll i = n - 1; i <= r; i--)
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define int long long
#define pb push_back
const int dx[] = {0, -1, 0, 1};
const int dy[] = {1, 0, -1, 0};
const int MOD = (1000000007);
//const int MOD = (998244353);
//const int INF = (1 << 30)-1;
const int INF = (1LL << 60)-1;
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
using Graph = vector<vector<pair<int, int>>>;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
//---------------------------------------------
int n,k;
cin>>n>>k;
cout<<n-k+1<<endl;
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
int n, k;
int main() {
read(n), read(k);
print(n - k + 1);
}
| 1 |
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
#define MAX 32
typedef long long ll;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int n, m;
bool exist[MAX][MAX];
int main(void) {
while (cin >> n) {
if (n == 0) break;
for (int i = 0; i <= 20; i++) {
for (int j = 0; j <= 20; j++) {
exist[i][j] = false;
}
}
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
exist[y][x] = true;
}
int nowx = 10;
int nowy = 10;
cin >> m;
for (int i = 0; i < m; i++) {
//printf("now pos (%d %d)\n", nowx, nowy);
char d;
int l;
cin >> d >> l;
if (exist[nowy][nowx]) exist[nowy][nowx] = false;
if (d == 'N') {
for (int j = 0; j < l; j++) {
nowy++;
if (exist[nowy][nowx]) exist[nowy][nowx] = false;
}
}
if (d == 'S') {
for (int j = 0; j < l; j++) {
nowy--;
if (exist[nowy][nowx]) exist[nowy][nowx] = false;
}
}
if (d == 'E') {
for (int j = 0; j < l; j++) {
nowx++;
if (exist[nowy][nowx]) exist[nowy][nowx] = false;
}
}
if (d == 'W') {
for (int j = 0; j < l; j++) {
nowx--;
if (exist[nowy][nowx]) exist[nowy][nowx] = false;
}
}
}
if (exist[nowy][nowx]) exist[nowy][nowx] = false;
bool ok = true;
for (int y = 0; y <= 20; y++) {
for (int x = 0; x <= 20; x++) {
if (exist[y][x]) {
ok = false;
break;
}
}
if (!ok) break;
}
if (ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using hset = unordered_set<T>;
template<class Key, class T> using hmap = unordered_map<Key, T>;
map<char, int> news = {{'N', 0}, {'E', 1}, {'S', 2}, {'W', 3}};
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main() {
int N, M, I, x, y;
char d;
hset<int> st;
while (cin >> N) {
st.clear();
if (N == 0) break;
for (int i = 0; i < N; i++) {
cin >> x >> y;
st.insert(y*21 + x);
}
cin >> M;
x = 10; y = 10;
for (int i = 0; i < M; i++) {
cin >> d >> I;
for (int j = 0; j < I; j++) {
x += dx[news[d]];
y += dy[news[d]];
st.erase(y*21 + x);
}
}
if (st.empty()) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x)
using namespace std;
typedef unsigned int uint;
typedef long long ll;
const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};
int getInt(){
int ret = 0,c;
c = getchar();
while(!isdigit(c)) c = getchar();
while(isdigit(c)){
ret *= 10;
ret += c - '0';
c = getchar();
}
return ret;
}
int main(){
int n;
while(n = getInt()){
REP(i,n){
int pm = getInt();
int pe = getInt();
int pj = getInt();
int sum = pm + pe + pj;
if((pm == 100 || pe == 100 || pj == 100) ||
(pm + pe >= 180) || (sum >= 240)){
puts("A");
}else if((sum >= 210) ||
(sum >= 150 && (pm >= 80 || pe >= 80))){
puts("B");
}else{
puts("C");
}
}
}
return 0;
} | #include <cstdio>
using namespace std;
typedef long long LL;
const int N = 55;
int n; LL K, a[N];
template <class T> inline void in(T &x) {
x = 0; int f = 1; char ch = getchar();
for (; ch<'0' || ch>'9';) {if (ch=='-') f=-1; ch = getchar();}
for (; ch>='0' && ch<='9';) x = x*10 + (LL)ch-'0', ch = getchar();
x *= f;
}
inline void work() {
in(K), n = 50; LL tmp = K / n;
for (int i = 1; i <= n; ++i) a[i] = n - 1;
for (int i = 1; i <= n; ++i) a[i] += tmp;
for (int i = 1; i <= K % n; ++i) {
a[i] += n;
for (int j = 1; j <= n; ++j) if (i != j) --a[j];
}
int lim = K % n;
printf("%d\n", n);
for (int i = 1; i < n; ++i) printf("%lld ", a[i]);
printf("%lld\n", a[n]);
}
int main() {work(); return 0;} | 0 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using namespace std;
int main()
{
int D;
long long G;
int p[10];
long long c[10];
long long sum[10];
long long ans = 10000000;
cin >> D >> G;
for (int i = 0;i < D;i++){
cin >> p[i] >> c[i];
sum[i] = 100*(i+1)*p[i] + c[i];
}
for (int i = 0;i < (1<<D);i++){
long long res = 0;
long long pre = 0;
for (int j = 0;j < D;j++){
if ((i>>j)%2){
res += sum[j];
pre += p[j];
}
}
if (res < G){
for (int j = D-1;j >= 0;j--){
if ((i>>j)%2==0){
for (int k = 0;k < p[j]-1;k++){
res += 100*(j+1);
pre++;
if (res >= G){
goto EXIT;
}
}
}
}
}
EXIT:
if(res >= G){
ans = min(ans,pre);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
cout << (expr ? "Yes" : "No") << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
string S;
cin >> S;
string S1 = S.substr(0, N);
string S2 = S.substr(N, N);
lint ans = 0;
REP(k, 1<<N) {
string a = "";
string b = "";
REP(i, N) {
if((k>>i&1) == 1) {
a = S1[i] + a;
} else {
b = S1[i] + b;
}
}
vector<vector<lint>> dp(N+1, vector<lint>(a.size()+1));
dp[0][0] = 1;
REP(i, N) {
REP(j, a.size()+1) {
if(j != a.size() && S2[i] == a[j]) {
dp[i+1][j+1] += dp[i][j];
}
if(S2[i] == b[i-j]) {
dp[i+1][j] += dp[i][j];
}
}
}
ans += dp[N][a.size()];
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
int B;
cin >> B;
int count=0;
int a1,a2,a3,a4;
// ここにプログラムを追記
for(int i=0;i<B-A+1;i++){
a1=(A+i)/10000;
a2=((A+i)%10000)/1000;
a3=(((A+i)%10000)%1000)%100/10;
a4=(((A+i)%10000)%1000)%100%10;
if(a1==a4 && a2==a3){
count++;
}
}
cout << count << endl;
} | /* FUCK U*/
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
using namespace std;
void solve(){
int n,k,count;
cin>>n>>k;
for(int i=n;i<=k;++i){
string str=to_string(i);
if(str.at(0)==str.at(4) && str.at(1)== str.at(3))
count++;
}
cout<<count<<endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | 1 |
#include <iostream>
int triple(int n) {
return n * n * n;
}
int main() {
int input;
std::cin >>input;
std::cout << triple(input) << std::endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
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; }
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
vector<ll> enum_divisors(ll N){
vector<ll> res;
for (ll i = 1; i * i <= N; ++i){
if (N % i == 0){
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
sort(res.begin(), res.end());
return res;
}
int digit(ll a){
int res = 0;
while(a > 0){
a /= 10;
res++;
}
return res;
}
int f(ll a, ll b){
return max(digit(a),digit(b));
}
int main(){
ll N; cin >> N;
vector<ll> divisors = enum_divisors(N);
int ans = 100000000;
for(auto divisor : divisors){
ll a = divisor;
ll b = N/divisor;
ans = min(ans, f(a,b));
}
cout << ans << endl;
} | 0 |
#include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int base[3] = {0, 0, 0};
void Hit()
{
if (base[2] == 1)
{
base[2] = 0;
}
if (base[1] == 1)
{
base[2] = 1;
}
if (base[0] == 1)
{
base[1] = 1;
}
else if (base[0] == 0)
{
base[0] = 1;
}
}
void Homerun()
{
for (int i = 0; i < 3; i++)
{
base[i] = 0;
}
}
int main()
{
int out = 0;
int score = 0;
int n;
string s;
vector <string> event;
int eventnum = 0;
cin >> n;
int a = 0;
for (int i = 0; i < 3 * n; i++)
{
while (true)
{
cin >> s;
event.push_back(s);
if (event.at(a) == "OUT")
{
a += 1;
eventnum += 1;
break;
}
else
{
a += 1;
eventnum += 1;
}
}
}
for (int i = 0; i < eventnum; i++)
{
if (event.at(i) == "HIT")
{
if (base[2] == 1)
{
score += 1;
}
Hit();
}
else if (event.at(i) == "HOMERUN")
{
score += base[0] + base[1] + base[2] + 1;
Homerun();
}
else
{
out += 1;
if (out == 3)
{
cout << score << endl;
for (int i = 0; i < 3; i++)
{
base[i] = 0;
}
score = 0;
out = 0;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define double long double
int n;
string s;
int cache[1000004][3];
int dp(int pos,int carr)
{
if(pos==n)
return carr;
int &ans=cache[pos][carr];
if(ans!=-1)
return ans;
ans=1e18;
for(int i=0;i<10;i++)
{
int dig1=i;
int dig2=(i+carr+s[pos]-'0')%10;
ans=min(ans,dig1+dig2+dp(pos+1,(i+carr+s[pos]-'0')/10));
}
return ans;
}
int32_t main()
{
cin>>s;
reverse(s.begin(),s.end());
n=s.length();
memset(cache,-1,sizeof(cache));
print(dp(0,0));
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100010,mod=998244353;
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline int read(){
int x=0,f=0;char ch=getchar();
while(ch<'0' || ch>'9') f|=ch=='-',ch=getchar();
while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
return f?-x:x;
}
int n,m,lim,wsum,e[15][15],f[1<<15][15],tot[1<<15];
inline void chkmax(int &x,int y){if(x<y) x=y;}
int main(){
n=read();m=read();lim=1<<n;
FOR(i,1,m){
int u=read()-1,v=read()-1;
wsum+=e[u][v]=e[v][u]=read();
}
FOR(i,0,lim-1) FOR(j,0,n-1) if((i>>j)&1) FOR(k,j+1,n-1) if((i>>k)&1) tot[i]+=e[j][k];
MEM(f,~0x3f);
f[1][0]=0;
FOR(i,1,lim-1) FOR(j,0,n-1) if((i>>j)&1){
FOR(k,0,n-1) if(!((i>>k)&1) && e[j][k]) chkmax(f[i|(1<<k)][k],f[i][j]+e[j][k]);
int re=(lim-1)^i;
for(int k=re;k;k=((k-1)&re)) chkmax(f[i|k][j],f[i][j]+tot[k|(1<<j)]);
}
printf("%d\n",wsum-f[lim-1][n-1]);
} | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int N, M;
int a[300], b[300], c[300];
int g[15][15];
ll dp[1<<15][15];
const ll INF = 1e+12;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
cin >> N >> M;
int sum = 0;
for(int i = 0; i < M; i++) {
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--;
g[a[i]][b[i]] = c[i];
g[b[i]][a[i]] = c[i];
sum += c[i];
}
int fin = (1<<N)-1;
for(int i = 1; i < (1<<N); i++){
if(i%2 == 0) continue;
for(int j = 0; j < N; j++){
if(!(i&(1<<j))) continue;
for(int k = j+1; k < N; k++){
if(!(i&(1<<k))) continue;
dp[i][0] += g[j][k];
}
}
}
for(int i = 1; i < (1<<N); i++){
for(int j = 0; j < N; j++){
if(i == 1 && j == 0) continue;
if(dp[i][j] == 0) dp[i][j] = -INF;
}
}
for(int i = 1; i < (1<<N); i++){
if(i%2 == 0) continue;
if(i&(1<<(N-1))) continue;
for(int j = (i+1)|i; j < (1<<N); j = (j+1)|i){
int rem = j-i;
ll sum_rem = 0;
for(int k = 0; k < N; k++){
for(int l = k+1; l < N; l++){
if((rem&(1<<k)) && (rem&(1<<l))) sum_rem += g[k][l];
}
}
// cout << i << '-' << j << ' ' << rem << ' ' << sum_rem << endl;
if(j&(1<<(N-1))){
// N-1に行く
for(int k = 0; k < N; k++){
if(!(i&(1<<k))) continue;
if(g[k][N-1] == 0) {}
else{
// if(i == 7) cout << i << "at"<< k << "dp" << dp[i][k] << '-' << j << endl;
dp[j][N-1] = max(dp[j][N-1], dp[i][k]+sum_rem+g[k][N-1]);
}
}
}else{
// k -> l
for(int k = 0; k < N; k++){
if(!(i&(1<<k))) continue;
for(int l = 0; l < N; l++){
if(!(rem&(1<<l))) continue;
if(g[k][l] == 0) {}
else{
dp[j][l] = max(dp[j][l], dp[i][k]+sum_rem+g[k][l]);
}
}
}
}
}
}
ll g_max = 0;
for(int i = 0; i < (1<<N); i++){
g_max = max(g_max, dp[i][N-1]);
// cout << dp[i][N-1] << endl;
}
cout << sum-g_max << endl;
} | 1 |
#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 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 H, W, K; cin >> H >> W >> K;
--K;
vector<vector<long long> > dp(H+1, vector<long long>(W, 0));
dp[0][0] = 1;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
for (int bit = 0; bit < 1<<(W-1); ++bit) {
bool ok = true;
for (int k = 0; k < W-2; ++k) {
if ((bit & (1<<k)) && (bit & (1<<(k+1)))) ok = false;
}
if (!ok) continue;
int nj = j;
if (bit & (1<<j)) nj = j+1;
else if (j > 0 && (bit & (1<<(j-1)))) nj = j-1;
dp[i+1][nj] += dp[i][j];
dp[i+1][nj] %= MOD;
}
}
}
print(dp[H][K]);
}
| #include <cstdio>
typedef long long LL;
const int N=1000005,mo=998244353;
LL fac[N],inv[N];
LL ksm(LL x,int y){
LL i=1;
for (;y;y>>=1,x=x*x%mo)
if (y&1) i=i*x%mo;
return i;
}
void Pre(int n){
fac[0]=1;
for (int i=1;i<=n;i++) fac[i]=fac[i-1]*i%mo;
inv[n]=ksm(fac[n],mo-2);
for (int i=n;i>=1;i--) inv[i-1]=inv[i]*i%mo;
}
LL C(int n,int m){
return n<m||m<0?0:fac[n]*inv[m]%mo*inv[n-m]%mo;
}
LL INV(int n){
return inv[n]*fac[n-1]%mo;
}
int main(){
int n,m;
scanf("%d%d",&n,&m);
Pre(n+m);
int ans=0,sum=0,s=C(n+m,n);
for (int i=1;i<=n+m;i++){
if (i&1)
s=(s+C(i-2,i/2)*C(n+m-i+1,n-i/2))%mo;
else
s=(s-C(i-2,i/2-1)*C(n+m-i,n-i/2)*2)%mo;
sum=(sum+s)%mo;
ans=(ans+sum*INV(i))%mo;
}
ans=ans*ksm(C(n+m,n),mo-2)%mo;
printf("%d\n",(ans+mo)%mo);
} | 0 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) (__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) (__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vp = vector<pii>;
using vvp = vector<vp>;
using mii = map<int, int>;
using vm = vector<mii>;
using vvm = vector<vm>;
template <class T, class U>
using umap = unordered_map<T, U>;
using umii = umap<int, int>;
using seti = set<int>;
template <class T>
using uset = unordered_set<T>;
using useti = uset<int>;
template <class T>
using less_queue = priority_queue<T>;
template <class T>
using greater_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr int INF = 1e18;
template <class T>
void SORT(T &a) { stable_sort(all(a)); }
template <class T>
void RSORT(T &a) { stable_sort(rall(a)); }
template <class T>
void rev(T &a) { reverse(rall(a)); }
template <class T>
void uniq(T &a) { a.erase(unique(all(a)), end(a)); }
template <class T>
auto min_of(T a) { return *min_element(all(a)); }
template <class T>
auto max_of(T a) { return *max_element(all(a)); }
template <class T>
int sum_of(T a) { return accumulate(all(a), 0ll); }
template <class T, class U>
auto sum_of(T a, U init) { return accumulate(all(a), init); }
template <class T, class U>
int count_of(T a, U i) { return count(all(a), i); }
template <class T, class U>
bool has(T a, U i) { return find(all(a), i) != end(a); }
template <class T>
int sz(T a) { return a.size(); };
template <class T>
void COUT(T x) { cout << x << endl; }
template <class T, class U>
void COUT(T x, U y) { cout << x << ' ' << y << endl; }
template <class T, class U, class V>
void COUT(T x, U y, V z) { cout << x << ' ' << y << ' ' << z << endl; }
template <class T>
void CSP(T x) { cout << x << ' '; }
template <class T>
void CVEC(T v) {
int c = v.size() - 1;
for (size_t i = 0; i < c; i++) cout << v[i] << ' ';
if (c > -1) cout << v[c];
cout << endl;
}
template <class T>
bool amin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ceil_div(int x, int y) { return (x - 1) / y + 1; }
#pragma endregion header
mii prime_factors(int n) {
mii ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1) ret[n]++;
return ret;
}
void solve(int a, int b) {
COUT(sz(prime_factors(gcd(a, b))) + 1);
}
#pragma region main
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(15);
int a;
cin >> a;
int b;
cin >> b;
solve(a, b);
}
#pragma endregion main
| #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int N;
string S;
cin >> N >> S;
ll a=0,b=0,c=0;
for(int i=0;i<N;i++){
if(S[i]=='R') a++;
else if(S[i]=='G') b++;
else c++;
}
ll sum=a*b*c;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(2*j-i>N-1) break;
if(S[i]!=S[j]&&S[i]!=S[2*j-i]&&S[j]!=S[2*j-i])
sum--;
}
}
cout << sum << endl;
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
// utility
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
/* const int MOD = 998244353; */
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
signed main() {
string s;
cin >> s;
int N = s.size();
int ans = N*(N-1)/2+1;
map<char, int> m;
REP(i, N) m[s[i]]++;
for(auto p : m){
ans -= p.second*(p.second-1)/2;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <cstring>
#include <cmath>
using namespace std;
const long double eps = 1e-12;
typedef long long ll;
typedef pair<int , int> pt;
#define sz(a) ((int) a.size() )
#define LL(x) (x << 1)
#define RR(x) ((x << 1) | 1)
#define For(i , a , b) for (int i = a ; i <= b ; i++)
#define Ford(i , a , b) for (int i = a ; i >= b ; i--)
#define Rep(i , n) for (int i = 0 ; i < n ; i++)
const int maxn = 1000000 + 1912;
string s;
int lenJ[maxn] , lenI[maxn];
void ReadData() {
cin >> s;
}
void Process() {
lenJ[0] = s[0] == 'J';
For(i , 1 , sz(s) - 1) if (s[i] == 'J') lenJ[i] = lenJ[i - 1] + (s[i] == 'J'); else lenJ[i] = 0;
Ford(i , sz(s) - 1 , 0) if (s[i] == 'I') lenI[i] = lenI[i + 1] + (s[i] == 'I'); else lenI[i] = 0;
int res = 0;
int last = 0;
Rep(i , sz(s)) if (s[i] == 'O') {
last++;
if (i - last >= 0 && lenJ[i - last] >= last && lenI[i + 1] >= last) res = max(res , last);
} else last = 0;
cout << res << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("/users/youaremysky/documents/workspace/input.inp" , "r" , stdin);
ReadData();
Process();
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4);
vector<int> b(2);
for (int i = 0; i<4; i++) {
cin >> a[i];
}
for (int i = 0; i<2; i++) {
cin >> b[i];
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
cout << a[3] + a[1] + a[2] +b[1] << endl;
return 0;
}
| #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int a[4],e,f,sum=0,x=120;
for(int i=0;i<4;i++){
cin >> a[i];
sum=sum+a[i];
if(a[i]<x)x=a[i];
}
sum=sum-x;
cin >> e;
cin >> f;
if(e>f){sum=sum+e;}
else if(e<f){sum=sum+f;}
else if(e==f){sum=sum+e;}
cout << sum << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
#if 1
//-------------
// DUMPマクロ
// https://www.creativ.xyz/dump-cpp-652/
// vector
template <typename T>
istream& operator>>(istream& is, vector<T>& vec) {
for (T& x : vec) is >> x;
return is;
}
// pair
template <typename T, typename U>
ostream& operator<<(ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// vector
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// map
template <typename T, typename U>
ostream& operator<<(ostream& os, map<T, U>& map_var) {
os << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set
template <typename T>
ostream& operator<<(ostream& os, set<T>& set_var) {
os << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cerr
void dump_func() {
DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&& ... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef DEBUG
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#endif
signed main() {
string s;
cin>>s;
if(s.find("AC")==s.npos) No;
else Yes;
return 0;
}
| #include<stdio.h>
int main() {
char character1[100];
char character2[100];
scanf("%s", character1);
scanf("%s", character2);
printf("%s%s", character2, character1);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
//==================================
int main() {
#ifdef FASTIO
cin.tie(0), cout.tie(0);
ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
ifstream ifs("./in_out/input.txt");
cin.rdbuf(ifs.rdbuf());
#endif
int N;
cin >> N;
if (N == 1) {
cout << "Hello World\n";
}
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
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; }
ll mod= 1e9 + 7;
int main(){
int g;
cin >>g;
int a,b;
cin >>a >>b;
if(g==1){cout << "Hello World" << endl;}else{cout << a+b << endl;}
} | 1 |
#include<iostream>
#include<climits>
using namespace std;
// 完成版。
int tree[(1 << 18)];
void Update(int s, int t, int m, int left = 0, int right = (1 << 17), int key = 0){
if(t < left || right <= s) return;
if(s <= left && right - 1 <= t){ tree[key] = max(tree[key], m); return; }
Update(s, t, m, left, (left + right) / 2, 2 * key + 1);
Update(s, t, m, (left + right) / 2, right, 2 * key + 2);
}
int Find(int i){
i += (1 << 17) - 1;
int m = tree[i];
while(i){
i = (i - 1) / 2;
m = max(tree[i], m);
};
return m;
}
int main(){
int i;
for(i = 0; i < (1 << 18); i++) tree[i] = 0;
int n, q;
int x[100000];
for(i = 0; i < 100000; i++) x[i] = INT_MAX;
int s, t, value, m;
m = 1;
cin >> n >> q;
int query;
while(q){
q--;
cin >> query;
if(query){
cin >> i;
cout << x[Find(i)] << endl;
}else{
cin >> s >> t >> value;
x[m] = value;
Update(s, t, m);
m++;
}
};
return 0;
}
| #include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
using namespace std;
struct Node {
int key;
Node *left, *right, *parent;
};
Node *root, *NIL;
void insert(int k) {
if(root == NIL) {
root = (Node *)malloc(sizeof(Node));
root->key = k;
root->left = root->right = NIL;
}else {
Node *z = (Node *)malloc(sizeof(Node));
z->key = k;
z->left = z->right = NIL;
Node *x = root;
while(true) {
if(k < x->key) {
if(x->left == NIL) {
x->left = z;
z->parent = x;
break;
}
else x = x->left;
}else {
if(x->right == NIL) {
x->right = z;
z->parent = x;
break;
}
else x = x->right;
}
}
}
}
Node *find(Node *node, int k) {
Node *x = node;
while(x != NIL && k != x->key) {
if(k < x->key) x = x->left;
else x = x->right;
}
return x;
}
Node *treeSuccessor(Node *x) {
if(x->right != NIL) {
x = x->right;
while(x->left != NIL) x = x->left;
return x;
}
/*else {
Node *y = x->parent;
while(y!=NIL && x==y->right) {
x = y;
y = y->parent;
}
return y;
}
*/
}
void deleteNode(Node *node) {
Node *target, *child;
if(node->left == NIL || node->right == NIL) target = node;
else target = treeSuccessor(node);
if(target->left != NIL)
child = target->left;
else
child = target->right;
if(child != NIL) child->parent = target->parent;
if(target->parent == NIL) root = child;
else {
if(target == target->parent->left)
target->parent->left = child;
else
target->parent->right = child;
}
if(target != node) node->key = target->key;
free(target);
}
void inorder(Node *node) {
if(node == NIL) return;
inorder(node->left);
printf(" %d", node->key);
inorder(node->right);
}
void preorder(Node *node) {
if(node == NIL) return;
printf(" %d", node->key);
preorder(node->left);
preorder(node->right);
}
int main()
{
int n, x;
char str[19];
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%s", str);
if(str[0] == 'i') { //insert
scanf("%d", &x);
insert(x);
}else if(str[0] == 'p') { //print
inorder(root);
printf("\n");
preorder(root);
printf("\n");
}else if(str[0] == 'f') { //find
scanf("%d", &x);
Node *t = find(root, x);
if(t != NIL) printf("yes\n");
else printf("no\n");
}else if(str[0] == 'd') { //delete
scanf("%d", &x);
deleteNode(find(root,x));
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int n, r;
cin >> n >> r;
if(n < 10) cout << r+100*(10-n) << endl;
else cout << r << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; int w; cin >> s >> w;
string ans = "";
for (int i = 0; i < s.size(); i+=w) {
ans += s[i];
}
cout << ans << endl;
return 0;
} | 0 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
const int N = 45;
const int mod = 1e9 + 7;
using namespace std;
int n, x, y, z, now, lim, f[N][(1 << 17) + 5], ans;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar(); }
while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * w;
}
int fpow(int x, int y)
{
int res = 1;
for( ; y; y >>= 1, x = 1ll * x * x % mod)
if(y & 1) res = 1ll * res * x % mod;
return res;
}
void output(int x)
{
int a[100], cnt = 0;
while(x) a[cnt++] = x & 1, x >>= 1;
if(!cnt) return (void) (puts("0"));
for(int i = cnt - 1; i >= 0; i--) printf("%d", a[i]);
puts("");
}
int main()
{
n = read <int> (), x = read <int> (), y = read <int> (), z = read <int> ();
now = (1 << (x - 1 + y + z)) | (1 << (y - 1 + z)) | (1 << (z - 1)), lim = (1 << (x + y + z)) - 1;
f[0][0] = 1;
for(int tmp, i = 0; i < n; i++)
for(int j = 0; j <= lim; j++)
if(f[i][j])
{
for(int k = 1; k <= 10; k++)
{
tmp = ((j << k) | (1 << (k - 1))) & lim;
if((tmp & now) != now) f[i + 1][tmp] = (f[i + 1][tmp] + f[i][j]) % mod;
}
}
for(int j = 0; j <= lim; j++) if((j & now) != now) ans = (ans + f[n][j]) % mod;
printf("%d\n", (fpow(10, n) - ans + mod) % mod);
return 0;
}
| #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define REP(e,v) for(auto e:v)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define edge(v,a,b) v[a].pb(b);v[b].pb(a);
#define MAX_V 400010
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define endl "\n"
#define ALL(c) (c).begin(),(c).end()
using namespace std;
int in() {int x;scanf("%d",&x);return x;}
ll lin() {ll x;scanf("%lld",&x);return x;}
#define INF 1e9+7
#define LLINF 1e18+7
ll MOD=1e9+7;
#define N 1055050
ll dp[50][1<<20];
vector<ll> change(int x){
vector <ll> v;
int count=0;
while(x){
count++;
if(x%2){v.pb(count);count=0;}
x/=2;
}
return v;
}
int change2(vector<ll> v){
ll now=1;
ll ans=0;
for(auto e:v){
rep(i,e)now*=2;
ans+=now/2;
}
return ans;
}
bool judge[N];
ll pw[50];
main(){
ll n=in();
ll x[3];
rep(i,3)x[i]=in();
int sum=x[0]+x[1]+x[2];
swap(x[0],x[2]);
vector<pair<vector<ll>,ll>> v;
vector<ll> vvv;
v.pb({vvv,1ll});
ll ans=0;
pw[0]=1;
rep(i,20)pw[i+1]=pw[i]*2;
dp[0][0]=1;
vector<ll> tmp={2,3};
rep(i,1<<sum){
vector<ll> s=change(i);
int state=0;
int now[3]={};
rep(kk,s.size()){
if(state==3)break;
if(now[state]+s[kk]<x[state])now[state]+=s[kk];
else if(now[state]+s[kk]==x[state])state++;
else {state=-1;break;}
}
judge[i]=(state==3?1:0);
}
rep(i,n){
rep(k,1<<sum){
if(dp[i][k]==0)continue;
rep2(j,1,7){
vector<ll> s(1,j);
ll next=(k*pw[j]+pw[j-1])%pw[sum];
if(!judge[next])
dp[i+1][next]=(dp[i][k]+dp[i+1][next])%MOD;
}
dp[i+1][0]=(dp[i+1][0]+dp[i][k]*3)%MOD;
}
}
ll p=1;
rep(i,n){
p=p*10ll%MOD;
}
rep(i,1<<sum){
p=(p-dp[n][i]+MOD)%MOD;
}
cout<<p<<endl;
}
| 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
const long double eps = 1e-12;
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144*2
#define REP(a,b) for(long long a = 0;a < b;++a)
long long bad[700][700] = {};
vector<pair<int,int>> vertexs[2][700][700];
int visited[2][700][700];
int coloring[2][700][700];
int main() {
long long n, d[2];
cin >> n;
REP(q, 2) {
cin >> d[q];
}
REP(itr, 2) {
for (long long a = 0; a * a <= d[itr]; ++a) {
long long b = sqrt(d[itr] - a * a);
if (b * b + a * a != d[itr]) continue;
for (int q = 0; q < 2 * n; ++q) {
for (int j = 0; j < 2 * n; ++j) {
if (bad[q][j] == 1) continue;
int xe[4] = { 1,1,-1,-1 };
int ye[4] = { 1,-1,1,-1 };
REP(t, 4) {
int now_x = q + xe[t] * a;
int now_y = j + ye[t] * b;
if (now_x >= 0 && now_x < 2 * n && now_y >= 0 && now_y < 2 * n) {
if (bad[now_x][now_y] == 1) continue;
vertexs[itr][q][j].push_back(make_pair(now_x, now_y));
vertexs[itr][now_x][now_y].push_back(make_pair(q, j));
}
}
}
}
}
for (int q = 0; q < 2 * n; ++q) {
for (int j = 0; j < 2 * n; ++j) {
if (visited[itr][q][j] == 0 && bad[q][j] == 0) {
queue<pair<int, int>> next;
next.push(make_pair(q, j));
visited[itr][q][j] = 1;
vector<pair<int, int>> used;
int cnt[2] = {};
while (next.empty() == false) {
pair<int, int> now = next.front();
next.pop();
used.push_back(now);
REP(i, vertexs[itr][now.first][now.second].size()) {
pair<int, int> going = vertexs[itr][now.first][now.second][i];
if (visited[itr][going.first][going.second] == 0) {
visited[itr][going.first][going.second] = 1;
coloring[itr][going.first][going.second] = (coloring[itr][now.first][now.second] + 1) % 2;
cnt[coloring[itr][going.first][going.second]]++;
next.push(going);
}
}
}
int yusen = 1;
if (cnt[0] < cnt[1]) {
yusen = 0;
}
REP(q, used.size()) {
if (coloring[itr][used[q].first][used[q].second] == yusen) {
bad[used[q].first][used[q].second] = 1;
}
}
}
}
}
}
int cnt = 0;
REP(q, 2 * n) {
REP(j, 2 * n) {
if (bad[q][j] == 0) {
cnt++;
if (cnt <= n * n) {
cout << q << " " << j << endl;
}
}
}
}
} | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int N=100000+100;
const db pi=acos(-1.0);
#define lowbit(x) ((x)&(-x))
#define sqr(x) (x)*(x)
#define rep(i,a,b) for (register int i=a;i<=b;i++)
#define per(i,a,b) for (register int i=a;i>=b;i--)
#define go(u,i) for (register int i=head[u],v=sq[i].to;i;i=sq[i].nxt,v=sq[i].to)
#define fir first
#define sec second
#define mkp make_pair
#define pb push_back
#define maxd 998244353
#define eps 1e-8
inline int read()
{
int x=0,f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
inline ll readll()
{
ll x=0;int f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
int n,d1,d2,col[610][610];
void solve(int d)
{
int p=0;
while (d%4==0)
{
d/=4;p++;
}
if (d&1)
{
rep(i,0,n*2-1) rep(j,0,n*2-1)
{
int tmp=(i>>p)+(j>>p);
col[i][j]|=(tmp&1);
}
}
else
{
rep(i,0,n*2-1) rep(j,0,n*2-1)
{
col[i][j]|=((i>>p)&1);
}
}
}
int main()
{
n=read();d1=read();d2=read();
solve(d1);solve(d2);
int cnt=0;
rep(i,0,n*2-1) rep(j,0,n*2-1)
{
if (!col[i][j])
{
printf("%d %d\n",i,j);cnt++;
if (cnt==n*n) return 0;
}
}
return 0;
} | 1 |
//kruskal tree
#include <cstdio>
#include <algorithm>
using namespace std;
#define M 100000
int parent[M],a[M],b[M];
pair<int,int>node[M];
int root(int a){return parent[a]==a?a:parent[a]=root(parent[a]);}
int unite(int a,int b){
int x=root(a),y=root(b);
if(x==y)return 0;
parent[x]=y;
return 1;
}
int main(){
int i,s,n,m;
for(;scanf("%d%d",&n,&m)>1;printf("%d\n",s)){
for(i=0;i<m;i++)scanf("%d%d%d",a+i,b+i,&node[i].first),node[i].second=i;
sort(node,node+m);
for(i=0;i<n;i++)parent[i]=i;
for(s=i=0;i<m;i++)if(unite(a[node[i].second],b[node[i].second]))s+=node[i].first;
}
} | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
struct Edge{
int from, to; ll cost;
Edge(int from, int to, ll cost){
this->from = from;
this->to = to;
this->cost = cost;
}
bool operator<(const Edge &e) const{
return cost < e.cost;
}
bool operator>(const Edge &e) const{
return cost > e.cost;
}
};
struct Graph{
int V,E;
vector<vector< pair<int, ll> > > edges;
Graph(){
cin >> V >> E;
edges.resize(V);
int s,t; ll w;
rep(E){
cin >> s >> t >> w;
edges[s].emplace_back(t, w);
edges[t].emplace_back(s, w);
}
}
ll kruskal(){
ll ret = 0LL;
priority_queue<Edge, vector<Edge>, greater<Edge> > que;
vector<bool> used(V, false);
used[0] = true;
for(pair<int, ll> e: edges[0])
que.push(Edge(0, e.first, e.second));
while(!que.empty()){
Edge e = que.top(); que.pop();
while(!que.empty() && used[e.to]){
e = que.top(); que.pop();
}
if(used[e.to]) break;
ret += e.cost;
used[e.to] = true;
for(pair<int, ll> next: edges[e.to])
if(!used[next.first]) que.push(Edge(e.to, next.first, next.second));
}
return ret;
}
};
int main(){
Graph g = Graph();
cout << g.kruskal() << endl;
}
| 1 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
void fnInput(int &rnMaxSiz, vector<int> &rvnNum)
{
cin >> rnMaxSiz;
rvnNum.resize(rnMaxSiz);
for (int i = 0; i < rnMaxSiz; i++)
cin >> rvnNum[i];
}
void fnPartition(vector<int> &rvnNum, int nStart, int nEnd, int &nCur)
{
for (int i = nStart; i < nEnd; i++)
if (rvnNum[i] <= rvnNum[nEnd])
swap(rvnNum[nCur++], rvnNum[i]);
swap(rvnNum[nCur], rvnNum[nEnd]);
}
void fnResult(const vector<int> &cnrvnNum, int nCur)
{
for (int i = 0; i < cnrvnNum.size(); i++)
{
if (i) cout << " ";
if (i == nCur) cout << "[";
cout << cnrvnNum[i];
if (i == nCur) cout << "]";
}
cout << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int nMaxSiz;
vector<int> vnNum;
fnInput(nMaxSiz, vnNum);
int nStart = 0;
int nEnd = vnNum.size() - 1;
int nCur = nStart;
fnPartition(vnNum, nStart, nEnd, nCur);
fnResult(vnNum, nCur);
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n, l;
cin >> n >> l;
int sum = 0;
int best = 1e8;
rep (i, n) {
int x = l + i;
sum += x;
if (abs(best) > abs(x)) {
best = x;
}
}
sum -= best;
println(sum)
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >> s[i];
int cnt = 0;
queue<pii> q;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j] == '#') {
cnt++;
q.push(pii(i,j));
}
}
}
if (cnt == h*w) {
cout << 0 << endl;
return 0;
}
auto f = [&] (int y, int x) {
cnt++;
s[y][x] = '#';
q.push(pii(y, x));
};
for (int i = 1; 1; i++) {
int j = q.size();
for (int k = 0; k < j; k++) {
int a = q.front().first;
int b = q.front().second;
q.pop();
if (a>0) if (s[a-1][b]=='.') f(a-1,b);
if (a<h-1) if (s[a+1][b]=='.') f(a+1,b);
if (b>0) if (s[a][b-1]=='.') f(a,b-1);
if (b<w-1) if (s[a][b+1]=='.') f(a,b+1);
}
if (cnt == h*w) {
cout << i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
using v_int = std::vector<int>;
using v2_int = std::vector<v_int>;
using v_ll = std::vector<ll>;
using v2_ll = std::vector<v_ll>;
using v_string = std::vector<std::string>;
using v_bool = std::vector<bool>;
using v2_bool = std::vector<v_bool>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
const double PI = 3.1415926535897932;
const int INF = 2*(int)1e9;
const ll LINF = (ll)1e18;
const ll MOD = 1000000007;
const int dc[4] = {1, -1, 0, 0};
const int dr[4] = {0, 0, 1, -1};
//const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
//const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
using namespace std;
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p)
{
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
is >> v[i];
}
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
os << v[i];
if(i != len-1) { os << ","; }
}
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
int h, w;
cin >> h >> w;
v_string s(h);
cin >> s;
queue<pii> q;
v2_int dist(h, v_int(w, 0));
v2_bool done(h, v_bool(w, false));
irep(i, h) {
irep(j, w) {
if(s[i][j] == '#') {
q.push(pii(i,j));
done[i][j] = true;
}
}
}
while(q.size()) {
pii t = q.front(); q.pop();
irep(x,4) {
int row = t.fi + dr[x];
int col = t.se + dc[x];
if(row < 0 || row >= h) { continue; }
if(col < 0 || col >= w) { continue; }
if(s[row][col] == '#' || done[row][col]) { continue; }
done[row][col] = true;
dist[row][col] = dist[t.fi][t.se] + 1;
q.push(pii(row,col));
}
}
int ans = 0;
irep(i, h) {
irep(j, w) {
chmax(ans, dist[i][j]);
}
}
cout << ans << endl;
return 0;
}
/*atcoder*/
| 1 |
#include<bits/stdc++.h>
#define MOD_1_000_000_007 (1000000007LL)
#define LINF (1LL<<60)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i < (long long)(n); i++)
#define rep2(i, n) for (long long i = 2; i < (long long)(n); i++)
#define rep0c(i, n) for (long long i = 0; i <= (long long)(n); i++)
#define rep1c(i, n) for (long long i = 1; i <= (long long)(n); i++)
#define rep2c(i, n) for (long long i = 2; i <= (long long)(n); i++)
#define repc0(n, i) for (long long i = (long long)(n); i >= 0; i--)
#define repc1(n, i) for (long long i = (long long)(n); i >= 1; i--)
#define repc2(n, i) for (long long i = (long long)(n); i >= 2; i--)
namespace solver {
using namespace std;
typedef long long ll;
ll M, D[200020], C[200020];
void init() {
scanf("%lld", &M);
rep(i, M) scanf("%lld %lld", &D[i], &C[i]);
}
ll fold(ll n) {
if (n < 10) return n;
return (n/10)+(n%10);
}
void solve() {
ll past = 0, ans = 0;
rep(i, M) {
ans += (C[i]-1) + (D[i]*C[i]/10);
past *= 10;
past += fold(D[i]*C[i]);
while(past >= 10) {
ans++;
past = (past/10)+(past%10);
}
}
printf("%lld\n", ans);
}
void solve2() {
ll acc = 0, ans = 0;
rep(i, M) {
ans += C[i];
acc += D[i]*C[i];
}
ans--;
acc--;
ans += acc/9;
printf("%lld\n", ans);
}
}
int main() {
solver::init();
solver::solve2();
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
int ina, inb, n;
cin >> n;
while(n != 0){
int a=0, b=0;
for(int i=0;i<n;i++){
cin >> ina >> inb;
if(ina > inb){
a += ina+inb;
}else if(ina < inb){
b += ina+inb;
}else{
a += ina;
b += inb;
}
}
cout << a << " " << b << endl;
cin >> n;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
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 mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
map<ll, ll> m;
for (ll i = l; i <= r && i <= l+5000; i++){
m[i%mod]++;
}
ll ans = 2020;
vector<ll> a;
for (auto x: m){
rep1(i, x.second) a.push_back(x.first);
}
ll n = a.size();
for (ll i=0; i<(n); i++){
for (ll j=i+1; j<(n); j++){
ans = min(ans, a[i]*a[j]%2019);
}
}
cout << ans << endl;
//printf("%.12f", ans);
} | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll l, r;
cin >> l >> r;
if(r - l >= 2019){
cout << 0;
}
else{
ll ans = 2018;
for(long long i = l; i <= r - 1; i++){
for(long long j = i + 1; j <= r; j++){
ll a, b;
a = i % 2019;
b = j % 2019;
ll x;
x = (a * b) % 2019;
ans = min(ans, x);
}
}
cout << ans;
}
return 0;
} | 1 |
#include<iostream>
int H,W,A,B;
int main(){
std::cin>>H>>W>>A>>B;
for(int i=0;i<H*W;i++)std::cout<<(i%W<A^i/W<B)<<(i%W==W-1?"\n":"");
return 0;
} | #include<stdio.h>
//this file is not a C file but a C++ file
void seisekiduke(void);//宣言
int main(void){
int stnum;//the number of the student
while(1) {
scanf(" %d", &stnum);
if(stnum == 0) {
break;
}
for(int i = stnum - 1;i >= 0;i -= 1) {
seisekiduke();//一名の生徒の成績を付ける
}
}
return 0;
}
void seisekiduke(void) {
int pm, pe, pj = 0;//score
char grade;
scanf(" %d %d %d", &pm, &pe, &pj);
if((pm == 100 || pe == 100 || pj == 100) ||
(pm + pe) / 2 >= 90 ||
(pm + pe + pj) / 3 >= 80) {
grade = 'A';
}else if((pm + pe + pj) / 3 >= 70 ||
(((pm + pe + pj) / 3 >= 50) && (pm >= 80 || pe >= 80))){
grade = 'B';
}else{
grade = 'C';
}
printf("%c\n", grade);
} | 0 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define lw(vc,num) lower_bound(vc.begin(), vc.end(), num) - vc.begin();
#define hg(vc,num) upper_bound(vc.begin(), vc.end(), num) - vc.begin();
#define bn(v,x) binary_search (v.begin(), v.end(), x)
#define mx 100001
#define eps 0.00000000001
#define mod 1000000007
#define pi acos(-1)
#define inf 100000000
#define loop(i,b,n) for(int i=b;i<n;++i)
#define rev_loop(i,b,n) for(int i=b;i>=n;--i)
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
bool isprime(int n)
{
if(n == 1) return false;
if(n == 2 || n == 3) return true;
if(n%2 == 0 || n%3 == 0) return false;
for(int i=5; i*i<=n; i+=6){
if((n%i == 0)||(n%(i+2) == 0)) return false;
}
return true;
}
long long binpow(long long a, long long b) {
if (b == 0)
return 1;
long long res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
int main()
{
fio;
int n;
cin>>n;
vi v1(n);
loop(i,0,n)
{
cin>>v1[i];
}
int ans = 0,k1 = INT_MAX;
loop(i,0,n)
{
if(k1>v1[i])
{
k1 = v1[i];
ans++;
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, X, Y;
cin >> A >> B >> C >> D;
X = min(A, B);
Y = min(C, D);
cout << X + Y << endl;
} | 0 |
#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("")
/*By Citrus*/
char buf[1<<23],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=gc();
for (;!isdigit(c);c=gc()) f^=c=='-';
for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
return f?x:-x;
}
template <typename mitsuha>
inline bool read(mitsuha &x){
x=0;int f=1;char c=gc();
for (;!isdigit(c)&&~c;c=gc()) f^=c=='-';
if (!~c) return 0;
for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
return x=f?x:-x,1;
}
template <typename mitsuha>
inline int write(mitsuha x){
if (!x) return 0&pc(48);
if (x<0) pc('-'),x=-x;
int bit[20],i,p=0;
for (;x;x/=10) bit[++p]=x%10;
for (i=p;i;--i) pc(bit[i]+48);
return 0;
}
inline char fuhao(){
char c=gc();
for (;isspace(c);c=gc());
return c;
}
}using namespace chtholly;
using namespace std;
const int yuzu=5e5;
typedef int fuko[yuzu|10];
struct node {
int l,r,id;
void rd(int x) {
read(l),read(r),id=x;
}
}qr[yuzu|10];
fuko c,cnt,lxy;
int main() {
int i,n,q,bk;
read(n),read(q),bk=sqrt(n);
for (i=1;i<=n;++i) c[i]=read();
for (i=1;i<=q;++i) qr[i].rd(i);
sort(qr+1,qr+q+1,[&](node a,node b){return a.l/bk^b.l/bk?a.l<b.l:a.r<b.r;});
int nl=1,nr=0,ans=0;
for (i=1;i<=q;++i) {
for (;nr<qr[i].r;) !cnt[c[++nr]]++?++ans:0;
for (;nr>qr[i].r;) !--cnt[c[nr--]]?--ans:0;
for (;nl<qr[i].l;) !--cnt[c[nl++]]?--ans:0;
for (;nl>qr[i].l;) !cnt[c[--nl]]++?++ans:0;
lxy[qr[i].id]=ans;
}
for (i=1;i<=q;++i) printf("%d\n",lxy[i]);
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {}
void add(int i, T x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i&-i) {
x += d[i];
}
return x;
}
T sum(int l, int r) {
return sum(r-1) - sum(l-1);
}
};
int main() {
int n,q;
cin >>n >> q;
vi a(n);
vi pi(n+1,-1);
vector<vi> p(n);
rep(i,n){
cin >> a[i];
}
rep(i,n){
int l = pi[a[i]];
if(l != -1)p[l].push_back(i);
pi[a[i]] = i;
}
vector<vp> qs(n);
rep(i,q){
int l,r;
cin >> l >> r;
l--;r--;
qs[l].emplace_back(r,i);
}
vi ans(q);
BIT<int> d(n);
for(int x = n-1;x>=0;x--){
for(int y:p[x])d.add(y,1);
for(P query : qs[x]){
int r = query.first, i = query.second;
ans[i] = (r-x+1) - d.sum(r);
}
}
rep(i,q)cout<<ans[i]<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int h, w;
string s[400];
int a[400][400];
int b = 0;
pair<int, int> dyx[4] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
void bfs(int y, int x) {
queue<pair<int,int>> q;
q.push(make_pair(y, x));
a[y][x] = b;
while (!q.empty()) {
int x, y;
tie(y, x) = q.front();
q.pop();
for (auto d: dyx) {
int ny = y + d.first;
int nx = x + d.second;
if (ny < 0 || ny >= h || nx < 0 || nx >= w) {
continue;
}
if (a[ny][nx] > -1) {
continue;
}
if (s[y][x] != s[ny][nx]) {
a[ny][nx] = b;
q.push(make_pair(ny, nx));
}
}
}
}
int main() {
cin>>h>>w;
for (int i=0; i<h; i++) cin>>s[i];
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
a[i][j] = -1;
}
}
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
if (a[i][j] == -1) {
bfs(i, j);
++b;
}
}
}
map<int, pair<int,int>> cnt;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
if (s[i][j] == '#') {
++cnt[a[i][j]].first;
} else {
++cnt[a[i][j]].second;
}
}
}
long long ans = 0;
for (auto e: cnt) {
ans += 1LL * e.second.first * e.second.second;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using State = pair<pair<int, int>, int>;
int MX = 81*2*81 + 9;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, m;
cin >> n >> m;
//n = 80; m = 80;
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
//a[i][j] = (i+j)%81;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int v;
cin >> v;
//v = (81+i-j)%81;
a[i][j] -= v;
}
}
vector<vector<vector<bool>>> was(n, vector<vector<bool>>(m));
vector<State> q;
q.reserve(n*m*MX);
auto add = [&] (int i, int j, int c) {
if (i < 0 || i >= n || j < 0 || j >= m) {
return;
}
auto &vec = was[i][j];
if (vec.size() == 0) {
vec.assign(2*MX + 1, false);
}
for (int mul = -1; mul <= 1; mul += 2) {
int nxtC = c + mul*a[i][j];
int code = nxtC + MX;
if (!vec[code]) {
q.push_back({{i, j}, nxtC});
vec[code] = true;
}
}
};
add(0, 0, 0);
int ans = 1e9;
for (int qi = 0; qi < q.size(); qi++) {
auto cur = q[qi];
int i = cur.first.first;
int j = cur.first.second;
int c = cur.second;
if (i == n-1 && j == m-1) {
ans = min(ans, abs(c));
}
add(i+1, j, c);
add(i, j+1, c);
}
cout << ans << endl;
}
| 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
int main(){
int n,k;
while(cin>>n>>k){
if(n==0) break;
vector<int> seq(n);
set<string> ans;
REP(i,n) cin>>seq[i];
for(int i = 0; i < 1<<n; i++){
int cnt = 0;
REP(j,n){
cnt += (i>>j)&1;
}
if(cnt != k) continue;
vector<int> selected;
REP(j,n) if((i>>j)&1){
selected.push_back(seq[j]);
}
sort(selected.begin(), selected.end());
do{
stringstream ss;
REP(j,selected.size()) ss << selected[j];
ans.insert(ss.str());
}while(next_permutation(selected.begin(), selected.end()));
}
printf("%d\n",(int)ans.size());
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef pair< int, int > Pi;
const static int dy[] = {0, 1, 0, -1};
const static int dx[] = {1, 0, -1, 0};
const static int INF = 1 << 30;
int w, h, mas[20][20];
Pi S, G;
bool In(int x, int y)
{
return(0 <= x && x < w && 0 <= y && y < h);
}
int rec(int x, int y, int d, int cost)
{
if(cost > 10) return(INF);
if(make_pair(x, y) == G) return(cost);
int ret = INF;
if(d == -1) {
for(int i = 0; i < 4; i++) {
if(!In(x + dx[i], y + dy[i])) continue;
if(In(x + dx[i], y + dy[i]) && mas[y + dy[i]][x + dx[i]] == 1) continue;
ret = min(ret, rec(x + dx[i], y + dy[i], i, cost + 1));
}
} else {
x += dx[d], y += dy[d];
if(In(x, y)) {
if(mas[y][x] == 1) {
mas[y][x] = 0;
ret = rec(x - dx[d], y - dy[d], -1, cost);
mas[y][x] = 1;
} else {
ret = rec(x, y, d, cost);
}
}
}
return(ret);
}
int main()
{
while(cin >> w >> h, w) {
S = make_pair(-1, -1);
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
cin >> mas[i][j];
if(mas[i][j] == 2) {
S = make_pair(j, i);
} else if(mas[i][j] == 3) {
G = make_pair(j, i);
}
}
}
int ret = rec(S.first, S.second, -1, 0);
if(S == make_pair(-1, -1) || ret == INF) cout << -1 << endl;
else cout << ret << endl;
}
} | 0 |
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
int N,x;
cin >> N >> x;
int a;
vector<int> A(N);
for(int i=0;i<N;i++){
cin >> a;
A.at(i) = a;
}
sort(A.begin(), A.end());
int count=0;
for(int i=0;i<N;i++){
x = x - A.at(i);
if((x>0)&&(i!=N-1)){
count = count + 1;
}
else if(x==0){
count = count + 1;
}
else{
break;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3f
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define N 305
using namespace std;
typedef pair<int,int> Pair;
const int mod = 1e9 + 7;
inline int add(int x, int y) { return (x += y) - (x >= mod ? mod : 0); }
inline void inc(int &x, int y) { (x += y) -= (x >= mod ? mod : 0); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
template <class T> inline T input() {
int x; char ch; while (!isdigit(ch = getchar()));
for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48));
return x;
}
template <class T> inline void chkmin(T &x, T &y) { x = x < y ? x : y; }
template <class T> inline void chkmax(T &x, T &y) { x = x > y ? x : y; }
struct {
inline operator int () { return input<int>(); }
inline operator long long () { return input<long long>(); }
template <class T> inline void operator () (T &x) { x = *this; }
template<class T, class ...A> inline void operator () (T &x, A &...a)
{ x = *this; this -> operator ()(a...); }
} read;
int n, m, ans = inf;
int a[N][N];
int cnt[N];
bool vis[N];
void calc() {
memset(cnt, 0, sizeof cnt);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (vis[a[i][j]]) {
++cnt[a[i][j]];
break;
}
}
int main() {
read(n, m);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
read(a[i][j]);
for (int i = 1; i <= m; ++i) vis[i] = true;
calc();
for (int i = 1; i <= m; ++i) {
int pos = max_element(cnt + 1, cnt + m + 1) - cnt;
ans = min(ans, cnt[pos]);
vis[pos] = false;
calc();
}
printf("%d\n", ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i <= N; i++)
if (i % 3 != 0 && i % 5 != 0) ans += i;
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
cout<<n + (n*n) + (n*n*n);
}
| 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the kth largest element.(0-based)
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define pi pair<ll,ll>
#define pii pair<ll,pi >
#define ppi pair<pi,ll>
#define ppp pair<pi,pi >
#define ex(str,a,b) str.substr((int)(a),min((int)str.size()-a,(int)(b-a+1)))
#define all(X) X.begin(),X.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// for pair comparison function(ascending order) use return (i1.ff < i2.ff);
/* string operations :
str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
__builtin_popcount(n) : no. of set bits in n.
*/
const int M = (1<<20)+5;
const int md = 1e9+7;
priority_queue<ll,vector<ll >,greater<ll > > pq;
ll pwr(ll a,ll n,ll m)
{
ll p=1;
while(n>0)
{
if(n%2==1)
p=(p*a)%m;
a=(a*a)%m;
n=n/2;
}
return p;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n,h,w;
cin >> h >> w >> n;
if(h>w)
cout << (n+h-1)/h << "\n";
else
cout << (n+w-1)/w << "\n";
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P =pair<int,int>;
int main() {
int A,B,C;
cin>>A>>B>>C;
if((A<C&&C<B)||(B<C&&C<A)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;}
/*compile
g++ code.cpp
./a.out
run*/ | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
string s;
cin >> s;
vector<long long> b;
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
long long cur = a[i];
for (auto& x : b) {
cur = min(cur, cur ^ x);
}
if (cur > 0) {
if (s[i] == '1') {
ans = 1;
break;
} else {
b.push_back(cur);
}
}
}
cout << ans << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200 + 10;
ll a[maxn];
const int L = 63;
ll d[L];
bool add(ll x){
for(int i = L - 1; i >= 0; i--) if(x & 1ll << i){
if(d[i] == -1){d[i] = x; return true;}
x ^= d[i];
}
return false;
}
int main(){
// Fast;
int t; scanf("%d", &t); while(t--){
memset(d, -1, sizeof d);
int n; scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%lld", a + i);
char s[maxn]; scanf("%s", s);
int flag = 0;
for(int i = n - 1; i >= 0; i--){
if(add(a[i]) && s[i] == '1'){
flag = 1;
break;
}
}
printf("%d\n", flag);
}
return 0;
}
| 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int mod;
int mypow(int a,int b)
{
int ans=1;
while(b)
{
if(b&1)ans=1ll*ans*a%mod;
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
int n,pw2[6005],pw3[6005],ans=0,fac[6005],invfac[6005];
int main()
{
scanf("%d%d",&n,&mod);n=3*n;
pw2[0]=pw3[0]=1;
pw2[1]=mypow(2,mod-2);
pw3[1]=mypow(3,mod-2);fac[0]=fac[1]=1;
for(int i=2;i<=n;i++)pw2[i]=1ll*pw2[i-1]*pw2[1]%mod,pw3[i]=1ll*pw3[i-1]*pw3[1]%mod,fac[i]=1ll*fac[i-1]*i%mod;
invfac[n]=mypow(fac[n],mod-2);
for(int i=n-1;i>=0;i--)invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
for(int i=0;i<=n/3;i++)
{
for(int j=0;i+j<=n/3;j++)
{
ans=(ans+1ll*pw2[i]*pw3[j]%mod*invfac[i]%mod*invfac[j]%mod*invfac[n-2*i-3*j])%mod;
}
}
for(int i=1;i<=n;i++)ans=1ll*ans*i%mod;
printf("%d\n",ans);
return 0;
} | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
#define l_ength size
ll MOD;
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
ll dp[6060][13000];
int main(void){
int n,i,j;
ll ans = 0ll;
std::cin >> n >> MOD;
n *= 3;
dp[0][6500] = 1ll;
for(i=0; i<n; ++i){
for(j=500; j<=12500; ++j){
add_mod(dp[i+1][j-1],dp[i][j]);
add_mod(dp[i+2][j+1],dp[i][j]*(i+1)%MOD);
add_mod(dp[i+3][j],dp[i][j]*(i+1)*(i+2)%MOD);
}
}
for(j=500; j<=6500; ++j){
add_mod(ans,dp[n][j]);
}
std::cout << ans << std::endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
void doit(){
ll n,q,i,a1 = 0, a2 = 0;
ump<ll, ll>mpAC,mpWA;
string s;
cin >> n >> q;
while(q--){
ll k;
cin >> k >> s;
if(s == "WA"){
if(mpAC.find(k) == mpAC.end())mpWA[k]++;
}
else {
if(mpAC.find(k) == mpAC.end()){
a2 += mpWA[k];
a1++;
}
mpAC[k] = 1;
}
}
cout << a1 << " " << a2 << nl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt","r",stdin);
freopen("output1.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
// cin >> t;
for(ll i = 1; i <= t; i++){
doit();
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
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;
signed main(){
ll n,m; cin>>n>>m;
vl a(m);
vector<char> b(m);
ll ans=-1;
rep(i,0,m){
cin>>a[i]>>b[i];
}
rep(i,0,1000){
string s=to_string(i);
if(s.size()!=n)continue;
bool ok=true;
rep(i,0,m){
if(s[a[i]-1]!=b[i])ok=0;
}
if(ok){
ans=i;
break;
}
}
cout << ans << endl;
return 0;
} | 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;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int NIL = -1;
const int MAX = 10000;
const int MOD = 1000000007;
const double pi = 3.141592653589;
int main() {
int n, l;
cin >> n >> l;
int taste = 0;
int ate = INF;
rep(i,n){
taste += l + i;
if(abs(ate) > abs(l+i)) ate = l+i;
};
cout << taste - ate << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int a,b;
cin >> a >> b;
int ans = 0;
for(int i = a; i <= b; i++){
string s = to_string(i);
string t = s;
reverse(t.begin(),t.end());
if(s == t){
ans++;
}
}
cout << ans << endl;
} | 0 |
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main()
{
int i,a[4],b,c,sum;
for(i=0;i<4;i++){
scanf("%d",&a[i]);
}
scanf("%d %d",&b,&c);
sort(a,a+4,greater<int>());
for(i=0;i<3;i++){
sum+=a[i];
}
if(b>c){
sum+=b;
}
else{
sum+=c;
}
printf("%d\n",sum);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int sx,sy,tx,ty;
cin>>sx>>sy>>tx>>ty;
int dx=abs(sx-tx);
int dy=abs(sy-ty);
cout<<string(dx,'R')<<string(dy,'U');
cout<<string(dx,'L')<<string(dy,'D');
cout<<'L'<<string(dy+1,'U')<<string(dx+1,'R')<<'D';
cout<<'R'<<string(dy+1,'D')<<string(dx+1,'L')<<'U';
cout<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
// 最大公約数
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
// 最小公倍数
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll N;
string A, B, C;
cin >> N;
cin >> A;
cin >> B;
cin >> C;
ll count = 0;
REP(i, N){
if((A[i] != B[i]) && (B[i] != C[i]) && (C[i] != A[i])){
count += 2;
continue;
}
if((A[i] == B[i]) && (B[i] != C[i]) && (C[i] != A[i])){
count++;
continue;
}
if((A[i] != B[i]) && (B[i] == C[i]) && (C[i] != A[i])){
count++;
continue;
}
if((A[i] != B[i]) && (B[i] != C[i]) && (C[i] == A[i])){
count++;
continue;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
void solve(){
int N; cin >> N;
string A, B, C; cin >> A >> B >> C;
int ans = 0;
rep(i,N){
set<char> st;
st.insert(A[i]);
st.insert(B[i]);
st.insert(C[i]);
ans += st.size()-1;
}
cout << ans << endl;
}
int main(){
solve();
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"///REACHED///\n";
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll ,ll> pll;
typedef pair<ld,ld> pld;
typedef unordered_map<ll,ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5+7;
const ll MAX7 = 1e+7+7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const ll INFi = 0x7f7f7f7f;
const ll MOD = 1000000007;
/*vll adj[MAXN];ll visit[MAXN]={};
ll dx8[]={0,1,1,1,0,-1,-1,-1}, dy8[]={1,1,0,-1,-1,-1,0,1};
ll dx4[]={0,1,0,-1}, dy4[]={1,0,-1,0};
*/
// <------------- Declare Variables Here ------------> //
ll T=1;
ll n,x,y,m,k,d,w;
string s,t;
//vll a,b;
// <------------- Implement Functions Here ----------> //
// <------------- Start of main() -------------------> //
void MAIN(ll _) {
vll a(3);
cin>>a[0]>>a[1]>>a[2];
sort(all(a));
cin>>k;
cout<<(a[0]+a[1]+((ll)pow(2,k))*a[2]);
}
int main() {
fastio;randomINT;
//cin>>T;
for(ll i=1;i<=T;i++) {
MAIN(i);
}
return 0;
}
| #include<stdio.h>
#include<string.h>
#include<stdlib.h>
int i,j,k;
int a,b,c,flag[304],n;
typedef struct result{
int x,y,z,r;
}RESULT;
RESULT w[1005];
int main(){
scanf("%d %d %d",&a,&b,&c);
while(a!=0 && b!=0 && c!=0){
for(i=1;i<=a+b+c;i++)flag[i]=2;
scanf("\n%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d %d %d",&(w+i)->x,&(w+i)->y,&(w+i)->z,&(w+i)->r);
if((w+i)->r==1){
flag[(w+i)->x]=1;
flag[(w+i)->y]=1;
flag[(w+i)->z]=1;
}
}
for(i=1;i<=n;i++){
if((w+i)->r==0){
if(flag[(w+i)->x]==1 && flag[(w+i)->y]==1)flag[(w+i)->z]=0;
if(flag[(w+i)->y]==1 && flag[(w+i)->z]==1)flag[(w+i)->x]=0;
if(flag[(w+i)->z]==1 && flag[(w+i)->x]==1)flag[(w+i)->y]=0;
}
}
for(i=1;i<=a+b+c;i++)printf("%d\n",flag[i]);
scanf("%d %d %d",&a,&b,&c);
}
return 0;
} | 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);
ll n, m;
cin >> n >> m;
for(ll i = m/n; i >= 1; --i){
ll r = m - i * n;
if(r < 0) continue;
if(r%i == 0){
cout << i << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF = 10010001010;
const int inf = 1000034000;
typedef vector<ll> vecl;
typedef vector<int> veci;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<long long> enum_divisors(long long N)
{
vector<long long> res;
for (long long i = 1; i * i <= N; ++i)
{
if (N % i == 0)
{
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
int main()
{
ll N, M;
cin >> N >> M;
ll ans = 1;
auto div = enum_divisors(M);
for (int i = M / N; i >= 1;i--)
{
for (int j = 0; j < div.size();j++)
{
if(div[j] == i){
ans = i;
break;
}
//cout << i << " " <<div[j] << endl;
}
if (ans != 1)
{
break;
}
}
cout << ans << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
int D[100010];
int mod = 998244353;
signed main()
{
cin >> N;
rep(i, N)
{
int d;
cin >> d;
D[d]++;
if(i == 0 && d != 0)
{
cout << 0 << endl;
return 0;
}
}
int ans = 1;
rep(i, N)
{
if(i == 0 && D[i] != 1)
{
cout << 0 << endl;
return 0;
}
int tmp = 1;
if(i != 0)
rep(j, D[i])tmp = tmp * D[i - 1] % mod;
ans = ans * tmp % mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
const double pi=acos(-1);
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int n;
cin >> n;
vector<int> A(n);
for(int i=0;i<n;i++) cin >> A[i];
sort(A.begin(),A.end());
ll h=0,v=0;
for(int i=n-1;i>0;i--){
if(h==0){
if(A[i]==A[i-1]){
h=A[i];
i--;
}
}else{
if(A[i]==A[i-1]){
v=A[i];
break;
}
}
}
ll ans=h*v;
cout << ans << endl;
} | 0 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#define reg register
#define ri reg int
#define rep(i, x, y) for(ri i = x; i <= y; ++i)
#define nrep(i, x, y) for(ri i = x; i >= y; --i)
#define DEBUG 1
#define ll long long
#define max(i, j) (i) > (j) ? (i) : (j)
#define min(i, j) (i) < (j) ? (i) : (j)
struct IO {
#define MAXSIZE (1 << 20)
#define isdigit(x) (x >= '0' && x <= '9')
char buf[MAXSIZE], *p1, *p2;
char pbuf[MAXSIZE], *pp;
#if DEBUG
#else
IO() : p1(buf), p2(buf), pp(pbuf) {}
~IO() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
#endif
inline char gc() {
#if DEBUG
return getchar();
#endif
if(p1 == p2)
p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin);
return p1 == p2 ? ' ' : *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T>
inline void read(T &x) {
register double tmp = 1;
register bool sign = 0;
x = 0;
register char ch = gc();
for(; !isdigit(ch); ch = gc())
if(ch == '-') sign = 1;
for(; isdigit(ch); ch = gc())
x = x * 10 + (ch - '0');
if(ch == '.')
for(ch = gc(); isdigit(ch); ch = gc())
tmp /= 10.0, x += tmp * (ch - '0');
if(sign) x = -x;
}
inline void read(char *s) {
register char ch = gc();
for(; blank(ch); ch = gc());
for(; !blank(ch); ch = gc())
*s++ = ch;
*s = 0;
}
inline void read(char &c) {
for(c = gc(); blank(c); c = gc());
}
inline void push(const char &c) {
#if DEBUG
putchar(c);
#else
if(pp - pbuf == MAXSIZE) {
fwrite(pbuf, 1, MAXSIZE, stdout);
pp = pbuf;
}
*pp++ = c;
#endif
}
template <class T>
inline void write(T x) {
if(x < 0) {
x = -x;
push('-');
}
static T sta[35];
T top = 0;
do{
sta[top++] = x % 10;
x /= 10;
}while(x);
while(top)
push(sta[--top] + '0');
}
template <class T>
inline void write(T x, char lastChar) {
write(x);
push(lastChar);
}
} io;
int aa[1000010], cnt[1000010], belong[1000010];
int n, m, size, bnum, now, ans[1000010];
struct query { /*询问*/
int l, r, id;
} q[1000010];
int cmp(query a, query b) {
return (belong[a.l] ^ belong[b.l]) ? belong[a.l] < belong[b.l] : ((belong[a.l] & 1) ? a.r < b.r : a.r > b.r); /*奇偶优化后的排序*/
}
int main() {
io.read(n), io.read(m);
size = sqrt(n);
bnum = ceil((double)n / size);
rep(i, 1, bnum)
rep(j, (i - 1) * size + 1, i * size) {
belong[j] = i; /*依旧不知道所以然的离散化*/
}
rep(i, 1, n) io.read(aa[i]);
rep(i, 1, m) {
io.read(q[i].l), io.read(q[i].r);
q[i].id = i; /*读入每一个询问*/
}
std::sort(q + 1, q + m + 1, cmp);
int l = 1, r = 0;
rep(i, 1, m) {
int ql = q[i].l, qr = q[i].r; /*莫队主体*/
while(l < ql) now -= !--cnt[aa[l++]]; /*需要移动就移,在移的过程中更新答案*/
while(l > ql) now += !cnt[aa[--l]]++;
while(r < qr) now += !cnt[aa[++r]]++;
while(r > qr) now -= !--cnt[aa[r--]];
ans[q[i].id] = now;
}
rep(i, 1, m) io.write(ans[i], '\n');
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int main()
{
// que[R] = {L, index_of_query};
// um is map such that um[element] = last index the element was seen
// s - a set that contains the last index as mentioned above
// code assumes 0 indexed
// complexity - O(n*log(n))
unordered_map<int, int>um;
pbds s;
int n; cin >> n;
int q; cin >> q;
vector<int>a(n);
for (auto &it : a)
cin >> it;
vector<int>ans(q);
vector<vector<pair<int, int>>>que(n);
for (int i = 0; i < q; i++)
{
int L, R; cin >> L >> R;
L --;
R--;
que[R].push_back({L, i});
}
for (int i = 0; i < n; i++)
{
if (um.count(a[i]))
s.erase(um[a[i]]);
um[a[i]] = i;
s.insert(i);
for (auto it : que[i])
ans[it.second] = s.size() - s.order_of_key(it.first);
}
for (int i = 0; i < q; i++)
cout << ans[i] << endl;
return 0;
} | 1 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = 998244353ll;
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
ll dp[310][310][310][2];
std::string s;
int main(void){
int n,m,i,j,k,l;
ll ans=0ll;
std::cin >> s;
std::cin >> l;
n = s.l_ength();
l = std::min(l,n);
std::reverse(s.begin(),s.end());
dp[0][0][0][0] = 1ll;
for(i=0; i<n; ++i){
if(s[i]=='0'){
for(j=0; j<=l; ++j){
for(k=0; k<=j; ++k){
add_mod(dp[i+1][j][k][0],dp[i][j][k][0]);
if(k){
add_mod(dp[i+1][j][k][0],dp[i+1][j][k-1][0]);
}
}
}
for(j=0; j<=l; ++j){
for(k=0; k<=j; ++k){
add_mod(dp[i+1][j][k][0],dp[i][j][k][1]);
}
}
}else{
for(j=0; j<=l; ++j){
for(k=0; k<=j; ++k){
add_mod(dp[i+1][j][k][0],dp[i][j][k][0]);
if(j+1<=l){
add_mod(dp[i+1][j+1][k][1],dp[i][j][k][0]);
add_mod(dp[i+1][j+1][k][1],dp[i][j][k][1]);
}
}
}
}
/*
for(j=0; j<=l; ++j){
for(k=0; k<=j; ++k){
printf("%d %d %d: %lld, %lld,;\n",i,j,k,dp[i+1][j][k][0],dp[i+1][j][k][1]);
}
}
printf("\n");
*/
}
for(j=0; j<=l; ++j){
for(k=0; k<=j; ++k){
add_mod(ans,dp[n][j][k][0]);
}
}
std::cout << ans << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = unordered_map<T, K>;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll e5 = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = ll(n - 1); i >= 0; i--)
#define each(i, mp) for (auto &i : mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
template <class T> ostream &operator<<(ostream &out, const vector<T> &list) {
ll n = list.size();
rep(i, n) out << list[i] << ' ';
return out;
}
template <class T> istream &operator>>(istream &in, vector<T> &list) {
ll n = list.size();
rep(i, n) in >> list[i];
return in;
}
template <class T> ostream &operator<<(ostream &out, const vector<vector<T>> &list) {
ll n = list.size();
rep(i, n) out << list[i] << '\n';
return out;
}
/* ------------- ANSWER ------------- */
/* ---------------------------------- */
void solve() {
ll n;
cin >> n;
vl a(n);
vl cnt(n);
cin >> a;
ll ans = 1;
rep(i, n) {
if (a[i] == 0) ans *= (3 - cnt[a[i]]);
else ans *= (cnt[a[i] - 1] - cnt[a[i]]);
ans %= mod;
cnt[a[i]]++;
}
cout << ans << '\n';
}
int main() {
#ifdef MY_DEBUG
while (true) {
#endif
solve();
#ifdef MY_DEBUG
}
#endif
return 0;
} | 0 |
///\/\/\/
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, ll>;
using garph = vector<vector<ll>>;
const int inf = 2147483647;//2*10^9
const ll INF = 9223372036854775807;//9*10^18
signed main (){
nvarep(n,v);
map<int,int>fm,bm;
rep(i,0,n){
if(i%2==0)fm[v[i]]++;
else bm[v[i]]++;
}
vector<p>f,b;
irep(i,fm){
f.pb(mp(i->second,i->first));
}
irep(i,bm){
b.pb(mp(i->second,i->first));
}
f.pb(mp(0,0));
b.pb(mp(0,0));
sort(range(f));
reverse(range(f));
sort(range(b));
reverse(range(b));
if(f[0].second==b[0].second){
cout<<n-max(f[0].first+b[1].first,f[1].first+b[0].first)<<nnn;
}else{
cout<<n-f[0].first-b[0].first<<nnn;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<int> even(1e5+1, 0);
vector<int> odd(1e5+1, 0);
rep(i,n) {
int v;
cin >> v;
if (i%2) {
odd[v]++;
} else {
even[v]++;
}
}
pair<int, int> mx_odd = make_pair(0, 0);
pair<int, int> mx_even = make_pair(0, 0);
pair<int, int> mx_odd_2 = make_pair(0, 0);
pair<int, int> mx_even_2 = make_pair(0, 0);
rep(i, 1e5+1) {
if (odd[i] > mx_odd.second) {
mx_odd_2 = mx_odd;
mx_odd = make_pair(i, odd[i]);
} else {
if (odd[i] > mx_odd_2.second) mx_odd_2 = make_pair(i, odd[i]);
}
if (even[i] > mx_even.second) {
mx_even_2 = mx_even;
mx_even = make_pair(i, even[i]);
} else {
if (even[i] > mx_even_2.second) mx_even_2 = make_pair(i, even[i]);
}
}
int h = n/2;
int odd_diff = (n/2 - mx_odd.second);
int even_diff = (n/2 - mx_even.second);
int ans = 0;
if (mx_even.first == mx_odd.first) {
int a = (h - mx_even.second) + (h - mx_odd_2.second);
int b = (h - mx_odd.second) + (h - mx_even_2.second);
ans = min(a, b);
} else {
ans = (h - mx_odd.second) + (h - mx_even.second);
}
cout << ans << endl;
return 0;
} | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define RRep(i, r, n) for (ll i = n - 1; i <= r; i--)
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define int long long
#define pb push_back
#define mp make_pair
const int dx[] = {0, -1, 0, 1};
const int dy[] = {1, 0, -1, 0};
const int MOD = (1000000007);
//const int MOD = (998244353);
//const int INF = (1 << 30)-1;
const int INF = (1LL << 60)-1;
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
using Graph = vector<vector<pair<int, int>>>;
using Ki = vector<vector<int>>;
using Vi = vector<int>;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
//---------------------------------------------
int n;
cin>>n;
vector<string> s(3);
rep(i,3){
cin>>s[i];
}
ll ans=0;
rep(i,n){
ll memo=0;
if(s[0][i]!=s[1][i]) memo++;
if(s[0][i]!=s[2][i]) memo++;
if(s[2][i]!=s[1][i]) memo++;
ans+=max((ll)0,memo-1);
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,n,su=0;
string a,s,d;
cin>>n>>a>>s>>d;
set<char>se;
for(i=0;i<n;i++)
{
se.insert(a[i]);
se.insert(s[i]);
se.insert(d[i]);
su+=se.size()-1;
se.clear();
}
cout<<su<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n, u, v;
cin >> n >> u >> v;
u--, v--;
vector<vl> g(n);
rep(i, n - 1) {
ll a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<vl> d(2, vl(n, -1));
rep(k, 2) {
queue<ll> q;
q.push(u);
d[k][u] = 0;
while(!q.empty()) {
int i = q.front();
q.pop();
for(auto v : g[i]) {
if(d[k][v] != -1) continue;
d[k][v] = d[k][i] + 1;
q.push(v);
}
}
swap(u, v);
}
ll mx = 0;
rep(i, n) if(d[0][i] < d[1][i]) mx = max(mx, d[1][i]);
cout << mx - 1 << endl;
} | #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;
}
wGraph InputWGraph(ll N,ll M){
wGraph G(N);
for (int i = 0; i < M; ++i) {
ll a,b,c;
cin >> a >> b >> c;
a--;b--;
G[a].push_back(make_pair(b,c));
G[b].push_back(make_pair(a,c));
}
return G;
}
wGraph InputDWGraph(ll N, ll M){
wGraph G(N);
for (int i = 0; i < M; ++i) {
ll a,b,c;
cin >> a >> b >> c;
a--;b--;
G[a].push_back(make_pair(b,c));
}
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 OutputGraph(wGraph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j].first <<"/" << G[i][j].second << ",";
}
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() {
string N;
cin >> N;
ll digit = N.size();
vector<vector<ll>>memo(2);
for (int yi = 0; yi < 2; ++yi) {
memo[yi] = vector<ll>(digit);
for (int xi = 0; xi < digit; ++xi) {
memo[yi][xi] = (1ll << 50);
}
}
ll first = N[0] - '0';
memo[0][0] = min(11 - first,first);
memo[1][0] = min(11 - first - 1,first + 1);
for (int i = 1; i < digit; ++i) {
ll num = N[i] - '0';
memo[0][i] = min(memo[0][i-1] + num,memo[1][i-1] + (10 - num));
memo[1][i] = min(memo[0][i-1] + num + 1,memo[1][i-1] + (10 - num - 1));
}
cout << (memo[0][digit-1]) << endl;
}
| 0 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
else if (n == 1) return p % m;
else if (n % 2 == 1) return p * pow_mod(p, n - 1, m) % m;
else {
ll tmp = pow_mod(p, n / 2, m);
return (tmp * tmp) % m;
}
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
ll com_mod(ll n, ll k, ll m) {
if (k == 0) return 1;
else {
ll x = 1;
ll y = 1;
for (ll i = 0; i < k; i++) {
x = (x * (n - i)) % m;
y = (y * (i + 1)) % m;
}
ll res = (x * pow_mod(y, m - 2, m)) % m;
return res;
}
}
int main() {
int n, k; cin >> n >> k;
cout << (n % k == 0 ? 0 : 1) << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define fi first
#define se second
#define debug(x) cout << #x << ": " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> void Print(vector<T> v) {
F0R(i, v.size()) {
cout << v[i] << ' ';
}
cout << newl;
}
#if 1
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << max(max(a + b, a * 2 - 1), b * 2 - 1);
}
#endif
| 0 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using vector2d=vector<vector<T>>;
struct fixprec{int p;fixprec(int p):p(p){}};
ostream&operator<<(ostream&o,fixprec f){return o<<fixed<<setprecision(f.p);}
/*!* [intutil] *!*/
/*+* 整数演算いろいろ *+*/
i64 divceil(i64 a, i64 b) {
return a / b + (a > 0 && a % b ? 1 : 0);
}
i64 logceil(i64 a, i64 b) {
for(i64 i = 0, x = 1; a >= 2; x *= a, i++) if(x <= b) return i; return 0;
}
i64 gcd(i64 a, i64 b) {
for (i64 c; a;) c = a, a = b % a, b = c; return b;
}
i64 lcm(i64 a, i64 b) {
return (a / gcd(a, b) * b);
}
int main() {
int N;
cin >> N;
vector<i64> A(N);
for(i64 &a : A) cin >> a;
bool ans;
// i : ターン数 (0 mod 2 で自分のターン)
for(int i = 0; true; i++) {
i64 g = A[0];
for(i64 a : A) g = gcd(g, a);
for(i64 &a : A) a /= g;
int even_num = 0;
for(i64 a : A) even_num += (a % 2 == 0);
if(even_num % 2) { // 偶数が奇数個
ans = i % 2 == 0;
break;
} else { // 偶数が偶数個
i64 odd = 0;
for(i64 a : A) if(a % 2 == 1) odd = a;
if(N - even_num == 1 && odd > 2) { // 奇数が一つだけで、それは1でない
for(i64 &a : A) if(a % 2 == 1) a--;
continue;
} else {
ans = i % 2 == 1;
break;
}
}
}
cout << (ans ? "First" : "Second") << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
namespace IO {
template <typename _T>
inline bool read (_T& x) {
x = 0;
_T y = 1;
char c = getchar();
while ((c < '0' || '9' < c) && c != EOF) {
if (c == '-') y = -1;
c = getchar();
}
if (c == EOF) return false;
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getchar();
x *= y;
return true;
}
template <typename _T>
inline _T input () {
_T x = 0, y = 1;
char c = getchar();
while ((c < '0' || '9' < c) && c != EOF) {
if (c == '-') y = -1;
c = getchar();
}
if (c == EOF) return 0;
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getchar();
x *= y;
return x;
}
};
using namespace IO;
namespace modular {
const int MOD = 1000000007;
inline int add (int x, int y) { return (x += y) >= MOD ? x -= MOD : x; }
inline void inc (int &x, int y) { (x += y) >= MOD ? x -= MOD : 0; }
inline int mul (int x, int y) { return 1LL * x * y % MOD; }
inline int qpow (int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = mul(x, x)) if (y & 1) ans = mul(ans, x);
return ans;
}
};
#define reg register
#define MAX_N 200007
#define FIN(s) freopen(s, "r", stdin)
#define FOUT(s) freopen(s, "w", stdout)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, l, r) for(int i = l; i <= r; ++i)
#define lep(i, l, r) for(int i = l; i < r; ++i)
#define irep(i, r, l) for(int i = r; i >= l; --i)
#define ilep(i, r, l) for(int i = r; i > l; --i)
typedef long long ll;
int N;
int a[MAX_N];
inline void print (bool k, bool p) { puts(k ^ p ? "First" : "Second"); exit(0); }
void dfs (int p) {
int cnt[2] = {0, 0};
rep (i, 1, N) cnt[a[i] & 1]++;
rep (i, 1, N) if (a[i] == 1) print(cnt[0] & 1, p);
if (cnt[0] & 1) print(1, p);
else if (cnt[1] > 1) print(0, p);
rep (i, 1, N) if (a[i] != 1 && (a[i] & 1)) a[i]--;
int d = a[1];
rep (i, 2, N) d = std::__gcd(d, a[i]);
rep (i, 1, N) a[i] /= d;
dfs(p ^ 1);
}
int main () {
#ifdef LOCAL
FIN("in");
#endif
read(N);
rep (i, 1, N) read(a[i]);
dfs(0);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
while (K--) {
vector<int> V(N);
for (int i = 0; i < N; i++) {
V.at(max(0, i - A.at(i)))++;
if (i + A.at(i) + 1 < N) V.at(i + A.at(i) + 1)--;
}
for (int i = 1; i < N; i++) V.at(i) += V.at(i - 1);
if (A == V) break;
A = V;
}
for (auto a : A) cout << a << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
ll n, k;
array<ll, N> old, nw;
bitset<N> used;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (auto& i : a) cin >> i;
for (int i = 0; i < n; ++i) {
old[max(0ll, i - a[i])]++;
old[min(n, i + a[i] + 1)]--;
}
for (int i = 1; i < k; ++i) {
ll psum = 0;
used.reset();
for (int j = 0; j < n; ++j) {
if (i % 2) {
psum += old[j];
// cout << i << ' ' << j << ' ' << psum << '\n';
ll mn = max(0ll, j - psum), mx = min(n, j + psum + 1);
if (!used[j]) {
used[j] = 1;
nw[j] = 0;
}
if (!used[mn]) {
used[mn] = 1;
nw[mn] = 0;
}
if (!used[mx]) {
used[mx] = 1;
nw[mx] = 0;
}
// cout << j << ' ' << mn << ' ' << mx << '\n';
nw[mn]++;
nw[mx]--;
} else {
psum += nw[j];
// cout << i << ' ' << j << ' ' << psum << '\n';
ll mn = max(0ll, j - psum), mx = min(n, j + psum + 1);
if (!used[j]) {
used[j] = 1;
old[j] = 0;
}
if (!used[mn]) {
used[mn] = 1;
old[mn] = 0;
}
if (!used[mx]) {
used[mx] = 1;
old[mx] = 0;
}
// cout << j << ' ' << mn << ' ' << mx << '\n';
// cout << old[mn] << ' ' << old[mx] << '\n';
old[mn]++;
old[mx]--;
}
}
if (nw == old) break;
}
if (k % 2) {
ll psum = 0;
for (int i = 0; i < n; ++i) {
psum += old[i];
cout << psum << ' ';
}
} else {
ll psum = 0;
for (int i = 0; i < n; ++i) {
psum += nw[i];
cout << psum << ' ';
}
}
}
| 1 |
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include <fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using pll = pair<long long, long long>;
#define REP(i,n) for(long long i(0);(i)<(n);(i)++)
void solve(long long N){
cout << (N-2)*180 << endl;
}
int main(){
long long N;
scanf("%lld",&N);
solve(N);
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
using namespace std;
int main(){
double n;
cin >> n;
cout << n*(180-(360/n)) << endl;
return 0;
}
| 1 |
#include <iostream>
using namespace std;
#define MOD 1000000007
int main(int argc, const char * argv[]) {
int N;
cin>>N;
int *A=new int[N];
long long s=0,s2=0;
for(int i=0;i<N;++i){
cin>>A[i];
s+=A[i];
s%=MOD;
s2+=(long long)A[i]*A[i];
s2%=MOD;
}
s*=s;
s%=MOD;
s-=s2;
s%=MOD;
if(s<0){
s+=MOD;
}
if(s%2==0){
cout<<(s/2)<<endl;
}else{
cout<<((s+MOD)/2)<<endl;
}
delete[] A;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
//cout<<fixed<<setprecision(10);
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> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//以降 cin の入力元が 'input.txt' になる
//std::ifstream in("input.txt");
//std::cin.rdbuf(in.rdbuf());
const int max_n = 8100;
bool pos_x[max_n][max_n*2];
bool pos_y[max_n][max_n*2];
signed main()
{
gearup;
int n; cin >> n;
vl a(n);
rep(i,n)cin>>a[i];
if(a[0] != 0){
out(-1);
return 0;
}
ll res = 0;
rep(i,n-1){
if(a[i+1] > i+1){
out(-1);
return 0;
}
if(a[i] + 1 == a[i+1])res++;
else if(a[i] >= a[i+1])res += a[i+1];
else {
out(-1);
return 0;
}
}
out(res);
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
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;
}
signed main() {
init();
ll N, A, B;
cin >> N >> A >> B;
if (N == 1) {
COUT("Hello World");
} else {
COUT(A + B);
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
if(n - 1)
{
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
else
{
cout << "Hello World" << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k; cin >> k;
string s; cin >> s;
string ans;
if (s.size() <= k) ans = s;
else {
ans = s.substr(0, k);
ans += "...";
}
cout << ans << endl;
return 0;
} | //abc168
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int k;
string s;
cin >> k >> s;
if(s.size() <= k){
cout << s;
}else{
cout << s.substr(0,k) << "..." << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
// debug templates
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p) cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v) cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v) cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m) cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m) cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
void solve(){
int minn = inf, maxx = 0;
FOR(5){
int x; cin >> x;
minn = min(minn,x);
maxx = max(maxx,x);
}
int k; cin >> k;
cout << (maxx - minn > k ? ":(" : "Yay!");
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
int a[5],k;
for(int i=0;i<5;i++)
{
cin>>a[i];
}
cin>>k;
sort(a,a+5);
string ans="Yay!";
if(a[4]-a[0]>k)
{
ans=":(";
}
cout<<ans<<endl;
} | 1 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
using namespace std;
#define N 1010
int MOD = 1000000007;
int fac[N+1];
int inv[N+1];
ll bitpow(ll x,ll n){
ll ans = 1;
while(n > 0){
if(n%2 == 1) ans = ans * x % MOD;
x = x * x %MOD;
n = n >> 1;
}
return ans;
}
ll COM(ll n,ll k){
return fac[n]*inv[k]%MOD*inv[n-k]%MOD;
}
int dp[1010][1010] = {0};
signed main(){
int n,a,b,c,d;
cin >> n >> a >> b >> c >> d;
fac[0] = 1;
inv[0] = 1;
for(int i = 1;i <= N;i++){
fac[i] = fac[i-1]*i%MOD;
inv[i] = bitpow(fac[i],MOD-2)%MOD;
}
dp[a-1][0] = 1;
for(int i = a;i <= b;i++){
for(int j = 0;j <= n;j++){
dp[i][j] = dp[i-1][j];
for(int k = c;k <= d;k++){
if(j-i*k < 0 || i*k > n)break;
dp[i][j] += dp[i-1][j-i*k] * fac[n-(j-i*k)] %MOD * inv[n-(j-i*k) - i*k] %MOD * inv[k]%MOD * bitpow(inv[i],k)%MOD;
dp[i][j] %= MOD;
// if(i == 3){
// //cerr << "j : dp[i-1][j-i*k] : fac[n-(j-i*k)] : inv[n-i*k] : inv[k] : bitpow(inv[i],k)" << endl;
// //cerr << j << " " << dp[i-1][j-i*k] << " : " << fac[n-(j-i*k)]<< " : "<< inv[n-i*k] << " : "<< inv[k] << " : "<< bitpow(inv[i],k);
// //cerr << endl;
// }
}
}
}
cout << dp[b][n] << endl;
return 0;
}
// g++ -std=c++14 code1.cpp
// rm -r -f test;oj dl https://yahoo-procon2019-qual.contest.atcoder.jp/tasks/yahoo_procon2019_qual_d
// rm -r -f test;oj dl http://arc067.contest.atcoder.jp/tasks/arc067_c | /**
*Makacha
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read (T &x) {bool b = 0; char c; while (!isdigit (c = getchar()) && c != '-');
if (c == '-') c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x<<3) + (x<<1) + c - 48; if (b)x=-x;}
template <typename T> inline void wrip(T x) {if (x > 9) wrip(x / 10); putchar(x%10 + 48); }
template <typename T> inline void write(T x) {if (x < 0) putchar('-'), x = -x; wrip(x); putchar(' ');}
template <typename T> inline void writeln(T x) {if (x < 0) putchar('-'), x = -x; wrip(x); putchar('\n');}
inline char readch() {char c; do c = getchar(); while (c == '\n' || c == ' '); return c;}
inline void reads(string &s) {char c; while((c=getchar())==' '||c =='\n'); s=c; while((c=getchar())!=' '&&c!='\n') s+=c;}
inline void getlines(string &s) {char c; while((c=getchar())=='\n'); s=c; while((c=getchar())!='\n') s+=c;}
typedef const int csint;
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair <int, int> ii;
typedef vector <int> vi;
const ld pi = acos(-1);
const ll inf = 1e9,
mod = 1e9 + 7,
N = 1011;
int n, a, b, c, d;
ll f[N][N], cb[N][N], g[N][N];
ll fac[N], inv[N];
void Inc(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll pw(ll a, ll b) {
if (b == 0)
return 1;
ll t = pw(a, b / 2);
t = t * t % mod;
if (b % 2)
return t * a % mod;
return t;
}
int res, dx[111], pa[111];
void Try(int x) {
if (x > n) {
int cnt[21], num[21];
memset(cnt, 0, sizeof(cnt));
memset(num, 0, sizeof(num));
for (int i = 1; i <= n; i++)
cnt[pa[i]]++;
for (int i = 1; i <= n; i++) {
if (!cnt[i])
continue;
if (cnt[i] < a || cnt[i] > b)
return;
num[cnt[i]]++;
}
for (int i = 1; i <= n; i++) {
if (!num[i])
continue;
if (num[i] > d || num[i] < c)
return;
}
res++;
return;
}
for (int i = 1; i <= x; i++) {
if (dx[i])
continue;
dx[x] = i != x;
pa[x] = i;
Try(x + 1);
dx[x] = 0;
}
}
int main() {
#ifdef makacha
freopen("m.inp", "r", stdin);
freopen("m.out", "w", stdout);
#endif // makacha
read(n);
read(a);
read(b);
read(c);
read(d);
// Try(1);
// cout << res << '\n';
cb[0][0] = 1;
for (int i = 1; i <= n; i++) {
cb[i][0] = 1;
for (int j = 1; j <= i; j++)
cb[i][j] = (cb[i - 1][j] + cb[i - 1][j - 1]) % mod;
}
g[0][0] = 1;
for (int i = 1; i <= n; i++) {
g[i][0] = 1;
for (int j = i; j <= n; j += i)
g[i][j] = (ll) cb[j][j / i] * g[i - 1][j - j / i] % mod;
}
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (ll)fac[i - 1] * i % mod;
inv[n] = pw(fac[n], mod - 2);
for (int i = n; i >= 1; i--)
inv[i - 1] = (ll)inv[i] * i % mod;
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j += i)
g[i][j] = (ll)g[i][j] * inv[i] % mod;
f[a - 1][0] = 1;
for (int i = a; i <= b; i++) {
int lim = min(d * i, n);
int im = i - 1;
for (int j = i * c, grs = c; j <= lim; j += i, grs++)
for (int k = j, rem = n, kk = k - j; k <= n; k++, rem--, kk++) {
ll tmp = f[im][kk];
tmp = tmp * cb[rem][j] % mod;
tmp = tmp * g[grs][j] % mod;
Inc(f[i][k], tmp);
}
for (int j = 0; j <= n; j++)
Inc(f[i][j], f[im][j]);
}
cout << f[b][n];
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.