code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
int dist[100010];
deque<int> dq;
int n;
int main()
{
cin >>n;
fill(dist,dist+n,1e9);
dist[1]=1;
dq.push_back(1),dq.push_back(1);
while (1)
{
int x=dq.front(); dq.pop_front();
int y=dq.front(); dq.pop_front();
if (!x)
{
cout <<y;
return 0;
}
if (dist[(x*10)%n]>y)
{
dist[(x*10)%n]=y;
dq.push_front(y);
dq.push_front((x*10)%n);
}
if (dist[(x+1)%n]>y+1)
{
dist[(x+1)%n]=y+1;
dq.push_back((x+1)%n);
dq.push_back(y+1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<pii> td(N);
for (int i = 0; i < N; ++i) {
cin >> td[i].first >> td[i].second;
td[i].first--;
}
auto cmp = [&](pii a, pii b) { return a.second == b.second ? a.first < b.first : a.second > b.second; };
sort(td.begin(), td.end(), cmp);
priority_queue<int, vector<int>, greater<int>> que1;
priority_queue<int> que2;
vector<bool> isused(N);
int cnt = 0;
ll pt = 0;
for (int i = 0; i < K; ++i) {
if (isused[td[i].first])
que1.push(td[i].second);
else {
isused[td[i].first] = true;
cnt++;
}
pt += td[i].second;
}
for (int i = K; i < N; ++i) {
if (!isused[td[i].first]) {
isused[td[i].first] = true;
que2.push(td[i].second);
}
}
ll ans = pt + (ll)cnt * cnt;
while (!que1.empty() && !que2.empty()) {
pt -= que1.top();
pt += que2.top();
que1.pop();
que2.pop();
cnt++;
ans = max(ans, pt + (ll)cnt * cnt);
}
cout << ans << endl;
return 0;
}
| 0
| 5,677,472
|
#include <iostream>
#include <utility>
using namespace std;
void output(int n, int element[])
{
for (int i = 0; i < n - 1; i++)
cout << element[i] << " ";
cout << element[n - 1] << endl;
}
int selection_sort(int n, int element[])
{
int swap_count = 0;
for (int i = 0; i < n; i++) {
int minimam = i;
for (int j = i + 1; j < n; j++) {
if (element[j] < element[minimam])
minimam = j;
}
if (minimam != i)
swap(element[i], element[minimam]), swap_count++;
}
return swap_count;
}
int main()
{
int n, element[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> element[i];
}
int swap_count = selection_sort(n, element);
output(n, element);
cout << swap_count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
while (cin >> n, n) {
vector<ll> v(n); cin >> v;
ll ans = linf;
rep(i, n) rep(j, i+1, n) chmin(ans, abs(v[i]-v[j]));
cout << ans << endl;
}
}
| 0
| 93,725,573
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
int main(){
int d;
while(cin>>d){
int s=0;
for(int x=d;x<600;x+=d) s+=x*x*d;
cout<<s<<endl;
}
}
|
#include<iostream>
#include<string>
#define rep(i,start,n) for(int i=0 ; i < n ; i++)
using namespace std;
int main(){
int count[26]={0};
int x=0;
string sentence;
while(getline(cin,sentence)){
x = sentence.length();
rep(i , 0 , sentence.size()){
char c = tolower(sentence[i]);
count[c-'a']++;
}
}
rep( i , 0 , 26 ){
cout << char(i+'a') << " : " << count[i] << endl;
}
return 0;
}
| 0
| 14,581,076
|
#include <bits/stdc++.h>
using namespace std;
# define ll long long
# define VI vector<int>
# define VL vector<ll>
# define PII pair<int,int>
# define VII vector<PII>
# define mp make_pair
# define pb push_back
# define vt vector
# define PI acos(-1)
# define ld long double
# define endl "\n"
# define all(c) (c).begin(), (c).end()
# define ft first
# define sd second
# define FOR(i,a,b) for(int i = a ; i < b ; ++i)
# define F0R(i,b) for(int i = 0 ; i < b ; ++i)
const ll inf = 1e18 ;
const int MxN = 100001 ;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL) ;
string s ;
int k ;
cin >> s >> k ;
int n = s.size() ;
ll cnt = 1 ,moves=0;
bool ok = false , ok2 = false;
char prv = s[0] ;
bool first = true ;
bool last = 0 ;
for(int i=1; i<n ; ++i) {
if(s[i] == prv) {
cnt++;
} else {
if(i==n-1) {
ok = true ;
if(cnt % 2 == 0 )
last = 1 ;
else
last = 0 ;
}
if(first) {
if(cnt % 2 == 0)
ok2 = true ;
else ok2 = false ;
first = false ;
}
moves += cnt/2 ;
cnt = 1 ;
prv = s[i] ;
}
}
if(!ok) {
if(cnt == n) {
cout << (cnt*k) /2 ;
return 0 ;
}
moves += cnt/2 ;
if(cnt % 2 == 0 )
last = 1 ;
else
last = 0 ;
}
ll ans = moves * k ;
if(s[0] == s[n-1]) {
if(!ok2 && !last)
ans += k -1 ;
}
cout << ans ;
return 0 ;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll n; cin >> n;
vector<ll> a(n);
rep(i,n) {
cin >> a[i];
}
ll guu = 0;
if (n % 2 == 0) guu = 1;
else guu = 0;
ll dir = 0;
ll posi = n-1;
for (int i = 0; i < n; ++i) {
cout << a[posi] << " ";
if (dir == 0) {
posi -= 2;
}
else {
posi += 2;
}
if (posi < 0) {
dir = 1;
if (guu) posi = 0;
else posi = 1;
}
}
}
| 0
| 33,176,812
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){ cin >> a[i]; }
int min=0, max=0;
long long sum=0;
min = *min_element(a.begin(), a.end());
max = *max_element(a.begin(), a.end());
for(int i=0; i<a.size(); i++){ sum += a[i]; }
cout << min << " " << max << " " << sum << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) (int)(x).size()
#define SIZEL(x) (ll)(x).size()
#define MSG(a) cout << #a << " " << a << endl;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main()
{
int n, m;
cin >> n >> m;
vector<tuple<int, int, int>> pyi;
REP(i, m) {
int p, y;
cin >> p >> y;
pyi.push_back(make_tuple(p, y, i));
}
sort(ALL(pyi));
vector<string> ans(m);
int seq=1;
int pPrv=-1;
REP(i, m){
int p = get<0>(pyi[i]);
int y = get<1>(pyi[i]);
int ii = get<2>(pyi[i]);
if (pPrv==p) seq++;
else{
seq=1;
pPrv=p;
}
ostringstream sout;
sout << setfill('0') << setw(6) << p;
sout << setfill('0') << setw(6) << seq;
ans[ii] = sout.str();
}
REP(i, m){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 47,076,244
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef struct node{
int data;
struct node *pre, *next;
}Node;
Node *head;
void init()
{
head = (Node*)malloc(sizeof(Node));
head->next = head;
head->pre = head;
}
void insert(int key)
{
Node *x = (Node*)malloc(sizeof(Node));
x->data = key;
Node *p = head->next;
x->next = p;
p->pre = x;
head->next = x;
x->pre = head;
}
Node* listSearch(int key){
Node *cur = head->next;
while (cur != head && cur->data != key) {
cur = cur->next;
}
return cur;
}
void deleteNode(Node *t){
if (t == head) {
return;
}
t->pre->next = t->next;
t->next->pre = t->pre;
free(t);
}
void deleteFirst()
{
deleteNode(head->next);
}
void deleteLast()
{
deleteNode(head->pre);
}
void deleteKey(int key)
{
deleteNode(listSearch(key));
}
void printLast(){
Node* cur = head->next;
int isf = 0;
while (1) {
if (cur == head) {
break;
}
if (isf++ > 0) {
printf(" ");
}
printf("%d", cur->data);
cur = cur->next;
}
printf("\n");
}
int main(int argc, char *argv[]) {
int key, n, i;
int size = 0;
char com[20];
int np = 0, nd = 0;
scanf("%d", &n);
init();
for (i = 0; i < n; i++) {
scanf("%s %d", com, &key);
if (com[0] == 'i') {
insert(key);
np++;
size++;
}else if (com[0] == 'd') {
if (strlen(com) > 6) {
if (com[6] == 'F') {
deleteFirst();
}
else if (com[6] == 'L') {
deleteLast();
}
}else {
deleteKey(key);
nd++;
}
size--;
}
}
printLast();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define mx 105
#define ll long long
int ar[mx][mx];
char ch[mx][mx];
int n,m,k,ii;
void solve()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%s",ch[i]+1);
if(ch[1][1]=='#')ar[1][1]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(i==1 && j==1)continue;
if(i>1)
{
int val=0;
if(ch[i-1][j]!=ch[i][j] && ch[i][j]=='#')val++;
ar[i][j]=ar[i-1][j]+val;
}
else ar[i][j]=1000;
if(j>1)
{
int val=0;
if(ch[i][j-1]!=ch[i][j] && ch[i][j]=='#')val++;
ar[i][j]=min(ar[i][j],ar[i][j-1]+val);
}
}
}
printf("%d\n",ar[n][m]);
}
int main()
{
int t=1;
while(t--)solve();
return 0;
}
| 0
| 56,010,889
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int ok = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') ok++;
}
cout << (8 <= 15 - s.size() + ok ? "YES" : "NO") << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<set>
using namespace std;
int main(){
int n;
cin>>n;
set<string> s;
string v,w;
for(int i=0;i<n;i++){
cin>>v>>w;
if(v=="insert"){
s.insert(w);
}
else{
if(s.count(w)){cout<<"yes"<<endl;}
else{cout<<"no"<<endl;}
}
}
}
| 0
| 72,519,328
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, h, w;
cin >> n >> h >> w;
int ans = 0;
for(int i=0; i<n; i++){
int a, b;
cin >> a >> b;
if(a >= h && b >= w) ans += 1;
}
cout << ans << endl;
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3121000;
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
long long Comb(int a,int b){
if(a<b||b<0)return 0;
return fact[a]*finv[b]%mod*finv[a-b]%mod;
}
void init_C(int n){
fact[0]=finv[0]=inv[1]=1;
for(int i=2;i<n;i++){
inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
}
for(int i=1;i<n;i++){
fact[i]=fact[i-1]*i%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
}
long long pw(long long a,long long b){
long long ret=1;
while(b){
if(b%2)ret=ret*a%mod;
a=a*a%mod;
b/=2;
}
return ret;
}
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
double ABS(double a){return max(a,-a);}
int main(){
int a;scanf("%d",&a);
while(a--){
long long A,B;
scanf("%lld%lld",&A,&B);
if(A>B)swap(A,B);
long long ret=A-1;
long long tmp=A*B-1;
long long val=(long long)((sqrt(4*tmp+1+0.5)-1)/2);
ret+=max(0LL,val-A);
val=max(val,A);
ret+=(A*B-1)/(val+1);
printf("%lld\n",ret);
}
}
| 0
| 81,913,535
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return ans;
}
int main() {
int N;
cin>>N;
int ans=1;
bool a=true;
while(a==true){
if(N<ans*2){
a=false;
}
else{
ans*=2;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
template <typename T>
class SegmentTree {
public:
using Operation = std::function<T(T, T)>;
using RangeOperation = std::function<T(T, int)>;
SegmentTree(
int size, Operation operation, T identity = T(),
RangeOperation range_operation = [](int v, int) { return v; })
: operation_(operation),
identity_(identity),
range_operation_(range_operation) {
int two = 1;
while (two < size) {
two <<= 1;
}
v_.resize(two * 2 - 1, identity_);
l_.resize(two * 2 - 1, identity_);
}
void Set(int i, T v) {
int index = v_.size() / 2 + i;
while (true) {
v_[index] = v;
if (index == 0) break;
v = operation_(v, v_[index + (index % 2 == 0 ? -1 : 1)]);
index = (index - 1) / 2;
}
}
void Apply(int begin, int end, T v) {
std::function<void(int, int, int)> rec = [&](int cbegin, int cend,
int index) {
if (begin <= cbegin && cend <= end) {
l_[index] = operation_(l_[index], v);
return;
}
if (cend <= begin || end <= cbegin) {
return;
}
int cmid = (cbegin + cend) / 2;
rec(cbegin, cmid, index * 2 + 1);
rec(cmid, cend, index * 2 + 2);
int size = std::min(cend, end) - std::max(cbegin, begin);
v_[index] = operation_(v_[index], range_operation_(v, size));
};
rec(0, (v_.size() + 1) / 2, 0);
}
T Get(int i) const { return Aggregate(i, i + 1); }
T Aggregate(int begin, int end) const {
std::function<T(int, int, int)> rec = [&](int cbegin, int cend, int index) {
int size = std::min(cend, end) - std::max(cbegin, begin);
if (begin <= cbegin && cend <= end) {
return operation_(v_[index], range_operation_(l_[index], size));
}
if (cend <= begin || end <= cbegin) {
return identity_;
}
int cmid = (cbegin + cend) / 2;
return operation_(operation_(rec(cbegin, cmid, index * 2 + 1),
rec(cmid, cend, index * 2 + 2)),
range_operation_(l_[index], size));
};
return rec(0, (v_.size() + 1) / 2, 0);
}
void Debug() const {
auto debug = [&](const std::vector<T>& v) {
int width = 0;
for (T t : v) {
std::stringstream ss;
ss << t;
width = std::max<int>(width, ss.str().size());
}
const int N = (v.size() + 1) / 2;
int index = 0;
int twos = 1;
std::string separator = '|' + std::string(N * (width + 1) - 1, '-') + '|';
std::cerr << separator << std::endl;
for (T t : v) {
if (index == 0) {
std::cerr << '|';
}
std::cerr << std::string((width + 1) * (N / twos - 1), ' ');
std::cerr << std::setw(width) << t << '|';
++index;
if (index == twos) {
index = 0;
twos <<= 1;
std::cerr << std::endl << separator << std::endl;
}
}
};
std::cerr << "v_:" << std::endl;
debug(v_);
std::cerr << "l_:" << std::endl;
debug(l_);
}
private:
const Operation operation_;
const T identity_;
const RangeOperation range_operation_;
std::vector<T> v_;
std::vector<T> l_;
};
#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 CIN(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 COUT(...) 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;
struct Monster {
ll X, H;
bool operator<(const Monster& m) const {
return X < m.X;
}
};
Monster monster[200000];
int main() {
CIN(ll, N, D, A);
REP(i, N) cin >> monster[i].X >> monster[i].H;
sort(monster, monster + N);
auto add = [](ll a, ll b) -> ll { return a + b; };
auto mul = [](ll a, int size) -> ll { return a * size; };
SegmentTree<ll> tree(N, add, 0, mul);
REP(i, N) tree.Set(i, monster[i].H);
ll ans = 0;
int mi = 0;
while (mi < N) {
int h = tree.Get(mi);
if (h <= 0) {
++mi;
continue;
}
Monster max_m = {monster[mi].X + D * 2, 0};
int ub = upper_bound(monster, monster + N, max_m) - monster;
ll cnt = (h + A - 1) / A;
tree.Apply(mi, ub, -cnt * A);
ans += cnt;
}
COUT(ans);
}
| 0
| 5,748,887
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(void){
int n, k;
cin >> n >> k;
vector<ll> s(n+1);
s[0] = 0;
rep(i, n){
ll a;
cin >> a;
s[i+1] = (s[i] + a - 1) % k;
}
map<ll, ll> mp;
queue<ll> q;
ll ans = 0;
rep(j, n+1){
ans += mp[s[j]];
mp[s[j]]++;
q.push(s[j]);
if(q.size() == k){
mp[q.front()]--;
q.pop();
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 500005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
LL res[SIZE];
for(int i = 0; i < SIZE; ++i) {
res[i] = -1;
}
if(s[0] == '<') {
res[0] = 0;
int p = 0;
while(p < s.size() && s[p] == '<') {
res[p + 1] = res[p] + 1;
++p;
}
}
for(int i = 1; i < s.size(); ++i) {
if(s[i - 1] == '>' && s[i] == '<') {
res[i] = 0;
int p = i - 1;
while(p >= 0 && s[p] == '>' && res[p] < res[p + 1] + 1) {
res[p] = res[p + 1] + 1;
--p;
}
p = i;
while(p < s.size() && s[p] == '<') {
res[p + 1] = res[p] + 1;
++p;
}
}
}
if(s[s.size() - 1] == '>') {
res[s.size()] = 0;
res[s.size() - 1] = 1;
int p = s.size() - 2;
while(p >= 0 && s[p] == '>' && res[p] < res[p + 1] + 1) {
res[p] = res[p + 1] + 1;
--p;
}
}
LL sum = 0;
for(int i = 0; i <= s.size(); ++i) {
sum += res[i];
}
cout << sum << endl;
return 0;
}
| 0
| 49,108,690
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int A,B,m,x,y,c,mn=2e5;
cin >> A >> B >> m;
vector<int> a(A),b(B);
rep(i,A)cin >> a.at(i);
rep(i,B)cin >> b.at(i);
rep(i,m){
cin >> x >> y >> c;
mn=min(a.at(x-1)+b.at(y-1)-c,mn);
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
mn=min(mn,a.at(0)+b.at(0));
cout << mn << endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
using namespace std;
const int INF = 1e18;
void solve()
{
std::ifstream in("sample.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> coins;
coins.push_back(1);
rng(i, 1, 7) coins.push_back(pow(6, i));
rng(i, 1, 6) coins.push_back(pow(9, i));
sort(ALL(coins));
vector<vector<int>> dp(coins.size() + 1);
rep(i, coins.size() + 1) dp[i].resize(100010);
rep(i, 100010) dp[0][i] = INF;
rep(i, coins.size() + 1) dp[i][0] = 0;
for (int ic = 1; ic <= coins.size(); ic++)
{
for (int jv = 0; jv < 100010; jv++)
{
if (jv - coins[ic - 1] >= 0)
{
dp[ic][jv] = min(dp[ic - 1][jv], dp[ic][jv - coins[ic - 1]] + 1);
}
else
{
dp[ic][jv] = dp[ic - 1][jv];
}
}
}
cout << dp[coins.size()][n] << endl;
}
signed main()
{
solve();
return 0;
}
| 0
| 50,749,714
|
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i=0;i<5;i++){
cin>>a[i];
}
sort(a,a+5);
for(int i=4;i>=0;i--)
printf("%d%c",a[i],i==0?'\n':' ');
return 0;
}
|
#pragma GCC optimize("O3")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DEBUG
#define fi first
#define se second
#define pqueue priority_queue
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define int long long
#define mk(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ull> vull;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector< vector<ll> > vvll;
typedef vector<char> vc;
const int INF = 1e9 + 228;
const ll INFLL = 1e18;
const ll MOD = 1e9 + 7;
const ld eps = 1e-6;
const ld eps2 = 1e-9;
const ll MOD2 = 998244353;
const ll dosz = 5e5;
const ll SZ = (1<<18);
const ld PI = atan2l(0, -1);
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void solve(){
int n, m;
cin >> n >> m;
vi nums(n-1);
int lst;
cin >> lst;
for(int i=0;i<n-1;i++){
cin >> nums[i];
int keklol = nums[i];
nums[i] -= lst;
lst = keklol;
}
int kek = 0;
cin >> lst;
for(int i=0; i<m-1; i++){
int bt;
cin >> bt;
int keklol = bt;
bt -= lst;
kek += (((bt)*(i+1)%MOD)*(m-i-1))%MOD;
kek%=MOD;
lst = keklol;
}
int lol = 0;
int sum = 0;
for(int i=0; i<n-1; i++){
sum += nums[i];
sum %= MOD;
lol += sum;
lol %= MOD;
}
int ans = 0;
for(int i=0; i<n-1; i++){
ans += (lol*kek)%MOD;
ans %= MOD;
lol -= (nums[i]*(n-i-1))%MOD;
lol %= MOD;
if(lol<0)
lol += MOD;
}
cout << ans << endl;
}
signed main(){
fast_io();
srand(time(NULL));
cout << fixed << setprecision(12);
int q = 1;
while(q--)
solve();
}
| 0
| 70,085,963
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long N,K;cin>>N>>K;
long long ans=K*pow((K-1),N-1);
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(){
int k,a,b;
cin >> k >> a >>b;
ll bis=1;
int money=0;
rep(i,k){
if (money>0){
money--;
bis+=b;
}
else if(bis>=a && a<b &&(b-a)>2 &&(k-i)>1){
money++;
bis-=a;
}
else {
bis++;
}
}
cout << bis <<endl;
return 0;
}
| 0
| 99,649,345
|
#include <iostream>
using namespace std;
int main(){
long long x, y;cin>>x>>y;
if (x % y == 0){
cout << -1 << endl;
} else {
long long num=1;
bool success_flag = true;
while(true){
if (x * num <= 1000000000000000000){
if (x * num % y != 0){
break;
}
} else {
success_flag = false;
break;
}
}
if (success_flag){
cout << x * num <<endl;
} else {
cout << -1 << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i < (int)n;++i)
int main() {
int n;cin>>n;
int a[n],s[n+1];
int sum=0;
rep(i,n)cin>>a[i];
s[0]=a[0];
rep(i,n){
sum+=a[i];
s[i+1]=s[i]+a[i+1];
}
int ans = 99999999;
rep(i,n){
ans = min(ans,abs(s[i]-(sum-s[i])));
}
cout<<ans<<endl;
return 0;
}
| 0
| 8,615,702
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#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
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 vin(Vi &v){REP(i,0,(v).size()) cin>>v[i];}
void vin(Vi &v,Vi &v2){REP(i,0,(v).size()) cin>>v[i]>>v2[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;}
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;}
void accum(Vi &v){REP(i,1,(v).size()) v[i]+=v[i-1];}
bool comp(Pii a,Pii b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
int N;
string s;
Vi ss,ans;
bool flag=false;
bool check(int n,int m){
Vi a(N);
a[0]=n;
a[1]=m;
REP(i,2,N){
a[i]=a[i-1]^a[i-2]^ss[i-1];
}
flag=true;
if(a[0]!=a[N-1]^a[N-2]^ss[N-1]) flag=false;
if(a[1]!=a[0]^a[N-1]^ss[0]) flag=false;
if(flag) ans=a;
return flag;
}
void vout(Vi a){
REP(i,0,a.size()){
if(a[i]==0) cout<<'S';
else cout<<'W';
}
cout<<endl;
}
signed main(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
cin>>N>>s;
REP(i,0,N){
if(s[i]=='o') ss.pb(0);
else ss.pb(1);
}
if(check(0,0)){vout(ans);return 0;}
if(check(0,1)){vout(ans);return 0;}
if(check(1,0)){vout(ans);return 0;}
if(check(1,1)){vout(ans);return 0;}
cout<<-1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pie 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define ff first
#define ss second
#define INF 1ll<<63 - 1
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nrep(i,a,b) for(int i=a;i>=b;i--)
#define pl pair<ll,ll>
#define pi pair<int,int>
#define pll pair<pair<ll,ll>, ll>
#define pii pair< int, pair<int,int> >
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
ll aa[300005];
ll dp[300005][60];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll t,x,y,q,z,k,n,m,xx,yy;
cin>>n;
rep(i,1,n){
cin>>aa[i];
}
nrep(i,n,1){
rep(j,0,59){
dp[i][j] = dp[i+1][j];
if((1ll<<j)&aa[i]) dp[i][j]++;
}
}
ll ans = 0;
rep(i,1,n){
rep(j,0,59){
z = n - i;
if((1ll<<j)&aa[i]){
z -= dp[i+1][j];
ans = (ans%N + (z*power(2,j,N))%N)%N;
}else{
z = dp[i+1][j];
ans = (ans%N + (z*power(2,j,N))%N)%N;
}
}
}
cout<<ans;
}
| 0
| 31,277,974
|
#include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 100000007
#define MAX_E 1000000
#define MAX_V 1000000
using namespace std;
int V, E;
vector<int> adj[MAX_V];
int visited[MAX_V];
stack<int> stk;
void DFS(int u){
visited[u]=2;
int d=adj[u].size();
for(int j=0; j<d; ++j){
if(visited[adj[u][j]]==2){
printf("Sandro fails.");
exit(0);
}
if(visited[adj[u][j]]==0)
DFS(adj[u][j]);
}
visited[u]=1;
stk.push(u);
return;
}
bool cmp(int i, int j){return i>j;}
int main(){
scanf("%d%d", &V, &E);
for(int i=0; i<E; ++i){
int u, v;
scanf("%d%d", &u, &v);
adj[u].push_back(v);
}
for(int i=0; i<V; ++i){
sort (adj[i].begin(), adj[i].begin()+adj[i].size(), cmp);
}
for(int i=0; i<V; ++i){
if(!visited[i])DFS(i);
}
while(!stk.empty()){
cout<<stk.top()<<endl;
stk.pop();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,sum;
cin >> N;
vector<int> A(N+2,0);
vector<bool> bs(N+1,false);
sum = 0;
for(int i=0;i<N;i++) {
cin >> A[i+1];
if(i) {
if(((A[i+1] >= A[i]) && (A[i] >= A[i-1]))
|| ((A[i+1] <= A[i]) && (A[i] <= A[i-1]))) {
bs[i] = true;
}
}
sum += abs(A[i+1] - A[i]);
}
if(((A[N+1] >= A[N]) && (A[N] >= A[N-1]))
|| ((A[N+1] <= A[N]) && (A[N] <= A[N-1]))) {
bs[N] = true;
}
sum += abs(A[N+1] - A[N]);
for(int i=1;i<=N;i++){
if(bs[i]) {
cout << sum << endl;
} else {
cout << sum - abs(A[i]-A[i-1]) - abs(A[i+1]-A[i]) + abs(A[i+1]-A[i-1]) << endl;
}
}
return 0;
}
| 0
| 90,404,299
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
bool ok = true;
rep(i,n/2) if(s[i] != s[n-1-i]) ok = false;
int m = (n-1)/2;
rep(i,m/2) if(s[i] != s[m-1-i]) ok = false;
int k = (n+3)/2 - 1;
rep(i,m/2) if(s[i+k] != s[n-1-i]) ok = false;
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
map<string,int> mp;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
vector<ll> a(n),sum(n+1,0);
for(int i=0;i<n;i++)cin>>a.at(i);
for(int i=0;i<n;i++)sum.at(i+1)=a.at(i)+sum.at(i);
vector<ll> tmp;
for(int i=1;i<n+1;i++){
for(int j=0;j<i;j++){
tmp.push_back(sum.at(i)-sum.at(j));
}
}
ll ans;
for(ll bit=60;bit>=0;bit--){
vector<ll> res;
for(int i=0;i<tmp.size();i++){
if(tmp.at(i)&(1ll<<bit))res.push_back(tmp.at(i));
}
if(res.size()>=k){
tmp=res;
}
}
ans=tmp.at(0);
for(int i=1;i<tmp.size();i++){
ans&=tmp.at(i);
}
cout<<ans<<endl;
}
| 0
| 24,304,134
|
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=a;i<b;++i)
#define for_rev(i,a,b) for(int i=a;i>=b;--i)
#define allof(a) a.begin(),a.end()
#define minit(a,b) memset(a,b,sizeof(a))
#define size_of(a) (int)a.size()
typedef long long lint;
typedef double Double;
typedef pair<int, int> pii;
typedef vector< int > Array;
typedef vector< Array > Matrix;
typedef vector< Double > DArray;
typedef vector< DArray > DMatrix;
typedef vector< string > SArray;
typedef vector< pii > PArray;
inline int POPCNT(int _x) { return __builtin_popcount(_x); }
inline int POPCNT(lint _x) { return __builtin_popcountll(_x); }
const int iINF = 1L << 30;
const lint lINF = 1LL << 60;
Double EPS = 1e-9;
inline bool in_range(int _v, int _mx, int _mi) { return _mi <= _v && _v < _mx; }
inline bool in_range(Double _v, Double _mi, Double _mx) { return -EPS < _v - _mi && _v - _mx < EPS; }
inline bool in_range(int _x, int _y, int _W, int _H) { return 0 <= _x && _x < _W && 0 <= _y && _y < _H; }
const int DX[4] = {0,1,0,-1}, DY[4] = {-1,0,1,0};
const int DX_[8] = {0,1,1,1,0,-1,-1,-1}, DY_[8] = {-1,-1,0,1,1,1,0,-1};
int n;
void solve() {
bool lflag = true, rflag = true;
bool prev = true;
int cnt = 0;
for_(i,0,n) {
string s; cin >> s;
if (s == "lu") {
lflag = !lflag;
}
if (s == "ru") {
rflag = !rflag;
}
if (s == "ld") {
lflag = !lflag;
}
if (s == "rd") {
rflag = !rflag;
}
if (lflag == rflag) {
if (lflag != prev) {
++cnt;
prev = !prev;
}
}
}
cout << cnt << endl;
}
int main() {
while (cin >> n, n) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF = (ll)5e15;
int main() {
int n;
cin >> n;
P now = P(0,0);
int time = 0;
rep(i,n) {
int t,x,y;
cin >> t >> x >> y;
int dist = abs(x-now.first) + abs(y-now.second);
if(dist > (t-time)) {
cout << "No" << endl;
return 0;
}
int res = abs((t-time) - dist);
if(res%2 == 0) {
time = t;
now = P(x,y);
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 3,480,514
|
#include<cstdio>
unsigned prime[15] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47}, over[5], divisor[5] = {3,5,15,25,75};
int main(){
unsigned N;
scanf("%u", &N);
unsigned power, _N;
for (size_t i = 0; i < 15; i++){
power = 1, _N = N;
while(_N /= prime[i]) power += _N;
for (size_t j = 0; j < 5; j++){
if(power >= divisor[j]) over[j]++;
}
}
printf("%u\n", over[4] + over[3]*(over[0] - 1) + over[2]*(over[1] - 1) + (over[1]*(over[1] - 1)>>1)*(over[0] - 2));
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
int main(){
string s,t;
cin>>s>>t;
vector<int> ss(s.length());
vector<int> tt(t.length());
for(ll i=0;i<s.length();++i){
ss[i]=s[i];
}
for(ll i=0;i<t.length();++i){
tt[i]=t[i];
}
sort(ss.begin(),ss.end());
sort(tt.begin(),tt.end(),greater<ll>());
for(ll i=0;i<min(s.length(),t.length());++i){
if(ss[i]<tt[i]){
cout<<"Yes";
return 0;
}else if(ss[i]>tt[i]){
cout<<"No";
return 0;
}
}
if(s.length()<t.length()){
cout<<"Yes";
}else{
cout<<"No";
}
}
| 0
| 3,723,805
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define in(v) v; cin >> v;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define all(f,c,...) (([&](decltype((c)) cccc) { return (f)(begin(cccc), end(cccc), ## __VA_ARGS__); })(c))
template<class T>ostream& operator<<(ostream& os,const vector<T>& vec){os<<"{";for(size_t i=0;i<vec.size();++i)os<<(i?", ":"")<<vec[i];os<<"}";return os;}
ostream& operator<<(ostream& os,const vector<char>&v){for(size_t i=0;i<v.size();++i)os<<v[i];return os;}
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>& rhs){os<<"("<<rhs.first<<", "<<rhs.second<<")";return os;}
#ifdef LOCAL
void debug() {cerr << "\n";}
template<class First> void debug(const First& first) {cerr<<first<<"\n";}
template<class First, class... Rest> void debug(const First& first, const Rest&... rest) {cerr<<first<<",";debug(rest...);}
void debug2() {cerr << "\n";}
template<class First> void debug2(const First& first) {cerr<<first<<" ";}
template<class First, class... Rest> void debug2(const First& first, const Rest&... rest) {cerr<<first<<" ";debug2(rest...);}
#else
#define debug(...) 42
#define debug2(...) 42
#endif
template<class T>using vv = vector<vector<T>>;
char s[100][100];
int H, W;
int dp[100][100];
int dfs(int i, int j) {
if (i == H-1 && j == W-1)
return s[i][j] == '#';
if (dp[i][j] != -1)
return dp[i][j];
int ans = 10000;
if (i < H-1)
ans = min(ans, dfs(i+1, j) + (s[i][j] != s[i+1][j]));
if (j < W-1)
ans = min(ans, dfs(i, j+1) + (s[i][j] != s[i][j+1]));
return dp[i][j] = ans;
}
int main() {
ins(H, W);
rep(i, H) rep(j, W) {
cin >> s[i][j];
dp[i][j] = -1;
}
cout << dfs(0, 0)/2 + (s[0][0] == '#')<< endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
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 D,T,S;
cin >> D >> T >> S;
if (D > T * S){
puts("No");
}else{
puts("Yes");
}
}
| 0
| 97,057,566
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (long long i = 0; i < (n); ++i)
#define repj(n) for (long long j = 0; j < (n); ++j)
#define repk(n) for (long long k = 0; k < (n); ++k)
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(itr) for (auto&& v : (itr))
#define updatemax(t, v) (t = std::max(t, (v)))
#define updatemin(t, v) (t = std::min(t, (v)))
int main() {
ll a, b;
cin >> a >> b;
string s = "", t = "";
repi(b) s += (char)(a + '0');
repi(a) t += (char)(b + '0');
cout << min(s, t) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7;
#define INF 1e9+9;
#define ps(x,y) fixed<<setprecision(y)<<x
# define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int k,s,c=0;
cin>>k>>s;
for(int i=0;i<=k;i++){
for(int j=0;j<=k;j++){
if(s-(i+j)>=0 && s-(i+j)<=k)
c++;
}
}
cout<<c<<endl;
return 0;
}
| 0
| 48,909,272
|
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),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())
const int MAX = 510000;
const int MOD = 1000000007;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n=1):n(n), f(n+1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i]) continue;
primes.push_back(i);
f[i] = i;
for (ll j = i*i; j <= n; j += i) {
if (!f[j]) f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x;}
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0) return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
vector<pair<ll,int>> factor(ll x) {
vector<pair<ll,int>> res;
for (int p : primes) {
int y = 0;
while (x%p == 0) x /= p, ++y;
if (y != 0) res.emplace_back(p,y);
}
if (x != 1) res.emplace_back(x,1);
return res;
}
};
int main(){
ll N; cin >> N;
Sieve sieve(1000005);
ll ans = 0;
for(int i = 1; i < N; i ++){
ll tmp = 1;
vector<pair<ll, ll> > m = sieve.factor(i);
for(auto p : m){
tmp *= p.sc + 1;
}
ans += tmp;
}
cout << ans << endl;
}
|
#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(){
ll h,w;
cin >> h >> w;
char s[h][w];
rep(i,0,h){
rep(j,0,w) {
cin >> s[i][j];
}
}
rep(i,0,2*h){
rep(j,0,w) {
cout << s[i/2][j];
}
line
}
return;
}
int main(){
fast
int tc=1;
while(tc--){
solve();
}
R 0;
}
| 0
| 32,103,784
|
#include <iostream>
using namespace std;
int main(){
char C[6] = {'A','B','C','D','E','F'};
char A,B;
int a,b;
cin >> A >> B;
for(int i = 0; i < 6; i++){
if(C[i] == A) a = i;
if(C[i] == B) b = i;
}
if(a > b) cout << ">" << endl;
else if(a < b) cout << "<" << endl;
else cout << "=" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define _GLIBCXX_DEBUG
const lli INF = 2147483647;
const lli MINF = -2147483648;
const lli LINF = 9223372036854775807;
const lli MOD = 1000000007;
const double PI = acos(-1);
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define pb push_back
#define eb emplace_back
#define mp make_pair
#pragma GCC optimize("Ofast")
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vvli = vector<vlli>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
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;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
lli a, b, c, h, n, p, w, ans = 0, count = 0, odd = 0, even = 0;
string s, t;
vector<pair<string, pair<lli, lli>>> pr;
cin >> n >> p;
vlli d(n);
rep(i, 0, n)
{
cin >> d[i];
if (d[i] % 2 == 1)
odd++;
else
even++;
}
if (n == 1 && even == 1 && p == 1)
{
cout << 0 << endl;
}
else if (n == 1 && even == 1 && p == 0)
{
cout << 2 << endl;
}
else if (n == 1 && odd == 1 && p == 0)
{
cout << 1 << endl;
}
else if (n == 1 && odd == 1 && p == 1)
{
cout << 1 << endl;
}
else if (even == n && p == 1)
{
cout << 0 << endl;
}
else if (even == n && p == 0)
{
count = pow(2, n);
cout << count << endl;
}
else
{
count = pow(2, n - 1);
cout << count << endl;
}
}
| 0
| 30,056,674
|
#include <iostream>
using namespace std;
int main(void){
int N;
cin >> N;
int x = N * 800;
int y = (N / 15);
y *= 200;
cout << x - y << endl;
}
|
#include <cstring>
#include <string>
#include <memory>
#include <iostream>
constexpr int max_size()
{
return 1000003;
}
constexpr int null_val()
{
return -1;
}
class dictionary {
public:
dictionary()
: _data(std::make_unique<int[]>(max_size()))
{
for (int i = 0; i < max_size(); ++i) {
_data[i] = null_val();
}
}
void insert(const std::string& str) {
return insert(str2key(str), 0);
return;
}
bool find(const std::string& str) {
return find(str2key(str), 0);
}
private:
int str2int(const char ch) {
if (ch == 'A') {
return 1;
}
if (ch == 'C') {
return 2;
}
if (ch == 'G') {
return 3;
}
if (ch == 'T') {
return 4;
}
return 0;
}
int pow5(int exp) const
{
if (exp == 0) {
return 1;
}
return 5 * pow5(exp - 1);
}
int str2key(const std::string& str)
{
int sum = 0;
for (std::size_t i = 0; i < str.size(); ++i) {
sum += str2int(str[i]) * pow5(i);
}
return sum;
}
int base_hash(const int key) const
{
return key % max_size();
}
int collision_hash(const int key) const
{
constexpr int modulo = max_size() + 1;
return 1 + key % modulo;
}
int create_hash(const int key, const int r) const
{
const int base = base_hash(key);
const int collision = collision_hash(key);
const int h = (base + r * collision) % max_size();
return h;
}
void insert(const int key, const int r)
{
const int h = create_hash(key, r);
if (is_empty(h)) {
_data[h] = key;
return;
}
if (_data[h] == key) {
return;
}
insert(key, r + 1);
return;
}
bool find(const int key, const int r) const
{
const int h = create_hash(key, r);
if (is_empty(h)) {
return false;
}
if (_data[h] == key) {
return true;
}
return find(key, r + 1);
}
bool is_empty(const int idx) const {
return _data[idx] == null_val();
}
private:
std::unique_ptr<int[]> _data;
};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
std::cin >> n;
std::cin.ignore();
dictionary dict;
std::string buf;
for (int i = 0; i < n; ++i) {
getline(std::cin, buf);
if (buf.front() == 'i') {
static const std::size_t size = strlen("insert ");
const std::string val
= buf.substr(size, buf.size() - size);
dict.insert(val);
}
else {
static const std::size_t size = strlen("find ");
const std::string val
= buf.substr(size, buf.size() - size);
if (dict.find(val)) {
std::cout << "yes" << std::endl;
}
else {
std::cout << "no" << std::endl;
}
}
}
return 0;
}
| 0
| 44,561,390
|
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<unordered_map>
#include<iomanip>
#include<queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ll amari = 1000000007;
#define rep(n,x) for(ll i=0;i<n;i++) cin>>x[i];
#define forr(a,b) for(ll i=a;i<b;i++);
ll modpow(ll a, ll n, ll mod)
{
ll res = 1;
while (0 < n)
{
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll gcd(ll x, ll y)
{
if (x % y == 0) return y;
else return gcd(y, x % y);
}
ll prime(ll x)
{
for (ll i = 2; i * i <= x; i++)
{
if (x % i == 0) return 0;
}
return 1;
}
int main()
{
ll x, y;
cin >> x >> y;
ll ans, p, q;
if ((2 * x - y) % 3 != 0||2*y<x||2*x<y)
{
ans = 0;
}
else
{
p = (2 * y - x) / 3;
q = (2 * x - y) / 3;
ll r;
r = p + q;
vector<ll> fact(r + 100);
vector<ll> inv(r + 100);
vector<ll> factinv(r + 100);
fact[1] = 1;
fact[0]=1;
inv[1] = 1;
factinv[1] = 1;
factinv[0]=1;
for (ll i = 2; i < r + 10; i++)
{
fact[i] = (fact[i - 1] * i) % amari;
inv[i] = (amari - (inv[amari % i] * (amari / i))%amari) % amari;
factinv[i] = (factinv[i - 1] * inv[i]) % amari;
}
ans = amari*10+(fact[p + q] * factinv[p] % amari) * factinv[q];
ans%=amari;
}
cout <<ans << "\n";
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second
#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
int h, w, n;
char field[1010][1010];
int sx, sy, gx[10], gy[10];
ll ans = 0;
int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
int d[1010][1010];
void solve(int k){
REP(i, h){
REP(j, w){
d[i][j] = INF;
}
}
queue<P> que;
que.push(P(sy, sx));
d[sy][sx] = 0;
while (que.size()){
P p = que.front(); que.pop();
int y = p.first, x = p.second;
if (y == gy[k] && x == gx[k])break;
REP(i, 4){
int nx = x + dx[i], ny = y + dy[i];
if (nx >= 0 && nx < w&&ny >= 0 && ny < h){
if (field[ny][nx] != 'X'&&d[ny][nx] == INF){
d[ny][nx] = d[y][x] + 1;
que.push(P(ny, nx));
}
}
}
}
}
int main(){
int pos;
cin >> h >> w >> n;
REP(i, h){
REP(j, w){
cin >> field[i][j];
if (field[i][j] == 'S'){
sy = i, sx = j;
}
if (field[i][j] >= '1'&&field[i][j] <= '9') {
pos = field[i][j] - '0';
gy[pos] = i, gx[pos] = j;
}
}
}
for (int k = 1; k <= n;k++){
solve(k);
ans += d[gy[k]][gx[k]];
sy = gy[k], sx = gx[k];
}
cout << ans << endl;
}
| 0
| 69,089,498
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int> nums(n);
for (int &a : nums) {
cin >> a;
}
sort(nums.begin(), nums.end());
int res = 0;
for (int i = 0; i < k; ++i) {
res += nums[i];
}
cout << res << endl;
}
|
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define boolsize 1000001
#define pi pair<ll,ll>
#define vi vector<ll>
#define vii vector<pi>
using namespace std;
template<typename T>
void showvector(vector <T> v)
{
for(T x:v)
cout<<x<<" ";
cout<<endl;
}
template<typename T>
void showvector1(vector <T> v)
{
ll n=v.size();
fo1(i,n-1)
cout<<v[i]<<endl;
}
template<typename T>
void showset(set <T> s)
{
for(T x: s)
cout<<x<<" ";
cout<<endl;
}
template<class T>
void showvectorpair(vector<T> v)
{
for(auto it=v.begin();it!=v.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T,typename P>
void showmap(map <T,P> m)
{
for(auto it=m.begin();it!=m.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T>
bool comp(T a,T b)
{
return (a>b);
}
template<class T>
bool comppair(T a,T b)
{
if(a.first==b.first)
return(a.second>b.second);
return (a.first>b.first);
}
bool sameparity(ll a,ll b)
{
return (a%2==b%2);
}
bool difparity(ll a,ll b)
{
return !(a%2==b%2);
}
bool isprime(ll x)
{ if(x<=1)
return false;
for(ll i=2;i<=sqrt(x);i++)
{
if(x%i==0)
return false;
}
return true;
}
bool iseven(ll x)
{
return !(x%2);
}
bool isodd(ll x)
{
return (x%2);
}
void vfun()
{
ll n,k;
cin>>n;
vector <ll> v(n);
fo(i,n)
cin>>v[i];
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("inputh.txt", "r", stdin);
freopen("outputh.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll test=1;
while(test--)
{
ll r,c;
cin>>r>>c;
vector <string> v(r);
fo(i,r)
cin>>v[i];
ll L[r][c],R[r][c],U[r][c],D[r][c];
for(ll i=0;i<r;i++)
{
for(ll j=0;j<c;j++)
{
if(j==0)
{
if(v[i][j]=='#')
L[i][j]=0;
else
L[i][j]=1;
}
else
{if(v[i][j]=='#')
L[i][j]=0;
else
L[i][j]=L[i][j-1]+1;
}
}
}
for(ll i=0;i<r;i++)
{
for(ll j=c-1;j>=0;j--)
{
if(j==c-1)
{
if(v[i][j]=='#')
R[i][j]=0;
else
R[i][j]=1;
}
else
{if(v[i][j]=='#')
R[i][j]=0;
else
R[i][j]=R[i][j+1]+1;
}
}
}
for(ll i=0;i<c;i++)
{
for(ll j=0;j<r;j++)
{
if(j==0)
{
if(v[j][i]=='#')
U[j][i]=0;
else
U[j][i]=1;
}
else
{if(v[j][i]=='#')
U[j][i]=0;
else
U[j][i]=U[j-1][i]+1;
}
}
}
for(ll i=0;i<c;i++)
{
for(ll j=r-1;j>=0;j--)
{
if(j==r-1)
{
if(v[j][i]=='#')
D[j][i]=0;
else
D[j][i]=1;
}
else
{if(v[j][i]=='#')
D[j][i]=0;
else
D[j][i]=D[j+1][i]+1;
}
}
}
ll ans=0;
for(ll i=0;i<r;i++)
{
for(ll j=0;j<c;j++)
{
ans=max(ans,L[i][j]+R[i][j]+U[i][j]+D[i][j]-3);
}
}
cout<<ans;
}
}
| 0
| 14,685,988
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long>T(N);
for (int i = 0; i < N; i++) {
cin >> T.at(i);
}
if (N == 1){
cout << T.at(0) << endl;
return 0;
}
long long gcd;
long long lcm = T.at(0);
long long X = T.at(0);
long long Y = T.at(1);
long long Z = X % Y;
int count;
for (int i = 1; i < N; i++) {
count = 0;
while (count == 0){
if (Z == 0){
gcd = Y;
lcm = lcm / gcd * T.at(i);
if (i != N-1){
X = T.at(i+1);
Y = lcm;
Z = X % Y;
}
count++;
}
else {
X = Y;
Y = Z;
Z = X % Y;
}
}
}
cout << lcm << endl;
}
|
#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 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);
string s; cin>>s;
int n = s.size();
if (n==2 && s[0]==s[1]){
cout<<"1 2\n";
return 0;
}
rep(i,n-2){
if (s[i]==s[i+1] || s[i+1]==s[i+2] || s[i]==s[i+2]){
cout<<i+1<<" "<<i+3<<"\n";
return 0;
}
}
cout<<"-1 -1\n";
return 0;
}
| 0
| 84,117,379
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,t=0,r,c=0,a;
cin>>n>>m;
m=m+1;
while(m>n)
{
a=n;
while(n!=0)
{
r=n%10;
t=r+t*10;
n=n/10;
}
if(t==a)
{
c++;
n=a+1;
t=0;
}
else
{
n=a+1;
t=0;
}}
cout<<c<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a > b){
while(a > 0){
cout << b;
a--;
}
}
else{
while(b > 0){
cout << a;
b--;
}
}
cout << endl;
}
| 0
| 20,264,049
|
#include <iostream>
#include <algorithm>
using namespace std;
int N, K, a[100009], b[100009];
long long solve(int x) {
long long ret = 0;
for (int i = 0; i < N; i++) {
if ((x & a[i]) == a[i]) ret += b[i];
}
return ret;
}
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) cin >> a[i] >> b[i];
long long ret = solve(K);
for (int i = 0; i < 30; i++) {
if (K & (1 << i)) {
int val = (K - (1 << i)) | ((1 << i) - 1);
ret = max(ret, solve(val));
}
}
cout << ret << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
item += ch;
}
}
if (!item.empty()) {
elems.push_back(item);
}
return elems;
}
string to_str_with_zero(int i, int w) {
ostringstream sout;
sout << std::setfill('0') << std::setw(w) << i;
string s = sout.str();
return s;
}
int letter_to_int(char c) {
return tolower(c) - 'a';
}
int compare_array(vector<int> a1, vector<int>a2) {
if (a1.size() != a2.size()) {
return a1.size() - a2.size();
}
for (int i=0; i<a1.size(); i++) {
if (a1.at(i) != a2.at(i)) {
return a1.at(i) - a2.at(i);
}
}
return 0;
}
int gcd(int a, int b) {
if (a == b) {
return a;
}
else if (a > b) {
return gcd(a - b, b);
}
else {
return gcd(a, b - a);
}
}
char int_to_char(int a) {
if (a == -1) {
return 'z';
}
else {
return 'a' + a;
}
}
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans*i;
}
for (int i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
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;
}
int divide_count(int a, int divider) {
int r = 0;
while(a % divider == 0) {
a /= divider;
r++;
}
return r;
}
bool is_prime(int a) {
int i = 2;
while(i * i <= a) {
if(a % i == 0) {
return false;
}
i++;
}
return true;
}
int main() {
std::cout << std::setprecision(9);
int a, b;
cin >> a >> b;
int ans = -1;
for(int i=b*10; i<b*10+10; i++) {
if((int)(i * 0.08) == a) {
ans = i;
break;
}
}
cout << ans << endl;
}
| 0
| 55,970,266
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long double a,b,c;
cin>>a>>b;
c=a/b;
cout<<c<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ return a < b && (a = b, true); }
int main() {
int x,a,b;
cin >> x >> a >> b;
if (b - a <= 0){
cout << "delicious\n";
}
else if (b - a <= x){
cout << "safe\n";
}
if (b - a > x){
cout << "dangerous\n";
}
return 0;
}
| 0
| 52,021,773
|
#include <bits/stdc++.h>
using namespace std;
#define forloop(n) for(int i = 0; i < n; i++)
#define ll long long
int main(){
int n; cin>>n;
ll res = 0, sum = 0;
forloop(n){
ll a,b; cin>>a>>b;
sum += a*b;
res += b;
}
cout<< (sum-1)/9 + res-1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x << ": " << x << '\n'
const int MOD = (int)1e9 + 7;
signed main() {
int A, B;
cin >> A >> B;
if (A % 2 == 0) {
int cnt = B - A + 1;
int r = cnt % 4;
if (r == 0) {
cout << 0 << endl;
} else if (r == 1) {
cout << B << endl;
} else if (r == 2) {
cout << 1 << endl;
} else {
cout << (1 ^ B) << endl;
}
return 0;
} else {
int cnt = B - A + 1 - 1;
int r = cnt % 4;
if (r == 0) {
cout << A << endl;
} else if (r == 1) {
cout << (A ^ B) << endl;
} else if (r == 2) {
cout << (A ^ 1) << endl;
} else {
cout << ((A ^ 1) ^ B) << endl;
}
return 0;
}
}
| 0
| 18,330,599
|
#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 <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
const int N = 102;
vector<int> ind[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto &t : a) {
cin >> t;
}
for (int i = 0; i < n; i++) {
ind[a[i]].push_back(a[i]);
}
int mx = *max_element(a.begin(), a.end());
vector<int> d(mx + 1);
vector<int> to(mx + 1);
for (int i = 0; i <= mx; i++) {
d[i] = max(i, mx - i);
}
for (int i = 0; i <= mx; i++) {
if (ind[d[i]].empty()) {
cout << "Impossible\n";
return 0;
}
to[i] = ind[d[i]].back();
ind[d[i]].pop_back();
}
for (int i = 0; i <= mx; i++) {
d[i]++;
}
for (int i = 0; i <= mx; i++) {
ind[d[i]].clear();
}
for (int i = 0; i < N; i++) {
if (!ind[i].empty()) {
cout << "Impossible\n";
return 0;
}
}
cout << "Possible\n";
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define MOD 1000000007
#define INF 1e9
#define PIE 3.14159265358979323
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>
T GCD(T a, T b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
template <class T>
inline T LCM(T a, T b) {
return (a * b) / GCD(a, b);
}
using namespace std;
signed main() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
int x = a - b;
if (k % 2)
cout << -x << endl;
else
cout << x << endl;
}
| 0
| 38,637,973
|
#include<iostream>
using namespace std;
int main()
{
int n;
int room[4][3][10] = { { 0 } };
cin >> n;
for (int i = 0; i < n; i++){
int b, f, r, v;
cin >> b >> f >> r >> v;
room[b - 1][f - 1][r - 1] = room[b - 1][f - 1][r - 1] + v;
}
for (int i = 0; i < 4; i++){
for (int j = 0; j < 3; j++){
for (int k = 0; k < 10; k++){
cout <<" "<< room[i][j][k];
}
cout << endl;
}
if (i < 3){
for (int l = 0; l < 20; l++){
cout << "#";
}
cout << endl;
}
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#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 popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), 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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
const ll N = 1e5+5, M = 1e6+5, A = 1e7+5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
void solve(){
ll n, h, ans = 0; cin >> n >> h;
ll a[n], b[n];
rep(i, n) cin >> a[i] >> b[i];
sort(b, b+n);
ll mx = *max_element(a, a+n);
ll j = 0;
while(j < n && b[j] <= mx){
j++;
}
for(ll i = n-1; i >= j; i--) {
ans++; h -= b[i];
if(h <= 0) ANS(ans);
}
ans += (h + mx-1)/mx;
cout << ans;
}
int main(int argc, char const* argv[])
{
ll t = 1;
while(t--) {
solve();
}
return 0;
}
| 0
| 32,433,659
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;
int main(){
int n;
cin >> n;
ll ans = 0;
for(ll i = 1; i <= n; i++){
ans += i*(n-i+1);
}
for(int i = 0; i < n-1; i++){
ll a, b;
cin >> a >> b;
if(a > b) swap(a,b);
ll edge_num = a*(n-b+1);
ans -= edge_num;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, X;
cin >> N >> X;
vector<ll> Pati(N + 1), Maisuu(N + 1);
Pati[0] = 1, Maisuu[0] = 1;
for (int i = 1; i <= N; i++) {
Pati[i] = 2 * Pati[i - 1] + 1;
Maisuu[i] = 2 * Maisuu[i - 1] + 3;
}
ll ans = 0;
for (int i = N; i >= 0; i--) {
X--;
if (X >= 0 && i == 0) {
ans++;
break;
}
if (i == 0) break;
if (X >= Maisuu[i - 1]) {
ans += Pati[i - 1];
X -= Maisuu[i - 1];
} else {
continue;
}
X--;
if (X >= 0) ans++;
if (X >= Maisuu[i - 1]) {
ans += Pati[i - 1];
X -= Maisuu[i - 1];
X--;
} else {
continue;
}
}
cout << ans << endl;
}
| 0
| 48,213,507
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvec;
typedef vector<vector<bool>> vveb;
typedef vector<vector<string>> vves;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<(int)(n);i++)
#define rep2(i,n) for(int i=2;i<(int)(n);i++)
#define repk(i,k,n) for(int i=k;i<(int)(n);i++)
#define fs first
#define sc second
#define pb push_back
#define pp pop_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
#define dame { puts("-1"); return 0;}
#define YES { cout << "YES" << endl; return 0; }
#define NO { cout << "NO" << endl; return 0; }
#define Yes { cout << "Yes" << endl; return 0; }
#define No { cout << "No" << endl; return 0; }
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 dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int a = (s[5]-'0')*1000 + (s[6]-'0')*100 + (s[8]-'0')*10 + (s[9]-'0');
if(a<500){cout <<"Heisei"<<endl;}
else cout << "TBD" <<endl;
return 0;
}
|
#include<iostream>
int a = 0 , b = 0 ;
int main()
{
std::cin >> a >> b ;
if( a == b )
{
std::cout << "a == b" <<std::endl ;
}
else if( a > b )
{
std::cout << "a > b" <<std::endl ;
}
else if( a < b)
{
std::cout << "a < b" <<std::endl ;
}
}
| 0
| 34,862,941
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
long long ans = 0,w = 0;
for(int i = 0 ; i < S.size() ; i++){
if(S[i] == 'W'){
ans +=i;
w++;
}
}
cout << ans-(w-1)*w/2 << endl;
}
|
#include <iostream>
using namespace std;
int main()
{
string n;
cin >> n;
for(int i = 0; i < 3; i++) {
if(n[i] == '1') {
cout << 9;
} else if(n[i] == '9') {
cout << 1;
} else {
cout << n[i];
}
}
cout << endl;
return 0;
}
| 0
| 52,423,248
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0);
int main() {
int a, b;
cin >> a >> b;
if (a == 1 && b == 1) {
cout << "Draw" << endl;
} else if (a == 1) {
cout << "Alice" << endl;
} else if (b == 1) {
cout << "Bob" << endl;
} else {
if (a == b)
cout << "Draw" << endl;
else if (a > b)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
}
}
|
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,pair<int,int> > p;
#define bit(n,k) ((n>>k)&1)
#define rad_to_deg(rad) (((rad)/2/M_PI)*360)
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
int main(){
string s;
cin>>s;
int count=0;
for(int i=0;i<(int)s.size();i++){
if(s[i]=='o') count++;
}
int n=(int)s.size();
n=15-n;
if(count+n>=8) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
| 0
| 17,685,804
|
#include<bits/stdc++.h>
#define speed_up ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ara(A,N) sort(A,A+N)
#define rev(A,N) sort(A,A+N,greater<long long>())
using namespace std;
int main()
{ speed_up;
int m, n, i, j, k, l;
cin>>n>>m;
vector<string> a(n), b(m);
for(i = 0; i<n; i++)
{
cin>>a[i];
}
for(j = 0; j<m; j++)
{
cin>>b[j];
}
for(i = 0; i<n; i++)
{
for(j = 0; j<n; j++)
{
if(a[i][j]!= b[0][0]) continue;
bool x = 1;
for(k = 0; k<m; k++)
{
for(l = 0; l<m; l++)
{
if(i+k>=n || j+l>=n || a[i+k][j+l]!=b[k][l])
{
x = 0;
break;
}
}
if(x == 0) break;
}
if(x)
{
puts("Yes");
return 0;
}
}
}
puts("No");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF= 1LL << 60;
#define REP(i,n) for(ll i=0; i<n; i++)
#define FOR(i,a,n) for(ll i=a; i<n; i++)
struct c{
int num,sum;
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n);
vector<int> B(n);
vector<c> C(n);
REP(i,n){
cin >> A[i] >> B[i];
C[i].num= i;
C[i].sum= A[i]+B[i];
}
sort(C.begin(), C.end(), [](const c &a, const c &b) { return a.sum > b.sum; });
ll s= 0;
REP(i,n){
s+= (i&1)?-B[C[i].num]:A[C[i].num];
}
cout << s << endl;
}
| 0
| 26,479,057
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll N;
cin >> N;
ll num = 0;
for(ll i = 1; i <= N; i++) {
if(to_string(i).size() % 2 == 1) {
num++;
}
}
cout << num << endl;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)(v).size())
#define clr(v, d) memset(v, d, sizeof(v))
#define Fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
typedef long long ll;
const double PI = acos(-1.0);
int dx[] = { 1,-1,0,0 };
int dy[] = { 0,0,1,-1 };
void file() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
}
bool check_prime(ll a)
{
bool flag = true;
if (a <= 1)
return false;
else
{
for (ll i = 2; i <= sqrt(a); i++)
{
if (a % i == 0)
{
flag = false;
break;
}
}
}
if (flag)
return true;
else
{
return false;
}
}
int main()
{
Fast;
ll n;
cin >> n;
int sum = 0;
n = n * 2;
vector<int>v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
sort(v.begin(), v.end());
if (n % 2 == 0)
{
for (int i = 0; i < n-1; i+=2)
{
sum += min(v[i], v[i + 1]);
}
}
else
{
v.pop_back();
for (int i = 0; i < n - 1; i += 2)
{
sum += min(v[i], v[i + 1]);
}
}
cout << sum;
}
| 0
| 10,091,820
|
#include<bits/stdc++.h>
using namespace std;
const int mod = 200003;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define fr(s,n) for (int i=(int)(s);i<(int)(n);i++)
#define lc cout<<"\n"
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
int a[n]={0};
fr(0,k){
int d;
cin>>d;
for(int j=0;j<d;j++){
int x;
cin>>x;
a[x-1]=1;
}
}
int ans=0;
fr(0,n){
ans+=!a[i];
}
cout<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL)
#define ll long long
#define fm_t ll t;cin>>t;while(t--)
#define fr(i,a,b) for( ll i=a;i<b;i++)
#define fr1(i,n,a) for( ll i=n-1;i>=a;i--)
#define sz(x) (ll)(x).size()
#define all(v) (v).begin(), (v).end()
#define Sort(x) sort(x.begin(),x.end())
#define ms(a) memset(a,0,sizeof(a))
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
const ll Mod = 998244353;
#define mod 1000000007
#define inf 1e18
#define ld long double
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vvi vector< vector<int> >
#define vlp vector< pair<ll, ll> >
#define vllp vector<pair<ll, ll>, ll >
#define pi pair<ll, ll>
#define ppi pair<pair<ll, ll>, ll>
#define ump unordered_map<ll,ll>
#define pri priority_queue< pair<ll,ll> , vector< pair<ll,ll> >, greater< pair<ll,ll> > >
void ingraph(vl graph[], ll m){ll x, y;fr(i,0,m){cin>>x>>y;x--, y--;graph[x].pb(y);graph[y].pb(x);}}
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b, a%b);}
ll lcm(ll a, ll b){return a*b/gcd(a, b);}
ll modmulti(ll a, ll b){
return ((a%mod)*1ll*(b%mod))%mod;
}
ll modadd(ll a, ll b){
ll asdfgh = ((a%mod)+(b%mod)+mod+mod)%mod;
asdfgh = (asdfgh+mod)%mod;
return asdfgh;
}
ll modpower(ll a, ll n){
if(n==0) return 1;
if(n==1) return a%mod;
ll b = modpower(a,n/2);
b = modmulti(b,b);
if(n%2==0) return b;
return modmulti(a,b);
}
ll modinv(ll a){
return modpower(a,mod-2);
}
int main()
{
fast;
ll n,k;
cin>>n>>k;
ll a[n+5];
for(ll i=1;i<=n;i++)
cin>>a[i];
ll dp[n+1][k+1];
ms(dp);
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
ll pref[k+1];
ms(pref);
pref[0]=dp[i-1][0]%mod;
fr(j,1,k+1)
pref[j]=(pref[j-1]+dp[i-1][j])%mod;
fr(j,0,k+1)
{
if(j<=a[i])
dp[i][j]=pref[j]%mod;
else dp[i][j]=(pref[j]-pref[j-a[i]-1]+mod)%mod;
}
}
cout<<dp[n][k]<<endl;
return 0;
}
| 0
| 90,439,723
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (c >= a && c <= b) puts("Yes");
else puts("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,monster = 0,sum = 0;
cin >> n;
vector<int> city(n+1);
vector<int> hero(n);
for (int i = 0; i < n+1; i++){
cin >> city.at(i);
monster += city.at(i);
}
for (int i = 0; i < n; i++){
cin >> hero.at(i);
}
for (int i = 0; i < n; i++){
if(city.at(i) <= hero.at(i)){
hero.at(i) -=city.at(i);
city.at(i) = 0;
}else{
city.at(i) -= hero.at(i);
hero.at(i) = 0;
continue;
}
if(city.at(i+1) <= hero.at(i)){
hero.at(i) -=city.at(i+1);
city.at(i+1) = 0;
}else{
city.at(i+1) -= hero.at(i);
hero.at(i) = 0;
continue;
}
}
for (int i = 0; i < n+1; i++){
sum += city.at(i);
}
cout << monster - sum << endl;
}
| 0
| 62,011,198
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxN = 1e5+20;
int n;
int64_t v[mxN+1][3];
int64_t dp[mxN+1][4];
int64_t go(int idx, int last) {
if(idx == n) {
if(last == 1) {
return max(v[idx][1], v[idx][2]);
} else if(last == 2) {
return max(v[idx][0], v[idx][2]);
} else {
return max(v[idx][0], v[idx][1]);
}
}
if(idx > n) {
return (int64_t)-1e18;
}
if(dp[idx][last] != -1) {
return dp[idx][last];
}
int64_t ans = (int64_t)-1e18;
if(last != 1) {
ans = max(ans, v[idx][0] + go(idx+1, 1));
}
if(last != 2) {
ans = max(ans, v[idx][1] + go(idx+1, 2));
}
if(last != 3) {
ans = max(ans, v[idx][2] + go(idx+1, 3));
}
return dp[idx][last] = ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 0; j < 3; j++) {
cin >> v[i][j];
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < 4; j++) {
dp[i][j] = -1;
}
}
int64_t ans = go(1, 0);
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
long long gcd(ll a, ll b)
{
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(ll a, ll b)
{
return a / gcd(a, b) * b ;
}
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
vector<vector<int>> d(10, vector<int>(10, 1000000));
void warshall_floyd(int n) {
rep(k,n) rep(i,n) {
rep(j,n) {
d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
}
}
}
ll g1(ll n, int p) {
if (n == 0) return 0;
return n/p + g1(n/p, p);
}
ll g2(ll n, int p) {
ll res = g1(n/2, p);
if (p == 2) res += n/2;
return res;
}
int main()
{
ll n; cin >> n;
if (n % 2 == 1) {
cout << 0 << endl;
} else {
cout << min(g2(n,2), g2(n,5)) << endl;
}
return 0;
}
| 0
| 81,190,878
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int t,n,i,j,k;
cin>>n;
int s=((n-1)*n)/2;
cout<<s;
}
|
#include<iostream>
#include<string>
#define MAX 2000000
#define nINF -1
int parent(int);
int left(int);
int right(int);
void maxHeapify(int*, int);
void buildMaxHeap(int*);
void insert(int*, int);
void heapIncreaseKey(int*, int);
int extractMax(int*);
int n=0;
int main(){
int *T, key;
std::string func, ins="insert", ext="extract", end="end";
T = new int[MAX];
while(1){
std::cin >> func;
if(func == end) break;
else if(func == ins){
std::cin >> key;
insert(T, key);
}
else if(func == ext) std::cout << extractMax(T) << "\n";
}
return 0;
}
int parent(int x){
return x/2;
}
int left(int x){
return 2*x;
}
int right(int x){
return 2*x+1;
}
void maxHeapify(int *A, int i){
int l=left(i), r=right(i), largest, temp;
if(l <= n && A[l] > A[i]) largest = l;
else largest = i;
if(r <= n && A[r] > A[largest]) largest = r;
if(largest != i){
temp = A[i];
A[i] = A[largest];
A[largest] = temp;
maxHeapify(A,largest);
}
}
void buildMaxHeap(int *A){
int i;
for(i=n/2; i>0; i--) maxHeapify(A,i);
}
void insert(int *A, int key){
n++;
A[n] = nINF;
heapIncreaseKey(A, key);
}
void heapIncreaseKey(int *A, int key){
int temp, i=n;
if(key < A[i]) std::cout << "Error\n";
A[i] = key;
while(i > 1 && A[parent(i)] < A[i]){
temp = A[i];
A[i] = A[parent(i)];
A[parent(i)] = temp;
i = parent(i);
}
}
int extractMax(int *A){
int max;
if(n < 1) std::cout << "Error\n";
max = A[1];
A[1] = A[n];
n--;
maxHeapify(A,1);
return max;
}
| 0
| 32,173,200
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).rbegin(),(a).rend())
#define ll long long
#define pb(a) push_back(a)
#define PRINTV(v) {for(ll deB=0; deB<(v).size(); deB++){cout << (v)[deB] << " ";}cout << endl;}
int main(){
ll X,N;
vector<ll> p(100,-1);
cin >> X >> N;
REP(i,N) cin >> p[i];
if(N==0){
cout << X << endl;
return 0;
}
ll test = 0;
while(true){
ll ret = X - test;
bool check = false;
REP(i,N) if(ret==p[i]) check = true;
if(!check){
cout << ret << endl;
return 0;
}
ret = X + test;
check = false;
REP(i,N) if(ret==p[i]) check = true;
if(!check){
cout << ret << endl;
return 0;
}
test++;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define mp make_pair
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const dou pi = 3.14159265358;
const ll mod = 1000000007LL;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
template<class T> inline bool change(T a,T b){if(a > b){swap(a,b);return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,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;
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; 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 nCk(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 n,ll m,ll MOD){
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
ll s = S.size();
if(s != 26){
map<char,ll> ma;
rep(i,s){
ma[S[i]]++;
}
for(char c = 'a';c <= 'z';c++){
if(!ma[c]){
S += c;
break;
}
}
cout << S << endl;
}
else{
if(S == "zyxwvutsrqponmlkjihgfedcba"){
cout << "-1\n";
return 0;
}
string T = S;
next_permutation(all(S));
rep(i,s){
if(T[i] == S[i])cout << S[i];
else{
cout << S[i] << "\n";
return 0;
}
}
}
}
| 0
| 77,045,809
|
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(void)
{
long long X, Y, ans, div=0;
cin >> X >> Y;
if(X % Y == 0){
cout << -1 << endl;
}
else{
ans = X;
div = ans % Y;
while(div == 0){
ans += X;
div = ans % Y;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
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; }
const ll mod = 1e9+7;
ll n;
int main() {
cin >> n;
vector<ll> A(n, 0);
for(int i = 0; i < n; ++i) {
cin >> A.at(i);
}
vector<ll> zero(65, 0);
vector<ll> nzero(65, 0);
for(int i = 0; i < n; ++i) {
for(int j = 0; j < 63; ++j) {
if(A.at(i)&((ll)1<<j)) {
nzero.at(j)++;
}else {
zero.at(j)++;
}
}
}
ll ans = 0;
ll now = 1;
for(int i = 0; i < 63; ++i) {
ll next = nzero.at(i)*zero.at(i);
next %= mod;
next *= now;
next %= mod;
now *= 2;
now %= mod;
ans += next;
ans %= mod;
}
cout << ans << endl;
}
| 0
| 40,590,456
|
#include <stdint.h>
#include <stdio.h>
#include <vector>
unsigned readUnsigned() {
int c;
do { c = ::getchar_unlocked(); } while (c < '0');
unsigned result = c - '0';
while ((c = ::getchar_unlocked()) >= '0') {
result *= 10;
result += c - '0';
}
return result;
}
void writeUnsignedLn(unsigned x) {
static const unsigned MAX_DIGITS = 10;
static const unsigned BUF_SIZE = MAX_DIGITS + 1;
static char buffer[BUF_SIZE] = {0};
buffer[BUF_SIZE - 1] = '\n';
unsigned i = BUF_SIZE - 1;
do {
buffer[--i] = x % 10 + '0';
x /= 10;
} while (x);
::fwrite_unlocked(buffer + i, 1, BUF_SIZE - i, stdout);
}
uint64_t N, L, T;
std::vector<uint64_t> xs, W;
std::vector<unsigned> solve() {
std::vector<uint64_t> crossings(N);
struct xid { uint64_t x, id; };
std::vector<xid> left, right;
for (unsigned n = 0; n <= 1; ++n) {
for (unsigned i = 0; i < N; ++i) {
if (W[i] == 1) {
right.push_back({xs[i] + n*L, i});
}
else {
left.push_back({xs[i] + n*L, i});
}
}
}
uint64_t numleft = left.size() / 2;
uint64_t numright = right.size() / 2;
for (unsigned i = 0, min = 0, max = 0; i < N; ++i) {
if (W[i] != 1) {
continue;
}
crossings[i] = (2 * T) / L * numleft;
uint64_t lo = xs[i];
uint64_t hi = xs[i] + 2 * T % L;
for (; min < left.size() && left[min].x < lo; ++min);
for (; max < left.size() && left[max].x < hi; ++max);
crossings[i] += max - min;
}
for (unsigned i = 0, min = 0, max = 0; i < N; ++i) {
if (W[i] != 2) {
continue;
}
crossings[i] = (2 * T) / L * numright;
uint64_t lo = xs[i] + L - 2 * T % L;
uint64_t hi = xs[i] + L;
for (; min < right.size() && right[min].x <= lo; ++min);
for (; max < right.size() && right[max].x <= hi; ++max);
crossings[i] += max - min;
}
std::vector<unsigned> result(N);
for (unsigned i = 0; i < N; ++i) {
if (W[i] == 1) {
unsigned j = (i + crossings[i]) % N;
unsigned t = (xs[i] + T) % L;
result[j] = t;
}
else {
unsigned j = (i - crossings[i] % N + N) % N;
unsigned t = (xs[i] - T%L + L) % L;
result[j] = t;
}
}
return result;
}
int main() {
N = readUnsigned();
L = readUnsigned() * 2;
T = readUnsigned() * 2;
xs.resize(N);
W.resize(N);
for (unsigned i = 0; i < N; ++i) {
xs[i] = readUnsigned() * 2;
W[i] = readUnsigned();
}
std::vector<unsigned> result = solve();
for (unsigned i = 0; i < N; ++i) {
writeUnsignedLn(result[i] / 2);
}
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
using namespace std;
const long long int INF = 1000000007;
int main(void)
{
string s, t;
cin >> s >> t;
int N = s.size();
int M = t.size();
int start = -1;
bool include = false;
for (int i = 0; i <= N - M; i++)
{
include = true;
for (int j = 0; j < M; j++)
{
if (s[i + j] == t[j] || s[i + j] == '?')
{
continue;
}
else
{
include = false;
break;
}
}
if (include)
{
start = i;
}
}
if (start == -1)
{
cout << "UNRESTORABLE" << endl;
return 0;
}
for (int i = 0; i < M; i++)
{
s[start + i] = t[i];
}
for (int i = 0; i < N; i++)
{
if (s[i] == '?')
{
s[i] = 'a';
}
}
cout << s << endl;
}
| 0
| 55,226,099
|
#include<iostream>
using namespace std;
int main(void){
int d;
int sum;
int x_now;
cin >> d;
while(!cin.eof()){
sum = 0;
x_now = 0;
for(int i=600;i!=0;){
sum += x_now*x_now*d;
i -= d;
x_now += d;
}
cout << sum << endl;
cin >> d;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e12;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pii;
const ll mod = 1e9 + 7;
void faster()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const ll M = 10 + 10;
const ll N = 200 * 1000 + 10;
vector <pii> adj[N];
vector <pair <int, pii> > edge;
bool ok = true, vis[N];
ll dist[N];
void dfs(int v)
{
vis[v] = 1;
for (auto e : adj[v])
{
int u = e.second, w = e.first;
if(vis[u])
continue;
dist[u] = dist[v] + w;
dfs(u);
}
}
int main()
{
faster();
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++)
{
int v, u, w;
cin >> v >> u >> w;
v--, u--;
adj[v].push_back({w, u});
adj[u].push_back({-w, v});
edge.push_back({w, {v, u}});
}
for (int i = 0; i < n; i++)
{
if(!vis[i])
{
dfs(i);
}
}
for (auto e : edge)
{
int v = e.second.first, u = e.second.second, w = e.first;
if(dist[v] - dist[u] != -w)
ok = false;
}
if(ok)
cout << "Yes\n";
else
cout << "No\n";
}
| 0
| 4,431,046
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
}
int ans = max(vec[0], -1 * vec[0]);
rep(i,N - 1){
ans += max(vec[i + 1] - vec[i], vec[i] - vec[i + 1]);
}
ans += max(vec[N - 1], -1 * vec[N - 1]);
int ans_copy = ans;
ans_copy += (max(vec[1], -1 * vec[1]) - max(vec[0], -1 * vec[0]) - max(vec[1] - vec[0], vec[0] - vec[1]));
cout << ans_copy << endl;
rep(i,N - 2){
ans_copy = ans;
ans_copy += (max(vec[i + 2] - vec[i], vec[i] - vec[i + 2]) - max(vec[i + 2] - vec[i + 1], vec[i + 1] - vec[i + 2]) - max(vec[i + 1] - vec[i], vec[i] - vec[i + 1]));
cout << ans_copy << endl;
}
ans_copy = ans;
ans_copy += max(vec[N - 2], -1 * vec[N - 2]) - max(vec[N - 1], -1 * vec[N - 1]) - max(vec[N - 2] - vec[N - 1], vec[N - 1] - vec[N - 2]);
cout << ans_copy << endl;
}
|
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; }
else if(k == 1) { return n; }
else return C(n-1,k-1) + C(n-1,k);
}
int main() {
lint n; cin >> n;
vector<lint> a(n); for(lint i=0;i<n;i++) { cin >> a[i]; }
vector<lint> b(n);
lint i=0;
for(i=0;i<(n+1)/2;i++) { b[i] = a[n-2*i-1]; }
for(i=0;i<(n+1)/2;i++) { b[i+(n+1)/2] = a[2*i+n%2]; }
for(lint i=0;i<n;i++) { cout << b[i] << " "; }
cout << endl;
return 0;
}
| 0
| 4,368,611
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector<long long> height(N);
for (int i=0; i<N; i++) cin >> height[i];
long long ans = 100000000000;
for (int i=0; i<pow(2, N); i++)
{
long long cost=0;
vector<long long> tmp_height(N);
copy(height.begin(), height.end(), tmp_height.begin());
if (__builtin_popcount(i)>=K)
{
long long h=0;
for (int j=0; j<N; j++)
{
if (i&(1<<j))
{
if (tmp_height[j]<=h)
{
cost += h-tmp_height[j]+1;
tmp_height[j] = h+1;
}
}
h = max(h, tmp_height[j]);
}
ans = min(ans, cost);
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define Pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<long> > v2l;
const int mod = 1e+5;
const int mx = 2e+5;
const ll inf = 1e18;
using namespace std;
#define max 101
void solvio(){
int N,L;
string S[max];
cin >> N >> L;
for(int i=0; i<N; i++)
cin >> S[i];
sort(S,S+N);
for(int i=0;i<N;i++)
cout << S[i]; cout << endl;
}
int main(){
booster;
solvio();
_terminated;
}
| 0
| 63,433,297
|
#include <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
int main() {
int n;
cin >> n;
vector <int> a(n);
rep (i, n) cin >> a[i];
sort(a.begin(), a.end());
int mini = 1e9, num;
rep (i, n - 1) {
if (n % 2) {
if (mini > abs(a[i] - (a.back() + 1) / 2)) {
mini = abs(a[i] - (a.back() + 1) / 2);
num = a[i];
}
}
else {
if (mini > abs(a[i] - a.back() / 2)) {
mini = abs(a[i] - a.back() / 2);
num = a[i];
}
if (mini > abs(a[i] - (a.back() / 2 + 1))) {
mini = abs(a[i] - (a.back() / 2 + 1));
num = a[i];
}
}
}
cout << a.back() << " " << num << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
size_t N;
cin >> N;
vector<long> A(N, 0);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<long> base(N, 0);
for (int i = 0; i < N; ++i)
base[i] = A[i] - (i + 1);
sort(base.begin(), base.end());
long b = base[N / 2];
size_t out(0);
for (auto x : base)
out += static_cast<size_t>(abs(x - b));
cout << out << endl;
}
| 0
| 77,712,749
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <vector>
#define MAXN 100005
#define eps 1e-7
#define mo 974711
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
int64 A,B;
int Q;
int64 calc(int64 X,int64 MID) {
int64 s = MID,t = X - MID + 2;
if(s >= A) ++s;
if(t <= B) --t;
return s * t;
}
int64 get_Max(int64 X,int64 L,int64 R) {
while(R - L + 1 >= 3) {
int64 K = (R - L + 1) / 3;
int64 LB = L + K,RB = R - K;
if(calc(X,LB) < calc(X,RB)) L = LB;
else R = RB;
}
int64 ans = 0;
for(int64 i = L ; i <= R ; ++i) ans = max(ans,calc(X,i));
return ans;
}
int64 check(int64 MID) {
int64 res = 0;
res = max(get_Max(MID,1,A - 1),res);
res = max(get_Max(MID,MID - A + 2,MID),res);
res = max(get_Max(MID,1,B - 1),res);
res = max(get_Max(MID,MID - B + 2,MID),res);
res = max(get_Max(MID,A,B),res);
res = max(get_Max(MID,A,MID - B + 2),res);
res = max(get_Max(MID,B,MID - A + 2),res);
return res;
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
scanf("%d",&Q);
while(Q--) {
scanf("%lld%lld",&A,&B);
if(A > B) swap(A,B);
int64 P = A * B;
int64 L = 0,R = (A + B);
while(L < R) {
int64 MID = (L + R + 1) >> 1;
if(check(MID) < P) L = MID;
else R = MID - 1;
}
printf("%lld\n",L);
}
}
|
#include <bits/stdc++.h>
using namespace std;
using univ= pair<int64_t, int64_t>;
int main(){
int N;
cin >> N;
vector<univ> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i).first;
}
for(int i=0; i<N; i++){
cin >> data.at(i).second;
}
auto comp= [](univ a, univ b){
return a.second- a.first > b.second- b.first;
};
sort(data.begin(), data.end(), comp);
int64_t shortage= 0;
int cnt_short= 0;
while(data.at(cnt_short).second- data.at(cnt_short).first > 0){
shortage+= data.at(cnt_short).second- data.at(cnt_short).first;
cnt_short++;
}
int cnt_surplus= 0;
while(shortage > 0 && cnt_surplus < N){
cnt_surplus++;
int id_surplus= N- cnt_surplus;
shortage-= data.at(id_surplus).first- data.at(id_surplus).second;
}
int ans= (shortage > 0) ? -1
: cnt_short+ cnt_surplus;
cout << ans << endl;
}
| 0
| 15,966,085
|
#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>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const ll INF = 1LL << 60;
ll gcd(ll a,ll b){
if(b == 0){
return a;
}
else{
return gcd(b,a%b);
}
}
int main() {
ll A,B;
cin >> A >> B;
ll ans;
ll c = gcd(A,B);
ans = A / c * B;
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int n, s = 0, h[100];
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> h[i];
}
for(int i = 0; i < n; i++)
{
int k = 0;
for(int j = 0; j <= i; j++)
{
if(h[j] > h[i])
k++;
}
if(k == 0)
s++;
}
cout << s;
return 0;
}
| 0
| 13,238,026
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=2001,INF=1<<30;
int main(){
int N;cin>>N;
vector<int> A(N),S(100,0);
for(int i=0;i<N;i++){
cin>>A[i];
S[A[i]]++;
}
sort(all(A));
bool flag=true;
if(A[0]*2<A[N-1]) flag=false;
if(N!=2&&A[0]==A[1]&&A[0]==1) flag=false;
if(A[N-2]!=A[N-1]) flag=false;
if(N==2){
if(A[0]!=1||A[1]!=1) flag=false;
}
else{
for(int i=1;i<N-1;i++){
if(S[i-1]&&S[i+1]&&!S[i]) flag=false;
}
if(A[0]==A[2]) flag=false;
if(A[N-1]<=A[0]*2-2) flag=false;
if(A[0]==A[1]&&A[N-1]==A[0]*2) flag=false;
}
if(flag) cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
}
|
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll calc(string S, ll rep)
{
string temp_s = S;
for (ll i = 0; i < rep - 1; ++i) {
S = S + temp_s;
}
ll res = 0;
ll cnt = 1;
for (ll i = 1; i < S.size(); ++i) {
if (S[i] == S[i - 1]) {
cnt += 1;
}
else {
if (cnt > 1) {
res += cnt / 2;
}
cnt = 1;
}
}
if (cnt > 1) {
res += cnt / 2;
}
return res;
}
int main()
{
string S;
cin >> S;
ll K;
cin >> K;
char temp = S[0];
bool all_same = true;
for (ll i = 0; i < S.size(); ++i) {
if (S[i] == temp) {
continue;
}
all_same = false;
break;
}
if (all_same) {
cout << S.size() * K / 2 << endl;
return 0;
}
ll one = calc(S, 1);
ll two = calc(S, 2);
ll three = calc(S, 3);
ll dif = three - two;
ll ans = one + (K - 1) * dif;
cout << ans << endl;
}
| 0
| 82,321,273
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string a;
while(true){
int count=0;
cin>>a;
if(a=="#")
break;
bool right=true,mae;
for(int i=0;i<a.size();i++){
mae=right;
if(a[i]=='y'||a[i]=='u'||a[i]=='i'||a[i]=='o'||a[i]=='p'||a[i]=='h'||a[i]=='j'||a[i]=='k'||a[i]=='l'||a[i]=='n'||a[i]=='m'){
right=true;
}
else{
right=false;
}
if(i!=0&&mae!=right)
count++;
}
cout<<count<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
string s;
ll k;
cin >> s >> k;
for(int i = 0; i < s.size(); i++){
if (i == k-1){
cout << s[i] << endl;
return 0;
}
if (s[i] != '1'){
cout << s[i] << endl;
return 0;
}
}
}
| 0
| 52,692,067
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int flag=0,i;
string s,t;
cin>>s>>t;
if(t.size()==s.size()+1)
{
for(i=0;i<t.size()-1;i++)
{
if(s[i]!=t[i])
flag++;
}
}
else
{
flag++;
}
if(flag==0)
cout<<"Yes"<<endl;
else
{
cout<<"No"<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
if(S.at(0)!='k'){
if(S.substr(S.size()-7,7)=="keyence") cout << "YES" << endl;
else cout << "NO" << endl;
}
else if(S.at(S.size()-1)!='e'){
if(S.substr(0,7)=="keyence") cout << "YES" << endl;
else cout << "NO" << endl;
}
else if(S.at(0)=='k' && S.at(S.size()-1)=='e'){
if(S.substr(0,1)=="k" && S.substr(S.size()-6,6)=="eyence") cout << "YES" << endl;
else if(S.substr(0,2)=="ke" && S.substr(S.size()-5,5)=="yence") cout << "YES" << endl;
else if(S.substr(0,3)=="key" && S.substr(S.size()-4,4)=="ence") cout << "YES" << endl;
else if(S.substr(0,4)=="keye" && S.substr(S.size()-3,3)=="nce") cout << "YES" << endl;
else if(S.substr(0,5)=="keyen" && S.substr(S.size()-2,2)=="ce") cout << "YES" << endl;
else if(S.substr(0,6)=="keyenc" && S.substr(S.size()-1,1)=="e") cout << "YES" << endl;
else cout << "NO" << endl;
}
}
| 0
| 83,689,294
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll A, B, K;
cin >> A >> B >> K;
ll take = min(A, K);
A -= take;
K -= take;
if (K > 0) B -= K;
if (B < 0) B = 0;
cout << A << ' ' << B << '\n';
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
ll n;
cin >> n;
vector<ll> a(n),t(n);
for(int i = 0; i < n; i++) cin >> t[i];
for(int i = 0; i < n; i++) cin >> a[i];
if(a[0] != t[n-1]){
cout << 0 << endl;
}else
{
ll ans = 1;
for(int i = 1; i < n-1; i++){
if(t[i] == t[i-1] && a[i] == a[i+1]){
ans *= min(t[i],a[i]);
ans %= mod;
}else if(t[i] > t[i-1] && a[i] == a[i+1] && a[i] < t[i]){
ans = 0;
}else if(t[i] == t[i-1] && a[i] > a[i+1] && a[i] > t[i]){
ans = 0;
}else if(t[i] > t[i-1] && a[i] > a[i+1] && a[i] != t[i]){
ans = 0;
}
}
cout << ans << endl;
}
return 0;
}
| 0
| 76,924,911
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define REV(x) reverse(ALL(x))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
int N, M, K; cin >> N >> M >> K;
bool okay = false;
REPS(k, N){
if(2*k == N){
if(k*M == K) okay = true;
}else{
int l = (K - k*M) / (N - 2*k);
if(l >= 0 && l <= M && k*(M-l) + (N-k)*l == K)
okay = true;
}
}
cout << (okay ? "Yes" : "No") << endl;
return 0;
}
|
#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()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODADD(ADD_X,ADD_Y) (ADD_X+ADD_Y)%MOD;
#define MODSUB(SUB_X,SUB_Y) (SUB_X-SUB_Y)+MOD)%MOD;
#define MODMUL(MUL_X,MUL_Y) (MUL_X*MUL_Y)%MOD;
#define LCM(LCM_X,LCM_Y) (LCM_X*LCM_Y)/__gcd(LCM_X,LCM_Y);
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
int dx[]= {1,0,-1,0,1,-1,1,-1};
int dy[]= {0,1,0,-1,1,-1,-1,1};
int mark[200];
int main()
{
FastRead
ll n,ans;
cin>>n;
ans=n;
ll sq=sqrt(n);
for(ll i=1;i<=sq;i++){
if(n%i==0){
ll m=n/i;
ans=min(ans,m+i-2);
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 49,035,158
|
#include<bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define mp make_pair
#define pii pair<int,int>
#define pb push_back
#define ri register int
#define rep(i,a,b) for(ri i=(a);i<=(b);++i)
#define rep2(i,a,b,c) for(ri i=(a);i<=(b);i+=(c))
#define REP(i,a,b) for(ri i=(a);i>=(b);--i)
#define REP2(i,a,b,c) for(ri i=(a);i>=(b);i-=(c))
#define fi first
#define se second
using namespace std;
inline int read(){
ri x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^'0'),c=getchar();
return x*f;
}
inline void write(ri x){
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
const int N=1e6+5;
int n;
bool vis[N];
deque<pii> q;
int main()
{
n=read();q.push_front(mp(1,1));
while(1){
pii t=q.front();q.pop_front();
if(vis[t.fi]) continue;
vis[t.fi]=1;
if(!t.fi) return write(t.se),0;
q.push_front(mp(t.fi*10%n,t.se));
q.push_back(mp((t.fi+1)%n,t.se+1));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int,int> P;
using ll = long long;
using VI = vector<int>;
int main(){
char left[] = {'q','w','e','r','t','a','s','d','f','g','z','x','c','v','b'};
string s;
while(1){
cin >> s;
if(s[0]=='#') break;
int count = 0;
int flag=-1;
int mflag = -1;
rep(i,s.size()){
flag = -1;
rep(j,15){
if(left[j]==s[i]){
flag = 0;
}
}
if(flag==-1) flag = 1;
if(i==0){
mflag = flag;
}else{
if(mflag!=flag) count++;
}
mflag = flag;
}
cout << count << endl;
}
}
| 0
| 62,951,517
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long N;
long sum=0;
long max=0;
cin>>N;
vector <int>a(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
if(a.at(i)>max){
max=a.at(i);
}
else{
sum+=max-a.at(i);
}
}
cout<<sum<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
set<int> st;
rep(i, K) {
int D;
cin >> D;
rep(i, D) {
int a;
cin >> a;
st.insert(a);
}
}
int ans = N - sz(st);
cout << ans << '\n';
return 0;
}
| 0
| 63,530,243
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
const int INF = 1e9;
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
int main()
{
cin >> N;
vi arr(N);
for (int i = 0; i < N; i++) cin >> arr.at(i);
B = *max_element(all(arr));
C = *min_element(all(arr));
cout << B-C;
return 0;
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,e,n,k,maxi=0,f=0,mini=INF,sum=0,q;
string str,stra,straa;
ll x,y,w,z;
char ca,cb,cc;
cin>>ca>>cb>>cc;
map<char,ll> ma;
ma[ca]++;
ma[cb]++;
ma[cc]++;
if(ma['a']&&ma['b']&&ma['c']) Yes;
else No;
return 0;
}
| 0
| 76,556,601
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
}
return ret;
}
ll mod(ll val) {
ll res = val % MOD;
if(res < 0) {
res += MOD;
}
return res;
}
int N;
ll bit[1000010];
void add(int a,ll w) {
while(a <= N) {
bit[a] += w;
a += a & -a;
}
}
ll sum(int a) {
ll ret = 0;
while(a > 0) {
ret += bit[a];
a -= a & -a;
}
return ret;
}
int main() {
cin >> N;
ll D,A;
cin >> D >> A;
vector<P> vec(N);
for(int i = 0;i < N;i++) {
cin >> vec.at(i).first >> vec.at(i).second;
}
sort(vec.begin(),vec.end());
vector<ll> C(N);
for(int i = 0;i < N;i++) {
C.at(i) = vec.at(i).first;
}
for(int i = 0;i < 1000010;i++) {
bit[i] = 0;
}
ll ret = 0;
for(int i = 0;i < N;i++) {
if(vec.at(i).second - sum(i + 1) * A <= 0) {
continue;
}
else {
ll cnt = (vec.at(i).second - sum(i + 1) * A + A - 1) / A;
ret += cnt;
auto itr = upper_bound(C.begin(),C.end(),C.at(i) + 2 * D);
int itr2 = itr - C.begin();
itr2++;
add(i + 1,cnt);
add(itr2,-cnt);
}
}
cout << ret << endl;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
int main()
{
int N,A,B,C,X;
while(cin>>N>>A>>B>>C>>X){
if(N == 0) return 0;
int Y[N];
FOR(i,0,N) cin >> Y[i];
int fr = 0;
int now = 0;
int rnd = X;
bool ok = false;
while(fr <= 10000) {
if(Y[now] == rnd) now++;
if(now == N) {
cout << fr << endl;
ok = true;
break;
}
rnd = (A * rnd + B) % C;
fr++;
}
if(!ok) cout << -1 << endl;
}
return 0;
}
| 0
| 97,723,417
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
using namespace std;
using ll = long long;
int main() {
ll n,m;
cin >> n >> m;
ll ans = 0;
if(n*2 >= m){
ans += m/2;
}
else{
ans += n;
m -= n*2;
m /= 4;
ans += m;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int A,B,M;
cin >> A >> B >> M;
int a[A],b[B];
rep(i,A)cin >> a[i];
rep(i,B)cin >> b[i];
int minA = 100000;
int minB = 100000;
rep(i,A)minA = min(a[i],minA);
rep(i,B)minB = min(b[i],minB);
int ans = minA + minB;
rep(i,M){
int x,y,c;
cin >> x >> y >> c;
int price = a[x-1] + b[y-1] - c;
ans = min(price,ans);
}
cout << ans << endl;
return 0;
}
| 0
| 9,256,727
|
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define REP(e,v) for(auto e:v)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define edge(v,a,b) v[a].pb(b);v[b].pb(a);
#define MAX_V 400010
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define endl "\n"
#define ALL(c) (c).begin(),(c).end()
using namespace std;
int in() {int x;scanf("%d",&x);return x;}
ll lin() {ll x;scanf("%lld",&x);return x;}
#define INF 1e9+7
#define LLINF 1e18+7
ll MOD=1e9+7;
#define N 1055050
ll n,m,k;
ll a[N];
main(){
n=in();
vec v;
ll ans=0;
rep(i,n){
v.pb(in());
}
int now=1;
ans=v[0]-1;
rep2(i,1,n-1){
if(v[i]==now+1)now+=1;
else{
ans+=(v[i]-1)/(now+1);
}
}
cout<<ans;
}
|
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fb(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define nl '\n'
#define pl pair<ll, ll>
#define all(v) v.begin(), v.end()
#define lb lower_bound
#define ub upper_bound
#define nude(a) \
for (auto i : a) \
cout << i << " "; \
cout << nl;
#define tc \
ll tc; \
cin >> tc; \
while (tc--)
const ll mod = (1e9 + 7);
const ll sz = 2e5 + 9;
#define maxheap priority_queue<ll>
#define minheap priority_queue<ll, vector<ll>, greater<ll>>
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
{
res = (res * x) % p;
}
y = y >> 1;
x = (x * x) % p;
}
return res;
}
vector<vector<ll>> dp(1e5 + 1, vector<ll>(2, -1));
ll dfs(vector<vector<ll>> &adj, ll cur, ll par, ll col)
{
if (dp[cur][col] == -1)
{
dp[cur][col] = 1;
for (ll x : adj[cur])
{
if (x != par)
{
if (!col)
{
dp[cur][col] *= (dfs(adj, x, cur, col) + dfs(adj, x, cur, col ^ 1)) % mod;
dp[cur][col] %= mod;
}
else
{
dp[cur][col] *= dfs(adj, x, cur, col ^ 1) % mod;
dp[cur][col] %= mod;
}
}
}
}
return dp[cur][col];
}
void bring_me_thanos()
{
ll n;
cin >> n;
vector<vector<ll>> adj(n + 1);
ll x, y;
f(i, 0, n - 1)
{
cin >> x >> y;
adj[x].pb(y);
adj[y].pb(x);
}
dfs(adj, 1, 0, 0);
dfs(adj, 1, 0, 1);
cout << (dp[1][0] + dp[1][1]) % mod << nl;
}
void solve()
{
bring_me_thanos();
}
int main()
{
#ifdef JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
clock_t beg = clock();
solve();
clock_t end = clock();
fprintf(stderr, "%.3f sec, Copyright %c 2019 PyThor. \n", double(end - beg) / CLOCKS_PER_SEC, 184);
return 0;
}
| 0
| 64,228,022
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A.at(i);
for(int k=0;k<K;k++){
vector<int> B(N+1,0);
for(int i=0;i<N;i++){
int left = max(0,i-A.at(i));
int right = min(i+A.at(i)+1,N);
B.at(left) ++;
B.at(right) --;
}
for(int i=1;i<=N;i++){
B.at(i) += B.at(i-1);
}
if(A==B) break;
A = B;
}
for(int i=0;i<N;i++){
cout << A.at(i) << endl;
}
}
|
#include <iostream>
#include <limits>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) { for (auto it = c.begin(); it != c.end(); ++it) if (it == c.begin()) cout << *it; else cout << ' ' << *it; cout << endl; }
struct V {
double x;
double y;
explicit V(double init_x = 0, double init_y = 0) : x(init_x), y(init_y) {}
V(const V& rhs) : x(rhs.x), y(rhs.y) {}
V& operator=(const V& rhs) {
if (this != &rhs) {
x = rhs.x;
y = rhs.y;
}
return *this;
}
double norm() const { return sqrt(x*x+y*y); }
};
inline double innerProduct(const V& lhs, const V& rhs) { return (lhs.x * rhs.x + lhs.y * rhs.y); }
inline V operator+(const V& lhs, const V& rhs) { return V(lhs.x + rhs.x, lhs.y + rhs.y); }
int main()
{
int N;
cin >> N;
vector<V> e(N);
for (int i = 0; i < N; ++i) {
cin >> e[i].x >> e[i].y;
}
double ans = 0;
const double EPS = 0.00000000000000000000001;
const double cos_EPS = cos(EPS);
const double sin_EPS = sin(EPS);
const double cos_90 = 0;
const double sin_90 = 1.0;
for (const V& v: e) {
vector<V> dir(6);
dir[0].x = cos_EPS * v.x - sin_EPS * v.y;
dir[0].y = sin_EPS * v.x + cos_EPS * v.y;
dir[1].x = cos_90 * dir[0].x - sin_90 * dir[0].y;
dir[1].y = sin_90 * dir[0].x + cos_90 * dir[0].y;
dir[2].x = cos_90 * dir[0].x + sin_90 * dir[0].y;
dir[2].y = -sin_90 * dir[0].x + cos_90 * dir[0].y;
dir[3].x = cos_EPS * v.x + sin_EPS * v.y;
dir[3].y = -sin_EPS * v.x + cos_EPS * v.y;
dir[4].x = cos_90 * dir[0].x - sin_90 * dir[3].y;
dir[4].y = sin_90 * dir[0].x + cos_90 * dir[3].y;
dir[5].x = cos_90 * dir[0].x + sin_90 * dir[3].y;
dir[5].y = -sin_90 * dir[0].x + cos_90 * dir[3].y;
for (const V& d: dir) {
V vSum;
for (const V& t: e) {
if (0 <= innerProduct(t, d)) {
vSum = vSum + t;
}
}
ans = max(ans, vSum.norm());
}
}
printf("%.30f\n", ans);
return 0;
}
| 0
| 45,031,201
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
int a=n/15;
cout << 800*n-a*200 << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
return gcd(y,x%y);
}
int dis2(int x1,int y1,int x2,int y2){
return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
int main(){
int A,B,M;cin>>A>>B>>M;
int a[A],b[B];
for(int i=0;i<A;i++) cin>>a[i];
for(int i=0;i<B;i++) cin>>b[i];
int x[M],y[M],c[M];
for(int i=0;i<M;i++){
cin>>x[i]>>y[i]>>c[i];
}
int ans=*min_element(a,a+A)+*min_element(b,b+B);
for(int i=0;i<M;i++){
ans=min(ans,a[x[i]-1]+b[y[i]-1]-c[i]);
}
cout<<ans<<endl;
return 0;
}
| 0
| 43,450,121
|
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int N,M;
cin >> N >> M;
cout << 6-N-M;
}
|
#include <iostream>
int main()
{
int a,hanako = 0,tosiki = 0;
std::cin >> a;
std::string str1,str2;
for(int b = 0; b < a;b++){
std::cin >> str1;
std::cin >> str2;
if(str1 < str2){
tosiki = tosiki + 3;
}
if(str1 > str2){
hanako = hanako + 3;
}
if(str1 == str2){
tosiki++;
hanako++;
}
}
std::cout << hanako <<" "<<tosiki<<std::endl;
return 0;
}
| 0
| 16,654,402
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a_max, tmp = 0;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) cin >> vec.at(i);
sort(vec.begin(), vec.end());
a_max = vec.back();
vector<bool> bl(a_max + 1, true);
for (size_t i = 0; i < vec.size(); i++) {
if (tmp == vec.at(i)) {
bl.at(vec.at(i)) = false;
}
if (bl.at(vec.at(i))) {
for (int j = 2; j * vec.at(i) <= a_max; j++) {
bl.at(vec.at(i) * j) = false;
}
}
tmp = vec.at(i);
}
int cnt = 0;
for (size_t x = 0; x < vec.size(); x++) {
if (bl.at(vec.at(x))) {
cnt++;
}
}
cout << cnt << endl;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define int long long
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 100002;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t,dp[li][5];
int cev;
string s;
vector<int> v[li];
inline int add(int x,int y){
if(x+y>=mod)return x+y-mod;
return x+y;
}
inline int mul(int x,int y){
return (x%mod)*(y%mod)%mod;
}
inline void dfs(int node,int ata){
int sum[2]={1,1};
flag=0;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
if(go==ata)continue;
flag=1;
dfs(go,node);
sum[0]=mul(sum[0],add(dp[go][0],dp[go][1]));
sum[1]=mul(sum[1],dp[go][0]);
}
if((int)v[node].size()==1 && ata!=0){
dp[node][0]=1;
dp[node][1]=1;
}
else{dp[node][0]=sum[0];dp[node][1]=sum[1];}
}
main(void){
scanf("%lld",&n);
for(int i=1;i<n;i++){
int x,y;
scanf("%lld %lld",&x,&y);
v[x].pb(y);
v[y].pb(x);
}
dfs(1,0);
printf("%lld\n",add(dp[1][1],dp[1][0]));
return 0;
}
| 0
| 95,777,421
|
#include<bits/stdc++.h>
#define INF (1e9)
#define N 1005
using namespace std;
int main(){
int n,a[N];
while(1){
cin>>n;
if(!n)break;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int ans=INF;
for(int i=0;i<n-1;i++)
ans=min(ans,a[i+1]-a[i]);
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,s,e) for (int i=s;i<(e);i++)
#define All(v) (v).begin(),(v).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
using namespace std;
typedef long long llint;
typedef pair<int, int> P;
const int MOD = (int)1e9 + 7;
const int INF = 999999999;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
map<P, int> m;
int H, W, N;
cin >> H >> W >> N;
REP(i, N){
int a, b;
cin >> a >> b;
FOR(j, a-1, a+2)FOR(k, b-1, b+2){
if(m.find(mp(j,k)) == m.end()) m[mp(j, k)] = 1;
else m[mp(j, k)]++;
}
}
vector<llint> ans(10,0);
for(auto x : m){
P key = x.first;
if(key.first <= 1 || key.first >= H) continue;
if(key.second <= 1 || key.second >= W) continue;
ans[m[key]]++;
}
ans[0] = (llint)(H-2)*(W-2);
FOR(i, 1, 10) ans[0] -= ans[i];
REP(i, 10) cout << ans[i] << "\n";
return 0;
}
| 0
| 3,473,915
|
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
using namespace std;
typedef pair<int, int> pii;
#define MAX 99999999
int main(){
int n;
while(cin>>n,n){
vi v(n+1,0);
rep(i,n)cin>>v[i];
ll ans=-INF, temp;
for(int i=0;i<n;i++){
temp=0;
for(int j=i;j<n;j++){
temp+=v[j];
ans=max(ans,temp);
}
}
if(n==1)cout<<v[0]<<endl;
else cout<<ans<<endl;
}
}
|
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
int a,b,c;
cin >> a >> b >> c;
if (a==b){
cout << c;
return 0;
}
else if (a==c){
cout <<b;
return 0;
}
else if (b==c){
cout << a;
return 0;
}
return 0;
}
| 0
| 68,920,119
|
#include <iostream>
using namespace std;
int main(int argc, char **argv)
{
int n, tmp, count;
while(cin >> n){
count = 0;
for(int i = 0; i <= 9; i++){
if(i > n){
break;
}
for(int j = 0; j <= 9; j++){
if((i + j) > n){
break;
}
for(int k = 0; k <= 9; k++){
tmp = i + j + k;
if(tmp > n){
break;
}
for(int l = 0; l <= 9; l++){
if(n == (tmp+l)){
count++;
break;
}
}
}
}
}
cout << count << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;
int main() {
int N;
cin>>N;
int64_t t=1e18;
vector<int64_t>A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
if(A[i]==0){cout<<0<<endl;return 0;}
}
int64_t sum=1;
for(int i=0;i<N;i++){
if(t%A[i]==0){
if(sum<=t/A[i]){sum*=A[i];}
else {cout<<-1<<endl;return 0;}
}
else {
if(sum<t/A[i]){sum*=A[i];}
else{cout<<-1<<endl;return 0;}
}
}
cout<<sum<<endl;
return 0;
}
| 0
| 16,328,959
|
#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 reps(i, s, e) for(int i=s; i<e; i++)
#define inf 1e18
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x) x.size()
#define ceil(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
using namespace std;
using ll = long long;
template<typename T> inline bool chmax(T &a, T b){ if(a<b){ a=b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b){ if(b<a){ a=b; return true; } return false; }
template<typename T> T gcd(T a, T b){ if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b){ return a*b/gcd(a, b); }
template<typename T> T vdebug(vector<T> v){ for(auto vv : v){ cout << vv << " "; } cout << endl; }
template<typename T> T adebug(T arr[], int n){ rep(i, n){ cout << arr[i] << " "; } cout << endl; }
void ans(bool b){ if(b) cout << "Yes" << endl; else cout << "No" << endl; }
void ans2(bool b){ if(b) cout << "YES" << endl; else cout << "NO" << endl; }
int keta(ll num){ int k=0; while(num>0){ num/=10; k++; } return k; }
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
ll a[200010];
ll sum[200010];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
rep(i, n){
cin >> a[i];
sum[i+1] = a[i] + sum[i];
}
ll res = inf;
reps(i, 1, n){
res = min(res, abs(sum[n]-2*sum[i]));
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long int;
struct Point {
Point(ll a, ll b) : x(a), y(b) {}
ll x = 0;
ll y = 0;
};
inline ll dist(const std::shared_ptr<Point>& a,
const std::shared_ptr<Point>& b) {
return std::abs(a->x - b->x) + std::abs(a->y - b->y);
}
inline int pos(const std::shared_ptr<Point>& pos,
const std::vector<std::shared_ptr<Point>>& checkpoints) {
ll min = dist(pos, checkpoints[0]);
int p = 1;
for (std::size_t i = 1; i < checkpoints.size(); ++i) {
const ll d = dist(pos, checkpoints[i]);
if (d < min) {
p = i + 1;
min = d;
}
}
return p;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0, m = 0;
std::cin >> n >> m;
std::vector<std::shared_ptr<Point>> students;
while (n--) {
ll a = 0, b = 0;
std::cin >> a >> b;
students.emplace_back(new Point(a, b));
}
std::vector<std::shared_ptr<Point>> checkpoints;
while (m--) {
ll a = 0, b = 0;
std::cin >> a >> b;
checkpoints.emplace_back(new Point(a, b));
}
for (const std::shared_ptr<Point>& p : students)
std::cout << pos(p, checkpoints) << std::endl;
return 0;
}
| 0
| 77,310,333
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define lrep(i,n,m) for(int i = n; i < m; i++)
using ll = long long;
using Vii = vector<vector<int> >;
using Gjudge = vector<vector<bool>>;
using Vi = vector<int>;
using Vl = vector<ll>;
using Vll = vector<vector<ll> >;
using Vs = vector<string>;
using Vb = vector<bool>;
using the = pair<int, int>;
using lthe = pair<ll, ll>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int Mod = static_cast<int>(1e9 + 7);
const int INF = INT_MAX;
const int dx[4] = { 1,0,-1,0 };
const int dy[4] = { 0,1,0,-1 };
int main()
{
int h, w;
cin >> h >> w;
Vs G(h);
queue<the> Q;
int bcnt = 0;
rep(i, h) cin >> G[i];
rep(i, h) {
rep(j, w) {
if (G[i][j] == '#') {
Q.push({ i,j });
bcnt++;
}
}
}
int ans = 0;
int cnt = 0;
int nbcnt = 0;
while (!Q.empty()) {
the v = Q.front();
Q.pop();
cnt++;
for (int i = 0; i < 4; i++) {
the nv = { v.first + dx[i],v.second + dy[i] };
if (nv.first < 0 || nv.first >= h || nv.second < 0 || nv.second >= w) continue;
if (G[nv.first][nv.second] == '#') continue;
Q.push(nv);
G[nv.first][nv.second] = '#';
nbcnt++;
}
if (bcnt == cnt) {
ans++;
cnt = 0;
bcnt = nbcnt;
nbcnt = 0;
}
}
ans--;
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 long long LL;
typedef pair<int, int> PII;
typedef pair<LL,LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI;
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<int>> PQLP;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EB emplace_back
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#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 SORTR(c) sort((c).rbegin(), (c).rend())
#define LB lower_bound
#define UB upper_bound
#define NEXP next_permutation
#define FI first
#define SE second
#define Vmin(a) *min_element((a).begin(),(a).end())
#define Vmax(a) *max_element((a).begin(),(a).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REPR(i,n) FORR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX/2;
const LL LINF = LLONG_MAX/3;
const int RINF = INT_MIN/2;
const LL RLINF = LLONG_MIN/3;
const LL MOD = 1e9+7;
const LL MODD = 998244353;
const int MAX = 510000;
inline bool Eq(double a, double b) { return fabs(b - a) < EPS; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define COUT(x) cout << (x) << endl
#define COUT2(x,y) cout << (x) << " " << (y) << endl
#define COUT3(x,y,z) cout << (x) << " " << (y) << " " << (z) << endl
#define PR(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
#define BC(x) __builtin_popcountll(x)
VI dx = {1,0,-1,0,1,1,-1,-1};
VI dy = {0,1,0,-1,1,-1,1,-1};
VC dc = {'R','D','L','U'};
VS ds = {"R","D","L","U","RD","RU","LD","LU"};
LL Gcd(LL a, LL b) {return __gcd(a,b);}
LL Lcm(LL a, LL b) {return a/Gcd(a,b)*b;}
LL ModPow(LL A, LL N, LL M){
LL res = 1;
while(N>0){
if(N&1) res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
template<class T> void VCout(vector<T> &v){
int N = SZ(v);
REP(i,N){
cout << v.at(i);
if(i == N-1) cout << endl;
else cout << " ";
}
return;
}
int main() {
cout << fixed << setprecision(12);
int n; cin >> n;
VI l(n);
REP(i,n) cin >> l.at(i);
int ans = 0;
while(Vmax(l) > 0){
int i = 0;
while(i < n){
if(l.at(i)==0){
i++;
continue;
}
ans++;
while(i < n && l.at(i)>0){
l.at(i++)--;
}
}
}
COUT(ans);
return 0;
}
| 0
| 88,160,045
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n;
string s;
cin >> n >> s;
s.erase(unique(s.begin(), s.end()), s.end());
cout << s.length();
}
int main()
{
fastio;
solve();
return 0;
}
|
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
const int INF = 1000100100;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int dp[105][4][2];
int main(){
string s; cin >> s;
int n = s.size();
int K; cin >> K;
dp[0][0][0] = 1;
rep(i,n) rep(j,4) rep(k,2){
int nd = s[i]-'0';
rep(d,10){
int ni = i+1, nj = j, nk = k;
if(d != 0) nj++;
if(nj > K) continue;
if(k == 0){
if(d>nd) continue;
if(d<nd) nk = 1;
}
dp[ni][nj][nk] += dp[i][j][k];
}
}
int ans = dp[n][K][0] + dp[n][K][1];
cout << ans << endl;
return 0;
}
| 0
| 85,662,285
|
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a,b;
int cnt=0;
int m[16]={0};
while(scanf("%d%d",&a,&b),a,b){
int ro[32][32]={{0}};
ro[0][1]=1;
int n;
scanf("%d",&n);
int x,y;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);
ro[y][x]=1;
}
for(int i=1;i<=b;i++){
for(int j=1;j<=a;j++){
if(ro[i][j]==1)ro[i][j]=0;
else ro[i][j]=(ro[i-1][j]+ro[i][j-1]);
}
}
m[cnt]=ro[b][a];
cnt++;
}
for(int i=0;i<cnt;i++){
printf("%d\n",m[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
#define MAXN 100000
using namespace std;
int par[MAXN];
int rank[MAXN];
void init(int n) {
for (int i=0; i<n; i++) {
par[i] = i;
rank[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
par[x] = find(par[x]);
return par[x];
}
}
void unite(int x,int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rank[x] < rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank[x] == rank[y]) {
rank[x]++;
}
}
}
bool same(int x,int y) {
return find(x) == find(y);
}
int main() {
int n, q;
cin >> n >> q;
init(n);
for (int i=0; i<q; i++) {
int com, x, y;
cin >> com >> x >> y;
switch (com) {
case 0:
unite(x,y);
break;
case 1:
printf("%d\n", same(x,y));
break;
default:
break;
}
}
return 0;
}
| 0
| 93,127,087
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, double> M;
bool compare_by_b(pair<int, double> a, pair<int, double> b) {
if(a.second != b.second){
return a.second < b.second;
}else{
return a.first < b.first;
}
}
int main(){
int h,n;
cin >> h >> n;
int a[n],b[n];
int dekai = -1;
vector<M> hoge;
for(int i = 0; i < n; i++){
int temp1,temp2;
cin >> temp1 >> temp2;
a[i] = temp1;
b[i] = temp2;
dekai = max(dekai,temp1);
}
int dp[h+dekai];
for(int i = 0; i < h+dekai ; i++){
dp[i] = MOD;
}
dp[0] = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < h+dekai;j++){
if(j+a[i] < h+ dekai){
dp[j+a[i]] = min(dp[j+a[i]],dp[j]+b[i]);
}
}
}
int ans = MOD;
for(int i = h; i < h+dekai;i++){
ans = min(ans,dp[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, std::vector<long long> A)
{
sort(A.begin(), A.end());
if (A[0] == 0)
{
cout << 0 << endl;
return;
}
ll ans = 1;
double res = 1;
for (ll i = 0; i < N; i++)
{
if (ans * A[i] > (ll)1e18 || res * A[i] > (ll)1e18)
{
ans = -1;
break;
}
ans *= A[i];
res *= A[i];
}
cout << ans << endl;
}
signed main()
{
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++)
{
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| 0
| 79,481,577
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
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 namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const int MOD = 1e9 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
rep (i, N) cin >> a[i];
int ans = (N - K) / (K - 1) + 1;
if ((N - K) % (K - 1) != 0) ans++;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main(){
ll h, n;
cin >> h >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
vector<ll> dp(h + 10, MAX);
rep(i, h) {
rep(j, n) {
if (i + 1 > a[j]) {
dp[i + 1] = min(dp[i + 1], dp[i + 1 - a[j]] + b[j]);
} else {
dp[i + 1] = min(dp[i + 1], b[j]);
}
}
}
cout << dp[h] << endl;
}
| 0
| 37,741,805
|
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(ll i=0;i< (n);i++)
#define rep1(i,n) for(ll i=1;i<= (n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const static ll MOD = 998244353;
ll modcross(ll a,ll n){
if(n == 0)return 0;
if(n % 2 == 1)return (a+modcross(a,n-1)) % MOD;
ll t = modcross(a,n/2) % MOD;
return t*2 % MOD;
}
ll modpow(ll a,ll n){
if(n == 0)return 1;
if(n % 2 == 1)return a*modpow(a,n-1) % MOD;
ll t = modpow(a,n/2) % MOD;
return t*t % MOD;
}
int main(){
ll n;cin>>n;
vector<ll> D(n,0);
rep(i,n)cin>>D[i];
map<ll,ll> mp;
rep(i,n){
mp[D[i]]++;
}
if(D[0] != 0 || mp[0] != 1){
cout<<'0'<<endl;
return 0;
}
ll ans = 1;
for(auto it = next(mp.begin(),1);it!=mp.end();it++){
if(prev(it,1)->first + 1< it->first){
cout<<'0'<<endl;
return 0;
}
ans = modcross(ans,modpow(prev(it,1)->second,it->second));
ans %= MOD;
}
cout<<ans%MOD<<endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
#include <stack>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T> void printvec(const vector<T>& v) {
for (auto x : v) { cout << x << " "; }
cout << endl;
}
template<class T> void printtree(const vector< vector<T> >& tree) {
for (long long i = 0; i < tree.size(); ++i) {
cout << i + 1 << ": "; printvec(tree[i]);
}
}
template<class T, class U> void printmap(const map<T, U>& mp) {
for (auto x : mp) { cout << x.first << "=>" << x.second << endl; }
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define sz(x) (ll)(x).size()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll INF = 1e15;
const ll MOD = 1000000007;
int main(int argc, char** argv) {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
ll n,k;
cin >> n >> k;
vector<ll> a(n);
rep(i,n) {
cin >> a[i];
}
ll ans = INF;
rep(i,1ll<<n) {
if (__builtin_popcountll(i) < k) { continue; }
ll h = 0;
ll now = 0;
rep(j,n) {
if (i>>j&1) {
if (h >= a[j]) {
now += h+1-a[j];
h = h+1;
}
}
chmax(h,a[j]);
}
chmin(ans,now);
}
cout << ans << endl;
}
| 0
| 90,503,440
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
string N;
cin >> N;
bool seven=false;
for (int i=0;i<3;i++) {
if(N[i]=='7') {
seven = true;
break;
}
}
if(seven==true) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include <stdio.h>
using namespace std;
int main(){
int N;
scanf("%d",&N);
int a,b,c;
for(int i = 0; i < N; ++i){
scanf("%d %d %d",&a,&b,&c);
if(a*a+b*b==c*c || a*a+c*c == b*b || b*b+c*c==a*a) {
printf("YES\n");
continue;
}
printf("NO\n");
}
return 0;
}
| 0
| 2,834,576
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
int main(){
LL ans = 0, u, v;
scanf("%d", &n);
for(LL i = 1; i <= n; i++){
ans += i * (n - i + 1);
}
for(int i = 1; i < n; i++){
scanf("%lld%lld", &u, &v);
if(v < u) swap(u, v);
ans -= u * (n - v + 1);
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
#define a first
#define b second
#define all(x) x.begin(), x.end()
vector<LL> div(LL X){
vector<LL> ret;
ret.pb(1);
for(LL d = 2; d * d <= X; d++){
if(X % d == 0){
ret.pb(d);
if(d * d != X) ret.pb(X / d);
}
}
if(X > 1) ret.pb(X);
sort(all(ret));
return ret;
}
int main(){
LL N;
scanf("%lld", &N);
vector<LL> divisors = div(N);
LL ans = 0;
for(auto &q : divisors){
LL m = N / q - 1;
if(m > q) ans += m;
}
printf("%lld\n", ans);
return 0;
}
| 0
| 19,403,467
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main() {
int n;
cin >> n;
bool ans = true;
int t,x,y;
int time = 0;
int dx = 0;
int dy = 0;
rep(i,n){
cin >> t >> x >> y;
time = abs(time-t);
dx = abs(dx - x);
dy = abs(dy - y);
if(time < (dx+dy)) ans = false;
if(time %2 != (dx+dy) %2 ) ans = false;
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using P = pair<int, int>;
int main(){
int n,k;
cin >> n >> k;
ll ans;
if(k%2 == 0){
ll l = 2*n/k;
ll o = (l+1)/2;
ll e = l/2;
ans = o*o*o + e*e*e;
}else{
ll l = n/k;
ans = l*l*l;
}
cout << ans << endl;
return 0;
}
| 0
| 99,633,373
|
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int n,s,ans;
void dfs(int k,int now,int m){
if(k==n){
if(now==s) ans++;
return;
}
rep(i,m+1,10){
dfs(k+1,now+i,i);
}
return;
}
signed main(){
while(1){
cin>>n>>s;
if(n+s==0) break;
ans=0;
dfs(0,0,-1);
o(ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int ans=1, a=0;
cin >> s;
for(int i=0; i<3; i++){
if(s[i]=='R'){
a=1;
if(s[i]==s[i+1]) ans++;
}
}
if(ans==1 && a==0){
cout << 0;
}else{
cout << ans;
}
return 0;
}
| 0
| 32,436,640
|
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <tuple>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <numeric>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int mill = 1;
for (int i = 1; i < 1000; i++) {
if (i % 3 == 0) {
mill += 20*10;
} else {
mill += 20*5 + 19*5;
}
}
for (int i = 0; i < n; i++) {
int y, m, d;
cin >> y >> m >> d;
int t = 0;
for (int i = 1; i < y; i++) {
if (i % 3 == 0) {
t += 20*10;
} else {
t += 20*5 + 19*5;
}
}
for (int i = 1; i < m; i++) {
if (i%2) {
t += 20;
} else {
if (y%3 != 0)t += 19;
else t+=20;
}
}
t += d;
cout << mill - t << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
map<char, bool> mp;
void solve(string s) {
bool now = mp[s.front()];
int cnt = 0;
FORE(e, s) {
cnt += now != mp[e];
now = mp[e];
}
cout << cnt << endl;
}
signed main(void) {
int n, m, p;
string s;
FORE(e, "qwertasdfgzxcvb") {
mp[e] = true;
}
FORE(e, "yuiophjklnm") {
mp[e] = false;
}
while (cin >> s) {
if (s == "#") return 0;
solve(s);
}
}
| 0
| 32,487,974
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
string tmp, p, q, o;
rep(i, n) {
cin >> tmp;
p += tmp;
}
rep(i, n) {
cin >> tmp;
q += tmp;
o += to_string(i + 1);
}
map<string, int> m;
int cnt = 1;
do {
m[o] = cnt;
cnt++;
} while(next_permutation(o.begin(), o.end()));
cout << abs(m[p] - m[q]) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define nxvarep(n,x,a) ll n,x;cin>>n>>x;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
#define cout15(a) printf("%.15f\n",a)
template<class T>inline bool chmin(T& a,T b,bool f){
if(f==1){if(a>b){a=b;return true;}return false;}
else if(f==0){if(a<b){a=b;return true;}return false;}return false;}
typedef pair<ll,string> p;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
int main (){
nvarep(n,a);
vector<ll>pl,mi;
rep(i,0,n){
if(i%2==0)pl.pb(a[i]);
else mi.pb(a[i]);
}
if(n%2==0){
reverse(range(mi));
rep(i,0,mi.size()){
cout<<mi[i];
cout<<spa;
}
rep(i,0,pl.size()){
cout<<pl[i];
if(i==pl.size()-1)break;
cout<<spa;
}
}else{
reverse(range(pl));
rep(i,0,pl.size()){
cout<<pl[i];
cout<<spa;
}
rep(i,0,mi.size()){
cout<<mi[i];
if(i==mi.size()-1)break;
cout<<spa;
}
}
cout<<nnn;
return 0;
}
| 0
| 16,844,753
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
int main() {
long long n, k;
cin >> n >> k;
double ans = 0.0;
for (long long num = 1; num <= n; num++) {
long long number = num;
long long index = 0;
while (number < k) {
index += 1;
number *= 2;
}
double plus = 1.0 / (double)n * pow(0.5, index);
ans += plus;
}
cout << fixed << setprecision(12) << ans << endl;
}
|
#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(){
ll n,k;
cin >> n >> k;
priority_queue<pll> pq;
rep(i,n){
ll t,d;
cin >> t >> d;
--t;
pq.push(pll(d,t));
}
priority_queue<pll,vector<pll>,greater<pll>> used;
vector<int> cnt(n,0);
ll c = 0;
ll res = 0;
rep(i,k){
res += pq.top().first;
if(cnt[pq.top().second] == 0) ++c;
cnt[pq.top().second] ++;
used.push(pq.top());
pq.pop();
}
ll ans = res + c * c;
while(!pq.empty() && !used.empty()){
bool ok = true;
while(cnt[pq.top().second]>0){
pq.pop();
if(pq.empty()){
ok = false;
break;
}
}
while(cnt[used.top().second]==1){
used.pop();
if(used.empty()){
ok = false;
break;
}
}
if(!ok) break;
res -= used.top().first;
cnt[used.top().second] --;
used.pop();
res += pq.top().first;
cnt[pq.top().second] ++;
pq.pop();
c++;
ans = max(ans,res + c * c);
}
cout << ans << endl;
return 0;
}
| 0
| 33,035,531
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
typedef long long int ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, int> pli;
typedef std::pair<ll, ll> pll;
#define FOR(i,n,m) for(ll i=(ll)(m);i<(ll)(n);++i)
#define REP(i,n) FOR(i,n,0)
#define IREP(i,n) for(ll i=(ll)(n);i>=0;--i)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
bool dpx[4000][8000];
bool dpy[4000][8000];
int main()
{
string S;
cin >> S;
int x, y;
cin >> x >> y;
vector<int> X, Y;
int n = 0;
int t = 0;
REP(i, S.length())
{
if (S[i] == 'F')
{
n++;
if (i != S.length() - 1)
{
continue;
}
}
t++;
if (t == 1)
{
x -= n;
n = 0;
continue;
}
if (n != 0)
{
if (t % 2 == 1)
{
X.push_back(n);
}
else
{
Y.push_back(n);
}
}
n = 0;
}
memset(dpx, 0, sizeof(dpx));
memset(dpy, 0, sizeof(dpy));
dpx[0][0] = dpy[0][0] = true;
ll max = 0;
FOR(i, X.size() + 1, 1)
{
ll m = max;
REP(j, max + 1)
{
if (dpx[i - 1][j])
{
m = std::max(m, std::max(j + X[i - 1], abs(j - X[i - 1])));
dpx[i][j + X[i - 1]] = dpx[i][abs(j - X[i - 1])] = true;
}
}
max = std::max(max, m);
}
max = 0;
FOR(i, Y.size() + 1, 1)
{
ll m = max;
REP(j, max + 1)
{
if (dpy[i - 1][j])
{
m = std::max(m, std::max(j + Y[i - 1], abs(j - Y[i - 1])));
dpy[i][j + Y[i - 1]] = dpy[i][abs(j - Y[i - 1])] = true;
}
}
max = std::max(max, m);
}
if (dpx[X.size()][abs(x)] && dpy[Y.size()][abs(y)])
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void){
string s;
cin >> s;
string div[4] = {"dream","dreamer","erase","eraser"};
reverse(s.begin(),s.end());
rep(i,4) reverse(div[i].begin(),div[i].end());
bool can = true;
for(int i=0;i<s.size();){
bool can2 = false;
rep(j,4){
string d = div[j];
if(s.substr(i,d.size()) == d){
can2 = true;
i += d.size();
}
}
if(can2 == false){
can = false;
break;
}
}
if(can) cout << "YES" << endl;
else cout << "NO" << endl;
}
| 0
| 91,011,828
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
#include<chrono>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define vint(a,n) vint a(n); rep(i, n) cin >> a[i];
#define vll(a,n) vll a(n); rep(i, n) cin >> a[i];
#define ALL(n) begin(n),end(n)
#define RALL(n) rbegin(n),rend(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vector<int>;
using vll=vector<ll>;
using vbool=vector<bool>;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
double n, m, d; cin >> n >> m >> d;
if(d!=0) printf("%.10lf\n", (double)(n-d)*(m-1)*2/(n*n));
else printf("%.10lf\n", (double)(n-d)*(m-1)/(n*n));
return 0;}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll N;
cin>>N;
vector<ll> pos(N,0);
for(ll i=0;i<N;i++){
ll curr;
cin>>curr;
curr--;
pos[curr]=i;
}
multiset<ll> ms;
ms.insert(-1);
ms.insert(-1);
ms.insert(N);
ms.insert(N);
ll ans=0;
for(ll i=N-1;i>=0;i--){
ll curr=pos[i];
ms.insert(curr);
auto it=ms.find(curr);
it--;
ll p1 = *it;
it--;
ll p2 = *it;
it++;it++;it++;
ll n1 = *it;
it++;
ll n2 = *it;
ll x=i+1;
ll count=(n2-n1)*(pos[i]-p1);
count+=(p1-p2)*(n1-pos[i]);
ans+=(x*count);
}
cout<<ans<<endl;
return 0;
}
| 0
| 47,855,873
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K;
cin >> N >> K;
int ans = 1e9;
for (int i = 1; i <= N; i++) {
int sum = 1;
for (int j = 1; j <= i; j++) {
sum *= 2;
}
sum += K*(N-i);
ans = min(ans, sum);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std ;
double a = 0 ;
double b = 0 ;
double c = 0 ;
double D = 0 ;
double R = 0 ;
double S = 0 ;
double L = 0 ;
double h = 0 ;
int main()
{
cin >> a >> b >> D ;
R = D * M_PI / 180.0 ;
c = sqrt( pow( a ,2 ) + pow( b ,2 ) - ( ( 2 * a * b ) * cos( R ) ) ) ;
L = a + b + c ;
h = b * sin( R ) ;
S = ( 1.0 / 2.0 ) * a * h ;
cout << fixed << setprecision(5) << S << endl << L << endl << h << endl ;
return 0 ;
}
| 0
| 12,944,611
|
#include <bits/stdc++.h>
using namespace std;
const int kN = 100'000 + 5;
const int kMod = 1'000'000'000 + 7;
int x[kN], y[kN];
int f(int *a, int n) {
int sum = 0, res = 0;
for (int i = 0; i < n; ++i) {
a[i] = (a[i] % kMod + kMod) % kMod;
int add = (1LL * a[i] * i + kMod - sum) % kMod;
(res += add) %= kMod;
(sum += a[i]) %= kMod;
}
return res;
}
int main() {
int n, m; scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) scanf("%d", &x[i]);
for (int i = 0; i < m; ++i) scanf("%d", &y[i]);
int ans = 1LL * f(x, n) * f(y, m) % kMod;
printf("%d\n", ans);
return 0;
}
|
#include <iostream>
int countPattern(int n) {
int count = 0;
int ni, ij, ijk;
for (int i = 0; i < 10; i ++) {
ni = n - i;
for (int j = 0; j < 10; j ++) {
ij = ni - j;
for (int k = 0; k < 10; k ++) {
ijk = ij - k;
if (0 <= ijk && ijk <= 9) {
count ++;
}
}
}
}
return count;
}
int main () {
int n;
while (std::cin >> n) {
std::cout << countPattern(n) << std::endl;
}
return 0;
}
| 0
| 55,444,658
|
#include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define pi pair<ll,ll>
#define pii pair<ll,pi >
#define ppi pair<pi,ll>
#define ppp pair<pi,pi >
#define ex(str,a,b) str.substr((int)(a),min((int)str.size()-a,(int)(b-a+1)))
#define all(X) X.begin(),X.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int M = (1<<20)+5;
const int md = 1e9+7;
priority_queue<ll,vector<ll >,greater<ll > > pq;
ll pwr(ll a,ll n,ll m)
{
ll p=1;
while(n>0)
{
if(n%2==1)
p=(p*a)%m;
a=(a*a)%m;
n=n/2;
}
return p;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n,k,s,i;
cin >> n >> k >> s;
if(k > 0)
{
if(s == (ll)(1e9))
{
for(i=1;i<=n-k;++i)
cout << 1 << " ";
for(i=1;i<=k;++i)
cout << s << " ";
}
else
{
for(i=1;i<=k;++i)
cout << s << " ";
for(i=1;i<=n-k;++i)
cout << s+1 << " ";
}
}
else
{
if(s == (ll)(1e9))
{
for(i=1;i<=n;++i)
cout << 1 << " ";
}
else
{
for(i=1;i<=n;++i)
cout << s+1 << " ";
}
}
cout << "\n";
}
| 0
| 100,407,520
|
#include <iostream>
#include <iomanip>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a <= c && c <= b ? "Yes" : "No") << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmin(T &a, T b) {
if (a > b) a = b; return true;
return false;
}
void solve(long long N, long long M, std::vector<long long> a, std::vector<long long> b, std::vector<long long> c, std::vector<long long> d){
REP(i, N) {
int ans = 0;
int mini = 2001001001;
REP(j, M) {
int dist = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (mini > dist) ans = j + 1;
chmin(mini, dist);
}
cout << ans << '\n';
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
scanf("%lld",&N);
long long M;
scanf("%lld",&M);
std::vector<long long> a(N);
std::vector<long long> b(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&a[i]);
scanf("%lld",&b[i]);
}
std::vector<long long> c(M);
std::vector<long long> d(M);
for(int i = 0 ; i < M ; i++){
scanf("%lld",&c[i]);
scanf("%lld",&d[i]);
}
solve(N, M, std::move(a), std::move(b), std::move(c), std::move(d));
return 0;
}
| 0
| 24,561,838
|
#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>;
const int mod = 998244353;
int main(int, char**)
{
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(_,k) {
vector<int> d(n, 0);
int endcntl = 0, endcntr = 0;
rep(i,n) {
int l = max(0, i-a[i]);
int r = min(n-1, i+a[i]);
d[l]++;
if (r+1 < n) d[r+1]--;
if (l==0) endcntl++;
if (r+1 >= n) endcntr++;
}
rep(i,n) {
if (!i) a[i] = d[i];
else a[i] = a[i-1] + d[i];
}
if (endcntl == n && endcntr == n) break;
}
rep(i,n) {
if (i) cout << " ";
cout << a[i];
}
cout << endl;
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<iterator>
#include<math.h>
#include<cstring>
using namespace std;
void lets_play()
{
int a,b,i;
cin>>a>>b;
if(a>=b)
{
for(i=1;i<=a;i++)
cout<<b;
cout<<endl;
}
else
{
for(i=1;i<=b;i++)
cout<<a;
cout<<endl;
}
}
int main()
{
lets_play();
}
| 0
| 70,163,299
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long double ld;
typedef long long ll;
typedef double db;
#define endl '\n'
#define pb push_back
#define pii pair<ll, ll>
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define optimize1() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#pragma warning(disable:4996)
using namespace std;
const ll MX = 5e4 + 10, INF = 1e9 + 1;
ll n;
vector<vector<int>> a;
vector<int> cur(20, 0);
bool can(int l) {
for (int i = 0; i <= 20; ++i)
if (cur[i] + a[l][i] == 2)
return false;
return true;
}
signed main() {
optimize1();
cin >> n;
a.resize(n);
int x;
for (int i = 0; i < n; ++i) {
cin >> x;
for (int j = 0; j <= 20; ++j) {
a[i].pb(x % 2);
x /= 2;
}
}
ll ans = 0, l = 0;
for (int i = 0; i < n; ++i) {
while (l < n && can(l)) {
for (int j = 0; j <= 20; ++j)
cur[j] += a[l][j];
l++;
}
ans += l - i;
for (int j = 0; j <= 20; ++j)
cur[j] -= a[i][j];
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <cmath>
#include <iterator>
#include <map>
#include <fstream>
#include <iomanip>
using namespace std;
const int MAX_N = 1000000;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define prec std::cout << std::fixed << std::setprecision(15);
#define endl "\n"
#define MOD 1000000007
#define Int int64_t
#define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define ssort(z) sort(z.begin(), z.end())
#define rsort(z) sort(z.rbegin(), z.rend())
#define eerase(z) z.erase(unique(z.begin(), z.end()), z.end())
#define ccnt(z, w) count(z.begin(), z.end(), w)
template <typename T>
void printV(const std::vector<T>& v, const char * const separator = " ")
{
if(!v.empty())
{
std::copy(v.begin(),
--v.end(),
std::ostream_iterator<T>(std::cout, separator));
std::cout << v.back() << "\n";
}
}
Int gcd(Int a, Int b) {
return b != 0 ? gcd(b, a % b) : a;
}
Int lcm(Int a, Int b) {
return a / gcd(a, b) * b;
}
int Max(int a, int b, int c) {
int temp = max(a, b);
return max(temp, c);
}
int Min(int a, int b, int c) {
int temp = min(a, b);
return min(temp, c);
}
bool integer(double num) {
return floor(num) == num;
}
Int fact(int num) {
if (num == 0)
return 1;
else
return num * fact(num - 1);
}
void y() {
cout << "Yes" << endl;
exit(0);
}
void n() {
cout << "No" << endl;
exit(0);
}
void Y() {
cout << "YES" << endl;
exit(0);
}
void N() {
cout << "NO" << endl;
exit(0);
}
Int yakusu(int n) {
int cnt = 0;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
if (i * i != n) cnt++;
}
}
return cnt;
}
int cnt = 0;
bool is_prime[ 50000 + 1 ];
vector<int> P;
void Eratosthenes( const int N )
{
for( int i = 0; i <= N; i++ )
{
is_prime[ i ] = true;
}
for( int i = 2; i <= N; i++ )
{
if( is_prime[ i ] )
{
for( int j = 2 * i; j <= N; j += i )
{
is_prime[ j ] = false;
}
P.emplace_back( i );
}
}
}
int main() {
IOS;
int n,a,b;
Int ans=0;
cin>>n>>a>>b;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin>>p[i];
}
int cnt1=0,cnt2=0,cnt3=0;
for (int j = 0; j < n ; ++j) {
if(p[j]<=a)cnt1++;
else if(p[j]<=b) cnt2++;
else cnt3++;
}
ans=min({cnt1,cnt2,cnt3});
cout<<ans;
cout<<endl;
return 0;
}
| 0
| 37,297,851
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
int main() {
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
bool ok = (x - r >= 0 && x + r <= w && y - r >= 0 && y + r <= h);
cout << (ok ? "Yes" : "No") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003;
template <typename T> inline bool chmin(T& x, const T& y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T& x, const T& y) {if (x < y) {x = y; return 1;} return 0;}
struct IOSET {IOSET() {cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> g(n);
rep(i, n - 1) {
int u, v;
cin >> u >> v;
--u; --v;
g[u].push_back(v); g[v].push_back(u);
}
if (n == 2) {
cout << (a[0] == a[1] ? "YES\n" : "NO\n");
return 0;
}
int root = -1;
rep(i, n) {
if (sz(g[i]) >= 2) root = i;
}
auto dfs = [&](auto f, int v, int p) -> ll {
if (sz(g[v]) == 1) return a[v];
ll sum = 0;
for (int u: g[v]) {
if (u == p) continue;
ll x = f(f, u, v);
if (x > a[v]) {
cout << "NO\n";
exit(0);
}
sum += x;
}
ll one = a[v] * 2 - sum;
ll two = a[v] - one;
if (one < 0 || two < 0 || one > a[v] || two > a[v]) {
cout << "NO\n";
exit(0);
}
return one;
};
cout << (dfs(dfs, root, -1) == 0 ? "YES\n" : "NO\n");
return 0;
}
| 0
| 10,871,059
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template<class T> struct edge { int from, to; T cost;};
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
int H,W,D;
vector<pair<int,int>> A;
vector<ll> ma;
int Q;
void input() {
cin >>H >>W >>D;
A.assign(H*W, {0, 0});
rep(i, H){ rep(j, W){
int a; cin >>a; a--;
A[a] = {i, j};
}}
ma.assign(H*W, 0);
for (int i=0; i<=D-1; i++){
int t = i;
while (t + D < H*W){
ma[t+D] = ma[t] + abs(A[t].first - A[t+D].first) + abs(A[t].second - A[t+D].second);
t += D;
}
}
cin >>Q;
}
void solve() {
int L,R; cin >>L >>R; L--; R--;
ll res = 0;
if (L == R){
cout <<res <<endl;
}else{
res = ma[R] - ma[L];
cout <<res <<endl;
}
}
int main() {
input();
rep(q, Q) solve();
}
|
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
void solve()
{
ll a,b,c,d,m,n,p,q,r,x,y,z,aa,bb,cc,dd,h;
ll i,j,k,l;
ll cnt=0,cnt1=0,cnt2=0,cnt3=0,sum=0,mx=LLONG_MIN,mn=LLONG_MAX;
ll flag=0,flag2=0;
vector <ll> vec1,vec2,vec3;
string s1,s2,s3;
cin >> a >> b;
FOR(i,a,b+1)
{
s1=to_string(i);
l = 0;
h=s1.size()-1;
flag=0;
while (h > l)
{
if (s1[l++] != s1[h--])
{
flag=1;
break;
}
}
if(!flag)
cnt++;
}
cout << cnt << endl;
}
int main()
{
RUN_FAST
ll t=1;
while(t--)
{
solve();
}
return 0;
}
| 0
| 48,331,377
|
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <bitset>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int n,k;
cin >> n >> k;
ll a[n];
rep(i,n) cin >> a[i];
ll ans = 1e12;
rep(i,1<<n){
ll tmp = 0;
int z = bitset<32>(i).count();
if (z<k)continue;
ll cur = 0;
rep(j,n){
if (i>>j & 1){
tmp += max(cur-a[j]+1,0LL);
cur = max(cur+1,a[j]);
}else {
cur = max(cur,a[j]);
}
}
ans = min(ans,tmp);
}
cout << ans << endl;
}
|
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include <queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int main() {
ll N;
cin >> N;
vector<ll> A(N);
vector<pair<ll, ll>> P(N);
vector<ll> L1(N), L2(N), R1(N), R2(N);
REP(i, 0, N) {
cin >> A[i];
P[i].first = A[i];
P[i].second = i;
}
sort(P.begin(), P.end(), [](const pair<ll, ll>& a, const pair<ll, ll>& b) {return a.first > b.first; });
set<ll,greater<ll>> tmp;
for (ll i = 0; i < N; ++i) {
auto l1 = tmp.upper_bound(P[i].second);
if (l1 == tmp.end()) {
L1[P[i].second] = -1;
L2[P[i].second] = -1;
}
else {
L1[P[i].second] = *l1;
auto l2 = tmp.upper_bound(*l1);
if (l2 == tmp.end()) L2[P[i].second] = -1;
else L2[P[i].second] = *l2;
}
tmp.insert(P[i].second);
}
set<ll> tmp2;
for (ll i = 0; i < N; ++i) {
auto r1 = tmp2.upper_bound(P[i].second);
if (r1 == tmp2.end()) {
R1[P[i].second] = N;
R2[P[i].second] = N;
}
else {
R1[P[i].second] = *r1;
auto r2 = tmp2.upper_bound(*r1);
if (r2 == tmp2.end()) R2[P[i].second] = N;
else R2[P[i].second] = *r2;
}
tmp2.insert(P[i].second);
}
ll ans = 0;
sort(P.begin(), P.end(), [](const pair<ll, ll>& a, const pair<ll, ll>& b) {return a.second < b.second; });
REP(i, 0, N) {
ans += (P[i].first) * (R1[P[i].second] - P[i].second) * (L1[P[i].second] - L2[P[i].second]);
ans += (P[i].first) * (R2[P[i].second] - R1[P[i].second]) * (P[i].second - L1[P[i].second]);
}
PRI(ans);
return 0;
}
| 0
| 81,945,047
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef _LOCAL_DEBUG
#include "templates/debug.h"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int& it : a)
cin >> it;
int j = 0;
ll cash = 1000;
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
cash += (ll)(a[i] - a[j]) * (cash / a[j]);
j = i + 1;
}
}
cash += (ll)(a[n - 1] - a[j]) * (cash / a[j]);
cout << cash << '\n';
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string S,T;
int x[10000],y[10000];
int dp[10000][10000];
char U[53]="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int MAXN;
int main(){
int q;
cin>>q;
for(int i=0;i<q;i++){
MAXN=0;
cin>>S>>T;
for(int i=0;i<S.size();i++){
for(int j=0;j<52;j++){
if(S[i]==U[j]){
x[i+1]=j;
}
}
}
for(int i=0;i<T.size();i++){
for(int j=0;j<52;j++){
if(T[i]==U[j]){
y[i+1]=j;
}
}
}
for(int i=0;i<=T.size();i++){
for(int j=0;j<=S.size();j++){
if(i==0 || j==0){
dp[i][j]=0;
}
else if(x[j]==y[i]){
dp[i][j]=dp[i-1][j-1]+1;
}
else{
dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
}
}
}
for(int i=0;i<=T.size();i++){
for(int j=0;j<=S.size();j++){
MAXN=max(MAXN,dp[i][j]);
}
}
cout<<MAXN<<endl;
}
return 0;
}
| 0
| 18,669,711
|
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define INFTY 2000000001
#define MAX 101
int n = 0;
int adl[MAX][MAX], deg[MAX];
int adm[MAX][MAX];
int main() {
scanf("%d", &n);
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < n; j++ ) {
adm[i][j] = 0;
}
}
for ( int i = 0; i < n; i++ ) {
int num;
scanf("%d", &num);
num--;
scanf("%d", °[num]);
for ( int j = 0; j < deg[num]; j++) {
scanf("%d", &adl[num][j]);
adl[num][j]--;
adm[num][adl[num][j]] = 1;
}
}
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < n-1; j++ ) {
printf("%d ", adm[i][j]);
}
printf("%d\n", adm[i][n-1]);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
string S;
cin >> S;
if (S == "keyence" || S.substr(0,7) == "keyence" || S.substr(S.size()-7,7) == "keyence") {
cout << "YES" << endl;
return 0;
}
vector<vector<string>> v = {
{"k", "eyence"},
{"ke", "yence"},
{"key", "ence"},
{"keye", "nce"},
{"keyen", "ce"},
{"keyenc", "e"},
};
string ans = "NO";
rep(i,0,v.size()-1) {
string l = v[i][0];
string r = v[i][1];
bool lok = false, rok = false;
if (S.substr(0,l.size()) == l && S.substr(S.size()-r.size(),r.size()) == r) {
ans = "YES";
}
}
cout << ans << endl;
return 0;
}
| 0
| 45,810,460
|
#include<cstdio>
using namespace std;
int s;
long long dp[2005];
int main() {
scanf("%d",&s);dp[0]=1;
for(int i=3;i<=s;++i) {
for(int j=0;j<=i-3;++j) {
dp[i]=(dp[i]+dp[j])%1000000007;
}
}
printf("%lld",dp[s]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
int n, s=1;
cin>> n;
int a[n];
cin>> a[0];
for(int i=1; i<n; i++)
{
cin>> a[i];
if( a[i]>= a[0])
{
s++;
a[0]= a[i];
}
}
cout << s;
nl;
return 0;
}
| 0
| 36,932,579
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,r,s,p;
string t;
cin>>n>>k>>r>>s>>p>>t;
long long kotae=0;
for(int i=0;i<n;i++){
if(i+k<n){
if(t[i]==t[i+k]){
t[i+k]='a';
}
}
if(t[i]=='r')kotae+=p;
else if(t[i]=='s')kotae+=r;
else if(t[i]=='p')kotae+=s;
}
cout<<kotae<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
typedef long long int int64;
const int N = (int) 2e4 + 100;
int a[N], b[N];
int p[N];
int main(int, char **)
{
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &p[i]);
p[i]--;
}
for (int i = 0; i < n; i++)
{
a[i] = (i + 1) * N;
b[i] = a[i];
}
reverse(b, b + n);
for (int i = 0; i < n; i++)
a[p[i]] += i;
for (int i = 0; i < n; i++)
printf("%d ", a[i]);
printf("\n");
for (int i = 0; i < n; i++)
printf("%d ", b[i]);
printf("\n");
return 0;
}
| 0
| 79,392,521
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
long long int l;
cin >> n >> l;
vector<long long int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int memo = -1;
for(int i=0; i+1<n; i++){
if(a[i] + a[i+1] >= l) memo = i+1;
}
if(memo == -1){
cout << "Impossible" << endl;
return 0;
}
cout << "Possible" << endl;
for(int i=1; i<memo; i++) cout << i << endl;
for(int i=n-1; i>memo; i--) cout << i << endl;
cout << memo << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> ans;
vector<vector<int>> g(200005,vector<int> (0));
void dfs(int v,int p){
for(auto i:g[v]){
if(i==p) continue;
ans[i] += ans[v];
dfs(i,v);
}
}
int main(){
int n,q;
cin >> n >> q;
ans.resize(n);
rep(i,n-1){
int a,b;
cin >> a >> b;
a--;b--;
g[a].push_back(b);
g[b].push_back(a);
}
rep(i,q){
int p1,x1;
cin >> p1 >> x1;
p1--;
ans[p1] += x1;
}
dfs(0,-1);
rep(i,n) cout << ans[i] << ' ';
cout << endl;
}
| 0
| 53,900,097
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.