code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const int MAX = 1e5+1;
int a[MAX];
bool b[MAX];
int search(int i, int sum){
if(b[i] == true) return -1;
if(i == 2) return sum;
b[i] = true;
return search(a[i], sum + 1);
}
void solve(){
int n; cin>>n;
for (int i=1; i<=n; i++)
cin>>a[i];
memset(b, false, sizeof b);
int res = search(1, 0);
cout<<res<<endl;
}
int main(){
solve();
Bye;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0;i < n;i++){
cin >> a[i];
a[i]--;
}
vector<long long> c(n,0);
for (long long i = 0;i < n;i++){
c[a[i]]++;
}
long long sum = 0;
for (long long i = 0; i < n; i++){
sum += c[i]*(c[i]-1)/2;
}
for (long long i = 0; i < n; i++){
long long ans = sum;
ans -= (c[a[i]])*(c[a[i]]-1)/2;
ans += (c[a[i]]-1)*(c[a[i]]-2)/2;
cout << ans << endl;
}
}
| 0
| 89,285,598
|
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main(){
int N;
string S;
cin >> N >> S;
int count = 1;
for(int i = 0; i < N - 1; i++){
if(S[i] != S[i + 1]) count++;
}
cout << count << endl;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 1000000007
#define inf 100000000000000000
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int n,t,d[15][15],cost,x,y,k,i,j;
int main()
{
while(scanf("%d",&n)!=EOF&&n!=0)
{
memset(d,INF,sizeof(d));t=0;
P mi;mi.second=INF;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&x,&y,&cost);
d[x][y]=d[y][x]=cost;
t=max(t,max(x,y));
}
for(i=0;i<=t;i++)d[i][i]=0;
for(k=0;k<=t;k++)
{
for(i=0;i<=t;i++)
{
for(j=0;j<=t;j++)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
for(i=0;i<=t;i++)
{
P p;p.first=i;p.second=0;
for(j=0;j<=t;j++)
{
if(i==j)continue;
p.second+=d[i][j];
}
if(mi.second>p.second)mi=p;
}
printf("%d %d\n",mi.first,mi.second);
}
return 0;
}
| 0
| 21,584,525
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x[1000];
ll y[1000];
ll z[1000];
ll s[8][1000];
int main() {
int N, M;
cin >> N >> M;
for (int i=0; i<N; i++) {
cin >> x[i] >> y[i] >> z[i];
}
for (int i=0; i<N; i++) {
s[0][i] = x[i] + y[i] + z[i];
}
for (int i=0; i<N; i++) {
s[1][i] = - x[i] + y[i] + z[i];
}
for (int i=0; i<N; i++) {
s[2][i] = x[i] - y[i] + z[i];
}
for (int i=0; i<N; i++) {
s[3][i] = x[i] + y[i] - z[i];
}
for (int i=0; i<N; i++) {
s[4][i] = - x[i] - y[i] + z[i];
}
for (int i=0; i<N; i++) {
s[5][i] = x[i] - y[i] - z[i];
}
for (int i=0; i<N; i++) {
s[6][i] = - x[i] + y[i] - z[i];
}
for (int i=0; i<N; i++) {
s[7][i] = - x[i] - y[i] - z[i];
}
ll ans = 0;
for (int i=0; i<8; i++) {
ll m = 0;
sort(s[i], s[i]+N, greater<ll>());
for (int j=0; j<M; j++) {
m += s[i][j];
}
ans = max(ans, m);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
string L;
ll dpC[100010] = { 0 };
ll dpUC[100010] = { 0 };
int main(){
cin >> L;
int len = L.size();
dpUC[0] = 1;
for(int i = 0; i < len; i++){
if(L[i] == '0'){
dpC[i+1] = (3 * dpC[i]) % MOD;
dpUC[i+1] = dpUC[i] % MOD;
} else if(L[i] == '1'){
dpC[i+1] = (dpUC[i] + 3 * dpC[i]) % MOD;
dpUC[i+1] = (2 * dpUC[i]) % MOD;
}
}
cout << (dpC[len] + dpUC[len]) % MOD << endl;
return 0;
}
| 0
| 39,164,248
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
int main(){
int n,k;
string s;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v[i];
sort(v.begin(),v.end());
int ans=0;
rep(i,k){
ans+=v[n-1-i];
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
long long dp[303][303];
int main() {
int N, K;
cin >> N >> K;
int M = N - K;
vector<int>H(N + 1);
for (int i = 0; i < N; ++i) {
cin >> H[i + 1];
}
for (int i = 0; i < N + 1; ++i) {
for (int j = 0; j < M + 1; ++j) {
dp[i][j] = 1e18;
}
}
dp[0][0] = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 0; j <= M; ++j) {
long long now = 1e18;
for (int k = 0; k < i; ++k) {
now = min(now, dp[k][j] + max(0, H[i] - H[k]));
}
dp[i][j + 1] = now;
}
}
long long ans = 1e18;
for (int i = 0; i <= N; ++i) {
ans = min(ans, dp[i][M]);
}
cout << ans << endl;
return 0;
}
| 0
| 78,291,517
|
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<int,int>
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=1e18;
const int mod=1e9+7;
const int M=100009;
inline int bigmod(int B,int P){int R=1;while(P>0){if(P&1){R=(R*B)%mod;}P>>=1;B=(B*B)%mod;}return R;}
inline int ad(int x,int y){int ret=(x%mod+y%mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int sub(int x,int y){int ret=((x%mod)-(y%mod)+mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int gun(int x,int y){int ret=((x%mod)*(y%mod))%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
main()
{
fast
int n;
cin>>n;
int a[n+3],b[n+3];
f(i,1,n)
{
cin>>a[i]>>b[i];
}
int delta=0;
rf(i,n,1)
{
int val=a[i]+delta;
if(val%b[i]!=0)
{
if(val<b[i])
{
delta+=(b[i]-val);
}
else
{
int m=val/b[i];
m=(m+1)*b[i];
delta+=(m-val);
}
}
}
cout<<delta<<endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int x,a,b,c,n,f,I;
vector<int> y;
int dam;
while(1){
I=0;
f=0;
y.clear();
cin >> n >> a >> b >> c >> x;
if(n==0&&a==0&&b==0&&c==0&&x==0)break;
for(int i=0;i<n;i++){
cin >> dam;
y.push_back(dam);
}
while(1){
if(y[I]==x){
I++;
if(I==n){
cout << f << endl;
break;
}
}
x=(a*x+b)%c;
f++;
if(f==10001){
cout << -1 << endl;
break;
}
}
}
return 0;
}
| 0
| 77,002,257
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,j,s,l;
cin>>n;
ll ans = n-1;
for(ll i=1;i<=sqrt(n);i++)
{
if(n%i==0){
j = i;
s = n/j;
ans = min(ans,(j-1)+(s-1));
l = 1;
}
}
if(l==1)
cout<<ans<<endl;
else
cout<<n-1<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N,A,B; cin>>N>>A>>B;
if(A+B<=N+1&&(N+A-1)/A<=B&&(N+B-1)/B<=A){
int memo;
REP(i,0,N){
int X=i+(N-i+A-1)/A;
if(X==B){
memo=i;
break;
}
}
vi ans;
REP(i,1,memo) ans.pb(i);
vii C(N);
for(int i=N;memo<i;i--){
int X=(N-i)/A;
C[X].pb(i);
}
rep(i,0,N){
sort(ALL(C[i]));
rep(j,0,C[i].size()) cout<<C[i][j]<<" ";
}
reverse(ALL(ans));
rep(i,0,memo) cout<<ans[i]<<" ";
cout<<endl;
}
else cout<<-1<<endl;
}
| 0
| 66,179,050
|
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
long double ans=0.0;
rep(i,n){
long double m;
string s;
cin >> m >> s;
if(s == "JPY"){
ans += m;
}
else{
ans += m*380000.0;
}
}
cout << ans;
return 0;
}
|
#include <iostream>
#include <map>
using namespace std;
int main(){
int n, a;
cin >> n;
map<int,int>mp;
for(int i=0; i<n; i++){
cin >> a;
mp[a]++;
mp[a+1]++;
mp[a-1]++;
}
int M = 0;
for(auto itr = mp.begin(); itr != mp.end(); ++itr) {
M = max(itr->second,M);
}
cout << M << endl;
return 0;
}
| 0
| 34,125,351
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<double> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
double ans = 0;
for(int i = 0; i < N; i++) {
ans += A.at(i)/pow(2, i + 1);
}
cout << ans + A.at(A.size() - 1)/pow(2, A.size() ) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << ": " << x << endl;
#else
#define debug(x)
#endif
int main() {
cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(20);
string s; cin >> s;
if(s.size() == 2) {
if(s[0] == s[1]) cout << 1 << " " << 2 << endl;
else cout << -1 << " " << -1 << endl;
return 0;
}
rep(i, s.size()-1) {
if(s[i] == s[i+1]) {
cout << i+1 << " " << i+2 << endl;
return 0;
}
}
rep(i, s.size()-2) {
if(s[i] == s[i+2]) {
cout << i+1 << " " << i+3 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
}
| 0
| 18,768,584
|
#include <iostream>
#include <string>
int main() {
int a, b;
auto mark = ">";
std::cin >> a >> b;
if (a > b)
{
mark = ">";
}
else if(a < b)
{
mark = "<";
}
else mark = "==";
std::cout << "a" << " " << mark << " " << "b" << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100];
int main(){
int a, b, k;
scanf("%d%d%d", &a, &b, &k);
for(int i=0;i<k;i++){
if(i%2 == 0){
if(a%2 != 0) a--;
b += a/2;
a/=2;
}
else{
if(b%2 != 0) b--;
a += b/2;
b/=2;
}
}
printf("%d %d\n", a, b);
}
| 0
| 17,500,213
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ifstream fin("parimpar2.in");
ofstream fout("parimpar2.out");
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int ans=k;
for(int i=0; i<n-1; ++i)
ans*=k-1;
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N,A,B; cin>>N>>A>>B;
if(A+B<=N+1&&(N+A-1)/A<=B&&(N+B-1)/B<=A){
int memo;
REP(i,0,N){
int X=i+(N-i+A-1)/A;
if(X==B){
memo=i;
break;
}
}
vi ans;
REP(i,1,memo) ans.pb(i);
vii C(N);
for(int i=N;memo<i;i--){
int X=(N-i)/A;
C[X].pb(i);
}
rep(i,0,N){
sort(ALL(C[i]));
rep(j,0,C[i].size()) cout<<C[i][j]<<" ";
}
reverse(ALL(ans));
rep(i,0,memo) cout<<ans[i]<<" ";
cout<<endl;
}
else cout<<-1<<endl;
}
| 0
| 30,325,500
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
int main(){
int N; cin >> N;
string S; cin >> S;
S.erase(unique(ALL(S)),S.end());
cout << S.size() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
int main() {
string str;
cin >> str;
vector<ll> num(4);
for (ll i = 0; i < 4; ++i) {
num[i] = str[i] - '0';
#ifdef SOURCE_TEST
cout << num[i] << "\n";
#endif
}
for (ll i = 0; i < 1U << 3; ++i) {
ll sum = num[0];
for (ll j = 0; j < 3; ++j) {
if (i & (1U << j)) {
#ifdef SOURCE_TEST
cout << sum << "+=" << num[j + 1] << "\n";
#endif
sum += num[j + 1];
} else {
#ifdef SOURCE_TEST
cout << sum << "-=" << num[j + 1] << "\n";
#endif
sum -= num[j + 1];
}
}
#ifdef SOURCE_TEST
cout << "ans==" << sum << endl;
#endif
if (sum == 7) {
cout << num[0];
for (ll j = 0; j < 3; ++j) {
if (i & (1U << j)) {
cout << "+";
} else {
cout << "-";
}
cout << num[j + 1];
}
cout << "=7\n";
break;
}
}
return 0;
}
| 0
| 11,023,614
|
#include<bits/stdc++.h>
using namespace std;
int main(){
char c;
set<char> s;
for(int i = 0;i < 4;i++){
cin >> c;
s.insert(c);
}
if(s.size() == 2)cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<long long> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LLi i = 0; i < (n); i++)
#define FOR(in) for(LLi i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define uniq(v) v.erase(unique(v.begin(), v.end()), v.end());
#define exit(); return 0;
#define no "NO"
#define yes "YES"
#define con continue;
int main()
{
LL n;
cin>>n;
cout<<n*(n+1)/2<<endl;
2
exit()
}
| 0
| 16,159,129
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int a,b;
cin>>a>>b;
if(a * b == 15)
{
printf("*");
}
else if(a + b == 15)
{
printf("+");
}
else
{
printf("x");
}
printf("\n");
return 0;
}
|
#include<bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for(int i = a; i <= b; i+=c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
vector<int> tree[100001];
int dp[100001][2];
int solve(int u, bool constr, int pr)
{
if (dp[u][constr] != -1)
return dp[u][constr];
int ans = 0;
int w1 = 1;
for (int child : tree[u]) {
if (child != pr)
{
w1 = (w1 * solve(child, 0, u)) % MOD;
}
}
ans = (ans + w1) % MOD;
if (!constr)
{
int w2 = 1;
for (int child : tree[u]) {
if (child != pr)
{
w2 = (w2 * solve(child, 1, u)) % MOD;
}
}
ans = (ans + w2) % MOD;
}
return dp[u][constr] = ans;
}
int32_t main()
{
ios :: sync_with_stdio(false); cin.tie(0);
int t = 1;
for (int i9 = 1; i9 <= t; i9++)
{
int n;
cin >> n;
n--;
memset(dp, -1, sizeof(dp));
while (n--)
{
int x, y;
cin >> x >> y;
tree[x].pb(y);
tree[y].pb(x);
}
cout << solve(1, 0, -1);
}
}
| 0
| 34,228,193
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define P pair<ll,ll>
#define fs first
#define sc second
template<class S>S sum(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
ll min(int a,ll b){return min((ll)a,b);} ll min(ll a,int b){return min(a,(ll)b);}
template <class S> void print(vector<S> &v){for(ll i=0; i<(ll)v.size(); i++){cerr << v[i] << ' ';}cerr << endl;}
template <class S> void print(vector<vector<S>> &v) {for (ll i = 0; i < (ll)v.size(); i++) {for (ll j = 0; j < (ll)v[i].size(); j++) {cerr << v[i][j] << ' ';}cerr << endl;}}
int main(){
ll n; cin >> n;
if(n%2){
cout << 0 << endl;
}else{
n/=10;
ll ans = 0;
while(n){
ans += n;
n/=5;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll ans = 0;
ll now = 1;
rep(i, n)
{
if (a[i] == now)
{
now++;
}
else if (a[i] % now == 0)
{
ans += a[i] / now - 1;
if (now == 1)
{
now = 2;
}
}
else
{
ans += a[i] / now;
}
}
cout << ans << endl;
return 0;
}
| 0
| 85,119,781
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int k,s;
cin >> k >> s;
int ans = 0;
int z = 0;
REP(x,k+1){
REP(y,k+1){
z = s - x - y;
if(x + y + z == s && z >= 0 && z <= k){
ans++;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll x){
if(x == 1) return 1;
return f(x/2)*2+1;
}
int main(){
string s;
cin >> s;
int ans(1000);
for(int i=0;i<s.size()-2;i++){
string t = s.substr(i,3);
int num = atoi(t.c_str());
ans = min(ans,abs(num-753));
}
cout << ans << endl;
return 0;
}
| 0
| 73,794,473
|
#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<cmath>
#include<fstream>
#include <set>
const int MAXN =1e5+10;
const long long mod = 1e14 ;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int inf= 0x3f3f3f3f;
#define eps 1e-8
#define PI 3.1415926535898
#define lowbit(x) (x&(-x))
using namespace std ;
typedef long long ll;
int a[15][15],c[15];
int main()
{
int ans=inf;
int n,m,x;
scanf("%d %d %d",&n,&m,&x);
for(int i=1;i<=n;i++)
{
scanf("%d",&c[i]);
for(int j=1;j<=m;j++) scanf("%d",&a[i][j]);
}
for(int i=1;i<2<<n;i++)
{
int num=i;
int vis[15],index=1;
while(num)
{
vis[index++]=num%2;
num/=2;
}
int need[15]={0},sum=0;
for(int j=1;j<=n;j++)
{
if(vis[j])
{
sum+=c[j];
for(int k=1;k<=m;k++)
{
need[k]+=a[j][k];
}
}
}
int flag=1;
for(int j=1;j<=m;j++)
{
if(need[j]<x)
{
flag=0;
break;
}
}
if(flag) ans=min(ans,sum);
}
if(ans==inf) printf("-1\n");
else printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define PI acos(-1.0)
typedef long long ll;
const int maxn=1e5+5;
int main()
{
ll k;
scanf("%lld",&k);
int n=50;
cout << n << endl;
ll res=k%50;
ll x=k/50-1;
ll cnt=res;
for(ll i=1;i<=50;i++)
{
if(cnt>0)
{
printf("%lld ",i+50-res+1+x );
cnt--;
}
else
printf("%lld ",i-res+x);
}
cout << endl;
return 0;
}
| 0
| 1,741,050
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N, K;
cin >> N >> K;
double p = 0;
for(int i=1; i<=N; i++){
double tmp = 1.0/N;
int now = i;
while(now<K){
now *= 2;
tmp /= 2;
}
p += tmp;
}
printf("%.12lf\n", p);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define ggr getchar();getchar();return 0;
#define prique priority_queue
constexpr auto mod = 1000000007;
#define inf 1e15
#define key 1e9
using namespace std;
typedef pair<int, int>P;
template<class T> inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template<class T> inline void chmin(T& a, T b) {
a = std::min(a, b);
}
const int MAX = 2330000;
int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COMB(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)cnt++;
}
if (cnt != 1)return false;
else return n != 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= (i % mod); res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
class UnionFind {
protected:
int* par, * rank, * size;
public:
UnionFind(unsigned int size) {
par = new int[size];
rank = new int[size];
this->size = new int[size];
rep(i, size) {
par[i] = i;
rank[i] = 0;
this->size[i] = 1;
}
}
int find(int n) {
if (par[n] == n)return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m)return;
if (rank[n] < rank[m]) {
par[n] = m;
size[m] += size[n];
}
else {
par[m] = n;
size[n] += size[m];
if (rank[n] == rank[m])rank[n]++;
}
}
bool same(int n, int m) {
return find(n) == find(m);
}
int getsize(int n) {
return size[find(n)];
}
};
int dight(int n) {
int ans = 1;
while (n >= 10) {
n /= 10;
ans++;
}
return ans;
}
int dight_sum(int n) {
int sum = 0;
rep(i, 20)sum += (n % (int)pow(10, i + 1)) / (pow(10, i));
return sum;
}
int dight_min(int n) {
int ans = 9;
while (n >= 10) {
ans = min(ans, n % 10);
n /= 10;
}
ans = min(ans, n);
return ans;
}
int dight_max(int n) {
int ans = 0;
while (n >= 10) {
ans = max(ans, n % 10);
n /= 10;
}
ans = max(ans, n);
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int f(int l, int x) {
if (l == 1 && x == 1)return 1;
if (x == 1)return 0;
if (x <= pow(2, l) - 2)return f(l - 1, x - 1);
if (x == pow(2, l) - 1)return f(l - 1, x - 2) + 1;
if (x != pow(2, l + 1) - 3)return f(l - 1, pow(2, l) - 3) + f(l - 1, x - pow(2, l) + 1) + 1;
return f(l - 1, pow(2, l) - 3) * 2 + 1;
}
signed main() {
int n, x;
cin >> n >> x;
n++;
cout << f(n, x) << endl;
ggr
}
| 0
| 17,396,406
|
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
int n;
long long int ans=1;
cin>>n;
rep(i,1,n+1){
ans*=i;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int main(){
ll n; cin >> n;
vector<ll> div;
for(ll i=1; i*i<=n; i++){
if(n%i==0){
div.push_back(i);
if(n/i!=i) div.push_back(n/i);
}
}
sort(ALL(div));
ll sum=0;
for(auto x: div){
ll obj = n/x-1;
if(obj<1) continue;
if(n/obj == n%obj) sum += obj;
}
cout << sum << endl;
}
| 0
| 21,580,054
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long N,M;
cin>>N>>M;
vector<long> a(N);
for(int i=0;i<N;i++){
cin>>a[i];
a[i]%=M;
}
long ans=0;
vector<long> r(N);
r[0]=a[0];
if(r[0]==0) ans++;
for(int i=1;i<N;i++){
r[i]=r[i-1]+a[i];
r[i]%=M;
if(r[i]==0) ans++;
}
map<long,long> modm;
for(int i=0;i<N;i++){
modm[r[i]]++;
}
for (auto& x:modm) {
long n=x.second;
ans+=n*(n-1)/2;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
bool debug = 0;
void solve() {
ll x, y;
cin >> x >> y;
ll ans = INF;
if (y >= x) {
ans = min(ans, y - x);
}
if (y >= x * (-1)) {
ans = min(ans, y + x + 1);
}
if (y * (-1) >= x) {
ans = min(ans, -y - x + 1);
}
if (y * (-1) >= x * (-1)) {
ans = min(ans, -y + x + 2);
}
cout << ans << endl;
}
int main() {
if (debug) {
while (true) {
cout << "********" << endl;
solve();
}
} else {
solve();
}
return 0;
}
| 0
| 28,195,032
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
ll n,a[200000],sum,x,ans;
int main(){
cin>>n;
rep(i,n)cin>>a[i];
rep(i,n){
while(x<n&&(sum^a[x])==sum+a[x]){
sum+=a[x];
x++;
}
ans+=x-i;
sum^=a[i];
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 998244353
using namespace std;
typedef long long ll;
ll power(ll n, ll p, ll mod) {
ll ans = 1;
while (p > 0) {
if (p & 1) ans = ans * n % mod;
n = n * n % mod;
p >>= 1;
}
return ans;
}
int main() {
int N; cin >> N;
vector<int> D(N);
REP(i, 0, N) cin >> D[i];
int count[N] = {};
REP(i, 0, N) count[D[i]]++;
if (D[0] != 0 || count[0] != 1) {
cout << 0 << endl;
return 0;
}
ll ans = 1; int M = 1;
REP(i, 1, N) {
if (count[i] == 0) break;
ans = (ans * power(count[i - 1], count[i], MOD)) % MOD;
M += count[i];
}
if (N == M) cout << ans % MOD << endl;
else cout << 0 << endl;
return 0;
}
| 0
| 40,907,973
|
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
string s;
cin >> s;
if(s[2] == s[3] & s[4] == s[5])
cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define MOD 1000000007
int main(void)
{
string S;
ll A,B,C,D;
cin >> S;
A = S[0] - '0';
B = S[1] - '0';
C = S[2] - '0';
D = S[3] - '0';
char ope1,ope2,ope3;
REP (i,8) {
if (A + B + C + D == 7) { ope1 = '+'; ope2 = '+'; ope3 = '+'; }
else if (A - B + C + D == 7) { ope1 = '-'; ope2 = '+'; ope3 = '+'; }
else if (A + B - C + D == 7) { ope1 = '+'; ope2 = '-'; ope3 = '+'; }
else if (A - B - C + D == 7) { ope1 = '-'; ope2 = '-'; ope3 = '+'; }
else if (A + B + C - D == 7) { ope1 = '+'; ope2 = '+'; ope3 = '-'; }
else if (A - B + C - D == 7) { ope1 = '-'; ope2 = '+'; ope3 = '-'; }
else if (A + B - C - D == 7) { ope1 = '+'; ope2 = '-'; ope3 = '-'; }
else if (A - B - C - D == 7) { ope1 = '-'; ope2 = '-'; ope3 = '-'; }
else { cout << "error" << endl;}
}
cout << A << ope1 << B << ope2 << C << ope3 << D << "=7" << endl;
return 0;
}
| 0
| 2,115,240
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define pf(n) cout << n << endl
#define ps() cout <<" ";
#define sf(n) cin >> n
#define vi vector<int>
#define vp vector<pair<int, int>>
#define graph vector< vector<int> >
#define vs vector<string>
#define mn -
#define pls +
#define mod %
#define E =
#define EE ==
#define le <=
#define ge >=
int mx=9999999;
void yes()
{
cout<<"yes\n";
}
void no()
{
cout<<"no\n";
}
void YES()
{
cout<<"YES\n";
}
void NO()
{
cout<<"NO\n";
}
void Case(int i,int n)
{
cout<<"Case:"<<i<<" "<<n<<endl;
}
inline int inc(int i,int j)
{
return i + j;
}
inline int dec(int i,int j)
{
return i - j;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string a,b;
cin>>a>>b;
int mx E 0;
for(int i E 0;i le a.length() mn b.length();i E i pls 1)
{
int c E 0;
for(int j E 0,k E i;j<b.length();j E inc(j,1),k E inc(k,1))
{
if(b[j] EE a[k])c E inc(c,1);
}
if(c > mx)
mx E c;
}
pf(b.length() mn mx);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<pii> td(N);
for (int i = 0; i < N; ++i) {
cin >> td[i].first >> td[i].second;
td[i].first--;
}
auto cmp = [&](pii a, pii b) { return a.second == b.second ? a.first < b.first : a.second > b.second; };
sort(td.begin(), td.end(), cmp);
priority_queue<int, vector<int>, greater<int>> que1;
priority_queue<int> que2;
vector<bool> isused(N);
int cnt = 0;
ll pt = 0;
for (int i = 0; i < K; ++i) {
if (isused[td[i].first])
que1.push(td[i].second);
else {
isused[td[i].first] = true;
cnt++;
}
pt += td[i].second;
}
for (int i = K; i < N; ++i) {
if (!isused[td[i].first]) {
isused[td[i].first] = true;
que2.push(td[i].second);
}
}
ll ans = pt + (ll)cnt * cnt;
while (!que1.empty() && !que2.empty()) {
pt -= que1.top();
pt += que2.top();
que1.pop();
que2.pop();
cnt++;
ans = max(ans, pt + (ll)cnt * cnt);
}
cout << ans << endl;
return 0;
}
| 0
| 60,789,168
|
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int MOD = 1e9+7;
const int N = 5*1e5;
int main(){
AC
int s, w;
cin>>s>>w;
if(w>=s)
cout<<"unsafe"<<endl;
else
cout<<"safe"<<endl;
}
|
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B;
string S, T;
const ll MOD = (1e+9) + 7;
const ll INF = 1LL << 60;
typedef pair<ll,ll> P;
string ans = "";
bool f(ll a){
cout<<"? "<<ans<<a;
rep(i, 15 - to_string(a).size() - ans.size()) cout<<9;
cout<<endl;
char c;
cin>>c;
return c == 'Y';
}
bool f2(ll a){
cout<<"? "<<a<<endl;
char c;
cin>>c;
return c == 'Y';
}
int main() {
rep(i,9){
if(f(4)){
if(f(2)){
if(f(1)) {
if(i == 0){
if(f2(1e+16)) {
ll temp = 9, re = 1;
while (!f2(temp)) {
re *= 10;
temp *= 10;
temp += 9;
}
cout <<"! "<< re << endl;
return 0;
}else{
ans.push_back('1');
}
}else{
ans.push_back(f(0) ? '0' : '1');
}
}else{
ans.push_back('2');
}
}else{
ans.push_back(f(3) ? '3' : '4');
}
}else{
if(f(7)){
if(f(6)){
ans.push_back(f(5) ? '5' : '6');
}else{
ans.push_back('7');
}
}else{
ans.push_back(f(8) ? '8' : '9');
}
}
}
ll temp = 10, re = 1;
while (f2(temp)) {
++re;
temp *= 10;
}
cout<<"! "<<ans.substr(0, re)<<endl;
}
| 0
| 36,615,448
|
#include <iostream>
#include <string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#define INF long long int(1e18+1)
#define rep(i,n,m) for(int i=n;i<m;i++)
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long int>a(n);
rep(i, 0, n)cin >> a[i];
sort(a.begin(), a.end());
rep(i, 1, n) {
if (a[i] == a[i - 1]) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include<bits/stdc++.h>
#define endl "\n"
#define ll long long
#define PI acos(-1.0)
#define test cout<<"\n****\n"
#define precise fixed(cout);cout<<setprecision(12)
#define fast ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
int main(){
string str;
cin>>str;
if(str[0]=='R' && str[1]=='R' && str[2]=='R'){
cout<<"3\n";
}
else if((str[0]=='R' && str[1]=='R') || (str[1]=='R' && str[2]=='R')){
cout<<"2\n";
}
else if(str[0]=='R' || str[1]=='R' || str[2]=='R'){
cout<<"1\n";
} else{
cout<<"0\n";
}
return 0;
}
| 0
| 37,135,503
|
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, m, n) for(int i = m; i < n; ++i)
#define rrep(i,n) for(int i = n; i >= 0; --i)
#define RREP(i, m, n) for(int i = n; i >= m; --i)
#define llrep(i, n) for(ll i = 0; i < n; ++i)
#define llREP(i, m, n) for(ll i = m; i < n; ++i)
#define llrrep(i,n) for(ll i = n; i >= 0; --i)
#define llRREP(i, m, n) for(ll i = n; i >= m; --i)
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
using pil = std::pair<int, long long>;
using pli = std::pair<long long, int>;
using plpii = std::pair<long long, std::pair<int, int>>;
using pdd = std::pair<double, double>;
const long long INF = 1000000000000000001;
const long long _MOD = 1000000007;
const long long MOD = 998244353;
const int ALPHABET = 27;
const double pi = 3.14159265358979;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans = 0;
deque<char> stack;
rep(i, s.length()) {
if (stack.empty()) {
stack.push_back(s[i]);
continue;
}
if (stack.back() != s[i]) {
ans += 2;
stack.pop_back();
}
else {
stack.push_back(s[i]);
}
}
cout << ans << "\n";
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<vector>
#include<ctime>
#define ll long long
#define pr(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define N 2010000
struct node
{
ll to,next;
}e[N*3];
ll size,o,p,vis[N],tag[N],g[N],f,n,m,i,du[N],I,P,Q;
void add(ll o,ll p)
{
e[++size].to=p;
e[size].next=g[o];
g[o]=size;
}
void dfs(ll x)
{
vis[x]=1;
for (ll k=g[x];k;k=e[k].next)
{
ll y=e[k].to;
{
if (vis[y]==0)
{
tag[y]=tag[x]^1;
dfs(y);
}
else
{
if (tag[x]==tag[y]) f=0;
}
}
}
}
int main()
{
scanf("%lld %lld",&n,&m);
for (i=1;i<=m;i++)
{
scanf("%lld %lld",&o,&p);
add(o,p);
add(p,o);
du[o]++;du[p]++;
}
for (i=1;i<=n;i++)
{
if (vis[i]==1) continue;
if (du[i]==0)
{
I++;
continue;
}
f=1;
dfs(i);
if (f==1) Q++;
else P++;
}
ll ans=2*I*n-I*I+P*P+2*P*Q+2*Q*Q;
printf("%lld\n",ans);
return 0;
}
| 0
| 33,525,493
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n; cin >> n;
rep(i,25){
rep(y,14){
if(4*i+7*y==n){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, r, s, p;
string t;
cin >> n >> k >> r >> s >> p >> t;
int ans = 0;
map<char, bool> flag;
for (int i = 0; i < n; i++) {
if (i >= k && t[i] == t[i - k]) {
t[i] = 'x';
continue;
}
if (t[i] == 'r') {
ans += p;
} else if (t[i] == 's') {
ans += r;
} else {
ans += s;
}
}
cout << ans << '\n';
return 0;
}
| 0
| 86,402,642
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <stdio.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
int st[10001];
int en[10001];
vector < pair <int , int > > v;
int main(){
int n;
while(cin >> n,n){
int h,m,s;
v.clear();
REP(i,n){
scanf("%d:%d:%d",&h,&m,&s);
v.push_back(make_pair(h*3600+m*60+s,1));
scanf("%d:%d:%d",&h,&m,&s);
v.push_back(make_pair(h*3600+m*60+s,-1));
}
sort(All(v));
int res , ans ;
res = ans = 0;
for(int i = 0 ; i < v.size();++i){
res += v[i].second;
ans = max(ans,res);
}
printf("%d\n",ans);
}
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> ts;
vector<int> xs;
vector<int> ys;
bool solve(const int N) {
for (int i = 1; i <= N; i++) {
int diff_t = ts[i] - ts[i - 1];
int diff_x = abs(xs[i] - xs[i - 1]);
int diff_y = abs(ys[i] - ys[i - 1]);
if (diff_t < diff_x + diff_y) {
return false;
}
if (abs(diff_x + diff_y - diff_t) % 2 != 0) {
return false;
}
}
return true;
}
int main(void) {
int N;
cin >> N;
ts.resize(N + 1);
xs.resize(N + 1);
ys.resize(N + 1);
ts[0] = 0;
xs[0] = 0;
ys[0] = 0;
for (int i = 1; i <= N; i++) {
int t, x, y;
cin >> t >> x >> y;
ts[i] = t;
xs[i] = x;
ys[i] = y;
}
if (solve(N)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 17,154,134
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s,left,right;
int a, b;
while (cin >> s, s != "-") {
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
left = s.substr(0, b);
right = s.substr(b);
s = right + left;
}
cout << s << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
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,m;
cin >> n >> m;
int h[n];
REP(i,n) cin >> h[i];
vector<int> to[100010];
REP(i,m){
int a,b;
cin >> a >> b;
a--;b--;
to[a].push_back(b);
to[b].push_back(a);
}
int cnt=0;
REP(i,n){
bool flag=true;
for(int v : to[i]){
if(h[i]<=h[v]){
flag=false;
break;
}
}
if(flag) cnt++;
}
cout << cnt;
return 0;
}
| 0
| 22,722,462
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#include <string>
const int mxN=2e5;
const int maxN=5e3;
#define ld long double
#define pb push_back
#define mp make_pair
#define ins insert
#define vi vector<int>
int main()
{
int n,k;
cin >> n >> k;
vector<int> a(n);
for(int i=0;i<n;i++)
cin >> a[i];
sort(a.begin(),a.end());
int ans=0;
for(int i=0;i<k;i++)
ans+=a[i];
cout << ans;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x)))
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return 0;
}
template <typename T>
T lcm(T x, T y)
{
T z = gcd(x, y);
return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++)
{
if (n % i == 0)
{
return false;
}
i++;
}
return true;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main()
{
cout << fixed << setprecision(30);
ll n;
cin >> n;
vec a(n), b(n);
loop(i, n) cin >> a[i] >> b[i];
vector<pair<ll, ll>> c(n);
loop(i, n)
{
c[i] = make_pair(a[i] + b[i], a[i]);
}
sort(all(c));
reverse(all(c));
ll T = 0, A = 0;
loop(i, n)
{
if (i % 2 == 0)
T += c[i].second;
else
A += c[i].first - c[i].second;
}
putout(T - A);
return 0;
}
| 0
| 54,536,964
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep2(i, 1, n + 1) cin >> a[i];
if (n % 2 != 0) {
for (int i = n; i > 0; i -= 2) {
cout << a[i];
if (n != 1) cout << " ";
}
for (int i = 2; i <= n - 1; i += 2) {
cout << a[i];
if (i != n - 1) cout << " ";
}
cout << endl;
} else {
for (int i = n; i >= 2; i -= 2) {
cout << a[i] << " ";
}
for (int i = 1; i <= n - 1; i += 2) {
cout << a[i];
if (i != n - 1) cout << " ";
}
cout << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
using ull = unsigned long long;
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
static int divisors[1 << 24];
for (int i = 1; i < 1 << 24; ++i) {
for (int j = 1; i*j <=n; ++j) {
divisors[i*j] += 1;
}
}
ll ans = 0;
for(int i = 1; i < n+1; ++i) {
ans += ll(i) * divisors[i];
}
cout << ans << endl;
return 0;
}
| 0
| 81,249,981
|
#include<bits/stdc++.h>
int a[100035],n,l,t,x,y;
long long cnt;
int main()
{
scanf("%d%d%d",&n,&l,&t);
for (int i=1; i<=n; i++)
{
scanf("%d%d",&x,&y);
if (y==1){
x += t;
cnt += x/l;
x %= l;
}else{
cnt += (x-t)/l;
x = (x-t)%l;
if (x < 0) cnt--, x += l;
}
a[i] = x;
}
std::sort(a+1, a+n+1);
((cnt%=n)+=n)%=n;
for (int i=cnt+1; i<=n; i++) printf("%d\n",a[i]);
for (int i=1; i<=cnt; i++) printf("%d\n",a[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B) { cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld", &n)
#define pri(n) printf("%d ", (int)(n))
#define prin(n) printf("%d\n", (int)(n))
#define lpri(n) printf("%lld ", n)
#define lprin(n) printf("%lld\n", n)
#define rep(i,a,b) for(int i=a; i<(int)b; i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
const int inf = INT_MAX;
const int ninf = INT_MIN;
const int mod = 1e9+7;
const int maxN = 1e6+2;
int main()
{
int n;
scn(n);
ll ans = 0;
int bit[22] = {0};
int l = 0;
rep(i, 1, n + 1) {
int val;
scn(val);
rep(k, 0, 21) {
if(val >> k & 1) {
l = max(l, bit[k]);
bit[k] = i;
}
}
ans += i - l;
}
lprin(ans);
}
| 0
| 83,272,705
|
#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 () {
ios::sync_with_stdio(0);
cin.tie(0);
int S,W;
cin >> S >> W;
if (S <= W) {
cout << "unsafe" << endl;
}
else {
cout << "safe" << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
int t[N+1];
int x[N+1];
int y[N+1];
t[0] = x[0] = y[0] = 0;
for(int i = 0; i < N; i++) {
cin >> t[i+1] >> x[i+1] >> y[i+1];
}
bool flag = true;
for(int i = 0; i < N; i++){
int dt = t[i+1] - t[i];
int dist = abs(x[i+1]-x[i]) + abs(y[i+1]-y[i]);
if(dist > dt) flag = false;
if(dt%2 != dist%2) flag = false;
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 57,729,395
|
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define sep cout<<"\n";
#define Yes cout<<"Yes\n";
#define No cout<<"No\n";
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
inline string shift(string s){
int n = s.length();
string r = "";
r+=s[n-1];
for(int i=0;i<n-1;i++)r+=s[i];
return r;
}
int main(){
string s;
cin>>s;
int n = s.length();
if(s[0]!='A')cout<<"WA\n";
else{
bool flag = true;
bool c = false;
if(s[1]=='C' || s[1]<97){
flag = false;
}
for(int i=2;i<n-1;i++){
if(s[i]<97 && s[i]!='C'){
flag = false;
break;
}
if(s[i] == 'C'){
if(c == false)c = true;
else {
flag = false;
break;
}
}
}
if(s[n-1]<97)flag = false;
if(flag && c)cout<<"AC\n";
else cout<<"WA\n";
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N;
string S;
cin >>S;
sort(all(S));
rep(i,S.size()-1){
if(S[i+1]==S[i]){
cout<<"no"<<endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
| 0
| 70,033,955
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a.begin(), a.end());
cout << a[0] << " " << a[n-1] << " " << sum << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
using namespace std;
int main() {
long long int N, A, B, ans;
cin >> N >> A >> B;
if (A > B || (N == 1 && A != B)) {
ans = 0;
}
else if (A == B) {
ans = 1;
}
else {
if (N == 2) {
ans = B - A + 1;
}
else {
ans = B * (N - 1) + A - A * (N - 1) - B + 1;
}
}
cout << ans;
return 0;
}
| 0
| 74,376,971
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, x;
cin >> n >> x;
int dd[n];
for (int i = 0; i < n; i++) {
int xx;
cin >> xx;
dd[i] = abs(x - xx);
}
if (n == 1) {
cout << dd[0] << endl;
return 0;
}
int ans = gcd(dd[0], dd[1]);
for (int i = 2; i < n; i++) {
ans = gcd(ans, dd[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
ll price[4];
rep(i,4){
cin >> price[i];
}
price[0] *= 4; price[1] *= 2;
ll price_1L(min({price[0],price[1],price[2]}));
ll n; cin >> n;
if(price_1L*2<=price[3]){
cout << n*price_1L << endl;
}else if(n%2==0){
cout << n/2*price[3] << endl;
}else{
cout << n/2*price[3]+price_1L << endl;
}
return 0;
}
| 0
| 65,597,051
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int x;
cin >> x;
for (int i = 0; i < 10011; i++) {
if (100 * i <= x && x <= 100 * i + 5 * i) {
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <set>
using namespace std;
const long long N = 1e10 + 7;
const int maxn = 2e5 + 5;
const long long INF = 8e18;
typedef long long ll;
#define for0(i,n) for(int i = 0;i < n;i++)
#define for1(i,n) for(int i = 1;i <= n;i++)
int main()
{
int a,b,c,n;
cin >> a >> b >> c >> n;
while(n && a >= b){
b *= 2;
n--;
}
while(n && b >= c){
c *= 2;
n--;
}
if(b > a && c > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 0
| 29,544,840
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
while(true){
int ans = mod;
int N; cin >> N;
if(N == 0) break;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
rep(i, N-1) ans = min(ans, A[i+1]-A[i]);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int min(vector<int> x) {
int min = -1;
rep(i, x.size()) {
if(min == -1 || min > x[i])
min = x[i];
}
return min;
}
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
vector<int> x(M);
vector<int> y(M);
vector<int> c(M);
rep(i, A) cin >> a[i];
rep(i, B) cin >> b[i];
rep(i, M) cin >> x[i] >> y[i] >> c[i];
int amin = min(a);
int bmin = min(b);
int ans = amin+bmin;
rep(i,M){
ans = min(ans,a[x[i]-1]+b[y[i]-1]-c[i]);
}
cout << ans <<endl;
}
| 0
| 68,836,804
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c;
cin>>k;
for(int i=0;i<k;i++)
{
if(a>=b)
{
b*=2;
}
else if(b>=c)
{
c*=2;
}
}
if(a<b && b<c)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
|
#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 mod 1000000007
typedef long long ll;
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 main() {
ll n;
cin >> n;
auto pf = prime_factorize(n);
ll res = 0;
for(auto p : pf){
ll prime = p.first;
ll kazu = p.second;
ll check = 1;
while(kazu >= check){
kazu -= check;
check++;
res++;
}
}
cout << res << endl;
return 0;
}
| 0
| 50,875,975
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<ll>;
using vvi=vector<vi>;
using vd=vector<double>;
using vvd=vector<vd>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using vs=vector<string>;
#define rep(i,n) range(i,0,n)
#define range(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.141592653589793
template<class S,class T>ostream& operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s; a=0;} return os;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
if(n==1){
cout<<"Yes"<<endl;
cout<<2<<endl;
cout<<"1 1"<<endl;
cout<<"1 1"<<endl;
return 0;
}
if(n==2){
cout<<"No"<<endl;
return 0;
}
ll d=floor(sqrt(n*2))+1;
if(d*d-d!=n*2){
cout<<"No"<<endl;
return 0;
}
vvi ans(d);
int p=0,q=1;
rep(i,n){
ans[p].push_back(i+1);
ans[q].push_back(i+1);
if(++q==d){
q=++p+1;
}
}
cout<<"Yes"<<endl;
cout<<d<<endl;
rep(i,d){
cout<<ans[i].size()<<" "<<ans[i]<<endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
bool flag = true;
unordered_map<int, int> mp;
for (int i = 0; i < n; ++i)
{
int x;
cin >> x;
mp[x]++;
if (mp[x] > 1)
{
flag = false;
break;
}
}
if (flag)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
return 0;
}
| 0
| 68,576,219
|
#include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
map<ll,int> A;
REP(i,N){
int a; cin >> a;
A[a]++;
}
ll max1 = 0;
ll max2 = 0;
for(auto a: A){
if(a.second>=2 && a.second<4){
max2 = max1;
max1 = a.first;
}else if(a.second>=4){
max1 = a.first;
max2 = a.first;
}
}
cout << max1*max2 << endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
char c[10][5];
c[1][0] = '.';c[1][1] = ',';c[1][2] = '!';c[1][3] = '?';c[1][4] = ' ';
c[2][0] = 'a';c[2][1] = 'b';c[2][2] = 'c';
c[3][0] = 'd';c[3][1] = 'e';c[3][2] = 'f';
c[4][0] = 'g';c[4][1] = 'h';c[4][2] = 'i';
c[5][0] = 'j';c[5][1] = 'k';c[5][2] = 'l';
c[6][0] = 'm';c[6][1] = 'n';c[6][2] = 'o';
c[7][0] = 'p';c[7][1] = 'q';c[7][2] = 'r';c[7][3] = 's';
c[8][0] = 't';c[8][1] = 'u';c[8][2] = 'v';
c[9][0] = 'w';c[9][1] = 'x';c[9][2] = 'y';c[9][3] = 'z';
cin >>n;
while(n--){
string s;
cin >>s;
for(int i=0,a=0,b=0; i<s.size(); i++){
if(s[i] == '0' && a == 0) continue;
else if(s[i] == '0' && a!=0){
if(a == 1) b%=5;
else if(a == 7 || a == 9) b%=4;
else b%=3;
cout <<c[a][b];
a = 0;
b = 0;
}
else if(s[i] != '0' && a == 0) a = s[i]-'0';
else if(s[i] != '0' && a!=0) b++;
}
cout <<endl;
}
return 0;
}
| 0
| 20,674,274
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=998244353;
const ll INF=1000000000000000;
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;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
ll mod_pow(ll x,ll n,ll mod){ll res=1;while(n>0){if(n&1) res=res*x%mod;x=x*x%mod;n>>=1;}return res;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
ll high_order_bit(ll n){ll tmp=1,i=-1;while(tmp<=n){tmp*=2;i++;}if(n==0) return 0;else return i;}
vector<ll> binary_expansion(ll n){vector<ll> B(high_order_bit(n)+1);ll tmp=n;for(ll i=high_order_bit(n);i>=0;i--){B[i]=tmp/pw2[i];tmp%=pw2[i];}return B;}
vector<ll> divisor(ll x){vector<ll> div;for(ll i=1;i*i<=x;i++){if(i*i!=x && x%i==0){div.pb(i);div.pb(x/i);}else if(x%i==0) div.pb(i);}sort(all(div));return div;}
vector<ll> vectorprime(ll x){vector<bool> is_prime(x+1);vector<ll> prime;rep(i,x+1) is_prime[i]=true;is_prime[0]=is_prime[1]=false;for(ll i=2;i<=x;i++){if(is_prime[i]){prime.pb(i);}for(int j=i*2;j<=x;j+=i) is_prime[j]=false;}return prime;}
map<ll,ll> prime_factor(ll x){map<ll,ll> m;ll sq=(ll)sqrt(x) + 1;vector<ll> v_prime=vectorprime(sq);ll tmp=x;rep(i,sz(v_prime)){ll count=0;while(tmp % v_prime[i] == 0){tmp /= v_prime[i];count++;}if(count != 0) m[v_prime[i]]=count;if(tmp==1) break;}if(tmp != 1) m[tmp]=1;return m;}
ll fac[500001],finv[500001],inv[500001],dx[9]={0,0,1,-1,1,1,-1,-1,0},dy[9]={1,-1,0,0,1,-1,1,-1,0};
void table(){fac[0]=fac[1]=1;finv[0]=finv[1]=1;inv[1]=1;for(ll i=2;i<500001;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 dev(long long a,long long b){return (a*inv[b])%MOD;}
ll comb(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 perm(ll n,ll k){if(n<k) return 0;if(n<0 || k<0) return 0;return (fac[k]*comb(n,k))%MOD;}
int main(){
{table();}
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll H,W; cin>>H>>W;
ll ans=0;
vector<vector<char> > f(H+2,vector<char>(W+2));
vector<vector<ll> > U(H+2,vector<ll>(W+2,0));
vector<vector<ll> > R(H+2,vector<ll>(W+2,0));
vector<vector<ll> > D(H+2,vector<ll>(W+2,0));
vector<vector<ll> > L(H+2,vector<ll>(W+2,0));
rep1(i,H){
string s; cin>>s;
rep1(j,W) f[i][j]=s[j-1];
}
rep1(j,W)rep1(i,H){
if(f[i][j]=='.') U[i][j]=U[i-1][j]+1;
}
rep1(j,W)rrep1(i,H){
if(f[i][j]=='.') D[i][j]=D[i+1][j]+1;
}
rep1(i,H)rep1(j,W){
if(f[i][j]=='.') L[i][j]=L[i][j-1]+1;
}
rep1(i,H)rrep1(j,W){
if(f[i][j]=='.') R[i][j]=R[i][j+1]+1;
}
rep1(i,H)rep1(j,W){
if(f[i][j]=='.') chmax(ans,U[i][j]+D[i][j]+L[i][j]+R[i][j]-3);
}
cout<<ans<<endl;
}
|
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline int read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x:-x;
}
int t[maxn],F,n,ind[maxn],ans[maxn];
vector <int> mp[maxn];
int main()
{
n=read();
rep(i,1,(n-1))
{
int u=read(),v=read();
mp[u].pb(v); mp[v].pb(u); ind[u]++; ind[v]++;
}
rep(i,1,n)
{
for(int j=0;j<mp[i].size();j++)
{
int v=mp[i][j];
t[i]+=(ind[v]==1);
}
}
rep(i,1,n)
{
if(t[i]==0&&ind[i]!=1)
for(int j=0;j<mp[i].size();j++)
{
int v=mp[i][j];
ans[i]+=(t[v]>=1);
}
if(ans[i]==mp[i].size()) F=1;
}
rep(i,1,n) if(t[i]>=2) F=1;
if(F||n%2==1) puts("First"); else puts("Second");
return 0;
}
| 0
| 31,592,615
|
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int r,g,b,n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(i, n + 1){
rep(j, n + 1){
if(i * r + j * g > n) continue;
int B = n - i * r - j * g;
if(B % b != 0) continue;
if(i * r + j * g + B == n) ans++;
}
}
print(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T>
void printlnVector(T v)
{
rep(i, v.size())
{
cout << v[i] << endl;
}
}
template <typename T>
void printVector(T v)
{
rep(i, v.size())
{
cout << v[i] << " ";
}
cout << endl;
}
struct WeightedUnionFind
{
vector<pair<int, int>> d;
WeightedUnionFind(int n = 0) : d(n, make_pair(-1, 0)) {}
int find(int x)
{
if (d[x].first < 0)
return x;
int r = find(d[x].first);
d[x].second += d[d[x].first].second;
return d[x].first = r;
}
bool unite(int x, int y, int l)
{
l = dist(x) + l - dist(y);
x = find(x);
y = find(y);
if (x == y)
return false;
if (d[x].first > d[y].first)
{
swap(x, y);
l *= -1;
}
d[x].first += d[y].first;
d[y].first = x;
d[y].second = l;
return true;
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return -(d[find(x)].first); }
int dist(int x)
{
find(x);
return d[x].second;
}
int diff(int x, int y) { return dist(y) - dist(x); }
};
int main()
{
int N, M;
cin >> N >> M;
WeightedUnionFind uf(N);
bool is_ok = true;
rep(i, M)
{
int L, R, D;
cin >> L >> R >> D;
--L;
--R;
if (uf.same(L, R))
{
if (uf.diff(L, R) != D)
is_ok = false;
}
else
{
uf.unite(L, R, D);
}
}
printYesNo(is_ok);
return 0;
}
| 0
| 91,106,305
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL<<61;
template<class T>bool chmax(T &a, const T &b) {
if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) {
if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P){if(P==0) return 1;
if(P%2==0){ll t = jou(N, P/2);return t*t % mod;
}return (N * jou(N, P-1)) % mod;}
int main() {
int n;
cin>>n;
vector<ll> p(n);
ll ans=0;
rep(i,n){
cin>>p[i];
ans+=abs(p[i]);
}
sort(all(p));
if(p[0]>0) cout << ans-2*p[0] << endl;
else if (p[n-1]<0) cout << ans+2*p[n-1] << endl;
else cout << ans << endl;
int now=n-2;
while(now>0 && p[now]>=0){
cout << p[0] << " " << p[now] << endl;
p[0]-=p[now];
now--;
if(now==0) break;
}
cout << p[n-1] << " " << p[0] << endl;
p[n-1]-=p[0];
now=1;
while(now<n-1 && p[now]<0){
cout << p[n-1] << " " << p[now] << endl;
p[n-1]-=p[now];
now++;
if(now==n-1) break;
}
}
|
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define rrepi(i, a, b) for(intl i = (intl)(a) - 1; i >= (intl)(b); i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,1,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define alength(a) (sizeof(a) / sizeof(a[0]))
#define debug(x) cout << #x << ":" << x << endl
#define rdebug(i,x) rep(i, alength(x))cout << #x << "[" << i << "]:" << x[i] << endl
#define rrdebug(i, j, x) rep(i, alength(x))rep(j, alength(x[i]))cout << #x << "[" << i << "][" << j << "]:" << x[i][j] << endl
#define pb push_back
#define mp make_pair
#define pii pair<intl,intl>
const intl INF = 1e9;
const intl MOD = 1e9+7;
const ld EPS = 1.0e-14;
const ld PI = acos(-1);
void fp(bool f){cout << (f ? "Yes" : "No") << endl;}
void fp(bool f, string s, string t){cout << (f ? s : t) << endl;}
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; }
intl gcd(intl a, intl b){ if(!b)return a; return gcd(b, a % b); }
intl lcm(intl a,intl b){ return a / gcd(a, b) * b; }
intl kai(intl k){
intl a = 1;
for(int i = 2; i <= k; i++){
a *= i;
}
return a;
}
intl digit10(intl a){
intl b = 0;
do{
a /= 10;
b++;
}while(a);
return b;
}
signed main(){
cout << fixed << setprecision(10);
intl n,m;
cin >> n >> m;
intl a[n];
rep(i,n)cin >> a[i];
priority_queue<intl> q;
rep(i,n)q.push(a[i]);
rep(i,m){
intl a = q.top();
q.pop();
a /= 2;
q.push(a);
}
intl cnt = 0;
rep(i,n){
cnt += q.top();
q.pop();
}
cout << cnt << endl;
return 0;
}
| 0
| 16,597,587
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int N;
cin >> N;
vector<float> v(N);
rep(i,N) cin >> v.at(i);
sort(v.begin(),v.end());
float x;
rep(i,N-1){
x = (v.at(i)+v.at(i+1))/2;
v.at(i+1) = x;
}
cout << v.at(N-1) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
double sum=0;
int n;
cin>>n;
while(n--)
{
double x;
cin>>x;
string s;
cin>>s;
if(s=="JPY")
sum+=x;
else
{
sum+=(x*380000.0);
}
}
cout<<setprecision(10)<<fixed<<sum<<endl;
return 0;
}
| 0
| 40,861,522
|
#include <iostream>
#include <vector>
int main()
{
int n; std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
{
std::cin >> v[i];
}
std::sort(v.begin(), v.end());
size_t dd = n / 2;
std::cout << (v[dd] - v[dd-1]) << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli h, n;
int main(void){
cin >> h >> n;
vector<lli> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
lli ma = *max_element(a.begin(), a.end());
vector<lli> dp(h+ma+5, 1e9);
dp[0] = 0;
rep(i, h){
rep(j, n){
chmin(dp[i+a[j]], dp[i]+b[j]);
}
}
lli ans = 1e18;
for(int i = h; i <= h+ma; i++){
ans = min(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
| 0
| 65,412,981
|
#pragma region _head
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<iomanip>
#include<queue>
#include<stack>
#include<numeric>
#include<utility>
#include<regex>
#pragma region _define
#define int LL
#define f(i,a,b) for(LL i=a;i<b;i++)
#define f_vI(v,n) f(i,0,n)cin>>v[i]
#define f_v2I(v1,v2,n) f(i,0,n)cin>>v1[i]>>v2[i]
#define f_v3I(v1,v2,v3,n) f(i,0,n)cin>>v1[i]>>v2[i]>>v3[i]
#define f_vO(v,n) f(i,0,n)cout<<v[i]<<endl
#define ei else if
#define all(a) a.begin(),a.end()
#define size(s) ((LL)s.size())
#define F first
#define S second
#define check() cout<<"! ! !"
#define endl "\n"
#define _y() cout<<"Yes"<<endl
#define _Y() cout<<"YES"<<endl
#define _n() cout<<"No"<<endl
#define _N() cout<<"NO"<<endl
#define int_INF 1<<29
#define ll_INF 1LL<<60
#define MOD 1000000007
#pragma endregion
#pragma region _using
using namespace std;
using LL = long long;
using st = string;
using vi = vector<LL>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vc = vector<char>;
using vs = vector<st>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using qi = queue<LL>;
using qc = queue<char>;
using qs = queue<st>;
using si = stack<LL>;
using sc = stack<char>;
using ss = stack<st>;
using pi = pair<LL, LL>;
using mll = map<LL, LL>;
using vpi = vector<pi>;
#pragma endregion
#pragma region _graph
#define node 50
#define link(a,b,m) f(i,0,m){cin>>a[i]>>b[i]; a[i]--; b[i]--; graph[a[i]][b[i]]=graph[b[i]][a[i]]=true;}
#pragma endregion
void _yn(bool p) {
p ? _y() : _n();
}
void _YN(bool p) {
p ? _Y() : _N();
}
LL gcd(LL a, LL b) {
LL r;
while ((r = a % b) != 0) {
a = b;
b = r;
}
return b;
}
LL lcm(LL a, LL b) {
return (a / gcd(a, b) * b);
}
bool is_prime(int n) {
for (int i = 2; i*i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
LL factorial(LL n) {
LL a = 1, ret = 1;
while (a < n) {
a++;
ret *= a;
ret %= MOD;
}
return ret;
}
#pragma endregion
signed main(void) {
cin.tie(0); ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
_yn(a == b && b == c);
return 0;
}
|
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<map>
#include<vector>
#include<sstream>
#include<iostream>
using namespace std;
struct Data{
char c;
int n;
};
int main(void){
int n;
cin>>n;
string str;
string c[] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
while(n--){
cin>>str;
Data a[1200];
char ch = 'A';
int t = -1;
for(int i = 0;i < str.size();i++){
if(ch == str[i]){
a[t].n++;
}
else{
ch = str[i];
t++;
a[t].c = ch;
a[t].n = 1;
}
}
t++;
for(int i = 0;i < t;i++){
if(a[i].c == '0')continue;
cout<<c[a[i].c - '0' - 1][(a[i].n - 1)%c[a[i].c - '0' - 1].size()];
}
cout<<endl;
}
return 0;
}
| 0
| 15,136,094
|
#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
int gsu(int val) {
int ret = 0;
while(val) {
ret+=val%10;
val/=10;
}
return ret;
}
void solve(int test_case) {
int n,a,b;
cin>>n>>a>>b;
ll sum = 0;
REP(i,1,n) {
int gs = gsu(i);
if(gs>=a&&gs<=b)sum+=i;
}
cout<<sum;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Umap unordered_map
#define Uset unordered_set
int main(){
string s, t;
cin >> s;
cin >> t;
int cnt = 0;
REP(i, 3){
if(s[i] == t[i]) cnt++;
}
cout << cnt;
return 0;
}
| 0
| 63,538,418
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long n; cin >> n;
long cnt = 0;
string s; cin >> s;
vector<int> v(3);
for(int i=0;i<1000;i++){
v[0] = i/100; v[1] = (i%100)/10; v[2] = i%10;
long a = 0;
for(int j=0;j<n;j++){
if(v[a] == (int)(s[j]-'0'))a++;
if(a == 3){
cnt++;
break;
}
}
a = 0;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())
const int MOD = 1000000007;
const int MAX = 201000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
COMinit();
ll n; cin >> n;
string s; cin >> s;
ll ans = 1;
vector<ll> color(2*n,0);
REP(i,2*n){
if(s[i]=='W') color[i] = 1;
if(i%2==0) color[i] = !color[i];
}
ll white = 0;
REP(i,2*n){
white += color[i];
if(color[i]==0){
(ans *= white) %= MOD;
white--;
}
}
if(white != 0){
cout << 0 << endl;
return 0;
}
(ans *= fac[n]) %= MOD;
cout << ans << endl;
}
| 0
| 57,667,783
|
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int popcount( int a ) {
int ret = 0;
for ( int i = 0; i < 32; i++ ) {
if ( a & ( 1 << i ) ) { ret++; }
}
return ret;
}
int main() {
string S;
cin >> S;
vector<int> hash(S.length());
for ( int i = 0; i < S.length(); i++ ) {
if ( !i ) { hash[i] = ( 1 << (S[i]-'a' ) ); }
else { hash[i] = hash[i-1] ^ ( 1 << (S[i]-'a') ); }
}
vector<int> dp( 1<<26 );
for ( int i = 0; i < (1<<26); i++ ) {
dp[i] = INT_MAX-1;
}
for ( int i = 0; i < S.length(); i++ ) {
if ( popcount( hash[i] ) <= 1 ) {
dp[hash[i]] = 1;
continue;
}
for ( int j = 0; j < 26; j++ ) {
dp[hash[i]] = min( dp[hash[i]], dp[ hash[i] ^ ( 1 << j ) ] + 1 );
}
}
cout << dp[hash[S.length()-1]] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int r,c;
cin >> r >> c;
char arr[r][c];
char aaa[r][c];
char bbb[r][c];
for (int i =0;i<r;i++){
for (int j =0;j<c;j++){
cin>>arr[i][j];
}
}
for (int i=0;i<r;i++){
for (int j=0;j<c;j++){
aaa[i][j]=arr[i][j];
bbb[i][j]=arr[i][j];
}
}
for (int i =0;i<r;i++){
for (int j=0;j<c;j++){
cout<<aaa[i][j];
}
cout<<endl;
for (int j=0;j<c;j++){
cout<<bbb[i][j];
}
cout<<endl;
}
return 0;
}
| 0
| 57,441,682
|
#include<iostream>
using namespace std;
int main() {
int N;
cin>>N;
long a[N], b[N], c[N];
long sum = 0;
for(int i=0;i<N;++i){
cin>>a[i];
}
for(int i=0;i<N;++i){
cin>>b[i];
c[i] = a[i] - b[i];
sum -= c[i];
}
bool ans = true;
if(sum<0)ans=false;
long plus = 0;
long minus = 0;
for(int i=0;i<N;++i){
if(c[i]>=0){
plus+=c[i];
}
else{
if(-c[i]%2==1){
minus += -c[i]/2+1;
}
else{
minus += -c[i]/2;
}
}
}
if(sum < plus | sum < minus)ans=false;
if(ans)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int main(){
int n,m;
cin >> n >> m;
vector<string> a(n),b(m);
rep(i,n) cin >> a[i];
rep(i,m) cin >> b[i];
bool ok = false;
rep(i,n-m+1)rep(j,n-m+1){
bool res = true;
rep(x,m)rep(y,m){
if(a[i+x][j+y] != b[x][y]){
res = false;
break;
}
}
if(res){
ok = true;
break;
}
}
cout << (ok?"Yes":"No") << endl;
return 0;
}
| 0
| 26,861,220
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
int n=t.size();
int m=s.size();
int ans=10000;
for(int i=0;i<m-n+1;i++){
int cnt=0;
for(int j=0;j<n;j++){
if(s.at(i+j)==t.at(j)) cnt++;
}
ans=min(ans,n-cnt);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
EACH(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
REP(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
REP(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N;
while (cin >> N, N) {
map<char, char> m;
REP(i, N) {
char c1, c2; cin >> c1 >> c2;
m[c1] = c2;
}
int M; cin >> M;
REP(i, M) {
char c; cin >> c;
if (m.count(c)) {
cout << m[c];
}
else {
cout << c;
}
}
cout << endl;
}
}
| 0
| 14,310,838
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if ((a * b) % 2)
{
cout << "Odd\n";
}
else
{
cout << "Even\n";
}
}
|
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;
typedef unsigned long long ll;
bitset<61> a[100005];
int main() {
int n;
cin >> n;
bitset<61> tmp(0);
for(int i = 0; i < n; i++) {
ll A; cin >> A;
a[i] = A;
tmp ^= A;
}
for(int i = 0; i < n; i++) {
for(int j = 0; j <= 65; j++) {
if(tmp[j] == 1) {
a[i][j] = 0;
}
}
}
int rank = 0;
for(int i = 60; i >= 0; i--) {
int j = rank;
while(j < n && a[j][i] == 0) j++;
if(j == n) continue;
swap(a[rank],a[j]);
for(int k = 0; k < n; k++) {
if(k == rank) continue;
if(a[k][i] == 0) continue;
a[k] ^= a[rank];
}
rank++;
}
for(int i = 1; i < n; i++) a[0] ^= a[i];
a[0] <<= 1;
cout << a[0].to_ullong() + tmp.to_ullong() << endl;
}
| 0
| 40,581,804
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define rt0 return 0;
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(){
ll n;
cin >> n;
mes(n*n);
}
|
#include<iostream>
#include<cmath>
#include<vector>
#include<bitset>
#include<bitset>
#include<string>
#include<utility>
#include<queue>
using namespace std;
int main(){
string s;
cin >> s;
int ansa=0,ansb=0;
for(int i=0;i<s.size();i++){
if(i&1){
if(s.at(i)=='0'){
ansa++;
}else{
ansb++;
}
}else{
if(s.at(i)=='0'){
ansb++;
}else{
ansa++;
}
}
}
cout << min(ansa,ansb) << endl;
return 0;
}
| 0
| 96,413,749
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define me memset
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
using namespace std;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
inline int read()
{
int X=0; bool flag=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') flag=0; ch=getchar();}
while(ch>='0'&&ch<='9') {X=(X<<1)+(X<<3)+ch-'0'; ch=getchar();}
if(flag) return X;
return ~(X-1);
}
int n,m;
char s[2000][2000];
int dp[2000][2000];
int main() {
n=read();
m=read();
for(int i=1;i<=n;++i){
scanf("%s",s[i]+1);
}
dp[1][1]=1;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
if(s[i][j]!='#' && i+j!=2){
dp[i][j]=dp[i-1][j]+dp[i][j-1];
dp[i][j]%=mod;
}
}
}
printf("%d\n",dp[n][m]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#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 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 ll inf = 1001001001;
int main(){
int n;
ll h;
cin >> n >> h;
vector<ll>a(n);
vector<ll>b(n);
rep(i, 0, n){
cin >> a[i] >> b[i];
}
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
int cnt = 0;
ll damage = 0;
rep(i, 0, n){
if(a[0] > b[i])break;
damage += b[i];
cnt++;
if(damage >= h)break;
}
if(damage >= h){
cout << cnt << endl;
}
else if((h-damage)%a[0] == 0)cout << cnt + (h-damage)/a[0] << endl;
else{
cout << cnt + ((h-damage)/a[0]) +1 << endl;
}
}
| 0
| 21,922,825
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
int main() {
int N;
cin>>N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin>>a[i];
}
sort(a.rbegin(),a.rend());
int a1=a[0],a2,dist=2e9+5;
for (int i = 1; i < N; ++i) {
if(abs(a[i]*2-a1)<dist){
dist=abs(a[i]*2-a1);
a2=a[i];
}
}
cout<<a1<<" "<<a2<<endl;
return 0;
}
|
#include<stdio.h>
struct Vector2D{
double x;
double y;
};
Vector2D sub(const Vector2D a, const Vector2D b){
Vector2D ret;
ret.x = a.x-b.x;
ret.y = a.y-b.y;
return ret;
}
bool hittest_point(Vector2D A, Vector2D B, Vector2D C, Vector2D P){
Vector2D AB = sub(B, A);
Vector2D BP = sub(P, B);
Vector2D BC = sub(C, B);
Vector2D CP = sub(P, C);
Vector2D CA = sub(A, C);
Vector2D AP = sub(P, A);
double c1 = AB.x * BP.y - AB.y * BP.x;
double c2 = BC.x * CP.y - BC.y * CP.x;
double c3 = CA.x * AP.y - CA.y * AP.x;
if((c1>=0 && c2>=0 && c3 >=0) || (c1<0 && c2 <0 && c3<0)){
return true;
}else{
return false;
}
}
int main(){
Vector2D A, B, C, P;
while(~scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &A.x, &A.y,&B.x, &B.y, &C.x, &C.y,&P.x, &P.y)){
if(hittest_point(A, B,C,P)){
printf("YES\n");
}else{
printf("NO\n");
}
}
return 0;
}
| 0
| 79,902,541
|
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
void coY() {cout <<"Yes"<<endl;}
void coN(){cout <<"No"<<endl;}
int main()
{
int n;
cin >> n;
vector<int> d(n);
rep(i, n)cin>>d[i];
SORT(d);
int l = d[n/2-1], r = d[n/2];
cout << r - l << endl;
}
|
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
long long int a[10],temp,i,j;
for(i=0;i<10;i++){
cin>>a[i];
}
for(i=0;i<10;i++){
for(j=0;j<10-i-1;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(int i=10-1;i>6;i--){
cout<<a[i]<<"\n";
}
return 0;
}
| 0
| 40,153,801
|
#include<stdio.h>
#include<string.h>
int main(){
int n,i;
char s1[21];
scanf("%s",s1);
int len=strlen(s1);
len--;
for(i=len;i>=0;i--){
printf("%c",s1[i]);
}
printf("\n");
return(0);
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
vector<int>vec[26];
char str[MAX];
void Get_Pos()
{
for(int i=0;str[i];i++)
{
int k=str[i]-'a';
vec[k].push_back(i);
}
}
void Solve()
{
for(int i=0;i<26;i++)
{
int l=vec[i].size();
for(int j=0;j<l;j++)
{
int t=vec[i].at(j);
for(int k=j+1;k<l;k++)
{
int r=vec[i].at(k);
if(((k-j+1)<<1)>r-t+1)
{
printf("%d %d\n",t+1,r+1);
return;
}
}
}
}
printf("-1 -1\n");
}
int main()
{
int n;
while(scanf("%s",str)!=EOF)
{
Get_Pos();
Solve();
}
return 0;
}
| 0
| 18,953,917
|
#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
int n;
cin >> n;
vector<int> memo(101010,0);
for(int i=0;i<n;i++){
int temp;
cin >> temp;
memo[temp]++;
}
int ans=-1;
for(int i=0;i<memo.size()-3;i++){
int cnt=0;
for(int j=i;j<=i+2;j++){
cnt+=memo[j];
}
ans=max(ans,cnt);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<pair<int, ll>>>;
const int INF = 1001001001;
ll h, w;
ll solve1(ll a){
ll res = h - a;
ll b = res/2, c = res - b;
return max(abs(a-b), max(abs(a-c), abs(b-c))) * w;
}
ll solve2(ll a){
ll res = h - a;
ll b = w/2, c = w - b;
return max(abs(a*w - res*b), max(abs(a*w - res*c), abs(res*b - res*c)));
}
int main(){
cin >> h >> w;
ll ans = INF;
for(ll a = 1; a <= h-1; a++){
ll tmp1 = solve1(a);
ll tmp2 = solve2(a);
ans = min(ans, min(tmp1, tmp2));
}
swap(h, w);
for(ll a = 1; a <= h-1; a++){
ll tmp1 = solve1(a);
ll tmp2 = solve2(a);
ans = min(ans, min(tmp1, tmp2));
}
cout << ans << endl;
}
| 0
| 94,572,626
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
#define INF 1000000000000;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i,n) cin >> h[i];
long long dp[110000];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = INF;
for (int j = 1; j <= k; j++) {
if (i-j < 0) {
continue;
}
dp[i] = min(dp[i-j] + abs(h[i-j] - h[i]), dp[i]);
}
}
cout << dp[n-1];
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
ll n,s,k; cin >> n >> k >> s;
ll p = 0;
ll c = s/k;
ll d = s-c*(k-1);
rep(i,n){
if(p < k){
cout << s << " ";
p ++;
}
else {
if(s != 1) cout << s-1 << " ";
else cout << s+1 << " ";
}
}
return 0;
}
| 0
| 75,159,251
|
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string s,t,u;
int M=0,l=0;
map<string,int>m;
for(;cin>>u;){
if(++m[u]>M)M=m[u],s=u;
if(t.size()<u.size())t=u;
}
cout<<s<<' '<<t<<endl;
}
|
#include<iostream>
#include<algorithm>
#define MOD 1000000007
#define Nmax 2000010
using namespace std;
long long inv[Nmax],fact[Nmax],invfact[Nmax];
void PRE(){
inv[1]=fact[0]=invfact[0]=1;
for(int i=1;i<Nmax;i++){
if(i>1)inv[i]=(MOD-(MOD/i)*inv[MOD%i]%MOD)%MOD;
fact[i]=fact[i-1]*i%MOD;
invfact[i]=invfact[i-1]*inv[i]%MOD;
}
}
long long C(int n,int k){
return fact[n]*invfact[k]%MOD*invfact[n-k]%MOD;
}
int vis[100010];
int main(){
PRE();
int n,m;cin>>n;
for(int i=0;i<100010;i++)vis[i]=-1;
for(int i=0;i<=n;i++){
int a;cin>>a;a--;
if(vis[a]!=-1){
m=n+vis[a]-i;
}
else vis[a]=i;
}
for(int k=1;k<=n+1;k++){
long long ans=C(n+1,k);
if(k-1<=m){
ans-=C(m,k-1);
}
ans%=MOD;
if(ans<0)ans+=MOD;
cout<<ans<<endl;
}
return 0;
}
| 0
| 1,480,908
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
int main()
{
ll x, a, b;
cin >> x >> a >> b;
if (b - a <= 0)
{
println("delicious");
}
else if (0 < b - a && b - a <= x)
{
println("safe");
}
else
{
println("dangerous");
}
}
|
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
ll N = S.size(), tmp = 0;
vector<ll>C;
char l = 'A';
rep(i, N) {
if (i == 0) {
tmp++;
l = S[i];
}
else if (S[i] == l) {
tmp++;
if (i == N - 1) {
C.push_back(tmp);
}
}
else {
l = S[i];
C.push_back(tmp);
tmp = 1;
if (i == N - 1) {
C.push_back(tmp);
}
}
}
ll ans;
if (N == 1) {
ans = 0;
}
else {
ans = C.size() - 1;
}
cout << ans;
return 0;
}
| 0
| 78,181,590
|
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
bool cmp(pair<int, int> &x, pair<int, int> &y)
{
return x.second > y.second;
}
int main(void)
{
int n, m;
while(cin >> n >> m, n > 0){
int j = 0, ans = 0;
vector<pair<int, int>> dp(n);
rep(i, n){
int d, p;
cin >> d >> p;
dp[i] = make_pair(d, p);
}
sort(dp.begin(), dp.end(), cmp);
while(m > 0){
if (dp[j].first > 0){
dp[j].first--;
m--;
}else{
j++;
if (j == n) break;
}
}
rep(i, n){
ans += dp[i].first * dp[i].second;
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, d, a;
cin >> n >> d >> a;
vector < pair < ll, ll > > v;
for(int i = 0; i < n; i++){
ll x, h;
cin >> x >> h;
v.push_back({x, (h + a - 1) / a});
}
sort(v.begin(), v.end());
vector < ll > p(n + 2, 0);
ll bombs = 0, rt;
for(int i = 0; i < n; i++){
ll x = v[i].first, req = v[i].second;
req -= p[i];
if(req <= 0){
p[i + 1] += p[i];
continue;
}
bombs += req;
ll lo = i, hi = n - 1;
while(lo <= hi){
ll mid = (hi - lo) / 2 + lo;
if(v[mid].first <= x + 2 * d){
lo = mid + 1;
rt = mid;
}
else hi = mid - 1;
}
p[rt + 1] -= req;
p[i] += req;
p[i + 1] += p[i];
}
cout << bombs << endl;
}
| 0
| 17,000,992
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
typedef int64_t 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 mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++)
{
int a; cin >> a;
oks[a] = false;
}
vector<ll> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; ++now) {
for (int next = now+1; next <= min(N,now+2); next++)
{
if (oks[next])
{
dp[next] += dp[now];
dp[next] %= mod;
}
}
}
cout << dp[N] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
const double PI = acos(-1);
const int mod = 1e9+7;
const long long INF = (1LL << 60);
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a / gcd(a,b) * b;}
ll stringcount(string s, char c){return count(s.cbegin(), s.cend(), c);}
bool isInteger(double x){return floor(x) == x;}
ll ceil(ll a, ll b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmax(T &a, const T &b){ if(a < b){ a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(a > b){ a=b; return 1; } return 0; }
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
char a, b, c, d;
cin >> a >> b >> c >> d;
rep(i, 0, 2) rep(j, 0, 2) rep(k, 0, 2){
ll sum = a - '0';
if(i == 0) sum += b - '0';
else sum -= b - '0';
if(j == 0) sum += c - '0';
else sum -= c - '0';
if(k == 0) sum += d - '0';
else sum -= d - '0';
if(sum == 7){
cout << a << (i==0?'+':'-') << b << (j==0?'+':'-') << c << (k==0?'+':'-') << d << "=7" << endl;
return 0;
}
}
return 0;
}
| 0
| 80,302,287
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint n, k;
scanf("%lld", &n);
scanf("%lld", &k);
std::string s;
std::cin >> s;
std::vector<lint> line;
std::vector<lint> line_state;
lint stream = 0;
lint state;
if (s.front() == '0')
state = 0;
else
state = 1;
for (int i = 0; i < n; ++i)
{
if (s[i] == '0')
{
if (state == 0)
{
stream++;
}
else
{
line.push_back(stream);
line_state.push_back(state);
stream = 1;
state = 0;
}
}
else
{
if (state == 1)
{
stream++;
}
else
{
line.push_back(stream);
line_state.push_back(state);
stream = 1;
state = 1;
}
}
}
line.push_back(stream);
line_state.push_back(state);
if (line_state.size() - std::accumulate(line_state.begin(), line_state.end(), 0) <= k)
{
printf("%lld", n);
return 0;
}
else
{
std::vector<lint> line_cumsum(line.size());
lint cumsum = 0;
for (lint i = 0; i < line.size(); i++)
{
cumsum += line[i];
line_cumsum[i] = cumsum;
}
lint ans = 0;
lint cand;
for (int i = 0; i < line.size(); i++)
{
lint right;
lint left;
if (line_state[i] == 0)
{
left = std::max(0, i - 1);
right = std::min(i + 2 * int(k) - 1, int(line.size()) - 1);
}
else
{
left = i;
right = std::min(i + 2 * int(k), int(line.size()) - 1);
}
if (right >= line.size())
break;
if (left == 0)
cand = line_cumsum[right];
else
cand = line_cumsum[right] - line_cumsum[left - 1];
ans = std::max(ans, cand);
}
printf("%lld", ans);
return 0;
}
return 0;
}
|
#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;
cin >> N;
string w;
cin >> w;
char last = w.at(w.size() - 1);
vector<string> used;
used.push_back(w);
bool ans = true;
rep(i, N - 1){
cin >> w;
if (last != w.at(0)) ans = false;
last = w.at(w.size() - 1);
used.push_back(w);
}
sort(used.begin(), used.end());
string tmp = used.at(0);
for(int i = 1; i < N; i++){
if (tmp == used.at(i)) ans = false;
tmp = used.at(i);
}
if (ans) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 38,585,087
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c; cin>>a>>b>>c;
cout<<(a + b >= c ? "Yes\n" : "No\n");
}
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.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>bool even(T n) { return ! (n & 1); }
template<class T>bool odd(T n) { return n & 1; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll calc(ll n)
{
if (n % 4 == 0) return n;
else if (n % 4 == 1) return 1;
else if (n % 4 == 2) return n + 1;
else return 0;
}
int main()
{
ll A, B;
cin >> A >> B;
ll ans = calc(B) ^ calc(A-1);
cout << ans << endl;
}
| 0
| 14,459,986
|
#include <iostream>
int main()
{
long long N;
std::cin >> N;
long long ans = 0;
for (long long i=1; i<N+1; i++)
{
long long n = N/i;
ans += i*(n*(n+1))/2;
}
std::cout << ans;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
const int INF = 1e9+100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(), (a).end()
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main(){
FIN;
ll n; cin >> n;
vector<ll> a(n+1);
a[0] = 0;
for(ll i=1;i<n+1;i++){
cin >> a[i];
}
vector<ll> ans(n+1);
ans[0] = 0;
if(n%2 == 0){
ll idx = n;
for(ll i=1;i<=n/2;i++){
ans[i] = a[idx];
idx -= 2;
}
idx = 1;
for(ll i=n/2+1;i<=n;i++){
ans[i] = a[idx];
idx += 2;
}
}
if(n%2 == 1){
ll idx = n;
for(ll i=1;i<=n/2+1;i++){
ans[i] = a[idx];
idx -= 2;
}
idx = 2;
for(ll i=n/2+2;i<=n;i++){
ans[i] = a[idx];
idx += 2;
}
}
for(ll i=1;i<=n;i++) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 0
| 13,984,449
|
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
using namespace std;
int main() {
string s, right = "yuiopjhklnm";
int count;
bool use_right;
while (cin >> s, s != "#") {
count = 0;
if ((int)right.find(s[0]) >= 0) use_right = true;
else use_right = false;
for (int i = 1; i < s.length(); i++) {
if (use_right && (int)right.find(s[i]) < 0) {
use_right = false;
count++;
}
else if (!use_right && (int)right.find(s[i]) >= 0) {
use_right = true;
count++;
}
}
cout << count << el;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll dis(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2);
}
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 ans_d = LLONG_MAX;
ll ans = 0;
for(ll j = m-1; j>=0;j--){
ll d_ = dis(a[i], b[i], c[j], d[j]);
if (ans_d >= d_){
ans_d = d_;
ans = j+1;
}
}
cout << ans << endl;
}
return 0;
}
| 0
| 73,921,454
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#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=(b)-1; i>=(a); --i)
#define DEBUG(x) cout<<#x<<": "<<x<<'\n'
#define DEBUG_VEC(v) cout<<#v<<":";REP(i, v.size())cout<<' '<<v[i];cout<<'\n'
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a=min((a), (b))
#define CHMAX(a, b) a=max((a), (b))
const ll MOD=1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
const double EPS=1e-11;
#define EQ0(x) (abs((x))<EPS)
#define EQ(a, b) (abs((a)-(b))<EPS)
const int MAX_N=114514;
ll fact[MAX_N], fact_inv[MAX_N];
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;
}
ll comb(int n, int r){
if(n<r){
return 0;
}
return (fact[n]*fact_inv[r])%MOD*fact_inv[n-r]%MOD;
}
void init_comb(int n){
fact[0]=1;
REP(i, n){
fact[i+1]=fact[i]*(i+1)%MOD;
}
fact_inv[n]=power(fact[n], MOD-2);
FORR(i, 0, n){
fact_inv[i]=fact_inv[i+1]*(i+1)%MOD;
}
return;
}
int num[114514];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, a[114514];
cin>>n;
REP(i, n+1){
cin>>a[i];
--a[i];
++num[a[i]];
}
int dup;
REP(i, n){
if(num[i]==2){
dup=i;
break;
}
}
int b[2], sz=0;
REP(i, n+1){
if(a[i]==dup){
b[sz++]=i;
}
}
init_comb(n+1);
ll c=b[0]+n-b[1];
FOR(i, 1, n+2){
cout<<(comb(n+1, i)-comb(c, i-1)+MOD)%MOD<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int m,k;
cin>>m>>k;
if(k==0){
rep(i,1<<m)
cout<<i<<" "<<i<<endl;
return 0;
}
if(k==1&&m==1){
cout<<-1<<endl;
return 0;
}
if(k>=1<<m){
cout<<-1<<endl;
return 0;
}
cout<<k<<endl;
rep(i,1<<m){
if(i==k)continue;
cout<<i<<endl;
}
cout<<k<<endl;
for(int i=(1<<m)-1;i>=0;i--){
if(i==k)continue;
cout<<i<<endl;
}
}
| 0
| 41,831,613
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
using namespace std;
int main(){
string str, ans;
int i;
cin >> str;
for(i=0 ; i<str.size() ; i++){
ans += str[str.size()-i-1];
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
void aaa(int *a,int start,int end){
if(start<end){
for(int i=start;i<end; i++){
if(a[i]>a[i+1]){
int tmp=a[i];
a[i]=a[i+1];
a[i+1]=tmp;
}
}
aaa(a,start,end-1);
}
}
int main(void){
using namespace std;
int n,m,count[101];
string s[101],t[101];
cin >> n;
for(int i=0;i<n;i++){
std::cin >> s[i];
}
cin >> m;
for(int i=0;i<m;i++){
std::cin >> t[i];
}
s[n]="";
for(int i=0;i<n+1;i++){
count[i]=0;
for(int j=0;j<n;j++){
if(s[i]==s[j]) count[i]++;
}
for(int k=0;k<m;k++){
if(s[i]==t[k]) count[i]--;
}
}
aaa(count,0,n);
std::cout << count[n] <<endl;
}
| 0
| 15,207,478
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 100010
int n;
bool t[N];
unordered_set<int> v[N];
unordered_set<int>::iterator it;
queue<int> Q;
void BFS(int x){
if(v[x].size()==0)return;
int to=*v[x].begin();
t[to]=false;
t[x]=false;
for(it=v[x].begin();it!=v[x].end();it++){
v[*it].erase(x);
}
for(it=v[to].begin();it!=v[to].end();it++){
v[*it].erase(to);
if(v[*it].size()==1)Q.push(*it);
}
}
int main(){
cin>>n;
lol(i,n-1){
int a,b;cin>>a>>b;
a--,b--;
v[a].insert(b);
v[b].insert(a);
}
lol(i,n)t[i]=true;
lol(i,n)if(v[i].size()==1)Q.push(i);
while(!Q.empty()){
int x=Q.front();
Q.pop();
BFS(x);
}
int sum=0;
lol(i,n)sum+=t[i];
cout<<(sum>0?"First":"Second")<<endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
#define jck 3.141592
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
int main(){
int N,K; cin >> N >> K;
vector<Pi> dt(N);
map<int,int> mp;
priority_queue<int,vector<int>,greater<int>> q;
set<int> s;
rep(i,N){
cin >> dt[i].second >> dt[i].first;
}
sort(dt.rbegin(),dt.rend());
ll now = 0;
ll ans = 0;
rep(i,K){
now += dt[i].first;
s.insert(dt[i].second);
mp[dt[i].second]++;
if(mp[dt[i].second] >= 2) q.push(dt[i].first);
}
int m = s.size();
ans = now+(ll)m*m;
int cnt = 0;
repr(i,K,N){
if(mp[dt[i].second] == 0){
if(!q.empty()){
int u = q.top();
q.pop();
now -= u;
now += dt[i].first;
cnt++;
mp[dt[i].second]++;
ans = max(ans,now+(ll)(m+cnt)*(m+cnt));
}
}
}
cout << ans << endl;
}
| 0
| 70,940,039
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int n, k;
long long cnt1, cnt2, ans;
cin >> n >> k;
cnt1 = cnt2 = ans = 0;
for(int i = 1; i <= n; i++)
{
if (i % k == 0)
cnt1++;
if (k % 2 == 0 && i % k == k / 2)
cnt2++;
}
ans = cnt1 * cnt1 * cnt1 + cnt2 * cnt2 * cnt2;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s;
cin >> a >> b >> s;
if(s[a] == '-'){
for(int i = 0; i < s.size(); i++){
if(i != a){
if(!(s[i] >= 48 && s[i] <= 57)){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}else{
cout << "No" << endl;
return 0;
}
}
| 0
| 94,448,460
|
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
ll Max(ll(a), ll(b), ll(c)) {
return max(max(a, b), c);
}
ll Min(ll(a), ll(b), ll(c)) {
return min(min(a, b), c);
}
int main() {
ll A, B, C;
cin >> A >> B >> C;
rep(i, B) {
if ((i * A) % B == C) {
cout << "YES" << endl; return 0;
}
}
cout << "NO" << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <string>
#include <cmath>
#include <climits>
#include <cstdint>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1>::type>; };
template <typename T>
struct vector_helper<T, 0> { using type = T; };
template <typename T, size_t Depth>
using vector_t = typename vector_helper<T, Depth>::type;
template <typename T> using vec = vector_t<T, 1>;
template <typename T> using vvec = vector_t<T, 2>;
template <typename T> using vvvec = vector_t<T, 3>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0) return 1; if (b == 1) return a % mod; if (b == 2) return (a * a) % mod;
return (max(a * (b & 1), (int64_t)1) * mpow(mpow(a, b / 2, mod), 2, mod)) % mod;
}
constexpr int64_t mdiv(int64_t a, int64_t b, int64_t mod = 1000000007) {
return (a * mpow(b, mod - 2, mod)) % mod;
}
}
int main() {
int x; cin >> x;
int m = 1;
while ((360 * m) % x) ++m;
cout << (360 * m) / x << endl;
}
| 0
| 56,088,330
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#define ll long long
#define int long long
#define Size(v) (int)v.size()
using namespace std;
const int nax = 5e6 + 5;
int fact[nax];
const int MOD = 1e9 + 7;
int add(int x, int y)
{
x += y;
while(x >= MOD) x -= MOD;
while(x < 0) x += MOD;
return x;
}
int mul(int x, int y)
{
return (x * 1ll * y) % MOD;
}
int square(ll x) {return mul(x, x);}
int binpow(ll a, ll b) {
if (b == 0) return 1 % MOD;
if (b % 2 == 0) return square(binpow(a, b/2)) % MOD;
return a*(square(binpow(a, b/2))) % MOD;
}
void genfact(ll n) {
fact[0] = 1;
for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i % MOD;
}
int inv(int x)
{
return binpow(x, MOD - 2);
}
int divide(int x, int y)
{
return mul(x, inv(y));
}
int Ckn(int n, int k)
{
if (k > n) return 0;
return divide(fact[n], mul(fact[k], fact[n - k]));
}
void solve() {
int x, y;
cin >> x >> y;
fact[0] = 1;
for (int i = 1; i <= 5000000; ++i) fact[i] = (fact[i - 1] * i) % MOD;
if ((x + y) % 3 != 0) {
cout << 0;
return;
}
int mn = (x + y) / 3;
int m = x - mn;
m = max(m, y - mn);
cout << Ckn(mn, m);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
while (t--)
solve();
return 0;
}
|
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include <string.h>
#include <iomanip>
using namespace std;
#define PI 3.14159265358979323846264338327950L
#define MAX 12
#define SUM_INIT 10000000000
int main() {
int N, M, X;
int C[MAX];
int A[MAX][MAX];
cin >> N >> M >> X;
for (int ii = 0; ii < N; ii++) {
cin >> C[ii];
for (int jj = 0; jj < M; jj++) {
cin >> A[ii][jj];
}
}
long long sum = SUM_INIT, tmp = 0;
int U[MAX];
for (int ii = 0; ii < 1 << N; ii++) {
memset(U, 0x00, sizeof(U));
tmp = 0;
for (int jj = 0; jj < N; jj++) {
if (((ii >> jj) & 1) == 0) {
continue;
}
for (int kk = 0; kk < M; kk++) {
U[kk] += A[jj][kk];
}
tmp += C[jj];
}
for (int jj = 0; jj < M; jj++) {
if (U[jj] < X) {
break;
}
if (jj == M - 1) {
if (tmp < sum) {
sum = tmp;
}
}
}
}
if (sum == SUM_INIT) {
cout << -1 << endl;
}
else {
cout << sum << endl;
}
return 0;
}
| 0
| 17,999,626
|
#include <bits/stdc++.h>
using namespace std;
int main(){
char c[3], d[3];
cin >> c >> d;
cout << (c[0] == d[2] && c[1] == d[1] && c[2] == d[0] ? "YES" : "NO") << endl;;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int n,k;
cin >> n >> k;
k--;
vector<int> a(n);
rep(i,n) cin >> a[i];
int ans = 1e18;
for(int bit = 0; bit < (1 << (n - 1)); bit++){
int cnt = 0;
for(int i = 0; i < n - 1; i++){
if(1 & (bit >> i)) cnt++;
}
if(cnt != k) continue;
int tmp = 0;
int maxv = a[0];
for(int i = 1; i < n; i++){
if(1 & (bit >> (n - 1 - i))){
if(a[i] <= maxv){
tmp += (maxv + 1 - a[i]);
maxv = maxv + 1;
}
}
maxv = max(maxv,a[i]);
}
ans = min(ans,tmp);
}
cout << ans << endl;
}
| 0
| 18,194,628
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
int n; cin >> n;
double sum = 0;
while (n--) {
double x; cin >> x;
sum += 1 / x;
}
cout << fixed << setprecision(10) << 1 / sum;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> s(N + 1);
cout << "0\n";
cin >> s[0];
s[N] = s[0];
int m = 0, l = 0, r = N;
while (s[m] != "Vacant") {
m = (l + r) / 2;
cout << m << endl;
cin >> s[m];
if ((m - l) % 2 ^ s[m] == s[l]) {
l = m;
} else {
r = m;
}
}
}
| 0
| 14,190,824
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
int h,m,s,s1,ti[100001];
char a,b;
while(1){
cin>>n;
if(n==0) break;
for(i=0;i<86400;i++) ti[i]=0;
for(i=0;i<n*2;i++){
cin>>h>>a>>m>>b>>s;
if(i%2==0) ti[h*3600+m*60+s]++;
else ti[h*3600+m*60+s]--;
}
for (i=0;i<86400;i++) {
if (0<i) ti[i]+=ti[i-1];
}
int M = -1;
for (i=0;i<86400;i++) {
M=max(ti[i],M);
}
cout<<M<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
a%=m;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
const ll N=5e5+5;
ll sp[N];
void sieve(){
for(int i=2;i<N;i++)sp[i]=i;
for(int i=2;i*i<N;i++){
if(sp[i]==i){
for(int j=i*i;j<N;j+=i){
sp[j]=i;
}
}
}
}
ll fac[N],inv[N];
ll p=1e9+7;
void fill(){
fac[0]=inv[0]=1;
for(int i=1;i<N;i++){
fac[i]=fac[i-1]*i%p;
inv[i]=powM(fac[i],p-2,p);
}
}
ll c(ll a,ll b,ll p){
if(a<b)return 0;
return (fac[a]*inv[a-b]%p)*(inv[b])%p;
}
ll lcm(ll a,ll b)
{
return (a*b)/(__gcd(a,b));
}
int main()
{
IOS;
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll l1=a%c?c+a-a%c:a,r1=b-b%c;
ll l2=a%d?d+a-a%d:a,r2=b-b%d;
ll e=lcm(c,d);
ll l3=a%e?e+a-a%e:a,r3=b-b%e;
ll cnt=0;
if(l1<=r1){
cnt+=1+(r1-l1)/c;
}
if(l2<=r2){
cnt+=1+(r2-l2)/d;
}
if(l3<=r3){
cnt+=-1-(r3-l3)/e;
}
cnt=(b-a+1)-(cnt);
cout<<cnt<<endl;
return 0;
}
| 0
| 26,345,838
|
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
using namespace std;
using ll = long long;
using ld = long double;
const int mxn = 110;
const int inf = 1e5+5;
int b[mxn];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ans = 0;
int n; cin>>n;
for(int i=0; i<n-1; i++) cin>>b[i];
b[n-1] = inf;
ans+=b[0];
for(int i=1; i<n; i++) ans+=min(b[i-1], b[i]);
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi pair<int,int>
#define pii pair<pair<int,int>,int>
#define pb push_back
#define pi 2*acos(0.0)
#define rev greater<int>()
#define pr(a,x,y) for(int i=x;i<y;i++){cout<<a[i]<<" ";}
#define ps(s) for(auto i:s){cout<<i<<" ";}
#define sp(x,y) fixed<<setprecision(y)<<x
#define w(x) ll x; cin>>x; while(x--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define test cout<<"This is test"<<endl;
#define str string
#define endl '\n'
#define e cout<<'\n';
void kehsihba(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
void solve(){
ll n;cin>>n;
ll arr[n];for(int i=0;i<n;i++){cin>>arr[i];}
sort(arr,arr+n);
double ans=arr[0];
for(int i=1;i<n;i++){
ans=(ans+arr[i])/2;
}
cout<<sp(ans,10);
}
int32_t main(){
kehsihba();
ll t=1;
for(int k=1;k<=t;k++){
solve();
}
}
| 0
| 38,368,817
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 100000000
#define INF 300000000000000000
#define MOD 1000000007
#define mod 1000000007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll>a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi<b.fi;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
string s,t;cin>>s>>t;
for(int len=n;len>=0;len--){
string ss=s.substr(n-len,len);
string tt=t.substr(0,len);
if(ss==tt){
cout<<2*n-len<<endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
constexpr double eps = 1e-10;
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
struct UnionFind{
vector<int> par, rank;
UnionFind(int n){
par.resize(n,-1);
rank.resize(n,0);
}
int root(int x){
if(par[x]<0) return x;
else return par[x]=root(par[x]);
}
bool same(int x,int y){
return root(x) == root(y);
}
int size(int x){
return -par[root(x)];
}
void merge(int x,int y){
x = root(x);
y = root(y);
if(x==y) return;
if(rank[x] < rank[y]) swap(x,y);
par[x]+=par[y];
par[y]=x;
rank[x]+=(rank[x]==rank[y]);
}
};
int main(){
int n,m; cin >> n >> m;
UnionFind uf(2*n);
vector<int> p(n);
rep(i,n){
cin >> p[i];
p[i]--;
uf.merge(p[i], i+n);
}
rep(i,m){
int x,y; cin >> x >> y;
x--; y--;
uf.merge(x, y);
}
int ans = 0;
rep(i,n){
if(uf.same(i, i+n)){
ans++;
}
}
cout << ans << endl;
}
| 0
| 76,250,508
|
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
typedef long long ll;
using namespace std;
const ll MOD = 1e9+7LL;
const int INF = 2e9;
int N;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
cout << (N-1)/2 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;
int d[101][101];
int inf=INT_MAX;
int v;
int warshall_floyd(){
rep(k,v)rep(i,v)rep(j,v){
if(d[i][k]==inf||d[k][j]==inf)continue;
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
int main(){
int e,r,s,t,ds;
cin>>v>>e;
rep(i,v)rep(j,v) d[i][j]=inf;
rep(i,v) d[i][i]=0;
rep(i,e){
cin>>s>>t>>ds;
d[s][t]=ds;
}
warshall_floyd();
rep(i,v){
if(d[i][i]<0){
cout<<"NEGATIVE CYCLE"<<endl;
break;
}
else if(i==v-1){
rep(j,v){
rep(k,v){
if(d[j][k]<inf) cout<<d[j][k];
else cout<<"INF";
if(k==v-1) cout<<endl;
else cout<<" ";
}
}
}
}
return 0;
}
| 0
| 68,669,568
|
#include <iostream>
#include <climits>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n][n];
for( int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = 0;
}
}
int p[n + 1];
for ( int i = 0; i < n; i++) {
cin >> p[i] >> p[i+1];
}
for (int l = 2; l <= n; l++) {
for (int i = 0; i < n - l + 1; i++) {
int min = INT_MAX;
for (int j = i; j < i + l - 1;j++ ) {
int t = dp[i][j] + p[i] * p[j + 1] * p[i + l] + dp[j+1][i + l - 1];
if (t < min) {
min = t;
}
}
dp[i][i + l - 1] = min;
}
}
cout << dp[0][n -1] << endl;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, sum = 0,a;
vector<pair<ll, int>> v(4);
for (int i = 0; i < 4; i++) {
cin >> a;
if(i==0){
v[i].first=a*8;
}else if(i==1){
v[i].first=a*4;
}else if(i==2){
v[i].first=a*2;
}else if(i==3){
v[i].first=a;
}
v[i].second = i + 1;
}
sort(v.begin(), v.end());
for (int i = 0; i < 4; i++) {
if (v[i].second == 1) {
v[i].first/=8;
} else if (v[i].second == 2) {
v[i].first/=4;
} else if (v[i].second == 3) {
v[i].first/=2;
}
}
cin >> n;
if (v[0].second == 4) {
if (n >= 2) {
sum += (n / 2) * v[0].first;
if (n % 2 != 0) {
if (v[1].second == 1) {
sum += 4 * v[1].first;
} else if (v[1].second == 2) {
sum += 2 * v[1].first;
} else if (v[1].second == 3) {
sum += 1 * v[1].first;
}
}
} else {
if (v[1].second == 1) {
sum += n * 4 * v[1].first;
} else if (v[1].second == 2) {
sum += n * 2 * v[1].first;
} else if (v[1].second == 3) {
sum += n * v[1].first;
}
}
}else{
if (v[0].second == 1) {
sum += n * 4 * v[0].first;
} else if (v[0].second == 2) {
sum += n * 2 * v[0].first;
} else if (v[0].second == 3) {
sum += n * v[0].first;
}
}
cout<<sum<<endl;
return 0;
}
| 0
| 89,825,423
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int ans1,ans2;
int main(void){
string s; cin>>s;
for(int i=0;i<s.size();i++){
if(i%2==0){
if(s[i]!='0'){
ans1++;
}
}else{
if(s[i]=='0'){
ans1++;
}
}
}
for(int i=0;i<s.size();i++){
if(i%2==0){
if(s[i]=='0'){
ans2++;
}
}else{
if(s[i]!='0'){
ans2++;
}
}
}
cout<<min(ans1,ans2)<<endl;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
int n, m;
cin >> n >> m;
vec s[m];
rep(i, m){
int k;
cin >> k;
rep(j, k){
int s_;
cin >> s_;
s_--;
s[i].push_back(s_);
}
}
int p[m];
rep(i, m) cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << n); i++){
bool flag = true;
rep(j, m){
int num = 0;
rep(k, s[j].size()){
if(((i >> s[j][k]) & 1) == 1) num++;
}
if(num % 2 != p[j]) flag = false;
}
if(flag) ans++;
}
cout << ans << endl;
}
| 0
| 94,950,330
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
M = N;
int sum = 0;
for (int i=8; i>=0; i--) {
int W=1;
for (int j=0; j<i; j++){
W *= 10;
}
int x;
x = N / W;
sum += x;
N = N - x*W;
}
if (M % sum == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
using ll = long long;
int dp[1100000];
int main() {
int n;
cin >> n;
for (int i=0; i<=1000000; i++) dp[i] = 10000000;
dp[0] = 0;
rep(i, 1000000) {
dp[i+1] = min(dp[i]+1, dp[i+1]);
for (int j=6; i+j<=1000000; j*=6) {
dp[i+j] = min(dp[i+j], dp[i]+1);
}
for (int j=9; i+j<=1000000; j*=9) {
dp[i+j] = min(dp[i+j], dp[i]+1);
}
}
cout << dp[n] << endl;
}
| 0
| 76,413,260
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void frog(int *A,int n)
{
ll t[n+1];
for(int i=1;i<=n;i++)
{
if(i==1)
t[i]=0;
else if(i>=3){
t[i]= min( (t[i-1]+abs(A[i]-A[i-1])),
(t[i-2]+abs(A[i]-A[i-2])) );
}
else t[i]=t[i-1]+abs(A[i]-A[i-1]);
}
std::cout << t[n];
}
int main() {
int n;
cin >>n;
int A[n+1];
for(int i=1;i<=n;i++)
cin >>A[i];
frog(A,n);
}
|
#include <bits/stdc++.h>
#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 main() {
int N, A, B;
cin >> N >> A >> B;
int res = 0;
REP(i, N) {
int I = i+1;
int sum = findSumOfDigits(I);
if (sum >= A && sum <= B) {
res += I;
}
}
cout << res << endl;
}
| 0
| 23,924,636
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define pq priority_queue
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define sz(c) ((ll)c.size())
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, \
tree_order_statistics_node_update>
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x, y;
cin >> x >> y;
if (y > x) {
swap(x, y);
}
if (y == 0 && x <= 1) {
cout << "Brown\n";
return 0;
}
if (x - y <= 1) {
cout << "Brown\n";
} else {
cout << "Alice\n";
}
}
|
#include <iostream>
#include <cstddef>
#include <string>
using ll = long long;
ll n;
std::string s, s2;
char t[4];
char p;
ll ans;
int main() {
std::cin >> n;
std::cin >> s;
for (int i = 0; i < 1000; i++) {
bool torf = true;
std::snprintf(t, 4, "%03d", i);
s2 = t;
long long int pos = -1;
for (int j = 0; j < 3; j++) {
pos = s.find(s2[j], pos+1);
if (pos == std::string::npos) {
torf = false;
break;
}
}
if (torf)
ans++;
}
std::cout << ans << std::endl;
}
| 0
| 92,986,629
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
char s[3];
cin>>s[0]>>s[1]>>s[2];
int max=0, locmax=0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
locmax++;
}
else{
locmax=0;
}
if(locmax>max){
max=locmax;
}
}
cout<<max;
}
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 100000000
#define INF 300000000000000000
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp(pair<ll,Pll> a,pair<ll,Pll> b){
if(a.fi!=b.fi)
return a.fi<b.fi;
else
return a.se.fi>b.se.fi;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
ll ans=0;
V<ll>a(n);
for(ll i=0;i<n;i++)cin>>a[i];
ll pre=0;
for(ll i=0;i<n;i++){
if(a[i]==0){
ans+=pre/2;
pre=0;
}
else{
a[i]+=pre;
ans+=a[i]/2;
a[i]%=2;
pre=a[i];
}
}
cout<<ans<<Endl;
return 0;
}
| 0
| 70,174,388
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
ll a, b, k; cin >> a >> b >> k;
ll t=k;
k = max(0LL, k-a);
a = max(0LL, a-t);
b = max(0LL, b-k);
cout << a << ' ' << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
vector<long long> a, p;
long long f(ll N, ll X){
if(X == 0){
return 0;
}
else if(N == 0){
return 1;
}
else if(X <= a[N-1] + 1){
return f(N-1, X-1);
}
else{
return p[N-1] + 1 + f(N-1, X - a[N-1] - 2);
}
}
int main(){
a.resize(51); p.resize(51);
a[0] = 1;
p[0] = 1;
for (ll i = 1; i < 51; i++) {
a[i] = 2 * a[i-1] + 3;
p[i] = 2 * p[i-1] + 1;
}
ll N, X;
cin >> N >> X;
printf("%lld\n", f(N, X));
}
| 0
| 36,224,088
|
#include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int H, W, D, Q;
int A[301][301];
int dp[300 * 300 + 1];
int L[100000], R[100000];
int main(int argc, char* argv[]) {
cin >> H >> W >> D;
unordered_map<int, pair<int, int>> map;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> A[i][j];
map[A[i][j]] = make_pair(i, j);
}
}
cin >> Q;
for (int i = 0; i < Q; i++)
cin >> L[i] >> R[i];
for (int i = 1; i <= H * W; i++) {
if (i <= D) {
dp[i] = 0;
} else {
auto prev = map[i - D];
auto present = map[i];
dp[i] = dp[i - D] + abs(present.first - prev.first) +
abs(present.second - prev.second);
}
}
for (int i = 0; i < Q; i++)
cout << dp[R[i]] - dp[L[i]] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
int N, A, B;
int ans[MAX_N];
void solve() {
cin >> N >> A >> B;
if(N == 1) {
if(A == 1 && B == 1) {
cout << 1 << "\n";
}
else cout << "-1\n";
return;
}
bool swaped = false;
if(A < B) {
swap(A, B);
swaped = true;
}
vector<int> cnt(B, 1);
int n = N;
if((N + A - 1) / A > B) {
cout << "-1\n";
return;
}
rep(i, 0, (N + A - 1) / A) {
cnt[i] = min(A, n);
n -= A;
}
int r = B - (N + A - 1) / A;
rep(i, 1, (N + A - 1) / A) {
if(cnt[i] - 1 >= r) {
cnt[i] -= r;
r = 0;
}
else {
cnt[i] = 1;
r -= (cnt[i] - 1);
}
}
if(r != 0) {
cout << "-1\n";
return;
}
int at = 0;
int from = N - 1;
rep(i, 0, B) {
rep(j, 0, cnt[i]) {
ans[at] = from - cnt[i] + j + 1;
at++;
}
from -= cnt[i];
}
if(swaped) reverse(ans, ans + N);
rep(i, 0, N) {
cout << ans[i] + 1 << " ";
}
cout << "\n";
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
srand((unsigned int)time(NULL));
#ifdef LOCAL
freopen("in.txt", "rt", stdin);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| 0
| 98,634,723
|
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> b(n);
rep(i,n-1) cin >> b[i];
int ans = b[0]+b[n-2];
rep(i,n-2) {
ans += min(b[i],b[i+1]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FAST_IO std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n) fixed << setprecision(n)
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define eb emplace_back
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(a) a.size()
#define len(a) a.length()
#define pi acos(-1.0)
#define g_sin(a) sin(a*pi/180)
#define g_cos(a) cos(a*pi/180)
#define g_tan(a) tan(a*pi/180)
#define ms0(a) memset(a, 0, sizeof(a));
#define ms1(a) memset(a, 1, sizeof(a));
#define msn1(a) memset(a, -1, sizeof(a));
#define msinf(a) memset(a, 0x3f3f3f, sizeof(a));
const int mod1 = 998244353, mod = 1e9+7;
const int MAXN = 100005, MAX_M = 200010;
int a[MAXN], n;
vector<int> g[MAXN];
int dfs(int v, int p){
int val = 0;
int mx = 0;
for (auto u:g[v]){
if (u == p)
continue;
int t = dfs(u, v);
val += t;
mx = max(mx, t);
}
int x = g[v].size() == 1 ? 1 : 2;
if (mx > a[v]){
cout << "NO\n";
exit(0);
}
if (x*a[v] - val < 0 || x*a[v] - val > a[v]){
cout << "NO\n";
exit(0);
}
return x*a[v] - val;
}
void Solve() {
cin >> n;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
for (int i = 1, a, b; i < n; i++){
cin >> a >> b;
g[a].pb(b);
g[b].pb(a);
}
cout << (dfs(1, 1) == 0 ? "YES\n":"NO\n");
}
signed main(){
FAST_IO;
int TC = 1;
while(TC--) Solve();
return 0;
}
| 0
| 3,510,669
|
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}
else{
return par[a]=find(par[a]);
}
}
bool same(ll a,ll b){
return (find(a)==find(b));
}
ll size(ll a){
return -par[find(a)];
}
void unite(ll a,ll b){
ll c=find(a),d=find(b);
if(c==d)
return;
if(size(c)<size(d)){
swap(c,d);
}
par[c]+=par[d];
par[d]=c;
}
};
ll Nagaemon1;
void swap(ll i,ll j){
Nagaemon1=i;
i=j;
j=Nagaemon1;
}
int main(){
int r,g,b,n,a=0,t;
cin >> r >> g >> b >> n;
rep(i,n+1){
rep(j,n+1){
t=n-r*i-g*j;
if(t%b==0&&0<=t/b&&t/b<=n)a++;
}
}
cout << a;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define elif else if
string a;
signed main()
{
cin>>a;
rep(i,4){
cout<<a[i];
}
cout<<" ";
rep(i,8){
cout<<a[i+4];
}
cout<<endl;
}
| 0
| 52,629,244
|
#include<bits
using namespace std;
int main()
{
int n,i,j,k;
cin>>n;
if(n<3)
cout<<"0"<<endl;
else cout<<n/3<<endl;
}
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i=0; i<n; i++) cin >> a[i];
map<int,int> mp;
int ans = 0;
for (int i=0; i<n; i++) {
if (mp[a[i]] == i+1) {
ans++;
}
mp[i+1] = a[i];
}
cout << ans << endl;
}
| 0
| 55,506,400
|
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tsie(nullptr);cout.tie(nullptr)
#define watch(x) cout << (#x) << " is " << (x) <<"#" <<endl
#define PI 3.1415926535
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii ;
typedef vector<ll> vi ;
typedef vector<ii> vii ;
const ll mod = 998244353;
const ll MAX = 3e3+23;
const ll inf = 1e18+7;
int main(){
fastio;
ll n,a,b;
cin>>n>>a>>b;
ll lad = n/(a+b);
ll ans = min(a,n-lad*(a+b));
ans += a*lad;
cout<<ans<<"\n";
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int a[4], b[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
cin >> b[0] >> b[1] >> b[2] >> b[3];
if (a[0] + a[1] + a[2] + a[3] >= b[0] + b[1] + b[2] + b[3])
cout << a[0] + a[1] + a[2] + a[3] << endl;
else
cout << b[0] + b[1] + b[2] + b[3] << endl;
return 0;
}
| 0
| 57,725,668
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const ll MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<ll> A(N), cum(N+1);
REP(i,N){
cin >> A[i];
A[i]--;
}
REP(i,N) cum[i+1] = (A[i] + cum[i]) % K;
map<ll, ll> mp;
ll ans = 0;
REP(i,N+1){
ans += mp[cum[i]];
mp[cum[i]]++;
if(i - K + 1 >= 0) mp[cum[i-K+1]]--;
}
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(){
string s;
cin>>s;
int n=s.size();
vector<int>a(n+1,0);
rep(i,n){
if(s[i]=='<')if(a[i]>=a[i+1])a[i+1]=a[i]+1;
}
for(int i=n; i>0; --i){
if(s[i-1]=='>')if(a[i]>=a[i-1])a[i-1]=a[i]+1;
}
ll ans=0;
rep(i,n+1)ans+=a[i];
cout<<ans<<endl;
}
| 0
| 45,539,158
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, p, q;
cin >> n;
vector<int> P(n), Q(n), R(n);
for (int i = 0; i < n; i++)
{
cin >> P.at(i);
}
for (int i = 0; i < n; i++)
{
cin >> Q.at(i);
}
for (int i = 1; i <= n; i++)
{
R.at(i - 1) = i;
}
int cnt = 0;
do
{
if (P == R)
{
p = cnt;
}
if (Q == R)
{
q = cnt;
}
cnt++;
} while (next_permutation(R.begin(), R.end()));
cout << abs(p - q) << endl;
}
|
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#define INF 1000000000000000
#define MOD 1000000007
using PII = pair<int64_t, int64_t>;
using VI = vector<int64_t>;
using VVI = vector<VI>;
using VS = vector<string>;
using VP = vector<PII>;
using i64 = int64_t;
template<typename T> void invec(vector<T> &A){for(T& a : A) cin >> a;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
VI p(N); invec(p);
int M = 40000;
VI a, b;
rep(i, 0, N){
a.push_back(M * (i+1));
b.push_back(M*(N-i-1) + 1);
}
rep(i, 0, N){
a[p[i] - 1] += i;
}
for(i64 i: a) cout << i << " ";
cout << "\n";
for(i64 i: b) cout << i << " ";
cout << "\n";
return 0;
}
| 0
| 55,559,109
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[2] = {-1, 1};
ll dy[4] = {0, 1, 0, -1};
int main(void){
ll n;
cin >> n;
ll ans = 0;
for(ll i = 1; i < sqrt(n); i++){
if(n%i==0 && n%(n/i-1)!=0){
ans+=n/i-1;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n,m,x;
cin >> n >> m >> x;
vector<vector<int>> a(n,vector<int>(m));
vector<int> c(n);
for(int i = 0;i < n;i++){
cin >> c[i];
for(int j = 0;j < m;j++){
cin >> a[i][j];
}
}
int ans = 12345678;
int all = 1 << n;
for(int mask = 0;mask < all;mask++){
vector<int> level(m);
int cost = 0;
for(int i = 0;i < n;i++){
if((mask >> i) & 1){
cost += c[i];
for(int j = 0;j < m;j++){
level[j] += a[i][j];
}
}
}
bool f = true;
for(int j = 0;j < m;j++){
if(level[j] < x)f = false;
}
if(f)ans = min(ans,cost);
}
if(ans == 12345678){
cout << -1 << endl;
}else{
cout << ans<< endl;
}
}
| 0
| 50,085,886
|
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 100005
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define endl "\n"
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
ll lcm(ll a, ll b) { return (a*b)/ gcd(a,b);}
int dp[N];
void test_case() {
int n;
cin>>n;
int k;
cin>>k;
vec arr(n);
rep(i,n) {
cin>>arr[i];
}
for(int i=0; i<n; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
dp[1] =abs(arr[0] - arr[1]);
for(int i=2; i<k; i++) {
dp[i] = abs(arr[i] - arr[0]);
}
for(int i=k; i<n; i++) {
for(int j=k; j>=1; j--) {
dp[i] = min(dp[i], dp[i-j] + abs(arr[i] - arr[i-j]));
}
}
cout<<dp[n-1]<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while(t--)
{
test_case();
}
}
|
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")
ll SUM(VI& V){
return accumulate(ALL(V), 0LL);
}
ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}
void print_vector(VI& V){
ll n = V.size();
rep(i, n){
if(i) cout << ' ';
cout << V[i];
}
cout << endl;
}
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)
void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin>>N;
VI A(N);
rep(i, N) cin >> A[i];
VI B(N);
rep(i, N) cin >> B[i];
ll sum_a = SUM(A);
ll sum_b = SUM(B);
if(sum_a>sum_b){
no();
}
ll diff = sum_b - sum_a;
ll a_add_cnt=0;
ll b_add_cnt=0;
rep(i,N){
if(A[i]==B[i]) continue;
if(A[i]>B[i]){
b_add_cnt += A[i]-B[i];
}
else if(A[i]<B[i]){
ll d = B[i]-A[i];
a_add_cnt += (d+1)/2;
}
}
ll ma = max(a_add_cnt, b_add_cnt);
if(ma<=diff){
yes();
}else{
no();
}
return 0;
}
| 0
| 5,352,055
|
#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, min, ans;
ans = 0;
min = pow(10, 6);
cin >> n;
rep(i, n) {
int p;
cin >> p;
if (p <= min) {
ans++;
min = p;
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<queue>
using namespace std;
int N;
int D[101],d[101][101];
void bfs(int src){
int u,k,a;
bool visit[101];
for(int i=1;i<=N;++i){
cin>>u>>k;
for(int j=0;j<k;++j){
cin>>a;
d[u][a]=1;
}
visit[i]=true;
}
queue<int>Q;
Q.push(src);
D[src]=0;
visit[src]=false;
while(!Q.empty()){
int cur=Q.front();
Q.pop();
for(int i=1;i<=N;++i){
if(d[cur][i]==1&&visit[i]){
visit[cur]=false;
visit[i]=false;
D[i]=D[cur]+1;
Q.push(i);
}
}
}
for(int i=1;i<=N;++i){
if(i!=1&&D[i]==0){
D[i]=-1;
}
cout<<i<<" "<<D[i]<<endl;
}
}
int main(){
cin>>N;
int start=1;
bfs(start);
}
| 0
| 66,249,541
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
ll H, W, N;
map<pii,ll> mp;
ll ans[10] = {};
void solve() {
cin >> H >> W >> N;
rep(i,N) {
int a, b;
cin >> a >> b;
for (int j = a-1; j <= a+1; j++) {
for (int k = b-1; k <= b+1; k++) {
mp[pii(j, k)]++;
}
}
}
ll sum = 0;
for (auto p : mp) {
int y = p.first.first;
int x = p.first.second;
int c = p.second;
if (y >= 2 && y <= H-1 && x >= 2 && x <= W-1) {
ans[c]++;
sum++;
}
}
ans[0] = (H-2) * (W-2) - sum;
rep(i,10) cout << ans[i] << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200001;
ll N, ans=0, tmp=0;
vector<ll> A(MAXN, 0);
map<ll, ll> M;
signed main(){
cin >> N;
M[0]++;
for(int i=1;i<=N;i++) {
ll a;
cin >> a;
A[i] = A[i-1]+a;
M[A[i]]++;
}
for(map<ll, ll>::iterator itr=M.begin();itr!=M.end();itr++) {
pair<ll, ll> p = *itr;
if(p.second>1) ans += p.second*(p.second-1)/2;
}
cout << ans << endl;
return 0;
}
| 0
| 68,825,473
|
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define free freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define Fast ios::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define mp make_pair
#define F first
#define S second
bool vowel(char che)
{
if (che == 'A' || che == 'E' || che == 'I' || che == 'O' || che == 'U' || che == 'Y')
return true;
else
return false;
}
const int N = 2e3+5;
const int mod = 1e9+7;
ll a[N], b[N], c[N], d, dp[N][N], dis;
char o;
bool mark[N], h;
string s;
int main()
{
Fast
ll t, n, m, k = 0, f = 0, sum = 0, ans = 0;
cin >> n;
m = n-3;
k = 0;
for (int i = 0; i <= 2000; i++){
dp[0][i] = 1;
dp[i][i] = 1;
}
for (int i = 1; i <= 2000; i++){
for (int j = 1; j < i; j++){
dp[j][i] = dp[j][i-1]+dp[j-1][i-1]%mod;
}
}
while (m >= 0){
k ++;
ans += dp[k-1][m+k-1];
ans %= mod;
m -= 3;
}
cout << ans << endl;
}
|
#include<stdio.h>
#include <cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<utility>
char a[9999999+99];
using namespace std;
int fact(int n)
{
int i,k=1;
for(i=1;i<=n;i++)
k*=i;
return k;
}
#define ll long long
#define MAX 10000000
int rep[100110];
int M = 0;
int find_rep(int x)
{
if(rep[x]==x)
return x;
return find_rep(rep[x]);
}
int x,y;
int main()
{
int n,q,qq;
cin>>n>>q;
for(int i=0;i<n;i++)
rep[i]=i;
while(q--)
{
cin>>qq>>x>>y;
if(qq==0)
{
int repu=find_rep(x);
int repv=find_rep(y);
rep[repu]=rep[repv];
}
else
{
if(find_rep(x)==find_rep(y))
{
cout<< "1"<<endl;
}
else
{
cout<< "0"<<endl;
}
}
}
return 0;
}
| 0
| 22,055,158
|
#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, A, B;
cin>>N>>A>>B;
int tmp;
int anum=0, bnum=0, cnum=0;
for(int i=0;i<N;++i) {
cin>>tmp;
if(tmp<=A) anum++;
else if(tmp<=B) bnum++;
else cnum++;
}
cout<<min(anum, min(bnum, cnum))<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int gcd(int a,int b){
if(b==0){
return a;
}
else{
return gcd(b,a%b);
}
}
int main(){
int i,j,n;
cin >> n;
int a[1000010],b[1000010];
for(i=0;i<n;i++){
cin >> a[i];
b[i]=a[i];
}
vector<int> x(1000010);
for(i=0;i<=1000000;i++){
x[i]=i;
}
for(i=2;i*i<=1000000;i++){
if(x[i]!=i){
continue;
}
for(j=i*2;j<=1000000;j=j+i){
x[j]=i;
}
}
int res=0;
vector<int> c(1000010,0);
for(i=0;i<n;i++){
vector<int> d;
while(a[i]>1){
if(c[x[a[i]]]==1){
res=1;
break;
}
d.push_back(x[a[i]]);
a[i]=a[i]/x[a[i]];
}
for(j=0;j<d.size();j++){
c[d[j]]=1;
}
}
if(res==0){
cout << "pairwise coprime" << endl;
return 0;
}
for(i=0;i<n;i++){
a[i]=b[i];
}
int ans=gcd(a[0],a[1]);
for(i=2;i<n;i++){
ans=gcd(ans,a[i]);
}
if(ans==1){
cout << "setwise coprime" << endl;
}
else{
cout << "not coprime" << endl;
}
}
| 0
| 50,254,516
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
bool judge(vector<string> S){
int n = sz(S);
bool ok = true;
rep(i,n){
rep(j,n){
if(i==j)continue;
ok &= (S[i][j] == S[j][i]);
}
}
return ok;
}
int main() {
int n;
cin>>n;
vector<string> S(n);
rep(i,n)cin>>S[i];
int ans =0;
rep(i,n){
ans+=judge(S)*n;
rotate(S.begin(),S.begin()+1,S.end());
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#define MAX 100005
#define NIL -1
using namespace std;
struct Node {
int parent;
int left;
int right;
};
Node Tree[MAX];
int D[MAX];
void print(int u) {
printf("node %d: ",u);
printf("parent = %d, ",Tree[u].parent);
printf("depth = %d, ",D[u]);
if (Tree[u].parent==NIL) {
printf("root, ");
} else if (Tree[u].left==NIL) {
printf("leaf, ");
} else {
printf("internal node, ");
}
printf("[");
int c;
for (int i=0,c=Tree[u].left; c!=NIL; i++,c=Tree[c].right) {
if (i) {
printf(", ");
}
printf("%d",c);
}
printf("]\n");
}
int rec(int u,int p) {
D[u]=p;
if (Tree[u].right!=NIL) {
rec(Tree[u].right,p);
}
if (Tree[u].left!=NIL) {
rec(Tree[u].left,p+1);
}
}
int main() {
int n;
cin >> n;
for (int i=0; i<n; i++) {
Tree[i].parent=Tree[i].left=Tree[i].right=NIL;
}
for (int i=0; i<n; i++) {
int v, d;
cin >> v >> d;
int l;
for (int j=0; j<d; j++) {
int c;
cin >> c;
if (j==0) {
Tree[v].left=c;
} else {
Tree[l].right=c;
}
l=c;
Tree[c].parent=v;
}
}
int r;
for (int i=0; i<n; i++) {
if (Tree[i].parent==NIL) {
r=i;
}
}
rec(r,0);
for (int i=0; i<n; i++) {
print(i);
}
return 0;
}
| 0
| 85,403,493
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.