code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define fin ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i+= 1)
#define forr(i,a) for(int i = a; i >= 0; i--)
#define fori(i,m) for(auto i = m.begin(); i != m.end(); i++)
#define w(t) while(t--)
#define sz(s) int(s.size())
#define cls(a,car) memset(a,car,sizeof (a))
#define what_is(x) cerr << #x << " is " << x << endl;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ii> vii;
const int N = 1 * 1e5 + 5;
const ll mod = 1e9 + 7;
const int INF = INT_MAX;
const ll INFCAD = ll(INT_MAX) * 2 + 1;
const double E = 1e-9;
int main(){
fin;
int n, k;
cin >> n >> k;
int idx;
fore(i, 0, n){
int x;cin >> x;
if(x == 1)
idx = i + 1;
}
if(n == k){
cout << 1 << '\n';
}
else{
n--;k--;
cout << n / k + (n % k != 0) << '\n';
}
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
const int mod = 1e9+7;
int32_t main()
{
int n, m;
cin >> n >> m;
vector<string> in(n);
rep(i, n)
{
cin >> in[i];
}
int dp[n][m];
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
rep(i, n)
{
rep(j, m)
{
if(in[i][j] == '#')
continue;
if(i-1 >= 0)
dp[i][j] += dp[i-1][j];
if(j-1 >= 0)
dp[i][j] += dp[i][j-1];
dp[i][j] %= mod;
}
}
cout << dp[n-1][m-1];
return 0;
} | 0 | 40,948,427 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
#define pow10(n) int(1e##n + n)
typedef long long LL;
typedef pair<int, int> P;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
int isvacant(int i)
{
std::cout << i << endl;
fflush(stdout);
string s;
cin >> s;
if (s[0] == 'V')
{
exit(0);
}
else if (s[0] == 'F')
{
return 0;
}
else
{
return 1;
}
}
void solve()
{
int N;
cin >> N;
int l = 0, r = N - 1;
int sl = isvacant(l);
int sr = isvacant(r);
while (true)
{
int m = (l + r) >> 1;
int sm = isvacant(m);
if ((sm == sl) != (l % 2 == m % 2))
{
r = m;
sr = sm;
}
else
{
l = m;
sl = sm;
}
}
}
int main(int argc, char const *argv[])
{
solve();
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define scout cout << fixed << setprecision(20)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int n; cin >> n;
vint a(n);
rep(i,n) cin >> a[i];
ll ans = INF;
for(int i=-100;i<=100;i++) {
ll s=0;
rep(j,n) {
s+=(i-a[j])*(i-a[j]);
}
ans=min(ans,s);
}
cout << ans << endl;
} | 0 | 13,355,324 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define co(x) cout << x << endl
#define coel cout << endl
#define pb push_back
#define sz(v) ((ll)(v).size())
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 100000000000;
#define pp pair<ll, pair<ll, ll>>
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main() {
string s; cin >> s;
ll n = sz(s);
ll ans = n*(n-1)/2;
Vl c(26);
rep(i, 0, n){
c[s[i]-'a']++;
}
rep(i, 0, 26){
ll m = c[i];
if(m < 2) continue;
ans -= m*(m-1)/2;
}
co(ans+1);
return 0;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s1;
string s2;
cin>>s1;
cin>>s2;
int l=s1.length();
int m=s2.length();
vector<vector<int>> Table(l+1,vector<int>(m+1));
for(int i=0;i<l+1;i++){
Table[i][0]=i;
}
for(int j=0;j<m+1;j++){
Table[0][j]=j;
}
for(int i=1;i<l+1;i++){
for(int j=1;j<m+1;j++){
int value=min(Table[i-1][j],Table[i][j-1])+1;
int cost;
if(s1[i-1]==s2[j-1]){
cost=0;
}else{
cost=1;
}
Table[i][j]=min(value,Table[i-1][j-1]+cost);
}
}
cout<<Table[l][m]<<endl;
return 0;
} | 0 | 15,324,255 |
#include <queue>
#include <iostream>
using namespace std;
int main() {
string word;
priority_queue<int> Q;
while (cin >> word) {
if (word == "insert") {
int n;
cin >> n;
Q.push(n);
}
else if (word == "extract") {
int n = Q.top();
cout << Q.top() << endl;
Q.pop();
}
else if (word == "end") {
break;
}
}
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int grid[105][105];
int main(){
int n;cin >> n;
vector<int> a(n);
rep(i,n) cin>> a[i];
ll ans = 0;
rep(i,n-1){
ans += a[i]/2;
a[i] %= 2;
if(a[i+1]>0&&a[i]==1){
ans++;
--a[i+1];
--a[i];
}
}
ans += a[n-1]/2;
cout << ans << endl;
} | 0 | 25,862,649 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
int max_x;
cin >> max_x;
rep(i, N - 1){
int x;
cin >> x;
max_x = max(max_x, x);
}
int min_y;
cin >> min_y;
rep(i, N - 1){
int y;
cin >> y;
min_y = min(min_y, y);
}
for (int i = X + 1; i <= Y; i++){
if (max_x < i && i <= min_y){
cout << "No War" << endl;
return 0;
}
}
cout << "War" << endl;
} | #include <map>
#include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <string>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#include <bitset>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> bool chmin(T &a, T b) { return a>b?(a=b,true):false; }
template<class T> bool chmax(T &a, T b) { return a<b?(a=b,true):false; }
#define FOR(i,x,y) for(int i=(x);i<(int)(y);i++)
#define REP(i,y) for(int i=0;i<(int)(y);i++)
#define repp(i,y) for(int i=1;i<=(int)(y);i++)
#define REPB(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
#define bs2int(bs) ((bs).to_ullong())
template<class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << " ";
os << *it;
}
return os;
}
ll n,k;
ll a[100100], b[100100];
int main() {
cin>>n>>k;
vector<ll> v;
int rightmost_zero = -1;
ll i=0;
while ((k>>i) > 0) {
if(bit(k,i)==0) {
rightmost_zero = i;
break;
}
i++;
}
v.push_back(k);
if (rightmost_zero != -1) {
for(ll i=rightmost_zero+1; (k>>i)>0; i++) {
bitset<64> bs(k);
REP(j,i) {
bs.set(j);
}
bs.reset(i);
if (bs2int(bs) < k) v.push_back(bs2int(bs));
}
}
REP(i,n) {
cin>>a[i]>>b[i];
}
ll mxans = 0;
for (int k : v) {
ll ans = 0;
REP(i,n) {
if (k==(k | a[i])) ans+=b[i];
}
chmax(mxans, ans);
}
cout << mxans << endl;
} | 0 | 2,619,338 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e5 + 7;
int n, m, v, p, a[N];
bool check(int mid) {
if (mid >= n - p)
return 1;
vector <int> t;
for (int i = 0; i <= n - p; ++i)
if (i != mid)
t.app(a[i]);
int add = max(0ll, v - p);
int sum = 0;
for (int e : t)
if (a[mid] + m < e)
return 0;
for (int e : t)
sum += min(m, a[mid] + m - e);
return sum >= add * m;
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
cin >> n >> m >> v >> p;
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
int l = -1;
int r = n - p;
while (l < r - 1) {
int mid = (l + r) >> 1;
if (check(mid))
r = mid;
else
l = mid;
}
cout << n - r << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
int x,y,z,ans=0,money;
for(x=0;x<=N;x++){
if(x*10000>Y){
break;
}
for(y=0;y<=N-x;y++){
z = N-x-y;
money = 10000*x+5000*y+1000*z;
if(money==Y){
ans=1;
cout << x << " " << y << " " << z << endl;
break;
}
}
if(ans == 1){
break;
}
}
if(ans == 0){
cout << -1 << " " << -1 << " "<< -1 << endl;
}
} | 0 | 69,472,533 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
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(void)
{
int N, K;
cin >> N >> K;
cout << N-K+1 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int n;
int bj[maxn];
int a[maxn];
int cnta[maxn];
int cntb[maxn];
typedef pair<int,int> pii;
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(i&1)
{
cnta[a[i]]++;
}else{
cntb[a[i]]++;
}
}
vector<pii> ji,ou;
for(int i=1;i<=n;i++)
{
if(i&1)
{
ji.push_back(make_pair(cnta[a[i]],a[i]));
}else
{
ou.push_back(make_pair(cntb[a[i]],a[i]));
}
}
sort(ji.begin(),ji.end());
ji.erase(unique(ji.begin(),ji.end()),ji.end());
sort(ou.begin(),ou.end());
ou.erase(unique(ou.begin(),ou.end()),ou.end());
int ans=1e9;
for(int i=1;i<=n;i+=2)
{
if(ou[ou.size()-1].second!=a[i])
{
ans=min(ans,n/2-cnta[a[i]]+n/2-ou[ou.size()-1].first);
}else
{
if(ou.size()>=2)
{
ans=min(ans,n/2-cnta[a[i]]+n/2-ou[ou.size()-2].first);
}else
{
ans=min(ans,n/2-cnta[a[i]]+n/2);
}
}
}
for(int i=2;i<=n;i+=2)
{
if(ji[ji.size()-1].second!=a[i])
{
ans=min(ans,n/2-cntb[a[i]]+n/2-ji[ji.size()-1].first);
}else
{
if(ji.size()>=2)
{
ans=min(ans,n/2-cntb[a[i]]+n/2-ji[ji.size()-2].first);
}else
{
ans=min(ans,n/2-cntb[a[i]]+n/2);
}
}
}
cout<<ans<<endl;
return 0;
} | 0 | 98,229,497 |
#include <iostream>
#include <algorithm>
#include <vector>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int n,x;
while(cin >> n >> x)
{
if(n == 0 && x == 0) break;
int count = 0;
REP(i,1,n-1)
{
REP(j,i+1,n)
{
REP(k,j+1,n+1)
{
if(i+j+k == x) count++;
}
}
}
cout << count << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long N;
long long u[200005];
long long v[200005];
int main(){
cin >> N;
for(long long i = 0; i < N - 1; i++) {
cin >> u[i] >> v[i];
u[i]--; v[i]--;
if(u[i] > v[i]) {
swap(u[i], v[i]);
}
}
long long maxi = 0;
for(long long i = 0; i < N; i++) {
long long num = N-i;
maxi += ((num) * (num+1))/2;
}
for(long long i = 0; i < N - 1; i++) {
long long left = u[i];
long long right = v[i];
long long leftcount = left + 1;
long long rightcount = N - right;
maxi -= leftcount * rightcount;
}
cout << maxi << endl;
} | 0 | 50,135,784 |
#include <iostream>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
map<int, int> count;
rep(i, M) {
int a, b;
cin >> a >> b;
count[a]++;
count[b]++;
}
for (auto& num : count) {
if (num.second % 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<<#x<<" = "<<(x)<<"\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int,int>;
using P = pair<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int,vector<int>,greater<int>>;
using V = vector<int>;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main() {
IOS;
int n,m; cin >> n >> m;
PQ pq;
REP(i,n) {
int a; cin >> a;
pq.push(a);
}
REP(i,m) {
int a = pq.top(); pq.pop();
pq.push(a/2);
}
ll ans = 0;
REP(i,n) { ans+=pq.top(); pq.pop(); }
COUT(ans);
return 0;
} | 0 | 78,509,130 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
const int maxn=200005;
int n,m;
int head[maxn],t[maxn<<1],ne[maxn<<1],num,col[maxn],size[maxn];
int sumb,numb,sumn,numn;
i64 ans=0;
inline bool dfs(int x, int fa, int c){
if(col[x]!=-1)return col[x]==c;
col[x]=c;size[x]=1;
bool res=true;
forE(i,x){
if(col[t[i]]==-1)
res&=dfs(t[i],x,c^1),size[x]+=size[t[i]];
else
res&=dfs(t[i],x,c^1);
}
return res;
}
inline void addedge(int x,int y){
ne[++num]=head[x];head[x]=num;t[num]=y;
ne[++num]=head[y];head[y]=num;t[num]=x;
}
int main(){
read(n);read(m);rep(i,1,n)head[i]=-1;
rep(i,1,m){
int x,y;
read(x);read(y);
addedge(x,y);
}
memset(col,-1,sizeof(col));
rep(i,1,n)if(col[i] == -1){
bool flag=dfs(i, 0, 0);
int sz=size[i];
if(sz>1){
if(flag)
sumb+=sz,numb+=1;
else
sumn+=sz,numn+=1;
}
}
ans=1ll*n*n;
ans-=1ll*(sumb+sumn)*(sumb+sumn);
ans+=1ll*(numb+numn)*(numb+numn);
ans+=1ll*numb*numb;
printf("%lld\n",ans);
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <string>
#include <complex>
#include <algorithm>
#include <iostream>
#include <vector>
#include <bitset>
#include <deque>
#include <queue>
#include <map>
#include <utility>
#include <functional>
#include <iomanip>
#include <chrono>
#include <unordered_map>
#include <set>
using namespace std;
using ull = unsigned long long;
using ll =long long ;
using prll =pair<ll, ll>;
constexpr ll MOD = 1000000007;
constexpr ll mINF = -922337200085470000;
constexpr ll pINF = 1LL << 60;
constexpr ull uINF= 1844674407399900000;
constexpr long double pi = 3.1415926535897932384;
constexpr ll juu = 100000;
constexpr ll hyaku = 1000000;
constexpr int dx[4] = {0,0,1,-1};
constexpr int dy[4] = {1,-1,0,0};
constexpr int ddx[8] = {0,0,1,-1,1,1,-1,-1};
constexpr int ddy[8] = {1,-1,0,0,-1,1,1,-1};
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Debug(xx) cerr << " DEBUG:"<< xx << endl ;
#define Debug2(xx,yy) cerr << " DEBUG:"<< xx << ":" << yy<< endl ;
ll factor[300];
ll memory[300];
void primefac(ll num)
{
int i = 0, kosuu = 0;
while (*(factor + i) != 0)
{
while (num % *(factor + i) == 0)
{
num /= *(factor + i);
memory[*(factor + i)] += 1;
}
if (num == 1)
break;
i++;
}
}
int elast(ll number)
{
ll tmp = 0;
int flag = 0;
*factor = 2;
for (int i = 3; i <= number; i++)
{
flag = 0;
for (int j = 0; j <= tmp; j++)
{
if (i % (*(factor + j)) == 0)
{
flag = 1;
break;
}
}
if (flag)
continue;
tmp += 1;
*(factor + tmp) = i;
}
return tmp + 2;
}
ll powpow(ll n, ll p)
{
if (p == 1)
return n % MOD;
if (p % 2 == 1)
{
return (n * powpow(n, p - 1)) % MOD;
}
ll dob = powpow(n, p / 2);
return (dob * dob) % MOD;
}
ll nCrMod(ll n, ll r)
{
ll child = 1;
ll parent = 1;
if (r == 0)
return 1;
for (ll i = 0; i < r; ++i)
{
child = child * (n - i) % MOD;
parent = parent * (r - i) % MOD;
}
ll ans = child * powpow(parent, MOD - 2);
return ans % MOD;
}
ll to_digit(ll num){
return (ll)(to_string(num).size());
}
ll nCr(ll n, ll r)
{
ll val = 1,val2 = 1;
if (r == 0)
return 1;
if(n < r)
return 0;
for (ll i = 0; i < r; ++i)
{
val *= (n - i);
val2 *= (r - i);
}
return val/val2;
}
ll nPr(ll n, ll r)
{
ll val = 1;
for (ll i = 0; i < r; ++i)
{
val *= (n - i);
}
return val;
}
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;
}
template <typename T>
void eraseSame(T &a)
{
sort(all(a));
a.erase(unique(all(a)), a.end());
}
template <typename T>
bool swapmax(T &a, T &b)
{
T temp;
temp = a;
if (a > b)
{
swap(a,b);
return false;
}
return true;
}
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <typename T>
void splitIn(ll N, vector<T> &array)
{
T temp;
int i = 0;
if (N == 0)
{
return;
}
array.resize(N);
while (cin >> temp)
{
array[i] = temp;
++i;
if (i >= N)
{
break;
}
}
return;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, m,l;
ll ans = 0;
ll sum = 0;
string s;
vector<ll> v;
cin >> k >> n >> m;
if(n+2 < m && k + 1 >= n + 2){
ll kremain;
kremain = (k) - (n - 1) - 2;
ans += m;
ll rp;
rp = kremain / 2;
ans += rp*(m-n) + (kremain % 2);
}
else{
ans = k +1;
}
cout << ans << "\n";
return 0;
} | 0 | 66,081,574 |
#include <iostream>
using namespace std;
int main()
{
int x, y;
cin >> x >> y;
x = x * x;
x = x - y;
cout << x;
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 double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int n;
cin >> n;
vector<ll>a(n);
rep(i, 0, n)cin >> a[i];
ll stock = 0;
ll money = 1000;
rep(i, 0, n-1){
if(a[i]<a[i+1]){
stock += money/a[i];
money -= stock*a[i];
money += a[i+1]*stock;
stock=0;
}
}
cout << money << endl;
} | 0 | 68,685,283 |
#include<stdio.h>
int main()
{
int k,x;
scanf("%d %d",&k,&x);
k=k*500;
if(k>=x||k==x){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
#define pq_pair_tB priority_queue <pair<ll,ll>, vector<pair<ll,ll> > , greater<pair<ll,ll> > >
#define pq_pair_ts priority_queue <pair<ll,ll> >
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b,a%b);}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B , K;
cin >> A >> B >> K;
rep(i, (K+1)/2){
if(A % 2 == 1) A--;
B+=A/2;
A/=2;
if((K%2 == 1) && (i == K/2)) break;
if(B % 2 == 1) B--;
A+=B/2;
B/=2;
cerr << i << ":" << A << " " << B << endl;
}
cout << A << " " << B << endl;
return 0;
} | 0 | 64,753,040 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
bool diff = false;
long long ans = 0;
int big = 1E9 + 6;
for (int i = 0; i < n; i++)
{
int a, b;
cin >> a >> b;
ans += a;
if (a > b && b < big)
big = b;
diff = diff || (a != b);
}
ans -= big;
if (!diff)
ans = 0;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int fn(long long x, long long y, long long z){
return x*x + y*y + z*z + x*y + y*z + z*x;
}
int main(){
string s;
cin >> s;
vector<int> n(s.size());
rep(i,s.size()){
if(s.at(i) == '1') n.at(i) = 1;
else if(s.at(i) == '2') n.at(i) = 2;
else if(s.at(i) == '3') n.at(i) = 3;
else if(s.at(i) == '4') n.at(i) = 4;
else if(s.at(i) == '5') n.at(i) = 5;
else if(s.at(i) == '6') n.at(i) = 6;
else if(s.at(i) == '7') n.at(i) = 7;
else if(s.at(i) == '8') n.at(i) = 8;
else if(s.at(i) == '9') n.at(i) = 9;
}
int num;
if(n.at(0)*100 + n.at(1)*10 + n.at(2) >= 753 ){
num = n.at(0)*100 + n.at(1)*10 + n.at(2) - 753;
}
else num = 753 - (n.at(0)*100 + n.at(1)*10 + n.at(2));
int ans = num;
rep(i,s.size()-2){
if(n.at(i)*100 + n.at(i+1)*10 + n.at(i+2) >= 753 ){
num = n.at(i)*100 + n.at(i+1)*10 + n.at(i+2) - 753;
}
else num = 753 - (n.at(i)*100 + n.at(i+1)*10 + n.at(i+2));
if(num < ans ) ans = num;
}
cout << ans << endl;
} | 0 | 34,921,908 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main() {
double a, b, C;
double S, L, h;
cin >> a >> b >> C;
double D = acos(-1.0) * C /180.0;
S = a * b * sin(D) / 2.0;
L = a + b + sqrt(a*a + b*b -2*a*b*cos(D));
h = b*sin(D);
printf("%lf\n%lf\n%lf\n",S, L, h);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9+7
typedef long long int ll;
const int maxn = 1000;
ll mod = INF;
int main(){
int h,n;
int a[1000],b[1000];
int dp[10001];
cin >> h>>n;
for(int i=0;i<n;i++){
cin >> a[i]>>b[i];
}
for(int i=0;i<=10000;i++){
dp[i]=INF;
}
dp[0]=0;
for(int d=1;d<=10000;d++){
for(int j=0;j<n;j++){
if(d-a[j]<0){
dp[d]=min(dp[d],b[j]);
}else if(d-a[j]>=0){
dp[d]=min(dp[d],dp[d-a[j]]+b[j]);
}
}
}
for(int i=h;i<=10000;i++){
if(dp[i]!=INF){
cout << dp[i]<<endl;
break;
}
}
return 0;
} | 0 | 55,251,050 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
rep(i,s.size()) {
if (s[i] == '0') a++;
else b++;
}
int ans = 2*min(a,b);
cout << ans << 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;
}
vector<int> as;
vector<vector<int>> pos_for_bit;
ll solve(const int N) {
ll ans = 0;
for (int i = 0; i < N; i++) {
const int start = i;
int end = N;
#ifdef DEBUG
printf("start: %d\n", start);
#endif
for (int bit = 0; bit < 20; bit++) {
if (as[i] & (1 << bit)) {
auto it = upper_bound(pos_for_bit[bit].begin(), pos_for_bit[bit].end(), i);
chmin(end, *it);
#ifdef DEBUG
printf(" bit: %d, %d\n", bit, *it);
#endif
} else {
auto it = upper_bound(pos_for_bit[bit].begin(), pos_for_bit[bit].end(), i);
it++;
chmin(end, *it);
#ifdef DEBUG
printf(" bit: %d, %d\n", bit, *it);
#endif
}
}
#ifdef DEBUG
printf(" end: %d\n", end);
#endif
ans += end - start;
}
return ans;
}
int main(void) {
int N;
cin >> N;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
}
pos_for_bit.resize(20, vector<int>());
for (int i = 0; i < 20; i++) {
for (int j = 0; j < N; j++) {
if (as[j] & (1 << i)) {
pos_for_bit[i].push_back(j);
}
}
pos_for_bit[i].push_back(N);
pos_for_bit[i].push_back(N);
}
#ifdef DEBUG
printf("pos_for_bit: \n");
for (int i = 0; i < 20; i++) {
printf(" bit %d: ", i);
for (auto x : pos_for_bit[i]) {
printf("%d ", x);
}
printf("\n");
}
#endif
cout << solve(N) << endl;
return 0;
} | 0 | 69,582,896 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
bool compare(int a,int b){
return a<b;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int p=0;
int count=0;
int max=0;
for(int i=0;i<s.size();i++){
if(s[i]=='R'){
count++;
if(count>max){
max=count;
}
}
else if(s[i]=='S'){
count=0;
continue;
}
}
cout<<max<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
vector<vector<int>> a(3, vector<int>(3));
int n, b;
rep(i, 3){
rep(j, 3){
cin >> a[i][j];
}
}
cin >> n;
vector<vector<int>> bingo(3,vector<int>(3));
rep(i, n){
cin >> b;
rep(j, 3){
rep(k, 3){
if(a[j][k]==b){
bingo[j][k] = 1;
}
}
}
}
vector<int> r(3,0);
vector<int> c(3,0);
rep(i, 3){
rep(j,3){
if(bingo[j][i]==1)
c.at(i)++;
}
}
rep(i, 3){
rep(j,3){
if(bingo[i][j]==1)
r.at(i)++;
}
}
if(bingo[1][1]==1&&bingo[2][2]==1&&bingo[0][0]==1
|| bingo[0][2]==1&&bingo[1][1]==1&&bingo[2][0]==1){
cout << "Yes" << endl;
return 0;
}
rep(i, 3){
if(r.at(i)==3||c.at(i)==3){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | 0 | 58,284,841 |
#include <iostream>
#include <string>
using namespace std;
const string L = "qwertasdfgzxcvb";
int main(){
string s;
while(cin >> s, s != "#"){
int ans = 0;
bool prev = L.find(s[0]) != string::npos;
for(int i=1; i<(int)s.size(); ++i){
bool cur = L.find(s[i]) != string::npos;
ans += cur != prev;
prev = cur;
}
cout << ans << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int>ansl;
string s;
int main(){
int M,N_MIN,N_MAX;
cin >>M>>N_MIN>>N_MAX;
while(!((M==0)&&(N_MIN==0)&&(N_MAX==0))){
vector<int> v;
for(int i = 0;i<M;i++){
int x;
cin >>x;
v.push_back(x);
}
int ans = N_MIN-1;
int gap = v[N_MIN-1]-v[N_MIN];
for(int i = N_MIN;i <= N_MAX-1;i++){
int z = v[i]-v[i+1];
int mx = gap;
gap = max(gap,z);
if(mx != gap){
ans = i;
}
if(mx == z){
ans = i;
}
}
ansl.push_back(ans+1);
cin >>M>>N_MIN>>N_MAX;
}
for(int i = 0;i<(int)ansl.size();i++){
cout <<ansl[i]<<endl;
}
return 0;
} | 0 | 59,748,605 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
if ((n[0] == n[1] && n[1] == n[2])
|| (n[1] == n[2] && n[2] == n[3])) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <string.h>
#include <iomanip>
using namespace std;
#define int long long
#define ull unsigned long long
#define F first
#define S second
#define nl "\n"
#define ld long double
#define div 1000000007
#define pi 3.14159265358979323846
#define pb push_back
bool ans=0;
void f(int a,int b,int c,int k)
{
if(a<b && b<c)
{
ans=1;
return;
}
if(k==0)
{
return;
}
f(2*a,b,c,k-1);
f(a,2*b,c,k-1);
f(a,b,2*c,k-1);
}
void solve()
{
int a,b,c,k;cin>>a>>b>>c>>k;
f(a,b,c,k);
if(ans)
cout<<"Yes"<<nl;
else
cout<<"No"<<nl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int t=1;
while(t--)
{
solve();
}
return 0;
} | 0 | 20,032,739 |
#include <stdio.h>
int main() {
int n, ct = 0;
char s[105];
scanf("%d", &n);
scanf("%s", &s);
if (n % 2 != 0) {
printf("No");
return 0;
}
int half = n / 2;
for (int i = 0; i < half; i++) {
if (s[i] == s[i + half]) {
ct++;
}
}
if (ct == half) {
printf("Yes");
} else {
printf("No");
}
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int n;
cin>>n;
int cnt[110000];
int m=0;
rep(i,0,n){
int d;
cin>>d;
if(i==0&&d!=0||i!=0&&d==0){
cout<<0<<endl;
return 0;
}
cnt[d]++;
m=max(m,d);
}
ll ans=1;
rep(i,1,m+1){
rep(j,0,cnt[i]){
ans*=cnt[i-1]%998244353;
ans%=998244353;
}
}
cout<<ans%998244353<<endl;
} | 0 | 41,442,637 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[2] - A[0] << endl;
} | #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
#define pll pair<ll, ll>
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B, C, K;
cin >> A >> B >> C >> K;
vector<ll> nums = {A, B, C};
if (K == 0) {
cout << A - B << endl;
return 0;
}
ll na = nums[1] + nums[2];
ll nb = nums[0] + nums[2];
ll nc = nums[0] + nums[1];
nums[0] = na;
nums[1] = nb;
nums[2] = nc;
if (abs(nums[0] - nums[1]) > (ll)pow(10, 18))
cout << "Unfair" << endl;
else {
if (K % 2 == 1)
cout << nums[0] - nums[1] << endl;
else
cout << nums[1] - nums[0] << endl;
}
} | 0 | 77,052,540 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
int alp[26] = {};
while (cin >> s) {
for (int i = 0; i < s.length(); i++) {
if (s[i] < 'A') continue;
if (s[i] < 'a') alp[s[i] - 'A']++;
else alp[s[i] - 'a']++;
}
}
for (int i = 0; i < 26; i++) {
char c = 'a' + i;
cout << c << " : " << alp[i] << endl;
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N, A, B; cin >> N >> A >> B;
int ans = 0;
for(int i = 1; i <= N; i++) {
int n = 0;
int x = i;
while(x) {
n += x % 10;
x /= 10;
}
if(n >= A && n <= B) ans += i;
}
cout << ans << endl;
return 0;
} | 0 | 59,563,464 |
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include <array>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(int i = 0; i < n; i++)
#define FORAB(i, a, b) for(int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C) ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))
typedef long long int LL;
typedef long long LLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL> VPL;
typedef vector<PII> VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;
#define MAXN 1000006
const LL MOD = 1000000007;
const LL INF = 2000000000000000001LL;
LL Calc(VI& A) {
int n = SZ(A);
VL max_node(n + 1, 0);
LL cur = 1;
max_node[0] = 1;
for (int i = 0; i < n; i++) {
cur -= A[i];
if (cur < 0) return -1;
cur = max_node[i + 1] = MIN(2 * cur, 200000000000000LL);
}
cur = 0;
LL ret = 0;
for (int i = n - 1; i >= 0; i--) {
cur += A[i];
cur = max_node[i] = MIN(cur, max_node[i]);
ret += max_node[i];
}
return ret;
}
void solve(int ks) {
int n;
scanf("%d", &n);
VI A(n + 1, 0);
for (int i = 0; i <= n; i++) scanf("%d", &A[i]);
LL ans = Calc(A);
printf("%lld\n", ans);
}
void gen() {
}
int main()
{
double start_time = clock();
#ifdef LOCAL
freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
#endif
gen();
if (0) {
int T;
scanf("%d", &T);
for (int ks = 1; ks <= T; ks++) {
solve(ks);
if (ks % 1 == 0) fprintf(stderr, "%d done\n", ks);
}
}
else {
solve(0);
}
double end_time = clock();
fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r);
int cnt[300005] = {};
int cnt2[300005] = {};
int cnt3[300005] = {};
void solve(long long N, std::vector<long long> A)
{
rep(i, N) cnt[A[i]]++;
vector<int> a;
vector<int> hist;
rep(i, 300005)
{
if (cnt[i])
{
cnt2[cnt[i]]++;
}
}
map<lli, lli> m;
lli sum = 0;
lli used = 0;
rep(i, 300005) used += cnt2[i];
rep(i, 300005)
{
sum += cnt2[i] * i;
used -= cnt2[i];
if (i)
cnt3[i] = (sum + i * used) / i;
}
lli cur = N;
for (int k = 1; k <= N; k++)
{
while (cur >= 0 && cnt3[cur] < k)
cur--;
cout << (cur > 0 ? cur : 0) << endl;
}
}
signed main()
{
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++)
{
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r)
{
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r)
{
return (l < r) ? (l = r, true) : false;
} | 0 | 84,098,518 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main()
{
int N;
cin >> N;
vector<pair<string, int>>v(N);
rep(i, N)
{
string s;
int t;
cin >> s >> t;
v[i] = make_pair(s, t);
}
string X;
cin >> X;
int num;
rep(i, N)if (v[i].first == X)num = i;
int sum = 0;
for (int i = num + 1; i < N; i++)sum += v[i].second;
cout << sum;
} | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 100000000000000000
#define mod 1000000007
#define MAX 10000005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<lint,lint> pii;
bool prime[MAX];
int lowFactor[MAX];
void SIEVE(void){
for(int i=1;i<MAX;i++){
prime[i]=true;
lowFactor[i]=i;
}
prime[1]=false;
for(int i=2;i*i<MAX;i++){
if(!prime[i]) continue;
for(int j=i*i;j<MAX;j+=i){
prime[j]=false;
if(lowFactor[j]==j) lowFactor[j]=i;
}
}
}
lint getFactorization(int a){
lint ans=1;
while(a>1){
int pre=lowFactor[a];
int cong=0;
while(lowFactor[a]==pre){
pre=lowFactor[a];
a/=pre;
cong++;
}
if(cong) ans*=(cong+1);
}
return ans;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
SIEVE();
int n;
cin>>n;
lint sm=0;
for(int i=1;i<=n;i++){
sm+=i*getFactorization(i);
}
cout<<sm;
return 0;
} | 0 | 95,383,683 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0];
cin >> a[1];
cin >> a[2];
sort(a, a+3);
printf("%d %d %d\n", a[0], a[1], a[2]);
} | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int bingo[3][3];
bool mark[3][3];
int main(){
for(int i=0; i<3; ++i){
for(int j=0; j<3; ++j){
int a;
cin >> a;
bingo[i][j] = a;
}
}
int N; cin >> N;
for(int n=0; n<N; ++n){
int b; cin >> b;
for(int i=0; i<3; ++i){
for(int j=0; j<3; ++j){
if(b == bingo[i][j]) mark[i][j] = true;
}
}
}
string ans = "No";
for(int i=0; i<3; ++i){
if (mark[i][0] == true &&
mark[i][1] == true &&
mark[i][2] ==true ){
ans = "Yes";
}
}
for(int j=0; j<3; ++j){
if (mark[0][j] == true &&
mark[1][j] == true &&
mark[2][j] ==true ){
ans = "Yes";
}
}
if(mark[0][0] == true &&
mark[1][1] == true &&
mark[2][2] == true){
ans = "Yes";
}
if(mark[0][2] == true &&
mark[1][1] == true &&
mark[2][0] == true){
ans = "Yes";
}
cout << ans << endl;
} | 0 | 91,983,281 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for (int i = 0; i < 19; i++){
if (s[i] != ',')
cout << s[i];
else
cout << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_ROW = 510;
const int MAX_COL = 510;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
int GaussJordan(BitMatrix &A, bool is_extended = false) {
int rank = 0;
for (int col = 0; col < (int)A.W; col++) {
if (is_extended && col == (int)A.W - 1) break;
int pivot = -1;
for (int row = rank; row < (int)A.H; row++) {
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1) continue;
if (rank != pivot) swap(A[pivot], A[rank]);
for (int row = 0; row < (int)A.H; row++) {
if (row != rank && A[row][col] != 0) A[row] ^= A[rank];
}
rank++;
}
return rank;
}
int linear_equation(BitMatrix A, vector<int> b, vector<int> &res) {
int m = (int)A.H, n = (int)A.W;
BitMatrix M(m, n+1);
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) M[i][j] = A[i][j];
M[i][n] = b[i];
}
int rank = GaussJordan(M, true);
for (int row = rank; row < m; ++row) if (M[row][n] != 0) return -1;
res.assign(n, 0);
for (int i = 0; i < rank; ++i) res[i] = M[i][n];
return rank;
}
int main(){
int n, m; cin >> n >> m;
BitMatrix A(m, n);
vector<int> b(m);
for (int i = 0; i < m; i++) {
int k; cin >> k;
for (int j = 0; j < k; j++) {
int s; cin >> s; s--;
A[i][s] = 1;
}
}
for (int i = 0; i < m; i++) cin >> b[i];
vector<int> res;
int rank = linear_equation(A, b, res);
if (rank == -1) cout << 0 << endl;
else cout << (1<<(n-rank)) << endl;
} | 0 | 44,844,036 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>> xs(h);
vector<vector<int>> ys(w);
rep(i, w) {
ys[i].push_back(0);
ys[i].push_back(h+1);
}
rep(i, h) {
xs[i].push_back(0);
xs[i].push_back(w+1);
}
rep(i, h) {
rep(j, w) {
int x = j+1;
int y = i+1;
char c;
cin >> c;
if(c == '#') {
xs[i].push_back(x);
ys[j].push_back(y);
}
}
}
rep(i, w) {
sort(ys[i].begin(), ys[i].end());
}
rep(i, h) {
sort(xs[i].begin(), xs[i].end());
}
int max_cnt = 0;
rep(i, h) {
rep(j, w) {
int x = j+1;
int y = i+1;
if(binary_search(xs[i].begin(), xs[i].end(), x) || binary_search(ys[j].begin(), ys[j].end(), y)) {
continue;
}
auto l_at = lower_bound(xs[i].begin(), xs[i].end(), x);
int xrange = *l_at - *prev(l_at) - 1;
auto u_at = lower_bound(ys[j].begin(), ys[j].end(), y);
int yrange = *u_at - *prev(u_at) - 1;
int cnt = xrange + yrange - 1;
max_cnt = max(cnt, max_cnt);
}
}
cout << max_cnt << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 2e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define N 100010
vii M(N, vi());
vi color(N, -1);
bool bipartite(int s) {
stack<int> st;
color[s] = 0;
st.push(s);
int i, j;
bool flag = true;
while (!st.empty()) {
i = st.top();
st.pop();
for (j = 0; j < M[i].size(); j++) {
if (color[M[i][j]] == color[i]) {
flag = false;
}
else {
if (color[M[i][j]] == -1) {
color[M[i][j]] = 1 - color[i];
st.push(M[i][j]);
}
}
}
}
return flag;
}
int main() {
int n, m, i, j;
cin >> n >> m;
vector<bool> used(n, false);
for (i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--; v--;
M[u].push_back(v);
M[v].push_back(u);
used[u] = used[v] = true;
}
ll single = 0, nibu = 0, ki = 0;
for (i = 0; i < n; i++) {
if (!used[i]) {
single++;
}
else {
if (color[i] == -1) {
if (bipartite(i)) {
nibu++;
}
else {
ki++;
}
}
}
}
ll ans = 0;
for (i = 0; i < single; i++) {
ans += 2 * (n - i) - 1;
}
ans += 2 * nibu + ki;
ans += 2 * nibu*(nibu - 1) + 2 * nibu * ki + ki * (ki - 1);
cout << ans << endl;
} | 0 | 16,232,900 |
#include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
using vstr = vector<string>;
const ll MOD=1e9+7;
const ll INF=1ll<<60;
string S,T;
int main(){
cin >> S>> T ;
int ans = 1000;
for(int i=0, len=S.length()-T.length(); i<=len; ++i){
int k=0;
for(int j=0, lenT=T.length(); j<lenT; ++j){
if(S.at(i+j) != T.at(j)) ++k;
}
ans = min(ans,k);
}
cout << ans<<endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int n, m, v, p;
bool check(int *a, int i) {
if (a[i] + m < a[n-p]) return false;
else if (v <= i+p) return true;
long long amt = (long long)m * (v - (i + p));
for (int j = i+1; j <= n-p; j++) {
if (a[i] + m < a[j]) return false;
amt -= a[i] + m - a[j];
if (amt <= 0) return true;
}
return false;
}
int main() {
cin >> n >> m >> v >> p;
int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a+n);
int lb = -1, ub = n-p;
while (ub - lb > 1) {
int i = (ub + lb) / 2;
if (check(a, i)) ub = i;
else lb = i;
}
cout << n-ub << endl;
} | 0 | 98,054,982 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int main(){
int n;
int k;
cin >> n >> k;
int i=0;
int number =1;
while(i<n){
if(number < k) number*=2;
else number+=k;
i++;
}
cout << number;
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
bool c1 = false,c2=false,c3=false;
string s,sr;
cin >> s;
lli n = s.size();
sr = s;
reverse(all(sr));
if(s==sr){
c1 = true;
}
string ss1, ssr1;
ss1 = s.substr(0,(n-1)/2);
ssr1 = ss1;
reverse(all(ssr1));
if(ssr1==ss1){
c2 = true;
}
string ss2, ssr2;
ss2 = sr.substr(0, (n - 1) / 2);
ssr2 = ss2;
reverse(all(ssr2));
if(ssr2==ss2){
c3 = true;
}
YN(c1 && c2 && c3);
} | 0 | 77,547,262 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) {
cout << i << ":" << v[i] << " ";
}
cout << endl;
#else
(void)v;
#endif
}
signed main() {
string S;
cin >> S;
if (S[6] == '1') {
if (S[5] == '1') {
COUT("TBD");
return 0;
}
COUT("Heisei");
return 0;
}
if (S[6] == '2') {
if (S[5] == '1') {
COUT("TBD");
return 0;
}
COUT("Heisei");
return 0;
}
if (S[6] == '3') {
COUT("Heisei");
return 0;
}
if (S[6] == '4') {
COUT("Heisei");
return 0;
}
COUT("TBD");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const int inf=1e9+7;
const ll INF=1e18;
int main(){
int n;cin>>n;
string s;cin>>s;
int tmp=0;int r=0;
rep(i,n){
if(s[i]==')'){
if(tmp)tmp--;
else r++;
}
else tmp++;
}
string ans;
rep(i,r)ans+='(';
ans+=s;
rep(i,tmp)ans+=')';
cout<<ans<<endl;
} | 0 | 83,948,806 |
#include <iostream>
using namespace std;
int main() {
int h, w, b;
char a;
cin >> h >> w;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
string s;
cin >> s;
if (s=="snuke") {
a=65+j;
b=i+1;
}
}
}
cout << a << b;
} | #include<bits/stdc++.h>
#define li long long int
using namespace std;
int main(){
li n;
cin>>n;
if(n>=400&&n<600)
cout<<8<<endl;
if(n>=600&&n<800)
cout<<7<<endl;
if(n>=800&&n<1000)
cout<<6<<endl;
if(n>=1000&&n<1200)
cout<<5<<endl;
if(n>=1200&&n<1400)
cout<<4<<endl;
if(n>=1400&&n<1600)
cout<<3<<endl;
if(n>=1600&&n<1800)
cout<<2<<endl;
if(n>=1800&&n<2000)
cout<<1<<endl;
} | 0 | 37,074,716 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
vector<ll> P;
vector<ll> C;
set<ll> roop(ll x,ll &point) {
set<ll> S;
S.insert(x);
ll k=x;
x=P[x-1];
point+=C[x-1];
while(x!=k) {
S.insert(x);
x=P[x-1];
point+=C[x-1];
}
return S;
}
int main() {
ll N,K;
cin>>N>>K;
P=vector<ll>(N);
for(ll i=0;i<N;i++) {
cin>>P[i];
}
C=vector<ll>(N);
for(ll i=0;i<N;i++) {
cin>>C[i];
}
vector<set<ll>> A(0);
vector<vector<ll>> B(2,vector<ll>(0));
vector<ll> ans(0);
for(ll i=1;i<=N;i++) {
ll index=-1;
for(ll j=0;j<A.size();j++) {
if(A[j].count(i)) {
index=j;
}
}
if(index<0) {
ll point=0;
A.push_back(roop(i,point));
B[0].push_back(A.back().size());
B[1].push_back(point);
index=A.size()-1;
}
ll place=P[i-1];
ll point=C[place-1];
ll m=point;
if(K<B[0][index]) {
for(ll j=0;j<K-1;j++) {
place=P[place-1];
point+=C[place-1];
m=max(m,point);
}
ans.push_back(m);
}
else if(B[1][index]<=0) {
for(ll j=0;j<B[0][index]-1;j++) {
place=P[place-1];
point+=C[place-1];
m=max(m,point);
}
ans.push_back(m);
}
else {
ll maxroop=K/(B[0][index])*B[1][index];
place=i;
point=0;
m=0;
for(ll j=0;j<K%B[0][index];j++) {
place=P[place-1];
point+=C[place-1];
m=max(point,m);
}
maxroop+=m;
ll minroop=((K/(B[0][index]))-1)*B[1][index];
if((K/(B[0][index]))-1==0) {
place=P[i-1];
point=C[place-1];
m=point;
for(ll j=0;j<B[0][index]-2;j++) {
place=P[place-1];
point+=C[place-1];
m=max(point,m);
}
minroop+=m;
}
else {
place=i;
point=0;
m=0;
for(ll j=0;j<B[0][index];j++) {
place=P[place-1];
point+=C[place-1];
m=max(point,m);
}
minroop+=m;
}
ans.push_back(max(maxroop,minroop));
}
}
sort(all(ans));
cout<<ans.back()<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
typedef pair<int,int> P;
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 /gcd(a,b) * b;
}
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
int binary(int bina){
int ans = 0;
for (int i = 0; bina>0 ; i++)
{
ans = ans+(bina%2)*pow(10,i);
bina = bina/2;
}
return ans;
}
int main() {
int a,b;
cin >> a >> b;
if (a == 1 && b == 2) cout << 3 << endl;
if (a == 1 && b == 3) cout << 2 << endl;
if (a == 2 && b == 1) cout << 3 << endl;
if (a == 2 && b == 3) cout << 1 << endl;
if (a == 3 && b == 1) cout << 2 << endl;
if (a == 3 && b == 2) cout << 1 << endl;
} | 0 | 13,101,516 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a,b,c;
cin >>a >> b>> c;
if(c % gcd(a,b) == 0)cout << "YES" <<endl;
else cout << "NO" <<endl;
return 0;
} | #include<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
int main()
{
int i=0, count=1;
char num[1001];
std::vector<int> sum(10, 0);
cin>>num;
while (1)
{
if (strcmp(num, "0")==0)
break;
for (int j = 0; j < std::strlen(num); j++)
{
sum[i] += num[j] - '0';
}
if (++i==count*10)
{
count++;
sum.resize(count*10);
}
cin>>num;
}
for (int j = 0; j < i; j++)
cout<<sum[j]<<endl;
return 0;
} | 0 | 87,932,446 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N ;
cin >> N ;
map<long long , long long> A ;
for(int i = 0 ; i < N ; i++){
long long P ;
cin >> P ;
A[P]++ ;
}
long long X = 0 , Y = 0;
for(auto a : A){
if( a.second >= 2 && X <= a.first) {
Y = X ;
X = a.first ;
if( a.second >=4 && X<= a.first){
X = a.first;
Y = a.first ;
}
}
}
cout << X*Y << endl ;
} | #include <iostream>
#include <climits>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD 1000000007LL
int h,w;
int m;
set<pair<int, int>> t;
set<int> vt;
set<int> hr;
map<int, int> vn;
map<int, int> hn;
multimap<int, int> rvn;
multimap<int, int> rhn;
int main()
{
ll ans=0;
cin >> h >> w >> m;
for (int i=0; i<m; i++) {
int hi, wi;
cin >> hi >> wi;
t.insert(make_pair(hi, wi));
vt.insert(hi);
hr.insert(wi);
if (vn.count(hi) > 0) {
vn[hi]++;
} else {
vn[hi]=1;
}
if (hn.count(wi) > 0) {
hn[wi]++;
} else {
hn[wi]=1;
}
}
for (auto vit=vn.begin(); vit!=vn.end(); vit++) {
rvn.emplace(vit->second, vit->first);
}
for (auto hit=hn.begin(); hit!=hn.end(); hit++) {
rhn.emplace(hit->second, hit->first);
}
ans = rvn.rbegin()->first + rhn.rbegin()->first - 1;
for (auto vit=rvn.rbegin(); vit != rvn.rend() && vit->first == rvn.rbegin()->first; vit++) {
for (auto hit=rhn.rbegin(); hit != rhn.rend() && hit->first == rhn.rbegin()->first; hit++) {
auto fit=t.find(make_pair(vit->second, hit->second));
if (fit == t.end()) {
ans++;
cout << ans << endl;
return 0;
}
}
}
cout << ans << endl;
return 0;
} | 0 | 72,710,196 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N, M;
cin>>N>>M;
pair<int, int> ans[M];
int a=1, b=N;
map<int, int> amap;
for(int i=0;i<M;++i) {
ans[i] = mp(a, b);
amap[b-a]++;
amap[N-(b-a)]++;
a++;
b--;
while(amap[b-a]>0 || b-a==N-(b-a)) {
b--;
}
}
for(int i=0;i<M;++i) cout<<ans[i].fi<<" "<<ans[i].se<<endl;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s[n] = {};
for ( int i = 0 ; i < n ; i++ ) cin >> s[i];
for ( int i = 0 ; i < 26 ; i++ ) {
char a = i + 'a';
int b = 0 , c = 0;
for ( int j = 0 ; j < n ; j++ ) {
b = 0;
for ( int k = 0 ; k < s[j].length() ; k++ ) {
if ( s[j][k] == a ) b++;
}
if( j == 0 ) c = b;
c = min( b , c );
}
for ( int j = 0 ; j < c ; j++ ) cout << a;
}
} | 0 | 25,359,612 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for(int i = 0; i < N; ++i){
cin >> A[i];
}
int cnt = 0;
for(int i = 0; i < N; ++i){
int minj = i;
for(int j = i; j < N; ++j){
if(A[j] < A[minj]) minj = j;
}
if(i != minj){
++cnt;
swap(A[i], A[minj]);
}
}
for(int i = 0; i < N - 1; i++) cout << A[i] << " ";
cout << A[N - 1] << endl;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define IN(type, n) type n; cin >> n
void count_num(ll n, unordered_map<ll, ll> &count, unordered_map<ll, ll> &over_count) {
if (over_count.count(n)) over_count[n]++;
else {
count[n]++;
if (count[n] > 1) over_count[n] = count[n];
}
}
int main() {
ll MAX = 1000000;
vector<ll> min_div(MAX + 1, 1);
for (int i = 2; i <= MAX; ++i) {
if (min_div[i] == 1) {
for (int j = i; j <= MAX; j+= i) {
min_div[j] = i;
}
}
}
IN(ll, N);
vector<ll> A(N);
unordered_map<ll, ll> count;
unordered_map<ll, ll> over_count;
REP(i, N) {
IN(ll, A);
ll tmp_div = 1;
while(A != 1) {
if (tmp_div != min_div[A]) {
tmp_div = min_div[A];
count_num(tmp_div, count, over_count);
}
A /= tmp_div;
}
}
if (over_count.size() == 0) {
cout << "pairwise coprime" << endl;
return 0;
}
bool is_pairwise = true;
for (auto itr = over_count.begin(), itr_end = over_count.end(); itr != itr_end; ++itr) {
if (itr->second == N) {
cout << "not coprime" << endl;
return 0;
}
}
cout << "setwise coprime" << endl;
return 0;
} | 0 | 59,244,926 |
#include <algorithm>
#include <complex>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<long double> point;
int main() {
int n; cin >> n;
vector<point> v(n);
for (int i = 0; i < n; i++) {
int x, y; cin >> x >> y;
v[i] = point(x, y);
}
sort(v.begin(), v.end(), [](point& p, point& q) {
return arg(p) < arg(q);
});
long double ans = 0;
for (int i = 0; i < n; i++) {
point p(0, 0);
for (int j = 0; j < n; j++) {
p += v[(i + j) % n];
ans = max(ans, abs(p));
}
}
cout << fixed << setprecision(10) << ans << endl;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <bitset>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
static const int MAX = 100000;
vector<int> G[MAX];
vector<int> out;
int V[MAX];
int N;
int indeg[MAX];
void bfs(int s) {
queue<int> q;
q.push(s);
V[s] = 1;
while (!q.empty()) {
int u = q.front(); q.pop();
out.push_back(u);
rep(i, G[u].size()) {
int v = G[u][i];
indeg[v]--;
if (indeg[v] == 0 && V[v] == 0) {
V[v] = 1;
q.push(v);
}
}
}
}
void tsort(void) {
rep(i, N) {
V[i] = 0;
indeg[i] = 0;
}
rep(i, N) {
rep(j, G[i].size()) {
indeg[G[i][j]]++;
}
}
rep(i, N) {
if (indeg[i] == 0 && V[i] == 0) bfs(i);
}
}
int main(void) {
int M, s, t;
scanf("%d %d", &N, &M);
rep(i, M) {
scanf("%d %d", &s, &t);
G[s].push_back(t);
}
tsort();
rep(i, out.size()) printf("%d\n", out[i]);
return 0;
} | 0 | 2,544,268 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N;
cin >> N;
vec<ll> A(N + 1), S(N + 1), M(N + 1);
rep(i, N + 1) cin >> A[i];
S[N] = A[N];
for (int i = N - 1; i >= 0; --i)
S[i] = S[i + 1] + A[i];
rep(i, N + 1) {
if (i == 0)
M[i] = 1;
else
M[i] = min(M[i - 1] * 2, S[i]);
}
vec<ll> ans(N + 1);
ll a = 0;
rep(i, N + 1) {
if (i == 0)
ans[i] = M[i];
else {
ans[i] = min(M[i], (ans[i - 1] - A[i - 1]) * 2LL);
;
}
if (ans[i] < A[i]) {
cout << -1 << endl;
return 0;
}
a+=ans[i];
}
cout << a << endl;
} | #include <iostream>
using namespace std;
int main( void )
{
int n,s;
while( 1 ){
int ret = 0;
cin>>n>>s;
if( n==0 && s==0 ) break;
for( int i=0; i < (1<<10); i++ ){
int a=1,b=0,c=0;
for( int j=0; j<10; j++ ){
if( i & a ){ b += j; c++; }
a <<= 1;
}
if( c == n && b == s ) ret++;
}
cout << ret << endl;
}
return 0;
} | 0 | 93,833,237 |
#include <cstdio>
const int N = 9;
int main(){
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
printf("%dx%d=%d\n", i, j, i*j);
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
int main()
{
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
ll ans = 0, ind = 0;
while (m)
{
int amt = min(m, v[ind].second);
m -= amt;
v[ind].second -= amt;
ans += amt * v[ind].first;
if (!v[ind].second) ind++;
}
cout << ans << "\n";
} | 0 | 87,052,053 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int ans=a[0];
for(int i=1;i<n-1;i++){
if(abs(a[n-1]-2*ans)>abs(a[n-1]-2*a[i]))ans=a[i];
}
cout<<a[n-1]<<' '<<ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
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; }
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll n;
cin>>n;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
}
ll ans=0;
while(1){
vector<ll> b=a;
ll s=0;
rep(i,n){
s+=a[i]/n;
}
if(s==0){
cout<<ans<<endl;
return 0;
}
ans+=s;
rep(i,n){
b[i]=a[i]%n+s-a[i]/n;
}
swap(a,b);
}
return 0;
} | 0 | 5,110,441 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,fl=0 ; cin>>a>>b>>c ;
for(int x=1 ; x<=100000 ; x++)
{
if((b*x+c)%a==0) {fl=1 ; break ;}
}
if(fl) cout<<"YES"<<endl ;
else cout<<"NO"<<endl ;
} | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
int main(){
string s;
cin >> s;
ll iti=0,zero=0,s_size=s.size();
for(ll i = 0;i < s_size;i++){
if(s.at(i) == '1')
iti++;
else
zero++;
}
if(iti >= zero)
cout << zero * 2 << endl;
else
cout << iti * 2 << endl;
} | 0 | 92,734,832 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a==b && b==c && a==c){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int main()
{
string s; cin >> s;
reverse(ALL(s));
REP(i,4) reverse(ALL(divide[i]));
bool can = true;
for(int i = 0;i < s.size();){
bool can2 = false;
REP(j,4){
string d = divide[j];
if(s.substr(i,d.size())==d){
can2 = true;
i += d.size();
}
}
if(!can2){
can = false;
break;
}
}
if (can) cout << "YES" << endl;
else cout << "NO" << endl;
} | 0 | 55,734,359 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
int main() {
int M;
cin >> M;
vector<ll> d(M), c(M);
REP(i, M) {
cin >> d[i] >> c[i];
}
ll ans = 0;
REP(i, M) {
ans += c[i];
}
ans -= 1;
ll cnt = 0;
REP(i, M) {
cnt += d[i] * c[i];
}
cnt--;
ans += cnt / 9;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define MOD 1000000007
#define INF 1000000000
#define LLINF 1e18
void solve_abc_a() {
ll n, m;
ll a, b, d;
ll c;
ll h, w;
ll k;
string s, t;
ll l_ans = 0;
string s_ans = "NG";
ll l, r;
ll x[4], y[4];
cin >> x[0] >> y[0] >> x[1] >> y[1];
ll vx, vy;
vx = x[1] - x[0];
vy = y[1] - y[0];
x[2] = x[1] - vy;
y[2] = y[1] + vx;
x[3] = x[2] - vx;
y[3] = y[2] - vy;
cout << x[2] << " " << y[2] << " " << x[3] << " " << y[3] << "\n";
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
cout << setprecision(7);
solve_abc_a();
return 0;
} | 0 | 72,474,872 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll s; cin>>s;
ll x1=1e9, x2=1;
ll y2=(s+x1-1)/x1, y1=x1*y2-s;
cout<<0 <<" "<<0 <<" "<<x1 <<" "<<y1 <<" "<<x2 <<" "<<y2 <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
vector<int> v;
for(int i=0; i<4; i++){
int a=s/pow(10,3-i);
a%=10;
v.push_back(a);
}
for (int i=0 ; i<(1<<(3)); i++){
bitset<3> p(i);
int ans=v[0];
for (int j=0; j<3; j++){
if(p[j]==1){
ans += v[j+1];
}
else{
ans -= v[j+1];
}
}
if (ans==7){
cout << v[0];
for(int i=0; i<3; i++){
if(p[i]==1) cout << "+";
else cout << "-" ;
cout << v[i+1];
}
cout << "=7";
break;
}
}
} | 0 | 20,452,949 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
int l, r;
int L = 0, R = N;
for(int i = 0; i < M; i++) {
cin >> l >> r;
L = max(L,l);
R = min(R,r);
}
cout << (R - L >= 0)*(R - L + 1) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI=acos(-1.0);
int N,P; string S;
void input()
{
cin>>N>>P>>S;
}
void solve()
{
vi count(P,0);
ll ans=0;
if(P==2 || P==5){
for(ll i=0;i<N;++i){
if((S[i]-'0')%P==0) ans+=i+1ll;
}
}
else{
count[0]++;
reverse(S.begin(), S.end());
int k=1;
int sum=0;
for(int i=0;i<N;++i){
sum+=((S[i]-'0')*k)%P; sum%=P;
count[sum]++;
k*=10; k%=P;
}
for(int i=0;i<P;++i) {
ans+=(ll)count[i]*(count[i]-1)/2;
}
}
cout<<ans<<endl;
}
int main()
{
cin.tie();
ios::sync_with_stdio(false);
input();
solve();
return 0;
} | 0 | 79,659,881 |
#include <iostream>
#include <algorithm>
using namespace std;
static const int N = 101;
int main()
{
int n;
int p[N],m[N][N];
cin>>n;
for (int i = 1; i <= n; i++)
{
cin>>p[i-1]>>p[i];
m[i][i] = 0;
}
for (int l = 2; l <= n; l++)
{
for (int i = 1; i <= n-l+1; i++)
{
int j = i+l-1;
m[i][j] = (1<<21);
for (int k = i; k <= j-1; k++)
{
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j]);
}
}
}
cout<<m[1][n]<<endl;
return 0;
} | #pragma GCC optimize("O3")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DEBUG
#define fi first
#define se second
#define pqueue priority_queue
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define int long long
#define mk(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ull> vull;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector< vector<ll> > vvll;
typedef vector<char> vc;
const int INF = 1e9 + 228;
const ll INFLL = 1e18;
const ll MOD = 1e9 + 7;
const ld eps = 1e-6;
const ld eps2 = 1e-9;
const ll MOD2 = 998244353;
const ll dosz = 5e5;
const ll SZ = (1<<18);
const ld PI = atan2l(0, -1);
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void solve(){
int h, w, n;
cin >> h >> w >> n;
set<pii> points;
for(int i=0; i<n; i++){
int a, b;
cin >> a >> b;
points.insert(make_pair(a, b));
}
set<pii> used;
vi ans(10, 0);
for(pii i:points){
for(int x=-2; x<=0; x++){
for(int y=-2; y<=0; y++){
int curx = i.first+x, cury = i.second+y;
if(!(curx>=1 && cury>=1 && (curx+2)<=h && (cury+2)<=w))
continue;
if(used.count(make_pair(curx, cury)))
continue;
used.insert(make_pair(curx, cury));
int cnt = 0;
for(int i1=0; i1<3; i1++){
for(int i2=0; i2<3; i2++){
cnt += points.count(make_pair(curx+i1, cury+i2));
}
}
ans[cnt]++;
}
}
}
int sum = 0;
for(int i=1; i<10; i++)
sum += ans[i];
ans[0] = (h-2)*(w-2)-sum;
for(int i:ans)
cout << i << endl;
}
signed main(){
fast_io();
srand(time(NULL));
cout << fixed << setprecision(12);
int q = 1;
while(q--)
solve();
} | 0 | 28,392,740 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
const double PI = acos(-1);
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
using ll =long long;
const int mod = 1000000007;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
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);
};
bool Array_check(ll y, ll x,ll d,ll w) {
if (x < 0 || x >= w || y<0 || y>=d) {
return false;
}
else {
return true;
}
}
int main() {
ll r, d, x;
cin >> r >> d >> x;
rep(i, 10) {
x = r * x - d;
cout << x<<endl;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, m;
cin >> n;
vector<string> A(n);
for (int i = 0; i < n; i++)cin >> A.at(i);
cin >> m;
vector<string> B(m);
for (int i = 0; i < m; i++)cin >> B.at(i);
vector<string> name(m+n, " ");
vector<int> mny(m+n, 0);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (A.at(i) == name.at(j))
{
mny.at(j)++;
break;
}
else if (name.at(j) == " ")
{
name.at(j) = A.at(i); mny.at(j)++;
break;
}
}
}
for (int i = 0; i < m; i++)
{
for (int j = 0; j < m; j++)
{
if (B.at(i) == name.at(j))
{
mny.at(j)--;
break;
}
else if (name.at(j) == " ")
{
name.at(j) = B.at(i); mny.at(j)--;
break;
}
}
}
int max = 0;
for (int i = 0; i < m+n; i++)
{
if (max < mny.at(i)) max = mny.at(i);
}
cout << max << endl;
} | 0 | 43,291,952 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
ll g=1;
for(int i=0;i<n;i++)
{
ll t;cin>>t;
g=lcm(g,t);
}
cout<<g<<"\n";
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
vector<string> selection_sort(vector<string> s){
int n = s.size();
vector<int> a;
REP(i, n)
a.push_back(atoi(s[i].substr(1, 1).c_str()));
REP(i, n){
int mini = i;
for(int j = i; j < n ; j++){
if(a[j] < a[mini])
mini = j;
}
if(i != mini){
swap(a[i], a[mini]);
swap(s[i], s[mini]);
}
}
return s;
}
vector<string> bubble_sort(vector<string> s) {
int n = s.size();
vector<int> a;
REP(i, n)
a.push_back(atoi(s[i].substr(1, 1).c_str()));
REP(i, n)
for(int j = n - 1; j > i; j--)
if(a[j] < a[j-1]){
swap(a[j], a[j-1]);
swap(s[j], s[j-1]);
}
return s;
}
int find(vector<string> target, string query){
int i = 0;
vector<string>::iterator iter = target.begin();
while(iter != target.end()){
if (*iter == query)
break;
i++;
iter++;
}
return i;
}
int main() {
int n;
cin >> n;
vector<string> a;
string str;
REP(i, n) {
cin >> str;
a.push_back(str);
}
vector<string> b, s;
b = bubble_sort(a);
s = selection_sort(a);
REP(i, n-1) {
cout << b[i] << " ";
}
cout << b[n-1] << endl << "Stable" << endl;
REP(i, n-1) {
cout << s[i] << " ";
}
cout << s[n-1] << endl;
bool stable = true;
REP(i, n){
REP(j, i){
if((s[j].substr(1,1) == s[i].substr(1,1)) && ((find(a, s[j]) - find(a, s[i])) > 0)){
stable = false;
break;
}
}
}
if(stable)
cout << "Stable" << endl;
else
cout << "Not stable" << endl;
return 0;
} | 0 | 47,598,029 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin >> s >> t;
for(int i=0;i<t.size();++i)
{
cout << s.at(i) << t.at(i);
}
if(t.size()<s.size()) cout << s.at(s.size()-1);
return 0;} | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
struct vec
{
int64_t x,y;
int quatr() const
{
if (x>0 && y>=0) return 0;
else if (x<=0 && y>0) return 1;
else if (x<0 && y<=0) return 2;
else if (x>=0 && y<0) return 3;
else return 666;
}
bool operator<(const vec& v) const
{
int l = quatr();
int r = v.quatr();
if (l == r) return x*v.y-y*v.x > 0;
else return l < r;
}
vec operator+(const vec& v) const
{
return {x+v.x, y+v.y};
}
vec& operator+=(const vec& v)
{
x += v.x;
y += v.y;
return *this;
}
int64_t len() const
{
return x*x + y*y;
}
} V[100];
int main()
{
std::ios_base::sync_with_stdio(0);
int n;
std::cin >> n;
int64_t result = 0;
for (int i=0;i<n;++i) std::cin >> V[i].x >> V[i].y;
std::sort(V, V+n);
for (int s=0;s<n;++s)
{
vec v = {0, 0};
for (int l=0;l<n;++l)
{
v += V[(s+l)%n];
result = std::max(result, v.len());
}
}
std::cout << std::setprecision(20) << std::fixed << sqrtl(result);
return 0;
} | 0 | 38,904,014 |
#include <bits/stdc++.h>
#define N 100005
using namespace std;
int n;
vector<int> g[N];
int dfs(int u, int fa) {
int sg = 0;
for(auto v : g[u]) {
if(v == fa) continue;
sg ^= dfs(v, u) + 1;
}
return sg;
}
int main() {
scanf("%d", &n);
for(int i = 1, u, v; i < n; ++i) {
scanf("%d %d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
puts(dfs(1, 0) ? "Alice" : "Bob");
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, m, a[100005] = {}, b[100005] = {}, c, y = 0, z = 0;
string s;
cin >> n >> m;
while (m--) {
cin >> c >> s;
if (s == "AC") {
if (!a[c]) y++;
a[c] = 1;
} else {
if (!a[c]) b[c]++;
}
}
for (int i = 1; i <= n; i++) if (a[i]) z += b[i];
cout << y << ' ' << z;
} | 0 | 94,140,382 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int n, k; cin >> n >> k;
vector<int> p;
rep(i, n) {
int tmp; cin >> tmp;
p.push_back(tmp);
}
sort(all(p));
int ans = 0;
rep(i, k) ans += p[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x,y;
cin>>x>>y;
if(x>0&&y==0){
cout<<x+1<<endl;
}
else if(x<0&&y==0){
cout<<abs(x)<<endl;
}
else if(x>=0&&y>=0){
if(x<=y)
cout<<y-x<<endl;
else
cout<<x-y+2<<endl;
}else if(x<0&&y<0){
if(x<=y)
cout<<abs(x)-abs(y)<<endl;
else
cout<<abs(y)-abs(x)+2<<endl;
}else{
if(abs(x)<=abs(y))
cout<<(abs(y)-abs(x)+1)<<endl;
else
cout<<(abs(x)-abs(y)+1)<<endl;
}
return 0;
} | 0 | 76,321,535 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
int ans = 0;
bool flag = false;
while(!flag){
REP(i, N){
int cnt = A[i]/N;
A[i] %= N;
ans += cnt;
REP(j, N){
if(i == j) continue;
A[j] += cnt;
}
if(i == N-1){
REP(j, N){
if(A[j] >= N) break;
if(j == N-1) flag = true;
}
}
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define FOREACHr(it, l) for (auto it = l.rbegin(); it != l.rend(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define PB push_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define SQ(x) ((x)*(x))
const double pi=acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int,int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddx[4] = {1,0,-1,0};
const int ddy[4] = {0,1,0,-1};
int64 powr(int64 x,int64 y,int64 p)
{
int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0){
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
void in_o(){
#ifndef LOCAL
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
cinsc;
}
int main(){
int h,w;
cin>>h>>w;
string s[h];
FOR(i,0,h){
cin>>s[i];
}
FOR(i,0,h){
FOR(j,0,w){
int cnt=0;
if(s[i][j]=='.') continue;
FOR(k,0,4){
int x=i+ddx[k];
int y=j+ddy[k];
if(s[x][y]=='#') cnt++;
}
if(!cnt) return cout<<"No"<<endl,0;
}
}
cout<<"Yes"<<endl;
return 0;
} | 0 | 53,126,338 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
if(n<26){
map<char,int> mp;
char a='a';
for(int i=0;i<26;++i){
mp['a'+i]++;
}
for(int i=0;i<n;++i){
mp[s[i]]++;
}
bool ok=true;
for(auto p : mp){
if(p.second==1 && ok==true){
s=s+p.first;
ok=false;
}
}
cout << s << endl;
return 0;
}else{
if(s=="zyxwvutsrqponmlkjihgfedcba"){
cout << "-1" << endl;
return 0;
}
string ans;
string x=s;
next_permutation(x.begin(),x.end());
for(int i=0;i<26;++i){
if(s[i]==x[i]){
ans+=x[i];
}else{
ans+=x[i];
break;
}
}
cout << ans << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int x,n,i,ii,iii,answer=0,j,jj,jjj;
while(1){
cin>>n>>x;
answer=0;
if(x==0 && n==0){
break;
}
for(i=1;i<=n;i++){
for(ii=1;ii<=n;ii++){
for(iii=1;iii<=n;iii++){
if(i==ii || i==iii || ii==iii){}
else if(i<ii && ii<iii && i+ii+iii==x){answer++;}
}
}}
cout<<answer<<endl;
}
return 0;
} | 0 | 56,168,605 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
const int N = 200200;
using namespace std;
int n;
int a[N];
set < pair < pair < int, int >, int > > s;
bool can(int m)
{
s.clear();
s.insert({{1, a[1]}, 1});
for(int i = 2; i <= n; i++){
if((--s.end())->fi.se < a[i]){
s.insert({{(--s.end())->fi.se + 1, a[i]}, 1});
continue;
}
while((--s.end())->fi.se > a[i]){
if((--s.end())->fi.fi > a[i]){
s.erase(--s.end());
continue;
}
auto p = *(--s.end());
s.erase(--s.end());
p.fi.se = a[i];
s.insert(p);
}
if((--s.end())->se < m){
auto p = *(--s.end());
s.erase(--s.end());
if(p.fi.fi != p.fi.se){
s.insert({{p.fi.fi, p.fi.se - 1}, p.se});
}
p.fi.fi = p.fi.se;
p.se += 1;
s.insert(p);
continue;
}
int L = (--s.end())->fi.fi;
int R = (--s.end())->fi.se;
s.erase(--s.end());
while(!s.empty() && (--s.end())->se == m){
L = (--s.end())->fi.fi;
s.erase(--s.end());
}
if(s.empty()){
return false;
}
{
auto p = *(--s.end());
s.erase(--s.end());
if(p.fi.fi != p.fi.se){
s.insert({{p.fi.fi, p.fi.se - 1}, p.se});
}
p.fi.fi = p.fi.se;
p.se += 1;
s.insert(p);
}
s.insert({{L, R}, 1});
}
return true;
}
int main()
{
ios_base::sync_with_stdio(0);
cin >> n;
int can1 = 1;
for(int i = 1; i <= n; i++){
cin >> a[i];
if(i > 1 && a[i - 1] >= a[i]){
can1 = 0;
}
}
if(can1){
cout << 1 << "\n";
return 0;
}
int l = 2, r = n;
while(l < r){
int m = (l + r) / 2;
if(can(m)){
r = m;
} else{
l = m + 1;
}
}
cout << l << "\n";
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,an=INT_MAX,s;cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int k=-100;k<=100;k++)
{s=0;
for(int i=0;i<n;i++)
s+=(a[i]-k)*(a[i]-k);
an=min(an,s);
}
cout<<an<<endl;
} | 0 | 49,142,860 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "O3"
#define rep(i,a,n) for(long long i=a; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const double EPS = 1e-9;
const ll powll = 1LL<<1;
int main(void){
int m, nmin, nmax;
while(1){
cin >> m >> nmin >> nmax;
if(m == 0) break;
int ans = 0;
int dif = 0;
int p[m];
rep(i,0,m){
cin >> p[i];
}
sort(p,p+m);
rep(i,nmin, nmax+1){
int pmin = MOD;
int pmax = 0;
rep(j,0,m-i){
pmax = max(pmax,p[j]);
}
rep(j,m-i, m){
pmin = min(pmin, p[j]);
}
if((pmin-pmax) >= dif && i > ans){
dif = pmin-pmax;
ans = i;
}
}
cout << ans << "\n";
}
} | #include<bits/stdc++.h>
using namespace std;
class disjoint_set {
private:
vector<int> id;
vector<int> rank;
public:
disjoint_set(int size) {
id = vector<int>(size);
rank = vector<int>(size);
for (size_t i = 0; i < size; i++) {
id[i] = i;
}
}
int size() {
return id.size();
}
int getRoot(int x) {
if (x != id[x]) {
id[x] = getRoot(id[x]);
}
return id[x];
}
bool same(int x, int y) {
return getRoot(x) == getRoot(y);
}
void merge(int x, int y) {
int xRoot = getRoot(x);
int yRoot = getRoot(y);
if (xRoot == yRoot) return;
if (rank[xRoot] < rank[yRoot]) {
id[xRoot] = yRoot;
} else if (rank[xRoot] > rank[yRoot]) {
id[yRoot] = xRoot;
} else {
id[xRoot] = yRoot;
rank[yRoot]++;
}
}
};
int main() {
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
disjoint_set s(n);
for (size_t i = 0; i < q; i++) {
int t,x, y;
cin >> t >> x >> y;
if (t == 0) s.merge(x, y);
else cout << s.same(x, y) << endl;
}
} | 0 | 18,235,402 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int k;
cin >> k;
int a,b;
cin >> a >> b;
if(a%k==0||b%k==0){
cout << "OK" << endl;
}
else if(a/k<b/k){
cout << "OK" << endl;
}
else{
cout << "NG" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
int w;
cin >> w;
int tmp_num = 0;
while(1) {
if ( tmp_num > s.length() - 1 ) {
break;
}
cout << s[tmp_num];
tmp_num += w;
}
cout << endl;
return 0;
} | 0 | 9,312,460 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
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;}
const ll INF=1e9+7;
int main(){
ll n,m;
cin >> n >> m;
vector<ll> a(n),b(n),c(m),d(m);
rep(i,n){
cin >> a[i] >> b[i];
}
rep(i,m){
cin >> c[i] >> d[i];
}
rep(i,n){
ll dist=INF;
ll pos=-1;
rep(j,m){
ll buf=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(buf<dist){
dist=buf;
pos=j;
}
}
cout << pos+1 << endl;
}
return 0;
} | #include<algorithm>
#include<iostream>
#define INF -11111111
using namespace std;
int main(){
int n;
int a[5555];
while(1){
int ret = INF,sum;
cin >> n;
if(!n)break;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
sum = 0;
for(int j=i;j<n;j++){
sum += a[j];
ret = max( ret , sum );
}
}
cout << ret << endl;
}
} | 0 | 29,592,479 |
#include <iostream>
using namespace std;
int main() {
int a,b;
scanf("%d%d",&a,&b);
int x=b,y=a,a1=a,b1=b;
while(x!=1)
{
a=a*10+a1;
--x;
}
while(y!=1)
{
b=b*10+b1;
--y;
}
int m=max(a,b);
printf("%d",m);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
void solve(int test_case) {
ll n,k;
cin>>n>>k;
map<int,ll> m;
while(n--) {
int a,b;
cin>>a>>b;
m[a]+=b;
}
ll cnt = 0;
for(auto a:m) {
cnt+=a.S;
if(cnt>=k) {
cout<<a.F;
break;
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
} | 0 | 75,217,525 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
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(b<a){a=b;return true;}return false;}
#define int ll
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os<<"("<<p.first <<", "<<p.second<<")";
return os;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
map<int,int> mp,mpp;
rep(i,n){
int a;cin>>a;
mp[a]++;
}
for(auto p:mp) mpp[p.second]++;
vector<pair<int,int>> v;
v.push_back(make_pair(INF,0));
for(auto p:mpp)v.push_back(p);
sort(ALL(v));reverse(ALL(v));
vector<int> ans(n+1);
int var=(int)mp.size();
ans[var]=v.back().first;
for(int i=var+1;i<=n;i++) ans[i]=0;
for(int k=var-1;k>1;k--){
auto p=v.back();v.pop_back();
int rem=p.first;
if(p.second>1)v.push_back(make_pair(p.first,p.second-1));
while(rem){
auto pn=v.back();v.pop_back();
int need=(v.back().first-pn.first)*pn.second;
if(rem>=need){
rem-=need;
auto pnn=v.back();v.pop_back();
pnn.second=pnn.second+pn.second;
v.push_back(pnn);
}else{
pair<int,int> fs=make_pair(pn.first+rem/pn.second+1,rem%pn.second);
if(fs.second!=0){
if(v.back().first==fs.first){
fs.second+=v.back().second;v.pop_back();
v.push_back(fs);
}else{
v.push_back(fs);
}
}
pair<int,int> sc=make_pair(pn.first+rem/pn.second,pn.second-rem%pn.second);
if(v.back().first==sc.first){
sc.second+=v.back().second;v.pop_back();
v.push_back(sc);
}else{
v.push_back(sc);
}
rem=0;
}
}
ans[k]=v.back().first;
}
ans[1]=n;
for(int i=1;i<=n;i++) cout<<ans[i]<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod = 998244353;
vector<int> fac(300001);
vector<int> ifac(300001);
long long fpow(long long a,long long n){
long long ret=1;
if(n==1) return a;
if(n%2==0) {
ret = fpow(a*a%mod, n/2) %mod ;
}else {
ret = (a%mod)*fpow(a*a%mod, n/2) %mod;
}
return ret %mod;
}
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;
}
const double PI=3.14159265358979323846;
int dp[100][100];
int tmp[100][100];
signed main(){
int n;
cin >> n;
int w[n];
rep(i, n) {
cin >> w[i];
}
int a = 0;
int b = 0;
int ans = MX;
rep(i,n) {
a = 0;
b = 0;
rep(j, n) {
if(j<=i) a+=w[j];
else b+=w[j];
}
ans = min(abs(a-b), ans);
}
cout << ans << endl;
return 0;
} | 0 | 6,891,928 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
int a,b,x;
cin>>a>>b>>x;
if(a>x||a+b<x) {
cout<<"NO";
}else cout<<"YES";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
} | #include <iostream>
using namespace std;
char d[1<<22];
unsigned char key[256];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, hash;
char com[8], str[16], *p;
key['A']=0;
key['C']=1;
key['G']=2;
key['T']=3;
cin>>n;
for(int i=0; i<n; i++) {
cin>>com>>str;
hash=1;
p=str;
while(*p) hash = (hash<<2)+key[(unsigned)*(p++)];
if(com[0]=='i') {
d[hash>>3] |= 1<<(hash&7);
} else {
if(d[hash>>3] & (1<<(hash&7)) ) cout<<"yes\n";
else cout<<"no\n";
}
}
return 0;
} | 0 | 65,948,160 |
#include <iostream>
using namespace std;
int main (){
int a,b,c,k,n=0;
cin >> a >> b >> c >> k;
while (!(a<b)){
b*=2;
n++;
}
while (!(b<c)){
c*=2;
n++;
}
if (k>=n) cout << "Yes";
else cout << "No";
} | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define rep(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000000000000
#define MAX 200001
#define MOD 1000000007
template <typename T > inline string toString(const T &a) {ostringstream oss; oss << a; return oss.str();};
int main(){
int N, K;
ll res = 0;
cin >> N >> K;
deque<int> dq;
for(int i = 0; i < N; i++){
int v;
cin >> v;
dq.push_back(v);
}
for(int i = 0; i <= K; i++){
for(int j = 0; j <= K; j++){
if(i + j > K || i + j > N) continue;
auto dq_copy = dq;
int re = K - i - j;
vector<int> hou;
int idx = 0;
while(i != idx){
hou.push_back(dq_copy.front());
dq_copy.pop_front();
idx++;
}
idx = 0;
while(j != idx){
hou.push_back(dq_copy.back());
dq_copy.pop_back();
idx++;
}
ll ans = 0;
sort(hou.begin(), hou.end());
int s = hou.size();
for(int k = 0; k < s; k++){
if(hou[k] >= 0 || re == 0) ans += hou[k];
else re--;
}
res = max(res, ans);
}
}
cout << res << endl;
} | 0 | 79,756,817 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) for(ll i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(ll i=0; i<num; i++){ cout<<v[i]; if(i!=num-1) cout<<" ";}
cout << endl;
}
template <typename T>
void print_pairvec(const T &_pair, ll num=0){
cout << endl; for(pair<ll, int> x: _pair){ cout << x.first << " " << x.second << endl;}
}
template <typename T>
void print_vec2(const vector<vector<T>>& v){
cout << endl; cout << " ";
for(ll i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(ll i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(ll j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";
}
cout << "\x1B[0m" << endl;
}
}
int f(int n){
if(n%2 ==0) return n/2;
else return 3*n + 1;
}
int main(){
int s;
cin >> s;
map<int, int> mp;
mp[s]++;
int ans = 1;
while(true){
ans++;
s = f(s);
if(mp[s] != 0) break;
mp[s]++;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int main(){
int N,L;
cin>>N>>L;
vector<int> a(N);
REP(i,N) cin>>a[i];
bool ok=false;
int idx;
REP(i,N-1){
int l=a[i]+a[i+1];
if(l>=L){
idx=i;
ok=true;
break;
}
}
if(ok){
cout<<"Possible"<<endl;
REP(i,idx) cout<<i+1<<endl;
REPD2(i,N-2,idx) cout<<i+1<<endl;
cout<<idx+1<<endl;
}else{
cout<<"Impossible"<<endl;
}
} | 0 | 57,793,688 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int len;
cin >> len;
long long ans = 0;
for(int i = 1; i < len; i++)
ans += i;
cout << ans;
} | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int t;
int a,x;
cin>>a>>x;
int ans=2*x-a;
cout<<ans<<endl;
return 0;
} | 0 | 72,352,371 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double money = 100;
int n;
cin >> n;
for(int i=0;i<n;++i){
money *= 1.05;
money = ceil(money);
}
cout << (int)(money*1000) << endl;
} | #include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deque>
#include <numeric>
using namespace std;
#define mod 1000000007
int main()
{
int n;
cin >> n;
double t[110] = {};
double v[110] = {};
for(int i = 1; i <= n; i++){
cin >> t[i];
t[i] += t[i - 1];
}
t[n + 1] = t[n];
for(int i = 1; i <= n; i++){
cin >> v[i];
}
double ans = 0.0;
double beforev = 0.0;
for(double i = 0.5; i <= t[n]; i += 0.5)
{
double nowv = 200000.0;
for(int j = 0; j <= n + 1; j++){
double tmpv = 0.0;
if(j == 0) tmpv = v[j] + i;
else if(i < t[j - 1]) tmpv = v[j] + t[j - 1] - i;
else if(i <= t[j]) tmpv = v[j];
else tmpv = v[j] + i - t[j];
nowv = min(nowv, tmpv);
}
ans += (beforev + nowv) * 0.5 / 2.0;
beforev = nowv;
}
printf("%.10f\n", ans);
} | 0 | 39,261,696 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, k, s;
cin >> n >> k >> s;
vector<int> a(n);
if (s == (int)1e9) {
rep(i, n) {
if (i < k) a[i] = s;
else a[i] = 1;
}
} else {
rep(i, n) {
if (i < k) a[i] = s;
else a[i] = s + 1;
}
}
printf("%d", a[0]);
for (int i = 1; i < n; ++i) printf(" %d", a[i]);
printf("\n");
return 0;
} | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int type_ref, type_mic, type_dis;
cin >> type_ref >> type_mic >> type_dis;
vector<int> price_ref(type_ref);
int mp_ref = 100100;
rep(i, type_ref)
{
cin >> price_ref[i];
mp_ref = min(mp_ref, price_ref[i]);
}
vector<int> price_mic(type_mic);
int mp_mic = 100100;
rep(i, type_mic)
{
cin >> price_mic[i];
mp_mic = min(mp_mic, price_mic[i]);
}
int min_amount = mp_ref + mp_mic;
rep(i, type_dis)
{
int target_ref, target_mic, discount;
cin >> target_ref >> target_mic >> discount;
if (target_ref > type_ref || target_mic > type_mic) continue;
int _min_amount = price_ref[target_ref-1] + price_mic[target_mic-1] - discount;
min_amount = min(min_amount, _min_amount);
}
cout << min_amount << endl;
return 0;
} | 0 | 76,551,939 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
vector<int> data(n + 1, 0);
for (int i = 1 ; i <= n ; i++)
cin >> data[i], data[i]--;
unordered_map<int, int> cnt;
int sum1 = 0, sum2 = 0; LL ans = 0;
for (int i = 0 ; i <= n ; i++) {
sum1 += data[i];
sum1 %= k;
if (i - k >= 0) {
sum2 += data[i - k];
sum2 %= k;
cnt[sum2]--;
}
ans += cnt[sum1];
cnt[sum1]++;
}
cout << ans << '\n';
} | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N=2e5+10;
const int mod=1e9+7;
ll f(ll x)
{
if(x%4==0)
{
return x;
}
if(x%4==1)
{
return 1;
}
if(x%4==2)
{
return x+1;
}
if(x%4==3)
{
return 0;
}
}
int main()
{
ll a,b;
cin>>a>>b;
ll ans=f(a-1)^f(b);
cout<<ans<<endl;
return 0;
} | 0 | 1,760,105 |
#include<stdio.h>[
int main (){
int a,b,c;
scanf("%d%d%d",&a, &b, &c);
if(a < b && b < c) printf("Yes\n");
else printf("No\n");
return 0;
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
char ans[510][510];
signed main() {
string pat = "RYGB";
int H, W, d; cin >> H >> W >> d;
rep(i,0,H) {
rep(j,0,W) printf("%c", pat[ 2*( ((i+j)/d)%2 ) + ((i-j+510*d)/d)%2]);
cout << endl;
}
return 0;
} | 0 | 9,068,945 |
#include <bits/stdc++.h>
using namespace std;
const int Mx = 1 << 17;
vector<int> N[Mx];
bool DFS(int v, int p = -1) {
int c = 0;
for(int u : N[v])
if(u != p)
c += DFS(u, v);
if(c == 0) return 1;
if(c == 1) return 0;
cout << "First";
exit(0);
}
int main() {
int n; cin >> n;
int m = 0;
for(int i = 1; i < n; i++) {
int u, v; cin >> u >> v;
N[v].push_back(u);
N[u].push_back(v);
if(N[v].size() > N[m].size()) m = v;
if(N[u].size() > N[m].size()) m = u;
}
cout << (DFS(m) ? "First" : "Second");
} | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod = 1e9+7;
#define ll long long
char a[110][110];
int dp[110][110];
signed main() {
int h, w;
cin >> h>>w;
rep(i,h+2) rep(j, w+2) a[i][j]='.';
FOR(i,1,h+1) {
string s;
cin>>s;
FOR(j,1,w+1) {
a[i][j]= s[j-1];
}
}
FOR(j,1,w+2) {
dp[1][j]=dp[1][j-1]+((a[1][j]!=a[1][j-1])?1:0);
dp[j][1]=dp[j-1][1]+((a[j][1]!=a[j-1][1])?1:0);
}
FOR(i,2,h+1) {
FOR(j,2,w+1) {
int ii = ((a[i-1][j]!=a[i][j])?1:0);
int jj = ((a[i][j-1]!=a[i][j])?1:0);
dp[i][j]=min(dp[i-1][j]+ii,dp[i][j-1]+jj);
}
}
int ans = dp[h][w] + ((a[h][w+1]!=a[h][w])?1:0);
cout << ans/2 << endl;
return 0;
} | 0 | 56,486,496 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push
#define lld long long int
#define ins insert
#define adv advance
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl vector<long long int >
#define vpll vector< pair<lld ,lld> >
#define vvl vector<vector<lld> >
#define pll pair <lld,lld>
#define modA(cccc,bbbb ,p) (((cccc+bbbb)%p+p)%p)
#define modS(cccc,bbbb ,p) (((cccc-bbbb)%p+p)%p)
#define modM(cccc,bbbb ,p) ((((cccc%p)*(bbbb%p))%p+p)%p)
long long int modp(lld a,lld p,lld n)
{
lld d[100];
lld i,j,k,l;
if(n==0) return 1;
for(i=0;n>=1;i++)
{
d[i]=n%2;
n/=2;
}
l=i;
long long int e=1;
if(d[0]==1) e*=(a%p);
for(i=1;i<l;i++)
{
a*=a;
a=a%p;
if(d[i]==1)
{
e*=a;
e=e%p;
}
}
return e%p;
}
lld modInverse(lld n, lld p)
{
return modp(n, p, p-2);
}
lld p1=1e9 + 7,p2=998244353;
lld l,r,mid,ans;
lld n,i,j,k,g,m;
lld x,y,n1,n2,h,z,c;
lld aa=1;
lld ss;
void solve()
{
cin>>n>>k;
ans=1;
n-=k;
while(n>=1)
{
n-=(k-1);
ans+=1;
}
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lld t=1;
lld ans=0;
for(int i=0;i<t;i++)
{
solve();
}
return 0;
} | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int main() {
int n, m;
while (cin >> n >> m && n){
vector<P> a(n);
REP(i,n){
int d, p;
scanf("%d %d", &d, &p);
a[i] = make_pair(-p, d);
}
sort(a.begin(),a.end());
int ans = 0;
REP(i,n){
if (m > a[i].second){
m -= a[i].second;
}else{
a[i].second -= m;
m = 0;
ans -= a[i].second*a[i].first;
}
}
cout << ans << endl;
}
return 0;
} | 0 | 92,858,491 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin >> n >> m;
int a[n];
int sum = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
int ans = 0;
for(int i = 0; i < n; i++){
if(a[i] * (4*m) >= sum){
ans++;
}
}
if(ans >= m){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,l,r) for(ll i=(l); i<(r); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int inf = 1001001001;
const ll mod = 1000000007;
using pp=pair<ll,ll>;
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_): par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool same(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
ll modpow(ll x, ll n) {
x = x%mod;
if(n==0) return 1;
else if(n%2==1) {
return (x*modpow(x, n-1))%mod;
}
else return modpow((x*x)%mod, n/2)%mod;
}
ll com(ll n, ll k) {
ll x = 1;
for(int i=n-k+1; i<=n; i++) {
x = x*i%mod;
}
ll y = 1;
for(int i=1; i<=k; i++) {
y = y*i%mod;
}
y = modpow(y, mod-2);
return x*y%mod;
}
bool is_prime(const unsigned n){
switch(n){
case 0:
case 1: return false;
case 2:
case 3: return true;
}
if(n % 2 == 0 || n % 3 == 0) return false;
for(unsigned i = 5; i * i <= n; i += 6) {
if(n % i == 0) return false;
if(n % (i+2) == 0) return false;
}
return true;
}
int digsum(int n) {
int res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
vector<ll> divisor(ll n){
vector<ll> ret;
for(ll i = 1 ; i*i <= n ; i++){
if(n%i == 0){
ret.push_back(i);
if(i*i != n) ret.push_back(n/i);
}
}
sort(ret.begin(),ret.end());
return ret;
}
int main(){
ll n;
cin >> n;
vector<ll> a={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a[n-1] << endl;
} | 0 | 41,849,671 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
vector<int> v(n);
for(int i=0; i<n; i++) cin >> v[i];
sort(v.begin(), v.end());
int a=v[0], b=v[n-1];
int max = v[0]+k-v[n-1];
for(int i=1; i<n; i++) {
if(v[i]-v[i-1]>max) {
max = v[i]-v[i-1];
a = v[i], b = v[i-1];
}
}
if(a==v[0] && b==v[n-1]) cout << b-a << endl;
else cout << b+k-a << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie();
int n, m;
cin>>n>>m;
int a[n];
int total = 0;
for(int i = 0; i < n; i++){
cin>>a[i];
total +=a[i];
}
int div = 4*m;
int k = 0;
int temp;
if(total%div == 0)
temp = total/div;
else
{
temp = total/div + 1;
}
for(int i = 0; i < n ;i++){
if(a[i] >= temp)
k++;
}
if(k >= m) cout<<"Yes";
else cout<<"No";
return 0;
} | 0 | 65,541,517 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
vector<ll> h(n);
rep(i,n) cin >> h[i];
sort(h.begin(),h.end());
ll ans = 0;
for (int i = 0; i < n-k; i++) {
ans += h[i];
}
cout << ans << endl;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
int ans = 0;
rep(i, N - 1) {
if (a[i] == a[i + 1]) {
ans++;
a[i + 1] = 101 + i;
}
}
cout << ans << "\n";
} | 0 | 89,150,227 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << "\n";
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n; cin >> n;
int ans = 1;
while(ans <= n) {
ans *= 2;
}
print(ans / 2);
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int m,f,r;
int num = 0;
string grade;
while(1){
cin >> m >> f >> r;
if(m == -1 && f == -1 && r ==-1) break;
if(m + f < 30 || m == -1 || f == -1) grade += 'F';
else if(m + f >= 80) grade += 'A';
else if(m + f >=65 && m + f < 80) grade += 'B';
else if(m + f >= 50 && m + f < 65) grade += 'C';
else if(m + f >= 30 && m + f < 50) {
(r >= 50)?grade+= 'C':grade+='D';
}
}
for(int i = 0; i < grade.length(); i++){
cout << grade[i] << endl;
}
return 0;
} | 0 | 56,307,909 |
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <utility>
#include <typeinfo>
#include <tuple>
#include <iterator>
using namespace std;
#define MOD 1000000007
#define INF 1e9+7
#define INF_LONG 1e18
#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, m, n) for(int i=m; i<n; ++i)
#define countof(array) (sizeof(array) / sizeof(array[0]))
typedef long long ll;
#define MAX_N 100000
#define MAX_M 100000
#define MAX_V 100
#define MAX_E 100
#define MAX_Q 100000
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int ddx[] = {-1, 0, 1, 0, -1, 1, -1, 1};
int ddy[] = {0, -1, 0, 1, 1, 1, -1, -1};
string ab = {"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
string as = {"abcdefghijklmnopqrstuvwxyz"};
ll gcd(ll x, ll y) {
if(y==0) return x;
else return gcd(y, x%y);
}
ll lcm(ll x, ll y) {
return (x*y)/gcd(x, y);
}
void yes() {
cout << "Yes" << endl;
}
void no() {
cout << "No" << endl;
}
void print_array(int array[], int len) {
for(int i=0; i<len; ++i) {
cout << array[i] << endl;
}
}
ll absolute(ll x) {
return (x<0)? (-1)*x : x;
}
ll n, k, a, b;
map<ll, ll> m;
vector<ll> v;
vector<ll> w;
int main() {
cin >> n >> k;
rep(i, n) {
cin >> a >> b;
m[a] += b;
}
for(auto it : m) {
if(v.empty()) {
v.push_back(it.first);
w.push_back(it.second);
}else {
v.push_back(it.first);
w.push_back(it.second+w[w.size()-1]);
}
}
vector<ll>::iterator itr = lower_bound(w.begin(), w.end(), k);
cout << v[distance(w.begin(), itr)] << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,X;
cin >>N>>M>>X;
vector<int> S(M,0);
vector<vector<int>> A(N,vector<int>(M+1));
for(int i=0;i<N;i++){
for(int j=0;j<M+1;j++){
cin >>A[i][j];
S[j]+=A[i][j];
}
}
int ans=10000000,e=0,cnt=0,d=0;
for(int i=0;i<1<<N;i++){
vector<int> S(M,0);
int an=0;
d=0;
for(int j=0;j<N;j++){
if(i>>j&1){
an+=A[j][0];
for(int k=1;k<M+1;k++){
S[k-1]+=A[j][k];
}
}
if(j==N-1){
for(int k=1;k<M+1;k++){
if(S[k-1]>=X){
if(k==M){
d=1;
continue;
}
}
else{
break;
}
}
}
if(j==N-1 && d==1 ){
ans=min(ans,an);
e=1;
}
}
}
if(e){
cout << ans <<endl;
}
else{
cout << -1 <<endl;
}
} | 0 | 96,305,297 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int N, M, K, ans;
cin >> N >> M >> K;
ans=0;
for (int i=0; i<=N; i++) {
for (int j=0; j<=M; j++) {
if (i*(M-j)+j*(N-i)==K) {
ans=ans+1;
}
}
}
if (ans>0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#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 mk(arr,n,type) type *arr=new type[n];
#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 sz = 1e5 + 2;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int pwmd(int a, int b) {
if (a == 1)
return 1;
if (b == 0)
return 1;
int ans = pwmd(a, b >> 1);
ans = (ans % mod * ans % mod) % mod;
if (b & 1)
return (ans * a) % mod;
else
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n = 0; cin >> n;
int k = 0; cin >> k;
int dp[sz];
memset(dp, 0, sizeof(dp));
int ans = 0;
for (int i = k; i >= 1; --i) {
dp[i] = pwmd(k / i, n);
for (int j = 2 * i; j <= k; j += i)
dp[i] = (dp[i] - dp[j] + mod) % mod;
ans = (ans % mod + (dp[i] % mod * i % mod ) % mod) % mod;
}
cout << ans << endl;
return 0;
} | 0 | 13,964,216 |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define FT() int t; scanf("%d",&t); while(t--)
#define pb push_back
#define nl printf("\n")
#define fi(i,start,end) for(int i=start; i < (int)end ; ++i)
#define ip(n) scanf("%d",&n)
#define mz(a) memset(a,0,sizeof(a))
#define inpArr(A,n) fi(i,0,n) ip(A[i]);
#define print(a) for(auto i : a) cout<<i<<" "; nl;
#define Fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
ll max(ll a,ll b) {return a>b?a:b;}
ll min(ll a,ll b) {return a<b?a:b;}
int main() {
#ifndef ONLINE_JUDGE
freopen("D:/Sublime/Rough/input.txt","r",stdin);
#endif
Fastio;
int testcase = 1;
while(testcase--)
{
string s,t;
cin>>s>>t;
int n = s.length(), m = t.length();
int mx = 0;
for(int i=0;i<m;i++)
{
for(int j=i;j<=n-m + i; j++)
{
if(t[i] == s[j])
{
int ic = i, jc = j, len = 0;
while(ic<m && jc<n)
{
if(t[ic] == s[jc])
len++;
ic++; jc++;
}
mx = max(mx,len);
}
}
}
cout<<(m-mx)<<"\n";
}
#ifndef ONLINE_JUDGE
cout<<"\nTime Elapsed : " << 1.0*clock() / CLOCKS_PER_SEC << " s";
#endif
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#include <cstdlib>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
using namespace std;
bool debug=true;
int main(){
int n;
string s[10]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
cin>>n;
for(int i=0;i<n;i++){
string ss;
cin>>ss;
int cnt=0;
for(int j=0;j<ss.size();j++){
if(ss[j]=='0'&&cnt!=0){
int x=int(ss[j-1])-48;
cout<<s[x][(cnt-1)%int(s[x].size())];
cnt=0;
}else if(ss[j]=='0'&&cnt==0){
cnt=0;
}else{
cnt++;
}
}
cout<<endl;
}
return 0;
} | 0 | 64,292,498 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int a[3];
for(int i=0;i<3;i++){
cin >> a[i];
}
sort(a,a+3);
int ans = 0;
if((a[2] - a[1]) & 1){
ans += (a[2] - a[1]) / 2;
a[1] = a[2] - 1;
}else{
ans += (a[2] - a[1]) / 2;
a[1] = a[2];
}
if((a[2] - a[0]) & 1){
ans += (a[2] - a[0]) / 2;
a[0] = a[2] - 1;
}else{
ans += (a[2] - a[0]) / 2;
a[0] = a[2];
}
sort(a, a+3);
if(a[1] < a[2]){
ans++;
}else{
if(a[0] < a[1]){
ans += 2;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)
template<class T, class U> bool chmax(T &a, U b) { if (a < b) a = b; return true; }
template<class T, class U> bool chmin(T &a, U b) { if (a > b) a = b; return true; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
string s; cin >> s;
int ans = 0;
rep(i, 1000) {
string t = to_string(i);
while (si(t) <= 2) t = '0' + t;
int cnt = 0;
rep(j, n) {
if (s[j] == t[cnt]) ++cnt;
if (cnt == 3) {
++ans;
break;
}
}
}
cout << ans << endl;
return (0);
} | 0 | 54,697,989 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
ll k,a,b;
cin >>k >>a >>b;
ll ans=1;
if(k<=a-1){
cout << ans+k<< endl;
return 0;
}
else {
if(b-a<=2){
cout << ans+k<< endl;
return 0;
}
ans=a;k-=(a-1);
ans+=(b-a)*(k/2)+k%2;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD = 1000000007;
const double PI = acos(-1);
bool ok(string s) {
int n = s.size();
if (n % 2 == 1) return false;
for (int i = 0; i < n / 2; i++) {
if (s[i] != s[n / 2 + i]) return false;
}
return true;
}
int solve(string s) {
int n = s.size();
int i = 0;
while (!s.empty()) {
s.pop_back();
i++;
if (ok(s)) return n - i;
}
}
int main() {
string s; cin >> s;
int ans = solve(s);
cout << ans << endl;
return 0;
} | 0 | 23,539,211 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll res(ll x){
if(x%4==0) return x;
if(x%4==1) return 1;
if(x%4==2) return x+1;
if(x%4==3) return 0;
}
int main() {
ll a,b;
cin >> a >> b;
ll ansa=0,ansb=0;;
ll now=1;
a--;
ansa=res(a);
ansb=res(b);
ll ans=ansa^ansb;
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n=1;
int result[n];
for(int s=0;s<n;s++){
string x,y;
cin>>x;
cin>>y;
int x_size=x.size();
int y_size=y.size();
int score[x_size+1][y_size+1];
for(int i=0;i<x_size+1;i++){
score[i][0]=i;
}
for(int j=0;j<y_size+1;j++){
score[0][j]=j;
}
for(int i=1;i<x_size+1;i++){
for(int j=1;j<y_size+1;j++){
int a=1;
if(x[i-1]==y[j-1]){
a=0;
}
score[i][j]=min(score[i-1][j]+1,score[i][j-1]+1);
score[i][j]=min(score[i-1][j-1]+a,score[i][j]);
}
}
cout<<score[x_size][y_size]<<"\n";
}
return 0;
} | 0 | 23,408,357 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int H, W; cin >> H >> W;
vector<string> s(H);
rep(i, H) cin >> s[i];
rep(i, H) rep(j, W) {
if(s[i][j] == '#') {
bool t = false;
if((i>0&&s[i-1][j]=='#') || (j>0&&s[i][j-1]=='#') || (i<H-1&&s[i+1][j]=='#') || (j<W-1&&s[i][j+1]=='#'))
t = true;
if(!t) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | #include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int n, k;
int ary[100000];
int main() {
while(1) {
scanf(" %d %d", &n, &k);
if(n == 0 && k == 0) break;
memset(ary, 0, sizeof ary);
rep(i,n) {
static int t;
scanf(" %d", &t);
ary[i] = t;
}
int sum = 0;
for(int i = 0; i < k; i++) sum += ary[i];
int maxv = sum;
for(int i = 1; i < n - k + 1; i++) {
sum -= ary[i - 1];
sum += ary[i + k - 1];
maxv = max<int>(maxv, sum);
}
printf("%d\n", maxv);
}
return 0;
} | 0 | 46,981,612 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divCeil(ll A, ll B) {return (A + (B - 1)) / B;}
ll myctoi(char C) {return C - '0';}
char myitoc(ll N) {return '0' + N;}
#define FINALANS(A) {cout << (A) << endl; exit(0);}
int main()
{
ll N;
cin >> N;
vector<ll> A = {0};
for (ll i = 1; ; i++)
{
if (A.back() >= N)
break;
A.push_back(A.back() + i);
}
ll x = distance(A.begin(), lower_bound(A.begin(), A.end(), N));
cout << x << " " << endl;
ll y = x * (x + 1) / 2 - N;
for (ll i = x - 1; i >= 1; i--)
{
if (i != y)
cout << i << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
const long long INF = 1<<29;
int N,A,B,C;
vector<int> l;
int dfs(int i,int a,int b,int c){
if(i==N){
if(!a||!b||!c) return INF;
else return abs(A-a) + abs(B-b) + abs(C-c);
}
int res = dfs(i+1,a,b,c);
res = min(res,dfs(i+1,a+l[i],b,c) + (a?10:0));
res = min(res,dfs(i+1,a,b+l[i],c) + (b?10:0));
res = min(res,dfs(i+1,a,b,c+l[i]) + (c?10:0));
return res;
}
int main(){
cin >> N >> A >> B >> C;
l.resize(N);
rep(i,N){
cin >> l[i];
}
cout << dfs(0,0,0,0) << endl;
return 0;
} | 0 | 18,575,105 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;
ll modadd(long long a, long long b){return (a%MOD+b%MOD+MOD)%MOD;}
ll modmul(long long a, long long b){return a%MOD*b%MOD%MOD;}
ll modexp(long long a, long long n){if (a==0) return 0; if(n==0)return 1; if(n%2==0){ll e=modexp(a,n/2); return modmul(e,e);} return modexp(a,n-1)*a%MOD;}
ll modinv(long long n){return modexp(n%MOD,MOD-2);}
ll modfact(long long n){long long res=1; for (int i=1; i <= n; ++i){res *= i; res %= MOD;} return res;}
ll modncr(long long n, long long r){long long numer=1;long long denom=1;for(int i=1;i<=r;++i){numer=modmul(numer,n-r+i);denom=modmul(denom,i);}return modmul(numer, modinv(denom));}
int main(void) {
ll N, K; cin >> N >> K;
ll ans = 0;
for (ll i = K; i <= N+1; ++i) {
ans = modadd(ans, i * (2*N - i + 1) / 2 - i * (i - 1) / 2 + 1);
}
out(ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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 Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
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;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
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;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
vector<ll> acc_sum(vector<ll> v){
vector<ll> ans(v.size(),0);
rep(i,v.size()){
if(i==0) ans[0]=v[0];
else ans[i]=ans[i-1]+v[i];
}
return ans;
}
int main() {
IOS;
ll n,k;
cin>>n>>k;
vector<ll> v(n);
rep(i,n) cin>>v[i];
rep(_,k){
vector<ll> imos(n+1,0);
rep(i,n){
imos[max((ll)0,i-v[i])]++;
imos[min((ll)n-1,i+v[i])+1]--;
}
v=acc_sum(imos);
bool flag=true;
rep(i,n) if(v[i]!=n) flag=false;
if(flag){
rep(i,n){
if(i==0) cout<<v[i];
else cout<<' '<<v[i];
}
cout<<endl;
return 0;
}
}
rep(i,n){
if(i==0) cout<<v[i];
else cout<<' '<<v[i];
}
} | 0 | 86,456,003 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rrep(i,n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(bit)
using ll = long long;
using P = pair<int,int>;
const long double pi = acos(-1.0);
const int MAX = 1000010;
const int INF = 1ll << 60;
const int MOD = 1000000007;
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 (b < a) {a = b; return 1;} return 0;}
template<typename T> T pow(T a, ll n) {T r(1); while(n) {if (n & 1) r *= a; a *= a; n >>= 1;} return r;}
struct faster_io {faster_io() {cin.tie(0); ios_base::sync_with_stdio(false);}} faster_io_;
struct graph {
struct edge {
int to, cost;
edge(int t, int c) : to(t), cost(c) {}
};
int n;
vector<vector<edge>> G;
vector<int> d, pre;
graph(int i) : n(i), G(i), d(i,INF), pre(i) {}
void add_edge(int s, int to, int cost) {
G[s].push_back(edge(to,cost));
}
void dijkstra(int s) {
rep(i,n) {d[i] = INF; pre[i] = 0;}
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(); int 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; pre[e.to] = v;
que.push(P(d[e.to],e.to));
}
}
}
};
signed main() {
int n; cin >> n;
graph g(n);
rep(i,n-1) {
int a, b, c; cin >> a >> b >> c;
a--; b--;
g.add_edge(a,b,c);
g.add_edge(b,a,c);
}
int q, k;
cin >> q >> k;
k--;
g.dijkstra(k);
rep(i,q) {
int a, b; cin >> a >> b;
a--; b--;
cout << g.d[a] + g.d[b] << endl;
}
return 0;
} | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < ll(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < ll(b); i++)
#define FORD(i, a, b) for (int i = a; i > ll(b); i--)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
const long long INF = 1e12;
const int MOD = 1e9 + 7;
#define MAXR 100000
#define Umap unordered_map
#define Uset unordered_set
#define int long long
#define P pair<int, int>
#define MP make_pair
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
int maxans = 0;
REP(i, n+1) {
if (s.substr(n - i, i) == t.substr(0, i)) {
chmax(maxans, i);
}
}
print(n * 2 - maxans);
} | 0 | 16,645,182 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, h;
cin>>n>>h;
int a = 0;
vector<int> b(n);
for(int i = 0; i < n; i++){
int x; cin>>x>>b[i];
a = max(a, x);
}
sort(b.rbegin(), b.rend());
ll ans = h;
ll sum = 0;
for(int i = 0; i < n; i++){
sum += b[i];
ll req = max(0LL, h - sum);
ans = min(ans, i + 1 + (req + a - 1)/a);
}
cout<<ans<<'\n';
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define ANS cout << ans << endl
#define RETURN(x) \
cout << x << endl; \
return 0
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
init();
ll N;
cin >> N;
unordered_map<string, ll> m;
rep(i, N) {
string s;
cin >> s;
m[s]++;
}
ll M;
cin >> M;
rep(i, M) {
string s;
cin >> s;
m[s]--;
}
ll ans = 0;
for (auto mm : m) ans = max(ans, mm.second);
ANS;
return 0;
} | 0 | 14,203,359 |
#include<iostream>
#include<string>
#include<stack>
int main(){
while(1){
std::stack<char>Cstr;
Cstr.push(' ');
std::string str;
int count=0;
std::getline(std::cin,str);
if(str==".")break;
for(int i=0;i<str.size();i++){
if(str[i]=='('||str[i]=='['){
count++;
Cstr.push(str[i]);
}else if(str[i]==')'||str[i]==']'){
count--;
if(!((str[i]==')'&&Cstr.top()=='(')||(str[i]==']'&&Cstr.top()=='['))){
std::cout<<"no"<<std::endl;
goto end;
}
Cstr.pop();
}
}
if(count==0)std::cout<<"yes"<<std::endl;
else std::cout<<"no"<<std::endl;
end:;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, N;
cin >> H >> N;
int s = 0;
int v;
for (int i = 0; i < N; ++i)
{
cin >> v;
s += v;
}
cout << (s >= H ? "Yes" : "No");
return 0;
} | 0 | 64,273,305 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge=pair<int,int>;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll power(ll a,ll b){
ll res=1;
while(b>0){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
int main(){
ll M,K;
cin>>M>>K;
bool CAN=true;
if(M<=1){
if(K!=0) CAN=false;
}
else{
if(K>=power(2,M)) CAN=false;
}
if(CAN){
if(M==1){
co("0 0 1 1");
return 0;
}
for(ll i=0; i<power(2,M); ++i){
if(i!=K) cout<<i<<" ";
}
cout<<K<<" ";
for(ll i=power(2,M)-1; i>=0; --i){
if(i!=K) cout<<i<<" ";
}
cout<<K<<endl;
}
else co(-1);
return 0;
} | #include <bits/stdc++.h>
#define N 1005
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;
typedef long long ll;
ll ans;
int main(){
ll n, k;
cin >> n >> k;
map <int,ll> mp;
for(int i=0; i<n; i++){
int a,b;
cin >> a >> b;
mp[a]+=b;
}
ll cntr = 0;
for(auto i:mp){
cntr+=i.second;
if(cntr >= k){
cout << i.first;
return 0;
}
}
return 0;
} | 0 | 70,272,999 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int N,M;
cin>>N>>M;
cout<<N*N-M<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c,S,L,h;
cin >> a >> b >> c;
c = c * M_PI / 180;
S = ((a * b) * sin(c)) / 2;
L = a + b + sqrt(pow(a, 2) + pow(b, 2) - (2 * a * b * cos(c)));
h = b * sin(c);
cout.precision(15);
cout << S << endl;
cout << L << endl;
cout << h;
return 0;
} | 0 | 84,897,270 |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(x, a, b) for(int x = (a); x <= (b); ++x)
#define rop(x, a, b) for(int x = (a); x < (b); ++x)
#define per(x, a, b) for(int x = (a); x >= (b); --x)
using namespace std;
typedef long long LL;
typedef double DB;
LL n, x, as;
LL work(LL a, LL b) {
if(a > b) swap(a, b);
if(a == 0) return 0;
return work(a, b % a) + b / a * 2 * a - a * (b % a == 0);
}
int main() {
cin >> n >> x;
as += n;
as += work(x, n - x);
cout << as << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n, b, f, r, v;
int oh[4][3][10] = { 0 };
cin >> n;
for(int i = 0; i < n; i++){
cin >> b >> f >> r >> v;
b--; f--; r--;
oh[b][f][r] += v;
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 3; j++){
for(int k = 0; k < 10; k++){
cout << ' ' << oh[i][j][k];
}
cout << endl;
}
if(i != 3) cout << "####################" << endl;
}
return 0;
} | 0 | 60,987,708 |
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long int
#define pb push_back
int main() {
int a, b;
cin >> a >> b;
if(a%3==0 || b%3==0 || (a+b)%3==0) print("Possible");
else print("Impossible");
} | #include <bits/stdc++.h>
using namespace std;
int main () {
int H, N;
cin >> H >> N;
vector<vector<int>> M(N, vector<int>(2));
int K = 1000000000;
for (int i = 0; i < N; i++) {
cin >> M.at(i).at(0) >> M.at(i).at(1);
K = min(K, M.at(i).at(1));
}
sort(M.begin(), M.end());
vector<int> DP(H + 1, 1000000000);
for (int i = 1; i < min(M.at(0).at(0), H + 1); i++) {
DP.at(i) = K;
}
DP.at(0) = 0;
for (int i = 0; i <= H; i++) {
for (int j = 0; j < N; j++) {
if (i >= M.at(j).at(0)) {
DP.at(i) = min(DP.at(i), DP.at(i - M.at(j).at(0)) + M.at(j).at(1));
}
else {
DP.at(i) = min(DP.at(i), M.at(j).at(1));
}
}
}
cout << DP.at(H) << endl;
} | 0 | 90,762,975 |
#include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<set>
#include<vector>
#define INF 100000000
#define MAX_N 10000
#define MAX_M 100
typedef long long int ll;
using namespace std;
int main(){
int a,b,c;
scanf("%d %d %d", &a, &b, &c);
if(a < b && b < c)
printf("Yes\n");
else
printf("No\n");
return 0;
} | using namespace std;
#include<iostream>
#include<stdio.h>
int main(){
int x;
cin >>x;
int a[x];
for (int j =1;j<=x;j++) cin>>a[j];
for (int i=1;i<=x;i++){
cout<<"node "<<i<<": key = "<<a[i]<<", ";
if(i>1) cout<<"parent key = "<<a[i/2]<<", ";
if(i*2<=x) cout<<"left key = "<<a[i*2]<<", ";
if((i*2)+1<=x) cout<<"right key = "<<a[(i*2)+1]<<", ";
cout<<endl;
}
return 0;
} | 0 | 53,378,038 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll dp[105][5][2];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
int k;
cin >> s >> k;
int n = s.size();
dp[0][0][0] = 1;
rep(i,n)rep(j,4)rep(l,2){
int nd = s[i] - '0';
rep(d,10){
int ni = i+1, nj = j, nl = l;
if(d != 0) nj++;
if(nj > k) continue;
if(l == 0){
if(d > nd) continue;
if(d < nd) nl = 1;
}
dp[ni][nj][nl] += dp[i][j][l];
}
}
ll ans = dp[n][k][0] + dp[n][k][1];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 100005;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
#define DEBUG
#define FORi(N) for(ll i = 0; i < N; ++i)
#define FORj(N) for(ll j = 0; j < N; ++j)
#define FORk(N) for(ll k = 0; k < N; ++k)
#if __cplusplus >= 201103L
#define ALL(v) begin(v),end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end(v), (x))
#else
#define ALL(v) (v).begin(),(v).end()
#define SORT(v) sort(v.begin(), v.end())
#define FIND(v,x) find(v.begin(), v.end(), (x))
#endif
#define fi first
#define se second
#define MEMNEXT(from, to) do{ memmove((to), (from), sizeof(from)); \
memset((from), 0, sizeof(from)); } while(0)
#ifdef DEBUG
#define DUMP(x) do{ std::cerr << (#x) << ": " << x << std::endl; }while(0)
#else
#define DUMP(x) do{}while(0)
#endif
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> lp;
typedef pair<ll, ll> llp;
typedef vector<int> vec;
typedef vector<ll> vecll;
typedef vector<vec> mat;
typedef vector<vecll> matll;
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};
struct edge{
int to,cost;
};
#ifndef DEBUG
void debug(const char* format, ...){}
#else
void debug(const char* format, ...){
va_list arg;
va_start(arg, format);
vprintf(format, arg);
va_end(arg);
}
#endif
#ifdef DEBUG
#define DUMPV(v, c) do{ \
printf("%s: ", #v); \
for (int i = 0; i < (c); ++i) \
{ \
cout << (v)[i] << " "; \
} \
cout << endl; \
} while(0)
#else
#define DUMPV(v,c)
#endif
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( reinterpret_cast<T*>(array),
reinterpret_cast<T*>(array+N),
val );
}
ll BSearch(ll ok, ll ng, bool (*f)(ll)){
ll mid;
while(abs(ok - ng) > 1LL) {
mid = (ok + ng) / 2LL;
if(f(mid)) {
debug("BSearch: f(%d) == true\n", mid);
ok = mid;
}
else
{
debug("BSearch: f(%d) == false\n", mid);
ng = mid;
}
}
return ok;
}
ll NUM_TEST_CASE = 1;
ll N,M,K,A,B,C,D,E;
int dp[NMAX] = {};
string S;
vec v;
string ans = {};
void solve(){
ll sum = 0;
for (auto &&ch : S)
{
sum += ch - '0';
}
ans = sum % 9 ? "No" : "Yes";
}
void debug(){
}
void answer(){
cout << ans << endl;
}
void init(){
}
int main(int argc, char const *argv[])
{
for (int test_case = 0; test_case < NUM_TEST_CASE; ++test_case)
{
init();
cin >> S;
solve();
#ifdef DEBUG
debug();
#endif
answer();
}
return 0;
} | 0 | 50,334,316 |
#include <bits/stdc++.h>
#include <functional>
#include<stdio.h>
using namespace std;
#define ll long long int
#define dd long double
#define pb push_back
#define pf push_front
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pi>
#define mi map<ll,ll>
#define vvi vector<vector<ll>>
#define mpi map<pi,ll>
#define pipi pair<ll,pair<ll,ll> >
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define x first
#define y second
#define sz(x) (ll)x.size()
#define u '\n'
#define PI 3.141592653589
#define bs(v,n) binary_search(all((v)),(n))
#define lb(v,n) lower_bound(all((v)),(n))
#define ub(v,n) upper_bound(all((v)),(n))
#define fo(i,l,u) for(i=l;i<u;i++)
#define rfo(i,l,u) for(i=l;i>=u;i--)
#define rf(s) for(auto &c : s)
#define allfo(s) for(auto it=(s).begin();it!=(s).end();it++)
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define M 1000000007
#define ef else if
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define C continue;
#define wa(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
#define debug(vec) cout<<(#vec)<<": "; for (auto& i: vec) cout<<i<<" "; cout<<'\n'
#define debugp(vec) cout<<(#vec)<<": "; for (auto& i: vec) cout<<i.x<<","<<i.y<<" | "; cout<<'\n'
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<pi,null_type,less<pi>,rb_tree_tag,tree_order_statistics_node_update> pbds;
#define fbo find_by_order
#define ook order_of_key
const ll N = 350;
ll gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a); }
ll power(ll x, ll y)
{
ll res = 1;
while (y > 0)
{
if (y & 1)
res = res*x;
y = y>>1;
x = x*x;
}
return res;
}
vector<vi>v;
ll t1[100005][2];
vi vis;
void dfs(ll n)
{
vis[n]=1;
for(auto i:v[n])
{
if(vis[i]==0)
{
dfs(i);
t1[n][0]=(t1[n][0]*t1[i][1])%M;
t1[n][1]=(t1[n][1]*(t1[i][0]+t1[i][1])%M)%M;
}
}
}
signed main()
{
tezz
ll t=1;
while(t--)
{
ll n,i,j;
cin>>n;
v=vector<vi>(n+1);
vis=vi(n+1);
fo(i,0,n-1)
{
ll a,b;
cin>>a>>b;
v[a].pb(b);
v[b].pb(a);
}
fo(i,0,100005)
{
fo(j,0,2)
t1[i][j]=1;
}
dfs(1);
cout<<(t1[1][0]+t1[1][1])%M<<u;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int mod = 1e9 + 7;
ll dp[2020][2020];
ll sum[2020][2020];
int main() {
int n,m;
cin >> n >> m;
vector<int> s(n), t(m);
rep(i,n) cin >> s[i];
rep(i,m) cin >> t[i];
memset(dp,0,sizeof(dp));
memset(sum,0,sizeof(sum));
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if(s[i] == t[j]) {
dp[i + 1][j + 1] = sum[i][j] + 1;
dp[i + 1][j + 1] %= mod;
} else {
dp[i + 1][j + 1] = 0;
}
sum[i + 1][j + 1] = (sum[i + 1][j] + sum[i][j + 1] + dp[i + 1][j + 1] + mod - sum[i][j]) % mod;
}
}
ll answer = 0;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
answer += dp[i][j];
answer %= mod;
}
}
cout << answer << '\n';
} | 0 | 69,020,212 |
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
string result = "Yes";
if (a >= b || b >= c) {
result = "No";
}
cout << result << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a[100];
int list[4]={0,0,0,0};
for(int i=1;i<=10;i++){
cin>>a[i];
if(list[1]<a[i]){
list[3]=list[2];
list[2]=list[1];
list[1]=a[i];
}
else if(list[2]<a[i]){
list[3]=list[2];
list[2]=a[i];
}
else if(list[3]<a[i]){
list[3]=a[i];
}
}
for(int j=1;j<=3;j++){
cout<<list[j]<<endl;
}
return 0;
} | 0 | 74,120,185 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> h;
rep(i, n){
int x;
cin >> x;
h.push_back(x);
}
h.push_back(0);
int now, top, ans=0;
vector<int> res;
res.push_back(0);
rep(i, n+1){
now = res.back();
while (now > h[i]) {
res.pop_back();
top = res.back();
ans += now - max(top, h[i]);
now = top;
}
if (now < h[i]) {
res.push_back(h[i]);
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define bitcount(x) __builtin_popcount(x)
#define bitcountll(x) __builtin_popcountll(x)
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inp(p) in2(p.F,p.S)
#define llin(a) cin >> a
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twod(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define prp(p) pr2(p.F,p.S)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define pinttwod(mat,i,j,n,m) rep(i,n){rep(j,m)pr(mat[i][j]); lin;}
#define plltwod(mat,i,j,n,m) rep(i,n){rep(j,m)llpr(mat[i][j]); lin;}
#define byes printf("YES\n")
#define bno printf("NO\n")
#define yes printf("Yes\n")
#define no printf("No\n")
#define lin printf("\n")
#define rep(i,n) for(i=0;i<n;++i)
#define fone(i,n) for(i=1;i<=n;++i)
#define rrep(i,n) for(i=n-1;i>=0;--i)
#define lp(i,a,b) for(i=a;i<b;++i)
#define rlp(i,a,b) for(i=a;i>=b;--i)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
#define sz(x) x.size()
#define inrange(i,a,b) (i>=a && i<=b)
#define FLUSH fflush(stdout)
#define precision(x) cout << setprecision(x) << fixed
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define lchild(p) 2*p
#define rchild(p) 2*p+1
#define lseg l,m,2*p
#define rseg m+1,h,2*p+1
#define bhardo(mat,i,j,n,m,t) rep(i,n){rep(j,m)mat[i][j]=t;}
#define biton(mask,i) (mask&(1<<i))
#define bitoff(mask,i) (!(mask&(1<<i)))
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define ck printf("continue\n")
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cerr << *it << " = " << a << "\n";
err(++it, args...);
}
#define ll long long int
#define ii pair<int,int>
#define pli pair<ll,int>
#define triple tuple<int,int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
const double PI = acos(-1);
const double eps = (1e-9);
const ll INF = 1e18;
const int M = (1e9)+7;
const int N = (1e6)+5;
void solve()
{
int n,i;
in(n);
vector<ll> v(n);
rep(i,n)
llin(v[i]);
ll k=0;
ll x,a;
while(1)
{
x=0;
rep(i,n)
x+=(v[i]/n);
if(x==0)
break;
k+=x;
rep(i,n)
a=(v[i]/n),v[i]=v[i]-n*a+(x-a);
}
llout(k);
}
int main()
{
int t=1;
while(t--)
solve();
} | 0 | 57,624,587 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <numeric>
#include <vector>
#include <set>
#include <queue>
using namespace std;
int h,w,n;
char s[1252];
int mp[1252][1252];
int ys[11];
int xs[11];
bool used[1252][1252];
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int bfs(int sy,int sx,int gy,int gx){
queue<int> qy,qx,qdist;
for(int i=0;i<h;i++)for(int j=0;j<w;j++)
used[i][j]=false;
qy.push(sy);
qx.push(sx);
qdist.push(0);
used[sy][sx] = true;
while(!qy.empty()){
int y,x,dist;
y = qy.front(); qy.pop();
x = qx.front(); qx.pop();
dist = qdist.front(); qdist.pop();
if(gy==y && gx==x)return dist;
for(int i=0;i<4;i++){
int ny,nx,ndist;
ny = y+dy[i];
nx = x+dx[i];
ndist = dist+1;
if(ny<0 || ny>=h || nx<0 || nx>=w)continue;
if(used[ny][nx])continue;
if(mp[ny][nx]==1)continue;
used[ny][nx] = true;
qy.push(ny);
qx.push(nx);
qdist.push(ndist);
}
}
return -1;
}
int main(){
scanf("%d%d%d",&h,&w,&n);
for(int i=0;i<h;i++){
scanf("%s",s);
for(int j=0;j<w;j++){
mp[i][j] = (s[j]=='X'?1:0);
if(s[j]!='X' && s[j]!='.'){
if(s[j]=='S'){
ys[0]=i;
xs[0]=j;
}else{
ys[s[j]-'0']=i;
xs[s[j]-'0']=j;
}
}
}
}
int ans = 0;
for(int i=0;i<n;i++){
ans += bfs(ys[i],xs[i],ys[i+1],xs[i+1]);
}
printf("%d\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long N, K, ans;
vector<long> A;
int main(void) {
cin >> N >> K;
A.resize(N, 0);
for (long i = 0; i < K; i++) {
long d; cin >> d;
for (long j = 0; j < d; j++) {
long a; cin >> a; a--;
A[a]++;
}
}
for (auto e: A) {
if (e == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 71,928,758 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w, 1e9));
cnt[0][0] = s[0][0] == '#' ? 1 : 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i) {
if (s[i][j] == s[i - 1][j]) {
cnt[i][j] = min(cnt[i][j], cnt[i - 1][j]);
} else {
cnt[i][j] = min(cnt[i][j], cnt[i - 1][j] + 1);
}
}
if (j) {
if (s[i][j] == s[i][j - 1]) {
cnt[i][j] = min(cnt[i][j], cnt[i][j - 1]);
} else {
cnt[i][j] = min(cnt[i][j], cnt[i][j - 1] + 1);
}
}
}
}
cout << (cnt[h - 1][w - 1] + 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
vector<int> a(5);
rep(i,5) cin >> a.at(i);
vector<int> b(5);
rep(i,5){
b.at(i)=a.at(i)%10;
}
rep(i,5){
if(b.at(i)==0)continue;
else b.at(i)=10-b.at(i);
}
int m=0;
rep(i,5){
m=max(m,b.at(i));
}
int ans=0;
rep(i,5){
ans+=a.at(i)+b.at(i);
}
cout << ans-m << endl;
} | 0 | 14,838,277 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VII;
typedef vector<VL> VLL;
typedef pair<int, int> PII;
typedef map<int, int> MP;
typedef vector<pair<ll, ll>> PS;
template <class T, class U>
bool chmax(T &a, U b) {
if (a <= b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U>
bool chmin(T &a, U b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
int main() {
ll n, m, k, x, y , z = 0, h,w, sum = 0, Max = -1, Min = 3e9+1;
string u;
bool ok=true;
cin >> n >> m;
VL a(m),b(m); VB ans(m,false);
rep(i,m){
cin >> a[i] >> b[i];
}
rep(i,m){
if(a[i]==1){
ans[b[i]]=true;
}
}
rep(i,m){
if(b[i]==n && ans[a[i]]){
pri("POSSIBLE");
return 0;
}
}
pri("IMPOSSIBLE");
return 0;
} | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
using namespace std;
int main(){
int N,A,B,C,X;
while(cin >> N >> A >> B >> C >> X,N){
int Y[100];
int cnt = 0;
REP(i,N){
cin >> Y[i];
}
int i = 0;
while(1){
if(cnt > 10000){
cout << -1 << endl;
break;
}else{
if(X == Y[i]){
if(i == N - 1){
cout << cnt << endl;
break;
}
i++;
}
cnt++;
X = (A*X+B)%C;
}
}
}
return 0;
} | 0 | 30,709,991 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1;
while(tc--){
int n;
cin >> n;
int ans = 0;
for(int i = 1; i * i <= n; i++){
if(n % i){
continue;
}
if(n / i == i){
continue;
}
if(n % (n / i - 1) == 0){
continue;
}
ans += n / i - 1;
}
cout << ans << '\n';
}
} | #include<cstdio>
#include<algorithm>
using namespace std;
int a,b,c,d,S,T;
int main(){
scanf("%d%d%d%d",&a,&b,&c,&d);
S=a+b+c+d;
scanf("%d%d%d%d",&a,&b,&c,&d);
T=a+b+c+d;
printf("%d\n",max(S,T));
} | 0 | 57,905,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(pos, len) for(int pos=0;pos<len;pos++)
#define repp(pos, len) for(int pos=1;pos<=len;pos++)
#define INF 987654321
#define IINF 2987654321987654321
#define MOD 998244353
const int MAXN = 1e5 + 50;
ll d[MAXN], pa[MAXN], sz[MAXN], depth[MAXN];
vector<int> adj[MAXN];
int n;
bool check(int root) {
queue<int> que;
que.push(root);
ll sum = 0;
depth[root] = 0;
while(!que.empty()) {
int v = que.front(); que.pop();
for(auto c : adj[v]) {
depth[c] = depth[v] + 1;
sum += depth[c];
que.push(c);
}
}
return sum == d[root];
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%lld", &d[i]);
map<ll, int> M;
for(int i = 1; i <= n; i++)
M[d[i]] = i;
for(int i = 1; i <= n; i++)
sz[i] = 1;
vector<int> v;
for(int i = 1; i <= n; i++) v.push_back(i);
sort(v.begin(), v.end(), [](int i, int j){ return d[i] > d[j]; });
int root = v.back();
for(auto c : v) {
if(c == root) break;
ll dval = d[c] + 2*sz[c] - n;
if(M.find(dval) == M.end() || M[dval] == c) {
printf("-1");
exit(0);
}
int p = M[dval];
adj[p].push_back(c);
pa[c] = p;
sz[p] += sz[c];
}
if(!check(root)) {
printf("-1");
exit(0);
}
for(int i = 1; i <= n; i++)
if(i != root) printf("%d %d\n", i, pa[i]);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
const long long int m=pow(10,9)+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,y;
cin>>n>>y;
for(ll i=0;i<=n;i++)
{
for(ll j=0;j<=n-i;j++)
{
if(i*10000+j*5000+(n-i-j)*1000==y)
{
cout<<i <<" "<<j<<" "<<n - i - j<<endl;
return 0;
}
}
}
cout<<"-1 -1 -1"<<endl;
return 0;
} | 0 | 63,146,082 |
#include<bits/stdc++.h>
typedef long long int ll;
#define optimization() ios_base::sync_with_stdio(0);
#define FOR(V,lim) for(ll V=0;V<lim;V++)
#define endl '\n'
using namespace std;
int main()
{
ll a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw"<<endl;
else if((a==1 || a>b) && b>1)
cout<<"Alice"<<endl;
else
cout<<"Bob"<<endl;
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 | 41,876,282 |
#include<iostream>
int main(void){
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int cnt = 1;
char b = s[0];
for(int i = 1; i < n; i++){
if(s[i] != b){
cnt++;
b = s[i];
}
}
std::cout << cnt << std::endl;
return 0;
} | #include <bits/stdc++.h>
int main(){
int n,a,b,c,max;
bool output[1000]={false};
std::cin >> n;
for (int i=0;i<n;++i)
{
std::cin >> a >> b >> c;
if (a>b && a>c){
max = a;
a = 0;
}
else if (b>a && b>c){
max= b;
b = 0;
}
else if (c>a && c>b){
max= c;
c = 0;
}
if (pow(max,2) == pow(a,2)+pow(b,2)+pow(c,2)){
output[i] = true;
}
}
for (int i=0;i<n;++i){
if (output[i]) std::cout << "YES" << std::endl;
else std::cout << "NO" << std::endl;
}
} | 0 | 40,688,757 |