code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(-1.0L);
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; }
string s;
vector<int> alp(26, 0);
int main() {
alp['y'-'a']++;
alp['u'-'a']++;
alp['i'-'a']++;
alp['o'-'a']++;
alp['p'-'a']++;
alp['h'-'a']++;
alp['j'-'a']++;
alp['k'-'a']++;
alp['l'-'a']++;
alp['n'-'a']++;
alp['m'-'a']++;
while(1) {
cin >> s;
if(s == "#") break;
int slen = s.length();
int now = 0;
int cnt = 0;
for(int i = 0; i < slen; ++i) {
if(i == 0) now = alp[s[i]-'a'];
else {
int ch = alp[s[i]-'a'];
if(now != ch) cnt++;
now = ch;
}
}
cout << cnt << endl;
}
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
int ans = 100000;
int k = N/9;
for(int i = 0; i <= k; i++){
int x = i;
int y = (N-9*x)/6;
int z = N-9*x-6*y;
int countx = 0;
int county = 0;
while(x>0){
countx += x%9;
x /= 9;
}
while(y>0){
county += y%6;
y /= 6;
}
ans = min(ans, countx+county+z);
}
cout << ans << endl;
}
| 0
| 24,161,429
|
#include <iostream>
#include <vector>
#include <cstdlib>
#include <math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
#define MOD 1000000007
int N;
long long h[100010];
long long dp[100010];
int main(){
int N; cin >> N;
for(int i = 0; i < 100010; ++i) dp[i] = INF;
dp[0] = 0;
for(int i = 0; i < N; i++){
chmin(dp[i+1], dp[i] + 1);
int n6 = 1;
int n6_num = pow(6, n6);
while((i + n6_num) <= N){
chmin(dp[i+n6_num], dp[i]+1);
n6+=1;
n6_num = pow(6, n6);
}
int n9 = 1;
int n9_num = pow(9, n9);
while((i + n9_num) <= N){
chmin(dp[i+n9_num], dp[i]+1);
n9+=1;
n9_num = pow(9, n9);
}
}
cout << dp[N] << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long n;
vector<long>a;
long ans;
main()
{
cin>>n;
for(int i=0;i<n;i++)
{
long x;cin>>x;a.push_back(x);
}
while(1)
{
sort(a.begin(),a.end(),greater<long>());
if(a[0]<n)break;
long k=0;
while(k+1<n&&a[k+1]+k+1>=n&&a[k]-a[k+1]<n+1)k++;
if(k==n-1)
{
k=0;
while(k+1<n&&a[k+1]+k+1>=n&&a[0]-a[k+1]<=k+1)k++;
}
if(k<n-1)
{
long L=(a[0]-a[k+1])/(1+n);
if(L<=0)L=1;
ans+=L*(k+1);
for(int i=0;i<n;i++)
{
if(i>k)a[i]+=L*(k+1);
else a[i]+=L*(k-n);
}
}
else
{
long L=a[0]-n+1;
if(L>a[n-1])L=a[n-1];
ans+=L*n;
for(int i=0;i<n;i++)a[i]-=L;
}
}
cout<<ans<<endl;
}
| 0
| 54,711,435
|
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(b<a){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill((T*)array, (T*)(array+N), val);}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
class debug
{
public:
template<typename T> void vdeb(T vec);
template<typename T1, typename T2> void adeb(T1 *arr, T2 n);
template<typename T> void mdeb(T mp);
};
#endif
template<typename T> void debug::vdeb(T vec)
{
cout << "#vector set debug" << endl;
for(auto vv : vec) cout << vv << " ";
cout << endl;
}
template<typename T1, typename T2> void debug::adeb(T1 *arr, T2 n)
{
cout << "#adebug" << endl;
for(int i=0; i<=n; i++) cout << arr[i] << " ";
cout << endl;
}
template<typename T> void debug::mdeb(T mp)
{
cout << "#map pair debug" << endl;
for(auto const& m : mp) cout << m.first sp m.second << endl;
}
debug dbg;
class BAtCoderAlloy {
public:
void solve(std::istream& in, std::ostream& out)
{
int n;
ll h, w;
in >> n >> h >> w;
ll a, b;
int res = 0;
for(int i=0; i<n; i++){
in >> a >> b;
if(h <= a && w <= b) res++;
}
out << res << endl;
}
};
int main() {
BAtCoderAlloy solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
string s;
cin >> s;
rep(i,(1 << 3)) {
int x = s[0] - '0';
rep(j,3) {
if (i & (1 << j)) {
x += s[j+1] - '0';
} else {
x -= s[j+1] - '0';
}
}
if (x == 7) {
char op[3];
rep(j,3) {
op[j] = ((i & (1 << j))? '+': '-');
}
rep(j,3) {
printf("%c%c", s[j], op[j]);
}
printf("%c=7\n", s[3]);
return;
}
}
}
int main() {
solve();
return 0;
}
| 0
| 21,226,923
|
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
int N, M;
int main() {
cin >> N >> M;
int a[100000] = {0};
int b[100000] = {0};
rep(i, M) {
int temp;
string res;
cin >> temp >> res;
temp--;
if(res == "WA") {
if(b[temp] == 0) {
a[temp]++;
}
} else {
if(b[temp] == 0) {
b[temp] = 1;
}
}
}
int ans1 = 0, ans2 = 0;
rep(i, N) {
if(b[i] != 0) {
ans1 += a[i];
}
ans2 += b[i];
}
cout << ans2 << " " << ans1 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
LL N;
cin>> N;
for(LL i=sqrt(N);i>0;i--){
if(N%i==0){
i=N/i;
int count=0;
while(i>0){
i/=10;
count++;
}
cout << count << endl;
return 0;
}
}
}
| 0
| 62,981,747
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a,b;
cin >> a >> b;
if(a==b){
cout << a << endl;
return 0;
}
ll res;
if(a%2==0){
ll n=b-a+1;
if(n%4==0) res=0;
else if(n%4==2) res=1;
else if(n%4==1) res=b;
else if(n%4==3) res=1^b;
}
else{
ll n=b-a;
if(n%4==0) res=a;
else if(n%4==2) res=a^1;
else if(n%4==1) res=a^b;
else if(n%4==3) res=a^1^b;
}
cout << res << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m,c[20],dp[50001],i=0,j=0;
cin >> n >> m;
for(i;i<m;i++){
cin >> c[i];
}
sort(c,c+m);
for(i=0;i<=n;i++){
dp[i] = 100000;
}
dp[0]=0;
for(i=0;i<m;i++){
dp[c[i]]=1;
}
for(i=1;i<n+1;i++){
for(j=0;j<m;j++){
if(c[j]>=i) break;
dp[i]=min(dp[i],dp[i-c[j]]+1);
}
}
cout<< dp[n] << endl;
}
| 0
| 86,075,379
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll H, W, M;
scanf("%lld %lld %lld", &H, &W, &M);
vll h_list = vll(300005);
vll w_list = vll(300005);
mll points;
ll h_max = -1;
ll w_max = -1;
for (ll i = 0; i < M; i++) {
ll h, w;
scanf("%lld %lld", &h, &w);
h_list[h]++;
w_list[w]++;
h_max = max(h_max, h_list[h]);
w_max = max(w_max, w_list[w]);
points[h + w * 1000000LL] = 1;
}
vll y_list;
vll x_list;
for (ll i = 0; i < 300005; i++) {
if (h_list[i] == h_max) {
y_list.emplace_back(i);
}
}
for (ll i = 0; i < 300005; i++) {
if (w_list[i] == w_max) {
x_list.emplace_back(i);
}
}
ll ans = h_max + w_max - 1;
for (auto y : y_list) {
for (auto x : x_list) {
if (!points[y + x * 1000000LL]) {
cout << ans + 1 << endl;
return 0;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
int N, M; cin >> N >> M;
vector<ll> X(N), Y(N), Z(N); for(int i = 0; i < N; i++) cin >> X[i] >> Y[i] >> Z[i];
ll Max = 0;
for(int f1 = 0; f1 < 2; f1++){
for(int f2 = 0; f2 < 2; f2++){
for(int f3 = 0; f3 < 2; f3++){
vector<ll> ABS(N);
for(int i = 0; i < N; i++){
ll temp=0;
if(f1) temp += X[i]*(-1);
else temp += X[i];
if(f2) temp += Y[i]*(-1);
else temp += Y[i];
if(f3) temp += Z[i]*(-1);
else temp += Z[i];
ABS[i] = temp;
}
sort(ABS.rbegin(), ABS.rend());
ll tempMax = 0;
for(int i = 0; i < M; i++) tempMax += ABS[i];
Max = max(Max, tempMax);
}
}
}
cout << Max << endl;
}
| 0
| 91,742,009
|
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("No");}
#define printd(x) printf("%.12f\n", x);
template<class T> bool chmin(T& a, const T& b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> bool chmax(T& a, const T& b) {if (a < b) {a = b; return 1;} return 0;}
using namespace std;
using ll = long long;
int main() {
int n, p;
cin >> n >> p;
vector<int> a(n);
rep (i, n) cin >> a[i];
bool haveodd = false;
rep (i, n) if (a[i] % 2) haveodd = true;
cout << (haveodd ? 1LL<<n-1: p ? 0 : 1LL<<n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#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 FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,z,w;
cin >> n >> z >> w;
vll a(n);
REP(i, n)
cin >> a[i];
if(n>=2)
cout << max(abs(a[n-1]-w), abs(a[n-2]-a[n-1])) << endl;
else
cout << abs(a[0]-w) << endl;
}
| 0
| 50,976,067
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,K,h,i,c;
cin>>N>>K;
c = 0;
for(i=0;i!=N;i++)
{
cin>>h;
if(h >= K)
c++;
}
cout<<c;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
int a=1;
cin>>n;
while(true)
{
if(n == 4 || n == 2 || n == 1)
{
cout << a+3 << endl;
break;
}
if(n%2)
{
n = 3*n + 1;
}
else {
n /= 2;
}
a++;
}
}
| 0
| 884,429
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define LL long long
#define mod 1000000007
#define FOR(i, j, k) for (int i=j ; i<k ; i++)
#define ROF(i, j, k) for (int i=j ; i>=k ; i--)
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false); debug("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
const long long INF = 1e18;
const long long MAX = 1e5+10;
int main(){
fastio;
int t=1;
while(t--){
int n ; string s; cin>>s; n=s.size();
stack<char>st;
FOR(i,0,n){
if(st.empty() ) st.push(s[i]);
else {
if(st.top()=='0' && s[i]=='1') {st.pop();continue;}
else if(st.top()=='1' && s[i]=='0') {st.pop();continue;}
else st.push(s[i]);
}
}
cout<<n-st.size();
}
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 350000;
const int K = 19;
int n, q;
int mod = 1e9 + 7;
int s1[N], s2[N], a[N], ans[N], f[N], invf[N];
string t[N], d[N], s;
int binpow(int x, int y){
if (y == 0) return 1;
if (y % 2) return x * binpow(x, y - 1) % mod;
int z = binpow(x, y / 2);
return z * z % mod;
}
int c(int n, int k){
if (k < 0) return 0;
return f[n] * invf[k] % mod * invf[n - k] % mod;
}
int check (int x){
for (int i = 1; i <= q; i++){
if (s[x - 1] == t[i][0]){
if (d[i] == "L"){
if (x == 1) return -1;
x--;
} else{
if (x == n) return 1;
x++;
}
}
}
return 0;
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
for (int i = 1; i <= 3; i++){
int x, y;
cin >> x >> y;
a[x]++;
a[y]++;
}
int x, y;
x = y = 0;
for (int i = 1; i <= 4; i++) if (a[i] == 1) x++; else if (a[i] == 2) y++;
if (x == 2 && y == 2) cout << "YES"; else cout << "NO";
}
| 0
| 88,994,229
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const long long mod = 1000000007;
const long long inf = 1e18;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
vector<char> p,q;
string s,t;
cin>>s>>t;
for(int i=0;i<s.length();i++){
char c=s[i];
p.pb(c);
}
for(int i=0;i<t.length();i++){
char c=t[i];
q.pb(c);
}
sort(p.begin(),p.end());
sort(q.rbegin(),q.rend());
int ans=1;
if(s.length()<t.length()){
for(int i=0;i<s.length();i++){
int a=p[i]-'a';
int b=q[i]-'a';
if(a>b){
ans=0;
break;
}
if(a<b){
ans=1;
break;
}
}
}
else{
ans=0;
for(int i=0;i<t.length();i++){
int a=p[i]-'a';
int b=q[i]-'a';
if(a<b){
ans=1;
break;
}
}
}
if(ans){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define FLASH \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
using namespace std;
const int MAX = 3000000;
const int P = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMBinit()
{
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 % P;
inv[i] = P - inv[P % i] * (P / i) % P;
finv[i] = finv[i - 1] * inv[i] % P;
}
}
int COMB(int n, int k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % P) % P;
}
signed main()
{
COMBinit();
int X, Y;
cin >> X >> Y;
int K = X + Y;
if (K % 3 != 0)
return cout << 0, 0;
int n = (2*Y - X) / 3;
int m = (2*X - Y) / 3;
if (n < 0 || m < 0)
return cout << 0, 0;
cout << COMB(n+m, n);
return 0;
}
| 0
| 100,426,440
|
#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 MOD=1000000007;
int main() {
int n;
cin >> n;
int ans;
if(n/10==0) ans=n;
else if(n/100==0) ans=9;
else if(n/1000==0) ans=n-90;
else if(n/10000==0) ans=909;
else if(n/100000==0) ans=n-90-9000;
else ans=90909;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long double PI = acos(-1);
#define chmin(i, j) i = min(i, j);
#define chmax(i, j) i = max(i, j);
#define rep(i, n) for(int i=0;i<n;i++)
ll MOD = 1000000007;
ll fact(ll m) {
if(m == 0 || m == 1) return 1LL;
else return (m * fact(m-1LL)) % MOD;
}
bool custom(pair<ll, ll> a, pair<ll, ll> b) {
if(a.first == b.first) return (a.second > b.second);
else return a.first < b.first;
}
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
for(int i=0;i<n;i++) cin >> a[i];
map<int, ll> cnt;
ll ans = 0;
vector<ll> total(n);
for(int i=0;i<n;i++) {
if(i == 0) total[i] = a[i];
else total[i] = total[i-1] + a[i];
cnt[total[i]%m]++;
}
for(auto it=cnt.begin();it!=cnt.end();it++) {
ll a = it->second;
if(it->first == 0) ans += a;
ans += a * (a-1) / 2;
}
cout << ans << endl;
}
| 0
| 41,670,802
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define eb emplace_back
#define pi pair<int,int>
#define vp vector<pair<int,int>>
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a,0,sizeof(a))
#define Yes(f) cout<<(f?"Yes":"No")<<endl
#define yes(f) cout<<(f?"yes":"no")<<endl
#define YES(f) cout<<(f?"YES":"NO")<<endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod=1e9+7;
const string sp=" ";
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(12);
}
signed main(){
init();
run();
return 0;
}
void run(){
int n,k;
cin>>n>>k;
int m=(n-1)*(n-2)/2;
if(m<k){
cout<<-1<<endl;
return;
}
cout<<(n-1)+m-k<<endl;
REP(i,2,n)cout<<1<<sp<<i<<endl;
int cnt=m-k;
REP(i,2,n){
REP(j,i+1,n){
if(!cnt)return;
cout<<i<<sp<<j<<endl;
cnt--;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
long long sum=0;
vector<long long>A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
A.at(i)=A.at(i)-(i+1);
}
sort(A.begin(),A.end());
long long b=0;
if(N%2==1){
if(N==1){
b=A.at(0);
}
else{
b=A.at(N/2);
}
for(int i=0;i<N;i++){
sum=sum+abs(A.at(i)-b);
}
}
else{
b=(A.at(N/2)+A.at(N/2-1))/2;
long long c=A.at(N/2);
long long d=A.at(N/2-1);
for(int i=0;i<N;i++){
sum=sum+abs(A.at(i)-b);
}
long long sum2=0;
long long sum3=0;
for(int i=0;i<N;i++){
sum2=sum2+abs(A.at(i)-c);
}
for(int i=0;i<N;i++){
sum3=sum3+abs(A.at(i)-d);
}
sum=min(sum,min(sum3,sum2));
}
cout<<sum<<endl;
}
| 0
| 66,679,940
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long t,a,k;
cin>>t>>a>>k;
if(k<=t)
{
t=t-k;
k=0;
}
else
{
k=k-t;
t=0;
}
if(k<=a)
{
a=a-k;
k=0;
}
else
{
k=k-a;
a=0;
}
cout<<t<<" "<<a;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; cin>> n;
vector<int> a(100000);
map<int, int> mp;
int MAX=0;
int MIN = 1000000000;
for(int i=0; i<n; i++){
cin >> a[i];
MAX = max(MAX, a[i]);
MIN = min(MIN, a[i]);
if(!mp.count(a[i])){
mp[a[i]]=1;
}else{
mp[a[i]]++;
}
}
int ans = 0;
for (auto p: mp) {
int x = p.first;
int n = p.second;
if (n < x) ans += n;
else ans += n - x;
}
cout << ans << endl;
return 0;
}
| 0
| 97,806,929
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
sort(S.begin(), S.end());
sort(T.begin(), T.end());
reverse(T.begin(), T.end());
if(S < T) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define INF (int)1e7
class Graph{
typedef pair<int, int> p;
int V;
list<p> *adj;
public:
Graph(int V){
this->V = V;
adj = new list<p> [V];
}
void addEdge(int u, int v, int w){
adj[u].push_back(make_pair(v, w));
}
bool route(lli from, lli to){
vector<lli> vec(V, -1);
dfs(1,from,vec);
return vec[to] >= 0;
}
void dfs(lli ed, lli num, vector<lli>& vec){
for(auto e: adj[num]){
if(vec[e.first] != -1)continue;
vec[e.first] = num;
dfs(ed+1, e.first, vec);
}
}
vector<int> bfs(int n){
queue<int> q;
vector<int> vec(V,-1);
q.push(n);
vec[n]=0;
while(!q.empty()){
int p=q.front();
q.pop();
for(auto e:adj[p]){
if(vec[e.first]==-1){
q.push(e.first);
vec[e.first] = e.second + vec[p];
}
}
}
return vec;
}
vector<int> shortestPath(int src){
priority_queue< p, vector <p> , greater<p> > pq;
vector<int> dist(V, INF);
pq.push(make_pair(0, src));
dist[src] = 0;
while (!pq.empty()) {
int u = pq.top().second;
pq.pop();
list< pair<int, int> >::iterator i;
for (i = adj[u].begin(); i != adj[u].end(); ++i) {
int v = (*i).first;
int weight = (*i).second;
if (dist[v] > dist[u] + weight) {
dist[v] = dist[u] + weight;
pq.push(make_pair(dist[v], v));
}
}
}
for(int i=0;i<V;i++)if(dist[i]==INF)dist[i]=-1;
return dist;
}
};
bool cmpf(const pair<lli, lli> left, const pair<lli, lli> right) {
return left.first< right.first;
}
bool cmps(const pair<lli, lli> left, const pair<lli, lli> right) {
return left.second < right.second;
}
void dfs(lli ed, lli num, vector<map<lli,lli>>& vec){
lli n=1;
for(auto e: vec[num]){
if(n == ed)n++;
if(e.second != -1)continue;
vec[num][e.first] = n;
vec[e.first][num] = n;
dfs(n, e.first, vec);
n++;
}
}
lli gcd(lli a, lli b){
if(a < b)return gcd(b, a);
lli temp;
while((temp = a%b)){
a=b;
b=temp;
}
return b;
}
struct nCr{
vector<lli> f, rf;
lli count=0;
nCr(lli num): f(num), rf(num){
count = num;
f[0] = 1;
rep1(i, num) f[i] = (f[i - 1] * i) % MOD;
rep0(i, num+1) rf[i] = inv(f[i]);
}
lli inv(lli x) {
lli res = 1;
lli k = MOD - 2;
lli y = x;
while (k) {
if (k & 1) res = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
lli C(lli n, lli k) {
lli a = f[n];
lli b = rf[n-k];
lli c = rf[k];
lli bc = (b * c) % MOD;
return (a * bc) % MOD;
}
};
struct UF{
vector<int> par,size;
UF(int N) : par(N), size(N, 1){
rep0(i,N)par[i] = i;
}
int root(int x){
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if(rx == ry) return;
par[rx] = ry;
size[rx] += size[ry];
}
bool same(int x, int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int getSize(int x){
return size[x];
}
};
int main(){
lli n;
cin >> n;
vector<lli> vec(n+1);
rep1(i,n)cin >>vec[i];
sort(all(vec));
lli ans=0, size=0;
rep1(i,n){
if(vec[i] > 2 * size)ans=0;
size+=vec[i];
ans++;
}
cout << ans;
}
| 0
| 91,994,697
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
map<int,int> A;
for(int i=0;i<N;i++){
int a;
cin>>a;
A[a]++;
}
int j=0;
for(pair<int,int> p:A)
if(p.second>=p.first)
j+=p.second-p.first;
else
j+=p.second;
cout<<j<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
int dxy[] = {0, 1, 0, -1, 0};
void solve();
signed main()
{
#if DEBUG
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
#if DEBUG
#define SIZE 333
#else
#define SIZE 333
#endif
int N,K;
int DP[SIZE][SIZE][SIZE];
int LAST = SIZE-1;
int H[SIZE];
void solve() {
cin>>N>>K;
REP(i,N)cin>>H[i];
REP(i,N)REP(k,K+1)REP(j,SIZE) {
DP[i][k][j] = LONG_LONG_MAX/3;
}
if (K) DP[0][K-1][LAST] = 0;
DP[0][K][0] = H[0];
FOR(i,1,N)REP(k,K+1)FOR(_j,-1,i) {
int j = (_j<0) ? LAST : _j;
if (k<K) DP[i][k][j] = min(DP[i][k][j], DP[i-1][k+1][j]);
int lastH = (_j<0) ? 0 : H[_j];
DP[i][k][i] = min(DP[i][k][i], DP[i-1][k][j] + max(0LL, H[i]-lastH));
}
int ans = LONG_LONG_MAX;
REP(k,K+1)FOR(_j,-1,N) {
int j = (_j<0) ? LAST : _j;
ans = min(ans, DP[N-1][k][j]);
}
cout << ans << endl;
}
| 0
| 16,137,588
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i=0; i<N; i++) cin >> d[i];
ll ans = 0;
for (int i=0; i<N-1; i++) {
for (int j=i+1; j<N; j++) {
ans += d[i]*d[j];
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N, T;
cin >> N >> T;
vll t(N);
rep(i, 0, N) cin >> t[i];
if (N == 1) {
cout << T << endl;
return 0;
}
ll sm = T * N;
vll diff(N - 1);
rep(i, 0, N-1) {
diff[i] = t[i+1] - t[i];
}
ll tmp = 0;
rep(i, 0, N-1) {
if (diff[i] < T) {
tmp += T - diff[i];
}
}
cout << sm - tmp << endl;
}
| 0
| 50,913,776
|
#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 t, x;
cin >> t >> x;
double ans = (double)t / x;
printf("%.10f\n", ans);
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
int n;
cin >> n;
if (n == 1)
{
cout << "Yes" << endl << "2" << endl;
cout << "1 1" << endl;
cout << "1 1";
return 0;
}
for (int il = 2; il <= n; ++il)
{
if ((1 + (il - 1)) * (il - 1) / 2 == n)
{
cout << "Yes" << endl << il << endl;
vector< vector<int> > a(il);
int nr = 1;
for (int i = 0; i < il - 1; ++i)
{
for (int j = i + 1; j < il; ++j)
{
a[i].push_back(nr);
a[j].push_back(nr);
++nr;
}
}
for (int i = 0; i < il; ++i)
{
cout << a[i].size() << " ";
for (int j = 0; j < a[i].size(); ++j)
cout << a[i][j] << " ";
cout << endl;
}
return 0;
}
}
cout << "No";
return 0;
}
| 0
| 26,357,866
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
if (N&1) {
cout << 0 << '\n';
return 0;
}
ll ans = 0;
ll cur = 10;
while (N/cur) {
ans += N/cur;
cur *= 5;
}
cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 9223372036854775807
#define MOD 1000000007
#define P pair<int,int>
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
signed main(){
int n,k;
cin >> n >> k;
vint x(n);
vint y(n);
vint xary(n);
vint yary(n);
rep(i,0,n){
cin >> x[i] >> y[i];
xary[i] = x[i];
yary[i] = y[i];
}
int ans = INF;
sort(xary.begin(),xary.end());
sort(yary.begin(),yary.end());
rep(xi,0,n){
rep(xj,xi+1,n){
rep(yi,0,n){
rep(yj,yi+1,n){
int tmp = 0;
rep(s,0,n){
if(xary[xi] <= x[s] && x[s] <= xary[xj] && yary[yi] <= y[s] && y[s] <= yary[yj]){
tmp++;
}
if(tmp >= k){
ans = min(ans,(xary[xj] - xary[xi])*(yary[yj] - yary[yi]));
}
}
}
}
}
}
cout << ans << endl;
}
| 0
| 82,598,179
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(int i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };
namespace {
template<typename T> void chmax(T& a, T b) { a = std::max(a, b); }
template<typename T> void chmin(T& a, T b) { a = std::min(a, b); }
template<typename T> void chadd(T& a, T b) { a = a + b; }
void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
void CCout(long long x, const char* end = "\n") { std::cerr << x << end; }
template <typename T> void CCout(const T& x, const char* end = "\n") { std::cerr << x << end; }
template <typename T> void CCout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cerr << x[i] << (i == sz - 1 ? end : sep); } }
struct inp {
std::size_t sz;
inp(std::size_t _sz = 1) : sz(_sz) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { vector<T> a(sz); for (std::size_t i = 0; i < sz; i++) std::cin >> a[i]; return a; }
template <typename T, typename U> operator std::pair<T, U>() const { T f; U s; std::cin >> f >> s; return std::pair<T, U>(f, s); }
};
inp inp1;
}
int main() {
string l = inp1;
size_t n = l.length();
vector<vector<ll>> dp(n + 1, vector<ll>(2, 0));
dp[0][1] = 1;
rep(i, n) {
dp[i + 1][0] += dp[i][0];
dp[i + 1][0] += dp[i][0] * 2;
int d = l[i] - '0';
if (d == 0) {
dp[i + 1][1] += dp[i][1];
}
else {
dp[i + 1][0] += dp[i][1];
dp[i + 1][1] += dp[i][1] * 2;
}
dp[i + 1][0] %= mod;
dp[i + 1][1] %= mod;
}
cerr << dp[n][0] << ", " << dp[n][1] << '\n';
Cout((dp[n][0] + dp[n][1]) % mod);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t,u,v;
cin >> s >> t >> u >> v;
string w = s+t+u+v;
int n=0;
int o=0;
int p=0;
int q=0;
for(int i=0;i<4;i++){
if(w.at(i)=='1'){
n++;
}
else if(w.at(i)=='9'){
o++;
}
else if(w.at(i)=='7'){
p++;
}
else if(w.at(i)=='4'){
q++;
}
}
if(n==1&&o==1&&p==1&&q==1){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
| 0
| 92,646,320
|
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, n) { cin >> a[i]; }
ll s[n + 1];
s[0] = 0;
rep(i, n) { s[i + 1] = s[i] + a[i]; }
ll judge[n + 1];
rep(i, n + 1) { judge[i] = (s[i] - i) % k; }
map<ll, ll> num;
ll ans = 0;
rep(i, n + 1) {
ans += num[judge[i]];
num[judge[i]]++;
ll index = i - k + 1;
if (index >= 0) {
num[judge[index]]--;
}
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
bool prime(int cur)
{
if(cur==1||cur==0)return false;
for(int i=2;i<=sqrt(cur);i++)
{
if(cur%i==0)
{
return false;
}
}
return true;
}
int cnt[1000005];
int main()
{
for(int i=1;i<=1000005;i++)
{
if(prime(i))cnt[i]=cnt[i-1]+1;
else cnt[i]=cnt[i-1];
}
int n;
while(scanf("%d",&n)!=EOF)
{
cout<<cnt[n]<<endl;
}
return 0;
}
| 0
| 83,642,166
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
string s; cin >> s;
string t; cin >> t;
int cnt=0;
bool flg = false;
for(int i=0; i<s.length(); i++){
string s_sub = s.substr(i, s.length()-i);
for(int j=0; j<t.length(); j++){
string t_sub = t.substr(0, t.length()-j);
if(s_sub==t_sub){
cnt = s_sub.length(); flg = true;
break;
}
}
if(flg) break;
}
string res = s + t.substr(cnt, t.length()-cnt);
int ans = res.length();
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string S; int N; int count;
cin >> N >> S;
for (int i=0;i<1000;i++){
int a[3]={i/100, (i/10)%10, i%10};
int kakutei=0;
for (int j=0; j<N;j++){
if(S[j]==('0'+a[kakutei])){
kakutei++;
}
if(kakutei==3){
break;
}
}
if(kakutei==3){
count++;
}
}
cout << count << endl;
}
| 0
| 93,934,053
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
void Digvijay()
{
int n;
cin>>n;
vector<int> a(n);
for(auto& it:a)cin>>it;
int val=1;
bool ok=false;
for(int i=0;i<n;i++)
{
if(a[i]==val)
{
ok=true;
val++;
}
}
if(ok)
{
cout<<n-val+1<<"\n";
}
else
{
cout<<-1<<"\n";
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int _=1;
for(int __=0;__<_;__++)
{
Digvijay();
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
string s;
cin >> n >> s;
int a[26] = {};
for (int i = 0; i < n; i++) {
a[s[i] - 'a']++;
}
const int mod = 1'000'000'007;
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= a[i] + 1;
ans %= mod;
}
cout << ans - 1 << endl;
return 0;
}
| 0
| 52,569,112
|
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
#include <functional>
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
ll dp[MAX_N];
int main(){
int n,m;
cin>>n>>m;
vector<int> a(m);
int num[]={0,2,5,5,4,5,6,3,7,6};
for(int i=0;i<m;i++) cin>>a[i];
sort(a.begin(),a.end(),greater<int>());
for(int i=0;i<=n;i++){
dp[i]=-INF;
}
dp[0]=0;
for(int i=1;i<=n;i++){
for(int j=0;j<m;j++){
if(i-num[a[j]]>=0) dp[i]=max(dp[i],dp[i-num[a[j]]]+1);
}
}
string s;
while(n>0){
for(int j=0;j<m;j++){
if(n-num[a[j]]>=0){
if(dp[n]==dp[n-num[a[j]]]+1){
s+=to_string(a[j]);
n-=num[a[j]];
break;
}
}
}
}
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 FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T>
void printlnVector(T v)
{
rep(i, v.size())
{
cout << v[i] << endl;
}
}
template <typename T>
void printVector(T v)
{
rep(i, v.size())
{
cout << v[i] << " ";
}
cout << endl;
}
int main()
{
int N;
cin >> N;
vector<int> T(N), A(N);
rep(i, N)
{
cin >> T[i];
}
rep(i, N)
{
cin >> A[i];
}
bool is_ok = true;
vector<int> mountain_hight(N, -1);
mountain_hight[0] = T[0];
rep(i, N - 1)
{
if(T[i] < T[i + 1])
mountain_hight[i + 1] = T[i + 1];
}
REVERSE(A);
REVERSE(mountain_hight);
rep(i, N)
{
if(mountain_hight[i] != -1 && mountain_hight[i] > A[i])
is_ok = false;
}
if(mountain_hight[0] == -1)
mountain_hight[0] = A[0];
else if(mountain_hight[0] != A[0])
is_ok = false;
rep(i, N - 1)
{
if(A[i] < A[i + 1])
{
if(mountain_hight[i + 1] == -1)
mountain_hight[i + 1] = A[i + 1];
else if(mountain_hight[i + 1] != A[i +1])
is_ok = false;
}
}
if(!is_ok)
{
cout << 0 << endl;
return 0;
}
REVERSE(A);
REVERSE(mountain_hight);
int mod = 1e9 + 7;
long long ans = 1;
rep(i, N)
{
if(mountain_hight[i] == -1)
{
ans *= min(T[i], A[i]);
ans %= mod;
}
}
cout << ans << endl;
return 0;
}
| 0
| 72,418,363
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,int>P;
int n;
P d[200000];
vector<int>E[200000];
int sz[200000];
ll dp1[200000];
vector<pair<int,int>>ans;
void dfs1(int v){
for(int u:E[v]){
dfs1(u);
ans.push_back({v+1,u+1});
dp1[v]+=dp1[u]+sz[u];
}
}
int main(){
scanf("%d",&n);
rep(i,n){
scanf("%lld",&d[i].first);
d[i].second=i;
}
rep(i,n)sz[i]=1;
sort(d,d+n);
for(int i=n-1;i>0;i--){
ll c=d[i].first-n+2*sz[d[i].second];
int id=lower_bound(d,d+n,P(c,0))-d;
if(id==n||d[id].first!=c){
puts("-1");return 0;
}
E[d[id].second].push_back(d[i].second);
sz[d[id].second]+=sz[d[i].second];
}
dfs1(d[0].second);
if(dp1[d[0].second]!=d[0].first){
puts("-1");return 0;
}
for(auto p:ans){
printf("%d %d\n",p.first,p.second);
}
}
|
#include<iostream>
#include<cmath>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<climits>
#include<deque>
#include<tuple>
#include<iomanip>
using namespace std;
#define int int64_t
#define double long double
#define vi vector<int>
#define di deque<int>
#define si set<int>
#define vpii vector<pair<int,int>>
#define pi pair<int,int>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define PI 3.1415926535897932384626433832795
#define read(a) for(auto& x:a) cin>>x
#define speak(a) for(auto x:a) cout<<x<<' '
#define rep(i,s,n) for(int i=s;i<n;++i)
#define repe(i,s,n) for(int i=s;i<=n;++i)
#define repr(i,n,s) for(int i=n;i>=s;--i)
#define endl '\n'
#define gap ' '
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define MOD 1000000007
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,x;cin>>n;
si s;
rep(i,0,n) cin>>x,s.insert(x);
cout<<(s.size()==n?"YES":"NO");
}
| 0
| 29,779,815
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <limits>
const int N = 102;
long m[N][N], p[N+1];
int matrixChainOrder(int n){
for(int i=1; i<n; i++){ m[i][i] = 0; }
for(int l=2; l<n; l++){
for(int i=1; i < n - l + 1; i++){
int j = i+l-1;
m[i][j] = std::numeric_limits<long>::max();
for(int k=i; k<=j-1; k++){
m[i][j] = std::min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]);
}
}
}
return m[1][n - 1];
}
int main(){
int n ;
std::cin >> n;
for(int i=1; i<=n; i++){
std::cin >> p[i-1] >> p[i];
}
std::cout << matrixChainOrder(n + 1) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
void solve()
{
int a, b, c;
cin >> a >> b >> c;
cout << max({a, b, c}) - min({a, b, c}) << endl;
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
| 0
| 91,584,115
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#include <cstring>
#include <random>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl '\n'
#define try tr
#define pii pair<int, int>
#define ti tuple <int, int, int>
#define vi vector <int>
#define vpi vector <pii>
#define umap unordered_map
#define uset unordered_set
#define left left11
#define right right11
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define sqr(a) ((a) * (a))
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fs first
#define sc second
ld TL = 0.25;
bool is_tl = 0;
int CALLS = 0;
inline bool IS() {
if (++CALLS == 1000) {
CALLS = 0;
is_tl |= clock() > (TL - 0.1) * CLOCKS_PER_SEC;
}
return is_tl;
}
template<typename T1, typename T2>
inline void amin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2>
inline void amax(T1 &a, T2 b) { if (a < b) a = b; }
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << ' ' << p.second << endl;
return os;
}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &u : v) os << u << ' ';
os << endl;
return os;
}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 1e6 + 7, NS = 2e3 + 7, lg = 19, sq = 550, inf = 1e18 + 7, SM = 1e2 + 7;
const ld eps = 1e-9;
int hash_mod[4] = {1000000007, 998244353, 1000000009, 999999937}, mod = hash_mod[rnd() % 4];
int hash_pows[4] = {179, 239, 1007, 2003}, P = hash_pows[rnd() % 4];
void solve() {
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(all(a));
int l = -1, r = n - 1, m;
while(r - l > 1) {
m = (l + r) / 2;
int sum = 0;
for (int i = 0; i <= m; i++)
sum += a[i];
bool f = 1;
for (int i = m + 1; i < n; i++) {
if(a[i] > sum * 2)
f = 0;
else
sum += a[i];
}
if(f)
r = m;
else
l= m;
}
cout << n - r;
}
signed main() {
fast
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF = 10010001010;
const int inf = 1000034000;
typedef vector<ll> vecl;
typedef vector<int> veci;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
uintmax_t combination(unsigned int n, unsigned int r)
{
if (r * 2 > n)
r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for (unsigned int i = 1; i <= r; ++i)
{
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string S;
cin >> S;
for (int i = 0; i < S.size();i+=2)
{
cout << S[i];
}
cout << endl;
}
| 0
| 48,736,699
|
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
int odd = (m + 1) / 2;
int even = m / 2;
std::vector<int> a(m), b(m);
int p = 1;
for (int i = 0; i < odd; ++i)
a[i] = p++;
for (int i = odd; i-- > 0;)
b[i] = p++;
for (int i = 0; i < even; ++i)
a[odd + i] = p++;
++p;
for (int i = even; i-- > 0;)
b[odd + i] = p++;
for (int i = 0; i < m; ++i)
std::cout << a[i] << " " << b[i] << "\n";
}
|
#include "bits/stdc++.h"
using namespace std;
long long P_is_not_2_5(long long N, long long P, const string& S) {
map<long long, long long> residual;
residual.insert(make_pair(0LL, 1LL));
long long pow10 = 1;
long long curr = 0LL;
for (long long i = N - 1; i >= 0; --i) {
curr += pow10 * (long long)atoi(S.substr(i, 1).c_str());
curr %= P;
if (residual.count(curr) == 0) {
residual.insert(make_pair(curr, 0LL));
}
residual[curr] += 1;
pow10 *= 10;
pow10 %= P;
}
long long ans = 0;
for (auto it : residual) {
long long n = it.second;
if (n >= 2) {
ans += n * (n - 1) / 2;
}
}
return ans;
}
long long P_is_2_or_5(long long N, long long P, const string& S) {
long long ans = 0LL;
for (long long i = 0; i < N; ++i) {
long long c = (long long)atoi(S.substr(i, 1).c_str());
if (c % P == 0) {
ans += i + 1;
}
}
return ans;
}
void Main() {
long long N, P;
cin >> N >> P;
string S;
cin >> S;
long long ans = 0LL;
if (P == 2LL || P == 5LL) {
ans = P_is_2_or_5(N, P, S);
}
else {
ans = P_is_not_2_5(N, P, S);
}
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 0
| 98,022,918
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
int ii() { int x; if (scanf("%d", &x) == 1) return x; }
long long il() { long long x; if (scanf("%lld", &x) == 1) return x; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); }
void od(double x) { printf("%.15f ", x); }
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}}
void br() { putchar('\n'); }
#define gcd __gcd
int lcm(int a, int b){return a / gcd(a, b) * b;}
#define begin_end(a) a.begin(),a.end()
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; i++ )
#define rep(i,n) REP(i,0,n)
#define m_p(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define p_b push_back
#define SZ(x) ((int)(x).size)
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
int main(){
ll N, K;
cin >> N >> K;
vector<ll> runlength_buckets(100001, 0);
rep(i, N){
ll a = il();
ll b = il();
runlength_buckets[a] += b;
}
ll k = 0;
REP(i, 1, 100001){
ll len = runlength_buckets[i];
if (k + len >= K){
cout << i << endl;
return (0);
}
k += len;
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 1000000007;
const int inf = (1 << 21);
const long long INF = 1LL << 60;
using ii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vii = vector<pair<int, int>>;
using vll = vector<pair<ll, 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; }
template<class T>
inline T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template<class T>
inline T LCM(T a, T b) { return (a + (b - 1)) / b; }
template<class T>
inline T round_int(T a, T b) {return (a + (b - 1)) / b; }
constexpr array<int, 9> dx = { 0, 1, 0, -1, -1, 1, 1, -1, 0 };
constexpr array<int, 9> dy = { 1, 0, -1, 0, 1, 1, -1, -1, 0 };
int gra[110][110];
int main() {
int a, b;
cin >> a >> b;
if (!a) {
cout << "1 1" << endl << "#" << endl;
}
if (!b) {
cout << "1 1" << endl << "." << endl;
}
cout << "100 100" << endl;
for (int i = 1; i <= 100; ++i) {
for (int j = 1; j <= 100; ++j) {
if (i <= 50) gra[i][j] = 0;
else gra[i][j] = 1;
}
}
a--, b--;
for (int i = 1; i <= 50 && b; i += 2) {
for (int j = 1; j <= 100 && b; j += 2) {
gra[i][j] = 1;
b--;
}
}
for (int i = 1; i <= 50 && a; i += 2) {
for (int j = 1; j <= 100 && a; j += 2) {
gra[101 - i][j] = 0;
a--;
}
}
for (int i = 1; i <= 100; ++i) {
for (int j = 1; j <= 100; ++j) {
if (gra[i][j] == 1) {
cout << "#";
}
else cout << ".";
}
cout << endl;
}
}
| 0
| 93,243,808
|
#include<bits/stdc++.h>
using namespace std;
int gcd(int n, int m){
if(n%m==0) return m;
else return gcd(m, n%m);
}
int main(){
long long a,b; int g; cin>>a>>b; g = gcd(a, b);
long long ans = a*b/g;
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define bg begin()
#define en end()
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
static const long long MOD = 1000000007;
static const long long LINF = (long long)(1e18+99);
static const int INF = 1000000099;
ll n, a[10005], b[10005];
int main(void) {
cin >> n;
ll suma = 0, sumb = 0;
rep(i, 0, n) {cin >> a[i]; suma += a[i];}
rep(i, 0, n) {cin >> b[i]; sumb += b[i];}
ll t = sumb - suma;
if (t<0) {
puts("No");
return 0;
}
ll ax = 0, bx = 0;
rep (i, 0, n) {
ll d = b[i] - a[i];
if (d<0) {
bx += d*-1;
} else {
if (d%2!=0) {
ax += d + 1;
bx++;
} else {
ax += d;
}
}
}
ll at = t*2 - ax;
ll bt = t - bx;
if (at>=0 && bt>=0 && at==bt) puts("Yes");
else puts("No");
return 0;
}
| 0
| 98,531,306
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n, k; cin >> n >> k;
vector<int> l(n);
rep(i,n) cin >> l[i];
sort(RALL(l));
int sum = 0;
rep(i,k) sum += l[i];
cout << sum << endl;
}
|
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sz(v) ((int)v.size())
#define lgt(s) ((int)s.length())
#define int long long
using namespace std;
class Solver{
public:
void test(){
{
this->solve();
}
}
void solve(){
int x,n;
cin>>x>>n;
if(n == 0){
cout<<x<<endl;
return;
}
if(n == 1){
int t;
cin>>t;
if(t == x){
cout<<x-1<<endl;
}else{
cout<<x<<endl;
}
return;
}
multiset < int > s;
for(int i=0; i<n; ++i){
int p;
cin>>p;
s.insert(p);
}
int lx=x, rx=x;
auto t = s.find(x);
if(t == s.end()){
cout<<x<<endl;
}else{
while(s.find(rx)!=s.end()){
++rx;
}
while(s.find(lx)!=s.end()){
--lx;
}
if(x-lx == rx-x){
cout<<lx<<endl;
}else{
if(x-lx < rx-x){
cout<<lx<<endl;
}else{
cout<<rx<<endl;
}
}
}
}
};
int32_t main(){
IOS;
Solver S;
S.test();
return 0;
}
| 0
| 16,399,930
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
string s; cin >> s;
if (s.size() < 26) {
set<char> st;
string alps = "abcdefghijklmnopqrstuvwxyz";
REP(i, alps.size()) {
if (s.find(alps[i]) == string::npos) {
cout << s << alps[i] << endl;
return 0;
}
}
} else if (s == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 << endl;
} else {
string nxt = s;
next_permutation(nxt.begin(), nxt.end());
REP(i, 26) {
if (s[i] == nxt[i]) {
cout << s[i];
} else {
cout << nxt[i] << endl;
return 0;
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define ll long long int
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
using namespace std;
int mx8[] = {0,0,1,-1,-1,1,-1,1};
int my8[] = {-1,1,0,0,-1,-1,1,1};
int mx4[] = {1,-1,0,0};
int my4[] = {0,0,-1,1};
int main() {
string s; cin >> s;
if(s == "keyence"){cout << "YES" << endl; return 0;}
int n = s.size();
bool ok = false;
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
string S = "";
for(int k = 0; k < i; k++){
S += s[k];
}
for(int k = j+1; k < n; k++){
S += s[k];
}
if(S=="keyence") ok = true;
}
}
if(ok) cout << "YES" << endl;
else cout << "NO" << endl;
}
| 0
| 50,235,970
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M=1000000007;
const ll MM=998244353;
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
if(a<=0)return 0;
a%=m;
if(!b)return 1;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
template<typename T,typename F>
void chmax( T &a,F b){
if(b>a)a=b;
}
template<typename T,typename F>
void chmin( T &a,F b){
if(b<a)a=b;
}
const ll N=1e5+5;
struct segtree{
ll size;
vl sums;
void init(ll n){
size=n+1;
sums.resize(2*size,0);
}
void allot(ll n){
size=1;
while(size<=n)size*=2;
sums.resize(2*size,0);
}
void build(vl& a,ll x,ll lx,ll rx){
if((rx-lx)==1)
{
if( lx<sz(a))
sums[x]=a[lx];
return;
}
ll m=(lx+rx)/2;
build(a,2*x+1,lx,m);
build(a,2*x+2,m,rx);
sums[x]=sums[2*x+2]+sums[2*x+1];
}
void build(vl& a){
build(a,0,0,size);
}
void add(ll i,ll v,ll x,ll lx,ll rx){
if(rx-lx==1){
sums[x]+=v;
return;
}
ll m=(lx+rx)/2;
if(i<m)add(i,v,2*x+1,lx,m);
else add(i,v,2*x+2,m,rx);
sums[x]=sums[2*x+1]+sums[2*x+2];
}
void add(ll i, ll v){
add(i,v,0,0,size);
}
void set(ll i,ll v,ll x,ll lx,ll rx){
if(rx-lx==1){
sums[x]=v;
return;
}
ll m=(lx+rx)/2;
if(i<m)set(i,v,2*x+1,lx,m);
else set(i,v,2*x+2,m,rx);
sums[x]=sums[2*x+1]+sums[2*x+2];
}
void set(ll i, ll v){
set(i,v,0,0,size);
}
ll calc(ll l,ll r,ll x,ll lx,ll rx){
ll tot=0;
if(lx>=r||rx<=l)return 0;
else if(lx>=l&&rx<=r)return sums[x];
ll m=(lx+rx)/2;
return calc(l,r,2*x+1,lx,m)+calc(l,r,2*x+2,m,rx);
}
ll calc(ll l,ll r){
return calc(l,r,0,0,size);
}
ll find(ll k,ll x,ll lx,ll rx){
if(rx-lx==1)return lx;
ll m=(lx+rx)/2;
if(sums[2*x+1]>=k){
return find(k,2*x+1,lx,m);
}
else {
return find(k-sums[2*x+1],2*x+2,m,rx);
}
}
ll find(ll k){
return find(k,0,0,size);
}
};
int main()
{
IOS;
string s;cin>>s;
ll n=s.size();
if(n==1){
if(s[0]=='1'){
cout<<3;
return 0;
}
}
ll x=1;
vl r(n),f(n);
ll cnt=0;
for(int i=0;i<n;i++){
if(s[i]=='1'){
x=x*2%M;
cnt++;
}
r[i]=x;
}
x=1;
for(int i=n-1;i>=0;i--){
x=x*3%M;
f[i]=x;
}
ll ans=powM(2,cnt,M);
for(int i=0;i<n;i++){
if(s[i]=='1'){
if(!i)ans=(ans+f[i+1])%M;
else if(i==n-1)ans=(ans+r[i-1])%M;
else ans=(ans+r[i-1]*f[i+1]%M)%M;
}
}
cout<<ans;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>>G(n);
vector<int>p(m), y(m);
for(int i=0;i<m;i++){
cin >> p[i] >> y[i];
p[i]--;
G[p[i]].push_back(i);
}
vector<ll>ans(m);
for(ll i=0;i<n;i++){
if(G[i].empty()) continue;
vector<pair<ll, ll>> yy;
for(auto g:G[i]) yy.push_back({y[g], g});
sort(yy.begin(), yy.end());
for(ll j=0;j < (ll)yy.size();j++){
ans[yy[j].second] = (i+1)*1000000 + j+1;
}
}
for(int i=0;i<m;i++) printf("%012lld\n", ans[i]);
}
| 0
| 58,992,469
|
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
using namespace std;
#define mod 1000000007
int main()
{
long long int n;
cin >> n;
long long int left = 0, right = n;
while(right - left > 1){
long long int mid = (left + right) / 2;
if(mid * (mid + 1) / 2 >= n) right = mid;
else left = mid;
}
while(n > 0 && right > 0){
if(n >= right){
n -= right;
cout << right << endl;
}
right--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, temp, swaps = 0;
int arr[100];
void SelectionSort(int *arr, int n, bool stable = 0)
{
for (int i = 0; i < n - 1; i++)
{
int minIdx = i;
for (int j = i + 1; j < n; j++)
{
if (arr[j] < arr[minIdx])
{
minIdx = j;
}
}
if (stable)
{
int key = arr[minIdx];
while (minIdx > i)
{
arr[minIdx] = arr[minIdx - 1];
--minIdx;
}
arr[i] = key;
}
else
if (arr[i] > arr[minIdx])
{
swaps = swaps + 1;
temp = arr[i];
arr[i] = arr[minIdx];
arr[minIdx] = temp;
}
}
}
int main()
{
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> arr[i];
}
SelectionSort(arr, N);
for (int k = 0; k < N - 1; k++)
cout << arr[k] << char(0x20);
cout << arr[N - 1] << endl;
cout << swaps;
cout << endl;
return 0;
}
| 0
| 67,982,187
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
using namespace std;
int main(){
int n;
cin>>n;
float x1,y1,x2,y2,x3,y3,x4,y4;
while(n>0){
float a=999999,b=999999;
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if(x2!=x1){
a=(y2-y1)/(x2-x1);
}
if(x3!=x4){
b=(y4-y3)/(x4-x3);
}
if(a==b)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
n--;
}
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
Int n,m;
cin>>n>>m;
vector<vector<Int> > G(n);
for(Int i=0;i<m;i++){
Int u,v;
cin>>u>>v;
u--;v--;
G[u].emplace_back(v);
G[v].emplace_back(u);
}
vector<Int> used(n,-1);
Int cnt=0,flg=0;
function<void(Int)> dfs=[&](Int v){
cnt++;
for(Int u:G[v]){
if(~used[u]){
flg|=~(used[v]-used[u])&1;
}else{
used[u]=used[v]+1;
dfs(u);
}
}
};
Int x=0,y=0,z=n;
for(Int i=0;i<n;i++){
if(~used[i]) continue;
cnt=flg=used[i]=0;
dfs(i);
if(cnt!=1){
z-=cnt;
if(flg) y++;
else x++;
}
}
Int ans=n*n-(n-z)*(n-z);
ans+=(x+y)*(x+y);
ans+=x*x;
cout<<ans<<endl;
return 0;
}
| 0
| 73,821,797
|
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int n, a, sum = 0; cin >> n >> a;
if (n + a == 15) {
cout << '+' << endl;
}
else if (n * a == 15) {
cout << '*' << endl;
}
else {
cout << 'x' << endl;
}
cin >> n;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=1e9+7;
const int INF=1e9;
const double PI=acos(-1);
const int MAX=200010;
ll binary_power(ll a, ll n) {
if (n==0) return 1;
ll k=binary_power(a,n/2);
if (n%2==0) return k*k;
else return k*k*a;
}
int main() {
ios_base::sync_with_stdio(false);
int n,p;
cin >> n >> p;
int odd=0,even=0;
rep(i,n) {
int a;
cin >> a;
if (a%2==0) ++even;
else ++odd;
}
ll ans;
if (odd==0) {
if (p==0) ans=binary_power(2,n);
else ans=0;
} else {
ans=binary_power(2,n-1);
}
cout << ans << endl;
return 0;
}
| 0
| 7,955,543
|
#include <iostream>
using namespace std;
int main (){
while (1){
long n,dset[5000],temp=0,max;
cin>>n;
if (n==0)break;
for (int i=0;i<n;i++){
cin>>dset[i];
}
max=dset[0];
for (int i=0;i<n;i++){
for (int j=i;j<n;j++){
temp=temp+dset[j];
if (max<temp){
max=temp;
}
}
temp=0;
}
cout<<max<<endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int n, m, a, b, flag;
string s = "IMPOSSIBLE";
cin >> n >> m;
vector<int> ve(200001);
flag = 0;
for(int i = 0; i < m; i++){
cin >> a >> b;
if(flag == 0){
if(a == 1){
if(ve[b] == 0){
ve[b]++;
}else{
s = "POSSIBLE";
flag = 1;
}
}
if(b == n){
if(ve[a] == 0){
ve[a]++;
}else{
s = "POSSIBLE";
flag = 1;
}
}
}
}
cout << s << endl;
}
| 0
| 46,287,401
|
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
void startupcpp(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(15);
}
double distance(ddatas x,ddatas y){
double a=x.first-y.first,b=x.second-y.second;
return sqrt(a*a+b*b);
}
ll modinv(ll a) {
ll b=mod,u=1,v=0,t;
while(b){
t=a/b;
a-=t*b; swap(a,b);
u-=t*v; swap(u,v);
}
return (u+mod)%mod;
}
ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}
vec modncrlistp,modncrlistm;
ll modncr(ll n,ll r){
if(n<r)return 0;
ll i,size=modncrlistp.size();
if(size<=n){
modncrlistp.resize(n+1);
modncrlistm.resize(n+1);
if(!size){
modncrlistp[0]=modncrlistm[0]=1;
size++;
}
For(i,size,n+1){
modncrlistp[i]=modncrlistp[i-1]*i%mod;
modncrlistm[i]=modinv(modncrlistp[i]);
}
}
return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}
ll modpow(ll a,ll n){
ll res=1;
while(n>0){
if(n&1)res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll countdigits(ll n){
ll ans=0;
while(n){n/=10;ans++;}
return ans;
}
ll sumdigits(ll n){
ll ans=0;
while(n){ans+=n%10;n/=10;}
return ans;
}
void topcoder(vector<int>& v){
string s;
while(1){
cin>>s;
int i=s[0]=='{',x=0;
while(s[i]>='0'&&s[i]<='9'){
x=x*10+s[i]-'0';
++i;
}
v.eb(x);
if(s[i]=='}')break;
}
}
void topcoder(string& s){
string t;
cin>>t;
int i=1;
while(t[i]!='"'){
s+=t[i++];
}
}
struct unionfind{
private:
int maxN;
vector<int> par,treesize;
public:unionfind(int N) :maxN(N),par(N),treesize(N,1){
for(int i=0;i<maxN;++i)par[i]=i;
}
int root(int x){
while(par[x]!=x){
x=par[x]=par[par[x]];
}
return x;
}
bool unite(int x,int y){
x=root(x);
y=root(y);
if(x==y)return false;
if(treesize[x]>treesize[y])swap(x,y);
par[x]=y;
treesize[y]+=treesize[x];
return true;
}
bool parcheck(int x,int y){
return root(x)==root(y);
}
int size(int x){
return treesize[root(x)];
}
void clear(){
treesize.assign(maxN,1);
for(int i=0;i<maxN;++i)par[i]=i;
}
};
int main(){
ll i,j,N,ans=0;
cin>>N;
pvec v(N);
rep(i,N)cin>>v[i].first>>v[i].second;
sort(all(v),[](auto x,auto y){
return x.first+x.second>y.first+y.second;
});
rep(i,N){
if(i&1)ans-=v[i].second;
else ans+=v[i].first;
}
print(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/jsc2019_qual_b.txt"); \
cin.rdbuf(in.rdbuf());
#else
#define INPUT_FILE
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100100100;
const ll LINF = 1e18+100;
const int MOD = 1e9 + 7;
ll powMod(ll n, ll p, const int mod = MOD) {
if (p == 0) return 1;
if (p % 2 == 0) {
ll t = powMod(n, p / 2);
return t * t % MOD;
} else {
return n * powMod(n, p - 1) % MOD;
}
}
ll combMod(ll n, ll k, const int mod = MOD) {
ll nCk = 1;
k = min(k, n - k);
repi(i, 1, k + 1) {
nCk = nCk * (n - i + 1) % MOD;
nCk = nCk * powMod(i, mod - 2) % MOD;
}
return nCk;
}
int main() {
INPUT_FILE CIN_OPTIMIZE;
ll N, K;
cin >> N >> K;
vector<int> c(N);
rep(i, N) { cin >> c[i]; }
ll n = 0;
ll m = 0;
rep(i, N) {
repi(j, i, N) {
if (c[i] > c[j]) n++;
}
rep(j, i) {
if (c[i] > c[j]) m++;
}
}
ll ans = K * n % MOD;
ans += combMod(K, 2) * (n + m) % MOD;
ans %= MOD;
cout << ans << endl;
}
| 0
| 92,721,268
|
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> a(m), b(m);
rep(i, m) cin >> a[i] >> b[i];
vector<int> ma(n);
rep(i, m) {
ma[a[i]-1] = max(ma[a[i]-1], h[b[i]-1]);
ma[b[i]-1] = max(ma[b[i]-1], h[a[i]-1]);
}
int cnt = 0;
rep(i, n) {
if (h[i] > ma[i]) {
cnt++;
}
}
put(cnt);
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int H,W;
int main(){
cin >> H >> W;
string board[H*W];
for(int i=0; i<H; i++) cin >> board[i];
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
for(int y=0; y<H; y++){
for(int x=0; x<W; x++){
if(board[y][x]=='.') continue;
bool flg = false;
for(int k=0; k<4; k++){
if(y+dy[k]<0 || y+dy[k]>=H || x+dx[k]<0 || x+dx[k]>=W) continue;
if(board[y+dy[k]][x+dx[k]] == '#') flg = true;
}
if(!flg){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 57,770,372
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
string x;
int sum;
cin >> x;
while( !(x=="0") ) {
sum = 0;
for( auto i:x ) {
sum += i - '0';
}
cout << sum << endl;
cin >> x;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < n; ++i)
int main() {
ll n, x, m;
cin >> n >> x >> m;
if (x == 0) {
cout << 0 << endl;
return 0;
}
if (n == 1) {
cout << x << endl;
return 0;
}
if (n == 2) {
cout << x + x * x % m << endl;
return 0;
}
ll y = x;
vector<ll> used(m + 1);
ll start = 0, end = 0;
rep(i, 0, n) {
used[x]++;
end = x;
x = x * x % m;
if (used[x] == 1) {
start = x;
break;
}
}
ll ans = 0;
ll now = y;
while (n > 0 && now != start) {
ans += now;
now = now * now % m;
--n;
}
ll loop = 1;
ll loop_sum = now;
now = now * now % m;
ll cnt = 1000000;
while (cnt > 0 && now != start) {
loop_sum += now;
now = now * now % m;
++loop;
--cnt;
}
if (n <= 0 || x == 0) {
cout << ans << endl;
return 0;
}
ans += n / loop * loop_sum;
n %= loop;
rep(i, 0, n) {
ans += x;
x = x * x % m;
}
cout << ans << endl;
return 0;
}
| 0
| 46,788,410
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a,b,k,s,l;
cin>>a>>b>>k;
if(k<=a)
{
cout<<a-k<<" "<<b<<endl;
}
else
{
if((k-a)<=b)
{
cout<<"0"<<" "<<b-(k-a)<<endl;
}
else cout<<"0"<<" "<<"0"<<endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vec = bitset<100001>;
bool solve(vector<vec> A, int N, int M){
int r = 0;
for(int j = 0; j < M; j++){
int p = -1;
for(int i = r; i < N; i++){
if(A[i][j]){
p = i;
break;
}
}
if(p == -1) continue;
swap(A[r], A[p]);
for(int i = r + 1; i < N; i++) if(A[i][j]) A[i] ^= A[r];
r++;
}
for(int i = r; i < N; i++) if(A[i][M]) return false;
return true;
}
int main(){
int N;
scanf("%d", &N);
vector<ll> A(N); rep(i, N) scanf("%lld", &A[i]);
ll ans = 0;
vector<int> f, taken;
repr(i, 60){
int cnt = 0;
rep(j, N) if(A[j] >> i & 1) cnt++;
if(cnt % 2 == 1){
ans += 1LL << i;
}else{
f.push_back(i);
vector<vec> X(f.size());
rep(r, f.size()){
rep(j, N) X[r][j] = A[j] >> f[r] & 1;
}
rep(r, taken.size()) X[r][N] = taken[r];
X[taken.size()][N] = 1;
if(solve(X, f.size(), N)) taken.push_back(1);
else taken.push_back(0);
}
}
rep(r, f.size()) if(taken[r]) ans += 1LL << f[r] + 1;
printf("%lld\n", ans);
return 0;
}
| 0
| 99,307,111
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long r;
cin >> r;
cout << r*r << '\n';
return 0;
}
|
#include <iostream>
using namespace std;
int main( void )
{
int a, b;
cin >> a >> b;
if ( a == b )
{
cout << "Draw";
}
else if ( a == 1 )
{
cout << "Alice";
}
else if ( b == 1 )
{
cout << "Bob";
}
else if ( a > b )
{
cout << "Alice";
}
else
{
cout << "Bob";
}
return 0;
}
| 0
| 54,460,161
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
const long MOD = 1'000'000'007;
int main() {
long n; string s;
cin >> n >> s;
long r, g, b;
r = g = b = 0;
for (long i = 0; i < n; i++) {
switch (s[i]) {
case 'R':
r++;
break;
case 'G':
g++;
break;
case 'B':
b++;
break;
}
}
long ans = r * g * b;
for (long i = 0; i < n; i++) {
for (long j = i+1; j < n; j++) {
long k = j + (j - i);
if (k < n) {
if (s[i] != s[j] && s[j] != s[k] && s[k] != s[i]) {
ans--;
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n, -1);
rep(i,k){
int d; cin >> d;
rep(j,d){
int A;
cin >> A;
a[A-1] = 1;
}
}
int ans = 0;
rep(i,n){
if(a[i] != 1) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 86,157,940
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
if(a == "H"){cout << b << endl;}
else{
if(b == "H"){cout << "D" << endl;}
else{cout << "H" << endl;}
}
}
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define chk(x) cout<<#x<<" : "<<x, nl
#define ll long long int
#define u unsigned
#define vi vector<int>
#define vvi vector<vi>
#define pr pair<ll, ll>
#define vii vector<pair<int, int>>
#define vll vector<pr>
#define vl vector<ll>
#define m(a,b) map<a, b>
#define ci m(char, ll)
#define ii m(ll, ll)
#define mid(a,b) ((a+b)/2)
#define pb push_back
#define LCM(a,b) ((a*b)/__gcd(x,y))
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
class triplet{
ll f, s, t;};
vl in(ll n){vl v;ll x;
f(i,n)
cin>>x, v.pb(x);
return v;}
void out(vl v){
fl(i,v)cout<<i;
}
void out(vl v, char ch){
fl(i,v)
cout<<i<<ch;
}
void solve(){
ll N;
cin>>N;
cout<<N*(N-1)/2;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| 0
| 5,037,235
|
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = (int)(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = (int)(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define REVERSE(x) reverse((x).begin(), (x).end())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << '\n'
#define endl '\n'
constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
constexpr double EPS = 1e-10;
constexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
constexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template<typename T>
bool chmax(T& a, T b){
if(a < b){
a = b;
return true;
}
return false;
}
template<typename T>
bool chmin(T& a, T b){
if(b < a){
a = b;
return true;
}
return false;
}
template<typename T>
T meguru_search(T ok, T ng, function<bool(T)> check){
while(max(ok, ng) - min(ok, ng) > T(1)){
T mid = (ok + ng) / T(2);
if(check(mid)){
ok = mid;
}else{
ng = mid;
}
}
return ok;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> cnt(n);
rep(i, n){
int a;
cin >> a;
++cnt[--a];
}
SORT(cnt);
vector<int> sum(n + 1);
reps(i, n){
sum[i] = sum[i - 1] + cnt[i - 1];
}
vector<int> v(n + 1);
rep(i, n + 1){
auto f = [&](int l){
int k = lower_bound(cnt.begin(), cnt.end(), i) - cnt.begin();
return sum[k] + (lint)(n - k) * i >= (lint)l * i;
};
v[i] = meguru_search<int>(0, n + 1, f);
}
reps(i, n){
cout << meguru_search<int>(0, n + 1, [&](int k){ return v[k] >= i; }) << endl;
}
cout << flush;
return 0;
}
|
#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);
ll high_order_bit(ll n){
ll tmp=1,i=-1;
while(tmp<=n){
tmp*=2;
i++;
}
if(n==0) return 0;
else return i;
}
vector<ll> binary_expansion(ll n){
vector<ll> B(high_order_bit(n)+1);
ll tmp=n;
for(ll i=high_order_bit(n);i>=0;i--){
B[i]=tmp/pw2[i];
tmp%=pw2[i];
}
return B;
}
vector<ll> divisor(ll x){
vector<ll> div;
for(int i=1;i*i<=x;i++){
if(i*i!=x && x%i==0){
div.pb(i);
div.pb(x/i);
}
else if(x%i==0) div.pb(i);
}
return div;
}
vector<ll> vectorprime(ll x){
vector<bool> is_prime(x+1);
vector<ll> prime;
rep(i,x+1) is_prime[i]=true;
is_prime[0]=is_prime[1]=false;
for(int i=2;i<=x;i++){
if(is_prime[i]){
prime.pb(i);
}
for(int j=i*2;j<=x;j+=i) is_prime[j]=false;
}
return prime;
}
int main(){
{rep1(i,50) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N;
ll ans=0;
string S;
cin>>N>>S;
vector<ll> R;
vector<ll> G;
vector<ll> B;
rep(i,sz(S)){
if(S[i]=='R') R.pb(i+1);
else if(S[i]=='G') G.pb(i+1);
else B.pb(i+1);
}
if((sz(R)==0)||(sz(G)==0)||(sz(B)==0)){
cout<<0;
return 0;
}
rep1(i,N){
if(S[i-1]=='R'){
rep(j,sz(G)){
ll Gpoint=G[j];
ll out_1=-1;
if(2*Gpoint-i>=1) out_1=2*Gpoint-i;
ll out_2=-1;
if(2*i-Gpoint>=1) out_2=2*i-Gpoint;
ll out_3=-1;
if((Gpoint-i)%2==0) out_3=(Gpoint+i)/2;
ans+=sz(B);
int l=0,r=sz(B)-1;
while(r-l>=1){
int i=(l+r)/2;
if(B[i]<out_1) l=i+1;
else r=i;
}
if(B[l]==out_1) ans--;
l=0,r=sz(B)-1;
while(r-l>=1){
int i=(l+r)/2;
if(B[i]<out_2) l=i+1;
else r=i;
}
if(B[l]==out_2) ans--;
l=0,r=sz(B)-1;
while(r-l>=1){
int i=(l+r)/2;
if(B[i]<out_3) l=i+1;
else r=i;
}
if(B[l]==out_3) ans--;
}
}
}
cout<<ans<<endl;
}
| 0
| 85,847,731
|
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_sandglass2(void) {
int x, t;
cin >> x >> t;
cout << ((x - t<0)?0:x-t) << endl;
}
int main()
{
a_sandglass2();
return 0;
}
|
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int N;
int a[100];
int b, c, d;
int main()
{
cin >> N;
for(int i=0; i<N; i++)
{
cin >> a[i];
}
d=0;
for(int k=0; k<N-1; k++)
{
b=k;
for(int i=k; i<N; i++)
{
if(a[i]<a[b])
{
b=i;
}
}
if(k!=b)
{
c=a[b];
a[b]=a[k];
a[k]=c;
d+=1;
}
}
cout << a[0];
for(int i=1; i<N; i++)
{
cout << " " << a[i];
}
cout << endl << d << endl;
return 0;
}
| 0
| 87,957,538
|
#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(){
ll n;
cin >> n;
vector<int> ns(n);
rep(i, n){
cin >> ns.at(i);
}
sort(ns.begin(), ns.end());
int sum = 0;
rep(i, n-1) if(ns.at(i) == ns.at(i+1)) sum++;
int k = 0;
int max = 0;
rep(i, ns.size()-1){
if(ns.at(i) == ns.at(i+1)){
k += 1;
if(max < k){
max = k;
}
}else{
k = 0;
}
}
cout << n - sum - sum%2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
ll N,M;
cin >>N>>M;
map<ll,ll>m;
rep2(i,N){
ll p;
cin>>p;
m[p]=i;
}
UnionFind tree(N+1);
rep(i,M){
ll x,y;
cin>>x>>y;
tree.unite(x, y);
}
ll ans = 0;
rep2(i,N){
if(tree.same(i,m[i])){
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 26,353,140
|
#include <iostream>
#include <functional>
using namespace std;
int main()
{
function<long long(int)> const fact = [&]( int n ) -> long long { return n==0 ? 1 : fact( n-1 ) * n; };
int i; cin >> i;
cout << fact( i ) << endl;
}
|
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v) os << vv << ",";
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "{";
for (auto vv : v) os << vv << ",";
return os << "}";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <class K, class T>
ostream& operator<<(ostream& os, map<K, T> v) {
os << "{";
for (auto vv : v) os << vv << ",";
return os << "}";
}
template <class T>
ostream& operator<<(ostream& os, queue<T> q) {
os << "[";
while (!q.empty()) {
os << q.front() << ",";
q.pop();
}
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, priority_queue<T> q) {
os << "{";
while (!q.empty()) {
os << q.top() << ",";
q.pop();
}
return os << "}";
}
const ll MOD = 1000000007;
template <class T>
vector<T> Vec(size_t l, T v) { return vector<T>(l, v); }
template <class T, class... Ts>
auto Vec(size_t l, Ts... ts) {
return vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}
template <typename T>
inline T sq(T a) { return a * a; }
template <typename T>
inline T iceil(T n, T d) { return (n + d - 1) / d; }
template <typename T>
T gcd(T a, T b) {
while (b > 0) {
a %= b;
swap(a, b);
}
return a;
}
template <typename T, typename U>
T ipow(T b, U n) {
T ret = 1;
while (n > 0) {
if (n & 1) ret *= b;
n >>= 1;
b *= b;
}
return ret;
}
template <typename T, typename U>
T mpow(T b, U n) {
T ret = 1;
while (n > 0) {
if (n & 1) ret = ret * b % MOD;
n >>= 1;
b = b * b % MOD;
}
return ret;
}
int main() {
ll N, L, T;
cin >> N >> L >> T;
auto x = Vec<ll>(N, 0LL), w = Vec<ll>(N, 0LL);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> w[i];
w[i] = 3 - w[i] * 2;
}
ll confl = 0;
for (int i = 1; i < N; ++i) {
if (w[0] == w[i]) continue;
if (w[0] > 0) {
confl += iceil(x[0] - x[i] + T * 2, L);
} else {
confl += iceil(x[i] - x[0] + T * 2, L) - 1;
}
}
cerr << confl << endl;
ll id0 = confl % N;
if (w[0] < 0) id0 = (N - id0) % N;
ll x0 = (x[0] + T * w[0]) % L;
if (x0 < 0) x0 += L;
for (int i = 0; i < N; ++i) {
x[i] = (x[i] + T * w[i]) % L;
if (x[i] < 0) x[i] += L;
}
sort(x.begin(), x.end());
auto itr = lower_bound(x.begin(), x.end(), x0);
if (w[0] < 0) itr = --upper_bound(x.begin(), x.end(), x0);
auto ans = Vec<ll>(N, 0LL);
for (int j = 0; j < N; ++j) {
ans[(id0 + j) % N] = *itr;
if (++itr == x.end()) itr = x.begin();
}
for (auto& e : ans) cout << e << endl;
return 0;
}
| 0
| 31,634,163
|
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int K, S;
cin >> K >> S;
int cont = 0;
for (int X = 0; X <= K; X++)
{
for (int Y = 0; Y <= K; Y++)
{
int Z = S - X - Y;
if (Z >= 0 && Z <= K)
cont++;
}
}
cout << cont;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
string s, t;
cin >> s >> t;
int n = s.length();
vector<int> sa(26, 0), ta(26, 0);
vector<int> sv(n), tv(n);
for(int i=0; i<n; i++){
if(sa[s[i]-'a']){
sv[i] = sa[s[i]-'a'];
}else{
sv[i] = i+1;
sa[s[i]-'a'] = i+1;
}
}
for(int i=0; i<n; i++){
if(ta[t[i]-'a']){
tv[i] = ta[t[i]-'a'];
}else{
tv[i] = i+1;
ta[t[i]-'a'] = i+1;
}
}
for(int i=0; i<n; i++){
if(tv[i]!=sv[i]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 87,841,126
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const int BITS_LEN = 62;
vector<ll> a;
vector<ll> sums;
void calc_sums(const ll N) {
vector<ll> part_sums(N + 1, 0);
for (int i = 0; i < N; i++) {
part_sums[i + 1] = part_sums[i] + a[i];
}
int ind = 0;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
sums[ind] = part_sums[j + 1] - part_sums[i];
ind++;
}
}
}
int main(void) {
ll N, K;
cin >> N >> K;
a.resize(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
ll sums_len = N * (N + 1) / 2;
sums.resize(sums_len);
calc_sums(N);
ll cur = 0;
for (int i = 40; i >= 0; i--) {
ll ncur = cur + (1LL << i);
int ok = 0;
for (int j = 0; j < sums_len; j++) {
if ((ncur & sums[j]) == ncur) ok++;
}
if (ok >= K) cur = ncur;
}
cout << cur << 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>
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 << "-1\n"; return;}
void solve() {
int n; cin >> n;
vector <int> rp(n + 1);
loop1(i, n) {
int x; cin >> x;
rp[x] = i;
}
loop1(i, n)
cout << rp[i] << " ";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 41,649,496
|
#include<stdio.h>
#define INT_MAX 0x7f7f7f7f
int n, m, dis[105][105];
bool floyd()
{
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++){
dis[i][i] = 0;
for(int j = 0; j < n; j++)
if(dis[i][k] != INT_MAX && dis[k][j] != INT_MAX)
if(dis[i][j] > dis[i][k] + dis[k][j])
dis[i][j] = dis[i][k] + dis[k][j];
if(dis[i][i] < 0) return false;
}
return true;
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
dis[i][j] = INT_MAX;
for(int i = 1; i <= m; i++)
{
int x, y, t;
scanf("%d%d%d", &x, &y, &t);
dis[x][y] = t;
}
if(floyd())
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++){
if(dis[i][j] != INT_MAX) printf("%d", dis[i][j]);
else printf("INF");
putchar(" \n"[j == n-1]);
}
else printf("NEGATIVE CYCLE\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#define pb push_back
const ll INF = 1000000000000000;
const ll MOD = 1000000007;
const double PI = acos(-1);
#define DBG(a,b,c,d)
int main(){
IO_STREAM;
int N; cin>>N;
vi d(N);
rep(i,0,N){
cin>>d[i];
}
int ans=0;
rep(i,0,N){
rep(j,0,N){
if(i!=j) ans+=d[i]*d[j];
}
}
ans/=2;
cout<<ans<<endl;
return 0;
}
| 0
| 8,602,000
|
#include<bits/stdc++.h>
using namespace std;
int dist[101][101];
int n, m;
bool isUsed(int a, int b, int c){
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(dist[i][j] == dist[i][a] + c + dist[b][j]) return false;
}
}
return true;
}
int main(){
cin >> n >> m;
for(int i=0; i<n; i++) for(int j=0; j<n; j++) dist[i][j] = (i == j ? 0 : 1e9);
vector<int> a(m), b(m), c(m);
for(int i=0; i<m; i++){
cin >> a[i] >> b[i] >> c[i];
dist[--a[i]][--b[i]] = c[i];
dist[b[i]][a[i]] = c[i];
}
for(int k=0; k<n; k++) for(int i=0; i<n; i++) for(int j=0; j<n; j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
int ans = 0;
for(int i=0; i<m; i++) ans += isUsed(a[i], b[i], c[i]);
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define _GLIBCXX_DEBUG
#define DIVISOR 1000000007
using namespace std;
typedef pair<int,int> pii;
typedef pair<int64_t, int64_t> pII;
template<typename T>
void cins(vector<T>& arr) { for(T& e: arr) cin >> e; }
#ifdef DEBUG
#define debug(fmt, ...) \
printf("[debug: %s] " fmt, __func__, __VA_ARGS__)
#define ps(arr) \
debug("size %ld: ", arr.size()); \
for(auto e: arr) cout << e << " "; \
cout << endl;
#else
#define debug(fmt, ...)
#define ps(arr)
#endif
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if(a>b) swap(a,b);
if(b>c) swap(b,c);
int sum = 3*c - (a+b+c);
if(sum%2) sum += 3;
cout << sum / 2 << endl;
return 0;
}
| 0
| 51,396,002
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n - 2) * 180;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(n,v) cout<<#v<<":";for(int i=0;i<n;i++)cout<<v[i]<<" ";cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main(){
int n;
cin>>n;
char s[n][n];
rep(i,n){
rep(j,n){
cin>>s[i][j];
}
}
ll ans=0;
rep(slide,n){
char t[n][n];
rep(i,n){
rep(j,n){
t[i][(j+slide)%n]=s[i][j];
}
}
bool f=true;
rep(i,n){
rep(j,n){
if(t[i][j]!=t[j][i]){
f=false;break;
}
}
if(!f) break;
}
if(f) ans+=n;
}
cout<<ans<<endl;
return 0;
}
| 0
| 5,778,793
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, L;
cin >> N >> L;
string S[N];
rep(i,N) cin >> S[i];
sort(S,S+N);
string ans = "";
rep(i,N) ans += S[i];
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <sstream>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h,n, w,m,t; string s;
ll R, C;
ll sy, sx, gy, gx;
char maze[510][510];
ll dis[20][20];
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
ll gcd(ll x, ll y) {
if (x % y == 0) return y;
return gcd(y, x % y);
}
ll lcm(ll a,ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector <ll> >& v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j])%ma;
}
}
}
ll GetDigit(ll num) {
return log10(num) + 1;
}
ll Combination(int n, int r)
{
if (n - r < r) r = n - r;
if (r == 0) return 1;
if (r == 1) return n;
vector<ll> numerator(r);
vector<ll> denominator(r);
for (int k = 0; k < r; k++)
{
numerator[k] = n - r + k + 1;
denominator[k] = k + 1;
}
for (int p = 2; p <= r; p++)
{
int pivot = denominator[p - 1];
if (pivot > 1)
{
int offset = (n - r) % p;
for (int k = p - 1; k < r; k += p)
{
numerator[k - offset] /= pivot;
denominator[k] /= pivot;
}
}
}
ll result = 1;
for (int k = 0; k < r; k++)
{
if (numerator[k] > 1) result *= numerator[k];
result %= ma;
}
return result;
}
int main() {
cin >> n >> m;
ll k;
cin >> k;
rep(i, n + 1) {
rep(j, m + 1) {
ll sum = i * m + j * n - 2*i * j;
if (sum == k) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 58,151,110
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int N, K, ans = 1;
cin >> N >> K;
rep(i, N) {
if (ans < K) ans += ans;
else ans += K;
}
cout << ans << "\n";
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
void FIO()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int n, k;
vector<int> a(100005);
vector<int> dp(100005, -1);
int solve(int start)
{
if (start == n - 1)
return 0;
if (dp[start] != -1)
return dp[start];
int val = INT_MAX;
for (int i = start + 1; i <= min(n, start + k); i++)
{
val = min(val, abs(a[start] - a[i]) + solve(i));
}
return dp[start] = val;
}
int32_t main()
{
FIO();
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(0) << '\n';
return 0;
}
| 0
| 25,796,405
|
#include <bits/stdc++.h>
using namespace std;
#define foru(i, l, r) for (register int i = l; i <= r; i++)
#define ford(i, r, l) for (register int i = r; i >= l; i--)
int N;
char S[100002];
char T[100002];
int main() {
scanf("%d%s%s", &N, S + 1, T + 1);
for (int len = N; len >= 1; len--) {
bool flag = true;
for (int i = N - len + 1, j = 1; i <= N && flag; i++, j++)
if (S[i] != T[j]) flag = false;
if (flag) return printf("%d\n", (N << 1) - len), 0;
}
printf("%d\n", N << 1);
return 0;
}
|
#include <iostream>
#include <iomanip>
#define SQRT_3 1.73205080757
using namespace std;
constexpr double
ccw60x(const double ax, const double ay, const double bx, const double by)
{
return (bx - ax) / 2 - (by - ay) * SQRT_3 / 2 + ax;
}
constexpr double
ccw60y(const double ax, const double ay, const double bx, const double by)
{
return (bx - ax) * SQRT_3 / 2 + (by - ay) / 2 + ay;
}
void
koch(const int n, const double ax, const double ay, const double bx, const double by)
{
if (n == 0) return;
double sx = (2 * ax + bx) / 3;
double sy = (2 * ay + by) / 3;
koch(n - 1, ax, ay, sx, sy);
cout << sx << ' ' << sy << endl;
double tx = (ax + 2 * bx) / 3;
double ty = (ay + 2 * by) / 3;
double ux = ccw60x(sx, sy, tx, ty);
double uy = ccw60y(sx, sy, tx, ty);
koch(n - 1, sx, sy, ux, uy);
cout << ux << ' ' << uy << endl;
koch(n -1, ux, uy, tx, ty);
cout << tx << ' ' << ty << endl;
koch(n -1, tx, ty, bx, by);
}
int
main()
{
ios_base::sync_with_stdio(false);
int n;
cin >> n; cin.ignore();
double ax = 0;
double ay = 0;
double bx = 100;
double by = 0;
cout << fixed << setprecision(8) << ax << ' ' << ay << endl;
koch(n, ax, ay, bx, by);
cout << bx << ' ' << by << endl;
return 0;
}
| 0
| 49,510,633
|
#include <iostream>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
}
else if(A==1||A>B){
if(B==1){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
}
else{
cout<<"Bob"<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int64_t from_zero(int64_t n)
{
if (n % 4 == 0)
{
return n;
}
else if (n % 4 == 1)
{
return 1;
}
else if (n % 4 == 2)
{
return n ^ 1;
}
else
{
return 0;
}
}
int main()
{
int64_t a, b;
cin >> a >> b;
int64_t res;
if (a == 0)
{
res = from_zero(b);
}
else
{
res = from_zero(a - 1) ^ from_zero(b);
}
cout << res << endl;
}
| 0
| 42,865,944
|
#include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
for (int x = 1; x <= 1000000; ++x) {
if (int(x * 0.08) == A && int(x * 0.10) == B) {
cout << x << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a)*(a)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define MOD 1000000007
#define PI 3.141592653589793238
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll exp(ll x,ll n,ll mod)
{
ll result=1;
while(n)
{
if(n & 1)
result=(result * x)%mod;
x=(x*x)%mod;
n>>=1;
}
return result;
}
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
IOS
ll n;
cin>>n ;
ll ans=0;
for(ll i=0;i<n;i++)
ans+=(i+1)*(n-i);
for(ll i=0;i<n-1;i++)
{
ll x ,y;
cin>>x>>y;
x--;y--;
if(x>y)
swap(x,y);
ans-=((x+1)*(n-y));
}
cout<<ans<<endl;
return 0;
}
| 0
| 25,939,270
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, A, B;
cin >> K >> A >> B;
if(A + 2 < B) {
ll ans = A;
K -= A - 1;
ans += (K/2)*(B - A) + K%2;
cout << ans << endl;
} else {
cout << K + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
string s;
char t[10][100005];
int main(void){
cin>>n>>s;
t[0][0]='S';
t[1][0]='S';
t[2][0]='W';
t[3][0]='W';
if(s[0]=='o'){
t[0][1]='S';
t[0][n-1]='S';
t[1][1]='W';
t[1][n-1]='W';
t[2][1]='S';
t[2][n-1]='W';
t[3][1]='W';
t[3][n-1]='S';
}else{
t[0][1]='S';
t[0][n-1]='W';
t[1][1]='W';
t[1][n-1]='S';
t[2][1]='S';
t[2][n-1]='S';
t[3][1]='W';
t[3][n-1]='W';
}
for(int i=2;i<n-1;i++){
for(int j=0;j<4;j++){
if(s[i-1]=='o'){
if(t[j][i-1]=='S'){
t[j][i]=t[j][i-2];
}else{
if(t[j][i-2]=='S'){
t[j][i]='W';
}else{
t[j][i]='S';
}
}
}else{
if(t[j][i-1]=='S'){
if(t[j][i-2]=='S'){
t[j][i]='W';
}else{
t[j][i]='S';
}
}else{
t[j][i]=t[j][i-2];
}
}
}
}
for(int i=0;i<4;i++){
bool k=false;
bool l=false;
if(s[n-2]=='o'){
if(t[i][n-2]=='S'){
if(t[i][n-1]==t[i][n-3]){
k=true;
}
}else{
if(t[i][n-1]!=t[i][n-3]){
k=true;
}
}
}else{
if(t[i][n-2]=='S'){
if(t[i][n-1]!=t[i][n-3]){
k=true;
}
}else{
if(t[i][n-1]==t[i][n-3]){
k=true;
}
}
}
if(s[n-1]=='o'){
if(t[i][n-1]=='S'){
if(t[i][n-2]==t[i][0]){
l=true;
}
}else{
if(t[i][n-2]!=t[i][0]){
l=true;
}
}
}else{
if(t[i][n-1]=='S'){
if(t[i][n-2]!=t[i][0]){
l=true;
}
}else{
if(t[i][n-2]==t[i][0]){
l=true;
}
}
}
if(k&&l){
for(int j=0;j<n;j++){
cout<<t[i][j];
}
cout<<endl;
return 0;
}
}
cout<<-1<<endl;
}
| 0
| 94,591,705
|
#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 rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
int h,w;
cin>>h>>w;
vector<string>s(h);
rep(i,h) cin>>s[i];
vector<bool>l(h,false),r(w,false);
rep(i,h)rep(j,w){
if(s[i][j]=='#'){
l[i]=true;
r[j]=true;
}
}
rep(i,h){
if(l[i]){
rep(j,w){
if(r[j])
cout<<s[i][j];
}
cout<<endl;
}
}
}
|
#include <cstring>
#include <string>
#include <memory>
#include <iostream>
constexpr int max_size()
{
return 1000003;
}
constexpr int null_val()
{
return -1;
}
class dictionary {
public:
dictionary()
: _data(std::make_unique<int[]>(max_size()))
{
for (int i = 0; i < max_size(); ++i) {
_data[i] = null_val();
}
}
void insert(const std::string& str) {
return insert(str2key(str), 0);
return;
}
bool find(const std::string& str) {
return find(str2key(str), 0);
}
private:
int str2int(const char ch) {
if (ch == 'A') {
return 1;
}
if (ch == 'C') {
return 2;
}
if (ch == 'G') {
return 3;
}
if (ch == 'T') {
return 4;
}
return 0;
}
int pow5(int exp) const
{
if (exp == 0) {
return 1;
}
return 5 * pow5(exp - 1);
}
int str2key(const std::string& str)
{
int sum = 0;
for (std::size_t i = 0; i < str.size(); ++i) {
sum += str2int(str[i]) * pow5(i);
}
return sum;
}
int base_hash(const int key) const
{
return key % max_size();
}
int collision_hash(const int key) const
{
constexpr int modulo = max_size() + 1;
return 1 + key % modulo;
}
int create_hash(const int key, const int r) const
{
const int base = base_hash(key);
const int collision = collision_hash(key);
const int h = (base + r * collision) % max_size();
return h;
}
void insert(const int key, const int r)
{
const int h = create_hash(key, r);
if (is_empty(h)) {
_data[h] = key;
return;
}
if (_data[h] == key) {
return;
}
insert(key, r + 1);
return;
}
bool find(const int key, const int r) const
{
const int h = create_hash(key, r);
if (is_empty(h)) {
return false;
}
if (_data[h] == key) {
return true;
}
return find(key, r + 1);
}
bool is_empty(const int idx) const {
return _data[idx] == null_val();
}
private:
std::unique_ptr<int[]> _data;
};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
std::cin >> n;
std::cin.ignore();
dictionary dict;
std::string buf;
for (int i = 0; i < n; ++i) {
getline(std::cin, buf);
if (buf.front() == 'i') {
static const std::size_t size = strlen("insert ");
const std::string val
= buf.substr(size, buf.size() - size);
dict.insert(val);
}
else {
static const std::size_t size = strlen("find ");
const std::string val
= buf.substr(size, buf.size() - size);
if (dict.find(val)) {
std::cout << "yes" << std::endl;
}
else {
std::cout << "no" << std::endl;
}
}
}
return 0;
}
| 0
| 77,565,402
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int H, W;
cin >> H >> W;
vector<string> G(H);
rep(i, H) cin >> G.at(i);
vector<vector<string>> a(H, vector<string>(W));
rep(i, H) rep(j, W) a.at(i).at(j) = G.at(i).at(j);
rep(i, H) {
bool flag = true;
rep(j, W) if (a.at(i).at(j) == "#") flag = false;
if (flag) rep(k, W) a.at(i).at(k) = "x";
}
rep(j, W) {
bool flag = true;
rep(i, H) if (a.at(i).at(j) == "#") flag = false;
if (flag) rep(l, H) a.at(l).at(j) = "x";
}
rep(i, H) {
bool flag = false;
rep(j, W) {
if (a.at(i).at(j) != "x") {
cout << a.at(i).at(j);
flag = true;
}
}
if (flag) cout << endl;
}
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a, b,c,d,f,g;
cin>> a;
cin>>b;
cin>> c;
cin >>d ;
f=(a+b);
g=(c+d);
if(f>g){
cout<<"Left";
}else if(f<g) {
cout<<"Right";
}else {
cout<<"Balanced";
}
return 0;
}
| 0
| 16,871,051
|
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef double db;
#define inf 0x3f3f3f3f
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll a[312345];
ll b[312345];
ll c[312345];
ll d[312345];
ll n, m;
ll solve(ll t) {
ll ans = 0, i;
t = m - t + 1;
ans = d[t - 1];
ll left = a[t], right = a[m] + ans;
while (left < right) {
ll mid = left + right+1 >> 1;
ll* tt = lower_bound(a + t, a + m + 1, mid);
ll x = tt - a;
ll y = x - t;
ll z = d[x - 1] - d[t - 1];
z = mid * y - z;
if (z > ans)right = mid - 1;
else left = mid;
}
return left;
}
signed main() {
ll i, t;
cin >> n;
for (i = 0; i < n; ++i)cin >> b[i];
sort(b, b + n);
a[1] = 1;
ll cnt = 1;
for (i = 1; i < n; ++i) {
if (b[i] == b[i - 1])++a[cnt];
else {
a[++cnt] = 1;
}
}
m = cnt;
sort(a + 1, a + m + 1);
a[m + 1] = inf;
for (i = 1; i <= m; ++i) {
d[i] = a[i] + d[i - 1];
}
for (i = m + 1; i <= n; ++i)c[i] = 0;
for (i = 1; i <= m; ++i) {
c[i] = solve(i);
}
for (i = 1; i <= n; ++i)cout << c[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
#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++)
#define SIZE 100005
#define INF 1e18
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define vec vector
using pint = pair<int,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; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double pi = acos(-1);
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll n,x,m;
cin>>n>>x>>m;
vll id(m,-1);
vll a;
ll len=0;
ll tot=0;
while(id[x]==-1){
a.push_back(x);
id[x]=len;
len++;
x=x*x%m;
}
ll loop_sum=0;
for(int i=id[x];i<len;i++){
loop_sum+=a[i];
}
ll ans=0;
if(n<=len){
rep(i,n)ans+=a[i];
}else{
rep(i,id[x])ans+=a[i];
n-=id[x];
ans+=loop_sum*(n/(len-id[x]));
rep(j,n%(len-id[x]))ans+=a[id[x]+j];
}
cout<<ans<<endl;
return 0;
}
| 0
| 3,209,178
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int main()
{
static long i,j,k,l;
long n;
long cnt = 0;
long left,right,mid;
long ans = 0;
int a,b;
static int H[10000];
static int W[10000];
for(i = 0;; i++) {
scanf("%d %d",&H[i],&W[i]);
if(H[i] == 0)
break;
}
for(j = 0; j < i; j++) {
for(l = 0; l < W[j]; l++)
putchar('#');
putchar('\n');
for(k = 1; k < H[j]-1; k++) {
putchar('#');
for(l = 1; l < W[j]-1; l++) {
putchar('.');
}
putchar('#');
putchar('\n');
}
for(l = 0; l < W[j]; l++)
putchar('#');
putchar('\n');
putchar('\n');
}
return 0;
}
|
#include <iostream>
int main(int argc, char const *argv[]) {
int Mid_score=0,Final_score=0,Retest_score=0;
while(1){
int grade=0;
char rank;
std::cin >> Mid_score >> Final_score >> Retest_score;
if(Mid_score==(-1) && Final_score == (-1) && Retest_score == (-1))break;
grade = Mid_score+Final_score;
if(grade >= 80){
rank = 'A';
}else if(grade >= 65 && grade < 80){
rank = 'B';
}else if(grade >= 50 && grade < 65){
rank = 'C';
}else if(grade >= 30 && grade < 50){
if(Retest_score >= 50){
rank = 'C';
}else rank ='D';
}else if(grade < 30){
rank = 'F';
}
if(Mid_score==(-1) || Final_score == (-1)){
rank = 'F';
}
std::cout << rank << std::endl;
}
return 0;
}
| 0
| 98,325,781
|
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
long long int gcd(long long int bdda,long long int chota)
{
if(chota==0)
return bdda;
return gcd(chota,bdda%chota);
}
void solve()
{
long long int n,k;
cin>>k>>n;
long long int a[n];
for(long long int i=0;i<n;i++)cin>>a[i];
long long int curr=0,val=INT_MIN;
for(long long int i=0;i<n-1;i++)
{
curr=a[i+1]-a[i];
val=max(val,curr);
}
curr=k-a[n-1]+a[0];
val=max(val,curr);
cout<<k-val;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
solve();
}
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string S;
cin >> S;
bool iscan = true;
for (int i=0; i<A; i++) {
if (S[i] < '0' || S[i] > '9') {
iscan = false;
}
}
if (S[A] != '-') {
iscan = false;
}
for (int i=A+1; i<=A+B; i++) {
if (S[i] < '0' || S[i] > '9') {
iscan = false;
}
}
if (iscan) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 69,874,541
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int N,K;
cin>>N>>K;
vector<pair<ll,ll>> x;
for(int i(0);i<N;i++){
int t,d;
cin>>t>>d;
x.push_back({d,t});
}
sort(x.rbegin(),x.rend());
ll sum(0);
int used[100001] = {0};
priority_queue<ll, vector<ll>, greater<ll> > q;
priority_queue<ll> p;
ll cnt(0);
for(int i(0);i<K;i++){
sum += x[i].first;
used[x[i].second]++;
if(used[x[i].second] >= 2) q.push(x[i].first);
else cnt++;
}
for(int i(0);i<N;i++){
if(used[x[i].second] == 0){
p.push(x[i].first);
used[x[i].second] = 1;
}
}
ll ans = sum + cnt*cnt;
while(!q.empty() && !p.empty()){
sum -= q.top();q.pop();
sum += p.top();p.pop();
cnt++;
ans = max(ans,sum+cnt*cnt);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<vector<int>> A(N, vector<int>(M));
vector<int> c(N);
for (int i = 0; i < N; i++) {
cin >> c.at(i);
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int ans = 12345678;
for (int bit = 0; bit < (1 << N); bit++) {
int cost = 0;
vector<int> level(M);
for (int i = 0; i < N; ++i) {
if (bit & (1 << i)) {
cost += c.at(i);
for (int j = 0; j < M; j++) {
level.at(j) += A.at(i).at(j);
}
}
}
bool ok = true;
for (int j = 0; j < M; j++) {
if (level.at(j) < X) ok = false;
}
if (ok) ans = min(ans, cost);
}
if (ans == 12345678) cout << -1 << endl;
else cout << ans << endl;
}
| 0
| 30,656,217
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h,n;
cin>>h>>n;
int a[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
sum+=a[i];
}
if(sum>=h)
cout<<"Yes\n";
else
cout<<"No\n";
exit(0);
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 300000;
int mod = 1e9 + 7;
int a[N], f[N];
string s;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n + n; i++){
if (i % 2){
if (s[i] == 'B') a[i] = -1;
if (s[i] == 'W') a[i] = 1;
} else{
if (s[i] == 'B') a[i] = 1;
if (s[i] == 'W') a[i] = -1;
}
}
int ans = 1;
int k = 0;
for (int i = 0; i < n + n; i++){
if (a[i] == 1) k++; else{
ans = ans * k % mod;
k--;
}
if (k < 0) ans = 0;
}
if (k != 0) ans = 0;
f[0] = 1;
for (int i = 1; i <= n; i++) f[i] = f[i - 1] * i % mod;
cout << ans * f[n] % mod;
}
| 0
| 30,419,853
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
int main() {
int n;
while (cin >> n, n) {
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 1e8;
for (int i=0; i<n-1; ++i) {
ans = min(ans, (ll)abs(a[i] - a[i+1]));
}
cout << ans << endl;
}
}
|
#include<iostream>
#include<vector>
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int x=0,y=0,z=0;
int cnt=0;
for (int x = 0; x <=k ; x++) {
for(int y=0;y<=k; y++){
z=s-x-y;
if (z>=0 && z<=k){
cnt++;
}
}
}
cout<<cnt<<endl;
return 0;
}
| 0
| 94,127,592
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
cin >> k;
vector<uint64_t> costs(k, INT_MAX);
priority_queue<pair<uint64_t, int>, vector<pair<uint64_t, int>>,
greater<pair<uint64_t, int>>>
q;
costs[1] = 0;
q.push(make_pair(0, 1));
while (!q.empty()) {
auto v = q.top();
q.pop();
int byten = (v.second * 10) % k;
if (v.first < costs[byten]) {
costs[byten] = v.first;
q.push(make_pair(v.first, byten));
}
int next = (v.second + 1) % k;
if (v.first + 1 < costs[next]) {
costs[next] = v.first + 1;
q.push(make_pair(v.first + 1, next));
}
}
cout << costs[0] + 1 << "\n";
}
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a.at(i);
int ans = MOD;
for (int z = -1000; z <= 1000; z++) {
int sum = 0;
rep(j, N) {
sum += (a.at(j) - z) * (a.at(j) - z);
}
ans = min(ans, sum);
}
cout << ans << endl;
return 0;
}
| 0
| 28,645,806
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
long double cnt=0.0;
for(ll i=0;i<n;i++){
long double now;
cin>>now;
cnt+=1/now;
}
cnt=1/cnt;
printf("%.9Lf",cnt);
return 0;
}
|
#include <bits/stdc++.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 sp(n) cout << fixed << setprecision(n)
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; }
typedef long long ll;
using namespace std;
int main(void){
int n;cin>>n;
for(int i=n;i<=1000;i++){
string s=to_string(i);
if((s[0]==s[1]&&s[0]==s[2])){
cout<<i<<endl;
return 0;
}
}
}
| 0
| 53,886,990
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main(){
int num = 0;
int N;
int L, Q;
vector<int> x;
vector<vector<int>> table;
cin>>N;
x.resize(N);
for(int n = N; n > 0; n >>= 1, num++);
table.resize(num+2, vector<int>(N));
for(int i = 0; i < N; i++){
cin>>x[i];
}
cin>>L>>Q;
for(int i = 0; i < N; i++){
table[0][i] = upper_bound(x.begin(), x.end(), x[i] + L) - x.begin() - 1;
}
for(int i = 1; i < (int)table.size(); i++){
for(int j = 0; j < N; j++){
table[i][j] = table[i-1][table[i-1][j]];
}
}
for(int i = 0; i < Q; i++){
int a, b;
int ans = 0;
cin>>a>>b;
a--, b--;
if(a > b) swap(a, b);
for(int k = table.size()-1; k >= 0; k--){
if(table[k][a] < b){
a = table[k][a];
ans += 1<<k;
}
}
if(a != b) ans++;
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n, k;
scanf("%d%d", &n, &k);
vector<int> p(n, 0), l(n, 0);
vector<ll> c(n, 0), s(n, 0);
for (int i = 0; i < n; ++i) {
scanf("%d", &p[i]);
p[i]--;
}
for (int i = 0; i < n; ++i) {
scanf("%lld", &c[i]);
}
for (int i = 0; i < n; ++i) {
if (l[i] == 0) {
int C = 1;
ll S = c[i];
for (int j = p[i]; j != i; S += c[j], ++C, j = p[j]);
l[i] = C;
s[i] = S;
for (int j = p[i]; j != i; l[j] = C, s[j] = S, j = p[j]);
}
}
ll a = ll(-1e18);
for (int i = 0; i < n; ++i) {
if (k < l[i]) {
ll tmp = 0;
for (int j = p[i], m = k; m; --m, j = p[j]) {
tmp += c[j];
a = max(a, tmp);
}
}
else if (s[i] > 0) {
ll tmp = s[i]*ll(k/l[i]-1);
a = max(a, tmp);
for (int j = p[i], m = l[i]+k%l[i]; m; --m, j = p[j]) {
tmp += c[j];
a = max(a, tmp);
}
}
else {
ll tmp = 0;
for (int j = p[i], m = l[i]; m; --m, j = p[j]) {
tmp += c[j];
a = max(a, tmp);
}
}
}
printf("%lld\n", a);
}
| 0
| 80,193,908
|
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
struct UnionFind{
vector<int> data;
UnionFind(int size) : data(size,-1){}
bool unite(int x,int y){
x=root(x),y=root(y);
if(x!=y){
if(data[y]<data[x]){
swap(x,y);
}
data[x]+=data[y],data[y]=x;
}
return x!=y;
}
bool find(int x,int y){
return root(x)==root(y);
}
int root(int x){
return data[x]<0 ? x : data[x]=root(data[x]);
}
int size(int x){
return -data[root(x)];
}
};
int main(){
int n,q;
scanf("%d %d",&n,&q);
UnionFind uf(n);
for(int i=0;i<q;i++){
int c,x,y;
scanf("%d %d %d",&c,&x,&y);
if(c!=0){
if(uf.find(x,y)){
printf("%d\n",1);
}else{
printf("%d\n",0);
}
}else{
uf.unite(x,y);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d<<endl;
#define vecp(p) int aa;cin>>aa;(p).push_back(aa);
#define vecpl(p) long long aa;cin>>aa;(p).push_back(aa);
#define vecps(p) string aa;cin>>aa;(p).push_back(aa);
#define vecp2(p) cin>>aa;(p).push_back(aa);
#define vecpl2(p) long long a b;cin>>ab;(p).push_back(ab);
#define vecps2(p) string ab;cin>>ab;(p).push_back(ab);
#define sorts(c) sort((c).begin(),(c).end());
#define reverses(c) reverse((c).begin(),(c).end());
#define vec(b) vector<int> (b);
#define vecl(b) vector<long long> (b);
#define vecs(b) vector<string> (b);
#define pb(b,a) (b).push_back((a));
#define doublece(a,b) cout<<(a)<<' '<<(b)<<endl;
#define pairs(s) vector<pair<int,int>> (s);
#define pairsp(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define MOD 998244353
#define cey ce("Yes")
#define cen ce("No")
#define ceY ce("YES")
#define ceN ce("NO")
ll inv(ll a, ll p) {
ll res = 1;
while (p > 0) {
if ((p & 1) == 1) { res *= a; res %= MOD; }
a = a * a % MOD;
p >>= 1;
}
return res;
}
int main()
{
int N;
cin >> N;
map<int, int> K;
int maxi = 0;
fx(N) {
int a;
cin >> a;
K[a]++;
if (x==0&&a!=0) {
ce(0);
return 0;
}
maxi = max(maxi, a);
}
if (K[0]!=1) {
ce(0);
return 0;
}
ll ans = 1;
fyg(maxi+1,2) {
ans *= inv(K[y-1],K[y]);
ans %= MOD;
}
ce(ans)
return 0;
}
| 0
| 27,016,833
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
#define vll vector<ll>
#define vbool vector<bool>
#define INF 100000000
int main(){
ll n,m;
cin >> n >> m;
ll ans = 0;
if(n*2 <= m){
ans += n;
m -= n*2;
}
else{
ans += m/2;
m %= 2;
}
if(m >= 4){
ans += m/4;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
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;}
int main() {
#if LOCAL&01
std::ifstream in("./test/sample-1.in");
std::cin.rdbuf(in.rdbuf());
#else
cin.tie(0);
ios::sync_with_stdio(false);
#endif
ll N1,N2,N3,N4; cin>>N1>>N2>>N3>>N4;
map<ll,ll> tbl;
tbl[N1]++;
tbl[N2]++;
tbl[N3]++;
tbl[N4]++;
if (tbl.count(1)==1
&& tbl.count(9)==1
&& tbl.count(7)
&& tbl.count(4)){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
}
| 0
| 43,458,953
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int> > VVI;
typedef vector< vector<ll> > VVL;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pf push_front
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ub upper_bound
#define lb lower_bound
int main(){
int N;
cin>>N;
VI A(N),B(N);
rep(i,N) cin>>A[i]>>B[i];
ll sum=0;
rep(i,N) sum+=A[i];
int tmp=1001001001;
rep(i,N){
if(A[i]>B[i]) tmp=min(tmp,B[i]);
}
int F=1;
rep(i,N) F*=(A[i]==B[i]);
cout<<(F?0:sum-tmp)<<endl;
}
|
#include<cstdio>
#include<algorithm>
void read_int (int &a) {
char c=getchar(); a=0;
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') a=(a<<1)+(a<<3)-48+c,c=getchar();
return;
}
int n,a[200003];
int num[200003],pla[200003],tot,w;
bool inc (int lim) {
if (pla[tot]!=w)
++tot,pla[tot]=w,num[tot]=0;
++num[tot];
while (num[tot]==lim) {
if (pla[tot]==1) return false;
if (pla[tot-1]!=pla[tot]-1)
--pla[tot],num[tot]=1;
else --tot,++num[tot];
} return true;
}
bool judge (int lim) {
w=a[1]; tot=0;
for (int now=2;now<=n;now++) {
if (a[now]<w) while (pla[tot]>a[now]) --tot;
else if (a[now]>w) { w=a[now]; continue; }
w=a[now];
if (!inc(lim)) return false;
} return true;
}
int main () {
read_int(n);
for (int i=1;i<=n;i++)
read_int(a[i]);
int left=1,right=n,mid,ans;
while (left<=right) {
mid=left+right>>1;
if (judge(mid)) ans=mid,right=mid-1;
else left=mid+1;
} printf("%d",ans);
return 0;
}
| 0
| 22,306,464
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
string s; cin>>s;
while(true){
if(s.empty())break;
string a,b,c;
a.resize(5);
b.resize(6);
c.resize(7);
int n=s.size();
if(5>n){
cout<<"NO"<<endl;
return 0;
}
rep(i,0,5){
a[i]=s[n-1-i];
}
reverse(all(a));
if(a=="dream" || a=="erase"){
rep(i,0,5)s.pop_back();
continue;
}
if(n>5){
rep(i,0,6){
b[i]=s[n-1-i];
}
}
reverse(all(b));
if(b=="eraser"){
rep(i,0,6)s.pop_back();
continue;
}
if(n>6){
rep(i,0,7){
c[i]=s[n-1-i];
}
}
reverse(all(c));
if(c=="dreamer"){
rep(i,0,7)s.pop_back();
}
else{
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector <int> a(n);
for (auto &i : a) cin >> i;
int ans = 0, A, b;
vector <vector <int> > edge(n);
for (int i = 0; i < m; i++) {
cin >> A >> b;
--A, --b;
edge[A].pb(b);
edge[b].pb(A);
}
for (int i = 0; i < n; i++) {
bool ok = true;
for (auto &j : edge[i]) {
if (a[i] <= a[j]) {
ok = false;
break;
}
}
if (ok) ++ans;
}
cout << ans << '\n';
}
| 0
| 6,374,763
|
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#include <queue>
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
priority_queue<int64_t> A;
for (int64_t i = 0; i < N; i++) {
int64_t tmp;
cin >> tmp;
A.push(tmp);
}
for (int64_t i = 0; i < M; i++) {
auto tmp = A.top();
A.pop();
A.push(tmp/2);
}
int64_t sum = 0;
for (int64_t i = 0; i < N; i++) {
sum += A.top();
A.pop();
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())
const ll M = 1e9+7;
void no(){
cout << 0 << endl;
exit(0);
}
int main(){
ll N; cin >> N;
vector<ll> T(N+2,0), A(N+2,0);
ll bound;
ll maxi = 0;
REP(i, N){
cin >> T[i+1];
if(T[i+1]>T[i]){
bound = i+1;
maxi = T[i+1];
}
}
T[N+1] = maxi;
A[0] = maxi;
REP(i, N) cin >> A[i+1];
REP(i,bound+1){
if(A[i] != maxi) no();
}
ll ans = 1;
FOR(i,1,bound){
if(T[i]>T[i-1]) continue;
(ans *= T[i]) %= M;
}
IFOR(i,bound+1,N+1){
if(A[i]>A[i+1]) continue;
(ans *= A[i]) %= M;
}
cout << ans << endl;
}
| 0
| 45,953,151
|
#include <bits/stdc++.h>
using namespace std;
void bingo(int a1, int a2, int a3, vector<bool>& judge);
int main(){
vector<int> A(9);
for (int i = 0; i < 9; i++){
cin >> A.at(i);
}
int N;
cin >> N;
vector<bool> judge(9, false);
for (int i = 0; i < N; i++){
int B;
cin >> B;
for (int j = 0; j < 9; j++){
if (A.at(j) == B){
judge.at(j) = true;
break;
}
}
}
bingo(0,1,2,judge);
bingo(3,4,5,judge);
bingo(6,7,8,judge);
bingo(0,3,6,judge);
bingo(1,4,7,judge);
bingo(2,5,8,judge);
bingo(0,4,8,judge);
bingo(2,4,6,judge);
cout << "No" << endl;
}
void bingo(int a1, int a2, int a3, vector<bool>& judge){
if (judge.at(a1) == true && judge.at(a2) == true && judge.at(a3) == true){
cout << "Yes" << endl;
exit(0);
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
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(v) (v).begin(), (v).end()
#define MP make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int MOD = 1e9 + 7;
int main()
{
int N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
vector<char> hand(N);
int score = 0;
rep(i, N)
{
if (i - K < 0)
{
if (T[i] == 's')
{
score += R;
hand[i] = 'R';
}
else if (T[i] == 'p')
{
score += S;
hand[i] = 'S';
}
else
{
score += P;
hand[i] = 'P';
}
}
else
{
if (T[i] == 's' && hand[i - K] != 'R')
{
score += R;
hand[i] = 'R';
}
else if (T[i] == 'p' && hand[i - K] != 'S')
{
score += S;
hand[i] = 'S';
}
else if (T[i] == 'r' && hand[i - K] != 'P')
{
score += P;
hand[i] = 'P';
}
else
{
hand[i] = '0';
}
}
}
cout << score << endl;
return 0;
}
| 0
| 24,607,342
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w, m; cin >> h >> w >> m;
vector<int> hc(h, 0), wc(w, 0);
vector<vector<int> > p(m, vector<int>(2));
for (int i = 0; i < m; i++) {
cin >> p[i][0] >> p[i][1];
p[i][0]--; p[i][1]--;
hc[p[i][0]]++;
wc[p[i][1]]++;
}
int mh = 0, mw = 0;
for (int i = 0; i < h; i++)
mh = max(mh, hc[i]);
long long th = 0;
for (int i = 0; i < h; i++) {
if (mh == hc[i])
th++;
}
for (int i = 0; i < w; i++)
mw = max(mw, wc[i]);
long long tw = 0, cnt = 0;
for (int i = 0; i < w; i++) {
if (mw == wc[i])
tw++;
}
for (int i = 0; i < m; i++) {
if (hc[p[i][0]] == mh && wc[p[i][1]] == mw)
cnt++;
}
if (cnt >= th*tw)
cout << mh + mw -1 << endl;
else
cout << mh + mw << endl;
return 0;
}
|
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
ll n,arr[100005],ps[100005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
sort(arr+1,arr+n+1);
for(int i=1;i<=n;i++){
ps[i]=ps[i-1] + arr[i];
}
for(int i=n-1;i>=1;i--){
if(ps[i]*2>=arr[i+1]){
continue;
}
else {
cout<<n-i<<endl;
return 0;
}
}
cout<<n<<endl;
}
| 0
| 51,709,914
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
int a[N];
for(int i=0;i<N;i++){
cin >> a[i];
}
int b[N];
for(int i=0;i<N;i++){
cin >> b[i];
}
int ans=0;
ll p=0;
vector<int> c;
for(int i=0;i<N;i++){
if(b[i]-a[i]>0){
p+=b[i]-a[i];
ans++;
}else c.push_back(a[i]-b[i]);
}
sort(c.begin(),c.end(),greater<int>());
for(auto tmp:c){
if(p<=0) break;
p-=tmp;
ans++;
}
if(p>0){
cout << -1 << endl;
}else{
cout << ans << endl;
}
}
|
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; }
else if(k == 1) { return n; }
else return C(n-1,k-1) + C(n-1,k);
}
lint P(lint n, lint k) {
if(k == 1) { return n; }
return (n*(P(n-1,k-1)%1000000007)%1000000007);
}
int main() {
lint n; cin >> n;
vector<lint> a(n+1); for(lint i=0;i<=n;i++) { cin >> a[i]; }
vector<lint> b(n+1), c(n+1);
b[n] = a[n];
c[0] = 1LL;
for(lint i=n-1;i>=0;i--) { b[i] = b[i+1]+a[i]; }
for(lint i=1;i<=n;i++) { c[i] = min((c[i-1]-a[i-1])*2,(lint)1000000000000000); }
lint ans=0LL;
for(lint i=0;i<=n;i++) {
if(a[i] > c[i]) {
cout << "-1\n";
return 0;
}
ans += min(lint(b[i]),lint(c[i]));
}
cout << ans << endl;
return 0;
}
| 0
| 39,697,378
|
#include <iostream>
#include <vector>
#include <string>
typedef long long LL;
using namespace std;
int main(){
string n;
int ns;
int k;
cin >> n;
cin >> k;
ns = n.size();
vector<vector<LL>> dp0(ns+1, vector<LL>(k+1, 0));
vector<vector<LL>> dp1(ns+1, vector<LL>(k+1, 0));
dp0[0][0]=1;
dp1[1][1]=1;
int tmp;
for(int i=0; i<ns; i++){
tmp = n[i]-'0';
for(int j=0; j<=k; j++){
if(tmp==0){
dp0[i+1][j]+=dp0[i][j];
if(j+1<=k){
dp0[i+1][j+1]+=dp0[i][j]*9;
}
if(j!=0){
dp1[i+1][j]+=dp1[i][j];
}
}else{
dp0[i+1][j]+=dp0[i][j]+dp1[i][j];
if(i==0 && j==0){
dp0[i+1][j+1]+=dp0[i][j]*(tmp-1);
}else if(j+1<=k){
dp0[i+1][j+1]+=dp0[i][j]*9+dp1[i][j]*(tmp-1);
}
if(j!=0 && j+1<=k){
dp1[i+1][j+1]+=dp1[i][j];
}
}
}
}
cout << dp0[ns][k]+dp1[ns][k] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll h, w, d;
cin >> h >> w >> d;
vector<ll> a(h*w+1), x(h*w+1);
ll q, c;
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
cin >> c;
a[c] = i;
x[c] = j;
}
}
vector<ll> b(h*w+1, 0);
ll le, ri;
for(int i=1;i<=d;i++){
ll now = i;
while(now + d <= h * w){
ll nx = now + d;
b[nx] = b[now] + abs(x[now] - x[nx]) + abs(a[now] - a[nx]);
now = nx;
}
}
cin >> q;
vector<ll> ans;
for(int i=0;i<q;i++){
cin >> le >> ri;
ans.pb(b[ri] - b[le]);
}
for(auto& i: ans){
cout << i << endl;
}
return 0;
}
| 0
| 40,515,977
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
int cal(vector<int> &a, int n) {
vector<int> b(n);
for (int i = 0; i < n; i++) b[i] = i + 1;
int cnt = 1;
while (a != b) {
cnt++;
next_permutation(all(b));
}
return cnt;
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
vector<int> a(n), b(n);
for (auto &i : a) cin >> i;
for (auto &i : b) cin >> i;
cout << abs(cal(a, n) - cal(b, n)) << '\n';
}
|
#include<bits/stdc++.h>
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++)
int main(){
string s; cin>>s;
if(sz(s)<4) cout<<"No";
else{
string t="";
rep(i,4){
t+=s[i];
}
if(t=="YAKI") cout<<"Yes";
else cout<<"No";
}
}
| 0
| 11,667,362
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n;
cin >> n;
vl a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0, m = 0;
priority_queue<ll> q;
rep(i, n) {
if(a[i] > b[i])
q.push(a[i] - b[i]);
else if(a[i] < b[i]) {
m += b[i] - a[i];
ans++;
}
}
while(!q.empty() && m > 0) {
ll k = q.top();
q.pop();
m -= k;
ans++;
}
if(m > 0) ans = -1;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z) lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y)
#define deg2rad(deg) ((((double)deg)/((double)360)*2*M_PI))
#define rad2deg(rad) ((((double)rad)/(double)2/M_PI)*(double)360)
#define Find(set, element) set.find(element) != set.end()
#define Decimal(x) printf("%.10f\n", x)
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
#define debug(x) cerr << #x << ": " << (x) << "\n";
typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<int>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<vector<vector<PI>>> vvvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<vector<vector<PLL>>> vvvpl;
int POWINT(int x, int n) {
int ret = 1;
rep(i, 0, n) ret *= x;
return ret;
};
ll POWLL(ll x, int n) {
ll ret = 1;
rep(i, 0, n) ret *= x;
return ret;
};
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
};
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> A(3);
rep(i, 0, 3) {
cin >> A[i];
}
sort(All(A));
int ans = 1e9+7;
do {
ans = min(ans, abs(A[0] - A[1]) + abs(A[1] - A[2]));
} while (next_permutation(All(A)));
cout << ans << endl;
return 0;
};
| 0
| 81,673,006
|
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
string S;
cin >> S;
string A = S.substr(2, S.size() - 3);
if (S[0] == 'A') {
if (count(A.begin(), A.end(), 'C') == 1) {
sort(S.begin(), S.end());
int Q = 0;
for (int i = 0; i < S.size(); i++) {
if (islower(S[i])) Q++;
}
if (S.size() - Q == 2) {
cout << "AC" << endl;
return 0;
}
else {
cout << "WA" << endl;
return 0;
}
}
else {
cout << "WA" << endl;
return 0;
}
}
else cout << "WA" << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i=0;i<(n); i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
int main(){
ll n,m;
cin>>n>>m;
ll x[n];
ll y[n];
ll z[n];
rep(i,n){
cin >>x[i]>>y[i]>>z[i];
}
ll xxi,yyi,zzi;
ll xx,yy,zz;
ll ans = 0;
rep(xi,2){
rep(yi,2){
rep(zi,2){
priority_queue<ll> p;
ll tmp = 0;
rep(i, n){
if (xi==0) xxi = -1; else xxi=1;
if (yi==0) yyi = -1; else yyi=1;
if (zi==0) zzi = -1; else zzi=1;
xx = x[i]*xxi;
yy = y[i]*yyi;
zz = z[i]*zzi;
p.push(xx+yy+zz);
}
rep(j,m){
tmp += p.top();
p.pop();
}
chmax(ans, tmp);
}
}
}
cout << ans << endl;
}
| 0
| 6,411,429
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
int min_diff = INT_MAX;;
string s;
cin>>s;
int n=s.length();
for(int i=0;i<n-2;i++){
string res = s.substr(i,3);
int x = stoi(res);
min_diff = min(min_diff,abs(753-x));
}
cout<<min_diff<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi >
#define str string
#define vs vector<str>
#define vb vector<bool>
#define slli set<lli>
#define mii map<int, int>
#define mlli map<int, lli>
#define msi map<str, int>
#define mp make_pair
#define pii pair<int, int>
#define pll pair<lli, lli>
#define vpii vector<pii >
#define vpll vector<pll >
#define pb push_back
#define loop(i, s, l, j) for(int i = s; i < l; i += j)
#define rloop(i, s, l, j) for(int i = s; i >= l; i -= j)
#define rep(i, n) loop(i,0,n,1)
#define rrep(i, n) rloop(i,n-1,0,1)
#define fastio() ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ft first
#define sd second
#define mit mii::iterator
#define vit vi::iterator
#define all(a) a.begin(),a.end()
#define min3(a, b, c) min(a, min(b, c))
#define mod 1000000007
#define inf 1000000000
#define limit 200001
int dx4[4] = {0, -1, 0, 1};
int dy4[4] = {1, 0, -1, 0};
int dx8[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int Power(int base,int exp){int ans=1; while(exp > 0){if(exp&1)ans=(1LL*ans*base)%mod; exp=exp>>1; base=(1LL*base*base)%mod;} return ans;}
void input()
{
int n;
cin >> n;
vlli div(n+1, 1);
loop(p,2,n+1,1)
{
if(div[p] != 1)
continue;
loop(j,p,n+1,p)
{
int x = j, e = 0;
while(x%p == 0)
e++, x=x/p;
div[j] = div[j] * (1 + e);
}
}
lli ans = 0;
rep(i,n+1)
ans += i * div[i];
cout << ans << '\n';
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio();
int q = 1;
while(q--)
input();
}
| 0
| 94,362,453
|
#include<iostream>
using namespace std;
int main() {
int n, b, f, r, v;
int count[5][4][11] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
count[b][f][r] += v;
}
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 3; j++) {
for (int k = 1; k <= 10; k++) {
cout << ' ' << count[i][j][k];
}
cout << "\n";
if (j == 3 && i != 4)
cout << "####################\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
bool ok=false;
for(int i=a;i<a*b;i+=a){
if(i%b==c){
ok=true;
break;
}
}
if(ok)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}
| 0
| 31,763,488
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c;
cin >> a >> b >> c;
if(a+b>=c){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long w=10;
int n;
int ans=0;
char s[10];
int main(){
cout << "? 10000000000" << endl;
cin>>s;
if (s[0]=='Y') {
long long x=2;
while(true) {
cout<<"? "<<x<<endl;
cin>>s;
if (s[0]=='Y') {
cout<<"! "<<x/2<<endl;
return 0;
}
x*=10;
}
}
while(1){
cout<<"? "<<w<<"\n";
cin>>s;
if(s[0]=='N') break;
w=w*10;
}
long long l=w/10,r=w-1,mid;
while(l!=r){
mid=(l+r)/2*1000000000;
cout<<"? "<<mid<<"\n";
cin>>s;
if(s[0]=='Y') r=mid/1000000000;
else l=mid/1000000000+1;
}
printf("! %lld\n",l);
return 0;
}
| 0
| 1,938,306
|
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;
long long mod_pow(long long a, long long b) {
long long res = 1, mul = a;
for (int i = 0; i < 31; ++i) {
if (b >> i & 1) {
res *= mul;
res %= MOD;
}
mul = (mul * mul) % MOD;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({ to,cost });
G[to].push_back({ from,cost });
}
int main() {
long long n, ans = 100000;
cin >> n;
while (n--) { ans = (ans + ans / 20 + 999) / 1000 * 1000; }
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> p(n), x(n + 1);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
x.at(p.at(i)) = i;
}
multiset<ll> s;
s.insert(x.at(n));
s.insert(-1);
s.insert(-1);
s.insert(n);
s.insert(n);
ll ans = 0;
for (int i = n - 1; i >= 1; i--) {
s.insert(x.at(i));
auto now = s.find(x.at(i));
auto b = now;
b--;
auto a = b;
a--;
auto c = now;
c++;
auto d = c;
d++;
ll keep = (*now - *b) * (*d - *c) + (*b - *a) * (*c - *now);
ans += keep * i;
}
cout << ans << '\n';
}
| 0
| 74,533,408
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int ans = 0;
string s, t;
cin >> s >> t;
rep(i, 3) {
if (s[i] == t[i]) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
constexpr int MaxN = 100000;
int main()
{
int N, M;
cin >> N >> M;
vector<int64_t> A(N);
for (int i = 0; i < N; ++i)
{
cin >> A[i];
}
vector<int64_t> B(N);
B[0] = A[0];
for (int i = 1; i < N; ++i)
{
B[i] = A[i] + B[i-1];
}
map<int64_t, int64_t> num;
for (int i = 0; i < N; ++i)
{
++num[B[i] % M];
}
int64_t sum = 0;
for (auto n : num)
{
if (n.first == 0)
{
sum += n.second;
}
sum += n.second * (n.second - 1) / 2;
}
cout << sum << endl;
return 0;
}
| 0
| 44,895,840
|
#include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int64_t>>;
int main(){
int64_t N;cin>>N;
Graph G(N);
for(int i=0;i<N-1;i++){
int64_t u,v;cin>>u>>v;u--;v--;
G[u].push_back(v);
G[v].push_back(u);
}vector<int64_t>C(N);C.at(0)=1;
for(int i=1;i<N;i++){
int64_t a=C.at(i-1)+i+1;
for(auto v:G[i]){
if(v<i)
a-=(v+1);
}C[i]=a;
}int64_t ans=0;
for(int i=0;i<N;i++)
ans+=C.at(i);
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
int main(){
int n;
cin >> n;
vector<vector<int>> S_list(n, vector<int>(26, 0));
REP(i,n){
string tmp;
cin >> tmp;
for(char c : tmp){
int index = (int)(c - 'a');
S_list[i][index]++;
}
}
vector<int> ans(26,0);
REP(i,26){
int min_c = S_list[0][i];
for(int j=0; j<n; j++){
chmin(min_c, S_list[j][i]);
}
ans[i] = min_c;
}
string ans_S = "";
REP(i, 26){
for(int j=0; j<ans[i]; j++){
ans_S += 'a' + i;
}
}
cout << ans_S << endl;
return 0;
}
| 0
| 80,427,657
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define vi vector<int>
template <class t, class u>
bool chmax(t &a, u b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class t, class u>
bool chmin(t &a, u b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
ll mod = 1000000007;
signed main()
{
string s;
cin >> s;
int cnt = 0;
rep(i, s.size() - 1)
{
if (s[i] != s[i + 1])
{
cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
string s;
void solve() {
int cnt = 0;
int l = 0, r = s.size() - 1;
while (l < r) {
if (s[l] == s[r]) {
l++;
r--;
} else if (s[l] == 'x') {
cnt++;
l++;
} else if (s[r] == 'x') {
cnt++;
r--;
} else {
cout << -1 << endl;
return;
}
}
cout << cnt << endl;
}
int main() {
cin >> s;
solve();
}
| 0
| 60,974,933
|
#include <cstdio>
#include <cstring>
#define MAXN 200010
#define LL long long
struct edge{
int to,next;
edge(int _to=0,int _next=0):to(_to),next(_next){}
}e[MAXN<<1];
LL n,m;
int g[MAXN],nume;
int c[MAXN],nowc,d[MAXN],tag[MAXN];
void addEdge(int u,int v){
e[nume]=edge(v,g[u]);
g[u]=nume++;
}
void dfs(int x){
c[x]=nowc;
for(int i=g[x];~i;i=e[i].next)
if(!c[e[i].to]){
d[e[i].to]=!d[x];
dfs(e[i].to);
}
}
int main(){
memset(g,-1,sizeof g);
scanf("%lld%lld",&n,&m);
for(int i=1;i<=m;i++){
int u,v;
scanf("%d%d",&u,&v);
addEdge(u,v); addEdge(v,u);
}
LL c0=0,c1=0,c2=0;
for(int i=1;i<=n;i++)
if(!c[i]){
if(g[i]==-1){
c0++;
continue;
}
nowc=i;
d[i]=0;
dfs(i);
}
for(int x=1;x<=n;x++)
for(int i=g[x];~i;i=e[i].next)
if(d[x]==d[e[i].to])
tag[c[x]]=1;
for(int i=1;i<=n;i++)
if(c[i]==i){
if(tag[i]) c2++;
else c1++;
}
LL ans=0;
ans+=c0*c0+2*c0*(n-c0);
ans+=(c1+c2)*(c1+c2)+c1*c1;
printf("%lld\n",ans);
}
|
#include<iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int X = x2 - x1;
int Y = y2 - y1;
int x3 = x2 - Y;
int y3 = y2 + X;
int x4 = x3 - X;
int y4 = y3 - Y;
cout << x3<<" "<<y3<<" "<<x4<<" "<<y4 << endl;
return 0;
}
| 0
| 54,964,860
|
#include "bits/stdc++.h"
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
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
string S, T;
cin >> S >> T;
int len = 0;
rep(i, N) {
bool ok = true;
rep(j, N - i) {
if (S[i + j] != T[j]) ok = false;
}
if(ok) len = max(len, N - i);
}
cout << N * 2 - len << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MAX=100005;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define sum(v) accumulate(ALL(v),0)
#define fi first
#define se second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
int len=v.size();
for(int i=0; i<len; ++i) {
s<<v[i];
if(i<len-1) s<<" ";
}
return s;
}
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
int len=vv.size();
for(int i=0; i<len; ++i) {
s<<vv[i]<<endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
ll n,a,b;
cin>>n>>a>>b;
if((b-a)%2==0){
cout<<"Alice"<<endl;
}else{
cout<<"Borys"<<endl;
}
return 0;
}
| 0
| 68,590,628
|
#include <stdio.h>
#include <iostream>
using namespace std;
int calcSumOfNumbers(const char x[]);
int main(void)
{
while (1) {
char x[1000] = "\0";
cin >> x;
if (x[0] == '0') break;
cout << calcSumOfNumbers(x) << endl;
}
return 0;
}
int calcSumOfNumbers(const char x[])
{
int sum = 0;
for (int i = 0; x[i] != '\0'; i++) {
sum += x[i] - '0';
}
return sum;
}
|
#include <iostream>
#include <string>
#include <queue>
using namespace std;
struct Point{
int x;int y;
};
int main(){
int w,h,i,j,k,c=0;
string str;
Point p,b;
cin >> w >> h;
while(w!=0&&h!=0){
c=1;
int dp[21][21]={{}};
for(i=0;i<h;i++){
cin >> str;
for(j=0;j<w;j++){
if(str[j]=='.') dp[j][i]= 1;
if(str[j]=='#') dp[j][i]= 2;
if(str[j]=='@') {
dp[j][i]= 3;
p.x=j;p.y=i;
}
}
}
queue <Point> q;
q.push(p);
while(!q.empty()){
p = q.front();
q.pop();
if((p.x+1)<w&&dp[p.x+1][p.y]==1){
c++;
b.x=p.x+1;b.y=p.y;
dp[p.x+1][p.y]=-1;
q.push(b);
}
if((p.x-1)>=0&&dp[p.x-1][p.y]==1){
c++;
b.x=p.x-1;b.y=p.y;
dp[p.x-1][p.y]=-1;
q.push(b);
}
if((p.y+1)<h&&dp[p.x][p.y+1]==1){
c++;
b.x=p.x;b.y=p.y+1;
dp[p.x][p.y+1]=-1;
q.push(b);
}
if((p.y-1)>=0&&dp[p.x][p.y-1]==1){
c++;
b.x=p.x;b.y=p.y-1;
dp[p.x][p.y-1]=-1;
q.push(b);
}
}
cout << c << endl;
cin >> w >> h;
}
return 0;
}
| 0
| 6,190,145
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int i = a * b;
if(i % 2 == 0){
cout << "Even" << endl;
}
else{
cout << "Odd" << endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
intt N, K, R, S, P; std::cin >> N >> K >> R >> S >> P;
std::string T; std::cin >> T;
intt ans = 0;
for (int i = 0; i < K; ++i) {
std::string s;
int j = i;
while (j < N) {
s.push_back(T[j]);
j += K;
}
int t = 0;
for (int k = 0; k < s.size(); ++k) {
if (k > 0 && s[k] == s[k - 1] && t == 1) {
t = 0;
continue;
}
else {
if (s[k] == 'r')
ans += P;
else if (s[k] == 's')
ans += R;
else if (s[k] == 'p')
ans += S;
t = 1;
}
}
}
std::cout << ans << std::endl;
return 0;
}
| 0
| 16,308,332
|
#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>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string str;
cin >> str;
rep(i,4) cout << str.at(i);
cout << " ";
rep(i,8) cout << str.at(i+4);
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
int n; cin >> n;
vector<int> a;
int ans(0),t(1);
rep(i,n){
int x; cin >> x;
if(x==t){
t++;
a.push_back(x);
}else{
ans++;
}
}
if(a.size()==0){
cout << -1 << endl;
}else{
cout << ans << endl;
}
return 0;
}
| 0
| 5,194,144
|
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
#ifdef INPUT
#include <sstream>
stringstream input(R"(
6
)");
#define cin input
#endif
int main()
{
int n;
cin >> n;
int k = sqrt((long double)n * 2) + 1;
if (k * (k - 1) / 2 == n)
{
cout << "Yes" << endl;
cout << k << endl;
REP (i, k)
{
cout << k - 1;
int x = i * (i - 1) / 2;
REP (j, i)
cout << ' ' << ++x;
++x;
FOR (j, i, k - 1)
cout << ' ' << (x += j);
cout << endl;
}
} else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MOD=1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(j,k) {
vector<int> b(n+1);
rep(i,n) {
int l=max(0,i-a[i]);
int r=min(n,i+a[i]+1);
b[l]++; b[r]--;
}
rep(i,n) b[i+1]+=b[i];
b.pop_back();
if(a==b) break;
a=b;
}
rep(i,n) cout << a[i] << " ";
cout << endl;
return 0;
}
| 0
| 70,814,887
|
#include<iostream>
#include<cctype>
#include<cstdio>
#include<string>
using namespace std;
int main(){
string str;
int i;
getline(cin,str);
for(i=0;i<str.size();i++){
if(str[i]>='a'&& str[i]<='z'){
str[i]+='A'-'a';
}
else if(str[i]>='A' && str[i]<='Z'){
str[i]+='a'-'A';
}
cout<<str[i];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define all(x) (x).begin(),(x).end()
const int mod = 1e9 + 7;
#define pow abcdef_pow
int pow(int a, int b) {
if (b == 0) return 1;
int t = pow(a, b / 2);
t = (t * t) % mod;
if (b % 2) return (t * a) % mod;
return t;
}
int invc(vector<int> &a) {
int ret = 0, n = a.size();
for (int i = 0; i < n - 1; i++)
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
ret++;
if (ret > mod) ret -= mod;
}
}
return ret;
}
int rmod(int x) {
return x % mod;
}
void Main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &i : a) cin >> i;
vector<int> b(all(a));
b.insert(b.end(), all(a));
int t1 = invc(a), t2 = invc(b) - t1 * 2;
t1 = rmod(t1 * k);
t2 = rmod(rmod(t2 * k) * rmod((k - 1) * pow(2, mod - 2)));
cout << rmod(t1 + t2) << '\n';
}
signed main() {
#ifdef _DEBUG
cerr << "- ---- -- ----- <3\n";
#endif
cin.tie(0)->sync_with_stdio(0);
int T = 1;
while (T--) Main();
}
| 0
| 53,095,074
|
#include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
int ans = (a + b) / 2;
cout << ans + ((a + b) % 2) << endl;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
string x;
cin >> x;
int N = x.size();
vector <char> f(N);
int res;
for(int bit = 0; bit < (1<<N); ++bit){
res = x[0] - '0';
for(int i = 1; i < N; i++){
if(bit & (1<<i)) {
res -= x[i] - '0';
f[i] = '-';
}
else {
res += x[i] - '0';
f[i] = '+';
}
}
if(res == 7){
break;
}
}
cout << x[0] << f[1] << x[1] << f[2] << x[2] << f[3] << x[3] << "=7" << endl;;
return 0;
}
| 0
| 21,997,227
|
#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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> res;
rep(i, n) {
ll sum = 0;
FOR(j, i, n) {
sum += a[j];
res.push_back(sum);
}
}
ll ans = 0;
repr(i, 50) {
vector<ll> nxt;
rep(j, res.size()) {
if (res[j] & (1LL << i)) {
nxt.push_back(res[j]);
}
}
if (nxt.size() >= k) {
ans += (1LL << i);
res = nxt;
}
}
cout << ans << '\n';
return 0;
}
|
#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;
class Matrix {
public:
int r, c;
Matrix () {}
Matrix (int r, int c) : r(r), c(c) {}
};
int main(){
int n;
cin >> n;
vector<Matrix> M(n, Matrix());
for (int i = 0; i < n; i++) {
int r, c;
cin >> r >> c;
Matrix m = Matrix(r, c);
M[i] = m;
}
vector<vector<int>> dp(n, vector<int>(n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (i == j) dp[i][j] = 0;
else dp[i][j] = INF;
for (int w = 1; w < n; w++) {
for (int i = 0; i < n-w; i++) {
int j = i + w;
for (int k = i; k < j; k++) {
int cost = M[i].r * M[k].c * M[j].c;
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + cost);
}
}
}
cout << dp[0][n-1] << '\n';
}
| 0
| 77,206,186
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int m, nmin, nmax;
while(cin >> m >> nmin >> nmax, m | nmin | nmax){
vector<int> P(m);
for(int i = 0; i < m; i++) cin >> P[i];
sort(P.begin(), P.end(), greater<int>());
int ans = 0;
int gap = 0;
for(int n = nmin; n <= nmax; n++){
if(gap <= P[n-1] - P[n]){
gap = P[n-1] - P[n];
ans = n;
}
}
cout << ans << endl;
}
}
|
#include <iostream>
#define SIZE 100
using namespace std;
int main() {
int value[SIZE] = {0}, n, max = 0;
while (cin >> n) {
value[n - 1]++;
if (value[n - 1] > max) max = value[n - 1];
}
for (int i = 1; i <= SIZE; i++) {
if (value[i - 1] == max) {
cout << i << endl;
}
}
return 0;
}
| 0
| 59,477,919
|
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <list>
#include <string.h>
using namespace std;
#define M 1046527
#define MIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if( ch == 'A' ) return 1;
else if ( ch == 'C' ) return 2;
else if ( ch == 'G' ) return 3;
else if ( ch == 'T' ) return 4;
else return 0;
}
long long getKey(char str[]) {
long long sum = 0, p=1, i;
for( i = 0; i < strlen(str); i++) {
sum += p*(getChar(str[i]));
p *= 5;
}
return sum;
}
int h1(int key) {return key % M; }
int h2(int key) {return 1 + (key % (M-1));}
int find(char str[]) {
long long key, i, h;
key = getKey(str);
for( i = 0;; i++) {
h = (h1(key) + i*h2(key)) % M;
if( strcmp(H[h], str) == 0 ) return 1;
else if( strlen(H[h]) == 0 ) return 0;
}
return 0;
}
int insert(char str[]) {
long long key, i, h;
key = getKey(str);
for( i = 0;; i++) {
h = (h1(key) + i*h2(key)) % M;
if(strcmp(H[h], str) == 0) return 1;
else if( strlen(H[h]) == 0) {
strcpy(H[h], str);
return 0;
}
}
return 0;
}
int main() {
int n;
char com[6], str[4];
cin >> n;
for(int i = 0; i < M; i++) H[i][0] = '\0';
for(int i = 0; i < n; i++) {
scanf("%s %s", com, str);
if( com[0] == 'i' ) {
insert(str);
} else if( com[0] == 'f' ) {
if( find(str) ) {
printf("yes\n");
} else printf("no\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m;
cin>>n>>m;
int k[m],s[m][20];
rep(i,m){
cin>>k[i];
rep(j,k[i]){
cin>>s[i][j];
s[i][j]--;
}
}
int p[m];
rep(i,m) cin>>p[i];
int ans=0;
for(int bit=0;bit<(1<<n);bit++){
int a=0;
rep(i,m){
int cnt=0;
rep(j,k[i]) if(bit&(1<<s[i][j])) cnt++;
if(cnt%2==p[i]) a++;
}
if(a==m) ans++;
}
cout<<ans;
}
| 0
| 43,537,678
|
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
string s;
cin >> s;
int n = (int)s.size();
for(int i = 0; i < n; ++i) {
for(int j = i; j < n + 1; ++j) {
string tmp;
for(int k = 0; k < n; ++k) {
if( i <= k && k < j ) continue;
tmp.push_back(s[k]);
}
if( tmp == "keyence" ) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
using point= pair<int64_t, int64_t>;
int N,K;
cin >> N >> K;
const int Kin= K-2;
vector<point> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i).first >> data.at(i).second;
}
sort(data.begin(), data.end());
int64_t ans= INT64_MAX;
for(int j1=0; j1<N; j1++){
for(int j2=j1+1; j2<N; j2++){
point p1= data.at(j1);
point p2= data.at(j2);
int64_t ymax= max(p1.second, p2.second);
int64_t ymin= min(p1.second, p2.second);
if(Kin==0){
int64_t xmax= max(p1.first, p2.first);
int64_t xmin= min(p1.first, p2.first);
ans= min(ans, (xmax- xmin)*(ymax- ymin));
}
else{
vector<int64_t> Xs_in_Yrange;
for(int i=0; i<N; i++){
if(i==j1 || i==j2){ continue; }
else{
if(ymin <= data.at(i).second && data.at(i).second <= ymax){
Xs_in_Yrange.emplace_back(data.at(i).first);
}
}
}
int Nin= Xs_in_Yrange.size();
if(Nin >= Kin){
for(int i=0; i+Kin-1 < Nin; i++){
int64_t xmax= max(Xs_in_Yrange.at(i+Kin-1), max(p1.first, p2.first));
int64_t xmin= min(Xs_in_Yrange.at(i) , min(p1.first, p2.first));
ans= min(ans, (xmax- xmin)*(ymax- ymin));
}
}
}
}
}
cout << ans << endl;
}
| 0
| 44,528,223
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.