code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include "bits/stdc++.h"
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef pair<ll, ll> pll;
template<typename T>
const T INF = (is_same<T, int>::value ? 1e9 : 1e18);
template<typename T>
inline T mod(T n, T mod){ T res = n%mod; if(res < 0) res += mod; return res; }
int main(){
fastio;
int n;
cin >> n;
vector<double> v(n);
double sum = 0;
for(auto& x : v){
cin >> x;
sum += (1/x);
}
cout << setprecision(10) << fixed << 1/sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
while(1){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if(m==0) break;
int cur,prev;
cin >> prev;
int pmax=0,gmax=0;
for(int i=1; i<m; i++){
cin >> cur;
if(nmin<=i && i<=nmax){
int gap = prev-cur;
if(gap >= gmax){
gmax = gap;
pmax = i;
}
}
prev = cur;
}
cout << pmax << endl;
}
return 0;
}
| 0
| 7,331,289
|
#define _GLIBCXX_DEBUG
#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;
int main() {
int s, w;
cin >> s >> w;
cout << ((s <= w) ? "unsafe" : "safe") << endl;
}
|
#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <climits>
#include <stack>
#include <queue>
#include <set>
#include <cctype>
#include <bitset>
#include <type_traits>
#include <list>
using namespace std;
#define REP(i, n) for (long long i = 0; i < (n); ++i)
#define rep(i, a, b) for (long long i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
int main(void)
{
long long h, w;
cin >> h >> w;
long long minv = 1e16;
for (long long i = 1; i < h; i++)
{
long long s[3];
s[0] = i * w;
s[1] = (w / 2) * (h - i);
s[2] = h * w - s[0] - s[1];
sort(s, s + 3);
if (minv > s[2] - s[0])
minv = s[2] - s[0];
if ((h - i) < 2)
continue;
s[0] = i * w;
s[1] = w * ((h - i) / 2);
s[2] = h * w - s[0] - s[1];
sort(s, s + 3);
if (minv > s[2] - s[0])
minv = s[2] - s[0];
}
swap(h, w);
for (long long i = 1; i < h; i++)
{
long long s[3];
s[0] = i * w;
s[1] = (w / 2) * (h - i);
s[2] = h * w - s[0] - s[1];
sort(s, s + 3);
if (minv > s[2] - s[0])
minv = s[2] - s[0];
if ((h - i) < 2)
continue;
s[0] = i * w;
s[1] = w * ((h - i) / 2);
s[2] = h * w - s[0] - s[1];
sort(s, s + 3);
if (minv > s[2] - s[0])
minv = s[2] - s[0];
}
cout << minv << endl;
}
| 0
| 31,157,351
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n, k;
cin >> n >> k;
set<int> st;
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
int a;
cin >> a;
st.insert(a);
}
}
int ans = n - st.size();
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N
#define bit(x,y) ((x>>y)&1LL)
#define loop(x) for(int xv=1; xv<=x; xv++)
#define what_is(x) cerr << #x << " is " << x << endl;
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
return os << '(' << a.first << ", " << a.second << ')';
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &a) {
os << '[';
for (unsigned int i = 0; i < a.size(); i++)
os << a[i] << (i < a.size() - 1 ? ", " : "");
os << ']';
return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &a) {
os << '{';
for (typename set<T>::iterator it = a.begin(); it != a.end(); it++) {
typename set<T>::iterator jt = it;
os << *it << (++jt != a.end() ? ", " : "");
}
os << '}';
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, map<T1, T2> &a) {
os << "{\n";
for (typename map<T1, T2>::iterator it = a.begin(); it != a.end(); it++) {
typename map<T1, T2>::iterator jt = it;
os << " " << it->first << ": " << it->second << (++jt != a.end() ? ",\n" : "\n");
}
os << '}';
return os;
}
int n;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
bool equal = true;
int sum = 0; int mn = 2e9;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
if (x != y) equal = false;
sum += x;
if (x > y)
mn = min(mn, y);
}
if (equal) cout << 0 << endl;
else cout << sum - mn << endl;
}
| 0
| 48,187,245
|
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < m; i++) {
int x; cin >> x;
mp[x] = 1;
}
vector<long long> fibo(2);
fibo[0] = 0;
fibo[1] = 1;
long long md = 1e9 + 7;
for (int i = 1; i <= n; i++) {
long long x = fibo[0] + fibo[1];
fibo[0] = fibo[1];
if (mp.count(i)) {
x = 0;
}
fibo[1] = x % md;
}
cout << fibo[1] << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } }
typedef pair<ll, ll> P;
ll modnum = 1000000000+7;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
string l; cin >> l;
ll ans = 0;
ll tmpans = 1;
rep(i, l.size()) {
int n = l[i] - '0';
if(n == 1) {
ll x = modpow(3, l.size()-1-i, modnum);
ans += x * tmpans;
ans %= modnum;
tmpans *= 2;
tmpans %= modnum;
}
}
ans += tmpans;
ans %= modnum;
cout << ans << endl;
return 0;
}
| 0
| 19,987,375
|
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <list>
using namespace std;
#define FOR( i, k, n ) for ( int i = ( k ); i < ( int )( n ); ++i )
#define REP( i, n ) FOR( i, 0, n )
typedef long long ll;
typedef pair< int, int > P;
int main()
{
int N, M;
while( cin >> N >> M, N || M ) {
priority_queue< P > que;
REP( i, N ) {
int d, p;
cin >> d >> p;
que.push( P( p, d ) );
}
int ans = 0;
while( !que.empty() ) {
int d = que.top().second, p = que.top().first; que.pop();
if( M >= d ) M -= d;
else if( M > 0 ) {
ans += ( d - M ) * p;
M = 0;
}
else ans += d * p;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
void solve(){
int n;
cin >> n;
Vi a(n+1),b(n);
rp(i,n+1) cin >> a.at(i);
rp(i,n) cin >> b.at(i);
ll sum=0;
rp(i,n){
if(b[i]>=a[i]){
b[i]-=a[i];
sum+=a[i];
}else{
sum+=b[i];
b[i]=0;
}
if(a[i+1]>=b[i]){
a[i+1]-=b[i];
sum+=b[i];
}else{
sum+=a[i+1];
a[i+1]=0;
}
}
print(sum);
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
}
| 0
| 8,241,890
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string a, b;
cin >> a >> b;
if (a.size() > b.size()) cout << "GREATER" << endl;
else if (a.size() < b.size()) cout << "LESS" << endl;
else {
REP(i,a.size()) {
if (a[i] > b[i]) {
cout << "GREATER" << endl;
break;
}
else if (a[i] < b[i]) {
cout << "LESS" << endl;
break;
}
if (i == a.size() - 1 && a[i] == b[i]) {
cout << "EQUAL" << endl;
}
}
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <functional>
#include <cctype>
#include <locale>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
typedef pair<int,int> P;
typedef pair<long long,long long> Pll;
#define fout(num) cout << fixed << setprecision(20) << (num) << endl
signed main(){
ll a,b,c; cin >> a >> b >> c;
ll res=0;
rep(i,1001001){
res+=a;
if(res%b==c){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
}
| 0
| 59,910,911
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
int main() {
string s; cin >> s ;
int w ; cin >> w ;
rep(i,(s.size()+w-1)/w){
cout<<s[i*w];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> data(n);
for (int i=0;i<n;i++){
int tmp;
cin>>tmp;
data.at(i)=tmp;
}
vector<int> count(200001,0);
for (int i=0;i<n;i++){
count.at(data.at(i))++;
}
sort(count.begin(),count.end());
int plusindex;
for (int i=0;i<=200000;i++){
if (count.at(i)>0){
plusindex=i;
break;
}
}
int kinds=200000-plusindex+1;
int answer=0;
if (kinds<=k){
answer=0;
}
else {
for (int i=plusindex;i<=200000-k;i++){
answer+=count.at(i);
}
}
cout<<answer<<endl;
}
| 0
| 19,304,626
|
#include <bits/stdc++.h>
#define trace1(a) cout<<#a<<": "<<a<<endl
#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)
#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)
#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)
#define trace5(a,b,c,d,e) cout<<#a<<": "<<a<<" | ", trace4(b,c,d,e)
#define trace6(a,b,c,d,e,f) cout<<#a<<": "<<a<<" | ", trace5(b,c,d,e,f)
#define trace7(a,b,c,d,e,f,g) cout<<#a<<": "<<a<<" | ", trace6(b,c,d,e,f,g)
#define trace8(a,b,c,d,e,f,g,h) cout<<#a<<": "<<a<<" | ", trace7(b,c,d,e,f,g,h)
#define trace9(a,b,c,d,e,f,g,h,i) cout<<#a<<": "<<a<<" | ", trace8(b,c,d,e,f,g,h,i)
#define trace10(a,b,c,d,e,f,g,h,i,j) cout<<#a<<": "<<a<<" | ", trace9(b,c,d,e,f,g,h,i,j)
#define rep(i,a,b) for(int (i)=(int)(a);(i)<(int)(b); ++(i))
#define reps(i,a,b,c) for(int (i)=(int)(a);(i)<(int)(b); (i)+=(c))
#define rrep(i,a,b) for(int (i)=(int)(a);(i)>=(int)(b);--(i))
#define rreps(i,a,b,c) for(int (i)=(int)(a);(i)>=(int)(b);(i)-=(c))
#define fore(x,a) for(auto &x:a)
#define foreach(i,a) for(auto i=(a).begin(); i!=(a).end(); ++i)
#define rforeach(i,a) for(auto i=(a).rbegin();i!=(a).rend();++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define isin(i,a,b) ((a) <= (i) && (i) <= (b))
#define uni(a) (a).erase(unique(all(a)),(a).end())
#define dup(x,y) (((x)+(y)-1)/(y))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(a) ((long long)(a).size())
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long; using vi = vector<int>;
using unit= unsigned; using vl = vector<ll>;
using ull = unsigned long long; using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int,int>; using vpii= vector<pii>;
using pil = pair<int,ll>; using vpil= vector<pil>;
using pli = pair<ll,int>; using vpli= vector<pli>;
using pll = pair<ll,ll>; using vpll= vector<pll>;
void _main(); int main(){ cin.tie(0); ios::sync_with_stdio(false); _main(); }
template<class T>string join(const v(T)&v){ stringstream s; rep(i,0,sz(v))s<<' '<<v[i]; return s.str().substr(1); }
template<class T>istream &operator>>(istream&i, v(T)&v){ fore(x,v){ i >> v; } return i; }
template<class T>ostream &operator<<(ostream&o, const v(T)&v){ o<<"["; fore(x,v)o<<x<<","; o<<"]"; return o; }
template<class T>ostream &operator<<(ostream&o, const deque<T>&v){ o<<"deq["; fore(x,v)o<<x<<","; o<<"]"; return o; }
template<class T>ostream &operator<<(ostream&o, const set<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }
template<class T>ostream &operator<<(ostream&o, const unordered_set<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }
template<class T>ostream &operator<<(ostream&o, const multiset<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }
template<class T>ostream &operator<<(ostream&o, const unordered_multiset<T>&v){ o<<"{"; fore(x,v)o<<x<<","; o<<"}"; return o; }
template<class T1,class T2>ostream &operator<<(ostream &o, const pair<T1,T2>&p){ o<<"("<<p.fi<<","<<p.se<<")"; return o; }
template<class TK,class TV>ostream &operator<<(ostream &o, const map<TK,TV>&m){ o<<"{"; fore(x,m)o<<x.fi<<"=>"<<x.se<<","; o<<"}"; return o; }
template<class TK,class TV>ostream &operator<<(ostream &o, const unordered_map<TK,TV>&m){ o<<"{"; fore(x,m)o<<x.fi<<"=>"<<x.se<<","; o<<"}"; return o; }
template<class T>void YES(T c){ if(c) cout<<"YES"<<endl; else cout<<"NO"<<endl; }
template<class T>void Yes(T c){ if(c) cout<<"Yes"<< endl; else cout<<"No"<<endl; }
template<class T>void POSS(T c){ if(c) cout<<"POSSIBLE"<<endl; else cout<<"IMPOSSIBLE"<<endl; }
template<class T>void Poss(T c){ if(c) cout<<"Possible"<<endl; else cout<<"Impossible"<<endl; }
template<class T>bool chmax(T &a,const T &b){ return a<b?(a=b,true):false; }
template<class T>bool chmin(T &a,const T &b){ return a>b?(a=b,true):false; }
template<class T>T gcd(T a,T b){ return b?gcd(b,a%b):a; }
template<class T>T lcm(T a,T b){ return a/gcd(a,b)*b; }
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = 1001002003;
const ll LINF= 1001002003004005006LL;
const int dx[] = { -1, 0, 1, 0 , -1,-1, 1, 1 };
const int dy[] = { 0, 1, 0,-1 , -1, 1,-1, 1 };
void _main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
v(string) s(h);
rep(i,0,b) s[i] = string(a,'0') + string(w-a,'1');
rep(i,b,h) s[i] = string(a,'1') + string(w-a,'0');
fore(x,s) cout << x << endl;
}
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
rep(i, 1000) {
int s = i * b + c;
if (s % a == 0) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| 0
| 42,260,437
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const double EPS = 1e-10;
const ll INF = 100000000;
const ll MOD = 1000000007;
int n;
ll a[200000];
bool solve(int m) {
vector<P> v;
for (int i = 1; i < n; i++) {
if (a[i-1] < a[i]) continue;
if (m == 1) return false;
bool flag = false;
for (int j = (int)v.size()-1; j >= 0; j--) {
if (v[j].first > a[i]) {
v.pop_back();
} else if (v[j].first == a[i]) {
v[j].second++;
int pos = j;
while (v[pos].second == m+1) {
if (v[pos].first == 1) return false;
if (pos == 0 || v[pos-1].first+1 != v[pos].first) {
int t = v[pos].first;
v.pop_back();
v.push_back(P(t-1, 2));
break;
} else {
v.pop_back();
pos--;
v[pos].second++;
}
}
flag = true;
break;
} else {
v.push_back(P(a[i], 2));
flag = true;
break;
}
}
if (!flag) v.push_back(P(a[i], 2));
}
return true;
}
int main() {
cin >> n;
rep(i,n) cin >> a[i];
int st = 0, en = n, mid;
while (en-st > 1) {
mid = (st + en) / 2;
if (solve(mid)) en = mid;
else st = mid;
}
cout << en << endl;
}
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
vector<string> ans;
int main(){
while(1){
string str;
getline(cin,str);
if(str == ".")break;
vector<int> hmk;
vector<int> hkk;
bool balance = true;
for(int i = 0;i < str.size();i++){
if(!balance) break;
if(str[i] == '(') hmk.push_back(i);
if(str[i] == '[') hkk.push_back(i);
if(str[i] == ')'){
if(hmk.size() == 0) balance = false;
else{
for(int j = 0;j < hkk.size();j++){
if(hmk.back() < hkk[j]){balance = false;break;}
}
hmk.pop_back();
}
}
if(str[i] == ']'){
if(hkk.size() == 0) balance = false;
else{
for(int j = 0;j < hmk.size();j++){
if(hkk.back() < hmk[j]){balance = false;break;}
}
hkk.pop_back();
}
}
}
string yn;
if(hmk.size() == 0 && hkk.size() == 0 && balance) yn = "yes";
else yn = "no";
ans.push_back(yn);
}
for(int i = 0;i < ans.size();i++){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 89,373,540
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,n,k;
cin>>x>>n;
set<int> s;
for(int i=0;i<n;i++){
cin>>k;
s.insert(k);
}
int index;
int mm=INT_MAX;
for(int i=x;i>=-1000;i--){
if(s.count(i)==0){
if(mm>abs(x-i)){
mm=abs(x-i);
index=i;
break;
}
}
}
for(int i=x;i<=1000;i++){
if(s.count(i)==0){
if(mm>abs(x-i)){
mm=abs(x-i);
index=i;
break;
}
}
}
cout<<index;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100010;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<int> depth;
vector<int> score;
vector<int> p, x;
void search_depth(const Graph &G, int v, int parent, int dep){
depth[v] = dep;
for(auto next_v : G[v]){
if(next_v == parent) continue;
search_depth(G, next_v, v, dep + 1);
}
}
void dfs(const Graph &G, int v, int parent){
seen[v] = true;
score[v] += score[parent];
for(auto next_v : G[v]){
if(seen[next_v]) continue;
dfs(G, next_v, v);
}
}
int main(){
int n, q; cin >> n >> q;
Graph G(n);
depth.resize(n);
seen.resize(n);
p.resize(q);
x.resize(q);
score.resize(n);
rep(i, n) score[i] = 0;
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){
cin >> p[i] >> x[i];
p[i]--;
}
depth.assign(n, 0);
search_depth(G, 0, -1, 0);
rep(i, q) score[p[i]] += x[i];
dfs(G, 0, -1);
rep(i, n){
if(i == n - 1){
cout << score[i] << endl;
return 0;
}
cout << score[i] << " ";
}
}
| 0
| 40,155,191
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
int ctoi(char c) {
switch (c) {
case '0': return 0; case '1': return 1; case '2': return 2;
case '3': return 3; case '4': return 4; case '5': return 5;
case '6': return 6; case '7': return 7; case '8': return 8;
case '9': return 9; default: return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
return firstElof.second < secondElof.second;
}
ll i, j, k, l, m, n; ll N, M, K, H, W, L;
ll MOD = 1000000007; ll INF = 9999999999999; ll ans = 0;
vl flag, color; vll path; vl D;
int main() {
cin >> N >> M;
vl A = {0,0,0,0,0,0,0,0,0};
for (i = 0; i < M; i++) {
ll a;
cin >> a;
a--; A[a] = 1;
}
vl dp(N + 1);
for (i = 0; i <= N; i++) {
dp[i] = -1;
}
dp[0] = 0;
vl cost = { 2,5,5,4,5,6,3,7,6 };
for (i = 0; i < N; i++) {
if (i != 0 && dp[i] == -1)continue;
for (j = 0; j < 9; j++) {
if (A[j] && i+cost[j]<=N) {
if (dp[i] + 1 > dp[i + cost[j]]) {
dp[i + cost[j]] = dp[i] + 1;
}
}
}
}
ll use = 8;
string S = "";
while (N > 0 && use>=0) {
while (!A[use])use--;
if (use < 0)break;
if (N - cost[use] < 0) {
use--;
}
else if (dp[N - cost[use]] == dp[N] - 1) {
char p = '1' + use;
S += p;
N -= cost[use];
}
else {
use--;
}
}
cout << S;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll> cur;
rep(i, x) rep(j, y) { cur.push_back(a[i] + b[j]); }
sort(cur.begin(), cur.end(), greater<>());
if (cur.size() > k) cur.resize(k);
vector<ll> res;
rep(i, cur.size()) rep(j, z) { res.push_back(cur[i] + c[j]); }
sort(res.begin(), res.end(), greater<>());
rep(i, k) { cout << res[i] << endl; }
return 0;
}
| 0
| 22,833,030
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
using matrix = vector<vector<uint>>;
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, M = 0;
cin >> N;
vector<int> x(N);
for (int i = 0; i < N; ++i)
cin >> x[i];
while (N >> M)
M++;
int L;
cin >> L;
vector<vector<ll>> nxt(M, vector<ll>(N, N - 1));
for (int i = 0; i < N; ++i)
nxt[0][i] = upper_bound(x.begin(), x.end(), x[i] + L) - x.begin() - 1;
for (int i = 0; i + 1 < M; ++i)
for (int j = 0; j < N; ++j)
nxt[i + 1][j] = nxt[i][nxt[i][j]];
int Q;
cin >> Q;
for (int i = 0; i < Q; ++i) {
int a, b, res = 0;
cin >> a >> b;
a--, b--;
if (a == b) {
cout << res << '\n';
continue;
}
if (a > b)
swap(a, b);
for (int j = M - 1; j >= 0; --j) {
if (nxt[j][a] < b) {
a = nxt[j][a];
res += (1 << j);
}
}
cout << res + 1 << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#define ull uint64_t
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mx5 100005
#define mx6 1000005
#define mod 1000000007
#define nfs ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main() {
nfs
int i, j, n;
cin >> n;
vector <pair<int,int>> dp((1 << n), {0, 0});
for (i = 0; i < (1 << n); i++) {
cin >> dp[i].ff;
}
for (i = 0; i < n; i++) {
for (int mask = 0; mask < (1 << n); mask++) {
if (mask & (1 << i)) {
int a[2] = {dp[mask ^ (1 << i)].ff, dp[mask ^ (1 << i)].ss};
for (j = 0; j < 2; j++) {
if (a[j] > dp[mask].ss) {
dp[mask].ss = a[j];
if(dp[mask].ss > dp[mask].ff)
swap(dp[mask].ff, dp[mask].ss);
}
else break;
}
}
}
}
int out = dp[0].ff + dp[0].ss;
for (i = 1; i < (1 << n); i++) {
cout << (out = max(out, dp[i].ff + dp[i].ss)) << " ";
}
}
| 0
| 63,105,066
|
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main() {
int n;
cin >> n;
vector<int>x(n);
rep(i,n) cin >> x.at(i);
int ans = 1000000000;
for(int i=0;i<=100;i++){
int sum = 0;
rep(j,n){
int num = (x.at(j) - i)*(x.at(j) - i);
sum += num;
}
ans = min(ans,sum);
}
cout << ans << endl;
}
|
/*http:
#include <iostream>
#include <vector>
#include <algorithm>
#define MAX 999999
using namespace std;
int num_prime[MAX];
bool not_prime_flag[MAX];
int main()
{
int n;
int max_input;
vector<int> input;
while (cin>>n){
input.push_back(n);
}
max_input=*max_element(input.begin(),input.end());
for (int i = 1; i < max_input; ++i) {
if(!not_prime_flag[i]){
for (int j = 2; (i+1)*j-1 < max_input; ++j) {
not_prime_flag[(i+1)*j-1] = true;
}
}
num_prime[i]=num_prime[i-1]+!not_prime_flag[i];
}
for (int i:input) {
cout<<num_prime[i-1]<<endl;
}
return 0;
}
| 0
| 11,334,193
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N;
vector<int> a;
bool judge(){
sort(a.begin(),a.end());
int diam=a[N-1];
int mia=0;
if(diam%2) mia=(diam+1)/2;
else mia=diam/2;
if(a[N-1]!=diam||a[0]!=mia) return false;
int numOfMia=0;
for(int i=0;i<N;i++){
if(a[i]!=mia) break;
numOfMia++;
}
if(diam%2&&numOfMia!=2) return false;
if(diam%2==0&&numOfMia!=1) return false;
int num[N+10]={};
for(int i=0;i<N;i++) num[a[i]]++;
for(int i=mia+1;i<=diam;i++){
if(num[i]<2) return false;
}
return true;
}
int main(){
cin>>N;
for(int i=0;i<N;i++){
int x;
cin>>x;
a.push_back(x);
}
if(judge()) cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
return 0;
}
|
#include <vector>
#include <math.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <deque>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<long, long>;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define rep(i, n) for(int i = 0; i<n; i++)
#define rep_s(i, start, n) for(int i= start; i<n; i++)
#define ALL(a) (a).begin(), (a).end()
string alphabet_upper = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string alphabet_lower = "abcdefghijklmnopqrstuvwxyz";
int keta_sum(int num){
int dig, sum = 0;
while(num){
dig = num % 10;
sum = sum + dig;
num = num / 10;
}
return sum;
}
int main(void){
ll N, A, B, W, H, C, D;
cin >> A >> B;
int grid[102][102];
rep(i, 102) rep(j, 102) grid[i][j] =-1;
rep_s(i, 1, 51) rep_s(j, 1, 101) grid[i][j] = 1;
rep_s(i, 1, 51) rep_s(j, 1, 101) grid[i+50][j] = 0;
int count_a = 0, count_b = 0;
rep_s(i,1, 50) {
rep_s(j, 1, 101) {
if (count_a == A-1) goto Next;
if (grid[i-1][j]!=0 && grid[i][j-1]!=0 && grid[i+1][j]!=0 && grid[i][j+1]!=0){
if (grid[i-1][j-1]!=0 && grid[i-1][j+1]!=0 && grid[i+1][j-1]!=0 && grid[i+1][j+1]!=0){
grid[i][j] = 0;
count_a++;
}
}
}
}
Next:
rep_s(i,52, 101) {
rep_s(j, 1, 101) {
if (count_b == B-1) goto finished;
if (grid[i-1][j]!=1 && grid[i][j-1]!=1 && grid[i+1][j]!=1 && grid[i][j+1]!=1){
if (grid[i-1][j-1]!=1 && grid[i-1][j+1]!=1 && grid[i+1][j-1]!=1 && grid[i+1][j+1]!=1){
grid[i][j] = 1;
count_b++;
}
}
}
}
finished:
cout << 100 << " " << 100 << endl;
rep_s(i, 1, 101){
rep_s(j, 1, 101){
if (grid[i][j] == 0) cout << ".";
else if (grid[i][j] == 1) cout <<"#";
}
cout << endl;
}
}
| 0
| 99,464,060
|
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr int inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#pragma endregion
signed main() {
int k,s;cin >> k >> s;
int count = 0;
for(int i = 0;i<=k;i++) {
for(int j = 0;j<=k;j++) {
if(s-i-j<=k&&i+j<=2*k&&s-i-j>=0) {
count++;
}
}
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i,idx,k,j,n,a[100000],mx=0;
map<long long int,long long int>m;
vector<long long int>v;
cin>>n;
idx=0;
for(i=0;i<n;i++){cin>>a[i];}
sort(a,a+n,greater<int>());
for(i=0;i<n;i++){m[a[i]]++;}
for(j=0;j<n;j++){
if(m[a[j]]>=4){
if(idx==0){v.push_back(a[j]);
v.push_back(a[j]);idx=1;m[a[j]]=-1;}
else{v.push_back(a[j]);m[a[j]]=-1;}
}
else if(m[a[j]]>=2&&m[a[j]]<=3){
v.push_back(a[j]);m[a[j]]=-1;idx=1;
}
}
if(v.size()<2){cout<<"0\n";}
else{cout<<v[0]*v[1]<<endl;}
}
| 0
| 72,559,464
|
#include<iostream>
using namespace std;
int doro[20][20];
int ans = 0, a, b;
int jud(int x, int y)
{
if (x>a||y>b)return 0;
if (doro[x][y] == 1)return 0;
if (x == a&&y == b)return 1;
if (a>x)ans += jud(x + 1, y);
if (b>y)ans += jud(x, y + 1);
return 0;
}
int main()
{
int num, x, y;
while (1)
{
ans = 0;
for (int i = 0; i < 20; i++)
for (int q = 0; q < 20; q++)
doro[i][q] = 0;
cin >> a >> b;
if (a == 0 && b == 0)break;
cin >> num;
for (int i = 0; i < num; i++)
{
cin >> x >> y;
doro[x][y] = 1;
}
jud(1, 1);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int>P;
int main() {
ll a,b,c;
cin>>a>>b>>c;
for(int i=0;i<b;i++){
cout<<c<<" ";
}
for(int j=0;j<a-b;j++){
if(j==(a-b-1)){
if(c>2){
cout<<c-1<<endl;
}
else{
cout<<c+1<<endl;
}
}
else {
if(c>2){
cout<<c-1<<" ";
}
else{
cout<<c+1<<" ";
}
}
}
}
| 0
| 28,050,718
|
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
void swap(int a,int b) {
int tmp = a;
a = b;
b = tmp;
}
int main(void) {
string s;
cin >>s;
int a = s.size();
for (int i = 0; i < (a - 1) / 2; i++) {
if (s[i] != s[a-i-1]) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < (a - 1) / 4;i++) {
if (s[i] != s[(a - 1) / 2 -i-1]) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < (a - 1) / 4; i++) {
if (s[i+ ((a - 1) / 2)+1] != s[a-i-1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes"<< endl;
return 0;
}
|
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
string s;
long long k,c=0,ans=0;
cin>>s>>k;
f(i,0,s.size()){
if(s[i]=='1'){
c++;
}
else{
ans=i;
break;
}
}
if(c>=k){
cout<<'1'<<endl;
}
else{
cout<<s[ans]<<endl;
}
return 0;
}
| 0
| 98,066,738
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, sum = 0;
cin >> a >> b;
sum = a + b;
if (sum % 3 == 0)
cout << "Possible"<<endl;
else if (sum == 0)
cout << "Impossible"<<endl;
else if (b % 3 == 0 || a % 3 == 0)
cout << "Possible"<< endl;
else
cout << "Impossible"<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random>
#include<stdlib.h>
#define rip(i,n) for(int i=0;i<n;i++)
#define Rip(i,n) for(int i=1;i<=n;i++)
#define RIP(i,a,b) for(int i=a;i<b;i++)
#define all(V) V.begin(),V.end()
#define sec setprecision;
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops");
constexpr double eps = 1e-9;
constexpr double pi = 3.141592653589793238462643383279;
using namespace std;
using ll = long long;
using ld = long double;
using Pa = pair<int, int>;
ll mod = 1000000007;
ll MOD = 998244353;
ll gcd(ll a, ll b)
{
if (a % b == 0) return(b);
else return(gcd(b, a % b));
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
ll pow(ll x, ll n) {
x %= mod;
if (n == 0)
return 1;
if (n % 2 == 0)
return (pow((x * x) % mod, n / 2) % mod);
else
return (x * pow(x, n - 1)) % mod;
}
bool prime(int n) {
int i = 2;
if (n == 2)return true;
else if(n <= 1)return false;
if (n % i == 0)return false;
i = 3;
while (i <= sqrt(n)) {
if (n % i == 0)return false;
i += 2;
}
return true;
}
signed main() {
int h, w; cin >> h >> w;
vector<vector<bool>>s(h+2,vector<bool>(w+2,false));
rip(i, h){
rip(j, w) {
char a; cin >> a;
if (a == '#')s[i+1][j+1] = true;
}
}
rip(i, h) {
rip(j, w) {
bool p = true;
int k=i+1;int l=j+1;
p = s[k-1][l]||s[k][l-1]||s[k+1][l]||s[k][l+1];
if(p == false&&s[k][l]==true) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
| 0
| 77,536,567
|
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n, m, res;
int h[N], e[M], ne[M], idx;
bool st[N];
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
void dfs(int u, int cnt)
{
if (cnt >= n)
{
res ++ ;
return;
}
for (int i = h[u]; ~i; i = ne[i])
{
int j = e[i];
if (st[j]) continue;
st[j] = true;
dfs(j, cnt + 1);
st[j] = false;
}
}
int main()
{
memset(h, -1, sizeof h);
cin >> n >> m;
while (m -- )
{
int a, b;
cin >> a >> b;
add(a, b), add(b, a);
}
st[1] = true;
dfs(1, 1);
cout << res << endl;
return 0;
}
|
#include<iostream>
#include<vector>
int main(void){
int n;
std::cin >> n;
std::vector<int> w(n);
for(int i = 0; i < n; i++){
std::cin >> w[i];
}
int sum = 0;
for(int i = 0; i < n; i++){
sum += w[i];
}
int sum1 = 0;
int sum2;
int ans = 1e9;
for(int i = 0; i < n-1; i++){
sum1 += w[i];
sum2 = sum - sum1;
int diff = sum1 - sum2;
if(diff < 0) diff = -diff;
ans = std::min(ans, diff);
}
std::cout << ans << std::endl;
return 0;
}
| 0
| 15,376,106
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll n, k; cin >> n >> k;
ll mx = 0;
vector<ll> a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
mx = max(mx, a[i]);
}
if (mx < k) {
puts("IMPOSSIBLE");
return 0;
}
ll g = 0;
for (ll i = 0; i < n; ++i) {
g = __gcd(g, a[i]);
}
if (k % g == 0) {
puts("POSSIBLE");
} else {
puts("IMPOSSIBLE");
}
}
|
#include<iostream>
#include<cstdio>
using namespace std;
class Dice {
public:
int face[6];
Dice(int face1, int face2, int face3, int face4, int face5, int face6) {
face[0] = face1;
face[1] = face2;
face[2] = face3;
face[3] = face4;
face[4] = face5;
face[5] = face6;
}
int top() {
return face[0];
}
int front() {
return face[1];
}
int right() {
return face[2];
}
void move(char c) {
if (c == 'N') {
moveFace(1, 2, 6, 5);
} else if (c == 'S') {
moveFace(1, 5, 6, 2);
} else if (c == 'W') {
moveFace(1, 3, 6, 4);
} else if (c == 'E') {
moveFace(1, 4, 6, 3);
}
}
void moveFace(int i1, int i2, int i3, int i4) {
int tmp = face[i1 - 1];
face[i1 - 1] = face[i2 - 1];
face[i2 - 1] = face[i3 - 1];
face[i3 - 1] = face[i4 - 1];
face[i4 - 1] = tmp;
}
int getRight(int top2, int front2) {
for (int i = 0; i < 4; i++) {
move('N');
for (int j = 0; j < 4; j++) {
move('W');
for (int k = 0; k < 4; k++) {
move('N');
if (top() == top2 && front() == front2) {
return right();
}
}
}
}
return 0;
}
};
int main() {
int face1, face2, face3, face4, face5, face6;
cin >> face1 >> face2 >> face3 >> face4 >> face5 >> face6;
Dice d(face1, face2, face3, face4, face5, face6);
int count;
cin >> count;
for (int i = 0; i < count; i++) {
int top, front;
cin >> top >> front;
cout << d.getRight(top, front) << endl;
}
}
| 0
| 100,261,558
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
long double N;
cin >> N;
cout << (ll)((180.0*(N-2.0)/N) * N) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
deque<pair<int, int>> que;
typedef vector<vector<int> > Matrix;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
map<ll, ll> v1, v2;
REP(i, n){
if(i%2==0){
ll v;
cin >> v;
v1[v]++;
}
else {
ll v;
cin >> v;
v2[v]++;
}
}
vector<pair<ll, ll>> v1_, v2_;
for(auto itr = v2.begin(); itr != v2.end(); ++itr) {
v2_.push_back({itr->second, itr->first});
}
for(auto itr = v1.begin(); itr != v1.end(); ++itr) {
v1_.push_back({itr->second, itr->first});
}
sort(v1_.begin(), v1_.end(), greater<pair<ll, ll>>());
sort(v2_.begin(), v2_.end(), greater<pair<ll, ll>>());
ll ans;
if(v1_[0].second == v2_[0].second){
if(v1_.size()==1 && v2_.size()==1){
ans = n/2;
}else{
ll ans1 = (n/2 - v1_[0].first) + (n/2 - v2_[1].first);
ll ans2 = (n/2 - v2_[0].first) + (n/2 - v1_[1].first);
ans = min(ans1,ans2);
}
}else{
ans = (n/2 - v1_[0].first) + (n/2 - v2_[0].first);
}
cout << ans << endl;
}
| 0
| 61,104,730
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int m;
int s=100000;
cin>>m;
for(int i=0;i<m;i++){
s = s*1.05;
if(s%1000!=0)
s = ((s/1000)+1)*1000;
}
cout<<s<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
ll h,n; cin>>h>>n;
vl v(n);
rep(i,0,n){
cin>>v[i];
}
sort(all(v));
ll c=0;
for(int i=n-1;i>=0;i--){
c+=v[i];
if(c>=h){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
}
| 0
| 38,909,432
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(int i=0;i<a;i++)
#define rep1(i,a,b) for(int i=(a);i<=(b);++i)
#define irep(i,b,a) for(int i=(b);i>=(a);--i)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define hurr cout<<"Road_Clear"<<endl;
#define unq(v) sort(all(v)),(v).erase(unique(all(v)),(v).end())
#define _ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define sqr(a) ((a)*(a))
#define sz(a) int(a.size())
#define ff first
#define ss second
#define pb push_back
const double pi = acos(-1.0);
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int maxn = 2000100;
int main(){
_
int n,k; cin >> n >> k;
ll res = k* pow((k-1),n-1);
cout<<res<<endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define CFOR(i, str) for(int i = 0; (str)[i]!='\0'; (i)++)
#define FOR(i, s, r) for(int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define vmax(v) *max_element(v.begin(), v.end())
#define vmin(v) *min_element(v.begin(), v.end())
#define cnt(v, n) count(v.begin(), v.end(), (n))
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vpic vector<pair<int, char>>
#define mp make_pair
#define rot(s, k) rotate(s.begin(), s.begin()+ s.size()-(k%s.size()), s.end());
#define lld long long int
#define ulld unsigned long long int
typedef long long ll;
using namespace std;
ll binpow(ll a, ll b) {
ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res;
}
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
bool isPrime(ll n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (ll i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
void solve(){
char n,m;
cin>>n>>m;
if(n>m)
{
char temp=n;
n=m;
m=temp;
}
for(int i=0;i<m-'0';i++)
{
cout<<n;
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll t;
t=1;
while(t--)
{
solve();
}
return 0;
}
| 0
| 6,089,514
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
signed main() {
string s;
cin >> s;
int ans = 0;
int N = s.size();
REP(i, N) if(s[i] == 'o') ans++;
ans += 15-N;
if(ans < 8) NO;
else YES;
return 0;
}
|
#include <iostream>
#define N 1000000
using namespace std;
char grade_char(int);
int main()
{
int m,f,r,j;
char C[N];
while(1)
{
cin >> m >> f >> r;
if(m==-1&&f==-1&&r==-1) break;
else if(m==-1||f==-1) C[j]=grade_char(0);
else if((m+f>=30&&m+f<50)&&r>=50) C[j]=grade_char(50);
else if((m+f>=30&&m+f<50)&&r>=50) C[j]=grade_char(49);
else C[j]=grade_char(m+f);
j++;
}
for(int i=0;i<j;i++)
{
cout << C[i] << endl;
}
return 0;
}
char grade_char(int score)
{
if(0<=score&&score<30) return 'F';
else if(30<=score&&score<50) return 'D';
else if(50<=score&&score<65) return 'C';
else if(65<=score&&score<80) return 'B';
else return 'A';
}
| 0
| 73,208,260
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll a, ll b, ll c);
ll msub(ll a, ll b);
ll mtime(ll a, ll b, ll c);
int main() {
int n;
cin >> n;
n = ((n+110)/111)*111;
cout << n << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
}
|
#include <iostream>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <numeric>
#define rep(i, n) for(int i=0; i<(int)(n);i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
template<class T> inline bool chmin(T& a, T b);
template<class T> inline bool chmax(T& a, T b);
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v);
template<class T> lint sum(vector<T> a);
template<class T> double ave(vector<T> a);
lint n, m;
int main(){
cin >> n;
cout << (int)((180.0 - (double)(360.0 / n)) * n) << endl;
return 0;
}
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << "\t";
}
return s;
}
| 0
| 3,106,271
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,k,s,d=1e9;
cin >> n >> k >> s;
if(s==d) d = 1;
rep(i,k) cout << s << ' ';
rep(i,n-k) cout << d << ' ';
cout << endl;
}
|
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#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 dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
using namespace std;
int main(){
int N, M;
pair<int, int> a[10000];
while(cin >> N >> M && N > 0){
rep(i, N){
cin >> a[i].second >> a[i].first;
}
sort(a, a+N);
reverse(a, a+N);
int ans = 0;
rep(i, N){
if(M >= a[i].second){
M = M - a[i].second;
} else {
ans += a[i].first * (a[i].second - M);
M = 0;
}
}
cout << ans << endl;
}
}
| 0
| 60,092,293
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int ans = 0;
for(int i=0;i<N;i++){
int X;
int A,B;
cin>>A>>B;
X = B-A+1;
ans+=X;
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
#define mp make_pair
#define pb push_back
#define f first
#define s second
int x;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> x;
cout << 360/__gcd(360, x) << endl;
cout.flush();
return 0;
}
| 0
| 100,306,747
|
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string s, t;
cin >> s >> t;
for (size_t i = 0; i < s.size(); i++) {
if (s.at(i) != t.at(i)) {
cout << "No";
return 0;
}
}
cout << "Yes";
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 n,h;cin>>n>>h;
int a[n],b[n];rep(i,n)cin>>a[i]>>b[i];
sort(a,a+n,greater<int>());
sort(b,b+n,greater<int>());
int ans = 0;
int i=0;
while(b[i]>a[0]){
h-=b[i];
++ans;
++i;
if(h<=0 ||i==n)break;
}
if(h>0){
ans+=h/a[0];
if(h%a[0] != 0)++ans;
}
cout<<ans<<endl;
return 0;
}
| 0
| 7,022,209
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility>
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll inf = 1LL << 50;
const ll MOD = 1e9 + 7;
struct edge { ll from; ll to; ll cost; };
int main(){
ll n, k;
cin >> n >> k;
vector<ll>a(n); vector<ll>b(n);
rep(i, 0, n) {
cin >> a[i] >> b[i];
}
ll ans = -1;
for (int i = 0; i <= 35; i++) {
ll msk = 0;
if (i == 0)msk = k;
else {
if ((1LL << i)&k) {
for (int j = 0; j <= 35; j++) {
if (j < i)msk += 1LL << j;
else if (j > i && (k & (1LL << j)))msk += 1LL << j;
}
}
else {
continue;
}
}
ll temp = 0;
rep(p, 0, n) {
int ok = 1;
for (int j = 0; j <= 35; j++) {
if ( ((1LL << j)&a[p]) && !((1LL << j)&msk) ) {
ok = 0;
}
}
if (ok)temp += b[p];
}
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int n;
LDP vec[110];
vector<ld> ang_={(ld)0,pi,-pi},ang={(ld)0,pi,-pi};
void solve(){
cin >> n;
rep(i,n){
int x,y;
cin >> x >> y;
vec[i]=P(x,y);
}
rep(i,n){
ld a1,a2;
a1=atan2(vec[i].second,vec[i].first)+pi/2;
a2=atan2(vec[i].second,vec[i].first)-pi/2;
if (a1>pi) a1-=pi;
if (a2<-pi) a2+=pi;
ang_.push_back(a1);
ang_.push_back(a2);
ang_.push_back(atan2(vec[i].second,vec[i].first));
ang.push_back(a1);
ang.push_back(a2);
ang.push_back(atan2(vec[i].second,vec[i].first));
}
sort(ang_.begin(),ang_.end());
rep(i,(int)ang_.size()-1){
ang.push_back((ang_[i]+ang_[i+1])/2);
}
sort(ang.begin(),ang.end());
ld ans=0;
rep(i,ang.size()){
ld a=ang[i];
ld p=cos(a),q=sin(a);
ld x=0,y=0;
rep(k,n){
if (p*vec[k].first+q*vec[k].second>=0) {
x+=vec[k].first;
y+=vec[k].second;
}
}
ans=max(ans,sqrt(x*x+y*y));
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
}
| 0
| 34,383,521
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define no cout << "no" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define AC cout << "AC" << endl;
#define WA cout << "WA" << endl;
#define out(s) cout << s << endl;
#define ll long long
#define ull unsigned long long
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const double PI = 3.14159265358979323846;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
#define H_MAX 500
#define W_MAX 500
#define INF 1e9 + 7
int main() {
char a, b;
cin >> a >> b;
if (a > b) {
rep(i, a - '0') {
cout << b;
}
} else {
rep(i, b - '0') {
cout << a;
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
const int INF = 2147483647;
const ll MOD = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vl a(n);
REP(i, n) { cin >> a[i]; }
ll ans = 1e11;
REP(i, (1 << n)) {
ll tmp = 0;
int vis = 1;
ll ma = a[0];
FOR(j, 1, n) {
if ((i >> j) % 2 == 1 && a[j] <= ma) {
tmp += ma - a[j] + 1;
ma = ma + 1;
vis++;
} else if (a[j] > ma) {
vis++;
}
ma = max(ma, a[j]);
}
if (vis >= k) {
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| 0
| 79,774,908
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
while(!(b>a))
{
b*=2;
k--;
}
while(!(c>b))
{
c*=2;
k--;
}
if(k>=0)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
ll h,w;
cin>>h>>w;
while(h--){
string s;
cin>>s;
cout<<s<<endl;
cout<<s<<endl;
}
return 0;
}
| 0
| 88,951,348
|
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<rhs.size(); ++i){ std::cout<<rhs[i]<<' '; }
std::cout<<"]"<<std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>>& rhs){
std::cout<<" = "<<std::endl;
std::cout<<"[[ ";
for(uint p=0; p<rhs.size(); ++p){
if(p!=0){ std::cout<<" [ "; }
for(uint q=0; q<rhs[p].size(); ++q){
std::cout<<rhs[p][q]<<' ';
}
if(p!=rhs.size()-1){ std::cout<<"]"<<std::endl; }
}
std::cout<<"]]"<<std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR,TL>>& rhs){
std::cout<<" = [";
uint i=0;
for(; i<rhs.size()-1; ++i){ std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"], "; }
std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"]]" << endl;
}
#define printn(var) {printf("%s", #var);print(var);}
#define printn_all(var) {printf("%s(%d): ", __func__, __LINE__);printf("%s", #var);print(var);}
int64 pow2(int n){ return (1ll << (n-1)); }
int64 rec(int n, int64 x){
if(n==0){ return (x<=0 ? 0:1); }
int64 len = pow2(n+2) - 3;
int64 numPate = pow2(n+1) - 1;
if(x<=len+1){ return rec(n-1, x-1);
} else { return numPate + 1 + rec(n-1, x-1-(len+1)); }
}
int main(){
int N; int64 X; cin >> N >> X;
cout << rec(N, X) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 1e5 + 5;
int dp[maxn][21] , a[maxn] , n , L;
void solve ()
{
for (int i = 1 ; i <= n ; i++) {
int l = 1 , r = n , mid;
while (l <= r){
mid = l + r >> 1;
if (a[mid] <= a[i] + L) l = mid + 1;
else r = mid - 1;
}
dp[i][0] = r;
}
for (int i = 1 ; i <= 20 ; i++)
for (int j = 1 ; j <= n; j++)
dp[j][i] = dp[dp[j][i - 1]][i - 1];
}
int ask (int x , int y)
{
if (x == y) return 0;
int ans = 0;
for (int i = 20 ; i >= 0 ; i--)
if (dp[x][i] < y) x = dp[x][i] , ans += (1 << i);
ans++;
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1 ; i <= n ; i++) cin >> a[i];
cin >> L;
solve ();
int q;cin >> q;
while (q--){
int x , y; cin >> x >> y;
if (x > y) swap(x , y);
cout << ask(x , y) << endl;
}
return 0;
}
| 0
| 47,058,185
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e5 + 7;
vector <int> g[N];
bool used[N], col[N];
vector <int> comp;
void dfs(int u) {
comp.app(u);
used[u] = 1;
for (int v : g[u]) {
if (!used[v]) {
col[v] = col[u] ^ 1;
dfs(v);
}
}
}
int cnt[3];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n, m;
cin >> n >> m;
while (m--) {
int u, v; cin >> u >> v;
g[u].app(v); g[v].app(u);
}
int t = 0;
for (int i = 1; i <= n; ++i) {
if (g[i].empty()) {
++t;
continue;
}
if (!used[i]) {
comp.clear();
dfs(i);
bool b = 1;
for (int u : comp) {
for (int v : g[u]) {
b &= col[u] != col[v];
}
}
++cnt[b];
}
}
cout << (cnt[0] + cnt[1]) * (cnt[0] + cnt[1]) + cnt[1] * cnt[1] + t * n + (n - t) * t << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main()
{
int n;
cin >> n;
vector<ll> t(n),a(n),b(n);
for(int i = 0;i<n;i++)cin >> t[i];
for(int i = 0;i<n;i++)cin >> a[i];
vector<bool> is(n,true);
is.front() = false;
is.back() = false;
if(n==1)
{
if(a[0]!=t[0])
{
cout<<0<<endl;
return 0;
}
}
for(int i = 0;i<n-1;i++)
{
if(t[i]!=t[i+1])
{
b[i+1] = t[i+1];
is [i+1] = false;
}
}
for(int i = 0;i<n-1;i++)
{
if(a[i]!=a[i+1])
{
b[i]=a[i];
is [i] = false;
}
}
ll mx = 0;
for(int i = 0;i<n;i++)
{
mx = max(mx,b[i]);
if(mx>t[i])
{
cout<<0<<endl;
return 0;
}
}
mx = 0;
for(int i = n-1;i>=0;i--)
{
mx = max(mx,b[i]);
if(mx>a[i])
{
cout<<0<<endl;
return 0;
}
}
ll ans = 1;
for(int i = 0;i<n;i++)
{
if(is[i])
{
(ans *= min(t[i],a[i]))%=MOD;
}
}
cout<<ans<<endl;
}
| 0
| 85,431,634
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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; }
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using M = map<int, int>;
using Ml = map<ll, ll>;
ll const INF = 1ll<<61;
double pi = 3.141592653589793238;
int main() {
ll n, i;
cin >> n >> i;
cout << n - i + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define txt \
freopen("ip.txt", "r", stdin); \
freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define quickie \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define div2(a) (!(a & 1))
#define deb(x) cout << (#x) << " " << (x) << "\n";
#define newl cout << "\n"
#define all(s) s.begin(), s.end()
#define pi 3.14159265358979323846
#define mod 1000000007
#define fp(x) fixed << setprecision(x) <<
template <class T>
int digit(T a)
{
vector<long long> dig = {
0,
9,
99,
999,
9999,
99999,
999999,
9999999,
99999999,
999999999,
9999999999,
99999999999,
999999999999,
9999999999999,
99999999999999,
999999999999999,
9999999999999999,
99999999999999999,
999999999999999999,
INT64_MAX};
auto it = lower_bound(dig.begin(), dig.end(), a);
int idx = (it - dig.begin());
return idx;
}
template <class T>
int sumAllInts(T n)
{
int a = 1;
int su = 0;
while (n)
{
su += n % 10;
n /= 10;
}
return su;
}
template <class T>
void split(char c, T s)
{
int n = s.size();
int i = 0;
while ((cout << s[i], i += 1) && (i < n) && (cout << c << ' '))
;
}
void solve()
{
int n; cin>>n;
map<int,int> mp;
for (int i = 0; i < n; i++)
{
int temp; cin>>temp;
mp[temp]++;
}
int freqE = 0;
int freqO = 0;
for(auto c: mp){
if(c.second%2==0){
freqE++;
}else
{
freqO++;
}
}
int ans = mp.size();
if(freqE%2==0){
cout<<ans;
}else
{
cout<<ans - 1;
}
}
int main()
{
quickie;
int t = 1;
while (t--)
{
solve();
newl;
}
return 0;
}
| 0
| 91,647,318
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <math.h>
#define PREP(i, m, n) for(int i = m; i < n; i++)
#define MREP(i, m, n) for(int i = m - 1; i >= n; i--)
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define X first
#define Y second
#define MP make_pair
#define PB push_back
using namespace std;
int table[10][10];
int main(){
int n;
while(cin >> n && n != 0){
for(int i = 0; i < 10; i++){
fill(table[i], table[i]+10, 10000000);
table[i][i] = 0;
}
for(int i = 0; i < n; i++){
int node1, node2;
cin >> node1 >> node2;
cin >> table[node1][node2];
table[node2][node1] = table[node1][node2];
}
for(int i = 0; i < 10; i++){
for(int j = 0; j < 10; j++){
for(int k = 0; k < 10; k++){
table[j][k] = min(table[j][k], table[j][i] + table[i][k]);
}
}
}
int index = -1;
int min = 1000000;
for(int i = 0; i < 10; i++){
if(table[i][0] == 10000000) break;
int sum = 0;
for(int j = 0; j < 10; j++){
if(table[i][j] == 10000000) break;
sum += table[i][j];
}
if(sum<min){
min = sum;
index = i;
}
}
cout << index << " " << min << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
ll k, a, b, sol;
bool sameAll(string x) {
for(ll i = 1; i < x.size(); i++) {
if(x[i] != x[i - 1]) return false;
}
return true;
}
ll ganti(string x) {
ll ans = 0;
for(ll i = 0; i < x.size() - 1; i++) {
if(x[i] == x[i + 1]) {
ans++; i++;
}
}
return ans;
}
bool BF(string x) {
return x[0] == x[x.size() - 1];
}
ll CFront(string x) {
ll fr = 0;
for(ll i = 0; i < x.size(); i++) {
if(x[i] == x[0]) fr++;
else break;
}
return fr;
}
ll CBack(string x) {
ll ba = 0;
for(ll i = x.size() - 1; i >= 0; i--) {
if(x[i] == x[x.size() - 1]) ba++;
else break;
}
return ba;
}
void solve() {
cin >> s >> k;
if(sameAll(s)) cout << s.size() * k / 2 << "\n";
else if(!BF(s)) cout << ganti(s) * k << "\n";
else if(BF(s)) {
a = CFront(s);
b = CBack(s);
sol = ganti(s) * k - (a / 2 + b / 2 - (a + b) / 2) * (k - 1);
cout << sol << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
solve();
}
| 0
| 22,398,132
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n;
vector<vector<int>> mat;
for(int i = 0; i<n; i++){
vector<int> arr(3);
for(int i = 0l; i < 3; i++){
cin>>arr[i];
}
mat.push_back(arr);
}
vector<vector<int>> dp(n, vector<int>(3,0));
dp[0][0] = mat[0][0];
dp[0][1] = mat[0][1];
dp[0][2] = mat[0][2];
for(int i = 1; i < n; i++){
for(int j = 0; j < 3; j++){
dp[i][j] = max(dp[i-1][(j+1)%3], dp[i-1][(j+2)%3]) + mat[i][j];
}
}
cout<<max(dp[n-1][0], max(dp[n-1][1], dp[n-1][2]));
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define setbit bitset<8>
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define count2way(v, x) high2way(v, x) - low2way(v, x)
#define lower(v, x) low2way(v, x) - v.begin()
#define higher(v, x) high2way(v, x) - v.begin() - 1
#define putout(a) cout << a << endl
#define putout2(a, b) \
putout(a); \
putout(b)
#define putout3(a, b, c) \
putout(a); \
putout(b); \
putout(c)
#define putout4(a, b, c, d) \
putout(a); \
putout(b); \
putout(c); \
putout(d)
#define putout5(a, b, c, d, e) \
putout(a); \
putout(b); \
putout(c); \
putout(d); \
putout(e)
#define Gput(a, b) G[a].push_back(b)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cin5(a, b, c, d, e) cin >> a >> b >> c >> d >> e
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return 0;
}
template <typename T>
T lcm(T x, T y)
{
T z = gcd(x, y);
return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++)
{
if (n % i == 0)
{
return false;
}
i++;
}
return true;
}
template <typename T>
T modinv(T a, T m)
{
T b = m, u = 1, v = 0;
while (b)
{
T t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
template <class T>
inline void chmax(T &a, T b)
{
if (a < b)
a = b;
}
template <class T>
inline void chmin(T &a, T b)
{
if (a > b)
a = b;
}
int main()
{
cout << fixed << setprecision(30);
ll n;
cin >> n;
vec a(n), b(n);
loop(i, n) cin >> a[i];
loop(i, n) cin >> b[i];
ll check = Sum(b) - Sum(a);
ll count1 = 0, count2 = 0;
loop(i, n)
{
if (a[i] < b[i])
count2 += (b[i] - a[i] + 1) / 2;
else
count1 += a[i] - b[i];
}
if (max(count1, count2) <= check)
putout("Yes");
else
putout("No");
return 0;
}
| 0
| 19,843,451
|
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
int a,b,c,d,k;
int main(){
cin>>a>>b>>c>>d>>k;
int l=a*60+b,r=c*60+d;
cout<<r-l-k<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
int main(){
ll w,h,n;cin >> w >> h >> n;
vector<string> field(h);
rep(i,h) field.at(i).resize(w);
rep(i,h) rep(j,w) field.at(i).at(j) = 'o';
rep(i,n){
ll x,y,a;cin >> x >> y >> a;
if( a == 1 ){
rep(j,h){
for(ll k=0;k<x;++k) field.at(j).at(k) = 'x';
}
}else if( a == 2 ){
rep(j,h){
for(ll k=x;k<w;++k) field.at(j).at(k) = 'x';
}
}else if( a == 3 ){
for(ll j=1;j<=y;++j){
rep(k,w) field.at(h-j).at(k) = 'x';
}
}else if( a == 4 ){
for(ll j=h-y-1;j>=0;--j){
rep(k,w) field.at(j).at(k) = 'x';
}
}
}
ll ans = 0;
rep(i,h) rep(j,w) if( field.at(i).at(j) == 'o' ) ans++;
cout << ans << endl;
return 0;
}
| 0
| 2,780,909
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
int main(){
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
int ans = a[0];
for(int i = 0; i < n-1; i++){
if(a[i] < a[i+1]){
ans += a[i+1] - a[i];
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nax = 1e7+7;
const int MOD = 1e9+7;
int main(){
int n, k; cin>>n>>k;
double ans = 0;
for(int i=1; i<=n; i++){
double tmp = k;
double curr = 1;
while(tmp>i){
tmp/=2;
curr/=2;
}
ans += curr;
}
ans /= n;
cout<<setprecision(10)<<ans<<endl;
return 0;
}
| 0
| 14,156,902
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
int main()
{
i64 N;
cin >> N;
i64 ans = 0;
for (i64 i = 1; i <= N; i++)
ans += (N - 1) / i;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x) \
for(auto &youso_ : (x)) cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
cin >> head;
CIN(move(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<bool> VB;
typedef vector<double> VD;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 5e18;
const ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
void chmax(PL &a, PL b) {
if(b.fi > a.fi) {
a.se = max(a.fi, b.se);
a.fi = b.fi;
} else
a.se = max(b.fi, a.se);
}
signed main() {
LCIN(N);
VL A(1LL << N);
VECCIN(A);
VPL dp(1LL << N);
REP(i, 1LL << N) { dp[i] = {A[i], -LINF}; }
REP(b, N) REP(s, 1LL << N) {
if(s >> b & 1) {
chmax(dp[s], dp[s & ~(1LL << b)]);
}
}
ll ans = 0;
REP(s, 1LL << N) {
ll tmp = dp[s].fi + dp[s].se;
ans = max(ans, tmp);
if(s) cout << ans << "\n";
}
}
| 0
| 25,513,035
|
#include <bits/stdc++.h>
#define rep(i,n) for(long long int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
int main(){
int x; cin >> x;
if(x < 1200)print("ABC");
else print("ARC");
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, H, maxA = 0;
cin >> N >> H;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
maxA = max(A.at(i), maxA);
}
sort(B.begin(),B.end());
reverse(B.begin(),B.end());
int i = 0;
int sumB = 0;
while (B.at(i) > maxA) {
sumB += B.at(i);
if (sumB >= H) {
cout << i + 1 << endl;
return 0;
}
i++;
if (i == N) {
break;
}
}
H -= sumB;
cout << i + H / maxA + (H % maxA + maxA - 1) / maxA << endl;
}
| 0
| 99,196,712
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x;
cin >> x;
cout << 10 - (x / 200);
return 0;
}
|
#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
| 64,355,631
|
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
queue<int> Q;
int n,u,k,vv,cur,dst;
cin >> n;
vector<int> D(n,-1),check(n,0);
vector< vector<int> > v(n);
for(int i = 0;i < n;++i){
cin >> u >> k;
for(int j = 0;j < k;++j){
cin >> vv;
v[u - 1].push_back(vv);
}
sort(v[u - 1].begin(),v[u - 1].end());
}
D[0] = 0;
check[0] = 1;
Q.push(1);
while(!Q.empty()){
cur = Q.front();
Q.pop();
for(int i = 0;i < v[cur - 1].size();++i){
dst = v[cur - 1][i];
if(check[dst - 1] == 0){
D[dst - 1] = D[cur - 1] + 1;
check[dst - 1] = 1;
Q.push(dst);
}
}
}
for(int i = 0;i < n;++i)
cout << i + 1 << " " << D[i] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll n,x,y;cin >> n >> x >> y;
vl v(n);rep(i,n)cin >> v[i];
vvl dp(n,vl(2));
rep(i,n)dp[i][0]=0;
rep(i,n)dp[i][1]=inf;
per(i,n){
ll Y = (i ? v[i-1] : y);
chmax(dp[i][0],abs(v[n-1]-Y));
repl(j,i+1,n){
chmax(dp[i][0],dp[j][1]);
}
ll X = (i ? v[i-1] : x);
chmin(dp[i][1],abs(v[n-1]-X));
repl(j,i+1,n){
chmin(dp[i][1],dp[j][0]);
}
}
cout << dp[0][0] <<endl;
}
| 0
| 2,800,221
|
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> > v[1<<18];
int a[1<<18],tmp;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int m=(1<<n);
for(int i=0;i<m;i++)
cin>>a[i];
for(int i=0;i<m;i++){
v[i].push_back(make_pair(0,-1));
v[i].push_back(make_pair(a[i],i));
if(i!=0){
for(int j=0;j<n;j++)
if((1<<j)&i){
v[i].push_back(v[i^(1<<j)][0]);
v[i].push_back(v[i^(1<<j)][1]);
}
sort(v[i].begin(),v[i].end(),greater<pair<int,int> >());
v[i].resize(unique(v[i].begin(),v[i].end())-v[i].begin());
tmp=max(tmp,v[i][0].first+v[i][1].first);
cout<<tmp<<'\n';
}
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int main() {
ll n,k;
cin >> n >> k;
ll a[n];
ll b[n];
rep(i,n)cin >> a[i] >> b[i];
int count = 0;
ll k_ = k;
rep(i,30){
if(k_ % 2 == 1)count++;
k_ /= 2;
}
ll f[count + 1][30];
rep(i,count+1){
k_ = k;
if(i == 0){
rep(j,30){
f[i][j] = k_ % 2;
k_ /= 2;
}
}else{
rep(j,30){
f[i][j] = k_ % 2;
k_ /= 2;
}
int count_ = 0;
drep(j,30){
if(count_ == i){
f[i][j] = 1;
}else{
if(f[i][j] == 1){
count_++;
if(count_ == i){
f[i][j] = 0;
}
}
}
}
}
}
ll ans[count + 1] = {};
rep(i,n){
rep(j,count+1){
int flag = 0;
ll a_ = a[i];
rep(l,30){
if(f[j][l] < (a_%2)){
flag = 1;
break;
}
a_ /= 2;
}
if(flag == 0){
ans[j] += b[i];
}
}
}
ll ans2 = 0;
rep(i,count + 1){
ans2 = max(ans2, ans[i]);
}
cout << ans2 << endl;
return 0;
}
| 0
| 58,543,669
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<long long,int> P;
int main(){
string s, ans = "";
cin >> s;
int w;
cin >> w;
for (int i = 0; i < s.size(); i += w){
ans += s[i];
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <climits>
int main()
{
long N,M;
std::cin >> N >> M;
std::vector<std::vector<long> > ship(200000+1);
for(long i=0; i<M; i++){
long a,b;
std::cin >> a >> b;
ship[a].push_back(b);
}
bool flag=0;
std::vector<long> root;
for(long i=0; i<ship[1].size();i++){
root.push_back(ship[1][i]);
}
for(long i=0; i<root.size(); i++){
for(long j=0; j<ship[root[i]].size(); j++){
if(ship[root[i]][j]==N){
flag=1;
break;
}
}
}
if(flag){
std::cout << "POSSIBLE" << std::endl;
}else{
std::cout << "IMPOSSIBLE" << std::endl;
}
return 0;
}
| 0
| 65,262,497
|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD=998244353;
int64_t modpow(int64_t a,int64_t n){
int64_t res=1;
if(n==0) return res;
while(n>0){
if(n&1) res=(res*a)%MOD;
a=(a*a)%MOD;
n >>= 1;
}
return res;
}
int main(){
int N;
cin>>N;
vector<int64_t> D(N);
for(int i=0;i<N;++i) cin>>D[i];
int64_t ans=0;
if(D[0]!=0) cout<<0<<endl;
else{
ans=1;
map<int,int> S;
for(int i=0;i<N;++i){
++S[D[i]];
}
if(S[0]>1) cout<<0<<endl;
else{
for(auto p:S){
if(p.first>0){
ans *= modpow(S[p.first-1],S[p.first]);
ans %= MOD;
}
}
cout<<ans<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int> > vvint;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;
typedef priority_queue<int, vector<int>, greater<int> > spqint;
typedef priority_queue<ll, vector<ll>, greater<ll> > spqll;
typedef priority_queue<int, vector<int>, less<int> > bpqint;
typedef priority_queue<ll, vector<ll>, less<ll> > bpqll;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define IREP(i, v) for (auto i = v.begin(); i != v.end(); i++)
#define MOD 1000000007
#define NIL -1
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
const double PI = M_PI;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void yes()
{
cout << "Yes" << endl;
}
void no()
{
cout << "No" << endl;
}
int N ;
struct BIT {
private:
vector<int> bit;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
void add(int a, int w) {
for (int x = a; x <= N; x += x & -x) bit[x] += w;
}
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x) ret += bit[x];
return ret;
}
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N ;
int n = N ;
vint a, b ;
REP(i,n){
int c ;
cin >> c ;
if(i%2==0){
a.PB(c) ;
}
else{
b.PB(c) ;
}
}
sort(ALL(a)) ;
reverse(ALL(a)) ;
sort(ALL(b)) ;
reverse(ALL(b)) ;
vint d ;
REP(i,n){
if(i%2==0){
d.PB(a[SZ(a)-1]) ;
a.pop_back() ;
}
else{
d.PB(b[SZ(b)-1]) ;
b.pop_back() ;
}
}
vint f ;
f = d ;
sort(ALL(f)) ;
vint h(n) ;
REP(i,n){
auto itr = LB(ALL(f),d[i]) ;
int g = distance(f.begin(),itr) ;
h[i] = g ;
}
ll ans = 0 ;
REP(i,n){
if(i%2!=h[i]%2){
ans++ ;
}
}
cout << ans/2 <<endl;
return 0;
}
| 0
| 61,130,970
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long int modpow(int b, int p){
long long int num = 1, power = b;
for(int i=0; i<=30; i++){
if((p>>i) & 1) num *= power;
num %= MOD;
power *= power;
power %= MOD;
}
return num;
}
int main(){
int n, k;
cin >> n >> k;
vector<long long int> gcd(k+1);
for(int i=k; i>=1; i--){
gcd[i] = modpow(k/i, n);
for(int d=2; d<=k/i; d++){
gcd[i] -= gcd[i*d];
gcd[i] = (gcd[i] % MOD + MOD) % MOD;
}
gcd[i] = (gcd[i] % MOD + MOD) % MOD;
}
long long int ans = 0;
for(long long int j=1; j<=k; j++){
ans += (gcd[j] * j) % MOD;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
int main() {
int N;
long long ans =1, l_1 = 1, l_2 = 2;
cin >> N;
if (N == 1) {
cout << 1 << endl;
return 0;
}
rep(i, N) {
ans = 0;
ans = l_1 + l_2;
l_2 = l_1; l_1 = ans;
}
cout << ans << endl;
return 0;
}
| 0
| 3,212,466
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
#include <unordered_map>
using namespace std;
int main(){
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> AB(N);
int a, b;
for(int i = 0; i < N; i++){
cin >> a >> b;
a--;
b--;
AB[i] = make_pair(a, b);
}
unordered_map<long long, int> cntMap;
for(auto p: AB){
for(int i = -1; i <= 1; i++){
for(int j = -1; j <= 1; j++){
int x = p.first + i;
int y = p.second + j;
if(1 <= x && x < H - 1 && 1 <= y && y < W - 1){
cntMap[(long long)x * W + y]++;
}
}
}
}
vector<long long> ans(10);
for(auto temp: cntMap){
ans[temp.second]++;
}
ans[0] = (long long)(H - 2) * (W - 2);
for(int i = 1; i <= 9; i++){
ans[0] -= ans[i];
}
for(auto temp: ans){
cout << temp << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main()
{
string A;
cin >> A;
for (int bit = 0; bit < (1 << 3); bit++)
{
bitset<3> s(bit);
float sum = A.at(0) - '0';
rep(i, 3)
{
if (s.test(i))
{
sum += A.at(i + 1) - '0';
}
else
{
sum -= A.at(i + 1) - '0';
}
}
if (sum == 7)
{
rep(i, 3)
{
cout << A.at(i);
if (s.test(i))
{
cout << '+';
}
else
{
cout << '-';
}
}
cout << A.at(3) << "=7" << endl;
exit(0);
}
}
}
| 0
| 30,104,117
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:vec) cout<<itr<<' ';
cout<<'\n';
}
typedef pair<ll,ll> P;
const ll mod=1e9+7;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,k;
cin>>n>>k;
vector<ll> a(n+1);
vector<ll> s1(n+1,0),s2(n+1,0);
FOR(i,1,n+1){
cin>>a[i];
s1[i]=s1[i-1]+a[i];
if(a[i]>0) s2[i]=s2[i-1]+a[i];
else s2[i]=s2[i-1];
}
ll ans=0;
FOR(i,1,n+1){
if(i+k-1>n) break;
ans=max(ans,s1[i+k-1]-s1[i-1]+s2[i-1]+s2[n]-s2[i+k-1]);
ans=max(ans,s2[i-1]+s2[n]-s2[i+k-1]);
}
cout<<ans<<endl;
}
|
#include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main()
{
int n;
cin >> n;
vector<ll> wa;
ll sum = 0;
for (int i = 1; i <= n; i++) {
ll now;
cin >> now;
if (now != 0) {
sum += now;
} else {
wa.push_back(sum);
sum = 0;
}
}
if (sum > 0) wa.push_back(sum);
ll result = 0;
for (auto x : wa) {
result += x / 2;
}
cout << result << endl;
}
| 0
| 46,181,993
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int r,l;
int rmax = 0, lmin = n;
vector<int> c(n+1);
for(int i = 0; i < m; ++i){
cin >> r >> l;
rmax = max({rmax,r});
lmin = min({lmin,l});
}
int res = max({lmin-rmax+1,0});
cout << res << endl;
}
|
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1e9+7;
int levenshtein(string s, string t){
int lenS = s.length();
int lenT = t.length();
vector<vector<int>> dp(lenS+1, vector<int>(lenT+1));
rep(i, lenS+1){
dp[i][0] = i;
}
rep(i, lenT+1){
dp[0][i] = i;
}
rep(i, lenS){
rep(j, lenT){
dp[i+1][j+1] = min(dp[i+1][j]+1, dp[i][j+1]+1);
int c = s[i] == t[j] ? 0 : 1;
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j] + c);
}
}
return dp[lenS][lenT];
}
signed main(){
string s1, s2;
cin >> s1 >> s2;
cout << levenshtein(s1, s2) << endl;
return 0;
}
| 0
| 10,178,093
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int y,m,d;
char a,b;
cin>>y>>a>>m>>b>>d;
if(m <= 04){
cout<<"Heisei";
}
else{
cout<<"TBD";
}
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 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
const ll mod=1e9+7;
const int inf=1<<30;
int main(){
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(all(a));
vector<pii> o(0);
for(int i=1;i<n-1;i++){
if(a[i]<0){
o.push_back(pii(a[n-1],a[i]));
a[n-1]-=a[i];
}
else{
o.push_back(pii(a[0],a[i]));
a[0]-=a[i];
}
}
o.push_back(pii(a[n-1],a[0]));
cout << o[n-2].first-o[n-2].second << endl;
rep(i,o.size()){
cout << o[i].first << " " << o[i].second << endl;
}
}
| 0
| 29,575,350
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 5e2 + 2;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
int sum = 0;
for (int i = 0, x; i < m; i++) {
cin >> x;
sum += x;
}
if (n - sum < 0) return cout << -1, 0;
cout << n - sum;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int dx[4] = {-1, 0, 0, 1};
const int dy[4] = {0, -1, 1, 0};
const int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const string dir8[8] = {"U", "RU", "R", "RD", "D", "LD", "L", "LU"};
#define MAX_N 100000
#define MAX 100000
#define INFTY (1<<30)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define REP(i, N) for (int i = 0; i < (int)(N); ++i)
#define SLN(i,N) (i == N-1 ? "\n" : " ")
ll fact(ll n) { ll res = 1; for(ll i=2;i<=n;++i) res = res * i; return res;}
ll nCr(ll n, ll r) {return (fact(n)/fact(n-r)*fact(r)) ;}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const ll MOD = 1e9+7;
const ll INF = 1LL << 60;
const int inf = 1000100011;
class Point { public: double x, y; Point(double x = 0, double y = 0) : x(x), y(y) {} Point operator+(Point p) { return Point(x + p.x, y + p.y); } Point operator-(Point p) { return Point(x - p.x, y - p.y); } Point operator*(double a) { return Point(a * x, a * y); } Point operator/(double a) { return Point(x / a, y / a); } double abs() { return sqrt(norm()); } double norm() { return x * x + y * y; } bool operator<(const Point& p) const { return x != p.x ? x < p.x : y < p.y; } bool operator==(const Point& p) const { return fabs(x - p.y) < EPS && fabs(y - p.y) < EPS; } };
typedef Point Vector;
double norm(Vector a) { return a.x * a.x + a.y * a.y; }
double abs(Vector a) { return sqrt(norm(a));}
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
struct Segment { Point p1, p2; };
typedef Segment Line;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<string> s(N);
vector<int> sab(N);
int nfb = 0, nba = 0, bab = 0;
REP(i, N) cin >> s[i];
for (int i = 0; i < N; i++) {
int cnt = 0;
if (s[i][0] == 'B' && s[i][s[i].size() - 1] == 'A') {
bab++;
} else if (s[i][s[i].size() - 1] == 'A') {
nba++;
} else if (s[i][0] == 'B') {
nfb++;
}
for (int j = 0; j < s[i].size() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
cnt++;
}
}
sab[i] = cnt;
}
ll ans = 0;
REP(i, N) ans += sab[i];
if (bab == 0) {
ans += min(nba, nfb);
} else {
if (nba + nfb > 0) {
ans += bab + min(nba, nfb);
} else if (nba + nfb == 0) {
ans += bab - 1;
}
}
cout << ans << endl;
return 0;
}
| 0
| 80,474,683
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
vector<ll> score(n);
ll ans = 0;
rep(i, n) {
cin >> a[i] >> b[i];
score[i] = a[i] + b[i];
ans += a[i];
}
sort(score.rbegin(), score.rend());
rep(i, n) {
if (i % 2) ans -= score[i];
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define FI freopen("input.txt","r",stdin)
#define FO freopen("output.txt","w",stdout)
#define PrintCase(i) printf("Case %d: ",i)
#define sc(a) scanf("%d",&a)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define MAX 1000000
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
bool isPrime(ll a)
{
for(ll i=2;i*i<=a;i++)
if(a%i==0)
return false;
return true;
}
bool isPowerOfTwo(ll a)
{
if(a==1)
return true;
if(a&1)
return false;
while(a)
{
a/=2;
if(a!=1 && a&1)
return false;
if(a==1)
return true;
}
return true;
}
ll gcd(ll a, ll b)
{
if(a<0 || b<0)
{
a = abs(a);
b = abs(b);
}
if(a<b)
swap(a,b);
if(a%b==0 || b==0)
return b;
else
return gcd(b,a%b);
}
ll lcm(ll a, ll b)
{
return (a*b)/gcd(a,b);
}
ll power(ll base, ll exponent)
{
ll ans = 1;
for(ll i=1;i<=exponent;i++)
ans*=base;
return ans;
}
bool isPowerOfX(ll x, ll value)
{
if(value==1)
return true;
while(value)
{
value/=x;
if(value%x && value!=1)
return false;
}
return true;
}
ll X_or(ll for1, ll for2, ll value)
{
ll arr[7];
arr[3] = for1^for2;
arr[4] = arr[3]^for2;
arr[5] = arr[4]^arr[3];
cout<<arr[3]<<" "<<arr[4]<<" "<<arr[5]<<" ..... \n";
if(value%3==0)
{
return arr[3];
}
else
{
ll ret = ((value%3)==1)?arr[4] : arr[5];
return ret;
}
}
ll X_nor(ll for1, ll for2, ll value)
{
ll arr[7];
arr[3] = ~(for1^for2);
if(arr[3]<0)
arr[3]*=(-1);
arr[4] = ~(arr[3]^for2);
if(arr[4]<0)
arr[4]*=(-1);
arr[5] = ~(arr[3]^arr[4]);
if(arr[5]<0)
arr[5]*=(-1);
cout<<arr[3]<<" "<<arr[4]<<" "<<arr[5]<<" ..... \n";
if(value%3==0)
{
return arr[3];
}
else
{
ll ret = (value%3==1)? arr[4] : arr[5];
return ret;
}
}
int main()
{
ll x,y;
cin>>x>>y;
(y>=(2*x) && y<=(4*x) && !(y&1))?cout<<"Yes\n":cout<<"No\n";
return 0;
}
| 0
| 30,483,360
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int n,a;
cin>>n>>a;
n*=n;
n-=a;
cout<<n<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
int main(int argc, char **argv)
{
ll N, K, S; cin >> N >> K >> S;
vector<ll> res;
for (ll i = 0; i < K; ++i)
res.push_back(S);
ll t;
if (S == 1000000000)
t = 1000000000-1;
else
t = 1000000000;
for (ll i = K; i < N; ++i)
res.push_back(t);
for (auto e : res)
std::cout << e << " ";
}
| 0
| 42,054,642
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
string s; cin >> s;
for(int i = 0; i <4; i++){
if((i == 0 && s[i] != 'Y' ) || (i == 1 && s[i] != 'A')
|| (i == 2 && s[i] != 'K') || (i == 3 && s[i] != 'I' )){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <iostream>
using namespace std;
struct Heap {
int *heapTable;
int length;
int curr;
Heap () {
this->heapTable = new int[20000001];
this->length = 0;
this->curr = 1;
}
void add (int valor) {
this->heapTable[this->curr] = valor;
this->curr++;
this->length++;
}
void bottomUp() {
if (this->length > 1) {
int k = this->length;
int v = this->heapTable[k];
bool heapConfirm = false;
while (!heapConfirm && k > 1) {
int j = k / 2;
if (v <= this->heapTable[j]) {
heapConfirm = true;
} else {
this->heapTable[k] = this->heapTable[j];
this->heapTable[j] = v;
k = j;
}
}
}
}
void upDown() {
int k = 1;
int v = this->heapTable[k];
bool heapConfirm = false;
while (!heapConfirm) {
int j = 2 * k;
if (j < this->curr) {
if (this->heapTable[j] < this->heapTable[j+1]) {
j = j + 1;
}
} if (v >= this->heapTable[j]) {
heapConfirm = true;
} else {
this->heapTable[k] = this->heapTable[j];
k = j;
}
}
this->heapTable[k] = v;
}
void extract () {
int aux = this->heapTable[1];
this-> heapTable[1] = this->heapTable[length];
this->heapTable[length] = 0;
this->curr--;
this->length--;
cout << aux << endl;
}
void printArray() {
for (int i = 0; i < this->length+1; i++) {
cout << this->heapTable[i] << " ";
}
cout << "\n";
}
};
int main () {
Heap *heap = new Heap();
bool stop = false;
while (!stop) {
string action = "";
int valor = 0;
cin >> action;
if (action == "end") {
stop = true;
}
else if (action == "insert") {
cin >> valor;
heap->add(valor);
heap->bottomUp();
} else {
heap->extract();
heap->upDown();
}
}
}
| 0
| 29,862,156
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a/gcd(a, b) * b;
}
vector<ll> binary_count (ll n) {
vector<ll> ret;
ll target = n+1;
ll now = 2;
while(now/2 <= target){
if(now == 2){
ret.push_back((target/2)%2);
now *= 2;
continue;
}
ret.push_back((max(0LL,(target%now)-(now/2)))%2);
now *= 2;
}
return (ret);
}
ll powll(ll a, ll x){
if(x == 0) return 1;
else return powll(a, x-1)*a;
}
int main()
{
cout << fixed << setprecision(15);
ll A, B;
cin >> A >> B;
vector<ll> Aans = binary_count(A-1);
vector<ll> Bans = binary_count(B);
ll Aans10 = 0;
for(ll i=0; i<Aans.size(); i++){
if(Aans[i] == 1){
Aans10 += powll(2, i);
}
}
ll Bans10 = 0;
for(ll i=0; i<Bans.size(); i++){
if(Bans[i] == 1){
Bans10 += powll(2, i);
}
}
cout << (Aans10 ^ Bans10) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout<<x<<"\n";
#define deB(x,y) cout<<x<<" "<<y<<"\n";
#define Deb(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n";
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";
#define No cout<<"No\n";
#define clt(x) 63-__builtin_clzll(x)
#define bct(x) __builtin_popcountll(x)
#define all(v) (v).begin(),(v).end()
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pair<ll,ll>>
#define maxq priority_queue<ll>
#define minq priority_queue<ll,vector<ll>, greater<ll>>
#define cont continue;
#define reto return 0;
#define sz size()
#define spmod 1116295198451
#define mod 1000000007
#define md 998244353
#define N 2e5+10
ll dp[2009];
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll n;
cin>>n;
dp[0]=1;
ll i=1,j;
while(i<=n)
{
j=3;
while(j<=i-3)
{
dp[i]+=dp[j];
dp[i]%=mod;
j++;
}
if(i>2)
dp[i]++;
dp[i]%=mod;
i++;
}
deb(dp[n]);
}
| 0
| 88,656,393
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
cin>>n>>m;
k=n*m;
if(k%2==0)
cout<<"Even"<<endl;
else
cout<<"Odd"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<ll,ll>
#define ll long long
#define endl '\n'
void solve()
{
ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;
string s, r, y;
cin>>s;
n=s.length();
vector<ll>v(n+1,0);
ll rig=0,lef=0;
rep(i,0,n)
{
if(s[i]=='<') rig++;
else rig=0;
v[i+1]=rig;
}
per(i,n-1,-1)
{
if(s[i]=='>') lef++;
else lef=0;
v[i]=max(v[i],lef);
}
rep(i,0,n+1) k+=v[i];
cout<<k;
}
int main()
{
ios_base::sync_with_stdio(false);
cin. tie(0);cout. tie(0);
ll t=1;
while(t--)
{
solve();
}
return 0;
}
| 0
| 66,751,157
|
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll ans[2001];
int main() {
int s;
cin >> s;
for(int i = 3; i < 2001; ++i) {
ans[i] = 1;
}
for(int i = 3; i <= s; ++i) {
for(int j = 3; j <= i; ++j) {
ans[i] = (ans[i] + ans[i-j]) % mod;
}
}
cout << ans[s];
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
int main() {
int n; cin >> n;
int adj[n][n] = {};
for (int i = 0; i < n; i++) {
int u, k; cin >> u >> k;
for (int j = 0; j < k; j++) {
int v; cin >> v;
adj[u-1][v-1] = 1;
}
}
int d[n];
fill(d, d+n, -1);
queue<int> que;
que.push(0);
d[0] = 0;
while(!que.empty()) {
int v = que.front(); que.pop();
for (int i = 0; i < n; i++) {
if(adj[v][i] == 1 && d[i] == -1) {
que.push(i);
d[i] = d[v] + 1;
}
}
}
for (int i = 0; i < n; i++) {
cout << i+1 << ' ' << d[i] << endl;
}
}
| 0
| 47,705,955
|
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(ll i=0;i<(n);++i)
#define _rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define _repe2(i,n) for(ll i=0;i<=(ll)(n);++i)
#define _repe3(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);++i)
#define repe(...) _overload3(__VA_ARGS__,_repe3,_repe2)(__VA_ARGS__)
#define _rrep2(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define _rrep3(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2)(__VA_ARGS__)
#define _rrepe2(i,n) for(ll i=(ll)(n);i>=0;i--)
#define _rrepe3(i,a,b) for(ll i=(ll)(b);i>=(ll)(a);i--)
#define rrepe(...) _overload3(__VA_ARGS__,_rrepe3,_rrepe2)(__VA_ARGS__)
#define all(x) (x).begin(),(x).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(b<a){a=b;return 1;}return 0;}
ll N;
vl A;
void solve();
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
cin >> N;
A = vl(N);
for(int i = 0; i < N; ++i){
cin >> A[i];
}
solve();
}
void solve(){
ll sum=0;
ll mx=A[0];
rep(i,1,N){
sum+=max(0LL,mx-A[i]);
chmax(mx,A[i]);
}
cout<<sum<<endl;
}
|
#include <iostream>
#include <utility>
#include <string>
using namespace std;
struct Card{char suit; int value;};
void bubbleSort(struct Card C[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(C[j].value<C[j-1].value) swap(C[j],C[j-1]);
}
}
}
void selectionSort(struct Card C[],int n){
for(int i=0;i<n;i++){
int minj=i;
for(int j=i;j<n;j++){
if(C[j].value<C[minj].value) minj=j;
}
swap(C[i],C[minj]);
}
}
int main(){
int n; cin >> n;
struct Card C[n],D[n];
for(int i=0;i<n;i++){
string str;
cin >> str;
C[i].suit=str[0];
D[i].suit=str[0];
C[i].value=str[1]-'0';
D[i].value=str[1]-'0';
}
bubbleSort(C,n);
for(int i=0;i<n;i++){
if(i==n-1) cout << C[i].suit << C[i].value << endl;
else cout << C[i].suit << C[i].value << " ";
}
cout << "Stable" << endl;
selectionSort(D,n);
for(int i=0;i<n;i++){
if(i==n-1) cout << D[i].suit << D[i].value << endl;
else cout << D[i].suit << D[i].value << " ";
}
bool isStable=true;
for(int i=0;i<n;i++){
if(C[i].suit != D[i].suit){
isStable=false;
break;
}
}
if(isStable) cout << "Stable" << endl;
else cout << "Not stable" << endl;
}
| 0
| 14,459,510
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 998244353
#define INF LLONG_MAX/2
#define PI acos(-1.0)
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;
typedef priority_queue<int> PQi;
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;}
void vout(Vi &v){for(int i=0;i<(v).size();i++) cout<<v[i]<<" ";cout<<endl;}
void vout(Vs &v){for(int i=0;i<(v).size();i++) cout<<v[i]<<" ";cout<<endl;}
void vvout(VVi &v){for(int i=0;i<(v).size();i++) vout(v[i]);}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int mypow(int x, int n, int m){if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int digit(int k,int i){string s = to_string(k);return s[s.size()-i]-'0';}
void uniq(Vi &v){sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end());}
int ctoi(char c){if(c>='0'&&c<='9'){return c-'0';}return 0;}
int leng(int n){string s=to_string(n); return s.size();}
int digitsum(int n){int ret=0; while(n>0){ret+=n%10;n/=10;}return ret;}
int lesscount(int x,Vi &a){return lower_bound(a.begin(),a.end(),x)-a.begin();}
int orlesscount(int x,Vi &a){return upper_bound(a.begin(),a.end(),x)-a.begin();}
int morecount(int x,Vi &a){return a.size()-orlesscount(x,a);}
int ormorecount(int x,Vi &a){return a.size()-lesscount(x,a);}
int count(int x,Vi &a) {return upper_bound(ALL(a),x)-lower_bound(ALL(a),x);}
Vi accum(Vi &v){Vi ret((v).size()+1);REP(i,0,(v).size()) ret[i+1]=ret[i]+v[i];return ret;}
bool comp(Pii a,Pii b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
signed main(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);
int n;
cin>>n;
Vi d(n);
REP(i,0,n){
cin>>d[i];
if(i==0) if(d[i]!=0) {cout<<0<<endl;return 0;}
if(i!=0) if(d[i]==0) {cout<<0<<endl;return 0;}
}
int maxd=*max_element(ALL(d));
map<int,int> ma;
REP(i,0,n){
ma[d[i]]++;
}
int ans=1;
REP(i,0,maxd){
if(ma[i]==0){cout<<0<<endl;return 0;}
ans = (ans * mypow(ma[i],ma[i+1],MOD))%MOD;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP0(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define RREP0(i,n) for(int i=n-1; i>=0; --i)
#define RREP1(i,n) for(int i=n; i>=1; --i)
#define SORT(c) sort((c).begin(),(c).end())
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long LL;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<string> Vs;
typedef pair<int, int> Pii;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(int argc, char const *argv[]) {
cin.tie(0); ios::sync_with_stdio(false);
int H,tmp; std::cin >> H;
Vi h; h.reserve(H);
REP0(i,H){ std::cin >> tmp; h.PB(tmp); }
REP1(i,H){
std::cout << "node " << i << ": key = " << h[i-1] << ", ";
if (i!=1) std::cout << "parent key = " << h[i/2-1] << ", ";
if (i*2<=H) std::cout << "left key = " << h[i*2-1] << ", ";
if (i*2+1<=H) std::cout << "right key = " << h[i*2] << ", ";
std::cout << '\n';
}
return 0;
}
| 0
| 54,182,115
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
const ll INF = LLONG_MAX/3;
const int N = 100000;
struct edge{
int to;
ll cost;
};
vector<edge> G[N];
ll x[N];
void dfs(int v){
for(const auto &e:G[v]){
if(x[e.to]==INF){
x[e.to] = x[v]+e.cost;
dfs(e.to);
}
}
}
int main(){
int n,m;
cin >>n >>m;
vector<int> l(m),r(m),d(m);
rep(i,m){
cin >>l[i] >>r[i] >>d[i];
--l[i];
--r[i];
G[l[i]].pb({r[i],d[i]});
G[r[i]].pb({l[i],-d[i]});
}
fill(x,x+N,INF);
rep(i,n){
if(x[i]==INF){
x[i] = 0;
dfs(i);
}
}
string ans = "Yes";
rep(i,m){
if(x[r[i]] - x[l[i]] != d[i]) ans = "No";
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> vs;
for (int i = 0; i < h; i++) {
string s;
cin >> s;
vs.push_back(s);
}
for (int i = 1; i <= 2 * h; i++) {
cout << vs[(i + 1) / 2 - 1] << endl;
}
}
| 0
| 4,027,820
|
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define ll long long
using namespace std;
int main() {
string s, t, r;
cin >> s >> t >> r;
char ss = s[0] - 0x20, tt = t[0] - 0x20, rr = r[0] - 0x20;
cout << ss << tt << rr << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
#define rep1(i,n) for(int i=1;i<=int(n);++i)
int main(void){
int n;
cin >> n;
vector<ll> a(n+1), p(n+1), s(n+1);
rep(i,n+1) {
cin >> a[i];
}
if (n == 0) {
cout << ((a[0] == 1) ? 1 : -1) << endl;
return 0;
}
if (a[0] == 1) {
cout << -1 << endl;
return 0;
}
s[n] = a[n];
p[n] = 0;
for (int d = n-1; d >= 0; d--) {
s[d] = s[d+1] + a[d];
p[d] = s[d] - a[d];
if (p[d] <= 0) {
cout << -1 << endl;
return 0;
}
}
s[0] = p[0] = 1;
rep1(d,n){
p[d] = min(p[d-1]*2 - a[d], p[d]);
if (p[d] < 0) {
cout << -1 << endl;
return 0;
}
}
cout << accumulate(all(p), 0LL) + accumulate(all(a), 0LL) << endl;
return 0;
}
| 0
| 9,838,575
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<P>>;
int main() {
int N;
cin >> N;
Graph G(N);
rep(i, N-1) {
int a, b, c;
cin >> a >> b >> c;
a--; b--;
G[a].push_back(P(b, c));
G[b].push_back(P(a, c));
}
int Q, K;
cin >> Q >> K;
K--;
vector<int> x(Q), y(Q);
rep(i, Q) {
cin >> x[i] >> y[i];
x[i]--; y[i]--;
}
vector<ll> dist(N, -1);
queue<int> que;
dist[K] = 0;
que.push(K);
while (!que.empty()) {
int v = que.front(); que.pop();
for (P nv: G[v]) {
if (dist[nv.first] != -1) continue;
dist[nv.first] = dist[v] + nv.second;
que.push(nv.first);
}
}
rep(i, Q) {
cout << dist[x[i]] + dist[y[i]] << endl;
}
return 0;
}
| 0
| 25,260,673
|
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double n, m, d;
cin >> n >> m >> d;
cout << setprecision(12) << fixed << (d == 0 ? 1 : 2) * (m - 1) * (n - d) / (n * n) << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
while( true ) {
long long int n;
cin >> n;
if ( n == 0 ) break;
long long int ans = 0;
long long int k = 0;
long long int l = 0;
long long int r = 0;
for ( long long int i = 0; i < n; i++ ) {
string in;
cin >> in;
if ( in == "lu" ) {
l = 1;
}else if ( in == "ru" ) {
r = 1;
}else if ( in == "ld" ) {
l = 0;
}else {
r = 0;
}
if ( k == 0 && l == 1 && r == 1 ) {
k = 1;
ans++;
}
if ( k == 1 && l == 0 && r == 0 ) {
k = 0;
ans++;
}
}
cout << ans << endl;
}
return 0;
}
| 0
| 85,797,546
|
#include <iostream>
int main()
{
int i = 1;
while (1)
{
int a;
std::cin >> a;
if (std::cin.eof()) {
break;
}
if (a != 0) {
std::cout << "Case " << i << ": " << a << std::endl;
i += 1;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int i,m,nmin,nmax,a[200],gap,n;
while(1){
cin >> m >> nmin >> nmax;
if(m==0 && nmin == 0 && nmax == 0) break;
for(i=1;i<m+1;i++){
cin >> a[i];
}
gap = a[nmin] - a[nmin+1];
n = nmin;
for(i=nmin;i< nmax+1;i++){
if(a[i] - a[i+1] >= gap ){
gap = a[i]-a[i+1];
n = i;
}
}
cout << n << endl;
}
return 0;
}
| 0
| 86,378,247
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI=acos(-1.0);
ll a,b,c,k;
void input()
{
cin>>a>>b>>c>>k;
}
void solve()
{
if(k<=a) cout<<k<<endl;
else if(k<=a+b) cout<<a<<endl;
else cout<<a-(k-a-b)<<endl;
}
int main()
{
cin.tie();
ios::sync_with_stdio(false);
input();
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std ;
int main(){
string S ;
cin >> S ;
int N ;
N = S.size() ;
int cnt = 0 ;
for(int i = 1 ; i < N ; i++){
if((N-i)%2 == 0){
for(int j = 0 ; j < (N-i)/2 ; j++){
if(S.at(j) != S.at((N-i)/2 + j)){
cnt++ ;
}
}
if(cnt == 0) {
cout << N - i << endl ;
return 0 ;
}
cnt = 0;
}
}
}
| 0
| 48,055,551
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) for((i)=((n)-1);(i)>=(0);(i)--)
#define MOD 1000000007
signed main(){
int A,B;
cin>>A>>B;
cout<<A*(A-1)/2+(B-1)*B/2<<endl;
}
|
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int sum_of_digits(int n){
int sum = 0;
while(n>0){
sum += n%10;
n/=10;
}
return sum;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
int total = 0;
for (int i=0; i<=n; i++){
int sum = sum_of_digits(i);
if (sum >= a && sum <=b){
total +=i;
}
}
cout << total << endl;
}
| 0
| 76,419,645
|
#include <iostream>
#include <algorithm>
using namespace std;
void nextRand(int *x,int a,int b,int c){
*x = (a * (*x) + b) % c;
}
int main(){
while(true){
int n;
int a,b,c;
int x;
cin >> n >> a >> b >> c >> x;
if(n==0){
break;
}
int *reels = new int[n];
for(int i=0;i<n;i++){
cin >> reels[i];
}
int reelidx = 0;
int frame = -1;
for(int i=0;i<10001;i++){
if(x == reels[reelidx]){
reelidx++;
}
nextRand(&x,a,b,c);
if(reelidx == n){
frame = i;
break;
}
}
cout << frame << endl;
delete[] reels;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
vector<ll> L;
ll count = 0;
cin >> N;
L.resize(2 * N);
rep(i, 2 * N) cin >> L[i];
sort(L.begin(), L.end());
rep(i, N) count += L[2 * i];
cout << count << endl;
return 0;
}
| 0
| 98,934,916
|
#include <bits/stdc++.h>
using namespace std;
int conv(char c){
for (int i = 50; i<=57; i++){
if (c == i){
return i-48;
}
}
}
int main(){
string s;
cin >> s;
int64_t k;
cin >> k;
int answer = 1;
for (int64_t i = 0; i<k; i++){
if (s.at(i) != '1'){
answer = conv(s.at(i));
break;
}
}
cout << answer << endl;
}
|
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
void print(std::string s, int shuffle_num);
int main(void) {
std::string s;
int m;
std::cin >> s >> m;
while(s != "-") {
int shuffle_num = 0;
for (int i = 0; i < m; i++) {
int temp;
std::cin >> temp;
shuffle_num += temp;
}
print(s, shuffle_num);
std::cin >> s >> m;
}
return EXIT_SUCCESS;
}
void print(std::string s, int shuffle_num) {
int start = shuffle_num % s.size();
std::string s_cp = s.substr(start, s.size() - start) + s.substr(0, start);
std::cout << s_cp << std::endl;
return;
}
| 0
| 15,129,772
|
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(istream &is, vector<T> &v) { for(auto &it : v) is >> it; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep = ""; for(const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void dbg_out() { cerr << "\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
void solve(){
LL d, t, s;
cin >> d >> t >> s;
if(t*s >= d){
cout << "Yes\n";
}
else cout << "No\n";
}
int main()
{
Fast;
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int,int> cnt;
for(int i=0; i<n; i++){
int a;
cin >> a;
cnt[a]++;
}
ll ans=0;
for(auto p: cnt){
int x,num;
x = p.first;
num= p.second;
if(num>=x) ans+=(ll)(num-x);
else ans+=(ll)num;
}
cout << ans << endl;
}
| 0
| 31,114,486
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; (i) >= (int) (b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x
#define TRUE__ "YES"
#define FALSE__ "NO"
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define RS resize
#define CINV(v, N) do {\
v.RS(N);\
rep(i, N) cin >> v[i];\
} while (0);
#define RCINV(v, N) do {\
v.RS(N);\
rrep(i, N) cin >> v[i];\
} while (0);
#define MOD 1000000007
void init();
void solve();
signed main()
{
init();
solve();
}
int K;
priority_queue<pair<int, pair<int, int> > > q;
vector<int> cost;
vector<bool> f;
const int INF = INT_MAX;
void init()
{
cin >> K;
cost.RS(K, INF);
}
void solve()
{
cost[1] = 1;
q.push(MP(-1, MP(1, 10 % K)));
q.push(MP(-2, MP(1, 2 % K)));
while (!q.empty()) {
auto x = q.top();
q.pop();
int s = x.second.first;
int t = x.second.second;
int c = -x.first;
if (cost[t] != INF) continue;
cost[t] = c;
q.push(MP(-c, MP(t, t * 10 % K)));
q.push(MP(-c-1, MP(t, (t + 1) % K)));
}
cout << cost[0] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = 0x3F3F3F3F;
const int NEGINF = 0xC0C0C0C0;
const int NULO = -1;
const ll mod = 1e9 + 7;
const double EPS = 1e-10;
inline int cmp(double x, double y = 0)
{
if(fabs(x - y) < EPS)
return 0;
return x > y ? 1 : -1;
}
ll exp(ll a, ll b)
{
ll ans = 1;
while(b)
{
if(b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
const int maxn = 2e5 + 10;
ll fat[maxn], inv[maxn];
ll C(int n, int k)
{
if(n < k)
return 0;
if(n < 0 || k < 0)
return 0;
return (((fat[n] * inv[k]) % mod) * inv[n - k]) % mod;
}
void initFactorials()
{
fat[0] = 1;
inv[0] = 1;
for(int i = 1; i < maxn; i++)
{
fat[i] = (i * fat[i-1]) % mod;
inv[i] = exp(fat[i], mod - 2);
}
}
vector<int>job[maxn];
int main()
{
ios::sync_with_stdio(0);
int n,m;
cin >> n >> m;
for(int i = 1; i <= n ; i++)
{
int a,b;
cin >> a >> b;
job[a].push_back(b);
}
ll ans = 0;
priority_queue<int>pq;
for(int i = m - 1; i >= 0; i--)
{
for(const auto &x : job[m - i])
{
pq.push(x);
}
if(pq.size())
{
ans += pq.top();
pq.pop();
}
}
cout << ans << endl;
return 0;
}
| 0
| 80,642,243
|
#include <cstdio>
#include <algorithm>
#include <climits>
typedef long long ll;
const int max_t = 20;
ll dist[max_t][max_t];
int main() {
while (1) {
int n, t = 0;
scanf("%d", &n);
if (n == 0) break;
for (int i = 0; i < max_t; i++) {
std::fill(dist[i], dist[i] + max_t, INT_MAX);
}
for (int i = 0; i < n; i++) {
int from, to;
ll d;
scanf("%d%d%lld", &from, &to, &d);
t = std::max(t, from);
t = std::max(t, to);
dist[from][to] = d;
dist[to][from] = d;
}
for (int i = 0; i <= t; i++) {
dist[i][i] = 0;
}
for (int k = 0; k <= t; k++) {
for (int i = 0; i <= t; i++) {
for (int j = 0; j <= t; j++) {
dist[i][j] = std::min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
ll min_len = INT_MAX;
int start = -1;
for (int i = 0; i <= t; i++) {
ll len = 0;
for (int j = 0; j <= t; j++) {
if (j == i) continue;
len += dist[i][j];
}
if (len < min_len) {
min_len = len;
start = i;
}
}
printf("%d %lld\n", start, min_len);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
int blank = 16 - (A + B);
int flag = 0;
if(A<B){
swap(A,B);
}
for(int i=0; i <= blank; i++){
int C = A - i;
if(abs(C - B) == 1 || abs(C - B) == 0){
flag = 1;
}
else{
continue;
}
}
if(flag == 1){
cout << "Yay!" << endl;
}else{
cout << ":(" << endl;
}
}
| 0
| 63,824,959
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 5005;
const int MAX_K = 5005;
int N, K;
vector<int> a;
bool dp[MAX_N][MAX_K];
bool solve(int x){
memset(dp, false, sizeof(dp));
dp[0][0] = true;
rep (j, N){
rep (k, K){
if (dp[j][k]){
dp[j+1][k] |= true;
if (x != j && k + a[j] < K) dp[j + 1][k + a[j]] |= true;
}
}
}
rep (k, K){
if (dp[N][k] && k + a[x] >= K){
return true;
}
}
return false;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
a.clear(); a.resize(N, 0);
rep (i, N){
cin >> a[i];
}
sort(ALL(a));
int ok = N;
int ng = -1;
while(abs(ok - ng) > 1){
int mid = (ok + ng) / 2;
if (solve(mid)){
ok = mid;
}else{
ng = mid;
}
}
cout << ok << endl;
return 0;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
class union_find {
private:
vector<int> par;
vector<int> ran;
vector<ll> size;
public:
union_find(int n);
int find(int x);
void unite(int x, int y);
bool same(int x, int y);
ll show_size(int x);
};
union_find::union_find(int n){
par.resize(n);
ran.resize(n);
size.resize(n);
rep(i,n) par[i] = i;
rep(i,n) ran[i] = 0;
rep(i,n) size[i] = 1;
};
int union_find::find(int x) {
if(par[x] == x) return x;
else return par[x] = find(par[x]);
};
void union_find::unite(int x, int y) {
x = find(x);
y = find(y);
if(x == y) return;
ll t = show_size(x)+show_size(y);
size[x] = size[y] = t;
if(ran[x] < ran[y]){
par[x] = y;
}
else{
par[y] = x;
if(ran[x] == ran[y]) ran[x]++;
}
};
ll union_find::show_size(int x) {
if(par[x] == x) return size[x];
return show_size(par[x] = find(par[x]));
}
bool union_find::same(int x, int y) {
return (find(x) == find(y));
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
union_find uf(n);
rep(i,m){
int a, b;
cin >> a >> b;
--a; --b;
uf.unite(a, b);
}
int ans = 0;
rep(i,n){
chmax(ans, (int)uf.show_size(i));
}
cout << ans << endl;
return 0;
}
| 0
| 19,842,889
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
#define F first
#define S second
#define int ll
int32_t main(){
FAST
int n; cin >> n;
map<string, int> has;
string arr[n];
for(int i = 0; i < n; i++){
string s; cin >> s;
sort(s.begin(), s.end());
arr[i] = s;
has[s]++;
}
int ans = 0;
for(int i = 0; i < n; i++){
ans += has[arr[i]]*(has[arr[i]] - 1)/2;
has[arr[i]] = 1;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n ;
cin >> n ;
vector<ll> ans(n);
vector<ll> a(n);
rep(i, n){
cin >> a[i];
}
map<ll,pair<ll,ll>> m;
rep(i,n){
m[a[i]].first++;
if(m[a[i]].first==1)m[a[i]].second=i+1;
}
ll num=0,cnt,itr;
ll minitr;
ll sum=0;
for (auto i = m.rbegin(); i != m.rend(); ++i) {
if(num==0){
num=i->first;
cnt=i->second.first;
itr=i->second.second;
minitr=itr-1;
continue;
}
ans[minitr]+=(cnt+sum)*(num-i->first);
sum+=cnt;
num=i->first;
cnt=i->second.first;
itr=i->second.second;
minitr=min(minitr,itr-1);
}
ans[minitr]+=(cnt+sum)*num;
for(auto an:ans)cout << an << endl;
return 0;
}
| 0
| 45,891,803
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 2e5 + 5;
const int mod = 1e9 + 7;
int add(int x, int y) {
return ((x + y) % mod + mod) % mod;
}
int mul(int x, int y) {
return (1LL * x * y) % mod;
}
int fp (int x, int y) {
if (!y) return 1;
int acc = fp(x, y / 2);
acc = mul(acc, acc);
if (y & 1) acc = mul(acc, x);
return acc;
}
int fact[A], inv[A];
void pre() {
fact[0] = inv[0] = 1;
for (int i = 1; i < A; i++) {
fact[i] = mul(fact[i - 1], i);
inv[i] = fp(fact[i] , mod - 2);
}
}
int ncr(int n, int r) {
return mul(fact[n], mul(inv[n - r], inv[r]));
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
n++, pre();
int ans = 0;
for (int i = k; i <= n; i++) {
int l = ncr(i, 2) , r = add(ncr(n, 2), -ncr(n - i, 2));
ans = add(ans, add(add(r, -l), 1));
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
constexpr int ms = 1001;
constexpr ll mod = 1e9+7;
void solve() {
int h, w;
cin >> h >> w;
ll dp[ms][ms];
memset(dp, -1, sizeof(dp));
vector<string> vs(h);
for (int i = 0; i < h; ++i) {
cin >> vs[i];
}
function<ll(int i, int j)> calc_dp = [&] (int i, int j) {
if (i < 0 || j < 0)
return 0ll;
if (i == 0 && j == 0)
return 1ll;
if (vs[i][j] == '#')
return 0ll;
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = (calc_dp(i-1, j) + calc_dp(i, j-1)) % mod;
return dp[i][j];
};
cout << calc_dp(h-1, w-1) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
for (int i = 0; i < t; ++i) {
solve();
}
return 0;
}
| 0
| 13,147,144
|
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
if (a+b == 15) cout << "+\n";
else if (a*b == 15) cout << "*\n";
else cout << "x\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef pair<int, int> P;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
int N; cin >> N;
int A[N];
rep(i, N) cin >> A[i];
vector<P> l;
rep(i, N) l.pb(P(A[i], i));
sort(l.begin(), l.end());
reverse(l.begin(), l.end());
multiset<int> s = {-1, -1, N, N};
int ans = 0;
rep(i, N) {
P p = l[i];
int value = p.first, idx = p.second;
if (i>0) {
int prepre = *----s.lower_bound(idx);
int pre = *--s.lower_bound(idx);
int nex = *s.lower_bound(idx);
int nexnex = *++s.lower_bound(idx);
ans += value*((idx-pre)*(nexnex-nex)+(nex-idx)*(pre-prepre));
}
s.insert(idx);
}
cout << ans << endl;
}
| 0
| 58,835,322
|
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
template<typename T>
T ModPow(T s, T n)
{
T res = 1;
while(n) {
if (n & 1) {
res *= s;
res %= MOD;
}
s *= s;
s %= MOD;
n >>= 1;
}
return res;
}
template<typename T>
T ModInv(T n) {
return ModPow(n, MOD - 2);
}
template<typename T>
T ModnCr(T n, T r)
{
T x = 1, y = 1;
rep(i, r) {
x *= n-i;
x %= MOD;
y *= r-i;
y %= MOD;
}
T rtn = (x * ModInv(y)) % MOD;
return rtn;
}
ll func(ll n)
{
ll res = 1;
while(n) {
res *= n;
res %= MOD;
n--;
}
return res;
}
int main(void)
{
int x,y;
cin >> x >> y;
int d = 2 * x - y;
if(d%3 != 0) {
cout << 0 << endl;
} else {
ll a = x - (2 * d) / 3;
ll b = d / 3;
if(a < 0 || b < 0) { cout << 0 << endl; return 0; }
ll ans = ModnCr(a+b,b);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
vector<vector<char>> c(52, vector<char>(52));
int H, W, cnt;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> c[i][j];
}
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (c[i][j] == '#' && c[i][j - 1] != '#' && c[i - 1][j] != '#' && c[i][j + 1] != '#' && c[i + 1][j] != '#') cnt++;
}
}
if (cnt == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 69,465,760
|
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int H, W;
cin >> H >> W;
string s[60];
for (int i = 0; i < H; i++) cin >> s[i];
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (s[i][j] == '.') continue;
bool ok = false;
for (int k = 0; k < 4; k++) {
int x = i + dx[k], y = j + dy[k];
if (x < 0 || x >= H || y < 0 || y >= W) continue;
if (s[x][y] == '#') ok = true;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define RS resize
#define CLR clear
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define LLI long long int
using namespace std;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T,U>;
template <typename T> T gcd(T a, T b){a = abs(a); b = abs(b); if(a<b) swap(a,b); while(b>0){a %= b; swap(a,b);} return a;}
template <typename T> T lcm(T a, T b){return (1LL * a * b) / gcd(a,b);}
template <typename T, typename U> P<T,U> operator+(const P<T,U> &a, const P<T,U> &b){return {a.first + b.first, a.second + b.second};}
template <typename T, typename U> P<T,U> operator-(const P<T,U> &a, const P<T,U> &b){return {a.first - b.first, a.second - b.second};}
template <typename T> bool isSquare(T n){T rt = sqrt(n); return rt*rt == n;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
if(!isSquare(1+8*n)){
cout << "No" << endl;
return 0;
}
int k = ((int)sqrt(1+8*n)+1)/2;
cout << "Yes" << endl;
cout << k << endl;
vector<vector<int>> s(k);
int t = 1;
FOR(i,0,k){
FOR(j,t,t+k-1-i){
s[i].push_back(j);
}
FOR(j,0,k-1-i){
s[i+j+1].push_back(t+j);
}
t += k-1-i;
}
REP(i,k){
cout << k-1 << " ";
REP(j,s[i].size()){
if(j!=0) cout << " ";
cout << s[i][j];
}
cout << endl;
}
return 0;
}
| 0
| 77,750,637
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long i,j,k,a,b,c=0,d=0,n,m,t;
cin>>a>>b>>c>>d;
n=min(a,b);
m=min(c,d);
cout<<n+m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int MAX = 2e6;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll x, y, i, j;
cin >> x >> y;
if ((x+y)%3!=0){
cout << 0 << endl;
return 0;
}
i = y - (x+y)/3;
j = x - (x+y)/3;
ll num = i + j;
COMinit();
ll ans = COM(i+j, i);
cout << ans << endl;
}
| 0
| 42,545,164
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n,p;
cin>>n>>p;
cout<<(n+1)-p<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,a,b;
cin >> n >> a >> b;
if (a <= b){
if (n == 1){
if (a == b){
cout << 1 << endl;
}
else{
cout << 0 << endl;
}
}
else if (n == 2){
cout << 1 << endl;
}
else{
ll l = a + b*(n-1);
ll s = a*(n-1) + b;
cout << l-s+1 << endl;
}
}
else{
cout << 0 << endl;
}
}
| 0
| 44,906,885
|
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "bitset"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 1e-7;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<set<int>>edge(N);
for (int i = 1; i < N; i++) {
cin >> L >> R;
L--;
R--;
edge[L].insert(R);
edge[R].insert(L);
}
queue<int>Q;
int three = 0;
for (int i = 0; i < N; i++) {
if (edge[i].size() == 1)Q.push(i);
else if (edge[i].size() >= 3)three++;
}
while (three) {
if (Q.empty()) {
cout << "First\n";
return 0;
}
vector<vector<int>>parent(N);
set<int>nxq;
while (!Q.empty()) {
int cn = Q.front();
int node = 0;
int n = cn;
int nx = n;
int depth = 0;
Q.pop();
while (edge[nx].size() < 2) {
node++;
n = nx;
nx = *edge[n].begin();
edge[n].erase(nx);
edge[nx].erase(n);
}
if (edge[nx].size() == 2)three--;
if (node % 2) {
edge[n].insert(nx);
edge[nx].insert(n);
if (edge[nx].size() == 3)three++;
parent[nx].push_back(n);
}
if (edge[nx].size() == 2)nxq.insert(nx);
if (!three) {
node = 0;
for (auto i : edge)if (i.size() == 2)node++;
if (node % 2)cout << "First\n";
else cout << "Second\n";
return 0;
}
}
for (int i = 0; i < N; i++) {
if (edge[i].size() == 1)Q.push(i);
}
if (clock() > CLOCKS_PER_SEC * 1900 / 1000) {
cout << "First\n";
return 0;
}
}
int node = 0;
for (auto i : edge)if (i.size() == 2)node++;
if (node % 2)cout << "First\n";
else cout << "Second\n";
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int bfrv[4][3][10] = {0};
int n;
cin >> n;
int t = n;
int b, f, r, v;
while (t)
{
cin >> b >> f >> r >> v;
bfrv[b-1][f-1][r-1] += v;
t--;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
cout << " " << bfrv[i][j][k];
}
cout << endl;
}
if (i < (4-1))
cout << "####################" << endl;
}
return 0;
}
| 0
| 4,452,255
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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; }
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using M = map<int, int>;
using Ml = map<ll, ll>;
ll const INF = 1ll<<61;
double pi = 3.141592653589793238;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
cout << *max_element(a.begin(), a.end()) - *min_element(a.begin(), a.end()) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#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(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
#define dump(x) cerr<<#x<<": "<<x<<endl;
#define bit(k) (1LL<<(k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << "{" <<p.first << ", " << p.second << "}";
return os;
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = (ll)1e9+7;
const double PI = acos(-1.0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll N;
cin >> N;
vector<int> p(N);
rep(i,N){
cin >> p[i];
p[i]--;
}
ll d = 20000 + 1;
vector<ll> a(N),b(N);
a[0] = 1;
rep(i,N-1)a[i+1] = a[i] + d;
b.back() = 1;
int start = 0;
rep(i,N){
if(p[i] == N - 1)start = i;
}
for(int i = start; i+1 < N; i++){
ll y = p[i];
ll x = p[i+1];
ll delta_a = abs(a[y] - a[x]);
if(x < y){
b[x] = b[y] + delta_a + 1;
}
else{
b[x] = b[y] - delta_a + 1;
}
}
for(int i = start; i - 1 >= 0; i--){
ll y = p[i-1];
ll x = p[i];
ll delta_a = abs(a[x] - a[y]);
if(x < y){
b[y] = b[x] - delta_a - 1;
}
else{
b[y] = b[x] + delta_a - 1;
}
}
rep(i,N){
cout << a[i] << " ";
}
cout << endl;
rep(i,N){
cout << b[i] << " ";
}
cout << endl;
}
| 0
| 7,946,046
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
const double PI = 3.1415926535897932;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main()
{
int S, W;
cin >> S >> W;
int TW = W * 2;
if (S <= W) {
cout << "unsafe" << endl;
}
else {
cout << "safe" << endl;
}
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#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++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
auto ctoi = [&] (char c) {
if (c >= '0' && c <= '9') return c - '0';
return -1;
};
string s;
cin >> s;
int k;
cin >> k;
int l = min(k,(long long)s.size());
rep(i,l) {
int a = ctoi(s[i]);
if (a == 1) continue;
else {
cout << a << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
| 0
| 31,085,129
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N,A,B;
cin >>N>>A>>B;
ll ans=0;
rep2(i,N){
ll now=i;
ll sum=0;
while(now){
sum+=now%10;
now/=10;
}
if(sum<=B && sum>=A){
ans+=i;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <map>
#include <algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int>a(n);
rep(i,n){
cin >> a[i];
}
sort(a.rbegin(),a.rend());
map<int,int>mp;
const int d = a[0];
rep(i,n){
mp[a[i]]++;
}
for(int i = d; i >= d/2+1; i--){
mp[i]-=2;
}
if(d%2==0){
mp[d/2]--;
}
for(auto &x:mp){
if(x.second < 0){
cout << "Impossible" << endl;
return 0;
}else if(x.second > 0){
if(x.first <= (d+1)/2){
cout << "Impossible" << endl;
return 0;
}
}
}
cout << "Possible" << endl;
return 0;
}
| 0
| 66,789,363
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n, m;
cin >> n >> m;
int x[n+1], y[m+1];
cin >> x[0] >> y[0];
for(int i=0; i<n; i++) cin >> x[i+1];
for(int i=0; i<m; i++) cin >> y[i+1];
sort(x, x+n+1);
sort(y, y+m+1);
string ans;
if(x[n]>=y[0]) ans = "War";
else ans = "No War";
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include<string>
using namespace std;
int main()
{
int n;
int b;
int f;
int r;
int v;
int count[4][3][10]={0};
int i;
int j;
int k;
cin >> n;
for(i=0;i<n;i++)
{
cin >> b >> f >> r >>v;
count[b-1][f-1][r-1]+=v;
}
for(i=0;i<4;i++)
{
for(j=0;j<3;j++)
{
for(k=0;k<10;k++)
{
cout << " " << count[i][j][k];
}
cout <<"\n";
}
if(i==3)
break;
cout <<"####################\n";
}
}
| 0
| 23,585,296
|
#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i <= (ll)(n); ++i)
#define MAX 500000001000000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N,M;
cin >> N >> M;
ans = (100*(N-M) + 1900*M) * pow(2,M);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,m;
cin >> n >> m;
vector<vector<ll>>s(m);
for(ll i=0;i<m;i++){
ll k;
cin >> k;
for(ll j=0;j<k;j++){
ll x;
cin >> x;
s[i].push_back(x-1);
}
}
vector<ll>p(m);
for(ll i=0;i<m;i++){
cin >> p[i];
}
ll ans=0;
for(ll i=0;i<(1<<n);i++){
bool judge=true;
for(ll j=0;j<m;j++){
ll lamp=0;
for(ll id:s[j]){
if((i >> id) & 1){
lamp++;
}
}
lamp%=2;
if(lamp!=p[j]){
judge=false;
}
}
if(judge) ans++;
}
cout << ans << endl;
}
| 0
| 60,405,948
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define nl cout<<"\n"
#define dbg(x) cout<<x<<" ";
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define UM unordered_map<int,int>
#define ULL unordered_map<ll,int>
void fun(){
int n,m,x,y; cin>>n>>m>>x>>y;
int mn=INT_MAX,mx=INT_MIN;
fi(0,n){
int k; cin>>k;
mx=max(k,mx);
}
fi(0,n){
int k; cin>>k;
mn=min(k,mn);
}
if(mn>x&&mn<=y&&mx<mn)
cout<<"No War\n";
else
cout<<"War\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
fun();
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
ll stock=0;
ll yen=1000;
int i=0;
while(i<n)
{
while(i+1<n&&a[i]>=a[i+1])
{
i++;
}
if(i<n)
{
stock+=yen/a[i];
yen=yen%a[i];
}
while(i+1<n&&a[i]<=a[i+1])
{
i++;
}
if(i<n)
{
yen+=stock*a[i];
stock=0;
}
if(i==n-1)
break;
}
if(yen>1000)
cout<<yen;
else
cout<<"1000";
return 0;
}
| 0
| 77,910,283
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int main() {
int n;
ll k;
cin >> n >> k;
vector<pair<int,int>>s;
rep(i,n) {
int a,b;
cin >> a >> b;
s.push_back(make_pair(a,b));
}
sort(s.begin(),s.end());
ll sum = 0;
int ans = 0;
rep(i,n) {
sum += s[i].second;
if(sum >= k) {
ans = s[i].first;
break;
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
ll mod=1e9+7;
vector<ll> tfact(1e7+1);
void fact(ll n) {
for(ll i=0;i<=n;i++) {
if(i==0) {
tfact[i]=1;
}
else {
tfact[i]=tfact[i-1]*i%mod;
}
}
}
int main() {
ll n;
string s;
cin >> n >> s;
n*=2;
vector<ll> d(n);
d[0]=-1;
for(ll i=0;i<n-1;i++) {
if(s[i]==s[i+1]) {
d[i+1]=-d[i];
}
else {
d[i+1]=d[i];
}
}
if(s[0]=='W'||s[n-1]=='W'||d[n-1]==-1) {
cout << 0 << endl;
return 0;
}
ll l=1;
ll ans=1;
for(ll i=1;i<n;i++) {
if(d[i]==1) {
ans=ans*l%mod;
l--;
if(l<0) {
cout << 0 << endl;
return 0;
}
}
else {
l++;
}
}
fact(n/2);
ans=ans*tfact[n/2]%mod;
if(ans<0||l!=0) {
ans=0;
}
cout << ans << endl;
}
| 0
| 12,090,742
|
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
#define patkan 9
#define ff first
#define ss second
#define abs(x) (((x) < 0)?-(x):(x))
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
using cat = long long;
#ifdef DONLINE_JUDGE
#define lld I64d
#endif
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int N;
cin >> N;
vector<cat> X[2];
X[0].resize(N);
X[1].resize(N);
for(int i = 0; i < N; i++) cin >> X[0][i] >> X[1][i];
for(int i = 1; i < N; i++) if((X[0][i]+X[1][i]-X[0][0]-X[1][0])%2 != 0) {
cout << "-1\n";
return 0;
}
vector<cat> lengths;
for(int i = 0; i < 33; i++) lengths.push_back(1LL<<i);
if((X[0][0]+X[1][0])%2 == 0) lengths.push_back(1);
int L = lengths.size();
cout << L << "\n";
for(int i = 0; i < L; i++) cout << lengths[i] << ((i == L-1) ? "\n" : " ");
for(int i = 0; i < N; i++) {
string s;
for(int j = 0; j < L; j++) s += '?';
string dir = "UDLR";
int d[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};
for(int j = L-1; j >= 0; j--) {
cat maxdist = 0;
for(int k = 0; k < j; k++) maxdist += lengths[k];
cat l = lengths[j];
for(int k = 0; k < 4; k++) {
if(abs(X[0][i]-d[k][0]*l)+abs(X[1][i]-d[k][1]*l) > maxdist) continue;
X[0][i] -= d[k][0]*l;
X[1][i] -= d[k][1]*l;
s[j] = dir[k];
break;
}
}
cout << s << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = 1<<30;
const ll mod = 1000000007LL;
int main() {
ll N,K;
cin>>N>>K;
vector<ll> v(N);
for(ll i = 0LL; i < N; i++) cin>>v[i];
vector<ll> S(N);
for(ll i = 0LL; i < N; i++){
if(i==0LL) S[i]=v[i];
else S[i]=S[i-1]+v[i];
}
unordered_map<ll,ll> m;
for(ll i = 0LL; i < N-1; i++){
for(ll j = i+1; j < N; j++){
m[S[j]-S[i]]++;
}
}
for(ll i = 0LL; i < N ;i++) m[S[i]]++;
ll cnt = 0LL;
ll M = S[N-1];
while(M>0LL) {
M=(M>>1);
cnt++;
}
ll ans = 0LL;
for(ll i = cnt; i >=0LL; i--){
ll x = ans + (1LL<<i);
ll num = 0;
for(auto y:m){
if((y.first&x)==x) num+= y.second;
}
if(num>=K) ans=x;
}
cout<<ans<<endl;
}
| 0
| 76,309,199
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << 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; }
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 upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int main() {
int n, m;
cin >> n >> m;
V a(n + 1);
VL modsum(n + 1, 0);
map<ll, int> mp;
mp[0]++;
rep1(i, n) {
cin >> a[i];
modsum[i] += modsum[i - 1] + a[i];
modsum[i] %= m;
mp[modsum[i]]++;
}
ll ans = 0;
for (auto c : mp) {
ll x = c.second;
ans += x * (x - 1) / 2;
}
cout << ans << endl;
return 0;
}
|
#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 n;
cin >> n;
int now=0;
int ans=0;
int cnt=0;
rep(i,n){
int m;
cin >> m;
if(now<m){
ans=max(ans,cnt);
now = m;
cnt=0;
}
else{
++cnt;
now = m;
}
}
ans = max(ans,cnt);
cout << ans;
return 0;
}
| 0
| 97,222,674
|
#include<bits/stdc++.h>
int main(){
int N,K;
std::cin>>N>>K;
std::vector<long long> A(N),S(N+1),black(N+1);
for(int i=0;i<N;++i){
std::cin>>A[i];
S[i+1]=S[i]+A[i];
black[i+1]=black[i]+((A[i]>0)?A[i]:0);
}
long long ans=-1e18,tmp;
for(int i=0;i<=N-K;++i){
tmp = (S[i+K]-S[i]>0)?(S[i+K]-S[i]):0;
tmp += black[i]+black[N]-black[i+K];
ans = std::max(ans,tmp);
}
std::cout<<ans<<std::endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
void init(){
cin.tie(0);
ios::sync_with_stdio(false);
}
int fac[310000];
int inv(int x){
if(x==1) return 1;
return (M-M/x)*inv(M%x)%M;
}
int comb(int n,int k){
int x=(fac[k]*fac[n-k])%M;
return (fac[n]*inv(x))%M;
}
int fac_init(int n){
fac[0]=1;
FOR(i,1,n+1){
fac[i]=fac[i-1]*i;
fac[i]%=M;
}
}
main(){
int n;
cin>>n;
int c[110000]={};
int r,s;
fac_init(n+2);
rep(i,n+1){
int a;
cin>>a;
if(c[a]){
r=c[a];
s=i;
}else{
c[a]=i+1;
}
}
r--;
s=n-s;
FOR(k,1,n+2){
int res=comb(n+1,k);
if(r+s>=k-1)
res-=comb(r+s,k-1);
cout<<(res+M)%M<<endl;
}
}
| 0
| 77,063,604
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
ll n;
ll add(ll x, ll y){
if(y < 0){
return (x + y + n) % n;
}else{
return (x + y) % n;
}
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n; cin >> n;
ll a[n];
ll sum = 0;
for(int i=0;i<n;i++){
cin >> a[i];
sum += a[i];
}
ll sumn = n * (n + 1) / 2;
if(sum % sumn != 0){
cout << "NO" << endl;
return 0;
}
ll ops = sum / sumn;
ll d[n];
for(int i=0;i<n-1;i++){
d[i] = a[i+1] - a[i];
}
d[n-1] = a[0] - a[n-1];
for(int i=0;i<n;i++){
if((ops - d[i]) < 0 || (ops - d[i]) % n != 0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
ll n;
ll a;
ll b;
ll x = 0;
ll y = 0;
ll ans = 0;
cin >> n >> a >> b;
x = n % (a+b);
y = n / (a+b);
if (x > a){
ans = y * a + a;
}
if (x <= a){
ans = y * a + x;
}
cout << ans;
return 0;
}
| 0
| 35,971,215
|
#include <iostream>
int main(){
int a, b, c, count=0;
std::cin >> a >> b >> c;
for(; a <= b; a++) if(c%a==0) count++;
std::cout << count << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = (int) 1e9 + 7;
int mul(int a, int b) {
return (long long) a * b % mod;
}
int main() {
int n;
string s;
cin >> n >> s;
vector<int> color;
for (auto c : s) {
color.push_back(c == 'B');
}
int res = 1, choices = 0;
for (auto c : color) {
c ^= (choices & 1);
if (c == 0) {
if (choices == 0) {
res = 0;
break;
}
else {
res = mul(res, choices);
choices--;
}
}
if (c == 1) {
choices++;
}
}
int ans = (choices == 0) ? res : 0;
for (int i = 1; i <= n; i++) {
ans = mul(ans, i);
}
cout << ans << '\n';
return 0;
}
| 0
| 2,067,306
|
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#define long long
using namespace std;
int main() {
int n;
cin>>n;
float a[n],sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
float avg,ans=0;
avg=round(sum/n);
for(int i=0;i<n;i++){
ans+=pow((avg-a[i]),2);
}
cout<<ans;
}
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
static const double EPS = 1e-5;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
const int INF = 1e6;
int main(void){
int n;
int cost[10][10];
while(cin>>n){
if(n==0) break;
REP(i,10)REP(j,10) cost[i][j] = INF;
REP(i,n){
int a,b,c;
cin>>a>>b>>c;
cost[a][b] = cost[b][a] = c;
}
REP(k,10)REP(i,10)REP(j,10)cost[i][j] = min(cost[i][j],cost[i][k]+cost[k][j]);
int ans = INF;
int ansi;
REP(i,10){
int tmp=0;
REP(j,10)tmp+=(cost[i][j]!=INF&&i!=j)?cost[i][j]:0;
if(tmp!=0&&ans>tmp){
ans = tmp;
ansi = i;
}
}
cout<<ansi<<" "<<ans<<endl;
}
return 0;
}
| 0
| 44,894,426
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
int main()
{
int n, p;
cin >> n >> p;
string s;
cin >> s;
if(10 % p == 0 ){
ll ans = 0;
rep(r,n){
if((s[r] - '0') % p == 0) {
ans += r + 1;
}
}
cout << ans << endl;
return 0;
}
vector<int> d(n+1);
int ten = 1;
for (int i = n-1; i >= 0; i--){
int a = (s[i]-'0') * ten % p;
d[i] = (d[i+1] + a) % p;
ten *= 10; ten %= p;
}
vector<int> cnt(p);
ll ans = 0;
for (int i = n; i >= 0; i--){
ans += cnt[d[i]];
cnt[d[i]]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, o, p;
int n, a, b;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> o >> a >> b;
p = s.substr(a, b - a + 1);
if (o == "print") {
cout << p << '\n';
continue;
} else if (o == "reverse") {
reverse(p.begin(), p.end());
} else {
cin >> p;
}
s = s.substr(0, a) + p + s.substr(b + 1);
}
return 0;
}
| 0
| 26,048,506
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<vector<int>> W(M);
for (int i = 0; i < N; i++){
int A, B;
cin >> A >> B;
if (M - A >= 0){
W[M - A].push_back(B);
}
}
int ans = 0;
priority_queue<int> pq;
for (int i = M - 1; i >= 0; i--){
for (int j : W[i]){
pq.push(j);
}
if (!pq.empty()){
ans += pq.top();
pq.pop();
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 55;
ll n, x, ans;
ll dp[50], len[50];
void sim(int layer) {
if (!x) return;
if (layer == 0) {
x--;
ans++;
} else {
x--;
if (!x) return;
if (x >= len[layer - 1]) {
x -= len[layer - 1];
ans += dp[layer - 1];
if (x) {
x--;
ans++;
} else return;
if (!x) return;
if (x >= len[layer - 1]) {
x -= len[layer - 1];
ans += dp[layer - 1];
} else {
sim(layer - 1);
x--;
}
} else {
sim(layer - 1);
x--;
}
}
}
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> x;
dp[0] = 1, len[0] = 1;
for (int i = 1; i < n; i++) {
dp[i] = 2ll * dp[i - 1] + 1ll;
len[i] = len[i - 1] * 2 + 3;
}
sim(n);
cout << ans;
}
| 0
| 93,951,016
|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
int main() {
ll N;
cin >> N;
vector<ll> p(N), inv_p(N+1);
REP(i, N) {
cin >> p[i];
inv_p[p[i]-1] = i+1;
}
ll delta = 3e4;
vector<ll> a(N), b(N);
REP(i, N) {
a[i] = delta*(ll(i+1));
b[i] = delta*ll(N-(i+1)) + inv_p[i];
}
for(ll x: a) cout << x << " ";
cout << endl;
for(ll x: b) cout << x << " ";
cout << endl;
return 0;
}
|
#include <iostream>
#include<time.h>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include<cctype>
#include<iterator>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define bitrep(bit,A) for(int bit=A; ;bit=(bit-1)&A)
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) (ll)((a).size())
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
#define chmax(x,a) x=c_max(x,a)
#define chmin(x,a) x=c_min(x,a)
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define SORT(c) stable_sort(ALL(c))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX_6 1001001
#define MAX_7 10010010
#define SENTINEL 2000000000
#define NIL -1
#define MOD 1000000007
#define INF 1<<30
#define INFTY 1000000000000000001LL
#define MAX_INT INT_MAX
#define Endl '\n'
#define greater greater<int>()
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
using Graph=vector<vector<ll> >;
VI calc_next(const VI &ar){
VI res;
for(auto val:ar){
for(int j=-1;j<=1;j++){
int add=(val%10)+j;
if(add>=0&&add<=9)res.push_back(val*10+add);
}
}
return res;
}
int main(){
int k;cin>>k;
VI all,cur;
for(int v=1;v<10;++v)cur.push_back(v),all.push_back(v);
for(int d=1;d<10;++d){
cur=calc_next(cur);
for(auto val:cur)all.push_back(val);
}
cout<<all[k-1]<<Endl;
}
| 0
| 80,795,828
|
#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,m;
cin >> n >> m;
vector<int> p(m);
vector<bool> s(m);
for(int i = 0; i < m; i++){
string tmp;
cin >> p[i] >> tmp;
p[i]--;
if(tmp == "AC") s[i] = true;
else s[i] = false;
}
vector<pair<bool, int> > cnt(n,make_pair(false, 0));
for(int i = 0; i < m; i++){
if(cnt[p[i]].first == true) continue;
if(s[i] == false) cnt[p[i]].second++;
if(s[i] == true) cnt[p[i]].first = true;
}
int ans1 = 0;
int ans2 = 0;
for(int i = 0; i < n; i++){
if(cnt[i].first == true){
ans1++;
ans2 += cnt[i].second;
}
}
cout << ans1 << " " << ans2 << endl;
return 0;
}
|
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(long long int i = 1;i <= n; i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
typedef long long int ll;
typedef long double ld;
const ll INF = (1LL << 60);
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
fill((T*)array, (T*)(array + N), val);
}
int main() {
ll n, k, a[15], sum, ans = INF; cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, (1 << n)) {
int cnt = 0;
rep(j, n) {
if (i & (1 << j))cnt++;
}
if (cnt == k) {
sum = 0; ll h = a[0];
req(l, n - 1) {
if (i & (1 << l)) {
sum += max((ll)0, h - a[l] + 1);
h = max(h + 1, a[l]);
}
else h = max(h, a[l]);
}
ans = min(ans, sum);
}
}cout << ans << endl;
}
| 0
| 51,378,539
|
#include<iostream>
#include<vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= end; --i)
#define arep(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int k = 1;
while (true) {
if (2 * N < k * (k - 1)) {
cout << "No" << endl;
return 0;
}
else if (2 * N == k * (k - 1)) break;
++k;
}
vector<vector<int>> s(k);
int now = 1;
rep(i, 0, k) {
rep(j, i + 1, k) {
s[i].push_back(now);
s[j].push_back(now);
++now;
}
}
cout << "Yes" << endl;
cout << k << endl;
rep(i, 0, k) {
cout << s[i].size() << ' ';
rep(j, 0, s[i].size()) {
cout << s[i][j] << ' ';
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main () {
ll r, l ;
cin >> l >> r ;
if(r - l > 3000){
cout << 0 << endl ;
return 0 ;
}
ll ans = INF ;
for(ll i = l; i <= r; i++){
for(ll j = l; j <= r; j++){
if(i >= j) continue ;
ll t = (i%2019 * j%2019) % 2019 ;
ans = min(ans, t) ;
}
}
cout << ans << endl ;
}
| 0
| 20,661,056
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s); i < (int)(n+1); i++)
#define repr(i,n) for (int i = (n-1); i>=0;i--)
#define repr3(i,n) for(int i = (n);i>0;i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
#define INF const ll INF = 1001001001;
#define PI const ld PI = 3.14159265358979323846;
int main() {
int R,G;
cin>>R>>G;
cout<<2*G-R<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int INF=1e9;
int main(){
ll n,k;
ll a[100100];
while(cin>>n>>k&&(n||k)){
REP(i,n)cin>>a[i];
ll sum=0,ans=0;
REP(i,n){
if(i<k){
sum+=a[i];
}else{
ans=max(ans,sum);
sum-=a[i-k];
sum+=a[i];
ans=max(ans,sum);
}
}
cout<<ans<<endl;
}
}
| 0
| 90,609,212
|
#include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define db double
#define inf 200001
#define INF (int)1e9
#define mod (int)(1e9+7)
#define pi acos(-1)
#define rd(n) {n=0;char ch;int f=0;do{ch=getchar();if(ch=='-'){f=1;}}while(ch<'0'||ch>'9');while('0'<=ch&&ch<='9'){n=(n<<1)+(n<<3)+ch-48;ch=getchar();}if(f)n=-n;}
using namespace std;
int n;
struct edge{
int y,nxt;
edge(){}
edge(int yy,int nn){
y=yy,nxt=nn;
}
}e[inf*2];
int head[inf],ecnt;
void addedge(int x,int y){
ecnt++;
e[ecnt]=edge(y,head[x]);
head[x]=ecnt;
return;
}
int siz[inf],fa[inf],far[inf],cnts[inf];
void dfs1(int u,int last){
fa[u]=last;
siz[u]=1;
int mx=0;
for (int i=head[u];i;i=e[i].nxt){
int v=e[i].y;
if (v==last){
continue;
}
cnts[u]++;
dfs1(v,u);
mx=max(mx,far[v]+1);
siz[u]+=siz[v];
}
if (cnts[u]==1){
far[u]=mx;
}
return;
}
void dfs2(int u){
int cnt=0;
for (int i=head[u];i;i=e[i].nxt){
int v=e[i].y;
if (v==fa[u]){
continue;
}
dfs2(v);
if (siz[v]>0){
cnt++;
}
}
if (cnt>=2){
puts("First");
exit(0);
}
if (u==1 && cnt==0){
puts("First");
exit(0);
}
if (u==1 && cnt==1){
puts("Second");
exit(0);
}
if (cnt==0){
return;
}
if (cnt==1){
siz[u]=-1;
}
return;
}
int main(){
rd(n)
if (n==2){
puts("Second");
return 0;
}
int x,y;
for (int i=1;i<n;i++){
rd(x) rd(y)
addedge(x,y);
addedge(y,x);
}
dfs1(1,0);
dfs2(1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define INF 10000000000000000
#define rep(i,n) for(int i=0;i<n;i++)
int n,a,b;
signed main(){
cin>>n>>a>>b;
if(a+b-1>n||a*b<n){
puts("-1");
return 0;
}
int x=n-a;
for(int i=n-a+1;i<=n;i++)cout<<i<<" ";
for(int i=2;i<=b;i++){
int t=min(x-b+i,a);
for(int j=x-t+1;j<=x;j++)cout<<j<<" ";
x-=t;
}
return 0;
}
| 0
| 6,153,096
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.