code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) cin >> S[i];
map<string, int> cnt;
ll ans = 0;
rep(i, N) {
sort(ALL(S[i]));
ans += cnt[S[i]];
++cnt[S[i]];
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
#define scl1(a) scanf("%lld", &a)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a) printf("%lld\n", a)
#define prl2(a, b) printf("%lld %lld\n", a, b)
#define ssl1(s) scanf(" %[^\n]", s)
#define scd1(a) scanf("%lf", &a)
#define scd2(a, b) scanf("%lf %lf", &a, &b)
#define prd(a) printf("%lf\n", a)
#define prld(a) printf("%Lf\n", a)
#define prcase(cs) printf("Case %lld: ", cs)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cot1(a) cout << a << "\n"
#define cot2(a, b) cout << a << " " << b << "\n"
#define cot3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline cout << "\n"
#define cotminus cout << "-1\n"
#define cot0 cout << "0\n"
#define cotyes cout << "YES\n"
#define cotno cout << "NO\n"
#define cotcase(cs) cout << "Case " << cs << ": "
#define reversed(s) reverse(s.begin(), s.end())
#define asort(s) sort(s.begin(), s.end())
#define dsort(s) sort(s.rbegin(), s.rend())
#define all(s) s.begin(), s.end()
#define uniq(s) s.resize(distance(s.begin(),unique(s.begin(), s.end())))
#define found(s, x) (s.find(x) != s.end())
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define fora(i, a, b) for (i = a; i <= b; i++)
#define forb(i, b, a) for (i = b; i >= a; i--)
#define fori(it, s) for(auto it = s.begin(); it != s.end(); it++)
#define FR ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
#define pi acos(-1)
const ll INF = LLONG_MAX;
const ll SZ = 2e2+5;
const ll mod = 1e9+7;
ll n, k;
ll a[SZ];
ll solve(ll r1, ll r2, ll c) {
ll i, x, sum(0);
priority_queue <ll, vector <ll>, greater<ll> > pq;
fora(i, r1, r2) {
pq.push(a[i]);
}
while(c--) {
if(pq.empty()) break;
x = pq.top();
if(x >= 0) break;
pq.pop();
}
while(!pq.empty()) {
sum += pq.top();
pq.pop();
}
return sum;
}
int main() {
ll cs = 0, tc = 1, x, y, z, i, j, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
string s, s1, s2;
cin2(n, k);
for1(i, n) cin1(a[i]);
for1(i, n) a[n+i] = a[i];
for1(i, n) {
if(i <= k) ans = max(ans, solve(1, i, k-i));
fora(j, i, n+i-1) {
t = j - i + 1;
c = k - t;
if(c < 0 || j < n) continue;
ans = max(ans, solve(i, j, c));
}
}
cot1(ans);
return 0;
}
| 0
| 25,755,081
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq;
typedef priority_queue<ll> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
int A,B,K;cin>>A>>B>>K;
for(int i=min(A,B);i>=1;i--){
if(A%i==0 && B%i==0){
K--;
if(K==0){
cout<<i<<endl;return 0;
}
}
}
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int mod = 1e9+7;
int main(){
int H, W;
cin >> H >> W;
vector<vector<int>> dp(H, vector<int>(W,0));
vector<vector<char>> A(H, vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> A[i][j];
}
}
dp[0][0] = 1;
for(int i=1; i<H; i++){
if(A[i][0]=='#') dp[i][0] = 0;
else dp[i][0] = dp[i-1][0];
}
for(int i=1; i<W; i++){
if(A[0][i]=='#') dp[0][i] = 0;
else dp[0][i] = dp[0][i-1];
}
for(int i=1; i<H; i++){
for(int j=1; j<W; j++){
if(A[i][j] == '#') dp[i][j] = 0;
else{
if(A[i-1][j]=='.' && A[i][j-1]=='.'){
dp[i][j] = (dp[i-1][j] + dp[i][j-1]) % mod;
}
else if(A[i-1][j]=='#' && A[i][j-1]=='.'){
dp[i][j] = dp[i][j-1];
}
else if(A[i-1][j]=='.' && A[i][j-1]=='#'){
dp[i][j] = dp[i-1][j];
}
else{
dp[i][j] = 0;
}
}
}
}
cout << dp[H-1][W-1] << endl;
}
| 0
| 33,135,396
|
#include <string>
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string S;
cin >> S;
for (string::size_type i = 0; i < S.size() / 2; i++)
{
swap(S[i], S[S.size() - i - 1]);
}
for (string::size_type i = 0; i < S.size(); i++)
{
cout << S[i];
}
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){
int len=d.size();
rep(i,len){
s<<d[i];if(i<len-1) s<<" ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){
int len=d.size();
rep(i,len){
s<<d[i]<<endl;
}
return s;
}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){
s<<"{ ";
for(auto itr=v.begin();itr!=v.end();++itr) {
if (itr!=v.begin()) {s<< ", ";}
s<<(*itr);
}
s<<" }";
return s;
}
template<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){
s<<"{ ";
for(auto itr=v.begin();itr!=v.end();++itr) {
if (itr!=v.begin()) {s<< ", ";}
s<<(*itr);
}
s<<" }";
return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){
s<<"{"<<endl;
for(auto itr=m.begin();itr!=m.end();++itr){
s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;
}
s<<"}"<<endl;
return s;
}
const ll mod=1e9+7;
const ll inf=1e15;
const int INF=1e9;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;
cin>>n>>k;
vector<ll> a(n+1),sum(n+1,0);
multiset<ll> beauty;
FOR(i,1,n+1){
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
FOR(l,1,n+1)FOR(r,l,n+1){
beauty.insert(sum[r]-sum[l-1]);
}
for(ll i=60;i>=0;i--){
ll cnt=0;
for(auto itr:beauty){
if(1ll<<i & itr){
cnt++;
}
}
if(cnt>=k){
multiset<ll> nb;
for(auto itr:beauty){
if(1ll<<i & itr){
nb.insert(itr);
}
}
swap(beauty,nb);
}
}
ll ans=(1ll<<60)-1;
for(auto itr:beauty){
ans&=itr;
}
cout<<ans<<endl;
}
| 0
| 35,077,901
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<int> vint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<string> vstring;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
typedef vector<vbool> vvbool;
#define rep(i,n) for(int i=0;i<n;i++)
#define drep(i,n) for(int i=n-1;0<=i;i--)
#define yes(ans) if(ans)cout<<"yes"<<endl;else cout<<"no"<<endl;
#define Yes(ans) if(ans)cout<<"Yes"<<endl;else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl;else cout<<"NO"<<endl;
#define POSSIBLE(ans) if(ans)cout<<"POSSIBLE"<<endl;else cout<<"IMPOSSIBLE"<<endl;
#define Pi 3.1415926535897932384626
#define mod llint(1e9+7)
#define Inf 2147483647
#define llInf 9223372036854775807
#define all(x) x.begin(),x.end()
#define pb push_back
#define isin(n,i) 0<=i&&i<n
class UnionFind {
public:
vector<int> Parent;
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
int root(int A) {
if (Parent[A] < 0) return A;
return Parent[A] = root(Parent[A]);
}
int size(int A) {
return -Parent[root(A)];
}
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B) {
return false;
}
if (size(A) < size(B)) swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
template<typename T>
struct SegTree {
using F = function<T(T, T)>;
vector<T>seg;
int siz;
const T unit;
const F f;
SegTree(int n, const T unit, const F f) : unit(unit), f(f) {
siz = 1;
while (siz < n)siz <<= 1;
seg.assign(siz * 2 - 1, unit);
siz--;
}
void set(int k, const T& t) {
seg[k + siz] = t;
}
void build() {
for (int i = siz - 1; 0 <= i; i--) {
seg[i] = f(seg[i * 2 + 1], seg[i * 2 + 2]);
}
}
T operator[](const int i) {
return seg[i + siz];
}
void update(int k, T x) {
k += siz;
seg[k] = x;
while (0 < k) {
k = (k - 1) >> 1;
seg[k] = f(seg[k * 2 + 1], seg[k * 2 + 2]);
}
}
T query(int a, int b) {
T l = unit, r = unit;
for (a += siz, b += siz; a < b; a >>= 1, b >>= 1) {
if (!(a & 1))l = f(seg[a++], l);
if (!(b & 1))r = f(seg[--b], r);
}
return f(l, r);
}
};
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
long long extGCD(long long a, long long b, long long& x, long long& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
template<typename T>
bool check(T a, T b) {
return a < b;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
llint nCr(llint n, llint r) {
llint ans = 1;
for (llint i = 0; i < r; i++) {
ans *= n - i;
ans %= 1000000007;
}
for (llint i = 1; i <= r; i++) {
ans *= modinv(i, 1000000007);
ans %= 1000000007;
}
return ans;
}
llint power(llint a, llint b) {
if (b == 1)return a;
if (b == 0)return 1;
llint tmp = power(a, (llint)b / 2);
tmp *= tmp;
tmp %= mod;
if (b % 2 == 1) {
tmp *= a;
tmp %= mod;
}
return tmp;
}
int main() {
int a[4] = {};
rep(i, 6) {
int x;
cin >> x;
a[x - 1]++;
}
bool ans = true;
rep(i, 4) {
if (a[i] > 2)ans = false;
}
YES(ans);
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define f(a,b) for(ll i = a ; i < b ; i++ )
#define fj(a,b) for(ll j = a ; j < b ; j++ )
#define fk(a,b) for(ll k = a ; k < b ; k++ )
#define fasthoja ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
vector<string> v;
void permute(string a, int l, int r)
{
if (l == r) {
v.push_back(a);
}
else
{
for (int i = l; i <= r; i++)
{
swap(a[l], a[i]);
permute(a, l+1, r );
swap(a[l], a[i]);
}
}
}
int main(void){
fasthoja;
ll n; cin >> n;
string sn = "";
f(1,n+1) sn += to_string(i);
vec p(n), q(n);
string tp = "";
string tq = "";
f(0,n) cin >> p[i],tp += to_string(p[i]);
f(0,n) cin >> q[i],tq += to_string(q[i]);
string str = to_string(n);
permute(sn , 0 , sn.length() - 1);
sort( v.begin() , v.end() );
ll i1 = 0, i2 = 0;
f(0,v.size()) {
if( v[i] == tp ) i1 = i;
if( v[i] == tq ) i2 = i;
}
cout << abs(i1 - i2) << "\n";
return 0;
}
| 0
| 93,031,097
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll cnt = 0;
string s,str ; cin >> s >> str;
rep(i,3){
if(s[i] == str[i]) cnt++;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
typedef long long int int64;
struct vertex {
int i;
int64 val;
int size;
int parent;
int next,child;
int depth;
} v[100003];
void dfs(int i)
{
for(int j = v[i].child;j != -1;j = v[j].next) {
v[j].depth = v[i].depth + 1;
dfs(j);
}
}
int n;
bool cmp1(const vertex &a,const vertex &b) {
return a.val < b.val;
}
int main()
{
scanf("%d",&n);
for(int i = 0;i < n;++i) {
scanf("%lld",&v[i].val);
v[i].i = i + 1;
v[i].size = 1;
}
std::sort(v,v+n,cmp1);
std::map<int64,int> m;
for(int i = 0;i < n;++i) {
m[v[i].val] = i;
v[i].next = v[i].child = -1;
}
for(int i = n - 1;i >= 1;--i) {
int64 val2 = v[i].val - n + 2LL * v[i].size;
std::map<int64,int>::iterator it = m.find(val2);
if(it == m.end()) {
printf("-1\n");
return 0;
}
v[i].parent = it->second;
v[v[i].parent].size += v[i].size;
v[i].next = v[v[i].parent].child;
v[v[i].parent].child = i;
}
int64 dsum = 0;
dfs(0);
for(int i = 0;i < n;++i) {
dsum += v[i].depth;
}
if(v[0].size == n && v[0].val == dsum) {
for(int i = 1;i < n;++i) {
printf("%d %d\n", v[i].i, v[v[i].parent].i);
}
} else {
printf("-1\n");
}
}
| 0
| 79,820,066
|
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k, m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
inline void wt_L(char a){
putchar_unlocked(a);
}
inline void wt_L(int x){
char f[10];
int m=0, s=0;
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
putchar_unlocked('-');
}
while(s--){
putchar_unlocked(f[s]+'0');
}
}
int main(){
int K, N;
rd(N);
rd(K);
if(K==1){
wt_L(0);
wt_L('\n');
}
else{
wt_L(N-K);
wt_L('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
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; }
using namespace std;
int main(){
Init();
ll a, b, c; cin >> a >> b >> c;
if(a == b) cout << c << endl;
if(b == c) cout << a << endl;
if(c == a) cout << b << endl;
}
| 0
| 43,688,300
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int h=1, w=1;
while (h != 0 && w != 0) {
cin >> h;
cin >> w;
if (h == 0 && w == 0) continue;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i == 0 || i == h - 1) {
cout << "#";
}
else {
if (j == 0 || j == w - 1) {
cout << "#";
}
else {
cout << ".";
}
}
}
cout << endl;
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>cnt(N+1);
for(int i = 0; i < N; i++) {
cin >> A[i];
cnt[i+1] += A[i];
}
for(int i = 0; i < N; i++) {
cnt[i+1]+=cnt[i];
}
sort(cnt.begin(),cnt.end());
int ans = 0;
int sum = 1;
for(int i = 1; i <= N; i++) {
if(cnt[i] == cnt[i-1]) {
sum++;
}
else {
ans+=(sum*(sum-1))/2;
sum = 1;
}
}
if(sum != 1) {
ans+=(sum*(sum-1))/2;
}
cout << ans << endl;
}
| 0
| 77,706,626
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll s[100009];
ll t[100009];
int main(){
int n,k;
int a[100009];
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
s[i]=s[i-1]+a[i];
t[i]=t[i-1]+max(a[i],0);
}
ll ans=s[n];
for(int i=1;i<=n-k+1;i++){
ans=max(ans,t[i-1]+(s[i+k-1]-s[i-1])+t[n]-t[i+k-1]);
ans=max(ans,t[i-1]+t[n]-t[i+k-1]);
}
cout<<ans<<endl;
return(0);
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n;
vector<int>a(n);
if(n%2==0){
for(int i=0;i<n;i++){
cin>>m;
if(i%2==1)a[n/2-i/2-1]=m;
if(i%2==0)a[n/2+i/2]=m;
}
}else{
for(int i=0;i<n;i++){
cin>>m;
if(i%2==0)a[n/2-i/2]=m;
if(i%2==1)a[n/2+i/2+1]=m;
}
}
for(int i=0;i<n;i++)cout<<a[i]<<" ";
return 0;
}
| 0
| 91,437,620
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
int cnt = 0;
if (i % 2 == 0) continue;
for (int j = 1; j <= i; j++) {
if (i % j == 0) cnt++;
}
if (cnt == 8) ans++;
}
cout << ans << endl;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin >>n,n){
long long int d[10][10];
int m=0;
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i == j) d[i][j] = 0;
else d[i][j] = 1000000000;
}
}
for(int i=0,a,b,c; i<n; i++){
cin >>a>>b>>c;
d[a][b] = c;
d[b][a] = c;
m = max(m,max(a,b));
}
for(int k=0; k<=m; k++) for(int i=0; i<=m; i++) for(int j=0; j<=m; j++) d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
long long int ans,cost=-1;
for(int i=0,t; i<=m; i++){
t = 0;
for(int j=0; j<=m; j++) t+=d[i][j];
if(cost>t || cost == -1){cost = t;ans = i;}
}
cout <<ans<<" "<<cost<<endl;
}
return 0;
}
| 0
| 99,182,140
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int p,q,r; cin >> p >> q >> r;
int ans1=INF,ans2=INF;
ans1 = min(p+q,r+q);
ans2 = min(r+p,q+p);
int ans = min(ans1,ans2);
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll MOD = pow(10, 9) + 7;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
ll sum = 0;
for (int i = 0; i < N; i++) {
ll cnt = 0;
for (int j = i + 1; j < N; j++) {
if (A[i] > A[j])
cnt++;
}
ll seq = ((1 + K) * K / 2) % MOD;
sum += (cnt * seq % MOD);
sum %= MOD;
}
for (int i = 1; i < N; i++) {
ll cnt = 0;
for (int j = i - 1; j > -1; j--) {
if (A[i] > A[j])
cnt++;
}
ll seq = (K * (K - 1) / 2) % MOD;
sum += (cnt * seq % MOD);
sum %= MOD;
}
sum %= MOD;
cout << sum << endl;
}
| 0
| 45,949,582
|
#include <iostream>
using namespace std;
int main(){
int root[5][51], i, j;
for (i = 0; i < 5; i++) {
for (j = 0; j < 51; j++)
root[i][j] = 0;
}
for (i = 0; i < 10; i++) {
root[1][i] = 1;
}
for (i = 1; i < 5; i++) {
root[i][0] = 1;
}
for (i = 2; i < 5; i++) {
for (j = 1; j < 51; j++) {
for (int k = j; k >= 0 && k > j - 10; k--) {
root[i][j] += root[i - 1][k];
}
}
}
while (true) {
int n;
cin >> n;
if (cin.eof()){
break;
}
cout << root[4][n] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> edge[1000010];
int n,poi[1000010],u,v;
void dfs(int u,int fa)
{
poi[u]=0;
for(auto v : edge[u])
{
if(v==fa) continue;
dfs(v,u);
poi[u]^=poi[v]+1;
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n-1;++i)
{
scanf("%d%d",&u,&v);
edge[u].push_back(v);
edge[v].push_back(u);
}
dfs(1,0);
puts(poi[1]?"Alice":"Bob");
}
| 0
| 99,000,096
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,i,j;
cin>>h>>w;
vector<string> a(h);
vector<int> r,c;
for(i=0;i<h;i++){
cin>>a.at(i);
for(j=0;j<w;j++) if(a.at(i).at(j)=='#') break;
if(j==w) r.push_back(i);
}
r.push_back(h);
for(j=0;j<w;j++){
for(i=0;i<h;i++) if(a.at(i).at(j)=='#') break;
if(i==h) c.push_back(j);
}
c.push_back(w);
for(i=0;i<h;i++){
if(*lower_bound(r.begin(),r.end(),i)!=i){
for(j=0;j<w;j++) if(*lower_bound(c.begin(),c.end(),j)!=j) cout<<a.at(i).at(j);
cout<<endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int maxn = 6e5 + 5;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int pre[n + 5][k + 5] = {};
int suf[n + 5][k + 5] = {};
int v[n + 5] = {};
pre[0][0] = 1;
suf[n+1][0] = 1;
for(int i = 1 ; i <= n ; i++) {
cin >> v[i];
}
for (int i = 1 ; i <= n ; i++) {
for (int j = 0 ; j <= k ; j++) {
if (pre[i - 1][j]) {
pre[i][j] = 1;
}
if (j >= v[i] && pre[i - 1][j - v[i]]) {
pre[i][j] = 1;
}
}
}
for (int i = n ; i >= 1 ; i--) {
for (int j = 0 ; j <= k ; j++) {
if (suf[i + 1][j]) {
suf[i][j] = 1;
}
if (j >= v[i] && suf[i + 1][j - v[i]]) {
suf[i][j] = 1;
}
}
}
for (int i = n + 1 ; i >= 1 ; i--) {
for (int j = 1 ; j <= k ; j++) {
suf[i][j] += suf[i][j-1];
}
}
int ans = 0;
for (int i = 1 ; i <= n ; i++) {
int lb = max(k - v[i], 0);
int ub = k - 1;
for (int j = 0 ; j < k ; j++) {
if (pre[i - 1][j] == 0)continue;
int rlb = max(lb - j,0);
int rub = ub - j;
int cnt = 0;
if (rlb == 0) {
cnt = suf[i+1][rub];
}
else {
cnt = suf[i+1][rub] - suf[i+1][rlb-1];
}
if (cnt) {
ans++;
break;
}
}
}
cout << n - ans << '\n';
}
| 0
| 38,598,686
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll x,y;
cin >> x >> y;
int n = 1;
while(x>y || 2*x<=y){x += x; n++;}
cout << n << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(n) cout << ( (n) ? "YES":"NO") << endl;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
int main(void)
{
IOS
const int N = 1e7+1;
int n; cin >> n;
vector<int> m(N);
REP(i,n) {
int x;
cin >> x;
m[x]++;
}
int cnt = 0;
REP(i,N) if (m[i] != 0) cnt++;
cout << ( cnt % 2 == 0 ? cnt -1 : cnt ) << endl;
return 0;
}
| 0
| 5,187,111
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n;
ll k;
cin>>n>>k;
vector<pair<ll,ll>> v(n);
rep(i,n) cin>>v[i].first>>v[i].second;
sort(v.begin(),v.end());
ll res=0,sum=0;
rep(i,n) {
sum+=v[i].second;
if (sum>=k) {
res=v[i].first;
break;
}
}
cout<<res<<endl;
}
|
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
#define CIN(type, x) \
type x; \
cin >> x
#define TRUE__ "Yes"
#define FALSE__ "No"
#define PRINT(f) \
if ((f)) \
{ \
cout << (TRUE__) << endl; \
} \
else \
{ \
cout << FALSE__ << endl; \
}
#define RS resize
#define CINV(v, N) \
do \
{ \
v.RS(N); \
rep(i, N) cin >> v[i]; \
} while (0);
#define RCINV(v, N) \
do \
{ \
v.RS(N); \
rrep(i, N) cin >> v[i]; \
} while (0);
template <typename T>
inline T GET()
{
T val;
cin >> val;
return val;
}
void init();
void solve();
signed main()
{
init();
solve();
}
int H, W, N;
map<pair<int, int>, int> m;
map<pair<int, int>, int> cnt;
int res[10];
void init()
{
cin >> H >> W >> N;
rep(i, N) {
int a, b;
cin >> a >> b;
a--;
b--;
m[MP(a, b)] = 1;
}
}
int calc(int r, int c)
{
if (r <= 0 || r >= H-1 || c <= 0 || c >= W-1) {
return 0;
}
int dr[] = {-1, -1, 0, 1, 1, 1, 0, -1, 0};
int dc[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};
int x = 0;
rep(i, 9) {
x += m.count(MP(r+dr[i], c+dc[i]));
}
res[x]++;
return x;
}
void solve()
{
for (auto x : m) {
int a, b;
a = x.first.first;
b = x.first.second;
int dr[] = {-1, -1, 0, 1, 1, 1, 0, -1, 0};
int dc[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};
rep(i, 9) {
if (cnt[MP(a+dr[i], b+dc[i])] == 0) {
cnt[MP(a+dr[i], b+dc[i])] = calc(a+dr[i], b+dc[i]);
}
}
}
int sum = 0;
rep(i, 10) {
sum += res[i];
}
res[0] = (H - 2) * (W - 2) - sum;
rep(i, 10) {
cout << res[i] << endl;
}
}
| 0
| 75,302,711
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
bool is_palindrome(int x)
{
int tmp = x;
int res = 0;
if (x != 0 && x % 10 == 0)
{
return 0;
}
while (res < x)
{
res = res * 10 + x % 10;
x /= 10;
}
return x == res || x == res / 10;
}
int main()
{
int a, b;
cin >> a >> b;
int ans = 0;
rep2(i, a, b + 1) ans += is_palindrome(i);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define all(x) (x).begin(),(x).end()
ll t1,t2,t3;
const ll mod = 1000000007;
const int INF = 1e9;
const ll INFLONG = 1e18;
ll n;
class Point{
public:
double x;
double y;
Point(){
}
Point(double x,double y):x(x),y(y){
}
};
void print(Point p){
printf("%.10f %.10f\n",p.x,p.y);
}
void dfs(ll depth,Point p1,Point p2){
if(depth == n){
return;
}else{
vector<Point> vec(3);
double tm1,tm2;
vec[0].x = (2 * p1.x + p2.x) / 3;
vec[0].y = (2 * p1.y + p2.y) / 3;
tm1 = (p1.x + p2.x) / 2;
tm2 = (p1.y + p2.y) / 2;
vec[2].x = (p1.x + 2 * p2.x) / 3;
vec[2].y = (p1.y + 2 * p2.y) / 3;
vec[1].x = tm1 - (tm2 - vec[0].y) * sqrt(3);
vec[1].y = tm2 + (tm1 - vec[0].x) * sqrt(3);
dfs(depth+1,p1,vec[0]);
print(vec[0]);
dfs(depth+1,vec[0],vec[1]);
print(vec[1]);
dfs(depth+1,vec[1],vec[2]);
print(vec[2]);
dfs(depth+1,vec[2],p2);
}
}
int main(){
cin >> n;
Point p1(0.0,0.0),p2(100.0,0.0);
print(p1);
dfs(0,p1,p2);
print(p2);
}
| 0
| 24,109,369
|
#include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod = 1e9+7;
const int mod1 = 998244353;
const int inf = 9223372036854775807ll;
void solve()
{
int n;
cin>>n;
int a[n];
int sum = 0;
loop(i,0,n)
cin>>a[i];
loop(i,0,n)
{
loop(j,0,n)
if(i!=j)
sum += a[i]*a[j];
}
cout<<sum/2;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int a,b,C;
cin >> a >> b >> C;
printf("%.4f\n%.4f\n%.4f\n"
,a*b*sin((double)C/180*M_PI)/2
,a+b+sqrt((double)pow(a,2)+pow(b,2)-2*a*b*cos((double)C/180*M_PI))
,b*sin((double)C/180*M_PI));
return 0;
}
| 0
| 48,727,058
|
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cntr = n / r + 1, cntg = n / g + 1;
int ans = 0;
rep(i, cntr) {
rep(j, cntg) {
int value = n - r * i - g * j;
if(value >= 0 && value % b == 0) ans++;
}
}
cout << ans << endl;
return 0;
}
|
#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<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using vb = vector<bool>;
using mll = map<ll, ll>;
using sll = stack<ll>;
#define REP(i,n) for(ll i(0);(i)<(n);(i)++)
#define rep(i,n) for(ll i(0);(i)<(n);(i)++)
#define ALL(a) a.begin(), a.end()
#define elnd endl
void solve(long long N, long long A, long long B, std::vector<long long> P){
ll cntA=0, cntB=0, cntC=0;
A++; B++;
REP(i, N){
if(P[i]<A){
cntA++;
}
else if(P[i]<B){
cntB++;
}
else{
cntC++;
}
}
cout << min(cntA, min(cntB, cntC)) << endl;
}
int main(){
long long N;
scanf("%lld",&N);
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
std::vector<long long> P(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&P[i]);
}
solve(N, A, B, std::move(P));
return 0;
}
| 0
| 96,810,081
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; 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 int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
int a, b, c;
int main() {
cin >> a >> b >> c;
if (a == b) {
cout << c;
} else if (b == c) {
cout << a;
} else {
cout << b;
}
}
|
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i=(a); i<(b); i++)
#define all(obj) (obj).begin(), (obj).end()
#define fi first
#define sc second
#define pb push_back
#define str to_string
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
void chmax(ll &a, ll b) { a = max(a, b); }
void chmin(ll &a, ll b) { a = min(a, b); }
ll dp[1010][1010];
ll LCS(string a, string b) {
int N = a.size();
int M = b.size();
memset(dp, 0, sizeof(dp));
rep(i, 0, N+1) rep(j, 0, M+1) {
if (i < N) {
chmax(dp[i+1][j], dp[i][j]);
}
if (j < M) {
chmax(dp[i][j+1], dp[i][j]);
}
if (i < N && j < M && a[i] == b[j]) {
chmax(dp[i+1][j+1], dp[i][j]+1);
}
}
return dp[N][M];
}
int main() {
int Q;
string a, b;
cin >> Q;
rep(i, 0, Q) {
cin >> a;
cin >> b;
cout << LCS(a, b) << endl;
}
return 0;
}
| 0
| 61,191,908
|
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const double PI = acos(-1);
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
}
else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
double w,h,x,y;
cin >> w >> h >> x >> y;
double mw = w / 2;
double mh = h / 2;
if(mw == x && mh == y){
cout << w * h / 2 << " " << 1 << endl;
} else {
cout << w * h / 2 << " " << 0 << endl;
}
}
|
#ifdef __APPLE__
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
# include <deque>
# include <functional>
# include <iomanip>
# include <sstream>
# include <fstream>
# include <complex>
# include <numeric>
# include <immintrin.h>
# include <cassert>
# include <array>
# include <tuple>
# include <unordered_map>
# include <unordered_set>
# include <thread>
#else
# include <bits/stdc++.h>
#endif
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define files(name) name!=""?freopen(name".in","r",stdin),freopen(name".out","w",stdout):0
#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define elif else if
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
using namespace std;
#define int long long
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long double ld;
typedef long long ll;
const int arr=2e5+10;
const int ar=2e3+10;
const ld pi=acos(-1);
const ld eps=1e-10;
const ll md=1e9+7;
const ll inf=1e18+10;
int h,w,n;
bool is_ok_start(int a,int b)
{
return a>=1&&b>=1&&a+2<=h&&b+2<=w;
}
signed main()
{
#ifdef __APPLE__
files("barik");
freopen("debug.txt","w",stderr);
#endif
cin>>h>>w>>n;
vector<pii> black;
vector<pii> interesting;
for (int i=1;i<=n;i++){
int a,b;
cin>>a>>b;
black.pb(mp(a,b));
for (int dx=0;dx>=-2;dx--){
for (int dy=0;dy>=-2;dy--){
if (is_ok_start(a+dx,b+dy)){
interesting.pb(mp(a+dx,b+dy));
}
}
}
}
sort(all(black));
sort(all(interesting));
interesting.resize(unique(all(interesting))-interesting.begin());
vi ans(10);
for (auto i:interesting){
int cur=0;
for (int dx=0;dx<=2;dx++){
for (int dy=0;dy<=2;dy++){
cur+=(binary_search(all(black), mp(i.fir+dx,i.sec+dy)));
}
}
ans[cur]++;
}
ans[0]+=(w-2)*(h-2)-len(interesting);
for (auto i:ans){
cout<<i<<"\n";
}
}
| 0
| 20,869,571
|
#include <iostream>
using namespace std;
int main() {
int N, tmp, A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
A[i] = tmp - 1;
}
int index = 0, res = -1;
for (int i = 0; i < N; i++) {
index = A[index];
if (index == 1) {
res = i + 1;
break;
}
}
cout << res << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int main(){
int N,Y;
cin>>N>>Y;
for(int x=0;N>=x;++x){
for(int y=0;N>=y;++y){
if(10000*x+5000*y+1000*(N-x-y)==Y&&N-x-y>=0){
cout<<x<<" "<<y<<" "<<N-x-y<<endl;
return 0;
}
}
}
cout<<"-1 -1 -1"<<endl;
}
| 0
| 71,570,316
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
int main() {
string s;
cin >> s;
if(s.size() != 26) {
vector<bool> ex(26,false);
for(char c : s) ex[c-'a'] = true;
cout << s;
rep(i,26) if(!ex[i]) {
char c = 'a'+i;
cout << c << endl;
return 0;
}
} else {
for(int i = 24; i >= 0; i--) {
char c = s[i];
bool ok = false;
rep2(j,i+1,26) {
if(s[j] > c) ok = true;
}
if(ok) {
cout << s.substr(0,i);
string ns = s.substr(i);
char nc = 'z';
rep2(j,1,ns.size()) if(ns[j] > c) chmin(nc,ns[j]);
cout << nc << endl;
return 0;
}
}
}
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
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>;
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, M;
cin >> N >> M;
vector<ll> P(N);
vector<bool> ans(N, false);
REP(i, N){
ll p;
cin >> p;
p--;
P[i] = p;
if(i == p){
ans[i] = true;
}
}
Graph G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(N, -1);
queue<int> que;
for (int v = 0; v < N; ++v) {
if (dist[v] != -1) continue;
map<ll, ll> M;
dist[v] = 0, que.push(v);
while (!que.empty()) {
int v = que.front(); que.pop();
if(M.count(v)){
M[v]++;
}
else{
M[v] = 1;
}
if(M.count(P[v])){
M[P[v]]++;
}
else{
M[P[v]] = 1;
}
for (auto nv : G[v]) {
if (dist[nv] == -1) {
dist[nv] = dist[v] + 1;
que.push(nv);
}
}
}
for(auto iter=M.begin(); iter!=M.end(); iter++){
if(iter->second == 2){
ans[iter->first] = true;
}
}
}
ll count = 0;
REP(i, N){
if(ans[i]) count++;
}
cout << count << endl;
return 0;
}
| 0
| 90,712,407
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
char a[14],b[14],c[14];
int na,nb,nc;
int cnt[27] = {0};
scanf("%s %s %s", a, b, c);
na = strlen(a);
nb = strlen(b);
nc = strlen(c);
if(a[na - 1] == b[0] && b[nb - 1] == c[0]) printf("YES\n");
else printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long h,w,n,u,v,s,t,cs=0,kq[15],dem,p,q;
struct st{
long long x,y;
};
st a[1000010];
bool cmp(st c, st d){
if (c.x==d.x) return c.y < d.y;
else return c.x < d.x;
}
int main()
{
cin >> h >> w >> n;
for (long i=1;i<=n;i++){
cin >> u >> v;
for (int j=0;j<=2;j++){
for (int k=0;k<=2;k++){
s=u-j;
t=v-k;
if (s>0 && t>0 && s<=h-2 && t<=w-2){
cs++;
a[cs].x=s;
a[cs].y=t;
}
}
}
}
p=(h-2)*(w-2);
sort(a+1,a+1+cs,cmp);
dem=1;
for (long i=2;i<=cs+1;i++){
if (a[i].x==a[i-1].x && a[i].y==a[i-1].y) dem++;
else {
kq[dem]++;
dem=1;
q++;
}
}
kq[0]=p-q;
for (int i=0;i<=9;i++) cout << kq[i] << endl;
return 0;
}
| 0
| 34,505,318
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
char a[510][510];
int main(){
rep(i,2) rep(j,3) cin >> a[i][j];
bool ok = true;
rep(j,3) if(a[1][j] != a[0][2-j]) ok = false;
cout << (ok ? "YES" : "NO") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,a[1<<18],b[1<<18],ans,x,y;
int main(void){
cin>>n;
for(int i=0;i<1<<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
for(int j=0;j<1<<n;j++){
if(j&(1<<i)){
x=a[j^(1<<i)],y=b[j^(1<<i)];
if(a[j]<x)swap(a[j],x);
b[j]=max(b[j],max(x,y));
}
}
}
for(int i=1;i<1<<n;i++){
ans=max(ans,a[i]+b[i]);
cout<<ans<<endl;
}
}
| 0
| 58,706,980
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 100000000
#define INF 300000000000000000
#define MOD 1000000007
#define mod 1000000007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll>a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi<b.fi;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
string s,t;cin>>s>>t;
for(int len=n;len>=0;len--){
string ss=s.substr(n-len,len);
string tt=t.substr(0,len);
if(ss==tt){
cout<<2*n-len<<endl;
return 0;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
typedef long long LL;
using namespace std;
#define NIL -1
vector<LL> num_div={1,3,5,15,25,75};
vector<LL> num_list;
LL num_lim;
LL dfs(LL idx, LL x){
if(x==1){
return 1;
}else if(idx==num_lim){
return 0;
}
LL ans=0;
for(LL i=0; i<num_div.size(); i++){
if(num_list[idx]+1<num_div[i]){
continue;
}
if(x%num_div[i]==0){
LL tmp=dfs(idx+1, x/num_div[i]);
ans+=tmp;
}
}
return ans;
}
int main(){
LL n;
map<LL, LL> num;
cin >> n;
for(LL i=2; i<=n; i++){
LL tmp=i;
LL idx=2;
while(tmp!=1){
while(tmp%idx==0){
num[idx]++;
tmp/=idx;
}
idx++;
}
}
for(auto i=num.begin(); i!=num.end(); i++){
if(i->second>=2){
num_list.push_back(i->second);
}
}
num_lim=num_list.size();
cout << dfs(0,75) << endl;
return 0;
}
| 0
| 23,144,316
|
#include <iostream>
using namespace std;
int main() {
char b;
for(int i=0;i<5;i++){
char a;
cin>>a;
cout<<a;
}
cin>>b;
cout<<" ";
for(int i=0;i<7;i++){
char a;
cin>>a;
cout<<a;
}
cin>>b;
cout<<" ";
for(int i=0;i<5;i++){
char a;
cin>>a;
cout<<a;
}
cout<<endl;
}
|
#include <bits/stdc++.h>
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define iter_(i,n) for (int i = 0; i < int(n); i++)
#define for_n(i, n) for (int i = 1; i <= int(n); i++)
#define pb push_back
#define mp make_pair
#define itr ::iterator
#define s_sort(s) sort(s.begin(),s.end())
#define n_sort(a) sort(a,a+n)
#define thank_you return 0
#define thanks return
#define pii pair<int,int>
#define precise_impact cout<<setprecision(10)<<fixed;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ulli;
typedef double db;
#define PI acos(-1.00)
#define MOD 1000000007
ll bigmod(ll a,ll b){
if(b==0){
return 1;
}
ll tm=bigmod(a,b/2);
tm=(tm*tm)%MOD;
if(b%2==1)
tm=(tm*a)%MOD;
return tm;
}
int egcd(int a,int b,int &x,int &y){
if(a==0){
x=0;
y=1;
return b;
}
int x1,y1;
int d=egcd(b%a,a,x1,y1);
x=y1-(b/a)*x1;
y=x1;
return d;
}
void solve();
int main()
{
boost_;
precise_impact;
int t=1;
while(t--)
solve();
thank_you;
}
void solve()
{
int a,b;
cin>>a>>b;
string s,p;
iter_(i,b){
s+=(char)(a+48);
}
iter_(i,a){
p+=(char)(b+48);
}
if(p<s){
cout<<p<<endl;
}
else
cout<<s<<endl;
}
| 0
| 28,258,901
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 100001;
const int MOD = 1000000007;
long fact[MAXN];
long long pw(long long a, int b) {
if (b == 0) return 1;
long long x = pw(a, b / 2);
x *= x;
x %= MOD;
if (b % 2 == 0) return x;
return x * a % MOD;
}
long long dv(long long a, long long b) {
return a * pw(b, MOD - 2) % MOD;
}
long long c(int n, int k) {
if (k > n) return 0;
return dv(dv(fact[n], fact[k]), fact[n - k]);
}
int main() {
fact[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact[i] = fact[i - 1] * i % MOD;
}
int n;
scanf("%d", &n);
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
a[i]--;
}
vector<int> ind(n, -1);
int i1 = -1, i2 = -1;
for (int i = 0; i < n + 1; i++) {
if (ind[a[i]] != -1) {
i1 = ind[a[i]];
i2 = i;
break;
} else {
ind[a[i]] = i;
}
}
const int MOD = 1000000007;
for (int k = 1; k <= n + 1; k++) {
long long cur = 0;
cur += c(n - 1, k);
cur += 2 * c(n - 1, k - 1);
cur -= c(i1 + (n - i2), k - 1);
if (k >= 2) {
cur += c(n - 1, k - 2);
}
cout << (cur % MOD + MOD) % MOD << "\n";
}
}
|
#include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll long long
#define INF 1000000000000000000
#define MOD 1000000007
#define rnd mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define uid uniform_int_distribution <int>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> cnt(26);
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']--;
ll ansi = 1;
for (int j = 0; j < 26; j++) {
if (s[i] - 'a' != j) {
ansi = (ansi * (cnt[j] + 1)) % MOD;
}
}
ans = (ans + ansi) % MOD;
}
cout << ans;
}
| 0
| 81,911,773
|
#include <iostream>
#include <numeric>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B,C;
cin >> A >> B>>C;
string s = "No";
if (A<=C&&C<=B) {
s="Yes";
}
cout << s << endl;
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
const int MOD = 1e9 + 7;
const int INF = 1e18 + 9;
constexpr long double pi = 3.141592653589793238462643383279;
int fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int keta(int n) {
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
int ketasum(int n) {
int sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
signed main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
vector<int> s(n, 0);
for (int i = 0; i < k; i++) {
cin >> d.at(i);
for (int j = 0; j < d.at(i); j++) {
vector<int> a(d.at(i));
cin >> a.at(j);
s.at(a.at(j) - 1) = 1;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += s.at(i);
}
cout << n - ans << endl;
}
| 0
| 40,206,715
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b; cin>>a>>b;
int c=a/0.08,d=b/0.1;
if(c>d) swap(c,d); --c; ++d;
while(c<=d){
if(floor(c*0.08)==a&&floor(c*0.1)==b) break;
else ++c;
}
if(c>d) cout<<-1; else cout<<c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,j=0,k=0;
cin>>n;
long a[n],b[n],c[200010];
for(long i=0;i<n;i++)cin>>a[i]>>b[i];
for(long i=0;i<n;i++)k+=a[i];
for(long i=0;i<200010;i++)c[i]=1000000001;
for(long i=0;i<n;i++){
if(a[i]>b[i]){
c[j]=b[i];
j++;
}
}
sort(c,c +n);
if(j>0){
cout<<k-c[0]<<endl;
}
else{
cout<<0<<endl;
}
return 0;
}
| 0
| 2,564,430
|
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include<string>
using namespace std;
int main()
{
long long int n,m,y,p;
cin>>n>>m;
y=n*n+m*m-n-m;
p=y/2;
cout<<p;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int x, n;
cin >> x >> n;
int *p = new int[n];
for (int i = 0; i < n;i++)
{
cin >> p[i];
}
int sml = INT_MAX;
int lar = INT_MIN;
int flag = 0;
for (int i = 0; i <= n;i++)
{
flag = 1;
for (int j = 0; j < n;j++)
{
if(x-i==p[j])
{
flag = 0;
break;
}
}
if(flag==1)
{
sml = x - i;
break;
}
}
for (int i = 0; i <= n;i++)
{
flag = 1;
for (int j = 0; j < n;j++)
{
if(x+i==p[j])
{
flag = 0;
break;
}
}
if(flag==1)
{
lar = x + i;
break;
}
}
if((lar-x)<(x-sml))
{
cout << lar << endl;
}else
{
cout << sml << endl;
}
return 0;
}
| 0
| 86,976,294
|
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
double L, l, V;
std::cin >> L;
l = L/3.0;
V = pow(l, 3.0);
std::cout << std::fixed;
std::cout << std::setprecision(7) << V;
}
|
#include<stdio.h>
bool exist[244140625];
int getnum(char *s){
int i = 0;
while(s[i] != '\0')
i++;
i--;
int j = 0,k = 1;
while(i >= 0){
if(s[i] == 'A')
j += k;
else if(s[i] == 'C')
j += k * 2;
else if(s[i] == 'G')
j += k * 3;
else if(s[i] == 'T')
j += k * 4;
i--;k *= 5;
}
return j;
}
int main(void){
int n;
scanf("%d",&n);
char op[10],s[20];
for(int i = 0;i < n;i++){
scanf("%s%s",op,s);
if(op[0] == 'i'){
exist[getnum(s)] = true;
}else
if(exist[getnum(s)])
printf("yes\n");
else
printf("no\n");
}
return 0;
}
| 0
| 91,714,174
|
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define putr(a) rep(testIncrement,0,a.size()) {puts(a[testIncrement]);} cout << endl
#define putrr(a) rep(Incr1,0,a.size()) {rep(Incr2,0,a[Incr1].size()) {puts(a[Incr1][Incr2]);} cout<<endl;} cout<<endl;
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define PI (acos(-1))
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
SINT64 N; cin >> N;
map<SINT64,SINT64> mp;
rep(i,2,N+1) {
SINT64 buf = i;
SINT64 ct = 2;
while(1) {
if ((buf % ct) == 0) {
buf /= ct;
mp[ct]++;
} else {
ct++;
}
if (buf == 1) break;
}
}
SINT64 ans = 1;
SINT64 ct1 = 0;
SINT64 ct2 = 0;
SINT64 ct3 = 0;
SINT64 ct4 = 0;
SINT64 ct5 = 0;
for(auto it=mp.begin();it!=mp.end();it++) {
if (it->S >= 2) ct1++;
if (it->S >= 4) ct2++;
if (it->S >= 14) ct3++;
if (it->S >= 24) ct4++;
if (it->S >= 74) ct5++;
}
ans = MAX(0,(ct1-2)*(ct2-1)*(ct2)/2);
ans += MAX(0,(ct3)*(ct2-1));
ans += MAX(0,(ct4)*(ct1-1));
ans += MAX(0,ct5);
put(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned 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;
const ld EPS = 1e-12L;
const ld PI = 3.1415926535897932385L;
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 powint(ull x, ll y){ ll r=1; while(y){ if(y&1) r*=x; x*=x; y>>=1; } return r; }
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>inline bool chmax(S &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class S, class T>inline 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
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vll a(n);
rep(i, n){
cin >> a[i];
}
ll ans = 0;
while(*max_element(ALL(a)) > n-1){
dump(a);
ll S = 0;
rep(i, n){
S += a[i]/n;
}
rep(i, n){
a[i] += S - a[i]/n - a[i]/n*n;
}
ans += S;
}
cout << ans << endl;
return 0;
}
| 0
| 93,625,908
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string s;
int br0=0,br1=0;
cin >> s;
for (int i=0;i<s.size();i++)
{
if(s[i]=='0')
br0++;
else
br1++;
}
cout << 2*min(br0,br1);
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a;
string b;
cin>>a>>b;
int ans;
ans+=(b[0]-'0')*100;
ans+=(b[2]-'0')*10;
ans+=(b[3]-'0');
long long d=a*ans/100;
cout<<d<<endl;
}
| 0
| 24,789,389
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type,Name, n,m,d)vector<vector<Type>> Name(n, vector<Type>(m, d))
#define P pair
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << 6 - a - b << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, x4, y4;
int n;
cin >> n;
for(int p=0; p < n; p++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
x1 -= x2; y1 -= y2; x3 -= x4; y3 -= y4;
cout << (abs(x1*y3-y1*x3) < 1e-10?"YES":"NO") << endl;
}
}
| 0
| 81,789,835
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll res[100005];
ll niz[100005];
int main(){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for(int i=1; i<=n; i++){
cin >> niz[i];
}
deque <int> q;
for(int i=n; i>=1; i--){
while(!q.empty() && niz[q.back()] <= niz[i]) q.pop_back();
q.push_back(i);
}
q.push_back(0);
priority_queue <int> pq;
int cnt = 1;
int rr = q.front();
for(int i=n; i>rr; i--) pq.push(niz[i]);
while(q.size() >= 2){
int i = q.front();
q.pop_front();
int j = q.front();
ll tren = niz[i];
while(!pq.empty() && pq.top() > niz[j]){
res[i] += (tren-pq.top())*cnt;
cnt++;
tren = pq.top();
pq.pop();
}
res[i] += (tren-niz[j])*cnt;
tren = niz[j];
for(int k=i-1; k>j; k--){
pq.push(niz[k]);
}
pq.push(tren);
}
for(int i=1; i<=n; i++){
cout << res[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr double EPS = 1e-12;
int main(){
int n;
cin >> n;
vector<int64> a(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
for(int i = 0; i < n; ++i){
if(a[i] == 0LL){
cout << 0 << endl;
return 0;
}
}
double keta = 0;
for(int i = 0; i < n; ++i){
keta += log10(a[i]);
}
if(keta > 18 + EPS){
cout << -1 << endl;
return 0;
}
int64 ans = 1;
for(int i = 0; i < n; ++i){
ans *= a[i];
}
if(ans > 1000000000000000000LL) cout << -1 << endl;
else cout << ans << endl;
}
| 0
| 14,123,395
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
map<char, int> cnt;
for(int i = 0; i < n; i++){
char now = s.at(i);
cnt[now]++;
}
long long ans = 1, mod = pow(10,9) + 7;
for(auto now : cnt) ans = ans * ++now.second % mod;
ans = (ans + mod -1) % mod;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
string S;
cin >> S;
int ans = 0, l = 0, r = S.size() - 1;
while (r - l > 0) {
if (S[l] == S[r])
++l, --r;
else {
if (S[l] == 'x')
++l, ++ans;
else if (S[r] == 'x')
--r, ++ans;
else {
cout << -1 << endl;
return 0;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 93,908,078
|
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
#define rng(i,l,r) for(size_t i=(l);i<(r);++i)
#define rep(i,n) rng(i,0,n)
#define gnr(i,l,r) for(size_t i=(r)-1;i>=(l);i--)
#define per(i,b) gnr(i,0,b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
using namespace std;
const int MOD = 1e9+7;
const int INF = 1e18;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1,1,0,-1,-1,-1,0,1};
const int dy8[8] = {0,1,1,1,0,-1,-1,-1};
const double pi = acos(-1);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
vector<int> fac(1e6+10);
vector<int> ifac(1e6+10);
int mpow(int x, int n){
int ans = 1;
while(n != 0){
if(n&1) ans = ans*x % MOD;
x = x*x % MOD;
n = n >> 1;
}
return ans;
}
int comb(int a, int b){
if(a == 0 && b == 0)return 1;
if(a < b || a < 0)return 0;
int tmp = ifac[a-b]* ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
void solve(){
std::ifstream in("sample.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int x,y; cin >> x >> y;
bool isOKn = ((2*y-x)>=0 && (2*y-x)%3==0);
bool isOKm = ((2*x-y)>=0 && (2*x-y)%3==0);
if(!(isOKn && isOKm)) {
cout << 0 << endl;
return;
}
int n = (2*y-x)/3;
int m = (2*x-y)/3;
fac[0] = 1;
ifac[0] = 1;
for(int i = 0; i<1e6+10; i++){
fac[i+1] = fac[i]*(i+1) % MOD;
ifac[i+1] = ifac[i]*mpow(i+1, MOD-2) % MOD;
}
cout << comb(m+n,n) << endl;
}
signed main() {
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
int ar[10005];
lli dp[10005][200][2];
lli getSum(int pos , int n , lli d, lli sum , bool flag)
{
if(pos > n) {
if(sum==d) return 1;
return 0;
}
if(dp[pos][sum][flag] != -1) return dp[pos][sum][flag];
int limit = 9;
if(!flag) limit = ar[pos];
lli res = 0;
for(int i=0;i<=limit;i++)
{
if(flag || i != limit)
res +=getSum(pos + 1 , n ,d, (sum + !(!i)) , true);
else
res+=getSum(pos + 1 , n ,d, (sum + !(!i)) , false);
}
return dp[pos][sum][flag] = res;
}
int digitSum(string num)
{
int res = 0;
for(char digit : num)
res += digit - '0';
return res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a;
lli d=0,ans=0;
cin>>a;
cin>>d;
lli L;
for(int i=0;i<a.size();i++)
ar[i+1] = a[i] - '0';
memset(dp , -1 , sizeof dp);
L = getSum(1 , a.size() , d, 0 , 0);
cout<<L<<endl;
}
| 0
| 72,474,998
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int k, a, b;
cin >> k >> a >> b;
if (a <= b / k * k)cout << "OK" << endl;
else cout << "NG" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> nums(N);
for (int i = 0; i < N; i++)
{
cin >> nums.at(i);
}
vector<ll> ruisekiMod(N + 1);
map<ll, ll> ruisekiModCount;
for(int i = 0; i < N; i++)
{
ruisekiMod.at(i + 1) = (ruisekiMod.at(i) + nums.at(i)) % M;
ruisekiModCount[ruisekiMod.at(i + 1)]++;
}
ll answer = 0;
for(int i = 0; i < N; i++)
{
ll currentMod = ruisekiMod.at(i);
answer += ruisekiModCount[currentMod];
ruisekiModCount[ruisekiMod.at(i + 1)]--;
}
cout << answer << endl;
return 0;
}
| 0
| 56,864,107
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
for(int i=0; i<n; i++){
cin >> x[i] >> y[i] >> z[i];
}
ll ans = 0;
for(int i=-1; i<=1; i+=2){
for(int j=-1; j<=1; j+=2){
for(int k=-1; k<=1; k+=2){
priority_queue<ll> items;
for(int a=0; a<n; a++){
ll scr = i * x[a] + j * y[a] + k * z[a];
items.push(scr);
}
ll tmp_ans = 0;
for(int b=0; b<m; b++){
tmp_ans += items.top();
items.pop();
}
ans = max(ans, tmp_ans);
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
string s, t;
cin>>s>>t;
int ls = s.length(), lt = t.length(), i, j, k, c, maxval=0;
for(i=0; i<=(ls-lt); i++){
for(j=i, k=0, c=0; j<i+lt && k<lt; j++, k++){
if(t[k]==s[j]) c++;
}
maxval = max(maxval, c);
}
cout<<lt-maxval;
}
| 0
| 48,622,262
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll k=1,a=10,ans=1;
bool que(ll x){
printf("? %lld\n",x);
fflush(stdout);
char c;
scanf(" %c",&c);
return c=='Y';
}
int main(void){
while(a<=100000000000&&que(a)){
k++;
a*=10;
}
if(k>10){
a=2;
while(!que(a)){
a*=10;
}
printf("! %lld\n",a/2);
return 0;
}
ll l=0,r=10;
while(r-l>1){
ll m=(l+r)/2;
if(que(m*a))r=m;
else l=m;
}
ans=l;
for(int i=1;i<k;i++){
l=-1;
r=10;
while(r-l>1){
ll m=(l+r)/2;
if(que((ans*10+m)*a))r=m;
else l=m;
}
ans=ans*10+l;
a/=10;
}
printf("! %lld\n",ans+1);
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_dimension_size),value)
#define FILL(n,first_dimension_size,value) fill((int*)n,(int*)(n+first_dimension_size),value)
#define INF (1 << 30)
#define MOD 1000000007
int main(){
int n,a,b,c;
cin >> n >> a >> b >> c;
vector<int> l(n);
REP(i,n)cin >> l[i];
ll res = INF;
for(int bita = 1;bita < (1 << n);bita++){
vector<bool> usea(n,0);
REP(i,n)if(bita >> i & 1)usea[i] = true;
for(int bitb = 1;bitb < (1 << n);bitb++){
vector<bool> useb(n,0);
bool flag = true;
REP(i,n){
if(bitb >> i & 1){
if(usea[i])flag = false;
else useb[i] = true;
}
}
if(!flag)continue;
for(int bitc = 1;bitc < (1 << n);bitc++){
flag = true;
vector<bool> usec(n,0);
ll sum = 0;
REP(i,n){
if(bitc >> i & 1){
if(!usea[i] && !useb[i])usec[i] = true;
else flag = false;
}
}
if(!flag)continue;
int aa = 0,bb = 0,cc = 0;
int count = 0;
REP(i,n)if(usea[i])aa += l[i],count++;
if(count)sum += (count-1)*10;
count = 0;
REP(i,n)if(useb[i])bb += l[i],count++;
if(count)sum += (count-1)*10;
count = 0;
REP(i,n)if(usec[i])cc += l[i],count++;
if(count)sum += (count-1)*10;
sum += abs(a-aa);
sum += abs(b-bb);
sum += abs(c-cc);
res = min(res,sum);
}
}
}
cout << res << endl;
return 0;
}
| 0
| 76,965,603
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll n,m,d;
cin >> n >> m >> d;
if(d == 0){
printf("%.14lf\n",(double)(m-1)/n);
}
else{
printf("%.14lf\n",(double)(m-1)*2*(n-d)/(n*n));
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll A,B;
cin >>A>>B;
ll ansA=0,ansB=0;
rep3(i,2,55){
if((A/(ll(1)<<(i-1)))%2==1){
if(A%2 == 0){
ansA+=(ll(1)<<(i-1));
}
}
if((B/(ll(1)<<(i-1)))%2==1){
if(B%2 == 0){
ansB+=(ll(1)<<(i-1));
}
}
}
if((A%4)==1 || (A%4)==2){
ansA++;
}
if((B%4)==1 || (B%4)==2){
ansB++;
}
cout << (ansA^ansB^A) << endl;
return 0;
}
| 0
| 87,052,894
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int,int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)
#define GOODBYE do { cout << "0" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
signed main(void){
int W,H;
int p[114514],q[114514];
vector<pair<int,int>> P;
cin >> W >> H;
REP(i,W){
cin >> p[i];
P.push_back({p[i],0});
}
REP(i,H){
cin >> q[i];
P.push_back({q[i],1});
}
int Ans=0;
sort(P.begin(),P.end());
int inter[214514]={};
REP(i,P.size()){
if(i==0){inter[0]=1;continue;}
if(P[i].second==P[i-1].second){
inter[i]=inter[i-1]+1;
}else{
inter[i]=1;
}
}
int w=W+1,h=H+1;
REP(i,P.size()){
if(i==0){
if(P[i].second==0){
Ans+=P[i].first * h;
}else{
Ans+=P[i].first * w;
}
continue;
}
if(P[i].second==0){
if(inter[i]==1){
h-=inter[i-1];
}
Ans+=P[i].first * h;
}else{
if(inter[i]==1){
w-=inter[i-1];
}
Ans+=P[i].first * w;
}
}
cout << Ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define precise cout.precision(10); cout << fixed;
#define endl "\n"
#define int int64_t
#define ll long long
#define yes printf("Yes\n")
#define no printf("No\n")
#define push_back pb
int32_t main()
{
long long n,i,l;
cin>>n>>l;
vector<string>s(n);
for(i=0;i<n;i++)
{
cin>>s[i];
}
sort(s.begin(),s.end());
for(i=0;i<n;i++)
{
cout<<s[i];
}
cout<<endl;
return 0;
}
| 0
| 16,595,152
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
ll w,h,x,y;
cin>>w>>h>>x>>y;
double area=w*h*.5;
x*=2;
y*=2;
int f=0;
if(x==w && y==h)
f=1;
cout<<setprecision(10)<<fixed<<area<<" "<<f<<endl;
return 0;
}
|
#include <iostream>
#include <stdlib.h>
#include <math.h>
using namespace std;
int main() {
double x1, y1, x2, y2, x3, y3, xp ,yp,ss,s1,s2,s3;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
ss=fabs((x3-x1)*(y2-y1)-(x2-x1)*(y3-y1));
s1=fabs((x3-xp)*(y2-yp)-(x2-xp)*(y3-yp));
s2=fabs((x3-xp)*(y1-yp)-(x1-xp)*(y3-yp));
s3=fabs((x2-xp)*(y1-yp)-(x1-xp)*(y2-yp));
if(fabs(s1+s2+s3-ss)<0.001){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}}
return 0;
}
| 0
| 64,100,228
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T1, typename T2>
istream& operator>>(istream& os, pair<T1, T2>& p) {
os >> p.first >> p.second;
return os;
}
int main() {
ll n, d, a;
cin >> n >> d >> a;
vector<pair<ll, ll>> v(n);
for (ll i = 0; i < n; ++i)cin >> v[i];
sort(v.begin(), v.end());
vector<ll> x(n);
vector<ll> h(n);
for (ll i = 0; i < n; ++i) {
x[i] = v[i].first;
h[i] = (v[i].second - 1) / a + 1;
}
vector<ll> sum(n, 0);
ll ans = 0;
for (ll i = 0; i < n; ++i) {
if (i != 0)sum[i] += sum[i - 1];
ll preans = max(0ll,h[i] - sum[i]);
ans += preans;
sum[i] += preans;
ll idx = distance(x.begin(), upper_bound(x.begin(), x.end(), x[i] + 2 * d));
if (idx < n)sum[idx] -= preans;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
priority_queue<ll> q;
ll all=0;
for(int i=0; i<n; i++){
ll a;
cin >> a;
q.push(a);
all += a;
}
ll discount = 0;
for(int i=0; i<m; i++){
ll use;
use = q.top();
q.pop();
discount += (use+1)/2;
q.push(use/2);
}
cout << all - discount << endl;
}
| 0
| 24,501,409
|
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
#include <memory>
#include <regex>
using namespace std;
int main()
{
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for(int i=0; i<h; ++i)
cin >> s[i];
int ans = 0;
for(int i=0; i<(1<<(h+w)); ++i){
bitset<32> bs(i);
int cnt = 0;
for(int y=0; y<h; ++y){
for(int x=0; x<w; ++x){
if(!bs[y] && !bs[h+x] && s[y][x] == '#')
++ cnt;
}
}
if(cnt == k)
++ ans;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
bool isPrime(ll x){
ll i;
if(x < 2)return 0;
else if(x == 2) return 1;
if(x%2 == 0) return 0;
for(i = 3; i*i <= x; i += 2) if(x%i == 0) return 0;
return 1;
}
signed main(void)
{
ll n;
cin >> n;
ll r = 0;
vll a(n);
rep(i, n) {
cin >> a[i];
}
Sort(a);
r = a[n/2] - a[n/2-1];
mes(r);
}
| 0
| 20,208,028
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s;
ll n,k; cin>>n>>s>>k;
rep(i,n) if(s[i]!=s[k-1]) s[i]='*';
cout<<s<<endl;
return 0;
}
|
#include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
array<int, 3> counter{};
int a, b;
cin >> a >> b;
for (int i = 0; i < n; i++)
{
int p;
cin >> p;
const auto index = (p <= a ? 0 : p <= b ? 1 : 2);
counter[index]++;
}
cout << *min_element(counter.begin(), counter.end()) << endl;
}
| 0
| 23,117,947
|
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<iomanip>
#include<math.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
#define INF 1000000000000000LL
int main(){
ll N; cin >> N;
ll a[N+1];
ll node = 0;
rep(i, N+1){
cin >> a[i];
}
ll c[N+2];
c[0] = 1;
for(int i=0; i<N+1; i++){
c[i+1] = min(2LL*(c[i]-a[i]), INF);
if(c[i+1] < 0){
cout << -1 << endl;
return 0;
}
}
node += a[N];
ll now = a[N];
for(int i=N-1; i>-1; i--){
now += a[i];
if(now < c[i]){
node += now;
}else{
node += c[i];
}
}
cout << node << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
constexpr int MOD = 1000000007;
int mod(const ll &x){
return x > 0 ? x % MOD : (x % MOD + MOD) % MOD;
}
int modm(const ll &x,const ll &m){
return (x % MOD) * (m % MOD) % MOD;
}
int modpow(ll x, ll p) {
int ret = 1;
while(p > 0) {
if (p & 1) ret = modm(ret,x);
x = modm(x,x);
p >>= 1;
}
return ret;
}
int modd(ll x,ll d) {
return modm(x,modpow(d,MOD-2));
}
int main(void)
{
IOS
int S; cin >> S;
vector<int> dp(S+1);
dp[0] = 1;
FOR(i,3,S+1) {
dp[i] = mod(dp[i-3] + dp[i-1]);
}
OUT(dp[S])
return 0;
}
| 0
| 80,412,973
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
string S; cin >> S;
if(S.length() < 4){
cout << "No" << endl;
return 0;
}
bool okay = true;
if(S[0] != 'Y') okay = false;
if(S[1] != 'A') okay = false;
if(S[2] != 'K') okay = false;
if(S[3] != 'I') okay = false;
cout << (okay ? "Yes" : "No") << endl;
return 0;
}
|
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<P,P> PP;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=4999999996000000001;
int main(){
ll n,d,a;
cin>>n>>d>>a;
vector<P> p(n);
for(ll i=0;i<n;i++) cin>>p[i].first>>p[i].second;
sort(p.begin(),p.end());
vector<ll> x(n),h(n);
for(ll i=0;i<n;i++){
x[i]=p[i].first;
h[i]=p[i].second;
}
ll ans=0;
vector<ll> damage(n+1,0);
for(ll i=0;i<n;i++){
ll now=x[i];
ll hp=h[i];
damage[i+1]+=damage[i];
ll num=(hp-damage[i+1]+a-1)/a;
num=max(num,(ll)0);
ans+=num;
damage[i+1]+=num*a;
ll next=upper_bound(x.begin(),x.end(),now+2*d)-x.begin();
if(next>=n) continue;
next++;
damage[next]-=num*a;
}
cout<<ans<<endl;
}
| 0
| 65,931,085
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<=111)
cout<<"111\n";
else if(n>111 && n<=222)
cout<<"222\n";
else if(n>222 && n<=333)
cout<<"333\n";
else if(n>333 && n<=444)
cout<<"444\n";
else if(n>444 && n<=555)
cout<<"555\n";
else if(n>555 && n<=666)
cout<<"666\n";
else if(n>666 && n<=777)
cout<<"777\n";
else if(n>777 && n<=888)
cout<<"888\n";
else if(n>888 && n<=999)
cout<<"999\n";
return 0;
}
|
#include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,L,T;
int pos[N],v[N];
int main(){
scanf("%d%d%d",&n,&L,&T);
for(int i=1;i<=n;i++) scanf("%d%d",&pos[i],&v[i]),v[i]=v[i]==1? 1:-1;
vector<int> fin;
for(int i=1;i<=n;i++)
fin.push_back(((pos[i]+v[i]*T)%L+L)%L);
int pos1=fin[0];
sort(fin.begin(),fin.end());
long long tot=0;
for(int i=1;i<=n;i++)
if(v[i]!=v[1])
tot+=(2*1LL*T+(v[1]==1? (L-pos[i]+pos[1]):(pos[i]-pos[1])) )/L;
tot=((v[1]*tot)%n+n)%n;
int id1=0;
for(int i=0;i<n;i++)
if(fin[i]==pos1){
id1=i;
if(v[1]==-1) break;
}
id1=((id1-tot)%n+n)%n;
for(int i=id1;i<n;i++)
printf("%d\n",fin[i]);
for(int i=0;i<id1;i++)
printf("%d\n",fin[i]);
return 0;
}
| 0
| 56,723,248
|
#include <iostream>
using namespace std;
int main(void) {
int n;
int score, sum_score;
int max_score, min_score;
int i;
cin >> n;
while (n) {
sum_score = 0;
max_score = 0;
min_score = 1000;
for (i=0; i<n; i++) {
cin >> score;
sum_score += score;
if (score < min_score) {
min_score = score;
}
if (score > max_score) {
max_score = score;
}
}
sum_score -= min_score + max_score;
cout << sum_score / (n-2) << endl;
cin >> n;
}
return 0;
}
|
#define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(ll i=0;i<(n);++i)
#define _rep3(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define _repe2(i,n) for(ll i=0;i<=(n);++i)
#define _repe3(i,a,b) for(ll i=(a);i<=(b);++i)
#define repe(...) _overload3(__VA_ARGS__,_repe3,_repe2)(__VA_ARGS__)
#define _rrep2(i,n) for(ll i=(n)-1;i>=0;i--)
#define _rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
template<class T>
bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
template<class T>
using pq=priority_queue<T,vector<T>,greater<T>>;
void solve();
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
solve();
}
void solve(){
ll h,w;cin>>h>>w;
vector<string> a(h);
rep(i,h)cin>>a[i];
ll ans=0;
vvl d(h,vl(w,INF));
queue<pl> q;
rep(i,h)rep(j,w){
if(a[i][j]=='#'){
q.emplace(i,j);
d[i][j]=0;
}
}
while(q.size()){
pl p=q.front();q.pop();
rep(i,4){
ll ty=p.first+D4[i],tx=p.second+D4[i+1];
if(ty<0||ty>=h||tx<0||tx>=w||d[ty][tx]!=INF)continue;
d[ty][tx]=d[p.first][p.second]+1;
chmax(ans,d[ty][tx]);
q.emplace(ty,tx);
}
}
cout<<ans<<endl;
}
| 0
| 79,665,651
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define SF scanf
#define PF printf
#define MAXN 200010
using namespace std;
int n;
struct node{
int x;
node *nxt;
}edge[MAXN*2];
node *head[MAXN],*ncnt=edge;
void add_edge(int x,int y){
ncnt++;
ncnt->x=y;
ncnt->nxt=head[x];
head[x]=ncnt;
}
int sg[MAXN];
void dfs(int x,int fa){
for(node *v=head[x];v!=NULL;v=v->nxt){
int u=v->x;
if(u==fa)
continue;
dfs(u,x);
sg[x]^=(sg[u]+1);
}
}
int main(){
SF("%d",&n);
int u,v;
for(int i=1;i<n;i++){
SF("%d%d",&u,&v);
add_edge(u,v);
add_edge(v,u);
}
dfs(1,0);
if(sg[1]==0)
PF("Bob");
else
PF("Alice");
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string O, E, ans = ""; cin >> O >> E;
int e = E.length(), j = 0, k = 0;
for (int i = 0; i < 2 * O.length(); ++i) {
if (i % 2 == 0) {
ans += O[j];
j++;
}
else if (e >= 1){
ans += E[k];
e--, k++;
}
}
cout << ans << endl;
}
| 0
| 88,271,650
|
#include <bits/stdc++.h>
using namespace std;
int dp1[2][32010], dp2[2][32010], *DP1[2] = {(dp1[0]+16005),(dp1[1]+16005)}, *DP2[2] = {(dp2[0]+16005),(dp2[1]+16005)};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
int x, y, c = 0, cur = 0, t = 0;
vector<int> xmoves, ymoves;
cin >> s;
cin >> x >> y;
s += 'T';
for (int i = 0; i < s.size(); ++i){
t++;
if (s[i] == 'F'){
cur++;
t--;
}
else if (cur){
if (!c){
if (t == 1){
x -= cur;
}
else xmoves.push_back(cur);
cur = 0;
c = 1;
}
else{
ymoves.push_back(cur);
cur = 0;
c = 0;
}
}
else{
c = 1 - c;
}
}
DP1[0][0] = 1;
for (int i = 1; i <= xmoves.size(); ++i){
for (int j = -8000; j <= 8000; ++j){
DP1[i&1][j] = (DP1[(i-1)&1][j-xmoves[i-1]] | DP1[(i-1)&1][j+xmoves[i-1]]);
}
}
DP2[0][0] = 1;
for (int i = 1; i <= ymoves.size(); ++i){
for (int j = -8000; j <= 8000; ++j){
DP2[i&1][j] = (DP2[(i-1)&1][j-ymoves[i-1]] | DP2[(i-1)&1][j+ymoves[i-1]]);
}
}
if (DP1[((int)xmoves.size())&1][x] && DP2[((int)ymoves.size())&1][y]){
cout << "Yes\n";
}
else cout << "No\n";
cout << flush;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(),(c).end()
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
#define INF 1e18
int main(){
int N,K; cin>>N>>K;
V<int> P(N),C(N);
rep(i,N)cin>>P.at(i),--P.at(i);
rep(i,N)cin>>C.at(i);
ll res = -INF;
rep(i,N){
int v = i;
ll cycle_sum = 0;
int cycle_cnt = 0;
while(1){
cycle_cnt++;
cycle_sum += C.at(v);
v = P.at(v);
if(v==i)break;
}
ll path = 0;
int cnt = 0;
while(1){
cnt++;
path += C[v];
if(cnt>K)break;
int num = (K-cnt) / cycle_cnt;
ll score = path + max(0ll, cycle_sum) * num;
chmax(res,score);
v = P.at(v);
if(v==i)break;
}
}
cout<<res<<endl;
}
| 0
| 20,002,790
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
using Graph = vector<vector<int>>;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
struct edge{ll to, cost;};
typedef pair<ll,ll> P;
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<P,vector<P>, greater<P> > que;
que.push(P(0,s));
while(!que.empty()){
P p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
};
class UnionFind
{
public:
int par[100005];
int depth[100005];
int nGroup[100005];
UnionFind(int n) {
init(n);
}
void init(int n) {
for(int i=0; i<n; i++) {
par[i] = i;
depth[i] = 0;
nGroup[i] = 1;
}
}
int root(int x) {
if(par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool same(int x, int y) {
return root(x) == root(y);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if(x == y) return;
if(depth[x] < depth[y]) {
par[x] = y;
nGroup[y] += nGroup[x];
nGroup[x] = 0;
} else {
par[y] = x;
nGroup[x] += nGroup[y];
nGroup[y] = 0;
if(depth[x] == depth[y])
depth[x]++;
}
}
};
const ll 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(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll n,k; cin>>n>>k;
ll ans = -INF;
ll ca = 0;
ll f = 0;
ll v[n]={};
rep(i,n) cin>>v[i];
for(ll i=0; i<=k; i++){
ca = 0;
if(i>=n){
f++;
break;}
for(ll j=0; j<=i; j++){
ca = 0;
priority_queue<ll, vector<ll>, greater<ll>> que;
for(ll p=0; p<j; p++){
ca+=v[p];
if(v[p]<0) que.push(v[p]);}
for(ll p=0; p<i-j; p++){
ca+=v[n-1-p];
if(v[n-1-p]<0) que.push(v[n-1-p]);}
for(ll p=0; p<k-i; p++){
if(que.size()==0) break;
ll r =que.top();
ca-=r;
que.pop();}
ans = max(ans,ca);
}
}
if(f>0){
priority_queue<ll, vector<ll>, greater<ll>> que;
ca = 0;
for(ll p=0; p<n; p++){
ca+=v[p];
if(v[p]<0) que.push(v[p]);}
for(ll p=0; p<k-n; p++){
if(que.size()==0) break;
ll r =que.top();
ca-=r;
que.pop();}
ans = max(ans,ca);}
cout << ans << endl;}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string.h>
#define s(n) scanf("%d",&n)
#define sc(n) scanf("%c",&n)
#define sl(n) scanf("%I64d",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define INF (int)1e9
#define EPS 1e-9
#define bitcount __builtin_popcount
#define gcd __gcd
#define forall(i,a,b) for(int i=a;i<b;i++)
#define foreach(v, c) for( typeof( (c).begin()) v = (c).begin(); v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define pb push_back
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define mp make_pair
#define MOD 1000000007
typedef long long ll;
using namespace std;
int dp[101][101];
int main()
{
int h,w;
cin>>h>>w;
vector<string> vec;
for(int i = 0;i<h;i++)
{
string str;
cin>>str;
vec.push_back(str);
}
if(vec[0][0] == '#') dp[0][0] = 1;
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
if(i == 0 && j == 0) continue;
int val = INF;
if(i-1 >= 0)
{
val = dp[i-1][j];
if(vec[i-1][j] == '.' && vec[i][j] == '#') val += 1;
}
if(j-1 >=0)
{
int temp = dp[i][j-1];
if(vec[i][j-1] == '.' && vec[i][j] == '#') temp+=1;
val = min(val , temp);
}
dp[i][j] = val; }
}
cout<<dp[h-1][w-1]<<endl;
return 0;
}
| 0
| 36,440,971
|
#include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
long N,M; cin >> N >> M;
vector<pair<long,long>> drink(N,make_pair(0,0));
for (int i = 0; i < N; i++) {
long a,b; cin >> a >> b;
drink[i] = make_pair(a,b);
}
sort(drink.begin(),drink.end());
long ans = 0;
for (int i = 0; i < N; i++) {
if (drink[i].second <= M) {
ans += drink[i].first * drink[i].second;
M -= drink[i].second;
}else {
ans += drink[i].first * M;
M -= M;
}
if (M == 0) {
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void Show(int s){
int i=1,l,r;
while(1){
if(i == 1){
l = 100;
r = 111;
}
else{
r = 100 * i + 10 * i + i;
l = r - 110;
}
if(l <= s && s <= r){
cout << i << i << i << endl;
break;
}
i++;
}
}
int main(void){
int s;
cin >> s;
Show(s);
}
| 0
| 23,207,226
|
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int W, H, N;
cin >> W >> H >> N;
int o_x = 0, o_y = 0;
while (N--) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) {
if (o_x <= x)
o_x = x;
} else if (a == 2) {
if (W >= x)
W = x;
} else if (a == 3) {
if (o_y <= y)
o_y = y;
} else if (a == 4) {
if (H >= y)
H = y;
}
}
if (o_x <= W && o_y <= H)
cout << (W - o_x) * (H - o_y) << endl;
else
cout << 0 << endl;
}
|
#include <bits/stdc++.h>
#define REP(i,s,e) for(int i=(s); i<(e);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n)
#define repe(i,n) for(auto &&i:n)
#define all(v) (v).begin(),(v).end()
#define decimal fixed<<setprecision(20)
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using LL = long long;
using namespace std;
using Graph = vector<vector<int>>;
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 = 1e9;
const LL LLINF = 1e16;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
signed main(){
fastcin();
int n, m;
cin >> n >> m;
vector<pair<int, int>> ans;
vector<int> d(n, 0);
if(n % 2 == 1){
rep(i, m) ans.emplace_back(i, 2*m-1-i);
}else{
int rem = n-2*m-1;
int l=m-1, r=m;
rep(i, m){
ans.emplace_back(l, r);
if(i+1 == (m+1)/2){
r+=rem;
}
l--; r++;
}
}
repe(i, ans){
cout << i.first+1 << " " << i.second+1 << endl;
}
}
| 0
| 4,090,549
|
#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++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
string yes = "Yes\n";
string no = "No\n";
int main()
{
int a,b,c,d; cin >> a >> b >> c >> d;
if (a + b > c + d)
cout << "Left\n";
else if (a + b < c + d)
cout << "Right\n";
else
cout << "Balanced\n";
return (0);
}
|
#include<iostream>
using namespace std;
int main(){
int n, x;
int S = 0;
while(1){
cin >> n >> x;
if((n == 0) && (x == 0))break;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
for(int k = 1; k <= n; k++){
if(((i + j + k) == x) && (i != j) && (j != k) && (k != i)){
S += 1;
}
}
}
}
S = S / 6;
cout << S << endl;
S = 0;
}
}
| 0
| 79,442,518
|
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> button(n);
for (int i = 0; i < n; i++)
cin >> button.at(i);
int i;
bool meetTwo = false;
int num = button.at(0);
for (i = 0; i < n; i++){
if (num == 2){
meetTwo = true;
break;
}
num = button.at(num - 1);
}
if (meetTwo == true)
cout << i + 1 << endl;
else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
}
| 0
| 59,417,738
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main(){
int n,h,m,s;
char str;
int temp;
while(1){
int t[86401]={0};
int max=t[0];
cin>>n;
if(n==0)
break;
for(int i=0;i<n;i++){
cin>>h>>str>>m>>str>>s;
temp=h*3600+m*60+s;
t[temp]+=1;
cin>>h>>str>>m>>str>>s;
temp=h*3600+m*60+s;
t[temp]+=-1;
}
for(int i=1;i<=86400;i++){
t[i]+=t[i-1];
if(max<=t[i])
max=t[i];
}
cout<<max<<endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = 0;
if(a%2==0 && b%2!=0){
ll c = (b-a+1)/2;
if(c%2!=0) ans = 1;
}
else if(a%2==0 && b%2==0){
ll c = (b-a)/2;
if(c%2==0) ans = b;
else if(c%2!=0) ans = b+1;
}
else if(a%2!=0 && b%2!=0){
ll c = (b-a)/2;
if(c%2==0) ans = a;
else if(c%2!=0) ans = a-1;
}
else if(a%2!=0 && b%2==0){
ll c = (b-a-1)/2;
ll d = a^b;
if(c%2!=0 && d%2==0) ans = d+1;
if(c%2==0 && d%2==0) ans = d;
if(c%2!=0 && d%2!=0) ans = d-1;
if(c%2==0 && d%2!=0) ans = d;
}
cout << ans << endl;
return 0;
}
| 0
| 65,795,622
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<l_l> vpl;
typedef vector<string> vs;
typedef pair<l_l,ll> lll;
#define pb push_back
#define sz(x) (int)(x).size()
#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++)
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=10100100100100100;
const ll dx[4]={1,-1,0,0};
const ll dy[4]={0,0,1,-1};
template<class T> inline bool chmin(T& a,T b){
if(a>b){
a=b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a,T b){
if(a<b){
a=b;
return true;
}
return false;
}
int main(){
ll x;cin>>x;
x/=200;
cout<<10-x<<endl;
return 0;
}
|
bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define ncouts(x) numout(x),outst[outst_N++] = ' '
#define ncoutn(x) numout(x),outst[outst_N++] = '\n'
#define scouts(x) strout(x),outst[outst_N++] = ' '
#define scoutn(x) strout(x),outst[outst_N++] = '\n'
#define dcouts(x) if(DBG) couts(x)
#define dcoutn(x) if(DBG) coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x,a) (((x)>>(a))&1LL)
#define IBIT(x,a) (((x)>>(a))&1)
#define BCOUNT(x) (__builtin_popcount(x))
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1,T2> &p){is >> p.first >> p.second; return is; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec){ os << "deque["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<class T> using V = vector<T>;
template<class T> using V2 = V<V<T>>;
template<class T> using V3 = V<V2<T>>;
template<class T> using V4 = V<V3<T>>;
char outst[20'000'000]; int outst_N = 0;
char outst_tmp[200];
template<class NUM >
void numout(NUM n){
if(n<0) { n*=-1; outst[outst_N++] = '-';}
if(n==0){ outst[outst_N++] = '0'; return;}
int cnt = 0;
while(n>0){
outst_tmp[cnt++] = '0' + (n % 10);
n /= 10;
}
IFOR(i,0,cnt){
outst[outst_N++] = outst_tmp[i];
}
}
void strout(std::string s){
for(auto x: s){
outst[outst_N++] = x;
}
}
constexpr ll LINF = 1LL << 60;
constexpr int IINF = 1 << 28;
constexpr ll mod = 998244353;
ll f(int n, ll x){
if(n==0) return x;
if(x==0 || x==1) return 0;
ll PB_p = (1LL<<(n+1)) - 3;
ll P_p = (1LL<<(n)) - 1;
if(x<PB_p+2) return f(n-1,x-1);
if(x==PB_p+2) return P_p+1;
x = min<ll>(x,2*PB_p+2);
if(x>PB_p+2 ) return P_p+1+f(n-1,x-PB_p-2);
return 0;
}
void solve(){
int n; ll x; cin >> n >> x;
coutn( f(n,x) );
}
int main(void){
cin.tie(0);
solve();
printf("%s", outst);
return 0;
}
| 0
| 40,277,713
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#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 deb(x) cout << #x << " = "<<x<<endl
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 200005;
ll gcd(ll a , ll b) {
return (b == 0) ? a : gcd(b, a % b);
}
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll powmod(ll a, ll b, ll m) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modinv(ll n, ll p)
{
return powmod(n, MOD - 2, MOD);
}
void max_self(ll &a, ll b) {
a = max(a, b);
}
bool is_ap(vl v, int n) {
ll d = v[1] - v[0];
F0R(i, n) {
if (v[i] != v[0] + i * d)
return false;
}
return true;
}
int main(int argc, char const *argv[])
{
cin.tie(0);
ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5])
cout << "Yes\n";
else
cout << "No\n";
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll k,a,b; cin >> k >> a >> b;
ll ans = 1;
ll dif = b-a;
if(a+2>=b) ans = 1 + k;
else if(1+k-2<a) ans = 1 + k;
else{
ans = a;
k = k - (a-1);
if (k%2!=0){
k--;
ans ++;
}
for(int i=0; i<k/2; i++){
ans = ans + dif;
}
}
cout << ans << endl;
}
| 0
| 28,813,366
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int a;
cin >> a;
int tmp = a;
int count=1;
int ans=0;
for(int i=1; i<N; i++){
cin >> a;
if(tmp==a) count++;
else{
ans += count/2;
count=1;
tmp = a;
}
}
ans+=count/2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
int main() {
int n, cnt = 0, ans = 0;
cin >> n;
rep2(i, n) {
rep2(j, i) {
if (i % j == 0)
cnt++;
}
if (cnt == 8 && i % 2 == 1) {
ans++;
}
cnt = 0;
}
cout << ans << endl;
return 0;
}
| 0
| 54,112,192
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
string s;
char res1;
int res2;
for(int i=1;i<=h;i++){
for(int j=0;j<w;j++){
cin >> s;
if(s=="snuke"){
res1=j+'A';
res2=i;
break;
}
}
}
cout << char(res1) << res2 << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
using namespace std;
int main()
{
int N;
string S, T, out = "";
cin >> N >> S >> T;
for (int i = 0; i < S.length(); i++)
{
out += S[i];
out += T[i];
}
cout << out << endl;
}
| 0
| 88,038,271
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x--)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e6 , M = N;
vi factorize (vi v){
for(int i=1;i<=N;i++)
for(int j=i;j<=N;j+=i){
v[j]+=1;
}
return v;
}
void solve() {
vi v(N+1,0);
v=factorize(v);
int n;
cin>>n;
int ans = 0;
for(int c=n-1;c>=1;c--){
ans += v[n-c];
}
cout<<ans;
}
int32_t main()
{
FIO;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r=0,g=0,b=0;
rep(i,n) {
if (s[i] == 'R') {
r++;
}
else if (s[i] == 'G') {
g++;
}
else {
b++;
}
}
ll count = 0;
for (int i = 0; i < n-2; i++) {
for (int j = i+1; j < n-1; j++) {
int k = j + (j-i);
if (k >= n) {
break;
}
if (s[i] != s[j] && s[j] != s[k] && s[i] != s[k]) {
count++;
}
}
}
ll ans = (ll)r*g*b - count;
cout << ans << endl;
return 0;
}
| 0
| 89,917,659
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
int n, a, b;
cin >> n >> a >> b;
int cycle = a + b;
int loop = n / cycle;
int blue = a * loop;
int left = n - cycle * loop;
left = min(left, a);
blue += left;
cout << blue << '\n';
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
using vs = vector<string>; using tll = tuple<ll, ll, ll>; using vtll = vector<tll>;
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define co(i) cout << i << endl;
#define co2(i,j) cout << i << " " << j << endl;
#define co3(i) cout << i << " ";
#define po(i) cout << i.first << " " << i.second << endl;
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
cerr << " " << h;
if (sizeof...(t) > 0) cerr << " :";
debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
ll ctoi(char c) {
switch (c) {
case '0': return 0; case '1': return 1; case '2': return 2;
case '3': return 3; case '4': return 4; case '5': return 5;
case '6': return 6; case '7': return 7; case '8': return 8;
case '9': return 9; default: return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
return firstElof.first > secondElof.first;
}
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R, Q;
ll MOD = 1000000007, INF = 1LL << 60, ans = 0, z = 0, o = 1;
vl flag, D; vll path;
int main() {
cin >> N;
string S;
cin >> S;
ll status = 0;
ll L = 0, R = 0;
ll flag = 0;
for (i = 0; i < N; i++) {
if (S[i] == ')') {
status++;
}
else {
status--;
}
if (status > 0) {
L++;
status--;
}
}
if (status < 0) {
R +=abs(status);
}
for (i = 0; i < L; i++) cout << "(";
cout << S;
for (i = 0; i < R; i++) cout << ")";
}
| 0
| 94,281,243
|
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
#define MP make_pair
#define PB push_back
#define FF first
#define SS second
#define FORN(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define DEBUG(X) { cout << #X << " = " << (X) << endl; }
#define PR0(A,n) { cout << #A << " = "; FORN(_,n) cout << A[_] << ' '; cout << endl; }
#define MOD 1000000007
#define INF 2000000000
int GLL(LL& x) {
return scanf("%lld", &x);
}
int GI(int& x) {
return scanf("%d", &x);
}
int n;
string s;
const int MAXN = 200005;
int a[MAXN], m[MAXN];
int dp[(1 << 26) + 5];
int mask(int x) {
return 1 << x;
}
bool contains(int s, int x) {
return s & mask(x);
}
int main() {
cin >> s;
n = s.size();
FORN(i, n) {
a[i + 1] = s[i] - 'a';
}
m[0] = 0;
FOR1(i, n) {
m[i] = m[i-1] ^ mask(a[i]);
}
fill(dp, dp + (1 << 26) + 5, INF);
dp[m[n]] = 0;
FORD(i, n) {
int best = INF;
FORN(j, 26) {
best = min(best, 1 + dp[m[i] ^ mask(j)]);
}
dp[m[i]] = min(dp[m[i]], best);
}
cout << max(1, dp[0]) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin >> k;
vector<long long> A(k);
for (int i = 0; i < k; ++i){
cin >> A[i];
}
long long minv = 2, maxv = 2;
for (int i = k - 1; i >= 0; --i){
long long tmp1;
if (minv % A[i] == 0){
tmp1 = minv;
}else{
tmp1 = A[i]*(minv / A[i] + 1);
}
if (tmp1 > maxv){
cout << -1 << endl;
return 0;
}
long long tmp2 = (maxv/A[i])*A[i];
if (tmp2 < minv){
cout << -1 << endl;
return 0;
}
minv = tmp1;
maxv = tmp2 + A[i] - 1;
}
cout << minv << " " << maxv << endl;
}
| 0
| 64,168,575
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N), S(N + 1, 0);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
A.at(i)--;
S.at(i + 1) = (S.at(i) + A.at(i)) % K;
}
map<int64_t, int64_t> mp;
for (int i = 0; i < min(K, N + 1); i++)
{
mp[S.at(i)]++;
}
int64_t ans = 0;
for (auto it = mp.begin(); it != mp.end(); it++)
{
ans += it->second * (it->second - 1) / 2;
}
for (int i = 0; i + K <= N; i++)
{
mp[S[i]]--;
mp[S[i + K]]++;
ans += mp[S[i + K]] - 1;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define speed() ios::sync_with_stdio(0);cin.tie(0);
#define file() freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define rep(i,a) for(ll i=0;i<a;i++)
#define rep1(i,begin,end) for(ll i=begin;i<=end;i++)
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define pf push_front
#define mp make_pair
#define pi acos(-1)
#define MOD 1e9+7
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
typedef long long int ll;
typedef vector<ll>vi;
typedef map<ll,ll>mi;
typedef pair<ll,ll>pll;
typedef set<ll>st;
typedef set<char>sc;
ll dx[] ={-1,+1,0,0,+1,-1,+1,-1};
ll dy[] ={0,0,-1,+1,+1,+1,-1,-1};
const ll mx = 1e5+123;
bool vis[mx];
vi adj[mx];
int main()
{
speed();
ll a,i,y = 0;
string s;
char c;
set<string>x;
cin>>a;
for(i=0;i<a;i++)
{
cin>>s;
if(i>0 && s[0]!=c)
{
y = -1;
}
c = s[s.size()-1];
x.insert(s);
}
if(x.size()!=a || y==-1)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
| 0
| 36,215,224
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int main(){
ll n; int x, m; cin>>n>>x>>m;
int mn = min(n, (ll)m);
vector<int> P;
ll sum_p = 0;
vector<bool> X(m, false);
rep(_i, mn){
if(X[x]){
int pre_len = find(P.begin(), P.end(), x) - P.begin();
int cyc_len = P.size() - pre_len;
int nxt_len = (n - pre_len) % cyc_len;
ll remain = 0; rep(i, pre_len + nxt_len) remain += P[i];
ll cyc = sum_p; rep(i, pre_len) cyc -= P[i];
cyc *= (n - pre_len) / cyc_len;
cout<< cyc + remain <<endl;
return 0;
}
X[x] = true;
P.push_back(x);
sum_p += x;
x = (ll)x*x % m;
}
cout<< sum_p <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
#define base 1000000005
long long node[maxn*10],ans[10];
int h,w,n,x,y,nodecnt;
int main()
{
scanf("%d%d%d",&h,&w,&n);
while(n--)
{
scanf("%d%d",&x,&y);
for(int i=0;i<3;++i)
for(int j=0;j<3;++j)
if(1<=x-i&&x-i<=h-2&&1<=y-j&&y-j<=w-2)
node[++nodecnt]=1ll*base*(x-i)+(y-j);
}
ans[0]=1ll*(h-2)*(w-2);
sort(node+1,node+nodecnt+1);
for(int i=1,cnt=1;i<=nodecnt;++i)
{
if(node[i]==node[i+1]) ++cnt;
else ++ans[cnt],cnt=1,--ans[0];
}
for(int i=0;i<10;++i) printf("%lld\n",ans[i]);
return 0;
}
| 0
| 1,220,762
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long double N, K;
cin >> N >> K;
long double ans;
ans = 0;
for (int i = 1; i <= N; i++)
{
if (i < K)
{
ans += pow(2, 17- ceil(log2(K/i)));
}
else
{
ans += 131072;
}
}
ans = ans / N / 131072;
cout << fixed << setprecision(15) << ans << endl;
}
int main() {
solve();
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)
#define pb push_back
#define f first
#define s second
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
const ll INFL = 1LL << 60;
const int INF = 1 << 30;
ll MOD = 1000000007;
ll pow_long(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2) res *= x;
x *= x;
k /= 2;
}
return res;
}
ll pow_mod(ll x, ll k){
x %= MOD; x += MOD; x %= MOD;
ll res = 1;
while(k > 0){
if(k % 2){
res *= x; res %= MOD;
}
x *= x; x %= MOD;
k /= 2;
}
return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y){return x / gcd(x, y) * y;};
ll kai_mod(ll x){
if(x == 0) return 1;
return x * kai_mod(x-1) % MOD;
}
int main(){
ll X, Y;
cin >> X >> Y;
if(X % Y == 0) cout << -1 << endl;
else{
for(ll i = 1;;i++){
if((X * i) % Y){
cout << X * i << endl;
return 0;
}
}
}
}
| 0
| 79,206,340
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
int k,x;
cin>>k>>x;
ll ans= 500*k;
if(x>ans)
{
cout<<"No";
}
else
cout<<"Yes";
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define P pair<int,int>
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}
#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}
#define Cout(x) cout<<(x)<<endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible" ) << endl
typedef long long ll;
using namespace std;
const int INF = 1e9,MOD = 1e9 + 7;
const ll LINF = 1e18;
long long int n,cnt=0,ans=0,a,b,c,cmp,cmpp,m,h,w,x,y,sum=0,pos;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("snuke"),alphh("ABCDEFGHIJKLMNOPQRSTUVWXYZ"),s;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
bool fl=true;
cin >> h >> w;
rep(i,h){
rep(j,w){
cin >> s;
rep(k,s.size()){
if(s[k]!=alph[k]){
fl=false;
}
}
if(fl){
cout << alphh[j] << i+1 << endl;
return 0;
}
fl=true;
}
}
return 0;
}
| 0
| 28,650,277
|
#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 f(ll a, ll b)
{
ll mx = max(a, b);
int cnt = 0;
while (mx)
{
mx /= 10;
cnt++;
}
return cnt;
}
int main()
{
ll n;
cin >> n;
int nn = (int)sqrt(n) + 1;
int ans = 1e9;
for (int i = 1; i <= nn; i++)
{
if (n % i == 0)
{
ll j = n / i;
int cnt = f(i, j);
ans = min(cnt, ans);
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
int main(){
ll a,b,k;
cin>>a>>b>>k;
bool flag=true;
while(k){
if(flag){
a/=2;
b+=a;
flag=false;
}else{
b/=2;
a+=b;
flag=true;
}
k--;
}
cout<<a<<" "<<b<<endl;
}
| 0
| 73,902,384
|
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;
using ll = long long;
using ull = unsigned long long;
bool in_bounds(int x, int y, int H, int W)
{
return (1 <= x && x <= W-2) && (1 <= y && y <= H-2);
}
int main()
{
ll H, W, N;
cin >> H >> W >> N;
unordered_map<int, unordered_map<int, int>> m;
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
for (int dx = -1; dx <= +1; ++dx) {
for (int dy = -1; dy <= +1; ++dy) {
int y = a + dx;
int x = b + dy;
if (in_bounds(x, y, H, W)) {
m[y][x]++;
}
}
}
}
vector<ll> ans(10);
ll count = 0;
for (auto&& mm : m) {
for (auto&& p : mm.second) {
ans[p.second]++;
++count;
}
}
ans[0] = (ll)(W-2)*(H-2) - count;
for (auto&& ai : ans) {
cout << ai << endl;
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
ll N;
cin >> N;
ll n_sub = 0;
for (int i = 0; i < N - 1; i++) {
ll u, v;
cin >> u >> v;
if (u > v) {
swap(u, v);
}
n_sub += u * (N - v + 1);
}
ll n_vertices = 0;
for (ll i = 1; i <= N; i++) {
n_vertices += i * (N - i + 1);
}
cout << n_vertices - n_sub << endl;
return 0;
}
| 0
| 82,906,616
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
int n;
cin >>n;
vector<int> bricks(n);
bool flag = false;
rep(i,n) {
cin >> bricks[i];
if (bricks[i] == 1) flag = true;
}
if (!flag) {
cout << -1 << endl;
return 0;
}
int cnt = 1;
int ans = 0;
rep(i,n){
if(bricks[i]==cnt) cnt ++;
else ans++;
}
cout << ans <<endl;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <random>
#include <iomanip>
using namespace std;
using P = pair<long, long>;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define fillInt(xs, x) \
for (int i = 0; i < (x); i++) \
scanf("%d", &xs[i]);
#define fillLong(xs, x) \
for (int i = 0; i < (x); i++) \
scanf("%ld", &xs[i]);
#define fillString(xs, x) \
for (int i = 0; i < (x); i++) \
cin >> xs[i];
#define sortv(xs) sort(xs.begin(), xs.end())
#define sortvinv(xs) sort(xs.begin(), xs.end(), std::greater<long>())
#define lbv(xs, x) lower_bound(xs.begin(), xs.end(), x) - xs.begin()
#define ubv(xs, x) upper_bound(xs.begin(), xs.end(), x) - xs.begin()
#define bs(xs, x) binary_search(xs.begin(), xs.end(), x)
#define index_of(as, x) \
distance(as.begin(), lower_bound(as.begin(), as.end(), x))
#define rep(i,n) for(auto i=0; i<(n); i++)
const int mod = 1000000007;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<long> a(n);
fillLong(a, n);
vector<long> b(n+1);
b[0] = 0;
rep(i, n) {
b[i+1] = b[i] + a[i];
}
vector<long> c;
rep(i, n) {
for(int j = i+1; j<n+1; j++) {
c.push_back(b[j] - b[i]);
}
}
sortv(c);
long res = 0;
for(int i = 50; i >= 0; i--) {
long l = lbv(c, 1L<<i);
if (c.size() - l >= k) {
c.erase(c.begin(), c.begin() + l);
res += (1L<<i);
}
rep(j, c.size()) {
c[j] &= ~(1L<<i);
}
sortv(c);
}
cout << res << endl;
}
| 0
| 36,268,905
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, A;
cin >> N >> A;
if (N % 500 <= A)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int b[n][20]={};
for(int i=0;i<n;i++){
cin>>a[i];
for(int j=0;j<20;j++){
if(a[i]%2)b[i][j]++;
a[i]/=2;
}
}
int x[20]={};
int r=-1;
long long ans=0;
bool over;
for(int l=0;l<n;l++){
over=0;
for(int i=0;i<20;i++)if(x[i]>1)over=1;
while(r<n && over==0){
r++;
for(int i=0;i<20;i++)x[i]+=b[r][i];
for(int i=0;i<20;i++)if(x[i]>1)over=1;
}
ans+=r-l;
for(int i=0;i<20;i++)x[i]-=b[l][i];
}
cout<<ans<<endl;
return 0;
}
| 0
| 19,082,478
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SIZE(obj) (int)(obj).sizeT()
#define YESNO(cond, yes, no) \
{ cout << ((cond) ? (yes) : (no)) << endl; }
#define SORT(list) sort(ALL((list)));
#define RSORT(list) sort((list).rbegin(), (list).rend())
#define ASSERT(cond, mes) assert(cond&& mes)
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'050'000'000;
template <typename T>
T round_up(const T& a, const T& b) {
return (a + (b - 1)) / b;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2>& p) {
os << p.first << p.second;
return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
REP(i, (int)v.size())
is >> v[i];
return is;
}
template <typename T>
T clamp(T& n, T a, T b) {
if (n < a) n = a;
if (n > b) n = b;
return n;
}
template <typename T>
static T GCD(T u, T v) {
T r;
while (v != 0) {
r = u % v;
u = v;
v = r;
}
return u;
}
template <typename T>
static T LCM(T u, T v) {
return u / GCD(u, v) * v;
}
std::vector<int> enum_div(int n) {
std::vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) { ret.push_back(n / i); }
}
}
return ret;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
struct ToUpper {
char operator()(char c) {
return toupper(c);
}
};
struct ToLower {
char operator()(char c) {
return tolower(c);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll A, B;
int K;
cin >> A >> B >> K;
REP(i, K) {
if (i % 2 == 0) {
if (A % 2 == 1) A--;
B += A / 2;
A /= 2;
} else {
if (B % 2 == 1) B--;
A += B / 2;
B /= 2;
}
}
cout << A << " " << B << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007;
int main() {
ll N,D,A;
cin>>N>>D>>A;
vector<pair<ll,ll>> M(N);
rep(i,N){
cin>>M.at(i).first>>M.at(i).second;
M.at(i).second=(M.at(i).second-1)/A+1;
}
sort(M.begin(),M.end());
ll bomb=0,ans=0;
queue<P> range;
rep(i,N){
while(!range.empty() && range.front().first<M.at(i).first){
P f=range.front();range.pop();
bomb-=f.second;
}
if(M.at(i).second-bomb>0){
ans+=M.at(i).second-bomb;
range.push({M.at(i).first+2*D,M.at(i).second-bomb});
bomb+=M.at(i).second-bomb;
}
}
cout<<ans<<endl;
}
| 0
| 54,889,504
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string order;
vector<int> num;
vector<char> word;
int n;
char button[9][5] = {{'.',',','!','?',' '},{'a','b','c'},{'d','e','f'},{'g','h','i'},{'j','k','l'},{'m','n','o'},{'p','q','r','s'},{'t','u','v'},{'w','x','y','z'}};
int main()
{
int but = 0,push = 0;
cin >> n;
for(int i=0;i<n;i++){
cin >> order;
for(int j=0;j<order.size();j++){
num.push_back((int)(order[j]-'0'));
}
for(int j=0;j<num.size();j++){
if(1<=num[j] && num[j]<=9){
if(but==0){
but = num[j];
}else{
push++;
}
}else if(num[j]==0){
if(but==0){
continue;
}
const int mod = (but == 1 ? 5 : but == 7 || but == 9 ? 4 : 3);
word.push_back(button[but-1][push%mod]);
push = 0;
but = 0;
}
}
for(int k=0;k<word.size();k++){
cout << word[k];
}
cout << endl;
word.clear();
num.clear();
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
for(auto&& i : s){
if(i == s[k - 1]){
cout << i;
}else{
cout << "*";
}
}
cout << "\n";
}
| 0
| 12,830,293
|
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x)
#define printl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
int main(){
string s, t; cin >> s >> t;
t += s;
print(t);
}
|
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<ll> A(n);
rep(i,n) cin>>A[i];
ll mans=100100100100;
for(int bit=0;bit<(1<<(n-1));bit++){
ll ans=0;
int cnt=0;
rep(i,n-1){
if(bit&(1<<i)) cnt++;
}
if(cnt!=k-1) continue;
ll mh=A[0];
for(int i=0;i<n-1;i++){
if(bit&(1<<i)){
if(A[i+1]<=mh){
ans+=mh+1-A[i+1];
mh=mh+1;
}
}
mh=max(mh,A[i+1]);
}
mans=min(mans,ans);
}
cout<<mans<<endl;
return 0;
}
| 0
| 13,271,187
|
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int T[10][10];
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i==j){
T[i][j] = 0;
}
else{
T[i][j] = INF;
}
}
}
int m = 0;
for(int i=0; i<n; i++){
int a, b, c;
cin >> a >> b >> c;
T[a][b] = T[b][a] = c;
if(a+1>m){
m = a+1;
}
if(b+1>m){
m = b+1;
}
}
for(int i =0;i<m;i++){
for(int j =0;j<m;j++){
for(int k = 0;k<m;k++){
if(T[j][k]>T[j][i]+T[i][k]){
T[j][k]=T[j][i]+T[i][k];
}
}
}
}
int anstown,anstime=INF;
for(int i =0;i<m;i++){
int sumtime=0;
for(int j = 0;j<m;j++){
sumtime+=T[i][j];
}
if(anstime>sumtime){
anstown = i;
anstime = sumtime;
}
}
cout << anstown <<" "<<anstime<<endl;
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(void) {
int n,i,c,k,prime[999999] = {0},t;
for(i = 2; 999999 >= i; i++){
if(!prime[i])
for(c = i*2; 999999 >= c; c += i)prime[c] = 1;
}
while(scanf("%d",&n) != EOF){
i = 0;
for(c = 2; n >= c; c++){
if(!prime[c]) i++;
}
printf("%d\n",i);
}
return 0;
}
| 0
| 74,572,960
|
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.end()) - arr.begin())
#define getbit(x, i) (((x) >> (i)) & 1)
template <typename T>
vector<T> readvector(size_t sz) {
vector<T> res(sz);
for (size_t i = 0; i < sz; ++i) {
cin >> res[i];
}
return res;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, " "));
return out;
}
int mylog(int n) {
return 63 - __builtin_clzll(n);
}
inline int binPow(int x, int deg, int mod) {
int ans = 1;
for (int i = sizeof(deg) * CHAR_BIT - 1; i >= 0; i--) {
ans *= ans;
ans %= mod;
if (getbit(deg, i)) ans *= x;
ans %= mod;
}
return ans;
}
inline int readInt();
inline int readUInt();
inline void readWord(char *s);
inline int fast_readchar();
inline void writeInt(int x);
inline void fast_writechar(int x);
inline void writeWord(const char *s);
inline void fast_flush();
const int MAXN = 2e6 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18;
bool check[MAXN];
void solve() {
int n;
cin >> n;
auto A = readvector<int>(n);
auto B = readvector<int>(n);
auto C = A;
for (int i = 0; i < n; i++) C[i] = i + 1;
int cnt = 0;
int ans = 0;
do {
if (C == A) {
ans += cnt;
}
if (C == B) {
ans -= cnt;
}
cnt++;
} while (next_permutation(C.begin(), C.end()));
cout << abs(ans) << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
for (int i = 1; i <= t; ++i) {
solve();
}
return 0;
}
static const int buf_size = 4096;
inline int fast_readchar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len) return -1;
return buf[pos++];
}
inline int readUInt() {
int c = fast_readchar(), x = 0;
while (c <= 32) c = fast_readchar();
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = fast_readchar();
return x;
}
inline int readInt() {
int s = 1, c = fast_readchar();
int x = 0;
while (c <= 32) c = fast_readchar();
if (c == '-') s = -1, c = fast_readchar();
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = fast_readchar();
return x * s;
}
inline void readWord(char *s) {
int c = fast_readchar();
while (c <= 32) c = fast_readchar();
while (c > 32) *s++ = c, c = fast_readchar();
*s = 0;
}
static int write_pos = 0;
static char write_buf[buf_size];
inline void fast_writechar(int x) {
if (write_pos == buf_size) fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
inline void fast_flush() {
if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
inline void writeInt(int x) {
if (x < 0) fast_writechar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n) s[n++] = '0' + x % 10, x /= 10;
while (n--) fast_writechar(s[n]);
}
inline void writeWord(const char *s) {
while (*s) fast_writechar(*s++);
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
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;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
const ll mod=998244353;
const int inf=1<<30;
ll rui(ll a,ll n){
ll ans=1;
while(n>0){
if(n&1) ans=ans*a%mod;
a=a*a%mod;
n/=2;
}
return ans;
}
int main(){
int n; cin >> n;
vector<ll> d(n);
rep(i,n) cin >> d[i];
if(d[0]!=0){
cout << 0 << endl;
return 0;
}
map<ll,ll> mp;
rep(i,n){
mp[d[i]]++;
}
ll ans=1;
for(auto c:mp){
if(c.first==0&&c.second!=1){
cout << 0 << endl;
return 0;
}
if(c.first>0){
ans*=rui(mp[c.first-1],c.second);
ans%=mod;
}
}
cout << ans << endl;
}
| 0
| 98,631,932
|
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
void printIntInLine(vector<int> &arr) {
for(vector<int>::iterator itr=arr.begin(); itr!=--(arr.end()); ++itr) {
printf("%d ", *itr);
}
printf("%d\n", *(--(arr.end())));
}
int main() {
int n, tmp, nSwap;
vector<int> arr;
scanf("%d", &n);
for(int i=0; i<n; ++i) {
scanf("%d", &tmp);
arr.push_back(tmp);
}
nSwap = 0;
for(auto itr=arr.begin(); itr!=arr.end(); ++itr) {
auto mini = itr;
for(auto itr2=itr; itr2!=arr.end(); ++itr2) {
if(*itr2 < *mini) {
mini = itr2;
}
}
if(itr != mini) {
swap(*itr, *mini);
++nSwap;
}
}
printIntInLine(arr);
printf("%d\n", nSwap);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
if (a < b) swap(a,b);
if (b == 0) return a;
return a%b == 0 ? b : gcd(b, a%b);
}
int lcm(int a, int b) { return a*b/gcd(a,b);}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i=0;i<N;i++) cin >> A[i];
int g = A[0];
int mx = A[0];
for (int i=1;i<N;i++) {
g = gcd(g,A[i]);
mx = max(mx, A[i]);
}
if (K%g==0 && K <= mx) cout << "POSSIBLE" << "\n";
else cout << "IMPOSSIBLE" << "\n";
}
| 0
| 16,007,319
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
ll x, a, b;
cin >> x >> a >> b;
int c = b - a;
if(c <= 0) cout << "delicious" << endl;
else if(c <= x) cout << "safe" << endl;
else cout << "dangerous" << endl;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define pragi(a,b) for(ll i = a;i<b;i++)
#define pragj(a,b) for(ll j = a;j<b;j++)
#define pragk(a,b) for(ll k = a;k>=b;k--)
#define all(v) (v.begin(),v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
#define KAKA ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef pair<ll, ll> pll;
ll dp[100005][2];
string s;
ll recur(ll pos,ll flag)
{
if(pos >= s.length())
{
return 1ll;
}
else if(dp[pos][flag] != -1)
{
return dp[pos][flag];
}
else
{
if(flag)
{
return dp[pos][flag] = ((recur(pos + 1,flag) % mod)*3)%mod;
}
else
{
ll limit = s[pos] - '0';
if(limit == 0)
{
return dp[pos][flag] = recur(pos + 1,flag)%mod;
}
else
{
return dp[pos][flag] = ((((recur(pos + 1,flag)%mod)*2)%mod + (recur(pos + 1,1)))%mod)%mod;
}
}
}
}
void Compute()
{
KAKA
memset(dp,-1,sizeof(dp));
ll ways = 0;
ways += recur(0,0);
cout<<ways<<"\n";
}
int main()
{
KAKA
cin>>s;
Compute();
}
| 0
| 26,100,607
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int dp[100005];
int h[100005];
int main(){
int N;
cin >> N;
int h[N];
for(int i=1; i<=N; i++){
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[1]-h[2]);
for(int i=3; i<=N; i++){
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
}
cout << dp[N] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int main()
{
string s;
cin >> s;
map<char, int> mp;
mp[s[0]]++;
mp[s[1]]++;
mp[s[2]]++;
mp[s[3]]++;
if(mp.size() == 2 && mp[s[0]] == 2 && mp[s[1]] == 2 && mp[s[2]] == 2 && mp[s[3]] == 2)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| 0
| 78,882,797
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int a,b,c,n;
int cmd(int q,int p)
{
int i;
if(q>p)
return q;
for(i=1;i<=n;i++)
{
q=q*2;
if(q>p)
break;
}
n=n-i;
return q;
}
int main()
{
scanf("%d %d %d %d",&a,&b,&c,&n);
int t=a/b+1;
int f=n-t;
b=cmd(b,a);
c=cmd(c,b);
if(b>a&&c>b)
cout<<"Yes"<<endl;
else cout <<"No"<<endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
ll n, a, b, c;
vl v;
vl L;
ll ans = INF;
void check(vl &v) {
ll now = 0;
ll lA = 0, lB = 0, lC = 0;
rep(i, n) {
if(v[i] == 1) {
if(lA > 0) {
now += 10;
}
lA += L[i];
}
else if(v[i] == 2) {
if(lB > 0) {
now += 10;
}
lB += L[i];
}
else if(v[i] == 3) {
if(lC > 0) {
now += 10;
}
lC += L[i];
}
}
if(lA == 0 || lB == 0 || lC == 0) {
return;
}
now += abs(lA - a) + abs(lB - b) + abs(lC - c);
chmin(ans, now);
}
void dfs(ll depth) {
if(depth == n) {
check(v);
return;
}
rep(i, 4) {
v[depth] = i;
dfs(depth+1);
}
}
int main() {
cin >> n >> a >> b >> c;
L.resize(n);
rep(i, n) {
cin >> L[i];
}
v.resize(n);
dfs(0);
out(ans);
re0;
}
| 0
| 50,634,439
|
#include<stdio.h>
int main(void)
{
int w,h,x,y,r,a,b,c,d;
scanf("%d %d %d %d %d",&w,&h,&x,&y,&r);
a=x+r;
b=y+r;
if(a<=w && b<=h && x>=0 && y>=0){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
ll l, r;
cin >> l >> r;
ll d = r-l;
if(d>=2020){
cout << 0 << endl;
return 0;
}
ll ans = inf;
lrep(i, l, r){
lrep(j, i+1, r+1){
ans = min(ans,(i%2019)*(j%2019)%2019);
}
}
cout << ans << endl;
}
| 0
| 18,011,321
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
int main()
{
int n, m;
cin >> n >> m;
int cost[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int num[m];
rep(i, m) cin >> num[i];
string dp[n + 1];
dp[0] = "";
for (int i = 1; i <= n; i++)
{
dp[i] = "";
rep(j, m)
{
int t = i - cost[num[j]];
if (t < 0 || (t != 0 && dp[t] == ""))
continue;
if (dp[i].size() < dp[t].size() + 1)
dp[i] = dp[t] + to_string(num[j]);
else if (dp[i].size() == dp[t].size() + 1)
dp[i] = max(dp[i], dp[t] + to_string(num[j]));
}
}
OP(dp[n]);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main (){
char kataA[11];
char kataB[11];
char kataC[11];
scanf("%s %s %s", &kataA, &kataB, &kataC);
int panjangA = strlen (kataA);
int panjangB = strlen(kataB);
if(kataA[panjangA-1] == kataB[0] && kataB[panjangB-1] == kataC[0]){
puts("YES");
}
else{
puts("NO");
}
return 0;
}
| 0
| 57,347,330
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,k,mod=1e9+7,ans=0;
int a[100005];
int quick_power(int a,int b)
{
int res=1;
for (;b;b=b>>1,a=(a*a)%mod)
{
if (b&1) res=(res*a)%mod;
}
return res;
}
signed main()
{
cin>>n>>k;
for (int i=k;i>=1;i--)
{
a[i]=quick_power(k/i,n)%mod;
for (int j=2*i;j<=k;j+=i) a[i]=((a[i]-a[j])%mod+mod)%mod;
}
for (int i=1;i<=k;i++) ans=(ans+a[i]*i)%mod;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi {
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
ll n;
string s;
cin >> n >> s;
ll cnt = 0;
for(ll i = 0; i <= 999; i++){
ll a[3];
a[0] = i / 100;
a[1] = (i / 10) % 10;
a[2] = i % 10;
ll digit = 0;
for(ll j = 0; j < n; j++){
if(a[digit] == (s[j] - '0')) digit++;
if(digit == 3){
cnt++;
break;
}
}
}
cout << cnt << endl;
return 0;
}
int getDigit(int n) {
int i = 1;
while(1) {
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n) {
int s = 0;
while(n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for(auto itr = str.begin();itr != str.end() ; itr++) {
if(97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for(auto itr = str.begin();itr != str.end() ; itr++) {
if(65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi() {
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k) {
Resize(n,k);
ll ret;
if(memo[n][k] != 0) {
ret = memo[n][k];
} else if(n == k || k == 0) {
memo[n][k] = 1;
ret = 1;
} else {
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k) {
if(n_num <= n || k_num <= k) {
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr) {
itr->resize(k_num);
}
}
}
long long Combi::nPk_modp(long long n, long long k, long long p) {
ll ans = 1;
for(long long i = k; i <= n; i++) {
ans = (ans * i) % p;
}
return ans;
};
vector<pair<long long,long long>> prime_factorize(long long p) {
vector<pair<long long,long long>> ret;
for(long long x = 2; x * x <= p; ++x) {
if(p % x != 0) continue;
long long num = 0;
while(p % x == 0) {
num++;
p /= x;
}
ret.push_back(make_pair(x,num));
}
if(p != 1) ret.push_back(make_pair(p, 1));
return ret;
}
| 0
| 60,578,711
|
#include <iostream>
using namespace std;
int ans,s,n;
void fanc(int sum,int i,int j){
if (sum==s&&i==n) {
ans++;
return;
}
if (sum>s||i>n||j>9) {
return;
}
fanc(sum+j,i+1,j+1);
fanc(sum,i,j+1);
return;
}
int main () {
while(1){
cin>>n>>s;
if (n==0&&s==0) {
break;
}
ans=0;
fanc(0,0,0);
cout << ans <<endl;
}
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#ifdef DEBUG
#define debug(x) cerr << #x << " " << x << '\n'
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 0x3f3f3f3f, N = 3e5 + 5;
int n, a[N], cnt[N], suf[N], cnt2[N], cnt3[N], pre[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> a[i];
cnt[a[i]]++;
}
for(int i=1;i<=n;i++)
{
if(cnt[i])
{
cnt2[cnt[i]] += cnt[i];
cnt3[cnt[i]]++;
}
}
for(int i=1;i<=n;i++) pre[i] = pre[i-1] + cnt2[i];
for(int i=n;i>=1;i--) suf[i] = suf[i+1] + cnt3[i];
for(int k=1;k<=n;k++)
{
int l = 1, r = n, ans = 0;
while(l<=r)
{
int mid = (l+r) >> 1;
if(suf[mid]+pre[mid-1]/mid>=k) ans = mid, l = mid + 1;
else r = mid - 1;
}
cout << ans << '\n';
}
return 0;
}
| 0
| 89,515,341
|
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vector<int> vi;
typedef vector<ll> vl;
const int inf = numeric_limits<int>::max() >> 2;
const ll linf = numeric_limits<ll>::max() >> 2;
const ull ulinf = numeric_limits<ull>::max() >> 2;
const double pi = acos(-1);
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const int dx8[8]={-1,0,1,-1,1,-1,0,1};
const int dy8[8]={-1,-1,-1,0,0,1,1,1};
#define p_queue(i) priority_queue<i>
#define rp_queue(i) priority_queue<i, vector<i>, greater<i>>
#define umap(i,j) unordered_map<i,j>
#define P(p) cout<<(p)<<endl
#define PS(p) cout<<(p)<< " "
#define IN cin >>
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i = (m-1); i >= (int)(n); i--)
#define inrep(n,a) for(int i = 0; i < (int)(n); i++)cin >> a[i];
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v,c) sort(v.begin(), v.end(), greater<c>())
#define ft first
#define sd second
#define pb push_back
#define it insert
#define sz(x) ((int)(x).size())
#define lb(a,n,k) (lower_bound(a,a+n,k) - a)
#define vlb(a,k) (lower_bound(a.begin(),a.end(),k) - a.begin())
#define ub(a,n,k) (upper_bound(a,a+n,k) - a)
#define vub(a,k) (upper_bound(a.begin(),a.end(),k) - a.begin())
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
vector<string> split(const string &str, char sep){
vector<string> v;
stringstream ss(str);
string buffer;
while( getline(ss, buffer, sep) ) {
v.push_back(buffer);
}
return v;
}
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b && b == c)Yes;
else No;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
#define F first
#define S second
#define int ll
int patties[51];
int sz[51];
int calc(int n, int x){
if(n == 0){
if(x <= 0){
return 0;
}
else{
return 1;
}
}
if(x <= sz[n - 1] + 1){
return calc(n - 1, x - 1);
}
return patties[n - 1] + calc(n - 1, x - sz[n - 1] - 2) + 1;
}
int32_t main(){
FAST
int n, x; cin >> n >> x;
patties[0] = 1;
sz[0] = 1;
for(int i = 1; i <= n; i++){
sz[i] = sz[i - 1]*2 + 3;
patties[i] = patties[i - 1]*2 + 1;
}
cout << calc(n, x);
return 0;
}
| 0
| 11,081,163
|
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(50) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define paf(L,R) pair<L,R>
#define mod 1000000007
#define MAX 10000000
#define ALL(a) a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
lli A,B,C,D,E,H,W,M,K,L,R,N,num=0,sum=0,flag=0;string S,T;
cin >> K;
Vec(dist,lli,K,INF);
dist[1]=1;
deque<lli>que;
que.pb(1);
while(!que.empty()){
auto x=que.front();
que.pop_front();
if(dist[(x+1)%K]>dist[x]+1){
dist[(x+1)%K]=dist[x]+1;
que.push_back((x+1)%K);
}
if(dist[x*10%K]>dist[x]){
dist[x*10%K]=dist[x];
que.push_front(x*10%K);
}
}
Out(dist[0]);
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define N 2000001
int heap_size=0;
int key[N];
int parent(int i){
return i/2;
}
int leftc(int i){
return 2*i;
}
int rightc(int i){
return 2*i+1;
}
void maxHeapify(int i){
int l,r,largest;
int st;
l=leftc(i);
r=rightc(i);
if(l<=heap_size && key[l]>key[i]) largest=l;
else largest=i;
if(r<=heap_size && key[r]>key[largest]) largest=r;
if(largest!=i){
st=key[i];
key[i]=key[largest];
key[largest]=st;
maxHeapify(largest);
}
}
int heapIncreaseKey(int i,int data){
int st;
if(data<key[i]) return -1;
key[i]=data;
while(i>1 && key[parent(i)]<key[i]){
st=key[i];
key[i]=key[parent(i)];
key[parent(i)]=st;
i=parent(i);
}
return 0;
}
void maxHeapInsert(int data){
heap_size++;
key[heap_size]=-2147483648;
heapIncreaseKey(heap_size,data);
}
int heapExtractMax(void){
int max;
if(heap_size <1) return -1;
max=key[1];
key[1]=key[heap_size];
heap_size--;
maxHeapify(1);
return max;
}
int main(){
int data;
char str[10];
int st;
while(1){
scanf("%s",str);
if(str[0]=='i'){
scanf("%d",&data);
maxHeapInsert(data);
}
else if(strcmp("extract",str)==0){
st=heapExtractMax();
if(st!=-1) printf("%d\n",st);
}
else break;
}
return 0;
}
| 0
| 85,797,414
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n+1); i++)
#define repr(i,n) for (ll i = (n-1); i>=0;i--)
#define repr3(i,n) for(ll i = (n);i>0;i--)
#define repr4(i,s,n) for(ll i = (n);i>=(s);i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll,ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
const int mod = 1000000007;
int main(){
string S;
cin>>S;
S[5]=' ';
S[13]=' ';
cout<<S<<endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
int n;
cin >> n;
vector<string> w(n);
for(auto &x:w)cin >> x;
set<string> check;
bool ans = true;
for(int i=0;i<n;i++){
if(check.count(w[i])){
ans = false;
break;
}
check.insert(w[i]);
if(i==0)continue;
if(w[i][0]!=w[i-1].at(w[i-1].size()-1)){
ans = false;
break;
}
}
if(ans)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 35,734,733
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int calc(int nowTime, int s, int f){
if(nowTime <= s) return s - nowTime;
else {
int div = (nowTime + f-1)/f;
return (div*f - nowTime);
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
vector<int> C(N-1), S(N-1), F(N-1);
for(int i = 0; i < N-1; ++i) cin >> C[i] >> S[i] >> F[i];
for(int j = 0; j < N; ++j){
int nowTime = 0;
for(int i = j; i < N-1; ++i){
nowTime += calc(nowTime, S[i], F[i]);
nowTime += C[i];
}
cout << nowTime << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i=0; i<n; i++) {
cin >> a[i];
}
bool flag=true;
bool m=false;
int b=0;
int c=0;
for(int i=0; i<n; i++) {
for(int j=c; j<n; j++) {
if(a[j]==i+1) {
b++;
m=true;
break;
}
if(j-1==n) {
flag=false;
break;
}
c++;
}
if(flag==false) break;
}
if(m==false) {
cout << -1 << endl;
return 0;
}
cout << n-b << endl;
return 0;
}
| 0
| 40,952,275
|
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t a,b,c;
cin >> a >> b >> c;
cout << (c>=a&&c<=b?"Yes":"No") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ';
}
int ans = 0;
bool check = 0;
string s, t;
int N = 3;
vector<int> v(N);
int a, b;
int x, y;
int main()
{
cin>> a >> b;
pr(a-b+1);
}
| 0
| 81,519,820
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e3 + 13;
signed main()
{
#ifdef home
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#else
#endif
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> in(n);
int mx = 0;
map<int, int> uwu;
for (int i = 0; i < n; i++)
{
cin >> in[i];
mx = max(mx, in[i]);
uwu[in[i]]++;
}
int mn = (mx + 1) / 2;
if (mx & 1)
{
if (uwu[mn] < 2)
{
cout << "Impossible";
return 0;
}
uwu[mn] -= 2;
}
else
{
if (uwu[mn] < 1)
{
cout << "Impossible";
return 0;
}
uwu[mn]--;
}
for (int i = mn + 1; i <= mx; i++)
{
if (uwu[i] < 2)
{
cout << "Impossible";
return 0;
}
uwu[i] -= 2;
}
for (auto i : uwu)
{
if (!i.second)
continue;
if (i.first <= mn)
{
cout << "Impossible" << '\n';
return 0;
}
}
cout << "Possible";
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n;
string s;
cin>>n>>s;
ll r=0,g=0,b=0;
rep(i,n){
if(s[i]=='R') r++;
else if(s[i]=='G') g++;
else b++;
}
ll ans=r*g*b;
ll sub=0;
rep(i,n){
for(int j=i+1;j<n;j++){
if(s[i]==s[j]) continue;
int k=j+j-i;
if(k>=n || s[k]==s[j] || s[k]==s[i]) continue;
sub++;
}
}
cout<<ans-sub<<endl;
}
| 0
| 89,445,428
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<ll, ll>;
int main(){
ll N, M;
cin >> N >> M;
vector<pint> v(M);
for (int i = 0; i < M; ++i)cin >> v[i].first >> v[i].second;
ll L_max = 0, R_min = N+1;
for (int i = 0; i < M; i++){
L_max = max(L_max, v[i].first);
R_min = min(R_min, v[i].second);
}
ll cnt = 0;
for (int i = 1; i <= N; i++) {
if (i >= L_max && i <= R_min) cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template<class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template<class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template<class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template<class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori (i, a.size())out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\nTOTAL EXECUTION TIME: " << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
const int M = 1e9 + 7;
void smain() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 1;
stack<int> st;
for (auto c : s) {
if (c == 'W') {
if (st.empty()) {
cout << "0";
return;
}
if (st.top() == 0) {
ans = (ll) ans * st.size() % M;
st.pop();
} else {
st.push(0);
}
} else {
if (st.size() && st.top() == 1) {
ans = (ll) ans * st.size() % M;
st.pop();
} else {
st.push(1);
}
}
}
if (st.size()) {
cout << "0";
return;
}
for (int i = 1; i <= n; ++i) {
ans = (ll) ans * i % M;
}
cout << ans;
}
| 0
| 28,533,850
|
#include "bits/stdc++.h"
#include <set>
using namespace std;
#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 rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x)
{
std::cout << x << " ";
}
template <typename T>
void println(T x)
{
std::cout << x << "\n";
}
signed main(void) {
string s, t;
cin >> s >> t;
int n = s.size();
bool same = false;
if (s == t)same = true;
rep(i, n) {
string s1 = s.substr(n - 1, 1);
string s2 = s.substr(0, n - 1);
s = s1+s2;
if (s == t)same = true;
}
if (same)print("Yes");
else print("No");
}
|
#include <bits/stdc++.h>
#define int long long
const int MOD = 1e9 + 7;
using pii=std::pair<int,int>;
using namespace std;
const int maxn = 1e5 + 5;
int n, m, x[maxn], y[maxn];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> x[i];
for(int i = 0; i < m; i++)
cin >> y[i];
sort(x, x + n);
sort(y, y + m);
int xlensum = 0, ylensum = 0;
for(int i = 0; i < n; i++)
{
xlensum += (i * x[i]) % MOD;
xlensum -= ((n - 1 - i) * x[i]) % MOD;
xlensum += MOD;
xlensum %= MOD;
}
for(int i = 0; i < m; i++)
{
ylensum += (i * y[i]) % MOD;
ylensum -= ((m - 1 - i) * y[i]) % MOD;
ylensum += MOD;
ylensum %= MOD;
}
cout << (xlensum * ylensum) % MOD << "\n";
return 0;
}
| 0
| 54,410,211
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define SZ(x) (int)(x.size())
#define mem(x, y) memset(x, y, sizeof(x))
#define what_is(x) cerr << "Line " << __LINE__ << ": " << #x << " is " << (x) << endl;
#define suf_zero(x) __builtin_ffs(x)
#define pre_zero(x) __builtin_clz(x)
#define num_one(x) __builtin_popcount(x)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define mt make_tuple
#define mp make_pair
#define eb push_back
#define pb push_back
#define INFI 2000000009
#define INFLL (ll)1e18+7
#define ig ignore
#define fi first
#define TP tuple<int, int, int>
#define se second
#define PII pair<int, int>
#define rep(i, begin, end) for(__typeof(end) i =(begin)-((begin)>(end));i!=(end)-((begin)>(end));i+=1-2*((begin)>(end)))
void err(istream_iterator<string> it) {cerr<<endl;}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " , ";
err(++it, args...);
}
auto TIMESTART = chrono::steady_clock::now();
auto TIMESTOP = chrono::steady_clock::now();
void TimeStop()
{
TIMESTOP = chrono::steady_clock::now();
auto ElapsedTime = TIMESTOP - TIMESTART;
cout << "\n\nTime elapsed: " << chrono::duration<double>(ElapsedTime).count() << " seconds.\n";
}
namespace fastIO{
#define BUF_SIZE 2000000
bool IOerror = 0;
static char obuf[BUF_SIZE], *OUT=obuf;
inline char nc(){
static char buf[BUF_SIZE], *p1 = buf+BUF_SIZE,
*pend = buf+BUF_SIZE;
if(p1==pend){
p1 = buf;
pend = buf+fread(buf, 1, BUF_SIZE, stdin);
if(pend==p1){
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
inline void read(int &x){
char ch;
while(blank(ch=nc()));
if(IOerror)return ;
for(x=ch-'0';(ch=nc())>='0'&&ch<='9';x=x*10+ch-'0');
}
inline void read(ll &x){
char ch;
while(blank(ch=nc()));
if(IOerror)return ;
for(x=ch-'0';(ch=nc())>='0'&&ch<='9';x=x*10+ch-'0');
}
void print(const int& x) {
if(x > 9) print(x / 10);
*OUT++= x % 10 + '0';
}
void print(const ll& x) {
if(x > 9) print(x / 10);
*OUT++= x % 10 + '0';
}
void print(){fwrite(obuf, OUT-obuf, 1, stdout);}
#undef BUF_SIZE
}
using namespace fastIO;
const double pi = acos(-1.0);
const double eps = 1e-8;
const int mod = 1e9+7;
#define mul(a, b) 1LL * (a) * (b) % mod
#define add(a, b) (a + b >= mod ? a + b - mod : a + b)
#define sub(a, b) (a - b < 0 ? a - b + mod : a - b)
#define RG register
ll qp(ll b, ll n, const ll mod=::mod){ll r=1;if(n<0)n+=mod-1;b%=mod;for(;n;n>>=1,b=mul(b,b))if(n&1)r=mul(r,b);return r;}
#define inv(x) (qp((x), mod-2))
const int maxn = 1e5+7;
pair<ll, ll> a[maxn];
int main()
{
#ifdef aoaoao
#endif
int n;scanf("%d", &n);
map<int, int> vis;
int mx = 0;
for(int i=1;i<=n;++i)
{
scanf("%lld%lld", &a[i].fi, &a[i].se);
vis[((a[i].fi+a[i].se)%2+2)%2]++;
}
if(SZ(vis)==2) return puts("-1"), 0;
int ok = 0;
if(vis.begin()->fi==0) ok = 1;
mx = 31;
printf("%d\n", mx+ok);
if(ok)
{
cout << 1 << ' ';
for(int i=1;i<=n;++i) a[i].fi--;
}
for(int i=0;i<mx;++i) printf("%lld%c", 1LL<<i, " \n"[i+1==mx]);
for(int i=1;i<=n;++i)
{
if(ok) cout << 'R';
char str[50];str[mx]='\0';
for(int j=mx-1;j>=0;--j)
{
if(abs(a[i].fi)>=abs(a[i].se))
{
if(a[i].fi>0)str[j]='R', a[i].fi-=1LL<<j;
else str[j]='L', a[i].fi+=1LL<<j;
}
else
{
if(a[i].se>0)str[j]='U', a[i].se-=1LL<<j;
else str[j]='D', a[i].se+=1LL<<j;
}
}
cout << str << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
const int MAX_N = 2006;
int N, M;
int a[MAX_N];
int b[MAX_N];
ll dp[MAX_N][MAX_N];
void solve()
{
for(int i=1;i<=N;++i)for(int j=1;j<=M;++j){
(dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+MOD)%=MOD;
if(a[i-1]==b[j-1]) (dp[i][j]+=1+dp[i-1][j-1])%=MOD;
}
cout << (dp[N][M]+1)%MOD;
}
int main()
{
cin >> N >> M;
for(int i=0;i<N;++i) cin >> a[i];
for(int i=0;i<M;++i) cin >> b[i];
solve();
return 0;
}
| 0
| 17,702,059
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
vector<vector<ll>> dp(n + 1, vector<ll>(2));
dp[0][0] = 1;
rep(i, n) rep(j, 2) {
if (s[i] == '1') {
dp[i + 1][1] = (dp[i + 1][1] + dp[i][j]) % mod;
}
else {
dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod;
}
if (!(s[i] == '0' && j == 0)) dp[i + 1][j] = (dp[i + 1][j] + (dp[i][j] * 2) % mod) % mod;
}
dunk((dp[n][0] + dp[n][1]) % mod);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n,y;
cin >> n >> y;
int a= -1, b = -1, c = -1;
for (int i = 0; i < n + 1; i++) {
if (y < i * 10000) break;
for (int j = 0; j < n - i + 1; j++) {
int n_d = n - i - j;
int total = 10000 * i + 5000 * j + 1000 * n_d;
if (total == y) {
a = i;
b = j;
c = n_d;
cout << a << ' ' << b << ' ' << c << endl;
return 0;
}
}
}
cout << a << ' ' << b << ' ' << c << endl;
return 0;
}
| 0
| 5,698,282
|
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).size())
#define MAX(v) *max_element(all(v))
#define MIN(v) *min_element(all(v))
using namespace std; using ll = long long; using P = pair<int,int>;
using vl = vector<ll>; using vvl = vector<vl>;
void debug_out() { cout << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
inline void IN(void){return;}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const int dx[8] = {1,0,-1,0,1,1,-1,-1}; const int dy[8] = {0,1,0,-1,1,1,-1,-1};
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll r,g,b,n;
IN(r,g,b,n);
ll ans = 0;
for(int i = 0;i*r <= n;i++){
for(int j = 0;j*g<=n;j++){
int v = n-i*r-j*g;
if(v>=0 && v%b==0) ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define ALL(a) (a).begin(),(a).end()
#define EACH(e,v) for(auto& e:v)
#define SORT(v) sort(ALL(v))
#define PERM(v) SORT(v);for(bool c##p=1;c##p;c##p=next_permutation(ALL(v)))
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<vii> viii;
typedef pair<int,int> P;
template <class T> void chmin(T & a, T const & b) { if (b < a) a = b; }
template <class T> void chmax(T & a, T const & b) { if (b > a) a = b; }
template <typename T>
string to_string(const T &n){ostringstream stm;stm << n;return stm.str();}
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
using ll = long long;
const ll mod = 1000'000'007;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int se[112345];
signed main(){
int n;
cin>>n;
vector<ll> avec;
rep(i,n+1){
ll a;cin>>a;avec.push_back(a);
}
COMinit();
int idx=0;
int idxb=0;
rep(i,n+1){
se[avec[i]]++;
if(se[avec[i]]==2)idx=i;
}
rep(i,n+1){
if(avec[idx]==avec[i]){
idxb=i;
break;
}
}
swap(idx,idxb);
int b=idxb-idx-1;int c=n-idxb;
ll ans=0LL;
rep(i,n+1){
int k=i+1;
if(i==0)cout<<n<<endl;
else {
ll ret=0;
ret+=COM(n-1,k)%mod;
ret+=COM(idx+c,k-1)%mod;
ret+=(COM(idx+b+c,k-1)-COM(idx+c,k-1))*2%mod;
ret+=COM(n-1,k-2)%mod;
cout<<(ret%mod+mod)%mod<<endl;
}
}
}
| 0
| 95,594,036
|
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int n;
cin >> n;
vector<int>w(n);
int all(0);
rep(i, n) {
cin >> w[i];
all += w[i];
}
int k = 105;
int ans(1e9);
int sum(0);
rep(i, n) {
sum += w[i];
int dist = abs(sum - (all - sum));
ans = min(ans, dist);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
using pii = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int W, H;
cin >> W >> H;
vector<int> p(W);
rep(i, 0, W) { cin >> p[i]; }
vector<int> q(H);
rep(i, 0, H) { cin >> q[i]; }
vector<pair<int, int>> v;
rep(i, 0, W) { v.push_back(pii(p[i], 0)); }
rep(i, 0, H) { v.push_back(pii(q[i], 1)); }
sort(all(v));
int w = 0, h = 0;
int ans = 0;
rep(i, 0, v.size()) {
dump(v[i], W + 1 - w, H + 1 - h);
if (v[i].second) {
ans += v[i].first * (W + 1 - w);
h++;
} else {
ans += v[i].first * (H + 1 - h);
w++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 25,299,977
|
#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int n,a,f;
int t[N],maxn=-N;
void hs(int x){
for(int i=2;i<=sqrt(x);){
if(x%i==0){
t[i]++;
while(x%i==0) x/=i;
}
else i++;
}
if(x>1) t[x]++;
}
int main(){
scanf("%d%d",&n,&a);
f=a;
for(int i=2;i<=n;i++){
scanf("%d",&a);
if(maxn<a) maxn=a;
f=__gcd(f,a);
hs(a);
}
if(f==1){
for(int i=2;i<=maxn;i++){
if(t[i]>1){
printf("setwise coprime\n");
return 0;
}
}
printf("pairwise coprime\n");
return 0;
}
else{
printf("not coprime\n");
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll int
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str;
ll k;
cin>>k>>n;
a=n;
ll v[k+1];
ll w[(k+1)*(k+1)];
rep(i,k+1){
v[i]=i;
}
map<ll,ll> ma;
rep(i,k+1){
rep(j,k+1){
ma[i+j]++;
}
}
map<ll,ll> mp;
rep(j,k+1){
rep(i,k*2+1){
mp[i+j]+=ma[i];
}}
cout<<mp[a]<<endl;
return 0;
}
| 0
| 67,013,154
|
#include <iostream>
using namespace std;
int main() {
int n;
int sum{0};
cin >> n;
for (int i = 1; i < n + 1; i++) {
sum += i;
}
cout << sum << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#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--)
typedef long long LL;
int main(){
int a;
while(cin>>a){
LL c=0;
REP(i,10){
REP(j,10){
REP(k,10){
REP(l,10){
if(i+j+k+l==a)c++;
}
}
}
}
cout<<c<<endl;
}
return(0);
}
| 0
| 14,705,476
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
const int INF = 1e9+100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(), (a).end()
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main(){
FIN;
ll n; cin >> n;
ll ans = 0;
vector<ll> A(100001,0);
for(int i=0;i<n;i++){
ll a; cin >> a;
if(a > 100000) ans++;
else A[a]++;
}
for(int i=1;i<=100000;i++){
if(A[i] < i) ans += A[i];
else ans += A[i] - i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, ans = 0;
cin >> n;
int mn = INF;
for (int i = 0, x; i < n; i++) {
cin >> x;
if (x <= mn) {
++ans;
}
umin(mn, x);
}
cout << ans << '\n';
}
| 0
| 59,351,939
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.