code1
stringlengths 54
12k
| code2
stringlengths 71
12k
| similar
int64 0
1
| __index_level_0__
int64 0
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
int C;
int D;
cin >> A >> B >> C >> D ;
if ((A+B)>(C+D)) {cout << "Left" << endl;}
else if ((A+B)==(C+D)) {cout << "Balanced" << endl;}
else if ((A+B)<(C+D)) {cout << "Right" << endl;}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template <class T = int>T in(){
T x;
cin >> x;
return (x);
}
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int N = in(),T = in();
vector<int> st(N);
REP(i,N)st[i] = in();
int cut = 0;
REP(i,N-1){
cut += max(0,st[i+1] - st[i] - T);
}
int answer = st[N-1]-cut+T;
cout << answer << "\n";
}
| 0
| 73,800,054
|
#include <bits/stdc++.h>
#define sort stable_sort
using namespace std;
int _;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
printf((a+b)%3 && a%3 && b%3 ?"Impossible\n":"Possible\n");
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <queue>
#include <cctype>
#include <climits>
#include <stack>
using namespace std;
template <typename T>
class UF{
public:
T par[10000],rank[10000];
inline UF(T n){
for(T i=0;i<n;i++){
par[i]=i;
rank[i]=0;
}
}
inline T find(T x){
if(par[x]==x)
return x;
else
return par[x]=find(par[x]);
}
inline void unite(T x, T y){
x=find(x);
y=find(y);
if(x==y) return;
if(rank[x]<rank[y])
par[x]=y;
else{
par[y]=x;
if(rank[x] == rank[y]) rank[x]++;
}
}
inline bool same(T x, T y){
return find(x)==find(y);
}
};
int main(){
int n,q;
scanf("%d %d",&n,&q);
UF<int> uf(n);
int c,x,y;
while(q--){
scanf("%d %d %d",&c,&x,&y);
if(c)printf("%d\n",uf.same(x,y));
else uf.unite(x,y);
}
}
| 0
| 49,907,297
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N,M,K;
cin >> N >> M >> K;
for(int y=0;y<=N;y++){
for(int x=0;x<=M;x++){
if(K == (M*y - y*x + x*(N-y))){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());return ret;}
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 ctoi(char c) {return c-'0';}
ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
ll lcm(ll a,ll b){ll g = gcd(a,b);return a/g*b;}
bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
ll modpow(ll a,ll n, ll mod){ll res = 1;while(n>0){if (n%2==1){res = res * a % mod;}a = a * a % mod;n/=2;}return res;}
int main() {
ll n,k;
cin >> n >>k;
vector<ll>loop(n),value(n);
for(int i=0;i<n;i++){
cin >> loop.at(i);
loop.at(i)--;
}
for(int i=0;i<n;i++){
cin >> value.at(i);
}
ll ans = -1e17;
for(int i=0;i<n;i++){
ll kei =0;
vector<ll>memo;
memo.push_back(0);
ll next = loop.at(i);
for(int j=0;j<k;j++){
next = loop.at(next);
if(j==0)next=loop.at(i);
kei+=value.at(next);
memo.push_back(kei);
if(memo.size()>1){
memo.at(memo.size()-1)=max(memo.at(memo.size()-1),memo.at(memo.size()-2));
}
ans = max(ans,kei);
if(next==i){
if(kei<0)break;
else{
ll kai = j+1;
ll check = k/kai*kei + memo.at(k%kai);
ans = max(check,ans);
check = ((k/kai)-1)*kei+memo.at(memo.size()-1);
ans = max(check,ans);
break;
}
}
}
}
cout<<ans<<endl;
}
| 0
| 38,581,705
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> sum(n, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
ll cnt = 1;
for (ll i = 0; i < a.size(); i++) {
if (i != 0) {
sum[i] += sum[i - 1] + a[i];
} else {
sum[i] = a[i];
}
}
for (ll i = n - 2; i >= 0; i--) {
if (a[i] * 2 >= a[n - 1]) {
cnt++;
} else {
if (sum[i] * 2 >= a[i + 1]) {
cnt++;
} else {
break;
}
}
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
int main() {
i64 n, m, v, p; scanf("%lld%lld%lld%lld", &n, &m, &v, &p);
std::vector<i64> a(n);
for(int i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(begin(a), end(a));
auto f = [&](int t) {
if(a[t] + m < a[n - p]) return false;
i64 V = std::max(0L, v - (p - 1 + t + 1));
i64 rem = V * m;
for(int i = t + 1; i <= n - p; i++) rem -= std::min(m, (a[t] + m) - a[i]);
return rem <= 0;
};
int ok = n - p, ng = -1;
while(std::abs(ok - ng) > 1) {
int mid = (ok + ng) >> 1;
if(f(mid)) ok = mid;
else ng = mid;
}
printf("%d\n", n - ok);
return 0;
}
| 0
| 2,398,647
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }
ll LCM(ll a, ll b) { return a/GCD(a, b)*b; }
int n;
vector<ll> A(100100, 0);
int main() {
cin >> n;
for(int i = 0; i <= n; ++i) cin >> A.at(i);
vector<ll> sumleft(n+2, 0);
vector<ll> sumright(n+2, 0);
for(int i = n; i >= 0; --i) {
if(i == n) {
sumleft.at(n) = A.at(n);
sumright.at(n) = A.at(n);
}else {
sumleft.at(i) = (sumleft.at(i+1)+1)/2 + A.at(i);
sumright.at(i) = sumright.at(i+1) + A.at(i);
}
}
if(sumright.at(0) >= 1 && sumleft.at(0) <= 1) {
ll ans = 0;
ll limit = 1;
for(int i = 0; i <= n; ++i) {
if(i == 0) {
ans += 1;
limit *= 2;
}else {
ll cnt = min(limit, sumright.at(i));
ans += cnt;
cnt -= A.at(i);
limit = cnt*2;
}
}
cout << ans << endl;
}else {
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
#define int long long
#define pq priority_queue
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
map<string, int> anag;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (anag.find(s) != anag.end()) {
anag[s]++;
} else {
anag[s] = 1;
}
}
int no_pairs = 0;
for (map<string, int>::iterator it = anag.begin(); it != anag.end(); it++) {
no_pairs += (it -> second) * ((it -> second) - 1) / 2;
}
cout << no_pairs;
}
| 0
| 75,317,254
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll K, S, c = 0, z;
cin >> K >> S;
for (int x = 0; x <= min(K, S); x++) {
for (int y = 0; y <= min(K, S - x); y++) {
z = S - x - y;
if (0 <= z && z <= K) c++;
}
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = unsigned long long;
using pii = pair<int, int>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7,maxn = 100000000;
const double PI = acos(-1);
ll fexp(ll base, ll p){
ll ans = 1;
while (p){
if (p&1) ans*= base;
base*=base;
p >>= 1;
}
return ans;
}
int main (){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<pii> student(n), check(m);
for (auto& it : student) cin >> it.ff >> it.ss;
for (auto& it : check) cin >> it.ff >> it.ss;
for (pii stu: student){
int dist = oo, ans;
for (int i=0; i<m; i++){
if (abs(stu.ff - check[i].ff) + abs(stu.ss - check[i].ss) < dist){
dist = abs(stu.ff - check[i].ff) + abs(stu.ss - check[i].ss);
ans = i+1;
}
}
cout << ans << endl;
}
return 0;
}
| 0
| 55,583,243
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a==b && a==c) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define mfill(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x,y,h,w) if(0<=x&&x<h&&0<=y&&y<w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug(...) 42
#endif
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;using vvint = vector<vector<int>>;
using vll = vector<ll>;using vvll = vector<vector<ll>>;
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b){if(a>b){a=b;return 1;}return 0;}
template <class T>void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class T>T gcd(T &a, T &b){if(a<b){swap(a,b);} T r = a%b; while(r!=0){a=b;b=r;r=a%b;} return b;}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
debug("debug test\n");
int n,m;cin>>n;
vint t(n), v(n);
vint a(n), b(n);
rep(i, n){
cin>>t[i];
}
rep(i, n){
cin>>v[i];
}
rep(i, n){
if(i == 0){
a[i] = 0;
}else{
a[i] = min(v[i-1], a[i-1]+t[i-1]);
}
}
for(int i = n-1;i >= 0;i--){
if(i == n-1){
b[i] = 0;
}else{
b[i] = min(v[i+1], b[i+1]+t[i+1]);
}
}
double ans = 0.0;
rep(i, n){
if(a[i] >= v[i]){
if(b[i] >= v[i]){
ans += (double)v[i]*(double)t[i];
}else if((double)b[i]+(double)t[i] >= (double)v[i]){
ans += (double)v[i]*(double)t[i] - (double)((double)v[i]-(double)b[i])*((double)v[i]-(double)b[i])/2.0;
}else{
ans += (double)b[i]*(double)t[i] + (double)t[i]*(double)t[i]/2.0;
}
}else{
if(b[i] >= v[i]){
if(a[i]+t[i] >= v[i]){
ans += (double)v[i]*(double)t[i] - (double)((double)v[i]-(double)a[i])*((double)v[i]-(double)a[i])/2.0;
}else{
ans += (double)a[i]*(double)t[i] + (double)t[i]*(double)t[i]/2.0;
}
}else{
if((double)((double)a[i]+(double)b[i]+(double)t[i])/2.0 > (double)v[i]){
ans += (double)v[i]*(double)t[i] - (double)((double)v[i]-(double)a[i])*((double)v[i]-(double)a[i])/2.0 - (double)((double)v[i]-(double)b[i])*((double)v[i]-(double)b[i])/2.0;
}else{
double koux = (double)(b[i]+t[i]-a[i])/2.0;
if(koux < 0.0){
ans += (double)t[i]*(double)b[i] + (double)t[i]*(double)t[i]/2.0;
}else if( koux > t[i]){
ans += (double)t[i]*a[i] + (double)t[i]*(double)t[i]/2.0;
}else{
ans += (double)koux*(2*(double)a[i]+koux)/2.0 + (double)((double)t[i]-koux)*(2*(double)b[i]+(double)t[i]-koux)/2.0;
}
}
}
}
}
printf("%.15f\n", ans);
return 0;
}
| 0
| 47,656,345
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
typedef pair<ll,ll> pll;
#define reps(i,f,n) for(int i = int(f); i <= int(n); i++)
#define rep(i,n) reps(i,0,int(n)-1)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sz size()
#define eb emplace_back
char str[12][6] ={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int mod[12] = {0,5,3,3,3,3,3,4,3,4};
int main(void){
int n;
cin >> n;
rep(test,n){
string s;
cin >> s;
int num = -1;
int cnt = -1;
rep(i,s.sz){
if(s[i] == '0'){
if(num != -1){
printf("%c", str[num][cnt%mod[num]]);
num = -1;
cnt = -1;
}
}else{
num = s[i] - '0';
cnt++;
}
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int>cnt(N+1, 0);
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
cnt[A]++;
}
sort(cnt.begin(), cnt.end());
int sum = 0;
vector<int>ans(N+1);
ans[0] = N+1;
for (int i = 1; i <= N; ++i) {
auto iter = lower_bound(cnt.begin(), cnt.end(), i);
sum += cnt.end() - iter;
ans[i] = sum / i;
}
for (int i = 1; i <= N; ++i) {
auto iter = upper_bound(ans.begin(), ans.end(), i, greater<int>());
cout << iter - ans.begin() - 1 << "\n";
}
return 0;
}
| 0
| 91,577,634
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
sort(s.begin(), s.end());
if (s == "abc")
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<numeric>
#include<map>
#include<limits>
using namespace std;
#define R(i,s,n) for(int i=s;i<n;i++)
#define D(i,n,s) for(int i=n-1;i>=s;i--)
typedef pair<int,int> P;
typedef unsigned long long ull;
typedef long long ll;
int main() {
int m,nmin,nmax;
while (cin >> m >> nmin >> nmax && m) {
int sco[m];
R(i,0,m) {
cin >> sco[i];
}
int tmp = 0;
int ans;
R(i,nmin-1,nmax) {
if (tmp <= sco[i]-sco[i+1]) {
tmp = sco[i]-sco[i+1];
ans = i+1;
}
}
cout << ans << endl;
}
return 0;
}
| 0
| 2,730,558
|
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i,n) ;for( int i =0; i < n ; i ++)
#define all(a) a.begin(),a.end()
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define f(i,a,b) for(int i=a;i<b;i++)
#define pri(a) printf("%.14lf\n",a);
#define sz(a) ((int)a.size())
#define MOD 1000000007
bool is_int_lround(double x){
return std::lround(x)==x;
}
ll keta(ll x){
ll n=0;
while(x>0){
x /=10 ;
n ++;
}
return n;
}
ll conbi(int n,int m){
cin>>n>>m;
vector<ll> a(100);
a[0] =1;
for(int i=0;i<14;i++){
a[i+1]=a[i]*(i+1);
}
return a[n] /(a[m] *a[n-m]);
}
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;
}
ll kaijoMOD(ll x){
ll z=1;
if(x==0){
return 1;
}
while(x>0){
z *=x;
z %=MOD;
x--;
}
return z;
}
ll div_num(ll n){
vl div(n+1,1);
for(ll i=2;i*i<=n;i++){
while(n%i==0){
n /=i;
div[i]++;
}
}
if(n!=1)div[n]++;
ll num=1;
for(ll i=0;i<=n;i++){
num*=div[i];
}
return num;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int keta_wa(int x){
int tot=0;
while(x>0){
tot +=x%10;
x/=10;
}
return tot;
}
long long lopow(ll a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a ;
a = a * a ;
n >>= 1;
}
return res;
}
int main(){
ll N;cin>>N;
map<ll,ll> yak;
for(ll i=2; i*i<=N;i++){
while(N%i==0){
N/=i;
yak[i]++;
}
}
if(N!=1)yak[N]++;
ll ans =0;
for(ll k=1;k<=40;k++){
for(auto x:yak){
if(x.second *2>=k*k+k && x.second *2<(k+1)*(k+2)){
ans +=k;
}
}
}
cout<< ans<<endl;
}
|
#include <bits/stdc++.h>
signed main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int ticket[3][3];
bool scratched[3][3] = {};
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
std::cin >> ticket[i][j];
}
}
int q;
std::cin >> q;
while (q--) {
int x;
std::cin >> x;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
scratched[i][j] |= (ticket[i][j] == x);
}
}
}
for (int i = 0; i < 3; i++) {
bool bingo = true;
for (int j = 0; j < 3; j++) {
bingo &= scratched[i][j];
}
if (bingo) {
std::cout << "Yes";
return 0;
}
}
for (int j = 0; j < 3; j++) {
bool bingo = true;
for (int i = 0; i < 3; i++) {
bingo &= scratched[i][j];
}
if (bingo) {
std::cout << "Yes";
return 0;
}
}
{
bool bingo = true;
for (int i = 0; i < 3; i++) {
bingo &= scratched[i][i];
}
if (bingo) {
std::cout << "Yes";
return 0;
}
}
{
bool bingo = true;
for (int i = 0; i < 3; i++) {
bingo &= scratched[i][3 - i - 1];
}
if (bingo) {
std::cout << "Yes";
return 0;
}
}
std::cout << "No";
return 0;
}
| 0
| 52,203,909
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,ans=0,p;
cin>>a>>b>>c;
if(a==b&&b==c){
cout<<0;
return 0;
}
while(1){
if(a%2==b%2&&b%2==c%2){
p=min(a,min(b,c));
if(a==p){
a+=2;
}
else if(b==p){
b+=2;
}
else{
c+=2;
}
ans++;
}
else if(a%2!=b%2&&a%2!=c%2){
b++;
c++;
ans++;
}
else if(b%2!=a%2&&b%2!=c%2){
a++;
c++;
ans++;
}
else if(c%2!=a%2&&c%2!=b%2){
a++;
b++;
ans++;
}
if(a==b&&b==c){
break;
}
}
cout<<ans;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
void Main() {
int H, W, D;
cin >> H >> W >> D;
map<int, pair<int, int>> A;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
int a;
cin >> a;
A.insert(make_pair(a, make_pair(i, j)));
}
}
int HW = H * W;
map<int, vector<int>> accums;
for (int i = 0; i < D; ++i) {
vector<int> acc;
acc.push_back(0);
int curr = (i == 0 ? D : i);
int next = i + D;
while (next <= HW) {
auto currA = A[curr];
auto nextA = A[next];
int cost = abs(currA.first - nextA.first) + abs(currA.second - nextA.second);
acc.push_back(acc.back() + cost);
curr = next;
next += D;
}
accums.insert(make_pair(i, acc));
}
int Q;
cin >> Q;
for (int q = 0; q < Q; ++q) {
int l, r;
cin >> l >> r;
const vector<int>& acc = accums[l % D];
int ans = acc[r / D] - acc[l / D];
cout << ans << endl;
}
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 0
| 50,999,223
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,M;
cin>>N>>M;
if((M/2)<=N)
cout<<M/2<<endl;
else{
int64_t ans=(N+(M/2))/2;
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string Sd, T;
cin >> Sd;
cin >> T;
string S = "UNRESTORABLE";
int start = 0;
vector<string> match_results;
bool containded = false;
rep(i, Sd.size() - T.size() + 1)
{
containded = true;
rep(j, T.size())
{
if (Sd.at(i + j) != T.at(j) && Sd.at(i + j) != '?')
{
containded = false;
}
}
if (containded)
{
string match_result = (Sd.substr(0, i) + T + Sd.substr(i + T.size(), Sd.size()));
replace(match_result.begin(), match_result.end(), '?', 'a');
match_results.push_back(match_result);
}
}
if (match_results.size() > 0)
{
sort(match_results.begin(), match_results.end());
S = match_results.at(0);
}
cout << S << endl;
return 0;
}
| 0
| 47,010,446
|
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
#define PI 3.14159265359
bool dp[100100];
int main () {
string S, T, U;
cin >> S >> T;
int A, B;
cin >> A >> B;
cin >> U;
if( U == S) A-=1;
if( U == T) B-=1;
cout << A << " " << B << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int ex[7]={1,2,4,8,16,32,64};
int n;
cin >> n;
rep(i,7){
if(ex[i]>n){
cout << ex[i-1];
return 0;
}
}
cout << ex[6];
return 0;
}
| 0
| 39,497,571
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
char c; cin>>c;
if(c=='A') cout<<"T\n";
else if(c=='T') cout<<"A\n";
else if(c=='G') cout<<"C\n";
else cout<<"G\n";
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
ll n, k;
cin >> n >> k;
vl a(n);
ll sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
sort(a.begin(), a.end());
auto check = [&](ll mid) {
if (a[mid] >= k)
return false;
bitset<5001> dp = 0;
dp[0] = 1;
for (int i = 0; i < n; ++i) {
if (i == mid)
continue;
if (a[i] <= 5000)
dp |= dp << a[i];
}
bool ok = true;
for (int i = max(0LL, k - a[mid]); i < k; ++i) {
if (dp[i] == 1) {
ok = false;
break;
}
}
return ok;
};
if (!check(0)) {
cout << 0 << "\n";
return 0;
} else if (check(n - 1)) {
cout << n << "\n";
return 0;
}
ll ok = 0;
ll ng = n - 1;
while (abs(ok - ng) != 1) {
ll mid = (ng + ok) / 2;
if (check(mid))
ok = mid;
else
ng = mid;
}
cout << ok + 1 << "\n";
return 0;
}
| 0
| 77,348,660
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/4
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
template<class T> inline bool chmax(T &a, T b){if(a < b){a = b;return true;}return false;}
template<class T> inline bool chmin(T &a, T b){if(a > b){a = b;return true;}return false;}
const int MOD = 1000000007;
ll bitpow(ll x,ll n){
ll ans = 1;
while(n > 0){
if(n%2 == 1) ans = ans * x % MOD;
x = x * x %MOD;
n = n >> 1;
}
return ans;
}
signed main(){
int n;
cin >> n;
vll a(n);
rep(i,n)cin >> a[i];
int bit[61] = {};
for(auto x:a){
rep(i,60){
if(x&(1LL<<i))bit[i]++;
}
}
int ans = 0;
rep(i,n){
int res = 0;
int pre = 0;
rep(j,80){
int cnt;
if(j < 60)cnt = bit[j];
else cnt = 0;
if(j < 60 && (a[i]&(1LL<<j)))cnt = n-cnt;
cnt += pre;
pre = cnt/2;
res += cnt%2 * bitpow(2,j);
res %= MOD;
}
ans = (ans+res)%MOD;
}
cout << ans*bitpow(2,MOD-2)%MOD << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,k,m,ans=0;
cin>>n;
vector<pair<pair<ll,ll>,ll> > a(2*n),b(n);
for(i=0;i<2*n;i++)
{
cin>>a[i].F.F>>a[i].F.S;
if(i>=n)
a[i].S = 1;
else a[i].S = 0;
}
sort(a.begin(),a.end());
set<ll> s;
ans=0;
for(i=0;i<2*n;i++)
{
if(a[i].S == 0)
s.insert(a[i].F.S);
else
{
auto it = s.lower_bound(a[i].F.S);
if(it!=s.begin())
{
it--;
s.erase(it);
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 92,386,313
|
#include <iostream>
using namespace std;
int sum(char *buf){
char *p = buf;
int sum = 0;
while(*p != 0){
if('0' <= *p && *p <= '9'){
sum += *p - '0';
}
p++;
}
return sum;
}
int main(int argc, char *argv[]){
char buf[1000+2];
while(1){
cin.getline(buf,sizeof(buf));
if (buf[0] == '0')break;
cout << sum(buf) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
int main()
{
while (1)
{
int n; cin >> n;
if (n == 0) return 0;
int f = 1;
int l = 0, r = 0;
int ans = 0;
rep(i, 0, n)
{
string s; cin >> s;
if (s == "lu")
l = 1;
else if (s == "ru")
r = 1;
else if (s == "ld")
l = 0;
else if (s == "rd")
r = 0;
if (f == l && f == r)
{
ans++;
f = (f + 1) % 2;
}
}
cout << ans << endl;
}
}
| 0
| 41,571,157
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
int main(){
int N, K;
scanf("%d", &N);
scanf("%d", &K);
long long ans = 0;
if (K%2==0){
int sho1 = N/K;
int sho2 = N/(K/2)-sho1;
ans = pow((long long)sho1, 3);
ans += pow((long long)sho2, 3);
} else {
int sho = N/K;
ans = pow((long long)sho, 3);
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(),(v).end()
#define FIN ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll mod = 1e9+7;
const ll inf = 1e15;
int main(){FIN
ll n,m;cin>>n>>m;
vll a(n);
REP(i,n) cin>>a[i];
vll rui(n+1,0);
ll sum=0;
REP(i,n){
sum += a[i];
rui[i+1] = sum % m;
}
map<ll,ll> mp;
REP(i,n+1) mp[rui[i]]++;
ll ans=0;
for(auto p:mp){
ans += p.second * (p.second-1) /2;
}
cout<<ans<<endl;
return 0;
}
| 0
| 110,365
|
#include<bits/stdc++.h>
#define LL long long
#define RG register
using namespace std;
template<class T> inline void read(T &x) {
x = 0; RG char c = getchar(); bool f = 0;
while (c != '-' && (c < '0' || c > '9')) c = getchar(); if (c == '-') c = getchar(), f = 1;
while (c >= '0' && c <= '9') x = x*10+c-48, c = getchar();
x = f ? -x : x;
return ;
}
template<class T> inline void write(T x) {
if (!x) {putchar(48);return ;}
if (x < 0) x = -x, putchar('-');
int len = -1, z[20]; while (x > 0) z[++len] = x%10, x /= 10;
for (RG int i = len; i >= 0; i--) putchar(z[i]+48);return ;
}
const int N = 3e5 + 10;
int a[N], n, m, s[N], b[N];
bool check(int x, int k) {
int p = lower_bound(a + 1, a + 1 + m, x) - a;
return s[p - 1] / x + m - p + 1 >= k;
}
int main() {
read(n);
for (int i = 1; i <= n; i++) read(b[i]);
sort(b + 1, b + 1 + n);
for (int i = 1; i <= n; i++)
if (b[i] != b[i - 1]) a[++m] = 1;
else a[m]++;
sort(a + 1, a + 1 + m);
for (int i = 1; i <= m; i++) s[i] = s[i - 1] + a[i];
for (int k = 1; k <= n; k++) {
int l = 1, r = s[m] / k;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(mid, k)) l = mid + 1;
else r = mid - 1;
}
printf("%d\n", l - 1);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n;
ll ans=0;
cin>>n;
map<int,int> mp;
rep(i,n) {
int temp;
cin>>temp;
mp[temp]++;
}
for (auto v : mp) {
if (v.first<v.second) {
ans+=v.second-v.first;
} else if(v.first>v.second) {
ans+=v.second;
}
}
cout<<ans<<endl;
}
| 0
| 67,529,313
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep2(i,n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using vi = vector<int>;
template <class T>
using Grid = vector<vector<T>>;
int main(){
int N;
cin >> N;
vector<int> v(N);
rep(i, N) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < N; i++) {
ans = (ans + v[i]) / 2.0;
}
printf("%.12f\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vll a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll sa = 0, sb = 0;
rep(i, n) {
sa += a[i];
sb += b[i];
}
ll diff = sb - sa;
ll cnt = 0;
rep(i, n) {
if (a[i] > b[i]) {
ll k = a[i] - b[i];
b[i] += k;
cnt += k;
}
}
rep(i, n) {
if (a[i] < b[i]) {
if ((a[i] - b[i]) % 2 == 0) {
ll k = (b[i] - a[i]) / 2;
a[i] += 2 * k;
cnt -= k;
} else {
ll k = (b[i] - a[i] + 1) / 2;
a[i] += 2 * k;
cnt -= k;
cnt++;
}
}
}
if (cnt > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| 0
| 76,613,500
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string e = "";
for(int i = 0; i < s.size(); i++) {
if(s[i] == '0') {
e.push_back('0');
}
else if(s[i] == '1') {
e.push_back('1');
}
else if (s[i] == 'B' && e.size() > 0) {
e.pop_back();
}
}
cout << e << endl;
}
|
#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;
}
typedef long long int ll;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int ans;
vector<P> op;
sort(ALL(a));
if(a[0] >= 0) {
if(n == 2){
cout << a[1] - a[0] << endl;
cout << a[1] << ' ' << a[0] << endl;
return 0;
}
ans = a[0] - a[1];
op.push_back(P(a[0], a[1]));
for(int i = 2; i < n - 1; i++) {
op.push_back(P(ans, a[i]));
ans -= a[i];
}
op.push_back(P(a[n - 1], ans));
ans = a[n - 1] - ans;
cout << ans << endl;
for(auto i : op) {
cout << i.first << ' ' << i.second << endl;
}
return 0;
}
if(a[n - 1] <= 0) {
sort(RALL(a));
ans = a[0] - a[1];
op.push_back(P(a[0], a[1]));
for(int i = 2; i < n; i++) {
op.push_back(P(ans, a[i]));
ans = ans - a[i];
}
cout << ans << endl;
for(auto i : op) {
cout << i.first << ' ' << i.second << endl;
}
return 0;
}
vector<int> sei, hu;
for(int i = 0; i < n; i++) {
if(a[i] >= 0) {
sei.push_back(a[i]);
} else {
hu.push_back(a[i]);
}
}
sort(ALL(sei));
sort(ALL(hu));
for(int i = 1; i < sei.size(); i++) {
op.push_back(P(hu[0], sei[i]));
hu[0] -= sei[i];
}
ans = sei[0];
for(int i = 0; i < hu.size(); i++) {
op.push_back(P(ans, hu[i]));
ans -= hu[i];
}
cout << ans << endl;
for(auto i : op) {
cout << i.first << ' ' << i.second << endl;
}
return 0;
}
| 0
| 48,094,718
|
#include <iostream>
using namespace std;
int main()
{
int a, b, c, n;
cin >> a >> b >> c;
if (a==b && c%a==0) cout << 1 << "\n";
else {
for (int i=a; i<=b; i++) {
if (c%i==0) n++;
}
cout << n << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
int r, d, x; cin >> r >> d >> x;
for (int i = 1; i <= 10; i++) {
cout << (x = r * x - d) << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
| 0
| 45,330,425
|
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
long long read() {
register long long x = 0;
register char f = 1, ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f ^= 1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ '0');
return f ? x : -x;
}
#define N 100005
int n;
long long sum, a[N], b[65], ans;
void insert(long long x) {
for (register int i = 60; ~i; --i)
if (!(sum >> i & 1))
if (x >> i & 1) {
if (!b[i])
return b[i] = x, void(0);
x ^= b[i];
}
for (register int i = 60; ~i; --i)
if (sum >> i & 1)
if (x >> i & 1) {
if (!b[i])
return b[i] = x, void(0);
x ^= b[i];
}
}
int main() {
n = read();
for (register int i = 1; i <= n; ++i) a[i] = read(), sum ^= a[i];
for (register int i = 1; i <= n; ++i) insert(a[i]);
for (register int i = 60; ~i; --i)
if (!(sum >> i & 1))
if (!(ans >> i & 1))
ans ^= b[i];
for (register int i = 60; ~i; --i)
if (sum >> i & 1)
if (!(ans >> i & 1))
ans ^= b[i];
printf("%lld\n", ans + (sum ^ ans));
}
|
#include<bits/stdc++.h>
#include<string.h>
#define pb push_back
#define all(v) v.begin(),v.end()
#define see(x) cout<<#x<<" : "<<(x)<<endl;
#define ya cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define ff first
#define sc second
typedef unsigned long long ll;
using namespace std;
int main()
{
ll n,i,j,ans=0;
cin>>n;
vector<ll>a(n+2),b(n+1);
for(i=1;i<=n+1;i++)
{
cin>>a[i];
}
for(i=1;i<=n;i++)
{
cin>>b[i];
}
ll t=0;
for(i=1;i<=n;i++)
{
ans+=min(b[i],a[i]);
t=a[i];
a[i]-=min(b[i],t);
b[i]-=min(b[i],t);
ans+=min(b[i],a[i+1]);
t=a[i+1];
a[i+1]-=min(b[i],t);
b[i]-=min(b[i],t);
}
cout<<ans<<endl;
return 0;
}
| 0
| 79,467,037
|
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main() {
cin >> s;
t = s;
reverse(t.begin(), t.end());
int n = s.size(), res = 0;
for (int l = 0, r = 0; l < n || r < n;) {
int cntl = 0, cntr = 0;
while (l < n && s[l] == 'x') ++l, ++cntl;
while (r < n && t[r] == 'x') ++r, ++cntr;
res += abs(cntl - cntr);
if (l < n && r < n && s[l] != t[r]) {
cout << -1 << endl;
return 0;
}
++l, ++r;
}
cout << res / 2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
const int IINF = 1e9 + 100;
const long long LLINF = 2e18 + 129;
const long long MOD = 1e9 + 7;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<lint> x(n), y(m);
rep(i, n){
cin >> x[i];
}
rep(i, m){
cin >> y[i];
}
vector<lint> xsum(n + 1), ysum(m + 1);
REP(i, 1, n + 1){
xsum[i] = x[i - 1] + xsum[i - 1];
}
REP(i, 1, m + 1){
ysum[i] = y[i - 1] + ysum[i - 1];
}
lint dxsum = 0, dysum = 0;
REP(i, 1, n){
dxsum += x[i] * i - xsum[i];
dxsum %= MOD;
}
REP(i, 1, m){
dysum += y[i] * i - ysum[i];
dysum %= MOD;
}
lint ans = (dxsum * dysum) % MOD;
cout << ans << endl;
return 0;
}
| 0
| 48,188,205
|
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a, b, c;
int count = 0;
cin >> a >> b >> c;
for (int div = a; div <= b; div++)
{
if (!(c%div))
count++;
}
cout << count << endl;
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<cmath>
#include<bits/stdc++.h>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
#define FOR(i,n) for (int i = 1; (i) <= (n); ++ (i))
#define dump(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define int long long
const int INF = 1e18;
const int MOD = 1e9+7;
const double eps = 0.000000001;
using namespace std;
int a[200000];
int keta[80];
int keta2[80];
int l;
int b2[200000];
int mypow(int _x, int _n){
int ret = 1;
while(0 < _n){
if((_n % 2) == 0){
_x *= _x;
_n >>= 1;
}
else{
ret *= _x;
--_n;
}
}
return ret;
}
int maxSubarrayXOR(int set[], int n,int l2){
int index = 0;
for (int i = l2-1; i >= 0; i--){
int maxInd = index;
int maxEle = -10;
for (int j = index; j < n; j++) {
if ( (set[j] & (mypow(2,i))) != 0 && set[j] > maxEle ){
maxEle = set[j], maxInd = j;
}
}
if (maxEle == -10) continue;
swap(set[index], set[maxInd]);
maxInd = index;
for (int j=0; j<n; j++){
if (j != maxInd &&(set[j] & (mypow(2,i))) != 0){
set[j] = set[j] ^ set[maxInd];
}
}
index++;
}
int res = 0;
for (int i = 0; i < n; i++) res ^= set[i];
return res;
}
signed main(){
int n;
int su = 0;
int ma = -INF;
cin >> n;
REP(i,n){
cin >> a[i];
su ^= a[i];
ma = max(ma,a[i]);
}
int l = 0;
while(ma>0){
l++;
ma/=2;
}
REP(i,n){
int no = a[i];
int kai2 = 0;
while(no>0){
keta[kai2] += no%2;
no/=2;
kai2 ++;
}
}
int su2 = su;
int kai3 = 0;
while(su2>0){
keta2[kai3] += su2%2;
su2/=2;
kai3 ++;
}
int ans = su;
REP(i,n){
int no3 = a[i];
int kai4 = 0;
int ketaa = 0;
while(no3>0){
if(keta2[kai4]==0){
int kee = no3%2;
ketaa += kee*mypow(2,kai4);
if(i==0){
}
}
no3/=2;
kai4 ++;
}
b2[i] = ketaa;
}
REP(i,n){
}
ans += 2* maxSubarrayXOR(b2,n,64);
cout << ans << endl;
return 0;
}
| 0
| 79,911,719
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
const int MOD = 1e9+7;
inline int add(int a, int b){ return (a+b)%MOD; }
inline int sub(int a, int b){ return ((a-b)%MOD + MOD)%MOD; }
inline int mul(int a, int b){ return ((ll)a*b)%MOD; }
int pwr(int a, int b){
if(!b) return 1;
int temp = pwr(a, b/2);
if(b%2) return mul(mul(temp, temp), a);
return mul(temp, temp);
}
inline int dvd(int a, int b){ return mul(a, pwr(b, MOD-2)); }
void solve(){
int n, k;
cin >> n >> k;
vector<int> amt(k+1);
for(int i = k; i > 0; --i){
amt[i] = pwr(k/i, n);
for(int j = 2*i; j <= k; j+=i){
amt[i] = sub(amt[i], amt[j]);
}
}
int ans = 0;
for(int i = 1; i <= k; ++i) ans = add(ans, mul(i, amt[i]));
cout << ans << '\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using ll = long long;
using namespace std;
int main(){
int n,d;
cin >> n >> d;
vvi x(n, vi(d));
rep(i, n){
rep(j, d) cin >> x[i][j];
}
int ans = 0;
rep(i, n - 1){
for(int j = i + 1; j < n; j++){
int num = 0;
rep(k, d) num += pow(x[i][k] - x[j][k], 2);
double val = sqrt(num);
if(val - (int)val == 0) ans++;
}
}
cout << ans << endl;
}
| 0
| 58,275,928
|
#include <stdio.h>
int main() {
int arr[3][3]={};
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
scanf("%d", &arr[i][j]);
}
}
int n;
scanf("%d", &n);
int call;
for(int k=0; k<n; k++){
scanf("%d", &call);
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
if(arr[i][j]==call){
arr[i][j]=0;
}
}
}
}
if(arr[0][0]==0&&arr[0][1]==0&&arr[0][2]==0 || arr[1][0]==0&&arr[1][1]==0&&arr[1][2]==0 || arr[2][0]==0&&arr[2][1]==0&&arr[2][2]==0 || arr[0][0]==0&&arr[1][0]==0&&arr[2][0]==0 || arr[0][1]==0&&arr[1][1]==0&&arr[2][1]==0 || arr[0][2]==0&&arr[1][2]==0&&arr[2][2]==0 || arr[0][0]==0&&arr[1][1]==0&&arr[2][2]==0 || arr[0][2]==0&&arr[1][1]==0&&arr[2][0]==0){
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 100000000000000000
#define mod 1000000007
#define MAX 200005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<lint,lint> pii;
struct DSU{
vector<lint>parent,rank;
DSU(lint n){
parent.resize(n+1);
rank.resize(n+1);
for(int i=1;i<=n;i++){
make_set(i);
}
}
void make_set(lint v){
parent[v]=v;
rank[v]=0;
}
lint find_set(lint v){
if(parent[v]==v) return v;
return parent[v]=find_set(parent[v]);
}
bool union_set(lint u,lint v){
u=find_set(u);
v=find_set(v);
if(u!=v){
if(rank[u]<rank[v]) swap(u,v);
parent[v]=u;
if(rank[u]==rank[v]) rank[u]++;
return true;
}
else return false;
}
};
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
lint n,m,u,v,w;
cin>>n>>m;
DSU ds(n);
while(m--){
cin>>w>>u>>v;
if(!w) ds.union_set(u+1,v+1);
else{
if(ds.find_set(u+1)==ds.find_set(v+1)) cout<<"1\n";
else cout<<"0\n";
}
}
return 0;
}
| 0
| 58,126,080
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
int sum=0;
rep(i,n){
for(int j=i+1;j<n;j++){
sum+=d[i]*d[j];
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define LB lower_bound
#define UB upper_bound
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL INF = 1e9;
const LL MOD = 1e9+7;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define FI first
#define SE second
LL Gcd(LL a, LL b) {
return __gcd(a,b);
}
LL Lcm(LL a, LL b) {
LL abd = Gcd(a,b);
LL x = a / abd, y = b / abd;
return x*y*abd;
}
LL RepSqu(LL N, LL P, LL M) {
if(P == 0) {
return 1;
}
if(P%2 == 0) {
LL t = RepSqu(N, P/2, M);
return t*t % M;
}
return (N * RepSqu(N, P-1, M)) % M;
}
bool IsPrime(LL N){
if(N >= 1) return false;
for(int i = 2; i*i <= N; ++i){
if(N%i == 0) return false;
}
return true;
}
bool ComPaiSec(PII a, PII b){
if(a.SE != b.SE){
return a.SE < b.SE;
}else{
return a.FI < b.FI;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
LL M=0;
cin >> N;
VI A(N);
VB B(N,true);
VPII C;
REP(i,N){
cin >> A.at(i);
}
SORT(A);
FOR(i,1,N-1){
if(A.at(i)<0){
continue;
}
C.PB(MP(A.at(0),A.at(i)));
A.at(0) -= A.at(i);
B.at(i) = false;
}
REP(i,N-1){
if(B.at(i)){
C.PB(MP(A.at(N-1),A.at(i)));
A.at(N-1) -= A.at(i);
}
}
cout << A.at(N-1) << endl;
REP(i,N-1){
cout << C.at(i).FI << " " << C.at(i).SE << endl;
}
return 0;
}
| 0
| 10,240,916
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
typedef vector<int> vi;
typedef vector<vi> vii;
const int mxN=2e5+5,MOD=1e9+7;
int n,vis[mxN];
int dp[2][mxN];
vi adj[mxN];
void solve(int i,int p){
if(dp[0][i]!=-1)return;
int cnt1=1,cnt2=1;
for(int j:adj[i]){
if(j!=p){
solve(j,i);
cnt1=(cnt1*dp[0][j])%MOD;
cnt2=(cnt2*(dp[0][j]+dp[1][j])%MOD)%MOD;
}
}
dp[1][i]=cnt1%MOD;
dp[0][i]=cnt2%MOD;
return;
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
memset(dp,-1,sizeof(dp));
cin>>n;
for(int i=0;i<n-1;i++){
int a,b;cin>>a>>b;a--;b--;
adj[a].pb(b);
adj[b].pb(a);
}
solve(0,-1);
cout<<(dp[0][0]+dp[1][0])%MOD<<"\n";
}
|
#include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, class T2> using P = pair<T1, T2>;
using I = int;
using D = double;
using B = bool;
using C = char;
using S = string;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = P<I, I>;
using VPII = V<PII>;
using PLL = P<LL, LL>;
using VPLL = V<PLL>;
using VI = V<I>;
using VVI = VV<I>;
using VLL = V<LL>;
using VVLL = VV<LL>;
using VC = V<C>;
using VVC = VV<C>;
using VS = V<S>;
using VVS = VV<S>;
using VB = V<B>;
using VVB = VV<B>;
#define REP(type, i, n) for (type i = 0; i < (type)(n); ++i)
#define REP2(type, i, m, n) for (type i = (m); i < (type)(n); ++i)
#define REPR(type, i, n) for (type i = (n)-1; i >= 0; --i)
#define REPR2(type, i, m, n) for (type i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define SORTR(a, type) sort(ALL(a), greater<type>())
#define SORTF(a, comp) sort(ALL(a), comp)
#define REVERSE(a) reverse(ALL(a))
#define SIZE(a, type) ((type)(a).size())
#define bit_search(bit, n) REP(LL, bit, 1LL<<(n))
#define bit_check(bit, i) ((bit>>(i)) & 1)
#define setpre(n) fixed << setprecision((n))
#define UNIQUE(a) do {SORT(a); (a).erase(unique(ALL(a)), (a).end());} while(0)
#define MAX(a) *max_element(ALL(a))
#define MIN(a) *min_element(ALL(a))
#define bisect_left(a, x) (lower_bound(ALL(a), (x)) - a.begin())
#define bisect_right(a, x) (upper_bound(ALL(a), (x)) - a.begin())
#define INPUT(a) REPx(&x, a) cin >> x;
#define INPUT2(a) REPx(&x, a) INPUT(x);
#define INPUTP(a) REPx(&x, a) cin >> x.first >> x.second;
#define ENDL cout << endl;
const int INF = 2e9;
const LL MOD = 1e9+7;
template<class T> using PRIORITY_QUEUE = priority_queue< T, V<T>, greater<T> >;
template<class T> inline bool chmin(T &a, T b){if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){if (a < b) {a = b; return true;} return false;}
template<class T> inline void debug1(V<T> A){REP(int, i, SIZE(A, int)){if (A[i] == INF) cout << "I ";else cout << A[i] << " ";}ENDL}
template<class T> inline void debug2(VV<T> A){REP(int, i, SIZE(A, int)){REP(int, j, SIZE(A[i], int)){if (A[i][j] == INF) cout << "I "; else cout << A[i][j] << " ";}ENDL}}
template<class T>
T Pow(T a, T b)
{
T res = 1;
while (b > 0)
{
if (b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
template<class T>
T comb(T n, T k)
{
if (n < k) return 0;
if (k > n/2) k = n - k;
T res = 1;
REP(T, i, k) res = res * (n-i) / (i+1);
return res;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
LL n, p, k = 0, ans = 0;
cin >> n >> p;
REP(int, i, n)
{
int a;
cin >> a;
if (a%2) ++k;
}
REP2(LL, i, p, k/2+p+1) ans += comb(k, 2*i-p);
ans *= Pow(2LL, n-k);
cout << ans << endl;
return 0;
}
| 0
| 18,987,015
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int N, K;
vector<int> A;
int main() {
while (cin >> N >> K) {
A.resize(N);
for (int i = 0; i < N; ++i) cin >> A[i];
int res = 0;
int right = 0;
while (true) {
if (res == 0) right += K;
else right += K-1;
++res;
if (right >= N) break;
}
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x,y,z,k;
cin >> x >> y >> z >> k;
ll a[x];
for(ll i=0;i<x;i++) cin >> a[i];
sort(a, a+x, greater<ll>());
ll b[y];
for(ll i=0;i<y;i++) cin >> b[i];
sort(b, b+y, greater<ll>());
ll c[z];
for(ll i=0;i<z;i++) cin >> c[i];
sort(c, c+z, greater<ll>());
priority_queue<ll> pq1;
for(ll i=0;i<x;i++){
for(ll j=0;j<y;j++){
pq1.push(a[i]+b[j]);
}
}
priority_queue<ll> pq2;
ll count=0;
while(!pq1.empty()){
count++;
pq2.push(pq1.top());
pq1.pop();
if(count==k) break;
}
priority_queue<ll> pq3;
while(!pq2.empty()){
ll v=pq2.top();
pq2.pop();
for(ll i=0;i<z;i++){
pq3.push(v+c[i]);
}
}
for(ll i=0;i<k;i++){
cout << pq3.top() << endl;;
pq3.pop();
}
}
| 0
| 75,820,442
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int main(){
ll n,k;
cin >> n >> k;
priority_queue<pll> pq;
rep(i,n){
ll t,d;
cin >> t >> d;
--t;
pq.push(pll(d,t));
}
priority_queue<pll,vector<pll>,greater<pll>> used;
vector<int> cnt(n,0);
ll c = 0;
ll res = 0;
rep(i,k){
res += pq.top().first;
if(cnt[pq.top().second] == 0) ++c;
cnt[pq.top().second] ++;
used.push(pq.top());
pq.pop();
}
ll ans = res + c * c;
while(!pq.empty() && !used.empty()){
bool ok = true;
while(cnt[pq.top().second]>0){
pq.pop();
if(pq.empty()){
ok = false;
break;
}
}
while(cnt[used.top().second]==1){
used.pop();
if(used.empty()){
ok = false;
break;
}
}
if(!ok) break;
res -= used.top().first;
cnt[used.top().second] --;
used.pop();
res += pq.top().first;
cnt[pq.top().second] ++;
pq.pop();
c++;
ans = max(ans,res + c * c);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main() {
string S;
getline(cin, S);
stack<int> st;
for (int i = 0; i < S.size(); i++){
int elem = S[i] - '0';
if (st.empty() || st.top() == elem)
st.push(elem);
else
st.pop();
}
cout << S.size() - st.size() << endl;
return 0;
}
| 0
| 76,256,355
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e9+7;
int main(){
ll k,a,b;
cin >> k >> a >> b;
if(a-1>=k){
cout << k+1 << endl;
return 0;
}
k-=a-1;
ll ans=a;
if(b-a>=2){
ll cnt=k/2;
k-=cnt*2;
ans+=cnt*(b-a);
}
ans+=k;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> countingSort(vector<int> &array,int n,int max){
vector<int> count_array(max+1,0);
for(int i=0;i<n;i++){
int x = array.at(i);
count_array.at(x) ++;
}
for(int i=1;i<=max;i++){
count_array.at(i) = count_array.at(i) + count_array.at(i-1);
}
vector<int> arr(n);
for(int i=n-1;i>=0;i--){
int num = array.at(i);
int idx = count_array.at(num);
arr.at(idx-1) = num;
count_array.at(num)--;
}
return arr;
}
int main(){
int n;
cin >> n;
vector<int> array(n);
for(int i=0;i<n;i++) cin >> array.at(i);
int max = -1;
for(int i=0;i<n;i++){
if(max<array.at(i)){
max = array.at(i);
}
}
vector<int> arr = countingSort(array,n,max);
for(int i=0;i<n;i++){
cout << arr.at(i);
if(i != n-1){
cout << " ";
}else{
cout << endl;
}
}
}
| 0
| 14,851,886
|
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int sum,pl,pu;
long ansl,ansu,ans;
sum = 0;
pl = 0;
pu = 0;
ans = 0;
ansl = 0;
ansu = 0;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) cin >> x[i];
for(int i = 0; i < n; i++){
sum += x[i];
}
pl = sum / n;
pu = pl + 1;
for(int i = 0; i < n; i++) ansl += (x[i] - pl) * (x[i] - pl);
for(int i = 0; i < n; i++) ansu += (x[i] - pu) * (x[i] - pu);
ans = min(ansl,ansu);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
vector<pair<char,int>> RLE(string S){
vector<pair<char,int>> p;
int N = S.size();
for (int i=0;i<N;i++) {
if (S[i]==S[i+1]){
int cnt = 1;
char c = S[i];
while (i+1<N && S[i]==S[i+1]) {
i++;
cnt++;
}
p.push_back({c,cnt});
}
else p.push_back({S[i],1});
}
return p;
}
int main(){
int H, W; cin >> H >> W;
string s[H];
rep(i,H) cin >> s[i];
int dp[H][W] = {};
dp[0][0] = (s[0][0]=='#'? 1:0);
for (int row=0;row<H;row++){
for (int col=0;col<W;col++){
if (row==0 && col==0) continue;
if (col==0){
dp[row][col] = dp[row-1][col]+(s[row-1][col]=='.' && s[row][col]=='#');
}
else if (row==0){
dp[row][col] = dp[row][col-1] + (s[row][col-1]=='.' && s[row][col]=='#');
}
else {
dp[row][col] = min(dp[row][col-1] + (s[row][col-1]=='.' && s[row][col]=='#'), \
dp[row-1][col]+(s[row-1][col]=='.' && s[row][col]=='#'));
}
}
}
cout << dp[H-1][W-1] << endl;
return 0;
}
| 0
| 100,518,207
|
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define vc vector<char>
#define vb vector<bool>
#define vf vector<float>
#define vs vector<string>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int>>
#define hashmap unordered_map
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf INT64_MAX
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(x) x.begin(),x.end()
#define digits(x) floor(log10(x))+1
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
template<class T>
void printV(vector<T> a) {for (auto v : a)cout << v << " ";}
template<class T>
void readV(vector<T>& a) {int n = a.size(); for (int i = 0 ; i < n ; i++)cin >> a[i];}
template<class T>
void printA(T* a , int n) {for (int i = 0; i < n ; i++)cout << a[i] << " ";}
template<class T>
void readA(T* a , int n) {for (int i = 0 ; i < n ; i++)cin >> a[i];}
auto clk = clock();
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
void run_time() {cout << endl<<"Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;}
void aryan_pandeya() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
aryan_pandeya();
FIO;
char x ;
cin>>x;
char y = x+1;
cout<<y;
return 0;
}
|
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
deque<int> deq;
int N; cin >> N;
while(N--){
string cmd; cin >> cmd;
if(cmd == "insert"){
int x; cin >> x;
deq.push_front(x);
}
else if(cmd == "delete"){
int x; cin >> x;
auto it = find(deq.begin(), deq.end(), x);
if(it != deq.end())
deq.erase(it);
}
if(cmd == "deleteFirst")
deq.pop_front();
if(cmd == "deleteLast")
deq.pop_back();
}
if(!deq.empty()){
cout << deq.front();
for(auto it=deq.begin()+1;it!=deq.end();++it)
cout << " " << *it;
cout << endl;
}
return 0;
}
| 0
| 51,613,021
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int K,X;
cin>>K>>X;
if(500*K>=X){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
return 0;
}
|
#include <iostream>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <utility>
#include <bitset>
#include <limits>
#include <climits>
using namespace std;
#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
#define sz(a) int((a).size())
#define pb push_back
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
const ll INF = 1000000000000000000LL;
template <typename T>
void dij1(int nV, vector<vector<pair<int,T>>>& adjacent, vector<T>& d, int start) {
d.assign(nV, INF);
d[start] = 0;
vector<int> prev(nV, -1);
priority_queue<pair<T, int>> Q;
Q.push(make_pair(0, start));
vector<bool> visited(nV, false);
while (!Q.empty()) {
T du = -Q.top().first;
int u = Q.top().second; Q.pop();
if (visited[u]) continue;
visited[u] = true;
int c = adjacent[u].size();
for (int i=0; i<c; ++i) {
int v = adjacent[u][i].first;
T distance = adjacent[u][i].second;
T alt = du + distance;
if (d[v] > alt) {
d[v] = alt;
prev[v] = u;
Q.push(make_pair(-alt, v));
}
}
}
}
int main() {
int N; cin >> N;
vector<vector<pair<int,ll>>> adj(N);
rep(i, N-1) {
int ai,bi; ll ci; cin >> ai >> bi >> ci;
--ai; --bi;
adj[ai].pb(make_pair(bi, ci));
adj[bi].pb(make_pair(ai, ci));
}
int Q, K; cin >> Q >> K;
--K;
vector<ll> d(N, INF);
dij1(N, adj, d, K);
rep(j, Q) {
int xi,yi; cin >> xi >> yi;
--xi; --yi;
ll ans = d[xi] + d[yi];
cout << ans << endl;
}
return 0;
}
| 0
| 8,524,267
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
int t = 0, x = 0, y = 0;
rep(i, n) {
int next_t, next_x, next_y;
scanf("%d%d%d", &next_t, &next_x, &next_y);
int distance = abs(x - next_x) + abs(y - next_y);
int timeleft = next_t - t;
if(distance > timeleft) {
printf("No\n");
return 0;
}
if((timeleft % 2) != (distance % 2)) {
printf("No\n");
return 0;
}
t = next_t, x = next_x, y = next_y;
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
int N=min(A,B);
int M=max(A,B);
int ans;
for(int i=1; i<N+1; i++){
if(M%(N-i+1)==0 && N%(N-i+1)==0) K--;
if(K==0){
ans=N-i+1;
break;
}
}
cout << ans << endl;
}
| 0
| 29,389,141
|
#include <iostream>
using namespace std;
string kei[] = {".,!? ","abc","def","ghi",
"jkl","mno","pqrs","tuv","wxyz",};
int main(){
string str;
int n;
cin >> n;
while(n--){
cin >> str;
int cnt = 0;
for(int i = 0 ; i < str.size()-1 ; i++ ){
if(str[i] == str[i+1] && str[i] != '0')cnt++;
if(str[i] == '0' && str[i+1] == '0')continue;
if(str[i]!='0' && str[i+1] == '0'){
cout << kei[(str[i]-'0')-1][cnt%(kei[(str[i]-'0')-1].size())];
cnt = 0;
}
}
cout << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const long long INF = 2e18;
const long long MOD = 1e9+7;
#define sx(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i,n) for (int i = 0; i < n; i++)
#define ALL(a) begin(a),end(a)
int main(void) {
int n;
while (cin >> n, n) {
vector<int> a(n);
REP(i,n) cin >> a[i];
int ans = inf;
REP(i,n) REP(j,n) {
if (i == j) continue;
ans = min(ans,abs(a[i]-a[j]));
}
cout << ans << endl;
}
return 0;
}
| 0
| 51,320,916
|
#include<iostream>
#include<cstdio>
using namespace std;
void solve(int delta_x){
int number_of_rectangle, height_of_rectangle;
int integer = 0;
number_of_rectangle = 600 / delta_x;
for(int i = 1;i < number_of_rectangle;i++){
height_of_rectangle = (delta_x * i) * (delta_x * i);
integer += height_of_rectangle * delta_x;
}
cout << integer << endl;
}
int main(){
int number_of_rectangle, delta_x;
while(cin >> delta_x){
solve(delta_x);
}
return 0;
}
|
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int fib[100];
int main(){
int n;
cin>>n;
fib[0]=1;
fib[1]=1;
for(int i =2;i <= n;i++){
fib[i]=fib[i-1]+fib[i-2];
}
cout <<fib[n]<<endl;
return 0;
}
| 0
| 91,770,824
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
int main(void){
Cin(int, a, b, k);
while(true){
a /= 2;
b += a;
if(--k == 0) break;
b /= 2;
a += b;
if(--k == 0) break;
}
Cout(a, " ", b);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int a,b;
string s;
int main(void){
cin>>a>>b>>s;
for(int i=0;i<a+b+1;i++){
if(i==a){
if(s[i]!='-'){
cout<<"No"<<endl;
return 0;
}
}else{
if(s[i]=='-'){
cout<<"No"<<endl;
return 0;
}
}
}
cout<<"Yes"<<endl;
}
| 0
| 87,685,975
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define endt '\t'
#define ends ' '
#define die(x) return cout << x << endl, 0;
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << '[' << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
int DP[MAXN][2];
vector<int> G[MAXN];
void DFS(int v, int p = 0) {
for (int u : G[v]) if (u != p)
DFS(u, v), DP[v][0] += max(DP[u][0], DP[u][1]);
for (int u : G[v]) if (u != p)
DP[v][1] = max(DP[v][1], DP[v][0] - max(DP[u][0], DP[u][1]) + DP[u][0] + 1);
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef LOCAL
ifstream cin("sample.in");
#endif
int n; cin >> n;
for (int i = 1; i < n; i++) {
int v, u; cin >> v >> u;
G[v].push_back(u);
G[u].push_back(v);
}
DFS(1);
int mx = max(DP[1][0], DP[1][1]);
cout << (n % 2 == 0 && (mx << 1) == n ? "Second" : "First") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
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;
}
signed main() {
init();
ll N;
cin >> N;
vll C(N - 1);
vll S(N - 1);
vll F(N - 1);
rep(i, N - 1) {
cin >> C[i] >> S[i] >> F[i];
}
rep(i, N) {
if (i == N - 1) {
COUT(0);
return 0;
}
ll time = S[i];
time += C[i];
rep2(j, i + 1, N - 1) {
time = max(time, S[j]);
if (time % F[j] != 0) {
time += F[j] - time % F[j];
}
time += C[j];
}
COUT(time);
}
return 0;
}
| 0
| 51,240,194
|
#include<iostream>
using namespace std;
int main(){
int A[3][3],N,bingo[3][3];
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
cin >> A[i][j];
bingo[i][j]=0;
}
}
cin >> N;
for (int k = 0; k < N; k++){
int b;
cin >> b;
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
if(A[i][j]==b){
bingo[i][j]=1;
}
}
}
}
int flg=0;
for (int i = 0; i < 3; i++){
if(bingo[i][0]==1 && bingo[i][1]==1 && bingo[i][2] == 1){
flg=1;
}
if(bingo[0][i]==1 && bingo[1][i]==1 && bingo[2][i] == 1){
flg=1;
}
}
if(bingo[0][0]==1 && bingo[1][1]==1 && bingo[2][2] == 1){
flg=1;
}
if(bingo[0][2]==1 && bingo[1][1]==1 && bingo[2][0] == 1){
flg=1;
}
if(flg==1){
printf("Yes\n");
}else{
printf("No\n");
}
}
|
#include <bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> A(N);
copy_n(istream_iterator<unsigned long>(cin), N, A.begin());
vector<unsigned long> pw;
unsigned long x{0}, o{0};
for(const auto& i : A){
x ^= i;
o |= i;
}
for(unsigned long i = 60; i--; )if(((~x & o) >> i) & 1)pw.push_back(i);
for(auto& i : A)i &= ~x;
unsigned long a{0};
for(const auto& i : pw){
auto it = partition(A.begin(), A.end(), [&i](auto a){return ~(a >> i) & 1;});
auto t = A.back();
if((t >> i) & 1){
A.pop_back();
if(a < (a ^ t))a ^= t;
if(A.empty())break;
for(auto& j : A)if((j >> i) & 1)j ^= t;
}
}
cout << x + (a * 2) << endl;
return 0;
}
| 0
| 61,067,314
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
const int INFint = 1e9;
const ll INFll = 1e18;
ll MOD=1e9+7;
ll gcd(ll a, ll b) { return __gcd(a,b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
ll modpow(ll a, ll n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
ll modinv(ll a) {
return modpow(a, MOD - 2);
}
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a + b >= c){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
long long power(long long a, long long b,long long m) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a %m;
a = a * a %m;
b >>= 1;
}
return res;
}
const int mod=998244353;
int dp[3005][3005];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int n;
cin>>n;
int a[n+2];
int tot=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
tot+=a[i];
}
int z=n*(n+1)/2;
if(tot%z)
cout<<"NO";
else
{
z=tot/z;
int temp=z;
int diff;
a[n+1]=a[1];
for(int i=2;i<=n+1;i++)
{
diff=a[i-1]-a[i]+z;
if(diff<0)
{
cout<<"NO";
return 0;
}
if(diff%n)
{
cout<<"NO";
return 0;
}
temp-=diff/n;
}
if(temp)
cout<<"NO";
else
{
cout<<"YES";
}
}
}
| 0
| 6,431,903
|
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define fo1(i,n) for(ll i=1;i<=n;i++)
using namespace std;
template<typename T>
void showvector(vector <T> v)
{
for(T x:v)
cout<<x<<" ";
cout<<endl;
}
template<typename T>
void showset(set <T> s)
{
for(T x: s)
cout<<x<<" ";
cout<<endl;
}
template<class T>
void showvectorpair(vector<T> v)
{
for(auto it=v.begin();it!=v.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T,typename P>
void showmap(map <T,P> m)
{
for(auto it=m.begin();it!=m.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T>
bool comp(T a,T b)
{
return (a>b);
}
template<class T>
bool comppair(T a,T b)
{
if(a.first==b.first)
return(a.second>b.second);
return (a.first>b.first);
}
bool sameparity(ll a,ll b)
{
return (a%2==b%2);
}
bool difparity(ll a,ll b)
{
return !(a%2==b%2);
}
bool isprime(ll x)
{
for(ll i=2;i<=sqrt(x);i++)
{
if(x%i==0)
return false;
}
return true;
}
bool iseven(ll x)
{
return !(x%2);
}
bool isodd(ll x)
{
return (x%2);
}
void fun()
{
}
void vfun()
{
ll n;
cin>>n;
vector <ll> v(n);
fo(i,n)
cin>>v[i];
sort(v.begin(),v.end());
ll mincs=INT_MAX;
for(ll k=-100;k<=100;k++)
{
ll cst=0;
fo(i,n)
{
cst+=pow(abs(v[i]-k),2);
}
mincs=min(mincs,cst);
}
cout<<mincs;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll test=1;
while(test--)
{
vfun();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const int MOD = 1000000007;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
int N,L;cin >> N >> L;
vector<int> a(N);rep(i,N)cin >> a[i];
bool ok = false;
int num = -1;
rep(i,N-1){
if(a[i]+a[i+1] >= L){
num = i;
ok = true;
break;
}
}
if(!ok){
cout << "Impossible" << endl;
}
else{
cout << "Possible" << endl;
rep(i,num)cout << i+1 << endl;
for(int i = N-1;i >= num + 2;i--)cout << i << endl;
cout << num + 1 << endl;
}
}
| 0
| 37,629,648
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
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() {
int N,K;cin>>N>>K;
vector<ll> num(K+1,0);
ll ans = 0;
for (int x = K;x > 0;x--) {
ll cnt = 0, kind = 1;
int now = x + x;
while(now <= K) {
kind++;
cnt = (cnt + num[now]) % MOD;
now += x;
}
ll gap = ((modpow(kind,N,MOD) - cnt + MOD) % MOD);
ans += (gap * x) % MOD;
ans %= MOD;
num[x] = gap;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> vec(n+1);
rep(i, n+1) cin >> vec[i];
ll smallest = 0;
for(ll i=n; i>=0; i--){
if(i == n){
if(vec[i] == 0){
cout << -1 << endl;
return 0;
}else{
smallest += vec[i];
}
}else{
smallest = vec[i] + (smallest+1)/2;
}
}
if(1 < smallest){
cout << -1 << endl;
return 0;
}
ll res = 0;
ll current = 0;
vector<ll> mx;
rep(i, n+1){
if(i == 0) mx.push_back(1);
else mx.push_back(min((mx[i-1]-vec[i-1])*2, (ll)1e18));
}
for(ll i=n; i>=0; i--){
current = min(current+vec[i], mx[i]);
res += current;
}
cout << res << endl;
return 0;
}
| 0
| 20,696,226
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, K, X, Y;
cin >> N >> K >> X >> Y;
if(N >= K) cout << K * X + (N - K) * Y << endl;
else cout << N * X << endl;
}
|
#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 ll = long long;
using namespace std;
int main(){
ll n; cin >> n;
vector<ll> p(n);
rep(i,n){
ll a; cin >> a; a--;
p[a] = i;
}
multiset<ll> check;
check.insert(n);
check.insert(n);
check.insert(-1);
check.insert(-1);
ll ans = 0;
rrep(i,n){
ll k = p[i];
auto iter = check.lower_bound(k);
ll r1 = *iter;
ll r2 = *(next(iter));
iter--;
ll l1 = *(iter);
ll l2 = *(prev(iter));
ans += (r1-k)*(l1-l2)*(i+1);
ans += (r2-r1)*(k-l1)*(i+1);
check.insert(k);
}
cout << ans << endl;
}
| 0
| 75,054,367
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N = 3e5 + 7;
const int mod = 1e9 + 7;
void solve1()
{
int n;
cin >> n;
vector < int > v(n + 2 , 0);
for( int i = 1; i <= n; i++ ){
cin >> v[i];
}
int sum = 0;
for( int i = 1; i <= n; i++ ){
sum = sum + abs(v[i] - v[i - 1]);
}
sum += abs(v[n]);
for( int i = 1; i < n; i++ ){
cout << sum - abs(v[i] - v[i - 1]) - abs(v[i] - v[i + 1]) + abs(v[i - 1] - v[i + 1]) << "\n";
}
cout << sum - abs(v[n]) + abs(v[n - 1]) - abs(v[n] - v[n - 1]);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0); srand(time(0));
int cghf = 1;
while( cghf-- ){
solve1();
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n;
cin>>n;
vector<ll>a(n);
rep(i,n)cin>>a[i];
map<ll,ll>mp;
rep(i,n){
mp[a[i]]++;
}
ll cnt=0;
for(auto p:mp){
if(p.first==p.second)cnt+=0;
else if(p.second>p.first)cnt+=p.second-p.first;
else cnt+=p.second;
}
cout<<cnt<<endl;
}
| 0
| 5,383,625
|
#include <iostream>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(){
int m,min,max,gap,gapmax,n;
while(cin >> m >> min >> max && m != 0){
int p[m];
REP(i,m){
cin >> p[i];
}
gapmax = 0;
FOR(i,min,max+1){
gap = p[i-1] - p[i];
if(gap >= gapmax){
gapmax = gap;
n = i;
}
}
cout << n << endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
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;
}
long long int maxtime(long long int x, long long int y) {
return(x + y - 1) / y;
}
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
long long int modinv(long long a, long long m) {
long long int b = m, u = 1, v = 0;
while (b) {
long long int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
vector<long long int >meguru;
bool isOK(int index, int key) {
if (meguru[index] <= key) return true;
else return false;
}
int binary_search(int key) {
int left = -1;
int right = (int)meguru.size();
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (isOK(mid, key)) left = mid;
else right = mid;
}
return left;
}
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() {
int h, w;
cin >> h >> w;
int f;
cin >> f;
char dp[10][10] = {};
int black = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
char a;
cin >> a;
dp[i][j] = a;
if (a == '#') {
black++;
}
}
}
int ans = 0;
for (int i = 0; i < (1 << h); i++) {
for (int j = 0; j < (1 << w); j++) {
int sum = 0;
for (int k = 0; k < h; k++) {
if (i & (1 << k)) {
for (int l = 0; l < w; l++) {
if (dp[k][l] == '#') {
sum++;
}
}
}
}
for (int k = 0; k < w; k++) {
if (j & (1 << k)) {
for (int l = 0; l < h; l++) {
if (dp[l][k] == '#') {
sum++;
}
}
}
}
for (int k = 0; k < h; k++) {
for (int l = 0; l < w; l++) {
if (i & (1 << k) && j & (1 << l)) {
if (dp[k][l] == '#') {
sum--;
}
}
}
}
if (black - sum == f) {
ans++;
}
}
}
cout << ans << endl;
}
| 0
| 69,420,635
|
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<int,int> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
int main() {
int A,B,C;cin >> A >> B >> C;
int hozon = A;
for(int i = 0;i<500;i++){
int V = A%B;
A %= B;
if(V == C){
cout << "YES" << endl;
return 0;
}
A += hozon;
}
cout << "NO" << endl;
}
|
#include <stdio.h>
int main()
{
char card[20001];
int maze,i,mvc,j,fc,cm,end=0;
while(1){
cm=0;
while(1){
scanf("%c",&card[cm]);
if(card[0]=='\n'){
continue;
}
if(card[0]=='-'){
goto theend;
}
if(card[cm]=='\n'&&cm!=0){
break;
}
cm++;
}
scanf("%d",&maze);
fc=0;
for(i=0;i<maze;i++){
scanf("%d",&mvc);
for(j=0;j<mvc;j++){
card[fc+cm]=card[fc];
fc++;
}
}
for(i=0;i<cm;i++){
printf("%c",card[fc]);
fc++;
}
printf("%c",'\n');
}
theend:
return 0;
}
| 0
| 88,678,029
|
#include <bits/stdc++.h>
using namespace std;
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define rep1(i,a,b) for(int a_=(a),b_=(b),i=a_;i<b_;++i)
#define repr(i,n) for(int _i=(n),i=_i;i>0;--i)
#define db(x) cerr<<#x<<" = "<<x<<" ";
#define db2(x,y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<") ";
#define db3(x,y,z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = ("<<x<<", "<<y<<", "<<z<<") ";
#define ln cout<<endl;
#define all(a) (a).begin(),(a).end()
#define dig(n) to_string(n).length()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define se second
#define fi first
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> iP;
typedef pair<P,P> PP;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
bool flag=false;
ll ans=0,sum=0;
int a,b;
cin>>a>>b;
--a;--b;
cout<<"80 80"<<endl;
char g[80][80];
rep(i,80){
char c;
if(i<40)c='#';
else c='.';
rep(j,80)g[i][j]=c;
}
bool br=false;
for(int i=0; i<40; i+=2){
for(int j=0;j<80;j+=2){
if(a==0){br=true;break;}
g[i][j] = '.';
--a;
}
if(br)break;
}
br=false;
for(int i=41;i<80;i+=2){
for(int j=0;j<80;j+=2){
if(b==0){br=true;break;}
g[i][j] = '#';
--b;
}
if(br)break;
}
rep(i,80){
rep(j,80){
cout<<g[i][j];
}
ln;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define modP 1000000007
#define MAX_N 200002
using namespace std;
typedef long long int ll;
ll ifac[MAX_N];
ll fac[MAX_N];
ll myPower(ll x,ll n){
if(n == 0) return 1;
if( n % 2 == 0){
return myPower(x*x%modP,n/2);
}else{
return myPower(x,n-1)*x % modP;
}
}
ll comb(ll a,ll b){
if(a == 0 && b == 0) return 1;
if( a < b || a < 0) return 0;
ll tmp = ifac[a-b]*ifac[b]%modP;
return tmp * fac[a]%modP;
}
void combInit(){
fac[0] = 1;
ifac[0] = 1;
for(ll i = 0; i < MAX_N; i++){
fac[i+1] = fac[i]*(i+1) % modP;
ifac[i+1] = ifac[i]*myPower(i+1,modP - 2) % modP;
}
}
int main(){
ll N,K;
cin>>N>>K;
ll ans = 0;
for(ll i = K; i <= N+1; i++){
ll minSum = i*(i-1)/2;
ll right = N;
ll left = (N-i+1);
ll maxSum = (right + left)*i/2;
ans += maxSum - minSum + 1;
ans = ans % modP;
}
cout<<ans<<endl;
return 0;
}
| 0
| 68,401,939
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <set>
typedef long long ll;
using namespace std;
int main()
{
ll x,n,i,ans=10000001;
cin>>x>>n;
ll a;
set<ll>s;
for(i=0; i<n; i++)
{
cin>>a;
s.insert(a);
}
ll pos=10000001;
for(i=-150; i<=150; i++)
{
if(s.count(i))
continue;
if(abs(x-i)<ans)
{
pos=i;
ans=abs(x-i);
}
}
cout<<pos<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
int main() {
int N,M;
while(scanf("%d %d",&N,&M),N) {
priority_queue<P> Q;
for(int i=0;i<N;i++) {
int d,p;
scanf("%d %d",&d,&p);
Q.push(P(p,d));
}
int sum=0;
while(!Q.empty()) {
P p=Q.top();Q.pop();
int d=min(p.second,M);
M-=d;
p.second-=d;
sum+=p.second*p.first;
}
printf("%d\n",sum);
}
}
| 0
| 48,323,243
|
#include <iostream>
using namespace std;
int main() {
int N, X, T;
double num;
cin >> N >> X >> T;
num = N / X;
if (N % X) num++;
num *= T;
cout << int(num) << endl;
return 0;
}
|
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (LL)(1e18)+1;
const int INF_INT = 2147483647-1e6-1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
LL N;
vector<set<LL>> red;
vector<set<LL>> blue;
LL ans = 0;
void solve(){
for(int blue_x=0;blue_x<=2*N-1;blue_x++){
for(auto blue_y_iter=blue[blue_x].begin();blue_y_iter!=blue[blue_x].end();blue_y_iter++){
LL blue_y = *(blue_y_iter);
pair<LL,LL> selected_red(-1,-1);
for(int red_x=blue_x-1;red_x>=0;red_x--){
auto iter = red[red_x].lower_bound(blue_y);
if(iter==red[red_x].begin()) continue;
iter--;
LL red_y = *iter;
if(selected_red.second<red_y){
selected_red = pair<LL,LL>(red_x,red_y);
}
}
if(selected_red.first==-1) continue;
red[selected_red.first].erase(selected_red.second);
ans++;
}
}
}
int main(){
cin >> N;
red = vector<set<LL>>(2*N);
blue = vector<set<LL>>(2*N);
for(int i=0;i<N;i++){
LL a,b;cin >> a >> b;
red[a].insert(b);
}
for(int i=0;i<N;i++){
LL a,b;cin >> a >> b;
blue[a].insert(b);
}
solve();
cout << ans << endl;
return 0;
}
| 0
| 53,009,778
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int64 k;
int main() {
scanf("%lld", &k);
int64 c = k / 50;
int64 r = k % 50;
if(c == 0) {
if(k == 0) {
printf("2\n0 0\n");
return 0;
}
if(k == 1) {
printf("2\n2 0\n");
return 0;
}
printf("%lld\n", k);
for(int i = 1; i <= k; i++) {
printf("%lld", k);
printf(i == k ? "\n" : " ");
}
return 0;
}
printf("50\n");
for(int i = 1; i <= r; i++)
printf("%lld ", 50 + c - i + 1);
for(int i = 1; i <= 50 - r; i++) {
printf("%lld", 49 + c - r);
printf(i == 50 - r ? "\n" : " ");
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int n[4];
for(int i = 0; i < 5; ++i)
cin >> n[i];
sort(n, n + 5, greater<int>());
for(int i = 0; i < 5; ++i){
if(i == 4)
cout << n[i] << endl;
else
cout << n[i] << " ";
}
return 0;
}
| 0
| 23,768,220
|
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<iterator>
#include<cmath>
#include<string>
#include<algorithm>
#include<sstream>
#include<queue>
#include<list>
#include<deque>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<chrono>
#include<iomanip>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define siz 100009
#define mp make_pair
#define ll long long int
#define fileout freopen("output.txt","w",stdout)
#define filein freopen("input.txt","r",stdin)
#define pi acos(-1.0)
#define all(x) x.begin(),x.end()
#define ull unsigned long long int
#define m(a) memset(a,0,sizeof(a))
#define f(i,n) for(ll i=0;i<n;i++)
#define sc(a) scanf("%lld",&a)
#define pr(a) printf("%lld\n",a)
#define vll vector<ll>
#define sll set<ll>
const ll inf = 1000000000000000;
ll in = 1000000000000000000;
using namespace std;
int main()
{
FastIO;
double t, a, i, j, k, q, c, d, b, r,n;
cin >> a >> b >> c >> d;
if(a/2.0==c && b/2.0==d)
cout << setprecision(10) << fixed << .5 * a * b <<" 1"<< endl;
else
cout << setprecision(10) << fixed << .5 * a * b << " 0" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
list<unsigned long long> dat(0);
list<unsigned long long>::iterator t=dat.begin();
string com;
int n,a;
cin>>n;
for(int i=0; i<n; i++){
cin >> com;
if(com=="insert"){
cin >> a;
dat.push_front(a);
}
else if(com=="delete"){
cin >> a;
t = dat.begin();
while(t!=dat.end() && *t!=(unsigned long long)a){
t++;
}
if(*t==(unsigned long long)a)
dat.erase(t);
}
else if(com=="deleteFirst"){
dat.pop_front();
}
else{
dat.pop_back();
}
}
t=dat.begin();
printf("%Ld",*t++);
while(t!=dat.end()){
printf(" %Ld", *t++);
}
printf("\n");
return 0;
}
| 0
| 41,203,837
|
#include <iostream>
using namespace std;
int main(void){
int n;
int ai;
long long x=10000000000,y=(-100000000000),z=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>ai;
if(ai<x){
x=ai;
}
if(ai>y){
y=ai;
}
z=ai+z;
}
cout<<x<<" "<<y<<" "<<z<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define rrep(i,n) for(int i=(n);i>=0;--i)
#define ssort(n) sort((n).begin(),(n).end())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define INF 10101010
int main()
{
vector<int> num(3);
cin >> num[0] >> num[1] >> num[2];
int count=0;
ssort(num);
while(num[1]<num[2]){
num[0]++;num[1]++;count++;
}
if((num[2]-num[0])%2==1){
num[2]++;num[1]++;count++;
}
while(num[0]<num[2]){
num[0]+=2;count++;
}
cout << count << endl;
}
| 0
| 41,453,082
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
vector<pair<string,ll>> v;
for(int i = 0;i<n;i++)
{
string s;
ll t;
cin>>s>>t;
pair<string,ll> p = {s,t};
v.push_back(p);
}
string x;
cin>>x;
bool check = 0;
ll ans = 0;
for(auto it = v.begin();it!=v.end();it++)
{
if(check)
{
ans+=it->second;
}
if(it->first==x)
{
check=1;
}
}
cout<<ans<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
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{
bool eq = true;
int i=0;
while (eq){
if (A.at(i) > B.at(i)){
eq = false;
cout << "GREATER" << endl;
}
else if (A.at(i) < B.at(i)){
eq = false;
cout << "LESS" << endl;
}
else if (A.at(i) == B.at(i) && i==A.size()-1){
eq = false;
cout << "EQUAL" << endl;
}
i++;
}
}
}
| 0
| 76,419,344
|
#include<stdio.h>
int main()
{
int a,b,i, flag ;
char s[13];
while(~scanf("%d %d %s", &a, &b, s))
{
flag = 0;
if(s[a] != '-')
flag = 1;
if(!flag)
{
for(i=0; s[i] != 0; i++)
{
if(i==a) continue;
else if(s[i]<'0' || s[i]>'9')
{
flag = 1;
break;
}
}
}
if(flag) printf("No\n");
else printf("Yes\n");
}
}
|
#include <iostream>
using namespace std;
void func(int &points_A, int &points_B, string str1, string str2) {
int n;
int isLonger = 0;
if (str1.length() > str2.length()) {
n = str2.length();
isLonger = 1;
} else if (str1.length() < str2.length()) {
n = str1.length();
isLonger = 2;
} else {
n = str1.length();
}
for (int i = 0; i < n; i++) {
if ((int) str1[i] > (int) str2[i]) {
points_A += 3;
return;
} else if ((int) str1[i] < (int) str2[i]) {
points_B += 3;
return;
}
}
if (isLonger == 1) {
points_A += 3;
return;
} else if (isLonger == 2) {
points_B += 3;
return;
} else if (isLonger == 0) {
points_A++;
points_B++;
}
}
int main() {
int points_A = 0;
int points_B = 0;
int num;
cin >> num;
for (int i = 0; i < num; i++) {
string str1;
string str2;
cin >> str1;
cin >> str2;
func(points_A, points_B, str1, str2);
}
cout << points_A << " " << points_B << "\n";
}
| 0
| 84,473,760
|
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
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;
ll N;
ll A[100010], B[100010];
std::vector<ll> vs;
ll sum = 0, ans = 0;
int main()
{
std::cin >> N;
rep( i, N )
std::cin >> A[i];
rep( i, N )
std::cin >> B[i];
rep( i, N )
{
if( A[i] >= B[i] )
vs.emplace_back( A[i]-B[i] );
}
std::sort( rall(vs) );
rep( i, N )
{
if( A[i] < B[i] )
sum += B[i]-A[i], ++ans;
}
bool fl = false;
rep( i, vs.size() )
{
if( sum <= 0 )
{
fl = true;
break;
}
sum -= vs[i];
++ans;
}
if( sum <= 0 )
fl = true;
std::cout << (fl?ans:-1) << std::endl;
return 0;
}
|
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ctime>
#define int long long
#define double long double
using namespace std;
const double PI = acos(-1);
const double eps = 0.0000000001;
const int INF = 0x3fffffffffffffff;
int n, a[200005], x[200005], y[100005], cnt;
struct node
{
int v;
bool operator<(const node &TMP) const
{
return abs(v) < abs(TMP.v);
}
};
multiset<node> big;
multiset<node> zero;
multiset<node> small;
void work(multiset<node> &A, multiset<node> &B)
{
int X = A.begin()->v;
x[++cnt] = A.begin()->v;
A.erase(A.begin());
X -= B.begin()->v;
y[cnt] = B.begin()->v;
B.erase(B.begin());
if (X > 0)
{
big.insert({X});
}
if (X == 0)
{
zero.insert({X});
}
if (X < 0)
{
small.insert({X});
}
}
signed main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
if (a[i] > 0)
{
big.insert({a[i]});
}
if (a[i] == 0)
{
zero.insert({a[i]});
}
if (a[i] < 0)
{
small.insert({a[i]});
}
}
while (big.size() + zero.size() + small.size() > 2)
{
if (big.size() && zero.size() && small.size())
{
work(small, zero);
continue;
}
if (big.size() && zero.size())
{
work(zero, big);
continue;
}
if (small.size() && zero.size())
{
work(zero, small);
continue;
}
if (big.size() && small.size())
{
if (big.size() > small.size())
{
work(small, big);
}
else
{
work(big, small);
}
continue;
}
if (big.size())
{
work(big, big);
continue;
}
if (small.size())
{
work(small, small);
continue;
}
if (zero.size())
{
work(zero, zero);
continue;
}
}
if (big.size() && small.size())
{
work(big, small);
}
if (big.size() && zero.size())
{
work(big, zero);
}
if (small.size() && zero.size())
{
work(zero, small);
}
if (big.size() > 1)
{
int A = big.begin()->v, B = big.rbegin()->v;
big.clear();
++cnt;
x[cnt] = B;
y[cnt] = A;
big.insert({B - A});
}
if (zero.size() > 1)
{
int A = zero.begin()->v, B = zero.rbegin()->v;
zero.clear();
++cnt;
x[cnt] = B;
y[cnt] = A;
zero.insert({B - A});
}
if (small.size() > 1)
{
int A = small.begin()->v, B = small.rbegin()->v;
small.clear();
++cnt;
x[cnt] = B;
y[cnt] = A;
big.insert({B - A});
}
if (big.size())
{
cout << big.begin()->v << endl;
}
if (zero.size())
{
cout << zero.begin()->v << endl;
}
if (small.size())
{
cout << small.begin()->v << endl;
}
for (int i = 1; i <= cnt; ++i)
{
cout << x[i] << ' ' << y[i] << endl;
}
return 0;
}
| 0
| 44,780,810
|
#include <iostream>
#include <iomanip>
#include <map>
#include <utility>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 998244353;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
ll power(ll n, ll t)
{
ll r = 1;
repi(i, t, 0)
{
r *= n;
r %= MOD;
}
return r % MOD;
}
int main()
{
int n;
cin >> n;
map<int, int> rt;
repi(i, n, 0)
{
int d;
cin >> d;
if(i == 0 && d != 0){
cout << 0 << endl;
return 0;
}
rt[d]++;
}
if (rt[0] != 1)
{
cout << 0 << endl;
}
else
{
ll ans = 1;
repi(i, rt.size(), 1)
{
ans *= power(rt[i - 1], rt[i]);
ans %= MOD;
}
cout << ans % MOD << endl;
}
return 0;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll n,k; string s; cin >> n >> s >> k;
rep(i,ll(s.size())){
if(s[i] != s[k-1]){
s[i] = '*';
}
}
cout << s << endl;
}
| 0
| 98,643,410
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#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 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 complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
int w, h, n; cin >> w >> h >> n;
vector<vector<bool>> f(w, vector<bool>(h, 0));
rep(i, n) {
int X, Y, a; cin >> X >> Y >> a;
rep(x, w) {
rep(y, h) {
if(a == 1) {
if(x < X) f[x][y] = 1;
} else if(a == 2) {
if(x >= X) f[x][y] = 1;
} else if(a == 3) {
if(y < Y) f[x][y] = 1;
} else {
if(y >= Y) f[x][y] = 1;
}
}
}
}
int ans = 0;
rep(i, w) {
rep(j, h) {
if(f[i][j]) ++ ans;
}
}
cout << h * w - ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector <vc> vvc;
typedef vector <vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <vi> vvi;
typedef vector <vvi> vvvi;
typedef vector<short> vs;
typedef vector <vs> vvs;
typedef vector <vvs> vvvs;
typedef vector <ll> vl;
typedef vector <vl> vvl;
typedef vector <vvl> vvvl;
typedef vector <ld> vld;
typedef vector <vld> vvld;
typedef vector <vvld> vvvld;
typedef vector <string> vst;
typedef vector <vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template<class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template<class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template<class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template<class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream &operator<<(ostream &out, vector <T> &a) {
out << "[";
fori (i, a.size())out << a[i] << vector < string > {", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
#ifdef HK_CUP
freopen("finput.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
#ifndef HK_CUP
cout << "\n\nTOTAL EXECUTION TIME: " << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
#endif
return 0;
}
void smain() {
int w, h;
cin >> w >> h;
vi kek(w);
for (int i = 0; i < w; ++i)
cin >> kek[i];
vi lel(h);
for (int i = 0; i < h; ++i)
cin >> lel[i];
int ans = 0;
for (int v : kek)
ans += v;
for (int v : lel)
ans += v;
vi _1 = kek, _2 = lel;
stable_sort(ALL(kek));
stable_sort(ALL(lel));
for (int i = 0; i < SZ(kek); ++i)
{
int l = -1, r = SZ(lel);
while (r - l > 1)
{
int m = l + r >> 1;
if (lel[m] > kek[i])
r = m;
else
l = m;
}
ans += kek[i] * (SZ(lel) - r);
}
for (int i = 0; i < SZ(lel); ++i)
{
int l = -1, r = SZ(kek);
while (r - l > 1)
{
int m = l + r >> 1;
if (kek[m] >= lel[i])
r = m;
else
l = m;
}
ans += lel[i] * (SZ(kek) - r);
}
cout << ans;
}
| 0
| 86,440,885
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vector<vector<long long int> >;
int main(void) {
string s;
cin >> s;
string first = s.substr(0, 4);
string second = s.substr(4, 8);
cout << first << " " << second << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int n, k; cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<int> s(n+1); s[0] = 0;
rep(i,n) s[i+1] = (s[i] + a[i]) %k;
map<int,int> mp;
ll ans = 0;
rep(i,n+1){
ans += mp[s[i]];
mp[s[i]]++;
}
dunk(ans);
}
| 0
| 72,327,407
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int x;
cin >> x;
int div = x / 100;
int rem = x % 100;
bool ok = false;
if (x < 100) ok = false;
else if (rem == 0) ok = true;
else if (x >= div * 100 && x <= div * 105) {
ok = true;
}
if (ok) cout << 1 << '\n';
else cout << 0 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
long long k;
cin >> k;
int n = (int)s.size();
if (s == string(n, s[0])) {
cout << n * k / 2 << '\n';
return 0;
}
long long cnt = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {
cnt++;
i++;
}
}
string ss = s + s;
long long cnt2 = 0;
for (int i = 0; i < 2 * n - 1; i++) {
if (ss[i] == ss[i + 1]) {
cnt2++;
i++;
}
}
cout << (cnt2 - cnt) * (k - 1) + cnt << '\n';
return 0;
}
| 0
| 72,012
|
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i=s;i<n;++i)
#define drep(i,s,n) for (int i=n;i>=s;--i)
#define all(x) (x).begin(),(x).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define print(x) cout<<(x)<<endl
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b)
{if (a%b == 0) return(b);
else return(gcd(b,a%b));}
ll lcm(ll a,ll b)
{return a/gcd(a,b)*b;}
void printv(vector<auto> v) {cout<<'[';rep(i,0,v.size()){cout<<v[i]<<',';}cout<<']'<<endl;}
void printvv(vector<vector<auto>> vv)
{cout<<'['<<endl;
rep(q,0,vv.size()){cout<<'[';rep(p,0,vv.at(q).size())cout<<vv.at(q).at(p)<<',';cout <<']'<<endl;}
cout<<']'<<endl;}
void solve(); int main(){cin.tie(0);ios::sync_with_stdio(0);solve();}
int step_x[] = {-1,0,0,1};
int step_y[] = {0,-1,1,0};
ll INF=1e18;
int N;
ll ans=1;
void solve() {
cin>>N;
rep(i,0,N)
{
ll T;
cin>>T;
ans = lcm(ans, T);
}
print(ans);
return;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solve (void)
{
int N;cin>>N;
cout<<0<<endl;
string str;
cin>>str;
vector<int> vec(N,-1);
if(str == "Male")
{
vec[0] = 0;
}
else if(str == "Female")
{
vec[0] = 1;
}
else
{
return;
}
int L = 0; int R = N;
for (int i = 0; i < 19; i++)
{
int mid = (L + R)/2;
cout<<mid<<endl;
cin >> str;
int X = -1;
if (str == "Male")
{
X = 0;
}
else if (str == "Female")
{
X = 1;
}
else
{
return;
}
if(((X == vec[0])&&(mid%2 == 0)) ||( (X != vec[0])&&(mid%2 != 0)))
{
L = mid;
}
else
{
R = mid;
}
}
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| 0
| 90,842,306
|
#include <bits/stdc++.h>
#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(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
if (N % 2 == 0) cout << N/2 - 1 << endl;
else cout << N/2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main () {
int n;
cin >> n;
vector < int > c(n - 1), s(n - 1), f(n - 1);
for (int i = 0; i < n - 1; ++i)
cin >> c[i] >> s[i] >> f[i];
for (int i = 0; i < n; ++i) {
int64_t ans = 0;
for (int j = i; j < n - 1; ++j) {
ans = max(ans, int64_t(s[j]));
while (ans % f[j])
++ans;
ans += c[j];
}
cout << ans << '\n';
}
}
| 0
| 72,410,403
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define mp make_pair
#define ll long long int
#define pb push_back
#define F first
#define S second
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin>>n>>k;
vector<int> v(n);
for(int i = 0; i < n; i++)
{
cin>>v[i];
}
sort(v.begin(), v.end(), greater<>());
int cnt = 0;
for(int i = 0; i < n; i++)
{
if(v[i] >= k)
{
cnt++;
}
if(v[i] < k)
{
break;
}
}
cout<<cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0; i < n; i++){
cin >> a.at(i);
}
for(int i=0; i < m; i++){
cin >> b.at(i);
}
rep(i,n-m+1){
rep(j,n-m+1){
bool x = true;
rep(k,m){
if(b.at(k) != a.at(i+k).substr(j,m)){
x = false;
}
}
if(x){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 57,384,075
|
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>
using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
template<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}
template<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
int main() {
int a[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k; cin >> k;
cout << a[k - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9+7
typedef long long int ll;
const int maxn = 1000;
ll mod = INF;
int main(){
int h,n;
int a[1000],b[1000];
int dp[10001];
cin >> h>>n;
for(int i=0;i<n;i++){
cin >> a[i]>>b[i];
}
for(int i=0;i<=10000;i++){
dp[i]=INF;
}
dp[0]=0;
for(int d=1;d<=10000;d++){
for(int j=0;j<n;j++){
if(d-a[j]<0){
dp[d]=min(dp[d],b[j]);
}else if(d-a[j]>=0){
dp[d]=min(dp[d],dp[d-a[j]]+b[j]);
}
}
}
for(int i=h;i<=10000;i++){
if(dp[i]!=INF){
cout << dp[i]<<endl;
break;
}
}
return 0;
}
| 0
| 100,127,119
|
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
int main()
{
ll n, k;
cin >> n >> k;
vector<ll> val(1e+5 + 10, 0);
rep(i, n) {
ll a, b;
cin >> a >> b;
val[a] += b;
}
ll ans;
for (int i = 1; i <= 1e+5+10; i++) {
k -= val[i];
if (k <= 0) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
int main(void){
int a=0,b=0,change=0;
while(true){
scanf("%d %d",&a,&b);
if((a==0)&&(b==0)){
break;
}
if(b<a){
change=a;
a=b;
b=change;
}
printf("%d %d\n",a,b);
}
return 0;
}
| 0
| 57,577,779
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t X, Y, A, B, C, a, t, x = 0, y = 0, z = 0, ans = 0;
cin >> X >> Y >> A >> B >> C;
priority_queue<pair<int64_t, int64_t>> pq;
for (int i = 0; i < A; i++)
{
cin >> a;
pq.push({a, 0});
}
for (int i = 0; i < B; i++)
{
cin >> a;
pq.push({a, 1});
}
for (int i = 0; i < C; i++)
{
cin >> a;
pq.push({a, 2});
}
while (x + y + z < X + Y)
{
tie(a, t) = pq.top();
pq.pop();
if (t == 0 && x < X)
{
ans += a;
x++;
}
else if (t == 1 && y < Y)
{
ans += a;
y++;
}
else if (t == 2)
{
ans += a;
z++;
}
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define SIZE(x) ((int)(x).size())
#define UQ(v) v.erase(unique(v,begin(),v,end()),v.end());
ll INF = 1LL <<30;
#define pb push_back
int dxy4[5] = { 0,1,0,-1,0 };
int dxy8[9] = { 0,1,1,0,-1,1,-1,-1,0 };
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
ll mod7 = 1000000007;
ll mod9 = 1000000009;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define FOR(i,x,n) for(int i=x;i<n;++i)
int a[100000];
int main() {
int n,k;
while (cin >> n >> k) {
if (!n)break;
rep(i, n)cin >> a[i];
ll sum = 0 ,ans = 0;;
rep(i, k)sum += a[i];
FOR(i, k, n) {
sum = sum + a[i] - a[i - k];
ans = max(sum, ans);
}
cout << ans << endl;
}
cin >> n;
return 0;
}
| 0
| 80,107,020
|
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
template<class T> inline bool change(T a,T b){if(a > b){swap(a,b);return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll n,ll m,ll MOD){
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N,M;
cin >> N >> M;
vector<vector<char>> moto(N,vector<char>(N)),tem(M,vector<char>(M));
rep(i,N)
rep(j,N)cin >> moto[i][j];
rep(i,M)
rep(j,M)cin >> tem[i][j];
ll ans = 0;
rep(i,N - M + 1){
rep(j,N - M + 1){
bool ok = true;
rep(k,M){
rep(l,M){
if(moto[i + k][j + l] != tem[k][l])ok = false;
}
}
if(ok){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No\n";
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
int main() {
ll n, Z, W;
cin >> n >> Z >> W;
vl a(n+1);
exrep(i, 1, n) {
cin >> a[i];
}
vvl dp(n, vl(2));
for(ll i = n-1; i >= 0; i--) {
dp[i][0] = -INF;
ll Y = a[i];
if(i == 0) {
Y = W;
}
chmax(dp[i][0], abs(a[n] - Y));
exrep(j, i+1, n-1) {
chmax(dp[i][0], dp[j][1]);
}
dp[i][1] = INF;
ll X = a[i];
if(i == 0) {
X = Z;
}
chmin(dp[i][1], abs(X - a[n]));
exrep(j, i+1, n-1) {
chmin(dp[i][1], dp[j][0]);
}
}
out(dp[0][0]);
re0;
}
| 0
| 91,108,085
|
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (A >= B) cout << "delicious" << endl;
else if (B - A <= X) cout << "safe" << endl;
else cout << "dangerous" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> height(N);
for (ll i = 0; i < N; i++) {
cin >> height.at(i);
}
vector<vector<ll>> road(M, vector<ll>(2));
for (ll i = 0; i < M; i++) {
cin >> road.at(i).at(0) >> road.at(i).at(1);
}
vector<ll> ma(N, 0);
for(ll i = 0; i < M; i++) {
ma.at(road.at(i).at(0) - 1) = max(ma.at(road.at(i).at(0) - 1), height.at(road.at(i).at(1) - 1));
ma.at(road.at(i).at(1) - 1) = max(ma.at(road.at(i).at(1) - 1), height.at(road.at(i).at(0) - 1));
}
ll ans = 0;
for(ll i = 0; i < N; i++) {
if(height.at(i) > ma.at(i)) {
ans++;
}
}
cout << ans <<endl;
}
| 0
| 82,826,778
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <climits>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <sstream>
#include <numeric>
using namespace std;
int mcm(const vector<int> &p) {
int n = p.size() - 1;
vector<vector<int>> dp(n, vector<int>(n, INT_MAX));
for (int i = 0 ; i < n; ++i) dp[i][i] = 0;
for (int l = 1; l < n; ++l)
for (int i = 0, j; (j = i + l) < n; ++i)
for (int k = i; k < j; ++k)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + p[i] * p[k + 1] * p[j + 1]);
return dp[0][n-1];
}
int main() {
int n, r, c;
cin >> n;
vector<int> p;
for (int i = 0; i < n; ++i) {
cin >> r >> c;
p.push_back(r);
}
p.push_back(c);
auto ans = mcm(p);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main() {
int H, W;
while (cin >> H >> W && (H || W)) {
for (int i = 0; i < W; i++)
cout << "#";
cout << endl;
for (int i = 1; i < H - 1; i++) {
cout << "#";
for (int j = 1; j < W - 1; j++)
cout << ".";
cout << "#" << endl;
}
for (int i = 0; i < W; i++)
cout << "#";
cout << endl;
cout << endl;
}
}
| 0
| 39,809,686
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<vector<ll> >;
using vd = vector <double>;
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
#define sortp(d) sort(d.begin(),d.end())
#define sortm(d) sort(d.rbegin(),d.rend())
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
ll p=0,q=0,r=0;
int main()
{
string S;
cin>>S;
bool app[26];
for (int i = 0; i < 26; ++i) {
app[i] = false;
}
for (int i = 0; i < S.size(); ++i) {
app[S[i] - 'a'] = true;
}
for (int i = 0; i < 26; ++i) {
if (app[i]==false) {
printf("%c\n", (char)(i + 'a'));
return 0;
}
}
puts("None");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int N,A,B;
cin>>N>>A>>B;
vector<int>P(N);
map<int,int>k;
k[0]=0,k[1]=0,k[2]=0;
for(int i=0;i<N;i++){
cin>>P[i];
if(P[i]<=A){k[0]++;}
else if(P[i]>A&&P[i]<=B){k[1]++;}
else{k[2]++;}
}
int MIN=999;
for(auto c:k){
MIN=min(MIN,c.second);
}
cout<<MIN<<endl;
return 0;
}
| 0
| 3,467,661
|
#ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main()
{
int n;
cin >> n;
auto a = vector<int>(n);
for (auto& a_i : a) {
cin >> a_i;
}
auto factors = vector<vector<int>>(1'000'005);
for (int a_i = 1; a_i <= 1'000'000; ++a_i) {
auto x = a_i;
factors[a_i].push_back(1);
if (x % 2 == 0) {
do { x /= 2; } while (x % 2 == 0);
factors[a_i].push_back(2);
}
if (x % 3 == 0) {
do { x /= 3; } while (x % 3 == 0);
factors[a_i].push_back(3);
}
for (int d = 5; d * d <= x;) {
if (x % d == 0) {
do { x /= d; } while (x % d == 0);
factors[a_i].push_back(d);
}
d += 2;
if (x % d == 0) {
do { x /= d; } while (x % d == 0);
factors[a_i].push_back(d);
}
d += 4;
}
if (x > 1) {
factors[a_i].push_back(x);
}
}
auto factor_count = vector<int>(1'000'005);
for (auto a_i : a) {
for (auto f : factors[a_i]) {
factor_count[f]++;
}
}
auto sharing = 0;
for (auto f = 1; f <= 1'000'000; ++f) {
if (f == 1) continue;
sharing = max(sharing, factor_count[f]);
}
if (sharing <= 1) {
cout << "pairwise coprime" << endl;
return 0;
}
if (sharing < n) {
cout << "setwise coprime" << endl;
return 0;
}
cout << "not coprime" << endl;
return 0;
}
|
#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 fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
string t = "keyence";
rep(i, 8) {
if (s.substr(0, i) + s.substr(n - 7 + i) == t) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| 0
| 34,361,723
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N; cin>>N;
ll count=1,ans=0,m=N;
for(ll i=0;i<N;i++){
ll a; cin>>a;
m=min(m,a);
if(a==count){
count++;
}else{
ans++;
}
}
if(m!=1){
cout<<-1<<endl;
return 0;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
template<class T>T updivide(T a,T b){if(b==1) return a;else if(a%b==0) return a/b;else return (a/b)+1;}
int main(){
INT(n);
vector<int> vec(n),plus,minus,zero;
rep(i,n){
in(vec[i]);
if(vec[i]>0){
plus.push_back(vec[i]);
}
if(vec[i]<0){
minus.push_back(vec[i]);
}
if(vec[i]==0){
zero.push_back(0);
}
}
int d=0;
while(d!=zero.size()){
d++;
if(plus.size()<minus.size()){
plus.push_back(0);
}
else if(plus.size()>=minus.size()){
minus.push_back(0);
}
}
vector<pair<int,int>> ope;
int m=0;
if(plus.size()>=1&&minus.size()>=1){
sort(all(plus));
sort(rall(minus));
for(int i=1;i<plus.size();i++){
ope.push_back(make_pair(minus[0],plus[i]));
minus[0]-=plus[i];
}
for(int i=0;i<minus.size();i++){
ope.push_back(make_pair(plus[0],minus[i]));
plus[0]-=minus[i];
}
m=plus[0];
}else{
sort(all(plus));
sort(rall(minus));
for(int i=1;i<plus.size();i++){
if(i<plus.size()-1){
ope.push_back(make_pair(plus[0],plus[i]));
plus[0]-=plus[i];
}else{
ope.push_back(make_pair(plus[i],plus[0]));
plus[i]-=plus[0];
m=plus[i];
}
}
for(int i=1;i<minus.size();i++){
ope.push_back(make_pair(minus[0],minus[i]));
minus[0]-=minus[i];
m=minus[0];
}
}
out(m);
rep(i,ope.size())out(ope[i].first,ope[i].second);
}
| 0
| 61,876,545
|
#include <iostream>
#include <string>
using namespace std;
int const NMAX = 1e5;
int v[1 + NMAX];
int main() {
int n, pos = 1, p, ans = 1;
string GUIDO;
cin >> n >> p;
ans *= p;
for(int i = 1;i < n;i++){
ans *= (p - 1);
}
cout << ans;
return 0;
}
|
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) REP(sz, vec.size()) cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
vvll edges;
ll dfs(ll i, ll p) {
ll ret = 0;
for (ll e: edges[i]) {
if (e == p) continue;
ret ^= dfs(e, i) + 1;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n; cin >> n;
edges.resize(n);
REP(i, n - 1) {
ll x, y; cin >> x >> y;
edges[x - 1].emplace_back(y - 1);
edges[y - 1].emplace_back(x - 1);
}
ll grun = dfs(0, -1);
if (grun == 0) cout << "Bob\n";
else cout << "Alice\n";
return 0;
}
| 0
| 11,412,002
|
#include <iostream>
using namespace std;
int main() {
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
int maxdiff = max(abs(a1-a2), max(abs(a2-a3), abs(a3-a1)));
cout << abs(a1-a2) + abs(a2-a3) + abs(a3-a1) - maxdiff << endl;
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
#define endl "\n"
#define all(V) V.begin(),V.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
const int MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const int inf = 1 << 25;
constexpr long double pi = 3.141592653589793238462643383279;
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact_mod(ll n, ll mod) {
ll f = 1; for (int i = 2; i <= n; i++) f = f * (i % mod) % mod;
return f;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll keta(ll n) {
if (n == 0) return 1;
ll count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
ll mch(ll n) {
if (n == 1) return 1;
else return n * mch(n - 1);
}
ll powmod(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
ll inv_mod(ll a, ll mod) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= mod;
if (u < 0) u += mod;
return u;
}
bool is_prime(const unsigned n) {
switch (n) {
case 0:
case 1: return false;
case 2:
case 3: return true;
}
if (n % 2 == 0 || n % 3 == 0) return false;
for (unsigned i = 5; i * i <= n; i += 6) {
if (n % i == 0) return false;
if (n % (i + 2) == 0) return false;
}
return true;
}
int n, a[100010], x, ans;
int main(void) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > n) ++ans;
else ++a[x];
}
for (int i = 1; i <= n; ++i) {
if (a[i] == 0) continue;
if (a[i] < i) ans += a[i];
else if (a[i] > i) ans += a[i] - i;
}
cout << ans << endl;
return 0;
}
| 0
| 42,962,023
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
int res = 0;
res += (A>B) ? B : A;
res += (C>D) ? D : C;
cout << res << endl;
}
|
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
void _print(vector<int> res) {
for (int i = 1; i < res.size(); i++) {
cout << res[i] << " ";
}
cout << endl;
}
void maxHeap(vector<int> &heap, int i) {
int left = 2 * i;
int right = 2 * i + 1;
int lagest = i;
if (left < heap.size() && left >= 1) {
if (heap[left] > heap[lagest]) {
lagest = left;
}
}
if (right < heap.size() && right >= 1) {
if (heap[right] > heap[lagest]) {
lagest = right;
}
}
if (lagest != i) {
swap(heap[lagest], heap[i]);
maxHeap(heap, lagest);
}
}
void insertHeap(vector<int> &heap, int key) {
heap.push_back(key);
int parentIndex = heap.size() - 1;
int keyIndex = parentIndex;
while (keyIndex > 1) {
parentIndex /= 2;
if (heap[parentIndex] < heap[keyIndex]) {
swap(heap[parentIndex], heap[keyIndex]);
keyIndex = parentIndex;
} else {
break;
}
}
}
void extractHeap(vector<int> &heap) {
if (heap.size() >= 1) {
cout << heap[1] << endl;
swap(heap[1], heap[heap.size() - 1]);
heap.pop_back();
maxHeap(heap, 1);
}
}
int main() {
vector<int> heap;
heap.push_back(-1);
string input;
int key;
while (true) {
cin >> input;
if (input == "insert") {
cin >> key;
insertHeap(heap, key);
}
if (input == "extract") {
extractHeap(heap);
}
if (input == "end") {
break;
}
}
return 0;
}
| 0
| 47,176,888
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long Y,ans;
string s;
ans=0;
cin>>s>>Y;
for(int i=0;i<s.size();i++){
if(i%Y==0){
cout<<s[i];
}
}
cout<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<ll,ll>;
const int inf=1e9+7;
const ll INF=9e18;
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(20);
string s;
cin>>s;
int n=s.size();
rep(i,0,n-1){
if(s[i]==s[i+1]){
cout<<i+1<<" "<<i+2<<endl;
return 0;
}
}
rep(i,0,n-2){
if(s[i]==s[i+2]){
cout<<i+1<<" "<<i+3<<endl;
return 0;
}
}
cout<<-1<<" "<<-1<<endl;
}
| 0
| 75,171,215
|
#include <iostream>
int main(void){
std::string S, T, ans="No";
std::cin >> S >> T;
int N = S.size();
for (int i=0; i<N; ++i){
bool flg = true;
int loc = i;
for (int j=0; j<N; ++j){
if (loc + j >= N) loc -= N;
if (S.at(loc + j) != T.at(j)){
flg = false;
break;
}
}
if (flg){
ans = "Yes";
break;
}
}
std::cout << ans << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fo(i, n) for(int i = 1; i <= n; ++i)
typedef long long ll;
const int N = 500505;
const int mod = 1e9 + 7;
int n, a[N], u, v;
vector<int> g[N];
inline void no() {
cout << "NO";
exit(0);
}
inline ll dfs(int v, int p = 0) {
vector<ll> h;
for(int to : g[v]) {
if(to == p) continue;
h.pb(dfs(to, v));
}
if(!h.size()) return a[v];
ll sum = 0;
for(ll w : h) sum += w;
ll min_moves = sum / 2;
ll max_moves = sum;
if(a[v] < min_moves || a[v] > max_moves)
no();
ll moves_by_two = max_moves - a[v];
ll all_moves = min(sum - *max_element(h.begin(), h.end()), sum / 2);
if(moves_by_two > all_moves) no();
sum -= moves_by_two * 2;
return sum;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n;
fo(i, n) cin >> a[i];
for(int i = 1; i < n; ++i) {
cin >> u >> v;
g[u].pb(v); g[v].pb(u);
}
if(n == 2) {
if(a[1] == a[2]) return cout << "YES", 0;
cout << "NO";
return 0;
}
int root = 1;
for(int i = 1; i <= n; ++i)
if(g[i].size() != 1) root = i, i = n + 1;
if(dfs(root) != 0) return cout << "NO", 0;
cout << "YES";
return 0;
}
| 0
| 68,821,415
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll H,W,D,Q;
cin >> H >> W >> D;
vector<vector<ll>> A(H,vector<ll>(W));
map<ll,Pll> mp;
rep(i,H){
rep(j,W){
cin >> A[i][j];
mp[A[i][j]] = Pll(i,j);
}
}
cin >> Q;
vector<ll> dp(H*W+10);
rep(i,H*W){
if(i<D)continue;
dp[i+1] = dp[i+1-D] + abs(mp[i+1].first - mp[i+1-D].first) + abs(mp[i+1].second - mp[i+1-D].second);
}
ll L,R;
vector<ll> v;
rep(i,Q){
cin >> L >> R;
v.push_back(dp[R]-dp[L]);
}
rep(i,Q){
cout << v[i] << endl;
}
}
|
#include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
using namespace std;
#define endl '\n'
#define ll long long int
#define c(x) ll x;cin>>x
#define cc(x,y) ll x,y;cin>>x>>y
#define ccc(x,y,z) ll x,y,z; cin>>x>>y>>z
#define db long double
#define fast cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define inf 200000000000000
#define mod 1000000007
#define eps 1e-7
#define PI 3.1415926535897932385
#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (ll)(x).size()
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define foreach(it,ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fill(ar,val) memset(ar, val, sizeof(ar))
#define print(arr,n) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n) cout<<arr[i]<<" "; cout<<endl
#define print2(arr,n,m) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n){ rep(j,m) cout<<arr[i][j]<<" "; cout<<endl; }
#define dyn1(arr,n) ll* arr=new ll[n]; rep(i,n) arr[i]=0;
#define dyn2(arr,n,m) ll** arr=new ll*[(n)]; rep(i,n) arr[i]=new ll[m]; rep(i,n) rep(j,m) arr[i][j]=0
#define carr(arr,n) rep(i,n) cin>>arr[i]
#define carr2(arr,n,m) rep(i,n) rep(j,m) cin>>arr[i][j]
#define debug(a) cout<<" :: "<<#a<<" == "<<a<<endl
#define debug2(a,b) cout<<" :: "<<#a<<" == "<<a<<" :: "<<#b<<" == "<<b<<endl
typedef pair<ll,ll> pii;
typedef vector<pii> vii;
inline ll maxim(ll a,ll b) {if(a>b) return a; else return b;}
inline ll minim(ll a,ll b) {if(a<b) return a; else return b;}
inline bool equals(double a, double b){ return fabs(a - b) < 1e-9; }
ll gcd(ll a, ll b){ return b==0 ? a : gcd(b, a%b); }
bool prime[3001];
void SieveOfEratosthenes()
{
memset(prime, true, sizeof(prime));
prime[1]=false;
for (int p=2; p*p<=3000; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=3000; i += p)
prime[i] = false;
}
}
}
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 modpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1) res = (res * a)%mod;
a = (a * a)%mod;
b >>= 1;
}
return res;
}
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll peak[1000010]={0};
map<ll,ll> m;
ll arr[1000010]={0};
vector<ll> cont;
ll temp[1000010]={0};
int main()
{
fast;
cout<<setprecision(10)<<fixed;
string s;
cin>>s;
ll n=s.length();
rep(o,n) arr[s[o]-'a']++;
ll total=1+(n*(n-1))/2;
rep(o,26)
{
total-=(arr[o]*(arr[o]-1))/2;
}
cout<<total<<endl;
return 0;
}
| 0
| 66,400,456
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, l, r, G;
G = 0;
cin >> N;
for(int i = 0; i < N; i++) {
int p = 0;
cin >> l >> r;
p = ((r - l) + 1);
G += p;
}
cout << G << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <functional>
#include <complex>
#include <cmath>
#include <vector>
#include <climits>
#include <set>
using namespace std;
int main()
{
int n;
int g[10][10];
while (cin >> n, n) {
set<int> pat;
fill((int *)g, (int *)(g + 10), INT_MAX / 2);
for (int i = 0; i < n; i++) {
int to, from, cost;
cin >> to >> from >> cost;
pat.insert(to);
pat.insert(from);
g[to][from] = cost;
g[from][to] = cost;
}
int m = pat.size();
for (int k = 0; k < m; k++) {
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (i == j) continue;
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
int r = INT_MAX, index;
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
if (i == j) continue;
sum += g[i][j];
}
if (r > sum) {
r = sum;
index = i;
}
}
cout << index << " " << r << endl;
}
return 0;
}
| 0
| 57,344,996
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const double PI=3.14159265358979323846;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0') {
++cnt;
} else {
--cnt;
}
}
cout << S.size() - abs(cnt) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define lb lower_bound
#define ub upper_bound
#define srt(a) sort(a.begin(),a.end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
#define mxe(a) *max_element(a.begin(),a.end())
#define mne(a) *min_element(a.begin(),a.end())
#define endl '\n'
#define mod 1000000007
#define INF64 1e18
const int N=105;
const int K=100005;
int dp[N][K];
void solve(){
int n,k;cin>>n>>k;
vi a(n+1);
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=0;i<=n;i++)dp[i][0]=1;
vi pref(k+1,1);
for(int i=1;i<=n;i++){
vi p(k+1);
p[0]=1;
for(int j=1;j<=k;j++){
dp[i][j]=(mod+pref[j]-(j-a[i]-1>=0?pref[j-a[i]-1]:0))%mod;
p[j]=(p[j-1]+dp[i][j])%mod;
}
pref=p;
}
cout<<dp[n][k];
}
int32_t main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int T=1;
for(int TT=1;TT<=T;TT++){
solve();
}
}
| 0
| 77,114,381
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#define REP(i,a) for (int i = 0;i < (a);++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(obj) (obj).begin,(obj).end()
#define SORT(list) sort(ALL((list)));
#define MOD 1000000007
using namespace std;
using ll = long long;
int main(){
int h,w,d;
cin >> h >> w >> d;
int a[h][w],total[d];
map<int,pair<int,int> >m;
REP(i,h){
REP(j,w){
cin >> a[i][j];
m[a[i][j]] = make_pair(i,j);
}
}
ll answer = 0;
int q;
cin >> q;
int l[q],r[q],left[h*w+1],right[h*w+1];
REP(i,q){
cin >> l[i] >> r[i];
}
FOR(i,0,h*w+1){
int lx,ly,px,py;
ly = m[i].first,lx = m[i].second;
if(i<=d){
left[i]=0;
}
else{
ly = m[i].first,lx = m[i].second;
py = m[i-d].first,px = m[i-d].second;
left[i] = left[i-d]+abs(lx-px)+abs(ly-py);
}
}
FORR(i,h*w,0){
if(i > h*w-d){
right[i] = 0;
continue;
}
int ly = m[i].first,lx = m[i].second;
int py = m[i+d].first,px = m[i+d].second;
right[i] = right[i+d] + abs(lx-px)+abs(ly-py);
}
FORR(i,h*w,h*w-d+1){
total[i%d]=left[i];
}
REP(i,q){
cout << left[r[i]]+right[l[i]]-total[l[i]%d] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n+1);
for ( int i=0; i<n; i++ ) {
cin >> a[i];
}
for ( int i=0; i<k; i++ ) {
vector<int> b(n+1);
for ( int i=0; i<n; i++ ) {
int l=max(0,i-a[i]);
int r=min(n,i+a[i]+1);
b[l]++; b[r]--;
}
a[0]=b[0];
for ( int i=1; i<n; i++ ) {
b[i]+=b[i-1];
a[i]=b[i];
}
bool flag=1;
for ( int i=0; i<n; i++ ) {
if ( a[i]!=n ) {
flag=0;
break;
}
}
if ( flag ) break;
}
for ( int i=0; i<n; i++ ) {
cout << a[i] << ' ';
}
return 0;
}
| 0
| 82,817,427
|
#include <iostream>
#include <algorithm>
using namespace std;
int res[300000];
int main(){
long long n, a, b;
cin >> n >> a >> b;
if(a+b > n+1 || a*b < n){
cout << -1 << endl;
return 0;
}
int r = n;
int past = 0;
int i=0;
while(r > 0){
int len;
len = min(a, r - b + past + 1);
for(int m=r-len+1; m<=r; m++)
res[i++] = m;
past += 1;
r = r - len;
}
cout << res[0];
for(int i=1; i<n; i++)
cout << " " << res[i];
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
vector<pair<ll, int>> factorize(ll n){
vector<pair<ll, int>> res;
for (ll i = 2; i*i <= n; ++i){
if (n%i) continue;
res.emplace_back(i, 0);
while (n%i == 0){
n /= i;
res.back().second++;
}
}
if(n != 1) res.emplace_back(n, 1);
return res;
}
int main(){
ll n;
cin >> n;
vector<pair<ll, int>> res = factorize(n);
int ans = 0;
rep(i, res.size()){
int num = res[i].second;
int j = 1;
while(j <= num){
ans++;
num -= j;
j++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 23,316,076
|
#include <iostream>
using namespace std;
int many(int, int);
int main()
{
int a, b, c;
cin >> a;
cin >> b;
while (a != 0 || b != 0) {
c = many(a, b);
cout << c << endl;
cin >> a;
cin >> b;
}
return 0;
}
int many(int x, int y)
{
int n, m, r, p, q = 0;
for (n = 1; n <= x; n++) {
for (m = 1; m <= x; m++) {
for (r = 1; r <= x; r++) {
if (n < m && m < r) {
p = n + m + r;
if (p == y) {
q = q + 1;
}
}
}
}
}
return q;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
long long int comb(long long int n, long long int r){
if(n < r || n < 0)
return 0;
long long int x = 1, y = 1;
if (n-r < r) r = n - r;
for (long long int i = 0; i < r; i++)
{
x = x * (n - i);
y = y * (i + 1);
}
return x / y;
}
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
return 0;
}
| 0
| 50,311,649
|
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
void Fast()
{
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
}
inline int D()
{
int t;
scanf("%d",&t);
return t;
}
inline ll llD()
{
ll t;
scanf("%lld",&t);
return t;
}
const int Max=1e5+8;
const int OO=-1e6;
int xt[4]= {1,0,0,-1};
int yt[4]= {0,1,-1,0};
ll n,m,f,l;
bool valid(int x,int y)
{
return x>-1 && y>-1 && x<n && y<m;
}
int mem[209][209][209],k;
string st,st2;
void init()
{
memset(mem,-1,sizeof mem);
}
int solve (int i=0,int t=0,int j=n )
{
}
int main()
{
int T=1;
while(T-->0)
{
n=D();
int x=D();
int t= D();
int ans= (n/x)*t;
if(n%x)ans+=t;
cout<<ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n,k;
int h[305];
long long dp[305][305];
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d",h+i);
}
memset(dp,0x3f,sizeof(dp));
dp[0][0]=0;
for(int i=0;i<=n;i++){
for(int j=0;j<=min(i,k);j++){
for(int k=i+1;k<=n+1;k++){
if(j+k-i-1<=::k){
dp[k][j+k-i-1]=min(dp[k][j+k-i-1],dp[i][j]+max(0,h[k]-h[i]));
}
}
}
}
long long ans=0x3f3f3f3f3f3f3f3fll;
for(int i=0;i<=k;i++){
ans=min(ans,dp[n+1][i]);
}
printf("%lld\n",ans);
return 0;
}
| 0
| 83,947,370
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;
bool flag=false;
cin>>a>>b>>c>>d;
ans=b/c + b/d;
a--;
ans-=(a/c +(a/d));
l=lcm(c,d);
ll aa=b/l;
aa-=a/l;
ans-=aa;
cout<<(b-a)-ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
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 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++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
ll N, K; cin >> N >> K;
if(N == 2){
if(K > 0){
cout << -1 << endl;
return;
}else{
cout << 1 << endl;
cout << 1 << " " << 2 << endl;
return;
}
}
if(K > (N-1)*(N-2)/2){
cout << -1 << endl;
return;
}
ll cnt = (N-1)*(N-2)/2 - K;
cout << N-1 + cnt << endl;
rep1(i, N-1){
cout << i << " " << N << endl;
}
ll tmp = 0;
rep1(i, N-1){
Rep1(j, i+1, N-1){
if(tmp == cnt) return;
cout << i << " " << j << endl;
tmp++;
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 61,161,635
|
#include <iostream>
using namespace std;
int main() {
int X, Y, x, y, r;
cin >> X >> Y >> x >> y >> r;
if (x + r <= X && x - r >= 0 && y + r <= Y && y - r >= 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x);
#define MAX (10000000)
using namespace std;
typedef unsigned int uint;
typedef long long ll;
const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};
int getInt(){
int ret = 0,c;
c = getchar();
while(!isdigit(c)) c = getchar();
while(isdigit(c)){
ret *= 10;
ret += c - '0';
c = getchar();
}
return ret;
}
int main(){
int n,m,p;
while(n=getInt(),m=getInt(),p=getInt(), n+m+p){
int sum = 0;
int hit;
m--;
REP(i,n){
int t = getInt();
sum += t * 100;
if(m == i)
hit = t;
}
if(hit == 0) puts("0");
else print((int)((((double)(100-p)/100.0) * sum)/hit));
}
return 0;
}
| 0
| 40,325,753
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n,m,k;
cin >> n>> m>> k;
int isK = false;
rep(i,n+1){
rep(j,m+1){
int l = (m-j)*i+(n-i)*j;
if(l == k) isK = true;
}
}
if(isK) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
|
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <set>
#include <queue>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
#define int long long
const int N=300010,Mod=1e9+7;
LL n,m,x,tot;
LL nums[N],n2[N];
int vis[N];
signed main(){
IOS;
cin>>n>>x>>m;
int l,r;
for(int i=1;;++i){
if(vis[x]) {
l=vis[x],r=i-1;
break;
}
nums[++tot]=x;
vis[x]=i;
x=x*x%m;
}
for(int i=1,j=l;j<=r;++j,++i){
n2[i]=nums[j];
}
for(int i=1;i<=tot;++i) nums[i]+=nums[i-1];
LL sum=nums[l-1];
int len=r-l+1;
n-=l-1;
for(int i=1;i<=len;++i) n2[i]+=n2[i-1];
sum=sum+n/len*n2[len]+n2[n%len];
cout<<sum<<endl;
return 0;
}
| 0
| 41,398,879
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
void _read();
const int nax = 1e5 + 11, mod = 1e9 + 7;
int n;
vector<int> adj[nax];
int dp[nax][2];
void dfs( int u = 1, int p = 1 ) {
bool is = true;
dp[u][0] = dp[u][1] = 1;
for( int v : adj[u]) {
if ( v == p ) continue;
dfs(v,u);
(dp[u][0] *= (dp[v][0]+dp[v][1])%mod) %= mod;
(dp[u][1] *= dp[v][0]) %= mod;
}
}
main () { _read();
cin >> n;
for( int i = 1; i < n; i++) {
int a,b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs();
cout << (dp[1][0] + dp[1][1]) % mod << '\n';
return 0;
};
void _read() {
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt","r",stdin);
#endif
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int sides[3];
bool rtt(int* arr){
for(int i = 0; i < 3; i++){
if(arr[i] * arr[i] == arr[(i + 1) % 3] * arr[(i + 1) % 3] + arr[(i + 2) % 3] * arr[(i + 2) % 3]){
return true;
}
}
return false;
}
int main(){
cin >> N;
for(int i = 0; i < N; i++){
cin >> sides[0] >> sides[1] >> sides[2];
if(rtt(sides)){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
return 0;
}
| 0
| 34,826,924
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<int>a(n);
for (auto &it : a)
cin >> it;
vector<int>ans(n);
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++)
ans[i] = min(ans[i - 1] + abs(a[i] - a[i - 1]), ans[i - 2] + abs(a[i] - a[i - 2]));
cout << ans[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
void solve() {
ll n;
cin >> n;
vector<string> v;
string x;
for (ll i = 0; i < n; ++i) {
cin >> x;
sort(x.begin(), x.end());
v.emplace_back(x);
}
sort(v.begin(), v.end());
vector<ll> aux;
ll len = 1;
for (ll i = 0; i < n - 1; ++i) {
if (v[i] == v[i + 1]) {
++len;
} else {
aux.emplace_back(len);
len = 1;
}
}
aux.emplace_back(len);
ll ans = 0;
for (ll x : aux) {
ans += (1ll * (x * x - x)) >> 1;
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 0
| 13,164,965
|
#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;
cin >> n;
double ans = 0;
rep(i, n)
{
double a;
cin >> a;
ans += 1 / a;
}
printf("%.6lf\n", 1 / ans);
return 0;
}
|
#include <iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
using namespace std;
int main(void){
string s,t;
cin>>s>>t;
int sl= s.length();
int tl= t.length();
int i=0,j=0,l=-1;
for( i=0;i<(sl-tl+1);i++){
bool ok=true;
for( j=0;j<tl;j++){
if(s[i+j]!='?' && s[i+j]!=t[j])
ok=false;
}
if(ok){
l=i;
}
}
if(l!=-1)
{
for(int k=0;k<tl;k++){
s[l+k]=t[k];
}
for(int i=0;i<sl;i++){
if(s[i]=='?')
s[i]='a';
}
cout<<s<<endl;
return 0;
}
cout<<"UNRESTORABLE";
}
| 0
| 20,060,187
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
string s;
cin >> s;
if(s[0]!='A'){
cout << "WA" <<endl;
return 0;
}
int cnt = 0;
for(int i = 2;i<s.size()-1;++i){
if(s[i]=='C')
cnt++;
}
if(cnt !=1) {
cout << "WA" <<endl;
return 0;
}
int mini = 0;
for(int i = 1;i<s.size();++i){
for(char x = 'a';x<='z' ;++x){
if(s[i]==x) mini++;
}
}
if(mini!=s.size()-2) {
cout << "WA" <<endl;
return 0;
}
cout << "AC" <<endl;
}
|
#include <bits/stdc++.h>
#define FOR(i, k, n) for(int i = (k); i < (n); i++)
#define FORe(i, k, n) for(int i = (k); i <= (n); i++)
#define FORr(i, k, n) for(int i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(int i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define ALLr(x) (x).rbegin(), (x).rend()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(void){
int n, m;
cin >> n >> m;
vector<int> a(m);
REP(i, m) cin >> a[i];
int num[] = {INF, 2, 5, 5, 4, 5, 6, 3, 7, 6};
sort(ALLr(a));
vector<int> dp(n+1, -INF);
dp[0] = 0;
FORe(i, 1, n){
REP(j, m){
if(i - num[a[j]] < 0) continue;
chmax(dp[i], dp[i-num[a[j]]]+1);
}
}
string ans;
int l = dp[n];
REP(i, l){
REP(j, m){
if(n - num[a[j]] < 0) continue;
if(dp[n-num[a[j]]] == dp[n]-1){
ans += (char)a[j] + '0';
n -= num[a[j]];
break;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 76,032,383
|
#include <math.h>
#include <assert.h>
#include <algorithm>
#include <set>
#include <iostream>
#include <vector>
#include <iomanip>
#include <queue>
#include <map>
#include <string>
#include <cstring>
#include <functional>
#include <stack>
#include <array>
#include <random>
#include <chrono>
#include <climits>
#include <bitset>
using namespace std ;
#define rep(i, a, b) for (int i=a; i<(b); i++)
#define forn(i, a) for (int i=0; i<(a); i++)
#define repd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define ford(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define int long long
#define ii pair<int,int>
#define ar array
#define FAST_IO ios_base::sync_with_stdio(false) ;cin.tie(NULL);cout.tie(NULL)
#define ms(x,a) memset(x,(int)(a),sizeof(x))
#define sz(x) ((int)(x).size())
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define pb push_back
#define endl '\n'
#define ff first
#define ss second
const int N = 1e6+7 ;
int d[N] ;
void solve(){
int n ;
cin >> n ;
rep(i,1,N){
for(int j = i ; j < N ; j+=i){
d[j]++ ;
}
}
int ans = 0 ;
rep(i,1,n) ans += d[i] ;
cout << ans << endl ;
}
int32_t main(){
FAST_IO ;
int t = 1 ;
while(t--){
solve() ;
}
}
|
#include <bits/stdc++.h>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
if (N == 1) {
std::cout << 0 << std::endl;
return 0;
}
std::vector<std::vector<int>> dp(N, std::vector<int>(K));
dp[N - 1][0] = 1;
if (A[N - 1] < K) {
dp[N - 1][A[N - 1]] = 1;
}
for (int j = N - 2; j >= 0; j--) {
for (int k = 0; k < K; k++) {
dp[j][k] = dp[j + 1][k];
if (k >= A[j]) {
dp[j][k] = std::max(dp[j][k], dp[j + 1][k - A[j]]);
}
}
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (i == 0) {
bool is_unnessesary = std::all_of(
dp[1].begin() + std::max(0, K - A[i]),
dp[1].begin() + K,
[](int a) {return a == 0;});
if (is_unnessesary) cnt += 1;
for (int k = 0; k < K; k++) {
dp[0][k] = 0;
}
dp[0][0] = 1;
if (A[i] < K) dp[0][A[i]] = 1;
} else if (i == N - 1) {
bool is_unnessesary = std::all_of(
dp[N - 2].begin() + std::max(0, K - A[i]),
dp[N - 2].begin() + K,
[](int a) {return a == 0;});
if (is_unnessesary) cnt += 1;
} else {
for (int k = 1; k < K; k++) dp[i + 1][k] += dp[i + 1][k - 1];
bool is_unnessesary = true;
for (int x = 0; x < K; x++) {
if (dp[i - 1][x] == 0) continue;
if (0 < K - A[i] - x) {
if (dp[i + 1][K - 1 - x] - dp[i + 1][K - A[i] - x - 1] > 0) {
is_unnessesary = false;
break;
}
} else if (K - A[i] - x <= 0 && 0 <= K - 1 - x) {
if (dp[i + 1][K - 1 - x] > 0) {
is_unnessesary = false;
break;
}
}
}
if (is_unnessesary) cnt += 1;
for (int k = 0; k < K; k++) {
dp[i][k] = dp[i - 1][k];
if (k >= A[i]) dp[i][k] = std::max(dp[i][k], dp[i - 1][k - A[i]]);
}
}
}
std::cout << cnt << std::endl;
return 0;
}
| 0
| 70,961,453
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans = 0;
if (a >= k) {
ans += k;
a -= k;
k = 0;
}
else {
ans += a;
k -= a;
a = 0;
}
k -= b;
b = 0;
if (k <= 0) {
cout << ans << endl;
}
else {
cout << ans - k << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, b, h = 100, w = 100;
string ans[100];
void solve();
int main() {
cin >> a >> b;
solve();
cout << h << " " << w << endl;
for(int i = 0; i < h; ++i) cout << ans[i] << endl;
return 0;
}
void solve() {
int cnt = 1;
for(int i = 0; i < 50; ++i)
for(int j = 0; j < 100; ++j) ans[i] += "#";
for(int i = 0; i < 50; ++i)
for(int j = 0; j < 100; ++j) ans[i + 50] += ".";
for(int i = 0; i < 50; i += 2) {
for(int j = 0; j < 100; j += 2) {
if(cnt == a) break;
ans[i][j] = '.';
++cnt;
}
if(cnt == a) break;
}
cnt = 1;
for(int i = 51; i < 100; i += 2) {
for(int j = 0; j < 100; j += 2) {
if(cnt == b) break;
ans[i][j] = '#';
++cnt;
}
if(cnt == b) break;
}
}
| 0
| 85,689,959
|
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define sz size()
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
typedef pair<double,double> pdd;
typedef pair<long long,long long> pll;
int main(){
fastIO;
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
ll n,az,ro;
cin>>n>>az>>ro;
if(az==0){
cout<<0<<endl;
}else if(az+ro==n){
cout<<az<<endl;
}else{
ll sobra = n%(az+ro);
ll ocup = (n/(az+ro))*az;
cout<<ocup + min(sobra,az)<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll N, A, B;
cin >> N >> A >> B;
if(!(N <= A * B && A + B - 1 <= N)){
cout << -1 << endl;
return 0;
}
vector<ll> v[B];
ll low = 1, up = N;
for(ll i = B - 1; 0 <= i; i--){
v[i].push_back(B - i);
low = B - i;
}
for(ll i = N; v[0].size() < A; i--){
v[0].push_back(i);
up = i;
}
sort(v[0].begin(), v[0].end());
ll index = B - 1;
for(ll i = low + 1; i < up; i++){
v[index].push_back(i);
index--;
if(!index) index = B - 1;
}
for(ll i = 0; i < B; i++) for(ll u : v[i]) cout << u << " ";
cout << endl;
return 0;
}
| 0
| 66,507,387
|
#include<bits/stdc++.h>
#warning Check Max_Limit,Overflows
using namespace std;
# define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
# define ff first
# define ss second
# define pb push_back
# define mod 1000000007
# define ll long long
# define db double
# define pii pair<ll,ll>
# define inf (ll)1e18
# define mx2 1000005
# define mx (1<<19)
# define endl "\n"
ll a[mx];
pii F[mx];
int main()
{
ll n;
cin>>n;
for(ll i=0;i<(1<<n);i++){ll x;cin>>x;F[i]={x,0};}
for(ll i = 0;i < n; ++i)
{
for(ll mask = 0; mask < (1<<n); ++mask)
{
if(mask & (1<<i))
{
vector <ll> vec={F[mask].ff,F[mask].ss,F[mask^(1<<i)].ff,F[mask^(1<<i)].ss};
sort(vec.begin(),vec.end(),greater<ll>());
F[mask]={vec[0],vec[1]};
}
}
}
ll temp=0;
for(ll i=1;i<(1<<n);i++)
{
temp=max(temp,(F[i].ff+F[i].ss));
cout<<temp<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const long long INF = 1000000007;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(void){
int N; cin >> N;
int t[N], v[N]; REP(i,N) cin >> t[i]; REP(i,N) cin >> v[i];
int T = 0; REP(i,N) T += t[i];
vector<double> maxv; maxv.push_back(0);
REP(i,N){
maxv.back() = min(maxv.back(), (double)v[i]);
REP(j,2*t[i]){
maxv.push_back(v[i]);
}
}
maxv.back() = 0;
FOR(i,1,2*T+1){
maxv[i] = min(maxv[i], maxv[i-1]+0.5);
}
for(int i=2*T-1; i>=0; i--){
maxv[i] = min(maxv[i], maxv[i+1]+0.5);
}
double ans = 0;
FOR(i,1,2*T+1){
ans += (maxv[i-1]+maxv[i])/4;
}
cout << fixed;
cout << setprecision(5) << ans << endl;
return 0;
}
| 0
| 69,372,982
|
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-5)
#define bit(n,k) ((n>>k)&1)
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
ll x, y;
bool operator<(const H &b) const {
if (x != b.x) return x < b.x;
return y < b.y;
}
bool operator>(const H &b) const {
if (x != b.x) return x > b.x;
return y > b.y;
}
bool operator==(const H &b) const { return x == b.x&&y == b.y; }
bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
ll pos, cost;
bool operator<(const P &b) const { return cost < b.cost; }
bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
ll to, cost;
};
struct E {
ll from, to, cost;
bool operator<(const E &b) const { return cost < b.cost; }
bool operator>(const E &b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T &a, U b) {
if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T &a, U b) {
if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
if (a < 0) return 0;
return a;
}
template<typename T>
T min_0(T a) {
if (a > 0) return 0;
return a;
}
ll read() {
ll u;
ll k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j) swap(i, j);
if (i == 0) return j;
return gcd(j%i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}
vector<string>split(string s, char c = ' ') {
vector<string>vec;
string h = "";
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] != ' ') {
h += s[j++];
}
if (h.size() > 0) vec.push_back(h);
h = "";
i = j + 1;
}
return vec;
}
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
signed main(){
int a[4] = { 0,0,0,0 };
for (int i = 0; i < 6; i++) {
a[read() - 1]++;
}
if (a[0] >= 3 || a[1] >= 3 || a[2] >= 3 || a[3] >= 3) {
cout << "NO\n";
}
else {
cout << "YES\n";
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <ios>
#include <iomanip>
#include <numeric>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
const long long LINF =1e18;
const int INF = 1e9;
int main() {
vector<int>x(11);
int d;
int r;
cin>>r>>d>>x[0];
for (int i = 1; i <= 10; ++i) {
x[i] = x[i-1] * r - d;
cout<<x[i]<<endl;
}
return 0;
}
| 0
| 19,728,144
|
#include<iostream>
using namespace std;
int main(void){
long long x,y;
cin>>x>>y;
int cnt(1);
while(x*2<=y){
x *= 2;
cnt++;
}
cout<<cnt<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const char INF = '9' + 1;
int main(){
int n;
string data[50];
string temp[50];
string tmp;
string junban[10];
char minv;
int m;
int p[10] = {0};
int i,j;
cin >> n;
for(i = 0;i < n;i++){
cin >> data[i];
temp[i] = data[i];
junban[temp[i][1] - '0'] += temp[i][0];
}
for(i = 0;i < n - 1;i++){
for(j = 0;j < n - i - 1;j++){
if(temp[j][1] > temp[j + 1][1])swap(temp[j],temp[j + 1]);
}
}
for(i = 0;i < n - 1;i++){
cout << temp[i] << " ";
}
cout << temp[i] << endl;
for(i = 0;i < n;i++){
if(junban[temp[i][1] - '0'][p[temp[i][1] - '0']] != temp[i][0]){
cout << "Not stable" << endl;
break;
}
p[temp[i][1] - '0']++;
}
if(i == n)cout << "Stable" << endl;
for(i = 0;i < 10;i++){
p[i] = 0;
}
for(i = 0;i < n - 1;i++){
minv = INF;
for(j = i;j < n;j++){
if(minv > data[j][1]){
minv = data[j][1];
m = j;
}
}
swap(data[i],data[m]);
cout << data[i] << " ";
}
cout << data[i] << endl;
for(i = 0;i < n;i++){
if(junban[data[i][1] - '0'][p[data[i][1] - '0']] != data[i][0]){
cout << "Not stable" << endl;
break;
}
p[temp[i][1] - '0']++;
}
if(i == n)cout << "Stable" << endl;
return 0;
}
| 0
| 43,695,010
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll inf = 1LL << 60;
template<class T> inline void chmin(T& a, T b) {
if (a > b) {
a = b;
}
}
template<class T> inline void chmax(T& a, T b) {
if (a < b) {
a = b;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vec a(N), b(N), ans(N, 0);
ll s = 0;
Rep (i, N) {
cin >> a[i];
s += a[i];
}
iota(b.begin(), b.end(), 0);
sort(b.begin(), b.end(), [&](ll x, ll y){return a[x] > a[y];});
ll tmp = b[0];
Rep (i, N-1) {
if (a[b[i]] == a[b[i+1]]) {
chmin(tmp, b[i+1]);
} else {
ans[tmp] += (a[b[i]] - a[b[i+1]]) * (i+1);
s -= (a[b[i]] - a[b[i+1]]) * (i+1);
chmin(tmp, b[i+1]);
}
}
ans[tmp] += s;
Rep (i, N) {
cout << ans[i] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n,k;cin >>n>>k;
ll g=0;
vector<ll>a(n);
for (int i = 0; i < n; ++i) {
cin >>a[i];
g=__gcd(g,a[i]);
}
bool flg=false;
for (int i = 0; i < n; ++i) {
ll d=a[i]-k;
if(d<0)continue;
if(d%g==0)flg=true;
}
if(flg)puts("POSSIBLE");
else puts("IMPOSSIBLE");
return 0;
}
| 0
| 41,913,202
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string ans;
if(n<1200) ans = "ABC";
else ans = "ARC";
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
const int MAXN = 4001;
int main(){
int N;string S;cin >> N >> S;
ll count = 0;
ll red=0,blue=0,green=0;
for(int i=0;i<N;i++){
if(S[i]=='R')red++;
if(S[i]=='B')blue++;
if(S[i]=='G')green++;
for(int k=0;k<N;k++){
int tmp_i = i+1;int tmp_k = k+1;
int tmp_j = (tmp_i+tmp_k)/2;
int j = tmp_j - 1;
if(tmp_j <= N && tmp_i< tmp_j && tmp_j<tmp_k && tmp_j - tmp_i == tmp_k - tmp_j && S[i]!=S[j] && S[j] != S[k] && S[i] != S[k]){
count++;
}
}
}
ll tmp = red*blue*green;
cout << tmp - count << endl;
return 0;
}
| 0
| 49,120,661
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<vector<int>> vec(11);
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
vec[i].emplace_back(s - 1);
}
}
int p[11];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
bool b[11];
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < n; j++) {
if (i & (1 << j)) {
b[j] = true;
}
else {
b[j] = false;
}
}
int co = 0;
for (int j = 0; j < m; j++) {
int co1 = 0;
for (int k = 0; k < vec[j].size(); k++) {
if (b[vec[j][k]]) {
co1++;
}
}
if (co1 % 2 == p[j] % 2) {
co++;
}
}
if (co == m) {
ans++;
}
}
cout << ans << endl;
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 n;
cin>>n;
vector<ll> v;
v.pb(0);
while(n--){
ll k;
cin>>k;
v.pb(k);
}
sort(v.begin(),v.end());
ll ans=0;
for(ll i=1;i<v.size();i++){
if(v[i]!=v[i-1]){
ans+=1;
}
}
cout<<ans-!(ans&1);
return 0;
}
| 0
| 29,697,422
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.