code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, N;
cin >> N >> A;
cout << N * N - A;
return 0;
} | #include<cstdio>
#include<cstring>
int main() {
char str[1001], cmd[8], p[1001], tmp;
int q, i, a, b, j;
scanf("%s%d", str, &q);
for (i = 0; i < q; i++) {
scanf("%s%d%d", cmd, &a, &b);
if (strcmp(cmd, "print") == 0) {
for (j = a; j <= b; j++) printf("%c", str[j]);
printf("\n");
}
else if (strcmp(cmd, "reverse") == 0) {
while (a < b) {
tmp = str[a];
str[a] = str[b];
str[b] = tmp;
a++;
b--;
}
}
else if (strcmp(cmd, "replace") == 0) {
scanf("%s", p);
for (j = a; j <= b; j++)str[j] = p[j - a];
}
}
return 0;
} | 0 | 4,467,680 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int n,m,ans=0;
Graph g;
vector<bool>seen;
void dfs(int x){
seen[x]=true;
bool flag=true;
rep(i,n){
if(!seen[i]){
flag=false;
}
}
if(flag){
ans++;
return;
}
for(int next_x:g[x]){
if(seen[next_x])continue;
seen[next_x]=true;
dfs(next_x);
seen[next_x]=false;
}
return;
}
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n>>m;
int a,b;
g.resize(n);
seen.resize(n);
rep(i,m){
cin>>a>>b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
seen[0]=true;
dfs(0);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= int(a); i--)
#define WRAP(y, x, h, w) (0 <= y && y < h && 0 <= x && x < w)
#define ALL(x) (x).begin(), (x).end()
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
REP(i, n)
{
cin >> a[i];
a[i]--;
}
vector<ll> b(n,0);
REP(i,n){
b[a[i]]++;
}
vector<ll> c(n);
ll ans=0;
REP(i,n){
c[i]=b[i]*(b[i]-1)/2;
ans+=c[i];
}
REP(i,n){
cout<<ans-c[a[i]]+(c[a[i]]*(b[a[i]]-2)/b[a[i]])<<endl;
}
} | 0 | 31,049,445 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll n;
cin >> n;
cout << n*(n-1)/2 << endl;
} | # include <iostream>
# include <deque>
using namespace std;
string S;
int K;
deque<int> d;
int counter=0;
long long ans=0;
bool allsame=true;
int main()
{
cin>>S;
cin>>K;
char current=S[0];
for (int i=0; i<S.size(); i++)
{
if (S[i]==current)
{
counter++;
}
else
{
d.push_back(counter);
counter=1;
current=S[i];
}
}
d.push_back(counter);
for (int i=0; i<d.size(); i++)
{
if (d[i]>1)
{
ans=ans+(d[i]/2);
}
}
for (int i=0; i<S.size(); i++)
{
current=S[0];
if (S[i]!=current)
{
allsame=false;
break;
}
}
if (allsame)
{
ans=1ll*K*S.size()/2;
}
else if (d.front()%2==1 && d.back()%2==1 && S[0]==S[S.size()-1])
{
ans=ans*K;
ans=ans+K-1;
}
else
{
ans=ans*K;
}
cout<<ans<<endl;
} | 0 | 62,978,772 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < n; i++)
const ll mod = 1000000007;
int main() {
int n,m;
cin >> n >> m;
int s[n];
rep(i,n) cin >> s[i];
int t[m];
rep(i,m) cin >> t[i];
ll dp[n+1][m+1];
rep(i,n+1) rep(j,m+1) dp[i][j] = 0;
rep(i,n) {
rep(j,m) {
dp[i+1][j+1] = (mod+dp[i+1][j]+dp[i][j+1]-dp[i][j])%mod;
if (s[i] == t[j]) {
dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j] + 1)%mod;
}
}
}
cout << (dp[n][m]+1)%mod << endl;
return 0;
} | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF = 10010001010;
const int inf = 2000000000;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
vector<int> N(3);
cin >> N[0] >> N[1] >> N[2];
sort(all(N));
reverse(all(N));
int ans = N[0] - N[1];
N[2] += ans;
N[1] = N[0];
if ((N[0] - N[2]) % 2 == 1)
{
ans++;
N[1]++;
N[0]++;
}
ans += (N[0] - N[2]) / 2;
cout << ans << endl;
} | 0 | 7,298,464 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r,g,b;
int k;
cin >> r >> g >> b;
cin >> k;
int good = 0;
for(int i = 0 ; i < k ; i++){
if(r >= b){
b *= 2;
}else if(r >= g){
g *= 2;
}else if(g >= b){
b *= 2;
}
if(r < g && g < b){
good = 1;
break;
}
}
if(good == 1){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;
int main(void){
int n;
while (true)
{
cin >> n;
if (n == 0)
break;
set<int> towns;
map<PI,int> edges;
REP(i,0,n)
{
int a, b, c;
cin >> a >> b >>c;
towns.insert(a);
towns.insert(b);
PI p;
if (a < b)
p = PI(a,b);
else
p = PI(b,a);
edges[p] = c;
}
VI t(towns.size());
vector<VI> e(towns.size(), VI(towns.size()));
int j = 0;
for (auto i = towns.begin(); i != towns.end(); i++)
{
t[j] = *i;
j++;
}
for (uint i = 0; i < t.size(); i++)
for (uint j = i; j < t.size(); j++)
if (edges.find(PI(t[i],t[j]))!=edges.end())
{
e[i][j] = edges[PI(t[i],t[j])];
e[j][i] = edges[PI(t[i],t[j])];
}
else if (i == j)
e[i][i] = 0;
else
{
e[i][j] = 1000;
e[j][i] = 1000;
}
for (uint r = 0; r < t.size(); r++)
for (uint p = 0; p < t.size(); p++)
for (uint q = 0; q < t.size(); q++)
if (e[p][q] > e[p][r] + e[r][q])
e[p][q] = e[p][r] + e[r][q];
int min = 0;
int i_min = 0;
bool first = true;
for (uint p = 0; p < t.size(); p++)
{
if (accumulate(e[p].begin(), e[p].end(), 0) < min|| first)
{
min = accumulate(e[p].begin(), e[p].end(), 0);
i_min = t[p];
first = false;
}
}
cout << i_min <<" "<< min << endl;
}
} | 0 | 98,762,706 |
#include <bits/stdc++.h>
using namespace std;
pair<long, long> divide(long h, long w) {
long s = h * w;
if (s % 2 == 0) return make_pair(s / 2, s / 2);
if (h > w) swap(h, w);
long s1 = h * (w / 2);
return make_pair(s1, s - s1);
}
int main() {
long h, w, ans = 1l << 62;
cin >> h >> w;
if (h % 3 == 0 || w % 3 == 0) {
cout << 0 << endl;
return 0;
}
for (long i = h / 3 - 1; i <= h / 3 + 2; i++) {
long s = i * w, s1 = divide(h - i, w).first, s2 = divide(h - i, w).second;
ans = min(ans, max(abs(s - s1), max(abs(s1 - s2), abs(s - s2))));
}
for (long i = w / 3 - 1; i <= w / 3 + 2; i++) {
long s = i * h, s1 = divide(w - i, h).first, s2 = divide(w - i, h).second;
ans = min(ans, max(abs(s - s1), max(abs(s1 - s2), abs(s - s2))));
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long int
int main()
{
string s;
cin>>s;
ll l=s.length();
ll i=0, j=l-1;
ll cnt=0;
while(j-i>=0)
{
if(s[i]==s[j])
{
i++;
j--;
}
else if(s[i]=='x')
{
i++;
cnt++;
}
else if(s[j]=='x')
{
j--;
cnt++;
}
else
{
cout<<-1<<endl;
return 0;
}
}
cout<<cnt<<endl;
return 0;
} | 0 | 76,824,400 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
ll l,r;
cin>>l>>r;
ll ans=3000;
for(int i=l;i<=min(r,l+3000);i++){
for(int j=i+1;j<=min(r,l+3000);j++){
ll tmp=((i%2019)*(j%2019))%2019;
ans=min(ans,tmp);
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
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; }
ll INF = 1001001001;
ll LINF = 1001001001001001001ll;
using tl = tuple<ll, ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin>>n>>m;
vector<vector<tl>> to(n);
rep(i, m) {
ll a, b, c;
cin>>a>>b>>c; a--; b--;
to[a].emplace_back(b, c, i);
to[b].emplace_back(a, c, i);
}
vector<bool> used(m);
rep(i, n) {
vector<ll> visited(n, LINF);
priority_queue<tl, vector<tl>, greater<tl>> q;
q.emplace(0, i, -1);
while (!q.empty()) {
tl t = q.top(); q.pop();
ll d = get<0>(t);
ll v = get<1>(t);
ll e = get<2>(t);
if (visited[v] != LINF) {
if (visited[v] == d && e != -1) {
used[e] = true;
}
continue;
}
visited[v] = d;
if (e != -1) used[e] = true;
for (auto nt : to[v]) {
ll nv = get<0>(nt);
ll nd = get<1>(nt) + d;
ll ne = get<2>(nt);
q.emplace(nd, nv, ne);
}
}
}
ll ans = 0;
rep(i, m) if(!used[i]) ans++;
cout<<ans<<endl;
} | 0 | 9,272,511 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
bool isPrime(ll n){
if (n == 2 || n == 3 || n == 5)
return true;
else if (n % 2 == 0 || n % 3 == 0 || n % 5 == 0 || n == 1)
return false;
else {
for (int i = 5; i <= sqrt(n); i += 2){
if (n%i == 0)
return false;
}
return true;
}
}
char arr[107][107];
int main(){
Lancer();
ll r, c, t;
cin >> r >> c;
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
cin >> arr[i][j];
for (int i = 0; i < r; i++){
t = 0;
for (int j = 0; j < c; j++){
if (arr[i][j] == '.')
t++;
}
if (t == c){
for (int j = 0; j < c; j++){
arr[i][j] = 'w';
}
}
}
for (int i = 0; i < c; i++){
t = 0;
for (int j = 0; j < r; j++){
if (arr[j][i] == '.' || arr[j][i] == 'w')
t++;
}
if (t == r){
for (int j = 0; j < r; j++)
arr[j][i] = 'w';
}
}
for (int i = 0; i < r; i++){
bool ch = false;
for (int j = 0; j < c; j++){
if (arr[i][j] != 'w'){
cout << arr[i][j];
ch = true;
}
}
if(ch) cout << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int begin = 0;
int end = 2*N-2;
int query;
bool flag = true;
string S;
cout << 0 << endl;
fflush(stdout);
cin >> S;
if(S == "Vacant"){
flag = false;
}
while(flag){
string T;
query = (begin + end)/2;
if(query %2 != 0){
query++;
}
cout << query << endl;
cin >> T;
fflush(stdout);
if(T == "Vacant"){
flag = false;
break;
}
else if(S == T){
begin = query;
}
else if(S != T){
end = query;
}
if(end - begin == 2){
cout << begin + 1 << endl;
fflush(stdout);
flag = false;
}
}
} | 0 | 39,817,190 |
#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 l;
cin >> l;
double a = l/3.0;
printf("%.12lf\n",a*a*a);
return 0;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define fi first
#define se second
#define inf 4e18
#define lim 1000000000000
#define pll pair<ll,ll>
#define pb push_back
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define el "\n"
#define vll vector<ll>
#define vpll vector<pll>
#define vppll vector<pair<ll,pll> >
#define vvpll vector<vector<pair<ll,ll> > >
#define vvll vector<vector<ll> >
#define vvc vector<vector<char> >
#define vc vector<char>
ll gcd(ll a,ll b){if(b==0)return a;else return gcd(b,a%b);}
ll xpow(ll a,ll b,ll m)
{
if(!b)
return 1%m;
if(b==1)
return a%m;
if(b&1)
{
return(((a%m)*xpow(a,b-1,m))%m);
}
else
{
ll p=xpow(a,b/2,m);
return((p*p)%m);
}
}
const ll zzz=1e3+5;
ll nCr[zzz][zzz];
void cal()
{
nCr[0][0]=1;
for(ll i=1;i<zzz;i++)
{
nCr[i][0]=1;
for(ll j=1;j<zzz;j++)
{
nCr[i][j]=(nCr[i-1][j]+nCr[i-1][j-1])%mod;
}
}
}
const ll N=1e5+5;
bool check_prime(ll n)
{
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
return 0;
}
return 1;
}
ll solve(string a,string b){
ll ans=0;
for(ll i=0;i<a.length();i++){
ans+=(a[i]!=b[i]);
}
return ans;
}
void doit()
{
string s,t;cin>>s>>t;
ll n=s.length(),m=t.length();
ll ans=inf;
for(ll i=m-1;i<n;i++){
string a=s.substr(i-m+1,m);
ans=min(ans,solve(a,t));
}
cout<<ans;
cout<<el;
}
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cal();
ll t;
t=1;
while(t--)
{
doit();
}
return 0;
} | 0 | 39,245,699 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using namespace std;
ll n, k;
const ll mod = 1000000007;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(abs(a-c)<=d) out("Yes");
else if(abs(a-b<=d&&abs(b-c)<=d)) out("Yes");
else out("No");
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
#define testP cout << "------------------ test ------------------" << endl;
#define testX(x) cout << "testout : " << x << endl;
const int MOD{ int(1e9 + 7) };
const int inf{ 2100000000 };
typedef long long ll;
using namespace std;
void printVec(vector<int>& vec) {
cout << "";
for (auto it = vec.begin(); it != vec.end(); it++) cout << *it << " ";
cout << endl;
}
int sumVec(vector<int> v) {
int sum = 0;
for (size_t i = 0; i < v.size(); i++) sum += v[i];
return sum;
}
int main(void) {
int W, H, N;
cin >> W >> H >> N;
bool Graph[102][102] = { false };
int x[102], y[102], A[102];
rep(i, N) {
cin >> x[i] >> y[i] >> A[i];
switch (A[i])
{
case 1:
for (int a = 0; a < x[i]; a++) {
for (int b = 0; b < H; b++) Graph[b][a] = true;
}
break;
case 2:
for (int a = x[i]; a < W; a++) {
for (int b = 0; b < H; b++) Graph[b][a] = true;
}
break;
case 3:
for (int a = 0; a < W; a++) {
for (int b = 0; b < y[i]; b++) Graph[b][a] = true;
}
break;
case 4:
for (int a = 0; a < W; a++) {
for (int b = y[i]; b < H; b++) Graph[b][a] = true;
}
break;
}
}
int ans = 0;
rep(i, H) {
rep(j, W) ans = Graph[i][j] ? ans : ans + 1;
}
cout << ans << endl;
return 0;
} | 0 | 36,194,690 |
#include <iostream>
using namespace std;
int main(){
int N; cin >> N;
int res = 0;
int cnt = 0;
int prev = -1;
for(int i=0;i<N;i++){
int a; cin >> a;
if(a != prev){
res += cnt/2;
cnt = 1;
} else {
++cnt;
}
prev = a;
}
res += cnt/2;
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
long INF = 1e16;
long divPlusOneIfModExist(long target, long div) {
return (target+div-1L)/div;
}
int main() {
long N;
cin >> N;
long A[N+1];
for (int i = 0; i <= (int)N; i++) {
cin >> A[i];
}
long maxNodes[N+1];
maxNodes[0] = 1L;
for (int i = 1; i <= N ; i++) {
maxNodes[i] = min(2*(maxNodes[i-1] - A[i-1]),INF);
}
long ans = 0L;
long currentNodes = 0L;
for (int i = (int)N; i >= 0 ; i--) {
if (divPlusOneIfModExist(currentNodes, 2L)>maxNodes[i]-A[i]) {
cout << -1 << endl;
return 0;
}
currentNodes = min(maxNodes[i],currentNodes+A[i]);
ans+=currentNodes;
}
cout << ans << endl;
return 0;
} | 0 | 53,681,634 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using P = pair<int, int>;
using V = vector<int>;
constexpr array<int, 4> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
constexpr int INF = 1234567890, MOD = 1000000000 + 7;
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;
}
constexpr int ceil(int a, int b) { return (a + b - 1) / b; }
constexpr int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
constexpr int fact(int n) { return n > 1 ? n * fact(n - 1) % MOD : 1; }
constexpr int modpow(int a, int n)
{
int rtn = 1;
while (n > 0)
{
if (n & 1)
rtn = rtn * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return rtn;
}
int modinv(int a)
{
int b = MOD, u = 1, v = 0;
while (b)
{
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
signed main()
{
cin.tie(0);
ios::sync_with_stdio(0);
cout << setprecision(10);
string s, t;
cin >> s >> t;
vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1, 0));
for (int i = 0; i <= t.size(); i++)
dp[0][i] = i;
for (int i = 0; i <= s.size(); i++)
dp[i][0] = i;
for (int i = 1; i <= s.size(); i++)
{
for (int j = 1; j <= t.size(); j++)
{
const int cost_insert = dp[i][j - 1] + 1;
const int cost_delete = dp[i - 1][j] + 1;
const int cost_replace = dp[i - 1][j - 1] + (s[i-1] != t[j-1]);
dp[i][j] = min(cost_insert, min(cost_delete, cost_replace));
}
}
cout << dp[s.size()][t.size()] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int f(int x) {
printf("%d\n", x); fflush(stdout);
char buf[255];
scanf("%s", buf);
if (buf[0] == 'V') exit(0);
return buf[0] == 'M';
}
int main() {
int N; scanf("%d", &N);
int L = 0, Lt = f(L);
int R = N - 1, Rt = f(R);
while (1) {
int M = (L + R) / 2;
int v = f(M);
if (abs(L - M) % 2 != abs(Lt - v) % 2) {
R = M;
Rt = v;
}
else {
L = M;
Lt = v;
}
}
} | 0 | 53,572,606 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int a,b,c;cin>>a>>b>>c;
for(int i=1;i<b;i++){
int d=a*i;
if(d%b==c){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const double PI = 3.141592653589793238460;
const int INF = 1e9+5;
int ans = INF;
int x;
void recur(int cost[], vector<int> books[], vector<int>& knowledge, int start, int n, int m, int& res){
bool flag=true;
for(int i = 0; i<m; i++){
if(knowledge[i]<x){
flag=false;
break;
}
}
if(flag){
ans = min(ans, res);
return;
}
for(int i = start; i < n; i++){
res+=cost[i];
for(int j=0; j<m; j++){
knowledge[j]+=books[i][j];
}
recur(cost, books, knowledge, i+1, n, m, res);
res-=cost[i];
for(int j=0; j<m; j++){
knowledge[j]-=books[i][j];
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m >> x;
int cost[n];
vector<int> books[n];
for(int i=0; i<n; i++){
cin >> cost[i];
for(int j=0; j<m; j++){
int t;
cin >> t;
books[i].push_back(t);
}
}
vector<int> knowledge(m,0);
int res = 0;
recur(cost, books, knowledge, 0, n, m, res);
ans==INF?cout<<(-1):cout<<ans;
return 0;
} | 0 | 17,687,025 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define rrep(i,m,n) for(int i = m; i < (int)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum accumulate
#define keta fixed<<setprecision
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
int main(){
int n,m;
std::cin >> n>>m;
std::vector<int> a(n+1,0);
rep(i,m){
int q,w;
std::cin >> q>>w;
q--;w--;
if(w<q)swap(q,w);
a[q]++;a[w]--;
}
bool han=1;
rep(i,n)if(a[i]%2)han=0;
if(han)std::cout << "YES" << std::endl;
else std::cout << "NO"<< std::endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
void warshall_floyd(vector<vector<long long>> &dist, vector<vector<long long>> &prev) {
int V = dist.size();
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
prev[i][j] = prev[k][j];
}
}
}
}
}
vector<int> get_path(const vector<vector<long long>> &prev, int s, int t) {
vector<int> path;
for (int cur = t; cur != s; cur = prev[s][cur]) {
path.push_back(cur);
}
path.push_back(s);
reverse(path.begin(), path.end());
return path;
}
bool is_negative(const vector<vector<long long>> &dist) {
int V = dist.size();
for (int i = 0; i < V; i++) {
if (dist[i][i] < 0) {
return true;
}
}
return false;
}
int main() {
int V, E;
cin >> V >> E;
vector<vector<long long>> dist(V, vector<long long>(V, INF));
vector<vector<long long>> prev(V);
for (int i = 0; i < V; ++i) {
dist[i][i] = 0;
prev[i] = vector<long long>(V, i);
}
for (int i = 0; i < E; i++) {
long long s, t, c;
cin >> s >> t >> c;
dist[s][t] = c;
}
warshall_floyd(dist, prev);
if (is_negative(dist)) {
cout << "NEGATIVE CYCLE" << endl;
} else {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (dist[i][j] >= INF / 2) {
cout << "INF";
} else {
cout << dist[i][j];
}
if (j != V - 1) {
cout << " ";
}
}
cout << endl;
}
}
return 0;
} | 0 | 55,934,080 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <stack>
#include <queue>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using ld = long double;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(void)
{
ll H, W, i, j, dp[110][110];
string s[110];
cin >> H >> W;
for(i=0; i<H; i++){
for(j=0; j<W; j++){
dp[i][j] = INF;
}
}
for(i=0; i<H; i++){
cin >> s[i];
}
if(s[0][0]=='#'){
dp[0][0] = 1;
}
else{
dp[0][0] = 0;
}
for(i=0; i<H; i++){
for(j=0; j<W; j++){
if(i<H-1){
if(s[i][j]=='.' && s[i+1][j]=='#'){
chmin(dp[i+1][j], dp[i][j]+1);
}
else chmin(dp[i+1][j], dp[i][j]);
}
if(j<W-1){
if(s[i][j]=='.' && s[i][j+1]=='#'){
chmin(dp[i][j+1], dp[i][j]+1);
}
else chmin(dp[i][j+1], dp[i][j]);
}
}
}
cout << dp[H-1][W-1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int md;
int add(int x, int y) {
x += y;
if (x >= md) {
x -= md;
}
return x;
}
int mul(int x, int y) {
return (int)((long long)x * y % md);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n >> md;
string s;
cin >> s;
map<int, int> m;
long long ans = 0;
int dec = 1;
int cur = 0;
if (md == 2) {
long long cnt = 0;
for (int i = n - 1; i >= 0; i--) {
int dig = (s[i] - '0');
if (dig % 2 == 0) {
cnt++;
}
ans += cnt;
}
cout << ans << '\n';
return 0;
}
if (md == 5) {
long long cnt = 0;
for (int i = n - 1; i >= 0; i--) {
int dig = (s[i] - '0');
if (dig % 5 == 0) {
cnt++;
}
ans += cnt;
}
cout << ans << '\n';
return 0;
}
for (int i = n - 1; i >= 0; i--) {
int dig = (s[i] - '0');
cur = add(cur, mul(dec, dig));
if (cur == 0) ans++;
ans += m[cur];
m[cur]++;
dec = mul(dec, 10);
}
cout << ans << '\n';
return 0;
} | 0 | 34,281,469 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
cout << (n+k-3)/(k-1) << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
int main(){
int n;
string s;
cin >> n >> s;
if(n % 2 == 1){
cout << "No" << endl;
return 0;
}
int hn = n / 2;
rep(i, n / 2){
if(s[i] != s[i+hn]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | 0 | 38,731,350 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
struct io { io() { ios::sync_with_stdio(false); cin.tie(0); } };
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void)
{
ll n;
cin >> n;
map<ll, ll> mp;
ll r = 0;
ll a;
rep(i, n) {
cin >> a;
mp[a-1]++;
mp[a]++;
mp[a+1]++;
}
for(auto i: mp) {
r = max(r, i.second);
}
mes(r);
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
#define INF 1<<29
using Graph = vector<vector<int>>;
Graph d;
void warshall_floyd(int V) {
rep(k,V)
rep(i,V)
rep(j,V) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
int main() {
int N, M, R; cin >> N >> M >> R;
d.assign(N, vector<int>(N, INF));
rep(i,N) d[i][i] = 0;
vector r(R, 0);
rep(i,R) {
int n; cin >> n; n--;
r.at(i) = n;
}
sort(r.begin(), r.end());
rep(i, M) {
int a, b, c; cin >> a >> b >> c;
a--, b--;
if (d[a][b] > c) {
d[a][b] = d[b][a] = c;
}
}
warshall_floyd(N);
ll mi = INT64_MAX;
do {
ll c = 0;
rep(i, R-1) c += d[r[i]][r[i+1]];
mi = min(mi, c);
} while(next_permutation(r.begin(), r.end()));
cout << mi << endl;
} | 0 | 37,279,986 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,L,T;
int a[N],x[N],w[N];
int main()
{
scanf("%d%d%d",&n,&L,&T);
int rk=0;
for(int i=0;i<n;i++){
scanf("%d%d",&a[i],&w[i]);
if(w[i]==1){
x[i]=(a[i]+T)%L;
rk+=(a[i]+T)/L;
}
else{
x[i]=(a[i]-T)%L;
rk+=(a[i]-T)/L;
if(x[i]<0){
x[i]+=L;
rk--;
}
}
}
rk=(rk%n+n)%n;
sort(x,x+n);
for(int i=rk;i<n;i++)
printf("%d\n",x[i]);
for(int i=0;i<rk;i++)
printf("%d\n",x[i]);
} | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define uniq(v) v.erase(unique(v.begin(),v.end()),v.end())
#define lb(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define ub(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
using Pair = pair<ll,pair<int,int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod=1000000007;
const ld pi=acos(-1.0);
const ll INF = 1LL<<61;
template<class T>bool chmax(T &a, const T &b) {
if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) {
if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m,v,p;
cin>>n>>m>>v>>p;
vector<ll> q(n);
rep(i,n){
cin>>q[i];
}
sort(all(q));
reverse(all(q));
int ng = n;
int ok = p-1;
while (abs(ok - ng) > 1) {
int mid = (ng + ok) / 2;
ll x=q[mid]+m;
if(x<q[p-1]){
ng=mid;
continue;
}
int cnt=n-mid+p-1;
ll hyo=m*cnt;
for(int i=p-1;i<mid;i++){
hyo+=x-q[i];
}
(m*v<=hyo? ok : ng) = mid;
}
cout << ok+1 << endl;
} | 0 | 55,791,537 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll N, X, M;
cin >> N >> X >> M;
vector<int> f(M, -1);
ll ans = 0;
ll A = X;
vector<int> v;
for (int i = 0; i < N; i++) {
if (f[A] == -1) {
ans += A;
f[A] = i;
v.push_back(A);
A = (A*A) % M;
}
else {
ll l = N-i;
ll s = 0;
ll k = l % (i-f[A]);
for (int j = f[A]; j < i; j++) {
s += v[j];
if (j < f[A]+k) {
ans += v[j];
}
}
ans += s*(l/(i-f[A]));
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n; ll k; cin>>n>>k;
map<int, ll> mp;
for(int i = 0; i < n; i++){
int a, b;
cin>>a>>b;
mp[a] += b;
}
for(auto x : mp){
if(k <= x.second){
cout<<x.first<<endl;
break;
}
k -= x.second;
}
return 0;
} | 0 | 19,958,054 |
#include <bits/stdc++.h>
using namespace std;
struct xy{
double x, y;
};
void koch(int n, xy a, xy b){
if(n == 0) return;
xy s, t, u;
double v = M_PI * 60.0/180.0;
s.x = (a.x*2 + b.x)/3;
s.y = (a.y*2 + b.y)/3;
t.x = (a.x + b.x*2)/3;
t.y = (a.y + (b.y*2))/3;
u.x = (t.x - s.x)*cos(v) - (t.y - s.y)*sin(v) + s.x;
u.y = (t.x - s.x)*sin(v) + (t.y - s.y)*cos(v) + s.y;
koch(n-1,a,s);
printf("%.8f %.8f\n",s.x,s.y);
koch(n-1,s,u);
printf("%.8f %.8f\n",u.x,u.y);
koch(n-1,u,t);
printf("%.8f %.8f\n",t.x,t.y);
koch(n-1,t,b);
}
int main(){
int n;
cin >> n;
xy a, b;
a.x = 0;
a.y = 0;
b.x = 100;
b.y = 0;
printf("%.8f %.8f\n",a.x,a.y);
koch(n,a,b);
printf("%.8f %.8f\n",b.x,b.y);
} | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int len(int n, int a){
if(a>=n){
return a-n*(a/n);}
else{ return a;}
}
int main(){
int n;
cin>>n;
char grid[n][n];
rep(i, n){
rep(j, n){
cin>>grid[i][j];
}
}
int cnt=0;
for(int b=0;b<n;b++){
bool pos=true;
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(grid[len(n, i+b)][j]!=grid[len(n, j+b)][i]){
pos=false;
break;}
}
if(!pos)
break;
}
if(pos)
cnt++;
}
cout<<cnt*n<<endl;
} | 0 | 91,915,930 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>> a(h+2, vector<char>(w+2));
vector<vector<int>> b(h+2, vector<int>(w+2));
for(int i=1;i<h+1;i++){
for(int j=1;j<w+1;j++){
cin >> a.at(i).at(j);
}
}
int flag=0;
for(int i=1;i<h+1;i++){
for(int j=1;j<w+1;j++){
if(a.at(i).at(j) =='#'){
if(a.at(i-1).at(j) =='#' || a.at(i+1).at(j) =='#' || a.at(i).at(j-1) =='#' ||a.at(i).at(j+1) =='#');
else flag=1;
}
}
}
if(flag==1)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
bool ans = true;
cin >> n;
string before, now;
set<string>dist;
cin >> before;
dist.insert(before);
rep(i, n-1) {
cin >> now;
if (dist.count(now)) {
ans = false;
break;
}
if (before.back() != now[0]) {
ans = false;
break;
}
dist.insert(now);
before = now;
}
if (ans) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | 0 | 18,383,585 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b) cout << c << endl;
else if(b == c) cout << a <<endl;
else cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll n,m;cin>>n>>m;
map<ll,ll> mp;
rep(i,0,2*m){
ll a;
cin>>a;
mp[a]++;
}
for(auto i:mp){
if(i.second%2==1){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
} | 0 | 34,842,345 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#include<numeric>
#include<array>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define Vl vector<ll>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll ZER = 0;
int main(){
vector<int> v(4);
rep(i, 3){
int a, b;
cin >> a >> b;
a--;b--;
v[a]++;
v[b]++;
}
sort(ALL(v));
if(v[0] == 1 && v[1] == 1 && v[2] == 2 && v[3] == 2)cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main () {
long long N,K;
cin >> N >> K;
vector<long long>A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<long long>counta(N,0);
vector<long long>countb(N,0);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(i) < A.at(j)){
if (i > j){
counta.at(i)++;
}
countb.at(i)++;
}
}
}
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += counta.at(i);
}
long long mod = 1000000007;
long long dis = 0;
for (int i = 0; i < N; i++) {
dis += countb.at(i);
dis %= mod;
}
long long kaijo = (K * (K-1)/2) % mod;
ans *= K;
ans %= mod;
ans += kaijo*dis;
ans %= mod;
cout << ans << endl;
} | 0 | 95,141,198 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define co cout
#define ci cin
#define sf1(n) scanf("%lld",&n)
#define sf2(n,m) scanf("%lld %lld",&n,&m);
#define sf3(n,m,p) scanf("%lld %lld %lld",&n,&m,&p);
#define pf1(n) printf("%lld\n",n);
#define en cout<<endl;
#define pb push_back
#define fi first
#define se second
#define coy cout<< "YES"<<endl;
#define con cout<< "NO"<<endl;
#define f(a,b) for(ll i=a;i<b;i++)
#define all(x) (x).begin(),(x).end()
#define pi pair<ll,ll>
#define br break;
#define i64 long long
#define PI 3.1415926535897932384626433832795
int main()
{
ll t,n,g,k,m,mx=0,mn=1e9,c,res,c1,x,y,w,z,c2;
sf1(n);
n--;
res=n*(n+1);
res/=2;
co<<res;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i, s, n) for(int i=(s); i<=(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
class UnionFind {
private:
int *par;
int *rank;
const size_t N;
public:
UnionFind(size_t n): N(++n), par(new int[N]), rank(new int[N]) {
reps(i,0,N) par[i] = i, rank[i] = 0;
}
~UnionFind() {
delete[] par;
delete[] rank;
}
int root(const int x) {
if(par[x] != x) par[x] = root( par[x] );
return (par[x]);
}
bool same(const int x, const int y) { return (root(x) == root(y)); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if(x == y)return (false);
par[x] = y;
return (true);
}
};
signed main()
{
cin.tie(0), ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
UnionFind S(N);
while(Q--) {
int x, y;
bool com;
cin >> com >> x >> y;
if(com == 1)outl( S.same(x,y) );
else S.unite(x,y);
}
} | 0 | 63,059,429 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int g = 1;
for (int i = min(a, b); i > 0; i--)
{
if (a % i == 0 && b % i == 0)
{
g = i;
break;
}
}
if (c % g == 0)
{
puts("YES");
}
else
{
puts("NO");
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <fstream>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
#include <cassert>
#pragma warning (disable: 4996)
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
if (n < 0)return 0;
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
ll merge_cnt(vector<ll>& a) {
int n = a.size();
if (n <= 1) { return 0; }
ll cnt = 0;
vector<ll> b(a.begin(), a.begin() + n / 2);
vector<ll> c(a.begin() + n / 2, a.end());
cnt += merge_cnt(b);
cnt += merge_cnt(c);
int ai = 0, bi = 0, ci = 0;
while (ai < n) {
if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {
a[ai++] = b[bi++];
}
else {
cnt += n / 2 - bi;
a[ai++] = c[ci++];
}
}
return cnt;
}
int main() {
ll a, b;
cin >> a >> b;
if (abs(a - b) <= 1)cout << "Brown" << endl;
else cout << "Alice" << endl;
} | 0 | 55,732,151 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
long long n, c, k;
cin >>n >>c >>k;
vector<long long> t(n);
for(int i = 0; i < n; ++i)
cin >>t[i];
sort(begin(t), end(t));
long long b = 0, cnt = 0, bt = 0;
for(int i = 0; i < n; ++i){
if(t[i] > bt || cnt == c){
bt = t[i] + k;
cnt = 1;
++b;
}
else{
++cnt;
}
}
cout <<b <<'\n';
return 0;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define ET cout << "\n"
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#ifdef bbq
#define debug(...) {\
fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
_do(__VA_ARGS__);\
}
#define DB(a,s,e) {for(int _i=s;_i<e;++_i) cerr << a[_i] << " ";cerr << "\n";}
template<typename T>void _do(T &&x){cerr<<x<<endl;}
template<typename T,typename ...S> void _do(T &&x,S &&...t){cerr<<x<<", ";_do(t...);}
template<typename a,typename b> ostream& operator << (ostream &s,const pair<a,b> &p){return s<<"("<<p.X<<","<<p.Y<<")";}
#else
#define debug(...)
#define DB(a,s,e)
#endif
int arr[100005];
vector<int> v;
int main()
{
IOS();
int n,ans=0;
cin >> n;
for(int i=1;i<=n;++i)
cin >> arr[i],v.pb(arr[i]);
sort(ALL(v));
for(int i=1;i<=n;++i)
if((upper_bound(ALL(v),arr[i])-v.begin())&~i&1)
++ans;
cout << ans << "\n";
} | 0 | 4,259,569 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <bitset>
#include <climits>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RFOR(i,a,b) for (int i=(a)-1;i>=(b);i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll X,Y;
cin>>X>>Y;
if(abs(X - Y) > 1)cout << "Alice" << endl;
else cout << "Brown" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h;
int w;
while(cin>>h>>w){
if(h == 0 && w == 0)
break;
for(int j = 0; j < h; j++){
for(int i = 0; i < w; i++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | 0 | 47,455,138 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; a < b; i++);
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) cerr << #v << ":"; rep(i, v.size()) cerr << " " << v[i]; cerr << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int a, b, c, k;
cin >> a >> b >> c >> k;
if (k <= a) {
cout << k << endl;
} else if (k <= a + b) {
cout << a << endl;
} else {
cout << a - (k - a - b) << endl;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define tcase() int t; cin >> t; while(t--)
const int MOD = 1e9 + 7;
const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = acos((ld) -1);
void setIO(string name = "") {
ios_base::sync_with_stdio(0); cin.tie(0);
if(sz(name)){
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
}
vi primes(1000002, 0);
bool flag = true;
void primefactor(int x){
if(flag == false) return;
for(int i = 1; i * i <= x; i++){
if(x % i == 0){
primes[i]++;
if(primes[x] > 1 && x != 1) flag = false;
if(i != (x / i)){
primes[x / i]++;
if(primes[x / i] > 1 && (x / i) != 1) flag = false;
}
}
}
}
int main(){
setIO();
int n;
cin >> n;
vi arr(n);
for(int i = 0; i < n; i++){
cin >> arr[i];
primefactor(arr[i]);
}
for(int i = 2; i < 1000002; i++){
if(primes[i] > 1) flag = false;
}
if(flag){
cout << "pairwise coprime";
return 0;
}
int gcd = arr[0];
for(int i = 0; i < n; i++){
gcd = __gcd(gcd, arr[i]);
}
if(gcd == 1){
cout << "setwise coprime";
return 0;
}
cout << "not coprime";
} | 0 | 14,914,005 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,q;
cin >>a>>b>>c;
q = 0;
while(a <= b){
if(c%a==0){
q++;
a++;
}
else{
a++;
continue;
}
}
cout <<q<<"\n";
} | #include <bits/stdc++.h>
#define LL long long
#define PB push_back
using namespace std;
const unsigned LL M = 1000000007;
int main(){
LL n,m;cin>>n>>m;
LL mat[n][m];
LL dp[n][m]={0};
for (LL i=0;i<n;i++){
string s; cin>>s;
for (LL j=0;j<m;j++){
if (s[j]=='#') mat[i][j]=0;
else mat[i][j]=1;
dp[i][j]=0;
}
}
dp[0][0]=1;
for (LL i=0;i<n;i++){
for (LL j=0;j<m;j++){
if (i==0 && j==0) continue;
if (mat[i][j]==0) continue;
if (i>0) dp[i][j]+=dp[i-1][j];
if (j>0) dp[i][j]+=dp[i][j-1];
dp[i][j]%=M;
}
}
cout<<dp[n-1][m-1];
} | 0 | 86,202,449 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<char,int>;
int main(){
string s;
cin >> s;
deque<P> deq;
const int len = s.size();
bool all_x = true;
rep(i, len){
if(s[i] == 'x')continue;
if(s[i] != 'x')all_x = false;
deq.push_back(P(s[i], i));
}
if(all_x){
cout << 0;
return 0;
}
bool f = true;
int l, r;
while(!deq.empty()){
if(deq.front().first != deq.back().first)f = false;
l = deq.front().second;
r = deq.back().second;
deq.pop_front();
if(deq.empty())break;
deq.pop_back();
}
if(!f){
cout << -1 << endl;
return 0;
}
else {
int res = 0;
while(l >= 0 || r <= len - 1){
if(l < 0 || r > len - 1){
res++;
l--;
r++;
continue;
}
if(s[l] == s[r]){
l--;
r++;
}
else if(s[l] != s[r] && s[l] == 'x'){
res++;
l--;
}
else if(s[l] != s[r] && s[r] == 'x'){
res++;
r++;
}
}
cout << res << endl;
return 0;
}
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>monster(N+1);
vector<int>hero(N);
for(int i=0;i<=N;i++){
cin>>monster[i];
}
for(int i=0;i<=N-1;i++){
cin>>hero[i];
}
long long ans=0;
for(int i=0;i<=N-1;i++){
if(hero[i]>=monster[i]){
ans+=monster[i];
hero[i]-=monster[i];
monster[i]=0;
if(hero[i]>=monster[i+1]){
ans+=monster[i+1];
hero[i]-=monster[i+1];
monster[i+1]=0;
}
else{
monster[i+1]-=hero[i];
ans+=hero[i];
hero[i]=0;
}
}
else{
ans+=hero[i];
monster[i]-=hero[i];
hero[i]=0;
}
}
cout<<ans;
return 0;
} | 0 | 1,142,848 |
#include<bits/stdc++.h>
using namespace std;
#define rush ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define FOR(a,x,n) for(ll a=x;a<n;a++)
#define ROF(a,x,n) for(ll a=x;a>=n;a--)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define MOD 1000000007
ll dp[100005];
ll ans(ll a[], ll n, ll index) {
if(index == n-1) return 0;
if(dp[index] != -1) return dp[index];
ll left = abs(a[index] - a[index+1]) + ans(a, n, index+1);
ll right = INT_MAX;
if(index+2 < n) right = abs(a[index] - a[index+2]) + ans(a, n, index+2);
return dp[index] = min(left, right);
}
void solve() {
ll n;
cin >> n;
memset(dp, -1, sizeof dp);
ll a[n];
FOR(i,0,n) cin >> a[i];
cout << ans(a, n, 0);
}
int main() {
rush
solve();
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstring>
#define ll long long
using namespace std;
ll n,ans;
int main() {
scanf("%lld",&n);
for (int i=1;i<=n;++i)
ans=(ans+(n-i+1)*(1-i)+(i+n)*(n-i+1)/2);
for (int i=1;i<n;++i){
int u,v;scanf("%d%d",&u,&v);
if (u>v) swap(u,v);
ans-=(1ll*u*(n-v+1));
}
printf("%lld\n",ans);
return 0;
} | 0 | 47,537,295 |
#include <iostream>
using namespace std;
void test();
int sum_comb(int n);
using namespace std;
int main(void)
{
test();
return 0;
}
void test()
{
int n,comb;
while (cin >> n)
{
comb = sum_comb(n);
cout << comb << endl;
}
}
int sum_comb(int n)
{
int a, b, c, d,cnt;
cnt = 0;
for (a = 0; a <= 9; a++)
{
for (b = 0; b <= 9; b++)
{
for (c = 0; c <= 9; c++)
{
for (d = 0; d <= 9; d++)
{
if ((a + b + c + d) == n)
cnt++;
}
}
}
}
return cnt;
} | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
#define PI acos(-1)
typedef long long ll ;
typedef unsigned long long ull;
const double eps= (1e-9);
using namespace std;
int dcmp(long double a,long double b){ return fabsl(a-b)<=eps ? 0: (a>b)? 1:-1 ;}
int getBit(ll num, int idx) {return ((num >> idx) & 1ll) == 1;}
int setBit1(int num, int idx) {return num | (1<<idx);}
ll setBit0(ll num, int idx) {return num & ~(1ll<<idx);}
ll flipBit(ll num, int idx) {return num ^ (1ll<<idx);}
void GO(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
int countNumBit1(int mask) {int ret=0; while (mask) {mask &= (mask-1);++ret; }return ret;}
const int N=5000+5,mod=1e9+7;
int n,k,p[N],c[N];
ll arr[N];
ll solve(int no){
int str=no;
int rem=k,cnt=0;
ll ret=0,mx=-1e16;
arr[cnt]=0;
while(rem>0){
str=p[str];
rem--;
ret+= c[str];
mx=max(mx,ret);
cnt++;
arr[cnt]=mx;
if(str==no){
break;
}
}
ll mx2=mx;
if(rem>0){
int F= rem/cnt;
int mo= rem%cnt;
mx=max(mx,ret*(F+1)+arr[mo]);
mx=max(mx,(F)*ret+mx2);
}
return mx;
}
int main(){
GO();
int T;
T=1;
while(T--){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>p[i];
for(int i=1;i<=n;i++) cin>>c[i];
ll ans=-1e16;
for(int i=1;i<=n;i++){
ans=max(ans,solve(i));
}
cout<<ans<<"\n";
}
} | 0 | 15,737,173 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
string a, b, c, d;
cin >> a >> b >> c >> d;
string s = a + b + c + d;
sort(ALL(s));
if(s == "1479") cout << "YES" << endl;
else cout << "NO" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sqrt(n);i++)
{
if(n%i==0)
ans = i;
}
return ans;
}
ll power(ll a,ll b,ll m)
{
if(b==0)
return 1;
if(b==1)
return a%m;
ll temp=power(a,b/2,m);
if(b%2==0)
return ((temp%m)*(temp%m))%m;
else
return ((((temp%m)*(temp%m))%m)*a%m)%m;
}
ll c(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1]%MOD +
C[i - 1][j])%MOD;
}
}
return C[n][k]%MOD;
}
ll modInverse(ll a, ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll func(ll n)
{
ll ans=0;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
if(i/10==0)
ans+=1+func(i)*func(n/i);
else
ans+=func(i)*func(n/i);
}
}
return ans;
}
ll dp[2001][2001];
ll check(vector<pair<ll,ll> >v,ll l,ll r,ll i)
{
if(l>r)
return 0;
if(dp[l][r]!=-1)
return dp[l][r];
ll ans=0;
ll p1=v[i].first;
ll p2=v[i].second;
ans=max(p1*(p2-l)+check(v,l+1,r,i+1),p1*(r-p2)+check(v,l,r-1,i+1));
return dp[l][r]=ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
t=1;
while(t--)
{
ll x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
ll p[a],q[b],r[c];
for(ll i=0;i<a;i++)
cin>>p[i];
for(ll i=0;i<b;i++)
cin>>q[i];
for(ll i=0;i<c;i++)
cin>>r[i];
sort(p,p+a,greater<ll>());
sort(q,q+b,greater<ll>());
sort(r,r+c,greater<ll>());
vector<ll>v;
for(ll i=0;i<x;i++)
v.pb(p[i]);
for(ll i=0;i<y;i++)
v.pb(q[i]);
for(ll i=0;i<c;i++)
v.pb(r[i]);
sort(v.begin(),v.end(),greater<ll>());
ll sum=0;
for(ll i=0;i<x+y;i++)
sum+=v[i];
cout<<sum;
}
} | 0 | 19,362,538 |
#include <iostream>
using namespace std;
int main() {
int n;
int max;
while(1) {
cin >> n;
if(n == 0) break;
int a[5010];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
for(int i = 0; i < n; i++) {
int temp = 0;
for(int j = i; j < n; j++) {
temp += a[j];
if(temp > max) max = temp;
}
}
cout << max << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pii pair<int,int>
#define pb push_back
#define vi vector<int>
using ll = long long;
const int mod = 1e9 + 7;
ll pwr(ll a, ll b);
const int N = 2e3 + 5;
ll n, m, dp[N][N];
int main(){
IOS
cin>>n>>m;
vi s(n), t(m);
for(int &x : s)cin>>x;
for(int &x: t)cin>>x;
memset(dp, 0, sizeof dp);
for(int i = 0; i <= m; i++){
dp[0][i] = 1;
}
for(int i = 0; i <= n; i++){
dp[i][0] = 1;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(s[i-1] == t[j-1]){
dp[i][j] = (dp[i][j-1] + dp[i-1][j]) % mod;
}else{
dp[i][j] = (dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1] + mod)%mod;
}
}
}
cout<<dp[n][m]<<"\n";
}
ll pwr(ll a, ll b){
a %= mod;
ll res = 1;
while(b > 0){
if(b&1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
} | 0 | 17,803,933 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << "\n";
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n; string s;
cin >> n >> s;
vector<bool> c1(10, false), c2(100, false), c3(1000, false);
REP(i, n) {
int c = s[i] - '0';
REP(j, 100) {
if (c2[j]) c3[j * 10 + c] = true;
}
REP(j, 10) {
if (c1[j]) c2[j * 10 + c] = true;
}
c1[c] = true;
}
int ans = 0;
REP(i, 1000) if (c3[i]) ans++;
print(ans);
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<sstream>
#include<string.h>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<utility>
#define rt "\n"
#define rep(i,n) for(int i=0;i<n;i++)
#define rop(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n-1;0<=i;i--)
#define yes(ans) if(ans)cout<<"yes"<<rt;else cout<<"no"<<rt;
#define Yes(ans) if(ans)cout<<"Yes"<<rt;else cout<<"No"<<rt;
#define YES(ans) if(ans)cout<<"YES"<<rt;else cout<<"NO"<<rt;
#define sec(a,b,ans) if(ans)cout<<a<<rt;else cout<<b<<rt;
#define vcin(v) for (int i = 0; i < (v).size(); i++) { cin >> (v)[i]; }
#define sort(s) sort(s.begin(),s.end())
#define reve(s) reverse(s.begin(),s.end())
#define asas int ans=0
#define llcncn llint cnt=0
#define llasas llint ans=0
#define cncn int cnt=0
#define smsm int sum=0
#define str srting
#define v vector
#define please return
#define AC 0
#define Rapid cin.tie(0);ios::sync_with_stdio(false)
using namespace std;
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<char> vcha;
typedef vector<double> vdou;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<string>> vvstr;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
return a * b / GCD(a, b);
}
int a = 0, b = 0, x = 0, y = 0, z = 0, n = 0;
string s = ""; asas; cncn;
int main(void) {
cin >> n;
if (n < 3)cout << 0 << rt;
else cout << n / 3 << rt;
please AC;
} | 0 | 9,718,575 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using P = pair<int, int>;
int main(){
string s, t;
cin >> s >> t;
bool can = false;
int index = 0;
rep(i,(int)s.size()-(int)t.size()+1){
bool flag = true;
rep(j,(int)t.size()){
if (s[i+j] != t[j] && s[i+j] != '?'){
flag = false;
break;
}
}
if (flag){
can = true;
index = max(index, i);
}
}
rep(i,(int)t.size()) s[i+index] = t[i];
rep(i,(int)s.size()){
if (s[i] == '?') s[i] = 'a';
}
cout << (can? s : "UNRESTORABLE") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> using vec = vector<T>;
template <class T, class U> using vep = vec<pair<T,U> >;
template <class T> using PQ = priority_queue<T>;
using ll = long long;
using vll = vec<ll>;
using pll = pair<ll, ll>;
using vpll = vec<pll>;
using str = string;
static const long long INF = 1LL<<59;
static const long long MOD = (ll)1e9+7;
static const double PI = 3.14159265358979323846;
#define endl "\n"
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define FOR(i, a, b) for(ll (i)=(a);(i)<=(b);i++)
#define rFOR(i, a, b) for(ll (i)=(b);(i)>=(a);i--)
#define REP(i, n) for(ll i=0;i<n;i++)
#define WHOLE(v) (v).begin(), (v).end()
#define ASC(v) sort(WHOLE(v))
#define DESC(v) sort((v).rbegin(), (v).rend())
#define INV(v) reverse(WHOLE(v))
#define FOLDL(src, dst, lambda) partial_sum(WHOLE(src), (dst).begin(), lambda)
#define FOLDR(src, dst, lambda) INV(src);partial_sum(WHOLE(src), (dst).begin(), lambda);INV(dst)
#define CUMSUML(src, dst) FOLDL(src, dst, [](auto a, auto b) {return a+b;})
#define CUMSUMR(src, dst) FOLDR(src, dst, [](auto a, auto b) {return a+b;})
#define ACCUM(v, d0, lambda) accumulate(WHOLE(v), d0, lambda)
#define SUM(v, d0) ACCUM(v, d0, [](auto a, auto b) {return a+b;})
#define ERASE(v, i) v.erase(v.begin() + i)
#define UNIQ(v) ASC(v);v.erase(unique(v.begin(), v.end()), v.end())
template <typename T>void debug(T t) {cerr << t << endl;}
template <typename T, typename ...Args>void debug(T t, Args ...args) {cerr << t << " ";debug(args...);}
template <typename T>void out(T t) {cout << t << endl;}
template <typename T, typename ...Args>void out(T t, Args ...args) {cout << t << " ";out(args...);}
template <typename T>istream& operator>>(istream &is, vec<T> &v) {for(auto &a:v) is >> a; return is;}
template <typename T>ostream& operator<<(ostream &os, vec<T> &v) {os << "[";REP(i, v.size() - 1) os << v[i] <<", "; os << v[v.size()-1]<<"]";return os;}
template <typename T, typename U>ostream& operator<<(ostream &os, pair<T, U> &p) {os << "(" << p.first << ", " << p.second << ")";return os;}
template <typename T, typename U>ostream& operator<<(ostream &os, map<T, U> &mp) {os << "{ ";for(auto &p:mp) os << p.first << ": " << p.second << ", "; os << "}";return os;}
void solve() {
ll N;cin >> N;
out(180 * (N - 2));
}
signed main() {
fast_io;
cout << setprecision(20) << fixed;
solve();
return 0;
} | 0 | 93,090,638 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read (T &x) {bool b = 0; char c; while (!isdigit (c = getchar()) && c != '-');
if (c == '-') c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x<<3) + (x<<1) + c - 48; if (b)x=-x;}
template <typename T> inline void wrip(T x) {if (x > 9) wrip(x / 10); putchar(x%10 + 48); }
template <typename T> inline void write(T x) {if (x < 0) putchar('-'), x = -x; wrip(x); putchar(' ');}
template <typename T> inline void writeln(T x) {if (x < 0) putchar('-'), x = -x; wrip(x); putchar('\n');}
inline char readch() {char c; do c = getchar(); while (c == '\n' || c == ' '); return c;}
inline void reads(string &s) {char c; while((c=getchar())==' '||c =='\n'); s=c; while((c=getchar())!=' '&&c!='\n') s+=c;}
inline void getlines(string &s) {char c; while((c=getchar())=='\n'); s=c; while((c=getchar())!='\n') s+=c;}
typedef const int csint;
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair <int, int> ii;
typedef vector <int> vi;
const ld pi = acos(-1);
const int inf = 12e8;
const int mod = 1e9 + 7,
N = 2e6 + 11;
int n, num[N];
ll res[N], sum[N];
vector <int> ds;
struct stc{
ll v;
int id;
} a[N];
bool cmp(stc a, stc b) {
if (a.v == b.v)
return a.id > b.id;
return a.v < b.v;
}
void Add(int p, int val) {
for (; p > 0; p -= (p & -p))
num[p] += val;
}
int Num(int p) {
int ans = 0;
for (; p <= n; p += (p & -p))
ans += num[p];
return ans;
}
void Inc(int p, ll val) {
for (; p > 0; p -= (p & -p))
sum[p] += val;
}
ll Sum(int p) {
ll ans = 0;
for (; p <= n; p += (p & -p))
ans += sum[p];
return ans;
}
int main() {
#ifdef makacha
freopen("m.inp", "r", stdin);
freopen("m.out", "w", stdout);
#endif
read(n);
for (int i = 1; i <= n; i++) {
read(a[i].v);
a[i].id = i;
}
sort(a + 1, a + n + 1, cmp);
ll last = 0;
for (int i = 1; i <= n; i++) {
a[i].v -= last;
ds.push_back(i);
Add(a[i].id, 1);
Inc(a[i].id, a[i].v);
if (Num(1) - Num(a[i].id) == a[i].id - 1) {
last = a[i].v + last;
res[a[i].id] += a[i].v * (n - a[i].id - Num(a[i].id + 1)) + Sum(a[i].id);
for (auto j: ds)
Inc(a[j].id, -a[j].v);
ds.clear();
}
}
for (int i = 1; i <= n; i++)
writeln(res[i]);
} | #include <bits/stdc++.h>
using namespace std;
void err() {
cout << -1 << '\n';
exit(0);
}
void dfs (int crr, int dpt, vector<vector<int>>& grh, long long& cnt) {
cnt += dpt;
for (int nxt : grh[crr]) {
dfs(nxt, dpt + 1, grh, cnt);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> d(n);
map<long long, int> mp;
for (int i = 0; i < n; i++) {
cin >> d[i];
mp[d[i]] = i;
}
sort(d.begin(), d.end());
vector<long long> sz(n, 1);
vector<int> prt(n);
vector<vector<int>> grh(n);
vector<pair<int, int>> edg;
for (auto it = prev(d.end()); it != d.begin(); it--) {
auto i = mp[*it];
long long prtv = *it - n + 2LL * sz[i];
auto jt = lower_bound(d.begin(), d.end(), prtv);
if (jt == d.end() || *jt != prtv) err();
auto p = mp[*jt];
prt[i] = p;
grh[p].push_back(i);
if (i == prt[i]) err();
sz[prt[i]] += sz[i];
edg.emplace_back(min(i, prt[i]), max(i, prt[i]));
}
long long cnt = 0;
int rt = mp[d[0]];
dfs(rt, 0, grh, cnt);
if (d[0] != cnt) err();
sort(edg.begin(), edg.end());
for (auto const & e : edg) {
cout << e.first + 1 << ' ' << e.second + 1 << '\n';
}
return 0;
} | 0 | 48,641,352 |
#include<iostream>
using namespace std;
int main(){
bool p[1000000];
int num[1000000];
int c,n;
for(int i=0;i<1000000;i+=2)p[i] = false ;
for(int i=1;i<1000000;i+=2)p[i] = true ;
p[1] = false;
p[2] = true;
c=3;
while(c < 1000){
for(int i=3*c; i < 1000000; i+=2*c)p[i] = false;
do{c+=2;}while(!p[c]);
}
c=0;
for(int i = 0 ; i < 1000000 ; i++){
if(p[i])c++;
num[i] = c;
}
while(cin>>n)cout<<num[n]<<endl;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long
const ll N=1e6+9;
const ll mod=1e9+7;
ll a[N];
void solve()
{
ll n, m ,k;
cin >> n ;
vector<int> a(n), b(n), c(n) ;
for(int i=0 ; i<n; i++) {
cin >> a[i] >> b[i] >> c[i] ;
}
vector<vector<int>> dp(n, vector<int>(3)) ;
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for(int i=1; i<n; i++) {
dp[i][0] = a[i] + max(dp[i-1][1], dp[i-1][2]) ;
dp[i][2] = c[i] + max(dp[i-1][1], dp[i-1][0]) ;
dp[i][1] = b[i] + max(dp[i-1][0], dp[i-1][2]) ;
}
cout << max({dp[n-1][0], dp[n-1][1], dp[n-1][2]}) ;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll t=1;
while(t--)
{
solve();
}
} | 0 | 16,309,790 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s,t;
cin >> s >> t;
int ans=0;
rep(i,s.length()){
if(s[i]!=t[i])
ans ++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
const int MAX_X = 1100;
const int MAX_Y = 1100;
int main() {
std::string X;
std::string Y;
int q;
int answers[160];
std::cin >> q;
int dp[MAX_X][MAX_Y];
for(int p=0; p<q; ++p) {
std::cin >> X;
std::cin >> Y;
for(int i=0; i<MAX_X; ++i) {
for(int j=0; j<MAX_Y; ++j) {
dp[i][j] = 0;
}
}
int xlen = X.size();
int ylen = Y.size();
X = " " + X;
Y = " " + Y;
for(int i=1; i<=xlen; ++i) {
for(int j=1; j<=ylen; ++j) {
if(X[i] == Y[j]) {
dp[i][j] = dp[i-1][j-1] + 1;
} else {
dp[i][j] = std::max(
dp[i][j-1],
dp[i-1][j]
);
}
}
}
answers[p] = dp[xlen][ylen];
}
for(int i=0; i<q; ++i) {
std::cout << answers[i] << std::endl;
}
} | 0 | 23,713,833 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main()
{
int n;
cin >> n;
for (int ans = 111; ans <= 999; ans += 111)
if (ans >= n)
{
cout << ans << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> ans(26,100);
for(int i = 0; i < n; i++){
string s; cin >> s;
vector<int> cnt(26);
for(int j = 0; j < s.size(); j++){
int idx = s[j] - 'a';
cnt[idx]++;
}
for(int j = 0; j < 26; j++){
ans[j] = min(ans[j], cnt[j]);
}
}
for(int i = 0; i < 26; i++){
char c = 'a' + i;
for(int j = 0; j < ans[i]; j++){
cout << c;
}
}
} | 0 | 49,089,172 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
int calc(string s, map<char,int> mp){
ll res = 0;
rep(i,s.size()){
if('2'<=s[i]&&s[i]<='9'){
res += (s[i]-'0')*mp[s[i+1]];
i++;
}else{
res += mp[s[i]];
}
}
return res;
}
int main(){
map<char,int> mp;
mp['m'] = 1000; mp['c'] = 100; mp['x'] = 10; mp['i'] = 1;
string mcxi = "mcxi";
ll q; cin >> q;
while(q--){
string s,t; cin >> s >> t;
ll ret = calc(s,mp) + calc(t,mp);
ll now = 1000;
string ans;
rep(i,4){
if(ret / now >= 2){
ans.push_back((char)(ret/now+'0'));
ans.push_back(mcxi[i]);
}
else if(ret / now == 1) ans.push_back(mcxi[i]);
ret = ret % now;
if(ret == 0) break;
now /= 10;
}
cout << ans << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define fill(a) memset(a, 0, sizeof(a))
const int MX = 1e6;
const int MI = -1e6;
const int MOD = 1e9 + 7;
const string ALPHA = "abcdefghijklmnopqrstuvwxyz";
const double PI = 3.1415926535;
#define rep(i, n) for(int i=0; i<n; i++)
const int mod=1e9+7;
inline int add(int x,int y){
x+=y;
if (x>=mod) return x-mod;
return x;
}
inline int sub(int x,int y){
x-=y;
if (x<0) return x+mod;
return x;
}
inline int mul(int x,int y){
return (x*1ll*y)%mod;
}
inline int power(int x,int y){
int ans=1;
while(y){
if (y&1) ans=mul(ans,x);
x=mul(x,x);
y>>=1;
}
return ans;
}
inline int inv(int x){
return power(x,mod-2);
}
int main()
{
IOS;
int n, m;
cin >> n >> m;
int arr[n];
int t=0;
for (int i=0; i<n; i++)
{
cin >> arr[i];
t+=arr[i];
}
int cnt=0;
for (int i=0; i<n; i++)
{
if (arr[i]*4*m>=t)
cnt++;
}
if (cnt>=m)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | 0 | 89,593,608 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
vector<int> k(n);
vector<bool> a(1000,true);
for(int i=0;i<n;i++){
cin>>k[i];
k[i]--;
a[k[i]]=false;
}
int p=0,q=0;
for(int i=x-1;i<1000;i++){
if(a[i]){
p=i+1;
break;
}
}
for(int i=x-1;i>=0;i--){
if(a[i]){
q=i+1;
break;
}
}
if(p-x>=x-q){
cout<<q<<endl;
}else{
cout<<p<<endl;
}
return 0;
} | #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 };
int main(){cout<<fixed<<setprecision(10);
int n,m;
cin>>n>>m;
vector<P> a(n);
rep(i,0,n)cin>>a[i].first>>a[i].second;
ll ans=0;
rep(i,0,n){
a[i].first=m-a[i].first;
}
sort(all(a));
reverse(all(a));
int date=m-1;
priority_queue<int, vector<int>, less<int>> pq;
int i=0;
while(true){
while(i<n&&date<=a[i].first){
pq.push(a[i].second);
i++;
}
if(!pq.empty()){
ans+=pq.top();
pq.pop();
}
date--;
if(date==-1)break;
}
cout<<ans<<endl;
} | 0 | 92,038,996 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int name1,name2,name3;
cin >>name1>>name2;
name3=name2*2-name1;
cout<<name3<<endl;
} | #include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ctime>
#define int long long
#define double long double
using namespace std;
const double PI = acos(-1);
const double eps = 0.0000000001;
const int INF = 0x3fffffffffffffff;
int n, a[200005], x[200005], y[100005], cnt;
struct node
{
int v;
bool operator<(const node &TMP) const
{
return abs(v) < abs(TMP.v);
}
};
multiset<node> big;
multiset<node> zero;
multiset<node> small;
void work(multiset<node> &A, multiset<node> &B)
{
int X = A.begin()->v;
x[++cnt] = A.begin()->v;
A.erase(A.begin());
X -= B.begin()->v;
y[cnt] = B.begin()->v;
B.erase(B.begin());
if (X > 0)
{
big.insert({X});
}
if (X == 0)
{
zero.insert({X});
}
if (X < 0)
{
small.insert({X});
}
}
signed main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
if (a[i] > 0)
{
big.insert({a[i]});
}
if (a[i] == 0)
{
zero.insert({a[i]});
}
if (a[i] < 0)
{
small.insert({a[i]});
}
}
while (big.size() + zero.size() + small.size() > 2)
{
if (big.size() && zero.size() && small.size())
{
work(small, zero);
continue;
}
if (big.size() && zero.size())
{
work(zero, big);
continue;
}
if (small.size() && zero.size())
{
work(zero, small);
continue;
}
if (big.size() && small.size())
{
if (big.size() > small.size())
{
work(small, big);
}
else
{
work(big, small);
}
continue;
}
if (big.size())
{
work(big, big);
continue;
}
if (small.size())
{
work(small, small);
continue;
}
if (zero.size())
{
work(zero, zero);
continue;
}
}
if (big.size() && small.size())
{
work(big, small);
}
if (big.size() && zero.size())
{
work(big, zero);
}
if (small.size() && zero.size())
{
work(zero, small);
}
if (big.size() > 1)
{
int A = big.begin()->v, B = big.rbegin()->v;
big.clear();
++cnt;
x[cnt] = B;
y[cnt] = A;
big.insert({B - A});
}
if (zero.size() > 1)
{
int A = zero.begin()->v, B = zero.rbegin()->v;
zero.clear();
++cnt;
x[cnt] = B;
y[cnt] = A;
zero.insert({B - A});
}
if (small.size() > 1)
{
int A = small.begin()->v, B = small.rbegin()->v;
small.clear();
++cnt;
x[cnt] = B;
y[cnt] = A;
big.insert({B - A});
}
if (big.size())
{
cout << big.begin()->v << endl;
}
if (zero.size())
{
cout << zero.begin()->v << endl;
}
if (small.size())
{
cout << small.begin()->v << endl;
}
for (int i = 1; i <= cnt; ++i)
{
cout << x[i] << ' ' << y[i] << endl;
}
return 0;
} | 0 | 94,342,159 |
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define INF 1000000000000000000LL
#define MOD 1000000007LL
#define infile "../test/sample-1.in"
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ten(n) ((int)1e##n)
template<class T, size_t N> size_t sza(const T (&array)[N]) { return N; }
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
template<class T=int> T in() {T x; cin>>x; return (x);}
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
#define fi first
#define se second
int solve(){
int k;cin>>k;
int n=50;
int x=k/n;
int y=k%n;
vi res;
rep(i, n+1){
if (i!=n-y) res.pb(i+x);
}
cout << n << endl;
rep(i, sz(res)) cout << res[i] << (i!=sz(res)-1 ? " " : "\n");
return 0;
}
signed main() {
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#define pb push_back
#define ff first
#define ss second
#define sz(x) ((int)((x).size()))
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define forn(i,a,b) for(ll (i)=(a);(i)<=(b);(i)++)
#define fill(l,a) memset((l) , (a) , sizeof(l))
#define maX(a,b) ( (a) > (b) ? (a) : (b))
#define miN(a,b) ( (a) < (b) ? (a) : (b))
#define checkbit(n,b) ( (n >> b) & 1)
#define INDEX(arr,i) ( lower_bound(all(arr),i)-arr.begin())
#define in(b,a) ( (b).find(a) != (b).end())
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector< std::vector<ll> > matrix;
typedef map<ll,ll> mii;
typedef vector<pii> vpii;
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
const int INF=1e9;
int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
ll gcd(ll a,ll b)
{
if(a==0)
return(b);
return(gcd(b%a,a));
}
ll lcm(ll a,ll b)
{
return(a/gcd(a,b)*b);
}
void solve()
{
ll w,h,n;
cin>>w>>h>>n;
ll xi,yi,ai;
ll arr[w][h];
memset(arr,0,sizeof(arr));
for(ll i=0;i<n;i++)
{
cin>>xi>>yi>>ai;
ll c1,c2,c3,c4;
if(ai==1)
{
c1=0;
c2=xi;
c3=0;
c4=h;
}
if(ai==2)
{
c1=xi;
c2=w;
c3=0;
c4=h;
}
if(ai==3)
{
c1=0;
c2=w;
c3=0;
c4=yi;
}
if(ai==4)
{
c1=0;
c2=w;
c3=yi;
c4=h;
}
for(ll j=c1;j<c2;j++)
{
for(ll k=c3;k<c4;k++)
{
arr[j][k]=1;
}
}
}
ll cnt=0;
for(ll i=0;i<w;i++)
{
for(ll j=0;j<h;j++)
{
if(arr[i][j]==0)
cnt++;
}
}
cout<<cnt<<endl;
}
int main()
{
IOS
ll t=1;
while(t--)
{
solve();
}
return(0);
} | 0 | 41,018,107 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll f(ll a) {
ll res[] = {a, 1, a+1, 0};
return res[a%4];
}
ll getXor(ll a, ll b) {
return f(b) ^ f(a-1);
}
int main()
{
ll l, r;
cin >> l >> r;
cout << getXor(l, r) << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m){
int arr[n];
int sum=0;
for(int i=0;i<n;i++){
cin>>arr[i];
sum+=arr[i];
}
sort(arr,arr+n,greater<int>());
int req=(sum)/(4*m);
if(req*(4*m)!=sum) req++;
bool ok=1;
for(int i=0;i<m;i++){
if(arr[i]<req){
ok=0;
break;
}
}
if(ok)cout << "Yes\n";
else cout << "No\n";
}
} | 0 | 66,530,011 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
signed main(){
int X,A,B;
cin>>X>>A>>B;
if(B-A<=X&&B-A>0) cout<<"safe"<<endl;
else if(B-A<=0) cout<<"delicious"<<endl;
else cout<<"dangerous"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
#define long long long
class UnionFind {
public:
vector<int> par, rank;
UnionFind(int sz) : par(sz, -1), rank(sz, 0){}
int find(int x){
if(par[x]<0) return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y){
x=find(x); y=find(y);
if(x==y) return;
if(rank[x] < rank[y]){
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if(rank[x]==rank[y]) rank[x]++;
}
}
bool same(int x, int y){ return find(x) == find(y); }
int size(int x){ return -par[find(x)]; }
};
int main(){
int n,m;
cin>>n>>m;
vector<int> u(m),v(m);
rep(i,m) cin>>u[i]>>v[i];
UnionFind uf(2*n);
rep(i,m) u[i]--,v[i]--;
rep(i,m) uf.unite(u[i]+n, v[i]), uf.unite(u[i], v[i]+n);
long alone=0;
long bad=0;
long good=0;
set<int> checked;
rep(i,n) if(checked.count(uf.find(i))==0){
if(uf.size(i)==1) alone++;
else if(! uf.same(i, i+n)) good++;
else bad++;
checked.insert(uf.find(i));
checked.insert(uf.find(i+n));
}
long ans = alone*n*2L - alone*alone;
ans += 2L*good*good;
ans += bad*bad;
ans += 2L*good*bad;
cout << ans << endl;
return 0;
} | 0 | 58,949,273 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,L,R;
string S, T;
const ll MOD = 998244353;
const ll INF = 1LL << 60;
typedef pair<ll,ll> P;
int main() {
cin>>N;
vec a(N);
rep(i,N) cin>>a[i];
vec kind(N,0);
rep(i,N) ++kind[a[i] - 1];
sort(ALL(kind));
vec ans(N,0), sum(N+1,0);
rep(i,N) sum[i+1] = sum[i] + kind[i];
rep(i,N){
ll max_num = (kind.end() - lower_bound(ALL(kind), i+1)) + sum[lower_bound(ALL(kind), i+1) - kind.begin()]/(i+1);
rep(j,max_num) ans[j] = i + 1;
}
rep(i,N) cout<<ans[i]<<endl;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
#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 rept(i,m,n) for(ll i=m; i<n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) for(auto v : (V)) cout << v << " "
int ctoi(char c) { if (c >= '0' && c <= '9') { return c - '0'; } return 0; }
void cum_sum(int N,vector<double> a, vector<double> &s){ for(int i=0; i<N; i++){ s[i+1]=s[i]+a[i];}}
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
bool is_prime(long long n) {
if (n <= 1) return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0) return false;
}
return true;
}
int getdigit(ll num){
unsigned digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
int main()
{
int N, R;
cin >> N >> R;
if(N>=10){
cout << R << endl;
}
else{
cout << R+100*(10-N) <<endl;
}
} | 0 | 16,712,595 |
#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
const ll mod = 1e9 + 7;
const ll inf = 1e18;
template < typename T >
void vprint(T &V){
for(auto v : V){
cout << v << " ";
}
cout << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N);
FOR(i, 0, N){
cin >> A.at(i);
}
vector<ll> B(N);
FOR(i, 0, N){
cin >> B.at(i);
}
vector<ll> C(N);
ll height = 0;
FOR(i, 0, N){
if(height!=A[i]){
C[i] = A[i];
}else{
C[i] = -height;
}
height = A[i];
}
vector<ll> D(N);
height = 0;
for(int i=N-1; i>=0; i--){
if(height!=B[i]){
D[i] = B[i];
}else{
D[i] = -height;
}
height = B[i];
}
vector<ll> E(N);
FOR(i, 0, N){
if(C[i]<0 && D[i]>0){
if(-C[i] < D[i]){
p(0);
return 0;
}
E[i] = D[i];
}
else if(D[i]<0 && C[i]>0){
if(-D[i] < C[i]){
p(0);
return 0;
}
E[i] = C[i];
}
else if(C[i]<0 && D[i]<0){
E[i] = max(C[i], D[i]);
}
else if(C[i]>0 && D[i]>0 && C[i]!=D[i]){
p(0);
return 0;
}
else if(C[i]>0 && D[i]>0 && C[i]==D[i]){
E[i] = C[i];
}
else{
}
}
ll answer = 1;
height = E[0];
FOR(i, 1, N-1){
if(E[i]<0){
answer *= -E[i];
answer %= mod;
}
}
p(answer);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;
bool flag=false;
string str;
cin>>n;
ll ara[n+2];
l=1;
for(i=0; i<n; i++)
{
cin>>ara[i];
l=lcm(l,ara[i]);
}
for(i=0; i<n; i++)
{
sum+=(l/ara[i]);
}
double s=sum,L=l;
L=L/s;
cout<<setprecision(10)<<fixed<<L<<endl;
} | 0 | 37,811,719 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n,k,x,y; cin >> n >> k >> x >> y;
if (n < k) {
cout << n * x << endl;
}
else {
cout << k * x + (n - k) * y << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B;
cin >> A >> B;
if((A==1 && B==2) || (A==2 && B==1))
{
cout << "3" << endl;
}
else if((A==2 && B==3) || (A==3 && B==2))
{
cout << "1" << endl;
}
else
{
cout << "2" << endl;
}
} | 0 | 24,698,594 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<cmath>
#include <iomanip>
using namespace std;
int main(void){
double a,b,c,d,e,f,dod;
cin>>a>>b>>c>>d;
e=a-c;
f=b-d;
dod=pow(e,2)+pow(f,2);
dod=sqrt(dod);
cout<<setprecision(12)<<dod<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1e9;
const int64_t inf64=1e18;
const double eps=1e-9;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
using i64=int64_t;
pair<int,int> rotate45(int y,int x){
return make_pair(y+x,-y+x);
}
void solve(){
int H,W,d;
cin >> H >> W >> d;
vector<int> ys,xs;
rep(i,0,H) rep(j,0,W){
int i_=rotate45(i,j).first,j_=rotate45(i,j).second;
ys.push_back(i_);
xs.push_back(j_);
}
sort(ys.begin(),ys.end());
sort(xs.begin(),xs.end());
ys.erase(unique(ys.begin(),ys.end()),ys.end());
xs.erase(unique(xs.begin(),xs.end()),xs.end());
map<int,int> y_to_order,x_to_order;
rep(i,0,ys.size()) y_to_order[ys[i]]=i;
rep(i,0,xs.size()) x_to_order[xs[i]]=i;
vector<int> color(H*W);
rep(i,0,H){
rep(j,0,W){
int i_=rotate45(i,j).first,j_=rotate45(i,j).second;
color[i*W+j]=(y_to_order[i_]/d%2+x_to_order[j_]/d*2+2000)%4;
}
}
rep(i,0,H){
rep(j,0,W){
if(color[i*W+j]==0) cout << "R";
else if(color[i*W+j]==1) cout << "Y";
else if(color[i*W+j]==2) cout << "G";
else cout << "B";
}
cout << endl;
}
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
return 0;
} | 0 | 76,089,172 |
#include<bits/stdc++.h>
const int dx[]={0,0,-1,1,-1,-1,1,1};
const int dy[]={-1,1,0,0,-1,1,-1,1};
using namespace std;
int n,k,a[5005];
bitset<5005> sum;
bool judge(int x)
{
if(a[x]>=k)
return 1;
sum.reset();
sum[0]=1;
for(int i=1;i<=n;i++)
if(i!=x)
sum|=sum<<a[i];
for(int i=k-1;i>=k-a[x];i--)
if(sum[i])
return true;
return false;
}
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1);
int l=0,r=n+1;
while(l<r)
{
int m=(l+r)>>1;
if(judge(m))
r=m;
else
l=m+1;
}
cout<<l-1;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL));
ll power(ll x,ll y,ll m){ll r=1;for(;y;y>>=1){if(y&1)r=r*x%m;x=x*x%m;}return r;}
const ll mod = 1e9 + 7;
int run_test(){
ll a;
cin >> a;
string s;
cin >> s;
ll b = (s[0] - '0') * 100;
ll d = (s[2] - '0')*10 + (s[3] - '0');
b +=d;
ll c = a * b;
cout << c / 100;
return 0;
}
int main(){
FAST;
ll t;
t = 1;
while(t--){
run_test();
}
} | 0 | 12,471,098 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; else return 0; }
long long il() { long long x; if (scanf("%lld", &x)==1) return x; else return 0; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); }
void od(double x) { printf("%.15f ", x); }
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}}
void br() { putchar('\n'); }
#define gcd __gcd
int lcm(int a, int b){return a / gcd(a, b) * b;}
#define begin_end(a) a.begin(),a.end()
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; i++ )
#define rep(i,n) REP(i,0,n)
#define m_p(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define p_b push_back
#define SZ(x) ((int)(x).size)
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
int main(){
ll N = il();
vector<ll> as;
rep(i, N){
as.push_back(il());
}
vector<ll> bs;
rep(i, N){
bs.push_back(il());
}
priority_queue<ll> bigger_b;
priority_queue<ll> bigger_a;
rep(i, N){
ll a = as[i];
ll b = bs[i];
if (a == b) continue;
else if (a > b) bigger_a.push(a-b);
else bigger_b.push(b-a);
}
while (!bigger_b.empty()){
if (bigger_a.empty()){
cout << "Yes" << endl;
return 0;
}
else{
ll tmpbiggera = bigger_a.top();
bigger_a.pop();
ll tmpbiggerb = bigger_b.top();
bigger_b.pop();
if (tmpbiggerb == 1){
bigger_a.push(tmpbiggera);
continue;
}
else{
ll cnt = min(tmpbiggerb/2, tmpbiggera);
tmpbiggerb -= cnt * 2;
tmpbiggera -= cnt;
}
if (tmpbiggerb != 0) bigger_b.push(tmpbiggerb);
if (tmpbiggera != 0) bigger_a.push(tmpbiggera);
}
}
if (!bigger_a.empty()) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;
using ll = long long;
using ull = unsigned long long;
string concat(string s, string t)
{
int n = s.size();
for (int i = n; i >= 1; --i) {
string ss = s.substr(n - i, i);
string tt = t.substr(0, i);
if (ss == tt) {
return s.substr(0, n-i) + ss + t.substr(i, n-i);
}
}
return s + t;
}
int main()
{
int N;
cin >> N;
string s, t;
cin >> s;
cin >> t;
cout << concat(s, t).size() << endl;
return 0;
} | 0 | 98,314,113 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
long double J=0,B=0;
for(int i=0;i<N;i++){
long double X;
string S;
cin>>X>>S;
if(S=="JPY"){
J+=X;
}
else{
B+=X;
}
}
B*=380000.0;
B+=J;
cout<<fixed<<setprecision(15);
cout<<B<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T>
string to_string(T s);
template <class S, class T>
string to_string(pair<S, T> p);
string to_string(string s) { return s; }
string to_string(const char s[]) { return to_string(string(s)); }
template <class T>
string to_string(T v) {
if (v.empty()) return "{}";
string ret = "{";
for (auto x : v) ret += to_string(x) + ",";
ret.back() = '}';
return ret;
}
template <class S, class T>
string to_string(pair<S, T> p) {
return "{" + to_string(p.first) + "," + to_string(p.second) + "}";
}
void debug() { cerr << endl; }
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
struct IO {
#ifdef _WIN32
inline char getchar_unlocked() { return getchar(); }
inline void putchar_unlocked(char c) { putchar(c); }
#endif
string separator = " ";
template <class T>
inline void read(T &x) {
char c;
do {
c = getchar_unlocked();
} while (c != '-' && (c < '0' || '9' < c));
bool minus = 0;
if (c == '-') {
minus = 1;
c = getchar_unlocked();
}
x = 0;
while ('0' <= c && c <= '9') {
x *= 10;
x += c - '0';
c = getchar_unlocked();
}
if (minus) x = -x;
}
inline void read(string &x) {
char c;
do {
c = getchar_unlocked();
} while (c == ' ' || c == '\n');
x.clear();
do {
x += c;
c = getchar_unlocked();
} while (c != ' ' && c != '\n' && c != EOF);
}
template <class T>
inline void read(vector<T> &v) {
for (auto &x : v) read(x);
}
template <class Head, class... Tail>
inline void read(Head &head, Tail &... tail) {
read(head);
read(tail...);
}
template <class T>
inline void write(T x) {
char buf[32];
int p = 0;
if (x < 0) {
x = -x;
putchar_unlocked('-');
}
if (x == 0) putchar_unlocked('0');
while (x > 0) {
buf[p++] = (x % 10) + '0';
x /= 10;
}
while (p) {
putchar_unlocked(buf[--p]);
}
}
inline void write(string x) {
for (char c : x) putchar_unlocked(c);
}
inline void write(const char s[]) {
for (int i = 0; s[i] != 0; ++i) putchar_unlocked(s[i]);
}
template <class T>
inline void write(vector<T> v) {
for (auto itr = v.begin(); itr + 1 != v.end(); ++itr) {
write(*itr);
write(separator);
}
write(v.back());
}
template <class Head, class... Tail>
inline void write(Head head, Tail... tail) {
write(head);
write(separator);
write(tail...);
}
template <class Head, class... Tail>
inline void writeln(Head head, Tail... tail) {
write(head, tail...);
write("\n");
}
void set_separator(string s) { separator = s; }
} io;
int main() {
int N;
io.read(N);
ll min_lower = INF;
ll sum = 0;
REP(i, N) {
ll A, B;
io.read(A, B);
sum += A;
if (A > B) min_lower = min(min_lower, B);
}
io.writeln(min_lower == INF ? 0 : sum - min_lower);
return 0;
} | 0 | 79,605,663 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h[i];
int dekai=0;
int cnt=0;
rep(i,n){
if(h[i]>dekai){
cnt++;
dekai = h[i];
}
else if(h[i] == dekai) cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll X, Y, Z, K; cin >> X >> Y >> Z >> K;
vll A(X); rep(i, X) cin >> A[i];
vll B(Y); rep(i, Y) cin >> B[i];
vll C(Z); rep(i, Z) cin >> C[i];
sort(all(A));
reverse(all(A));
sort(all(B));
reverse(all(B));
sort(all(C));
reverse(all(C));
priority_queue<pair<ll, vector<ll>>> que;
vvll used;
que.push({A[0] + B[0] + C[0], {0, 0, 0}});
rep(i, K) {
pair<ll, vector<ll>> elem;
do {
elem = que.top(); que.pop();
} while (find(all(used), elem.second) != used.end());
cout << elem.first << endl;
used.push_back(elem.second);
ll a = elem.second[0], b = elem.second[1], c = elem.second[2];
if (a < X - 1) que.push({A[a+1] + B[b] + C[c], {a+1, b, c}});
if (b < Y - 1) que.push({A[a] + B[b+1] + C[c], {a, b+1, c}});
if (c < Z - 1) que.push({A[a] + B[b] + C[c+1], {a, b, c+1}});
}
return 0;
} | 0 | 20,868,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v.end()
#define forn(i, n) for(ll i=0;i<(ll)n;i++)
#define fi first
#define se second
int main() {
char c;
cin >> c;
char r = c+1;
cout << r << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<pair<string, int>> s(n);
rep(i, 0, n){
cin >> s[i].first >> s[i].second;
}
string x;
cin >> x;
int count = 51;
int sum = 0;
rep(i, 0, n){
if(s[i].first == x){
count = i;
}
if(i > count){
sum += s[i].second;
}
}
cout << sum << endl;
return 0;
} | 0 | 11,336,771 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
void YN(bool flg){if(flg) cout << "YES" << endl; else cout << "NO" << endl;}
void Yn(bool flg){if(flg) cout << "Yes" << endl; else cout << "No" << endl;}
void yn(bool flg){if(flg) cout << "yes" << endl; else cout << "no" << endl;}
int main()
{
char h[] = {'a', 'i', 'u', 'e', 'o'};
char c;
cin >> c;
bool ok = false;
rep(i, 5) {
if(c == h[i]) ok = true;
}
if(ok) {
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T>
void printv(const vector<T> &v)
{
int sz = v.size();
for (int i = 0; i < sz; i++)
{
cout << v[i] << " \n"[i == sz - 1];
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> s >> k;
k--;
for (int i = 0; i < n; i++)
{
if (s[i] != s[k])
s[i] = '*';
}
cout << s << endl;
} | 0 | 81,214,048 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
ll ans = 180 * (N - 2);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
const int MOD = 1e9+7;
ll power(ll a, ll b){
ll r=1;
while(b>0){
if(b&1)
r=r*a %MOD;
a = a*a %MOD;
b/=2;
}
return r;
}
int main(){
string a, b;
cin >> a >> b;
if(a.length() > b.length()){
cout << "GREATER";
return 0;
}
else if(a.length() < b.length()){
cout << "LESS";
return 0;
}
if(a==b)
cout << "EQUAL";
else if(a < b)
cout << "LESS";
else
cout << "GREATER";
} | 0 | 79,571,870 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
int r , d , x;
cin >> r >> d >> x;
for(int i = 0;i < 10;i++){
x = r * x - d;
cout << x << endl;
}
} | #include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e18;
const int mod=1e9+7;
const int M=200005;
int a[M],n,k,cnt[M];
void work()
{
clr(cnt);
f(i,1,n)
{
int d=a[i];
int lft=i-d;
int rgt=i+d;
lft=max(lft,1LL);
rgt=min(rgt,n);
if(lft>rgt)continue;
cnt[lft]++;
cnt[rgt+1]--;
}
f(i,1,n)
{
cnt[i]+=cnt[i-1];
}
f(i,1,n)
{
a[i]=cnt[i];
}
}
main()
{
fast
cin>>n>>k;
f(i,1,n)
{
cin>>a[i];
}
int tmp=1000;
tmp=min(tmp,k);
while(tmp--)
{
work();
}
f(i,1,n)
{
cout<<a[i]<<" ";
}
cout<<endl;
return 0;
} | 0 | 34,800,353 |
#include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;
const int N = 2e5+5;
#ifdef SWAPNIL07
#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...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
void solve(){
int a, b, c, d; cin>>a>>b>>c>>d;
int a1 = max(a*c, b*d);
int a2 = max(a*d, b*c);
cout<<max(a1, a2);
}
signed main()
{
fast
#ifdef SWAPNIL07
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
while(t--){
solve();
cout<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n,m;
cin >> n >> m;
vector<pair<ll,ll>> drink(n);
rep(i,n){
cin >> drink[i].fi >> drink[i].se;
}
sort(rng(drink));
ll ans = 0;
ll cnt = 0;
rep(i,n){
ll c = min(m-cnt,drink[i].se);
cnt+=c;
ans+=c*drink[i].fi;
}
cout<<ans<<endl;
return 0;
} | 0 | 81,179,838 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll H,W,D;
cin >>H>>W>>D;
vector<Pi>pos(H*W);
rep(i,H){
rep(j,W){
ll a;
cin>>a;
a--;
pos[a]=mp(i,j);
}
}
vector<vector<ll>>sum(D,vector<ll>((H*W)/D + 2));
rep(i,D){
rep(j,(H*W)/D + 10){
ll now=i+D*j;
ll next=i+D*(j+1);
if(next>=H*W)break;
ll x=pos[now].second;
ll y=pos[now].first;
ll nx=pos[next].second;
ll ny=pos[next].first;
sum[i][j+1]=sum[i][j]+abs(nx-x)+abs(ny-y);
}
}
ll Q;
cin>>Q;
rep(i,Q){
ll l,r;
cin>>l>>r;
l--,r--;
ll inx=l%D;
ll ans=sum[inx][r/D]-sum[inx][l/D];
cout<<ans<<endl;
}
return 0;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
vector<int> as;
vector<vector<int>> pos_for_bit;
ll solve(const int N) {
ll ans = 0;
for (int i = 0; i < N; i++) {
const int start = i;
int end = N;
#ifdef DEBUG
printf("start: %d\n", start);
#endif
for (int bit = 0; bit < 20; bit++) {
if (as[i] & (1 << bit)) {
auto it = upper_bound(pos_for_bit[bit].begin(), pos_for_bit[bit].end(), i);
chmin(end, *it);
#ifdef DEBUG
printf(" bit: %d, %d\n", bit, *it);
#endif
} else {
auto it = upper_bound(pos_for_bit[bit].begin(), pos_for_bit[bit].end(), i);
it++;
chmin(end, *it);
#ifdef DEBUG
printf(" bit: %d, %d\n", bit, *it);
#endif
}
}
#ifdef DEBUG
printf(" end: %d\n", end);
#endif
ans += end - start;
}
return ans;
}
int main(void) {
int N;
cin >> N;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
}
pos_for_bit.resize(20, vector<int>());
for (int i = 0; i < 20; i++) {
for (int j = 0; j < N; j++) {
if (as[j] & (1 << i)) {
pos_for_bit[i].push_back(j);
}
}
pos_for_bit[i].push_back(N);
pos_for_bit[i].push_back(N);
}
#ifdef DEBUG
printf("pos_for_bit: \n");
for (int i = 0; i < 20; i++) {
printf(" bit %d: ", i);
for (auto x : pos_for_bit[i]) {
printf("%d ", x);
}
printf("\n");
}
#endif
cout << solve(N) << endl;
return 0;
} | 0 | 51,539,725 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int d; cin >> d;
string res;
switch(d){
case 22:
res = "Christmas Eve Eve Eve";
break;
case 23:
res = "Christmas Eve Eve";
break;
case 24:
res = "Christmas Eve";
break;
case 25:
res = "Christmas";
break;
}
cout << res << endl;
return 0;
} | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
using llint = long long int;
int n;
vector<int> va;
using vecitr = vector<int>::iterator;
int nearest(vecitr begin, vecitr end, int x)
{
bool first = true;
for (; begin != end; begin++)
{
if (*begin >= x)
{
int res = *begin;
if (!first)
{
int diff = res - x;
if (diff > x - *(begin - 1))
{
res = *(begin - 1);
}
}
return res;
}
first = false;
}
return *(end - 1);
}
int main()
{
cin >> n;
va.reserve(n);
for (int i = 0; i < n; i++)
{
int a;
cin >> a;
va.push_back(a);
}
sort(va.begin(), va.end());
llint max = 0;
pair<int, int> ans;
int b = nearest(va.begin(), va.end() - 1, va.back() / 2);
cout << va.back() << " " << b << endl;
return 0;
} | 0 | 49,792,091 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int rating, goal;
cin >> rating >> goal;
cout << (goal * 2) - rating << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
int sum = 0;
for(int i = 0; i < n; i++){
cin>>a[i];
sum+=a[i];
}
int avg = ceil(float(sum)/n);
int avg2 = floor(float(sum)/n);
int cost = 0;
int cost2 = 0;
for(int i = 0; i < n; i++) {
cost += (a[i]-avg)*(a[i]-avg);
cost2 += (a[i]-avg2)*(a[i]-avg2);
}
cout<<min(cost,cost2);
return 0;
} | 0 | 26,416,230 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int N, Num[100005], Max, Min = 987654321, result;
int abs(int num)
{
return num > 0 ? num : -num;
}
int main()
{
scanf("%d", &N);
for(int i = 0; i < N; i++)
{
scanf("%d", &Num[i]);
Max = max(Max, Num[i]);
}
for(int i = 0; i < N; i++)
{
if(Max == Num[i])
{
continue;
}
if(Min > abs(Num[i] - (Max - Num[i])))
{
Min = abs(Num[i] - (Max - Num[i]));
result = Num[i];
}
}
printf("%d %d", Max, result);
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
int ans[42];
pair<int, int> a[N], b[N];
int main() {
int h, w, n;
scanf("%d %d %d", &h, &w, &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &a[i].first, &a[i].second);
for (int dx = 0; dx < 3; dx++) {
for (int dy = 0; dy < 3; dy++) {
b[i * 9 + dx * 3 + dy].first = a[i].first - dx;
b[i * 9 + dx * 3 + dy].second = a[i].second - dy;
}
}
}
sort(a, a + n);
sort(b, b + n * 9);
long long total = (h - 2) * 1LL * (w - 2);
for (int i = 0; i < n * 9; i++) {
int x = b[i].first;
int y = b[i].second;
if (i > 0 && x == b[i - 1].first && y == b[i - 1].second) {
continue;
}
if (x < 1 || y < 1 || x > h - 2 || y > w - 2) {
continue;
}
int cnt = 0;
for (int dx = 0; dx < 3; dx++) {
for (int dy = 0; dy < 3; dy++) {
pair<int, int> p = make_pair(x + dx, y + dy);
int pos = lower_bound(a, a + n, p) - a;
if (pos < n && a[pos] == p) {
cnt++;
}
}
}
ans[cnt]++;
total--;
}
cout << total << endl;
for (int j = 1; j <= 9; j++) {
cout << ans[j] << endl;
}
return 0;
} | 0 | 53,608,262 |
#include <iostream>
using namespace std;
int main(void){
int N, s;
s = 0;
cin >> N;
for (int i = 1; i <= N; i++){
s = s + i;
}
cout << s << endl;
return 0;
} | #include<iostream>
#include<string>
#include<cstdint>
#include<alloca.h>
int64_t const MOD = 1e9+7;
std::string L;
int64_t const tbl[] = {1, 3, 5, 9, 11, 15, 19, 27, 29, 33, 37, 45, 49, 57, 65, 81};
int to_num(int k, char const* p) {
int res = 0;
while(--k>=0) { res = res*2 + (*p++ - '0'); }
return res;
}
bool is_zero(int k, char const* p) {
while(--k>=0) if(*p++ != '0') return false;
return true;
}
void minus1(int k, char const* p, char *o) {
int i = k-1;
for(; i >= 0; --i) {
if(p[i] == '0') o[i] = '1';
else {
o[i] = '0';
--i;
break;
}
}
for(; i >= 0; --i) o[i] = p[i];
}
int64_t full(int k) {
int64_t res = 1;
while(--k>=0) (res *= 3) %= MOD;
return res;
}
int64_t count_bits_pow2(int k, char const*p) {
int64_t res = 1;
while(--k>=0) if(*p++ != '0') (res *= 2) %= MOD;
return res;
}
int64_t calc(int k, char const* p) {
if(k <= 4) return tbl[to_num(k, p)];
int l = k/2, r = k - l;
if(is_zero(l, p)) return calc(r, p+l);
char *p1 = (char*)alloca(l);
minus1(l, p, p1);
int64_t resL = calc(l, p1)*full(r)%MOD;
int64_t resR = count_bits_pow2(l, p)*calc(r, p+l)%MOD;
return (resL+resR)%MOD;
}
int main() {
std::cin >> L;
std::cout << calc(L.size(), L.c_str()) << std::endl;
return 0;
} | 0 | 95,281,093 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
struct Spell {
int64_t damage{};
int64_t cost{};
};
int main() {
int64_t h{}, n{};
std::cin >> h >> n;
std::vector<Spell> spells(n);
for (int64_t i = 0; i < n; i++) {
std::cin >> spells[i].damage >> spells[i].cost;
}
std::vector<int64_t> dp(h + 1, std::numeric_limits<int64_t>::max());
dp[0] = 0;
for (int64_t i = 0; i < h; i++) {
if (dp[i] == std::numeric_limits<int64_t>::max()) continue;
for (int64_t j = 0; j < n; j++) {
const auto total = std::min(h, i + spells[j].damage);
dp[total] = std::min(dp[total], dp[i] + spells[j].cost);
}
}
std::cout << dp.back() << std::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 <tuple>
#include <numeric>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
ll rec(ll n, ll x)
{
if (n == 0)
{
return 1;
}
if (x == 1)
{
return 0;
}
ll p = pow(2, n) - 1;
ll h = pow(2, n + 1) - 3;
if (x <= h + 1)
{
return rec(n - 1, x - 1);
}
else if (x == h + 2)
{
return p + 1;
}
else if (x <= h * 2 + 2)
{
return p + 1 + rec(n - 1, x - h - 2);
}
else
{
return p * 2 + 1;
}
}
int main(void)
{
ll n, x;
cin >> n >> x;
cout << rec(n, x) << endl;
} | 0 | 46,151,240 |
#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i < (ll)(n); ++i)
#define INF 1000000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
string ans = "Yes";
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
map<char,int> ansstr;
map<char,int> chcnt;
string s;
cin >> s;
rep(i,s.size()){
ansstr[s[i]]++;
}
rep(i,N-1){
chcnt.clear();
cin >> s;
rep(j,s.size()){
chcnt[s[j]]++;
}
for(auto& p:ansstr){
if(chcnt.count(p.first)){
p.second = min(p.second,chcnt[p.first]);
}
else{
ansstr.erase(p.first);
}
}
}
for(auto p:ansstr){
rep(i,p.second){
cout << p.first;
}
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
const ll MOD=1e9+7;
#define endl '\n'
#define F first
#define S second
#define pb push_back
const double PI = 3.141592653589793238460;
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
long long int binpow(long long int a, long long int b) {
long long int res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
void solve()
{
int n,m;cin>>n>>m;
char s[n+1][m+1];
int dp[n+1][m+1];
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>s[i][j];
}
}
int flag=0,flag2=0;
for(int i=1;i<=n;i++)
{
if(s[i][1]=='#')
{
flag=1;
}
if(flag==1)
dp[i][1]=0;
else
dp[i][1]=1;
}
for(int i=1;i<=m;i++)
{
if(s[1][i]=='#')
{
flag2=1;
}
if(flag2==1)
dp[1][i]=0;
else
dp[1][i]=1;
}
for(int i=2;i<=n;i++)
{
for(int j=2;j<=m;j++)
{
if(s[i][j]=='.')
dp[i][j]=(dp[i-1][j]+dp[i][j-1])%MOD;
else
dp[i][j]=0;
}
}
cout<<dp[n][m]%MOD;
}
int main()
{
c_p_c();
int t=1;
while(t--)
{
solve();
}
return 0;
} | 0 | 19,840,812 |
#include <iostream>
using namespace std;
double x[4],y[4],px,py,ax,ay,bx,by;
int main()
{
while(true)
{
for(int i = 1;i<=3;i++){cin >> x[i];cin >> y[i];}
if(cin.eof()){break;}
cin >> px;
cin >> py;
double m,n;
ax = x[2]-x[1];
ay = y[2]-y[1];
bx = x[3]-x[1];
by = y[3]-y[1];
px = px - x[1];
py = py - y[1];
double det = ax*by-ay*bx;
m = (by*px-bx*py)/det;
n = (-ay*px+ax*py)/det;
if( det ==0) cout << "NO"<<endl;
if(m>0 && m <= 1 && n > 0 && n <= 1 && m+n <= 1 ) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
#define ZERO(a) memset(a,0,sizeof(a))
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
#define exists find_if
#define forall all_of
using ll = int; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; }
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
string bits_to_string(ll input, ll n=64) { string s; rep(i, n) s += '0' + !!(input & (1ll << i)); reverse(all(s)); return s; }
template <typename T> ostream &operator<<(ostream &o, const priority_queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} o << endl; return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; };
namespace myhash{ const int Bsizes[]={3,9,13,17,21,25,29,33,37,41,45,49,53,57,61,65,69,73,77,81}; const int xor_nums[]={0x100007d1,0x5ff049c9,0x14560859,0x07087fef,0x3e277d49,0x4dba1f17,0x709c5988,0x05904258,0x1aa71872,0x238819b3,0x7b002bb7,0x1cf91302,0x0012290a,0x1083576b,0x76473e49,0x3d86295b,0x20536814,0x08634f4d,0x115405e8,0x0e6359f2}; const int hash_key=xor_nums[rand()%20]; const int mod_key=xor_nums[rand()%20]; template <typename T> struct myhash{ std::size_t operator()(const T& val) const { return (hash<T>{}(val)%mod_key)^hash_key; } }; };
template <typename T> class uset:public std::unordered_set<T,myhash::myhash<T>> { using SET=std::unordered_set<T,myhash::myhash<T>>; public: uset():SET(){SET::rehash(myhash::Bsizes[rand()%20]);} };
uint32_t randxor() { static uint32_t x=1+(uint32_t)random_seed,y=362436069,z=521288629,w=88675123; uint32_t t; t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) ); }
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ gettimeofday(&start, NULL); ios::sync_with_stdio(false); cin.tie(0); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define rand randxor
static const double EPS = 1e-14;
static const long long INF = 1e9;
static const long long mo = 1e9+7;
#define ldout fixed << setprecision(40)
ll d[200010];
ll e[1ll<<26];
ll a[200010];
vll cand;
int main(void) {
string s; cin >> s;
ll n = s.length();
cand.pb(0); rep(i, 26) cand.pb(1ll<<i);
rep(i, n) {
a[i+1] = a[i] ^ (1ll << (s[i] - 'a'));
}
rep(i, 200010) {
d[i] = INF;
}
rep(x, 1ll<<26) {
e[x] = INF;
}
d[0] = 0;
e[a[0]] = 0;
repi(i, 1, n+1) {
for (auto x : cand) {
chmin(d[i], e[a[i]^x] + 1);
}
chmin(e[a[i]], d[i]);
}
cout << d[n] << endl;
return 0;
} | 0 | 52,548,836 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int a, b;
cin >> a >> b;
int c = 16-a-b;
if(abs(a-b)<2+c) cout << "Yay!" << endl;
else cout << ":(" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
vector<ll> acc_sum(vector<ll> v){
vector<ll> ans(v.size()+1,0);
rep(i,v.size()) ans[i+1]=ans[i]+v[i];
return ans;
}
void dis(vector<ll> v){
rep(i,v.size()) cout<<v[i]<<endl;
}
int main() {
IOS;
ll n;
cin>>n;
vector<ll> v(100,0);
Rep(i,n+1){
vector<pint> p=prime_factorize(i);
rep(j,p.size()) v[p[j].first]+=p[j].second;
}
vector<ll> w(100,0);
rep(i,100) w[v[i]]++;
reverse(ALL(w));
vector<ll> sum=acc_sum(w);
reverse(ALL(sum));
ll ans=0;
ans+=max(sum[74],(ll)0);
ans+=max(sum[24]*(sum[2]-1),(ll)0);
ans+=max(sum[14]*(sum[4]-1),(ll)0);
ans+=max(sum[4]*(sum[4]-1)/2*(sum[2]-2),(ll)0);
reverse(ALL(w));
cout<<ans<<endl;
} | 0 | 77,281,247 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int n;
cin>>n;
cout<<(n-2)*180<<endl;
}
signed main(){
solve();
} | #include <stdio.h>
#include <cmath>
int main(){
char s[8003] = {};
int x,y;
int gx[8000] ,gy[8000];
bool dx[8000][8000] ,dy[8000][8000];
scanf("%s\n", &s);
scanf("%d %d", &x, &y);
int i = 0;
while( s[i] == 'F'){
i++;
}
x = x-i;
i++;
x = std::abs(x);
y = std::abs(y);
int j = 0;
int ix = 0;
int iy = 0;
bool yoko = false;
while( s[i] != 0){
if( s[i] == 'T'){
if(yoko) gx[ix++] = j;
else gy[iy++] = j;
yoko = !yoko;
i++;
j = 0;
}else{
i++;
j++;
}
}
if(yoko) gx[ix++] = j;
else gy[iy++] = j;
yoko = !yoko;
dx[0][0] = true;
dy[0][0] = true;
for (int k = 1; k <= iy; k++){
for (int l = 0; l < 8000; l++){
if(dx[k-1][l]){
if(l+gx[k-1] < 8001) dx[k][l+gx[k-1]] = true;
if(l-gx[k-1] > -1) dx[k][l-gx[k-1]] = true;
}
if(dy[k-1][l]){
if(l+gy[k-1] < 8001) dy[k][l+gy[k-1]] = true;
if(l-gy[k-1] > -1) dy[k][l-gy[k-1]] = true;
}
}
}
if( dx[iy][x] && dy[iy][y] ) printf ("Yes\n");
else printf ("No\n");
return 0;
} | 0 | 78,068,340 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i,n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll,ll>>
#define vvl vector<vector<ll>>
#include<algorithm>
#include <iostream>
#include <vector>
#include <cstdlib>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
int main(){
ll n,k;cin>>n>>k;
vl a(n);rep(i,n){cin>>a[i];a[i]--;}
vl mem(n);
ll cnt=0;
ll ans=0;
rep(i,n)mem[a[i]]++;
rep(i,n){
if(mem[i]>0)cnt++;
}
sort(mem.begin(),mem.end());
rep(i,n){
if(mem[i]>0&&cnt>k){
ans+=mem[i];
cnt--;
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll X,N;
cin>>X>>N;
set<ll> S;
for(ll i=0;i<N;i++) {
ll p;
cin>>p;
S.insert(p);
}
if(!S.count(X)) {
cout<<X<<endl;
return 0;
}
for(ll i=1;i<1000;i++) {
if(!S.count(X-i)) {
cout<<X-i<<endl;
break;
}
else if(!S.count(X+i)) {
cout<<X+i<<endl;
break;
}
}
cout<<endl;
} | 0 | 12,394,046 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
int main()
{
string S;
cin >> S;
map<char, ll> mp;
for (ll i = 0; i < S.size(); i++)
{
mp[S[i]] += 1;
}
bool ok = true;
for (auto &&e : mp)
{
if (e.second > 1) {
ok = false;
}
}
cout << (ok ? "yes" : "no") << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
using namespace std;
int main()
{
int n;
cin >> n;
int birth[1000][11][21];
int ctn = 196470;
for (int y = 1; y < 1000; y++) {
for (int m = 1; m < 11; m++) {
int ma;
if (y % 3 == 0) ma = 20;
else if (m % 2) ma = 20;
else ma = 19;
for (int d = 1; d <= ma; d++) {
birth[y][m][d] = ctn;
ctn--;
}
}
}
int y, m, d;
while (n--) {
cin >> y >> m >> d;
cout << birth[y][m][d] << endl;
}
return 0;
} | 0 | 56,678,940 |
#include <bits/stdc++.h>
using namespace std;
static const int INF = 10000007;
int main()
{
int h, w;
int ma[101][101];
cin >> h >> w;
string in;
for (int i = 1; i <= h; ++i)
{
cin >> in;
for (int j = 1; j <= w; ++j)
{
ma[i][j] = (in[j-1] == '#');
}
}
int dp[101][101] = {};
for (int i = 0; i < 101; ++i)
{
for (int j = 0; j < 101; ++j)
{
dp[i][j] = INF;
}
}
dp[1][0] = dp[0][1] = 0;
for (int i = 1; i <= h; ++i)
{
for (int j = 1; j <= w; ++j)
{
dp[i][j] = min((ma[i-1][j]==0&&ma[i][j]?1:0) + dp[i-1][j], (ma[i][j-1]==0&&ma[i][j]?1:0) + dp[i][j-1]);
}
}
cout << dp[h][w] << endl;
return 0;
} | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long s = 0;
for (long x : a) s ^= x;
vector<long> b(n - 1);
for (int i = 0; i < n - 1; i++) {
b[i] = a[i] & (~s);
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
vector<long> q;
long c = 0;
for (long x : b) {
for (long y : q) {
x = min(x, x ^ y);
}
if (x > 0) {
q.push_back(x);
c = max(c, c ^ x);
}
}
s += c * 2;
cout << s;
return 0;
} | 0 | 23,300,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
cin >> s;
if (s[0]==s[1] && s[1]==s[2]) puts("Yes");
else if (s[1]==s[2] && s[2]==s[3]) puts("Yes");
else puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int b[100010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
for(int i=0;i<n;i++)
{
int a;cin>>a;
b[a]++;
b[a+1]++;
b[a+2]++;
}
int ans=0;
for(int i=0;i<100010;i++)ans=max(ans,b[i]);
cout<<ans<<"\n";
return 0;
} | 0 | 91,559,407 |
#include<iostream>
using namespace std;
int main() {
int height[10], i, a=0, b=0, c=0;
for (i = 0; i < 10; i++) {
cin >> height[i];
}
for (i = 0; i < 10; i++) {
if (height[i] >= a) {
c = b;
b = a;
a = height[i];
}
else if (height[i] >= b) {
c = b;
b = height[i];
}
else if (height[i] >= c) {
c = height[i];
}
}
cout << a << endl << b << endl << c << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
string a, b, c;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c;
if(a.back() == b[0] && b.back() == c[0]) cout << "YES\n";
else cout << "NO\n";
return 0;
} | 0 | 43,567,010 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/4
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
template<class T> inline bool chmax(T &a, T b){if(a < b){a = b;return true;}return false;}
template<class T> inline bool chmin(T &a, T b){if(a > b){a = b;return true;}return false;}
const int MOD = 1000000007;
signed main(){
string s;
cin >> s;
int n = s.size();
int ans = 0;
for(int i = 1;i < n/2;i++){
int f = 1;
rep(j,i){
if(s[j] != s[j+i])f = 0;
}
if(f)ans = 2*i;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int main()
{
_FastIO;
string s;
cin >> s;
int n = s.size();
int x = 0;
int ans = 753;
for(int i = 0; i < 3; i++){
int k = int(s[i]) - 48;
x = x * 10 + k;
}
ans = min(ans , abs(753 - x));
int i = 3;
while(i < n){
x %= 100;
int k = int(s[i]) - 48;
x = x * 10 + k;
ans = min(ans , abs(753 - x));
i++;
}
cout << ans << endl;
return 0;
} | 0 | 57,683,633 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(124,0);
string s;
cin >> s ;
for ( int i=0 ; i<s.size() ; i++){
p[(int)(s.at(i))]++;
}
for ( int i=0 ; i<125 ; i++){
if (p[i]>=2){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long nexta[18][100001];
long long arr(long long from, long long days){
long long shisu=0;
while(days>0){
if(days%2==1){
from=nexta[shisu][from];
}
days/=2;
shisu++;
}
return from;
}
int main(){
long long N;
cin >> N;
long long x[N+1];
long long i,j;
for(i=1; i<=N; i++){
cin >> x[i];
}
long long L;
cin >> L;
long long Q;
cin >> Q;
long long a[Q+1], b[Q+1];
for(i=1; i<=Q; i++){
cin >> a[i] >> b[i];
if(a[i]>b[i]) swap(a[i],b[i]);
}
for(i=1; i<=N; i++){
j=lower_bound(x+1,x+N+1,x[i]+L)-x;
if(j>N){
nexta[0][i]=N;
continue;
}
if(x[i]+L<x[j]){
j--;
}
nexta[0][i]=j;
}
for(i=1; i<18; i++){
for(j=1; j<=N; j++){
nexta[i][j]=nexta[i-1][nexta[i-1][j]];
}
}
long long ans[Q+1];
long long lef, rig, mid;
long long arrarr, arrarrarr;
for(i=1; i<=Q; i++){
lef=0;
rig=N;
while(lef<rig-1){
mid=(lef+rig)/2;
arrarr=arr(a[i],mid-1);
if(arrarr>=b[i]){
rig=mid;
}else{
lef=mid;
}
}
ans[i]=lef;
}
for(i=1; i<=Q; i++){
cout << ans[i] << endl;
}
system("pause");
return 0;
} | 0 | 1,413,282 |
#include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
string s;cin>>s;
ll countb = 0;
ll ans = 0;
int n = s.size();
for(int i = 0;i<n;++i){
if(s[i]=='W') {
ans+=countb;
}
else {
countb++;
}
}
cout<<ans<<endl;
} | 0 | 74,603,270 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#define pb push_back
const ll INF = 1000000000000000;
const ll MOD = 1000000007;
const double PI = acos(-1);
#define DBG(a,b,c,d)
int main(){
IO_STREAM;
int N; cin>>N;
vi A(N);
rep(i,0,N){
cin>>A[i];
}
vi ans(N);
rep(i,0,N){
ans[A[i]-1]=i+1;
}
rep(i,0,N){
cout<<ans[i]<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define sz(a) (ll)a.size()
#define endl "\n"
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b))
#define all(vec) vec.begin(),vec.end()
#define ms(a, b) memset(a,b,sizeof(a))
#define TEST_CASE(t) for(int zz=1;zz<=t;zz++)
#define PRINT_CASE printf("Case %d: ",zz)
#define fii freopen("input.txt","r",stdin);
#define foo freopen("output.txt","w",stdout);
#define FAST ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
const ll M = 1e9+7;
const ll mxn = 3e5+10;
vector<pll>row(mxn),col(mxn);
set<pll>st;
int main()
{
ll i,j,k,a,b,c,d,n,m,t,h,u,v,w,x,y,z;
cin>>x>>y>>n;
for(i=1;i<=n;i++)
{
cin>>u>>v;
st.insert({u,v});
row[u].ff+=1;
row[u].ss=u;
col[v].ff+=1;
col[v].ss=v;
}
ll mxr=0,mxc=0;
for(auto a:row)
{
mxr=max(mxr,a.ff);
}
for(auto a:col)
{
mxc=max(mxc,a.ff);
}
set<ll>stw,sth;
for(auto a:row)
{
if(a.ff==mxr)
{
stw.insert(a.ss);
}
}
for(auto a:col)
{
if(a.ff==mxc)
{
sth.insert(a.ss);
}
}
for(auto a:stw)
{
for(auto b:sth)
{
if(st.find({a,b})==st.end())
{
cout<<mxr+mxc<<endl;
return 0;
}
}
}
cout<<mxr+mxc-1<<endl;
return 0;
} | 0 | 32,100,609 |
#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 int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
ll N;
cin >> N;
ll ans = 1e18;
for (ll i = 1; i * i <= N; i++)
{
if (N % i == 0)
{
ans = min(ans, i + N / i - 2);
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> a(H,vector<char>(W));
vector<int> h(H);
vector<int> w(W);
rep(i,H){
rep(j,W){
cin >> a.at(i).at(j);
if(a.at(i).at(j) == '#'){
h.at(i) = 1;
w.at(j) = 1;
}
}
}
rep(i,H){
if(h.at(i) == 1){
rep(j,W){
if(w.at(j) == 1){
cout << a.at(i).at(j);
}
}
cout << endl;
}
}
return 0;
} | 0 | 91,631,875 |
#include<bits/stdc++.h>
using namespace std;
#define pf printf
#define PF(a) printf("%d\n",(a))
#define PF2(a,b) printf("%d %d\n",(a), (b))
#define PF3(a,b,c) printf("%d %d %d\n",(a), (b), (c))
#define PFL(a) printf("%lld\n",(a))
#define PFL2(a,b) printf("%lld %lld\n",(a), (b))
#define PFL3(a,b,c) printf("%lld %lld %lld\n",(a), (b), (c))
#define get(a) cin>>a
#define sf scanf
#define SF(a) scanf("%d",&a)
#define SF2(a,b) scanf("%d %d",&a, &b)
#define SF3(a,b,c) scanf("%d %d %d",&a, &b, &c)
#define SFL(a) scanf("%lld",&a)
#define SFL2(a,b) scanf("%lld %lld",&a, &b)
#define SFL3(a,b,c) scanf("%lld %lld %lld",&a, &b, &c)
#define gl(a) getline(cin,(a))
#define gc() getchar()
#define pb push_back
#define m_p make_pair
#define pc() printf("Case %d: ",tt++)
#define tc() cout<<"Case "<<tt++<<": "
#define SZ(a) (int)(a).size()
#define all(a) a.begin(),a.end()
#define FF first
#define SS second
#define MAX 2134567891
#define MOD 1000000007
#define MM 100005
#define PI 2*acos(0.0)
#define cond(n,m) (xx>=0 && xx<(n) && yy>=0 && yy<(m))
#define mem(a) memset((a),0,sizeof (a))
#define SET(a) memset((a),-1,sizeof (a))
#define output freopen("output.txt","w",stdout);
#define input freopen("input.txt","r",stdin);
#define I_O ios_base::sync_with_stdio(0); cin.tie(0)
#define rep(a) for(int i=0;i<(a);i++)
#define FOR(a,b) for(int i=(a);i<(b);i++)
#define REP(a) for(int j=0;j<(a);j++)
#define rev(a) for(int i=(a);i>=0;i--)
#define fr(i,n) for(i=0;i<n;i++)
#define fr1(i,n,m) for(i=n;i<m;i++)
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
typedef long long ll;
typedef unsigned long long llu;
typedef priority_queue < int > PQ;
typedef pair < int, int > pi;
typedef pair < int, pi > pii;
typedef vector < int > vi;
typedef vector < ll > vl;
typedef vector < string > vs;
/*
ll bigmod(ll a, ll b, ll c)
{
if(b==0)return 1%c;ll x=bigmod(a,b/2,c);x=x*x%c;
if(b%2==1)x=x*a%c;return x;
}
ll poww(ll a, ll b)
{
if(b==0)return 1;ll x=poww(a,b/2);x=x*x;if(b%2==1)x=x*a;return x;
}
ll mod_inverse(ll a, ll mod){return bigmod(a,mod-2,mod);}
ll LCM(ll a, ll b){ return a*b/ __gcd(a,b);}
int pr = 10000000;
vi primelist;
bool a[MM*100];
void seive( )
{
int i,j,k=sqrt(pr);
a[1]=1;
primelist.pb(2);
for(i=4;i<=pr;i+=2)a[i]=1;
for(i=3;i<=k;i+=2)if(!a[i])for(j=i*i;j<=pr;j+=2*i)a[j]=1;
for(i=3;i<=pr;i+=2)if(!a[i])primelist.pb(i);
}
ll fact_divs( ll n, ll p)
{
ll cnt=0;while(p<=n){cnt += n/p;n /= p;}return cnt;
}
struct point{double x, y;};
double area( point A, point B, point C){
return 0.5*(A.x*(B.y-C.y) - A.y*(B.x-C.x) + B.x*C.y - C.x*B.y);
}
ll a[MM];
int main()
{
I_O;
int n;
cin>>n;
rep(n){
cin>>a[i];
}
ll prev = 0, ans = 0;
rep(n){
ans += a[i]/2;
a[i] %= 2;
if(a[i] && a[i+1]){
a[i+1]--;
ans++;
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A.rbegin(), A.rend());
long long W = 0, H = 0;
for(int i = 1; i < N; i++) {
if(A[i-1] == A[i]) {
if(!W) {
W = A[i];
i++;
}
else if(!H) {
H = A[i];
break;
}
}
}
if(W && H) {
cout << W * H << endl;
}
else {
cout << 0 << endl;
}
return 0;
} | 0 | 88,555,229 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
const int mod = 1e9 + 7;
int main(){
int n;
cin >> n;
VLL T(n),A(n);
rep(i,n) cin >> T[i];
rep(i,n) cin >> A[i];
vector<bool> T_equal(n,false), A_equal(n,false);
T_equal[0] = true;
A_equal[n-1] = true;
rep(i,n-1) if(T[i] != T[i+1]) T_equal[i+1] = true;
for(int i = n-1; i >= 1; i--) if(A[i] != A[i-1]) A_equal[i-1] = true;
ll ans = 1;
rep(i,n){
if(T_equal[i] || A_equal[i] ){
if(T_equal[i] && A_equal[i] && T[i] != A[i]){
cout << 0 << endl;
return 0;
}else if(T_equal[i] && T[i] > A[i]){
cout << 0 << endl;
return 0;
}else if(A_equal[i] && T[i] < A[i]){
cout << 0 << endl;
return 0;
}
continue;
}
ans = ( ans * min(T[i],A[i]) ) % mod;
}
cout << ans << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
string comp;
if (a < b) {
comp = "a < b";
}
else if (a==b) {
comp = "a == b";
}
else {
comp = "a > b";
}
cout << comp.c_str() << std::endl;
return 0;
} | 0 | 63,647,277 |
#include<stdio.h>
#include<cstdio>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#include<utility>
#include<queue>
#include<stack>
#define pi 3.14159
#define Inf (int)pow(2., 12.)
using namespace std;
typedef std::pair<int, int> mypair;
queue<mypair> qu;
#define M 1000000
int main(){
string str;
char c;
while(getline(cin, str)) {
if(str == ".") { break; }
stack<char> st;
for(int i = 0; i < str.size(); i++) {
if(str[i] == '(') { st.push('(');}
else if(str[i] == '[') { st.push('[');}
else if(str[i] == ')') {
if(st.empty()) {
st.push(')');
break;
}
c = st.top();
if(c == '(') {st.pop();}
else {
break;
}
}
else if(str[i] == ']') {
if(st.empty()) {
st.push(']');
break;
}
c = st.top();
if(c == '[') {st.pop();}
else {
break;
}
}
}
if(st.empty()) { cout << "yes" <<endl;}
else { cout << "no" <<endl;}
}
} | #include<stdio.h>
int main(void)
{
int w,h,x,y,r;
scanf("%d",&w);
scanf("%d",&h);
scanf("%d",&x);
scanf("%d",&y);
scanf("%d",&r);
if(x>=r && x+r<=w && y>=r && y+r<=h){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 95,993,378 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define arep(x,n) for (int x: n)
using namespace std;
using ll = long long;
int main()
{
int n; cin >> n;
set<ll> a;
ll tmp;
rep(i,n) {
cin >> tmp;
a.insert(tmp);
}
if(a.size() == n) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <cstring>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#include <stack>
using namespace std;
using ll = long long;
#define int ll
#define P pair<ll, ll>
const double PI = 3.141592653589793238462643383279;
const ll MOD = 1e9 + 7;
const int INF = 1LL << 55;
class Combination {
int powmod(int a, int p) {
int ans = 1;
int mul = a;
for (; p > 0; p >>= 1, mul = (mul * mul) % mod) {
if ((p & 1) == 1) ans = (ans * mul) % mod;
}
return ans;
}
public:
int N;
int mod;
vector<int> fact;
vector<int> revFact;
Combination(int n, int m) : N(n), mod(m), fact(n+1), revFact(n+1) {
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = fact[i-1] * i;
fact[i] %= mod;
}
revFact[N] = powmod(fact[N], mod - 2);
for (int i = N-1; i >= 0; i--) {
revFact[i] = revFact[i+1] * (i+1);
revFact[i] %= mod;
}
}
int get(int a, int b) {
if (a < 0 || b < 0) return 0;
if (b > a) return 0;
return (((fact[a] * revFact[b]) % mod) * revFact[a-b]) % mod;
}
};
signed main() {
int n;
cin >> n;
int A[n+1];
map<int, int> m;
int dup = -1;
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
m[A[i]]++;
if (m[A[i]] == 2) dup = A[i];
}
int left_idx = -1;
int right_idx = -1;
for (int i = 0; i < n + 1; i++) {
if (A[i] == dup) {
if (left_idx == -1) {
left_idx = i;
} else {
right_idx = i;
}
}
}
int mid = right_idx - left_idx - 1;
int right = n - right_idx;
int left = left_idx;
int side = right + left;
Combination comb = Combination(n, MOD);
for (int k = 1; k <= n + 1; k++) {
int ret = 0;
if (n - 1 >= k) {
ret += comb.get(n - 1, k);
ret %= MOD;
}
if (n >= k) {
ret += 2 * comb.get(n - 1, k - 1);
ret %= MOD;
}
if (side >= k - 1) {
ret -= comb.get(side, k - 1);
ret += MOD;
ret %= MOD;
}
if (k >= 2) {
ret += comb.get(n - 1, k - 2);
ret %= MOD;
}
cout << ret << endl;
}
return 0;
} | 0 | 91,577,372 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<string>
#include<bitset>
#include<random>
#include<ctime>
using namespace std;
typedef long long ll;
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll a, b, c;
cin >> a >> b >> c;
cout << c - min(a - b, c);
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
using ll = long long;
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a > b) {
T buf = a;
a = b;
b = buf;
}
return a == 0 ? b : gcd(a, b%a);
}
int main() {
int n, k;
cin >> n >> k;
bool bigger = false;
int g = 0;
for (int i=0, ai; i<n; i++) {
cin >> ai;
if (ai >= k) bigger = true;
g = gcd(g, ai);
}
cout << (bigger && (k % g == 0) ? "POSSIBLE" : "IMPOSSIBLE") << '\n';
return 0;
} | 0 | 18,495,747 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const int INF = 2e9;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
ll n;
cin >> n;
ll ans = 0;
ll num = 1;
bool z = false;
rep(i, n){
ll a;
cin >> a;
if(a==num){
num++;
z = true;
}
else{
ans++;
}
}
if(z){
print(ans);
}
else{
print(-1);
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
int nmax=200000;
vvec g(nmax);
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int n;
cin>>n;
vec a(n);
vec b(n);
int sum=0;
int mem=0;
rep(i,n){
cin>>a[i]>>b[i];
sum+=a[i];
if(a[i]==b[i]) mem++;
}
if(mem==n) cout<<0<<endl;
else{
int m=INF;
rep(i,n){
if(a[i]>b[i]){
chmin(m,b[i]);
}
}
cout<<sum-m<<endl;
}
} | 0 | 80,992,604 |
#include <bits/stdc++.h>
using namespace std;
# define ll long long int
# define ld long double
# define pb push_back
# define pp pop_back
# define ff first
# define ss second
# define mp make_pair
# define ac accumulate
# define mod 1000000007
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int p[5005];
int c[5005];
vector<ll> prefixSums;
bool vis[5005];
void dfs(int src, ll currSum){
if(vis[src])
return;
vis[src] = true;
currSum += c[src];
prefixSums.push_back(currSum);
dfs(p[src], currSum);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int n, k;
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> p[i];
p[i]--;
}
for(int i = 0; i < n; i++)
cin >> c[i];
ll ans = -1e18;
for(int i = 0; i < n; i++){
memset(vis, false, sizeof(vis));
dfs(i, 0);
if(prefixSums.back() > 0 && k > (int)prefixSums.size()){
ll cycles = (ll)(k/(int)prefixSums.size());
ll left = (ll)(k%(int)prefixSums.size());
ll maxi = -1e18;
for(int x = 0; x < (int)prefixSums.size(); x++)
maxi = max(maxi, prefixSums[x]);
ans = max(ans, (cycles - 1LL)*(prefixSums.back()) + maxi);
maxi = -1e18;
for(int x = 0; x < left; x++)
maxi = max(maxi, prefixSums[x]);
ans = max(ans, (cycles*prefixSums.back()) + maxi);
}
else{
for(int j = 0; j < min((int)prefixSums.size(), k); j++)
ans = max(ans, prefixSums[j]);
}
prefixSums.clear();
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int i=0,j=0,n,m,x,c[20000],a[200][200],saisyo=999999999999,u=0,g[100],k,q=0,i2,cc=0;
string b,b2;
cin >> n >> m >> x;
for(i=0;i<n;i++)
{
cin >> c[i];
for(j=0;j<m;j++)
{
cin >> a[i][j];
}
}
for (int bit = 0; bit < (1<<n); ++bit)
{
q=0;
u=0;
for(k=0;k<m;k++)
{
g[k]=0;
}
for(i=0;i<n;i++)
{
if(((bit >> i)&1)==0)
{
continue;
}
for(j=0;j<m;j++)
{
g[j]+=a[i][j];
}
q+=c[i];
}
for(i2=0;i2<m;i2++)
{
if(g[i2]>=x)
{
u++;
}
}
if(u==m && saisyo>q)
{
saisyo=q;
cc++;
}
}
if(cc==0)
{
cout << "-1" << endl;
return 0;
}
cout << saisyo << endl;
return 0;
} | 0 | 33,017,913 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef double db;
typedef long long ll;
#define pb push_back
#define FAST cin.sync_with_stdio(0); cin.tie(0);
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define arep(i, a, n) for(int i = a; i <= (n); ++i)
#define drep(i, a, n) for(int i = a; i >= (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef vector<ll> vl;
typedef map<ll, ll> ml;
typedef unordered_map<ll, ll> hash;
#define deb_1(A) {cerr << "[" << #A << "] : " << A << endl;}
#define deb_2(A,B) {cerr << "[" << #A << "] : " << A << endl<< "[" << #B << "] : " << B << endl;}
#define deb_3(A,B,C) {cerr << "[" << #A << "] : " << A << endl<< "[" << #B << "] : " << B << endl\
<< "[" << #C << "] : " << C << endl;}
#define deb_4(A,B,C,D) {cerr << "[" << #A << "] : " << A << endl<< "[" << #B << "] : " << B << endl\
<< "[" << #C << "] : " << C << endl<< "[" << #D << "] : " << D << endl;}
#define deb_X(x,A,B,C,D,FUNC, ...) FUNC
#define deb(...) deb_X(,##__VA_ARGS__,\
deb_4(__VA_ARGS__),\
deb_3(__VA_ARGS__),\
deb_2(__VA_ARGS__),\
deb_1(__VA_ARGS__),\
)
#define M 1000000007
ll h,w;
int main() {
FAST
cin>>h>>w;
ll dp[h][w] = {0};
char grid[h][w];
rep(i,h)
{
rep(j,w)
{
cin>>grid[i][j];
}
}
dp[0][0] = 1;
rep(i,h)
{
rep(j,w)
{
if(grid[i][j] == '#')
{
dp[i][j] = 0;
}
else{
if(i>0 && j>0)dp[i][j] = (dp[i][j-1]%M + dp[i-1][j]%M)%M;
else if(i==0 && j!=0)dp[i][j] = dp[i][j-1];
else if(j==0 && i!=0)dp[i][j] = dp[i-1][j];
}
}
}
cout<<dp[h-1][w-1]<<endl;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1<<30;
const ll MOD = 1000000007;
int main(void) {
int N; cin >> N;
vector<pair<int, int> > ab(N); rep(i, N) cin >> ab[i].second >> ab[i].first;
vector<pair<int, int> > cd(N); rep(i, N) cin >> cd[i].first >> cd[i].second;
Sort(ab); Sort(cd);
int ans = 0;
vector<bool> vb(N, false);
rep (i, N) {
pair<int, int> tmp;
int flg = -1;
rep(j, ab.size()) {
if (ab[j].second < cd[i].first && ab[j].first < cd[i].second && !vb[j]) flg = j;
}
if (flg != -1) {
ans++;
vb[flg] = true;
}
}
cout << ans << endl;
return 0;
} | 0 | 10,248,440 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int f(int n)
{
return ((n & 1) ? 3 * n + 1 : n / 2);
}
int main()
{
int n;
cin >> n;
cout << 1110 - n << '\n';
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
int main() {
int n, k; cin >> n >> k;
rep(i,n) {int a; cin >> a;}
int ans = 1;
n -= k;
while (n > 0){
n -= k-1;
ans++;
}
cout << ans << endl;
} | 0 | 9,130,187 |
#include<iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a > b) swap(b, a);
else if (b > c) swap(c, b);
if (a > b) swap(b, a);
else if (b > c) swap(c, b);
if (a > b) swap(b, a);
else if (b > c) swap(c, b);
cout << a << " " << b << " " << c << endl;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll mod=1e9+7;
int main(){
ll n;
cin >> n;
vector<pll> a(n),c(n);
vector<ll> d(n);
rep(i,n){
cin >> a[i].fi >> a[i].se;
}
rep(i,n){
cin >> c[i].fi >> c[i].se;
}
sort(a.begin(),a.end());
sort(c.begin(),c.end());
ll ans=0;
rep(i,n){
ll x=-1,y=-1,num=-1;
rep(j,n){
if(c[i].fi>a[j].fi && c[i].se>a[j].se && d[j]==0){
if(a[j].se>=y){
x=a[j].fi;
y=a[j].se;
num=j;
}
}
}
if(num==-1) continue;
d[num]=1;
ans++;
}
cout << ans << endl;
} | 0 | 92,484,470 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll n,discard,largest;
int main(void){
cin>>n;
reg(i,1,n){
if(i*(i+1)/2>=n){
largest=i;
discard=i*(i+1)/2-n;
break;
}
}
reg(i,1,largest){
if(i!=discard)cout<<i<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int kaijo[2000010];
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
bool prime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
void init_fact(){
kaijo[0]=1;
for(int i=1;i<=2000000;i++){
kaijo[i]=kaijo[i-1]*i;
kaijo[i]%=mod;
}
}
int modpow(int a,int b){
if(b==0)return 1;
if(b%2)return modpow(a,b-1)*a%mod;
int memo=modpow(a,b/2);
return memo*memo%mod;
}
int comb(int a,int b){
if(!kaijo[0])init_fact();
return kaijo[a]*modpow(kaijo[a-b],mod-2)%mod*modpow(kaijo[b],mod-2)%mod;
}
int inv(int x){
x=modpow(x,mod-2);
return x;
}
bool kosa(double ax,double ay,double bx,double by,double cx,double cy,double dx,double dy){
double ta=(cx-dx)*(ay-cy)+(cy-dy)*(cx-ax);
double tb=(cx-dx)*(by-cy)+(cy-dy)*(cx-bx);
double tc=(ax-bx)*(cy-ay)+(ay-by)*(ax-cx);
double td=(ax-bx)*(dy-ay)+(ay-by)*(ax-dx);
return tc*td<0&&ta*tb<0;
}
int n;
vector<int>v[100010];
bool used[100010];
int G[100010];
void dfs(int x){
used[x]=true;
if(x&&v[x].size()==1){
G[x]=0;
return;
}
if((x==0&&v[x].size()==1)||(x&&v[x].size()==2)){
for(int i:v[x]){
if(!used[i]){
dfs(i);
G[x]=G[i]+1;
}
}
return;
}
for(int i:v[x]){
if(!used[i]){
dfs(i);
G[x]^=(G[i]+1);
}
}
}
signed main(){
cin>>n;
rep(i,n-1){
int a,b;
cin>>a>>b;
a--,b--;
v[a].pb(b);
v[b].pb(a);
}
dfs(0);
if(G[0]==0)puts("Bob");
else puts("Alice");
return 0;
} | 0 | 34,095,945 |
#include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define x first
#define y second
#pragma GCC optimize("O3")
#define plll pair <pair <ll, ll>, ll>
#define pllll pair <pair <ll, ll>, pair <ll, ll> >
#define psl pair <string, ll>
#define pld pair <ld, ld>
#define all(a) a.begin(), a.end()
#define vvl vector <vector <ll> >
#define cld complex <double>
typedef long long ll;
typedef long double ld;
using namespace std;
const ll maxn = 1e3 + 100;
const ll inf = 1e9;
ll n, m, k, t;
string S[maxn];
ll D[maxn][maxn];
bool in(ll x, ll y) {
return x >= 0 && y >= 0 && x < n && y < m;
}
int main() {
pyshnapyshnakaa
ll q, w, e, a, b, c;
cin >> n >> m;
for (q = 0; q < n; q++) {
cin >> S[q];
}
queue <pll> Q;
for (q = 0; q < n; q++) {
for (w = 0; w < m; w++) {
if (S[q][w] == '#') {
Q.push(mp(q, w));
D[q][w] = 0;
}
else {
D[q][w] = inf;
}
}
}
vector <pll> diff = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
while (!Q.empty()) {
pll p = Q.front();
Q.pop();
ll x = p.first, y = p.second;
for (auto d : diff) {
ll nx = x + d.first;
ll ny = y + d.second;
if (!in(nx, ny)) {
continue;
}
if (D[nx][ny] == inf) {
Q.push(mp(nx, ny));
D[nx][ny] = D[x][y] + 1;
}
}
}
ll ans = 0;
for (q = 0; q < n; q++) {
for (w = 0; w < m; w++) {
ans = max(ans, D[q][w]);
}
}
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
int main() {
int n;
cin >> n;
multiset<int> st;
int diam = 0;
REP(i, n) {
int a;
cin >> a;
st.insert(a);
diam = max(diam, a);
}
if (diam % 2 == 0) {
for (int i = diam; i > diam / 2; --i) {
if (st.find(i) != st.end()) {
st.erase(st.find(i));
} else {
cout << "Impossible" << endl;
return 0;
}
}
for (int i = diam / 2; i <= diam; ++i) {
if (st.find(i) != st.end()) {
st.erase(st.find(i));
} else {
cout << "Impossible" << endl;
return 0;
}
}
if (st.empty()) {
cout << "Possible" << endl;
return 0;
} else if (*st.begin() < diam / 2 + 1) {
cout << "Impossible" << endl;
return 0;
}
cout << "Possible" << endl;
} else {
for (int i = diam; i >= (diam + 1) / 2; --i) {
if (st.find(i) != st.end()) {
st.erase(st.find(i));
} else {
cout << "Impossible" << endl;
return 0;
}
}
for (int i = (diam + 1) / 2; i <= diam; ++i) {
if (st.find(i) != st.end()) {
st.erase(st.find(i));
} else {
cout << "Impossible" << endl;
return 0;
}
}
if (st.empty()) {
cout << "Possible" << endl;
return 0;
} else if (*st.begin() < (diam + 1) / 2 + 1) {
cout << "Impossible" << endl;
return 0;
}
cout << "Possible" << endl;
}
return 0;
} | 0 | 97,243,627 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int W,H,n;
while(~scanf("%d%d%d",&W,&H,&n)){
int l=0,r=W,b=0,t=H;
while(n--){
int x,y,a;
scanf("%d%d%d",&x,&y,&a);
switch(a){
case 1:
l=max(l,x);
break;
case 2:
r=min(r,x);
break;
case 3:
b=max(b,y);
break;
default:
t=min(t,y);
}
}
int ans;
if(l>r||b>t)
ans=0;
else
ans=(r-l)*(t-b);
printf("%d\n",ans);
}
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> h(n, 0);
rep(i, 0, n){
cin >> h[i];
}
vector<vector<int>> v(n);
rep(i, 0, m){
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
vector<int> x(n, 0);
int good = 0;
rep(i, 0, n){
for(int j: v[i]){
if(h[i] <= h[j]){
x[i]++;
break;
}
}
}
rep(i, 0, n){
if(x[i] == 0){
good++;
}
}
cout << good << "\n";
} | 0 | 82,766,150 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int i,num;
double x[4],y[4];
cin >> num;
for ( i = 0 ; i< num; i++ ) {
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
if( (x[0]-x[1])*(y[2]-y[3]) == (y[0]-y[1])*(x[2]-x[3]) ){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
if ((a[0] == 'D' && b[0] == 'H') || (a[0] == 'H' && b[0] == 'D')) {
cout << 'D';
}
else cout << 'H';
} | 0 | 75,397,976 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
string s; cin>>s;
int a=0,b=0;
rep(i,0,s.size()){
if(s[i]=='1')a++;
else b++;
}
cout<<min(a,b)*2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORD(i,a,b) for(int i=(a);i>=(b);--i)
#define TLE() cerr<<"\nTime elapsed: "<<1000*clock()/CLOCKS_PER_SEC<<"ms.\n";
const ll MOD = 1E9+7;
const ll IINF = 1E18;
const int INF = 1e9;
const double EPS = 1E-9;
const double PI = atan(1.0) * 4.0;
template<class T> T getbit(T s, int i) {return s>>i&1;}
template<class T> void flipbit(T& s, int i) {s^=(1LL<<i);}
constexpr int cntbit(ll x) {return __builtin_popcountll(x);}
constexpr int lg2(ll x) {return __lg(x);}
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
ll fpow(ll a,ll p){ll res=1LL;while(p){if(p&1LL) res=res*a%MOD;a=a*a%MOD;p>>=1LL;} return res;}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int r,d,x;
cin>>r>>d>>x;
REP(i,10){
x=r*x-d;
cout<<x<<'\n';
}
} | 0 | 72,702,087 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>
#include <tuple>
#include <new>
using namespace std;
#define EPS (1e-9)
#define INF (1e9)
#define MOD (ll)(1e9 + 7)
#define PI (acos(-1))
#define REP(i,a,n) for(int i=a;i<n;i++)
#define rep(i, n) REP(i,0,n)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" ; "IMPOSSIBLE")
using ll = long long int;
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
ll beki(ll a, ll b) {
ll tmp = 1;
rep(i, b) tmp *= a;
return tmp;
}
ll modPow(ll x, ll a) {
if (a == 1) return x;
if (a % 2) return (x * modPow(x, a - 1)) % MOD;
ll t = modPow(x, a / 2);
return ((t % MOD) * (t % MOD)) % MOD;
}
ll modInv(ll x) {
return modPow(x, MOD - 2);
}
ll X, Y, A, B, C;
vector<ll> p(100010), q(100010), r(100010);
priority_queue<ll, vector<ll>, greater<ll>> p_que, q_que;
ll ans = 0;
int main() {
cin >> X >> Y >> A >> B >> C;
rep(i, A) cin >> p[i];
rep(i, B) cin >> q[i];
rep(i, C) cin >> r[i];
sort(p.begin(), p.end(), greater<ll>());
sort(q.begin(), q.end(), greater<ll>());
sort(r.begin(), r.end(), greater<ll>());
rep(i, X) {
p_que.push(p[i]);
}
rep(i, Y) {
q_que.push(q[i]);
}
for (ll i = 0; min(p_que.top(), q_que.top()) < r[i]; i++) {
if (p_que.top() <= q_que.top()) {
p_que.pop();
p_que.push(r[i]);
}
else {
q_que.pop();
q_que.push(r[i]);
}
}
rep(i, X) {
ans += p_que.top();
p_que.pop();
}
rep(i, Y) {
ans += q_que.top();
q_que.pop();
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
const double cos60 = cos(M_PI / 3);
const double sin60 = sin(M_PI / 3);
struct StPnt
{
double m_nx;
double m_ny;
StPnt() :
m_nx(0), m_ny(0)
{ }
StPnt(double nx, double ny) :
m_nx(nx), m_ny(ny)
{ }
~StPnt() { }
};
void fnInput(int &rnRcSiz)
{
cin >> rnRcSiz;
}
void fnKochCrv( const StPnt &cnroPnt1, const StPnt &cnroPnt2, vector<StPnt> &rvoRtnPnt)
{
rvoRtnPnt[0] = cnroPnt1;
rvoRtnPnt[1].m_nx = (2 * cnroPnt1.m_nx + cnroPnt2.m_nx) / 3;
rvoRtnPnt[1].m_ny = (2 * cnroPnt1.m_ny + cnroPnt2.m_ny) / 3;
rvoRtnPnt[3].m_nx = (cnroPnt1.m_nx + 2 * cnroPnt2.m_nx) / 3;
rvoRtnPnt[3].m_ny = (cnroPnt1.m_ny + 2 * cnroPnt2.m_ny) / 3;
rvoRtnPnt[2].m_nx = (rvoRtnPnt[3].m_nx - rvoRtnPnt[1].m_nx) * cos60
- (rvoRtnPnt[3].m_ny - rvoRtnPnt[1].m_ny) * sin60;
rvoRtnPnt[2].m_nx += rvoRtnPnt[1].m_nx;
rvoRtnPnt[2].m_ny = (rvoRtnPnt[3].m_nx - rvoRtnPnt[1].m_nx) * sin60
+ (rvoRtnPnt[3].m_ny - rvoRtnPnt[1].m_ny) * cos60;
rvoRtnPnt[2].m_ny += rvoRtnPnt[1].m_ny;
rvoRtnPnt[4] = cnroPnt2;
}
void fnKochCtl(int nRcSiz, vector<vector<StPnt>> &rvvoPnt)
{
StPnt oPntB(0.0, 0.0);
StPnt oPntE(100.0, 0.0);
rvvoPnt.resize(7);
rvvoPnt[0].clear();
rvvoPnt[0].push_back(oPntB);
rvvoPnt[0].push_back(oPntE);
for (int nRc = 0; nRc < nRcSiz; nRc++)
{
rvvoPnt[nRc + 1].clear();
rvvoPnt[nRc + 1].push_back(oPntB);
for (int i = 0; i < rvvoPnt[nRc].size() - 1; i++)
{
StPnt oPnt1 = rvvoPnt[nRc][i];
StPnt oPnt2 = rvvoPnt[nRc][i + 1];
vector<StPnt> voRtnPnt(5);
fnKochCrv(oPnt1, oPnt2, voRtnPnt);
for (int j = 1; j < 5; j++)
rvvoPnt[nRc + 1].push_back(voRtnPnt[j]);
}
}
}
void fnResult(int nRcSiz, const vector<vector<StPnt>> &cnrvvoPnt)
{
for (int i = 0; i < cnrvvoPnt[nRcSiz].size(); i++)
cout << cnrvvoPnt[nRcSiz][i].m_nx << " " << cnrvvoPnt[nRcSiz][i].m_ny << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(8);
int nRcSiz;
vector<vector<StPnt>> vvoPnt;
fnInput(nRcSiz);
fnKochCtl(nRcSiz, vvoPnt);
fnResult(nRcSiz, vvoPnt);
return 0;
} | 0 | 95,103,367 |
#include <iostream>
using namespace std;
int main(){
int n,tree[1000000]={};
cin>>n;
for(int i=1;i<=n;i++){
cin>>tree[i];
}
for(int i=1;i<=n;i++){
cout<<"node "<<i<<": key = "<<tree[i]<<", ";
if(tree[i/2]!=0){
cout<<"parent key = "<<tree[i/2]<<", ";
}
if(tree[2*i]!=0){
cout<<"left key = "<<tree[2*i]<<", ";
}
if(tree[(2*i)+1]!=0){
cout<<"right key = "<<tree[(2*i)+1]<<", ";
}
cout<<endl;
}
return 0;
} | #include <iostream>
#include <cstring>
#include <queue>
using namespace std;
int main(){
priority_queue<int> priorityqueue;
char loader[8];
int loadnum;
while (1){
cin >> loader;
if (strcmp(loader, "insert") == 0){
cin >> loadnum;
priorityqueue.push(loadnum);
}
if (strcmp(loader, "extract") == 0){
cout << priorityqueue.top() << endl;
priorityqueue.pop();
}
if (strcmp(loader, "end") == 0){
break;
}
}
} | 0 | 68,718,965 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=1000010;
const ll mod=1e9+7;
#define bit(n,k) ((n>>k)&1)
bool ch(ll k, ll h){
rep(i,30){
if(bit(k,i)==0 && bit(h,i)==1){
return false;
}
}
return true;
}
int main(){
int n;
ll k;
cin >> n >> k;
vector<ll> a(n),b(n);
rep(i,n){
cin >> a[i] >> b[i];
}
ll ans = 0;
vector<ll> op;
op.emplace_back(k);
rep(i,30){
if(bit(k,i)){
ll msk = 0;
REP(j,i+1,30){ msk|=(1<<j); }
ll m2 = 0;
rep(j,i){ m2|=(1<<j); }
op.emplace_back((k&msk)|m2);
}
}
for(auto it:op){
ll tmp = 0;
rep(j,n)if(ch(it,a[j])){
tmp += b[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#define pb(i) push_back(i)
#define mx(ar, n) (*max_element(ar, ar + n))
#define mn(ar, n) (*min_element(ar, ar + n))
#define mnv(v) (*min_element(v.begin(), v.end()))
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef string S;
typedef int I;
int x = 1000001 ;
bool prime[1000001] ;
void sev(){
for(int i = 2; i*i <= x; i++)
{
for(int j = i*2; j <= x; j+=i)
{
prime[j] = true ;
}
}
}
int main()
{
sev() ;
I n ;
while(cin >> n){
int c = 0 ;
for(int i = 2; i <= n; i++)
{
if(!prime[i]){
c++ ;
}
}
cout << c << endl ;
}
return 0;
} | 0 | 28,386,865 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
long double T,X;
cin >>T>>X;
cout << fixed << setprecision(15) << T/X << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(int i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n; cin >> n;
ll a[n]; zep(i, 0, n)cin >> a[i];
ll mn = a[0], u = 1000 / a[0], m = 1000;
zep(i, 1, n){
if(a[i - 1] > a[i]){
m += u * (a[i - 1] - mn);
u = m / a[i];
mn = a[i];
}
}
m += u * (a[n - 1] - mn);
print(m)
return 0;
} | 0 | 87,198,916 |
#include <vector>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long int ll;
ll MOD = pow(10,9) + 7;
ll solve(vector<ll>& kids,ll K)
{
ll n = kids.size();
vector<vector<ll>> dp(n+1,vector<ll>(K+1));
vector<ll> rs(K+1,1);
vector<ll> nex_rs(K+1);
nex_rs[0] = 1;
for (int i=0;i<=n;++i)
{
dp[i][0] = 1;
}
for (int i=1;i<=n;++i)
{
vector<ll> rs(K+1);
rs[0] = 1;
for (int x=1;x<=K;++x)
{
rs[x] = rs[x-1] + dp[i-1][x];
}
for (int can=1;can<=K;++can)
{
ll upto = can - kids[i-1] - 1;
dp[i][can] = rs[can];
if (upto>=0) dp[i][can] -= rs[upto];
dp[i][can] %= MOD;
}
}
return dp[n][K];
}
int main()
{
int N,K;
cin>>N>>K;
vector<ll> kids(N);
for (int i=0;i<N;++i)
{
cin>>kids[i];
}
cout<<solve(kids,K)<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
signed main(){
int a, b, n, x, y;
int dp[20][20];
while (1) {
cin >> a >> b >> n;
if (a + b == 0) break;
rep(i, 0, 20) {
rep(j, 0, 20) {
dp[i][j] = 0;
}
}
rep(i, 0, n) {
cin >> x >> y;
x--;
y--;
dp[x][y] = -1;
}
dp[0][0] = 1;
rep(i, 0, a) {
rep(j, 0, b) {
if (i != 0 && dp[i][j] != -1) {
dp[i][j] += max((int)0, dp[i - 1][j]);
}
if (j != 0 && dp[i][j] != -1) {
dp[i][j] += max((int)0, dp[i][j - 1]);
}
}
}
cout << dp[a - 1][b - 1] << endl;
}
} | 0 | 29,200,942 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if(n == 0){
cout << 2 << endl;
return 0;
} else if(n == 1){
cout << 1 << endl;
return 0;
}
int64_t l0 = 2;
int64_t l1 = 1;
int64_t next = 0;
for(int i=0; i<n-1; i++){
next = l1 + l0;
l0 = l1;
l1 = next;
}
cout << next << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n;
cin>>n;
ll l1[n+1];
for(int i=1;i<=n;i++){
cin>>l1[i];
}
for(int i=n;i>=1;i-=2){
cout<<l1[i]<<" ";
}
if(n&1){
for(int i=2;i<=n;i+=2)cout<<l1[i]<<" ";
}
else for(int i=1;i<=n;i+=2)cout<<l1[i]<<" ";
return 0;
} | 0 | 20,727,157 |