code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll factorial(ll n) {
if (n == 1) {
return 1;
}
ll ans = factorial(n-1);
return ans*n;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return (a/gcd(a, b))*b;
}
bool is_prime(ll n) {
for (ll i = 2; i*i <= n; i++) {
if (n%i == 0) return false;
}
return n != 1;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0) return 1;
ll res = mod_pow(x*x%mod, n/2, mod);
if (n & 1) res = res * x % mod;
return res;
}
int main() {
ll n, h;
cin >> n >> h;
vector <pair <ll, ll>> v(n, pair <ll, ll> ());
rep(i, n) {
ll a, b;
cin >> a >> b;
v.at(i) = make_pair(a, -b);
}
sort(v.begin(), v.end());
pair <ll, ll> p = v.at(n-1);
p.second = -p.second;
vector <ll> b(n-1);
rep(i, n-1) b.at(i) = -v.at(i).second;
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
ll res = 0;
rep(i, n-1) {
if (h > 0) {
if (h <= p.second) {
h = 0;
res++;
} else if (p.first <= b.at(i)) {
h -= b.at(i);
res++;
}
}
}
if (h > 0) {
if (h-p.second > 0) {
h -= p.second;
res++;
if (h%p.first) res += h/p.first + 1;
else res += h/p.first;
} else res++;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int ans = 0;
vector<vi> g;
void dfs(int v, int n, vector<bool> visited) {
if (count(all(visited), true) == n) {
++ans;
return;
}
for (int to : g[v]) {
if (visited[to]) continue;
visited[to] = true;
dfs(to, n, visited);
visited[to] = false;
}
}
int main(){
int n, m;
cin >> n >> m;
g = vector<vi>(n);
rep(i, m) {
int a, b;
cin >> a >> b;
--a; --b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
vector<bool> visited(n);
visited[0] = true;
dfs(0, n, visited);
cout << ans << endl;
return 0;
} | 0 | 14,111,290 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char s[4];
scanf("%s", s);
map <char, int> freq;
for(int i = 0; i < 4; i++){
freq[s[i]]++;
if(freq[s[i]] >= 3)
return puts("No"), 0;
}
for(auto x : freq){
if(x.second != 2)
return puts("No"), 0;
}
puts("Yes");
return 0;
} | #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 Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
int main() {
ll n, H; cin >> n >> H;
Vl a(n), b(n);
ll a_ma = 0;
ll b_su = 0;
rep(i, 0, n){
cin >> a[i] >> b[i];
a_ma = max(a_ma, a[i]);
}
ll cnt_b = 0;
ll b_ma = 0;
rep(i, 0, n){
if(b[i] > a_ma){
b_ma += b[i];
cnt_b++;
}
}
ll h = H - b_ma;
if(h < 0){
sort(ALL(b), greater<ll>());
ll cnt = 0;
int i = 0;
while(H > 0){
H -= b[i];
cnt++;
i++;
}
cout << cnt << endl;
return 0;
} else {
ll cnt = cnt_b;
cnt += h/a_ma;
if(h%a_ma != 0) cnt++;
cout << cnt << endl;
return 0;
}
return 0;
} | 0 | 19,041,414 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
}
int count=1;
int ans=0;
for(int i=0; i<n; i++){
if(a.at(i) == count){
count++;
}
else{
ans++;
}
}
if(ans == n) cout << "-1"<< endl;
else cout << ans << endl;
} | #include <stdio.h>
#include <iostream>
using namespace std;
int N,R, inner;
int main(){
cin >> N >> R;
if (N<10){
inner = R+ 100*(10-N);
cout << inner;
}else {
cout << R;
}
} | 0 | 20,004,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL<<60;
const double PI = acos(-1);
int main(int, char**) {
double a, b, x; cin >> a >> b >> x;
double angle;
if (2 * x > a * a * b) {
angle = atan(2 * (a*a*b - x) / (a*a*a)) * (180/PI);
} else {
angle = (PI/2 - atan(2*x / (b*b*a))) * (180/PI);
}
cout << setprecision(10) << angle << endl;
return 0;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
int a, b, m;
int sa[100001]; INITA(sa, 0, 100001, 0);
int sb[100001]; INITA(sb, 0, 100001, 0);
cin >> a >> b >> m;
int mina = 100001;
int minb = 100001;
FOR(i, 1, a) { cin >> sa[i]; mina = min(mina, sa[i]);}
FOR(i, 1, b) { cin >> sb[i]; minb = min(minb, sb[i]);}
int res = mina + minb;
REP(i, m) {
int x, y, c;
cin >> x >> y >> c;
res = min(res, sa[x] + sb[y] - c);
}
cout << res << endl;
return 0;
} | 0 | 88,816,556 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using int64 = int64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, n;
cin >> h >> n;
int mx = h + 10010;
const int INF = (int)1e9;
vector<int> dpOld(mx, INF), dpNew(mx, INF);
dpOld[0] = 0;
while (n--) {
int a, b;
cin >> a >> b;
rep(i, mx) {
if (i - a >= 0) {
dpNew[i] = min(dpOld[i], dpNew[i - a] + b);
} else {
dpNew[i] = dpOld[i];
}
dpOld[i] = dpNew[i];
}
}
int ans = INF;
for (int i = h; i < mx; i++) {
ans = min(ans, dpNew[i]);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using pll = pair<long long,long long>;
#define cY cout<<"Yes"<<endl
#define cN cout<<"No"<<endl
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const long double pi = (acos(-1));
#define pb push_back
#define vs vector<string>
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;
}
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
ll nCr(ll n, ll r) {
ll ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans*i;
}
for (ll i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
map< ll, ll > prime_factor(ll n) {
map< ll, ll > ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
int main(){
ll H,W;
cin>>H>>W;
vector<vector<char>> grid(W,vector<char>(H));
rep(i,H)rep(j,W)cin>>grid[j][i];
vvl dp(W,vl(H,INF));
if(grid[0][0]=='#') dp[0][0]=1;
else dp[0][0]=0;
rep(i,H){
rep(j,W){
if(j!=W-1){
if(grid[j][i]=='.'&&grid[j+1][i]=='#'){
chmin(dp[j+1][i],dp[j][i]+1);
}else{
chmin(dp[j+1][i],dp[j][i]);
}
}
if(i!=H-1){
if(grid[j][i]=='.'&&grid[j][i+1]=='#'){
chmin(dp[j][i+1],dp[j][i]+1);
}else{
chmin(dp[j][i+1],dp[j][i]);
}
}
}
}
cout<<dp[W-1][H-1]<<endl;
} | 0 | 790,732 |
#include <iostream>
using namespace std;
int main(){
int X;
cin >> X;
int i=1;
while(360*i % X != 0){
i++;
}
cout << 360*i / X << endl;
} | #include<iostream>
#include<bits/stdc++.h>
#define rep(i,n) for(i=0;i<n;i++)
#define pb push_back
#define lli long long int
#define all(v) (v.begin(),v.end())
#define fr first
#define sc second
#define mp make_pair
using namespace std;
int k=pow(10,9)+7;
int main()
{
int n,m,i,j;
cin>>n>>m;
char a[n][m];
for(i=0;i<n;i++)
{
for(j=0;j<m;j++) cin>>a[i][j];
}
int dp[n][m];
dp[0][0]=1;
for(i=1;i<m;i++)
{
if(a[0][i]=='.') dp[0][i]=dp[0][i-1];
else dp[0][i]=0;
}
for(i=1;i<n;i++)
{
if(a[i][0]=='.') dp[i][0]=dp[i-1][0];
else dp[i][0]=0;
}
for(i=1;i<n;i++)
{
for(j=1;j<m;j++)
{
if(a[i][j]=='.') dp[i][j]=(dp[i-1][j]+dp[i][j-1])%k;
else dp[i][j]=0;
}
}
cout<<dp[n-1][m-1]%k;
} | 0 | 84,550,343 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define repk(i,m,n) for(int i=m;i<n;i++)
#define MotoHaiyaku ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=2*1e18;
const ld PI=3.14159265358979323846;
int main()
{
MotoHaiyaku
ll h,w,k,ans=0,t=0;
string s[10];
cin>>h>>w>>k;
rep(i,h) cin>>s[i];
rep(i,h) rep(j,w) if(s[i][j]=='#') t++;
rep(i,1<<h)
{
rep(j,1<<w)
{
ll a=i,b=j;
set<pair<ll,ll> > st;
rep(x,h)
{
if(a%2)
{
rep(y,w)
{
if(s[x][y]=='#') st.insert(mp(x,y));
}
}
a/=2;
}
rep(y,w)
{
if(b%2)
{
rep(x,h)
{
if(s[x][y]=='#') st.insert(mp(x,y));
}
}
b/=2;
}
if(t-st.size()==k) ans++;
}
}
cout<<ans;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (n)-1; i > -1; i--)
#define reps(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define sper(i, s, n) for (int i = (s); i >= (int)(n); i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
string s;
cin >> s;
bool ok = false;
rep(i, s.size())
{
reps(j, i, s.size())
{
string t = s.substr(0, i) + s.substr(j);
if (t == "keyence")
{
ok = true;
}
}
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main()
{
solve();
return 0;
} | 0 | 6,642,699 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
a += b, c += d;
if(a > c) cout << "Left" << endl;
else if(a == c) cout << "Balanced" << endl;
else cout << "Right" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> ab(m+1);
for(int i = 0; i < n; i++){
int a, b; cin >> a >> b;
if(a > m) continue;
ab.at(a).push_back(b);
}
priority_queue<int> que;
int ans = 0;
for(int i = 1; i <= m; i++){
for(auto x: ab.at(i)){
que.push(x);
}
if(!que.empty()){
ans += que.top(); que.pop();
}
}
cout << ans << endl;
} | 0 | 49,723,463 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
int w[110];
cin>>n;
rep(i,n)cin>>w[i];
int csum[110];
csum[0]=0;
reps(i,n+1)csum[i]=csum[i-1]+w[i-1];
int min=200;
reps(i,n){
if(abs((csum[n]-csum[i])-(csum[i]-csum[0]))<min)min=abs((csum[n]-csum[i])-(csum[i]-csum[0]));
}
cout<<min<<endl;
return 0;
} | #include <iostream>
#include <cstdlib>
#include <vector>
int main(void) {
int N;
int A;
int B;
int C;
int X;
int next_X;
int Y;
int next_Y;
int flame_num;
std::cin >> N;
while (N != 0) {
Y = -2;
flame_num = 0;
std::cin >> A >> B >> C >> X;
for (int i = 0; i < N; i++) {
std::cin >> next_Y;
if (next_Y == Y) {
flame_num++;
next_X = (A * X + B) % C;
X = next_X;
}
Y = next_Y;
while (Y != X) {
flame_num++;
next_X = (A * X + B) % C;
X = next_X;
if (flame_num > 10000) {
break;
}
}
}
if (flame_num > 10000) {
std::cout << "-1" << std::endl;
}
if (flame_num <= 10000) {
std::cout << flame_num << std::endl;
}
std::cin >> N;
}
return EXIT_SUCCESS;
} | 0 | 32,263,922 |
#include <iostream>
#include <algorithm>
#include <vector>
int main()
{
std::vector<int> Numbers;
for(std::size_t i = 0; i < 5; ++i){
int n;
std::cin >> n;
Numbers.push_back(n);
}
std::sort(Numbers.begin(), Numbers.end(), std::greater<int>());
for(std::size_t i = 0; i < Numbers.size(); ++i){
if(i) std::cout << " ";
std::cout << Numbers[i];
}
std::cout << std::endl;
return 0;
} | #include<cstdio>
#include<cstring>
int main(){
char s[100];
char p[99];
char ss[10000];
scanf("%s %s", s,p);
strcpy(ss,s);
strcat(ss,s);
if (strstr(ss, p)) printf("Yes\n");
else printf("No\n");
return 0;
} | 0 | 76,176,732 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int t, x;
cin >> t >> x;
double ans = (double)t / x;
printf("%.10f\n", ans);
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
#define endl "\n"
#define all(V) V.begin(),V.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
const int MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const int inf = 1 << 25;
constexpr long double pi = 3.141592653589793238462643383279;
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact_mod(ll n, ll mod) {
ll f = 1; for (int i = 2; i <= n; i++) f = f * (i % mod) % mod;
return f;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll keta(ll n) {
if (n == 0) return 1;
ll count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
ll mch(ll n) {
if (n == 1) return 1;
else return n * mch(n - 1);
}
ll powmod(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
ll inv_mod(ll a, ll mod) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= mod;
if (u < 0) u += mod;
return u;
}
bool is_prime(const unsigned n) {
switch (n) {
case 0:
case 1: return false;
case 2:
case 3: return true;
}
if (n % 2 == 0 || n % 3 == 0) return false;
for (unsigned i = 5; i * i <= n; i += 6) {
if (n % i == 0) return false;
if (n % (i + 2) == 0) return false;
}
return true;
}
int n, a[100010], x, ans;
int main(void) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > n) ++ans;
else ++a[x];
}
for (int i = 1; i <= n; ++i) {
if (a[i] == 0) continue;
if (a[i] < i) ans += a[i];
else if (a[i] > i) ans += a[i] - i;
}
cout << ans << endl;
return 0;
} | 0 | 95,522,657 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll MOD = pow(10, 9) + 7;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
ll sum = 0;
for (int i = 0; i < N; i++) {
ll cnt = 0;
for (int j = i + 1; j < N; j++) {
if (A[i] > A[j])
cnt++;
}
ll seq = ((1 + K) * K / 2) % MOD;
sum += (cnt * seq % MOD);
sum %= MOD;
}
for (int i = 1; i < N; i++) {
ll cnt = 0;
for (int j = i - 1; j > -1; j--) {
if (A[i] > A[j])
cnt++;
}
ll seq = (K * (K - 1) / 2) % MOD;
sum += (cnt * seq % MOD);
sum %= MOD;
}
sum %= MOD;
cout << sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%d",&a)
#define sff(a,b) scanf("%d%d",&a,&b)
#define sfff(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sffff(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define sl(a) scanf("%lld",&a)
#define sll(a,b) scanf("%lld%lld",&a,&b)
#define slll(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define sllll(a,b,c,d) scanf("%lld%lld%lld%lld",&a,&b,&c,&d)
#define sc(a) scanf("%c",&a)
#define sz(a) a.size()
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define faster ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pf printf
#define pf1(a) pf("%d\n",a);
#define PI acos(-1)
#define ll long long
#define ull unsigned long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define li list<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define mp map
#define nl cout<<endl
#define en pf("Entered\n")
#define en1 pf("Entered 2\n")
#define gcd(a,b) __gcd(a,b)
#define sp ' '
#define f0(a,n) for(int a=0;a<n;a++)
#define f1(a,n) for(int a=1;a<=n;a++)
#define MOD 1000000007
#define one cout<<"one"<<endl
#define two cout<<"two"<<endl
#define three cout<<"three"<<endl
#define four cout<<"four"<<endl
#define five cout<<"five"<<endl
#define six cout<<"six"<<endl
#define MAX 100000
int main()
{
faster
int t;
t=1;
while(t--)
{
int n;
cin>>n;
int arr[n*2];
f0(i,2*n)cin>>arr[i];
sort(arr,arr+2*n);
ll sum=0;
for(int i=0; i<2*n; i+=2)sum+=arr[i];
cout<<sum<<endl;
}
return 0;
} | 0 | 88,915,450 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string str;
while(cin>>str,str!="#"){
bool flag=true;
int co=0;
switch(str[0]){
case 'a':
case 'q':
case 'z':
case 'x':
case 's':
case 'w':
case 'e':
case 'd':
case 'c':
case 'v':
case 'f':
case 'r':
case 't':
case 'g':
case 'b':
flag=true;
break;
case 'n':
case 'h':
case 'y':
case 'u':
case 'j':
case 'm':
case 'k':
case 'i':
case 'o':
case 'l':
case 'p':
flag=false;
break;
}
for(int i=1;i<str.size();i++){
switch(str[i]){
case 'a':
case 'q':
case 'z':
case 'x':
case 's':
case 'w':
case 'e':
case 'd':
case 'c':
case 'v':
case 'f':
case 'r':
case 't':
case 'g':
case 'b':
if(flag==false){
co++;
}
flag=true;
break;
case 'n':
case 'h':
case 'y':
case 'u':
case 'j':
case 'm':
case 'k':
case 'i':
case 'o':
case 'l':
case 'p':
if(flag==true){
co++;
}
flag=false;
break;
}
}
cout<<co<<endl;
}
} | #include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <array>
#include <initializer_list>
#include <random>
#include <regex>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
using namespace std;
char col[4] = {'R', 'G', 'B', 'Y'};
char ans[1005][1005];
int h, w, d;
void fill_triangle(int cx, int cy, int dr, char cr)
{
for (int i = cx - d / 2 + 1; i < cx + d / 2; i++)
{
int R = d / 2 - abs(cx - i);
for (int j = 0; j < R; j++)
{
if (i >= 0 && i < h && cy + dr * j >= 0 && cy + dr * j < w)
ans[i][cy + dr * j] = cr;
}
}
}
int main()
{
scanf("%d%d%d",&h,&w,&d);
if (d & 1)
{
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
printf("%c", col[(i + j) & 1]);
}
printf("\n");
}
return 0;
}
else if (d % 4 == 2)
{
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
printf("%c", col[(j + i / 2 * 2) % 4]);
}
printf("\n");
}
return 0;
}
else
{
for (int i = d / 2 - 1; i < h + 2 * d; i += d)
{
for (int j = 0; j < w + 2 * d; j += d)
{
fill_triangle(i, j, 1, col[((i + j + d) / d) & 1]);
fill_triangle(i, j - 1, -1, col[((i + j + d) / d) & 1]);
}
}
for (int i = -1; i < h + 2 * d; i += d)
{
for (int j = d / 2; j < w + 2 * d; j += d)
{
fill_triangle(i, j, 1, col[(((i + j + d) / d) & 1) + 2]);
fill_triangle(i, j - 1, -1, col[(((i + j + d) / d) & 1) + 2]);
}
}
for (int i = 0; i < h; i++) printf("%s\n", ans[i]);
}
} | 0 | 77,098,450 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <climits>
#define DEBUG if(false)
using namespace std;
int main(){
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << abs(A[0] - A[1]) + abs(A[2] - A[1]) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.1415926535897932384626
#define bits(n) __builtin_popcount(n)
bool snuck[101];
void solve()
{
memset(snuck,false,sizeof(snuck));
int n,k;
cin>>n>>k;
for(int i=0;i<k;i++)
{
int d;
cin>>d;
for(int j=0;j<d;j++)
{
int a;
cin>>a;
snuck[a]=true;
}
}
int c=0;
for(int i=1;i<=n;i++)
{
if(!snuck[i])
c++;
}
cout<<c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
int t = 1;
while (t--)
{
solve();
}
return 0;
} | 0 | 79,992,502 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
int main(){
int len;
char s[1010];
while(1){
int ans=0;
scanf("%s",s);
len=strlen(s);
if(len==1 && s[0]=='0') break;
rep(i,0,len){
ans+=s[i]-'0';
}
printf("%d\n",ans);
}
return 0;
} | #include <bits/stdc++.h>
#define DEBUG_ENABLED 0
typedef long long int ll;
int main()
{
using namespace std;
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<pair<int, int>> ab;
for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
pair<int, int> p;
p = make_pair(a, b);
ab.push_back(p);
p = make_pair(b, a);
ab.push_back(p);
}
vector<int> order;
for (int i = 1; i <= N; i++)
{
order.push_back(i);
}
int counter = 0;
do
{
if (DEBUG_ENABLED)
{
for (int i = 0; i < N; i++)
cout << order.at(i);
cout << endl;
}
ll visited = 0L;
if (order.at(0) != 1)
{
if (DEBUG_ENABLED)
cout << "pass." << endl;
continue;
}
visited |= (1 << 1);
for (int i = 1; i <= N - 1; i++)
{
int from = order.at(i - 1);
int to = order.at(i);
if (DEBUG_ENABLED)
cout << "from:" << from << " to:" << to << endl;
bool found = false;
for (int i = 0; i < ab.size(); i++)
{
auto p = ab.at(i);
if (p.first == from && p.second == to)
{
found = true;
break;
}
}
if (found)
{
visited |= (1 << (to));
if (DEBUG_ENABLED)
cout << "marked:" << to << endl;
}
}
if (DEBUG_ENABLED)
{
cout << "visited:" << visited << " count:" << __builtin_popcount(visited) << endl;
}
if (__builtin_popcount(visited) == N)
{
++counter;
}
} while (next_permutation(order.begin(), order.end()));
cout
<< counter << endl;
return 0;
} | 0 | 49,281,852 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n, m;
cin >> n;
m = n + 1;
int a[m], b[n];
rep(i, m) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if(b[i] <= a[i]){
ans += b[i];
}
else{
ans += a[i];
b[i] -= a[i];
if(b[i] <= a[i + 1]){
ans += b[i];
a[i + 1] -= b[i];
}
else{
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
const int mod = 1e9 + 7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
using Point = complex<double>;
double dot(Point a, Point b) {return real(conj(a) * b);}
double cross(Point a, Point b) {return imag(conj(a) * b);}
int main() {
int n; cin >> n;
while (n--) {
double xa, ya, xb, yb, xc, yc, xd, yd;
cin >> xa >> ya >> xb >> yb >> xc >> yc >> xd >> yd;
if (abs(cross(Point(xa - xb, ya - yb), Point(xc - xd, yc - yd))) < 1e-12) {
cout << "YES" << endl;
} else cout << "NO" << endl;
}
} | 0 | 25,547,169 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
using P =pair<int,int>;
ll ketasu(ll a){
ll num=1;
while(a/10){
num++;
a/=10;
}
return num;
}
int main(){
ll n;
cin>>n;
string s;
cin>>s;
ll d=0;
rep(i,n-1){
if(s[i]==s[i+1])d++;
}
cout<<s.size()-d<<endl;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
map<int,int> ma;
int beki[200010];
int a[200010];
signed main(){
int n,p;cin>>n>>p;
string s;cin>>s;
int ans=0;
if(p==2 || p==5){
rep(i,n){
int t=s[i]-'0';
if(t%p==0)ans+=i+1;
}
cout<<ans<<endl;
return 0;
}
ma[0]++;
rep(i,n){
if(i==0)beki[i]=1;
else beki[i]=(10*beki[i-1])%p;
int t=s[n-1-i]-'0';
if(i==0)a[0]=t%p;
else {
a[i]=(a[i-1]+beki[i]*t)%p;
}
ma[a[i]]++;
}
for(auto ite=ma.begin();ite!=ma.end();ite++){
int po=ite->S;
ans+=po*(po-1)/2;
}
cout<<ans<<endl;
return 0;
} | 0 | 42,182,551 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<pair<ll, ll>> apple;
ll tmp;
rep(i, A) {
cin >> tmp;
apple.push_back(make_pair(tmp, 0));
}
rep(i, B) {
cin >> tmp;
apple.push_back(make_pair(tmp, 1));
}
rep(i, C) {
cin >> tmp;
apple.push_back(make_pair(tmp, 2));
}
sort(apple.begin(), apple.end(), greater<>());
ll ans = 0;
vector<int> MAX = {X, Y, 10000000};
vector<int> cnt(3, 0);
rep(i, A + B + C) {
pair<ll, ll> p = apple[i];
if (cnt[p.second] >= MAX[p.second]) continue;
++cnt[p.second];
ans += p.first;
if (cnt[0] + cnt[1] + cnt[2] == X + Y) break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#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 all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define yn(x, ok, ng) cout << ((x)?(ok):(ng)) << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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;}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int const INF = 1001001001;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s,t,u;
cin >> s >> t >> u;
yn(s[SZ(s)-1] == t[0] && t[SZ(t)-1] == u[0],"YES","NO");
return 0;
} | 0 | 87,453,622 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string S, T;
cin >> S >> T;
int A, B;
cin >> A >> B;
string U;
cin >> U;
if (U == S)
--A;
else
--B;
cout << A << " " << B << endl;
} | #include <stdio.h>
int main(){
int arr[3][3];
int arr1[3][3] = {};
int n;
for(int i = 0 ; i < 3 ; i++){
for(int j = 0 ; j < 3 ; j++){
scanf("%d", &arr[i][j]);
}
}
scanf("%d", &n);
int b[n];
for(int i = 0 ; i < n ; i++){
scanf("%d", &b[i]);
}
for(int i = 0 ; i < n ; i++){
if(b[i] == arr[0][0]){
arr1[0][0] += 1;
continue;
}
if(b[i] == arr[0][1]){
arr1[0][1] += 1;
continue;
}
if(b[i] == arr[0][2]){
arr1[0][2] += 1;
continue;
}
if(b[i] == arr[1][0]){
arr1[1][0] += 1;
continue;
}
if(b[i] == arr[1][1]){
arr1[1][1] += 1;
continue;
}
if(b[i] == arr[1][2]){
arr1[1][2] += 1;
continue;
}
if(b[i] == arr[2][0]){
arr1[2][0] += 1;
continue;
}
if(b[i] == arr[2][1]){
arr1[2][1] += 1;
continue;
}
if(b[i] == arr[2][2]){
arr1[2][2] += 1;
continue;
}
}
if(arr1[0][0] > 0 && arr1[0][1] > 0 && arr1[0][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][0] > 0 && arr1[1][1] > 0 && arr1[2][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[1][0] > 0 && arr1[1][1] > 0 && arr1[1][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[2][0] > 0 && arr1[2][1] > 0 && arr1[2][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][0] > 0 && arr1[1][0] > 0 && arr1[2][0] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][1] > 0 && arr1[1][1] > 0 && arr1[2][1] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][2] > 0 && arr1[1][2] > 0 && arr1[2][2] > 0){
printf("Yes\n");
return 0;
}
if(arr1[0][2] > 0 && arr1[1][1] > 0 && arr1[2][0] > 0){
printf("Yes\n");
return 0;
}
printf("No\n");
return 0;
} | 0 | 33,799,788 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define tt int t; cin>>t; while(t--)
#define lo(i,a,b) for(int i=a;i<b;i++)
#define rlo(i,n) for(int i=n-1;i>=0;i--)
#define be(a) (a).begin(),(a).end()
#define rbe(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a,b,sizeof(a))
#define pr(a) {for(auto x:a)cout<<x<<" ";cout<<nl;}
#define su ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define frac cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
void f()
{
ll n,m,x,y;
cin>>n>>m>>x>>y;
ll a[n+2],b[m+2];
a[0]=x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
b[0]=y;
for(int i=1;i<=m;i++)
{
cin>>b[i];
}
sort(a,a+n+1);
sort(b,b+m+1);
if(a[n]<b[0])
cout<<"No War\n";
else
cout<<"War\n";
}
int main()
{
su;
f();
return 0;
} | #include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n;cin>>n;int a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define outarr(a,n) for(int i=0;i<n;i++){cout<<a[i]<<" ";}
#define mod 1000000007
#define ff first
#define big 1e15
#define ss second
#define add push_back
#define remove pop_back
#define mapii map<int,int>
#define large *max_element
#define small *min_element
#define pqi priority_queue<int>
#define mpqi priority_queue<int,vector<int>,greater<int>>
#define in(n) int n;cin>>n;
#define w(t) int t;cin>>t;while(t--)
#define vi vector<int>
#define vivi vector<vector<int>>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>pbds;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output3.txt", "w", stdout);
#endif
in(k);
string s;
cin >> s;
if (s.size() <= k) {
cout << s;
} else {
for (int i = 0; i < k; i++) {
cout << s[i];
}
cout << "...";
}
} | 0 | 47,946,843 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001
int main(){
string S; cin >> S;
string ans;
for(int i=0; i<(int)S.size(); i++){
if(i==4) ans+=' ';
ans += S[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL<<60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << 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; }
int main(void){
ll N; cin >> N;
vector<ll> a(N), b(N); REP(i,N) cin >> a[i]; REP(i,N) cin >> b[i];
ll n1=0, n2=0;
REP(i,N){
if(a[i] > b[i]) n1 += a[i]-b[i];
else n2 += (b[i]-a[i])/2;
}
cout << (n1 <= n2 ? "Yes" : "No") << endl;
return 0;
} | 0 | 91,224,989 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll N;
cin >> N;
ll num = 0;
for(ll i = 1; i <= N; i++) {
if(to_string(i).size() % 2 == 1) {
num++;
}
}
cout << num << endl;
} | #include<iostream>
#include<string>
using namespace std;
long long pow(long long x,long long n){
long long re=1;
for(int i=0;i<n;i++)re*=x;
return re;
}
int main(){
int k=0;
while(k<10){
cout<<"? "<<pow(10,k+1)<<endl;
cout.flush();
string ans;
cin>>ans;
if(ans=="N")break;
k++;
}
if(k==10){
k=0;
while(k<10){
cout<<"? "<<2*pow(10,k)<<endl;
cout.flush();
string ans;
cin>>ans;
if(ans=="Y")break;
k++;
}
cout<<"! "<<pow(10,k)<<endl;
}
else{
long long l=pow(10,k),r=pow(10,k+1)-1;
while(r-l>0){
long long m=(r+l)/2;
cout<<"? "<<10*m<<endl;
cout.flush();
string ans;
cin>>ans;
if(ans=="Y")r=m;
else l=m+1;
}
cout<<"! "<<r<<endl;
}
cout.flush();
} | 0 | 38,937,948 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<int> x(n), y(m);
rep(i, 0, n) cin >> x[i];
rep(i, 0, m) cin >> y[i];
int x_max = *max_element(x.begin(), x.end());
int y_min = *min_element(y.begin(), y.end());
if (X < y_min && y_min <= Y && x_max < y_min)
cout << "No War" << endl;
else
cout << "War" << endl;
} | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int N=300+50;
const db pi=acos(-1.0);
#define lowbit(x) ((x)&(-x))
#define sqr(x) (x)*(x)
#define rep(i,a,b) for (register int i=a;i<=b;i++)
#define per(i,a,b) for (register int i=a;i>=b;i--)
#define go(u,i) for (register int i=head[u],v=sq[i].to;i;i=sq[i].nxt,v=sq[i].to)
#define fir first
#define sec second
#define mkp make_pair
#define pb push_back
#define maxd 998244353
#define eps 1e-8
inline int read()
{
int x=0,f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
inline ll readll()
{
ll x=0;int f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
int n,f[N<<1][N<<1];
char s[N][N],sq[N<<1][N<<1];
int main()
{
n=read();
rep(i,1,n) scanf("%s",s[i]+1);
rep(i,1,n*2) rep(j,1,n*2)
{
int x=i,y=j;
if (x>n) x-=n;
if (y>n) y-=n;
sq[i][j]=s[x][y];
}
int ans=0;
rep(i,1,n*2-1) rep(j,1,n*2-1)
{
int cnt=0,k=0;
while ((k<min(i,j)) && (sq[i][j-k]==sq[i-k][j])) k++;k--;
f[i][j]=1+min(f[i-1][j-1],k);
if (f[i][j]>=n) ans++;
}
printf("%d\n",ans);
return 0;
} | 0 | 90,065,593 |
#include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b) for(long long int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vlld vector<lld>
#define vi vector<int>
#define vch vector<char>
#define sll set<ll>
#define sch set<ch>
#define vpll vector< pair<ll,ll> >
#define vpii vector< pair<int,int> >
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mll map<ll, ll>
#define mcll map<char,ll>
#define sz(container) ll((container).size())
#define fill(a,b) memset(a, b, sizeof(a))
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
lld pi=3.1415926535897932;
const ll MOD=1e9+7;
const ll dx[4]={-1, 0, 1, 0} , dy[4]={0, 1, 0, -1};
const ll dxx[8]={-1, -1, 0, 1, 1, 1, 0, -1} , dyy[8]={0, 1, 1, 1, 0, -1, -1, -1};
ll lcm(ll a, ll b)
{
ll g=__gcd(a, b);
return a/g*b;
}
ll binpow(ll a, ll b,ll m)
{
a %= m;
ll res = 1;
while (b > 0)
{
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast_io;
ll T=1;
For(i,1,T)
{
ll n,m;cin>>n>>m;
vll a(n);
For(j,0,n-1) cin>>a[j],a[j]/=2;
ll least=a[0];
For(j,1,n-1)
{
least=lcm(least,a[j]);
}
if(least>m) cout<<"0";
else
{
ll ans=0,cnt=0;
For(j,0,n-1)
{
if((least/a[j])%2) cnt++;
}
if(cnt!=n)
{
cout<<"0";return 0;
}
for(ll j=least;j<=m;j+=2*least)
{
ans++;
}
cout<<ans;
}
}
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,h;
cin >> n >> h;
vll a(n),b(n);
ll amax = 0;
REP(i,n){
cin >> a[i] >> b[i];
amax = max(amax,a[i]);
}
sort(rALL(b));
ll ans = 0;
REP(i,n){
if(h<=0) break;
if(b[i]<amax) break;
h-=b[i];
ans++;
}
if(h>0){
ans += (h-1)/amax+1;
}
cout << ans << endl;
return 0;
} | 0 | 100,505,255 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> h(n);
for(int i=0; i<n; i++) cin >> h[i];
int est = h[0];
int ans = 1;
for(int i=1; i<n; i++){
if(est <= h[i]){
est = h[i];
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Atack {
int power;
int magic;
};
int main() {
int H, N;
cin >> H >> N;
vector<Atack> atack(N);
int A, B;
for (int i = 0; i < N; i++) {
cin >> atack[i].power;
cin >> atack[i].magic;
}
long dp[H+1];
for (int i = 1; i <= H; i++) {
dp[i] = 1e13;
for (int j = 0; j < N; j++) {
if (atack[j].power >= i) {
dp[i] = min((long)atack[j].magic, dp[i]);
} else {
dp[i] = min(dp[i - atack[j].power] + atack[j].magic, dp[i]);
}
}
}
cout << dp[H];
} | 0 | 42,450,342 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
int total = k;
int mn = total;
for(int i=1; i<n; i++){
mn = min(mn,total-(arr[i]-arr[i-1]));
}
mn = min(mn,total-(k-arr[n-1])-arr[0]);
cout<<mn;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long int
#define pll pair<int , int>
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define pii 3.14159265358979323
#define inf LLONG_MAX
#define ones(x) __builtin_popcount(x)
#define fill(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
#define hell 998244353
ll mod_pow(ll a,ll b,ll m)
{
ll res = 1;
while(b)
{
if(b&1)
{
res=(res*a) % m;
}
a=(a*a) % m;
b>>=1;
}
return res;
}
ll mod_inverse(ll a)
{
return mod_pow(a , mod-2 , mod);
}
void solve() {
int n , d;
cin >> n >> d;
int a[n][d];
for(int i = 0; i < n; ++i) {
for(int j = 0; j < d; ++j) {
cin >> a[i][j];
}
}
int ans = 0;
for(int i = 0; i < n; ++i) {
for(int j = i+1; j < n; ++j) {
int res = 0;
for(int z = 0; z < d; ++z) {
res += (a[i][z] - a[j][z])*(a[i][z] - a[j][z]);
}
int p = sqrt(res);
if(p*p == res) {
ans++;
}
}
}
cout << ans;
}
signed main() {
fast;
int t = 1;
while(t--) {
solve();
}
return 0;
} | 0 | 46,555,245 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define db double
#define mod 1000000007
#define pb push_back
#define pp pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repe(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=b;i>=a;i--)
#define maxn 100005
#define ss second
#define ff first
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int inv(int a, int b){
return 1<a ? b - inv(b%a,a)*b/a : 1;
}
int n,dp[105][maxn],k;
void solve()
{
cin >> n >> k;
vector<int> v(n);
for(auto &x:v)
cin >> x;
for(int i=0;i<maxn;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<=k;j++)
{
dp[i][j] = dp[i-1][j];
if(v[i-1] < j)
dp[i][j] -= dp[i-1][j-v[i-1]-1];
dp[i][j] = (mod+dp[i][j])%mod;
}
if(i == n)
{
cout << dp[n][k];
return;
}
for(int j=1;j<=k;j++)
dp[i][j] = (dp[i][j]+dp[i][j-1])%mod;
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
while(t--)
solve();
return 0;
} | #include <iostream>
#include <cstring>
using namespace std;
int a, b;
bool con[20][20];
int memo[20][20];
inline bool inside(int y, int x) {
return 0 <= y && y < b && 0 <= x && x < a;
}
int dfs(int y = 0, int x = 0) {
if (!inside(y, x)) return 0;
if (con[y][x]) return 0;
if (y == b - 1 && x == a - 1) return 1;
if (~memo[y][x]) return memo[y][x];
return memo[y][x] = dfs(y + 1, x) + dfs(y, x + 1);
}
int main() {
while (cin >> a >> b, a || b) {
memset(memo, -1, sizeof(memo));
memset(con, false, sizeof(con));
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
con[y - 1][x - 1] = true;
}
cout << dfs() << endl;
}
} | 0 | 7,640,724 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <stdio.h>
#include <string>
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main()
{
vector<int> intArray(3);
for (int i = 0; i < 3; i++)
{
cin >> intArray[i];
}
sort(intArray.begin(),intArray.end());
vector<string> strArray(3);
for (int i = 0; i < 3; i++)
{
strArray[i] = std::to_string(intArray[i]);
}
string str2 = strArray[2] + strArray[1];
int num1 = atoi(str2.c_str());
int num2 = atoi(strArray[0].c_str());
cout << num1+num2<< endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int S;
cin >> S;
int A, B, C, D;
A = S / 1000;
B = (S - A*1000) / 100;
C = (S - A*1000 - B*100) / 10;
D = (S - A*1000 - B*100 - C*10);
vector<string> vec(3);
vector<int> N = {B, C, D};
for(int i = 0; i < 8; i++){
int num = A;
for(int j = 0; j < 3; j++){
if(((i >> j) & 1) == 1){
vec.at(j) = "+";
num += N.at(j);
}else{
vec.at(j) = "-";
num -= N.at(j);
}
}
if(num == 7){
cout << A << vec.at(0) << B << vec.at(1) << C << vec.at(2) << D << "=7" << endl;
return 0;
}
}
} | 0 | 98,194,893 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string S, T;
cin >> S;
cin >> T;
int S_l = S.length(), T_l = T.length();
int roop = S_l - T_l + 1;
int ans = T_l;
for (int i = 0; i < roop; ++i){
int count = 0;
for (int j = 0; j < T_l; ++j){
if (S[i + j] == T[j]){
} else{
count += 1;
}
}
ans = (ans > count ? count : ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
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; }
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
const int MOD = 1000000007;
struct UnionFind {
vector<int> d;
UnionFind(int N=0) : d(N, -1){}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x,y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x){
return -d[find(x)];
}
};
int main(){
int N,M; cin >> N >> M;
vector<int> p(N);
rep(i,N) cin >> p[i];
UnionFind uf(N+1);
vector<vector<int>> edges(N);
rep(i,M){
int x, y; cin >> x >> y;
uf.unite(x, y);
}
int ans = 0;
rep(i,N){
if (uf.same(i+1, p[i])) ans++;
}
cout << ans << endl;
} | 0 | 97,111,988 |
#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 main() {
string S, T;
cin >> S >> T;
cout << T << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, std::vector<long long> A) {
ll ans = 0;
for (ll i = 0; i < N; i++) {
for (ll j = i + 1; j < N; j++) {
ans = max(ans, abs(A[i] - A[j]));
}
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
} | 0 | 66,673,271 |
#include <bits/stdc++.h>
using namespace std;
int count_lighting_bulb(int M, const vector<int> &p_vec,
const vector<bitset<10>> &connected, const bitset<10> &switches)
{
int cnt = 0;
for (int i = 0; i < M; ++i) {
int num_valid_switches = (connected.at(i) & switches).count();
if (num_valid_switches % 2 == p_vec.at(i))
++cnt;
}
return cnt;
}
int main()
{
int N, M;
cin >> N >> M;
vector<int> p_vec(M);
vector<bitset<10>> connected(M, 0);
int k, s;
for (int i = 0; i < M; ++i) {
cin >> k;
for (int j = 0; j < k; ++j) {
cin >> s;
--s;
connected.at(i).set(s);
}
}
for (int i = 0; i < M; ++i)
cin >> p_vec.at(i);
int cnt = 0;
for (int i = 0; i < (1 << N); ++i) {
bitset<10> switches(i);
int num = count_lighting_bulb(M, p_vec, connected, switches);
if (num == M)
++cnt;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
int N, K; cin >> N >> K;
string S; cin >> S;
vector<int> tmp; int cnt = 0;
if(S[0] == '0') tmp.push_back(0);
REP(i, N) {
cnt++;
if(S[i] != S[i + 1]) {
tmp.push_back(cnt);
cnt = 0;
}
}
if(S[N - 1] == '0') tmp.push_back(0);
vector<int> res(tmp.size() + 1, 0);
REP(i, tmp.size()) res[i + 1] = res[i] + tmp[i];
int ans = 0;
for(int i = 0; i < res.size(); i = i + 2) {
int right = i + (2 * K + 1);
if(right >= res.size()) right = res.size() - 1;
ans = max(ans, (res[right] - res[i]) );
}
cout << ans << endl;
} | 0 | 70,434,279 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<set<int>> light_bulbs(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
light_bulbs.at(i).insert(s);
}
}
vector<int> p(m);
for (int i = 0; i < m; i++) {
cin >> p.at(i);
}
int ans = 0;
for (int tmp = 0; tmp < (1 << n); tmp++) {
vector<set<int>> copied = light_bulbs;
for (int i = 0; i < n; i++) {
if (tmp & (1 << i)) {
continue;
} else {
for (int j = 0; j < m; j++) {
copied.at(j).erase(i);
}
}
}
bool ok = true;
for (int i = 0; i < m; i++) {
if ((int)copied.at(i).size() % 2 != p.at(i)) {
ok = false;
break;
}
}
if (ok) { ans++; }
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
string s;
cin >> s;
int dp[3] = {};
rep0(i,3){
if(s[i]=='a'){
dp[0]++;
}else if (s[i]=='b')
{
dp[1]++;
}else{
dp[2]++;
}
}
rep0(i,3){
if(dp[i]!=1){
cout << "No" << endl;
return 0 ;
}
}
cout << "Yes" << endl;
} | 0 | 37,846,002 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 998244353
int main(){
string s,t;
cin >> s >> t;
rep(i,s.size()){
char moji = s.at(s.size()-1);
for(int j=s.size()-1;j>0;j--){
s.at(j) = s.at(j-1);
}
s.at(0) = moji;
if(s==t){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, tenant[4][3][10]{};
int b, f, r, v;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> b >> f >> r >> v;
tenant[b - 1][f - 1][r - 1] += v;
}
for (int i = 0; i < 4 - 1; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
cout << " " << tenant[i][j][k];
}
cout << endl;
}
cout << "####################" << endl;
}
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
cout << " " << tenant[3][j][k];
}
cout << endl;
}
return 0;
} | 0 | 20,505,411 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k > (n - 1) * (n - 2) / 2) cout << -1;
else {
k = (n - 1) * (n - 2) / 2 - k;
cout << n - 1 + k << '\n';
for (int i = 2; i <= n; i++) cout << 1 << ' ' << i << '\n';
for (int i = 2; i <= n; i++) {
for (int j = 2; j < i; j++) {
cout << j << ' ' << i << '\n';
k--;
if (!k) break;
}
if (!k) break;
}
}
} | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N{};
cin >> N;
vector<int> num(N);
for (size_t i = 0;i < N;++i) {
cin >> num.at(i);
}
size_t i = 0,j=N-1;
int left = num.at(i), right = num.at(j);
while (i!=j) {
if (left >= right) {
j--;
if (i == j) {
break;
}
else {
right += num.at(j);
}
}
else if(left < right){
i++;
if (i == j) {
break;
}
else {
left += num.at(i);
}
}
if (i == j) {
break;
}
}
cout << abs(right - left);
} | 0 | 44,348,887 |
#include <stdio.h>
int kuadrat(int a, int b)
{
int total = 1;
while(b > 0){
total *= a;
b--;
}
return total;
}
int main()
{
int cases;
scanf("%d", &cases);
long long int arr[cases], total = 1;
int i = 0;
char temp;
do
{
scanf("%lld%c", &arr[i], &temp);
if(arr[i] == 0){
printf("0");
return 0;
}
i++;
} while (temp != '\n');
for(int j = 0; j < cases; j++){
if (total > 1000000000000000000 / arr[j])
{
printf("-1");
return 0;
}
else
{
total *= arr[j];
}
}
printf("%lld", total);
return 0;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define xx first
#define yy second
#define sci(n) scanf("%d",&n)
#define scii(n,m) scanf("%d%d",&n,&m)
#define sciii(n,m,w) scanf("%d%d%d",&n,&m,&w)
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld%lld",&n,&m)
#define sclll(n,m,w) scanf("%lld%lld%lld",&n,&m,&w)
#define pf(a) printf("%d\n",a)
#define CASE(a) printf("Case %d: ",a)
#define endl '\n'
#define READ freopen("input.txt","r",stdin)
#define WRITE freopen("output.txt","w",stdout);
#define PI acos(-1)
#define mem(a,b) memset(a,b,sizeof(a))
#define SQR(a) (a)*(a)
#define all(v) v.begin(),v.end()
#define pb push_back
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define inf INT_MAX
#define eps 1e-9
using namespace __gnu_pbds;
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(string x){cerr<<x;return *this;}
Gene c, class d >Rics(pair<c, d> x){ return *this,"(",x.first,", ",x.second,")";}
Gene ... d, Gene ...> class c >Rics(c<d...> x){ return *this, range(begin(x), end(x));}
Gene c >Rics(rge<c> x){
*this,"["; for(auto it = x.b; it != x.e; ++it)
*this,(it==x.b?"":", "),*it; return *this,"]";}
};
#define debug() cerr<<"LINE "<<__LINE__<<" >> ", printer()
#define dbg(x) "[",#x,": ",(x),"] "
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int my_rand(int l, int r) {
return uniform_int_distribution<int>(l, r) (rng);
}
template <typename T> T BigMod (T b,T p,T m){if (p == 0) return 1;if (p%2 == 0){T s = BigMod(b,p/2,m);return ((s%m)*(s%m))%m;}return ((b%m)*(BigMod(b,p-1,m)%m))%m;}
template <typename T> T ModInv (T b,T m){return BigMod(b,m-2,m);}
template <typename T> T POW(T B,T P){ if(P==0) return 1; if(P&1) return B*POW(B,P-1); else return SQR(POW(B,P/2));}
template <typename T> T Dis(T x1,T y1,T x2, T y2){return sqrt( SQR(x1-x2) + SQR(y1-y2) );}
template <typename T> T Angle(T x1,T y1,T x2, T y2){ return atan( double(y1-y2) / double(x1-x2));}
template <typename T> T gcd(T a,T b){if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a,T b) {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
template <typename T> T euclide(T a,T b,T &x,T &y) {if(a<0){T d=euclide(-a,b,x,y);x=-x;return d;} if(b<0){T d=euclide(a,-b,x,y);y=-y;return d;} if(b==0){x=1;y=0;return a;}else{T d=euclide(b,a%b,x,y);T t=x;x=y;y=t-(a/b)*y;return d;}}
template <typename T> void ia (T a[],int n){for (int i=0; i<n; i++) cin >> a[i];}
template <typename T> void pa (T a[],int n){for (int i=0; i<n-1; i++) cout << a[i] << " ";cout << a[n-1] << endl;}
template <typename T> ll isLeft(T a,T b,T c) { return (a.x-b.x)*(b.y-c.y)-(b.x-c.x)*(a.y-b.y);}
template<typename T>
using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define mxn 100005
int dp[2][mxn];
int add(int a , int b){
a += b;
while(a >= mod) a -= mod;
return a;
}
int sub(int a , int b){
a -= b;
a += mod;
while(a >= mod) a -= mod;
return a;
}
void solve(){
int n , k;
cin >> n >> k;
vector<int> fr(n + 5);
for(int i = 1;i <= n;i++) cin >> fr[i];
dp[(n + 1)&1][0] = 1;
for(int i = n;i >= 1;i--){
vector<int> cum(k + 5);
cum[0] = dp[(i + 1)&1][0];
dp[i&1][0] = 0;
for(int j = 1;j <= k;j++)dp[i&1][j] = 0 , cum[j] = add(cum[j - 1] , dp[(i + 1)&1][j]);
for(int s = 0;s <= k;s++){
int l = max(s - fr[i] , 0);
int r = s;
if(l != 0)dp[i&1][s] = add(dp[i&1][s] , sub(cum[r] , cum[l - 1]));
else dp[i&1][s] = add(dp[i&1][s] , cum[r]);
}
}
cout << dp[1][k] << endl;
}
int main(){
int T = 1;
while(T--){
solve();
}
return 0;
} | 0 | 30,915,434 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define foi(i,k,n) for(int i=(k); i<(int)(n); i+=1)
#define fod(i,n,k) for(int i=k; i>=(int)n; i-=1)
#define fast_io ios_base::sync_with_stdio(false) , cin.tie(NULL);
#define all(x) x.begin(), x.end()
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define endl "\n"
#define int long long
#define INF 0x3f3f3f3f
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define fir first
#define sec second
#define pb push_back
#define mp make_pair
typedef long long llint;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<llint> VL;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int,int> MII;
typedef set<int> SI;
string tostr(int n) {stringstream rr;rr<<n;return rr.str();}
llint toint(string s) {stringstream ss(s); llint x; ss >> x; return x;}
void solve(){
int h, w, k, ans = 0;
cin >> h >> w >> k;
char mat[h][w];
loop(i, h) loop(j, w) cin >> mat[i][j];
for(int i = 0; i < (1 << (h + w)); ++i){
int mask = i;
set <int> r, c;
int rc = 0, cc = 0;
while(mask && (rc < h)){
if((mask&1)){
r.insert(rc);
}
mask >>= 1;
rc++;
}
while(mask && (cc < w)){
if((mask&1)){
c.insert(cc);
}
mask >>= 1;
cc++;
}
int count = 0;
loop(x, h){
loop(y, w){
if(r.count(x)) continue;
if(c.count(y)) continue;
count += (mat[x][y] == '#');
}
}
if(count == k) {
ans++;
}
}
cout << ans;
}
int32_t main() {
fast_io;
int t = 1;
while(t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<int> sx(n); vector<int> sy(n);
vector<int> cx(m); vector<int> cy(m);
for (int i=0; i<n; i++) cin >> sx.at(i) >> sy.at(i);
for (int i=0; i<m; i++) cin >> cx.at(i) >> cy.at(i);
for (int i=0; i<n; i++) {
int d=1000000009,tmp=0,ans=0;
for (int j=0; j<m; j++) {
tmp = abs(sx.at(i)-cx.at(j)) + abs(sy.at(i)-cy.at(j));
if (d>tmp) {
d = tmp;
ans = j+1;
}
}
cout << ans << endl;
}
return 0;
} | 0 | 51,012,226 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n;
cin>>n;
if(n%2==0)cout<<n/2-1;
else cout<<n/2;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define no cout << "no" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define AC cout << "AC" << endl;
#define WA cout << "WA" << endl;
#define out(s) cout << s << endl;
#define ll long long
#define ull unsigned long long
#define vi vector<int>
const double PI = 3.14159265358979323846;
int main() {
string S;
int cnt = 0;
cin >> S;
if (S[0] == 'A') {
S.erase(0, 1);
for (int i = 1; i < S.size() - 1; i++) {
if (S[i] == 'C') {
cnt++;
S.erase(i, 1);
}
}
if (cnt == 1) {
bool flag = true;
for (int i = 0; i < S.size(); i++) {
if (S[i] >= 'A' && S[i] <= 'Z') {
flag = false;
}
}
if (flag) {
AC;
return 0;
}
}
}
WA;
} | 0 | 59,273,315 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char x,y;
cin>>x>>y;
if(x<y) cout<<"<"<<endl;
else if(x==y) cout<<"="<<endl;
else cout<<">"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll H, W, ans=0, tmp=0;
queue<pair<ll,ll>> Q;
vector<vector<ll>> color;
void bfs() {
while(!Q.empty()) {
pair<ll,ll> p = Q.front();
Q.pop();
if(p.first+1<H&&color[p.first+1][p.second]==-1) {
color[p.first+1][p.second]=color[p.first][p.second]+1;
Q.push(make_pair(p.first+1,p.second));
ans = max(ans,color[p.first][p.second]+1);
}
if(p.first-1>=0&&color[p.first-1][p.second]==-1) {
color[p.first-1][p.second]=color[p.first][p.second]+1;
Q.push(make_pair(p.first-1,p.second));
ans = max(ans,color[p.first][p.second]+1);
}
if(p.second+1<W&&color[p.first][p.second+1]==-1) {
color[p.first][p.second+1]=color[p.first][p.second]+1;
Q.push(make_pair(p.first,p.second+1));
ans = max(ans,color[p.first][p.second]+1);
}
if(p.second-1>=0&&color[p.first][p.second-1]==-1) {
color[p.first][p.second-1]=color[p.first][p.second]+1;
Q.push(make_pair(p.first,p.second-1));
ans = max(ans,color[p.first][p.second]+1);
}
}
}
signed main(){
cin >> H >> W;
color.resize(H);
for(int i=0;i<H;i++) {
for(int j=0;j<W;j++) {
color[i].push_back(-1);
}
}
for(int i=0;i<H;i++) {
for(int j=0;j<W;j++) {
char c;
cin >> c;
if(c=='#') {
Q.push(make_pair(i,j));
color[i][j]=0;
}
}
}
bfs();
cout << ans << endl;
return 0;
} | 0 | 15,266,244 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>
using namespace std;
typedef pair<int, int> Pi;
typedef long long ll;
#define pii Pi
#define pll PL
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> PL;
typedef long double ldouble;
vector <int> E[100010];
int vis[100010];
int color[100010];
int dfs(int x, int c){
int res = 1;
vis[x] = 1, color[x] = c;
for(int e : E[x]){
if(vis[e] == 0)res &= dfs(e, 3-c);
else if(color[e] != 3 - c)res = 0;
}
return res;
}
int deg[100010];
void solve(){
int n, m; cin >> n >> m;
ll ans = 0;
rep(i, m){
int x, y; scanf("%d%d", &x, &y);
E[x].pb(y);
E[y].pb(x);
deg[x]++, deg[y]++;
}
int a = 0, b = 0;
for(int i=1;i<=n;i++)if(deg[i] > 0 && !vis[i]){
++a;
b += dfs(i, 1);
}
ans = (ll)n * n;
int c = 0;
for(int i=1;i<=n;i++)if(deg[i] > 0)++c;
ans -= (ll)c * c;
ans += (ll)a * a + (ll)b * b;
printf("%lld\n", ans);
}
int main(){
int Tc = 1;
for(int tc=1;tc<=Tc;tc++){
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define endl '\n'
#define F first
#define S second
typedef pair<int,int> pii;
typedef long long ll;
void A(){
}
int main(){
int n; cin>>n;
int arr[n]; cin>>arr[0];
for(int i=1; i<n; i++){
cin>>arr[i];
arr[i]+=arr[i-1];
}
int ans = 1e6;
for(int i=0; i<n-1; i++){
ans=min(ans, abs(arr[i] - (arr[n-1]-arr[i])));
}
cout<<ans<<endl;
} | 0 | 92,852,702 |
#include<bits/stdc++.h>
#define mod 1000000007
#define int long long int
#define phi 1.6180339
#define rep(i,n) for(auto i=0;i<(n);i++)
#define endl "\n"
#define For(i,a,b) for(auto i=(a);i<(b);i++)
#define op1 cin.tie(NULL)
#define op2 cout.tie(NULL)
#define op3 std::ios_base::sync_with_stdio(false)
#define MAXX 1000001
using namespace std;
int arr[MAXX];
void trozen()
{
int a,b,c;
cin>>a>>b>>c;
int emptya=a-b;
c-=emptya;
if(c<0)
c=0;
cout<<c<<endl;
}
int32_t main()
{
op1;op2;op3;
trozen();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int len;
cin >> len;
int A = 0, B = 0, C = 0;
for(int i = 0; i < len; i++) {
int a, b, c;
cin >> a >> b >> c;
long long dist = abs(b - B) + abs(c - C);
int time = abs(a - A);
if(time < dist || (time > dist && time % 2 != dist % 2)) {
cout << "No";
return 0;
}
A = a;
B = b;
C = c;
}
cout << "Yes";
} | 0 | 60,305,318 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
map<ll,int> A;
REP(i,N){
int a; cin >> a;
A[a]++;
}
ll max1 = 0;
ll max2 = 0;
for(auto a: A){
if(a.second>=2 && a.second<4){
max2 = max1;
max1 = a.first;
}else if(a.second>=4){
max1 = a.first;
max2 = a.first;
}
}
cout << max1*max2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const int MOD=1000000007;
int INF=100100100100100;
int a[100010];
int b[100010];
ivec pos;
int neg;
signed main(){
int n;cin>>n;
int sum=0;
int ans=0;
rep(i,n)cin>>a[i];
rep(i,n){
cin>>b[i];
sum+=a[i]-b[i];
if(a[i]-b[i]<0){
neg+=b[i]-a[i];
ans++;
}
else if(a[i]-b[i]>0)pos.pb(a[i]-b[i]);
}
if(sum<0){
cout<<-1<<endl;
return 0;
}
if(neg==0){
cout<<0<<endl;
return 0;
}
sort(all(pos),greater<int>());
int ima=0;
for(ima=0;neg>0;ima++){
neg-=pos[ima];
}
ans+=ima;
cout<<ans<<endl;
return 0;
} | 0 | 88,056,931 |
#include <bits/stdc++.h>
#define vi vector<int>
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define ii pair<int,int>
#define qu queue <int>
#define qmax priority_queue <int>
#define qmin priority_queue <int, vector<int>,greater<int>>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin>>a>>b;
cout<<((a<=8 && b<=8) ? "Yay!" : ":(")<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
map<ll, ll> idx;
rep(i, n) idx[a[i]] = i;
sort(all(a));
ll cnt = 0;
rep(i, n) {
if (abs(i - idx[a[i]]) % 2 != 0) cnt++;
}
cout << (cnt / 2) << endl;
return 0;
} | 0 | 29,999,018 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<memory.h>
using namespace std;
int dp[1001][1001];
int n;
int solve(string a,string b)
{
int len1=a.size(),len2=b.size();
for(int i=0;i<=len1;i++)
dp[i][0]=i;
for(int j=0;j<=len2;j++)
dp[0][j]=j;
for(int i=1;i<=len1;i++)
for(int j=1;j<=len2;j++)
if(a[i-1]==b[j-1])
dp[i][j]=dp[i-1][j-1];
else
dp[i][j]=min(dp[i-1][j]+1,min(dp[i-1][j-1]+1,dp[i][j-1]+1));
return dp[len1][len2];
}
int main()
{
string a,b;
cin>>a>>b;
cout<<solve(a,b)<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, X;
vector<ll>a, p;
ll f(ll L, ll X) {
if (L == 0) {
if (X <= 0) return 0;
return 1;
}
ll mid = (a[L] + 1) / 2;
if (mid < X) {
return p[L - 1] + 1 + f(L - 1, X - mid);
} else if (mid == X) {
return p[L - 1] + 1;
} else {
return f(L - 1, X - 1);
}
}
int main() {
cin >> N >> X;
a.resize(N + 1);
p.resize(N + 1);
a[0] = 1;
p[0] = 1;
for (int i = 0; i < N; i++) {
a[i + 1] = 2 * a[i] + 3;
p[i + 1] = 2 * p[i] + 1;
}
ll ans = f(N, X);
cout << ans << endl;
} | 0 | 68,130,175 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 10000;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define ceiv(a, b) ((int)((a) + (b) - 1)/(int)(b))
int gcd(int x,int y){if(y==0) return x; return gcd(y, x%y);}
int lcm(int x,int y){return x/gcd(x,y)*y;}
signed main() {
int r; cin >> r;
cout << r*r << endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<bits/stdc++.h>
using std::string;
int main()
{
int N;
std::cin >> N;
int arr[2 * N];
for(int i = 0; i < 2 * N; i++)
{
std::cin >> arr[i];
}
int n = sizeof(arr)/sizeof(arr[0]);
std::sort(arr, arr + n);
int ans = 0;
for(int i = 0; i < 2 * N; i++)
{
if(i % 2 == 0)
{
ans += arr[i];
}
}
std::cout << ans << '\n';
} | 0 | 44,445,010 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i,s,n) for (int i = (s); i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
int K;
cin >> N >> K;
int A[N];
for(int i = 0; i < N; i++){
cin >> A[i];
}
cout << ((N-1) + (K-1) - 1) / (K-1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, a[100];
int cnt[100] = {0};
cin >> n;
int mn = n, mx = 0;
for(int i=0;i<n;++i){
cin >> a[i];
mn = min(mn, a[i]);
mx = max(mx, a[i]);
++cnt[a[i]];
}
if(mx % 2){
if(cnt[mn] != 2) goto l_ng;
for(int i=mn+1;i<=mx;++i){
if(cnt[i] == 0) goto l_ng;
}
goto l_ok;
}else{
if(cnt[mn] != 1) goto l_ng;
for(int i=mn+1;i<=mx;++i){
if(cnt[i] == 0) goto l_ng;
}
goto l_ok;
}
l_ng:
cout << "Impossible" << endl;
return 0;
l_ok:
cout << "Possible" << endl;
return 0;
} | 0 | 42,946,576 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 1000000007;
int test[12345678][2], aa[1234][1234], bb[1234][1234];
signed main() {
int n, m = 0, k, z = 0, cnt = 1, ans = 0;
cin >> n >> k;
if (k > (n - 1)* (n - 2) / 2) { cout << -1 << endl; return 0; }
for (int h = 2; h <= n; h++) {
test[m][0] = 1; test[m][1] = h; m++;
}
cnt = (n - 1) * (n - 2) / 2 - k;
for (int h = 2; h <= n; h++) {
for (int i = h + 1; i <= n; i++) {
if (cnt == 0) { z++; break; }
test[m][0] = h; test[m][1] = i; m++; cnt--;
}
if (z == 1) { break; }
}
cout << m << endl;
for (int h = 0; h < m; h++) {
cout << test[h][0] << ' ' << test[h][1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
vector<pair<int64, int64>> prime_factorize(int64 N) {
vector<pair<int64, int64>> res;
for (int64 a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
int64 ex = 0;
while(N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
void solve() {
int N; cin >> N;
int ans = 0;
for (int i = 1; i <= N; i+=2) {
vector<pair<int64, int64>> ret_pair = prime_factorize(i);
int64 tmp = 1;
for (auto p: ret_pair) {
tmp *= p.second + 1;
}
if (tmp == 8) ans++;
}
cout << ans << endl;
return;
}
int main() {
solve();
return 0;
} | 0 | 89,877,474 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LINF 1e18
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define VPII vector<PII>
int N;
VI H;
VI cost;
int dp(int n){
if(cost[n] != -1){
return cost[n];
}
return cost[n] = min(dp(n-1)+abs(H[n]-H[n-1]),dp(n-2)+abs(H[n]-H[n-2]));
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(11);
cerr << fixed << setprecision(6);
cin >> N;
H.assign(N,-1);
cost.assign(N,-1);
R(i,N) cin >> H[i];
cost[0] = 0;
cost[1] = abs(H[0]-H[1]);
dp(N-1);
cout << to_string(cost[N-1]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll N;
cin >> N;
vector<ll> a(N);
vector<ll> b(N);
REP(i, N){
cin >> a[i];
}
REP(i, N){
cin >> b[i];
}
ll plus = 0;
ll minus = 0;
REP(i, N){
if(b[i]-a[i] > 0){
plus += (b[i]-a[i])/2;
}
else{
minus += a[i]-b[i];
}
}
if(plus >= minus){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | 0 | 76,530,465 |
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int total = 0;
for (int n=1; n<=N; ++n) {
int r = n;
int sub = 0;
while (r != 0) {
sub += r % 10;
r /= 10;
}
if (((A <= sub) && (sub <= B))) {
total += n;
}
}
cout << total << endl;
} | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
int ans = 0;
REP(i,n){
int mi = i;
int j=i;
while (j<n){
if (a[j]<a[mi])
mi=j;
j++;
}
if (mi!=i){
swap(a[i],a[mi]);
ans++;
}
}
REP(i,n){
cout << a[i];
if (i<n-1)
cout << " ";
else
cout << endl;
}
cout << ans << endl;
return 0;
} | 0 | 36,910,561 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
const int M = 1000005;
int main() {
int x;
cin >> x;
int zy = x / 100;
int per = x % 100;
int cnt = zy;
for(int i = 5; i >= 0; i--){
if(per == 0){
break;
}
if(per % i == 0){
cnt = per / i;
per %= i;
}
}
if(cnt != 0 && zy >= cnt){
cout << 1 << endl;
}else{
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define es erase
#define in insert
#define pii pair<ll, ll>
#define ll long long
#define lb long double
#define ioss \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define m_p(i, j) make_pair(i, j)
#define mem(a, x) memset(a, x, sizeof(a))
#define endl "\n"
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll maxn = 6e5 + 7;
ll n, fa[maxn], m, num[maxn];
ll ifind(ll x)
{
if (x == fa[x])
return x;
return fa[x] = ifind(fa[x]);
}
ll cmb(ll x, ll y)
{
ll fx = ifind(x), fy = ifind(y);
if (fx != fy) {
fa[fx] = fy;
num[fy] += num[fx];
}
return 0;
}
int main()
{
cin >> n >> m;
for (ll i = 1; i <= n; i++) {
fa[i] = i;
num[i] = 1;
}
for (ll i = 1; i <= m; i++) {
ll x, y;
cin >> x >> y;
cmb(x, y);
}
cout << *max_element(num + 1, num + 1 + n) << endl;
} | 0 | 43,846,941 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
char c[1200];
fgets(c,1200,stdin);
for (int i = 0;i<1200;i++){
if (c[i] == '\n') break;
if (islower(c[i])) c[i] = toupper(c[i]);
else if (isupper(c[i])) c[i] = tolower(c[i]);
printf("%c",c[i]);
}
printf("\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
char ch[4];
cin>>ch;
sort(ch,ch+4);
if((ch[0]==ch[1])&&(ch[1]!=ch[2])&&(ch[2]==ch[3]))
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
} | 0 | 30,631,359 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
vector<ll> a(n);
ll mx = -1;
for(int i = 0; i < n; i++){
cin >> a[i];
mx = max(mx,a[i]);
}
int loga = 0;
while((1ll << loga) < mx) loga++;
vector<int> bit(loga,0);
for(int j = 0; j < n; j++){
for(int i = 0; i < loga; i++){
if(a[j] & (1ll << i)) bit[i]++;
}
}
ll ans = 0;
for(int i = 0; i < n; i++){
ll now = 1;
for(int j = 0; j < loga; j++){
if(a[i] & (1ll << j)){
bit[j]--;
ans += now*(n-i-1-bit[j])%mod;
ans %= mod;
} else ans += now*bit[j]%mod;
now *= 2;
now %= mod;
}
}
cout << (ans+mod)%mod << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define lli long long int
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define ve vector<lli>
#define vep vector<pair<lli,lli> >
#define pii pair<int,int>
#define pll pair<lli,lli>
#define fr(i,n) for(lli i=0;i<(n);i++)
#define F first
#define S second
#define PI 3.141592653589793238
using u64 = uint64_t;
long long int gcd(long long int a,long long int b)
{
if(a==0)return b;
return gcd(b%a,a);
}
int bin(long int a[],long int low,long int high,long d,long day[])
{
if(low>high)return -1;
long mid=(low+high)/2;
if(a[mid]>(a[low]+d)&&(a[mid-1]<=(a[low]+d)||day[mid-1])&&day[mid]==0)
return mid;
else if(a[mid]>(a[low]+d)&&day[mid]==0)
return bin(a,low,mid-1,d,day);
else
return bin(a,mid+1,high,d-a[mid+1]+a[low],day);
}
long long power(long long a,long long b)
{
if(b==0)return 1;
if(b%2==0)return (power(((a*a)),b/2));
return (((a)*(power(((a*a)),b/2))));
}
bool cmp(int a,int b)
{
return a>b;
}
bool sortbysecdesc(const pair<int,int> &a,
const pair<int,int> &b)
{
return a.first>b.first;
}
u64 binpower(u64 base,u64 e,u64 m)
{
u64 ans=1;
base%=m;
while(e)
{
if(e&1)
{
ans=ans*base%m;
}
base=base*base%m;
e>>=1;
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
for(int X=1;X<=t;X++)
{
int n;
cin>>n;
int a[n],i,cnt[n+1]={0},k;
fr(i,n){cin>>a[i]; cnt[a[i]]++;}
sort(a,a+n);
k=(a[n-1]+1)>>1;
if(a[0]!=k){cout<<"Impossible\n"; continue;}
if(a[n-1]%2==0&&cnt[a[0]]>1){cout<<"Impossible\n"; continue;}
if(a[n-1]%2==1&&cnt[a[0]]!=2){cout<<"Impossible\n"; continue;}
int ch=1;
for(i=a[n-1];i>a[0];i--)
{
if(cnt[i]<2){ch=0; break;}
}
if(ch){cout<<"Possible\n"; continue;}
else {cout<<"Impossible\n"; continue;}
}
return 0;
} | 0 | 56,673,507 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, K;
cin >> N >> K;
LL ans = K;
rep(i,N-1) ans *= K - 1;
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI=3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for(int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y) - 1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
bool ok(const vs64& a, int idx)
{
s64 w = a[idx];
int n = a.size();
int l = 0, r = 0;
while (true)
{
s64 sum = 0;
while (r < n && a[r] <= 2 * w)
{
if (idx != r) sum += a[r];
++r;
}
if (l == r) return false;
if (r == n) break;
l = r;
w += sum;
}
return true;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vs64 a(n);
rep (i, n) cin >> a[i];
sort(a.begin(), a.end());
int l = -1, r = n - 1;
while (l + 1 < r)
{
int m = (l + r) / 2;
if (ok(a, m)) r = m;
else l = m;
}
cout << n - r << "\n";
return 0;
} | 0 | 74,229,772 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
int main(){
int n,k; cin>>n>>k;
string s; cin>>s;
vector<int> num;
int conti=1;
if(s[0]=='0') num.push_back(0);
rep(i,0,n-1){
if(s[i]==s[i+1]){
conti++;
}else{
num.push_back(conti);
conti=1;
}
}
num.push_back(conti);
if(s[n-1]=='0') num.push_back(0);
vector<int> cum(num.size());
cum[0]=num[0];
rep(i,0,num.size()-1){
cum[i+1]=cum[i]+num[i+1];
}
if((cum.size()-1)/2<k){
cout<<s.size()<<endl;
return 0;
}
int ans=0;
for(int i=0; i+2*k<cum.size(); i+=2){
int temp;
if(i==0){
temp=cum[2*k];
}else{
temp=cum[i+2*k]-cum[i-1];
}
ans=max(ans,temp);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
ll N; cin >> N;
vector<ll> A(N); REP(i, N) cin >> A[i];
ll cnt = 0;
vector<ll> S(N + 1); S[0] = 0;
for(int i = 0; i < N; ++i) S[i + 1] = S[i] + A[i];
map<ll, ll> m;
REP(i, S.size()) m[S[i]]++;
for(auto x : m) {
cnt += 0.5 * x.second * (x.second - 1);
}
cout << cnt << endl;
} | 0 | 46,477,410 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(n>=k)
{
ll a=k*x;
ll b=y*(n-k);
ll c=a+b;
cout<<c<<endl;
}
else
{
ll c=n*x;
cout<<c<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
bool mp[h*w];
string tmp;
for(int i = 0; i < h; i++) {
cin >> tmp;
for(int j = 0; j < w; j++) {
if(tmp[j]=='#') mp[i*w+j] = false;
else mp[i*w+j] = true;
}
}
vector<int> r(h*w,0);
vector<int> c(h*w,0);
for(int i = 0; i < h; i++) {
int cnt=0;
for(int j = 0; j < w; j++) {
if(mp[i*w+j]) cnt++;
else{
for(int k = j-cnt; k < j; k++) {
r[i*w+k]=cnt;
}
cnt=0;
}
}
for(int k = w-cnt; k < w; k++) {
r[i*w+k]=cnt;
}
}
for(int j = 0; j < w; j++) {
int cnt=0;
for(int i = 0; i < h; i++) {
if(mp[i*w+j]) cnt++;
else{
for(int k = i-cnt; k < i; k++) {
c[k*w+j]=cnt;
}
cnt=0;
}
}
for(int k = h-cnt; k < h; k++) {
c[k*w+j]=cnt;
}
}
int ans=0;
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
int idx=i*w+j;
if(mp[idx]) ans=max(ans,r[idx]+c[idx]-1);
else continue;
}
}
cout << ans << "\n";
return 0;
} | 0 | 14,587,052 |
#include <iostream>
#include <bitset>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
ll a[n];
for (int i=0;i<n;i++) cin>>a[i];
ll ans=1e18;
for (ll bit=0;bit<(1<<n);bit++){
ll max_h=a[0];
ll sum=0;
ll cnt=1;
for (int i=1;i<n;i++){
if (bit&(1<<i)){
if(a[i]<=max_h){
sum+=max_h-a[i]+1;
cnt++;
max_h++;
}else max_h=a[i];
}else if(a[i]>max_h){
cnt++;
max_h=max(max_h,a[i]);
}
}
if (cnt>=k) ans=min(ans,sum);
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main()
{
string s;
cin >> s;
int n = s.size();
bool ans = false;
rep(i, n + 1) {
repl(j, i, n + 1) {
string t = s.substr(0, i) + s.substr(j);
if(t == "keyence") ans = true;
}
}
if(ans) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | 0 | 45,815,826 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
using namespace std;
int main() {
ll a, b, k;
cin >> a >> b >> k;
if (a >= k) {
cout << a - k << " " << b << endl;
} else if (a + b >= k) {
cout << "0 " << a + b - k << endl;
} else {
cout << "0 0" << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <iomanip>
#include <iterator>
#include <algorithm>
#include <functional>
#include <typeinfo>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define mp(a, b) make_pair(a, b)
#define all(vec) (vec).begin(), (vec).end()
#define yn(formula) (formula) ? (cout << "Yes" << endl) : (cout << "No" << endl)
#define YN(formula) (formula) ? (cout << "YES" << endl) : (cout << "NO" << endl)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vb> vvb;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
constexpr double PI = 3.14159265358979323846;
constexpr ll INF = 1ll << 59;
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-7;
constexpr int dy[4] = { 0, 1, 0, -1 };
constexpr int dx[4] = { 1, 0, -1, 0 };
int main()
{
int K;
cin >> K;
vvi g(K);
rep(i, K) {
g[i].push_back((i + 1) % K);
g[i].push_back((i * 10) % K);
}
vi visited(K, 0);
priority_queue<pii> pq;
pq.push(pii(-1, 1));
int ans;
while (!pq.empty()) {
int crr = pq.top().second;
int cost = -pq.top().first;
pq.pop();
if (crr == 0) {
ans = -cost;
break;
}
visited[crr] = 1;
if (visited[(crr + 1) % K] == 0) {
pq.push(pii(-cost - 1, (crr + 1) % K));
}
if (visited[(crr * 10) % K] == 0) {
pq.push(pii(-cost, (crr * 10) % K));
}
}
cout << -ans << endl;
return 0;
} | 0 | 71,367,914 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int count = 0;
bool finished = false;
int tmp;
vector<int> digit(3);
for(int num = 0; num < 1000; num++) {
tmp = num;
for(int d = 2; d >= 0; d--) {
digit[d] = tmp % 10;
tmp /= 10;
}
finished = false;
for(int i = 0; i < N-2; i++) {
if(S[i] - '0' == digit[0]) {
for(int j = i+1; j < N-1; j++) {
if(S[j] - '0' == digit[1]) {
for(int k = j+1; k < N; k++) {
if(S[k] - '0' == digit[2]) {
count++;
finished = true;
break;
}
}
finished = true;
break;
}
if(finished == true) {
break;
}
}
finished = true;
break;
}
if(finished == true) {
break;
}
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<edge>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define 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 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(a) accumulate(all(a),0ll)
#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)) ));
#define case std::cout << "Case #" <<qqq+1<<": "
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 2000000000;
const ll INF64 = 922337203685477580ll;
const ll MOD = 1000000007ll;
int cc(int n,int bit){
int c=0;
rep(i,n){
if(bit&(1<<i))c++;
}
return c;
}
int main(){
int n,k;
std::cin >> n>>k;
VEC(ll,aa,n);
ll ans=INF64;
brep(n){
std::vector<ll> a(aa);
if(cc(n,bit)<k)continue;
ll m=a[0],d=0ll;
rrep(i,1,n){
if(bit&(1<<i)){
d+=max(0ll,m-a[i]+1);
a[i]=max(a[i],m+1);
}
m=max(m,a[i]);
}
ans=min(ans,d);
}
std::cout << ans << std::endl;
} | 0 | 9,827,549 |
#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/(__gcd(a,b))
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define all(a) (a).begin(), (a).end()
#define vi vector<long long>
#define v vector
#define p pair
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
typedef double d;
using namespace std;
int modF=1e9+7;
int INF=1e11;
void solve(){
int n,m;
cin>>n>>m;
vi a(n);
int sum=0;
rep(i,0,n){
cin>>a[i];
sum+=a[i];
}
int l=sum/(4*m);
if(sum%(4*m)!=0)l++;
int cnt=0;
for(int i=0;i<n;i++){
if(a[i]<l){
cnt++;
}
}
if(cnt>n-m){
cout<<"No\n";
}
else{
cout<<"Yes\n";
}
}
signed main(){
boost_io;
solve();
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <bitset>
#define range(i, r) for(int i=0;i<r;i++)
#define ranges(i, l, r) for(int i=l;i<r;i++)
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
#define MODn 1000000009;
typedef long long int ll;
using namespace std;
int main(int argc, char const *argv[]) {
int N;
std::cin >> N;
std::vector<string> S(2*N);
range(i, N) {
std::cin >> S[i];
S[i] = S[i] + S[i];
}
ranges(i, N, 2*N) S[i] = S[i-N];
std::vector<int> st(2*N-1);
range(i, N-1){
st[i] = N-1-i;
}
st[N-1] = 0;
ranges(i, N, 2*N-1){
st[i] = i - N + 1;
}
int x = 0,y = 0, ans = 0, point;
for(int i=0;i<2*N-1;i++){
if(i<N-1) x=0,y=st[i], point=i+1;
else if(i==N-1) x = y = 0, point=N;
else x=st[i], y=0, point = N - (i - N) - 1;
bool flag = true;
for(int j=0;j<N;j++){
for(int k=0;k<N;k++){
if(S[x+k][y+j]!= S[x+j][y+k]) flag = false;
}
}
if(flag) ans+=point;
}
std::cout << ans << '\n';
return 0;
} | 0 | 95,175,932 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long int infLL = 9000000000000000000;
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(a) (a).begin(),(a).end()
#define mx_int_prime 999999937
const int inf = 2000000000;
const double PI = acos(-1);
const double eps = 1e-9;
typedef long double ld;
#define MOD 1000000007
typedef long long ll;
const int mx=2e5+125;
ll pr[mx],ar[mx],br[mx];
#define PB push_back
#define endl '\n'
#define S second
#define F first
int main()
{
faster();
vector<int>v;
int s;
cin>>s;
v.PB(s);
int n=1000000;
while(n--){
if(s%2==0)
{
s/=2;
v.PB(s);
}
else
{
s=3*s+1;
v.PB(s);
}
}
set<int>st;
for(int i=0; i<v.size(); i++){
if(st.count(v[i])){
cout<<i+1<<endl;
break;
}
else
st.insert(v[i]);
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
#define rep(i, n) for(long long i=0; i<n; i++)
#define reps(i, s, e) for(long long i=s; i<e; i++)
#define repr(i, n) for(long long i=n-1; i>=0; i--)
#define reprs(i, s, e) for(long long i=e-1; i>=s; i--)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll k; cin >> k;
string s; cin >> s;
if(s.size() <= k){
cout << s << endl;
}
else{
rep(i, k){
cout << s[i];
}
cout << "..." << endl;
}
return 0;
} | 0 | 89,513,640 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
using namespace std;
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define emb emplace_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline T range(T l, T r) {
return uniform_int_distribution<T>(l, r)(rng);
}
inline void setin(string s) {
freopen(s.c_str(), "r", stdin);
}
inline void setout(string s) {
freopen(s.c_str(), "w", stdout);
}
template <typename T> void Min(T &a, T b) {
a = min(a, b);
}
template <typename T> void Max(T &a, T b) {
a = max(a, b);
}
#define int long long
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 1e2 + 15;
int n;
pii a[N];
main() {
ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> a[i].f >> a[i].se;
sort(a + 1, a + 1 + n, [&](pii a, pii b) {
return atan2(a.f, a.se) < atan2(b.f, b.se);
});
for(int i = 1; i <= n; ++i)
a[i + n] = a[i];
int ans = 0;
for(int i = 1; i <= n; ++i) {
pii cur(0, 0);
for(int j = i; j <= i + n - 1; ++j) {
cur.f += a[j].f;
cur.se += a[j].se;
Max(ans, cur.f * cur.f + cur.se * cur.se);
}
}
cout.precision(30);
cout << sqrt(ans) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
const ll MOD=1000000007;
ll abs1(ll a){
if(a>=0)return a;
else return -a;
}
ll pow1(ll a,ll b,ll p=LLONG_MAX){
ll ret=1;
while(b!=0){
if((b&1)==1){
ret*=a;
}
a*=a;
if(a>=p)a%=p;
b=b>>1;
}
return ret;
}
int digit(ll a,ll b){
int i=0;
while(a!=0){
a/=b;
i++;
}
return i;
}
int ord(ll a,ll p){
int i=0;
while(a%p==0){
a/=p;
i++;
}
return i;
}
ll gcd1(ll a,ll b){
if(a==0 && b==0)return 0;
ll n;
while(a%b!=0){
n=a%b;
a=b;
b=n;
}
return b;
}
ll solveLinear(ll n,ll m,ll c){
if(n==0 && m==0)return 0;
ll a[100],b[100];
a[0]=n;b[0]=m;
int i=1;
while(b[i-1]!=0){
a[i]=b[i-1];
b[i]=a[i-1]%b[i-1];
i++;
}
n=i;
if(c%a[n-1]!=0){
return 0;
}
ll x=c/a[n-1],y=0;
for(i=1;i<n;i++){
ll cnt=x;
x=y;
y=cnt-(a[n-i-1]/b[n-i-1])*y;
}
return x;
}
ll modRev(ll a,ll p=MOD){
a%=p;
ll n=solveLinear(a,p,1);
n%=p;
if(n<0)return n+p;
return n;
}
ll fact(ll n,ll p=MOD){
if(n<0)return 0;
int i;
ll ret=1;
for(i=0;i<n;i++){
ret=ret*(i+1);
if(ret>=p)ret%=p;
}
return ret;
}
ll perm(ll n,ll k,ll p=MOD){
if(n<0 || k<0 || n<k)return 0;
int i;
ll ret=1;
for(i=0;i<k;i++){
ret=ret*(n-i);
if(ret>=p)ret%=p;
}
return ret;
}
ll binom(ll n,ll k,ll p=MOD){
if(n<0 || k<0 || n<k)return 0;
int i;
ll ret=1,fact=1;
for(i=0;i<k;i++){
ret=ret*(n-i);
fact*=i+1;
if(ret>=p)ret%=p;
if(fact>=p)fact%=p;
}
return (ret*modRev(fact))%p;
}
int main(){
int i,j,k;ll cnt=0;
ll n;
cin>>n;
ll a[n];
for(i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
ll sum=0;
for(i=0;i<n;i++)sum+=a[i];
if(a[0]>=0){
cout<<sum-2*a[0]<<endl;
for(i=1;i<n-1;i++){
cout<<a[0]<<" "<<a[i]<<endl;
a[0]-=a[i];
}
cout<<a[n-1]<<" "<<a[0]<<endl;
return 0;
}
if(a[n-1]<=0){
cout<<2*a[n-1]-sum<<endl;
for(i=0;i<n-1;i++){
cout<<a[n-1]<<" "<<a[i]<<endl;
a[n-1]-=a[i];
}
return 0;
}
sum=0;
for(i=0;i<n;i++)sum+=abs1(a[i]);
cout<<sum<<endl;
for(i=0;i<n-1;i++){
if(a[i]<0 && 0<=a[i+1]){
cnt=i;
}
if(0<=a[i]){
cout<<a[0]<<" "<<a[i]<<endl;
a[0]-=a[i];
}
}
for(i=0;i<=cnt;i++){
cout<<a[n-1]<<" "<<a[i]<<endl;
a[n-1]-=a[i];
}
return 0;
} | 0 | 49,488,373 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
string s, t;
cin >> s >> t;
int sl = s.size(), tl = t.size();
int dp[1010][1010];
dp[0][0] = 0;
for (int j = 1; j <= sl; ++j) {
for (int k = 1; k <= tl; ++k) {
if (s[j - 1] == t[k - 1]) {
dp[j][k] = dp[j - 1][k - 1] + 1;
}
else {
dp[j][k] = max(dp[j - 1][k], dp[j][k - 1]);
}
}
}
cout << dp[sl][tl] << "\n";
}
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
vector<int> ans(n);
if(a == 1){
if(n == b){
rep(i,n) cout << n-i << " ";
cout << endl;
}
else{
cout << -1 << endl;
}
}
else if(b == 1){
if(n == a){
rep(i,n) cout << i+1 << " ";
cout << endl;
}
else{
cout << -1 << endl;
}
}
else if(n <= a || n <= b){
cout << -1 << endl;
}
else{
if(a <= b){
rep(i,a) ans[i] = n - a + i + 1;
int bound = n - a + 1;
if(b < 2 || a < (n - a + b - 2) / (b - 1) || bound < b){
cout << -1 << endl;
}
else{
int idx = a;
int cnt = 1;
while(idx < n){
rep(i,b-1){
ans[idx++] = min(n - a - i, (b - 1) * cnt - i);
if(idx == n) break;
}
++cnt;
}
rep(i,n) cout << ans[i] << " ";
cout << endl;
}
}
else{
rep(i,b) ans[i] = b - i;
int bound = n - b + 1;
if(a < 2 || b < (n - b + a - 2) / (a - 1) || bound < a){
cout << -1 << endl;
}
else{
int idx = b;
int cnt = 1;
while(idx < n){
rep(i,a-1){
ans[idx++] = max(b + 1 + i, n - (a - 1) * cnt + i + 1);
if(idx == n) break;
}
++cnt;
}
rep(i,n) cout << ans[i] << " ";
cout << endl;
}
}
}
return 0;
} | 0 | 2,411,426 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ll long long
#define pii pair<int,int>
int fac[9];
void init() {
int i=0;
fac[0]=1;
for(int i=1;i<9;i++)
fac[i]=i*fac[i-1];
}
void test_case()
{
int n,a=0,b=0;
cin>>n;
int p[n], q[n];
for(int i=0;i<n;i++) cin>>p[i];
for(int i=0;i<n;i++) cin>>q[i];
do {
a++;
} while(prev_permutation(p,p+n));
do {
b++;
} while(prev_permutation(q,q+n));
cout<<abs(a-b);
}
int main()
{
fastio
test_case();
} | #include <bits/stdc++.h>
#define X first
#define Y second
#define MP make_pair
using namespace std;
typedef long long ll;
const int N = 1e5 + 12;
const ll mod = 1e9 + 7;
int n, m;
string s[N];
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 1;i <= n;i++)
cin >> s[i];
sort(s + 1, s + n + 1);
for(int i = 1;i <= n;i++)
cout << s[i];
} | 0 | 31,777,219 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main()
{
string s;
cin >> s;
map<int, int> d;
int h = 0, m;
d.insert(make_pair(h, 0));
for (auto c : s) {
h ^= 1 << c - 'a';
m = -1;
for (int i = 0; i < 26; i++) {
auto it = d.find(h ^ 1 << i);
if (it != d.end() && (m < 0 || it->second < m))
m = it->second;
}
auto r = d.insert(make_pair(h, m + 1));
if (r.second)
continue;
if (r.first->second > m)
r.first->second = m + 1;
else
m = r.first->second;
}
cout << m + 1 << endl;
return 0;
} | #include<iostream>
using std::cout;
using std::cin;
using std::endl;
void numberOfWay(int n, int x) {
int num = 0;
int first;
int second;
int third;
for (first = 1; first <= n - 2; first++) {
third = x - first;
for (second = first + 1; second <= n - 1; second++) {
int third_temp = third - second;
if (first < second && second < third_temp && third_temp <= n) {
num++;
}
}
}
cout << num << endl;
}
int main(void) {
int n;
int x;
cin >> n >> x;
while (n != 0 || x != 0) {
numberOfWay(n , x);
cin >> n >> x;
}
return 0;
} | 0 | 7,695,992 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
int n;
cin >> n;
vector<ll> c(n-1), s(n-1), f(n-1);
rep(i,n-1) cin >> c[i] >> s[i] >> f[i];
vector<ll> ans(n);
rep(i,n - 1) {
ll temp = 0;
for (int j = i; j < n - 1; j++) {
if (temp < s[j]) temp = s[j];
if (temp % f[j] != 0) temp += f[j] - temp % f[j];
temp += c[j];
}
ans[i] = temp;
}
rep(i,n) cout << ans[i] << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
vector<int> x(3);
rep(i,3) cin >> x[i];
sort(all(x));
int e = 0, o = 0;
rep(i,3){
if (x[i] % 2 == 0) e++;
else o++;
}
int ans = 0;
if (e == 1 && o == 2){
rep(i,3) if (x[i] % 2 != 0) x[i]++;
ans++;
}else if (e == 2 && o == 1){
rep(i,3) if (x[i] % 2 == 0) x[i]++;
ans++;
}
ans += (x[2]-x[0])/2;
ans += (x[2]-x[1])/2;
cout << ans << endl;
return 0;
} | 0 | 49,485,989 |
#include <bits/stdc++.h>
using namespace std;
int effort(int q,vector<int> &adress,int &N){
int a=0;
for(int i=0;i<N;i++){
a+=(q-adress.at(i))*(q-adress.at(i));
}
return a;
}
int main(){
int N;
cin>>N;
vector<int> adress(N);
for(int i=0;i<N;i++){
cin>>adress.at(i);
}
int ans=1000000000;
for(int i=0;i<100;i++){
if(effort(i,adress,N)<ans){
ans=effort(i,adress,N);
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
#define ii for(int i=1;i<=n;++i)
#define ji for(int j=1;j<=n;++j)
#define jj for(int j=1;j<=m;++j)
#define ij for(int i=1;i<=m;++i)
#define sz(x) ((ll)x.size())
#define all(x) x.begin(),x.end()
#define al(x) x+1,x+1+n
#define asd cout<<"ok"<<endl;
#define asdd cout<<"okok"<<endl;
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define pr(v) for(auto i:v) cout<<i<<" ";cout<<endl
#define prt(a, l, r) for(auto i=l;i<=r;++i) cout<<a[i]<<" ";cout<<endl;
#define pc(x) __builtin_popcount(x)
#define pb push_back
int main() {
ll n;
cin>>n;
int ans=0;
for(ll i=2;i*i<=n;++i) {
if(n%i==0) {
int cnt=0;
while(n%i==0) n/=i,++cnt;
int k=1;
while(cnt>=k) {
cnt-=k;
++ans;
k++;
}
}
}
if(n>1) ++ans;
cout<<ans<<endl;
} | 0 | 9,706,703 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
using lint = int64_t;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<lint> sum(N + 1, 0);
rep(i, N) sum[i + 1] = sum[i] + A[i];
map<lint, int> mp;
lint ans = 0;
rep(i, N + 1) {
ans += mp[sum[i] % M];
++mp[sum[i] % M];
}
cout << ans << "\n";
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<vector>
#include<queue>
#include<deque>
#include<string>
#include<utility>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<set>
#include<map>
#include<bitset>
#include<stack>
#include<ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<pli> vpli;
inline ll read(){
ll Hashimoto=0;
bool Kanna=1;
char I_Love=getchar();
while(I_Love<'0'||I_Love>'9'){
if(I_Love=='-')Kanna=0;
I_Love=getchar();
}
while(I_Love>='0'&&I_Love<='9'){
Hashimoto=Hashimoto*10+I_Love-'0';
I_Love=getchar();
}
return (Kanna?Hashimoto:-Hashimoto);
}
template<typename T1,typename T2> inline void Umax(T1 &a,T2 b){
if(a<b)a=b;
}
template<typename T1,typename T2> inline void Umin(T1 &a,T2 b){
if(a>b)a=b;
}
#define I_Love_Hashimoto_Kanna main
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define filein(s) freopen(s,"r",stdin);
#define fileout(s) freopen(s,"w",stdout);
#define file freopen("I_Love_Hashimoto_Kanna.out","w",stdout);
#define RE cout<<"I_Love_Hashimoto_Kanna"<<endl;
#define Tone(Kanna) cout<<Kanna<<endl;
#define Tall(Hashimoto,Kanna) for(int I_Love=0;I_Love<(Kanna);++I_Love)cout<<Hashimoto[I_Love]<<(I_Love==(Kanna)-1?"\n":" ");
#define FOR(I_Love,Hashimoto,Kanna) for(int I_Love=Hashimoto;I_Love<(Kanna);++I_Love)
#define MP(Hashimoto,Kanna) make_pair(Hashimoto,Kanna)
#define REV(Kanna) reverse(Kanna.begin(),Kanna.end());
#define SORT(Kanna) sort(Kanna.begin(),Kanna.end());
#define UNIQUE(Kanna) Kanna.erase(unique(Kanna.begin(),Kanna.end()),Kanna.end());
#define inf (int)1e9
#define linf (ll)1e18
#define mod (inf+7)
int n;
pli a[111111];
int s[111111];
int f[111111];
int I_Love_Hashimoto_Kanna() {
fastio;
n=read();
FOR(i,0,n){
a[i]={read(),i};
s[i]=1;
}
sort(a,a+n);
ll sum=0;
for(int i=n-1;i>0;--i){
int j=lower_bound(a,a+n,MP(a[i].first-(n-s[i]-s[i]),-1))-a;
if(i==j||a[j].first!=a[i].first-(n-s[i]-s[i])){
Tone(-1);
return 0;
}
f[i]=j;
s[j]+=s[i];
sum+=s[i];
}
if(sum!=a[0].first){
Tone(-1);
return 0;
}
FOR(i,1,n){
printf("%d %d\n",a[i].second+1,a[f[i]].second+1);
}
return 0;
} | 0 | 56,967,467 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s,t,u; cin>>s>>t>>u;
s[0]=char(s[0]-32);
cout<<s[0];
t[0]=char(t[0]-32);
cout<<t[0];
u[0]=char(u[0]-32);
cout<<u[0]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define FOREACHr(it, l) for (auto it = l.rbegin(); it != l.rend(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define PB push_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define SQ(x) ((x)*(x))
const double pi=acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int,int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddx[4] = {1,0,-1,0};
const int ddy[4] = {0,1,0,-1};
int64 powr(int64 x,int64 y,int64 p)
{
int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0){
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
void in_o(){
#ifndef LOCAL
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
cinsc;
}
int main(){
int n,k,S;
scanf("%d%d%d",&n,&k,&S);
if(S+1<=1000000000)
{
for(int i=0;i<k;i++) printf("%d ",S);
for(int i=k;i<n;i++) printf("%d ",S+1);puts("");
}
else
{
for(int i=0;i<k;i++) printf("%d ",S);
for(int i=k;i<n;i++) printf("%d ",1);puts("");
}
return 0;
} | 0 | 97,908,445 |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,m,x,y,d[N];
int main(){
scanf("%d%d",&n,&m);
while (m--)scanf("%d%d",&x,&y),d[x]^=1,d[y]^=1;
int cnt=0;
for (int i=1;i<=n;i++)cnt+=d[i];
if (cnt>1)puts("NO");
else puts("YES");
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> pii;
int n, k;
const int N = 1e5 + 5;
ll f[N], res;
ll expo(ll a, ll b) {
if (b == 0) return 1;
if (a == 0) return 0;
ll temp = expo(a, b / 2);
temp = (temp * temp) % MOD;
if (b & 1) temp = (temp * a) % MOD;
return temp;
}
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> k;
for (int i = k; i >= 1; --i) {
f[i] = expo(k / i, n);
for (int j = 2; j <= k / i; ++j)
f[i] -= f[j * i];
f[i] %= MOD;
if (f[i] < 0) f[i] += MOD;
res = (res + (f[i] * i)) % MOD;
}
cout << res;
return 0;
} | 0 | 3,313,635 |
#include<bits/stdc++.h>
using namespace std;
int main(){
float a,b,c;
int k;
cin>>a>>b>>c>>k;
int k1=0,k2=0;
if(b<=a){
k1 = floor(log2(a/b)) + 1;
b = b*pow(2,k1);
}
if(c<=b){
k2 = floor(log2(b/c)) + 1;
}
if(k>=k1+k2) cout<<"Yes\n";
else cout<<"No\n";
} | #include<cstdio>
#define MIN(X,Y) ((X<Y)?(X):(Y))
int main(void) {
while(true) {
int n,m,dis[11]={};
scanf("%d%d",&n,&m);
if(!n) break;
for(int i=0; i<n; i++) {
int d,p;
scanf("%d%d",&d,&p);
dis[p] += d;
}
for(int i=10; i; i--) {
int k = MIN(dis[i], m);
dis[i] -= k;
m -= k;
}
int res=0;
for(int i=0; i<=10; i++) {
res += dis[i] * i;
}
printf("%d\n",res);
}
return 0;
} | 0 | 74,333,512 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef ll int__;
#define rep(i,j) for(int__ (i)=0;(i)<(j);(i)++)
#define repeat(i,j,k) for(int__ i=(j);i<(k);(i)++)
#define all(v) v.begin(),v.end()
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int> v;
v.reserve(n);
rep(i,n){
int a;
cin>>a;
auto itr=lower_bound(all(v), a);
if(itr==v.end())v.push_back(a);
else *itr=a;
}
cout<<v.size()<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int64_t h,n;
cin >> h >> n;
int64_t a;
int64_t total = 0;
for(int i=0;i<n;i++){
cin >> a;
total += a;
}
if(total>=h) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 0 | 67,688,490 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n), a(m * n);
rep(i, n) {
cin >> c[i];
rep(j, m) cin >> a[i * m + j];
}
int best = 1e9;
rep(pat, 1 << n) {
int cost = 0;
vector<int> u(m);
rep (i, n) {
if ((pat >> i) & 1) {
cost += c[i];
rep (j, m) {
u[j] += a[i * m + j];
}
}
}
bool ok = true;
rep(j, m) {
if (u[j] < x) {
ok = false;
break;
}
}
if (ok) {
best = min(best, cost);
}
}
put((best == 1e9 ? -1 : best));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N , K;
cin >> N >> K;
vector<ll> P(N), C(N);
for (int i = 0; i < N; ++i) cin >> P[i], --P[i];
for (int i = 0; i < N; ++i) cin >> C[i];
vector<vector<int>> next(60, vector<int>(N));
vector<vector<ll>> val(60, vector<ll>(N)), all(60, vector<ll>(N));
for (int v = 0; v < N; ++v) {
next[0][v] = P[v];
val[0][v] = all[0][v] = C[v];
}
for (int d = 0; d + 1 < 60; ++d) {
for (int v = 0; v < N; ++v) {
next[d+1][v] = next[d][next[d][v]];
val[d+1][v] = val[d][v] + val[d][next[d][v]];
all[d+1][v] = max(all[d][v], val[d][v] + all[d][next[d][v]]);
}
}
ll res = -INF;
for (int v = 0; v < N; ++v) {
ll sum = 0;
ll offset = v;
for (int d = 59; d >= 0; --d) {
if (K & (1LL<<d)) {
res = max(res, sum + all[d][offset]);
sum += val[d][offset];
offset = next[d][offset];
}
}
}
cout << res << endl;
return 0;
} | 0 | 87,427,632 |
#include <iostream>
#define ll long long
#include <cstring>
using namespace std;
int arr[500005];
int main() {
string s;
cin >> s;
memset(arr, 0, sizeof(arr));
ll ans = 0;
int cntr = 0;
for (int i = 0; i < s.length(); i++){
if (s[i] == '<'){
arr[i+1] = arr[i]+1;
}
}
for (int i = s.length()-1; i >= 0; i--){
if (s[i] == '>'){
if (arr[i] < arr[i+1] + 1)
arr[i] = arr[i+1] + 1;
}
ans = ans + arr[i];
}
cout << ans + arr[s.length()] << endl;
} | #include <iostream>
using namespace std;
int nsum_two(int m, int n, int sum)
{
int nsum = 0;
for (int i = m; i < (sum / 2.0); i++)
{
if ((sum - i) > n) continue;
nsum++;
}
return nsum;
}
int main()
{
while (true)
{
int n, x;
cin >> n >> x;
if (n == 0 && x == 0) break;
int nsum_three = 0;
for (int j = 1; j < (x / 3); j++)
{
nsum_three += nsum_two(j + 1, n, x - j);
}
cout << nsum_three << endl;
}
return 0;
} | 0 | 38,435,534 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD = 1000000007;
const double PI = acos(-1);
int main() {
int W, H, N; cin >> W >> H >> N;
vector<vector<int>> F(H, vector<int>(W,1));
vector<int> L(110, 1);
vector<int> R(110, 1);
for (int i = 0; i < N; i++) {
int x, y, a; cin >> x >> y >> a;
if (a == 1) {
for (int w = 0; w < x; w++) {
R[w] = 0;
}
} else if (a == 2) {
for (int w = x; w < W; w++) {
R[w] = 0;
}
} else if (a == 3) {
for (int h = 0; h < y; h++) {
L[h] = 0;
}
} else if (a == 4) {
for (int h = y; h < H; h++) {
L[h] = 0;
}
}
}
int area = 0;
for (int h = 0; h < H; h++) {
for (int w = 0; w < W; w++) {
if (R[w] && L[h]) area++;
}
}
cout << area << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
int main(){
io
int n;
string s;
cin >> n >> s;
int cont(1);
char last = s[0];
for(int i(0); i<s.length(); i++){
if(s[i] != last){
cont++;
last = s[i];
}
}
cout << cont << endl;
return 0;
} | 0 | 27,849,923 |
#include<bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=998244353;
const ll INF=1000000010;
const ll LINF=1000000000000000010;
int dx[8]={0,0,1,1,1,-1,-1,-1};
int dy[8]={1,-1,1,-1,0,1,-1,0};
int main(){
ll s=1;
int keta=0;
char c;
bool f=false;
for(int i=1;i<=11;i++){
cout<<"? "<<s<<endl;
cin>>c;
keta=i-1;
if(c=='N'){
f=true;
break;
}
s*=10;
}
if(!f){
s=1;
for(int i=1;i<10;i++){
cout<<"? "<<s+1<<endl;
cin>>c;
if(c=='Y'){
cout<<"! "<<s<<endl;
return 0;
}
s*=10;
}
}
int now=1;
s=0;
while(1){
if(now==keta){
int en=0;
if(keta==1){
en=1;
}
for(int i=9;i>=en;i--){
cout<<"? "<<(s+i)*10<<endl;
cin>>c;
if(c=='N'){
cout<<"! "<<s+i+1<<endl;
return 0;
}
}
cout<<"! "<<s+en<<endl;
return 0;
}else{
int ok=0,ng=10;
while(ng-ok>1){
int mid=(ng+ok)/2;
cout<<"? "<<s+mid<<endl;
cin>>c;
if(c=='Y'){
ok=mid;
}else{
ng=mid;
}
}
s+=ok;
}
now++;
s*=10;
}
} | #include <stdio.h>
int main()
{
int m,f,r,summf;
while(1){
scanf("%d %d %d",&m,&f,&r);
if(m==-1&&f==-1&&r==-1){
break;
}
summf=m+f;
if(m==-1||f==-1){
printf("F\n");
}else
if(80<=summf){
printf("A\n");
}else
if(65<=summf&&summf<80){
printf("B\n");
}else
if(50<=summf&&summf<65){
printf("C\n");
}else
if(30<=summf&&summf<50){
if(r>=50){
printf("C\n");
}else printf("D\n");
}else
if(summf<30){
printf("F\n");
}
}
return 0;
} | 0 | 61,464,585 |
#include <cstdio>
#include <iostream>
using namespace std;
void print(int a[][10]){
for (int i = 0; i < 3; i++){
for (int j = 0; j < 10; j++){
cout<< " " << a[i][j];
}
cout << endl;
}
}
int main()
{
int n,b,f,r,v = 0;
cin >> n;
int A[3][10], B[3][10], C[3][10], D[3][10];
for (int i = 0; i < 3; i++){
for (int j = 0; j < 10; j++){
A[i][j] = 0;
B[i][j] = 0;
C[i][j] = 0;
D[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
if (b == 1) A[f-1][r-1] += v;
else if (b == 2) B[f-1][r-1] += v;
else if (b == 3) C[f-1][r-1] += v;
else D[f-1][r-1] += v;
}
print(A);
cout << "####################" << endl;
print(B);
cout << "####################" << endl;
print(C);
cout << "####################" << endl;
print(D);
return 0;
} | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#define div1 1000000007
using namespace std;
int main(void)
{
long long N, H, W, A[1001], B[1001], i, ans=0;
cin >> N >> H >> W;
for(i=1; i<=N; i++){
cin >> A[i] >> B[i];
if(A[i]>=H && B[i]>=W){
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 50,941,528 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(12);
double x1,y1,x2,y2,a,b,ans;
cin >> x1 >> y1 >> x2 >> y2;
a = x2-x1;
if(a<0) a = a * (-1);
b = y2-y1;
if(b<0) b = b * (-1);
a = pow(a,2);
b = pow(b,2);
ans = a+b;
ans = sqrt(ans);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main(){
int h,w;
cin >> h >> w;
char C[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> C[i][j];
}
}
for(int i=0;i<h;i++){
for(int j=0;j<2;j++){
for(int k=0;k<w;k++){
cout << C[i][k];
}
cout << endl;
}
}
} | 0 | 52,332,889 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include <queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int main() {
ll M, K, X;
cin >> M >> K;
X = 1LL << M;
if (X <= K) {
PRI(-1);
return 0;
}
if (M == 0)PRI("0 0");
else if (M == 1) {
if (K == 0)PRI("0 0 1 1");
else PRI(-1);
}
else {
REP(i, 0, X)if (i != K)PRI(i << " ");
PRI(K << " ");
for (int i = X-1; i >= 0; --i) if (i != K)PRI(i << " ");
PRI(K);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M, X;
cin >> N >> M >> X;
vector<ll> price(N);
vector<vector<ll>> book(N, vector<ll>(M));
for(ll i = 0; i < N; i++) {
cin >> price.at(i);
for(ll j = 0; j < M; j++) {
cin >> book.at(i).at(j);
}
}
ll ans = -1;
for(ll bit = 0; bit < (1 << N); bit++) {
ll currentPrice = 0;
vector<ll> skill(M, 0);
for(ll i = 0; i < N; i++) {
if(bit & (1 << i)) {
currentPrice += price.at(i);
for(ll j = 0; j < M; j++) {
skill.at(j) += book.at(i).at(j);
}
bool flag = true;
for(ll j = 0; j < M; j++) {
if(skill.at(j) < X) {
flag = false;
break;
}
}
if(flag) {
if(ans == -1) {
ans = currentPrice;
} else {
ans = min(ans, currentPrice);
}
}
}
}
}
cout << ans << endl;
} | 0 | 74,264,354 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>
using namespace std;
inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
const long double EPS = 1e-12;
const int INF = 10000;
map<char,int>mc;
int decode(string str){
int res=0;
int tmp=1;
REP(i,SZ(str)){
if(str[i]>='0'&&str[i]<='9'){
tmp=(unsigned int)(str[i]-'0');
}else{
res+=tmp*mc[str[i]];
tmp=1;
}
}
return res;
}
string encode(int sum){
string res="";
if(sum>=1000){
if(sum/1000==1)res+='m';
else res+=(toString((int)(sum/1000))+'m');
sum%=1000;
}
if(sum>=100){
if(sum/100==1)res+='c';
else res+=(toString((int)(sum/100))+'c');
sum%=100;
}
if(sum>=10){
if(sum/10==1)res+='x';
else res+=(toString((int)(sum/10))+'x');
sum%=10;
}
if(sum==1)res+='i';
else if(sum>=2)res+=(toString(sum)+'i');
return res;
}
int main(){
int N;
cin>>N;
mc.insert(MP('m',1000));
mc.insert(MP('c',100));
mc.insert(MP('x',10));
mc.insert(MP('i',1));
REP(T,N){
string s1,s2;
cin>>s1>>s2;
cout<<encode(decode(s1)+decode(s2))<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mini;
cin>>n;
int a[n+1],cnt=0;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
mini=i;
for(int j=i;j<n;j++)
{
if(a[j]<a[mini])
mini=j;
}
swap(a[i],a[mini]);
if(i!=mini)
cnt++;
}
for(int i=0;i<n;i++)
{
cout<<a[i];
if(i!=n-1)
cout<<" ";
}
cout<<endl<<cnt<<endl;
} | 0 | 57,424,512 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 1000000000000
#define MOD 1000000007
int main(){
ll n;
cin >> n;
vector<int> a,b;
REP(i,n){
ll tmp1,tmp2;
cin >> tmp1 >> tmp2;
a.push_back(tmp1);
b.push_back(tmp2);
}
ll total = 0;
REPD(i,n){
ll tmp = (b[i] - (a[i]+total)%b[i]);
if(tmp != b[i]){
total += tmp;
}
}
cout << total << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int main(){
int n;
cin >> n;
vector<int> a(n/2);
vector<int> b(n/2);
rep(i, n) {
if (i%2==0) cin >> a[i/2];
else cin >> b[i/2];
}
map<int, int> ma;
map<int, int> mb;
int x1 = 0, y1 = 0;
int x2 = 0, y2 = 0;
rep(i, n/2) {
ma[a[i]]++;
mb[b[i]]++;
}
vector<P> va;
vector<P> vb;
for(auto m: ma) {
va.push_back(m);
}
for (auto m: mb) {
vb.push_back(m);
}
auto comp = [](P a, P b) {
return a.second>b.second;
};
sort(whole(va), comp);
sort(whole(vb), comp);
int ans = 0;
if (va[0].first!=vb[0].first) {
ans = n - va[0].second - vb[0].second;
}
else {
if (va.size()==1 && vb.size()==1) ans = n/2;
else if (va.size()==1) {
ans = n - va[0].second - vb[1].second;
}
else if (vb.size()==1) {
ans = n - va[1].second - vb[0].second;
}
else {
ans = n - va[0].second - vb[1].second;
chmin(ans, n - va[1].second - vb[0].second);
}
}
cout << ans << endl;
return 0;
} | 0 | 22,622,291 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N+1), b(N+1), c(N+1);
for (int i = 1; i <= N; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<int> aa(N+1, a[1]), bb(N+1, b[1]), cc(N+1, c[1]);
for (int i = 2; i <= N; i++) {
aa[i] = max(bb[i-1], cc[i-1]) + a[i];
bb[i] = max(aa[i-1], cc[i-1]) + b[i];
cc[i] = max(bb[i-1], aa[i-1]) + c[i];
}
cout << max({aa[N], bb[N], cc[N]}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
string T = "keyence",S1 = " ", S2 = " ",T1;
int k = 0;
bool flag = true;
for(int i = 0; i < S.size(); i++){
if(S[i] != T[k] && flag == true){
flag = false;
S1 = S.substr(0,i);
reverse(T.begin(),T.end());
T1 = T.substr(0,7-k);
}
}
reverse(T.begin(),T.end());
reverse(S.begin(),S.end());
string S3 = S1 + S2;
if(S1 == T || S2 == T || S3 == T || S == T) cout << "YES" << endl;
else cout << "NO" << endl;
} | 0 | 11,665,611 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 105 + 5;
ll a[maxn];
int main()
{
ios::sync_with_stdio(false);
int n ; cin >> n;
for (int i = 1 ; i <= n ; i++){
cin >> a[i];
}
sort(a + 1 , a + 1 + n);
ll ans = 1e18;
for (int i = a[1] ; i <= a[n] ; i++){
ll res = 0;
for (int j = 1 ; j <= n ; j++){
res += (a[j] - i) * (a[j] - i);
}
ans = min (ans , res);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
string S, T;
cin >> S >> T;
int lenS = S.size(), lenT = T.size();
int res = -1;
for (int i = lenS - lenT; i >= 0; i--) {
bool same = true;
for (int j = 0; j < lenT; j++) {
if (S[i+j] != '?' && S[i+j] != T[j]) same = false;
}
if (same) {
res = i;
break;
}
}
if (res == -1) cout << "UNRESTORABLE" << '\n';
else {
for (int i = res; i < res + lenT; i++) S[i] = T[i - res];
for (char c : S) cout << (c == '?' ? 'a' : c);
cout << '\n';
}
} | 0 | 40,253,272 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0)
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define SZ(c) ((int)(c).size())
#define debug(x) cerr << #x << " = " << (x) << '\n';
using P = pair<int,int>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll MOD = 1000000007;
const int INF = 1 << 30;
class UnionFind {
public:
UnionFind(int N) {
_N = N;
_make_set();
}
int find(int x) {
if (_parent[x] != x) {
_parent[x] = find(_parent[x]);
}
return _parent[x];
}
void unite(int x, int y) {
int x_root = find(x);
int y_root = find(y);
if (x_root == y_root) return;
int x_rank = _rank[x_root];
int y_rank = _rank[y_root];
if (x_rank > y_rank) {
_parent[y_root] = x_root;
_size[x_root] += _size[y_root];
} else if (x_rank < y_rank) {
_parent[x_root] = y_root;
_size[y_root] += _size[x_root];
} else {
_parent[y_root] = x_root;
_rank[x_root] += 1;
_size[x_root] += _size[y_root];
}
}
bool same_set(int x, int y) { return find(x) == find(y); }
int size(int x) { return _size[find(x)]; }
private:
int _N;
vector<int> _parent, _rank, _size;
void _make_set() {
_parent = vector<int>(_N + 1);
iota(_parent.begin(), _parent.end(), 0);
_rank = vector<int>(_N + 1, 0);
_size = vector<int>(_N + 1, 1);
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
int N, Q; cin >> N >> Q;
auto uf = UnionFind(N);
REP(_, Q) {
int t, u, v; cin >> t >> u >> v;
u++; v++;
if (t == 0) {
uf.unite(u, v);
} else {
cout << (uf.same_set(u, v) ? 1 : 0) << '\n';
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
double a, b;
cin >> a >> b;
int answer = -1;
int answerbegin = (int)(a/0.08 +0.9);
int answerend = (int)((a+1)/0.08 +0.9);
bool br = false;
for(int i=answerbegin; i<answerend; i++){
for(int j=0; j<10; j++){
if( i==(10*b+j) ){
answer = i;
br = true;
break;
}
}
if(br) break;
}
cout << answer;
} | 0 | 74,000,764 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int W, H; cin >> W >> H;
ll p[W+1]; FOR(i,0,W) cin >> p[i];
ll q[H+1]; FOR(i,0,H) cin >> q[i];
p[W] = q[H] = 1e9;
sort(p, p + W);
sort(q, q + H);
int x = 0, y = 0;
ll cost = 0;
while(x < W || y < H) {
if(p[x] < q[y]) {
cost += p[x] * (H + 1 - y);
x++;
} else {
cost += q[y] * (W + 1 - x);
y++;
}
}
cout << cost << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
constexpr int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
constexpr int INF = 1e9;
constexpr int MOD = 1e9 + 7;
constexpr long long LINF = 1e18;
constexpr double EPS = 1e-10;
constexpr double PI = M_PI;
void solve() {
int H, W, D;
cin >> H >> W >> D;
vector<vector<int>> A(H, vector<int>(W));
for (int i=0; i<H; ++i) {
for (int j=0; j<W; ++j) {
cin >> A[i][j];
}
}
int Q;
cin >> Q;
vector<pair<int, int>> lr(Q);
for (int i=0; i<Q; ++i) cin >> lr[i].first >> lr[i].second;
vector<pair<int, int>> rev(H*W+1);
for (int i=0; i<H; ++i) {
for (int j=0; j<W; ++j) {
rev[A[i][j]] = make_pair(i, j);
}
}
vector<ll> sum(H*W+1);
for (int i=1; i<H*W+1; ++i) {
if (i > D) {
int pi = rev[i-D].first, pj = rev[i-D].second;
int ci = rev[i].first, cj = rev[i].second;
sum[i] = sum[i-D] + abs(pi - ci) + abs(pj - cj);
}
}
for (auto p : lr) cout << sum[p.second] - sum[p.first] << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
solve();
return 0;
} | 0 | 43,333,751 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> d(N);
for (long i=0; i<N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
long diff = d.at(d.size()/2)-d.at(d.size()/2-1);
cout << diff << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> grid(h, vector<char>(w));
rep(y, h) rep(x, w) cin >> grid[y][x];
set<int> empty_row = [&] {
set<int> ans;
rep(y, h) {
bool ok = [&] {
rep(x, w) {
if (grid[y][x] == '#') return false;
}
return true;
}();
if (ok) ans.insert(y);
}
return ans;
}();
vector<vector<char>> grid2;
rep(y, h) if (!contain(empty_row, y)) grid2.push_back(grid[y]);
h = grid2.size();
set<int> empty_column = [&] {
set<int> ans;
rep(x, w) {
bool ok = [&] {
rep(y, h) {
if (grid2[y][x] == '#') return false;
}
return true;
}();
if (ok) ans.insert(x);
}
return ans;
}();
vector<vector<char>> grid3(h);
rep(y, h) {
rep(x, w) {
if (contain(empty_column, x)) continue;
grid3[y].push_back(grid2[y][x]);
}
}
w = grid3[0].size();
rep(y, h) {
rep(x, w) cout << grid3[y][x];
cout << endl;
}
} | 0 | 15,066,385 |
#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 (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll 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 unsigned long long ull;
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; cin >> n;
int ans = 1;
while(ans <= n) {
ans *= 2;
}
print(ans / 2);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<int> cand(N, 1);
rep(i, K) {
int d;
cin >> d;
rep(i, d) {
int a;
cin >> a;
--a;
cand[a] = 0;
}
}
int ans = 0;
rep(i, N) ans += cand[i];
cout << ans << '\n';
return 0;
} | 0 | 20,390,782 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const ll dx[4] = { 0, -1, 1, 0 };
const ll dy[4] = { -1, 0, 0, 1 };
const ll INF = 1e9 + 7;
const ll inf = 1LL << 50;
int gcd(int x, int y) {
if (x < y)swap(x, y);
if (y == 0)return x;
return gcd(y, x%y);
}
void mul(ll a, ll b) {
a = a * b % INF;
}
ll T[100100], A[100100];
ll ans[100100];
int main() {
ll N; cin >> N;
bool ok = true;
REP(i, N)cin >> T[i];
REP(i, N)cin >> A[i];
for (int i = 0; i < N; ++i) {
ans[i] = min(T[i], A[i]);
}
ans[0] = 1;
ans[N - 1] = 1;
for (int i = 0; i < N - 1; ++i) {
if (T[i] != T[i + 1]) {
ans[i + 1] = 1;
}
}
for (int i = N - 1; i >= 1; --i) {
if (A[i] != A[i - 1]) {
ans[i-1] = 1;
}
}
ll res = 1;
for (int i = 0; i < N; ++i) {
res *= ans[i];
res %= INF;
}
if (A[0] != T[N-1]) {
ok = false;
}
for (int i = 0; i < N - 1; ++i) {
if (T[i] != T[i + 1] ) {
if (T[i+1] > A[i+1]) {
ok = false;
}
}
}
for (int i = N - 1; i >= 1; --i) {
if (A[i] != A[i - 1]) {
if (A[i - 1] > T[i - 1]) {
ok = false;
}
}
}
if (ok) {
cout << res << endl;
}
else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<char>> vec;
int main(){
ll H,W,ans=0;
cin>>H>>W;
ll dp[111][111];
vec.resize(H,vector<char>(W));
vector<vector<ll>> answer(H,vector<ll>(W));
for(ll i=0;i<H;i++){
for(ll j=0;j<W;j++){
cin>>vec.at(i).at(j);
}
}
if(vec.at(0).at(0)=='#'){ans++;}
for(ll i=1;i<=H;i++){
for(ll j=1;j<=W;j++){
if(i==1&&j==1){
dp[i][j]=0;
}else if(i==1&&j!=1){
dp[i][j]=dp[i][j-1];
if(vec.at(i-1).at(j-1)=='#'&&vec.at(i-1).at(j-2)=='.'){dp[i][j]++;}
}else if(i!=1&&j==1){
dp[i][j]=dp[i-1][j];
if(vec.at(i-1).at(j-1)=='#'&&vec.at(i-2).at(j-1)=='.'){dp[i][j]++;}
}else{
ll a;
a=dp[i][j-1];
if(vec.at(i-1).at(j-1)=='#'&&vec.at(i-1).at(j-2)=='.'){a++;}
ll b;
b=dp[i-1][j];
if(vec.at(i-1).at(j-1)=='#'&&vec.at(i-2).at(j-1)=='.'){b++;}
dp[i][j]=min(a,b);
}
}
}
cout<<dp[H][W]+ans<<endl;
} | 0 | 64,226,196 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
ll gcd(ll a, ll b) {
if (b == 0) { return a; }
if (a < b) { return gcd(b, a); }
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
struct edge {
ll ind;
ll to;
ll d;
};
void WF(ll N, vector<vector<ll>> &g) {
repn(k, N) {
repn(i, N) {
repn(j, N) {
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}
int main() {
ll N,M,R;
cin >>N>>M>>R;
vector<ll> r(R+1);
repn(i,R) cin >>r[i];
vector<vector<ll>> g(N+1,vector<ll>(N+1,INF));
repn(i,M){
ll a,b,c;
cin >>a>>b>>c;
g[a][b]=c;
g[b][a]=c;
}
WF(N,g);
ll ans=INF;
vector<ll> v(R+1);
repn(i,R) v[i]=i;
do{
ll d=0;
repn(i,R-1) d+=g[r[v[i]]][r[v[i+1]]];
ans=min(ans,d);
}
while(next_permutation(++v.begin(),v.end()));
cout <<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;
int main() {
Int N, M, V, P;
cin >> N >> M >> V >> P;
vector<Int> A(N);
for (Int i = 0; i < N; i++) {
cin >> A[i];
}
sort(all(A));
A.push_back(INF);
Int ok = N - 1;
Int ng = -1;
while (abs(ok - ng) > 1) {
Int mid = (ok + ng) / 2;
Int index = upper_bound(all(A), A[mid] + M) - A.begin();
Int k = N - index + 1;
Int v = V;
if (mid < v - 1) {
v -= mid + 1;
if (k - 1 < v) {
v -= k - 1;
Int x = v * M;
for (Int i = mid + 1; i < index; i++) {
x -= A[mid] + M - A[i];
}
if (x > 0) {
Int cnt = 0;
for (Int i = index - 1; i > mid; i--) {
x -= A[i] - A[mid];
cnt++;
if (x <= 0) break;
}
k += cnt;
}
}
}
if (k <= P) {
ok = mid;
} else {
ng = mid;
}
}
dump(N - ok);
return 0;
} | 0 | 25,303,390 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x:-x;
}
ll v[65],a[maxn],n,cnt[65],ans;
inline void ins(ll x)
{
for(ll i=60;i>=0;i--)
{
if(x&(1ll<<i))
{
if(v[i]) x^=v[i];
else {v[i]=x; break;}
}
}
}
inline ll qm()
{
ll tmp=0;
for(int i=60;i>=0;i--) if((tmp^v[i])>tmp) tmp^=v[i];
return tmp;
}
int main()
{
n=read(); rep(i,1,n) a[i]=read();
rep(x,0,60) rep(j,1,n) if(a[j]&(1ll<<x)) cnt[x]++;
per(i,60,0)
{
if(cnt[i]&1)
{
ans+=(1ll<<i);
rep(j,1,n) if(a[j]&(1ll<<i)) a[j]^=(1ll<<i);
}
}
rep(i,1,n) ins(a[i]); printf("%lld\n",ans+2*qm());
return 0;
} | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int N; cin >> N;
map<long long, long long> mp;
mp[0] = 1;
long long sum = 0;
long long res = 0;
for(int i=0;i<N;i++){
long long a; cin >> a;
sum += a;
if(mp.count(sum)){
res += mp[sum];
mp[sum]++;
} else {
mp[sum] = 1;
}
}
cout << res << endl;
} | 0 | 3,637,212 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
ll a,b,k; cin>>a>>b>>k;
for (int i=0; i<k; i++) {
if(i%2) swap(a,b);
if(a%2) a--;
a/=2;
b+=a;
if(i%2) swap(a,b);
}
cout<<a<<" "<<b<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#ifdef int
const ll INF = (1LL<<60);
#else
const int INF = (1LL<<30);
#endif
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
signed main(void)
{
int h, w, d;
cin >> h >> w >> d;
REP(i, h) {
REP(j, w) {
int x = i+j+5000, y = i-j+5000;
x /= d, y /= d;
if(x%2 && y%2) {
cout << "R";
} else if(x%2) {
cout << "G";
} else if(y%2) {
cout << "B";
} else {
cout << "Y";
}
}
cout << endl;
}
return 0;
} | 0 | 60,356,417 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
vector<Pll> B(N);
rep(i,N){
B[i] = Pll(A[i],i);
}
sort(B.begin(), B.end());
ll ans = 0;
rep(i,N){
if(B[i].se%2 != i%2) ans++;
}
cout << ans/2 << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define SZ(x) x.size()
#define fi first
#define se second
const int INF = 1e9;
using namespace std;
template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;
using pi=pair<int,int>;
using vi=vc<int>;
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;}
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
while(true){
int M,nl,nr; cin >> M >> nl >> nr;
if(M==0) break;
int A[M]; rep(i,M) cin >> A[i];
int ans;
int pos=-1;
rng(i,nl-1,nr){
if(chmax(pos,A[i]-A[i+1])) ans=i+1;
}
cout << ans << "\n";
}
} | 0 | 47,911,280 |
#include <iostream>
using namespace std;
void solve(std::string S){
string t = "2019/04/30";
if (S <= t) cout << "Heisei" << '\n';
else cout << "TBD" << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
std::string S;
std::cin >> S;
solve(S);
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
#include <list>
#include <deque>
typedef long long ll;
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 int MOD = 1000000007;
const ll INF = 1LL << 60;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : a; }
ll LCM(ll a, ll b) {return a / GCD(a, b) * b;}
int main()
{
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++) cin >> a[i];
deque<int> b;
for(int i = 0; i < n; i++)
{
if(i % 2 == 0) b.push_back(a[i]);
if(i % 2 != 0) b.push_front(a[i]);
}
if(n % 2 == 0)
{
for(int i = 0; i < n - 1; i++)
{
cout << b[i] << " ";
}
cout << b[n - 1] << endl;
}
else
{
for(int i = n - 1; i >= 1; i--)
{
cout << b[i] << " ";
}
cout << b[0] << endl;
}
} | 0 | 82,174,876 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <utility>
#include <tuple>
#include <cctype>
using namespace std;
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
int dx[8]={0,0,-1,1,1,1,-1,-1};
int dy[8]={-1,1,0,0,1,-1,1,-1};
const int SIZE=1050;
int main(){
int N,K;
cin>>N>>K;
vint A,B;
for(int i=0;i<N;i++){
int a,b;
cin>>a>>b;
A.pb(a);
B.pb(b);
}
bool bit[32]={};
for(int i=0;i<32;i++){
bit[i]=(K>>i&1);
}
ll ans=0,sum=0;
for(int i=0;i<N;i++){
bool flag=0;
for(int j=0;j<32;j++){
if(!bit[j] && bit[j]!=(A[i]&(1<<j)))
flag=1;
}
if(!flag)
sum+=B[i];
}
ans=sum;
for(int i=0;i<32;i++){
if(bit[i]){
sum=0;
for(int j=0;j<N;j++){
bool flag=0;
for(int k=31;k>=0;k--){
if(k<i){
}
else if(k==i){
if(A[j]&(1<<k))
flag=1;
}
else{
if(!bit[k] && bit[k]!=(A[j]&(1<<k)))
flag=1;
}
}
if(!flag){
sum+=B[j];
}
}
ans=max(ans,sum);
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
map<char,bool> right;
right['y']=right['u']=right['i']=right['o']=right['p']=
right['h']=right['j']=right['k']=right['l']=
right['n']=right['m']=true;
int cnt=0;
char now=getchar(),before;
while(before=now,now=getchar(),before!='#'){
if(now=='\n'){
cout<<cnt<<endl;
cnt=0;
now=getchar();
}else if(right[before]^right[now]){
cnt++;
}
}
return 0;
} | 0 | 92,210,755 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
int n = N;
int f = 0;
while(n>0){
f += n%10;
n /= 10;
}
cout << (N%f==0? "Yes": "No") << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(void)
{
long long int n,m,i,max=0,min=10000000,all=0;
cin>>n;
for(i=1;i<=n;i++){
cin>>m;
all=all+m;
if(max<=m) max=m;
if(min>=m) min=m;
}
if(n==1) cout<<m<<" "<<m<<" "<<m<<endl;
else cout<<min<<" "<<max<<" "<<all<<endl;
return 0;
} | 0 | 66,091,243 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define mem(a,val) memset(a, val, sizeof a)
#define maxn 100010
#define INF 1e15
#define ff first
#define ss second
#define endl '\n'
typedef long long ll;
int n, k;
int cum[maxn], sum[maxn];
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
cin >> s;
vector<int> v;
int cnt = 1;
for (int i = 1; i < n; ++i) {
if (s[i] != s[i - 1]) {
v.push_back(cnt);
if (s[i - 1] == '0') cum[(int)v.size()] = 1;
cnt = 1;
}
else cnt++;
}
v.push_back(cnt);
if (s[n - 1] == '0') cum[(int)v.size()] = 1;
n = v.size();
for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + v[i - 1];
for (int i = 1; i <= n; ++i) cum[i] += cum[i - 1];
int ans = 0;
for (int i = 0; i < n; ++i) {
int lo = 0, hi = n - i - 1;
while (lo <= hi) {
int mid = (lo + hi) >> 1;
if (cum[mid + i + 1] - cum[i] <= k) {
ans = max(ans, sum[mid + i + 1] - sum[i]);
lo = mid + 1;
}
else hi = mid - 1;
}
}
cout << ans << endl;
} | #include<cstdio>
#include<algorithm>
using namespace std;
int yaku[10000];
int array_addr = 0;
void Yakunum(int c){
int i = 1;
while(i != c+1){
if(c % i == 0){
yaku[array_addr] = i;
array_addr++;
}
i++;
}
}
int main(){
int a,b,c,yaku_cout=0;
scanf("%d %d %d",&a,&b,&c);
Yakunum(c);
for(int i=a;i<=b;i++){
for(int j=0;j<array_addr;j++){
if(i == yaku[j]){
yaku_cout++;
}
}
}
printf("%d\n",yaku_cout);
return 0;
} | 0 | 95,252,809 |
End of preview. Expand
in Dataset Viewer.
- Downloads last month
- 102