code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
#include <functional>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
map<ll,ll> prime;
void prime_factorize(ll n){
if(n<=1) return;
ll l=sqrt(n);
for(ll i=2;i<=(ll)(l);i++) {
if(n%i==0){
prime_factorize(i);prime_factorize(ll(n/i));return;
}
}
prime[n]++;return;
}
int main() {
ll N;
cin >> N;
ll lastA = 0, firstB = 0, lastA_firstB = 0;
ll count = 0;
for(int i = 0; i < N; i++) {
string S;
cin >> S;
auto found = S.find("AB");
while(found != string::npos) {
count++;
found = S.find("AB", found + 2);
}
if(S[0] == 'B' && S[S.size()-1] == 'A') lastA_firstB++;
else if(S[0]=='B') firstB++;
else if(S[S.size()-1] == 'A') lastA++;
}
if(lastA_firstB >= 1) {
count += lastA_firstB - 1;
if(firstB > 0) {
count += 1;
firstB--;
}
if(lastA > 0) {
count += 1;
lastA--;
}
}
count += min(firstB, lastA);
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
int N, M;
Graph G;
void solve() {
vector<int> dist(N, -1);
vector<int> prev(N, -1);
queue<int> que;
que.push(0);
dist[0] = 0;
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv] == -1) {
dist[nv] = dist[v] + 1;
prev[nv] = v;
que.push(nv);
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i) cout << prev[i] + 1 << endl;
}
int main() {
cin >> N >> M;
G.assign(N, vector<int>());
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
solve();
}
| 0
| 98,463,891
|
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 / gcd(a, b)* b;
}
int kan_hyaku(int n){
int kurai = 0;
for(int i=0;i<3;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ju(int n){
int kurai = 0;
for(int i=0;i<2;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ichi(int n){
int kurai = 0;
for(int i=0;i<1;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int keta(int n){
int wa = 1;
while(n>0){
wa *=10;
n--;
}
return wa;
}
double kan_half(int n){
double wa = 1;
while(n>0){
wa *= 0.5;
n--;
}
return wa;
}
ll facctorialMethod(ll k){
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum = sum%1000000007 * i%1000000007;
}
return sum;
}
bool red[100010] = {};
int main() {
int n,k;
cin >> n >> k;
if(k==1){
cout << 0 << endl;
return 0;
}
else{
cout << (n-k)+1 - 1 << endl;
}
}
|
#include<stdio.h>
int main(){
int x;
int y;
scanf ("%d %d",&x,&y);
int IR = 100*(10-x);
int IRT = y+ IR;
if(x<=10){
printf("%d",IRT);
}
else {
printf("%d",y);
}
return 0;
}
| 0
| 86,323,608
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
int main()
{
long long h, w;
cin >> h >> w;
long long s[3], smin1, smin2, tmp, ans = INT_MAX;
for(int i = 1; i <= h; i++){
s[0] = i * w;
s[1] = ((h - i) / 2) * w;
if((h-i)%2==0){
s[2] = s[1];
}
else{
s[2] = ((h - i) / 2 + 1) * w;
}
sort(s, s+3);
smin1 = s[2] - s[0];
s[0] = i * w;
s[1] = (h - i) * (w / 2);
if(w%2==0){
s[2] = s[1];
}
else{
s[2] = (h - i) * (w / 2 + 1);
}
sort(s, s+3);
smin2 = s[2] - s[0];
tmp = min(smin1, smin2);
ans = min(ans, tmp);
}
for(int i = 1; i <= w; i++){
s[0] = i * h;
s[1] = ((w - i) / 2) * h;
if((w-i)%2==0){
s[2] = s[1];
}
else{
s[2] = ((w - i) / 2 + 1) * h;
}
sort(s, s+3);
smin1 = s[2] - s[0];
s[0] = i * h;
s[1] = (w - i) * (h / 2);
if(h%2==0){
s[2] = s[1];
}
else{
s[2] = (w - i) * (h / 2 + 1);
}
sort(s, s+3);
smin2 = s[2] - s[0];
tmp = min(smin1, smin2);
ans = min(ans, tmp);
}
cout << ans;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
int main() {
int n;
cin >> n;
vl x(n), y(n);
bool gu = false, ki = false;
rep (i, n) {
cin >> x[i] >> y[i];
if ((x[i] + y[i]) % 2 == 0) {
gu = true;
}
else {
ki = true;
}
}
if (gu && ki) {
cout << -1 << endl;
return 0;
}
int m = 40;
vl d(m);
if (gu) {
d[m - 1] = 1;
d[m - 2] = 1;
rrep1 (i, m - 2) {
d[i - 1] = d[i] * 2;
}
}
else {
d[m - 1] = 1;
rrep1 (i, m - 1) {
d[i - 1] = d[i] * 2;
}
}
cout << m << endl;
rep (i, m) {
cout << d[i] << " ";
}
cout << endl;
rep (j, n) {
ll u = x[j] + y[j], v = x[j] - y[j];
ll now_x = 0, now_y = 0;
string w;
rep (i, m) {
if (now_x <= u && now_y <= v) {
w.push_back('R');
now_x += d[i];
now_y += d[i];
}
else if (now_x <= u && now_y > v) {
w.push_back('U');
now_x += d[i];
now_y -= d[i];
}
else if (now_x > u && now_y > v) {
w.push_back('L');
now_x -= d[i];
now_y -= d[i];
}
else {
w.push_back('D');
now_x -= d[i];
now_y += d[i];
}
}
cout << w << endl;
}
}
| 0
| 82,974,710
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int ctoi(char c) {return c-'0';}
int gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int lcm(ll a,ll b){return a*b/gcd(a,b);}
int main(){
int n;
cin >> n;
vector<int>a(n);
int ans =0 ;
for(int i=0;i<n;i++)cin >> a.at(i);
int che =1;
for(int i=1;i<n;i++){
if(a.at(i-1)==a.at(i))che++;
else{
ans+=che/2;
che=1;
}
if(i==n-1)ans+=che/2;
}
cout<<ans<<endl;
}
|
#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();
}
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 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 REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF_INT = 2147483647;
const LL INF_LL = 9223372036854775807;
#define CLR(a) memset((a), 0, sizeof(a))
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const list<T> &lst) {
os << "{";
REPI(itr, lst) {
os << *itr;
itr++;
if (itr != lst.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
REPI(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
static const int MAX = 100000;
static const int INFTY = (1 << 29);
VI G[MAX];
list<int> out;
bool V[MAX];
int N;
int indeg[MAX];
void bfs(int s) {
queue<int> q;
q.push(s);
V[s] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
out.PB(u);
REP(i, G[u].size()) {
int v = G[u][i];
indeg[v]--;
if (indeg[v] == 0 && !V[v]) {
V[v] = true;
q.push(v);
}
}
}
}
void tsort() {
REP(i, N) indeg[i] = 0;
REP(u, N) {
REP(i, G[u].size()) {
int v = G[u][i];
indeg[v]++;
}
}
REP(u, N) if (indeg[u] == 0 && !V[u]) bfs(u);
REPI(it, out) cout << *it << endl;
}
int main(void) {
int M;
cin >> N >> M;
REP(i, N) V[i] = false;
REP(i, M) {
int s, t;
cin >> s >> t;
G[s].PB(t);
}
tsort();
return 0;
}
| 0
| 81,475,781
|
#include <bits/stdc++.h>
#include <string.h>
#define rep(i, n) for(int i=0; i < n; i++)
#define REP(i, n, m) for(int i=n; i < m; i++)
#define reps(i, n) for(int i=1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
using namespace std;
using ll=long long;
const ll INF = 1LL << 60;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
int main() {
int a,b,c,d,e;cin>>a>>b>>c>>d>>e;
cout<<60*c+d-60*a-b-e;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
int N = S.size();
vector<int>num(N);
for (int i = 0; i < N; i++) {
num.at(i) = S.at(i) - '0';
num.at(i) -= 49;
}
int Min;
int count = 0;
for (int i = 0; i < 26; i++) {
for (int j = 0; j < N; j++) {
if (num.at(j) == i){
break;
}
else if (j == N-1){
Min = i;
count++;
}
}
if (count > 0){
break;
}
}
if (N != 26){
cout << S;
printf("%c", Min + 'a');
}
else {
if (S == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
reverse(num.begin(), num.end());
for (int i = 0; i < 25; i++) {
if (num.at(i) > num.at(i+1)){
for (int j = 0; j < 26-i-2; j++) {
cout << S.at(j);
}
for (int k = 0; k <= i; k++) {
if (num.at(k) >= num.at(i+1)){
printf("%c", num.at(k) + 'a');
break;
}
}
cout << endl;
return 0;
}
}
}
}
| 0
| 53,269,830
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> sort_vec;
for (int i = 0; i < n; i++) {
int entry;
cin >> entry;
sort_vec.push_back(entry);
}
int n_swaps = 0;
for (int i = 0; i < n; i++) {
int min_index = i;
for (int j = i+1; j < n; j++) {
if (sort_vec[j] < sort_vec[min_index]) min_index = j;
}
if (i != min_index) {
swap(sort_vec[i], sort_vec[min_index]);
n_swaps++;
}
}
for (int i = 0; i < n; i++) {
cout << sort_vec[i];
if (i < n - 1) cout << " ";
}
cout << endl;
cout << n_swaps << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
vector<int> A(10);
for (int i = 0; i < 4; i++){
int a;
cin >> a;
A.at(a)++;
}
if (A.at(1) && A.at(4) && A.at(7) && A.at(9)){
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| 0
| 72,645,468
|
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <regex>
#include <random>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exout(x) printf("%.12f\n", x)
const double pi = acos(-1.0);
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX_N = 1010101;
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)return 0;
return (x /gcd(x, y) * y );
}
ll par[101010];
ll rank2[101010];
void init(ll n) {
rep(i, n) {
par[i] = i;
rank2[i] = 0;
}
}
ll find(ll x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)return;
if (rank2[x] < rank2[y]) {
par[x] = y;
}
else {
par[y] = x;
if (rank2[x] == rank2[y]) {
rank2[x]++;
}
}
}
ll dx[8] = { 1,-1,0,0,1,1,-1,-1 };
ll dy[8] = { 0,0,1,-1,1,-1,1,-1 };
char c[2010][2010];
int main() {
ll n;
cin >> n;
vector<ll>a(n+1), b(n);
ll ans = 0;
rep(i, n+1) {
cin >> a[i];
}
ll target = 0;
rep(i, n) {
cin >> b[i];
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W; cin >> H >> W;
string S[H]; for (int i = 0; i < H; i++) cin >> S[i];
int L[H][W];
for (int i = 0; i < H; i++) {
int l = 0, r = 0, a = 0;
while (r != W) {
if (S[i][r] == '.') {
if (a == 0) l = r;
a++;
if (r == W-1) {
for (int j = l; j < r+1; j++) {
L[i][j] = a-1;
}
}
} else {
if (a != 0) {
for (int j = l; j < r; j++) {
L[i][j] = a-1;
}
}
a = 0;
L[i][r] = -1;
}
r++;
}
}
for (int i = 0; i < W; i++) {
int u = 0, d = 0, a = 0;
while (d != H) {
if (S[d][i] == '.') {
if (a == 0) u = d;
a++;
if (d == H-1) {
for (int j = u; j < d+1; j++) {
L[j][i] += a;
}
}
} else {
if (a != 0) {
for (int j = u; j < d; j++) {
L[j][i] += a;
}
}
a = 0;
L[d][i] = -1;
}
d++;
}
}
int ans = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
ans = max(ans, L[i][j]);
}
}
cout << ans << endl;
return 0;
}
| 0
| 72,484,702
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b,c,d,x;
string s,ss,sss;
int ans = 0;
string anss = "";
cin >> s >> ss;
int ab [] = {0 , 1 , 3 , 1 , 2 , 1 , 2 , 1 , 1 , 2 , 1 , 2 , 1};
int result3 = std::max({a, b, c});
if(s[0]==ss[2] && s[1] == ss[1] && s[2] == ss[0]) anss = "YES";
else anss = "NO";
cout << anss << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
reverse(S.begin(),S.end());
vector<string> T = {"dream","dreamer","erase","eraser"};
for(int i = 0; i < 4; i++){
reverse(T.at(i).begin(),T.at(i).end());
}
bool can =true;
for(int i = 0; i < S.size();){
bool can2 = false;
for(int j = 0; j < 4; j++){
string d = T.at(j);
if(S.substr(i,d.size()) == d){
can2 = true;
i += d.size();
}
}
if(!can2){
can = false;
break;
}
}
if(can)cout << "YES" << endl;
else cout << "NO" << endl;
}
| 0
| 51,634,593
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
long long k, a, b;
int main(){
cin >> k >> a >> b;
if(a >= b - 2 || a > k){
cout << k + 1 << endl;
}else{
long long rest = k - a + 1;
cout << a + ((rest / 2) * (b - a)) + rest % 2<< endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
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; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) { fill( (T*)array, (T*)(array+N), val ); }
template <class T1, class T2, class Pred = std::less<T2> >
struct sort_pair_second {
bool operator()(const std::pair<T1,T2>&left, const std::pair<T1,T2>&right) {
Pred p;
return p(left.second, right.second);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A == 1 && B == 13) {
cout << "Alice" << endl;
} else if (A == 13 && B == 1) {
cout << "Bob" << endl;
} else if (A == B) {
cout << "Draw" << endl;
} else if (A > B) {
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
return 0;
}
| 0
| 23,796,036
|
#include <cstdio>
struct Node {
int parent = -1;
int left_child = -1;
int right_sibling = -1;
unsigned int depth = 0;
const char* type() const
{
auto type =
parent == -1 ? "root" :
left_child == -1 ? "leaf" :
"internal node";
return type;
}
};
class RootedTree {
unsigned int n_;
Node* nodes_;
public:
RootedTree(unsigned int n) : n_(n), nodes_(new Node[n]) { }
~RootedTree() { delete[] nodes_; }
Node& operator[](unsigned int id) { return nodes_[id]; }
void set_depth()
{
set_depth_internal(root(), 0u);
}
void print_nodes() const
{
for (auto i = 0u; i < n_; ++i) {
auto node = nodes_[i];
std::printf("node %u: parent = %d, depth = %u, ", i, node.parent, node.depth);
std::printf("%s, [", node.type());
int next_c = node.left_child;
auto sep = "";
while (next_c != -1) {
std::printf("%s%d", sep, next_c);
sep = ", ";
next_c = nodes_[next_c].right_sibling;
}
std::printf("]\n");
}
}
private:
unsigned int root() const
{
for (auto i = 0u; i < n_; ++i) {
if (nodes_[i].parent == -1) {
return i;
}
}
return -1;
}
void set_depth_internal(unsigned int i, unsigned int depth)
{
nodes_[i].depth = depth;
if (nodes_[i].right_sibling != -1) {
set_depth_internal(nodes_[i].right_sibling, depth);
}
if (nodes_[i].left_child != -1) {
set_depth_internal(nodes_[i].left_child, depth+1);
}
}
};
int main()
{
unsigned int n;
std::scanf("%u", &n);
RootedTree tree(n);
for (auto i = 0u; i < n; ++i) {
unsigned int id, k, c;
std::scanf("%u %u", &id, &k);
int* next_p = &tree[id].left_child;
for (auto j = 0u; j < k; ++j) {
std::scanf("%u", &c);
tree[c].parent = id;
*next_p = c;
next_p = &tree[c].right_sibling;
}
}
tree.set_depth();
tree.print_nodes();
}
|
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
int n; cin >> n;
vector<ll> v(n);
priority_queue< ll, vector<ll>, greater<ll> > q;
rep(i,n){
cin >> v[i];
q.push(v[i]);
}
while (q.size() > 1) {
ll first = q.top();
q.pop();
ll second = q.top();
q.pop();
q.push(first);
if(second%first != 0) q.push(second%first);
}
cout << q.top();
return 0;
}
| 0
| 96,923,854
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
char a[55][55], b[55][55];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i <= n-m; i++) {
for (int j = 0; j <= n-m; j++) {
bool same = 1;
for (int k = 0; k < m; k++) {
for (int l = 0; l < m; l++) {
if (b[k][l] != a[i+k][j+l]) {
same = 0;
}
}
}
if (same) {
cout << "Yes\n";
return 0;
}
}
}
cout << "No\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=1;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}
int main(){
while(1){
char x;
int a=0,b=0,de[150],ch=0,f=0,it=0;
if(f=0){
f=1;
}
else scanf("%c",&x);
scanf("%c",&x);
if(x=='.') break;
while(1){
if(x=='(') {
a++;
it++;
de[it]=1;
}
if(x==')') {
if(de[it]==1){
a--;
it--;
}
else{ch=1;}
}
if(x=='['){
b++;
it++;
de[it]=2;
}
if(x==']'){
if(de[it]==2){
b--;
it--;
}
else{ch=1;}
}
if(a<0 || b<0){
ch=1;
}
scanf("%c",&x);
if(x=='.') break;
}
if(ch==0 &&a==0 && b==0) cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
return 0;
}
| 0
| 74,674,195
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define REP(i,a,b) for(int i=(int)(a); i<(int)(b); ++i)
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define SORT(x) sort(begin(x),end(x))
#define SELECT_SORT(x, n) sort(begin(x),begin(x)+n)
#define SWAP(type, a, b) do {type tmp = a; a = b; b = tmp;} while (0)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define INF 2000000000000
#define MAX 10
#define BAR() cout << "----------------------------" << endl;
#define DUMP(v) (cerr << #v << ": " << v << endl)
#define PRINT(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
int main()
{
int a[]={0};
int b[]={0};
int S= 0;
int T=0;
cin >> a[0] >> a[1] >> a[2] >> a[3];
cin >> b[0] >> b[1] >> b[2] >> b[3];
rep(i,4){
S += a[i];
T += b[i];
}
if(S >= T){
cout << S << endl;
}else{
cout << T << endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
ll n, p;
string s;
cin >> n >> p >> s;
ll ans = 0;
if (p == 2 || p==5) {
for (int i = 0; i < n; i++) {
if ((s[i] - '0') % p == 0)ans += i + 1;
}
cout << ans << endl;
}
else {
ll now = 0;
vector<ll> z(p);
z[0]++;
for (int i = n-1; i > -1; i--) {
now = ((s[i] - '0')*modpow(10,n-1-i,p) + now);
now %= p;
z[now]++;
}
for (int i = 0; i < p; i++) {
ans += z[i] * (z[i] - 1) / 2;
}
cout << ans << endl;
}
}
| 0
| 11,096,008
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
int main(){
string s;
while(getline(cin,s)&&s!="."){
bool res = true;
stack<char> st;
rep(i,s.size()){
if(s[i]=='(' || s[i]=='[')st.push(s[i]);
if(s[i]==')'){
if(st.size()&&st.top()=='(')st.pop();
else {res=false;break;}
}
if(s[i]==']'){
if(st.size()&&st.top()=='[')st.pop();
else {res=false;break;}
}
}
if(st.size()==0&&res)cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main(int argc, char **argv)
{
int N, K;
string S;
cin >> N >> K >> S;
int c[N + 2];
REP(i, N + 2) c[i] = 0;
int itr = 0;
bool f = (S[0] == '0')? true : false;
if (f) {
c[0] = 0;
itr++;
}
c[itr]++;
FOR(i, 1, N) {
if (S[i] == S[i - 1]) {
c[itr]++;
}
else {
itr++;
c[itr]++;
}
}
itr++;
if (S[N - 1] == '0') {
c[itr] = 0;
itr++;
}
int sum = c[0];
for (int i = 0; i < K; ++i) {
if (i * 2 + 1 < itr) sum += c[i * 2 + 1];
if (i * 2 + 2 < itr) sum += c[i * 2 + 2];
}
int maxSum = sum;
int start = 2 * K + 1;
int rstart = 0;
for (int i = start; i < itr; i += 2, rstart += 2) {
sum -= c[rstart];
sum -= c[rstart + 1];
sum += c[i];
sum += c[i + 1];
if (sum > maxSum) maxSum = sum;
}
cout << maxSum << endl;
return 0;
}
| 0
| 64,417,305
|
#include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
#define int long long
class BAtCoderBeginnerContest111 {
public:
void solve(std::istream &in, std::ostream &out) {
int n;
in >> n;
int t = 111;
int i = 1;
while (n > t) {
i++;
t = 111 * i;
}
out << 111 * i << endl;
}
};
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout << fixed;
BAtCoderBeginnerContest111 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
typedef long double ld;
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;
#define MOD 1000000007
#define MAX_V 100010
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N]={0};
ll fib(ll a){
if (fibl[a]!=0)return fibl[a];
if (a==0){
return 0;
}else if (a==1){
return 1;
}
return fibl[a]=fib(a-1)+fib(a-2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i=0; i<=n; ++i) x[i] = true;
x[0] = x[1] = false;
for(int i=2; i<=n; ++i) {
if(x[i]) {
p++;
for(int j=2*i; j<=n; j+=i) x[j] = false;
}
num[i] = p;
}
return p;
}
bool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.second < secondElof.second;
}
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
ll junnretu(ll n){
ll ans=1;
for (ll i=1;i<=n;i++){
ans*=i;
}
return ans;
}
map<ll,ll> prime_factor(ll n){
map<ll,ll> mp;
for(ll i=2; i*i<=n; i++){
while(n % i == 0){
mp[i]++;
n /= i;
}
}
if(n != 1) mp[n] = 1;
return mp;
}
ll keta(ll N){
int tmp{};
while( N > 0 ){
tmp += ( N % 10 );
N /= 10;
}
N = tmp;
return N;
}
int main(){
ll a;
cin>> a;
if (a<1200){
cout << "ABC" << endl;
}else if (a<2800)cout << "ARC" << endl;
else cout << "AGC" << endl;
return 0;
}
| 0
| 14,167,615
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> w(n);
vector<int> a;
rep(i,n) cin >> w.at(i);
for(int t = 1; t <= n; t++){
int sum1 = 0,sum2 = 0;
for(int i = 1; i <= n; i++){
if(i <= t) sum1 += w.at(i-1);
else sum2 += w.at(i-1);
}
a.push_back(abs(sum2-sum1));
}
sort(a.begin(),a.end());
cout << a.at(0) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
char a,b;
int main(){
cin>>a>>b;
if(a=='A'&&b=='A')cout<<"="<<endl;
if(a=='A'&&b=='B')cout<<"<"<<endl;
if(a=='A'&&b=='C')cout<<"<"<<endl;
if(a=='A'&&b=='D')cout<<"<"<<endl;
if(a=='A'&&b=='E')cout<<"<"<<endl;
if(a=='A'&&b=='F')cout<<"<"<<endl;
if(a=='B'&&b=='A')cout<<">"<<endl;
if(a=='B'&&b=='B')cout<<"="<<endl;
if(a=='B'&&b=='C')cout<<"<"<<endl;
if(a=='B'&&b=='D')cout<<"<"<<endl;
if(a=='B'&&b=='E')cout<<"<"<<endl;
if(a=='B'&&b=='F')cout<<"<"<<endl;
if(a=='C'&&b=='A')cout<<">"<<endl;
if(a=='C'&&b=='B')cout<<">"<<endl;
if(a=='C'&&b=='C')cout<<"="<<endl;
if(a=='C'&&b=='D')cout<<"<"<<endl;
if(a=='C'&&b=='E')cout<<"<"<<endl;
if(a=='C'&&b=='F')cout<<"<"<<endl;
if(a=='D'&&b=='A')cout<<">"<<endl;
if(a=='D'&&b=='B')cout<<">"<<endl;
if(a=='D'&&b=='C')cout<<">"<<endl;
if(a=='D'&&b=='D')cout<<"="<<endl;
if(a=='D'&&b=='E')cout<<"<"<<endl;
if(a=='D'&&b=='F')cout<<"<"<<endl;
if(a=='E'&&b=='A')cout<<">"<<endl;
if(a=='E'&&b=='B')cout<<">"<<endl;
if(a=='E'&&b=='C')cout<<">"<<endl;
if(a=='E'&&b=='D')cout<<">"<<endl;
if(a=='E'&&b=='E')cout<<"="<<endl;
if(a=='E'&&b=='F')cout<<"<"<<endl;
if(a=='F'&&b=='A')cout<<">"<<endl;
if(a=='F'&&b=='B')cout<<">"<<endl;
if(a=='F'&&b=='C')cout<<">"<<endl;
if(a=='F'&&b=='D')cout<<">"<<endl;
if(a=='F'&&b=='E')cout<<">"<<endl;
if(a=='F'&&b=='F')cout<<"="<<endl;
return 0;
}
| 0
| 15,474,720
|
#include <iostream>
#include <map>
#include <string>
#include <list>
using namespace std;
int main(){
list<string> res_list;
while(1){
int n;
map<char,char> convert_map;
cin>>n;
if(n == 0){
break;
}
for(int i = 0;i < n;i++){
char rc ,lc;
cin>>lc>>rc;
convert_map.insert( map<char,char>::value_type(lc,rc) );
}
cin>>n;
string res = "";
for(int i= 0;i < n;i++){
char c;
cin>>c;
auto it = convert_map.find(c);
if(it != convert_map.end()){
res+=it->second;
}else{
res+=c;
}
}
res_list.push_back( res );
}
for(auto it = res_list.begin();it != res_list.end();it++){
cout<<(*it)<<endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef ll Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int n;
vi in,used;
vvi G;
bool h=true;
ll dfs(int a){
used[a]=true;
vi t;
rep(i,G[a].size()){
int to=G[a][i];
if(used[to])continue;
t.pb(dfs(to));
}
if(!t.size())return in[a];
ll sum=0,ma=0;
rep(i,t.size()){
sum+=t[i];
ma=max(ma,t[i]);
}
ll w=in[a];
if(sum-ma>=ma){
if(sum<w||w*2<sum)h=false;
else{
ll W=sum-w;
in[a]-=W;
w-=W;
}
}else{
if(sum<w)h=false;
else{
ll W=sum-w;
W=min(W,sum-ma);
w-=W;
in[a]-=W;
if(in[a]!=sum-2*W||W<0||in[a]<0)h=false;
}
}
return w;
}
int main(){
cin>>n;
in=used=vi(n);
G=vvi(n);
rep(i,n)cin>>in[i];
rep(i,n-1){
int a,b;
cin>>a>>b;
a--;b--;
G[a].pb(b);
G[b].pb(a);
}
ll out=dfs(0);
int T=G[0].size();
if((T==1&&out==in[0]||T!=1&&out==0)&&h)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
| 0
| 93,285,042
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)
template<class T, class U> bool chmax(T &a, U b) { if (a < b) a = b; return true; }
template<class T, class U> bool chmin(T &a, U b) { if (a > b) a = b; return true; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
int ans = 1, mx = 0;
rep2(i, 1, n) {
int score = 0;
int j = i;
while (j % 2 == 0) {
j /= 2;
++score;
}
if (mx < score) {
mx = score;
ans = i;
}
}
cout << ans << endl;
return (0);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
cout << fixed << setprecision(25);
int n;
cin >> n;
string res;
cout << 0 << endl;
cin >> res;
if (res == "Vacant") return 0;
int left = 0, right = n;
while (1) {
int mid = (left + right) / 2;
string nxt;
cout << mid << endl;
cin >> nxt;
if (nxt == "Vacant") return 0;
if (((mid - left) % 2 == 0 && res != nxt) || ((mid - left) % 2 == 1 && res == nxt)) right = mid;
else {
left = mid;
res = nxt;
}
}
return 0;
}
| 0
| 69,188,580
|
#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>;
#define chmax(x,y) x = max(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int h, w, m;
cin >> h >> w >> m;
vector<int> hs(h), ws(w);
set<P> s;
rep(i,m) {
int r, c;
cin >> r >> c;
r--; c--;
hs[r]++;
ws[c]++;
s.emplace(r,c);
}
int mh = 0, mw = 0;
rep(i,h) mh = max(mh, hs[i]);
rep(i,w) mw = max(mw, ws[i]);
vector<int> is, js;
rep(i,h) if (mh == hs[i]) is.push_back(i);
rep(i,w) if (mw == ws[i]) js.push_back(i);
int ans = mh+mw;
for (int i : is) {
for (int j : js) {
if (s.count(P(i,j))) continue;
cout << ans << endl;
return 0;
}
}
ans--;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector < char >
# define vs vector < string >
# define vb vector < bool >
# define vd vector < D >
# define vll vector < ll >
# define vull vector < ull >
# define vld vector < ld >
# define PQ priority_queue
# define vvi vector < vector < int > >
# define vvb vector < vector < bool > >
# define vvc vector < vector < char > >
# define vvs vector < vs >
# define vvll vector < vector < ll > >
# define vvd vector < vector < D > >
# define vvld vector < vector < ld > >
# define all(v) (v).begin() , (v).end()
# define allrev(v) (v).rbegin() , (v).rend()
# define allcomp(v) v.begin() , v.end() , comp
# define allrevcomp(v) v.rbegin() , v.rend() , comp
# define pii pair < int , int >
# define pll pair < ll , ll >
# define pld pair < ld , ld >
# define pDD pair < D , D >
# define vpld vector < pld >
# define vpii vector < pii >
# define vpll vector < pll >
# define vpDD vector < pDD >
# define vvpii vector < vector < pii > >
# define F first
# define S second
# define mp make_pair
# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
# define pp(n) printf("%.10Lf",n);
# define line cout<<"\n";
# define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0);
# define fr(a,b) for(int i = a; i < b; i++)
# define rep(i,a,b) for(int i = a; i < b; i++)
string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = { -1 , 0 , 1 , 0 } ;
const int dy[] = { 0 , 1 , 0 , -1 } ;
const ld pie = 3.1415926535897932384626 ;
const ll mod = 1e9 + 7 ;
void solve(){
int n;
cin >> n;
int a[n];
int ans=1000005;
rep(i,0,n) cin >> a[i];
rep(i,-100,101){
int cost=0;
rep(j,0,n){
cost += (a[j]-i)*(a[j]-i);
}
ans = min(ans , cost);
}
cout << ans;
line
return;
}
int main(){
fast
int t=1;
while(t--){
solve();
}
R 0;
}
| 0
| 39,188,127
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 1; i <= n; ++i)
using namespace std;
int main()
{
int A, B, K;
cin >> A >> B >> K;
vector<int> divisor_A(100), divisor_B(100);
vector<int> ans(100);
int cnt = 0;
rep(i, A) {
if (A % i == 0) {
divisor_A.at(cnt) = i;
cnt++;
}
}
cnt = 0;
rep(i, B) {
if (B % i == 0) {
divisor_B.at(cnt) = i;
cnt++;
}
}
cnt = 0;
for (int i = 0; i < divisor_A.size(); i++) {
for (int j = 0; j < divisor_B.size(); j++) {
if (divisor_A.at(i) == divisor_B.at(j) && divisor_A.at(i) != 0) {
ans.at(cnt) = divisor_A.at(i);
cnt++;
}
}
}
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
cout << ans.at(K-1) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,X;
cin>>N>>M>>X;
vector<vector<int>> A(N,vector<int>(M));
vector<int> B(N);
for(int i=0;i<N;i++){
cin>>B[i];
for(int j=0;j<M;j++)cin>>A[i][j];
}
int mn=10000000;
for(int b=0;b<(1<<N);b++){
bitset<12> C(b);
vector<int> D(M,0);
int cnt=0;
for(int i=0;i<N;i++)
if(C.test(i)){
cnt+=B[i];
for(int j=0;j<M;j++)
D[j]+=A[i][j];
}
int c=10000000;
for(int &i:D)
c=min(i,c);
if(c>=X)
mn=min(mn,cnt);
}
if(mn==10000000)puts("-1");
else cout<<mn<<endl;
}
| 0
| 551,053
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int a,b,k;cin>>a>>b>>k;
int cnt=0;
for(int i=100;i>0;i--){
if(a%i==0&&b%i==0)cnt++;
if(cnt==k){
cout<<i<<endl;
return 0;
}
}
}
|
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const static int N = 10;
int partition(vector<int>& A,int p,int r) {
int x = A[r];
int i = p - 1;
for(int j=p;j<r;j++) {
if(A[j] > x) {
i++;
swap(A[i],A[j]);
}
}
swap(A[i+1],A[r]);
return i+1;
}
void quick_sort(vector<int>& A,int p,int r) {
if(p < r) {
int q = partition(A,p,r);
quick_sort(A,p,q-1);
quick_sort(A,q+1,r);
}
}
void sort(vector<int>& vec) {
quick_sort(vec,0,vec.size()-1);
}
int main() {
vector<int> hills(N);
for(int i=0;i<N;i++) {
scanf("%d",&hills[i]);
}
sort(hills);
for(int i=0;i<3;i++) {
printf("%d\n",hills[i]);
}
}
| 0
| 30,798,684
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
string abcd;
cin >> abcd;
int a, b, c, d;
a = stoi(abcd.substr(0, 1));
b = stoi(abcd.substr(1, 1));
c = stoi(abcd.substr(2, 1));
d = stoi(abcd.substr(3, 1));
int op[2] = {1, -1};
for (auto op1 : op) {
for (auto op2 : op) {
for (auto op3 : op) {
if (a + op1 * b + op2 * c + op3 * d == 7) {
cout << a << (op1 == 1 ? "+" : "-") << b << (op2 == 1 ? "+" : "-")
<< c << (op3 == 1 ? "+" : "-") << d << "=7" << endl;
return 0;
}
}
}
}
}
|
#include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <numeric>
#include <vector>
#include <map>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
vector<pair<ll, int>> prime_factorize(ll n) {
vector < pair < ll, int >> res;
int num = 0;
while (n % 2 == 0) {
num++;
n /= 2;
}
if (num != 0) res.emplace_back(make_pair( 2, num ));
for (ll p = 3; p * p <= n; p += 2) {
num = 0;
while (n % p == 0) {
num++;
n /= p;
}
if (num != 0) res.emplace_back(make_pair(p, num));
}
if (n != 1)res.emplace_back(make_pair(n, 1));
return res;
}
int main() {
ll N, ans=0;
cin >> N;
auto list = prime_factorize(N);
for (const auto& a : list) {
for (int k = 1; a.second >= k * (1 + k) / 2; k++) {
ans++;
}
}
cout << ans << endl;
}
| 0
| 90,327,759
|
#include <bits/stdc++.h>
#define int long long int
#define gif(a,b) (a/b +(a%b?1:0))
#define pi 3.14159265358
#define watch(x) cout<<(#x)<<" is "<<(x)<<"\n";
#define float long double
using namespace std;
int32_t main()
{
cin.tie(NULL);
std::ios::sync_with_stdio(false);
int x;
cin >> x;
string a[x];
for(int i = 0; i < x; ++i)
{
cin >> a[i];
if(i)
{
int n = a[i-1].length();
if(a[i][0] != a[i - 1][n-1])
{
cout << "No";
return 0;
}
}
for(int l = 0; l < i; l++)
{
if(a[i] == a[l])
{
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define EPS (1e-10)
#define equals(a, b) (fabs((a)-(b)) < EPS)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vi A(N);
vi cnt(N,0);
rep(i,N) {
cin >> A[i];
cnt[A[i]]++;
}
sort(rng(A));
int r = A.back();
int l = A[0];
if(r<2&&N>2) {
cout << "Impossible" << endl;
return 0;
}
if(l!=(r+1)/2) {
cout << "Impossible" << endl;
return 0;
}
if(r%2==0&&cnt[l]!=1) {
cout << "Impossible" << endl;
return 0;
}
if(r%2==1&&cnt[l]!=2) {
cout << "Impossible" << endl;
return 0;
}
srep(i,l+1,r+1) {
if(cnt[i]<2) {
cout << "Impossible" << endl;
return 0;
}
}
cout << "Possible" << endl;
return 0;
}
| 0
| 89,698,727
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int main(){
int n;
cin >> n;
vector<int> t(n),a(n);
rep(i,n) cin >> t[i];
rep(i,n) cin >> a[i];
vector<int> dec(n,-1),under(n,INF);
dec[0] = t[0];
int now = t[0];
for(int i=1;i<n;i++){
if(now < t[i]){
dec[i] = t[i];
now = t[i];
}else{
under[i] = now;
}
}
if(dec[n-1]==-1){
if(under[n-1]<a[n-1]){
cout << 0 << endl;
return 0;
}
}else{
if(dec[n-1]!=a[n-1]){
cout << 0 << endl;
return 0;
}
}
dec[n-1]=a[n-1];
now = a[n-1];
for(int i=n-2;i>=0;i--){
if(now < a[i]){
if(dec[i]!=-1&&dec[i]!=a[i]){ cout << 0 << endl;return 0;}
if(dec[i]==-1&&under[i]<a[i]){ cout << 0 << endl;return 0;}
dec[i] = a[i];
now = a[i];
}else{
if(dec[i]!=-1&&dec[i]>now){ cout << 0 << endl;return 0;}
under[i] = min(now,under[i]);
}
}
ll ans = 1;
rep(i,n){
if(dec[i]==-1){
ans = (ans * (ll)under[i]) % MOD;
}
}
cout << ans << endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define PI 3.14159265358979323846264338327950288
using namespace std ;
using bigint = long long int ;
using vi = vector<int> ;
using vll = vector<long long int> ;
int main(){
FAST_IO ;
bigint N , K ; cin >> N >> K ;
bigint max_sum = (N * ( N + 1 )) / 2 ;
bigint min_sum[N+3] ;
memset(min_sum, 0, sizeof(min_sum)) ;
min_sum[1] = 0 ;
for( int i = 2 ; i <= N + 1 ; i++ ){
min_sum[i] = min_sum[i-1] + i - 1 ;
}
bigint ans = 0 ;
for( bigint i = K ; i <= N + 1; i++ ){
bigint a = ((max_sum - min_sum[N-i+1] - min_sum[i] + 1) % mod + mod ) % mod ;
ans = ( ans + a ) % mod ;
}
cout << ans << endl ;
return 0 ;
}
| 0
| 38,171,527
|
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main()
{
int N;
cin >> N;
cout << N * N;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define NUM(x,v) (POSU(x,v)-POSL(x,v))
#define REV(x) (reverse(x.begin(),x.end()))
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}
ll ketawa(ll a){ll r=0;while(a){r+=a%10;a/=10;}return r;}
int main(){
int n,m;
cin >> n >> m;
vector< vector<ll> > dp(n+1,vector<ll>(m+1,0));
vector<ll> s(n),t(m);
for(auto &&x:s)cin>>x;
for(auto &&x:t)cin>>x;
for(int i=0;i<n+1;i++)dp[i][0] = 1;
for(int j=0;j<m+1;j++)dp[0][j] = 1;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
dp[i+1][j+1] += dp[i][j+1];
dp[i+1][j+1] += dp[i+1][j];
if(s[i]!=t[j]){
dp[i+1][j+1] += MOD - dp[i][j];
}
dp[i+1][j+1] %= MOD;
}
}
cout << dp[n][m] << endl;
}
| 0
| 67,073,473
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int64_t ans=0,b=0;
for(int i=0,l=S.size();i<l;i++){
if(S.at(i)=='B')
b++;
else
ans+=b;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
double A[2], B[2], C[2], D[2];
cin >> A[0] >> A[1] >> B[0] >> B[1] >> C[0] >> C[1] >> D[0] >> D[1];
double AB[2] = {A[0] - B[0], A[1] - B[1], };
double CD[2] = {C[0] - D[0], C[1] - D[1], };
double outerProduct = AB[0] * CD[1] - AB[1] * CD[0];
if (outerProduct == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
}
| 0
| 18,224,834
|
#include <iostream>
double x[3], y[3], xp, yp;
int main() {
while (std::cin>>x[0]>>y[0]>>x[1]>>y[1]>>x[2]>>y[2]>>xp>>yp) {
int bit = 3;
for (int i=0; i<3; ++i) {
double tmp = (x[(i+1)%3]-x[i])*(yp-y[i])-(y[(i+1)%3]-y[i])*(xp-x[i]);
bit &= ~((tmp < 0) + 1);
}
std::cout << (bit ? "YES" : "NO") << "\n";
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector <ll> th(3);
th[0] = X; th[1] = Y; th[2] = Z;
vector <ll> A(X);
for (int ii = 0; ii < X; ++ii) cin >> A[ii];
vector <ll> B(Y);
for (int ii = 0; ii < Y; ++ii) cin >> B[ii];
vector <ll> C(Z);
for (int ii = 0; ii < Z; ++ii) cin >> C[ii];
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
vector < pair<ll, ll> > v;
ll cA = 1000000;
ll cB = 1000;
ll cC = 1;
ll pval = A[0] + B[0] + C[0];
ll pidx = cA*0 + cB*0 + cC*0;
v.push_back(make_pair(pval, pidx));
map<ll, ll> m;
map<ll, ll> mm;
mm[pidx] = 1;
for (int cnt = 0; cnt < K; ++cnt){
pair<ll, ll> tmp = v.back();
v.pop_back();
ll val = tmp.first;
ll idx = tmp.second;
if (m[idx] == 0) cout << val << "\n";
m[idx] = 1;
vector <ll> tidx(3);
tidx[0] = idx / cA;
tidx[1] = (idx - cA*tidx[0]) / cB;
tidx[2] = idx - cA*tidx[0] - cB*tidx[1];
for (int ii = 0; ii < 3; ++ii){
if (tidx[ii] + 1 == th[ii]) continue;
tidx[ii]++;
ll val = A[tidx[0]] + B[tidx[1]] + C[tidx[2]];
ll idx = cA*tidx[0] + cB*tidx[1] + cC*tidx[2];
if (mm[idx] == 0){
v.push_back(make_pair(val, idx));
mm[idx] = 1;
}
tidx[ii]--;
}
sort(v.begin(), v.end());
}
return 0;
}
| 0
| 54,407,041
|
#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
vector<ll> dx = {1, -1, 0, 0};
vector<ll> dy = {0, 0, 1, -1};
vector<vector<ll>> g;
long long gcd(const long long& a, const long long& b)
{
if (b == 0)
{
return a;
}
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
ll n, k, s;
cin >> n >> k >> s;
for (int i = 0; i < n; ++i)
{
if (i < k)
{
cout << s;
}
else
{
if (s == 1000000000ll)
{
cout << 1;
}
else
{
cout << 1000000000ll;
}
}
if (i != n - 1)
{
cout << " ";
}
else
{
cout << endl;
}
}
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <iomanip>
#define ALL(X) X.begin(), X.end()
using lint = long long;
template <typename T>
void print_container(std::vector<T> vec)
{
for (auto iter = vec.begin(); iter != vec.end(); ++iter)
{
std::cout << *iter << " ";
}
std::cout << std::endl;
}
int main()
{
lint n;
scanf("%lld", &n);
std::vector<lint> creatures(n);
for (int i = 0; i < n; ++i)
{
scanf("%lld", &creatures[i]);
}
std::sort(ALL(creatures));
std::vector<lint> cumsum(n);
std::partial_sum(ALL(creatures), cumsum.begin());
lint ans{0};
for (int i = 0; i < n - 1; ++i)
{
if (cumsum[i] * 2 >= creatures[i + 1])
{
ans++;
}
else
{
ans = 0;
}
}
std::cout << ans + 1 << "\n";
return 0;
}
| 0
| 79,525,063
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
if(a == b){puts("Yes"); return 0;}
int len = (int)a.length();
for(int i = 0; i < len;++i){
char last = a[len - 1];
string temp = a.substr(0,len - 1);
a = last + temp;
if(a == b){
puts("Yes");
return 0;
}
}
if(a == b) puts("Yes");
else puts("No");
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {if(b>a) return b; else return a;}
int min(int a, int b) {if(b<a) return b; else return a;}
const int INF = 1e18;
signed main() {
int N;
cin >> N;
map<int, int> mp;
rep(i, N) {
int a;
cin >> a;
mp[a]++;
}
int res = INF;
for(int i=-100; i<=100; i++) {
int temp = 0;
for(auto &p : mp) {
int t = abs(p.fi-i);
temp += t*t*p.se;
}
res = min(res, temp);
}
cout << res << endl;
return 0;
}
| 0
| 21,972,114
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
using ld=long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
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;
}
struct Edge {
ll to, cap, rev;
Edge(ll _to, ll _cap, ll _rev) {
to = _to; cap = _cap; rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve(){
ll n,m,v,p;
cin>>n>>m>>v>>p;
Array a(n);
REP(i,n) cin>>a[i];
sort(all(a),greater<ll>());
auto check = [&](ll x)->bool{
ll base = a[x]+m;
ll ret = m*(v-1);
ret=ret-(p-1)*m;
rep(i,p-1,n){
if(i==x) continue;
if(a[i]>base) return false;
ret-=min(m, base-a[i]);
}
return ret<=0;
};
ll l=p-1;
ll r=n;
while(l+1<r){
ll m=l+r>>1;
if(check(m)) l=m;
else r=m;
}
cout<<r<<en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define mod 1000000007
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}
ll dp[1005][1005];
int main(){
string s,ss;
cin >> s >> ss;
ll n,nn;
n=s.size();
nn=ss.size();
rep(i,n+1) dp[i][0]=i;
rep(i,nn+1) dp[0][i]=i;
for(ll i=1;i<=n;i++){
for(ll j=1;j<=nn;j++){
if(s[i-1]==ss[j-1]){
dp[i][j]=dp[i-1][j-1];
}else{
dp[i][j]=min({dp[i][j-1]+1,dp[i-1][j]+1,dp[i-1][j-1]+1});
}
}
}
cout << dp[n][nn] << endl;
return 0;
}
| 0
| 96,031,174
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r, x, d; cin >> r >> d >> x;
for(int i = 0; i < 10; i++){
cout << r * x - d << endl;
x = r * x -d;
}
}
|
#include <iostream>
#include <vector>
int input()
{
int val;
std::cin >> val;
return val;
}
int main()
{
std::vector<int> x;
while (true)
{
int val = input();
if (val == 0)break;
x.push_back(val);
}
for (int i = 0; i < x.size();++i)
std::cout << "Case " << i+1 << ": " << x[i] << std::endl;
return 0;
}
| 0
| 18,073,263
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <complex>
#include <cstdint>
#include <tuple>
#define M_PI 3.14159265358979323846
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(); }
inline int readInt() { int x; scanf("%d", &x); return x; }
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
#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 SQ(a) ((a)*(a))
#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,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
const int N = 1005;
int x[N], y[N];
int u[N], v[N];
char* d = "RUDL";
int main() {
int n;
scanf("%d", &n);
REP(i, n)scanf("%d%d", &x[i], &y[i]);
int parity = (x[0] ^ y[0]) & 1;
REP(i, n) {
if ((x[i] ^ y[i] ^ parity) & 1) {
printf("-1\n");
return 0;
}
u[i] = x[i] + y[i];
v[i] = x[i] - y[i];
}
VI arms((parity) ? 1 : 2, 1);
FOR(i, 1, 31)arms.PB(1 << i);
int m = arms.size();
printf("%d\n", m);
REP(i, m)printf("%d ", arms[i]);
printf("\n");
REP(i, n) {
VI dir(m, 0);
for (int j = m - 1; j >= 0; j--) {
if (u[i] < 0) {
u[i] += arms[j];
dir[j] |= 2;
}
else {
u[i] -= arms[j];
}
if (v[i] < 0) {
v[i] += arms[j];
dir[j] |= 1;
}
else {
v[i] -= arms[j];
}
}
string ret;
REP(j, m) {
ret += d[dir[j]];
}
cout << ret << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
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; }
struct Card {
char c;
int v;
Card(){}
Card(char c, int v) :c(c), v(v) {}
bool operator>(const Card &p) const{
return v > p.v;
}
bool operator==(const Card &p)const {
return c == p.c&&v == p.v;
}
};
ostream &operator<<(ostream &os, const Card &p) {
os << p.c << p.v;
return os;
}
void BubbleSort(vector<Card>v) {
vector<Card>w(v);
for (int i = 0; i < w.size(); i++) {
for (int j = w.size() - 1; j > i; j--) {
if (w[j - 1] > w[j])swap(w[j - 1], w[j]);
}
}
rep(i, 0, w.size())cout << w[i] << (i == w.size() - 1 ? '\n' : ' ');
for(int i=0;i<w.size()-1;i++)for(int j=i+1;j<w.size();j++)
for(int a=0;a<w.size()-1;a++)for(int b=a+1;b<w.size();b++)
if (w[i] == v[b] && w[j] == v[a] && w[i].v == w[j].v) {
dump(i, j, a, b);
cout << "Not stable" << endl;
return;
}
cout << "Stable" << endl;
return;
}
void SelectionSort(vector<Card>v) {
vector<Card>w(v);
rep(i, 0, w.size()) {
int index = i;
rep(j, i + 1, w.size())if (w[index] > w[j])index = j;
swap(w[index], w[i]);
}
rep(i, 0, w.size())cout << w[i] << (i == w.size() - 1 ? '\n' : ' ');
for (int i = 0; i<w.size() - 1; i++)for (int j = i + 1; j<w.size(); j++)
for (int a = 0; a<w.size() - 1; a++)for (int b = a+1; b<w.size(); b++)
if (w[i] == v[b] && w[j] == v[a] && w[i].v == w[j].v) {
cout << "Not stable" << endl;
return;
}
cout << "Stable" << endl;
return;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<Card>cards;
rep(i, 0, N) {
char c; int v;
cin >> c >> v;
cards.emplace_back(Card(c, v));
}
BubbleSort(cards);
SelectionSort(cards);
return 0;
}
| 0
| 13,902,612
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll n, m, k; cin >> n >> m >> k;
bool ans = false;
for(ll i=0; i<=n; i++){
for(ll j=0; j<=m; j++){
if(i*m + j*n - (2*i*j) == k){
ans = true;
goto LAST;
}
}
}
LAST:
ans ? Yes() : No();
}
|
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 1e9;
int main() {
char a;
cin >> a;
if (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u') {
cout << "vowel\n";
} else {
cout << "consonant\n";
}
}
| 0
| 63,983,855
|
#include <iostream>
int main(){
int H,W,i,j;
while(true){
std::cin >> H >> W;
if(H==0 && W==0) break;
for(i = 0; i< H ; i++){
for(j=0;j<W;j++){
std::cout << "#";
}
std::cout << std::endl;
}
std::cout << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;
typedef pair <int,int> ii;
const ll MOD=1e9+7;
ll luythua(ll x,int y){
if(y==0)return 1;
ll k=luythua(x,y/2);
return k*k%MOD*(y%2?x:1)%MOD;
}
ll C(int n,int k){
if(n-k<k)k=n-k;
ll res=1;
for(int i=0;i<k;i++){
res=res*(n-i)%MOD;
res=res*luythua(i+1,MOD-2)%MOD;
}
return res;
}
int main() {
int x,y;
cin >> x >> y;
if ((x+y)%3!=0||min(x,y)*2<max(x,y)) cout << 0;
else {
int k=abs(x-y);
int bao = (x+y)/3;
int hung=(bao-k)/2;
cout<<C(bao,hung);
}
}
| 0
| 45,227,635
|
#include <bits/stdc++.h>
#define ll long long int
#define forr(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define oo 100000000000000000
using namespace std;
void _sol(){
int h,w,m; cin >> h >> w >> m;
vector<int> row(h+1,0) , col(w+1,0);
unordered_map<int,map<int,int>> mp;
forr(i,m){
int u,v; cin >> u >> v;
row[u]++;
col[v]++;
mp[u][v]++;
}
vector<pair<int,int>> v1,v2;
for(int i=1;i<=h;i++){
v1.push_back({row[i] , i});
}
for(int i=1;i<=w;i++){
v2.push_back({col[i] , i});
}
sort(v1.rbegin(),v1.rend()); sort(v2.rbegin(),v2.rend());
int ans = INT_MIN;
for(int i=1;i<=w;i++){
ans = max(ans , v1[0].first + v2[i-1].first - mp[v1[0].second][v2[i-1].second]);
}
for(int i=1;i<=h;i++){
ans = max(ans , v1[i-1].first + v2[0].first - mp[v1[i-1].second][v2[0].second]);
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
_sol();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int N, K;
ll X[55], Y[55], ans = INF;
int Solve(int A, int B, int C, int D){
ll x[4] = {X[A], X[B], X[C], X[D]};
ll y[4] = {Y[A], Y[B], Y[C], Y[D]};
sort(x, x + 4); sort(y, y + 4);
if (x[0] == x[3] || y[0] == y[3]) return 0;
int cnt = 0;
for (int i = 0; i < N; i++){
if (x[0] <= X[i] && X[i] <= x[3] && y[0] <= Y[i] && Y[i] <= y[3]) cnt++;
}
if (cnt >= K){
ans = min(ans, (x[3] - x[0]) * (y[3] - y[0]));
}
return 0;
}
int main(){
cin >> N >> K;
for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];
for (int i = 0; i < N; i++){
for (int j = i; j < N; j++){
for (int k = j; k < N; k++){
for (int l = k; l < N; l++){
Solve(i, j, k, l);
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 88,153,631
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
char a1, a2, a3;
char b1, b2, b3;
cin >> a1 >> a2 >> a3;
cin >> b1 >> b2 >> b3;
int ans = int(a1 == b1) + int(a2 == b2) + int(a3 == b3);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
ll mylcm(ll a, ll b) {
return a * b / __gcd(a, b);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
ll g = 1, mem, tmp;
vll a(n);
REP(i, n) {
cin >> a[i];
g = mylcm(g, a[i] / 2);
if (g > m) {
cout << 0 << endl;
return 0;
}
tmp = 0;
while (a[i] % 2 == 0) {
a[i] /= 2;
tmp++;
}
if (i && tmp != mem) {
cout << 0 << endl;
return 0;
}
mem = tmp;
}
ll res = (m - g) / (2 * g) + 1;
cout << res << endl;
return 0;
}
| 0
| 24,601,115
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans, tmp, hmin, sum;
ans = 0, sum = 0, hmin = 101, tmp = 101;
scanf("%d", &n);
int h[n+1] = {};
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
if (h[i] >= 1) hmin = min(hmin, h[i]);
sum += h[i];
}
while (sum > 0) {
for (int i = 0; i < n; i++) {
if (h[i] >= 1) {
if (h[i+1] == 0) ans += hmin;
h[i] -= hmin;
if (h[i] >= 1) tmp = min(h[i], tmp);
sum -= hmin;
}
}
hmin = tmp;
tmp = 101;
}
printf("%d\n", ans);
}
|
#include<bits/stdc++.h>
#define rep(i,e,n) for(int i=e; i<n; i++)
using namespace std;
int main()
{
int W , H , N;
cin >> W >> H >> N;
vector<vector<bool>> b(H,vector<bool>(W));
for(int i=0; i<N; i++){
int x,y,a;
cin >> x >> y >> a;
if(a == 1){
rep(h,0,H){
rep(w,0,x){
b.at(h).at(w) = true;
}
}
}
if(a == 2){
rep(h,0,H){
rep(w,x,W){
b.at(h).at(w) = true;
}
}
}
if(a == 3){
rep(h,0,y){
rep(w,0,W){
b.at(h).at(w) = true;
}
}
}
if(a == 4){
rep(h,y,H){
rep(w,0,W){
b.at(h).at(w) = true;
}
}
}
}
int cnt=0;
for(int h=0; h<H; h++){
for(int w=0; w<W; w++){
if(b.at(h).at(w) == false)
cnt++;
}
}
cout << cnt << endl;
}
| 0
| 99,504,475
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define GS(name) \
string(name); \
cin >> (name);
#define MOD 1000000007
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
string to_string(string s) {
return s;
}
template <class T>
string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(v.back());
}
ret += "}";
return ret;
}
void debug() {
cerr << endl;
}
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI(N);
GVI(t, N);
GVI(v, N);
int len = accumulate(ALL(t), 0);
debug(t, v, len);
vector<double> vs(len * 2 + 1, 100);
int start = 0, end = 0;
FOR(i, N) {
end += t[i];
for (int x = 0; x < len * 2 + 1; ++x) {
if (start * 2 <= x && x < end * 2 + 1) {
vs[x] = min(vs[x], (double)v[i]);
} else if (x < start * 2) {
vs[x] = min(vs[x], (double)v[i] + (start * 2 - x) / 2.0);
} else {
vs[x] = min(vs[x], (double)v[i] + (x - end * 2) / 2.0);
}
}
start = end;
}
for (int x = 0; x < len * 2 + 1; ++x) {
vs[x] = min(vs[x], (double)(x) / 2.0);
vs[x] = min(vs[x], (double)(len * 2 - x) / 2.0);
}
debug(vs);
double ans = 0;
for (int x = 0; x < len * 2 + 1; ++x) {
ans += (vs[x] + vs[x + 1]) * 0.25;
}
print(ans);
return 0;
}
|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, n);
double sum = 0;
rep(i, n) {
in(double, a);
sum += 1 / a;
}
cout << setprecision(20);
out(1 / sum);
}
| 0
| 55,730,365
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(){
ios::sync_with_stdio(false);
ll n;
cin >> n;
if(n%2 == 1) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
ll k = 10;
while(k<=n) {
ans+=n/k;
k*=5;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popcount __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
#define printpii(a) cout << a.ft << " " << a.sd << endl;
#define printpiii(a) cout << a.ft << " " << a.sd.ft << " " << a.sd.sd << endl;
#define print(a, n) rep(i, n) cout << a[i] << " "; cout << endl;
#define printv(v) for(auto x: v)cout << x << " "; cout << endl;
#define printm(a, n, m) rep(i, n) { rep(j, m) cout << a[i][j] << "\t"; cout << endl;}
ll lx[4] = {0, 0, 1, -1};
ll ly[4] = {1, -1, 0, 0};
ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
void fast(){ios_base::sync_with_stdio(false);cin.tie(0);cout << setprecision(12) << fixed;}
ll lcm(ll a, ll b) {return (a*b)/__gcd(a, b); }
void solve()
{
ll n;
cin >> n;
map<string , ll> mp;
rep(i, n)
{
string s; cin >> s; sort(all(s)); mp[s]++;
}
ll ans = 0;
itr(it, mp)
{
ans += (it->sd * (it->sd-1))/2;
}
cout << ans;
}
int main(){
fast();
ll t = 1;
while(t--){
solve();
}
return 0;
}
| 0
| 57,711,683
|
#include <iostream>
using namespace std;
int main(){
int x, y, r, w, h;
int i;
int edge[4];
int flag = 0;
cin>>w>>h>>x>>y>>r;
edge[0] = x-r;
edge[1] = w-(x+r);
edge[2] = y-r;
edge[3] = h-(y+r);
for(i = 0; i < 4; i++){
if(edge[i] < 0){
flag = 1;
break;
}
}
if(flag == 0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<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<vl> vvl;
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;
using Data = pair<ll, vi>;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
vl N(3);
rep(i,3) cin >> N[i];
int K;
cin >> K;
vvl v(3);
rep(i,3) {
v[i].resize(N[i]);
rep(j,N[i]) cin >> v[i][j];
sort(v[i].begin(), v[i].end(), greater<ll>());
}
priority_queue<Data> que;
set<Data> st;
que.push(Data(v[0][0] + v[1][0] + v[2][0], vi({0, 0, 0})));
rep(k,K) {
auto d = que.top(); que.pop();
cout << d.first << endl;
rep(i,3) {
if(d.second[i] + 1 < N[i]) {
ll sum = d.first - v[i][d.second[i]] + v[i][d.second[i] + 1];
auto num = d.second;
num[i]++;
auto nd = Data(sum, num);
if (!st.count(nd)) st.insert(nd), que.push(nd);
}
}
}
return 0;
}
| 0
| 99,297,055
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 1000000007
#define INF LLONG_MAX/2
#define PI acos(-1.0)
#define leng(n) (int)(log10(n)+1)
typedef long long ll;
typedef pair<int,int> Pii;
typedef tuple<int,int,int> Tiii;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<Pii> VPii;
typedef vector<string> Vs;
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;}
template<class T> void YesNo(T a) {cout<<(a?"Yes":"No")<<endl;}
template<class T> void YESNO(T a) {cout<<(a?"YES":"NO")<<endl;}
void vout(Vi &v){for(int i=0;i<(v).size();i++) cout<<v[i]<<" ";cout<<endl;}
void vvout(VVi &v){for(int i=0;i<(v).size();i++) vout(v[i]);}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int mypow(int x, int n, int m){if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int digit(int k,int i){string s = to_string(k);return s[s.size()-i]-'0';}
void uniq(Vi &v){sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end());}
int ctoi(char c){if(c>='0'&&c<='9'){return c-'0';}return 0;}
Vi accum(Vi v){Vi ret((v).size());ret[0]=v[0];REP(i,1,(v).size()) ret[i]=ret[i-1]+v[i];return ret;}
bool comp(Pii a,Pii b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
Vi yakusuu(int n){
Vi ret;
for(int i=1 ; i*i<=n ; ++i){
if(n%i == 0){
ret.push_back(i);
if(i*i!=n) ret.push_back(n/i);
}
}
sort(ALL(ret));
return ret;
}
signed main(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
int n;
cin>>n;
Vs s(n);
REP(i,0,n){
cin>>s[i];
}
int ans=0;
REP(i,0,n){
Vs ss(n);
REP(j,0,n){
ss[j]=s[(j+i)%n];
}
bool check=false;
REP(j,0,n){
REP(k,0,n){
if(ss[j][k]!=ss[k][j]){
check=true;
break;
}
}
if(check) break;
}
if(check==false) ans += n;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main() {
int N;cin>>N;
vector<ll> a(N);
rep(i,N) cin>>a[i];
vector<vector<ll>> dig(65,vector<ll>(N+1,0));
rep(i,60){
rep(j,N) {
int one = ((a[j]>>i)&1) ? 1 : 0;
dig[i][j+1] = dig[i][j] + one;
}
}
ll ans = 0;
ll two = 1;
rep(i,60) {
ll cnt = 0;
rep(j,N-1) {
ll num = (dig[i][N] - dig[i][j+1] + MOD) % MOD;
if((a[j]>>i)&1) {
cnt = (cnt + (N - (j+1) - num + MOD) % MOD) % MOD;
} else {
cnt = (cnt + num) % MOD;
}
}
ans = (ans + (two * cnt) % MOD) % MOD;
two = (two * 2) % MOD;
}
cout<<ans % MOD <<endl;
}
| 0
| 33,529,176
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
ll len;
ll fun1(string str,ll prime)
{
ll ans=0;
for(ll i=0;i<len;i++){
if((str[i]- '0')%prime==0) ans+=(i+1);
}
return ans;
}
ll bigmod(ll a,ll pr,ll mod)
{
if(pr==0) return 1ll;
else if(pr==1) return a%mod;
ll x=bigmod(a,pr/2ll,mod);
x=(x*x)%mod;
if(pr & 1ll) x=(x * a)%mod;
return x;
}
ll fun2(string str,ll prime)
{
ll temp[prime+1];
memset(temp,0,sizeof temp);
ll ans=0, last=0;
ll len=str.length();
for(ll i=0;i<len;i++){
ll p=last*10ll + (str[i]-'0');
p=(p%prime)*bigmod(10ll,len-i-1,prime);
++temp[(p%prime)];
last=(last*10ll +(str[i]-'0'))%prime;
}
for(ll i=0;i<prime;i++){
ll x;
if(temp[i]==0) continue;
if(i==0) x=((temp[i]*(temp[i]+1))/2ll);
else x=((temp[i]*(temp[i]-1))/2ll);
ans+=max(0ll, x);
}
return ans;
}
int main()
{
ll a,b,c,d,p,q;
string str;
cin>>len>>p;
cin>>str;
ll ans;
if(p==5 || p==2) ans=fun1(str,p);
else ans=fun2(str,p);
cout<<ans<<'\n';
}
|
#include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
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;
std::istream &operator>>(std::istream &in, set<int> &o) {
ll 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(); }
const int mod = 1000000007;
typedef priority_queue<string, vector<string>, greater<string> > PQ_ASK;
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n, m, d;
cin >> n >> m >> d;
if (d == 0) {
double ans = 1 / n * (m - 1);
printf("%.20f\n", ans);
} else {
double ans = 2.0 * (n - d) / n / n * (m - 1);
printf("%.20f\n", ans);
}
}
| 0
| 92,902,693
|
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <cmath>
using namespace std;
const int M = 100000;
const double pi = 3.141592653589;
int main()
{
for (int i = 1; i <= 9; i++) {
for (int k = 1; k <= 9; k++) {
int qq = i*k;
printf("%dx%d=%d\n", i, k,qq);
}
}
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <random>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double ld;
#define double ld
#define loop(i, n) for(int i = 0; i < (int)n; ++i)
#define loop1(i, n) for(int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair <int, int>
#define all(x) begin(x), end(x)
#define ti tuple <int, int, int>
#define Point Vect
#define mkt make_tuple
#define no {cout << -1; return;}
void solve() {
int n, m, on = 0;
cin >> n >> m;
vector <int> bulb(m);
loop(i, m) {
int k; cin >> k;
loop(j, k) {
int bit; cin >> bit;
bulb[i] ^= (1 << (bit - 1));
}
}
loop(i, m) {
int bit; cin >> bit;
if (bit)
on ^= (1 << i);
}
int ans = 0;
loop(mask, (1 << n)) {
int curon = 0;
loop(bit, n)
if (mask & (1 << bit))
loop(i, m)
if (bulb[i] & (1 << bit))
curon ^= (1 << i);
ans += (on == curon);
}
cout << ans;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 60,990,147
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
while (true) {
ll n, k;
cin >> n >> k;
if (n == 0 && k == 0) break;
vector<ll> A(n);
for (ll i = 0; i < n; i++) {
cin >> A[i];
}
vector<ll> s(n);
for (ll i = 0; i < n; i++) {
s[i + 1] = s[i] + A[i];
}
ll mx = (1LL << 60) * -1;
for (ll i = 0; i < n - k; i++) {
mx = max(mx, s[i + k] - s[i]);
}
cout << mx << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define REP(i, n) for (ll i = 0; i < 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 FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ';
pr(b);
}
int N, Q;
vector<int> edges[200000];
int64_t num[200000];
void dfs(int i, int p)
{
for (int j : edges[i])
if (j != p)
{
num[j] += num[i];
dfs(j, i);
}
}
int main()
{
cin >> N >> Q;
for (int i = 0; i < N - 1; i++)
{
int a, b;
cin >> a >> b;
edges[a - 1].push_back(b - 1);
edges[b - 1].push_back(a - 1);
}
for (int i = 0; i < Q; i++)
{
int p, x;
cin >> p >> x;
num[p - 1] += x;
}
dfs(0, -1);
for (int i = 0; i < N; i++)
cout << num[i] << " \n"[i == N - 1];
return 0;
}
| 0
| 79,574,296
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9+7LL;
int main() {
ll K; cin >> K;
queue<ll> q;
rep(i, 9){
q.push(i+1);
}
ll cnt = 1;
ll x;
while(cnt<=K){
x = q.front(); q.pop();
if(x%10!=0) q.push(10*x+x%10-1);
q.push(10*x+x%10);
if(x%10!=9) q.push(10*x+x%10+1);
cnt++;
}
cout << x << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> ll llpow(ll x,T n){ll ans=1;if(x==0)ans=0;while(n){if(n&1)ans*=x;x*=x;n>>=1;}return ans;}
long long modpow(long long a, long long n, long long mod) {long long res = 1;while (n > 0) {if (n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}
template<class T> inline T gcd(T x,T y){if(y==0)return x; else {return gcd(y,x%y);}}
template<class T> inline T lcm(T x,T y){return x/gcd(x,y)*y;}
long long modinv(long long a, long long m) {long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
#define rep(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
#define irep(i, end_i, begin_i) for (ll i = (ll)begin_i-1; i >= (ll)end_i; i--)
long long INF = 1LL<<60;
int main( ){
ll n,k;
cin>>n>>k;
ll mod=1e9+7;
vll cnt(k+1,0);
ll ans=0;
irep(i,1,k+1){
ll cpy=k;
cnt[i]=modpow(k/i,n,mod);
cpy/=i;
rep(minus,2,cpy+1){
cnt[i]-=cnt[minus*i];
cnt[i]%=mod;
if(cnt[i]<0)cnt[i]+=mod;
}
ll add=cnt[i]*i%mod;
if(add<0)add+=mod;
ans+=add;
ans%=mod;
if(ans<0)ans+=mod;
}
cout<<ans<<endl;
return 0;
}
| 0
| 71,961,863
|
#include<bits/stdc++.h>
#ifdef LOCAL
#include "../dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ROF(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
#define SUM(a) accumulate(all(a),0)
#define pb push_back
#define fst first
#define snd second
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef long long ll;
int main(){
string s; cin >> s;
int sz = s.size();
int x,y; cin >> x >> y;
vi d;
int pos = 0;
d.pb(0);
while(pos < sz){
if(s[pos] == 'T'){
pos++;
d.pb(0);
}else{
int tmp = 0;
while(s[pos] == 'F'){
pos++;
tmp++;
}
d.back() += tmp;
}
}
vvi dpx((d.size()+1)/2, vi(2*sz+1)), dpy(d.size()/2, vi(2*sz+1));
dpx[0][d[0]+sz] = true;
int i = 2;
while(i < d.size()){
rep(j,2*sz+1){
if(j - d[i] >= 0)
dpx[i/2][j] |= dpx[i/2 - 1][j - d[i]];
if(j + d[i] <= 2*sz)
dpx[i/2][j] |= dpx[i/2 - 1][j + d[i]];
}
i += 2;
}
if(d.size() >= 2)
dpy[0][d[1]+sz] = dpy[0][-d[1]+sz] = true;
i = 3;
while(i < d.size()){
rep(j,2*sz+1){
if(j - d[i] >= 0)
dpy[i/2][j] |= dpy[i/2 - 1][j - d[i]];
if(j + d[i] <= 2*sz)
dpy[i/2][j] |= dpy[i/2 - 1][j + d[i]];
}
i += 2;
}
dump(d,dpx,dpy);
int f = dpx[(d.size()-1)/2][x+sz];
if(d.size() >= 2) f &= dpy[d.size()/2 - 1][y+sz];
else f &= (y == 0);
if(f)
cout << "Yes\n";
else
cout << "No\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a,b;
while(cin>>a>>b)
{
if(a+b==15)
{
cout<<'+'<<endl;
}
else if(a*b==15)
{
cout<<'*'<<endl;
}
else
{
cout<<'x'<<endl;
}
}
return 0;
}
| 0
| 79,221,667
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N;
__int128 ans = 1;
cin >> N;
bool ng = false;
bool zero = false;
for(long long i = 0; i < N; i++) {
long long tmp;
cin >> tmp;
if(tmp == 0) {
zero = true;
}
__int128 a = tmp;
ans *= a;
if(ans > 1000000000000000000) {
ng = true;
}
}
if(zero) {
cout << 0 << endl;
} else if(ng) {
cout << -1 << endl;
} else {
long long hoge = ans;
cout << hoge << endl;
}
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#define maxn 100001
using namespace std;
int n;
int t[maxn];
int parent(int num)
{
return num/2;
}
int left(int num)
{
return num*2;
}
int right(int num)
{
return num*2+1;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&t[i]);
for(int i=1;i<=n;++i)
{
printf("node %d: ",i);
printf("key = %d, ",t[i]);
if(parent(i)>=1) printf("parent key = %d, ",t[parent(i)]);
if(left(i)<=n) printf("left key = %d, ",t[left(i)]);
if(right(i)<=n) printf("right key = %d, ",t[right(i)]);
printf("\n");
}
return 0;
}
| 0
| 29,109,683
|
#include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
#define vi vector<int>
#define IP pair<int,P>
#define PP pair<P,P>
int n,l,q;
int x[110000],d[20][110000];
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(20);
cin>>n;
rep(i,n){
cin>>x[i];
}
cin>>l>>q;
int p=0;
rep(i,n){
while(x[i]-x[p]>l) p++;
d[0][i]=p;
}
FOR(i,1,17){
rep(j,n+1){
d[i][j]=d[i-1][d[i-1][j]];
}
}
while(q--){
int a,b;
cin>>a>>b;
a--;b--;
if(a==b){
cout<<0<<endl;
}else{
if(a>b) swap(a,b);
int res=1;
rrep(i,16){
if(d[i][b]>a){
res+=1<<i;
b=d[i][b];
}
}
cout<<res<<endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
string s;
cin>>s;
int a=0,b=0,c=0;
for(char m:s){
if(m=='a')a++;
else if(m=='b')b++;
else c++;
}
if(a==b&&b==c)cout<<"Yes";
else cout<<"No";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
| 0
| 10,964,480
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define 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;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
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; }
ll choose(ll n, ll r){
ll res = 1;
for(int i = 1; i <= r; i++){
res *= n--;
res /= i;
}
return res;
}
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
map<int, ll> mp;
rep(i,n) mp[a[i]]++;
ll sum = 0;
for(auto m: mp){
sum += choose(m.second, 2);
}
rep(i,n){
ll ans = sum;
ans -= choose(mp[a[i]], 2);
ans += choose(mp[a[i]]-1, 2);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
while(y){
if(y%2){res=res*tmp%MOD;}
y>>=1;
tmp=tmp*tmp%MOD;
}
return res;
}
ll nature(ll a){
if(a>=0){return(a);}
else{return(-1*a);}
}
ll prime(ll a){
if(a==2){return 1;}
else if(a%2==0 || a==1){return 0;}
for(ll i=3;i*i<=a;i+=2){if(a%i==0){return 0;}}
return 1;
}
int main(){
ll N,K;
cin>>N>>K;
unordered_map<ll,ll> mp;
for(ll i=0;i<N;i++){
ll a,b;
cin>>a>>b;
mp[a]+=b;
}
for(ll i=1;i<=100000;i++){
K-=mp[i];
if(K<=0){cout<<i<<endl;return 0;}
}
}
| 0
| 32,778,902
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define pii pair<int,int>
using namespace std;
inline void solve(){
int n; cin>>n;
vi a(n),b(n);
for (int i=0;i<n;i++){
cin >> a[i] ;
b[i] = a[i] ;
}
sort(a.begin(), a.end());
int f=a[n-1],s=a[n-2];
for (int i=0;i<n;i++){
if (b[i]!=f) cout << f << endl;
else cout << s << endl;
}
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll arr[n];
map<ll,ll, greater<ll>>mp;
for(ll i=0; i<n; i++ )
{
cin>>arr[i];
mp[arr[i]]++;
}
ll c=0;
ll ar=1;
ll f=0;
for(auto it=mp.begin(); it!=mp.end(); ++it)
{
ll s=it->second;
if(c==0)
{
if(s>=4)
{
cout<<it->first*it->first<<endl;
f=1;
break;
}
}
if(s>=2)
{
ar=ar*it->first;
c++;
if(c==2)
{
break;
}
}
}
if(c!=2&&f==0)
{
cout<<0<<endl;
}
else if(c==2&&f==0)
{
cout<<ar<<endl;
}
}
| 0
| 26,154,805
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<string> S(N);
for(int i=0;i<N;i++) cin>>S.at(i);
int M;cin>>M;
vector<string> T(M);
for(int i=0;i<M;i++) cin>>T.at(i);
priority_queue<int> A;
sort(S.begin(),S.end());
for(int i=0;i<N;i++){
if(i>0 && S.at(i)==S.at(i-1)) continue;
string X=S.at(i);
int count=0;
for(int j=i;j<N;j++){
if(X==S.at(j)) count++;
}
for(int j=0;j<M;j++){
if(X==T.at(j)) count--;
}
A.push(count);
}
if(A.top()<0) cout<<0<<endl;
else cout<<A.top()<<endl;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
string S;
ll K;
cin >> S >> K;
ll N = S.size();
char prev = S[0];
ll tmpC = 1;
ll count = 0;
for (int i = 1; i < N; ++i) {
if(prev == S[i]){
tmpC++;
}else{
count += tmpC / 2;
tmpC = 1;
prev = S[i];
}
}
count += tmpC / 2;
ll countA = 1;
ll countB = 1;
for (int i = 1; i < S.size(); ++i) {
if(S[0] == S[i]){
countA++;
}else{
break;
}
}
for (int i = S.size() - 2; i >= 0; --i) {
if(S[i] == S[N - 1]){
countB++;
}else{
break;
}
}
if(countA == N){
cout << (S.size() * K / 2) << endl;
return 0;
}
if(S[0] != S[N - 1]){
cout << count * K << endl;
return 0;
}
ll tmp = (countA/2) + (countB/2) - (countA + countB)/2;
cout << count * K - tmp * (K-1) << endl;
}
| 0
| 56,166,582
|
#include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int MN = 1e5 + 1;
int N, M, V, P;
int A[MN], B[MN];
bool check(int p) {
for(int i = 0; i < N; i++) B[i] = A[i];
ll total_points = (ll)M * V;
auto give = [&](int i, int amount) {
ll v = min(total_points, (ll)min(amount, M - (B[i] - A[i])));
B[i] += v;
total_points -= v;
};
give(p, M);
int free = P - 1;
for(int i = N-1; i >= 0 && free > 0; i--) {
if(i == p) continue;
give(i, M);
free--;
}
for (int i = 0; i < N; i++) {
if (i == p) continue;
give(i, max(0, B[p] - B[i]));
}
if (total_points > 0) return false;
int larger_count = 0;
for(int i = 0; i < N; i++) {
if (B[i] > B[p]) larger_count++;
}
return larger_count < P;
}
int main() {
scanf("%d%d%d%d", &N, &M, &V, &P);
for(int i = 0; i < N; i++) scanf("%d", &A[i]);
sort(A, A+N);
int left = 0, right = N-1, mid, ans;
while(left <= right) {
mid = (left + right) / 2;
if (check(mid)) {
ans = mid;
right = mid - 1;
}
else {
left = mid + 1;
}
}
printf("%d\n", N - ans);
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
const ll C = 5e8;
const int MAX_N = 2e4 + 5;
ll target [MAX_N];
ll A [MAX_N];
ll B [MAX_N];
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int pi;
cin >> pi;
target[pi] = 2 * C + i;
}
A[n + 1] = C;
B[n + 1] = C;
for (int i = n; i >= 1; i--) {
ll amax = A[i + 1] - 1;
ll bmin = B[i + 1] + 1;
if (target[i] - amax >= bmin) {
A[i] = amax;
B[i] = target[i] - amax;
} else {
A[i] = target[i] - bmin;
B[i] = bmin;
}
}
for (int i = 1; i <= n; i++) {
cout << A[i] << " ";
}
cout << endl;
for (int i = 1; i <= n; i++) {
cout << B[i] << " ";
}
cout << endl;
}
| 0
| 15,619,506
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, m, k;
cin >> n >> m >> k;
rep(i, 0, m + 1) {
rep(j, 0, n + 1) {
int sum = (n - j) * i + (m - i) * j;
if (sum == k) {
cout << "Yes\n";
return 0;
}
}
}
cout << "No\n";
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#define mp make_pair
#define mt make_tuple
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using max_priority_queue = priority_queue<T>;
template <class T>
using min_priority_queue = priority_queue<T, std::vector<T>, std::greater<T>>;
const int INF = 1 << 29;
const ll LL_INF = 1LL << 60;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int N;
vector<int> A, B;
int main()
{
cin >> N;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; i++)
{
cin >> A[i] >> B[i];
}
if (A == B)
{
cout << 0 << endl;
return 0;
}
ll sum_a = accumulate(A.begin(), A.end(), 0LL);
ll res = LL_INF;
for (int i = 0; i < N; i++)
{
cin >> A[i] >> B[i];
if (A[i] > B[i])
{
res = min(res, (ll)B[i]);
}
}
cout << sum_a - res << endl;
return 0;
}
| 0
| 742,851
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
int n;
ll Bigmod(int a,int b)
{
if(b==0)
return 1%MOD;
ll x=Bigmod(a,b/2);
x=(x*x)%MOD;
if(b%2==1)
x=(x*a)%MOD;
return x;
}
ll recur(int pos)
{
if(pos==n)
{
if(s[pos]=='0')
return 1ll;
return 3ll;
}
if(s[pos]=='0')
return recur(pos+1)%MOD;
else
return (Bigmod(3,n-pos)+2 * recur(pos+1)%MOD)%MOD;
}
int main()
{
FastRead
cin>>s;
n=s.length()-1;
cout<<recur(0)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
os << "sz:" << v.size() << "\n[";
for (const auto& p : v) {
os << p << ",";
}
os << "]\n";
return os;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
os << "(" << p.first << "," << p.second
<< ")";
return os;
}
constexpr ll MOD = (ll)1e9 + 7LL;
template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
const int N = s.size();
vector<int> prev(26, 0);
vector<int> now(26, 0);
vector<int> value(N);
for (int i = 0; i < N; i++) {
now[s[i] - 'a'] = (prev[s[i] - 'a'] + 1) % 2;
for (int j = 0; j < 26; j++) {
value[i] += (int)now[j] << j;
}
prev = now;
}
int sum = 0;
for (int i = 0; i < 26; i++) {
sum += prev[i];
}
if (sum <= 1) {
cout << 1 << endl;
return 0;
}
const int maximum = 1 << 26;
vector<int> minimum(maximum, INF<int>);
minimum[0] = 0;
for (int i = 0; i < N; i++) {
const int v = value[i];
int u = v;
int mini = minimum[v];
for (int d = 0; d < 26; d++) {
if ((v >> d) & 1) {
u = v - (1 << d);
} else {
u = v + (1 << d);
}
mini = min(mini, minimum[u] + 1);
}
minimum[v] = min(minimum[v], mini);
}
cout << minimum[value[N - 1]] << endl;
return 0;
}
| 0
| 10,431,440
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
if (n == 1)
cout << (a == b ? "1" : "0");
else if (a > b)
cout << "0";
else
cout << 1ll * (b - a)*(n - 2) + 1ll;
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
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 N, A, B, C;
vector<int> lens;
int dfs(int cur, int a, int b, int c) {
if(cur == N) {
if(a == 0 || b == 0 || c == 0) {
return 1 << 29;
} else {
return abs(A - a) + abs(B - b) + abs(C - c);
}
} else {
int res1 = dfs(cur + 1, a + lens[cur], b, c);
if(a != 0) res1 += 10;
int res2 = dfs(cur + 1, a, b + lens[cur], c);
if(b != 0) res2 += 10;
int res3 = dfs(cur + 1, a, b, c + lens[cur]);
if(c != 0) res3 += 10;
int res4 = dfs(cur + 1, a, b, c);
return min({res1, res2, res3, res4});
}
}
int main() {
cin >> N >> A >> B >> C;
REP(i, N) {
int tmp;
cin >> tmp;
lens.emplace_back(tmp);
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
}
| 0
| 18,784,644
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
double n, x, t;
cin >> n >> x >> t;
int res = ceil(n/x)*t;
cout << res << endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); i++)
#define ASORT(c) std::sort((c).begin(), (c).end())
#define DSORT(c) std::sort((c).begin(), (c).end(), std::greater<typeof((c).front())>())
#define SIZE(x) ((int)(x).size())
#define check(x) std::cout << #x << " = " << x << '\n'
#define cout(x) std::cout << x << '\n'
typedef std::vector<int> VI;
typedef std::vector<VI> VII;
typedef std::vector<std::string> VS;
std::string yes = "Yes\n";
std::string no = "No\n";
void solve();
signed main() {
solve();
return 0;
}
void solve() {
int n;
std::cin >> n;
cout(n / 3);
}
| 0
| 35,564,300
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long int64;
typedef pair<int,int> pii;
typedef vector<int> vi;
const double eps = 1e-9;
const int oo = 0x3f3f3f3f;
const int mod = 1000000007;
const int bits = 60;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
int64 x = 0;
vector<int64> val(n);
for (int i = 0; i < n; ++i){
cin >> val[i];
x ^= val[i];
}
vector<int> order(bits);
iota(order.begin(), order.end(), 0);
sort(order.begin(), order.end(), [&](int u, int v){
int bu = x >> u & 1;
int bv = x >> v & 1;
if (bu != bv)
return bu < bv;
return u > v;
});
vector<int64> gauss(bits);
for (auto v : val) {
for (auto b : order){
if (v >> b & 1){
if (gauss[b]){
v ^= gauss[b];
} else {
gauss[b] = v;
break;
}
}
}
}
int64 y = 0;
for (auto b : order) {
if (y >> b & 1)
continue;
if (gauss[b])
y ^= gauss[b];
}
cout << (y + (y ^ x)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{int n,m,sum=0;
cin>>n>>m;
int a[m];
for(int i=0;i<m;i++)
{
cin>>a[i];
sum+=a[i];
}
if(sum>n)
{
cout<<"-1"<<endl;
}
else
{
cout<<n-sum;
}
}
| 0
| 71,609,829
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> train;
int num;
while(cin>>num){
if(num != 0){
train.push_back(num);
}else if(num == 0){
cout<<train[train.size()-1]<<endl;
train.pop_back();
}
}
return 0;
}
|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
bool Less(const string& a, const string& b) {
if (a.size() != b.size()) return a.size() < b.size();
return a < b;
}
int main() {
const vector<int> cost = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
in(int, n, m);
vector<int> a(m);
rep(i, m) cin >> a[i];
vector<string> dp(n + 1);
for (int i = 0; i <= n; ++i) {
for (int j = 0; j < m; ++j) {
int k = i - cost[a[j]];
if (k < 0 || dp[k] == "" && k != 0) continue;
string d = char('0' + a[j]) + dp[k];
if (Less(dp[i], d)) dp[i] = d;
}
}
out(dp[n]);
}
| 0
| 39,734,455
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << ((S.at(2) == S.at(3) && S.at(4) == S.at(5)) ? "Yes" : "No") << "\n";
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<iomanip>
#include<utility>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
#define S 21
llfor;
const ll mod=1000000007;
const double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll ans=1;rep(i,0,n){ans*=x;ans%=mod;}return ans;}
ll fact(ll x){ll ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)*fact(n-r)/fact(r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=1,tmp=n;while(tmp/10>0){tmp/=10;d++;}return d;}
void matcpy(ll a[S][S],ll b[S][S]){ll t=i;rep(i,0,S)rep(j,0,S)b[i][j]=a[i][j];i=t;}
void matrst(ll a[S][S]){ll t=i;rep(i,0,S)rep(j,0,S)a[i][j]=0;i=t;}
void matpow(ll a[S][S]){ll ans[S][S];matrst(ans);ll t=i,k;rep(i,0,S)rep(j,0,S)rep(k,0,S)ans[i][j]+=a[i][k]*a[k][j];matcpy(ans,a);i=t;}
void matmul(ll a[S][S],ll b[S][S], ll as[S][S]){ll t=i,k;matrst(as);rep(i,0,S)rep(j,0,S)rep(k,0,S)as[i][j]+=a[i][k]*b[k][j];i=t;}
int main(){
ll n,d;
cin>>n>>d;
ll a[d+10][n+10];
rep(i,0,n)rep(j,0,d)cin>>a[i][j];
ll k,dis,ans=0;
rep(i,0,n){
rep(j,i+1,n){
dis=0;
rep(k,0,d)dis+=(a[i][k]-a[j][k])*(a[i][k]-a[j][k]);
if((ll)sqrt(dis)*(ll)sqrt(dis)==dis)ans++;
}
}
pr(ans);
return 0;}
| 0
| 61,333,432
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < n; i++)
#define repd(i, n) for (int i = n-1; i > -1; i--)
#define repran(i, a,b) for (int i = a; i<b;i++)
#define all(x) (x).begin(), (x).end()
#define v(T) vector<T>
#define vv(T) vector<v(T)>
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
int main()
{
long double n, m, d;
cin >> n >> m >> d;
long double p;
if (d == 0) {p = 1/n;}
else p = 2*(n-d)/(n*n);
cout << fixed << setprecision(7) << (m-1)*p << endl;
}
|
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define _ << ' ' <<
using namespace std;
using ll = long long;
int a[200000];
int s[20];
bool ok(int x)
{
for (int i = 0; i < 20; ++i)
if ((a[x] & (1 << i)) && s[i])
return false;
return true;
}
void add(int x)
{
for (int i = 0; i < 20; ++i)
if (a[x] & (1 << i))
s[i]++;
}
void rem(int x)
{
for (int i = 0; i < 20; ++i)
if (a[x] & (1 << i))
s[i]--;
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
int p = 0, q = 0;
ll sol = 0;
add(p);
while (q < n)
{
while (q + 1 < n && ok(q + 1))
add(q + 1), q++;
sol += q - p + 1;
rem(p); p++;
if (q < p)
{
add(p);
q++;
}
}
cout << sol;
}
| 0
| 20,581,367
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll n; cin >> n;
vector<ll> a(n);
vector<ll> b(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
ll ans = 0;
for (int i = n - 1; i >= 0; --i) {
if (a[i] == 0 && ans == 0) continue;
if (a[i] == 0 && ans > 0 && b[i] == 1) continue;
if (a[i] > 0 && b[i] == 1) continue;
if ((a[i] + ans) % b[i] == 0) continue;
ll t = (a[i] + ans) / b[i];
ans += (t + 1) * b[i] - (a[i] + ans);
}
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
#define mx 200000
int main(){
int n, k, mn;
int h[mx], cost[mx];
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> h[i];
}
cost[1] = 0;
for(int i = 2; i <= n; i++){
mn = (abs(h[i] - h[i - 1])) + cost[i - 1];
for(int j = 2; j <= k ; j++){
if (i - j >= 1){
if(mn > ((abs(h[i] - h[i - j]) + cost[i - j]))){
mn = abs(h[i] - h[i - j]) + cost[i - j];
}
}
}
cost[i] = mn;
}
cout << cost[n] << endl;
return 0;
}
| 0
| 7,779,663
|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
vector<int> s;
int main(){
int i,j,min=10000000;
while(1){
cin >> n;
if(n==0)break;
min =10000000;
for(i=0;i<n;i++){
cin >> j;
a.push_back(j);
}
sort(a.begin(),a.end());
for(i=0;i<n-1;i++)if(min>a[i+1]-a[i])min = a[i+1]-a[i];
cout << min << endl;
while(a.size())a.pop_back();
}
return 0;
}
|
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define VV(T) vector<vector< T > >
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class F, class T>
void convert(const F &f, T &t){
stringstream ss;
ss << f;
ss >> t;
}
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif
#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
void mainmain(){
int n;
while(cin>>n,n){
vint v(n);
rep(i,n) cin>>v[i];
sort(ALL(v));
ll sum = 0;
reep(i,1,n-1){
sum += v[i];
}
cout << sum/(n-2) << endl;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(20);
mainmain();
}
| 0
| 10,376,957
|
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int gcd(int x,int y){
if(y==0)return x;
return gcd(y,x%y);
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
int main(){
int w;
string S;
cin>>S;
for(int i=0;i<S.length();i++){
if(S[i]=='o')w++;
}
w+=15-S.length();
if(w>=8){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {if(b>a) return b; else return a;}
int min(int a, int b) {if(b<a) return b; else return a;}
signed main() {
int N, D, A;
cin >> N >> D >> A;
V(P) XH(N);
rep(i, N) {
int x, h;
cin >> x >> h;
x--;
XH[i] = P(x, h);
}
SORT(XH);
queue<P> q;
int cnt = 0, res = 0;
rep(i, N) {
int x = XH[i].fi, h = XH[i].se;
while(!q.empty()) {
P p = q.front();
if(x>p.fi) {
cnt -= p.se;
q.pop();
} else break;
}
int b = A*cnt;
if(h>b) {
int t = ((h-b)/A) + ((h-b)%A ? 1 : 0);
res += t;
q.push(P(x+2*D, t));
cnt += t;
}
}
cout << res << endl;
return 0;
}
| 0
| 61,825,542
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = n * 800;
sum -= (n / 15) * 200;
cout << sum;
return 0;
}
|
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int 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;
}
#pragma endregion
signed main() {
int n;cin >> n;
int ans = 1;
while(ans*2<=n) ans*=2;
cout << ans << endl;
return 0;
}
| 0
| 54,159,406
|
#include<iostream>
using namespace std;
int K, S;
int main() {
cin >> K >> S;
long long ans = 0;
for (int i = 0; i <= K; i++)
for (int j = 0; j <= K; j++) {
if(0<=S-i-j&&S-i-j<=K)
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define __ <<" "<<
#define ___ <<" "
#define bash push_back
#define ALL(x) x.begin(),x.end()
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout <<fixed<<setprecision(12);
cerr <<fixed<<setprecision(12);
}
}IoSetup;
typedef long long ll;
typedef pair < int , int > pii;
static constexpr const signed int INF = 0x3f3f3f3f;
static constexpr const signed long long LINF = 0x3f3f3f3f3f3f3f3fLL;
static constexpr const signed int SMOD = 1000000007;
static constexpr const signed int NMOD = 998244353;
static constexpr const signed int dx[]={1,0,-1,0,1,1,-1,-1};
static constexpr const signed int dy[]={0,-1,0,1,-1,1,-1,1};
inline bool inside(int x,int y,int w,int h){return (x>=0 && y>=0 && x<w && y<h);}
template<class T>bool chmax(T &a, const T &b){return(a=max(a,b))==b;}
template<class T>bool chmin(T &a, const T &b){return(a=min(a,b))==b;}
inline int qp(int a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
int n;
vector<int> a;
signed main() {
cin >> n;
a.resize(n);
for(auto&&i:a) cin >> i;
sort(ALL(a));
int t = a[0], s = INF;;
for(int i = 0; i < n-1; i++) {
if(s > abs(a[n-1] - a[i] * 2)) {
s = abs(a[n-1] - a[i] * 2);
t = a[i];
}
}
cout << a[n-1] __ t << endl;
return 0;
}
| 0
| 23,407,796
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
template<typename T>
using reversed_priority_queue = \
std::priority_queue<T, std::vector<T>, std::greater<T> >;
ll INF = 1ll << 60;
signed main() {
ll K;
cin>>K;
vector<vector<PLL>> edges(K);
rep(i,0,K){
edges[i].push_back({1, (i+1)%K});
edges[i].push_back({0, (i*10)%K});
}
vector<ll> dist(K, INF);
reversed_priority_queue<PLL> q;
q.push({1,1});
while(!q.empty()){
ll d = q.top().first;
ll id = q.top().second;
q.pop();
if (d < dist[id]) {
dist[id] = d;
for(auto e: edges[id]){
q.push({e.first + d, e.second});
}
}
}
cout<<dist[0]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD = 1e9+7;
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;}
map<int, int> mp;
int n;
int ask(int i) {
i %= n;
if (mp.count(i)) return mp[i];
cout << i << endl;
string s;
cin >> s;
if (s[0] == 'V') exit(0);
return mp[i] = (s[0] == 'M');
}
int g(int i, int j) { return (j-i+n)%n;}
int main() {
cin >> n;
int l = 0, r = n/2;
int a = ask(l);
int b = ask(r);
if ((a^b) == g(l,r)%2) {
swap(l,r); r += n;
}
while (1) {
int c = (l+r)>>1;
if ((ask(l)^ask(c)) == g(l,c)%2) l = c;
else r = c;
}
return 0;
}
| 0
| 54,506,024
|
#include <iostream>
using namespace std;
int main(){
int a;
cin>>a;
if (a>=0&&a<1200){cout<<"ABC";}
else if(a>=1200&&a<2800){cout<<"ARC";}
else {cout<<"AGC";}
}
|
#include <stdio.h>
void right_triangle (int x, int y, int z)
{
if(x * x == y * y + z * z || y * y == z * z + x * x || z * z == x * x + y * y){
printf("YES\n");
} else {
printf("NO\n");
}
}
int main(void)
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i){
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
right_triangle(x, y, z);
}
return 0;
}
| 0
| 72,449,100
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
string S;
ll N,K;
cin >>S>>K;
N = S.size();
ll now=1;
rep(i,K){
if(S[i]!='1'){
cout<<S[i]<<endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
void solve(int N, string S) {
vector<int> cnt(3, 0);
REP(i, N) {
if (S[i] == 'R')
cnt[0]++;
if (S[i] == 'G')
cnt[1]++;
if (S[i] == 'B')
cnt[2]++;
}
long long ans(1);
REP(i, 3)
ans *= cnt[i];
REP(j, N) {
REP(i, j) {
const int k = j + (j - i);
if (k >= N || S[i] == S[j] || S[i] == S[k] || S[j] == S[k])
continue;
ans--;
}
}
cout << ans << endl;
}
int main(){
int N;
cin >> N;
string S;
cin >> S;
solve(N, S);
return 0;
}
| 0
| 11,790,605
|
#include<bits/stdc++.h>
using namespace std;
int h,w,m,h1,w1,maxr,maxc,row[300005],col[300005];
vector<int> vr;
vector<int> vc;
set<pair<int,int> > st;
int main(){
cin>>h>>w>>m;
for(int i=1;i<=m;i++){
cin>>h1>>w1;
st.insert(make_pair(h1,w1));
row[h1]++;
if(row[h1]==maxr){
vr.push_back(h1);
}
if(row[h1]>maxr){
maxr=row[h1];
vr.clear();
vr.push_back(h1);
}
col[w1]++;
if(col[w1]==maxc){
vc.push_back(w1);
}
if(col[w1]>maxc){
maxc=col[w1];
vc.clear();
vc.push_back(w1);
}
}
for(vector<int>::iterator it=vr.begin();it!=vr.end();it++)
for(vector<int>::iterator ite=vc.begin();ite!=vc.end();ite++){
if(st.find(make_pair(*it,*ite))==st.end()){
cout<<maxr+maxc<<endl;
return 0;
}
}
cout<<maxr+maxc-1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main(){
int h, w;
cin >> h >> w;
string s[h][w];
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
cin >> s[i][j];
}
}
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
if(s[i][j] == "snuke"){
printf("%c%d\n", 'A' + j , i+1);
}
}
}
return 0;
}
| 0
| 63,224,115
|
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e15;
const int mod=1e9+7;
const int M=100005;
int dp[203][203];
main()
{
fast
int n,m,r;
cin>>n>>m>>r;
vector<int>vec;
f(i,1,r)
{
int x;
cin>>x;
vec.pb(x);
}
f(i,1,n)
{
f(j,1,n)
{
dp[i][j]=inf;
dp[j][i]=inf;
}
}
f(i,1,m)
{
int a,b,c;
cin>>a>>b>>c;
dp[a][b]=min(dp[a][b],c);
dp[b][a]=min(dp[b][a],c);
}
f(k,1,n)
{
f(i,1,n)
{
f(j,1,n)
{
if(dp[i][j]>dp[i][k]+dp[k][j])
{
dp[i][j]=dp[i][k]+dp[k][j];
}
}
}
}
int ses=inf;
sort(vec.begin(),vec.end());
do
{
int cost=0;
for(int i=1;i<r;i++)
{
cost+=dp[vec[i]][vec[i-1]];
}
ses=min(ses,cost);
}while(next_permutation(vec.begin(),vec.end()));
cout<<ses<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#define ll long long
#define rep(i, a, b) for(int i = a; i < b; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int mx = 0;
vector<vector<int>> v(h+2, vector<int>(w+2, -2));
queue<pair<int,int>> q;
rep(i, 1, h+1) {
rep(j, 1, w+1) {
char c;
cin >> c;
if(c == '#') {
v[i][j] = 0;
q.push(make_pair(i, j));
} else v[i][j] = -1;
}
}
while(!q.empty()) {
pair<int, int> f = q.front();
q.pop();
int x = f.first, y = f.second;
if(v[x+1][y] == -1) {
v[x+1][y] = v[x][y] + 1;
q.push(make_pair(x+1, y));
if(v[x+1][y] > mx) mx = v[x+1][y];
}
if(v[x-1][y] == -1) {
v[x-1][y] = v[x][y] + 1;
q.push(make_pair(x-1, y));
if(v[x-1][y] > mx) mx = v[x-1][y];
}
if(v[x][y+1] == -1) {
v[x][y+1] = v[x][y] + 1;
q.push(make_pair(x, y+1));
if(v[x][y+1] > mx) mx = v[x][y+1];
}
if(v[x][y-1] == -1) {
v[x][y-1] = v[x][y] + 1;
q.push(make_pair(x, y-1));
if(v[x][y-1] > mx) mx = v[x][y-1];
}
}
cout << mx << "\n";
}
| 0
| 52,705,258
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,e[10000];
scanf("%d%d", &N, &M);
for(int i = 0; i < M; i++){
scanf("%d", &e[i]);
}
int s=0;
for(int i = 0; i < M; i++){
s+=e[i];
}
N = N - s;
if(N >= 0){
cout << N << endl;
}else{
printf("-1");
}
}
|
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
#include <numeric>
#include <string.h>
#include <sys/time.h>
#include <random>
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef pair<ll, ll> P;
typedef pair<double, P> T;
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <class T0, class T1>
class LazySegmentTree{
private:
void eval(int k, int len){
node[k] = g(node[k], p(lazy[k], len));
if(len > 1){
lazy[2 * k + 1] = f1(lazy[2 * k + 1], lazy[k]);
lazy[2 * k + 2] = f1(lazy[2 * k + 2], lazy[k]);
}
lazy[k] = u1;
}
void update(int a, int b, T1 x, int k, int l, int r){
eval(k, r - l);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy[k] = f1(lazy[k], x);
eval(k, r - l);
}
else{
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = f0(node[2 * k + 1], node[2 * k + 2]);
}
}
T0 query(int a, int b, int k, int l, int r){
if (r <= a || b <= l){
return u0;
}
eval(k, r - l);
if (a <= l && r <= b){
return node[k];
}
T0 vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
T0 vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return f0(vl, vr);
}
public:
int sz;
int n;
vector<T0> node;
vector<T1> lazy;
using F0 = function<T0(T0, T0)>; F0 f0; T0 u0;
using F1 = function<T1(T1, T1)>; F1 f1; T1 u1;
using G = function<T0(T0, T1)>; G g;
using P = function<T1(T1, int)>; P p;
LazySegmentTree(vector<ll> v, F0 f0, T0 u0, F1 f1, T1 u1, G g, P p):
sz(v.size()), f0(f0), u0(u0), f1(f1), u1(u1), g(g), p(p){
int sz = v.size();
n = 1;
while(n < sz) n *= 2;
node.resize(2*n-1, u0);
lazy.resize(2*n-1, u1);
for(int i = 0; i < sz; i++){
node[i+n-1] = v[i];
}
for(int i = n-2; i >= 0; i--){
node[i] = f0(node[i*2+1], node[i*2+2]);
}
}
void update(int a, int b, T1 x){
update(a, b, x, 0, 0, n);
}
void update(int a, T1 x){
update(a, a+1, x);
}
T0 query(int a, int b){
return query(a, b, 0, 0, n);
}
T0 query(int a){
return query(a, a+1);
}
};
int main(){
ll n, d, a; cin >> n >> d >> a;
vector<P> x(n);
vector<ll> v(n), x2(n);
for(int i = 0; i < n; i++){
cin >> x[i].fs >> x[i].sc;
}
sort(x.begin(), x.end());
for(int i = 0; i < n; i++){
v[i] = x[i].sc;
x2[i] = x[i].fs;
}
LazySegmentTree<ll, ll> seg(v,
[](ll x, ll y) { return x + y; }, 0,
[](ll x, ll y) { return x + y; }, 0,
[](ll x, ll y) { return x - y; },
[](ll x, int len) { return x; });
ll res = 0;
for(int i = 0; i < n; i++){
ll now = seg.query(i);
if(now <= 0){
continue;
}
auto itr = upper_bound(x2.begin(), x2.end(), x2[i] + 2 * d);
seg.update(i, itr - x2.begin(), (now + a - 1) / a * a);
res += (now + a - 1) / a;
}
cout << res << endl;
return 0;
}
| 0
| 1,970,137
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(a, b) for (int i = 0; i < (b); ++i)
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
void solve(void)
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<bool> f(n, true);
const int INF = 1e9;
int res = INF;
while (n > 1)
{
auto mn = min_element(a.begin(), a.end());
vector<int> tmp;
tmp.push_back(*mn);
int dis = distance(a.begin(), mn);
rep(i, n)
{
if (dis == i)
continue;
if (a[i] % *mn != 0)
tmp.push_back(a[i] % *mn);
else
--n;
}
a = tmp;
res = min(res, *mn);
}
cout << res << endl;
}
int main(void)
{
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define REP1(i,n) for(int i=1;i<((int)n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define yes cout<<"Yes"<<endl
#define YES cout<<"YES"<<endl
#define no cout<<"No"<<endl
#define NO cout<<"NO"<<endl
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
ll mpow(ll m, ll p){
ll power = m;
ll res = 1;
while(p>0){
if(p&1)
res = res*power;
power = power*power;
p /= 2;
}
return res;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
cin>>n>>k;
vll a(n);
REP(i,n)cin>>a[i];
vll remind(n+1);
REP(i,n)remind[i+1]=remind[i]+a[i];
vll sum(n*(n+1)/2);
ll cur=0;
for(ll i=0; i<n; i++){
for(ll j=i+1; j<=n; j++){
sum[cur]=remind[j]-remind[i];
cur++;
}
}
ll max_p=40;
ll now=0;
ll base=pow(2,40);
for(ll i=max_p; i>=0; i--){
ll cnt=0;
REP(j,sum.size()){
if(((now+base)&sum[j])==now+base)
cnt++;
}
if(k<=cnt)
now+=base;
base/=2;
}
cout<<now<<endl;
}
| 0
| 5,003,260
|
#include <bits/stdc++.h>
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define rep(i,n) FOR(i,0,n)
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a,const T &b){
if(a>b)return false;
a=b;
return true;
}
template<class T>bool chmin(T &a,const T &b){
if(a<b)return false;
a=b;
return true;
}
const ll mod=1e9+7;
const ll inf=1ll<<60;
ll n,k,ans,num;
vector<ll> a,b;
int main(){
cin>>n>>k;
a.resize(n);
b.resize(n);
rep(i,n){
cin>>a[i]>>b[i];
if((k&a[i])==a[i])ans+=b[i];
}
rep(i,31){
if((k>>i)&1==1){
ll K=k;
K|=(1<<i)-1;
K-=(1<<i);
num=0;
rep(j,n){
if((K&a[j])==a[j]){
num+=b[j];
}
}
chmax(ans,num);
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a,ll b)
{
if(a>b)
return a;
return b;
}
ll power(ll x, ll y,ll mod)
{
ll temp;
if( y == 0)
return 1;
temp = power(x, y/2,mod);
if (y%2 == 0)
return (temp*temp)%mod;
else
return (((x*temp)%mod)*temp)%mod;
}
ll binomialCoeff(ll n, ll k)
{
ll C[k+1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (ll i = 1; i <= n; i++)
{
for (ll j = min(i, k); j > 0; j--)
C[j] = C[j] + C[j-1];
}
return C[k];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map <int,int> m;
for(int i=0;i<3;i++)
{
int x=nxt();
m[x]+=1;
}
auto it=m.begin();
if(it->second==1)
cout<<it->first<<endl;
else
{
it++;
cout<<it->first<<endl;
}
return 0;
}
| 0
| 79,114,596
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF 1e18
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define PI (acos(-1))
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define rep(i, init, n) for(int i = init; i <(int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
cout << (a * a - b) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 998244353;
struct mint {
ll x;
mint() :x(0) {}
mint(ll x) :x((x% mod + mod) % mod) {}
mint& fix() { x = (x % mod + mod) % mod; return *this; }
mint operator-() const { return mint(0) - *this; }
mint& operator+=(const mint& a) { if ((x += a.x) >= mod) x -= mod; return *this; }
mint& operator-=(const mint& a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; }
mint& operator*=(const mint& a) { (x *= a.x) %= mod; return *this; }
mint operator+(const mint& a)const { return mint(*this) += a; }
mint operator-(const mint& a)const { return mint(*this) -= a; }
mint operator*(const mint& a)const { return mint(*this) *= a; }
bool operator<(const mint& a)const { return x < a.x; }
bool operator==(const mint& a)const { return x == a.x; }
};
istream& operator>>(istream & i, mint & a) { i >> a.x; return i; }
ostream& operator<<(ostream & o, const mint & a) { o << a.x; return o; }
typedef vector<mint> vm;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<ll> d(n);
vector<ll> mp(n + 1);
rep(i, n) {
cin >> d[i];
mp[d[i]]++;
}
if (d[0] != 0) {
puts("0");
return 0;
}
if (mp[0] != 1) {
puts("0");
return 0;
}
mint ans = 1;
mint tmp = 1;
rrep(i, n) {
rep(j, mp[i]) ans *= tmp;
tmp = mp[i];
}
dunk(ans);
return 0;
}
| 0
| 34,458,031
|
#include <iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int min8 = (a * 100 + 7) / 8;
int max8 = ((a + 1) * 100 + 7) / 8 - 1;
int min10 = (b * 100 + 9) / 10;
int max10 = ((b + 1) * 100 + 9) / 10 - 1;
if (min8 < min10) {
if (max8 < min10) cout << -1;
else cout << min10;
}
else {
if (max10 < min8) cout << -1;
else cout << min8;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define no cout << "No" << endl
#define yes cout << "Yes" << endl
#define tc ll t; cin >> t; while (t--)
#define sz(c) (ll) (c).size()
#define trav(x,c) for(auto &x : c)
#define all(c) (c).begin(), (c).end()
#define rll(c) (c).rbegin(), (c).rend()
#define _for(i,a,n) for(ll i = a ; i < n; ++i)
#define _rfor(i,a,n) for(ll i = n-1 ; i >= a; --i)
#define dx(x) cout << #x << ": " << x << endl;
#define dc(c) trav(x,c) cout << x << " "; cout << endl;
#define godspeed ios::sync_with_stdio(0); cin.tie(0);
int main() {
godspeed;
ll n, m, x; cin >> n >> m;
ll ans = 0;
vl v(n); _for(i,0,n) cin >> v[i];
sort(all(v));
_for(i,0,n-m) ans += v[i];
cout << ans;
}
| 0
| 24,256,191
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i,n,init) for(ll i=init;i<(n);i++)
#define repd(i,n,init) for(ll i=(n);i>=init;i--)
#define repm(i,m) for(auto i=m.begin();i!=m.end();i++)
#define repb(bit,n,init) for(ll bit=init;bit<(1<<n);++bit)
int main()
{
ll A,B,X;
cin >> A >> B >> X;
cout << (A+B>=X && A<=X?"YES":"NO") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Max=1e5+10;
const int MOD=1e9+7;
int a[Max];
int pos[Max];
ll inv[Max];
ll fac[Max];
int sp;
int ss;
void init() {
fac[0]=1;
fac[1]=1;
inv[0]=1;
inv[1]=1;
for(ll i=2; i<=Max; i++) {
fac[i]=fac[i-1]*i%MOD;
inv[i]=(MOD-MOD/i)*inv[MOD%i]%MOD;
}
for(ll i=1; i<=Max; i++)
inv[i]=inv[i]*inv[i-1]%MOD;
}
ll C(ll n, ll m) {
if(m>n)
return 0;
return ((fac[n]*inv[m]%MOD)*inv[n-m])%MOD;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
init();
for(int i=1;i<=n+1;i++){
cin>>a[i];
if(pos[a[i]]){
ss=a[i];
sp=i;
}else{
pos[a[i]]=i;
}
}
for(int i=0;i<=n;i++){
ll res=0;
res+=C(n+1,i+1);
res%=MOD;
res=(res+MOD-C(n-sp+pos[a[sp]],i))%MOD;
cout<<res<<endl;
}
return 0;
}
| 0
| 56,063,441
|
#include <bits/stdc++.h>
using namespace std;
using vvll = vector<vector<long long>>;
constexpr long long INF = 1e18;
vvll warshall_floyd(const vvll & Es){
vvll dist(Es);
for (int k = 0; k < Es.size(); ++k){
for (int i = 0; i < Es.size(); ++i){
if (dist[i][k] == INF) continue;
for (int j = 0; j < Es.size(); ++j){
if (dist[k][j] == INF) continue;
if (dist[i][j] > dist[i][k] + dist[k][j]){
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
return dist;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int V, E;
cin >> V >> E;
vvll Es(V, vector<long long>(V, INF));
for (int i = 0; i < V; ++i) Es[i][i] = 0;
while (E--){
int s, t;
long long d;
cin >> s >> t >> d;
Es[s][t] = d;
}
auto dist = warshall_floyd(Es);
for (int i = 0; i < V; ++i){
if (dist[i][i] < 0){
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
for (const auto & row : dist){
if (row[0] == INF) {
cout << "INF";
} else {
cout << row[0];
}
for (int i = 1; i < row.size(); ++i) {
if (row[i] == INF) {
cout << " INF";
} else {
cout << ' ' << row[i];
}
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n;
int ans=0;
cin >>n;
cout<<n*n<<endl;
}
| 0
| 96,053,592
|
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
ll cnt;
int main(){
ll n;
cin >> n;
ll a[n];
cinf(a,n);
ll start=1;
while(start!=2){
start=a[start-1];
cnt++;
if(cnt>n){
cout << -1 << endl;
return 0;
}
}
cout << cnt << endl;
}
|
#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(){
int N, M;
cin >> N >> M;
vector<ll> x(N), y(N);
vector<ll> nx(M), ny(M);
for (int i = 0; i < N; i++) cin >> x[i] >> y[i];
for (int i = 0; i < M; i++) cin >> nx[i] >> ny[i];
for (int i = 0; i < N; i++) {
int ans = 0;
ll mi = LINF;
for (int j = 0; j < M; j++) {
ll dist = abs(x[i] - nx[j]) + abs(y[i] - ny[j]);
if (dist < mi) {
mi = dist;
ans = j;
}
}
cout << ans + 1 << '\n';
}
}
| 0
| 71,327,758
|
#include<cstdio>
#include<algorithm>
int main(void)
{
int a,s,d,f,g,h,i,j;
scanf("%d",&f);
for(i=0;i<f;i++){
scanf("%d %d %d",&a,&s,&d);
if(a*a==s*s+d*d||d*d==s*s+a*a||s*s==d*d+a*a)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define roop(i, n) for(int i = 0;i < n;i++)
int main(void){
string str;
cin >> str;
int al[26] = {0};
roop(i, str.length()) al[str[i]-'a']++;
roop(i, 26){
if(al[i] == 0){
str += (char)(i+'a');
cout << str << endl;
return 0;
}
}
string t = str;
if(next_permutation(t.begin(), t.end()) == false){
cout << -1 << endl;
return 0;
}
roop(i, str.length()-1){
cout << t[i];
if(t[i] != str[i]) break;
}
cout << endl;
return 0;
}
| 0
| 96,807,862
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int a[n];
for(int i = 0 ; i < n; i++){
cin >> a[i];
}
int count = k;
if(n == k){
cout << 1 << endl;
return 0;
}
for(int i = 1; ; i++){
count += k-1;
if(count >= n){
cout << i+1 << endl;
return 0;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
while(true){
string S;
cin >> S;
if( S == "0")
break;
int sum = 0;
for(auto& c : S){
sum += c - '0';
}
cout << sum << endl;
}
return 0;
}
| 0
| 36,565,162
|
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
int main(){
int n,m;
cin>>n>>m;
vector<int>a(m);
rep(i,m)cin>>a[i];
sort(a.rbegin(),a.rend());
vector<int>nd(10);
vector<int>dp(n+1,-1);
vector<int>cnt(n+1);
dp[0]=0;
nd[1]=2;
nd[2]=5;
nd[3]=5;
nd[4]=4;
nd[5]=5;
nd[6]=6;
nd[7]=3;
nd[8]=7;
nd[9]=6;
rep(i,n+1){
rep(j,m){
if(i>=nd[a[j]]&&dp[i-nd[a[j]]]>=0){
dp[i]=max(dp[i],dp[i-nd[a[j]]]+1);
}
}
}
int num=dp[n];
while(num>0){
rep(j,m){
if(n>=nd[a[j]]&&dp[n-nd[a[j]]]+1==dp[n]){
cout<<a[j];
num--;
n-=nd[a[j]];
break;
}
}
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< pair<long long, long long> > vllll;
typedef map<int, int> mii;
typedef map<long long, long long> mllll;
typedef queue<int> qi;
typedef queue< pair<int, int> > qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define uni(v) do{ \
sort(v.begin(), v.end()); \
decltype(v)::iterator result = unique(v.begin(), v.end()); \
v.erase(result, v.end()); \
}while(0)
#define fi(init, n) for(int i = init; i < n; ++i)
#define fj(init, n) for(int j = init; j < n; ++j)
#define fk(init, n) for(int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
#define bitsum(x) __builtin_popcount(x)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = { 0, 1, 0, -1 };
const int dj[] = { 1, 0, -1, 0 };
template<typename T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template<typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template<typename T>
int finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size()) return 1;
else return 0;
}
ll frac(ll n){
if (n == 0) return 1;
return (n * frac(n - 1)) % MOD;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(int argc, char** argv) {
#ifdef HIRO
string quiz(argv[1]);
string id(argv[2]);
string filename("input/" + quiz + "/" + id + ".txt");
ifstream fin(filename);
if (fin.peek() == ifstream::traits_type::eof()) {
cout << "No input.";
return 0;
}
ifstream cin(filename);
std::cin.rdbuf(cin.rdbuf());
#endif
ll ans = 0;
ll n, k;
cin >> n >> k;
ll arr[n], order[n], all[n], ordersum = 0, allsum = 0;
zero(order);
zero(all);
fi(0, n)
cin >> arr[i];
fi(0, n)
fj(0, n) {
if(arr[i] > arr[j]) {
all[i]++;
if(i < j)
order[i]++;
}
}
fi(0, n) {
(ordersum += order[i]) %= MOD;
}
fi(0, n) {
(allsum += all[i]) %= MOD;
}
(ans += k * ordersum) %= MOD;
(ans += (((k * (k - 1) / 2) % MOD) * allsum) % MOD ) %= MOD;
cout << ans << endl;
return 0;
}
| 0
| 91,473,233
|
#include <bits/stdc++.h>
#include <atcoder/all>
#include <iostream>
#include <vector>
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Vc vector<char>
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
using namespace std;
using namespace atcoder;
signed main(){
int N,Q;
cin >> N >> Q;
dsu d(N);
int t,u,v;
rep(i,0,Q){
cin >> t >> u >> v;
if (t){
if (d.same(u,v)){
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} else {
d.merge(u,v);
}
}
}
|
#include<iostream>
int main(){
int h;
int w;
while(true){
std::cin>>h;
std::cin>>w;
if(h==0&&w==0){
break;
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(i==0||i==h-1||j==0||j==w-1){
std::cout<<"#";
}else{
std::cout<<".";
}
}
std::cout<<std::endl;
}
std::cout<<std::endl;
}
return 0;
}
| 0
| 28,186,259
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
ll c, d, cd;
ll f(ll n) {
ll dn = n/d;
ll cn = n/c;
ll cdn = n/cd;
return n - (dn + cn - cdn);
}
int main() {
ll a, b; cin >> a >> b >> c >> d;
cd = lcm(d, c);
cout << f(b) - f(a-1) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pf pop_front()
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define loopl(i,a,b) for(lli i=a;i<b;i++)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
#define mod2 1000000006
#define inf 100000000000000000
#define lld long double
#define pll pair<long long int,long long int>
#define pii pair<int,int>
#define vll vector<lli>
#define vii vector<int>
#define is indexed_set
#define eps 0.000001
#define endl '\n'
#define mo 998244353
#define pi 3.141592653589793
using namespace std ;
typedef tree<pair<pll,lli>,null_type,less<pair<pll,lli>>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
#define MAXN 200000
lli power(lli x, lli y, lli p)
{
lli res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
int main()
{
fastio;
lli n;
cin>>n;
lli a[n+1],cnt[n]={0};
loopl(i,1,n+1)
{
cin>>a[i];
cnt[a[i]]++;
}
if(a[1] !=0 || cnt[0]>1)
{
cout<<0;
return 0;
}
lli ans=1;
loopl(i,1,n)
{
ans = ans*power(cnt[i-1],cnt[i],mo);
ans %= mo;
}
cout<<ans;
}
| 0
| 46,897,677
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define fo(i,j,n) for (int i=(j); i < (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 main(){
int a, b, c; cin >> a >> b >> c;
if(a+b>=c) cout << "Yes" << ln;
else cout << "No" << ln;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define ld long double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
vi A(100001,0);
rep(i,n){
int a; cin>>a;
A[a]++;
}
int ans,sum=0;
rep(i,100001){
sum+=max(A[i]-1,0);
}
ans = n-(sum+1)/2*2;
cout<<ans<<endl;
return 0;
}
| 0
| 19,410,122
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> point(n);
vector<pair<int,int>> cpoint(m);
rep(i,n){
int x,y;
cin >> x >> y;
point[i]={x,y};
}
rep(i,m){
int x,y;
cin >> x >> y;
cpoint[i]={x,y};
}
rep(i,n){
int dis = 1 << 30;
int res = -1;
rep(j,m){
if (abs(cpoint[j].first-point[i].first) + abs(cpoint[j].second-point[i].second) < dis){
dis = abs(cpoint[j].first-point[i].first) + abs(cpoint[j].second-point[i].second);
res = j+1;
}
}
cout << res << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define n0_nnE int main(){
using namespace std;
typedef long long ll;
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
long long ans = 0;
int MaxNum = 0;
for (int i = 0; i < N; i++)
{
MaxNum = max(MaxNum, A[i]);
int Bi = MaxNum;
ans += Bi - A[i];
}
cout << ans << endl;
}
| 0
| 70,079,742
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,b) for (int i = 0; i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=3.14159265358979323846;
int main () {
int N;
cin >> N;
string s[N];
int na,nb, nab;
na = nb = nab = 0;
int ans = 0;
rep(i,N) {
cin >> s[i];
if (s[i][0] == 'B' && s[i].back()=='A') {
nab++;
}
else if (s[i][0] == 'B') {
nb++;
}
else if (s[i].back()=='A') {
na++;
}
rep(j,s[i].size()-1) {
if (s[i][j]=='A' && s[i][j+1]=='B') {
ans++;
}
}
}
if (na+nb==0) {
ans += max(nab-1,0);
}
else {
ans += nab+min(na,nb);
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n];
int i;
int cnt=0;
for(i=1;i<=n;i++)
{
cin >> a[i];
if(i>1)
{
if(a[i]<=a[i-1])
{
cnt++;
}
else
{
a[i]=a[i-1];
}
}
}
cout << ++cnt<< endl;
return 0;
}
| 0
| 60,994,260
|
#include<iostream>
#include<set>
#include<algorithm>
#include<map>
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rev(i,b,a) for(ll i=b-1;i>=a;i--)
#define eqrep(i,b) for(ll i=1;i<=b;i++)
#define itrep(at) for (auto it = at.begin(); it != at.end(); it++)
#define ld long double
#define pb push_back
#define eb emplace_back
#define w(t) while (t--)
#define booster \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define deb1(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout << #x << " : " << x << "\t" << #y << " : " << y << endl;
#define deb3(x, y, z) cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " << z << endl;
#define deb4(x, y, z, w) cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " << z << "\t" << #w << " : " << w << endl;
#define deb5(a, b, c, d, e) cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define deb6(a, b, c, d, e, f) cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " << #f << ": " << f << endl;
using namespace std;
long long cost = 1e18;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
booster;
ll n;
cin>>n;
string s;
cin>>s;
ll cnt=0;
rep(i,0,n)
{
if(s[i]!=s[i+1])
{
cnt++;
}
}
cout<<cnt<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#define invrep(i,n) for(int64_t i=n-1;i >= 0;i--)
#define _GLIBCXX_DEBUG
using namespace std;
int main(){
int64_t n,k;
cin >> n >> k;
vector<int64_t> a(n);
rep(i,n){
cin >> a[i];
}
vector<int64_t> ruiseki(1);
rep(i,n){
ruiseki.push_back(ruiseki.back()+a[i]);
}
vector<int64_t> cand;
for(int64_t i=0;i < n+1;i++){
for(int64_t j=i+1;j < n+1;j++){
cand.push_back(ruiseki[j]-ruiseki[i]);
}
}
int64_t sieve = 1;
sieve = sieve << 60;
vector<int64_t> goods = cand;
while(sieve > 0){
vector<int64_t> sieved;
rep(i,goods.size()){
if(goods[i] & sieve){
sieved.push_back(goods[i]);
}
}
if(sieved.size() >= k){
goods.clear();
goods = sieved;
}
sieve = sieve >> 1;
}
int64_t res = 0;
rep(i,k){
if(i == 0){
res = goods[0];
}else{
res = res & goods[i];
}
}
cout << res << endl;
}
| 0
| 38,471,274
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll n;
cin>>n;
vector<ll> v={1,6,36,216,1296,7776,46656,9,81,729,6561,59049};
sort(ALL(v));
ll dp[n+1];
rep(i,n+1) dp[i]=1e16;
dp[0]=0;
rep(i,v.size()){
rep(j,n+1){
if(j-v[i]>=0) chmin(dp[j],dp[j-v[i]]+1);
}
}
cout<<dp[n]<<endl;
}
|
#include <iostream>
using namespace std;
long long factorial[21];
void init(){
factorial[1] = 1;
for(int i = 2;i < 21; i++){
factorial[i] = factorial[i-1] * i;
}
}
int main(){
init();
int n;
while(cin >> n){
cout << factorial[n] << endl;
}
return 0;
}
| 0
| 61,801,700
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int target = 0;
for(int i : a){
target += i;
}
if((10*target / n)% 10 >= 5) target = target/n + 1;
else target = target/n;
int cost = 0;
for(int i : a){
cost += pow(i - target, 2);
}
cout << cost << endl;
}
|
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
#include <cstdlib>
#include <numeric>
#include <queue>
#include <complex>
#include <sstream>
#include <stack>
using namespace std;
#define reep(i, f, n) for (int i = f; i < n; ++i)
#define rep(i, n) reep(i, 0, n)
int main(){
double x1,x2,x3,y1,y2,y3,xp,yp;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp)!=EOF){
double d1 = (x2-x1)*(yp-y1) - (xp-x1)*(y2-y1);
double d2 = (x3-x2)*(yp-y2) - (xp-x2)*(y3-y2);
double d3 = (x1-x3)*(yp-y3) - (xp-x3)*(y1-y3);
if (( d1<0 && d2<0 && d3<0 ) || ( d1>0 && d2>0 && d3>0 )) printf("YES\n");
else printf("NO\n");
}
return 0;
}
| 0
| 35,312,689
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
const ll LINF=1e18;
int main(){
int n;
cin>>n;
int a[n],b[n];
ll sum=0;
int minb=INF;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
sum+=a[i];
if(a[i]>b[i]){
minb=min(minb,b[i]);
}
}
if(minb==INF)cout<<0<<endl;
else cout<<sum-minb<<endl;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define endl "\n"
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void Raghav()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(1003);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main()
{
Raghav();
string s;
cin >> s;
if (s[0] == s[1] && s[1] == s[2])
cout << "No";
else
cout << "Yes";
return 0;
}
| 0
| 88,400,118
|
#include<iostream>
using namespace std;
int main()
{
int n;
int y, m, d;
cin >> n;
int diff = 1;
for (int i = 1; i < 1000; i++)
{
if (i % 3 == 0)
{
diff += 10 * 20;
}
else
{
diff += 5 * 19 + 5 * 20;
}
}
for (int i = 0; i < n; i++)
{
cin >> y >> m >> d;
int sum = 0;
for (int j = 1; j < y; j++)
{
if (j % 3 == 0)
{
sum += 10 * 20;
}
else
{
sum += 5 * 19 + 5 * 20;
}
}
if (y % 3 == 0)
{
sum += ((m-1) * 20);
}
else
{
for (int j = 1; j < m; j++)
{
if (j % 2 == 0)
{
sum += 19;
}
else
{
sum += 20;
}
}
}
sum += d;
cout << diff - sum << endl;
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <iomanip>
#include <cassert>
using namespace std;
typedef long long ll;
int gcd(int a, int b){
if(a>b)return gcd(b,a);
if(b%a==0) return a;
else return gcd(b%a,a);
}
int main(){
int N,M;
cin >> N >>M;
int a[N];
long long k=1;
for (int i = 0; i < N; i++)
{
cin >> a[i];
}
for (int i = 0; i < N; i++)
{
k *= (a[i]/2)/gcd(a[i]/2, k);
if(k > M){
cout << 0 << endl;
return 0;
}
}
for(int i = 0 ; i < N; i++){
if((k/(a[i]/2))%2==0){
cout << 0 << endl;
return 0;
}
}
cout << ((M/k)+1)/2 << endl;
return 0;
}
| 0
| 38,013,600
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)(j);i <= (int)(k);i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define fix cout<<fixed<<setprecision(20);
const int maxn=(int)1e6+5;
typedef long long ll;
ll MOD = (ll)1e9+7;
inline ll qpow(ll a, ll b) {return b? ((b&1)? a*qpow(a*a%MOD,b>>1)%MOD: qpow(a*a%MOD,b>>1))%MOD: 1;}
inline ll gcd(ll a, ll b) {return b? gcd(b, a%b): a;}
ll n,k;
ll dp[maxn];
ll num(ll x){
if(dp[x])return dp[x];
ll ret=qpow(k/x,n);
for(int y=x+x;y<=k;y+=x)ret-=num(y),ret+=MOD,ret%=MOD;
return dp[x]=ret;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>k;
ll ans=0;
for(int x=k;x>=1;x--){
ans+=x*num(x)%MOD;ans%=MOD;
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
int main()
{
optimize();
int a,b;
cin>>a>>b;
string sa=to_string(a);
string cpa=sa;
string sb=to_string(b);
string cpb=sb;
for(int i=0;i<b-1;i++)
{
sa=sa+cpa;
}
for(int i=0;i< a-1;i++)
{
sb+=cpb;
}
if(a==b)
{
cout<<sa;
}
else
{
if(sa<sb)
cout<<sa;
else cout<<sb;
}
return 0;
}
| 0
| 91,164,775
|
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <cstring>
using namespace std;
string keys[10] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main(){
int N;
cin >> N;
for(int i = 0; i < N; i++){
string key_string;
cin >> key_string;
string ans;
bool in_loop = false;
int loop_ind = 0;
int cur_key;
for(int j = 0; j < key_string.size(); j++){
if(key_string[j] == '0'){
if(in_loop){
ans += keys[cur_key][loop_ind];
in_loop = false;
}
} else {
if(in_loop){
loop_ind = (loop_ind + 1) % keys[cur_key].size();
} else {
in_loop = true;
loop_ind = 0;
cur_key = key_string[j] - '0';
}
}
}
cout << ans << endl;
}
return 0;
}
|
# include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const long long INF = 1LL << 60;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
uintmax_t combination(unsigned int n, unsigned int r) {
if ( r * 2 > n ) r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for ( unsigned int i = 1; i <= r; ++i ) {
dividend *= (n-i+1);
divisor *= i;
}
return dividend / divisor;
}
int modPow(long long a, long long n, long long p) {
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
long long t = modPow(a, n / 2, p);
return (t * t) % p;
}
int main()
{
int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int x = 60*c + d - 60*a - b;
int ans = x - e;
cout << ans << endl;
return 0;
}
| 0
| 74,561,732
|
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(){
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << setprecision(5) << hypot(x2 - x1, y2 - y1) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define ldou long double
#define fi first
#define se second
#define setpre(x) std::cout << fixed << setprecision(x)
#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 out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x)?("Yes"):("No")) << endl
#define YN(x) cout << ((x)?("YES"):("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger(){ std::cout << " [LOGGER] " << endl; }
template<typename A, typename... B>
void logger(const A& a, const B&... b){
cout << a << " , "; logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 2000005;
int main(){
lint n; cin >> n; lint ans = 0;
repn(k, n){
lint l = n / k;
ans += k*(l*(l+1)/2);
}
out(ans);
}
| 0
| 64,973,220
|
#include <bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using bl = bool;
using vll = V<ll>;
using vpll =V<pair<ll,ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using vbl = V<bl>;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define rFOR(i,a,b) for(ll i=(a);i>(b);i--)
#define oFOR(i,a,b) for(ll i=(a);i<(b);i+=2)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn,(a).en)
#define REV(a) reverse((a).bgn,(a).en)
#define M(a,b) max(a,b)
#define rM(a,b) min(a,b)
#define fi first
#define se second
#define sz size()
#define gcd(a,b) __gcd(a,b)
#define co(a) cout<<a<<endl;
#define ci(a) cin>>a;
ll sum(ll n) {
ll m=0;
FOR(i,0,20){
m+=n%10;
n/=10;
if(n==0){
break;
}
}
return m;
}
ll combi(ll n,ll m) {
ll ans=1;
rFOR(i,n,n-m){
ans*=i;
}
FOR(i,1,m+1){
ans/=i;
}
return ans;
}
ll lcm(ll a,ll b){
ll n;
n=a/gcd(a,b)*b;
return n;
}
signed main() {
vll A(6);
FOR(i,0,6){
ci(A[i])
}
SORT(A);
ll count=0;
FOR(i,1,5){
if(A[i]==A[i+1]&&A[i]==A[i-1]){
co("NO")
break;
}
if(i==4){
co("YES")
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define vit vector<int>::iterator
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fr first
#define sc second
#define skip continue
#define PI 3.14159265
typedef unsigned long long ull;
typedef long long ll;
typedef unsigned int ui;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<bool> vb;
const int INF = 1e9 + 5;
const long long MAXN=2e5 + 5;;
void faster(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
bool cmp(const string& a, const string& b) {
return (a + b) < (b + a);
}
vector<int> Reversed(const vector<int>& s){
vector<int> d = s;
reverse(all(d));
return d;
}
void solve(){
string s = "aeiou";
char c;
cin >> c;
for(int i = 0; i < s.size(); i++){
if(s[i] == c){
cout << "vowel";
return;
}
}
cout << "consonant";
}
int main(){
int n = 1;
while(n--){
solve();
cout << endl;
}
}
| 0
| 12,623,143
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define loop(i,x,n) for(ll i = x;i<n;i++)
#define S(v) sort(v.begin(), v.end());
#define ff first
#define ss second
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll n;
cin>>n;
vector<ll> v(n);
loop(i,0,n)cin>>v[i];
S(v);
ll x = (n+1)/2;
cout<<v[x] - v[x - 1];
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
int N; cin >> N;
vecl A(N);
REP(i,N) {
cin >> A[i];
}
sort(A.begin(),A.end());
int cnt = 0;
ll total = 0;
REP(i,N-1) {
total += A[i];
if(2*total >= A[i+1]) cnt++;
else cnt = 0;
}
cout << cnt+1 << endl;
}
| 0
| 99,567,257
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <numeric>
int main() {
int N=0;
int K=0;
int X=0;
int Y=0;
std::cin >>N>>K>>X>>Y;
int total=0;
if (N>=K)
{
total=K*X+(N-K)*Y;
}else
{
total=N*X;
}
std::cout << total << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define pb push_back
#define ff first
#define ss second
#define INF int(3e9)
#define BIG_INF ll(9e18)
#define SIZE 100001
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define len(v) int((v).size())
#define sqr(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
#define filein freopen("input.txt", "r", stdin)
#define fileout freopen("output.txt", "w", stdout);
ll binpow(ll a, ll b, ll MOD = BIG_INF)
{
ll res = 1;
while(b)
{
if(b & 1)
res *= a;
a *= a;
b >>= 1;
a %= MOD;
res %= MOD;
}
return res % MOD;
}
const ll mod = 1e9 + 7;
int T = 1;
int n, m;
ll h[SIZE], p[SIZE];
vector<int> g[SIZE];
vector<int> cnt, nxt;
bool OK = 1;
void dfs(int u, int pr, int kGood, int kBad)
{
for(int v: g[u])
{
if(v == pr) continue;
int good = 0, bad = 0;
good = cnt[v] + h[v];
good = (good + 1) / 2;
bad = cnt[v] - good;
if(good < 0 || bad < 0 || good - bad != h[v])
{
OK = 0;
return;
}
kBad -= bad;
kGood -= good;
if(kGood < 0)
{
OK = 0;
return;
}
if(kBad < 0)
{
int d = abs(kBad);
if(d > kGood)
{
OK = 0;
return;
}
kGood -= d;
kBad = 0;
}
dfs(v, u, good, bad);
}
if(kGood + kBad != p[u])
{
OK = 0;
}
}
void calc(int u, int pr)
{
for(int v: g[u])
{
if(v != pr)
{
calc(v, u);
cnt[u] += cnt[v];
}
}
cnt[u] += p[u];
}
void solve()
{
int x;
cin >> x;
if(x <= 599) cout << '8';
else if(x <= 799) cout << '7';
else if(x <= 999) cout << '6';
else if(x <= 1199) cout << "5";
else if(x <= 1399) cout << "4";
else if(x <= 1599) cout << '3';
else if(x <= 1799) cout << '2';
else cout << 1;
return;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
while(T--)
{
solve();
}
return 0;
}
| 0
| 45,878,304
|
#include <iostream>
int sumOfIntegers(int min, int num, int sum);
int main()
{
int num, sum;
while (true) {
std::cin >> num >> sum;
if (num == 0 && sum == 0) {
break;
}
std::cout << sumOfIntegers(0, num, sum) << std::endl;
}
return 0;
}
int sumOfIntegers(int min, int num, int sum)
{
if (min > sum || min > 9 || num == 0) {
return 0;
}
if (min == sum && num == 1) {
return 1;
}
return (sumOfIntegers(min + 1, num, sum) + sumOfIntegers(min + 1, num - 1, sum - min));
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>
using namespace std;
#define DEBUG_
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define equals(a,b) (fabs((a)-(b)) < EPS)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template <typename T>
std::string printVector(const std::vector<T> &data)
{
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
template <typename T>
void print_array(const T &ary, int size){
REP(i,size){
cout << ary[i] << " ";
}
cout << endl;
}
const int MOD = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
const double EPS = (1e-10);
signed main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12);
int H,W,A,B; cin >>H>>W>>A>>B;
REP(i,H) {
REP(j,W){
if(i < B){
if(j < A) cout << 0;
else cout << 1;
}else{
if(j < A) cout << 1;
else cout << 0;
}
}
cout << endl;
}
}
| 0
| 88,957,970
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
using T = tuple<string,int,int>;
int main(){
int n,k,s;
cin >> n >> k >> s;
int a = s+1;
if(a > 1000000000){
a = 1;
}
rep(i,k) cout << s << " ";
for(int i = k; i < n; i++) cout << a << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
int n, m;
cin >> n >> m;
vt<int> p(n + 1), ac(n + 1);
while (m--) {
int x;
string s;
cin >> x >> s;
if (s == "AC") ac[x] = 1;
else if (!ac[x]) p[x]++;
}
int pen = 0;
for (int i = 1; i <= n; i++) pen += p[i] * ac[i];
cout << accumulate(all(ac), 0) << ' ' << pen;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int tcs = 1;
for (int tc = 1; tc <= tcs; tc++) {
solve();
}
}
| 0
| 68,051,962
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <numeric>
#include <bitset>
#include <functional>
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
{ 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};
int main() {
int n, y;
cin >> n >> y;
for(int i=0;i<=n;++i) {
for(int j=0;j<=n-i;++j) {
int k = n - i - j;
if(i * 10000 + j * 5000 + k * 1000 == y) {
cout << i << " " << j << " " << k << endl;
return 0;
}
}
}
cout << "-1 -1 -1" << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str, order;
int q, a, b;
cin >> str >> q;
for(int i=0; i<q; i++){
cin >> order;
if(order=="replace"){
cin >> a >> b >> order;
str.replace(a, b-a+1, order);
}
else if(order=="reverse"){
cin >> a >> b;
reverse(str.begin()+a, str.begin()+b+1);
}
else{
cin >> a >> b;
for (int j = a; j <= b; j++){
cout << str[j];
}
cout << endl;
}
}
return 0;
}
| 0
| 25,894,886
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, s;
cin >> n >> k >> s;
vll a(n);
if (s == 1000000000) {
for (int i = 0; i < k; i++){
a[i] = s;
}
for (int i = k; i < n; i++){
a[i] = s - 1;
}
} else {
for (int i = 0; i < k; i++) {
a[i] = s;
}
for (int i = k; i < n; i++) {
a[i] = s + 1;
}
}
rep(i, n) cout << a[i] << " ";
cout << 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 int MOD = 1000000007;
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;
int main(){
int N;
string S;
int K;
cin >> N >> S >> K;
rep(i,N){
if (S[i] == S[K-1]){
cout << S[i];
}
else{
cout << '*';
}
}
cout << endl;
}
| 0
| 84,998,087
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.