code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include<iostream>
using namespace std;
#define MAX 45
int fib[45];
void make_fib(){
fib[0] = 1;
fib[1] = 1;
for (int i=2;i<MAX;i++) {
fib[i] = fib[i-1] + fib[i-2];
}
}
int main() {
int n;
cin >> n;
make_fib();
cout << fib[n] << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
const int INF = 1 << 28;
const ll INF_L = 1LL << 60;
const int MOD = 1e9+7;
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; }
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void Dijkstra(){}
void BellmanFord(){}
void WarshallFloyd(){}
ll gcd(ll A, ll B) {if (A%B == 0) {return(B);} else {return(gcd(B, A%B));}}
ll lcm(ll A, ll B) {return A * B / gcd(A, B);}
ll powMod(ll B, ll P) {
if(P == 0) return 1;
if(P%2 == 0){ll t = powMod(B, P/2); return t*t % MOD;}
return B * powMod(B, P-1) % MOD;
}
const int FAC_INIT_SIZE = 5e6+9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i=2; i < FAC_INIT_SIZE; i++){
fac[i] = fac[i-1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
ll factMod(ll N){return fac[N] % MOD;}
ll factInvMod(ll N){return finv[N] % MOD;}
ll permMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else return factMod(N) * factInvMod(N-K) % MOD;
}
ll combMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else if (N < FAC_INIT_SIZE){ return factMod(N) * (factInvMod(K) * factInvMod(N-K) % MOD) % MOD;}
else {
ll ans = 1; ll Ks = K < N-K ? K : N-K;
for (ll i=N; i > N-Ks; i--) {ans *= i; ans %= MOD;}
return ans * factInvMod(Ks) % MOD;
}
}
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int d[N];
for(int i=0; i<N; i++) cin >> d[i];
sort(d, d+N);
cout << d[N/2] - d[N/2 - 1] << endl;
}
| 0
| 76,198,448
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> hi(n);
for (int i = 0; i < n; i++) cin >> hi.at(i);
int ans = 0;
int h = hi.at(0);
for (int i = 0; i < n; i++) {
if (h <= hi.at(i)) ans++;
h = max(h, hi.at(i));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll a, ll b, ll c);
ll msub(ll a, ll b);
ll mtime(ll a, ll b, ll c);
int main() {
ll a, b, c; cin >> a >> b >> c;
if(a == b) cout << c << endl;
else if(b == c) cout << a << endl;
else cout << b << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
}
| 0
| 89,579,505
|
#include <iostream>
#include <cstdlib>
#include <string>
#include <typeinfo>
#include <cstring>
#include <iostream>
#define MAX 2000001
#define VMAX 10000
using namespace std;
int main(){
unsigned short *A,*B;
int C[VMAX + 1];
int n,i,j;
cin >> n;
A = static_cast<unsigned short*>(malloc(sizeof(short) * n+1));
B = static_cast<unsigned short*>(malloc(sizeof(short) * n+1));
for(i = 0; i <= VMAX; i++)C[i] = 0;
for(i = 0; i < n; i++){
cin >> A[i+1];
C[A[i+1]]++;
}
for(i = 1;i <= VMAX; i++)C[i] = C[i] + C[i - 1];
for(j = 0;j <= n; j++){
B[C[A[j]]] = A[j];
C[A[j]]--;
}
for(i = 1; i <= n; i++){
if(i > 1)cout << " ";
cout << B[i];
}
cout << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
vector<int> G[100000];
vector<int> C[100000];
int n; bool used[100000];
int dfs(int k) {
int res = 0;
int len = G[k].size();
rep(i, len) {
int v = G[k][i];
res ^= dfs(v)+1;
}
return res;
}
int main() {
cin >> n;
rep(i, n - 1) {
int x, y; cin >> x >> y; x--; y--;
C[x].push_back(y);
C[y].push_back(x);
}
fill(used, used + n, false);
queue<int> q; q.push(0); used[0] = true;
while (!q.empty()) {
int x = q.front(); q.pop();
int len = C[x].size();
rep(i, len) {
int v = C[x][i];
if (used[v])continue;
used[v] = true; q.push(v); G[x].push_back(v);
}
}
if (dfs(0))cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
}
| 0
| 75,559,496
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
Pi dp[1<<18];
int main(){
int N; cin >> N;
vector<int> A(1<<N);
rep(i,1<<N){
cin >> A[i];
dp[i] = {A[i],-1};
}
rep(i,N)rep(j,1<<N){
if(j>>i&1){
vector<int> v(4);
v[0] = dp[j].first;
v[1] = dp[j].second;
v[2] = dp[j^(1<<i)].first;
v[3] = dp[j^(1<<i)].second;
sort(v.begin(),v.end());
dp[j].first = v[3];
dp[j].second = v[2];
}
}
int ans = -1;
repr(i,1,1<<N){
ans = max(ans,dp[i].first+dp[i].second);
cout << ans << endl;
}
}
|
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int INF = 1000000007;
int dp[30][200000];
int main(){
int n,m;
int c[30];
cin >> n >> m;
rep(i,m){
cin >> c[i] ;
}
rep(j,30){
rep(i,200000){
dp[j][i] = INF;
}
}
rep(j,30){
dp[j][0] = 0;
}
for(int i = 1;i<m+1;i++){
for(int j = 0;j<n+1;j++){
if(j-c[i-1] >= 0 )
dp[i][j] = min( dp[i][j-c[i-1]]+1, dp[i-1][j] );
else
dp[i][j] = dp[i-1][j] ;
}
}
cout << dp[m][n] << endl;
return 0;
}
| 0
| 29,625,952
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
const int INF = 1000010;
int MCMP(int N, int R[], int C[]) {
int dp[N][N];
rep(i, N) rep(j, N) {
if (i==j) dp[i][j] = 0;
else dp[i][j] = INF;
}
for (int len=0; len<=N; len++) {
for (int s=0; s+len<N; s++) {
int left = s, right = s+len;
for (int mid=left; mid<right; mid++) {
int lmr_num;
lmr_num = dp[left][mid] + dp[mid+1][right] + R[left] * C[mid] * C[right];
dp[left][right] = min(dp[left][right], lmr_num);
}
}
}
return dp[0][N-1];
}
int main() {
int N;
cin >> N;
int R[N], C[N];
rep(i, N) cin >> R[i] >> C[i];
cout << MCMP(N, R, C) << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cmath>
const int MaxN = 1e6;
using namespace std;
int pre[2 * MaxN + 5] , last[MaxN + 5] , other[MaxN + 5];
int all , n , res[MaxN + 5];
void Build(int u , int v){
pre[++all] = last[u];
last[u] = all;
other[all] = v;
}
void dfs(int x , int fa){
int ed = last[x];
while(ed != -1){
int dr = other[ed];
if(dr != fa){
dfs(dr , x);
res[x] ^= res[dr] + 1;
}
ed = pre[ed];
}
}
int main()
{
while(~scanf("%d" , &n)){
all = -1;
memset(last , -1 , sizeof(last));
memset(res , 0 , sizeof(res));
for(int i = 1;i <= n - 1;i++){
int u , v;
scanf("%d%d" , &u , &v);
Build(u , v); Build(v , u);
}
dfs(1 , 0);
if(res[1]) printf("Alice\n");
else printf("Bob\n");
}
}
| 0
| 92,530,479
|
#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, m;
cin >> n >> m;
pair<ll, int> d[n];
rep(i, n) cin >> d[i].first >> d[i].second;
sort(d, d + n);
ll ans = 0, cnt = 0;
rep(i, n) {
if (cnt + d[i].second <= m) {
ans += d[i].first * d[i].second;
cnt += d[i].second;
} else {
ans += (m - cnt) * d[i].first;
cnt = m;
}
if (cnt == m) break;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <set>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace std;
#define dbg(x) cerr << #x " = " << x << endl;
typedef pair<int, int> P;
typedef long long ll;
#define FIN freopen("in.txt", "r", stdin);
int main()
{
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i)
{
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j)
{
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0; i < M; ++i)
cin >> p[i];
int ans = 0;
for (int i = 0; i < (1 << N); ++i)
{
bool ok = true;
for (int j = 0; j < M; ++j)
{
int c = 0;
for (int id : vec[j])
{
if ((i >> id) & 1)
{
++c;
}
}
c %= 2;
if (c != p[j])
{
ok = false;
}
}
if (ok)
{
++ans;
}
}
cout << ans << endl;
return 0;
}
| 0
| 80,951,789
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define whatis(x) cout << #x << " is " << x<<" ";
#define whatisl(x) cout << #x << " is " << x<<"\n";
#define parr(array,end)for(ll loop=0;loop<end;loop++)cout<<array[loop]<<" ";cout<<"\n";
#define lline cout<<"\n";
#define errorl(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);cout<<"\n";}
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);cout<<"___";}
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a <<" , ";
err(++it, args...);
}
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define testcase ll tt; cin >> tt; while(tt--)
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define vars ll h,i,j,k,d,l,p,q,r,x,y,a,b,c,v,var,n,m,z,s,ans,ind1,ind2,flag,limit1,limit2,limit3,mod;
#define vll vector<ll>
#define pll pair<ll,ll>
#define sll set<ll>
#define pint pair<int,int>
const ll INF=1e9+7;
const ll MOD=1e9+7;
int main()
{
boost vars
cin>>n>>m;
string str;
for(i=0;i<n;i++)
{
cin>>str;
cout<<str<<"\n";
cout<<str<<"\n";
}
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 305;
typedef v(vl) vvl;
struct X {
typedef int T;
vector<T> d;
X() {}
X(vector<T>& a): d(a) {
d.pb(0);
init();
for (T& na : a) na = (*this)(na);
}
void add(const T& x) { d.pb(x);}
void init() {
sort(rng(d));
d.erase(unique(rng(d)), d.end());
}
int size() const { return sz(d);}
T operator[](int i) const { return d[i];}
int operator()(const T& x) const { return upper_bound(rng(d),x)-d.begin()-1;}
} xs;
ll f(int a, int b) {
a = xs[a];
b = xs[b];
return max(0,b-a);
}
int main() {
int n,t;
scanf("%d%d",&n,&t);
vi a(n);
cin>>a;
xs = X(a);
int m = sz(xs);
vvl dp(1,vl(m,LINF));
dp[0][0] = 0;
rep(i,n) {
vvl p(i+2,vl(m,LINF)); swap(dp,p);
rep(j,i+1)rep(k,m) {
ll now = p[j][k];
if (now == LINF) continue;
mins(dp[j][a[i]], now+f(k,a[i]));
mins(dp[j+1][k], now);
}
}
ll ans = LINF;
rep(i,t+1)rep(j,m) mins(ans,dp[i][j]);
cout<<ans<<endl;
return 0;
}
| 0
| 17,696,324
|
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<ll, ll>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
ll bpow(ll b, ll p, ll m = 1000000007LL) {
ll rt = 1;
for (; p; p >>= 1, b = b * b % m)
if (p & 1)
rt = rt * b % m;
return rt;
}
bool check(string a, string b) {
for (int i = 0; i < a.length(); i++) {
if (a[i] != '?' && a[i] != b[i])
return 0;
}
return 1;
}
int main() {
IOS;
string s;
cin >> s;
int ans = 0;
int l = 0, r = s.length() - 1;
while (l < r) {
if (s[l] != s[r] && s[r] != 'x' && s[l] != 'x') {
cout << -1 << endl;
return 0;
} else if (s[l] != s[r] && s[l] == 'x') {
ans++, l++;
} else if (s[l] != s[r] && s[r] == 'x') {
ans++, r--;
} else
l++, r--;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const int mod = 1000000007;
ll cnt = 0;
int main(){
int n; cin >> n;
vector<ll>a(n),b(n);
for(int i=0;i<n;i++){
cin >> a.at(i) >> b.at(i);
}
for(int i=n-1;i>=0;i--){
a[i]+=cnt;
if(a[i] % b[i] != 0){
ll m;
m=a[i] / b[i];
cnt+=(m+1)*b[i]-a[i];
}
}
cout << cnt << endl;
}
| 0
| 23,492,799
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long n, a, res, t;
while (cin >> n, n){
res = -100000000;
t = 0;
for(int i = 0; i < n; i++){
cin >> a;
t = max(t + a, a);
res = max(res, t);
}
cout << res << endl;
}
}
|
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
long long int mod(long long int a,long long int b){
a=a%1000000007;
b=b%1000000007;
return (a*b)%1000000007;
}
int main() {
long long int n,m;cin>>n>>m;
long long int A[n],B[m];
long long int k;cin>>k;
for(long long int i=1;i<=n-1;i++){
long long int b;cin>>b;
A[i]=b-k;
k=b;
}
long long int aa;cin>>aa;
for(long long int i=1;i<=m-1;i++){
long long int b;cin>>b;
B[i]=b-aa;
aa=b;
}
long long int a[n],b[m];
for(int i=1;i<=n-1;i++){
a[i]=i*(n-i);
}
for(int i=1;i<=m-1;i++){
b[i]=i*(m-i);
}
long long int x=0,y=0;
for(int i=1;i<=n-1;i++){
x=x+A[i]*a[i];
}
for(int i=1;i<=m-1;i++){
y=y+B[i]*b[i];
}
long long int ans=mod(x,y);
printf("%lld",ans);
return 0;
}
| 0
| 60,916,514
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long x,a,b;cin>>x>>a>>b;
cout<< (b<=a?"delicious":(b<=a+x?"safe":"dangerous"))<<endl;
}
|
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template<typename T>
T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T>
map<T, T> getPrimeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i] ++;
n /= i;
}
}
if (n != 1) res[n] = 1;
return res;
}
template<typename T>
bool IsPrimeNumber(T num)
{
if (num <= 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i,s,e) for(ll i=s;i<e;i++)
#define repeq(i,s,e) for(ll i=s;i<=e;i++)
map<ll, vll> m;
ll func(ll s) {
ll ret = 0;
rep(i, 0, m[s].size()) {
ret = max(ret, func(m[s][i]));
}
return ret + 1;
}
int main() {
ll A, B, C, K, a, b, c;
std::cin >> A >> B >> C >> K;
if (abs(A-B) > 10e18) {
std::cout << "Unfair" << endl;
return 0;
}
else if (K % 2 == 0) {
std::cout << A - B << endl;
}
else {
std::cout << B - A << endl;
}
return 0;
}
| 0
| 48,678,647
|
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
template<class T>bool chmax(T &a, const T &b) { return (a<=b)?(a=b,1):0; }
using namespace std;
int main(void){
int m, nmin, nmax;
while(cin>>m>>nmin>>nmax,m,nmin,nmax) {
int res = 0;
int n = 0;
int prev = 0;
rep(i,m) {
int cur; cin >> cur;
if(nmin<=i && i <= nmax) if(chmax(res, prev-cur)) n=i;
prev = cur;
}
cout << n << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
int n;
cin >> n;
int cnt = 0;
int k = 1;
rep(i, n) {
int a;
cin >> a;
if(a != k) {
cnt++;
} else {
k++;
}
}
if(cnt == n) {
cout << -1 << endl;
} else {
cout << cnt << endl;
}
return 0;
}
| 0
| 38,355,415
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int a,b;cin>>a>>b;
int A,B;
vector<int>power={2,3,4,5,6,7,8,9,10,11,12,13,1};
rep(i,power.size()){
if(a==power.at(i)){
A=i;
}
if(b==power.at(i)){
B=i;
}
}
if(A>B)cout<<"Alice"<<endl;
else if(A==B) cout<<"Draw"<<endl;
else cout<<"Bob"<<endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <string.h>
using namespace std;
int main(void)
{
int h, w;
cin >> h;
cin >> w;
char *initmap = (char*) malloc(h * w);
int *changennum = (int*) malloc(h * w * sizeof(int));
{
string s;
getline(cin,s);
for(int r = 0; r < h; r++)
{
getline(cin,s);
for( int c = 0; c < w; c++)
{
if (s[c] == '.')
{
initmap[r * w + c] = 1;
}
else
{
initmap[r * w + c] = 0;
}
}
}
}
changennum[0] = (initmap[0] == 1) ? 0 : 1;
for( int d = 1; d < h + w - 1; d++)
{
for( int r = 0; r < d + 1 && r < h; r++)
{
int c = d - r;
if( c >= w ) continue;
int ans = h + w;
if( c > 0 )
{
int tmp = changennum[ r * w + (c - 1) ];
if( initmap[r * w + c] != initmap[r * w + (c - 1) ] ) tmp++;
ans = tmp;
}
if( r > 0 )
{
int tmp = changennum[ (r - 1) * w + c ];
if( initmap[r * w + c] != initmap[(r - 1) * w + c ] ) tmp++;
if( tmp < ans ) ans = tmp;
}
changennum[ r * w + c ] = ans;
}
}
cout << (changennum[ h * w - 1 ] + 1) / 2;
free(initmap);
free(changennum);
}
| 0
| 38,109,602
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int total = 0, freq[105] = {0};
for(int i = 1; i <= n; i++){
int val;
cin >> val;
freq[val]++;
}
for(int i = 1; i <= 100; i++){
total += (i * freq[i]);
}
int ans1 = total / n, res1 = 0, res2 = 0, ans2 = ans1;
if(total%n) ans2++;
for(int i = 1; i <= 100; i++){
res1 += (freq[i] * (i-ans1) * (i-ans1));
}
for(int i = 1; i <= 100; i++){
res2 += (freq[i] * (i-ans2) * (i-ans2));
}
cout << min(res1, res2) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
string a, b; std::cin >> a >> b;
reverse(rng(b));
if (a == b)
std::cout << "YES" << "\n";
else
std::cout << "NO" << "\n";
}
| 0
| 79,856,733
|
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb push_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())
#ifdef leowang
#define debug(...) do{\
fprintf(stderr,"%s - %d : (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
_DO(__VA_ARGS__);\
}while(0)
template<typename I> void _DO(I&&x){cerr<<x<<endl;}
template<typename I,typename...T> void _DO(I&&x,T&&...tail){cerr<<x<<", ";_DO(tail...);}
#else
#define debug(...)
#endif
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<'('<<P.F<<','<<P.S<<')';
return out;
}
const ll maxn=300005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const double PI=acos(-1);
ll mypow(ll a,ll b){
ll res=1LL;
while(b){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
int main()
{
IOS;
string s;
cin>>s;
bool flag=0;
if(SZ(s)>=4){
if(string(s,0,4)=="YAKI") flag=1;
}
if(flag) cout<<"Yes\n";
else cout<<"No";
return 0;
}
|
#include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define log(x,b) (log(b)/log(x))
#define rep(i,x,y) for(int i=(x);i<(y);i++)
using namespace std;
const int mod=1e9;
int32_t main()
{
int n,m;
cin>>n>>m;
int x[50],y[50],a[50],b[50],res[50]={0};
for(int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
for(int i=1;i<=m;i++){
cin>>a[i]>>b[i];
}
for(int i=1;i<=n;i++){
int men=mod;
for(int j=1;j<=m;j++){
int dist=abs(x[i]-a[j])+abs(y[i]-b[j]);
if(dist<men){
men=dist;
res[i]=j;
}
}
}
for(int i=1;i<=n;i++){
cout<<res[i]<<endl;
}
return 0;
}
| 0
| 93,753,829
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
bool flag[10] = {false};
rep(i, 4) {
int a;
cin >> a;
flag[a] = true;
}
if (flag[1] && flag[9] && flag[7] && flag[4])
cout << "YES";
else
cout << "NO";
cout << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#define ll long long int
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
using namespace std;
int mx4[] = {0,1,0,-1};
int my4[] = {1,0,-1,0};
int mx2[] = {1,0};
int my2[] = {0,1};
class DCardEater {
public:
void solve(istream& in, ostream& out) {
int n; in >> n;
vector<int> a(n);
rep(i,n) in >> a[i];
sort(a.begin(),a.end());
int cnt = 0;
rep(i,n-1) {
if(a[i+1] == a[i]) cnt++;
}
if(cnt % 2 == 0) out << n - cnt << endl;
else out << n - cnt - 1 << endl;
}
};
int main() {
DCardEater solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0
| 49,235,437
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
char next;
set<string> SE;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
if (SE.count(S)) return cout << "No" << "\n", 0;
if (i && S.front() != next) return cout << "No" << "\n", 0;
SE.insert(S);
next = S.back();
}
cout << "Yes" << "\n";
}
|
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
using std::map;
using std::set;
using std::bitset;
using std::vector;
using std::string;
using std::multimap;
using std::multiset;
using std::deque;
using std::queue;
using std::stack;
using std::pair;
using std::iterator;
using std::sort;
using std::stable_sort;
using std::reverse;
using std::max_element;
using std::min_element;
using std::unique;
using std::ios_base;
using std::swap;
using std::fill;
using std::setprecision;
using std::fixed;
using std::min;
using std::max;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
namespace MySpace{
};
#define F(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define fi first
#define se second
#define re return
#define all(x) (x).begin(), (x).end()
inline int nextInt()
{
int x = 0;
char c = getchar();
int mi = (c == '-');
if (c == '-') c = getchar();
while ('0' <= c && c <= '9')
{
x = 10 * x + c - '0';
c = getchar();
}
if (mi) return x * -1;
return x;
}
int n;
int a[500000];
int b[500000];
int p[500000];
int pos[500000];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> p[i];
for (int i = 1; i <= n; i++) pos[p[i]] = i;
for (int i = 1; i <= n; i++) a[i] = b[n - i + 1] = n * i;
for (int i = 1; i <= n; i++) b[p[i]] += i;
for (int i = 1; i <= n; i++) cout << a[i] << " "; cout << "\n";
for (int i = 1; i <= n; i++) cout << b[i] << " "; cout << "\n";
}
| 0
| 35,970,355
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
if(b==0){
return a;
}
return gcd(b,a%b);
}
int main(){
ll n,x;cin >> n >> x;
if(n==x*2){
cout << x*3 << endl;
}
else{
cout << (n-gcd(n,x))*3 << endl;
}
}
|
#include <stdio.h>
int main(int argc, char *argv[])
{
int t;
scanf("%d",&t);
int a[100000];
int count[100005]={0};
for(int i=0;i<t;i++){
scanf("%d",&a[i]);
if(a[i]==0){
count[a[i]]++;
count[a[i]+1]++;
}
else{
count[a[i]]++;
count[a[i]-1]++;
count[a[i]+1]++;
}
}
int max=count[0];
for(int i=1;i<100000;i++){
if(count[i]>max) max=count[i];
}
printf("%d",max);
return 0;
}
| 0
| 49,422,595
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,j,n) for(int i = j; i < n; i++)
#define mreps(i,j,n) for(int i = j; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x,val) x.erase(remove(all(x), val), x.end())
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
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; }
set<ll> divisors(ll n)
{
set<ll> res;
for (ll i = 1; i*i <= n; i++)
{
if (n % i == 0)
{
res.insert(i);
res.insert(n / i);
}
}
return res;
}
void solve()
{
int n;
cin >> n;
map<int, int> mp;
vector<int> a(n);
int a_ma = 0;
rep(i, n)
{
cin >> a[i];
mp[a[i]]++;
chmax(a_ma, a[i]);
}
sort(all(a));
vector<bool> indivisible(a_ma+1, true);
int ans = 0;
rep(i, n)
{
if(indivisible[a[i]])
{
if(mp[a[i]] == 1)ans++;
int j = 1;
while (j * a[i] <= a_ma)
{
indivisible[j*a[i]] = false;
j++;
}
}
}
cout << ans << endl;
return;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll n, m; cin >> n >> m;
vector<pair<ll, ll>> std(n), chk(m);
rep(i, n) cin >> std[i].first >> std[i].second;
rep(i, m) cin >> chk[i].first >> chk[i].second;
rep(i, n){
ll minV = INFLL, minI = -1;
rep(j, m){
ll tmp = abs(std[i].first-chk[j].first) + abs(std[i].second-chk[j].second);
if(minV > tmp){
minV = tmp;
minI = j+1;
}
}
cout << minI << endl;
}
}
| 0
| 76,824,924
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef std::string str;
#define sei set<int>
#define sell set<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vld vector<ld>
#define vstr vector<str>
#define vpii vector<pii>
#define vpll vector<pll>
#define all(v) v.begin(),v.end()
#define foa(i,v) for(auto i : v)
#define fo(i,a,b) for(int i=a;i<b;i++)
#define fo_(i,a,b) for(int i=a;i>b;i--)
#define M(a) memset(a,0,sizeof a)
#define M_(a) memset(a ,-1,sizeof a)
#define deb(x) cerr << #x << " = " << x << endl
#define pb push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define OK order_of_key
#define FO find_by_order
#define nmax 1000100
const ld PI = 3.141592653589793238462643383279;
const ll inf = std::numeric_limits<ll>::max();
const int infint = std::numeric_limits<int>::max();
const ll mod = 1e9+7;
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
vll divs(ll n){
vll out;
fo(i,1,sqrt(n)+1){
if(n%i == 0 && n/i != i){
out.pb(i);
out.pb(n/i);
}else if(n%i == 0 && n/i == i) out.pb(i);
}
sort(out.begin(),out.end());
return out;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n;
cin >> n;
ll ans = n-1;
foa(i,divs(n)){
ans = min(ans,i-1+n/i-1);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pai pair<int,int>
#define vi vector<long long int>
#define vb vector<bool>
#define vm vector<vector<int> >
#define vd vector<double>
#define vs vector<string>
#define vp vector< pair <string,int> >
#define mpi map<int,int>
#define mps map<char,int>
#define sti stack<int>
#define stc stack<char>
#define sei set<int>
#define ses set<string>
#define multii multiset<int>
#define forn(i,n) for (int i = 0; i < n; i++)
#define fork(i,k,n) for (int i = k; i <= n; i++)
#define forkr(i,k,n) for (int i = k; i >= n; i--)
const int MAX=1e5+1;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin>>n;
vi v(n);
forn(i,n){
cin>>v[i];
}
ll m=v[0];
ll c=0;
for(int i=1;i<n;i++){
if(m>v[i]){
c+=m-v[i];
}
else{
m=v[i];
}
}
cout<<c<<endl;
}
| 0
| 77,636,231
|
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
const double PI=3.14159265358979323846;
const ull ULL_MAX = 1.8446744e+19;
using namespace std;
int main() {
int x, a;
cin >> x >> a;
int ans = x < a ? 0 : 10;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define N 100005
#define ll long long
#define For(i,x,y) for(int i=(x);i<=(y);++i)
#define Rof(i,x,y) for(int i=(x);i>=(y);--i)
#define Edge(x) for(int i=head[x];i;i=e[i].nxt)
#define mset(x,y) memset(x,y,sizeof(x))
#define strL strlen
#define p_b push_back
#define mcpy(x,y) memcpy(x,y,sizeof(x))
#define lson l,mid,(o<<1)
#define rson mid+1,r,((o<<1)|1)
#define Ls (t[o].ls)
#define Rs (t[o].rs)
#define mod
#define file(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
using namespace std;
vector<int> g[N];
int mch[N];
void dfs(int x,int f){
for(auto to:g[x])
if(to!=f){
dfs(to,x);
if(!mch[to]) mch[x]=to,mch[to]=x;
}
if(!mch[x]){
if(mch[f] || f==0){
puts("First");
exit(0);
}
mch[x]=f,mch[f]=x;
}
}
int main(){
int n,u,v;
scanf("%d",&n);
if(n==1) return puts("First"),0;
For(i,1,n-1){
scanf("%d%d",&u,&v);
g[u].push_back(v),g[v].push_back(u);
}
dfs(1,0);
puts("Second");
}
| 0
| 51,370,531
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
if(a>=k)
{
cout<<k<<"\n";
}
else
if((a+b)>=k)
{
cout<<a<<"\n";
}
else
{
cout<<(a-(k-(a+b)))<<"\n";
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
bool check(string A){
int a[26];
REP(i,26){
a[i]=0;
}
REP(i,A.size()){
a[A[i]-'a']++;
if(a[A[i]-'a']>=2)return false;
}
return true;
}
int main(){
string S;
cin>>S;
if(S.size()==26){
string A=S;
bool check=false;
int now=-1;
int c=-1;
for(int i=S.size()-1;i>=0;i--){
for(int j=i+1;j<S.size();j++){
if(A[i]<A[j]){
c=i;
check=true;
if(now==-1){
now=j;
}else{
if(A[j]<A[now]){
now=j;
}
}
}
}
if(check==true){
break;
}
}
if(check==false){
cout<<-1<<endl;
}else{
REP(i,c){
cout<<S[i];
}
cout<<S[now]<<endl;
}
}else{
REP(i,26){
string A=S;
A.push_back('a'+i);
if(check(A)==true){
cout<<A<<endl;
break;
}
}
}
return 0;
}
| 0
| 31,032,399
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main() {
int N ;
ll ans = 0 ;
cin >> N ;
vector<ll> A(N) ;
map<ll,ll> mp ;
rep(i,N) cin >> A.at(i) ;
vector<ll> S(N+1) ;
S.at(0) = 0 ;
mp[S.at(0)]++ ;
rep(i,N){
S.at(i+1) = S.at(i) + A.at(i) ;
mp[S.at(i+1)]++ ;
}
for(auto p : mp ){
ans += (p.second - 1 )*p.second / 2 ;
}
cout << ans << endl ;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, C[500], S[500], F[500];
int main() {
scanf("%d", &N);
for (int i = 0; i < N - 1; i++) scanf("%d%d%d", &C[i], &S[i], &F[i]);
for (int i = 0; i < N; i++) {
int t = 0;
for (int j = i; j < N - 1; j++) {
if (t < S[j])
t = S[j];
else if (t % F[j] == 0);
else t = t + F[j] - t % F[j];
t += C[j];
}
printf("%d\n ", t);
}
}
| 0
| 30,379,608
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<int,int>Mp;
for(int i = 0; i < 6; i++) {
int a;cin >> a;
Mp[a]++;
}
int X = 0,Y = 0;
for(pair<int,int> x:Mp) {
if(x.second == 1) {
X++;
}
else {
Y++;
}
}
if(X == 2 && Y == 2) {
cout <<"YES"<< endl;
}
else {
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,add=1,ans=0,now=0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if(S[0]=='0'){
zero = true;
}else{
zero = false;
}
for(int i=1;i<N;i++){
if(zero){
if(S[i]=='0'){
add++;
}else{
sum.push_back(add);
zero = false;
add = 1;
}
}else{
if(S[i]=='0'){
sum.push_back(add);
add = 1;
zero = true;
}else{
add++;
}
}
}
sum.push_back(add);
if(S[0]=='0'){
for(int i=0;i<min((int)sum.size(),2*K);i++){
ans += sum[i];
}
for(int i=1;i<min((int)sum.size(),2*K+2);i++){
now += sum[i];
}
ans = max(ans,now);
for(int i=2*K+2;i<sum.size();i++){
if(i%2==0){
now = now-sum[i-2*K-1]-sum[i-2*K]+sum[i];
}else{
now = now+sum[i];
}
ans = max(ans,now);
}
}else{
for(int i=0;i<min((int)sum.size(),1+2*K);i++){
ans += sum[i];
}
now = ans;
for(int i=2*K+1;i<sum.size();i++){
if(i%2==0){
now = now+sum[i];
}else{
now = now-sum[i-2*K-1]-sum[i-2*K]+sum[i];
}
ans = max(ans,now);
}
}
cout << ans << endl;
}
| 0
| 29,886,408
|
#include <iostream>
#include<bits/stdc++.h>
#include<vector>
#include<string>
#define ll long long
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vi vector<ll>
#define el printf("\n")
#define s second
#define pb(x) push_back(x)
#define f first
using namespace std;
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);cout.precision(30);
IOS;
ll a,b,c,d;
cin >> a >> b >> c >> d;
if(abs(c-a)<=d)
cout <<"Yes";
else
{
if(abs(a-b)<=d && abs(b-c)<=d)
cout << "Yes";
else
cout <<"No";
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
void input(vector<int> &A){
int n =0;
cin >> n;
A.resize(n);
for(int i=0; i<n ; i++){
cin >> A[i];
}
}
void output(vector<int> &out){
int size = out.size();
for(int i=0; i<size ; i++){
cout << out[i];
if(i< size-1){
cout << " ";
}
}
cout << endl;
}
void CountingSort(vector<int> &A, vector<int> &B, int k){
int n = A.size();
vector<int> C(k,0);
for(int j=0; j<n; j++){
C[A[j]]++;
}
for(int i=1; i<k ;i++){
C[i] += C[i-1];
}
for(int j= (n-1); j>=0; j--){
B[C[A[j]]-1] = A[j];
C[A[j]]--;
}
return;
}
int main(){
vector<int> vecA;
input(vecA);
vector<int> vecB(vecA.size(),0);
CountingSort(vecA, vecB, 10000);
output(vecB);
return 0;
}
| 0
| 68,061,475
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e << std::endl;}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class X> void DEBUG(X d, T e){if(DEBUG_OUT == false)return;std::cout <<d<<" ";DEBUG(e);};
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T > using matrix = vector< vector< T > >;
vector< int > divisor(int n) {
vector< int > ret;
for(int i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
void solve(void)
{
int N,M;
cin>>N>>M;
map<int,int> mp;
for (int i = 0; i < M; i++)
{
int A,B;
cin>>A>>B;
mp[A]++;
mp[B]++;
}
int ANS = 1;
for (auto itr = mp.begin(); itr != mp.end(); itr++)
{
if(itr->second%2 == 1)ANS = 0;
}
cout<<(ANS?"YES":"NO")<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
#define rep(i,z) for(int i = 0; i<(int)(z); i++)
#define rep1(i,z) for(int i = 1; i<=(int)(z); i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
using pear = pair<int,int>;
int main(){
int x,n; cin>>x>>n;
int p[n];
rep(i,n) cin>>p[i];
bool neko=true;
rep(i,n){
if(p[i]==x) neko=false;
}
if(neko){
cout<<x<<endl;
return 0;
}
int a= x-1, b=x+1;
rep(i,n){
bool an=true,bn=true;
for(int j=0; j<n;j++){
if(p[j]==a) an=false;
if(p[j]==b) bn=false;
}
if(an){
cout<<a<<endl;
return 0;
}
if(bn){
cout<<b<<endl;
return 0;
}
a--; b++;
}
cout<<a<<endl;
}
| 0
| 5,210,622
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll w, h;
cin >> w >> h;
vector<ll> p(w), q(h);
for(auto &e: p) cin >> e;
for(auto &e: q) cin >> e;
vector<pair<ll,ll>> es;
for(auto &e: p) es.push_back({e, 0});
for(auto &e: q) es.push_back({e, 1});
sort(es.begin(), es.end());
ll xx = 0, yy = 0, r = 0;
for(auto &e: es) {
ll c, t;
tie(c, t) = e;
if(t == 0)
r += max(0ll, c * (h+1 - yy)), xx++;
else
r += max(0ll, c * (w+1 - xx)), yy++;
}
cout << r << endl;
}
|
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll n_sum = n * (n + 1) / 2;
ll a[n+1], a_sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
a_sum += a[i];
}
a[n] = a[0];
ll c;
if (a_sum % n_sum != 0) {
cout << "NO" << endl;
return 0;
} else {
c = a_sum / n_sum;
}
ll count = 0;
for (int i = 0; i < n; i++) {
if (a[i] + c == a[i+1]) {
continue;
} else if (a[i] + c < a[i+1]) {
cout << "NO" << endl;
return 0;
} else {
count += (a[i] + c - a[i+1]) / n;
if ((a[i] + c - a[i+1]) % n != 0) {
cout << "NO" << endl;
return 0;
}
}
}
if (count != c) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << "\n";
return 0;
}
| 0
| 55,765,081
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0); ios_base::sync_with_stdio(0);
string s;
cin >> s;
int maxx=0,strk=0;
for(int i=0;i<3;i++){
if(s[i]=='R'){
strk++;
maxx = max(maxx,strk);
}
else strk=0;
}
cout << maxx;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define lw(vc,num) lower_bound(vc.begin(), vc.end(), num) - vc.begin();
#define hg(vc,num) upper_bound(vc.begin(), vc.end(), num) - vc.begin();
#define bn(v,x) binary_search (v.begin(), v.end(), x)
#define mx 100001
#define eps 0.00000000001
#define mod 1000000007
#define pi acos(-1)
#define inf 100000000
#define loop(i,b,n) for(int i=b;i<n;++i)
#define rev_loop(i,b,n) for(int i=b;i>=n;--i)
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
bool isprime(int n)
{
if(n == 1) return false;
if(n == 2 || n == 3) return true;
if(n%2 == 0 || n%3 == 0) return false;
for(int i=5; i*i<=n; i+=6){
if((n%i == 0)||(n%(i+2) == 0)) return false;
}
return true;
}
long long binpow(long long a, long long b) {
if (b == 0)
return 1;
long long res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
int main()
{
fio;
int n,l;
cin>>n>>l;
vector<string> v1;
string s1;
loop(i,0,n)
{
cin>>s1;
v1.pb(s1);
}
SORT(v1);
loop(i,0,n)
cout<<v1[i];
cout<<endl;
return 0;
}
| 0
| 6,333,064
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,c,k,t;
cin>>n>>c>>k;
std::deque<long long int> deq;
for (int i=0;i<n;i++) {
cin>>t;
deq.emplace_back(t);
}
sort(deq.begin(),deq.end());
const long long INF=1LL<<60;
long long int limit=INF;
long long int count=1;
long long int tmp=c;
for (int i=0;i<n;i++) {
if (deq[i]<=limit) {
limit=min(limit,deq[i]+k);
tmp--;
} else {
count++;
tmp=c-1;
limit=deq[i]+k;
}
if (tmp==0) {
if (i!=n-1) {
count++;
tmp=c;
limit=INF;
}
}
}
cout<<count<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
bool check[110000];
int cnt,n;
int a[110000];
void dfs(int n){
if(check[n])return;
check[n]=1;
if(n==2)return;
cnt++;
dfs(a[n]);
}
int main(){cout<<fixed<<setprecision(10);
cin>>n;
rep(i,1,n+1)cin>>a[i];
dfs(1);
if(check[2])cout<<cnt<<endl;
else cout<<-1<<endl;
}
| 0
| 41,704,009
|
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
typedef long long ll;
typedef unsigned long long ull;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1, dy = y2 - y1;
int x3 = x2 - dy, y3 = y2 + dx;
int x4 = x1 - dy, y4 = y1 + dx;
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
}
|
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin>>s>>t;
int n=s.length(),m=t.length();
ll dp[n+1][m+1];
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
dp[i][j]=i+j;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(s[i-1]==t[j-1]){
dp[i][j]=min(dp[i][j],dp[i-1][j-1]);
}
dp[i][j]=min(dp[i-1][j-1]+1,min(dp[i][j],min(dp[i-1][j]+1,dp[i][j-1]+1)));
}
}
cout << dp[n][m] <<endl;
return 0;
}
| 0
| 10,973,898
|
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define chmin(x,y) x = min(x, y)
#define chmax(x,y) x = max(x, y)
#define V vector
vector<int> dx = {-1, 1, 0, 0, -1, -1, 1, 1};
vector<int> dy = { 0, 0, -1, 1, -1, 1, -1, 1};
int main () {
int n; cin >> n;
V<P> r(n), b(n);
rep(i, n) {
int a, b; cin >> a >> b;
r[i].first = b; r[i].second = a;
}
rep(i, n) {
int c, d; cin >> c >> d;
b[i].first = c; b[i].second = d;
}
sort(allr(r));
sort(all(b));
V<bool> used_r(n, false);
int ans = 0;
rep(i, n) {
int bx = b[i].first, by = b[i].second;
rep(i, n) {
int rx = r[i].second, ry = r[i].first;
if (used_r[i]) continue;
if (rx < bx && ry < by) {
ans++;
used_r[i] = true;
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> pos(N + 1);
rep(i, N) {
int p;
cin >> p;
pos.at(p) = i + 1;
}
multiset<int> ms;
rep(i, 2) {
ms.insert(0);
ms.insert(N + 1);
}
ll ans = 0;
for (int i = N; i >= 1; i--) {
ms.insert(pos.at(i));
auto itr = ms.find(pos.at(i));
ll l1 = *prev(itr, 2);
ll l2 = *prev(itr, 1);
ll r1 = *next(itr, 1);
ll r2 = *next(itr, 2);
ans += ((l2 - l1) * (r1 - pos.at(i)) + (pos.at(i) - l2) * (r2 - r1)) * i;
}
cout << ans << endl;
return 0;
}
| 0
| 69,494,527
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int h,w;
string data;
cin>>h>>w;
while(getline(cin,data)){
cout<<data<<endl;
cout<<data<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int a[m];
int sum=0;
for(int i=0;i<m;i++)
{
cin>>a[i];
sum+=a[i];
}
if(sum>n)
cout<<-1<<endl;
else if(sum==n)
cout<<0<<endl;
else
cout<<n-sum<<endl;
exit(0);
}
| 0
| 89,338,816
|
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N, K;
cin >> N >> K;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
sort(list.begin(), list.end());
reverse(list.begin(), list.end());
int ans = 0;
for (int i = 0; i < K; i++)
ans += list[i];
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 100005
int n, p, a[N];
ll m, v;
bool cmp(int x, int y)
{
return x > y;
}
bool check(int x)
{
if(x <= p) return 1;
if(a[x] + m < a[p]) return 0;
int rv = v - (p - 1) - (n - x + 1);
if(rv < 0) return 1;
ll rs = 1ll * rv * m;
for(int i = p; i <= x - 1; i++)
rs -= a[x] + m - a[i];
return (rs <= 0);
}
int main()
{
scanf("%d%lld%lld%d", &n, &m, &v, &p);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1, cmp);
int l = 1, r = n, ans = 0;
while(l <= r)
{
int mid = l + r >> 1;
if(check(mid)) l = mid + 1, ans = mid;
else r = mid - 1;
}
cout << ans << endl;
return 0;
}
| 0
| 39,884,464
|
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
const int N=2e5+3;
int main()
{
ft
int t,i,j,n,m,l,r,a[3];
for(i=0;i<3;i++)
{
cin>>a[i];
}
sort(a,a+3);
cout<<a[0]+a[1]<<"\n";
return 0;
}
|
#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;
pair<int, int> A[100010];
rep(i, N) cin >> A[i].first;
rep(i, N) A[i].second = i;
sort(A, A + N);
int ans[2] = {};
rep(i, N){
if(A[i].second % 2 != i % 2) ans[i % 2]++;
}
cout << ans[0] << endl;
return 0;
}
| 0
| 68,710,657
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 1<<30
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef long long int LL;
typedef pair<ll,ll>Pll;
typedef pair<int,int>Pin;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
char dir[4]={'u','l','d','r'};
ll cmp(pair<ll,ll>a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi<b.fi;
}
bool color[200001];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;string s;
cin>>n>>s>>k;
for(int i=0;i<n;i++)
if(s[i]!=s[k-1])s[i]='*';
cout<<s<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (fopen("input.in", "r")) {
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
}
int n;
cin>>n;
ll ans = 0;
for(int i = 1; i<= n; i++) ans += ((ll)i) * ((ll)n - i + 1);
for(int i = 0; i< n-1; i++){
int u, v;
cin>>u>>v;
if(u> v) swap(u,v);
ans -= (ll)u * (n-v+1);
}
cout<<ans<<"\n";
}
| 0
| 75,304,915
|
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int cnt = 0;
vector<vector<ll>> vac;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin>>N;
vac.resize(N);
for(int i=0;i<N;i++){
vac[i].resize(3);
}
for(int i=0;i<N;i++){
for(int j=0;j<3;j++){
cin>>vac[i][j];
}
}
for(int i=1;i<N;i++){
vac[i][0] = max(vac[i][0]+vac[i-1][1],vac[i][0]+vac[i-1][2]);
vac[i][1] = max(vac[i][1]+vac[i-1][0],vac[i][1]+vac[i-1][2]);
vac[i][2] = max(vac[i][2]+vac[i-1][0],vac[i][2]+vac[i-1][1]);
}
ll final_ans = max(vac[N-1][0],max(vac[N-1][1],vac[N-1][2]));
cout<<final_ans<<endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
int cnt=0;
int ts, flg;
rep(i, 1000){
flg=0;
rep(j, n){
ts = s[j]-'0';
if((flg==0 && ts == i/100 %10) ||
(flg==1 && ts == i/10 %10) ||
(flg==2 && ts == i/1 %10)) {
flg++;
if(flg==3) break;
else continue;
}
}
if(flg==3){
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| 0
| 14,071,780
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
char a[n][m];
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
cin >> a[i][j];
}
}
int dp[n][m];
dp[0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(i == 0 && j == 0) continue;
bool up = false, left = false;
if(j != 0 && a[i][j - 1] == '.'){
left = true;
}
if(i != 0 && a[i - 1][j] == '.'){
up = true;
}
int sum = 0;
if(up) sum += dp[i - 1][j];
if(left) sum += dp[i][j - 1];
dp[i][j] = sum;
dp[i][j] %= (long long) (1e9 + 7);
}
}
cout << dp[n - 1][m - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
vector<int> table(100100,0);
REP(i,N){
int a; cin >> a;
table[a] ++;
}
int ans = 0;
FOR(i,1,100000){
ans = max(ans, table[i-1]+table[i]+table[i+1]);
}
cout << ans << endl;
return 0;
}
| 0
| 60,715,408
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main(){
int n,m,s;
scanf("%d%d%d",&n,&m,&s);
if (m == n){
for (int i=0;i<n-1;i++) printf("%d ",s);
printf("%d\n",s);
}
else{
int temp;
if (s == 1000000000) temp = 999999999;
else temp = s+1;
for (int i=0;i<m;i++) printf("%d ",s);
for (int i=m;i<n-1;i++) printf("%d ",temp);
printf("%d\n",temp);
}
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
sort(ALL(A));
ll ans = 0;
int cnt = 0;
REP(i,N){
if((cnt<=N-2&&A.at(i)<0)||i==0){
ans+=-A.at(i);
cnt++;
}else{
ans+=A.at(i);
}
}
cout << ans << endl;
int x = A.at(0);
FOR(i,cnt,N-1){
cout << x << " " << A.at(i) << endl;
x=x-A.at(i);
}
cout << A.at(N-1) << " " << x << endl;
x = A.at(N-1)-x;
FOR(i,1,cnt){
cout << x << " " << A.at(i) << endl;
x=x-A.at(i);
}
}
| 0
| 44,889,871
|
#include <cstdio>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
const int MAX = 10000;
vector<int> G[MAX];
vector<int> ans;
bool visited[MAX];
void dfs(int u) {
visited[u] = true;
for (int i = 0; i < G[u].size(); ++i) {
int next = G[u][i];
if (visited[next] == false) {
dfs(next);
}
}
ans.push_back(u);
}
int main() {
int v, e;
scanf("%d %d", &v, &e);
for (int i = 0; i < v; ++i) {
visited[i] = false;
}
for (int i = 0; i < e; ++i) {
int s, t;
scanf("%d %d", &s, &t);
G[s].push_back(t);
}
for (int i = 0; i < v; ++i) {
if (visited[i] == false)
dfs(i);
}
for (auto itr = ans.rbegin(); itr != ans.rend(); ++itr) {
cout << *itr << endl;
}
return 0;
}
|
#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 ll MOD=1e9+7;
const int MAX=1e5+10;
const ll INF=1e18;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
int n,m;
cin >> n >> m;
vector<int> cnt(n+3);
rep(i,m) {
int l,r;
cin >> l >> r;
++cnt[l];
--cnt[r+1];
}
int ans=0;
rep(i,n) {
cnt[i+1]+=cnt[i];
if (cnt[i+1]==m) ++ans;
}
cout << ans << endl;
return 0;
}
| 0
| 74,434,302
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using PL = pair<ll,ll>;
int main()
{
string s; ll t; cin >> s >> t;
for(auto &i : s) i -= '0';
ll n = s.size();
vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(120, vector<ll>(2)));
dp[0][0][0] = 1;
for(ll i = 0; i < n; i++) {
for(ll j = 0; j < 110; j++) {
for(ll k = 0; k < 2; k++) {
for(ll d = 0; d <= (k ? 9 : s[i]); d++) {
dp[i + 1][j + (d != 0)][k || d < s[i]] += dp[i][j][k];
}
}
}
}
cout << dp[n][t][0] + dp[n][t][1] << endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define printa(x, n) for(ll i = 0; i < n; i++) {cout << (x[i]) << " ";} cout << endl;
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;
using pll = pair<ll, ll>;
vector<vector<bool>> vvi(15, vector<bool>(15, false));
int main(void) {
int n, m, k;
cin >> n >> m >> k;
vector<bool> ok(n * m + 1, false);
if (k % n == 0 || k % m == 0) {
Yes();
return 0;
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
ok[i * (n - j) + (m - i) * j] = true;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ok[i * (m - j) + (n - i) * j] = true;
}
}
cout << (ok[k] ? "Yes" : "No") << endl;
return 0;
}
| 0
| 95,985,694
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <cmath>
#include <functional>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main(){
int tmp, i = 1;
cin >> tmp;
while (tmp != 0){
cout << "Case " << i << ": " << tmp << endl;
i++;
cin >> tmp;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
int n;
cin >> n;
string s;
cin >> s;
int len = s.size();
int cnt = 1;
for (int i = 1; i < len; i++)
{
if (s[i] == s[i - 1])
continue;
cnt++;
}
cout << cnt << "\n";
return 0;
}
| 0
| 4,216,986
|
#include <iostream>
using namespace std;
int main(void){
int n;
int debt=100000;
cin >> n;
for(int i=0;i<n;i++){
debt *= 1.05;
if( ( debt % 1000 ) != 0 ){
debt -= ( debt % 1000 );
debt += 1000;
}
}
cout << debt << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e << std::endl;}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class X> void DEBUG(X d, T e){if(DEBUG_OUT == false)return;std::cout <<d<<" ";DEBUG(e);};
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T > using matrix = vector< vector< T > >;
int euclidean_gcd(int a, int b) {
while(1) {
if(a < b) swap(a, b);
if(!b) break;
a %= b;
}
return a;
}
void solve(void)
{
int N,M;
cin>>N>>M;
vector<vector<int> > data(3,vector<int>(N));
for (int i = 0; i < N; i++)
{
cin>>data[0][i]>>data[1][i]>>data[2][i];
}
int ANS = 0;
for (int b = 0; b < 1<<3; b++)
{
vector<int> SUM(N,0);
for (int j = 0; j < N; j++)
{
int sign = 1;
for (int k = 0; k < 3; k++)
{
if(b>>k&1)
{
sign = -1;
}
else
{
sign = 1;
}
SUM[j] += data[k][j]*sign;
}
}
int VAL = 0;
sort(ALL(SUM),greater<int>());
for (int k = 0; k < M; k++)
{
VAL += SUM[k];
}
chmax(ANS,VAL);
}
cout<<ANS<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| 0
| 75,630,145
|
#include <stdio.h>
int f(int);
int main()
{
int d,total;
while(scanf("%d",&d) != EOF){
total = 0;
for(int i = 1; d*i < 600; i++){
total += f(d*i) * d;
}
printf("%d\n",total);
}
return 0;
}
int f(int d){
return (d * d);
}
|
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
vi g[N];
int a[N];
void solve(){
int x;
cin>>x;
cout<<8-(x-400)/200<<endl;
}
int main() {
ios_base::sync_with_stdio(0);
int i,t=1;
for(i=1;i<=t;i++){
solve();
}
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m){
int i, u, v;
while(m--){
cin>>u>>v;
g[u-1].pb(v-1);
g[v-1].pb(u-1);
}
}
void dfs(int u, int par){
for(int v:g[u]){
if (v == par) continue;
dfs(v, u);
}
}
| 0
| 37,081,340
|
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
string S;
int count = 0;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'o') {
count++;
}
}
if (count >= 8) {
cout << "YES" << endl;
} else {
if (count + (15 - S.length()) >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
|
#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() {
int n; cin >> n;
string s[51];
string alphabet = "abcdefghijklmnopqrstuvwxyz";
map<char, int> res;
for (auto c:alphabet) {
res[c] = 1000;
}
REP(i, n) {
string tmp; cin >> tmp;
map<char, int> tm;
for (auto c:alphabet) {
tm[c] = 0;
}
REP(j, tmp.size()) {
tm[tmp[j]] += 1;
}
for (auto c:alphabet) {
res[c] = min(res[c], tm[c]);
}
}
for (auto c:alphabet) {
REP(i, res[c]) {
cout << c;
}
}
cout << endl;
return 0;
}
| 0
| 92,997,620
|
#include <iostream>
#include <ctype.h>
#include <vector>
using namespace std;
int main() {
char ch;
int count[26] = {};
while (cin >> ch) {
ch = tolower(ch);
int num = ch - 'a';
count[num]++;
}
cout << "a : " << count[0] << endl;
cout << "b : " << count[1] << endl;
cout << "c : " << count[2] << endl;
cout << "d : " << count[3] << endl;
cout << "e : " << count[4] << endl;
cout << "f : " << count[5] << endl;
cout << "g : " << count[6] << endl;
cout << "h : " << count[7] << endl;
cout << "i : " << count[8] << endl;
cout << "j : " << count[9] << endl;
cout << "k : " << count[10] << endl;
cout << "l : " << count[11] << endl;
cout << "m : " << count[12] << endl;
cout << "n : " << count[13] << endl;
cout << "o : " << count[14] << endl;
cout << "p : " << count[15] << endl;
cout << "q : " << count[16] << endl;
cout << "r : " << count[17] << endl;
cout << "s : " << count[18] << endl;
cout << "t : " << count[19] << endl;
cout << "u : " << count[20] << endl;
cout << "v : " << count[21] << endl;
cout << "w : " << count[22] << endl;
cout << "x : " << count[23] << endl;
cout << "y : " << count[24] << endl;
cout << "z : " << count[25] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
bool eq = true;
ll ans = 0, mn = LINF;
ll a[n], b[n];
rep(i, n) {
cin >> a[i] >> b[i];
if (a[i] != b[i]) eq = false;
if (a[i] > b[i]) mn = min(mn, b[i]);
ans += b[i];
}
if (eq) cout << 0 << endl;
else cout << ans - mn << endl;
return 0;
}
| 0
| 99,631,212
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a;
cin >> n >> a;
cout << n * n - a << "\n";
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod (int)1e9+7
#define MOD 998244353
#define ll long long
#define mp make_pair
#define F first
#define S second
#define t() int test;cin>>test;while(test--)
#define ii pair<int,int>
#define que_max priority_queue <int>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define sz(x) (int)(x).size()
#define grid vector<vector<ll> >
typedef tree< int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}
#else
#define trace(...)
#endif
vector<string> matrix;
grid dp;
int n, m;
int const p = 1000000007;
ll ways(int r, int c)
{
if (r >= n || c >= m)return 0;
if (matrix[r][c] == '#')return 0;
if (r == n - 1 && c == m - 1)return 1;
ll &ans = dp[r][c];
if (ans != -1)
return ans;
ans = (ways(r + 1, c) % p + ways(r, c + 1) % p) % p;
return ans % p;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
IOS;
cin >> n >> m;
matrix.resize(n);
dp.assign(n, vector<ll>(m, -1));
for (auto &i : matrix)
{
cin >> i;
}
cout << ways(0, 0) << endl;
}
| 0
| 60,926,305
|
#include <iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(void) {
int N;
int K;
int l[50];
cin>>N>>K;
int ans=0;
for(int i=0;i<N;i++){
cin>>l[i];
}
sort(l,l+N,greater<int>());
for(int a=0;a<K;a++){
ans+=l[a];
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define ve vector
#define pq priority_queue
#define vi vector<int>
#define vl vector<long long>
#define vii vector<vector<int>>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
int main()
{
int N;
cin >> N;
vl A(N);
rep(i,N) cin >> A[i];
ll ans = 0;
ll B = 0;
ll t = 0;
ll oldt = -1;
for (ll s = 0; s < (ll)N; s++) {
while (B+A[t] == (A[t]^B) && t < (ll)N) {
B += A[t];
t++;
}
ll n = t-s;
ans += n;
if(t==s){
t++;
}else{
B-=A[s];
}
}
out(ans);
return 0;
}
| 0
| 14,543,297
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 10;
int f[N];
ll dis[N];
void fail() {
puts("No");
exit(0);
}
int find(int k) {
if(f[k] == k) return k;
else {
int fa = find(f[k]);
dis[k] += dis[f[k]];
return f[k] = fa;
}
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i) f[i] = i;
for(int i = 1, x, y, z; i <= m; ++i) {
scanf("%d%d%d", &x, &y, &z);
int fx = find(x), fy = find(y);
if(fx == fy) {
if(dis[y] - dis[x] != z) fail();
} else {
f[fy] = fx;
dis[fy] = dis[x] - dis[y] + z;
}
}
puts("Yes");
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int b,f,r,v,n,i,k,l,m,max[5][4][11]{0};
cin>>n;
for(i=0;i<n;i++){
cin>>b>>f>>r>>v;
if(r>0){
max[b][f][r]=max[b][f][r]+v;
}
}
for(k=1;k<=4;k++){
if(k!=1){
cout<<"####################"<<endl;
}
for(l=1;l<=3;l++){
for(m=1;m<=10;m++){
cout<<" "<<max[k][l][m];
}
cout<<endl;
}
}
return 0;
}
| 0
| 26,195,814
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool c=true;
for(int i=97;i<=122;i++){
c=true;
for(int j=0;s[j]!='\0';j++){
if(char(i)==s[j]){
c=false;
continue;
}
}
if(c==true){
cout<<char(i);
break;
}
}
if(c==false)
cout<<"None";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl vector<pll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pr_d(x) cout << fixed << setprecision(15) << x << endl
#define ud(c, x) distance(c.begin(), upper_bound(all(c), x))
#define ld(c, x) distance(c.begin(), lower_bound(all(c), x))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep3(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep4(i, a, b) for (int i = (a); i > (b); --i)
#define pb push_back
#define out(x) cout << x << "\n"
bool odd(int i) { return i % 2; }
#define all(v) v.begin(), v.end()
#define size(x) int(x.size())
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
void Yes_No(bool f) {
if (f)
printf("Yes\n");
else
printf("No\n");
}
void deb_p(pii p) { printf("pair = %d %d\n", p.fi, p.se); }
void deb_i(int i) { printf("i = %d\n", i); }
void deb_v(vector<int> v) {
printf("v = ");
for (auto i : v) printf("%d ", i);
printf("\n");
}
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void solve(void) {
string s;
cin >> s;
int ans = 0;
rep(i, size(s) - 1) {
if (s[i] != s[i + 1]) ++ans;
}
cout << ans << endl;
}
int main(void) { solve(); }
| 0
| 82,126,531
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vvin=vector<vin>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vst=vector<string>;
using P = pair<ll,ll>;
const int inf=1e9+7;
const ll INF=9e18;
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(20);
ll n,k;
cin>>n>>k;
vll a(n);
rep(i,0,n)cin>>a[i];
vector<P> cnt(n);
rep(i,0,n){
ll now=a[i];
rep(j,0,n){
if(i<j&&a[i]>a[j])cnt[i].first++;
if(a[i]>a[j])cnt[i].second++;
}
}
ll ans=0;
rep(i,0,n){
ans+=k*cnt[i].first;
ans+=k*k%inf*cnt[i].second;
ans-=k*(k+1)/2%inf*cnt[i].second;
ans%=inf;
}
if(ans<0)ans+=inf;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N;
string s[300];
char t[300][300];
bool check(){
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(t[i][j] != t[j][i]) return false;
}
}
return true;
}
int main(){
ll ans = 0;
cin >> N;
for(int i=0;i<N;i++) cin >> s[i];
for(int z=0;z<N;z++){
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
t[i][(j+z)%N] = s[i][j];
}
}
if(check()) ans += N;
}
cout << ans << endl;
return 0;
}
| 0
| 49,561,196
|
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
ll mpow(ll a, ll b){
if(b==0){
return 1;
}else if(b%2==0){
ll memo = mpow(a,b/2);
return memo*memo%MOD;
}else{
return mpow(a,b-1) * a % MOD;
}
}
ll gcd(ll a, ll b){
if(b==0){
return a;
}else{
return gcd(b, a%b);
}
}
int main(void){
int n;
cin>>n;
vector<string> S;
string s;
rep(i,n){
cin>>s;
S.push_back(s);
}
char A[303][303];
ll count = 0;
rep(slide,n){
rep(i,n){
rep(j,n){
A[i][j] = S[(int)((i+slide)%n)][j];
}
}
bool ok = true;
rep(i,n){
rep(j,n){
if(A[i][j] != A[j][i]){
ok = false;
break;
}
}
if(!ok) break;
}
if(ok) count++;
}
cout<<count*n<<endl;
return 0;
}
|
#include <stdio.h>
int main() {
int child, candy = 0;
scanf("%d", &child);
for(int i = 0; i < child; i++) {
for(int j = 0; j < i; j++) {
candy += 1;
}
candy++;
}
printf("%d", candy);
return 0;
}
| 0
| 56,869,080
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
ll n, k;
cin >> n >> k;
ll cur = 1;
for (int i = 0; i < n; i++) {
if (cur * 2 < cur + k) {
cur *= 2;
} else {
cur += k;
}
}
cout << cur << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
ll N; cin >> N;
vector<string> S(N);
REP(i,N){
cin >> S[i];
sort(ALL(S[i]));
}
sort(ALL(S));
ll cnt = 0;
ll ans = 0;
string str = S[0];
REP(i,N){
if(str == S[i]){
cnt++;
}else{
ans += cnt*(cnt-1)/2;
str = S[i];
cnt = 1;
}
}
ans += cnt*(cnt-1)/2;
cout << ans << endl;
return 0;
}
| 0
| 69,190,729
|
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <list>
#include <cmath>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B), x(M), y(M), c(M);
int amin = 1000000;
int bmin = 1000000;
for (int i = 0; i < A; ++i) {
cin >> a.at(i);
amin = std::min(amin, a.at(i));
}
for (int i = 0; i < B; ++i) {
cin >> b.at(i);
bmin = std::min(bmin, b.at(i));
}
for (int i = 0; i < M; ++i) {
cin >> x.at(i) >> y.at(i) >> c.at(i);
}
int min = amin + bmin;
for (int i = 0; i < M; ++i) {
min = std::min(min, a.at(x.at(i) - 1) + b.at(y.at(i) - 1) - c.at(i));
}
cout << min << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<stack>
using namespace std;
int main(){
string s;
cin >> s;
stack<char> st;
int cnt = 0;
for (int i = 0; i < s.size(); i++)
{
if(!st.empty() && st.top()!=s[i])
{
st.pop();
cnt += 2;
}
else
{
st.push(s[i]);
}
}
cout << cnt << endl;
return 0;
}
| 0
| 86,161,517
|
#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,v) for(auto i=v.begin();i!=v.end();++i)
#define REACH(i,v) for(auto i=v.rbegin();i!=v.rend();++i)
#define LB(c,x) distance((c).begin(),lower_bound(ALL(c),x))
#define UB(c,x) distance((c).begin(),upper_bound(ALL(c),x))
#define COUNT(c,x) (lower_bound(ALL(c),x)-upper_bound(ALL(c),x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl;
#define NL cerr<<endl;
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
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(a>b){a=b;return true;}return false;}
template<typename T>T sum(vector<T>&v){return accumulate(ALL(v),T());}
template<typename T>T sum(vector<T>&v,int a,int b){return accumulate(v.begin()+a,v.begin()+b,T());}
template<typename T>T max(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T min(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T max_index(vector<T>&v){return distance((v).begin(),max_element(ALL(v)));}
template<typename T>T min_index(vector<T>&v){return distance((v).begin(),min_element(ALL(v)));}
struct edge { int to, cost; };
template<typename T>auto&operator<<(ostream&s,const vector<T>&v){s<<"[";bool a=1;for(auto e:v){s<<(a?"":" ")<<e;a=0;}s<<"]";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const pair<T,U>&p){s<<"("<<p.first<<","<<p.second<<")";return s;}
template<typename T>auto&operator<<(ostream&s,const set<T>&st){s<<"{";bool a=1;for(auto e:st){s<<(a?"":" ")<<e;a=0;}s<<"}";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const map<T,U>&m){s<<"{";bool a=1;for(auto e:m){s<<(a?"":" ")<<e.first<<":"<<e.second;a=0;}s<<"}";return s;}
const int INF = 1e18;
const int MOD_N = 1e9+7;
class UnionFind
{
private:
vector<int> par, myrank;
public:
UnionFind(int n) {
par.resize(n);
myrank.resize(n, 0);
for (int i = 0; i < n; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (myrank[x] < myrank[y]) {
par[x] = y;
} else {
par[y] = x;
if(myrank[x] == myrank[y]) myrank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
};
signed main()
{
int n, q; cin >> n >> q;
V<int> c(q), x(q), y(q);
REP(i, q) {
cin >> c[i] >> x[i] >> y[i];
}
UnionFind uf(n);
REP(i, q) {
if (c[i] == 0) {
uf.unite(x[i], y[i]);
} else {
cout << (uf.same(x[i], y[i]) ? 1 : 0) << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std ;
template< class T > inl T read() {
T x = 0 ; int f = 1 ; char k = getchar() ;
for( ; k > '9' || k < '0'; k = getchar() ) if( k == '-' ) f = -1 ;
for( ; k >= '0' && k <= '9'; k = getchar() ) x = x * 10 + k - '0' ;
return x * f ;
}
template< class T > inl T read( T &x ) { return x = read<T>() ; }
int _num, _buf[20];
template< class T > il print( T x ) {
if( x == 0 ) return putchar( '0' ) ,void() ;
if( x < 0 ) putchar( '-' ), x = -x ;
while( x ) _buf[++_num] = x % 10, x /= 10 ;
while( _num ) putchar( _buf[_num--] + '0' ) ;
}
ll mul( ll a, ll b, ll mod ) { long double c = 1. ; return ( a * b - (ll)( c * a * b / mod ) * mod ) % mod ; }
it qpow( int x, int m, int mod ) {
int res = 1, bas = x ;
while(m) {
if( m & 1 ) res = ( 1ll * res * bas ) % mod ;
bas = ( 1ll * bas * bas ) % mod, m >>= 1 ;
}
return res ;
}
const int N = 2e5 + 5 ;
int n, val[N];
ll ans;
vector<int> G[N];
struct Seg_Tree {
int tag;
ll sum;
}T[N << 2];
#define lc ( cur << 1 )
#define rc ( cur << 1 | 1 )
il pushup( int cur ) {
T[cur].sum = T[lc].sum + T[rc].sum ;
}
il maintain( int cur, int l, int r, int k ) {
T[cur].tag += k ;
T[cur].sum += 1ll * k * ( r - l + 1 ) ;
}
il pushdown( int cur, int l, int r ) {
if( !T[cur].tag )
return ;
maintain( lc, l, mid, T[cur].tag ) ;
maintain( rc, mid + 1, r, T[cur].tag ) ;
T[cur].tag = 0 ;
}
il Build( int cur, int l, int r ) {
if( l == r ) {
T[cur].sum = val[l] ;
return ;
}
Build( lc, l, mid ), Build( rc, mid + 1, r ) ;
pushup( cur ) ;
}
il Updata( int cur, int l, int r, int L, int R, int k ) {
if( l >= L && r <= R ) {
maintain( cur, l, r, k ) ;
return ;
}
pushdown( cur, l, r ) ;
if( mid >= L )
Updata( lc, l, mid, L, R, k ) ;
if( R > mid )
Updata( rc, mid + 1, r, L, R, k ) ;
pushup( cur ) ;
}
int main() {
n = read<int>() ;
for( ri i = 1; i <= n; ++i )
val[i] = 1 ;
for( ri i = 1; i < n; ++i ) {
int u = read<int>(), v = read<int>() ;
if( u > v )
swap( u, v ) ;
G[u].push_back( v ) ;
val[v] -= 1 ;
}
for( ri i = 1; i <= n; ++i )
val[i] += val[i - 1] ;
Build( 1, 1, n ) ;
ans += T[1].sum ;
for( ri i = 1; i < n; ++i ) {
Updata( 1, 1, n, i, n, -1 ) ;
for( auto x: G[i] )
Updata( 1, 1, n, x, n, 1 ) ;
ans += T[1].sum ;
}
print( ans ), puts( "" ) ;
cerr << 1. * clock() / CLOCKS_PER_SEC << "\n" ;
return 0;
}
| 0
| 91,877,914
|
#include<stdio.h>
int main(void)
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a < b && b < c)
{
printf("Yes");
}
else
{
printf("No");
}
putchar('\n');
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#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 repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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 INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n,m;
ll ans=0LL;
cin >>n>>m;
ll one=1900LL*m+100LL*(n-m);
clog<<one<<endl;
ans=one*(1LL<<m);
cout<<ans<<endl;
}
| 0
| 65,673,940
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S; cin >> S;
vector<int> alpha(26,0);
REP(i,S.size()){
alpha[S[i]-'a']++;
}
for (char a='a'; a<='z';a++){
if(alpha[a-'a']==0){
cout << a << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m,ans=0;
cin>>n>>m;
int k[m],s[m][n],p[m];
rep(i,m){
cin>>k[i];
rep(j,k[i]) cin>>s[i][j];
}
rep(i,m) cin>>p[i];
rep(i,pow(2,n)){
int b=0;
rep(j,m){
int a=0;
rep(l,k[j]) if(i&(1<<(s[j][l]-1))) a++;
if(a%2==p[j]) b++;
}
if(b==m) ans++;
}
cout<<ans;
}
| 0
| 85,776,178
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
string kekka;
cin >> a >> b >> c;
kekka = toupper(a.at(0));
kekka += toupper(b.at(0));
kekka += toupper(c.at(0));
cout << kekka;
}
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define N 5e6
const lli mod = 1e9+7;
lli x, y;
vector<lli> inv(N);
vector<lli> fact(N);
vector<lli> fact_inv(N);
void setinv(){
inv[1] = 1;
for(int i = 2; i < N; i++){
inv[i] = mod-((mod/i)*inv[mod%i]%mod);
}
}
void setfact(){
fact[0] = fact[1] = 1;
for(int i = 2; i < N; i++){
fact[i] = i*fact[i-1]%mod;
}
}
void setfact_inv(){
fact_inv[0] = fact_inv[1] = 1;
for(int i = 2; i < N; i++){
fact_inv[i] = inv[i]*fact_inv[i-1]%mod;
}
}
lli comb(lli n, lli k){
lli ret = (fact[n]*fact_inv[k]%mod)*fact_inv[n-k]%mod;
return ret;
}
int main(void){
setinv();
setfact();
setfact_inv();
cin >> x >> y;
lli a = 2*y-x;
lli b = 2*x-y;
if(a < 0 || b < 0 || a%3 != 0 || b%3 != 0){
cout << 0 << endl;
return 0;
}
a/=3;
b/=3;
cout << comb(a+b, a) << endl;
return 0;
}
| 0
| 38,331,919
|
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int a=0,b=0,c=0,t=0;
int x;
cin >> a >> b >> c;
for(x=a ; x<=b ; x++){
if(c%x==0){
t++;
}
}
cout << t << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define N 110
using namespace std;
int A[N];
int dp[N][N];
int Min(int &a,int b){return a = min(a,b);}
int main(){
int n;
cin>>n;
for(int i=0,cnt=0;i<n;i++){
int a,b;
cin>>a>>b;
if(i == 0) A[cnt++] = a;
A[cnt++] = b;
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++)dp[i][j] = 1e9;
dp[i][i] = 0;
}
for(int len=0;len<n;len++)
for(int l=1;l<n;l++){
int r = l+len;
if(l+len>=N)continue;
for(int m = l;m<r;m++){
Min(dp[l][r],dp[l][m] + dp[m+1][r] + A[l-1]*A[m]*A[r]);
}
}
cout<<dp[1][n]<<endl;
return 0;
}
| 0
| 7,707,226
|
#include <iostream>
using namespace std;
int C(int n){
return n*(n-1)/2;
}
int main(){
int a,b;
cin >> a >> b;
cout << C(a)+C(b) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,K;
cin >> N >>K;
ll sum[N+1] ={};
for(int i=0;i<N;i++){
ll a;
cin >> a;
sum[i+1] = sum[i]+a;
}
vector<ll> candidates;
for(int l=0;l<N;l++)for(int r =l;r<N;r++){
candidates.push_back(sum[r+1]-sum[l]);
}
vector<ll> used(candidates.size(),false);
ll ans =0;
for(ll degree = 50;degree>=0;--degree){
ll num =0;
for(int i=0;i<candidates.size();i++){
if(used[i]){
continue;
}
if(candidates[i] & (1ll<<degree)){
num++;
}
}
if(num>=K){
ans += (1ll<<degree);
for(int i=0;i<candidates.size();i++){
if(!(candidates[i] & (1ll<<degree))){
used[i] = true;
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 51,778,756
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=200100;
vector<int>v[maxn];
int n;
int dfs(int x,int fa)
{
int ans=0;
for(int i=0;i<v[x].size();i++)
{
int y=v[x][i];
if(y==fa)continue;
ans^=(dfs(y,x)+1);
}
return ans;
}
int main()
{
cin>>n;
for(int i=1;i<n;i++)
{
int x,y;
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
if(dfs(1,0))cout<<"Alice";
else cout<<"Bob";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
EACH(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
REP(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
REP(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
FOR(i, 1, 10) FOR(j, 1, 10) {
cout << i << "x" << j << "=" << i*j << endl;
}
}
| 0
| 929,822
|
#include <iostream>
using namespace std;
class LightList
{
private:
const static int INVALID = -1;
int front, back;
int *allocate_array;
public:
LightList(int size) :
front(0), back(0)
{
allocate_array = new int[size];
}
~LightList()
{
delete[] allocate_array;
}
void insert(int x)
{
allocate_array[front] = x;
front++;
}
void remove(int x)
{
for (int i = front - 1; i >= back; i--) {
if (allocate_array[i] == x) {
allocate_array[i] = INVALID;
if (i == front - 1)
front--;
if (i == back)
back++;
break;
}
}
}
void deleteFirst()
{
front--;
}
void deleteLast()
{
back++;
}
void print()
{
int i = front - 1;
while (i >= back && allocate_array[i] == INVALID) i--;
cout << allocate_array[i];
i--;
for (; i >= back; i--) {
if (allocate_array[i] != INVALID)
cout << ' ' << allocate_array[i];
}
cout << endl;
}
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, size = 1000020;
cin >> n;
if (n < 1000020) size = n;
LightList number_list(size);
for (int i = 0; i < n; i++) {
char command[12];
int x;
cin >> command;
if (command[0] == 'i') {
cin >> x;
number_list.insert(x);
}
else {
switch (command[6]) {
case '\0':
cin >> x;
number_list.remove(x);
break;
case 'F':
number_list.deleteFirst();
break;
case 'L':
number_list.deleteLast();
break;
}
}
}
number_list.print();
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#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 FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, D;
cin >> N >> D;
vector<valarray<int>> X(N, valarray<int>(0, D));
FOR(n, 0, N) {
FOR(d, 0, D) {
cin >> X.at(n)[d];
}
}
int ans = 0;
FOR(i, 0, N) {
FOR(j, i + 1, N) {
float x = sqrt(pow(X.at(i) - X.at(j), 2).sum());
if (floor(x) == x) { ++ans; }
}
}
cout << ans << endl;
}
| 0
| 15,945,216
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
double l;
cin >> l;
l /= 3;
cout << fixed << setprecision(15);
cout << l * l * l << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<cmath>
#include<stack>
#include<string.h>
#include <iomanip>
#define rep(i,n) for(int i = 0;i<n;i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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; }
int main() {
int n,m;
cin >> n >> m;
vector<int>p(m),y(m);
rep(i,m) {
cin >> p[i] >> y[i];
p[i]--;
}
vector<vector<int>>val(n);
rep(i,m) {
val[p[i]].push_back(y[i]);
}
rep(i,n) {
sort(val[i].begin(),val[i].end());
}
rep(i,m) {
printf("%06d",p[i]+1);
int id = lower_bound(val[p[i]].begin(),val[p[i]].end(),y[i])-val[p[i]].begin();
printf("%06d\n",id+1);
}
}
| 0
| 31,506,793
|
#include<bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for(auto itr = mp.begin();itr != mp.end(); itr ++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<int > vecint;
typedef vector<string > vecstr;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << ((a <= c && c <= b)?"Yes":"No") << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%lld%lld", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define Rep(x,y) for(int x = 0; x < y; x++)
#define Repe(x,y,z) for(int x = z; x < y; x++)
#define YesNo(a) (a)?printf("Yes\n"):printf("No\n");
int main() {
int n;
ll x[1000] = {},y[1000];
ll leng[1000];
Scd(n);
Rep(i,n){
Scd2(x[i],y[i]);
leng[i] = abs(x[i]) + abs(y[i]);
}
int odd = leng[0] % 2;
Rep(i,n){
if(leng[i] % 2 != odd){
printf ("%d\n", -1);
return 0;
}
}
int ans = 31;
ans += !odd;
printf ("%d\n", ans);
ans -= !odd;
if(!odd) printf ("%d ", 1);
ll longer[32] = {1};
Rep(i,ans){
printf("%lld", longer[i]);
if( i+1 != ans) {
printf (" ");
longer[i+1] = longer[i];
longer[i+1] *= 2;
}
}
printf ("\n");
ans += !odd;
ll pow31 = 1;
Rep(i,31) pow31*=2;
ll u[1000],v[1000];
Rep(i,n){
if(!odd) x[i]--;
u[i] = x[i] + y[i];
v[i] = x[i] - y[i];
u[i] = (u[i] + (pow31 - 1)) / 2;
v[i] = (v[i] + (pow31 - 1)) / 2;
ll xx = 0;
ll yy = 0;
Rep(j,ans){
if( !odd && j == 0) {printf ("R"); xx++ ;continue;}
if( u[i] % 2 && v[i] % 2){
printf ("R");
xx += longer[j-!odd];
}else if( u[i] % 2 == 0 && v[i] % 2){
printf ("D");
yy -= longer[j-!odd];
}else if( u[i] % 2 && v[i] % 2 == 0 ){
printf ("U");
yy += longer[j-!odd];
}else{
printf ("L");
xx -= longer[j-!odd];
}
u[i] /= 2;
v[i] /= 2;
}
printf ("\n");
}
return 0;
}
| 0
| 23,066,113
|
#include<iostream>
using namespace std;
int main()
{
int p, q;
cin >> p >> q;
cout << (3 * p + q) / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define _ << " " <<
#define all(X) (X).begin(), (X).end()
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define Ti4 tuple<int, int, int, int>
#define Tlll tuple<ll, ll, ll>
#define PI 3.141592653589793
int main() {
string s, t = "yuiophjklnm";
bool b[200] = {};
for (int i = 0; i < t.size(); i++) b[t[i]] = 1;
while (cin >> s) {
if (s == "#") return 0;
int ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (b[s[i]] ^ b[s[i + 1]]) ans++;
}
cout << ans << endl;
}
}
| 0
| 64,914,039
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define xrep(i,x,n) for(ll i = (ll) x; i < (ll) n; i++)
#define vl vector<long long>
#define vs vector<string>
int main() {
ll N; cin >> N;
string S,T,U; cin >> S >> T;
rep(i,N){
U = U + S[i] + T[i];
}
cout << U << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 10001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
const double PI = acos(-1);
typedef pair<int, int> P;
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mpow(int N, int P, int M)
{
if (P == 0)
return 1;
if (P % 2 == 0)
{
int t = mpow(N, P / 2, M);
return t * t % M;
}
return N * mpow(N, P - 1, M) % M;
}
int counter(int x)
{
if (x == 0)
return 0;
return counter(x >> 1) + (x & 1);
}
vector<bool> prime(maxn + 1, true);
void prime_table(void)
{
prime[0] = false;
prime[1] = false;
for (int i = 2; i * i <= maxn; i++)
{
if (!prime[i])
{
continue;
}
for (int j = i + i; j <= maxn; j += j + i)
{
prime[j] = false;
}
}
}
bool IsPrime(int num)
{
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
vector<int> divisor(int n)
{
vector<int> ret;
for (int i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
ret.push_back(i - 1);
if (i * i != n)
{
ret.push_back((n / i) - 1);
}
}
}
sort(ret.begin(), ret.end());
return (ret);
}
int main()
{
string S;
string T;
cin >> S >> T;
cout << T << S << endl;
}
| 0
| 75,235,421
|
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define f(i,n) for(ll i=0;i<n;i++)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define nl "\n"
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define cout1(a) cout<<a<<nl
#define cout2(a,b) cout<<a<<" "<<b<<nl
#define cout3(a,b,c) cout<<a<<" "<<b<<" "<<c<<nl
#define cout4(a,b,c,d) cout<<a<<" "<<b<<" "<<c<<" "<<d<<nl
#define vcout(v,i) cout<<v[i].fi<<" "<<v[i].se<<nl
#define x first
#define y second
#define vc vector
#define pb push_back
#define ar array
#define all(a) (a).begin(), (a).end()
#define ms(v,n,x) fill(v,v+n,x);
#define init(c,a) memset(c,a,sizeof(c))
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define sll set<ll>
#define vll vector<ll>
#define vpll vector<pll>
#define maxi(a,b,c) max(a,max(b,c))
#define maxii(a,b,c,d) max(max(a,b),max(c,d))
#define mini(a,b,c) min(a,min(b,c))
#define md(a,b) ((a%mod)*(b%mod)+mod)%mod
#define inf 9e18
#define cases ll T;cin>>T;while(T--)
#define BLOCK 500
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
typedef std::complex<double> Complex;
typedef std::valarray<Complex> CArray;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int32_t main()
{
fast
cout << fixed << setprecision(12);
ll n,k;
cin>>n>>k;
map<ll,ll> m;
ll ans=0;
vll a(n+1),p(n+1);
fore(i,1,n){
cin>>a[i];
p[i]=a[i]+p[i-1];
}
f(i,n+1){
if(i>=k)
m[((p[i-k]-(i-k))%k+k)%k]--;
ans+=m[(p[i]-i+k)%k];
m[(p[i]-i+k)%k]++;
}
cout<<ans;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
for (;;) {
string str;
getline(cin, str);
if (str == "0") break;
int tmp = 0;
for (string::iterator it = str.begin(); it != str.end(); ++it) {
if (0x30 <= *it && *it <= 0x39) {
tmp += int(*it) - 0x30;
} else {
cout << "?";
}
}
cout << tmp << endl;
}
return 0;
}
| 0
| 54,309,174
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main(){
int H,W;
cin >> H >> W;
vector<vector<char>> map (H, vector<char>(W));
for (int i=0;i<H;i++) {
for (int j=0;j<W;j++) {
cin >> map.at(i).at(j);
}
}
vector<bool> black_in_row(H,false);
vector<bool> black_in_column(W,false);
for (int i=0;i<H;i++) {
for (int j=0;j<W;j++) {
if (map.at(i).at(j) == '#') {
black_in_row.at(i) = true;
black_in_column.at(j) = true;
}
}
}
for (int i=0;i<H;i++) {
for (int j=0;j<W;j++) {
if (black_in_row.at(i) && black_in_column.at(j)) {
cout << map.at(i).at(j);
}
}
if (black_in_row.at(i)){
cout << endl;
}
}
}
|
#include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
char x; cin>>x;
if('a'<=x && x <='z')
cout<<"a\n";
else if('A'<=x && x <='Z')
cout<<"A\n";
return 0;
}
| 0
| 85,171,119
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
vector <ll> v(n);
ll sum = 0;
rep(i, n) {
cin >> v.at(i);
sum += v.at(i);
}
ll tmp = 0, res = sum;
rep(i, n) {
tmp += v.at(i);
sum -= v.at(i);
res = min(res, abs(tmp-sum));
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
int l,r;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
if(x==1) l=i+1;
}
r=n-l+1;
int ans=0;
if(n==k){
ans =1;
}
else if(l<=k || r<=k){
n -= k;
ans ++;
ans += (n-1)/(k-1)+1;
}
else{
n--;
ans += n/(k-1);
}
cout << ans << endl;
return 0;
}
| 0
| 43,068,691
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
vector<ll> B(N + 1);
B[0] = 0;
rep(i,N){
B[i + 1] = B[i] + A[i];
}
map<ll,ll> mp;
rep(i,N + 1){
mp[B[i]]++;
}
ll ans = 0;
for (map<ll,ll>::iterator itr = mp.begin(); itr != mp.end(); itr++){
ans += (itr->second * (itr->second - 1)/ 2);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl vector<pll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pr_d(x) cout << fixed << setprecision(15) << x << endl
#define ud(c, x) distance(c.begin(), upper_bound(all(c), x))
#define ld(c, x) distance(c.begin(), lower_bound(all(c), x))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep3(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep4(i, a, b) for (int i = (a); i > (b); --i)
#define pb push_back
#define out(x) cout << x << "\n"
bool odd(int i) { return i % 2; }
#define all(v) v.begin(), v.end()
#define size(x) int(x.size())
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
void Yes_No(bool f) {
if (f)
printf("Yes\n");
else
printf("No\n");
}
void deb_p(pii p) { printf("pair = %d %d\n", p.fi, p.se); }
void deb_i(int i) { printf("i = %d\n", i); }
void deb_v(vector<int> v) {
printf("v = ");
for (auto i : v) printf("%d ", i);
printf("\n");
}
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void solve(void) {
int a, b;
cin >> a >> b;
if (a % 3 == 0 || b % 3 == 0 || (a + b) % 3 == 0)
out("Possible");
else
out("Impossible");
}
int main(void) { solve(); }
| 0
| 91,166,066
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
int h,w;
cin>>h>>w;
vector<string> c(h);
rep(i,h)cin>>c[i];
vector<string> ans(2*h);
rep(i,h){
if(i==0){
ans[0]=c[0];
ans[1]=c[0];
continue;
}
ans[2*i]=c[i];
ans[2*i+1]=c[i];
}
rep(i,2*h){
cout<<ans[i]<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
int main()
{
ll n,k;
cin>>n>>k;
ll a[n+1];
ll c[n+1];
for(ll i=1;i<=n;i++)
cin>>a[i];
for(ll i=1;i<=n;i++)
cin>>c[i];
ll ans=-inf;
for(ll i=1;i<=n;i++)
{
vector<ll>v;
v.push_back(0);
ll sum=c[i];
ll j=a[i];
ll len=1;
while(j!=i)
{
sum+=c[j];
j=a[j];
len++;
}
ll path=0;
ll cnt=0;
while(1)
{
cnt++;
if(cnt>k)
break;
path+=c[j];
j=a[j];
ll score=path+(max(0ll,sum)*((k-cnt)/len));
ans=max(ans,score);
if(i==j)
break;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 83,822,343
|
#include <bits/stdc++.h>
using namespace std;
long long x, y;
int main() {
cin >> x >> y;
if (x % y == 0)
return cout << -1, 0;
cout << x;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
bool OK=true;
map<char,int> data;
rep(i,4){
data[S[i]]++;
}
if(data.size()!=2){
OK=false;
}
for(auto p:data){
auto v=p.second;
if(v!=2){
OK=false;
}
}
if(OK==true){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
| 0
| 24,452,874
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<fstream>
using namespace std;
string s;
int dp[(1<<26)+1];
long long now=0;
int main(){
cin>>s;
memset(dp,63,sizeof(dp));
dp[0]=0;
for(int i=0;i<=s.length()-1;i++){
now^=(1<<(s[i]-'a'));
for(int j=0;j<=25;j++){
if((now^(1<<j))!=now){
dp[now]=min(dp[now],dp[now^(1<<j)]+1);
}
}
}
cout<<max(1,dp[now])<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e10
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
int n, w, h;
cin >> w>> h >>n;
int x, y, a;
pair<int, int> bottom = {0, 0};
pair<int, int> top = {w, h};
bool gone = false;
REP(i, n){
cin >> x>> y >> a;
if (a==1){
if (bottom.first < x) bottom.first = x;
}
else if (a == 2){
if (top.first > x) top.first = x;
}
else if (a == 3){
if (bottom.second < y) bottom.second= y;
}
else{
if (top.second > y) top.second = y;
}
}
if(top.first - bottom.first< 0 || top.second - bottom.second < 0)cout << 0;
else cout << (top.first - bottom.first)*(top.second - bottom.second )<<endl;
return 0;
}
| 0
| 86,435,477
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
int main() {
int N, Q;
cin >> N >> Q;
UnionFind UF(N);
rep(i,Q) {
int P,A,B;
cin >> A >> B;
UF.merge(A,B);
}
int ans = 0;
rep(i,N) {
ans = max(ans,UF.size(i));
}
cout << ans << endl;
}
|
#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 MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
long double a,b,x;
cin>>a>>b>>x;
cout<<fixed<<setprecision(10);
if(x<a*a*b/2){
cout<<atan(a*b*b/(2*x))*180.0/M_PI;
}else{
cout<<atan((2*a*a*b-2*x)/(a*a*a))*180.0/M_PI;
}
}
| 0
| 17,416,462
|
#include<bits/stdc++.h>
using namespace std;
int main(void) {
int n,l[1000],r[1000],a[1000],ans=0;
cin >> n;
for(int i=0;i<n;++i) cin >> l[i] >> r[i];
for(int i=0;i<n;++i) {
a[i] = r[i] - l[i] + 1;
ans = ans + a[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N;
cin >> N;
ll sum = 0;
vector<ll> A(N+1);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
A[N] = A[0];
if (sum % (N*(N+1)/2) != 0) {
cout << "NO" << endl;
return 0;
}
ll op = sum / (N*(N+1)/2);
for (int i = 1; i <= N; i++) {
if ((A[i-1]-A[i]+op) % N != 0 || A[i] < op) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 51,599,096
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
vector<int> edge[N];
int col[N];
int a[3];
int n, m;
bool bp;
void DFS(int u) {
for (int v: edge[u]) {
if (col[v] != -1) {
if ((col[v]^col[u]) != 1) bp = false;
} else {
col[v] = col[u]^1;
DFS(v);
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i=1; i<=m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
edge[u].push_back(v);
edge[v].push_back(u);
}
memset(col, -1, sizeof(col));
for (int i=1; i<=n; ++i) {
if (col[i] != -1) continue;
if (edge[i].size() == 0) { col[i] = 0; a[0]++; }
else {
col[i] = 0;
bp = true;
DFS(i);
if (bp) a[1]++;
else a[2]++;
}
}
ll ans = 0;
for (int i=1; i<3; ++i) {
for (int j=1; j<3; ++j) {
if (i == 1 && j == 1) ans += (ll)a[i]*a[j]*2LL;
else ans += (ll)a[i]*a[j];
}
}
ans += (ll)a[0]*(n-a[0])*2LL+(ll)a[0]*a[0];
printf("%lld\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
#define MAXI 1000000
int main() {
string s;
while(getline(cin, s), s != "."){
stack<int> st;
bool flag = true;
rep(i, s.size()){
if(s[i] == '(') st.push(1);
if(s[i] == '[') st.push(2);
if(s[i] == ')'){
if(st.empty() || st.top() != 1){
flag = false;
break;
}
st.pop();
}
if(s[i] == ']'){
if(st.empty() || st.top() != 2){
flag = false;
break;
}
st.pop();
}
}
if(flag && st.empty()) cout << "yes" << endl;
else cout << "no" << endl;
}
return 0;
}
| 0
| 88,441,970
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
static const double EPS = 1e-5;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
int main(void){
int N,M;
while(cin>>N>>M){
if(N==0) break;
vector<PII> times;
REP(i,N){
int D,P;
cin>>D>>P;
times.push_back(PII(P,D));
}
sort(times.begin(),times.end());
reverse(times.begin(),times.end());
int ans=0;
REP(i,N){
if(M>0){
ans += max(0,times[i].second-M) * times[i].first;
M-=times[i].second;
}else{
ans += times[i].second*times[i].first;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#pragma GCC optimize ("-O2")
#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define mii map<int,int>
#define vi vector<int>
#define vll vector<long long>
#define all(a) (a).begin(),(a).end()
#define clz(a) __builtin_clz(a)
#define ctz(a) __builtin_ctz(a)
#define popc(a) __builtin_popcount(a)
#define lul 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define SIZE 1000005
#define F first
#define S second
#define debug(x) cerr << #x << " = " << x << endl;
#define mod 998244353
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
std::cerr << name << " = " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');std::cerr.write(names, comma - names) << " = " << arg1<<" |";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
#define endl '\n'
const ld PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
void solve()
{
int n,k; cin>>n>>k;
cout<<n-k+1;
}
int main()
{
FAST;
int t; t=1;
while(t--){
solve();
}
return 0;
}
| 0
| 13,842,622
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <string>
#include <cmath>
#include <climits>
#include <cstdint>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1>::type>; };
template <typename T>
struct vector_helper<T, 0> { using type = T; };
template <typename T, size_t Depth>
using vector_t = typename vector_helper<T, Depth>::type;
template <typename T> using vec = vector_t<T, 1>;
template <typename T> using vvec = vector_t<T, 2>;
template <typename T> using vvvec = vector_t<T, 3>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0) return 1; if (b == 1) return a % mod; if (b == 2) return (a * a) % mod;
return (max(a * (b & 1), (int64_t)1) * mpow(mpow(a, b / 2, mod), 2, mod)) % mod;
}
constexpr int64_t mdiv(int64_t a, int64_t b, int64_t mod = 1000000007) {
return (a * mpow(b, mod - 2, mod)) % mod;
}
}
int main() {
int n; cin >> n;
cout << (n - 2) * 180 << endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
using namespace std;
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 3e2 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
int n, k, dp[N][N], a[N];
main () {
cin >> n >> k;
if (n == k) {
cout << 0;
return 0;
}
forn (i, 1, n)
cin >> a[i];
forn (i, 0, n)
forn (j, 0, n)
dp[i][j] = INF;
dp[0][0] = 0;
forn (i, 1, n)
forn (j, 1, i)
forn (z, 0, i - 1)
dp[i][j] = min(dp[i][j], dp[z][j - 1] + max(0ll, a[i] - a[z]));
int ans = INF;
forn (i, 1, n)
ans = min(ans, dp[i][n - k]);
cout << ans << endl;
}
| 0
| 22,626,551
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
class dlink {
public:
dlink(int k) : prev(NULL), next(NULL), key(k) {}
dlink *prev;
dlink *next;
int key;
};
class list {
public:
list() : head(NULL), tail(NULL) {}
dlink *head;
dlink *tail;
void ins(int k) {
dlink *d = new dlink(k);
if (head) {
head->prev = d;
d->next = head;
} else {
d->prev = NULL;
d->next = NULL;
tail = d;
}
head = d;
}
void del(int k) {
dlink *d = head;
while (d) {
if (d->key == k) {
dlink *p = d->prev;
dlink *n = d->next;
if (p) p->next = n;
if (n) n->prev = p;
if (d == head) head = d->next;
if (d == tail) tail = d->prev;
delete d;
break;
}
d = d->next;
}
}
void delFirst() {
dlink *d = head;
if (d) {
head = head->next;
if (head) {
head->prev = NULL;
} else {
tail = NULL;
}
delete d;
}
}
void delLast() {
dlink *d = tail;
if (d) {
tail = tail->prev;
if (tail) {
tail->next = NULL;
} else {
head = NULL;
}
delete d;
}
}
};
int main() {
int n;
cin >> n;
list lst;
char cmd[20];
int m;
for (int i = 0; i < n; i++) {
scanf("%s", cmd);
if (strcmp(cmd, "insert") == 0) {
scanf("%d", &m);
lst.ins(m);
} else if (strcmp(cmd, "delete") == 0) {
scanf("%d", &m);
lst.del(m);
} else if (strcmp(cmd, "deleteFirst") == 0) {
lst.delFirst();
} else if (strcmp(cmd, "deleteLast") == 0) {
lst.delLast();
}
}
dlink *p = lst.head;
while (p != NULL) {
if (p != lst.head) {
cout << " ";
}
cout << p->key;
p = p->next;
}
cout << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n; cin>>n;
long long int a,b,f,min=10000000000;
for(int i=1;i<=n/i;i++){
f=1;
if(n%i==0){
a=i;
b=n/a;
while(b>0){
if(b/10!=0){
f++;
}
b/=10;
}
if(f<min) min=f;
}
}
cout<<min<<endl;
}
| 0
| 60,425,017
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
int N,K;cin>>N>>K;
vector<ll> num(K+1,0);
ll ans = 0;
for (int x = K;x > 0;x--) {
ll cnt = 0, kind = 1;
int now = x + x;
while(now <= K) {
kind++;
cnt = (cnt + num[now]) % MOD;
now += x;
}
ll gap = ((modpow(kind,N,MOD) - cnt + MOD) % MOD);
ans += (gap * x) % MOD;
ans %= MOD;
num[x] = gap;
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
int main() {
string S; cin>>S;
long long counter=0;
long long counter1=0;
long long counter2=0;
long long answer=0;
if(S.at(0)=='<'){
counter++;}
else
counter1++;
for(long long i=1; i<S.size(); i++){
if(counter>0&&counter2==0){
if(S.at(i)=='<'){
counter++;
continue;}
else{
answer+=counter*(counter+1)/2;
counter1++;
counter2=counter;
counter=0;
continue;}}
else {
if(S.at(i)=='>'){
counter1++;
continue;}
else{
answer+=counter1*(counter1-1)/2+max((counter1-counter2),0LL);
counter++;
counter2=0;
counter1=0;
continue;}}}
answer+=counter*(counter+1)/2;
answer+=counter1*(counter1-1)/2+max((counter1-counter2),0LL);
cout<<answer<<endl;}
| 0
| 51,814,848
|
#include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main()
{
string s;
cin>>s;
int num = (s[0] - '0') *100 + (s[1]- '0') * 10 + (s[2]- '0');
int l = s.length();
int min_diff = 753;
rep(i,3, l - 1)
{
min_diff = min(min_diff, abs(753 - num));
num = num - 100 * (s[i-3] - '0');
num = num * 10 + (s[i] - '0');
}
cout<< min(min_diff, abs(753 - num));
}
|
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
#define int long long
int n;
int a[N];
int ans;
int last[N];
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
last[1] = 0;
for (int i = 2; i <= n; ++i)
{
last[i] = i - 1;
if (a[i] == 0)
{
if (a[i - 1] == 0) last[i] = last[i - 1];
}
}
for (int i = 1; i <= n; ++i)
{
int cursum = 0;
int curxor = 0;
int j = i;
while (j != 0)
{
cursum += a[j];
curxor ^= a[j];
if (cursum == curxor) ans += j - last[j];
else break;
j = last[j];
}
}
cout << ans;
return 0;
}
| 0
| 32,762,865
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GetLeastCommonMultiple(long long a, long long b) {
long long m = a;
long long n = b;
long long temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return a / n * b;
}
int main() {
ll a, b; cin >> a >> b;
cout << GetLeastCommonMultiple(a, b) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
string key = "keyence";
bool ok = false;
rep(i,s.length()){
rep(j,s.length()){
rep(k,s.length()){
auto t = s;
if(k > s.length()-j) break;
string a;
t.erase(j,k);
if(t == key) ok = true;
}
}
}
if(ok) cout << "YES" << endl;
else cout << "NO" << endl;
cout << endl;
return 0;
}
| 0
| 7,869,871
|
#include<bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fr first
#define sc second
#define N 300009
#define inf 2e16
#define pi pair<ll,ll>
#define pb push_back
using namespace std;
typedef long long ll;
void slv()
{
}
vector<int>adj[N];
bool vis[N];
int dis[N];
void vfs(int s)
{
queue<int>q;
q.push(s);
dis[s]=0;
vis[s]=1;
while (!q.empty())
{
int u=q.front();
q.pop();
for(auto v : adj[u])
{
if(!vis[v])
{
vis[v]=1;
dis[v]=dis[u]+1;
q.push(v);
}
}
}
}
int main()
{
int n,m;
cin>>n>>m;
while(m--)
{
int u,v;
cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
vfs(1);
if(dis[n]==2) puts("POSSIBLE");
else puts("IMPOSSIBLE");
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
int main(void){
int N;
std::cin >> N;
std::vector<std::vector<int>> A(N, std::vector<int>(2));
for (int i=0; i<N; ++i){
std::cin >> A.at(i).at(0);
A.at(i).at(1) = i + 1;
}
std::sort(A.begin(), A.end());
for (int i=0; i<N-1; ++i) {
std::cout << A.at(i).at(1) << " ";
}
std::cout << A.at(N - 1).at(1) << std::endl;
return 0;
}
| 0
| 33,524,162
|
#include <iostream>
#include <queue>
#define ll long long
#define up (ll)1e10
#define MAXN 1000005
using namespace std;
struct node {
ll num, step;
node(){}
node(ll n, ll s) : num(n), step(s){}
};
deque <node> q;
bool vst[MAXN];
ll k;
void slove() {
q.push_front(node(1, 1));
while(!q.empty()) {
node t = q.front();
vst[t.num] = 1;
if(t.num == 0) {
cout << t.step << "\n";
return;
}
q.pop_front();
if(!vst[t.num*10%k])
q.push_front(node(t.num*10%k, t.step));
if(!vst[(t.num+1)%k])
q.push_back(node((t.num+1)%k, t.step+1));
}
}
int main () {
cin >> k;
slove();
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)
int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};
int dx9[9]={0,1,0,-1,1,-1,1,0,-1};
int dy9[9]={0,1,1,1,0,0,-1,-1,-1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
ll n, x, m;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> x >> m;
ll ans = x;
vector<ll> memo(m + 1, -1);
vector<ll> sum;
sum.push_back(0);
sum.push_back(x);
memo[x] = 1;
ll xx = x;
REP(i, min(n - 1, m + 10)) {
xx = xx * xx % m;
if(memo[xx] != -1) {
ans += xx;
sum.push_back(ans);
ans += ((n - (i + 2)) / (i + 2 - memo[xx])) * (sum[i + 2] - sum[memo[xx]]);
ans += sum[memo[xx] + ((n - (i + 2)) % (i + 2 - memo[xx]))] - sum[memo[xx]];
break;
} else {
ans += xx;
sum.push_back(ans);
memo[xx] = i + 2;
}
}
cout << ans << endl;
}
| 0
| 51,148,045
|
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
int digits(ll m){
int re = 0;
while(m > 0){
m /= 10;
re++;
}
return re;
}
int main(){
int h, w; cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> l(h, vector<int>(w, 0));
vector<vector<int>> r(h, vector<int>(w, 0));
vector<vector<int>> u(h, vector<int>(w, 0));
vector<vector<int>> d(h, vector<int>(w, 0));
vector<vector<int>> total(h, vector<int>(w, 0));
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == '#') l[i][j] = 0;
else{
if(j == 0) l[i][j] = 1;
else l[i][j] = l[i][j - 1] + 1;
}
}
}
for(int i = 0; i < h; i++){
for(int j = w - 1; j >= 0; j--){
if(s[i][j] == '#') r[i][j] = 0;
else{
if(j == w - 1) r[i][j] = 1;
else r[i][j] = r[i][j + 1] + 1;
}
}
}
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == '#') u[i][j] = 0;
else{
if(i == 0) u[i][j] = 1;
else u[i][j] = u[i - 1][j] + 1;
}
}
}
for(int i = h - 1; i >= 0; i--){
for(int j = 0; j < w; j++){
if(s[i][j] == '#') d[i][j] = 0;
else{
if(i == h - 1) d[i][j] = 1;
else d[i][j] = d[i + 1][j] + 1;
}
}
}
int ans_max = 0;
rep(i, h){
rep(j, w){
ans_max = max(l[i][j] + r[i][j] + u[i][j] + d[i][j] - 3, ans_max);
}
}
cout << ans_max << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main() {
int n,k;
cin >> n >> k;
vector<pair<int,int>> sushi(n);
for (int i = 0; i < n; i++) {
cin >> sushi[i].second >> sushi[i].first;
}
sort(sushi.rbegin(),sushi.rend());
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<>> que;
vector<int> cnt(n + 1, 0);
int answer = 0;
int kind = 0;
for (int i = 0; i < k; i++) {
int val = sushi[i].first;
int x = sushi[i].second;
que.emplace(val, x);
answer += val;
if(cnt[x] == 0) kind++;
cnt[x]++;
}
answer += kind * kind;
int tmp = answer;
for (int i = k; i < n; i++) {
int new_val = sushi[i].first;
int new_x = sushi[i].second;
if(cnt[new_x] > 0) continue;
int old_val = 0;
int old_x = 0;
while (!que.empty()) {
pair<int,int> p = que.top();
if(cnt[p.second] > 1 && new_x != p.second) {
old_val = p.first;
old_x = p.second;
que.pop();
break;
}
que.pop();
}
if(old_x == 0) break;
cnt[old_x]--;
cnt[new_x]++;
tmp -= kind * kind;
kind++;
tmp += kind * kind;
tmp -= old_val;
tmp += new_val;
answer = max(answer, tmp);
}
cout << answer << '\n';
}
| 0
| 384,668
|
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define FOR(i,l,r) for(size_t i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
bool is_integer( float x ){
return floor(x)==x;
}
int main() {
string s,t;
int n;
bool ans = false;
cin >> s >> t;
n = s.length();
if(s == t) cout << "Yes";
else {
for(int i = 0; i < n; i ++){
s = s[n-1] + s.substr(0,n-1);
if(s == t) ans = true;
}
cout << ((ans)?"Yes":"No");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
void min_self(int & a, int b){
if(b<a)
a=b;
}
int main(){
int h,w;
cin >> h >> w;
string grid[h];
for(int i =0;i<h;i++)
cin >> grid[i];
int dp[h][w];
dp[0][0] = 0;
for(int i =0;i<h;i++){
for(int j = 0;j<w;j++){
if(i+j==0)
dp[0][0] = (grid[0][0]=='#');
else{
dp[i][j] = INT_MAX;
if(i>0){
min_self(dp[i][j],dp[i-1][j]+(grid[i][j]=='#' && grid[i-1][j]=='.'));
}
if(j>0)
min_self(dp[i][j],dp[i][j-1]+(grid[i][j]=='#' && grid[i][j-1]=='.'));
}
}
}
cout << dp[h-1][w-1] << endl;
}
| 0
| 33,123,335
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for(ll i = n-1; i >= 0LL; i--)
#define FOR(i, n, m) for(ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()
#define INF (ll)1e18
#define INFD 1e18
#define PI 3.14159265358979
#define MOD 998244353
#define VL vector<ll>
vector<ll> dx = {-1, 1, 0, 0};
vector<ll> dy = {0, 0, 1, -1};
vector<ll> dx8 = {-1, -1, -1, 0, 0, 1, 1, 1};
vector<ll> dy8 = {-1, 0, 1, -1, 1, -1, 0, 1};
ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
ll N, L;
cin >> N >> L;
vector<ll> A(N);
REP(i, N) cin >> A[i];
vector<ll> ans;
REP(i, N-1) {
if (A[i] + A[i+1] >= L) {
PRINT("Possible");
ans.push_back(i+1);
REPR(j, i) {
ans.push_back(j+1);
}
FOR(j, i+1, N-1) {
ans.push_back(j+1);
}
REPR(i, N-1) {
PRINT(ans[i]);
}
return 0;
}
}
PRINT("Impossible");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define inf (int)(3e18)
#define P pair<int,int>
#define mod (int)(1e9+7)
#define mod2 998244353
template<class T> inline void chmin(T &a, T b) {
a = min(a, b);
}
template<class T> inline void chmax(T &a, T b) {
a = max(a, b);
}
int N;
P mx1[1<<18],mx2[1<<18];
signed main(){
cin>>N;
rep(i,1<<N){
cin>>mx1[i].first;
mx1[i].second=i;
mx2[i].second=-1;
}
int ans=0;
rep(i,1<<N){
chmax(ans,mx1[i].first+mx2[i].first);
if(i)cout<<ans<<endl;
rep(j,N){
if(i>>j&1)continue;
int k=i|(1<<j);
if(mx1[k].first<=mx1[i].first&&mx1[k].second!=mx1[i].second&&mx2[k].second!=mx1[i].second){
mx2[k]=mx1[k];
mx1[k]=mx1[i];
}else if(mx2[k].first<=mx1[i].first&&mx2[k].second!=mx1[i].second&&mx1[k].second!=mx1[i].second){
mx2[k]=mx1[i];
}
if(mx2[k].first<=mx2[i].first&&mx2[k].second!=mx2[i].second&&mx1[k].second!=mx2[i].second){
mx2[k]=mx2[i];
}
}
}
}
| 0
| 69,945,137
|
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int N = 300000, M = 300000, K = 300000;
int xx[K], yy[K];
int kkx[1 + N], kky[1 + M];
map<pair<int, int>, bool> mp;
int qux[N], quy[N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, m, k; cin >> n >> m >> k;
for (int h = 0; h < k; h++)
cin >> xx[h] >> yy[h];
for (int h = 0; h < k; h++) {
kkx[xx[h]]++, kky[yy[h]]++;
mp[make_pair(xx[h], yy[h])] = true;
}
int kx = 0;
for (int x = 1; x <= n; x++)
kx = max(kx, kkx[x]);
int ky = 0;
for (int y = 1; y <= m; y++)
ky = max(ky, kky[y]);
int cntx = 0;
for (int x = 1; x <= n; x++)
if (kkx[x] == kx)
qux[cntx++] = x;
int cnty = 0;
for (int y = 1; y <= m; y++)
if (kky[y] == ky)
quy[cnty++] = y;
for (int hx = 0; hx < cntx; hx++)
for (int hy = 0; hy < cnty; hy++)
if (!mp[make_pair(qux[hx], quy[hy])]) {
cout << kx + ky << '\n';
return 0;
}
cout << kx + ky - 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N+2);
A[0] = 0;
for (int i = 1; i <= N; i++) cin >> A[i];
A[N+1] = 0;
ll sum = 0;
for (int i = 0; i <= N; i++){
sum += abs(A[i] - A[i + 1]);
}
for (int i = 0; i < N; i++) {
cout << sum - abs(A[i + 1] - A[i]) - abs(A[i + 1] - A[i + 2]) +abs(A[i] - A[i + 2])<< endl;
}
return 0;
}
| 0
| 28,724,616
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#define TC(c) printf("Case %lld:\n", ++c)
#define out(x) cout << #x << " -> " << x << endl;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FILE freopen("input.txt", "r", stdin); freopen("out.txt", "w", stdout);
using namespace std;
const int N = 300010;
ll s, v, t;
int solve() {
cin>>s>>t>>v;
if(s<=v*t){
printf("Yes\n");
}
else printf("No\n");
return 0;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return solve();
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
using P =pair<int,int>;
ll ketasu(ll a){
ll num=1;
while(a/10){
num++;
a/=10;
}
return num;
}
ll gcd(ll a,ll b){return b ? gcd(b,a%b) :a;}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll kosuu(ll a){
ll sum=0;
for(ll i=1;i*i<=a;i++){
if(a%i==0){
if(a!=1&&i*i!=a){
sum+=2;
}else{
sum++;
}
}
}
return sum;
}
ll n;
vector<pair<ll,ll>>p;
void fs(ll a){
for(ll i=2;i*i<=n;i++){
ll cnt=0;
while(n%i==0){
n/=i;
cnt++;
}
p.emplace_back(i,cnt);
}
return;
}
int main()
{
cin>>n;
fs(n);
if(n!=1)p.emplace_back(n,1);
ll ans=0;
for(auto x:p){
ll b=1;
while(0<=x.second-b){
ans++;
x.second-=b;
b++;
}
}
cout<<ans<<endl;
}
| 0
| 26,538,049
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);
ll mod1 = 998244353;
ll mypow(ll a, ll b) {
ll h = b;
ll two;
ll ans = 1;
ll tmp;
while(h>0) {
two = 1;
tmp = a;
while(2*two<h) {
two *= 2;
tmp *= tmp;
tmp %= mod1;
}
h -= two;
ans *= tmp;
ans %= mod1;
}
return ans;
}
int main() {
int N;
cin>>N;
int D[N];
map<int, int> amap;
for(int i=0;i<N;++i) {
cin>>D[i];
amap[D[i]]++;
}
if(D[0]>0 || amap[0]>1) {
cout<<0<<endl;
return 0;
}
ll ans = 1;
ll num = 1;
int maxnum=0;
bool can = true;
bool owari = false;
for(int i=0;i<N;++i) {
if(amap[i]>0) {
if(owari) can = false;
maxnum = i;
}
else {
owari = true;
}
}
if(!can) {
cout<<0<<endl;
return 0;
}
for(int i=1;i<=maxnum;++i) {
ans *= mypow(num, amap[i]);
ans %= mod1;
num = amap[i];
}
cout<<ans<<endl;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
const int mod = 998244353;
ll power(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x *= x; p /= 2; } else { a *= x; p--; } }return a; }
ll mpower(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x = x * x % mod; p /= 2; } else { a = a * x % mod; p--; } }return a; }
ll c(ll n, ll k) { ll a = 1; rep(i, 1, k) { a *= n - i + 1; a /= i; }return a; }
ll mc(ll n, ll m) { ll k = 1, l = 1; rep(i, n - m + 1, n + 1) k = k * i % mod; rep(i, 1, m + 1) l = l * i % mod; l = mpower(l, mod - 2); return k * l % mod; }
#define MAX 100010
struct edge { int to; ll cost; };
vector<edge> G[MAX];
ll depth[MAX];
void dfs(int v, int p, ll d) {
depth[v] = d;
rep(i, 0, G[v].size()) {
if(G[v][i].to != p)dfs(G[v][i].to, v, d + G[v][i].cost);
}
}
void init(int root, int V) {
dfs(root, -1, 0);
}
int main() {
int N, Q, a, b, c, K;
vector<ll> ans;
scanf("%d", &N);
rep(i, 0, N - 1)scanf("%d%d%d", &a, &b, &c), a--, b--, G[a].push_back({ b, c }), G[b].push_back({ a, c });
scanf("%d%d", &Q, &K);
K--;
init(K, N);
rep(i, 0, Q) {
scanf("%d %d", &a, &b);
a--, b--;
ans.push_back(depth[a] + depth[b]);
}
rep(i, 0, Q)printf("%lld\n", ans[i]);
return 0;
}
| 0
| 85,880,939
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<=111)cout<<111<<endl;
else if(n>111&&n<=222)cout<<222<<endl;
else if(n>222&&n<=333)cout<<333<<endl;
else if(n>333&&n<=444)cout<<444<<endl;
else if(n>444&&n<=555)cout<<555<<endl;
else if(n>555&&n<=666)cout<<666<<endl;
else if(n>666&&n<=777)cout<<777<<endl;
else if(n>777&&n<=888)cout<<888<<endl;
else if(n>888&&n<=999)cout<<999<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); }
int bt(ll x) { return 63 - __builtin_clzll(x); }
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
vector<int> get_bits(int mask) {
vector<int> bb;
while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
reverse(all(bb));
return bb;
}
int get_mask(vector<int> v) {
int mask = 0;
for(int x : v) { mask ^= (1 << x); }
return mask;
}
template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r){
uniform_int_distribution<ll> uid(l, r);
return uid(rng);
}
void sc() {}
template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
const int mod = 1e9 + 7;
int pwr(int a,ll b) {
int ans = 1;
while(b) {
if(b & 1) ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
int n;
const int N = 2e5 + 5;
int a[N];
bool f(int x) {
vector<pii> v = {{a[1], 0}};
debug(x);
fr(i, 2, n) {
if(a[i] > a[i - 1]) {
v.pb({a[i] - a[i - 1], 0});
}
else {
int tot = a[i - 1];
while(tot > a[i]) {
pii p = v.back();
if(tot - p.fi >= a[i]) {
tot -= p.fi;
v.pop_back();
}
else {
v.back().fi = a[i] - (tot - p.fi);
break;
}
}
tot = a[i];
for(int i = sz(v) - 1; i >= 0; i--) {
if(v[i].se == x - 1) {
tot -= v[i].fi;
v.pop_back();
}
else {
if(v[i].fi == 1) {
v[i].se++;
}
else {
v[i].fi--;
int val = v[i].se;
v.pb({1, val + 1});
}
break;
}
}
if(tot == 0) {
return 0;
}
if(a[i] > tot)
v.pb({a[i] - tot, 0});
}
debug(v);
}
return 1;
}
void solve() {
map<int,int> m;
sc(n);
fr(i, 1, n) {
sc(a[i]);
}
int l = 0, r = n;
while(r - l > 1) {
int m = (l + r) >> 1;
if(f(m))
r = m;
else
l = m;
}
cout << r;
}
int main() {
ios :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
for(int tt = 1; tt <= t; tt++) {
solve();
}
return 0;
}
| 0
| 48,672,040
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A+B == C+D) {
cout << "Balanced" << endl;
}
else if (A+B >= C+D) {
cout << "Left" << endl;
}
else {
cout << "Right" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,coun=0;
cin>>n;
ll sum=n+100;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
coun++;
ll x= n/i;
if(i+x<sum)sum=(i+x);
}
}
if(coun==0)
cout<<n-1<<endl;
else{
cout<<sum-2<<endl;
}
}
| 0
| 25,739,519
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const ll INF = 1e18;
const int MAX = 1e6;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int gcd(vector<int> &a) {
int r;
rep(i, (int)a.size()) {
if (i == 0) r = a[i];
r = gcd(r, a[i]);
}
return r;
}
int main() {
int n, x;
cin >> n >> x;
vi a(n);
vi b(n);
rep(i, n) {
cin >> a[i];
b[i] = abs(x-a[i]);
}
int ans = gcd(b);
cout << ans << "\n";
}
|
#include "bits/stdc++.h"
using namespace std;
#define all(v) (v).begin(), (v).end()
#define io ios::sync_with_stdio(0)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rson rt << 1 | 1, mid + 1, r
#define lson rt << 1, l, mid
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eps 1e-12
const int mod = 1e9 + 7;
inline int ksm(int a, int b)
{
int ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
char a[500][500];
int dp[500][500];
int n,m;
void upd(int &x,int y){
if(x>y)x=y;
}
signed main(){
cin>>n>>m;
rep(i,1,n)rep(j,1,m)cin>>a[i][j];
memset(dp,0x3f,sizeof dp);
dp[0][1]=0;
rep(i,1,n){
rep(j,1,m){
if(a[i][j]=='#'){
upd(dp[i][j],dp[i-1][j] + 1 - (a[i-1][j] == '#'));
upd(dp[i][j],dp[i][j-1] + 1 - (a[i][j-1] == '#'));
}
else {
upd(dp[i][j],dp[i-1][j]);
upd(dp[i][j],dp[i][j-1]);
}
}
}
cout<<dp[n][m]<<endl;
getchar();getchar();
}
| 0
| 14,638,924
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
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; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
string ans="";
for(int i=0;i<s.size();i+=2){
ans+=s[i];
}
cout<<ans<<"\n";
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
const int inf = 1001001001;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m=numeric_limits<T>::max()){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
template<class T> struct edge { int to; T cost;};
int main() {
int n; cin >>n;
int lb = 0;
int ra = 0;
int lbra = 0;
int res = 0;
rep(i, n){
string s; cin >>s;
if (s[0] == 'B' && s[s.size()-1] == 'A') lbra++;
else if (s[0] == 'B') lb++;
else if (s[s.size()-1] == 'A') ra++;
rep(j, s.size()-1) if (s[j] == 'A' && s[j+1] == 'B') res++;
}
if (lbra > 0){
res += lbra - 1;
if (ra > 0){
res++;
}else if (lb > 0){
res++;
}
}
res += min(ra, lb);
cout <<res <<endl;
}
| 0
| 78,198,745
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int H,W;
char S[2100][2100];
cin>>H>>W;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>S[i][j];
}
}
vector<vector<int> > right(H,vector<int>(W,0));
vector<vector<int> > left(H,vector<int>(W,0));
vector<vector<int> > under(H,vector<int>(W,0));
vector<vector<int> > up(H,vector<int>(W,0));
for(int i=0; i<H; i++){
int cnt = 0;
for(int j=0; j<W; j++){
if(S[i][j] == '#') cnt = 0;
else cnt++;
left[i][j] = cnt;
}
}
for(int i=0; i<H; i++){
int cnt = 0;
for(int j=W-1; j>=0; j--){
if(S[i][j] == '#') cnt = 0;
else cnt++;
right[i][j] = cnt;
}
}
for(int j=0; j<W; j++){
int cnt = 0;
for(int i=0; i<H; i++){
if(S[i][j] == '#') cnt = 0;
else cnt++;
up[i][j] = cnt;
}
}
for(int j=0; j<W; j++){
int cnt = 0;
for(int i=H-1; i>=0; i--){
if(S[i][j] == '#') cnt = 0;
else cnt++;
under[i][j] = cnt;
}
}
int ans = 0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
ans = max(ans,(right[i][j] + left[i][j] + under[i][j] + up[i][j] - 3));
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i, n) for(int i =0 ; i < n; ++i)
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define pii pair < int, int >
typedef vector<int> vi;
typedef long long ll;
const int mod =1e9+7;
const int N = (int)2e5 + 5;
void solve(){
int x;
cin>>x;
cout<<(x<1200?"ABC":"ARC");
}
int main(){
Red;
int t=1;
while(t--)
solve();
return 0;
}
| 0
| 50,620,682
|
#include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifndef ONLINE_JUDGE
#endif
int n;
cin>>n;
vector<ll> a(n);
ll ans = 1e18,x = 0,y=0;
for(int i=0;i<n;i++){
cin>>a[i];
x += a[i];
}
for(int i=0;i<n-1;i++){
y+=a[i];
x-=a[i];
ans = min(ans,abs(x-y));
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define repr(i,n) for(int i=(n);i>=0;--i)
#define cinv(n,v) VL v(n);rep(i,n)cin>>v[i]
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define m_t make_tuple
#define p_p(a,b) pb(m_p(a,b))
#define all(a) a.begin(),a.end()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(all(a),greater<>())
#define UNIQUE(a) a.erase(unique(all(a)),a.end())
#define SZ(a) (signed)(a.size())
#define debg(a) cout<<#a<<" "<<a<<endl;
#define debgp(a) cout<<#a<<" "<<a.fi<<" : "<<a.se<<endl
#define call(a) for(auto i:a)cout<<i<<" ";cout<<endl
#define callp(a) for(auto [k,v]:a)cout<<k<<":"<<v<<endl
#define show(a) for(cont &y:a){for(cont &x:y){cout<<x<<" ";}cout<<endl;}
#define out(a) cout<<(a)<<endl
#define ENDL cout<<endl
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define LINE puts("------------------")
#define fi first
#define se second
#define V vector
#define P pair
#define T tuple
#define PQ priority_queue
#define cont const auto
#define VV(type,name,y,x,a) vector<vector<type>> name = vector<vector<type>>(y,vector<type>(x,a))
typedef long long ll;
typedef double D;
typedef long double LD;
typedef string str;
typedef vector<ll> VL;
typedef pair<ll,ll> PL;
typedef vector<pair<ll,ll>> VP;
typedef tuple<ll,ll,ll> T3;
typedef tuple<ll,ll,ll,ll> T4;
typedef struct{ll to;ll cost;} Graphs;
typedef V<V<Graphs>> AdjList;
const signed INF = (1LL<<30);
const long long MOD = (1e9+7);
const long long LINF = (1LL<<60);
const long long LMAX = LLONG_MAX;
void YN(bool b){cout<<(b?"Yes":"No")<<endl;}
template<class T>inline T gcd(T a,T b){if(b==0)return a; return(gcd(b,a%b));}
template<class T>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T>inline bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<class T>T center(T a,T b,T c){
if( (a<=b&&b<=c)||(a>=b&&b>=c) )return b;
if( (b>=a&&a>=c)||(b<=a&&a<=c) )return a;
return c;
}
void print(){}
template<class Head,class... Tail>
void print(Head&& head, Tail&&... tail){
cout<<head<<endl;
print(forward<Tail>(tail)...);
}
void input(){}
template<class Head,class... Tail>
void input(Head&& head, Tail&&... tail){
cin>>head;
input(forward<Tail>(tail)...);
}
template<typename T>
ostream &operator<<(ostream&out,const vector<T>&v){
if(!v.empty()){
copy(v.begin(),v.end(),ostream_iterator<T>(out,", "));
out<<"\b\b";
}
return out;
}
template<typename T1, typename T2>
ostream &operator<<(ostream&out,const pair<T1,T2>&p){
out<<p.first<<", "<<p.second;
return out;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
ll h,w,n;
input(h,w,n);
vector<ll> a(n),b(n);
rep(i,n)cin>>a[i]>>b[i];
map<pair<ll,ll>,ll> box_pos;
rep(i,n){
a[i]--,b[i]--;
rep(j,3){
if(a[i]-j<0||a[i]-j+2>=h)continue;
rep(k,3){
if(b[i]-k<0||b[i]-k+2>=w)continue;
box_pos[m_p(a[i]-j,b[i]-k)]++;
}
}
}
vector<ll> ans(10,0);
for(auto x:box_pos){
ans[x.se]++;
}
ll sum=0;
for(auto x:ans)sum+=x;
ans[0]=(h-2)*(w-2)-sum;
for(auto x:ans)out(x);
return 0;
}
| 0
| 50,362,969
|
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi pair<int,int>
#define pii pair<pair<int,int>,int>
#define pb push_back
#define pi 2*acos(0.0)
#define rev greater<int>()
#define pr(a,x,y) for(int i=x;i<y;i++){cout<<a[i]<<" ";}
#define ps(s) for(auto i:s){cout<<i<<" ";}
#define sp(x,y) fixed<<setprecision(y)<<x
#define w(x) ll x; cin>>x; while(x--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define test cout<<"This is test"<<endl;
#define str string
#define endl '\n'
#define e cout<<'\n';
void kehsihba(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
double get(pair<int,int>a,pair<int,int>b){
int x=a.ff-b.ff;
int y=a.ss-b.ss;
x=x*x;y=y*y;
return (double)sqrt(x+y);
}
void solve(){
ll n;cin>>n;
ll arr[n+1]={0};
for(int i=1;i<=n;i++){
cin>>arr[i];
}
ll a[n+1]={0};
for(int i=1;i<=n;i++){
a[arr[i]]=i;
}
pr(a,1,n+1);
}
int32_t main(){
kehsihba();
ll t=1;
for(int k=1;k<=t;k++){
solve();
}
}
|
#include <iostream>
#include <vector>
using namespace std;
vector<int> g[100005];
int n, m, h[100005], ans;
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> h[i];
while(m--) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for(int i = 1; i <= n; i++) {
bool good = true;
for(auto next: g[i])
if(h[next] >= h[i])
good = false;
if(good) ans++;
}
cout << ans;
}
| 0
| 73,973,571
|
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void milkshake() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int x = a[0];
for(int i = 1; i <= n; i++) {
if(x == 2) drop(i);
x = a[x-1];
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt=1;
while(tt--) milkshake();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using nagai = long long;
using ll = long long;
const int N = 1e6 + 100;
vector<int> g[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<nagai> d(n);
for (auto& x : d)
cin >> x;
vector<int> ord(n);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int a, int b)
{
return d[a] > d[b];
});
map<nagai, int> mp;
for (int i = 0; i < n; ++i)
mp[d[i]] = i;
vector<int> sz(n, 1);
vector<pair<int, int>> edg;
vector<bool> used(n);
ord.pop_back();
for (int x : ord)
{
used[x] = true;
nagai dp = d[x] + sz[x] - (n - sz[x]);
if (!mp.count(dp) || used[mp[dp]])
{
cout << -1 << '\n';
return 0;
}
edg.emplace_back(mp[dp], x);
sz[mp[dp]] += sz[x];
}
for (auto& p : edg)
{
int x = p.first, y = p.second;
g[x].push_back(y), g[y].push_back(x);
}
vector<nagai> d1(n, -1);
d1[0] = 0;
vector<int> q = {0};
for (int i = 0; i < q.size(); ++i)
{
int x = q[i];
for (int y : g[x])
if (d1[y] == -1)
d1[y] = d1[x] + 1, q.emplace_back(y);
}
if (d[0] != accumulate(d1.begin(), d1.end(), 0LL))
{
cout << -1 << '\n';
return 0;
}
for (auto& x : edg)
cout << x.first + 1 << ' ' << x.second + 1 << '\n';
return 0;
}
| 0
| 68,260,025
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using 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; }
const ll INF=(ll)1e19;
int main(){
char c;
REP(i,3){
cin >> c;
if(c=='1')cout << 9;
else if(c=='9')cout << 1;
else cout << c;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
set<int> s;
for (int i = 0; i < 3; i++) {
int a;
cin >> a;
s.insert(a);
}
if (s.size() == 1) {
puts("Yes");
}
else {
puts("No");
}
}
| 0
| 40,822,678
|
#include <iostream>
using namespace std;
int main(){
char c;
cin >> c;
if (c == 'z'){
c = 'a';
}
else c = (int)c + 1;
cout << (char)c << endl;
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str;
ll p;
cin>>n>>p;
vector<ll> v(n);
rep(i,n) {
cin>>a;
if(a%2) f=1;
}
if(!f){
if(p){
cout<<0<<endl;
}else {
sum=1;
rep(i,n) sum*=2;
cout<<sum<<endl;
}
}else{
sum=1;
rep(i,n-1) sum*=2;
cout<<sum<<endl;
}
return 0;
}
| 0
| 26,669,294
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=50;
int n,a[N+9];
string s[N+9],t;
void into(){
cin>>n;
for (int i=1;i<=n;++i)
cin>>s[i]>>a[i];
cin>>t;
}
int ans;
void Get_ans(){
int flag=0;
for (int i=1;i<=n;++i){
ans+=flag*a[i];
if (s[i]==t) flag=1;
}
}
void work(){
Get_ans();
}
void outo(){
printf("%d\n",ans);
}
int main(){
into();
work();
outo();
return 0;
}
|
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
const int dx[4] = { 1, 0, -1, 0};
const int dy[4] = { 0, 1, 0, -1};
using LL = long long int;
using LD = long double;
const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
int n, e;
vvl M;
void warshallFloyd() {
REP(k, n) {
REP(i, n) {
if (M[i][k] == INF64) continue;
REP(j, n) {
if (M[k][j] == INF64) continue;
M[i][j] = min(M[i][j], M[i][k] + M[k][j]);
}
}
}
}
void print() {
REP(i, n) {
if (M[i][i] < 0) {
cout << "NEGATIVE CYCLE" << "\n";
return;
}
}
REP(i, n) {
REP(j, n) {
if (j) cout << " ";
if (M[i][j] == INF64) cout << "INF";
else cout << M[i][j];
}
cout << "\n";
}
}
void solve() {
warshallFloyd();
print();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> e;
M.resize(n, vl(n, INF64));
REP(i, n) M[i][i] = 0;
LL s, t, d;
REP(i, e) {
cin >> s >> t >> d;
M[s][t] = d;
}
solve();
return 0;
}
| 0
| 41,953,388
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(N) for (int i = 0; i < N; i++)
int count_char(string S, char c){
int count = 0;
int pos = S.find(c);
while (pos != string::npos){
count++;
pos = S.find(c, pos + 1);
}
return count;
}
int main(){
string S, T;
cin >> S >> T;
int i = 0;
vector<int> S_char_counts('z'-'a' + 1);
vector<int> T_char_counts('z'-'a' + 1);
bool can_match = true;
for (char c = 'a'; c <= 'z'; c++){
S_char_counts[i] = count_char(S, c);
T_char_counts[i] = count_char(T, c);
i++;
}
sort(S_char_counts.begin(), S_char_counts.end());
sort(T_char_counts.begin(), T_char_counts.end());
for (i = 0; i < 'z' - 'a' + 1; i++){
if (S_char_counts[i] == T_char_counts[i]){
continue;
}else{
can_match = false;
break;
}
}
if (can_match == true) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int add(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return (a + b) % mod;
}
int mul(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return 1ll * a * b % mod;
}
int fp(int b, int p){
if(!p) return 1;
ll ret = fp(b, p >> 1);
ret = ret * ret % mod;
if(p&1) ret = ret * b % mod;
return ret;
}
int kam[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, k;
cin >> n >> k;
ll ans = fp(k, n);
fill(kam, kam + N, 1);
for(int i = 2; i <= k; i++){
for(int j = i + i; j <= k; j += i) kam[j] += (i - kam[i]);
}
for(int i = 2; i <= k; i++){
ll x = i - kam[i];
ans = add(ans, mul(x, fp(k / i, n)));
}
cout << ans;
return 0;
}
| 0
| 65,754,899
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.