code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <string>
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <climits>
using namespace std;
using ll=long long;
void solve(){
while(1){
int m,mi,ma;
cin >> m >> mi >> ma;
if(!(m|mi|ma))return;
int ar[m];
for(int i=0;i<m;i++)
cin >> ar[i];
int res=0,j=-1;
for(int i=mi;i<=ma;i++)
if(res<=ar[i-1]-ar[i])
{res=ar[i-1]-ar[i];j=i;}
cout << j << endl;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#define INF 100000000000000000LL
using namespace std;
int main()
{
int n, m;
int a, b;
scanf("%d %d", &n, &m);
vector<int> v[100000];
for(int i=0; i<m; i++){
scanf("%d %d", &a, &b);
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
int c=0;
vector<int> conn[100000];
int d[100000], e[100000]={};
fill(d, d+n, -1);
set<int> st;
for(int i=0; i<n; i++){
st.insert(i);
}
vector<int> w;
while(!st.empty()){
auto begin=st.begin();
w.push_back(*begin);
conn[c].push_back(*begin);
d[*begin]=0;
if(v[*begin].empty()) e[c]=2;
st.erase(begin);
while(!w.empty()){
int x=w.back();
w.pop_back();
for(int i=0; i<v[x].size(); i++){
if(d[v[x][i]]==-1){
d[v[x][i]]=(d[x]+1)%2;
}else if(d[v[x][i]]==d[x]){
e[c]=1;
}
if(st.find(v[x][i])==st.end()) continue;
w.push_back(v[x][i]);
conn[c].push_back(v[x][i]);
st.erase(v[x][i]);
}
}
c++;
}
long long int cn2=0, cn0=0, cn1=0, ans=0;
for(int i=0; i<c; i++){
if(e[i]==2){
cn2++;
}else if(e[i]==1){
cn1++;
}else{
cn0++;
}
}
for(int i=0; i<c; i++){
if(e[i]==2){
ans=ans+n;
}else if(e[i]==1){
ans=ans+cn2*conn[i].size()+cn0+cn1;
}else{
ans=ans+cn2*conn[i].size()+2*cn0+cn1;
}
}
long long int N=(long long int)n;
printf("%lld\n", ans);
return 0;
}
| 0
| 58,377,621
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<lint, int>;
const int MAXN = 100005;
void my_ass(bool p){
if(!p){
puts("-1");
exit(0);
}
}
int n, leaf_size[MAXN];
pi a[MAXN];
vector<int> gph[MAXN];
lint get_dist(int x, int d){
lint ret = d;
for(auto &i : gph[x]) ret += get_dist(i, d + 1);
return ret;
}
int main(){
scanf("%d",&n);
for(int i=1; i<=n; i++){
scanf("%lld",&a[i].first);
a[i].second = i;
}
sort(a + 1, a + n + 1);
fill(leaf_size + 1, leaf_size + n + 1, 1);
for(int i=n; i>1; i--){
lint nxt = a[i].first - n + 2 * leaf_size[i];
int pos = lower_bound(a + 1, a + n + 1, pi(nxt, -1)) - a;
if(a[pos].first == nxt && pos < i){
gph[pos].push_back(i);
leaf_size[pos] += leaf_size[i];
}
else my_ass(0);
}
my_ass(get_dist(1, 0) == a[1].first);
for(int i=1; i<=n; i++){
for(auto &j : gph[i]){
if(i < j) printf("%d %d\n", a[i].second, a[j].second);
}
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
vector<int> p(n);
rep(i,n) cin >> p.at(i);
int mn = 0, ans = 0;
rep(i,n) {
if(i == 0 || p.at(i) < mn) {
ans++;
mn = p.at(i);
}
}
cout << ans << endl;
}
| 0
| 49,820,281
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string S, T;
cin >> S >> T;
int m = -1;
rep(i, S.size() - T.size() + 1) {
bool ok = true;
rep(j, T.size()) {
if (S[j + i] != '?' && S[j + i] != T[j]) {
ok = false;
}
}
if (ok) {
m = i;
}
}
if (m != -1) {
string ans = "";
rep(i, m) {
if (S[i] != '?') {
ans += S[i];
} else {
ans += "a";
}
}
ans += T;
for (int i = m + T.size(); i < S.size(); i++) {
if (S[i] != '?') {
ans += S[i];
} else {
ans += "a";
}
}
cout << ans << endl;
} else {
cout << "UNRESTORABLE" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << '\n';
print_space_enable = false;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
if (print_space_enable) std::cout << " ";
cout << fixed << setprecision(15) << head;
print_space_enable = true;
print(std::forward<Tail>(tail)...);
}
template<typename T>
void print(vector<T> v) {
for (size_t i = 0; i < v.size(); i++) {
if (i > 0) std::cout << " ";
std::cout << v[i];
}
std::cout << '\n';
}
vector<pair<char, int64_t>> run_length(string s) {
vector<pair<char, int64_t>> ret;
if (s.empty()) return ret;
int64_t cnt = 0;
char c = s[0];
for (size_t i = 0; i < s.size(); i++) {
if (s[i] == c) {
cnt++;
} else {
ret.emplace_back(c, cnt);
c = s[i];
cnt = 1;
}
if (i + 1 == s.size()) {
ret.emplace_back(c, cnt);
}
}
return ret;
}
int main() {
string s;
cin >> s;
vector<pair<char, Int>> v = run_length(s);
print(v.size() - 1);
return 0;
}
| 0
| 100,609,343
|
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
string s;
cin>>s;
string t;
bool a[n];
a[0]=0;
a[1]=0;
t="SS";
for(int i=1;i<n-1;i++){
if(a[i]){
if(s[i]=='x'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}else{
if(s[i]=='o'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}
}
for(int i=2;i<n;i++){
if(a[i])t+='W';
else t+='S';
}
for(int i=0;i<n;i++){
if(t[i]=='S'){
if(s[i]=='o'){
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}else{
if(s[i]=='o'){
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}
}
a[0]=0;
a[1]=1;
t="SW";
for(int i=1;i<n-1;i++){
if(a[i]){
if(s[i]=='x'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}else{
if(s[i]=='o'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}
}
for(int i=2;i<n;i++){
if(a[i])t+='W';
else t+='S';
}
for(int i=0;i<n;i++){
if(t[i]=='S'){
if(s[i]=='o'){
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}else{
if(s[i]=='o'){
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}
}
a[0]=1;
a[1]=0;
t="WS";
for(int i=1;i<n-1;i++){
if(a[i]){
if(s[i]=='x'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}else{
if(s[i]=='o'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}
}
for(int i=2;i<n;i++){
if(a[i])t+='W';
else t+='S';
}
for(int i=0;i<n;i++){
if(t[i]=='S'){
if(s[i]=='o'){
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}else{
if(s[i]=='o'){
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}
}
a[0]=1;
a[1]=1;
t="WW";
for(int i=1;i<n-1;i++){
if(a[i]){
if(s[i]=='x'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}else{
if(s[i]=='o'){
a[i+1]=a[i-1];
}else{
a[i+1]=a[i-1]^1;
}
}
}
for(int i=2;i<n;i++){
if(a[i])t+='W';
else t+='S';
}
for(int i=0;i<n;i++){
if(t[i]=='S'){
if(s[i]=='o'){
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}else{
if(s[i]=='o'){
if(t[(i-1+n)%n]!=t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}else{
if(t[(i-1+n)%n]==t[(i+1)%n]){
if(i==n-1){
cout << t<<endl;
return 0;
}
}else{
break;
}
}
}
}
cout << -1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
vector<long long> ki(200001,-1),button(200001,0);
vector<vector<long long>> kankei(200001);
void dfs(long long now,long long point){
point+=button.at(now);
ki.at(now)=point;
for(auto a:kankei.at(now)){
if(ki.at(a)==-1){
dfs(a,point);
}
}
}
int main(){
long long n,q;
cin>>n>>q;
for(long long i=0;i<n-1;i++){
long long a,b;
cin>>a>>b;
kankei.at(a).push_back(b);
kankei.at(b).push_back(a);
}
for(long long i=0;i<q;i++){
long long p,x;
cin>>p>>x;
button.at(p)+=x;
}
dfs(1,0);
for(long long i=1;i<=n;i++){
cout<<ki.at(i)<<endl;
}
return 0;
}
| 0
| 87,201,180
|
#include <stdio.h>
int main()
{
int n1=0,n2=0,n3=0;
scanf("%d %d %d",&n1,&n2,&n3);
if(n1<n2&&n2<n3)
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <numeric>
#include <iomanip>
#define M_PI acos(-1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const int MAX_V = 201;
int now = 0;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct edge {
int t;
edge(int _t) : t(_t) {}
};
bool use[100010];
vector<edge> te[100010];
vector<edge> fe[100010];
int d[100100];
ll rec(int num) {
if (num == 0) return 0;
return rec(num - 1) + num;
}
ll gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll calc(ll b,ll n){
if (n < b) return n;
return calc(b, n / b) + n % b;
}
void Solve() {
int n, m;
cin >> n >> m;
ll nsum = 0;
ll bef;
for (size_t i = 0; i < n; i++)
{
ll x;
cin >> x;
if (i == 0) {
bef = x;
continue;
}
ll add = ((n - 1) - (i - 1)) * i;
add %= INF;
add *= x - bef;
add %= INF;
nsum += add;
nsum %= INF;
bef = x;
}
ll msum = 0;
for (size_t i = 0; i < m; i++)
{
ll x;
cin >> x;
if (i == 0) {
bef = x;
continue;
}
ll add = ((m - 1) - (i - 1)) * (i);
add %= INF;
add *= x - bef;
add %= INF;
msum += add;
msum %= INF;
bef = x;
}
ll res = nsum * msum;
res %= INF;
cout << res << endl;
}
int main() {
Solve();
return 0;
}
| 0
| 1,694,774
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
if(a<b)return b;
else return a;
}
ll lmin(ll a,ll b){
if(a<b)return a;
else return b;
}
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(b==0)return a;
if(a%b==0)return b;
return gcd(b,a%b);
}
ll Pow(ll n,ll k){
ll ret=1;
ll now=n;
while(k>0){
if(k&1)ret*=now;
now*=now;
k/=2;
}
return ret;
}
void out(ll n){
cout<<"? "<<n<<endl;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int c=1;
for(ll i=9;;i=i*10+9){
out(i);
string s;cin>>s;
if(s=="Y"){
break;
}
else{
c++;
}
if(i==999999999)break;
}
if(c==1){
out(10);string t;cin>>t;
if(t=="N"){
for(ll i=20;i<100;i+=10){
out(i);
string s;cin>>s;
if(s=="Y"){
cout<<"! "<<i/10<<endl;
return 0;
}
}
}
int r=0;
for(ll i=10;;i*=10){
out(i);
string s;cin>>s;
if(s=="N"){
r=1;
break;
}
c++;
if(i==1000000000)break;
}
if(r==0){
cout<<"! "<<1<<endl;
return 0;
}
}
if(c==10){
cout<<"! "<<1000000000<<endl;
return 0;
}
ll ans=0;
for(ll i=0;i<c-1;i++){
int u=10,d=0;
while(u-d>1){
int mid=(u+d)/2;
out(ans+mid);
string s;cin>>s;
if(s=="Y"){
d=mid;
}
else{
u=mid;
}
}
ans+=d;
ans*=10;
}
ll now=ans;
ll u=9,d=-1;
while(u-d>1){
ll mid=(u+d)/2;
ll r=now+mid;
r*=10;
r+=9;
cout<<"? "<<r<<endl;
string s;cin>>s;
if(s=="Y")u=mid;
else d=mid;
}
ans+=u;
cout<<"! "<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
int p[MAX_N];
int idx[MAX_N];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &(p[i]));
p[i] -= 1;
idx[p[i]] = i;
}
set<int> st;
ll ans = 0LL;
for (int x = n - 1; x >= 0; --x) {
int i = idx[x];
ll c = 0LL;
{
st.insert(i);
vector<int> l(2, -1);
vector<int> r(2, n);
{
auto itr = st.find(i);
for (int j = 0; j < 2; ++j) {
if (itr == st.begin()) break;
--itr;
l[j] = *itr;
}
}
{
auto itr = st.find(i);
for (int j = 0; j < 2; ++j) {
++itr;
if (itr == st.end()) break;
r[j] = *itr;
}
}
vector<int> ls(2);
ls[0] = i - l[0];
ls[1] = l[0] - l[1];
vector<int> rs(2);
rs[0] = r[0] - i;
rs[1] = r[1] - r[0];
c = (ll)(ls[0] * rs[1]) + (ll)(ls[1] * rs[0]);
}
ans += c * (x + 1);
}
printf("%lld\n", ans);
return 0;
}
| 0
| 19,080,091
|
#include<bits/stdc++.h>
using namespace std;
int n, m, a[101], sum, temp, i, c;
int main()
{
cin >> n >> m;
for(i=0;i<n;i++)
{
cin >> a[i];
sum += a[i];
}
sort(a, a+n);
temp = sum /(4*m) + (sum%(4*m)>0);
for(i=0;i<n;i++)
{
if(a[i]>=temp)
c++;
}
if(c>=m)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, B, digit = 1, sum = 0, C;
cin >> N;
B = N;
C = N;
for ( i = 0; i < N; i++) {
if (B / 10 > 0) {
B = B / 10;
digit++;
}
else {
break;
}
}
for ( i = 0; i < digit; i++) {
sum += N % 10;
N /= 10;
}
if( C % sum == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0
| 49,357,224
|
#include <iostream>
using namespace std;
long long gcd(long long a, long long b){
while(a%b>0){
long long g = a%b;
a = b;
b = g;
}
return b;
}
int main() {
int n;
cin>>n;
long long num;
long long multi=1;
for (int i=0; i<n; i++){
cin >> num;
long long g = gcd(multi,num);
multi = multi/g*num;
}
cout << multi << endl;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };
int main(){
ios::sync_with_stdio(false);
string str, str_r;
cin >> str;
reverse(begin(str), end(str));
cout << str << endl;
}
| 0
| 34,592,895
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
set<int>S;
for(int i=0;i<N;i++)
S.insert(A.at(i));
int ans=S.size();
if(N%2==ans%2)
cout<<ans<<endl;
else
cout<<ans-1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
typedef long long int ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define lastone(n) ((n)&(-(n)))
#define read freopen("debug\\in.txt","r",stdin)
#define write freopen("debug\\out.txt","w",stdout)
#define DBG(a) cout<<#a<<" ->->->-> "<<a<<"\n"
#define EN cout<<"\n"
#define fi first
#define se second
#define PI (acos(-1))
#define fastread ios::sync_with_stdio(false);cin.tie(NULL)
#define mod (1000000007)
#define asz 200005
template<class T> ostream& operator<<(ostream &s,pair<T,ll> a)
{
s<<a.fi<<' '<<a.se;
return s;
}
int main()
{
fastread;
ll T=1;
for(ll qq=1;qq<=T; qq++)
{
ll n;
cin>>n;
vi a(n);
for(auto &x:a)cin>>x;
ll ans=0;
for(int i=0;i<n;i++)
{
ans+=a[i]/2;
a[i]%=2;
if(a[i]&&i!=n-1&&a[i+1])ans++,a[i+1]--;
}
cout<<ans<<endl;
}
}
| 0
| 28,526,150
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
string s, t;
cin >> s >> t;
cout << t << s << endl;
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 h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h)
cin >> s[i];
vector<vector<vector<int>>> id(h, vector<vector<int>>(w, vector<int>(2)));
vector<vector<int>> hl(h), vl(w);
rep(i, h)
{
int c = 0, l = 0;
rep(j, w)
if (s[i][j] == '#')
{
hl[i].push_back(l);
l = 0;
c++;
}
else
{
l++;
id[i][j][0] = c;
}
if (l != 0)
hl[i].push_back(l);
}
rep(j, w)
{
int c = 0, l = 0;
rep(i, h)
if (s[i][j] == '#')
{
vl[j].push_back(l);
l = 0;
c++;
}
else
{
l++;
id[i][j][1] = c;
}
if (l != 0)
vl[j].push_back(l);
}
int ans = 0;
rep(i, h)
rep(j, w)
if (s[i][j] == '.')
ans = max(ans, hl[i][id[i][j][0]] + vl[j][id[i][j][1]] - 1);
cout << ans << endl;
return 0;
}
| 0
| 84,020,580
|
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define vi vector<int>
#define vll vector<ll>
#define vi2 vector<vector<int>>
#define eb emplace_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
using P = pair<ll,ll>;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};
#define INT(name) int name;cin >> name;
#define VEC(type,name,n) vector<type> name(n);REP(i,n) cin >> name[i];
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()
{
INT(K);
vector<ll> A(K);
REP(i, K) cin >> A[i];
reverse(ALL(A));
if(A[0]!=2){
cout << -1 << endl;
}else{
ll MIN=2;
ll MAX=3;
int flag = 0;
FOR(i,1,K){
if(MIN%A[i]!=0){
MIN=(MIN/A[i]+1)*A[i];
}
MAX=MAX/A[i]*A[i]+A[i]-1;
if(MAX<MIN){
flag=1;
break;
}
}
if(flag==1){
cout << -1 << endl;
}else{
cout << MIN << " " << MAX << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[7],b,c,d;
for(int i=1;i<=6;i++){
cin>>a[i];
}
cin>>b;
for(int i=0;i<b;i++){
cin>>c>>d;
if(c==a[1]){
if(d==a[2])cout<<a[3]<<endl;
if(d==a[3])cout<<a[5]<<endl;
if(d==a[5])cout<<a[4]<<endl;
if(d==a[4])cout<<a[2]<<endl;
}else if(c==a[2]){
if(d==a[1])cout<<a[4]<<endl;
if(d==a[4])cout<<a[6]<<endl;
if(d==a[6])cout<<a[3]<<endl;
if(d==a[3])cout<<a[1]<<endl;
}else if(c==a[3]){
if(d==a[1])cout<<a[2]<<endl;
if(d==a[2])cout<<a[6]<<endl;
if(d==a[6])cout<<a[5]<<endl;
if(d==a[5])cout<<a[1]<<endl;
}else if(c==a[4]){
if(d==a[1])cout<<a[5]<<endl;
if(d==a[5])cout<<a[6]<<endl;
if(d==a[6])cout<<a[2]<<endl;
if(d==a[2])cout<<a[1]<<endl;
}else if(c==a[5]){
if(d==a[1])cout<<a[3]<<endl;
if(d==a[3])cout<<a[6]<<endl;
if(d==a[6])cout<<a[4]<<endl;
if(d==a[4])cout<<a[1]<<endl;
}else if(c==a[6]){
if(d==a[2])cout<<a[4]<<endl;
if(d==a[4])cout<<a[5]<<endl;
if(d==a[5])cout<<a[3]<<endl;
if(d==a[3])cout<<a[2]<<endl;
}
}
}
| 0
| 58,184,592
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
int rightPredict=0;
cin>>S>>T;
for(int i =0;i<=2;i+=1){
if (S[i]==T[i]){
rightPredict+=1;
}
}
cout<<rightPredict;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int n, m;
cin >> n;
map<string,int>mp;
vector<string>v;
rep(i, 0, n){
string a;
cin >> a;
v.push_back(a);
mp[a]++;
}
cin >> m;
rep(i, 0, m){
string b;
cin >> b;
v.push_back(b);
mp[b]--;
}
int ans=0;
rep(i, 0, v.size()){
ans = max(mp[v[i]],ans);
}
cout << ans << endl;
}
| 0
| 48,613,707
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
int cur = 0;
for(char& c : s) {
if(c == 'R') {
cur++;
} else {
ans = max(ans, cur);
cur = 0;
}
}
ans = max(ans, cur);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pair<int,int>;
using vec = vector<int>;
using ll=long long;
using vll = vector<ll>;
using vvll = vector<vector<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() {
int n;cin>>n;
map<string,int> mp;
rep(i,n){
string s;
cin>>s;
sort(s.begin(),s.end());
mp[s]++;
}
ll ans= 0;
for(auto& p: mp){
int s = p.second;
ans += (ll)s*(s-1)/2;
}
cout<< ans << endl;
return 0;
}
| 0
| 96,138,995
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
long long n;
cin >> n;
if (n % 1000000000 == 0) {
cout << "0 0 1000000000 1 " << 0 << " " << n / 1000000000 << endl;
} else {
cout << "0 0 1000000000 1 " << 1000000000 - (n % 1000000000) << " " << (n + 999999999) / 1000000000 << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define double long double
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll K;
cin>>K;
ll A[K];
REP(i,K) cin>>A[i];
bool CAN=true;
ll mn=2,mx=2;
for(int i=K-1; i>=0; --i){
if(mx/A[i]==mn/A[i] && mn*mx%A[i]!=0){
CAN=false;
break;
}
mn=((mn-1)/A[i]+1)*A[i];
mx=(mx/A[i]+1)*A[i]-1;
}
if(CAN) cout<<mn<<" "<<mx<<endl;
else co(-1);
return 0;
}
| 0
| 92,127,303
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<vector<ll> >;
using vvc = vector<vector<char> >;
using vd = vector <double>;
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
#define sortp(d) sort(d.begin(),d.end())
#define sortm(d) sort(d.rbegin(),d.rend())
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
int wa(ll x)
{
ll sum = 0;
while(x!=0){
sum += x% 10;
x /= 10;
}
return sum;
}
ll p=0,q=0,y=0;
int main()
{
ll a,b;
cin>>a>>b;
rep(i,1010)
{
p=i*0.08;q=i*0.1;
if (a==p&&q==b)
{
print(i);return 0;
}
}
print(-1)
}
|
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
int i, j, k;
int n;
int b, f, r, v;
int building[4][3][10];
cin >> n;
memset(building, 0, sizeof(building));
for (i = 0; i < n; i++) {
cin >> b;
cin >> f;
cin >> r;
cin >> v;
building[b - 1][f - 1][r - 1] += v;
}
for (i = 0; i < 4; i++) {
for (j = 0; j < 3; j++) {
for (k = 0; k < 10; k++) {
cout << " " << building[i][j][k];
}
cout << endl;
}
if (i < 3) {
cout << "####################" << endl;
}
}
return 0;
}
| 0
| 91,438,323
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int res = 0;
for (int i = 1; i <= x/100; i++) {
if (100*i <= x && x <= 105*i) res = 1;
}
cout << res << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
using namespace std;
#define MAX 100
int d[MAX], t = 0, M[MAX][MAX] = {}, n;
void bfs(){
queue<int> todo;
d[0] = 0;
todo.push(0);
while(!todo.empty()){
int m = todo.front();
todo.pop();
rep(i, n){
if(d[i] == -1 && M[m][i]){
d[i] = d[m] + 1;
todo.push(i);
}
}
}
return;
}
int main(){
cin >> n;
fill(d, d + n, -1);
int m, l;
rep(i, n){
cin >> m >> l;
rep(j, l){
int o;
cin >> o;
M[m - 1][o - 1] = 1;
}
}
bfs();
rep(i, n){
cout << i + 1 << " " << d[i] << endl;
}
return 0;
}
| 0
| 89,784,951
|
#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<ll, ll>;
#define FOR(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 MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout << fixed << setprecision(x)
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
int gcd(int a, int b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int lcm(int a, int b)
{
return a * b / gcd(a, b);
}
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, d;
cin >> n >> d;
vector<vector<double>> x(n, vector<double>(d));
rep(i, n) rep(j, d) cin >> x[i][j];
int total = 0;
vector<int> ans;
rep(i, n-1){ for (int j = i + 1; j < n; j++){int sum = 0;
rep(k, d) {
sum += (x[j][k] - x[i][k]) * (x[j][k] - x[i][k]);
}
ans.push_back(sum);
}}
rep(i,ans.size()){
rep(j,10000){
if (ans[i] == j * j) {
total++;
break;
}
}
}
cout << total << endl;
}
|
#include <stdio.h>
typedef long long ll;
ll min(ll a, ll b) {
return a > b ? b : a;
}
ll max(ll a, ll b) {
return a > b ? a : b;
}
int main(void) {
ll i, j, k, l, n, ans = 0, now;
scanf("%lld%lld", &n, &k);
ll h[n + 2], dp[n + 2][n + 1], d[n + 2][n + 1];
h[0] = 0, h[n + 1] = 0;
for(i = 1; i <= n; ++i) scanf("%lld", &h[i]);
for(i = 0; i <= n; ++i) if(h[i + 1] > h[i]) ans += h[i + 1] - h[i];
for(i = 0; i < n + 2; ++i) for(j = 0; j <= n; ++j) dp[i][j] = d[i][j] = 0;
for(i = 2; i < n + 2; ++i) {
for(j = i - 1; j; --j) {
d[i][i - j] = d[i][i - j - 1];
if(h[j] < h[i]) {
if(h[j - 1] > h[j]) d[i][i - j] += min(h[j - 1], h[i]) - h[j];
} else if(h[j] > h[j - 1]) d[i][i - j] += h[j] - max(h[j - 1], h[i]);
}
}
for(i = 2; i < n + 2; ++i) {
dp[i][0] = dp[i - 1][0];
for(j = 1; j <= k; ++j) dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
for(j = 1; j < i; ++j) for(l = 0; l <= k - j; ++l) if(dp[i - j - 1][l] + d[i][j] > dp[i][l + j])
dp[i][l + j] = dp[i - j - 1][l] + d[i][j];
}
printf("%lld", ans - dp[n + 1][k]);
return 0;
}
| 0
| 85,449,052
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n,i,l,m=1e13; cin>>n;
for(i=1;i<=sqrt(n);i++)
{
if (n%i==0)
{
l=(n/i)-1+(i-1);
m=min(m,l);
}
}
cout<<m;
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
int main(){
string left="zaqxswcdevfrbgt";
string right="nhymjukilop";
string input;
while (1){
int count=-1;
int boo=0;
cin>>input;
for (int i=0;i<input.length();i++){
for (int j=0;j<right.length();j++){
if (input[i]==right[j]){
if (boo!=1)
count++;
boo=1;
break;
}
}
for (int l=0;l<left.length();l++){
if (input[i]==left[l]){
if (boo!=2)
count++;
boo=2;
break;
}
}
}
if (input=="#"){
break;
}
cout<<count<<endl;
}
return 0;
}
| 0
| 17,912,463
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int A, B; cin >> A >> B;
string ans = "Yay!";
if (A > 8 || B > 8) {
ans = ":(";
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[101010];
main()
{
int n;
int x, y;
long long o;
cin >>n;
for(int i = 0; i < n; i ++)
cin >>a[i].first >>a[i].second;
for(int k = o = 0; k < 100000; k ++)
{
random_shuffle(a, a + n);
x = 0;
y = 0;
for(int i = 0; i < n; i ++)
{
if((long long)(x + a[i].first) * (x + a[i].first) + (long long)(y + a[i].second) * (y + a[i].second) > (long long)x * x + (long long)y * y)
{
x += a[i].first ;
y += a[i].second;
}
}
o = max(o, (long long)x * x + (long long)y * y);
}
cout <<fixed <<setprecision(20) <<(sqrt(o));
}
| 0
| 3,235,234
|
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
deque<char>c;
for(int i=0;i<s.length();i++)
{
c.push_back(s[i]);
}
bool flag = true;
string loc;
string s1 = "maerd",s2 = "remaerd",s3 = "esare",s4 = "resare";
while(!c.empty())
{
loc="";
while(!c.empty()&&loc.length()!=5)
{
loc = loc+c.back();
c.pop_back();
}
if(loc==s1||loc==s3)
{
continue;
}
else
{
while(!c.empty()&&loc.length()!=6)
{
loc = loc+c.back();
c.pop_back();
}
if(loc==s4)
{
continue;
}
else
{
while(!c.empty()&&loc.length()!=7)
{
loc = loc+c.back();
c.pop_back();
}
if(loc==s2)
{
continue;
}
else
{
flag = false;
break;
}
}
}
}
if(flag)
{
cout << "YES\n";
}
else
{
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string S; cin>>S;
int N=S.size();
bool ikeru=0;
if(S.substr(0, 7)=="keyence") ikeru=1;
if(S.substr(0, 6)=="keyenc" && S.substr(N-1, 1)=="e") ikeru=1;
if(S.substr(0, 5)=="keyen" && S.substr(N-2, 2)=="ce") ikeru=1;
if(S.substr(0, 4)=="keye" && S.substr(N-3, 3)=="nce") ikeru=1;
if(S.substr(0, 3)=="key" && S.substr(N-4, 4)=="ence") ikeru=1;
if(S.substr(0, 2)=="ke" && S.substr(N-5, 5)=="yence") ikeru=1;
if(S.substr(0, 1)=="k" && S.substr(N-6, 6)=="eyence") ikeru=1;
if(S.substr(N-7, 7)=="keyence") ikeru=1;
if(ikeru) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
| 0
| 28,232,145
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
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; }
void solve() {
int x; cin >> x;
int sum = 0;
string s = to_string(x); int n = (int)s.size();
rep(i, n) sum += s[i] - '0';
if(x % sum == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
#define fast() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define digit(N) cout << fixed << setprecision((N))
bool is_unbalanced(string s)
{
map<char, int> mp;
int sz = s.size();
if (sz < 2)
return false;
for (int i = 0; i < sz; i++)
{
mp[s[i]]++;
}
for (auto &c : mp)
{
if (2 * c.second > sz)
return true;
}
return false;
}
string s;
int main()
{
cin >> s;
int N = s.size();
for (int i = 0; i + 1 < N; i++)
{
string t = s.substr(i, 2);
if (is_unbalanced(t))
{
cout << i + 1 << " " << i + 2 << "\n";
return 0;
}
}
if (N == 2)
{
cout << -1 << " " << -1 << endl;
return 0;
}
for (int i = 0; i + 2 < N; i++)
{
string t = s.substr(i, 3);
if (is_unbalanced(t))
{
cout << i + 1 << " " << i + 3 << "\n";
return 0;
}
}
cout << -1 << " " << -1 << endl;
}
| 0
| 26,323,870
|
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
bool p[3000000];
vector<int> prime;
void init(){
memset(p,1,sizeof(p));
p[0] = p[1] = false;
for(int i = 2; i <= 1000000; i++){
if(!p[i]) continue;
for(long long j = 1LL*i*i; j <= 1000000; j += i)
p[j] = false;
prime.push_back(i);
}
}
int CntPrime(int n){
vector<int>::iterator it = lower_bound(prime.begin(), prime.end(), n);
if(it == prime.end()) return prime.size();
if( *it > n) it--;
return (it - prime.begin()+1);
}
int main(){
init();
int n;
while(cin >> n){
cout << CntPrime(n)<< endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<vector<int>> Graph;
int main() {
map<string,int> mp;
int n,m;
cin >> n;
string s;
rep(i,n){
cin >> s;
mp[s]++;
}
cin >> m;
rep(i,m){
cin >> s;
mp[s]--;
}
int ans=0;
for(auto i : mp){
ans = max(ans,i.second);
}
cout << ans << endl;
}
| 0
| 8,030,147
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(void) {
int a[30], l;
char c[30];
string s;
for (int i = 0; i < 26; i++) {
c[i] = 'a' + i;
a[i] = 0;
}
while (cin >> s) {
l = s.size();
for (int i = 0; i < l; i++) {
if ('A' <= s[i] && s[i] <= 'Z') {
s[i] = s[i] - 'A' + 'a';
}
for (int j = 0; j < 26; j++) {
if (s[i] == c[j]) {
a[j]++;
}
}
}
}
for (int i = 0; i < 26; i++) {
cout << c[i] << " : " << a[i] << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#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>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define mod 1000000007
using ll = long long;
using namespace std;
int main(){
string s,t;
cin >> s >> t;
vi ss(26), tt(26);
rep(i, s.size()){
int sn = ss[int(s[i] - 'a')];
int tn = tt[int(t[i] - 'a')];
if(sn != tn){
cout << "No" << endl;
return 0;
}
ss[int(s[i] - 'a')]++;
tt[int(t[i] - 'a')]++;
}
cout << "Yes" << endl;
}
| 0
| 2,381,890
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int N,L,T;
cin >> N >> L >> T;
vector<int> X(N);
vector<int> W(N);
vector<int> A(N);
vector<int> R(N);
rep(i,N){
cin >> X[i] >> W[i];
if(W[i] == 1){
A[i] = X[i] + T;
A[i] %= L;
}else{
A[i] = X[i] - T;
A[i] %= L;
if(A[i] < 0) A[i] += L;
}
}
int cnt = 0;
rep(i,N){
if(W[i] == 1){
cnt += (X[i]+T)/L;
}else{
cnt -= (T + L - X[i]-1)/L;
}
}
sort(A.begin(), A.end());
cnt = ((cnt % N) + N) % N;
for (int i = 0; i < N; ++i) R[i] = A[(i+cnt)%N];
for (int i = 0; i < N; ++i) cout << R[i] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PB(x, v) x.push_back(v);
#define pll pair<ll, ll>
#define ll long long
#define mll map<ll, ll>
#define vl vector<ll>
#define fa(x, v) for(auto x: v)
#define fr(i, a, b) for(int i= a;i <=b; i++)
#define B_ begin()
#define E_ end()
#define all(a) a.begin(), a.end()
#define NL_ "\n"
#define MAX 2000000000
#define F first
#define S second
#define FF first.first
#define FS first.second
#define SF second.first
#define SS second.second
#define mod(a) a%1000000007
int main()
{
FAST;
ll n;
cin >> n;
ll arr[n];
for(ll i=0; i< n; i++)
{
cin >> arr[i];
}
ll mn = LLONG_MAX;
ll cnt= 0;
for(int i = 0; i< n; i++)
{
mn = min(arr[i], mn);
if(mn>=arr[i]) cnt++;
}
cout << cnt<<NL_;
return 0;
}
| 0
| 79,877,046
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace std;
int main()
{
ll K;
cin>>K;
if(K==4||K==6||K==9||K==10||K==14||
K==21||K==22||K==25||K==26){
cout<<"2"<<endl;
}
else if(K==8||K==12||K==18||K==20||K==27){
cout<<"5"<<endl;
}
else if(K==16){
cout<<"14"<<endl;
}
else if(K==24){
cout<<"15"<<endl;
}
else if(K==28||K==30){
cout<<"4"<<endl;
}
else if(K==32){
cout<<"51"<<endl;
}
else{
cout<<"1"<<endl;
}
}
|
#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=1000000007;
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));}
vector<ll> pw2(51,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,50) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N,M; cin>>N>>M;
ll ans=0;
vector<ll> ken(M+1,0);
vector<ll> number(M+1,0);
set<P> se[100001];
rep1(i,M){
ll p,Y; cin>>p>>Y;
ken[i]=p;
se[p].insert(P(Y,i));
}
rep1(i,N){
ll count=1;
for(auto it=se[i].bg;it!=se[i].ed;it++){
number[(*it).b]=count++;
}
}
rep1(i,M){
printf("%06lld",ken[i]);
printf("%06lld",number[i]);
cout<<endl;
}
}
| 0
| 74,530,273
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N, D;
cin >> N >> D;
vector<vector<int>> vec;
REP(i, N) {
vector<int> tmp(D);
REP(j, D) {
cin >> tmp[j];
}
vec.push_back(tmp);
}
int res = 0;
REP(i, N) {
for (int j = i+1; j < N; j++) {
if (i == j) {
continue;
}
double ans = 0;
REP(k, D) {
int b = abs(vec[i][k] - vec[j][k]);
ans += b*b;
}
ans = sqrt(ans);
if(abs(ans - (int)ans)>0) {
continue;
}
res++;
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
const ll MOD=1000000007LL;
ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { return MUL(x, POW(y, MOD-2)); }
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == 0) {
v.clear();
return 0;
}
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
return i;
}
void read_cr() {
fgets(_buf, 256, stdin);
}
ll solve(int N, vi& t, vi& a) {
if (t[N-1] != a[0]) return 0;
vii rt(N), ra(N);
int last = 0;
rep(i,N){
if (t[i] > last) {
rt[i] = ii(t[i], t[i]);
last = t[i];
} else {
rt[i] = ii(1, last);
}
}
last = 0;
for(int i=N-1; i>=0; --i){
if (a[i] > last) {
ra[i] = ii(a[i], a[i]);
last = a[i];
} else {
ra[i] = ii(1, last);
}
}
ll ans = 1LL;
rep(i,N){
int lo = max(rt[i].first, ra[i].first);
int hi = min(rt[i].second, ra[i].second);
if (lo > hi) return 0;
ans = MUL(ans, hi - lo + 1);
}
return ans;
}
int main() {
int N; scanf("%d", &N); read_cr();
vi T(N), A(N);
loadvec(T,N);
loadvec(A,N);
cout << solve(N,T,A) << endl;
return 0;
}
| 0
| 39,327,381
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
double s=0,n,v1[200001],v2[200001],T[200],V[200],ans=0;
cin>>n;
rep(i,n){
cin>>T[i],s+=T[i];
if(i>0) T[i]+=T[i-1];
}
rep(i,n) cin>>V[i];
double t;
int x=0;
rep(i,2*s+1){
t=double(i)/2;
if(t==0) v1[i]=0;
else v1[i]=min(v1[i-1]+0.5,V[x]);
if(x<n-1&&t==T[x]) x++;
}
x=n-1;
for(int i=2*s;i>=0;i--){
t=double(i)/2;
if(t==s) v2[i]=0;
else v2[i]=min(v2[i+1]+0.5,V[x]);
if(x>0&&t==T[x-1]) x--;
}
rep(i,2*s) ans+=(min(v1[i],v2[i])+min(v1[i+1],v2[i+1]))/4;
cout<<setprecision(10)<<ans;
}
|
#include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
ll sigma(ll n, ll m)
{
return ((n + m) * (m - n + 1) * 0.5);
}
void Main()
{
ll h, w; cin >> h >> w;
vvc s(h + 2, vc(w + 2, '.'));
for(ll i = 1;i <= h;i++)
{
for(ll j = 1;j <= w;j++)
{
cin >> s[i][j];
}
}
for(ll i = 1;i <= h;i++)
{
for(ll j = 1;j <= w;j++)
{
if(s[i][j] == '#'&&s[i + 1][j] == '.'&&s[i - 1][j] == '.'&&s[i][j + 1] == '.'&&s[i][j - 1] == '.')
fin("No");
}
}
fin("Yes");
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
| 0
| 99,509,905
|
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main(){
int N,K,i;char c;scanf("%d %d\n",&N,&K);
vector<int> v;v.emplace_back(0);
bool p = 1;
for(i=0;i<N;i++){
scanf("%c",&c);
if((c == '1') == p) v.back()++;
else{
v.emplace_back(1);
p ^= 1;
}
}
if(v.size() <= K*2+1){
printf("%d\n",N);return 0;
}
int now = accumulate(v.begin(),v.begin()+K*2+1,0),ans = now;
if(v.size()%2 == 0) v.emplace_back(0);
for(i=K*2+1;i<v.size()-1;i+=2){
now -= v[i-K*2-1]+v[i-K*2];
now += v[i]+v[i+1];
ans = max(ans,now);
}
printf("%d\n",ans);
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
const int INF = 1<<29;
typedef long long int ll;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n>>b)&1; }
inline void set_bit(int & n, int b) { n |= two(b); }
inline void unset_bit(int & n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) { int res = 0; while(n && ++res) n-=n&(-n); return res; }
template<class T> void chmax(T & a, const T & b) { a = max(a, b); }
template<class T> void chmin(T & a, const T & b) { a = min(a, b); }
const int MOD=1000000007;
bool isPowerOfTwo (ll x)
{
return x && (!(x&(x-1)));
}
bool isPrime(int n)
{
if (n <= 1) return false;
if (n <= 3) return true;
if (n%2 == 0 || n%3 == 0) return false;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return false;
return true;
}
int highestPowerof2(unsigned int n)
{
if (n < 1)
return 0;
int res = 1;
for (int i=0; i<8*sizeof(unsigned int); i++)
{
int curr = 1 << i;
if (curr > n)
break;
res = curr;
}
return res;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
const int dx[] = {1,0,-1,0,1,1,-1,-1};
const int dy[] = {0,-1,0,1,1,-1,-1,1};
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
while(t--)
{
ll n;
cin>>n;
const ll p = 998244353;
ll a[n];
map<ll,ll> mp;
REP(i,n)
{
cin>>a[i];
mp[a[i]]++;
}
if(mp[0]!=1)
{
cout<<0;
return 0;
}
ll ans=1;
for(int i=1;i<n;i++)
{
ans*=mp[a[i]-1];
ans%=p;
}
cout<<ans;
}
return 0;
}
| 0
| 50,729,920
|
#include<iostream>
using namespace std;
int main(){
int n, m;
int data[128];
char x, y;
char z;
while(1){
cin >> n;
if (n == 0) break;
else {
for(int i = 0; i< 128; i++){
data[i] = i;
}
for(int i = 0; i< n; i++){
cin >> x >> y;
data[static_cast<int>(x)] = static_cast<int>(y);
}
cin >> m;
for (int i= 0; i< m; i++){
cin >> z;
cout<< static_cast<char>(data[static_cast<int>(z)]);
}
cout <<"\n";
}
}
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int a,b;
double ans;
int main(){
cin >> a >> b;
ans=(double)a/b;
cout << a/b <<' '<< a%b <<' ';
printf("%.10lf\n",ans);
return 0;
}
| 0
| 68,253,221
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
char a;
a=1;
while(true){
scanf("%c",&a);
if(a=='\n'){
break;
}
if(a>='a' && a<='z'){
a=a-32;
}else if(a>='A' && a<='Z'){
a=a+32;
}
cout<<(char)a;
}
cout<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
bool flag = 0;
ll saiki(int x,vector<ll> &a,vector<set<int> > &st){
if(flag)return -1;
if(st[x].size()==0){
return a[x];
}
ll tmp = 0;
ll mx = 0;
for(auto k:st[x]){
st[k].erase(x);
ll z = saiki(k,a,st);
mx = max(mx,z);
tmp += z;
}
ll ans = 2*a[x]-tmp;
ll k = a[x]-ans;
if(k>tmp-mx||k>tmp/2){
flag = 1;
return -1;
}
if(ans<0||ans>tmp){
flag = 1;
return -1;
}else{
return ans;
}
}
int main(){
int n;
cin >> n;
vector<ll>a(n);
rep(i,n){
cin >> a[i];
}
vector<set<int> > st(n);
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;
y--;
st[x].insert(y);
st[y].insert(x);
}
if(n==2){
if(a[0]==a[1]){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
return 0;
}
int x = 0;
if(st[x].size()==1){
x = *st[x].begin();
}
ll p = saiki(x,a,st);
if(flag||p!=0){
cout << "NO" << endl;
}else{
cout << "YES" << endl;
}
return 0;
}
| 0
| 24,192,137
|
#include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<ll> sum1,sum2;
void pre_process(vector<ll> &a,vector<ll> &s){
ll n=(ll)a.size();
s.assign(n+1,0);
for(ll i=0;i<n;i++){
s[i+1]=s[i]+a[i];
}
}
ll query(ll i,ll j,vector<ll> &s){
return (s[j]-s[i]);
}
int main(){
ll n,k;cin>>n>>k;
vector<ll> v(n);
rep(i,n) cin>>v[i];
pre_process(v,sum1);
reverse(v.begin(),v.end());
pre_process(v,sum2);
reverse(v.begin(),v.end());
ll ans=0,sum=0;
rep(left,min(n,k)+1){
rep(right,min(n,k)+1-left){
priority_queue<ll> que;
sum=(sum1[left]+sum2[right]);
rep(i,left+1){
if(i==0) continue;
que.push(-1*v[i-1]);
}
reverse(v.begin(),v.end());
rep(i,right+1){
if(i==0) continue;
que.push(-1*v[i-1]);
}
reverse(v.begin(),v.end());
rep(i,k-left-right){
if(que.size()==0) continue;
ll now=que.top();
que.pop();
if(now>0){
sum+=now;
}else{
break;
}
}
chmax(ans,sum);
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <random>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double ld;
#define double ld
#define loop(i, n) for(int i = 0; i < (int)n; ++i)
#define loop1(i, n) for(int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair <int, int>
#define all(x) begin(x), end(x)
#define ti tuple <int, int, int>
#define Point Vect
#define mkt make_tuple
#define no {cout << "No"; return;}
const int N = 1e5 + 7;
int p[N], t[4 * N];
void build(int v, int l, int r) {
if (l == r) {
t[v] = p[l];
return;
}
int m = l + r >> 1;
build(2 * v + 1, l, m);
build(2 * v + 2, m + 1, r);
t[v] = max(t[2 * v + 1], t[2 * v + 2]);
}
int ask(int v, int l, int r, int L, int R, int x, bool flag, int n) {
if (l > R || r < L || t[v] < x)
return (!flag ? n : -1);
if (l == r)
return l;
int m = l + r >> 1;
int pans = (!flag ? ask(2 * v + 1, l, m, L, R, x, flag, n) : ask(2 * v + 2, m + 1, r, L, R, x, flag, n));
return (pans != -1 && pans != n ? pans : (!flag ? ask(2 * v + 2, m + 1, r, L, R, x, flag, n) : ask(2 * v + 1, l, m, L, R, x, flag, n)));
}
void solve() {
int n; cin >> n;
vector <int> nxt(n, n), prv(n, -1), snxt(n), sprv(n);
stack <int> s;
loop(i, n) {
cin >> p[i];
while (!s.empty() && p[s.top()] < p[i]) {
nxt[s.top()] = i; s.pop();
}
s.push(i);
}
while (!s.empty())
s.pop();
for (int i = n - 1; i >= 0; --i) {
while (!s.empty() && p[s.top()] < p[i]) {
prv[s.top()] = i; s.pop();
}
s.push(i);
}
build(0, 0, n - 1);
loop(i, n) {
sprv[i] = ask(0, 0, n - 1, 0, prv[i] - 1, p[i], 1, n);
snxt[i] = ask(0, 0, n - 1, nxt[i] + 1, n - 1, p[i], 0, n);
}
ll ans = 0;
loop(i, n) {
if (prv[i] != -1)
ans += ll(prv[i] - sprv[i]) * (nxt[i] - i) * p[i];
if (nxt[i] != n)
ans += ll(snxt[i] - nxt[i]) * (i - prv[i]) * p[i];
}
cout << ans;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 47,559,589
|
#include <iostream>
using namespace std;
int triangle(int a,int b,int c){
if(a<=0 || b<=0 || c<=0){
cout << "ERROR" << endl;
return 1;
}
if(a < b){
swap(a,b);
}
if(a < c){
swap(a,c);
}
if(a*a-b*b-c*c == 0){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
}
int main(void){
int num,x,y,z;
cin >> num;
for(int i=0;i<num;i++){
cin >> x >> y >> z;
triangle(x,y,z);
}
}
|
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,-1,0,1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
rep(i,a.size()) cout << a[i] << " ";
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
const ll mod = 1e9 + 7;
vvl G(101010);
vl a(101010);
vl d(101010,0);
ll dfs(ll u, ll p){
if(d[u] == 1) return a[u];
ll sum = 0;
ll mx = 0;
for(auto v : G[u]){
if(v == p) continue;
ll df = dfs(v,u);
if(df == -1) return -1;
chmax(mx, df);
sum += df;
}
ll t;
if(sum - mx < mx) t = sum - mx;
else t = sum / 2;
ll rest = sum - t * 2;
if(a[u] > sum || a[u] < t + rest) return -1;
return a[u] - (sum - a[u]);
}
int main(){
ll n; cin >> n;
rep(i,n) cin >> a[i];
rep(i,n-1){
ll u,v; cin >> u >> v; u--; v--;
G[u].push_back(v);
G[v].push_back(u);
d[u]++; d[v]++;
}
if(n == 2){
if(a[0] == a[1]) puts("YES");
else puts("NO");
return 0;
}
ll s = 0;
rep(i,n) if(d[i] >= 2){
s = i;
break;
}
if(dfs(s,-1) == 0) puts("YES");
else puts("NO");
}
| 0
| 28,352,173
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin >> n;
bool exist=false;
ll groups = 0, crr = 0;
queue<ll> q, tpq;
if(n>2){
for(ll i=2;i<2*n;i++){
if((2*n)%i!=0) continue;
else{
if(abs((2*n)/i - i) == 1) {
groups = i;
exist = true;
break;
}
}
}
}
if(exist){
cout << "Yes" << endl;
cout << 2*n/groups << endl;
for(ll i=0;i<2*n/groups;i++){
ll cnt = 0;
cout << groups << " ";
if(i == 0){
for(crr=1;crr<=groups;crr++){
cout << crr << " ";
}
cout << endl;
q.push(1);
continue;
}
while(!q.empty()){
cnt += 1;
cout << q.front() << " ";
tpq.push(q.front() + 1);
q.pop();
}
ll tar = crr + groups - cnt;
tpq.push(crr);
for(;crr < tar; crr++){
cout << crr << " ";
}
cout << endl;
q = tpq;
while(!tpq.empty()){
tpq.pop();
}
}
}else{
if(n == 1){
cout << "Yes" << endl;
cout << 2 << endl;
cout << 1 << " " << 1 << endl;
cout << 1 << " " << 1 << endl;
}else{
cout << "No" << endl;
}
}
}
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int m;
cin >> m;
vector<int> D(m);
vector<long long> C(m);
for (int i = 0; i < m; ++i) {
cin >> D[i] >> C[i];
}
long long res = 0;
long long sum = 0;
for (auto x : C) {
res += x;
}
--res;
for (int i = 0; i < m; ++i) {
sum += D[i] * C[i];
}
res += (sum - 9 + 8) / 9;
cout << res << '\n';
return 0;
}
| 0
| 7,197,226
|
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
typedef long long ll;
void solve() {
int N,K;
cin >> N >> K;
vector<ll> vmx(N+2,0);
vector<ll> vmn(N+2,0);
REP(i,N+1) {
vmx[i+1] = (N-i) + vmx[i];
vmn[i+1] = i + vmn[i];
}
ll sm = 0;
FOR(i,K,N+2) sm+= (vmx[i]-vmn[i]+1);
cout << (sm%ll(1e9+7)) << endl;
}
int main() {
solve();
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
char next_anima(char who, char ans, char form){
bool res = ((form == 'S')? true : false);
if(who == 'S'){
if(ans == 'x')res = !res;
}else{
if(ans == 'o')res = !res;
}
return ((res)? 'S' : 'W');
}
int main(){
int N;
string s;
cin >> N >> s;
rep(i,2){
rep(j,2){
vector<char> ans(N);
if(i == 0)ans[0] = 'S';
else ans[0] = 'W';
if(j == 0)ans[1] = 'S';
else ans[1] = 'W';
for(int k = 1; k < N-1; ++k){
ans[k+1] = next_anima(ans[k], s[k], ans[k-1]);
}
if(ans[0] == next_anima(ans[N-1], s[N-1], ans[N-2]) && ans[1] == next_anima(ans[0], s[0], ans[N-1])){
for(auto x:ans)cout << x;
cout << endl;
return 0;
}
}
}
cout << -1 << endl;
return 0;
}
| 0
| 35,598,241
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
ll cnt[200010];
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
int A[200010];
rep(i, N) cin >> A[i];
rep(i, N) {
cnt[A[i]]++;
}
ll sum = 0;
rep(i, N + 1) sum += cnt[i] * (cnt[i] - 1) / 2;
rep(i, N) {
cout << sum - (cnt[A[i]] - 1) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll mypow(ll a, ll b) {
ll ret = 1;
while (b--) {
ret *= a;
}
return ret;
}
ll keta(ll a) {
ll ret = 0;
while (a) {
ret++;
a /= 10;
}
return ret;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b > c + d) {
cout << "Left\n";
} else if (a + b == c + d) {
cout << "Balanced\n";
} else {
cout << "Right\n";
}
return 0;
}
| 0
| 30,179,321
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
const ll MOD = 1000000007;
ll a[N];
int bts[66];
int stb[66];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
ll ans = 0;
for(int i=n;i>0;i--){
for(int j=0;j<61;j++){
ll t = (1ll<<j);
t %= MOD;
if((a[i])&(1ll<<j)){
ll b = stb[j];
bts[j]++;
ans += t*b;
ans %= MOD;
}else{
ll b = bts[j];
stb[j]++;
ans += t*b;
ans %= MOD;
}
}
}
cout<<ans;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi=acos(-1.0);
const ll mod=pow(10,9)+7;
const ll INF=pow(2,31)-1;
typedef pair<int,int> P;
typedef vector<int> vi;
ll gcd(ll a,ll b){
ll v0=a,v1=b,v2=a%b;
while(v2!=0){
v0=v1;
v1=v2;
v2=v0%v1;
}
return v1;
}
ll lcm(ll a,ll b){
return (a*b/gcd(a,b));
}
int main(){
ios::sync_with_stdio(false);
int n,record,ans=0,sum=0; cin>>n;
string s[n],x;
int t[n];
rep(i,n) cin >>s[i]>>t[i];
cin >>x;
rep(i,n) sum+=t[i];
rep(i,n){
if(s[i]==x){
record=i;
break;
}
}
for(int i=0;i<=record;i++){
sum-=t[i];
}
cout << sum <<endl;
return 0;
}
| 0
| 81,919,661
|
#include <bits/stdc++.h>
#include <queue>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define repr1(i, n) for (int i = n; i > 0; i--)
#define FOR(i, j, n) for (int i = j; i < n; i++)
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 10000000000;
int main(void){
int n;
cin >> n;
string s;
cin >> s;
ll r=0,g=0,b=0;
rep(i,n){
if(s[i] == 'R') r++;
if(s[i] == 'G') g++;
if(s[i] == 'B') b++;
}
ll cnt = 0;
for(int i = 0; i < n; i++){
for(int j = i+1; j < n; j++){
if(2*j-i >= n) continue;
if(s[i] != s[j] && s[j] != s[2*j-i] && s[2*j-i] != s[i]) cnt++;
}
}
cout << r*g*b - cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
double x1,y1,x2,y2,x3,y3;
double xp,yp;
double xv1,yv1,xv2,yv2,xvp,yvp;
double t,u;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
xv1 = x2 - x1;
yv1 = y2 - y1;
xv2 = x3 - x1;
yv2 = y3 - y1;
xvp = xp - x1;
yvp = yp - y1;
t = (xvp*yv2-yvp*xv2)/(xv1*yv2-xv2*yv1);
u = (yvp*xv1-xvp*yv1)/(xv1*yv2-xv2*yv1);
if(0.0 < t && 0.0 < u && 0.0 < t+u && t+u < 1.0){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
return 0;
}
| 0
| 32,008,772
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
bool x = true;
rep(i, n) {
cin >> a[i];
if(a[i] >= n) x = false;
}
if(x) {
cout << 0 << endl;
return 0;
}
vi r(n);
rep(i, n) {
r[i] = a[i]%(n+1);
}
ll ans = INT64_MAX;
rep(i, n+1) {
ll cnt = 0;
rep(j, n) {
int now = r[j]+i;
now %= n+1;
if(now == n) {
cnt = -1;
break;
}
cnt += a[j]-now;
}
if(cnt >= 0) {
ans = min(ans, cnt);
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n, p;
string s;
cin >> n >> p >> s;
ll ans = 0;
if (p == 2 || p == 5) {
for (int i = 0; i < n; i++) {
if ((s[i] - '0')%p == 0) ans += i + 1;
}
}
else {
map<ll,ll> cnt;
cnt[0]++;
ll num = 0, ten = 1;
for (int i = n - 1; i >= 0; i--) {
num = num + (s[i] - '0') * ten;
ten *= 10;
ten %= p;
num %= p;
cnt[num]++;
}
for (auto x:cnt) {
ans += x.second * (x.second - 1) / 2;
}
}
cout << ans << "\n";
}
| 0
| 15,220,650
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int d;
cin >> d;
if(d == 22)
cout << "Christmas Eve Eve Eve";
else if(d == 23)
cout << "Christmas Eve Eve";
else if(d == 24)
cout << "Christmas Eve";
else
cout << "Christmas";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main(){
int N;
string s;
cin >> N >> s;
string check = string();
for(int i = 0 ; i < N; i++) check += '0';
int i = 0;
for(int k = 0; k < N; k++){
if(check[i] == '1') {
i++;
continue;
}
if(s[i] == '('){
bool flag = true;
for(int j = i+1; j < s.length(); j++){
if(s[j] == ')' && check[j] == '0'){
check[j] = '1';
check[i] = '1';
flag = false;
break;
}
}
if(flag){
check[i] = '1';
check += '1';
s += ')';
}
}
else if(s[i] == ')'){
bool flag = true;
for(int j = i-1; j >= 0; j--){
if(s[j] == '(' && check[j] == '0'){
check[j] = '1';
check[i] = '1';
flag = false;
break;
}
}
if(flag){
check[i] = '1';
check = '1' + check;
s = '(' + s;
i++;
}
}
i++;
}
cout << s << endl;
return 0;
}
| 0
| 100,765,676
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#define Nil -1
#define Lens 1000000
using namespace std;
struct Node
{
int p, l, r;
};
int N;
Node Tr[Lens];
int D[Lens];
int v, d;
void maketree()
{
int tmp;
for (int i = 0; i < N; i++)
{
cin >> v >> d;
int tmpv = v;
int next;
for (int i = 0; i < d; i++)
{
cin >> tmp;
if (i == 0)
{
Tr[v].l = tmp;
Tr[tmp].p = v;
next = tmp;
}
else
{
Tr[next].r = tmp;
Tr[tmp].p = tmpv;
next = tmp;
}
}
}
}
void dns(int i, int p)
{
D[i] = p;
if (Tr[i].r != Nil) dns(Tr[i].r, p);
if (Tr[i].l != Nil) dns(Tr[i].l, p + 1);
}
void printtree()
{
int tmp = -1;
int r;
for (int i = 0; i < N; i++)
{
if (Tr[i].p == Nil)
r = i;
}
dns(r, 0);
for (int i = 0; i < N; i++)
{
cout << "node " << i << ": parent = " << Tr[i].p << ", " << "depth = " << D[i] << ", ";
if (Tr[i].p == Nil)
{
cout << "root, [";
if (Tr[i].l != Nil)
{
int next = Tr[i].l;
cout << Tr[i].l;
while (Tr[next].r != Nil)
{
cout << ", " << Tr[next].r;
next = Tr[next].r;
}
}
cout << "]";
}
else if (Tr[i].p != Nil&&Tr[i].l != Nil)
{
cout << "internal node, [";
cout << Tr[i].l;
int next = Tr[i].l;
while (Tr[next].r != Nil)
{
cout << ", " << Tr[next].r;
next = Tr[next].r;
}
cout << "]";
}
else
{
cout << "leaf, []";
}
cout << endl;
}
}
int main()
{
cin >> N;
for (int i = 0; i < N; i++)
{
Tr[i].l = Tr[i].r = Tr[i].p = Nil;
}
maketree();
printtree();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
string s, t; cin >> s >> t;
int ans = 99999;
for (int i = 0; i + t.size() <= s.size(); i++) {
int tr = 0;
for (int j = 0; j < t.size(); j++) {
if (s[i+j] != t[j]) tr++;
}
ans = min(ans,tr);
}
cout << ans << '\n';
}
| 0
| 14,427,669
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,s,n) for(int i = s; i < n; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main(){
ll n;
cin >> n;
ll ans = 0;
REP(i,1,n + 1){
ans += (n - 1) / i;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
int n, m; cin>>n>>m;
ll a[n+1], b[n+1], c[m+1], d[m+1];
for (int i=1; i<=n; i++) cin>>a[i]>>b[i];
for (int i=1; i<=m; i++) cin>>c[i]>>d[i];
for (int i=1; i<=n; i++){
ll min = LONG_MAX, res;
for (int j=1; j<=m; j++){
ll x = abs(a[i]-c[j]) + abs(b[i]-d[j]);
if(x<min){ min = x; res = j;}
}
cout<<res<<endl;
}
}
int main(){
solve();
Bye;
}
| 0
| 70,698,099
|
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
constexpr int MOD = 1e9 + 7;
constexpr ll inf = 1LL << 60;
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
ll modpow(ll a, ll n, ll p) {
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modpow(a, n - 1, p)) % p;
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
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;
}
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll com(ll n,ll m){
if(n<m || n<=0 ||m<0){
return 0;
}
if( m==0 || n==m){
return 1;
}
ll k=1;
for(ll i=1;i<=m;i++){
k*=(n-i+1);
k%=MOD;
k*=modinv(i,MOD);
k%=MOD;
}
return k;
}
ll rad(ll u, ll p){
ll cnt=0;
while(u%p==0){
u/=p;
cnt++;
}
return cnt;
}
int main() {
ll n;
cin>>n;
ll a[n+1];
ll b[n];
rep(i, n){
cin>>a[i];
b[i-1]=a[i];
}
ll cnt=0;
sort(b,b+n);
rep(i, n){
ll k=-1;
ll l=0;
ll r=n-1;
for(int w=1;w<=40;w++){
ll mid=(l+r)/2;
if(b[mid]==a[i]) {k=mid+1;
break;}
if(b[mid]>a[i]) r=mid;
if(b[mid]<a[i]) l=mid;
}
if(k==-1) k=n;
if((i-k+MOD+1)%2==1){
cnt++;
}
}
cout<<cnt/2<<endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6;
int n,L,T;
int pos[N];
int f[N][35];
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*f;
}
int main()
{
n=read();
for(int i=1;i<=n;i++) pos[i]=read();
L=read(),T=read();
for(int i=1;i<=n;i++)
f[i][0]=upper_bound(pos+1,pos+n+1,pos[i]+L)-pos-1;
for(int j=1;j<=30;j++)
for(int i=1;i<=n;i++) f[i][j]=f[f[i][j-1]][j-1];
while(T--)
{
int st=read(),en=read();
if(st>en) swap(st,en);
int ans=0;
for(int i=30;i>=0;i--)
{
if(f[st][i]<en)
{
ans+=1<<i;
st=f[st][i];
}
}
printf("%d\n",ans+1);
}
return 0;
}
| 0
| 18,244,980
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<pair<int, int>> red(N);
vector<pair<int, int>> blue(N);
for (int i = 0; i < N; i++) cin >> red[i].second >> red[i].first;
sort(red.begin(), red.end());
reverse(red.begin(), red.end());
for (int i = 0; i < N; i++) {
int a = red[i].first;
red[i].first = red[i].second;
red[i].second = a;
}
for (int i = 0; i < N; i++) cin >> blue[i].first >> blue[i].second;
sort(blue.begin(), blue.end());
vector<bool> seen(N, false);
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (red[j].first < blue[i].first && red[j].second < blue[i].second && !seen[j]) {
seen[j] = true;
ans++;
break;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N; cin >> N;
vector<int> D(N);
rep(i, N) cin >> D[i];
if(D[0] != 0) {
cout << 0 << endl;
return 0;
}
sort(all(D));
int ans = 1;
vector<int> num(N, 0);
num[D[0]]++;
rep(i, N) {
if(i == 0) continue;
if(D[i] == 0 || num[D[i]-1] == 0) {
cout << 0 << endl;
return 0;
}
num[D[i]]++;
ans *= num[D[i]-1];
ans %= 998244353;
}
cout << ans << endl;
}
| 0
| 34,322,278
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define All(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
bool isPrime(int n){
if(n < 2) return false;
else if(n == 2) return true;
else if(n%2==0) return false;
for(int i=3;i<=sqrt(n);i++){
if(n%i==0) return false;
}
return true;
}
int main(){
string s;
int k;
cin >> s >> k;
int cnt = 0;
for(int i=0;i<s.size();i++){
if(s[i]=='1') cnt++;
else break;
}
if(cnt >= k) cout<< 1 <<endl;
else cout<< s[cnt] <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
int main(){
ll n;
cin >> n;
ll x[n] = {};
rep(i,0,n) cin >> x[i];
ll ans = LINF;
rep(i,1,101){
ll temp = 0;
rep(j,0,n){
temp += pow(x[j]-i,2);
}
ans = min(ans,temp);
}
cout << ans << endl;
return 0;
}
| 0
| 10,017,150
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
string s; cin>>s;
int n=sz(s),ans=0;
for (int i=0;i<(n/2);i++){
string l,r;
l=s.substr(0,i+1);
r=s.substr(i+1,i+1);
if (l==r){
int len=sz(l)+sz(r);
if (len==n) break;
ans = len;
}
}
cout << ans << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
using ll = int; using vll = vector<ll>;
static const long long INF = 1e9;
ll d[200010], e[1ll<<26], a[200010];
int main(void) {
string s; cin >> s;
ll n = s.length();
vll cand; cand.push_back(0); rep(i, 26) cand.push_back(1ll<<i);
rep(i, n) a[i+1] = a[i] ^ (1ll << (s[i] - 'a'));
repi(i, 1, 200010) d[i] = INF;
repi(x, 1, 1ll<<26) e[x] = INF;
repi(i, 1, n+1) {
for (auto x : cand) chmin(d[i], e[a[i]^x] + 1);
chmin(e[a[i]], d[i]);
}
cout << d[n] << endl;
return 0;
}
| 0
| 47,161,425
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main(){
int h, w;
cin >> h >> w;
string s;
rep(i,h){
rep(k,w){
cin >> s;
if(s=="snuke"){
cout << (char)('A'+k) << i+1 << endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
int main() {
int n, c, k; cin >> n >> c >> k;
vint a(n);
rep(i,n) cin >> a[i];
sort(all(a));
int now = 0;
int ans = 0;
while (now < n) {
int id = upper_bound(all(a),a[now]+k)-a.begin();
int next = min(id-now,c)+now;
ans++;
swap(next,now);
}
cout << ans << endl;
}
| 0
| 10,141,808
|
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
string ans="No";
int H,N;
cin >> H >> N;
vector<int> A(N);
rep(i,N) {
cin >> A[i];
H=H-A[i];
if(H<=0) ans="Yes";
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define MOD 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define loop(I,N) for(int i=I;i<N;i++)
#define sortvec(V) sort(V.begin(),V.end())
#define vec vector<int>
#define endl "\n"
using namespace std;
#define PI 3.14159265359
int fast_power(int base, int power) {
int result = 1;
while (power > 0) {
if (power & 1) {
result = (result * base) % MOD;
}
base = (base * base) % MOD;
power = power >> 1;
}
return result % MOD;
}
bool isPrime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
if (x == 1)
return false;
return true;
}
int binsearch(int a[], int f, int r, int x) {
while (f <= r) {
int mid = (f + r) / 2;
if (a[mid] == x)
return mid;
else if (a[mid] > x) {
r = mid - 1;
}
else {
f = mid + 1;
}
}
return -1;
}
void sieve(int a[], int n) {
a[0] = 0;
a[1] = 0;
for (int i = 2; i <= n; i++) {
if (a[i] == 1) {
for (int j = i + i; j <= n; j += i) {
a[j] = 0;
}
}
}
}
int maxlim = 1e18;
int32_t main() {
int t = 1;
while (t--) {
string s;
cin >> s;
if (s[2] == s[3] && s[4] == s[5]) {
cout << "Yes\n";
exit(0);
}
cout << "No\n";
}
return 0;
}
| 0
| 66,985,216
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n;
cin>>n;
vector<int> p(n);
vector<int> q(n);
int cp=0;
int cq=0;
rep(i,n)cin>>p[i];
rep(i,n)cin>>q[i];
while(prev_permutation(p.begin(),p.end())){
cp++;
}
while(prev_permutation(q.begin(),q.end())){
cq++;
}
cout<<abs(cp-cq)<<endl;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
typedef long long lint;
int pow10[]={(int)1e0,(int)1e1,(int)1e2,(int)1e3,(int)1e4,
(int)1e5,(int)1e6,(int)1e7,(int)1e8,(int)1e9};
inline char getres(lint x){
printf("? %lld\n",x);
fflush(stdout);
char c;
while((c=getchar())!='Y'&&c!='N');
return c;
}
int main(){
if(getres(1e10)=='Y'){
int l=0,r=9,mid;
while(l!=r){
mid=(l+r)>>1;
if(getres(2*pow10[mid])=='Y') r=mid;
else l=mid+1;
}
printf("! ");
putchar('1');
while(l--) putchar('0');
puts("");
fflush(stdout);
}
else{
int len;
{
int l=0,r=9,mid;
while(l!=r){
mid=(l+r+1)>>1;
if(getres(pow10[mid])=='N') r=mid-1;
else l=mid;
}
len=l;
}
if(len==9){
printf("! %d\n",(int)1e9);
fflush(stdout);
return 0;
}
int l=pow10[len],r=pow10[len+1]-1,mid;
while(l!=r){
mid=(l+r)>>1;
if(getres(mid*10ll)=='Y') r=mid;
else l=mid+1;
}
printf("! %d\n",l);
fflush(stdout);
}
return 0;
}
| 0
| 21,087,686
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
using Int = long long;
const Int mod = 1000000007;
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
vector<vector<Int>> dp(n + 1, vector<Int>(m + 1));
for (int i = 0; i <= n; i++) {
dp[i][0] = 1;
}
for (int i = 0; i <= m; i++) {
dp[0][i] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
(dp[i][j] += dp[i][j - 1]) %= mod;
(dp[i][j] += dp[i - 1][j]) %= mod;
if (s[i - 1] != t[j - 1]) {
(dp[i][j] += mod - dp[i-1][j-1]) %= mod;
}
}
}
cout << dp[n][m] << endl;
}
|
#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;
cin >> N;
int ct = 0, cx = 0, cy = 0;
rep(i, N)
{
int t, x, y;
cin >> t >> x >> y;
int d = abs(x + y - (cx + cy));
int dt = t - ct;
cx = x;
cy = y;
ct = t;
if (!(dt >= d && (dt % 2 == d % 2)))
{
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 15,767,673
|
#include<iostream>
#include<algorithm>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int sum = 0;
int m = 1001;
int M = -1;
for (int i = 0; i < N; ++i) {
cin >> S;
sum += S;
m = min(m, S);
M = max(M, S);
}
sum = sum - m - M;
int ans = sum / (N-2);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
int N,M,X;
cin >> N >> M >> X;
vector<int>C(N);
vector<vector<int>> data(N, vector<int>(M));
vector<int>skills(M,0);
for (int i = 0; i < N; i++) {
cin >> C.at(i);
for (int j = 0; j < M; j++) {
cin >> data.at(i).at(j);
skills.at(j) += data.at(i).at(j);
}
}
for (int i = 0; i < M; i++) {
if (skills.at(i) < X){
cout << -1 << endl;
return 0;
}
}
int Min = 10000000;
for (int tmp = 0; tmp < (1 << 12); tmp++) {
bitset<12> s(tmp);
if (N < 12 && s.test(N)) {
break;
}
int price = 0;
vector<int>skill(M,0);
for (int i = 0; i < N; i++) {
if (s.test(i)) {
for (int j = 0; j < M; j++) {
skill.at(j) += data.at(i).at(j);
}
price += C.at(i);
}
}
for (int i = 0; i < M; i++) {
if (skill.at(i) < X){
break;
}
else if (i == M-1){
if (price < Min){
Min = price;
}
}
}
}
cout << Min << endl;
}
| 0
| 15,307,320
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<(int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
char b, ans;
cin >> b;
if(b=='A')ans='T';
else if(b=='T')ans='A';
else if(b=='C')ans='G';
else ans='C';
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef long double ld;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
int main() {
ll i, j, k;
ll N, M, K;
cin >> N >> M >> K;
for(i = 0; i < N + 1; i++) {
for(j = 0; j < M + 1; j++) {
ll b = i * M;
ll d = N - i - i;
b += j * d;
if(b == K) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
| 0
| 80,261,038
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000;
double PI = 3.1415926535;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
ll GCD(ll a,ll b){
if(a < b)return GCD(b,a);
ll r = INF;
while(r){
r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
int N,K = 0,A;
cin >> N;
map<int,int> mp;
for(int i = 0;i < N;i++){
cin >> A;
if(mp[A] == 0){
K++;
}
mp[A]++;
}
if(K % 2 == 1){
cout << K << endl;
}else{
cout << K - 1 << endl;
}
}
|
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sqrt(n);i++)
{
if(n%i==0)
ans = i;
}
return ans;
}
ll power(ll a,ll b,ll m)
{
if(b==0)
return 1;
if(b==1)
return a%m;
ll temp=power(a,b/2,m);
if(b%2==0)
return ((temp%m)*(temp%m))%m;
else
return ((((temp%m)*(temp%m))%m)*a%m)%m;
}
ll c(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1]%MOD +
C[i - 1][j])%MOD;
}
}
return C[n][k]%MOD;
}
ll modInverse(ll a, ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll func(ll n)
{
ll ans=0;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
if(i/10==0)
ans+=1+func(i)*func(n/i);
else
ans+=func(i)*func(n/i);
}
}
return ans;
}
ll dp[2001][2001];
ll check(vector<pair<ll,ll> >v,ll l,ll r,ll i)
{
if(l>r)
return 0;
if(dp[l][r]!=-1)
return dp[l][r];
ll ans=0;
ll p1=v[i].first;
ll p2=v[i].second;
ans=max(p1*(p2-l)+check(v,l+1,r,i+1),p1*(r-p2)+check(v,l,r-1,i+1));
return dp[l][r]=ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
t=1;
while(t--)
{
ll k,n;
cin>>k>>n;
ll a[n];
for(ll i=0;i<n;i++)
cin>>a[i];
ll ans=a[n-1]-a[0];
for(ll i=1;i<n;i++)
{
ll tmp=0;
tmp+=k-a[i];
tmp+=a[i-1];
ans=min(ans,tmp);
}
cout<<ans;
}
}
| 0
| 23,542,451
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
const ll inf=(1e14);
ll solve(){
int h,w,k,ans=0;
cin>>h>>w>>k;
string s[h];
for(string &i:s) cin>>i;
int tot=0;
for(string &i:s) for(char c:i) if(c == '#') tot++;
const int R=(1<<h),C=(1<<w);
for(int i=0;i<R;i++){
for(int j=0;j<C;j++){
int rm=0;
for(int r=0;r<h;r++) if((1<<r) & i) for(int c=0;c<w;c++) rm+=(s[r][c] == '#');
for(int c=0;c<w;c++) if((1<<c) & j) for(int r=0;r<h;r++) rm+=(s[r][c] == '#' && !((1<<r) & i));
ans+=(tot-rm == k);
}
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
while(t--) cout<<solve()<<'\n';
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n;
int score, sum_score;
int max_score, min_score;
int i;
cin >> n;
while (n) {
sum_score = 0;
max_score = 0;
min_score = 1000;
for (i=0; i<n; i++) {
cin >> score;
sum_score += score;
if (score < min_score) {
min_score = score;
}
if (score > max_score) {
max_score = score;
}
}
sum_score -= min_score + max_score;
cout << sum_score / (n-2) << endl;
cin >> n;
}
return 0;
}
| 0
| 41,130,454
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll n; cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
ll ans = 1000;
ll kabu = 0;
for (ll i = 0; i < n - 1; ++i) {
if (a[i] < a[i + 1] && kabu == 0) {
kabu = ans / a[i];
ans -= ans / a[i] * a[i];
continue;
}
if (a[i] > a[i + 1] && kabu > 0) {
ans += kabu * a[i];
kabu = 0;
continue;
}
}
if (kabu > 0) {
ans += kabu * a[n - 1];
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int b[n][20]={};
for(int i=0;i<n;i++){
cin>>a[i];
for(int j=0;j<20;j++){
if(a[i]%2)b[i][j]++;
a[i]/=2;
}
}
int x[20]={};
int r=-1;
long long ans=0;
bool over;
for(int l=0;l<n;l++){
over=0;
for(int i=0;i<20;i++)if(x[i]>1)over=1;
while(r<n && over==0){
r++;
for(int i=0;i<20;i++)x[i]+=b[r][i];
for(int i=0;i<20;i++)if(x[i]>1)over=1;
}
ans+=r-l;
for(int i=0;i<20;i++)x[i]-=b[l][i];
}
cout<<ans<<endl;
return 0;
}
| 0
| 53,314,844
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y;
cin >> x >> y ;
if ( (x*y)%2 == 0 ) {
cout << "Even" << endl;
}
else if ( (x*y)%2 == 1 ) {
cout << "Odd" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
int h, w;
cin >> h >> w;
char paint[h][w];
rep(i, h){
rep(j, w){
cin >> paint[i][j];
}
}
int x[4] = {0, 0, -1, 1};
int y[4] = {-1, 1, 0, 0};
int check;
int f = 0;
rep(i, h){
rep(j, w){
check = 0;
if (paint[i][j] == '#'){
rep(k, 4){
int nx = i + x[k], ny = j + y[k];
if(nx >= 0 && ny >= 0 && nx <= h && ny <= w && paint[nx][ny] == '#'){
check ++;
}
}
if (check == 0) f = 1;
}
}
}
if (f == 0) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 15,319,644
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
vector<ll> cnt(3);
ll n,a,b;cin>>n>>a>>b;
for(ll i=0;i<n;i++){
ll p;cin>>p;
if(p<=a)cnt[0]++;
else if(p<=b)cnt[1]++;
else cnt[2]++;
}
cout<<(*min_element(cnt.begin(),cnt.end()));
}
|
#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> ;
const int INF = 1e9;
const int MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i,n) cin >> s[i];
int A = 0,B = 0;
int AB = 0;
bool ok = false;
rep(i,n){
rep(j,s[i].size()-1){
if(s[i][j] == 'A' && s[i][j+1] == 'B'){
++AB;
}
}
if(s[i][0] == 'B' && s[i].back() == 'A'){
++A;++B;
}else if(s[i][0] == 'B'){
++B;ok = true;
}else if(s[i].back() == 'A'){
++A;ok = true;
}
}
if(ok) cout << AB + min(A,B) << endl;
else cout << AB + (min(A,B)==0 ? 0 : min(A,B)-1) << endl;
return 0;
}
| 0
| 83,457,148
|
#include <iostream>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
typedef long long ll;
#define fin(ans) cout << (ans) << '\n'
int main()
{
int r, D, x2000;
cin >> r >> D >> x2000;
int ans = x2000;
REP(i,10){
ans = r* ans -D;
fin(ans);
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX 11
#define INF (1<<23)
int G[MAX][MAX];
int main() {
int n, x, y, c;
int V;
while(cin >> n, n) {
fill(G[0], G[MAX], INF);
for(int i=0; i<MAX; i++) {
G[i][i] = 0;
}
V = 0;
for(int i=0; i<n; i++) {
cin >> x >> y >> c;
V = max(V, max(x, y));
G[x][y] = G[y][x] = c;
}
V++;
for(int k=0; k<V; k++) {
for(int i=0; i<V; i++) {
for(int j=0; j<V; j++) {
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
}
}
}
int sum, ans = INF, id;
for(int i=0; i<V; i++) {
sum = 0;
for(int j=0; j<V; j++) {
sum += G[i][j];
}
if(ans > sum) {
ans = sum;
id = i;
}
}
cout << id << " " << ans << endl;
}
return 0;
}
| 0
| 4,926,458
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll d[100009];
int main()
{
ll n;
cin>>n;
ll a[n+1];
for(int i=1;i<=n;i++)cin>>a[i];
ll c=1,an=0;
while(1)
{
if(c==2)break;
an++;
if(d[c]){an=-1;break;}
d[c]=1;
c=a[c];
}
cout<<an<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,ans,maxx;
int a[100005],shu[100005];
int main(){
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i];
shu[a[i]]++;
if(a[i] > maxx) maxx = a[i];
}
for(int i = 1;i <= maxx;i++)
if(shu[i] > 1)
ans += shu[i] - 1;
if(ans % 2 == 1) ans++;
cout << n - ans << endl;
return 0;
}
| 0
| 91,923,324
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll arr[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
ll k;
cin>>k;
cout<<arr[k-1];
}
|
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <tuple>
#include <numeric>
#include <assert.h>
#include <functional>
#include <unordered_map>
using namespace std;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val,Bit) ((Val) |= (Bit))
#define BitTstV(Val,Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof( x ) / sizeof( x[ 0 ]))
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define M_PI 3.14159265358979323846
typedef long long ll;
typedef unsigned long long int QWORD;
typedef pair<ll, ll> P;
int main()
{
int A, B, C;
cin >> A >> B >> C;
if (A <= C && C <= B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 20,673,058
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
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 vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
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;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define int long long
#define float double
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define dipi2(x,y) int x,y; cin>>x>>y;
#define w(x) int x; cin>>x; while(x--)
#define mka(type,arr,n) type *arr=new type[n];
#define fo(i,n) for(int i=0;i<n;i++)
#define mod pow(10,9)+7
#define inf 1e18
#define pi 3.141592653589793238
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
void c_p_c()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
c_p_c();
dipi(n);
dipi(a);
dipi(b);
int div = n / (a + b);
int rem = n % (a + b);
int blue = min(a, rem);
cout << (div * a) + blue;
return 0;
}
| 0
| 84,378,861
|
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int n,left=0,right=0,l=0,r=0;
string s;
cin>>n>>s;
char c=s[0];
rep(i,n){
if(c!=s[i]){
if(s[i]=='('){
left+=max(0,l-r);
r=max(0,r-l);
l=0;
}
c=s[i];
}
c==')'?l++:r++;
}
left+=max(0,l-r);
right=max(0,r-l);
rep(i,left) cout<<"(";
cout<<s;
rep(i,right) cout<<")";
return 0;
}
|
#include<iostream>
using namespace std;
void Solution()
{
int a, b, c;
while(cin>>a>>b>>c)
{
if(a < b && b < c)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
}
int main()
{
Solution();
}
| 0
| 77,936,512
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, k;
cin >> n >> k;
long long cnt = n / k;
long long cnts = (n + k / 2) / k;
long long ans = pow(cnt, 3);
if(k%2 == 0) ans += pow(cnts, 3);
cout << ans << endl;
}
|
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
void bfs(int v, vi &dist, vector<vi> &graph)
{
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++)
{
for (auto u : graph[q[i]])
{
if (dist[u] == -1)
{
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
if (s == "zyxwvutsrqponmlkjihgfedcba")
{
cout << "-1";
return 0;
}
vector<int> la(26);
forn(i, s.size()) la[s[i] - 'a']++;
for (int i = 0; i < 26; i++) if (la[i] == 0)
{
cout << s;
cout << (char)(i + 'a');
return 0;
}
string t = s;
next_permutation(all(t));
for (int i = 0; i < t.size(); i++)
{
if (s[i] == t[i]) cout << s[i];
else
{
cout << t[i];
return 0;
}
}
}
| 0
| 8,084,766
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define sc(n) scanf("%d", &n)
#define sca(a, n) fo(i, n) sc(a[i])
#define pd(a) printf("%d ", a)
#define pld(a) printf("%d\n", a)
#define pda(a, n) fo(i, n) pd(a[i])
#define pl printf("\n")
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
const ll mod = 1e9+7;
template<typename T> T gcf(T a, T b) {return (b == 0) ? a : gcf(b, a%b);}
template<typename T> T lcm(T a, T b) {return (a*b)/gcf(a, b);}
template<typename T> T sumTo(T x) {return x * (x+1) / 2;}
template<typename T> T sumSquaresTo(T x) {return x * (x+1) * (2*x+1) / 6;}
template<typename T> T ceilDiv(T n, T d) {return (n+d-1)/d;}
void solve() {
string s, t; cin >> s >> t;
int ans = 0; fo(i , s.size()) if (s[i] == t[i]) ans++;
pd(ans);
}
int main() {
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for(ll i = 2; i * i <= n; i++) {
if(n % i)
continue;
res.emplace_back(i, 0);
while(n % i == 0) {
n /= i;
res.back().second++;
}
}
if(n != 1)
res.emplace_back(n, 1);
return res;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
const ll INF = LONG_MAX;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
int main() {
#ifdef LOCAL
std::ifstream in("code.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int N = 100000;
int n;
cin >> n;
vector<int> option;
option.push_back(1);
for(int i = 6; i <= N; i *= 6) {
option.push_back(i);
}
for(int i = 9; i <= N; i *= 9) {
option.push_back(i);
}
sort(option.begin(), option.end(), greater<int>());
vector<int> dp(n + 1, N + 1);
dp[0] = 0;
for(int i = 1; i <= n; i++) {
for(auto e : option) {
if(i - e >= 0) {
dp[i] = min(dp[i], dp[i - e] + 1);
}
}
}
cout << dp[n];
return 0;
}
#if 0
struct node {
int to, weight;
};
using Edge = vector<node>;
void addEdge(bool directed, Edge *edges, int u, int v, int wt) {
edges[u].push_back({v, wt});
if(!directed) {
edges[v].push_back({u, wt});
}
}
int pre_node[100000];
void zeroOneBFS(Edge *edges, vector<int> &dist, int src) {
for(int i = 0; i < dist.size(); i++)
dist[i] = INT_MAX;
deque<int> Q;
dist[src] = 0;
Q.push_back(src);
while(!Q.empty()) {
int v = Q.front();
Q.pop_front();
for(int i = 0; i < edges[v].size(); i++) {
if(dist[edges[v][i].to] > dist[v] + edges[v][i].weight) {
dist[edges[v][i].to] = dist[v] + edges[v][i].weight;
pre_node[edges[v][i].to] = v;
if(edges[v][i].weight == 0)
Q.push_front(edges[v][i].to);
else
Q.push_back(edges[v][i].to);
}
}
}
for(int i = 0; i < dist.size(); i++)
cout << dist[i] << " ";
}
#endif
| 0
| 2,219,383
|
#include <iostream>
using namespace std;
int main(){
int a, b, c, count = 0;
bool divi[10001] = { false };
cin >> a >> b >> c;
for(int i = 1; i <= c; i++){
if(c % i == 0){
divi[i] = true;
}
}
for(int i = a; i <= b; i++){
if(divi[i] == true){
count++;
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_r(v) (v).rbegin(), (v).rend()
const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(vector<T> v)
{
if (v.size() == 0)
return;
int n = v.size() - 1;
rep(i, n) cout << v[i] << wsp;
cout << v[n] << rt;
return;
}
template <typename T>
void show2dvec(vector<vector<T>> v)
{
int n = v.size();
rep(i, n) show1dvec(v[i]);
}
bool in_field(int h, int w, int y, int x)
{
return 0 <= y && y < h && 0 <= x && x < w;
}
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
double n, m, d, ans;
cin >> n >> m >> d;
if (d == 0) ans = 1 / n * (m - 1);
else
{
ans = 2 * (n - d) / (n * n) * (m - 1);
}
printf("%.10f\n" , ans);
return 0;
}
| 0
| 6,099,745
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repp(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back()
#define ALL(a) (a).begin(),(a).end()
using namespace std;
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;}
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
signed main(){
int n; cin >> n;
int a[n];
rep(i,n) cin >> a[i];
vector<int> ans;
for(int i=0;i<n;i++){
if((n-i-1)%2==1) ans.pb(a[n-1-i]);
}
for(int i=0;i<n;i+=2){
ans.pb(a[i]);
}
if(n%2==0){
rep(i,n) cout << ans[i] << " ";
}else{
rep(i,n) cout << ans[n-1-i] << " ";
}
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
int p(int A,int B){
if(!B)return 1;
if(B%2)return p(A,B-1)*A%mod;
int C=p(A,B/2);
return C*C%mod;
}
signed main(){
int N;
cin>>N;
vector<int> D(N);
vector<int> A(N);
for(int i=0;i<N;i++){
cin>>D[i];
if((i==0 && D[i]!=0) || (i!=0 && D[i]==0)){
puts("0");
return 0;
}
A[D[i]]++;
}
int n=-1;
for(int i=1;i<N;i++){
if(A[i]==0)n=i;
else if(n!=-1){
puts("0");
return 0;
}
}
int ans=1;
for(int i=1;i<n;i++)
ans=ans*p(A[i-1],A[i])%mod;
cout<<ans<<endl;
}
| 0
| 76,153,604
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dl double long
const int INF=0x3fffffff;
const ll MOD=1000000007;
const ll MODD=998244353;
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
ll gcd(ll a, ll b) { return (b > 0) ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return a*b/gcd(a, b); }
using ipair = pair<ll, ll>;
int main()
{
ll N, K;
vector<ipair> v;
cin >> N >> K;
if((N-1)*(N-2)/2 < K){
cout << "-1" << "\n";
}
else{
REP(i, 1, N) v.push_back({i, N});
ll max = (N-1)*(N-2)/2-K;
ll ci=1, cj=2;
rep(i, max){
v.push_back({ci, cj});
++cj;
if(cj == N){
++ci;
cj = ci + 1;
}
}
cout << v.size() << "\n";
for(auto a: v){
cout << a.first << " " << a.second << "\n";
}
}
}
|
#define FOR(i, min, max) for(int (i) = (min); (i) < (max); (i)++)
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define SWAP(a,b) { int r = a; a = b; b = r; }
#include <utility>
#include <vector>
#include <math.h>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
int stable(string c[], string z[], int n)
{
bool order = true;
FOR(i, 0, n - 1)
{
cout << c[i] << " ";
}
cout << c[n - 1] << endl;
FOR(i, 1, n)
{
if (c[i][1] == c[i - 1][1])
{
bool ch = false;
FOR(j, 0, n)
{
if (c[i] == z[j])
ch = true;
if (z[j] == c[i - 1])
{
if (ch)
order = false;
else
break;
}
}
if(!order)
break;
}
}
if (order)
cout << "Stable" << endl;
else
cout << "Not stable" << endl;
return 0;
}
int main()
{
int n;
string a[100], c[100], z[100];
cin >> n;
FOR(i, 0, n)
{
string s;
cin >> s;
a[i] = s;
c[i] = s;
z[i] = s;
}
FOR(i, 0, n)
{
for (int j = n - 1; j > i; j--)
{
if (a[j][1] < a[j - 1][1])
{
string str = a[j];
a[j] = a[j - 1];
a[j - 1] = str;
}
}
}
stable(a, z, n);
FOR(i, 0, n)
{
int minj = i;
FOR(j, i, n)
{
if (c[j][1] < c[minj][1])
minj = j;
}
if (c[i][1] != c[minj][1])
{
string str = c[i];
c[i] = c[minj];
c[minj] = str;
}
}
stable(c, z, n);
return 0;
}
| 0
| 21,430,689
|
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
const long long int Z = 1000000007;
const long long int INF = 1 << 30;
int flag = 0;
using ll = long long;
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;
}
int main() {
int n, a = 0, b = 0;
std::cin >> n;
for (int i = 0;i < n;i++) {
std::string s, t;
std::cin >> s >> t;
if (s > t) {
a += 3;
}
if (s < t) {
b += 3;
}
if (s == t) {
a++;
b++;
}
}
std::cout << a << ' ' << b << std::endl;
return 0;
}
|
#include <iostream>
#include <stack>
using namespace std;
bool issame(char a,char b){
if(a=='(')return b==')';
if(a=='[')return b==']';
}
int main(){
while(1){
char in;
in=cin.peek();
if(in=='.')return 0;
stack<char> sta;
bool iscorrect=true;
while(cin.get(in),in!='.'){
if(cin.eof())return 0;
if(in=='('||in=='['){
sta.push(in);
}else if(in==')'||in==']'){
if(sta.empty()||!issame(sta.top(),in)){
iscorrect=false;
break;
}
sta.pop();
}
}
cout<<((iscorrect&&sta.empty())? "yes":"no")<<endl;
cin.ignore(100,'\n');
}
}
| 0
| 34,159,120
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
string s; cin >> s;
for(int i = 0; i < s.size(); i++) {
if(s[i] == ',') s[i] = ' ';
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> dp(1000000,INF);
dp[0]=0;
for(int i=1; i<1000000; i++){
chmin(dp[i],dp[i-1]+1);
for(int j=6; j<=i; j*=6){
chmin(dp[i],dp[i-j]+1);
}
for(int j=9; j<=i; j*=9){
chmin(dp[i],dp[i-j]+1);
}
}
cout << dp[n] << endl;
}
| 0
| 61,535,754
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
int64_t INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t n;
cin >> n;
vi a(n);
rep(i,n) cin >> a.at(i);
int64_t res = 0;
rep(i,n){
if(a.at(a.at(i)-1)-1 == i){
res++;
}
}
cout << res/2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
int x, y;
long long ans, dp[4002][3] = {};
string s;
char cat[] = "RGB";
cin >> n >> s;
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < 3; j++ ) {
if ( cat[j] == s[i] ) {
dp[i+1][j]++;
}
dp[i+1][j] += dp[i][j];
}
}
ans = 0;
for ( int i = 0; i < n; i++ ) {
for (int j = 0; j < 3; j++ ) {
if ( cat[j] == s[i] ) {
ans += (dp[n][ (j+1)%3 ] - dp[i+1][ (j+1)%3 ]) * dp[i][ (j+2)%3 ];
ans += (dp[n][ (j+2)%3 ] - dp[i+1][ (j+2)%3 ]) * dp[i][ (j+1)%3 ];
}
}
x = y = i;
while ( x >= 0 && y <= n-1 ) {
if ( s[x] != s[y] && s[x] != s[i] && s[y] != s[i] ) {
ans -= 1;
}
x--;
y++;
}
}
cout << ans << endl;
return (0);
}
| 0
| 87,825,415
|
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> a(n),b(n);
ll s = 0;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
b[i] = a[i];
s += a[i];
}
sort(b.begin(),b.end());
vector<ll> sum(n+1,0);
for (int i = 0; i < n; i++) {
sum[i+1] = sum[i]+b[i];
}
ll rem = s;
ll now = 0;
for (int i = 0; i < n; i++) {
if(now>=a[i]){
std::cout << 0 << std::endl;
continue;
}
now = a[i];
auto idx = distance(b.begin(),upper_bound(b.begin(),b.end(),now));
std::cout << rem-(sum[n]-sum[idx]-now*(n-idx)) << std::endl;
rem -= rem-(sum[n]-sum[idx]-now*(n-idx));
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int m, n1, n2;
void solve() {
int p[202];
rep(i, m) cin >> p[i];
int ans = n1;
for (int i = n1; i <= n2; i++) {
if (p[i - 1] - p[i] >= p[ans - 1] - p[ans]) {
ans = i;
}
}
cout << ans << endl;
}
int main() {
while (cin >> m >> n1 >> n2) {
if (m == 0) break;
solve();
}
return 0;
}
| 0
| 94,816
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
map<int, int> cnt1, cnt2;
int N, a;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (i % 2) cnt1[a]++;
else cnt2[a]++;
}
vector<pii> v;
for (auto c : cnt1) v.push_back(pii(c.second, c.first));
for (auto c : cnt2) v.push_back(pii(c.second, c.first));
sort(v.begin(), v.end(), greater<pii>());
int ans = N;
int cnt = -1;
for (int i = 0; i < v.size(); i++) {
if (cnt == -1) {
ans -= v[i].first;
cnt = v[i].second;
}
else {
if (cnt == v[i].second) continue;
ans -= v[i].first;
break;
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,K;
cin >> N >> K;
if (K > (N - 1) * (N - 2) / 2) cout << -1 << endl;
else{
cout << (N - 1) + (N - 1) * (N - 2) / 2 - K << endl;
for (int i = 2; i <= N; i++){
cout << 1 << " " << i << endl;
}
int count = 0;
for (int i = 2; i <= N; i++){
for (int j = i + 1; j <= N; j++){
if (count < (N - 1) * (N - 2) / 2 - K){
cout << i << " " << j << endl;
count++;
}
}
}
}
}
| 0
| 65,071,463
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#define lpsbd(i, s, b, d) for(size_t i = (s); i < (b); i+=(d))
#define lpsb(i, s, b) for(size_t i = (s); i < (b); i++)
#define lpn(i, n) for(size_t i = 0; i < (n); i++)
#define fa(i, x) for(auto &i: x)
#define vcd(t, n, d) vector<t>(n, d)
#define vc(t, n) vector<t>(n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main(void)
{
int K;
cin >> K;
auto A = vc(int, K);
lpn(i, K) cin >> A[K - i - 1];
ll omx = 2, omn = 2;
ll mx, mn;
lpn(i, K)
{
mx = (omx) / A[i] * A[i] + A[i] - 1;
mn = (omn + A[i] - 1) / A[i] * A[i];
if (mn > mx)
{
cout << -1 << endl;
return 0;
}
omx = mx;
omn = mn;
}
cout << mn << " " << mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n), b(n+1, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
b[a[i]]++;
}
long long sum = 0;
for (int i = 0; i <= n; i++) {
sum += b[i]*(b[i]-1LL)/2LL;
}
for (int i = 0; i < n; i++) {
long long x = b[a[i]];
long long y = x - 1;
long long ans = sum - x*(x-1LL)/2LL + y*(y-1)/2LL;
cout << ans << endl;
}
}
| 0
| 44,291,702
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
ll N, M;
cin >> N >> M;
if ((N >= 2) && (M >= 2))
cout << (N - 2) * (M - 2) << endl;
else if (N * M > 1)
{
cout << N * M - 2 << endl;
}
else
{
cout << 1 << endl;
}
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
int mod(int A, int M) {return (A % M + M) % M;}
const int INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
int divCeil(int A, int B) {return (A + (B - 1)) / B;}
int myctoi(char C) {return C - '0';}
char myitoc(int N) {return '0' + N;}
#define FINALANS(A) {cout << A << endl; exit(0);}
signed main()
{
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
{
cin >> p.at(i);
}
vector<int> a(N), b(N);
for (int i = 0; i < N; i++)
{
a.at(i) = (i + 1) * N;
b.at(N - i - 1) = (i + 1) * N;
}
for (int i = 0; i < N; i++)
{
a.at(p.at(i) - 1) += i;
}
for (int i = 0; i < N; i++)
{
cout << a.at(i);
if (i == N - 1)
cout << endl;
else
cout << " ";
}
for (int i = 0; i < N; i++)
{
cout << b.at(i);
if (i == N - 1)
cout << endl;
else
cout << " ";
}
}
| 0
| 77,799,241
|
#include <iostream>
typedef long long ll;
using namespace std;
static const int MOD = 1000000007;
ll dp[2005];
int main() {
int S;
cin >> S;
dp[0] = 1;
for (int i = 3; i <= S; i++) {
dp[i] = (dp[i - 1] + dp[i - 3]) % MOD;
}
if (S >= 1 && S <= 2) cout << 0 << endl;
else cout << dp[S] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 200003
#define MOD 1000000007
using Graph=vector<vector<pair<int,double>>>;
int main(){
int N;
cin>>N;
vector<ll> A(N),B(N);
ll sum=0;
int k;
bool flag=false;
for(int i=0;i<N;i++){
cin>>A.at(i)>>B.at(i);
sum+=A.at(i);
if(A.at(i)>B.at(i)){
if(flag){
if(B.at(i)<B.at(k)){
k=i;
}
}else{
k=i;
flag=true;
}
}
}
if(flag){
cout<<sum-B.at(k)<<endl;
}else{
cout<<0<<endl;
}
}
| 0
| 67,938,135
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll K, S, c = 0, z;
cin >> K >> S;
for (int x = 0; x <= min(K, S); x++) {
for (int y = 0; y <= min(K, S - x); y++) {
z = S - x - y;
if (0 <= z && z <= K) c++;
}
}
cout << c << endl;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
ll L, R, t; cin >> L >> R;
vector<int> check(2019,0);
for(ll i=L; i<R; i++){
for(ll j=i+1; j<=R; j++){
t = i*j%2019;
check[t] = 1;
if(t == 0){
cout << 0;
return 0;
}
}
}
rep(i,2019){
if(check[i] == 1){
cout << i;
return 0;
}
}
}
| 0
| 56,735,849
|
#include <iostream>
#include <list>
using namespace std;
int main(void) {
int w;
string c;
list<int> myList;
list<int>::iterator it;
cin >> w;
for (int i = 0; i < w; i++) {
cin >> c;
if (c == "insert") {
int x;
cin >> x;
myList.push_front(x);
} else if (c == "delete") {
int x;
cin >> x;
for (it = myList.begin(); it != myList.end(); it++) {
if (*it == x) {
myList.erase(it);
break;
}
}
} else if (c == "deleteLast") {
myList.pop_back();
} else if (c == "deleteFirst") {
myList.pop_front();
}
}
for (it = myList.begin(); it != myList.end(); it++) {
if (it == myList.begin()) {
cout << *it;
}else{
cout << ' ' << *it;
}
}
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 10000000
using namespace std;
bool check(char x){
for(int i=48; i<=57; i++){
if(x == i) return true;
}
return false;
}
int main(){
int n;
cin >> n;
rep(i,n){
string a,b;
cin >> a >> b;
int flag = 1;
int tmp,sum = 0;
rep(j,a.size()){
if(check((int)a[j])) flag = a[j]-'0';
else {
if(a[j] == 'm') tmp = 1000;
else if(a[j] == 'c') tmp = 100;
else if(a[j] == 'x') tmp = 10;
else if(a[j] == 'i') tmp = 1;
sum += tmp*flag;
flag = 1;
}
}
rep(j,b.size()){
if(check(b[j])) flag = b[j]-'0';
else {
if(b[j] == 'm') tmp = 1000;
else if(b[j] == 'c') tmp = 100;
else if(b[j] == 'x') tmp = 10;
else if(b[j] == 'i') tmp = 1;
sum += tmp*flag;
flag = 1;
}
}
if(sum/1000 !=0) {
if(sum/1000 == 1) cout << 'm';
else cout << sum/1000 << 'm';
sum -= 1000*(sum/1000);
}
if(sum/100 !=0) {
if(sum/100 == 1) cout << 'c';
else cout << sum/100 << 'c';
sum -= 100*(sum/100);
}
if(sum/10 !=0) {
if(sum/10 == 1) cout << 'x';
else cout << sum/10 << 'x';
sum -= 10*(sum/10);
}
if(sum/1 !=0) {
if(sum/1 == 1) cout << 'i';
else cout << sum/1 << 'i';
}
cout << endl;
}
return 0;
}
| 0
| 17,502,706
|
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, COUNT = 0, X;
vector<long long> ANS;
cin >> N;
for (int i = 1; ; i++) {
ANS.push_back(i);
COUNT += i;
if (N <= COUNT) break;
}
X = COUNT - N;
for (int i = 0; i < ANS.size(); i++) if (ANS[i] != X) cout << ANS[i] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
typedef long long ll;
ll a,b,k,l,m;
cin>> a>> b>> k;
if((a+b)<k)
{
cout<< "0 0"<< endl;
}
else if(k>=a)
{
l=k-a;
m=b-l;
cout<< "0 "<< m;
}
else
{
l= a-k;
cout<< l<< " "<< b;
}
}
| 0
| 70,825,693
|
#define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1<<n); ++bit)
#define isOne(bit, i) bit & (1<<i)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define add push_back
template<typename T>
std::vector<T> slice(std::vector<T> const &v, int m, int n)
{
auto first = v.cbegin() + m;
auto last = v.cbegin() + n + 1;
std::vector<T> vec(first, last);
return vec;
}
#define remove_unique(v) v.erase(unique(ALL(v)), v.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 (a>b) { a=b; return 1; } return 0; }
#define fir first
#define sec second
#define mp make_pair
#define ll long long
#define vec vector
#define cord2d pair<int,int>
#define intP pair<int, int>
template <class T> T get(){ T s; cin >> s; return(s);}
#define gi get<int>()
#define gs get<string>()
#define gll get<ll>()
template <class T> vector<T> getv(int n) { vec<T> v(n); REP(i, n) cin >> v[i]; return v; }
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)
#define gllm(n) getv<ll>(n)
void print(int a){ cout << a << endl; }
void print(long long a){ cout << a << endl; }
void print(string a){ cout << a; }
void print(char a){ cout << a << endl; }
void print(double a){ cout << a << endl; }
void print(double a, int dig){ cout << std::setprecision(dig) << a << endl; }
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
template <class T = int>
void print(vec<T> v){ cout << v << endl; }
template <class T = int>
void print2dVec(vec<vec<T>> v2d){for(vec<T> v: v2d) {print(v);}}
void YesNo1(bool i = true){ return print(i?"Yes":"No"); }
void YESNO2(bool i = true){ return print(i?"YES":"NO"); }
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") { cout << string(" ", nest) << before; print(var); }
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__
#define lamb(exp) [](auto i){return exp;}
#define isEven [](int i){return i % 2 == 0;}
#define isOdd [](int i){return i % 2 != 0;}
const ll INF = 1e18;
const int MOD = 1000000007;
int factorial(int k){ int sum = 1; for (int i = 1; i <= k; ++i) { sum *= i; } return sum; }
ll gcd(ll a, ll b) { if (b == 0) { return a; } return gcd(b, a % b); }
ll lcm(ll a, ll b) { ll temp = gcd(a, b); return temp ? (a / temp * b) : 0; }
void Main() {
int n = gi;
string s = gs;
string t = gs;
if (s==t) {
print(n);
return;
}
OneToN(i,n) {
if (s.substr(n-i,i) == t.substr(0,i)) {
print(n*2 - i);
return;
}
}
print(n*2);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
}
|
#include<bits/stdc++.h>
using namespace std ;
int main() {
int A ,B ;
cin >> A >> B ;
if( A == 1){
if (B == 2){
cout << 3 << endl ;
}
else {
cout << 2 << endl ;
}
}
else if (A == 2){
if (B==1){
cout << 3 << endl ;
}
else {
cout << 1 << endl ;
}
}
else if (A == 3){
if (B==2){
cout << 1 << endl ;
}
else {
cout << 2 << endl ;
}
}
}
| 0
| 30,029,988
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> ball(n);
map<int,int> maps;
for(int i=0;i<n;i++){
cin>>ball.at(i);
if(maps.count(ball.at(i))) maps.at(ball.at(i))++;
else maps[ball.at(i)]=1;
}
vector<int> num;
for(auto a:ball){
if(maps.at(a)!=0){
num.push_back(maps.at(a));
maps.at(a)=0;
}
}
sort(num.begin(),num.end());
long long ans=0;
int cnt=0;
for(int i=num.size()-1;i>=0;i--){
if(cnt>=k) break;
cnt++;
ans+=num.at(i);
}
cout<<n-ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int K;
void f(int &mine, int &others, int i)
{
if (i == K)
return;
if (mine % 2 == 1)
{
mine = mine - 1;
}
int gift = mine / 2;
mine -= gift;
others += gift;
f(others, mine, i + 1);
}
int main()
{
int A, B;
cin >> A >> B >> K;
f(A, B, 0);
cout << A << " " << B << endl;
return 0;
}
| 0
| 8,015,419
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
int p=1000000007;
vector<int64_t> e(k+1,1);
for(int i=0;i<=k;i++){
int x=n;
vector<bool> b;
while(x>0){
b.push_back(x%2==1);
x/=2;
}
for(int d=(int)b.size()-1;d>=0;d--){
e.at(i)=e.at(i)*e.at(i)%p;
if(b.at(d))
e.at(i)=e.at(i)*i%p;
}
}
vector<int64_t> c(k+1,0);
int64_t s=0;
for(int i=k;i>=1;i--){
c.at(i)=e.at(k/i);
for(int j=2;i*j<=k;j++)
c.at(i)=(c.at(i)-c.at(i*j)+p)%p;
s=(s+c.at(i)*i)%p;
}
cout<<s<<endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
if (count(A.begin(), A.end(), 0) > 0) {
cout << 0 << endl;
return 0;
}
ll prod = 1;
for (int i = 0; i < N; ++i) {
if (A[i] > 1000000000000000000LL / prod) {
cout << -1 << endl;
return 0;
}
prod *= A[i];
}
cout << prod << endl;
return 0;
}
| 0
| 57,533,526
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef long long ll;
typedef long double ld;
int main(){
int n;cin>>n;
vector<int> v(100003);
while(n--){
int a;cin>>a;
v[a]++;
v[a+1]++;
v[a+2]++;
}
cout<<MAX(v)<<endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
if(s1.size()>s2.size()){
cout << "GREATER" << endl;
return 0;
}else if(s1.size()<s2.size()){
cout << "LESS" << endl;
return 0;
}else{
for(int i=0;i<s1.size();i++){
int a = s1[i]-'0';
int b = s2[i]-'0';
if(a>b){
cout << "GREATER" << endl;
return 0;
}else if(b>a){
cout << "LESS" << endl;
return 0;
}
}
cout << "EQUAL" << endl;
}
}
| 0
| 19,202,831
|
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9+7;
long long dfs(int curstep,int &n,set<int> &brok,vector<long long> &dp){
if(curstep == n ) return 1;
if(curstep>n || brok.count(curstep)) return 0;
if(dp[curstep]!=-1) return dp[curstep];
return dp[curstep] = (dfs(curstep+1,n,brok,dp)%mod + dfs(curstep+2,n,brok,dp)%mod)%mod;
}
int main(){
int n,m;
cin>>n>>m;
set<int> broken;
vector<long long> dp(n+1,-1);
while(m--){
int a;
cin>>a;
broken.insert(a);
}
cout<<dfs(0,n,broken,dp);
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
ll solve1(ll n, int p)
{
if(n==0) { return 0; }
return n/p + solve1(n/p, p);
}
ll solve2(ll n, int p)
{
if(n%2==1) {
return solve1(n, p) - solve2(n-1, p);
}
ll res = solve1(n/2, p);
if(p==2) { res += n/p; }
return res;
}
int main(void)
{
ll n;
cin >> n;
ll ans = min(solve2(n, 2), solve2(n, 5));
cout << ans << endl;
return 0;
}
| 0
| 46,599,083
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
vector<int64_t> A = { 2, 1 };
int main() {
int N;
scanf("%d", &N);
for (int i = 2; i < N + 1; i++) {
A.push_back(A[i - 1] + A[i - 2]);
}
printf("%lld\n", A[N]);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD ((int)1e9+7)
#define N ((int)2e5+123)
void reads(string& x){ char kk[N]; scanf("%s",kk); x = kk;}
int ans, n, m, v[N],sum,q;
void solve(){
scanf("%d%d", &n,&m);
for(int i=0;i<n;i++){
scanf("%d",v+i);
sum+=v[i];
}
sum = (sum+4*m-1)/(4*m);
for(int i=0;i<n;i++){
q+=(v[i]>=sum);
}
if(q>=m)printf("Yes\n");
else printf("No\n");
}
int main(){
ios_base::sync_with_stdio(0);
int t = 1;
for(int caso=1;caso<=t;caso++){
solve();
}
}
| 0
| 94,134,388
|
#include<bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(false),cin.tie(0);
#define ll long long
#define inf 0x3f3f3f3f
const int N=105;
int main()
{
IO;
int len1,len2,i,j,x,ans;
string s,t;
cin>>s>>t;
len1=s.length();
len2=t.length();
ans=inf;
for(i=0;i+len2<=len1;i++)
{
x=0;
for(j=0;j<len2;j++)
{
if(s[i+j]!=t[j])
{
x++;
}
}
ans=min(ans,x);
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
int main(){
string S;
cin >> S;
int ans = 0;
bool flag = true;
if(S[0] == '0') flag = false;
else flag = true;
for (int i = 1; i < S.size(); i++) {
if(flag == false){
if(S[i] == '0'){
S[i] = '1';
ans++;
}
flag = true;
} else {
if(S[i] == '1'){
S[i] = '0';
ans++;
}
flag = false;
}
}
cout << ans << endl;
return 0;
}
| 0
| 11,639,111
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int>cnt(N+1, 0);
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
cnt[A]++;
}
sort(cnt.begin(), cnt.end());
int sum = 0;
vector<int>ans(N+1);
ans[0] = N+1;
for (int i = 1; i <= N; ++i) {
auto iter = lower_bound(cnt.begin(), cnt.end(), i);
sum += cnt.end() - iter;
ans[i] = sum / i;
}
for (int i = 1; i <= N; ++i) {
auto iter = upper_bound(ans.begin(), ans.end(), i, greater<int>());
cout << iter - ans.begin() - 1 << "\n";
}
return 0;
}
|
#include <algorithm>
int uf[100010];
void init(int n){ for(int i = 0; i < n; i++) uf[i] = -1; }
int find(int x){
if(uf[x] < 0) return x;
return uf[x] = find(uf[x]);
}
void unite(int x, int y){
x = find(x); y = find(y);
if(x != y){ uf[x] += uf[y]; uf[y] = x; }
}
bool same(int x, int y){
return find(x) == find(y);
}
#include <cstdio>
int main(){
int n,q;
scanf("%d%d",&n,&q);
init(n);
while(q--){
int c,x,y;
scanf("%d%d%d",&c,&x,&y);
if(c){
printf("%d\n",same(x,y));
} else {
unite(x,y);
}
}
}
| 0
| 84,159,064
|
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define EPS (1e-10)
#define endl "\n"
#define SZ(v) (int)(v.size())
#define IO ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL), cerr.tie(NULL);
typedef long long ll;
typedef long double ld;
ll MOD=1e9 + 7;
ll OO=1e9 + 1;
const int N=1e6 + 10,M=20;
int fr[N];
int n,m,k,T;
int a,b,c;
int l,r,mid;
string str;
vector<pair<int,int>> vec;
set<pair<int,int>> st;
map<int,vector<int>> mp;
int main(){
IO
cin>>n>>m>>k;
for(int i=0;i<k;++i){
cin>>a>>b;
vec.push_back({a,b});
if(!fr[b])
st.insert({0,b});
st.erase({fr[b],b});
fr[b]++;
st.insert({fr[b],b});
}
for(auto &it:vec)
mp[it.first].push_back(it.second);
int ans = 0;
for(auto &it:mp){
for(int &i:it.second){
st.erase({fr[i],i});
--fr[i];
st.insert({fr[i],i});
}
ans = max(ans,SZ(it.second) + (*st.rbegin()).first);
for(int &i:it.second){
st.erase({fr[i],i});
++fr[i];
st.insert({fr[i],i});
}
}
cout<<ans<<endl;
}
|
bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define ncouts(x) numout(x),outst[outst_N++] = ' '
#define ncoutn(x) numout(x),outst[outst_N++] = '\n'
#define scouts(x) strout(x),outst[outst_N++] = ' '
#define scoutn(x) strout(x),outst[outst_N++] = '\n'
#define dcouts(x) if(DBG) couts(x)
#define dcoutn(x) if(DBG) coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x,a) (((x)>>(a))&1LL)
#define IBIT(x,a) (((x)>>(a))&1)
#define BCOUNT(x) (__builtin_popcount(x))
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1,T2> &p){is >> p.first >> p.second; return is; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec){ os << "deque["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<class T> using V = vector<T>;
template<class T> using V2 = V<V<T>>;
template<class T> using V3 = V<V2<T>>;
template<class T> using V4 = V<V3<T>>;
char outst[20'000'000]; int outst_N = 0;
char outst_tmp[200];
template<class NUM >
void numout(NUM n){
if(n<0) { n*=-1; outst[outst_N++] = '-';}
if(n==0){ outst[outst_N++] = '0'; return;}
int cnt = 0;
while(n>0){
outst_tmp[cnt++] = '0' + (n % 10);
n /= 10;
}
IFOR(i,0,cnt){
outst[outst_N++] = outst_tmp[i];
}
}
void strout(std::string s){
for(auto x: s){
outst[outst_N++] = x;
}
}
constexpr ll LINF = 1LL << 60;
constexpr int IINF = 1 << 28;
constexpr ll mod = 1'000'000'007;
int dx[] = {1,-1,0, 0};
int dy[] = {0,0,1,-1};
int dx2[] = {0,2,0, 2};
int dy2[] = {0,0,2,2};
int MH = 100, MW = 100;
void solve(){
int a, b; cin >> a >> b;
int t = (a<b);
if(t) swap(a, b);
couts(MH); coutn(MW);
V2<int> c(MH, V<int>(MW));
V2<int> used(MH, V<int>(MW));
--b;
used[0][0] = 1;
FOR(i,0,MH/2){
FOR(j,0,MW/2){
c[2*i][2*j] = 1;
--a;
}
}
if(b>0){
FOR(i,0,MH/2-1){
FOR(j,0,MW/2-1){
if(b>0){
{
int unuse = 0;
FOR(k,0,4) unuse += (used[2*i+dx2[k] ][2*j+dy2[k] ]==0);
a += unuse;
}
b--;
FOR(k,0,4){
c[2*i+1+dx[k] ][2*j+1+dy[k] ] = 1;
used[2*i+1+dx[k] ][2*j+1+dy[k] ] = 1;
}
FOR(k,0,4){
c[2*i+dx2[k] ][2*j+dy2[k] ] = 1;
used[2*i+dx2[k] ][2*j+dy2[k] ] = 1;
}
}
else break;
}
if(b<=0) break;
}
}
if(a<0 ){
IFOR(i,0,MH/2){
IFOR(j,0,MW/2){
if(a<0){
if(!used[2*i][2*j] ) c[2*i][2*j] = 0, ++a;
}
else break;
}
if(a>=0) break;
}
}
FOR(i,0,MH){
FOR(j,0,MW){
if( c[i][j]^t ){
cout << '.';
}else{
cout << '#';
}
}
cout << '\n';
}
}
int main(void){
cin.tie(0);
solve();
return 0;
}
| 0
| 79,855,689
|
#include<stdio.h>
struct Card{
char suit;
char value;
};
void bubble(struct Card A[], int n){
int i, j;
struct Card t;
for ( i = 0; i < n; i++ ){
for ( j = n-1; j >= i+1; j-- ){
if ( A[j].value < A[j-1].value ){
t = A[j]; A[j] = A[j-1]; A[j-1] = t;
}
}
}
}
void selection(struct Card A[], int n){
int i, j, mini;
struct Card t;
for ( i = 0; i < n; i++ ){
mini = i;
for ( j = i; j < n; j++ ){
if ( A[j].value < A[mini].value ) mini = j;
}
t = A[i]; A[i] = A[mini]; A[mini] = t;
}
}
void print(struct Card A[], int n){
int i;
for ( i = 0; i < n; i++ ){
if ( i ) printf(" ");
printf("%c%c", A[i].suit, A[i].value);
}
printf("\n");
}
int isStable(struct Card C1[], struct Card C2[], int n){
int i;
for ( i = 0; i < n; i++ ){
if ( C1[i].suit != C2[i].suit ) return 0;
}
return 1;
}
int main(){
struct Card C1[101], C2[101];
int n, i;
char ch;
scanf("%d\n", &n);
for ( i = 0; i < n; i++ ){
scanf("%c%c ", &C1[i].suit, &C1[i].value);
}
for ( i = 0; i < n; i++ ) C2[i] = C1[i];
bubble(C1, n);
selection(C2, n);
print(C1, n);
printf("Stable\n");
print(C2, n);
if ( isStable(C1, C2, n) ){
printf("Stable\n");
} else {
printf("Not stable\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int cnt = 0, a_cnt = 0, b_cnt = 0, double_cnt = 0;
string s;
for (int i = 0;i < N;i++) {
cin >> s;
for (int j = 0;j < s.length()-1;j++) {
if (s[j] == 'A') {
if (s[j+1] == 'B') cnt++;
}
}
if (s[0] == 'B') b_cnt++;
if (s[s.length() - 1] == 'A') a_cnt++;
if (s[0] == 'B' && s[s.length() - 1] == 'A') double_cnt++;
}
if (double_cnt == a_cnt && a_cnt == b_cnt) {
a_cnt = max(0, a_cnt-1);
b_cnt = max(0, b_cnt-1);
}
cout << cnt + min(a_cnt, b_cnt) << endl;
}
| 0
| 65,090,844
|
#include <stdio.h>
#include <iostream>
using namespace std;
int main(void)
{
int dice[6]={0};
int q;
int a,b;
for(int i=0; i< 6; i++){
cin >> dice[i];
}
cin >> q;
for(int i = 0; i< q; i++){
cin >> a >> b;
if(a == dice[0]){
if (b == dice[1]){
cout << dice[2] <<endl;
}else if(b == dice[2]){
cout << dice[4] <<endl;
}else if(b == dice[3]){
cout << dice[1] <<endl;
}else if(b == dice[4]){
cout << dice[3] <<endl;
}else{
}
}
else if(a == dice[1]){
if (b == dice[0]){
cout << dice[3] <<endl;
}else if(b == dice[2]){
cout << dice[0] <<endl;
}else if(b == dice[3]){
cout << dice[5] <<endl;
}else if(b == dice[5]){
cout << dice[2] <<endl;
}else{
}
}
else if(a == dice[2]){
if (b == dice[0]){
cout << dice[1] <<endl;
}else if(b == dice[1]){
cout << dice[5] <<endl;
}else if(b == dice[4]){
cout << dice[0] <<endl;
}else if(b == dice[5]){
cout << dice[4] <<endl;
}else{
}
}
else if(a == dice[3]){
if (b == dice[0]){
cout << dice[4] <<endl;
}else if(b == dice[1]){
cout << dice[0] <<endl;
}else if(b == dice[4]){
cout << dice[5] <<endl;
}else if(b == dice[5]){
cout << dice[1] <<endl;
}else{
}
}
else if(a == dice[4]){
if (b == dice[0]){
cout << dice[2] <<endl;
}else if(b == dice[2]){
cout << dice[5] <<endl;
}else if(b == dice[3]){
cout << dice[0] <<endl;
}else if(b == dice[5]){
cout << dice[3] <<endl;
}else{
}
}
else if(a == dice[5]){
if (b == dice[1]){
cout << dice[3] <<endl;
}else if(b == dice[2]){
cout << dice[1] <<endl;
}else if(b == dice[3]){
cout << dice[4] <<endl;
}else if(b == dice[4]){
cout << dice[2] <<endl;
}else{
}
}else {
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W;
cin >> H >> W;
for(int h = 1; h <= H; h++) {
for(char a = 'A'; a < 'A' + W; a++) {
string s;
cin >> s;
if(s == "snuke") {
cout << a << h << endl;
return 0;
}
}
}
return 0;
}
| 0
| 90,927,785
|
#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;
int main() {
const long long int mod = 1000000007,INF=50000000000000;
map<long long int, long long int>mp;
cout << fixed << setprecision(10);
string str[120];
long long int n,speed=0,t[600]={},v[600],nowt=1,x1,x2,y1,y2;
long double res=0.0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>t[i];
}
for(int i=1;i<=n;i++){
cin>>v[i];
}
v[n+1]=0;
for(int i=1;i<=n+1;i++){
t[i]=t[i]+t[i-1];
}
for(int i=1;i<=t[n+1];i++){
long long int tmp=999999,tmp2=999999;
for(int j=nowt;j<=n;j++){
tmp=min(tmp,t[j]-i+v[j+1]);
tmp2=min(tmp2,2*t[j]-2*i+1+2*v[j+1]);
}
if(tmp>=speed+1&&speed<v[nowt]){
res+=(long double)(speed*2+1)/2.0;
speed++;
}else if(tmp>=speed){
if(tmp2>=1&&speed<v[nowt]){
res+=0.25;
}
res+=speed;
}else{
res+=(long double)(speed*2-1)/2.0;
speed--;
}
if(t[nowt]==i){
nowt++;
}
}
cout<<res;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define REV(x) reverse(ALL(x))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
int N, prv(-1), ans(0), cnt(0); cin >> N;
REP(i, N){
int a; cin >> a;
if(prv != a){
ans += cnt / 2;
cnt = 1;
prv = a;
}else ++cnt;
}
ans += cnt / 2;
cout << ans << endl;
return 0;
}
| 0
| 2,704,892
|
#include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
vector<ll> a(n + 1), b(n);
for(int i = 0; i <= n; ++i){
cin >> a[i];
}
for(int i = 0; i < n; ++i){
cin >> b[i];
}
ll tot = 0;
for(int i = 0; i < n; ++i){
if(b[i] >= a[i]){
tot += a[i];
b[i] -= a[i];
}else{
tot += b[i];
b[i] = 0;
}
if(b[i] >= a[i + 1]){
tot += a[i + 1];
a[i + 1] = 0;
}else{
tot += b[i];
a[i + 1] -= b[i];
}
}
cout << tot << '\n';
return 0;
}
|
#include <cstdio>
using LL = long long;
const int MAXN = (int)1e5;
LL a[MAXN];
struct LinearBasis {
static const int MAXL = 64;
LL a[MAXL];
LinearBasis() {
for (int i = 0; i < MAXL; ++i) a[i] = 0;
}
void Add(LL vec) {
for (int j = MAXL - 1; j >= 0 && vec > 0; --j) {
if (((vec >> j) & 1) == 0) continue;
if (a[j] > 0) {
vec ^= a[j];
continue;
}
for (int k = 0; k < j; ++k) {
if ((vec >> k) & 1) vec ^= a[k];
}
for (int k = j + 1; k < MAXL; ++k) {
if ((a[k] >> j) & 1) a[k] ^= vec;
}
a[j] = vec;
break;
}
}
void Build(LL *vec_array, int len) {
for (int i = 0; i < len; ++i) Add(vec_array[i]);
}
void Merge(const LinearBasis &another) {
for (int i = 0; i < MAXL; ++i) Add(another.a[i]);
}
LL GetMax() {
LL res = 0;
for (int i = MAXL - 1; i >= 0; --i) {
res ^= a[i];
}
return res;
}
};
LL solve(int n) {
LL xor_sum = 0;
for (int i = 0; i < n; ++i) xor_sum ^= a[i];
LinearBasis lb;
for (int i = 0; i < lb.MAXL; ++i) {
if (((xor_sum >> i) & 1) == 0) continue;
for (int j = 0; j < n; ++j) {
if ((a[j] >> i) & 1) a[j] ^= (1LL << i);
}
}
lb.Build(a, n);
LL lb_max = lb.GetMax();
return lb_max * 2 + xor_sum;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%lld", a + i);
printf("%lld\n", solve(n));
return 0;
}
| 0
| 62,195,037
|
#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<string,int>;
int main(){
int N;
string S;
cin >> N >> S;
int ans = 1;
for(int i = 1; i<N; i++){
if(S.at(i) != S.at(i-1))ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf 1e18
#define deci(x,y) fixed<<setprecision(y)<<x
#define w(t) int t; cin>>t; while(t--)
#define nitin ios_base::sync_with_stdio(false); cin.tie(NULL)
#define PI 3.141592653589793238
using namespace std;
int power(int x, int y, int p)
{
int res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int modi(int a, int m)
{
return power(a, m - 2, m);
}
int32_t main()
{
nitin;
int n;
cin>>n;
vector<int>a(n);
vector<int>b(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int j=0;j<n;j++){
cin>>b[j];
}
bool flag=true;
for(int i=0;i<n;i++)
{
if(a[i]>b[i])
{
flag=true;
break;
}
else if(a[i]<b[i]){
flag=false;
break;
}
}
if(flag)
{
swap(a,b);
}
int cnt=0;
do{
if(a==b)
break;
else
cnt++;
}
while(next_permutation(a.begin(),a.end()));
cout<<cnt<<endl;
return 0;
}
| 0
| 80,774,043
|
#include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a % 3 == 0 || b % 3 == 0 || (a + b) % 3 == 0)
printf("Possible");
else
printf("Impossible");
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int N;
scanf("%d", &N);
std::vector<int > A(N), T(N);
for (int i=0; i<N; i++){
scanf("%d", &A[i]);
}
for (int i=0; i<N; i++){
scanf("%d", &T[i]);
}
std::vector<int > fix(N, -1);
std::vector<int > max(N, 1001001004);
fix[0]=A[0];
for (int i=1; i<N; i++){
if (A[i]>A[i-1]){
fix[i]=A[i];
} else {
max[i]=A[i];
}
}
if (fix[N-1]!=-1 && fix[N-1]!=T[N-1]){
printf("0\n");
return 0;
}
fix[N-1]=T[N-1];
for (int i=N-2; i>=0; i--){
if (T[i]>T[i+1]){
if (fix[i]!=-1 && fix[i]!=T[i]){
printf("0\n");
return 0;
} else if (T[i]>max[i]){
printf("0\n");
return 0;
} else {
fix[i]=T[i];
}
} else {
max[i]=std::min(max[i], T[i]);
}
}
long long ans = 1;
long long mod=1e9+7;
for (int i=0; i<N; i++){
if (fix[i]!=-1) continue;
ans *= max[i];
ans %= mod;
}
std::cout << ans << std::endl;
return 0;
}
| 0
| 2,694,923
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n%2==0) --n;
cout << n/2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
template<class T> inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 5e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
bool used[26];
int main() {
init();
string S, e;
cin >> S;
ll sn = S.size();
repr(i, 26) e += 'a' + i;
if(S==e){
cout << -1 << endl;
return 0;
}
if(sn==26){
reverse(all(S));
ll en = 26;
bool isok = false;
rep(i,sn){
ll cn = S[i] - 'a';
used[cn] = true;
repe(j,cn+1, 26){
if(used[j]){
isok = true;
S[i] = 'a' + j;
break;
}
}
if (isok) break;
en--;
}
reverse(all(S));
cout << S.substr(0, en) << endl;
}
else{
rep(i, sn) used[S[i]-'a'] = true;
rep(i,26){
if(!used[i]){
S += 'a' + i;
break;
}
}
cout << S << endl;
}
}
| 0
| 44,466,865
|
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <inttypes.h>
using namespace std;
int main()
{
int32_t N;
scanf("%d", &N);
int32_t t[101];
int32_t T = 0;
for (int32_t i = 0; i < N; i++) {
scanf("%d", &t[i]);
T += t[i];
}
int32_t v[101];
for (int32_t i = 0; i < N; i++) {
scanf("%d", &v[i]);
}
double max_v[40001];
int32_t max_v_index = 0;
for (int32_t i = 0; i < N; i++) {
for (int32_t j = 0; j < 2 * t[i]; j++) {
if (i > 0 && j == 0)
max_v[max_v_index++] = min(v[i - 1], v[i]);
else
max_v[max_v_index++] = v[i];
}
}
max_v[0] = 0;
max_v[2 * T] = 0;
for (int32_t i = 1; i < 2 * T + 1; i++)
max_v[i] = min(max_v[i], max_v[i - 1] + 0.5);
for (int32_t i = 2 * T - 1; i >= 0 ; i--)
max_v[i] = min(max_v[i], max_v[i + 1] + 0.5);
double res = 0;
for (int32_t i = 0; i < 2 * T; i++) {
res += min(max_v[i], max_v[i + 1]) * 0.5;
if (max_v[i] != max_v[i + 1])
res += 0.5 * 0.5 / 2;
}
printf("%.17f\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
const int MOD = 1000000007;
const ll LINF = (ll)1e18 - 1;
const int INF = 1e9 - 1;
const double EPS = 0.000000001;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
auto print = [](auto &v) {
for(auto x : v) {
cout << x << " ";
}
cout << endl;
};
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll m, k;
cin >> m >> k;
VL ans;
if(k >= pow(2, m)) {
out(-1);
}
else if(m == 0 && k == 0) {
cout << 0 << ' ' << 0 << endl;
}
else if(m == 1 && k == 1) {
out(-1);
}
else if(m == 1 && k == 0) {
cout << 0 << ' ' << 0 << ' ' << 1 << ' ' << 1 << endl;
}
else {
for(int i = 0; i < pow(2, m); ++i) {
if(i != k) ans.push_back(i);
}
ans.push_back(k);
for(int i = (int)pow(2, m) - 1; i >= 0; --i) {
if(i != k) ans.push_back(i);
}
ans.push_back(k);
print(ans);
}
return 0;
}
| 0
| 57,684,011
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
using ll = long long;
#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 input(...) __VA_ARGS__; in(__VA_ARGS__)
template<class T>
void print(vector<T> a) {
cout << "[ ";
REP(i, a.size()) cout << a[i] << " ";
cout << "]" << endl;
}
void print() {
std::cout << std::endl;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
std::cout << head << " ";
print(std::forward<Tail>(tail)...);
}
void in() { }
template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
cin >> head;
in(std::forward<Tail>(tail)...);
}
int main() {
ll input(n);
vector<vector<ll>> graph(n);
REP(i, n) {
ll input(u, k);
REP(j, k) {
ll input(v);
graph[u - 1].push_back(v - 1);
}
}
vector<bool> visited(n);
vector<ll> cost(n);
queue<pair<ll, ll>> que;
que.push({0, 0});
while (!que.empty()) {
pair<ll, ll> node = que.front();
que.pop();
if (!visited[node.first]) {
cost[node.first] = node.second;
}
visited[node.first] = true;
for(auto v: graph[node.first]) {
if (!visited[v]) {
que.push({v, node.second + 1});
}
}
}
REP(i, n) {
if (!visited[i]) cost[i] = -1;
cout << i + 1 << " " << cost[i] << endl;;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T, typename K> using ump = unordered_map<T, K>;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll e5 = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = ll(n - 1); i >= 0; i--)
#define each(i, mp) for (auto &i : mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
template<class T>
ostream &operator<<(ostream &out, const vector<T> &list) {
ll n = list.size();
rep(i, n) out << list[i] << ' ';
return out;
}
template<class T>
istream &operator>>(istream &in, vector<T> &list) {
ll n = list.size();
rep(i, n) in >> list[i];
return in;
}
template<class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &list) {
ll n = list.size();
rep(i, n) out << list[i] << '\n';
return out;
}
void solve() {
ll n;
cin >> n;
vl a(n);
cin >> a;
vl sa(a);
sort(all(sa));
map<ll, ll> mp;
rep(i, n) mp[sa[i]] = i;
ll cnt = 0;
rep(i, n) {
if (i % 2 != mp[a[i]] % 2) cnt++;
}
cout << (cnt + 2 - 1) / 2 << '\n';
}
int main() {
#ifdef MY_DEBUG
while (true) {
#endif
solve();
#ifdef MY_DEBUG
}
#endif
return 0;
}
| 0
| 72,906,620
|
#include <iostream>
using namespace std;
int main() {
int n,x;
int ans;
while(true){
ans = 0;
cin >> n >> x;
if(n == 0 && x == 0) break;
for(int i = 1; i <= n-2; ++i){
for(int j = i+1; j <= n-1; ++j){
if(i == j) continue;
for(int k = j+1; k <= n; ++k){
if(i == k || j == k) continue;
if(i+j+k == x){
++ans;
}
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main (){
char kataA[11];
char kataB[11];
char kataC[11];
scanf("%s %s %s", &kataA, &kataB, &kataC);
int panjangA = strlen (kataA);
int panjangB = strlen(kataB);
if(kataA[panjangA-1] == kataB[0] && kataB[panjangB-1] == kataC[0]){
puts("YES");
}
else{
puts("NO");
}
return 0;
}
| 0
| 50,476,329
|
#include <bits/stdc++.h>
#define MAX 1000000
#define INF 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sync_with_stdio(false), cin.tie(NULL);
#define all(x) x.begin(), x.end()
#define read(x) freopen(x, "r", stdin)
#define write(x) freopen(x, "w", stdout)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define REP(i, a, n) for (int i = a; i <= n; i++)
#define inputArray(a,n) rep(i, 0, n) cin >> a[i];
#define copyArray(a,temp,n) rep(i, 0, n) temp[i]=a[i];
#define printArray(a,n) rep(i, 0, n) cout << a[i] << " "; cout << endl;
#define Cases cout << "Case " << ++Case << ": ";
#define __test int tt; int Case=0; cin >> tt; while(tt--)
#define dbgA2(A, n, m) {cout<<"--> "<<#A<<" = \n";rep(i, 0, n){rep(j, 0, n){cout<<A[i][j]<<" ";}cout<<"\n";}cout<<"\n";}
#define dbgA(A, n) {cout<<" --> "<<#A<<" = (";rep(i, 0, n)cout<<A[i]<<" ";cout<<")\n";}
#define dbg(args...) {string sss(#args);sss+=',';cout<<" --> ";debugger::call(all(sss), args);cout<<"\n";}
ll gcd(ll n, ll m) { return m ? gcd(m, n % m) : n; }
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
struct debugger {
typedef string::iterator si;
static void call(si it, si ed) {}
template<typename T, typename ... aT>
static void call(si it, si ed, T a, aT... rest) {
string b;
for(; *it!=','; ++it)
if(*it!=' ')
b+=*it;
cout << b << "=" << a << " ";
call(++it, ed, rest...);
}
};
void solve() {
int n, m;
cin >> n >> m;
int yen = 500 * n;
if(m <= yen) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
int main() {
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
int n,a[200001],s[200001];
map<int,int> mp;
bool judge(int x)
{
mp.clear();
int cnt=0;
for(int i=2;i<=n;i++)
if(a[i]<=a[i-1])
{
if(x==1) return false;
while(cnt&&s[cnt-1]>a[i])
mp[s[cnt-1]]=0,cnt--;
int t=a[i];
while(mp[t]+1>=x&&t>0) mp[t]=0,t--;
if(t<=0) return false;
mp[t]++;
s[cnt++]=t;
}
return true;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int l=1,r=n,ans;
while(l<=r)
{
int m=l+r>>1;
if(judge(m)) ans=m,r=m-1;
else l=m+1;
}
printf("%d\n",ans);
}
| 0
| 46,257,208
|
#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=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000
#define MOD 10000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define seq vector
signed main(){
int N,M,s,t,c;
cin >> N >> M;
vector< vector<int> > table(N,vector<int>(N,1e9));
vector< vector<int> > edges(M,vector<int>(0));
for(int i=0;i<N;i++){
table[i][i] =0;
}
for(int i=0;i<M;i++){
cin >> s >> t >> c;
s--;t--;
table[s][t] =c;
table[t][s] =c;
edges[i].push_back(s);
edges[i].push_back(t);
edges[i].push_back(c);
}
for(int k=0;k<N;k++){
for(int i=0;i<N;i++){
for(int j=0;j<N;j++ ){
if(table[i][j] > table[i][k]+table[k][j])
table[i][j] = table[i][k]+table[k][j];
}
}
}
int count =0;
for(auto i : edges){
s=i[0];
t=i[1];
c=i[2];
if (table[s][t] != c)
count++;
}
cout << count << endl;
}
|
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int H, W, D;
cin >> H >> W >> D;
map<int ,P> m;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
int a;
cin >> a;
m[a] = make_pair(i, j);
}
}
map<int, int> sum;
for(int i=1; i<=H*W; i++){
if(sum.count(i) != 0) continue;
int now = i;
sum[now] = 0;
P prev = m[now];
now += D;
while(now <= H*W){
P next = m[now];
sum[now] += sum[now-D] + abs(prev.first-next.first) + abs(prev.second-next.second);
prev = next;
now += D;
}
}
int Q;
cin >> Q;
int ans[Q];
for(int i=0; i<Q; i++){
int l, r;
cin >> l >> r;
ans[i] = sum[r] - sum[l];
}
for(int i=0; i<Q; i++){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 43,162,027
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
#define bl bool
#define nn printf("\n");
#define mod 1000000007
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X)
{
if (N == 0) { break; }
vector<int> dat(N + 2, 0);
rep(i, N) { cin >> dat[i]; }
int i = 0, j = 0;
while (1)
{
if (j > 10000) { printf("-1\n"); break; }
else if (X == dat[i])
{
if (i == N - 1) { printf("%d\n", j); break; }
i++;
}
j++;
X = (A * X + B) % C;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int table[2][100005] = {0};
for(int i=0; i<n; i++){
int v; cin >> v;
table[i%2][v]++;
}
vector<pair<int, int>> ruia, ruib;
for(int i=0; i<1e5+5; i++){
if(table[0][i]) ruia.push_back({table[0][i], i});
if(table[1][i]) ruib.push_back({table[1][i], i});
}
sort(ruia.rbegin(), ruia.rend());
sort(ruib.rbegin(), ruib.rend());
long ans = 0;
if(ruia[0].second == ruib[0].second){
if(ruia.size() == 1 && ruib.size() == 1)
ans = n / 2;
else if(ruia.size() == 1)
ans = n/2 - ruib[1].first;
else if(ruib.size() == 1)
ans = n/2 - ruia[1].first;
else
ans = min(n/2-ruib[0].first+n/2-ruia[1].first, n/2-ruia[0].first+n/2-ruib[1].first);
}else{
ans = n/2-ruia[0].first + n/2-ruib[0].first;
}
cout << ans << endl;
return 0;
}
| 0
| 33,778,951
|
#include<iostream>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p,n,m){
int ans=0,d[n];
double sum=0.0;
for(int i=0;i<n;i++){
cin>>d[i];
sum+=d[i];
}
sum*=100;
sum-=sum*(p*1.0/100);
if(d[m-1]){
ans=sum/d[m-1];
cout<<ans<<endl;
}
else
cout<<0<<endl;
}
}
|
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
const ll inf = 1000000001;
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T &t)
{
t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &... rest)
{
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &... rest)
{
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void out(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void out(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
ll gcd(ll a, ll b)
{
while (b)
{
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b)
{
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.end(), x.begin()
#define range(a) a.begin(), a.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
#define sz(x) (int)(x).size()
int mx = -100000;
int mn = 1001001001;
int n, a, c[100009];
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> a, c[a]++;
int ret = 0;
for (int i = 0; i <= 100000; i++)
ret = max(ret, c[i] + c[i + 1] + c[i + 2]);
out(ret);
return 0;
}
| 0
| 70,664,680
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.