code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
vector<double> x(n);
vector<string> u(n);
double sum = 0;
rep(i, n) {
cin >> x[i];
cin >> u[i];
}
rep(i, n) {
if(u[i] == "BTC") {
sum += x[i]*380000.0;
}
sum += x[i];
}
cout << sum << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 9223372036854775807;
ll N, K;
vector<ll > X;
vector<ll > Y;
ll check(ll x1, ll x2, ll y1, ll y2){
ll cn = 0;
for(ll k = 0; k < N; k++){
ll xk = X[k];
ll yk = Y[k];
if(xk >= x1 && xk <= x2 && yk >= y1 && yk <= y2){
cn++;
}
}
return cn;
}
int main(){
cin >> N >> K;
for(ll i = 0; i < N; i++){
ll a, b; cin >> a >> b;
X.push_back(a);
Y.push_back(b);
}
ll ans = INF;
for(ll x1 = 0; x1 < N; x1++){
for(ll x2 = x1 + 1; x2 < N; x2++){
for(ll y1 = 0; y1 < N; y1++){
for(ll y2 = y1 + 1; y2 < N; y2++){
ll tx1 = X[x1];
ll tx2 = X[x2];
ll ty1 = Y[y1];
ll ty2 = Y[y2];
if(tx1 > tx2) swap(tx1, tx2);
if(ty1 > ty2) swap(ty1, ty2);
ll cn = check(tx1, tx2, ty1, ty2);
if(cn >= K) ans = min(ans, (tx2-tx1)*(ty2-ty1));
}
}
}
}
cout << ans << endl;
}
| 0 | 55,137,126 |
#include <iostream>
using namespace std;
int H,W,D;
char A[2000][2000];
int main(){
cin >> H >> W >> D;
for(int i=0;i<2000;i++){
for(int j=0;j<2000;j++){
if((i/D)%2==0 && (j/D)%2==0) A[i][j] = 'R';
if((i/D)%2==0 && (j/D)%2==1) A[i][j] = 'Y';
if((i/D)%2==1 && (j/D)%2==0) A[i][j] = 'G';
if((i/D)%2==1 && (j/D)%2==1) A[i][j] = 'B';
}
}
int count = 0;
while(count<H){
int i = 510-count,j = count,c = 0;
while(c<W){
cout << A[i][j] << (c!=W-1? "":"\n");
i++;j++;
c++;
}
count++;
}
}
|
#include<iostream>
#include<vector>
using namespace std;
vector<int> ans;
int main(){
while(1){
int n,a,b,c,x;
cin >> n >> a >> b >> c >> x;
if(n + a + b + c + x == 0) break;
int y[100];
int count = -1;
int reel = 0;
for(int i = 0;i < n;i++){
cin >> y[i];
}
for(int i = 0;i <= 10000;i++){
if(x == y[reel]) reel++;
if(reel == n){
count = i;
break;
}
x = (a*x + b) % c;
}
ans.push_back(count);
}
for(int i = 0;i < ans.size();i++) cout << ans[i] << endl;
return 0;
}
| 0 | 100,897,704 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,cnt;
int main()
{
scanf("%d",&n);long long ans=0;
for(int i=1,w;i<=n;i++)
{
scanf("%d",&w),ans+=w>>1;
if(!w)ans+=cnt>>1,cnt=0;
else cnt+=w&1;
}
ans+=cnt>>1;
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a,x=0,y=0,b,z=0,z2=0;
cin>>n;
ll l1[n+2];map<ll,ll>m1,m2;
for(int i=1;i<=n;i++){
cin>>l1[i];
if(i&1){
m1[l1[i]]++;
if(m1[l1[i]]>x)x=m1[l1[i]],a=l1[i];
}
else{
m2[l1[i]]++;
if(m2[l1[i]]>y)y=m2[l1[i]],b=l1[i];
}
}
if(a==b&&x>y){
for(int i=2;i<=n;i+=2){
if(l1[i]!=b)z=max(z,m2[l1[i]]);
}n/=2;
cout<<(n-x)+(n-z)<<endl;
}
else if(a==b&&x==y){
for(int i=2;i<=n;i+=2){
if(l1[i]!=b)z=max(z,m2[l1[i]]);
}
for(int i=1;i<=n;i+=2){
if(l1[i]!=a)z2=max(z2,m1[l1[i]]);
}n/=2;
if(z>=z2)cout<<(n-z)+(n-x)<<endl;
else cout<<(n-z2)+(n-x)<<endl;
}
else if(a==b&&x<y){
for(int i=1;i<=n;i+=2){
if(l1[i]!=a)z=max(z,m1[l1[i]]);
}n/=2;
cout<<(n-y)+(n-z)<<endl;
}
else {n/=2;cout<<(n-x)+(n-y)<<endl;}
}
| 0 | 81,666,799 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
long long cycle = a+b;
long long ret = (n/cycle)*a;
n%=cycle;
if(n<a) ret+=n;
else ret+=a;
cout<<ret;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 100010;
int main() {
string s; cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
return 0;
}
| 0 | 37,154,092 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.1415926535897932384626;
long long int mod = 1000000007;
vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "RULD";
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<x;
#define re(i,a,b) for(i=a;i<=b;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl
ll rui(ll abc,ll bed){
if(bed==0){return 1;}
else{
ll ced = rui(abc,bed/2);
ced *= ced;
ced %= mod;
if(bed%2==1){ced*=abc; ced%=mod;}
return ced;
}
}
ll i,j,k,ii,jj;
ll n,m,num;
ll a,b,c,d,e,f,g,h,w;
ll x[800005],y[800005],z[900005];
char s[500005];
ll len[500];
bool dame;
int main(){
cin>>n;
for(i=0;i<n;i++){
cin>>x[i]>>y[i];
}
len[31] = 1;
for(i=30;i>=0;i--){
len[i] = len[i+1] * 2;
}
a = abs(x[0]) + abs(y[0]);
for(i=0;i<n;i++){
if((x[i] + y[i] - a) % 2 == 1){
dame = true;
}
}
if(dame){
p(-1);
return 0;
}
if(a%2==0){
for(i=0;i<n;i++){
x[i] += 1;
}
p(33);
for(i=0;i<32;i++){
pe(len[i]);
}
p(1);
}else{
p(32);
for(i=0;i<32;i++){
pe(len[i]);
}
el;
}
for(i=0;i<n;i++){
ll posx = 0;
ll posy = 0;
for(j=0;j<32;j++){
ll knum = -1;
ll ksum = INF;
ll lenx,leny;
for(k=0;k<4;k++){
lenx = dx[k] * len[j];
leny = dy[k] * len[j];
if(ksum > abs(x[i] - (posx + lenx)) + abs(y[i] - (posy + leny))){
ksum = abs(x[i] - (posx + lenx)) + abs(y[i] - (posy + leny));
knum = k;
}
}
posx += dx[knum] * len[j];
posy += dy[knum] * len[j];
pu(dir[knum]);
}
if(a%2==0){
pu("L");
}
el;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
int main() {
ll X, Y; cin >> X >> Y;
string result = abs(X-Y)>1 ? "Alice" : "Brown";
cout << result << endl;
return 0;
}
| 0 | 46,351,560 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
long long x,y,z;cin>>x>>y>>z;
int k; cin>>k;
long long a[x];
long long b[y];
long long c[z];
vector<long long> ko;
for(int i = 0;i<x;i++) cin >>a[i];
for(int i = 0;i<y;i++) cin >>b[i];
for(int i = 0;i<z;i++) cin >>c[i];
sort(a,a+x,greater<long long>());
sort(b,b+y,greater<long long>());
sort(c,c+z,greater<long long>());
for(int i = 0;i<x;i++){
for(int j = 0;j<y;j++){
for(int h = 0;h<z;h++){
if((i+1)*(j+1)*(h+1)<=k){
ko.push_back(a[i]+b[j]+c[h]);
}
else break;
}
}
}
sort(ko.begin(),ko.end(),std::greater<long long>());
for(int i = 0;i<k;i++){
cout<<ko[i]<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define fr(i,j,n) for(int i=j;i<n;i++)
#define pb push_back
#define rf(i,j,p) for(int i=p;i>=j;i--)
#define vi vector<int>
#define vll vector<long long>
#define ll long long
#define hmm "\n"
#define sp " "
#define srt(v) sort(v.begin(), v.end());
#define down cout<<hmm;
#define faaast ios_base::sync_with_stdio(0);cin.tie(nullptr);
using namespace std;
int main()
{
string s ; cin >> s ;
string t="", tt="" ;
fr(i,0,s.size())
{
if(i%2==0)t+="0";
else t+="1";
}
fr(i,0,s.size())
{
if(i%2==0)tt+="1";
else tt+="0";
}
int a1=0, a2=0;
fr(i,0,s.size())
{
if(t[i]!=s[i])a1++;
if(tt[i]!=s[i])a2++;
}
cout<<min(a1,a2)<<hmm;
}
| 0 | 83,081,363 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n, L;
ll a[100000];
int main() {
cin >> n >> L;
for(int i = 0; i < n; i++){
cin >> a[i];
}
if(a[0] + a[1] >= L){
cout << "Possible" << endl;
for(int i = n - 1; i >= 1; i--)cout << i << endl;
return 0;
}
if(a[n - 1] + a[n - 2] >= L){
cout << "Possible" << endl;
for(int i = 1; i < n; i++)cout << i << endl;
return 0;
}
for(int i = 0; i < n - 1; i++){
if(a[i] >= L){
cout << "Possible" << endl;
for(int j = 1; j <= i; j++)cout << j << endl;
for(int j = n - 1; j > i; j--)cout << j << endl;
return 0;
}
if(a[i] + a[i + 1] >= L){
cout << "Possible" << endl;
for(int j = 1; j <= i; j++)cout << j << endl;
for(int j = n - 1; j > i + 1; j--)cout << j << endl;
cout << i + 1 << endl;
return 0;
}
}
cout << "Impossible" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(void)
{
string s, t;
cin >> s >> t;
int len = s.length();
map<char, set<int>> mps, mpt;
for (int i = 0; i < len; ++i)
{
mps[s[i]].insert(i);
mpt[t[i]].insert(i);
}
map<char, bool> cs, ct;
for (int i = 0; i < len; ++i)
cs[s[i]] = true, ct[t[i]] = true;
for (auto i : mps)
{
for (auto j : mpt)
{
if (cs[i.first] && ct[j.first] && i.second == j.second)
cs[i.first] = false, ct[j.first] = false;
}
}
for (auto i : cs)
{
if (i.second)
{
cout << "No" << endl;
return 0;
}
}
for (auto i : ct)
{
if (i.second)
{
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0 | 76,293,323 |
#include "bits/stdc++.h"
using namespace std;
int main() {
double L;
cin >> L;
printf("%.10f\n", (L / 3.0)*(L / 3.0)*(L / 3.0));
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int mpow(int base, int exp);
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<ll,ll>> vpll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef unordered_map<ll, ll> umpll;
typedef unordered_map<int, int> umpii;
typedef unordered_map<ll, int> umpli;
typedef unordered_set<int> usi;
typedef unordered_set<ll> usll;
typedef set<int> si;
typedef set<ll> sll;
typedef set<pair<int, int>> spii;
typedef set<pair<ll, ll>> spll;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fo(i,n) for(i = 0;i < n; i++)
#define Fo(i,k,n) for(i = k;k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define deb(x) cout << #x << " = " << x << endl
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define deb3(x, y, z) cout << #x << " = " << x << ", " << #y << " = " << y << ", "<< #z << " = " << z << endl
ll randGen(ll lower, ll upper) { return (rand() % (upper - lower + 1)) + lower; }
ll dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
void solve(){
int n;
cin >> n;
ll a[n];
for(int i = 0; i < n; i++)cin >> a[i];
ll mx = a[0], ans = 0;
for(int i = 1; i < n; i++) {
if(a[i] > mx) mx = a[i];
ans += mx - a[i];
}
cout << ans << endl;
}
int main()
{
#ifndef ONLINE_JUDGE
string inputFile, outputFile;
inputFile = "input.txt";
outputFile = "output.txt";
freopen(inputFile.c_str(), "r", stdin);
freopen(outputFile.c_str(), "w", stdout);
#endif
int t = 1;
while(t-- >0){
solve();
}
return 0;
}
int mpow(int base, int exp) {
base %= MOD;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % MOD;
base = ((ll)base * base) % MOD;
exp >>= 1;
}
return result;
}
| 0 | 95,260,776 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<int> g[200005];
int d[200005];
void dfs(int x, int p) {
for (int i : g[x]) if (i != p) {
d[i] += d[x];
dfs(i, x);
}
}
int main() {
ios::sync_with_stdio(false);
int n, q, u, v;
cin >> n >> q;
for (int i = 1; i < n; i++) cin >> u >> v, g[u].push_back(v), g[v].push_back(u);
while (q--) cin >> u >> v, d[u] += v;
dfs(1, 1);
for (int i = 1; i <= n; i++) cout << d[i] << ' ';
}
|
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = ll(1e9)+7;
const ll inf = ll(5e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
#include <iostream>
#include <vector>
#include <map>
using namespace std;
namespace dbg {
using ll = long long;
class Debug {
public:
Debug(){}
template<typename T>
void vd(vector<T> vec);
template<typename T>
void vd2(vector<vector<T>> vec);
template<typename T>
void ad(T *arr, ll n);
template<typename T, size_t N>
void ad2(T (&arr)[N], ll n);
template<typename T>
void md(T mp);
};
template<typename T>
void Debug::vd(vector<T> vec) {
for (auto vv : vec) cout << vv << " ";
cout << endl;
}
template<typename T>
void Debug::vd2(vector<vector<T>> vec) {
for (auto vv : vec) for (auto vvv : vv) cout << vvv << " ";
cout << endl;
}
template<typename T>
void Debug::ad(T *arr, ll n) {
for (int i = 0; i <= n; i++) cout << arr[i] << " ";
cout << endl;
}
template<typename T, size_t N>
void Debug::ad2(T (&arr)[N], ll n) {
for (int i = 0; i <= N; i++) for (int j = 0; j <= n; j++) cout << arr[i][j] << " ";
cout << endl;
}
template<typename T>
void Debug::md(T mp) {
cout << "key : value" << endl;
for (auto const &m : mp) cout << m.first << " : " << m.second << endl;
cout << endl;
}
}
#endif
using dbg::Debug;
Debug debug;
class EFriendships {
public:
void solve(std::istream& in, std::ostream& out) {
int n, k;
in >> n >> k;
vector<vector<int>> g(n, vector<int>());
for(int i=1; i<n; i++){
g[0].push_back(i);
}
int cur = (n-1) * (n-2) / 2 - k;
if(cur < 0){
out << -1 << endl;
return;
}
bool flg = false;
for(int i=1; i<n; i++){
for(int j=i+1; j<n; j++){
if(cur > 0){
g[i].push_back(j);
--cur;
}else{
flg = true;
break;
}
}
if(flg){
break;
}
}
int m = 0;
for(int i=0; i<n; i++) {
for (auto v : g[i]) {
++m;
}
}
out << m << endl;
for(int i=0; i<n; i++) {
for (auto v : g[i]) {
out << i + 1 sp v + 1 << endl;
}
}
}
};
int main() {
EFriendships solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0 | 79,996,383 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, Q;
cin >> N >> Q;
vector<tuple<bool, ll, vector<ll>>> A(N);
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--; b--;
get<2>(A[a]).push_back(b);
get<2>(A[b]).push_back(a);
}
rep(i, Q) {
ll p, x;
cin >> p >> x;
get<1>(A[p - 1]) += x;
}
stack<ll> st;
st.push(0);
while(!st.empty()) {
ll current = st.top();
st.pop();
get<0>(A[current]) = true;
iter(j, get<2>(A[current])) {
if(!get<0>(A[j])) {
get<1>(A[j]) += get<1>(A[current]);
st.push(j);
}
}
}
iter(i, A) cout << get<1>(i) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
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;
long mod=1000000007;
long ans=0;
vector<long>d(k+1);
for(int i=k;i>0;i--){
d[i]=(d[i]+modpow(k/i,n,mod))%mod;
for(int j=2;j*i<=k;j++){
d[i]=(d[i]+mod-d[j*i])%mod;
}
}
rep(i,k+1){
ans=(ans+d[i]*i)%mod;
}
cout<<ans<<endl;
}
| 0 | 74,611,075 |
#include <bits/stdc++.h>
#define pan(i,n) for(int i=0;i<n;i++)
#define pans(i,n,a) for(int i=a;i<n;i++)
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define INF 1000000007
#define PI 3.141592653
#define inf 100007
#define P pair<ll,ll>
using namespace std;
int main(){
string s,d="";
cin>>s;
int n=s.size(),ans=0,i=0;
while(i<n){
if(s[i]==s[n-1]){
i++,n--;
}
else{
if(s[i]=='x') ans++,i++;
else if(s[n-1]=='x') ans++,n--;
else{
ans=-1;
break;
}
}
}
cout<<ans;
}
|
#include <iostream>
#include <vector>
using namespace std;
bool solve() {
int N;
if(!(cin >> N)) return false;
if(!N) return false;
vector<vector<int>> dist(10, vector<int>(10, -1));
for(int i = 0; i < N; ++i) {
int a, b, c;
cin >> a >> b >> c;
dist[a][b] = dist[b][a] = c;
dist[a][a] = 0;
dist[b][b] = 0;
}
for(int k = 0; k < 10; ++k) {
for(int i = 0; i < 10; ++i) {
for(int j = 0; j < 10; ++j) {
if(dist[i][k] == -1 || dist[k][j] == -1) continue;
const int nd = dist[i][k] + dist[k][j];
if(dist[i][j] == -1 || dist[i][j] > nd) {
dist[i][j] = nd;
}
}
}
}
int town = -1;
int sum = -1;
for(int i = 0; i < 10; ++i) {
int tmp = 0;
bool valid = false;
for(int j = 0; j < 10; ++j) {
if(dist[i][j] != -1) {
tmp += dist[i][j];
valid = true;
}
}
if(valid && (sum == -1 || tmp < sum)) {
town = i;
sum = tmp;
}
}
cout << town << ' ' << sum << endl;
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
while(solve()) ;
return 0;
}
| 0 | 70,324,709 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
int N, c=1;
string S;
cin >> N >> S;
for (int i=0; i<N-1; i++) {
if (S[i]!=S[i+1]) {c++;}
}
cout << c << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>A;
for(int i=0;i<N;i++){
int x;
cin>>x;
A.push_back(x);
}
int dp[N+2];
dp[1]=0;
if(N==1){
cout<<0<<endl;
return 0;
}
dp[2]=abs(A[1]-A[0]);
if(N==2){
cout<<dp[2]<<endl;
return 0;
}
dp[3]=min(abs(A[2]-A[0]),dp[2]+abs(A[2]-A[1]));
if(N==3){
cout<<dp[3]<<endl;
return 0;
}
for(int i=4;i<=N;i++){
dp[i]=min(dp[i-1]+abs(A[i-1]-A[i-2]),dp[i-2]+abs(A[i-1]-A[i-3]));
}
cout<<dp[N]<<endl;
return 0;
}
| 0 | 95,766,869 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll A[100010];
int main()
{
int N;
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
sort(A, A + N);
int ans = N;
int cnt = 1;
ll sum = A[0];
for (int i = 1; i < N; i++) {
if (sum * 2 >= A[i]) {
cnt++;
}
else {
ans -= cnt;
cnt = 1;
}
sum += A[i];
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
long long fact(int x)
{
long long g=1;
for(int i=2;i<=x;i++)
{
g*=i;
g%=1000000007;
}
return g;
}
int main()
{
string s;
long long k,n,l=0,ans=1;
cin>>n;
cin>>s;
n*=2;
for(int i=0;i<n;i++)
{
k=l%2;
if((s[i]=='B' && k==1) || (s[i]=='W' && k==0))
{
ans*=l;
ans%=1000000007;
l--;
}
else
l++;
if(l<0 || l>n/2)
break;
}
if(l!=0)
cout<<0<<endl;
else
cout<<(ans*fact(n/2))%1000000007<<endl;
}
| 0 | 13,474,031 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll mod = 1e9+7;
const int N=1e5+9;
int main()
{
FASTINOUT;
string s;
cin>>s;
sort(s.begin(),s.end());
if (s[0]=='a'&&s[1]=='b'&&s[2]=='c')
cout<<"Yes";
else
cout<<"No";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
string s;
cin>>s;
int n=s.length(),flag=0,i;
if(n%2==0)
n=n-2;
else
n=n-1;
while(1) {
for (i = 0; i < n/2; i++) {
if(s[i]!=s[n/2+i]) {
flag = 1;
break;
}
}
if(flag==0) {
cout<<n<<endl;
break;
}
else {
flag=0;
n = n - 2;
}
}
return 0;
}
| 0 | 15,183,817 |
#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 array<int, 2> duo;
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 n; cin >> n;
vector<pair<int,int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i + 1;
}
sort(all(a));
for (int i = 0; i < n; i++) cout << a[i].second << ' ';
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int K;
void f(int &mine, int &others, int i)
{
if (i == K)
return;
if (mine % 2 == 1)
{
mine = mine - 1;
}
int gift = mine / 2;
mine -= gift;
others += gift;
f(others, mine, i + 1);
}
int main()
{
int A, B;
cin >> A >> B >> K;
f(A, B, 0);
cout << A << " " << B << endl;
return 0;
}
| 0 | 9,423,242 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int m, n_min, n_max;
while(1) {
cin >> m >> n_min >> n_max;
if(m + n_min + n_max == 0) break;
vector<int> P(m);
for(int i = 0; i < m; i++) {
cin >> P[i];
}
int ans = 0;
int gap = 0;
for(int i = n_max; i >= n_min; i--) {
if(gap < P[i-1] - P[i]) {
ans = i;
gap = P[i-1] - P[i];
}
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
typedef long long ll;
typedef unsigned long long int llt;
typedef long double ld;
const long double PI =3.141592653589793238463;
const int N = 5e5 + 10;
vector<int> g[N];
bool viss[N];
int vis[N];
void dfs(int curr, int par)
{
for(auto x: g[curr])
if(x != par)
dfs(x, curr);
}
void dfs1(int curr, int par)
{
viss[curr] = 1;
for(auto x: g[curr])
if(!viss[x])
dfs1(x, curr);
}
void dfs2(int curr, int par, int num)
{
vis[curr] = num;
for(auto x: g[curr])
if(vis[x] == 0)
dfs2(x, curr, num);
}
ll fxor(ll n)
{
if(n < 0) return 0;
if(n % 4 == 3) return 0;
else if(n % 4 == 0) return n;
else if(n % 4 == 1) return n^(n-1);
else if(n%4 == 2) return n^(n-1)^(n-2);
}
llt ppow(llt x, llt y)
{
llt res = 1;
while(y > 0){
if(y&1)
res = (res * x)%M;
y = y >> 1;
x = (x * x)%M;
}
return res;
}
llt factdp[N];
llt fact(llt x)
{
if(x == 0) return 1;
if(x == 1) return 1;
if(factdp[x] != -1) return factdp[x];
return factdp[x] = (x*fact(x-1))%M;
}
string ansConv ="";
void convert10tob(llt N, int b)
{
if (N == 0)
return;
int x = N % b;
N /= b;
if (x < 0)
N += 1;
convert10tob(N, b);
ansConv += to_string(x);
return;
}
llt convertstrtob(string a, int b)
{
llt aa = 0;
llt mul = 1;
for(int i=a.length()-1; i>=0; i--)
{
int curr = a[i] - '0';
aa += (curr * mul);
mul *= b;
}
return aa;
}
int findpar(int curr, int arr[])
{
while(arr[curr] != curr) curr = arr[curr];
return curr;
}
void Union(int b, int spa, int arr[])
{
while(arr[b] != b)
{
int c = arr[b];
arr[b] = spa;
b = c;
}
arr[b] = spa;
}
int main()
{
int n, k;
cin>>n>>k;
int arr[n];
rep(i, 0, n)
cin>>arr[i];
sort(arr, arr+n);
int sm = 0;
int res = n;
repb(i, n-1, 0)
if(sm + arr[i] < k) sm += arr[i];
else res = min(res, i);
cout<<res<<endl;
return 0;
}
| 0 | 57,730,572 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long int li;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<ll, ll>P;
typedef tuple<ll, int, int, int, int, int, int, int>T;
#define PI 3.14159265358979
const int MAX = 510000;
const int MOD = 1000000007;
const int INF=100000000;
int main(){
int K,S;
cin>>K>>S;
ll ans=0ll;
rep(i,K+1){
rep(j,K+1){
int z=S-i-j;
if(0<=z&&z<=K){ans++;}
}
}
cout<<ans;
}
|
#include <iostream>
#include <vector>
int main(void){
int K, N, ans=0;
std::cin >> K >> N;
std::vector<int> A(N);
for (int i = 0; i<N; ++i){
std::cin >> A.at(i);
}
ans = A.at(0) + K - A.at(N-1);
for (int i=1; i<N; ++i){
int tmp = A.at(i) - A.at(i-1);
if (tmp > ans) ans = tmp;
}
ans = K - ans;
std::cout << ans << std::endl;
return 0;
}
| 0 | 48,458,080 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = max(x, y);
const ll INFL = 1LL << 60;
const ll INF = INFL;
ll MOD = 998244353;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll get_bit(ll x){return __builtin_popcountll(x);}
ll pow_long(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2) res *= x;
x *= x;
k /= 2;
}
return res;
}
ll pow_mod(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2){
res *= x; res %= MOD;
}
x *= x; x %= MOD;
k /= 2;
}
return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y){return x / gcd(x, y) * y;};
ll kai_mod(ll x){
if(x == 0) return 1;
return x * kai_mod(x-1) % MOD;
}
vector<ll> divisor(ll n){
vector<ll> res(0);
for(ll i = 1; i * i <= n; i++){
if(n % i == 0){
res.push_back(i);
if(i != n/i) res.push_back(n/i);
}
}
sort(res.begin(), res.end());
return res;
}
vector<ll> MakePrimeList(ll x) {
vector<ll> res;
for(ll k=2; k*k<=x; k++) {
if(x % k == 0) {
res.pb(k);
while(x % k == 0) x /= k;
}
}
if(x > 1) res.push_back(x);
return res;
}
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAXcomb; 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 comb(int n, int k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
int main(){
ll N;
ll A, B;
cin >> N >> A >> B;
ll l = 0, m = 0, r = 0;
rep(i, N){
ll p;
cin >> p;
if(p <= A) l++;
else if(p <= B) m++;
else r++;
}
cout << min(min(l, m), r) << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define MOD 1000000007
#define INF INT32_MAX / 2
#define PIE 3.14159265358979323
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
T GCD(T a, T b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
template <class T>
inline T LCM(T a, T b) {
return (a * b) / GCD(a, b);
}
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<vector<pair<int, int>>> prefecture(n + 1, vector<pair<int, int>>(0));
vector<pair<int, int>> res(m + 1);
int p, y;
rep(i, m) {
cin >> p >> y;
prefecture[p].push_back(make_pair(y, i + 1));
}
repk(i, 1, n + 1) sort(prefecture[i].begin(), prefecture[i].end());
repk(i, 1, n + 1) {
for (int j = 0; j < prefecture[i].size(); j++) {
res[prefecture[i][j].second] = make_pair(i, j + 1);
}
}
repk(i, 1, m + 1) {
cout << setfill('0') << right << setw(6) << res[i].first;
cout << setfill('0') << right << setw(6) << res[i].second << endl;
}
}
| 0 | 30,670,195 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())
const ll INF = 1e18;
void warshall_floyd(vector<vector<ll>>& d) {
ll n = SZ(d);
REP(i, n) REP(j, n) REP(k, n) if (d[j][k] > d[j][i] + d[i][k]) {
d[j][k] = d[j][i] + d[i][k];
}
}
int main() {
ll n, m, r;
cin >> n >> m >> r;
vector<ll> a(r);
REP(i, r) {
cin >> a[i];
a[i]--;
}
vector<vector<ll>> to(n, vector<ll>(n, INF));
REP(i, n) { to[i][i] = 0; }
REP(i, m) {
ll u, v, c;
cin >> u >> v >> c;
u--, v--;
to[u][v] = c;
to[v][u] = c;
}
warshall_floyd(to);
ll ans = INF;
sort(ALL(a));
do {
ll t = 0;
REP(i, r - 1) { t += to[a[i]][a[i + 1]]; }
ans = min(ans, t);
} while (next_permutation(ALL(a)));
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int a;
cin >> a;
while(a != 0){
int coin = 0;
a = 1000-a;
if(a>=500){
coin++;
a-=500;
}
while(a>=100){
coin++;
a -= 100;
}
if(a>=50){
coin++;
a-=50;
}
while(a>=10){
coin++;
a-=10;
}
if(a>=5){
coin++;
a-=5;
}
cout << coin+a << endl;
cin >> a;
}
return (0);
}
| 0 | 92,435,225 |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define tc ll t; cin >> t; while (t--)
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define sz(c) (ll) c.size()
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define trav(x,c) for(auto &x : c)
#define _for(i,a,n) for(ll i = a ; i < n ; ++i)
#define _rfor(i,a,n) for(ll i = n-1 ; i >= a ; --i)
#define dx(x) cout << #x << ": " << x << endl;
#define dc(c) trav(x,c) cout << x << " "; cout << endl;
#define dm(m) trav(x,m) cout << x.f << "->" << x.s << endl;
#define godspeed cin.tie(0) -> sync_with_stdio(0);
int main() {
godspeed;
ll n, m; cin >> n >> m;
vl v(n); _for(i,0,n) cin >> v[i];
sort(rall(v));
ll sum = accumulate(all(v),0);
(v[m-1] >= sum/(4.0*m)) ? yes : no;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i,n,init) for(ll i=init;i<(n);i++)
#define ll long long
bool pairCompare(const pair<int, int> & f, const pair<int, int> & s)
{
return f.first < s.first;
}
int main()
{
int ans;
string s;
cin >> s;
int cnt0 = 0;
int cnt1 = 0;
rep(i, s.size()) {
if (s[i] == '0')
++cnt0;
else
++cnt1;
}
ans = min(cnt0, cnt1) * 2;
cout << ans << endl;
return(0);
}
| 0 | 93,662,740 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popcount __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
#define printpii(a) cout << a.ft << " " << a.sd << endl;
#define printpiii(a) cout << a.ft << " " << a.sd.ft << " " << a.sd.sd << endl;
#define print(a, n) rep(i, n) cout << a[i] << " "; cout << endl;
#define printv(v) for(auto x: v)cout << x << " "; cout << endl;
#define printm(a, n, m) rep(i, n) { rep(j, m) cout << a[i][j] << "\t"; cout << endl;}
ll lx[4] = {0, 0, 1, -1};
ll ly[4] = {1, -1, 0, 0};
ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
void fast(){ios_base::sync_with_stdio(false);cin.tie(0);cout << setprecision(12) << fixed;}
void solve(){
string a, b;
cin >> a >> b;
sort(all(a));
sort(allr(b));
cout << (a < b ? "Yes" : "No");
}
int main(){
fast();
ll t = 1;
while(t--){
solve();
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
class Dice{
private:
int dice_bk[6];
public:
Dice();
int corocoro();
};
Dice::Dice()
{
for(int i = 0; i < 6; i++)
cin >> dice_bk[i];
}
int Dice::corocoro()
{
int dice[6];
int top, front;
int mem, tmp;
for(int i = 0; i < 6; i++)
dice[i] = dice_bk[i];
cin >> top >> front;
for(int i = 0; i < 6; i++){
if(front == dice[i]){
mem = i;
break;
}
}
string code;
switch(mem){
case 4:
code = "S";
break;
case 1:
code = "N";
break;
case 3:
code = "E";
break;
case 2:
code = "W";
break;
case 5:
code = "WW";
break;
default:
code = "";
break;
}
for(int i = 0; i < code.length(); i++){
switch(code[i]){
case 'N':
tmp = dice[5];
dice[5] = dice[4];
dice[4] = dice[0];
dice[0] = dice[1];
dice[1] = tmp;
break;
case 'S':
tmp = dice[5];
dice[5] = dice[1];
dice[1] = dice[0];
dice[0] = dice[4];
dice[4] = tmp;
break;
case 'W':
tmp = dice[5];
dice[5] = dice[3];
dice[3] = dice[0];
dice[0] = dice[2];
dice[2] = tmp;
break;
case 'E':
tmp = dice[5];
dice[5] = dice[2];
dice[2] = dice[0];
dice[0] = dice[3];
dice[3] = tmp;
break;
}
}
while(dice[4] != top){
tmp = dice[4];
dice[4] = dice[2];
dice[2] = dice[1];
dice[1] = dice[3];
dice[3] = tmp;
}
return dice[2];
}
int main()
{
Dice *x = new Dice();
int n;
cin >> n;
for(int i = 0; i < n; i++)
cout << x->corocoro() << endl;
return 0;
}
| 0 | 45,438,246 |
#include<iostream>
#include<numeric>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<climits>
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define mkp make_pair
#define pll pair<ll,ll>
#define rep(i,from,to) for(int i=from;i<to;i++)
#define repd(i,from,till) for(int i=from;i>=till;i--)
#define waste ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define inf 1e9+1
#define mod 1e9+7
#define inf1 1e18+1
#define pie 3.14159265358979323846
#define N 100005
using namespace std;
int solve(){
ll r,d,x;
cin>>r>>d>>x;
rep(i,0,10){
ll val=r*x-d;
x=val;
cout<<val<<endl;
}
return 0;
}
int main(){
waste;
int t;
t=1;
while(t--){
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int MAX_N = 100000;
int N;
vector<int> G[MAX_N];
int match[MAX_N];
bool used[MAX_N];
bool dfs(int v) {
if (used[v]) {
return false;
}
used[v] = true;
for (int u : G[v]) {
if (match[u] < 0 || dfs(match[u])) {
match[v] = u;
match[u] = v;
return true;
}
}
return false;
}
int bipartite_matching() {
int res = 0;
memset(match, -1, sizeof(match));
for (int v = 0; v < N; v++) {
if (match[v] >= 0) {
continue;
}
memset(used, 0, sizeof(used));
if (dfs(v)) {
res++;
}
}
return res;
}
int main() {
int a, b;
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> a >> b;
a--; b--;
G[a].push_back(b);
G[b].push_back(a);
}
cout << (bipartite_matching() * 2 == N ? "Second" : "First") << endl;
return 0;
}
| 0 | 26,507,189 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,k;
cin>>n>>k;
vector<long long> tower(n);
vector<long long> tallest(n,-1);
for(long long i=0;i<n;i++){
cin>>tower.at(i);
tallest.at(i)=max(tallest.at(max((long long)0,i-1)),tower.at(i));
}
long long ans=inf*1000;
for(long long tmp=0;tmp<(1<<n);tmp++){
bitset<15> bits=tmp;
long long cnt=0;
for(long long i=0;i<n;i++){
if(bits.test(i)) cnt++;
}
if(cnt!=k) continue;
long long pre=0;
vector<long long> high=tallest;
for(long long i=0;i<n;i++){
if(!bits.test(i)) continue;
if(i==0 || high.at(i-1)<tower.at(i)){
pre+=0;
}else{
pre+=high.at(i)-tower.at(i)+1;
long long now=high.at(i)+1;
for(long long j=i;j<n;j++){
high.at(j)=max(high.at(j),now);
}
}
}
ans=min(ans,pre);
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int m = 0;
int f = 0;
int r = 0;
while(cin >> m >> f >> r){
if(m == -1 && f == -1 && r == -1)
break;
int total = m + f;
if(m == -1 || f == -1){
cout << "F\n";
}else if(total >= 80){
cout << "A\n";
}else if(total >= 65 && total < 80){
cout << "B\n";
}else if(total >= 50 && total < 65){
cout << "C\n";
}else if(total >= 30 && total < 50 && r >= 50){
cout << "C\n";
}else if(total >= 30 && total < 50){
cout << "D\n";
}else if(total < 30){
cout << "F\n";
}
}
return 0;
}
| 0 | 100,072,087 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>
#include<queue>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll INF = (1LL << 63);
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define rep(i,n) for(int i = 0; i < n;i++)
const int MAX = 1000000010;
const ll MOD = 1000000007;
int n, m,k,sum = 0; string s;
int main() {
cin >> n >> k; vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.rbegin(),a.rend());
rep(i, k) {
sum += a[i];
}cout << sum << endl;
}
|
#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<list>
#include<numeric>
#include<complex>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> vint;
typedef vector<char> vchar;
#define PI 3.141592653589793238462643383279
#define intinf 2000000014
#define longinf 2000000000000000014LL
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define rep2d(i, j, n) for(i = 0;i < n;++i)for(j = i + 1;j < n;++j)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define sc(x) cin >> x
#define sc2(x, y) cin >> x >> y
#define sc3(x, y, z) cin >> x >> y >> z
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << x << "\n"
#define pri2(x, y) cout << x << " " << y << "\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\n"
#define debugn(i, n, a) rep(i, n)cout << " --- " << a[i] << "\n";
#define debugin(i, n, a) rep(i, n)printf(" --- %10d\n", a[i])
#define debugi2n(i, n, a, b) rep(i, n)printf(" --- %10d %10d\n", a[i], b[i])
#define debugiin(i, n, a) rep(i, n)printf(" --- %10d %10d\n", a[i].first, a[i].second)
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)
ll d[100][100];
bool warshallfloyd(int v){
int i, j, k;
rep(k, v)rep(i, v)rep(j, v)if(d[i][k] != longinf && d[k][j] != longinf && d[i][j] > d[i][k] + d[k][j])d[i][j] = d[i][k] + d[k][j];
rep(i, v)if(d[i][i] < 0)return false;
return true;
}
signed main(void){
int i, j, tmp, tmp2;
for(int testcase = 0;;testcase++){
int2(v, e);
rep(i, v)rep(j, v)(i == j) ? d[i][j] = 0LL : d[i][j] = longinf;
rep(i, e){
int3(s, t, dd);
d[s][t] = dd;
}
if(warshallfloyd(v)){
rep(i, v){
if(d[i][0] >= longinf)cout << "INF";
else cout << d[i][0];
rep1(j, v){
if(d[i][j] >= longinf)cout << " INF";
else cout << " " << d[i][j];
}
kara;
}
}else pri("NEGATIVE CYCLE");
/*/
}
return 0;
}
| 0 | 100,255,478 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define eb emplace_back
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 233;
char s[maxn];
int op[maxn];
int main()
{
int n;cin>>n;
scanf("%s",s+1);
if(s[1]=='W'){
puts("0");
return 0;
}
op[1] = 0;
int cur = 1;
ll ans = 1;
for(int i=2;i<=2*n;i++){
if(s[i]==s[i-1])op[i] = op[i-1]^1;
else op[i] = op[i-1];
if(op[i]==1){
ans = ans*cur%mod;
cur--;
}
else{
cur++;
}
if(cur<0){
puts("0");
return 0;
}
}
if(cur){
puts("0");
return 0;
}
for(int i=1;i<=n;i++)ans = ans*i%mod;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
void init(){
cin.tie(0);
ios::sync_with_stdio(false);
}
int h,w;
main(){
cin>>w>>h;
vector<int> a,b;
rep(i,w){
int c;
cin>>c;
a.PB(c);
}
rep(i,h){
int c;
cin>>c;
b.PB(c);
}
sort(all(a));
sort(all(b));
int as=w+1,bs=h+1;
int ans=0;
int i=0,j=0;
rep(_,w+h){
if(i<a.size()&&j==b.size()||i<a.size()&&a[i]<b[j]){
ans+=a[i]*bs;
as--;
i++;
}else if(i==a.size()||a[i]>b[j]){
ans+=b[j]*as;
bs--;
j++;
}else{
if(as>bs){
ans+=a[i]*bs;
as--;
i++;
}else{
ans+=b[j]*as;
bs--;
j++;
}
}
}
cout<<ans<<endl;
}
| 0 | 35,062,375 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define p_b push_back
#define e_b emplace_back
#define m_p make_pair
#define m_t make_tuple
using namespace std;
int main() {
string n;
cin >> n;
int c = 0;
for (int i = 0; i < n.size(); i++) {
c += n.at(i) - '0';
}
if (c % 9 == 0) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
|
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int main(void)
{
int N;
cin >> N;
vector<int> a;
int tmp;
for (int i = 0; i < N; i++)
{
cin >> tmp;
a.push_back(tmp);
}
int cnt = 0;
int now = a[0];
for (int i = 0; i < N; i++)
{
now = min(now, a[i]);
if (now == a[i])
{
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| 0 | 5,579,097 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n, h;
cin >> n;
int max_h = 0, ans = 0;
for(int i = 0; i < n; ++i)
{
cin >> h;
if (max_h <= h)
{
max_h = h;
ans ++;
}
}
cout << ans;
}
int main()
{
fastio;
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll n, p, Ce = 0, Co = 0;
cin >> n >> p;
vi a(n);
map<ll, ll> cnt;
rep(i, n){
cin >> a[i];
cnt[a[i]%2]++;
}
Ce = pow(2LL, cnt[0]);
Co = pow(2LL, n-1);
if(cnt[0] == n) cout << (!p ? Ce : 0) << endl;
else cout << Co << endl;
}
| 0 | 62,762,035 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v.end()
#define forn(i, n) for(ll i=0;i<(ll)n;i++)
#define fi first
#define se second
int main() {
int n, k;
cin >> n >> k;
vector<int> cnt(n);
for(int i = 0; i < k; i++) {
int d;
cin >> d;
forn(j, d) {
int x;
cin >> x;
cnt[x-1]++;
}
}
int r = count(all(cnt), 0);
cout << r << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long a[55],b[55],c[55],d[55];
int main(void){
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
for(int i=0;i<m;i++){
cin>>c[i]>>d[i];
}
for(int i=0;i<n;i++){
long long minute=1000000000;
int ans=-1;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j])+abs(b[i]-d[j]) < minute){
minute=abs(a[i]-c[j])+abs(b[i]-d[j]);
ans=j;
}
}
cout<<ans +1<<endl;
}
return 0;
}
| 0 | 99,168,906 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
int memo[90005];
int main()
{
int h, w, d;
cin >> h >> w >> d;
map<int, pair<int, int>> mp;
rep(i,h){
rep(j,w){
int a;
cin >> a;
a--;
mp[a] = make_pair(i, j);
}
}
int q;
cin >> q;
vector<int> L(q), R(q);
rep(i,q){
cin >> L[i] >> R[i];
L[i]--;
R[i]--;
}
ll ans = 0;
rep(i,h*w-d){
memo[i + d] = memo[i] + abs(mp[i].first - mp[i + d].first) + abs(mp[i].second - mp[i + d].second);
}
rep(i,q){
cout << memo[R[i]] - memo[L[i]] << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define MOD 1e9+7
int main(){
int n,m;
cin >> n >> m;
vector<string> a(n),b(m);
rep(i,n) cin >> a[i];
rep(i,m) cin >> b[i];
for(int i=0;i<=n-m;i++){
for(int j=0;j<=n-m;j++){
bool flag=true;
for(int k=0;k<m;k++){
for(int l=0;l<m;l++){
if(a[i+k][j+l]==b[k][l]) continue;
flag=false;
break;
}
}
if(flag){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0 | 43,106,490 |
#include <iostream>
#include <vector>
constexpr int MOD = 1000000007;
using namespace std;
int main()
{
int n;
cin >> n;
if (n < 3)
{
cout << 0 << endl;
return 0;
}
vector<int> dp(n + 1);
dp[0] = 1;
dp[1] = 0;
dp[2] = 0;
for (int i = 3; i < n + 1; i++)
{
int s = 0;
for (int j = 3; j <= i; j++)
s = (s + dp[i - j]) % MOD;
dp[i] = s;
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const ll INFL = 1LL << 60;
const int INFI = (1 << 30);
int N, A, B, C;
vector<int> L;
int rec(int i, int a, int b, int c) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) return INFI;
return abs(a - A) + abs(b - B) + abs(c - C);
}
int res = rec(i + 1, a, b, c);
res = min(res, rec(i + 1, a + L.at(i), b, c) + (a ? 10 : 0));
res = min(res, rec(i + 1, a, b + L.at(i), c) + (b ? 10 : 0));
res = min(res, rec(i + 1, a, b, c + L.at(i)) + (c ? 10 : 0));
return res;
}
int main() {
cin >> N >> A >> B >> C;
L.resize(N);
for (int i = 0; i < N; i++) cin >> L.at(i);
cout << rec(0, 0, 0, 0) << endl;
}
| 0 | 83,987,730 |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<char> A){rep(i,A.size()){cout << A[i];}cout << endl;}
int main(){
ll q,h,s,d,n;
cin >> q >> h >> s >> d;
cin >> n;
q *= 4;h *= 2;
s = min(q,s);s = min(h,s);
if (2*s <= d){
cout << n*s;
}
else{
cout << d*(n/2) + s*(n%2);
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define deb(x) cerr << #x <<": " << x << '\n';
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long double ld;
typedef long long ll;
int main(){
ios;
ll N, P; cin >> N >> P;
string S; cin >> S;
ll ans = 0;
if(P == 2 || P == 5){
rep(i,N){
if( (S[i] - '0') % P == 0 ) ans += i + 1;
}
}
else{
unordered_map<ll,ll>Remainders;
Remainders[0] = 1;
ll _10Power = 1, number = 0, remainder;
for(ll i = S.size() - 1; ~i; --i){
number += (S[i] - '0') * _10Power;
remainder = number % P;
++Remainders[remainder];
_10Power *= 10;
_10Power %= P; number %= P;
}
for(auto rem : Remainders){
ans += (rem.second * (rem.second - 1)) / 2;
}
}
cout << ans;
return 0;
}
| 0 | 61,362,184 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Edge {
int to;
ll cost;
};
using Graph = vector<vector<Edge>>;
vector<ll> dist;
void bfs(const Graph &G, int s) {
const ll INF = 1e15;
dist.assign((int)G.size(), INF);
queue<int> que;
que.emplace(s);
dist[s] = 0;
while (que.size() != 0) {
int now = que.front();
que.pop();
for (auto e : G[now]) {
if (dist[e.to] == INF) {
dist[e.to] = dist[now] + e.cost;
que.emplace(e.to);
}
}
}
}
int main() {
int V;
cin >> V;
Graph G(V);
for (int i = 0; i < V - 1; i++) {
int a, b;
ll c;
cin >> a >> b >> c;
a--, b--;
G[a].push_back({b, c});
G[b].push_back({a, c});
}
int Q, K;
cin >> Q >> K;
K--;
vector<int> x(Q), y(Q);
for (int i = 0; i < Q; i++) {
cin >> x.at(i) >> y.at(i);
x[i]--, y[i]--;
}
bfs(G, K);
for (int i = 0; i < Q; i++) {
cout << dist[x[i]] + dist[y[i]] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define ll long long
bool FLAG = 0;
#define debug(x) if (FLAG) {cerr << #x << " = " << x << endl;}
#define debug_vec(x) if (FLAG) {cerr << #x << " = {"; for (auto to x) cout << to << ", "; cout << "}" << endl}
#define F first
#define S second
#define sqr(x) ((x) * (x))
#define make make_pair
#define pb push_back
#define sz(x) (int)(x.size())
#define all(x) x.begin (), x.end ()
using namespace std;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = (int)1e9 + 7, N = (int)1e6+ 222;
const ll INF = (ll)1e18;
int n, L, a[N], sum;
void solve () {
cin >> n >> L;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n - 1; ++i) {
if (a[i] + a[i + 1] >= L) {
cout << "Possible" << endl;
for (int j = 1; j <= i - 1; ++j) cout << j << endl;
for (int j = n - 1; j >= i + 1; --j) cout << j << endl;
cout << i << endl;
return;
}
}
cout << "Impossible";
}
signed main () {
#ifdef Maga
freopen("input", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1;
while (t --) {
solve ();
}
return 0;
}
| 0 | 31,216,359 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int a=N%10;
int b=N%100-a;
int c=N-b-a;
if(a==7||b==70||c==700){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
|
#include<bits/stdc++.h>
const int M=300000;
typedef long long int ll;
using namespace std;
ll n,x;
set<ll> s;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
s.insert(x);
}
if(s.size()==n)
{
cout<<"YES";
} else cout<<"NO";
}
| 0 | 41,674,928 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include <bits/stdc++.h>
using namespace std;
#define umap unordered_map
#define uset unordered_set
#define ll long long
#define lll long long
#define pb push_back
#define nl cout << '\n'
#define sor(x) sort(x.begin(), x.end())
#define rev(v) reverse(v.begin(), v.end())
#define lb(v, temp) lower_bound(v.begin(), v.end(), temp)
#define ub(v, temp) upper_bound(v.begin(), v.end(), temp)
#define fi first
#define se second
#define llmax 1000000000000000000
#define pll pair<ll, ll>
#define ull unsigned ll
#define vll vector<ll>
#define rub cout << "\n------------------------------------\n"
#define deb(x) cerr<<#x<<' '<<'='<<' '<<x<<'\n'
#define fo(i,a,b) for(int i=a;i<b;i++)
#define Lets_be_precise cout<<fixed<<setprecision(10)
ll n,m,a,b,c,k,temp,x,y;
const int MAXN=100000+11;
void read(vector<ll> &v)
{
for (int i = 0; i < v.size(); i++)
cin>>v[i];
}
void solveforthiscase(const int & test)
{
cin>>n>>k;
if(k==1)
{cout<<0;return ;}
cout<<n-k;
return ;
}
int main()
{
ios_base::sync_with_stdio(false);
Lets_be_precise;
cin.tie(NULL);
cout.tie(NULL);
int test=1;
for(int i=1;i<=test;i++)
{
solveforthiscase(i);
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define eb emplace_back
#define pb push_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (int)(lower_bound(c.begin(),c.end(),x)-c.begin())
#define EL cout<<'\n'
#define BS(a,x) binary_search(ALL(a),x)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<'('<<P.F<<','<<P.S<<')';
return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
REP(i,SZ(V)) out<<V[i]<<((i!=SZ(V)-1)?" ":"");
return out;
}
const ll maxn=105;
const ll maxlg=20;
const ll INF64=1e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
ll mypow(ll a,ll b){
ll res=1LL;
while(b){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
int edge[maxn][maxn];
int main(){
IOS;
int n,m;
cin>>n>>m;
REP(i,m){
int u,v;
cin>>u>>v;
u--;v--;
edge[u][v]=edge[v][u]=1;
}
vector<int> v;
REP(i,n) v.pb(i);
int cnt=0;
do{
bool flag = 1;
REP(i,SZ(v)-1){
if(edge[v[i]][v[i+1]]==0) flag=0;
}
if(flag&&v[0]==0) cnt++;
}while(next_permutation(ALL(v)));
cout<<cnt<<'\n';
return 0;
}
| 0 | 86,404,829 |
#include<iostream>
#define pb push_back
#define inf 0x3f3f3f3f
#define ll long long
#define endl '\n'
#define pii pair<int,int>
#define mem(a,val) memset(a,val,sizeof(a))
#define mkp make_pair
#define speed ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int main(){
int x,ans=0;
cin>>x;
for(int i=1 ; i<=180 ; i++){
if(360*i%x==0) ans=360*i/x;
if(ans) break;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x,y,z,k;cin >>x>>y>>z>>k;
vector<long long> a(x),b(y),c(z),ab,abc;
for (int i=0;i<x;i++) cin >> a[i];
for (int i=0;i<y;i++) cin >> b[i];
for (int i=0;i<z;i++) cin >> c[i];
for (int i=0;i<x;i++) {
for (int j=0;j<y;j++) {
ab.push_back(a[i]+b[j]);
}
}
sort(ab.begin(),ab.end());
reverse(ab.begin(),ab.end());
for (int i=0;i<min(x*y,k);i++) {
for (int j=0;j<z;j++) {
abc.push_back(ab[i]+c[j]);
}
}
sort(abc.begin(),abc.end());
reverse(abc.begin(),abc.end());
for (int i=0;i<k;i++) cout << abc[i] << endl;
}
| 0 | 84,865,645 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[3];
cin>>a[1]>>a[2]>>a[3];
sort(a+1,a+4);
if(a[1]==a[2]) cout<<a[3];
else cout<<a[1];
cout<<endl;
return 0;
}
|
#include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
const char *comparator =
( a < b ) ? "<" :
( a > b ) ? ">" :
"==";
std::cout
<< "a "
<< comparator
<< " b"
<< std::endl;
return 0;
}
| 0 | 73,429,676 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using pll = pair<long long,long long>;
#define cY cout<<"Yes"<<endl
#define cN cout<<"No"<<endl
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const long double pi = (acos(-1));
#define pb push_back
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
ll nCr(ll n, ll r) {
ll ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans*i;
}
for (ll i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
map< ll, ll > prime_factor(ll n) {
map< ll, ll > ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
int main(){
ll n;
cin>>n;
map<ll,ll> e;
map<ll,ll> o;
rep(i,n){
ll a;
cin>>a;
if(i%2==0){
e[a]++;
}else{
o[a]++;
}
}
ll keye,keyo;
ll emax=0;
ll e2m=0;
ll omax=0;
ll o2m=0;
for(auto p:e){
ll value=p.second;
if(value>emax){
e2m=emax;
emax=value;
keye=p.first;
}else if(value>e2m){
e2m=value;
}
}
for(auto p:o){
ll value=p.second;
if(value>omax){
o2m=omax;
omax=value;
keyo=p.first;
}else if(value>o2m){
o2m=value;
}
}
if(keye!=keyo){
cout<<n-emax-omax<<endl;
}else{
if(omax+e2m>emax+o2m){
cout<<n-omax-e2m<<endl;
}else{
cout<<n-emax-o2m<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin >> n >> m;
vector<int> valppp(n);
vector<int> valppm(n);
vector<int> valpmp(n);
vector<int> valpmm(n);
vector<int> valmpp(n);
vector<int> valmpm(n);
vector<int> valmmp(n);
vector<int> valmmm(n);
for(int i = 0; i < n; i++) {
int x,y,z;
cin >> x >> y >> z;
valppp[i]=x+y+z;
valppm[i]=x+y-z;
valpmp[i]=x-y+z;
valpmm[i]=x-y-z;
valmpp[i]=-x+y+z;
valmpm[i]=-x+y-z;
valmmp[i]=-x-y+z;
valmmm[i]=-x-y-z;
}
sort(valppp.rbegin(),valppp.rend());
sort(valppm.rbegin(),valppm.rend());
sort(valpmp.rbegin(),valpmp.rend());
sort(valpmm.rbegin(),valpmm.rend());
sort(valmpp.rbegin(),valmpp.rend());
sort(valmpm.rbegin(),valmpm.rend());
sort(valmmp.rbegin(),valmmp.rend());
sort(valmmm.rbegin(),valmmm.rend());
int sumppp=0;
int sumppm=0;
int sumpmp=0;
int sumpmm=0;
int summpp=0;
int summpm=0;
int summmp=0;
int summmm=0;
for(int i = 0; i < m; i++) {
sumppp+=valppp[i];
sumppm+=valppm[i];
sumpmp+=valpmp[i];
sumpmm+=valpmm[i];
summpp+=valmpp[i];
summpm+=valmpm[i];
summmp+=valmmp[i];
summmm+=valmmm[i];
}
int ans=max({sumppp,sumppm,sumpmp,sumpmm,summpp,summpm,summmp,summmm});
cout << ans << "\n";
return 0;
}
| 0 | 100,413,296 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
if(n%111==0){
cout << n;
}
else{
cout << (n/111 + 1)*111;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<string> &o) {
string a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> numbers(n), values(n);
rep(i, n) cin >> numbers[i] >> values[i];
vector<ll> candidate;
{
ll sum = 0;
rep(i, n) {
if ((k | numbers[i]) == k) sum += values[i];
}
candidate.push_back(sum);
}
rep(i, 35) {
bool d = (k >> i) & 1;
if (!d) continue;
ll sum = 0;
ll target = k >> (i + 1);
rep(j, n) {
ll l = numbers[j];
bool b = ((l >> i) & 1);
if (b) continue;
ll c = (l >> (i + 1));
if ((target | c) != target) continue;
sum += values[j];
}
candidate.push_back(sum);
}
cout << *max_element(candidate.begin(), candidate.end()) << endl;
}
| 0 | 83,984,949 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str,fc,p;
int q,i=0,a,b;
cin>>str>>q;
for(;i<q;i++){
cin>>fc>>a>>b;
switch(fc[2]){
case 'i':
cout<<str.substr(a,b-a+1)<<endl;
break;
case 'v':
p=str.substr(a,b-a+1);
reverse(p.begin(),p.end());
str.replace(a,b-a+1,p);
break;
case 'p':
cin>>p;
str.replace(a,b-a+1,p);
break;
}
}
}
|
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int N=in(),M=in(),D=in();
if(D==0){
out((M-1)/(double)(N));
}
else{
out(2.0*(M-1)*(N-D)/((double)N)/((double)N));
}
return 0;
}
| 0 | 96,552,408 |
#include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define rep1(i, n) for (long long i=0; i<(long long)(n); i++)
#define rep2(i, s, e) for (long long i=(s); i<(long long)(e); i++)
#define GET_MACRO(_1,_2,_3,NAME,...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
int main(){
ll n, k;
cin >> n >> k;
vector<ll> next(n);
rep(i, n){
ll num;
cin >> num; num--;
next[i] = num;
}
vector<ll> point(n);
rep(i, n) cin >> point[i];
ll biggest = -1000000000000000001;
rep(i, n){
vector<ll> tmp;
ll c = i;
ll sbiggest = -1000000000000000001;
ll sum = 0;
while(next[c] != i){
c = next[c];
sum += point[c];
sbiggest = max(sbiggest, sum);
tmp.push_back(c);
}
sum += point[i];
sbiggest = max(sbiggest, sum);
tmp.push_back(i);
if(sum <= 0){
if(k <= (ll)tmp.size()){
ll b = -1000000000000000001;
ll csum = 0;
rep(j, k){
csum += point[tmp[j]];
b = max(b, csum);
}
biggest = max(biggest, b);
}else{
ll b = -1000000000000000001;
ll csum = 0;
rep(j, (ll)tmp.size()){
csum += point[tmp[j]];
b = max(b, csum);
}
biggest = max(biggest, b);
}
}else{
if(k <= (ll)tmp.size()){
ll b = -1000000000000000001;
ll csum = 0;
rep(j, k){
csum += point[tmp[j]];
b = max(b, csum);
}
biggest = max(biggest, b);
}else{
ll b1 = 0;
ll csum1 = 0;
rep(j, k%tmp.size()){
csum1 += point[tmp[j]];
b1 = max(b1, csum1);
}
ll b2 = 0;
ll csum2 = 0;
rep(j, k%tmp.size(), tmp.size()){
csum2 += point[tmp[j]];
b2 = max(b2, csum2);
}
biggest = max(biggest, (ll)(b1+sum*(k/tmp.size())));
biggest = max(biggest, (ll)(b2+sum*(k/tmp.size()-1)));
}
}
}
cout << biggest << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n_a = 0, n_b = 0;
for(int i = 0; i < 3; i++) {
char c;
cin >> c;
if(c == 'A') {
n_a++;
}
else {
n_b++;
}
}
if(n_a == 0 || n_b == 0) {
cout << "No\n";
}
else {
cout << "Yes\n";
}
return 0;
}
| 0 | 85,656,115 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n),b(n);
for(int i=0; i<n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(),b.end());
int max_value = b[b.size()-1];
int sec_value = b[b.size()-2];
for(int i=0; i<n; i++) {
if(max_value==sec_value){
cout << max_value << endl;
} else if(a[i]==max_value) {
cout << sec_value << endl;
} else {
cout << max_value << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
a%=m;
ll ans=1;
while(b>0)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll pow(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
int main()
{ fast
ll h1,m1,h2,m2,k;cin>>h1>>m1>>h2>>m2>>k;
ll a=0;
if(h2<h1)h2+=24;
if(m1>=m2)
{
a+=60+m2-m1;
h2--;
}
else a+=m2-m1;
a+=60*(h2-h1);
cout<<max(a-k,0LL)<<"\n";
return 0;
}
| 0 | 45,078,618 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,x,y;
cin >> n >> m >> x >> y;
vector<int> a(n);
vector<int> b(m);
int ma=-101,mi=101;
rep(i,n) {
cin >> a[i];
ma = max(ma,a[i]);
}
rep(i,m) {
cin >> b[i];
mi = min(mi,b[i]);
}
for(int i = ma+1;i <= mi;i++){
if((i>x)&&(i<=y)){
cout << "No War" << endl;
return 0;
}
}
cout << "War" << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,y;
cin >> n >> y;
int sen = y/1000;
if(sen<n){
cout << "-1 -1 -1" << endl;
return 0;
}
int r = sen-n;
for(int g = 0;g*4<=r;++g){
if((r-4*g)%9==0){
if(n-(r-4*g)/9-g>=0){
printf("%d %d %d\n", (r-4*g)/9, g, n-(r-4*g)/9-g);
return 0;
}
}
}
cout << "-1 -1 -1" << endl;
return 0;
}
| 0 | 87,649,661 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {}
void add(int i, T x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i&-i) {
x += d[i];
}
return x;
}
T sum(int l, int r) {
return sum(r-1) - sum(l-1);
}
};
int main()
{
int n,d,a;
cin >> n >> d >>a;
vector<pll> p(n);
rep(i,n)cin >> p[i].first >> p[i].second;
BIT<ll> bit(n+5);
sort(p.begin(),p.end());
ll ans = 0;
rep(i,n){
ll x = p[i].first;
ll h = p[i].second;
int tot = bit.sum(i);
h -= tot;
if(h> 0){
int num = (h+a-1)/a;
ans += num;
ll damage = num*a;
bit.add(i,damage);
ll hashi = min(x + 2*d+1,1001001001ll);
int ni = upper_bound(p.begin(),p.end(),pll(hashi,999))-p.begin();
bit.add(ni,-damage);
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
char getGrade(int m,int f,int r){
int sum = m+f;
char grade;
if(m==-1||f==-1){
grade='F';
}else if(80<=sum){
grade='A';
}else if(65<=sum&&sum<80){
grade='B';
}else if(50<=sum&&sum<65){
grade='C';
}else if(30<=sum&&sum<50){
if(50<=r)grade='C';
else grade='D';
}else if(sum<30){
grade='F';
}
return grade;
}
int main(){
int m,f,r;
while(1){
cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1)break;
cout<<getGrade(m,f,r)<<endl;
}
return 0;
}
| 0 | 76,934,557 |
#include <bits/stdc++.h>
using namespace std;
int A[128];
char B[1001];
int conv(const string &a) {
int res = 0;
for(int i = 0; i < a.size(); ++i) {
int d = 1;
if(isdigit(a[i])) {
d = a[i++] - '0';
}
res += d * A[a[i]];
}
return res;
}
string conv(const int x) {
string res;
for(int i = 1000; i >= 1; i /= 10) {
int d = x / i % 10;
if(!d) continue;
if(d > 1) res += (char)(d + '0');
res += B[i];
}
return res;
}
int main() {
A['m'] = 1000;
A['c'] = 100;
A['x'] = 10;
A['i'] = 1;
B[1000] = 'm';
B[100] = 'c';
B[10] = 'x';
B[1] = 'i';
int n; cin >> n;
while(n--) {
string a, b;
cin >> a >> b;
cout << conv(conv(a) + conv(b)) << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
int n; cin>>n;
int lcm=1;
while (n--){
int t; cin>>t;
lcm = lcm*(t/__gcd(lcm,t));
}
cout << lcm << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
| 0 | 65,284,528 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<(m);i++)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) for(int i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using PP=pair<ll,P>;
using vp=vector<P>;
using vpp=vector<PP>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
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;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
int main(){
ll x,y;
cin>>x>>y;
if(abs(x-y)<=1){
cout<<"Brown"<<endl;
}else{
cout<<"Alice"<<endl;
}
return 0;
}
|
#include <cstdint>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define SIZE 10000
static vector<uint32_t> graph[SIZE];
static vector<uint32_t> connected_num(SIZE, 0);
static queue<uint32_t> q;
static vector<uint32_t> sorted;
int32_t main()
{
uint32_t V, E;
cin >> V >> E;
for (uint32_t i = 0; i < E; i++) {
uint32_t s, t;
cin >> s >> t;
graph[s].push_back(t);
connected_num[t]++;
}
for (uint32_t i = 0; i < V; i++) {
if (connected_num[i] == 0) {
q.push(i);
}
}
while (!q.empty()) {
uint32_t index = q.front();
q.pop();
sorted.push_back(index);
for (uint32_t i = 0; i < graph[index].size(); i++) {
connected_num[graph[index][i]]--;
if (connected_num[graph[index][i]] == 0) {
q.push(graph[index][i]);
}
}
}
for (uint32_t i = 0; i < sorted.size(); i++) {
if (i != 0) cout << " ";
cout << sorted[i];
}
cout << endl;
return 0;
}
| 0 | 84,434,363 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#include <iomanip>
#include <unordered_map>
#include <map>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define reps(i,s,n) for(int i=s, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
typedef long double ld;
const char sp = ' ';
using namespace boost::multiprecision;
using namespace std;
int main(void){
ll A, B, C, D;
cin>>A>>B>>C>>D;
if(A+B>C+D) cout<<"Left"<<endl;
else if(A+B==C+D) cout<<"Balanced"<<endl;
else cout<<"Right"<<endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
struct pnt{
int cost, y, x;
};
vector<vector<int>> mv={{1,0},{-1,0},{0,1},{0,-1}};
int dist[1002][1002];
int bfs(queue<pnt> &que, vector<vector<char>> &mat){
for(int i=0; i<1002; i++){
for(int j=0; j<1002; j++){
dist[i][j]=-1;
}
}
while((int)que.size()>0){
pnt p=que.front();
que.pop();
if(dist[p.y][p.x]>=0){
continue;
}
dist[p.y][p.x]=p.cost;
for(auto &m:mv){
if(mat[p.y+m[0]][p.x+m[1]]=='.'){
que.push({p.cost+1,p.y+m[0],p.x+m[1]});
}
}
}
int ans=0;
for(int i=0; i<1002; i++){
for(int j=0; j<1002; j++){
ans=max(ans,dist[i][j]);
}
}
return ans;
}
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> mat(H+2,vector<char>(W+2,'@'));
queue<pnt> que;
for(int i=1; i<=H; i++){
for(int j=1; j<=W; j++){
cin >> mat[i][j];
if(mat[i][j]=='#'){
que.push({0,i,j});
}
}
}
cout << bfs(que, mat) << endl;
}
| 0 | 38,848,096 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
while( true ){
int n;
int ma = 0;
int mi = 0;
cin >> n;
if(n == 0){
break;
}
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
for(int i = 2;i < n-1;i++){
a[1]+=a[i];
}
cout << a[1]/(n-2) << endl;
}
}
|
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
const int dx[] = { 1, -1, 0, 0, 1, 1, -1, -1 };
const int dy[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
const char dir[] = {'D', 'U', 'R', 'L'};
void Fast() { cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); }
void File()
{
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
#endif
}
const int N = 1e3 + 9, M = 1e3 + 9, oo = 0x3f3f3f3f;
int n, m, dis[N][N];
char grid[N][M];
queue <array <int, 2>> Q;
bool valid(int r, int c)
{
return r >= 0 && r < n && c >= 0 && c < m && dis[r][c] == oo;
}
void BFS()
{
array <int, 2> cell;
int r, c;
while(Q.size())
{
cell = Q.front(); Q.pop();
for(int i = 0; i < 4; ++i)
{
r = cell[0] + dx[i];
c = cell[1] + dy[i];
if(!valid(r, c)) continue;
dis[r][c] = dis[cell[0]][cell[1]] + 1;
Q.push({r, c});
}
}
}
void Solve()
{
cin >> n >> m;
memset(dis, 0x3f, sizeof dis);
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j)
{
cin >> grid[i][j];
if(grid[i][j] == '#')
Q.push({i, j}), dis[i][j] = 0;
}
BFS();
int ans = 0;
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j)
if(dis[i][j] > ans) ans = dis[i][j];
cout << ans << endl;
}
void MultiTest(bool Tests = 0)
{
int tc = 1; (Tests) && (cin >> tc);
for(int i = 1; i <= tc; ++i)
Solve();
}
int main()
{
Fast(); MultiTest();
}
| 0 | 98,210,523 |
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scan(n,v) v.resize(n); rep(i,n){ cin>>v[i];}
#define MOD 1000000007ll
#define Yes(flag) cout<<((flag)? "Yes":"No");
#define YES(flag) cout<<((flag)? "YES":"NO");
#define be begin
#define pb push_back
#define fi first
#define se second
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
template<class T>T
chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<class T>T
chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
int n;
vector<int> a;
void input(){
cin>>n;
scan(n,a);
}
void src(){
int count=0;
int eq=0;
rep(i,n-1){
if(a[i]==a[i+1]){
eq++;
}else{
count += (eq+1)/2;
eq=0;
}
}
count += (eq+1)/2;
eq=0;
cout<<count;
}
int main(int argc,char* argv[]){
ios::sync_with_stdio(false);
input();
src();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<ll> C(N+1), D(N+1);
C[0] = 0;
D[0] = 0;
for (int i = 1; i < N+1; i++) {
D[i] = D[i-1] + A[i-1];
if(A[i-1] >= 0){
C[i] = C[i-1] + A[i-1];
}
else{
C[i] = C[i-1];
}
}
ll ans = 0;
ll tmp;
for (int i = 0; i < N-K+1; i++) {
tmp = C[i] + C[N] - C[i+K];
ans = max(ans, tmp);
}
for (int i = 0; i < N-K+1; i++) {
tmp = C[i] + C[N] - C[i+K] + D[i+K] - D[i];
ans = max(ans, tmp);
}
printf("%lld\n", ans);
}
| 0 | 93,753,314 |
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main(){
int n,x,i;
list <int> a;
list<int>::iterator it;
string com;
cin>>n;
for(i=0;i<n;i++){
cin>>com;
if(com=="deleteFirst") a.pop_front();
else if(com=="deleteLast") a.pop_back();
else{
cin>>x;
if(com=="insert") a.push_front(x);
else for(it=a.begin();it!=a.end();it++) if(*it==x){
a.erase(it);
break;
}
}
}
i=0;
for(it=a.begin();it!=a.end();it++){
if(i++) cout<<" ";
cout<<*it;
}
cout<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(int x, int y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using Graph = vector<vector<int>>;
ll inf=300000000000000000;
const double PI = 3.14159265358979323846;
int main(){
ll n,k;
cin >> n >> k;
ll a[n];
ll b[n];
rep(i,n)cin >> a[i] >> b[i];
ll ans=0;
ll u=0;
rep(i,30){
if(i==0)u=k;
else if(k&(1<<i)){
u=(k^(1<<i))|((1<<i)-1);
}
else continue;
ll an=0;
rep(j,n){
if((u|a[j])==u)an+=b[j];
}
ans=max(ans,an);
}
cout << ans << endl;
}
| 0 | 88,170,546 |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<int>
#define pi pair<int,int>
#define mp make_pair
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
int mod=1e9+7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int mul(int a,int b)
{
return ((a)*1ll*(b))%mod;
}
void add(int &a,int b)
{
a+=b;
if(a>=mod)a-=mod;
}
int sub(int a,int b){
a-=b;
if(a<0){
a+=mod;
}
return a;
}
int powz(int a,int b)
{
int res=1;
while(b)
{
if(b&1){
res=mul(res,a);
}
b/=2;
a=mul(a,a);
}
return res;
}
template <typename A, typename B>
istream& operator>>(istream& input,pair<A,B>& x) {
input>>x.F>>x.S;
return input;
}
template <typename A>
istream& operator>>(istream& input,vector<A>& x) {
for(auto& i:x)
input>>i;
return input;
}
template<typename A>
ostream& operator<<(ostream& output,vector<A>& x) {
for(auto& i:x)
output<<i<<' ';
return output;
}
const int N=1000002;
vector<int>adj[N];
int dp[N];
int dfs(int u,int p){
int sum=0;
for(auto i:adj[u]){
if(i!=p){
sum^=dfs(i,u);
}
}
return dp[u]=sum+1;
}
void solve(){
int n;
cin>>n;
for(int i=0;i<n-1;i++){
int x,y;
cin>>x>>y;
x--;y--;
adj[x].pb(y);
adj[y].pb(x);
}
dfs(0,-1);
int val=dp[0];
if(val!=1){
cout<<"Alice";
}
else{
cout<<"Bob";
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int tc=1;
for(int _=0;_<tc;_++){
solve();
if(_!=tc-1)
cout<<"\n";
}
}
|
#include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<string>
#include<math.h>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
using namespace std;
const int INF=100000000;
int main(){
int n;
while(cin>>n,n!=0){
int dp[100][100];
rep(i,10){
rep(j,10){
dp[i][j]=i==j?0:INF;
}
}
int k[100]={};
vector<int> vec;
rep(i,n){
int a,b,c;
cin>>a>>b>>c;
dp[a][b]=c;
dp[b][a]=c;
k[a]++;
k[b]++;
}
int city=0;
rep(i,11){
if(k[i]>0){
city++;
vec.push_back(i);
}
}
rep(k,10){
rep(i,10){
rep(j,10){
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
int minsum=INF,num;
rep(i,vec.size()){
int sum=0;
rep(j,vec.size()){
sum+=dp[vec[i]][vec[j]];
}
if(minsum>sum){
minsum=sum;
num=vec[i];
}
}
cout<<num<<" "<<minsum<<endl;
}
return 0;
}
| 0 | 62,900,155 |
#include<iostream>
#include<vector>
#include<queue>
#include<string>
int main(){
std::vector<int> tiles;
std::queue<int> unvisited_tile_q;
int width, height, counter, pos;
std::string line;
while(true){
std::cin >> width >> height;
if( width == 0 && height == 0 ) break;
tiles.resize(width*height);
pos = 0;
for( int h = 0; h < height; h++ ){
std::cin >> line;
for(std::string::iterator it = line.begin(); it != line.end(); ++it) {
switch(*it){
case '#':
tiles[pos] = 0;
break;
case '@':
unvisited_tile_q.push(pos);
case '.':
tiles[pos] = 1;
}
pos++;
}
}
counter = 0;
while( !unvisited_tile_q.empty() ){
pos = unvisited_tile_q.front();
unvisited_tile_q.pop();
if( tiles[pos] == 1 ){
counter++;
tiles[pos] = -1;
} else continue;
if ( pos - 1 >= 0 && pos % width > 0 && tiles[pos-1] == 1 ) unvisited_tile_q.push(pos-1);
if ( pos + 1 <= tiles.size() && pos % width < width - 1 && tiles[pos+1] == 1 ) unvisited_tile_q.push(pos+1);
if ( pos - width >= 0 && tiles[pos-width] == 1 ) unvisited_tile_q.push(pos-width);
if ( pos + width < tiles.size() && tiles[pos+width] == 1 ) unvisited_tile_q.push(pos+width);
}
std::cout << counter << std::endl;
}
return 0;
}
|
#include <stdio.h>
#include <vector>
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) for(int (i) = (n) - 1; (i) >= 0; --(i))
using lli = long long int;
std::vector<int> A;
int main(void){
int n; scanf("%d", &n);
A.resize(n); REP(i, n) scanf("%d", &A[i]);
lli L = 2, R = 2;
rREP(i, n){
lli LL = (((L - 1) / A[i]) + 1) * A[i];
lli RR = (R / A[i]) * A[i] + A[i] - 1;
L = LL; R = RR;
if(L > R){
puts("-1");
return 0;
}
}
printf("%lld %lld\n", L, R);
return 0;
}
| 0 | 19,708,260 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e9;
#define mod 1000000007
#define what_is(x) cerr<<#x<<" is "<<x<<"\n";
#define read(x) freopen("in.txt","r",stdin);
#define write(x) freopen("out.txt","w",stdout);
#define Fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sz 10
char arr[sz][sz];
int solve(int n, int m, int k){
int tot=0;
for(int maskR=0; maskR<(1<<n); maskR++){
for(int maskC=0; maskC<(1<<m); maskC++){
int black=0;
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
if(((maskR>>i)&1)==0 && ((maskC>>j)&1)==0 && arr[i][j]=='#')black++;
}
}
tot+=(black==k);
}
}
return tot;
}
int main(){
Fast;
int n,m,k;
cin>>n>>m>>k;
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
cin>>arr[i][j];
}
}
cout<<solve(n, m, k)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
#define all(v) v.begin(), v.end()
#define si(v) int(v.size())
#define UNIQUE(v) sort(all(v)), v.erase(unique(all(v)),v.end())
const ll mod = 1e9 + 7;
const ll infll = (1LL << 62) - 1;
const ll inf = (1LL << 30) - 1;
template<class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
int n; cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
}
ll ans = 1;
rep(i, n) {
if (ans > (1000000000000000000 / a[i])) {
cout << -1 << endl;
return 0;
}
ans *= a[i];
}
cout << ans << endl;
}
| 0 | 48,548,349 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
string O,E; cin >> O >> E;
REP(i,E.size()){
cout << O[i] << E[i];
}
if(O.size()-E.size() == 1) cout << O[O.size()-1];
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> v(N);
for(int i = 0; i < N; ++i) {
cin >> v[i];
}
int res = 0;
for(int i = 0; i <= N; ++i) {
for(int j = N; j >= i; --j) {
vector<int> tmp;
for(int k = 0; k < i; ++k) tmp.pb(v[k]);
for(int k = N - 1; k >= j; --k) tmp.pb(v[k]);
if(tmp.size() > K) break;
int sum = 0;
for(int k = 0; k < tmp.size(); ++k) {
sum += tmp[k];
}
res = max(res, sum);
sort(all(tmp));
for(int k = 0; k < min(K - int(tmp.size()), int(tmp.size())); ++k) {
sum -= tmp[k];
res = max(res, sum);
}
}
}
cout << res << endl;
return 0;
}
| 0 | 83,316,117 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t A,B,C;
cin>>A>>B>>C;
bool Q=false;
for(int i=1;i<10000000;i++){
if((A*i)%B==C){
Q=true;
break;
}
}
if(Q){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int next(int a, int b, int c, int x){
return (a*x+b)%c;
}
int main(void){
while(true){
int n, a, b, c, x, ri[110];
cin >> n >> a >> b >> c >> x;
if((n+a+b+c+x)==0) break;
for(int i=0;i<n;++i){
cin >> ri[i];
}
int frame = 0, now=0;
while(frame<=10000){
if(ri[now]==x) ++now;
if(now==n) break;
x = next(a, b, c, x);
++frame;
}
if(frame<=10000) cout << frame << endl;
else cout << "-1" << endl;
}
}
| 0 | 90,910,658 |
#include<stdio.h>
int main( ){
int n,b,f,r,v,a[4][3][10]={};
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d %d %d %d",&b,&f,&r,&v);
a[b-1][f-1][r-1]+=v;
if(a[b-1][f-1][r-1]<0){
a[b-1][f-1][r-1]=0;
}
}
for(int j=0;j<4;j++){
for(int p=0;p<3;p++){
for(int q=0;q<10;q++){
printf(" %d",a[j][p][q]);
}
printf("\n");
}
if(j!=3)printf("####################\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
random_device rnd;
mt19937 mt(rnd());
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1000000007;
int main()
{
int n;
cin >> n;
VI v(n);
VI num(1010101, 0);
VI divnum(1010101, 0);
rep(i, n)
{
cin >> v[i];
num[v[i]]++;
if (num[v[i]] == 1)
{
int j = 1;
while (j * v[i] < 1010101)
{
divnum[j * v[i]]++;
j++;
}
}
}
int ans = n;
rep(i, n)
{
if (num[v[i]] != 1)
{
ans--;
}
else if (divnum[v[i]] != 1)
{
ans--;
}
}
cout << ans << endl;
return 0;
}
| 0 | 30,227,336 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,M;
cin>>N;
map<string,ll> B;
map<string,ll> A;
for(ll i=0;i<N;i++) {
string s;
cin>>s;
B[s]++;
}
cin>>M;
for(ll i=0;i<M;i++) {
string t;
cin>>t;
A[t]++;
}
ll ans=0;
for(auto x:B) {
ll k=x.second-A[x.first];
ans=max(ans,k);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool compare(const vector<long long> &a, const vector<long long> &b) {
return atan2(a[1], a[0]) < atan2(b[1], b[0]);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<vector<long long>> coords;
for (int i = 0; i < N; i++) {
vector<long long> coord(2);
cin >> coord[0] >> coord[1];
coords.push_back(coord);
}
sort(coords.begin(), coords.end(), compare);
long long maxDist = 0;
for (int i = 0; i < N; i++) {
long long x = 0, y = 0;
for (int j = i; j < i + N; j++) {
x += coords[j % N][0];
y += coords[j % N][1];
maxDist = max(maxDist, x * x + y * y);
}
}
cout << fixed << setprecision(11) << sqrt(maxDist) << '\n';
return 0;
}
| 0 | 98,023,527 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n; cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
vector<vector<int>> alphs(n, vector<int>(26, 0));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < s[i].size(); ++j) {
alphs[i][s[i][j] - 'a'] += 1;
}
}
vector<int> common(26, n);
for (int i = 0; i < 26; ++i) {
common[i] = alphs[0][i];
}
for (int i = 1; i < n; ++i) {
for (int j = 0; j < 26; ++j) {
common[j] = min(common[j], alphs[i][j]);
}
}
for (int i = 0; i < 26; ++i) {
for (int j = 0; j < common[i]; ++j) {
cout << (char)('a' + i);
}
}
cout << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
const int INF=mod;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<int, int>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep2(i,k,n) for(int i = k; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define mkp make_pair
#define vin(v,N) for(long long id=0;id<N;id++) cin>>v.at(id)
#define lin(n) long long n;cin>>n
#define chin(x) char x;cin>>x;
#define sin(s) string s;cin>>s;
#define vlin(v,N) vector<long long>v(N);for(long long i=0;i<N;i++)cin>>v.at(i)
long long gcd(long long m, long long n){
long long a=max(m,n);
long long b=min(m,n);
long long r=a%b;
while(r!=0){
a=b; b=r; r=a%b;
}
return b;
}
long long lcd(long long m, long long n){
return m*n/gcd(m,n);
}
long long repeat_squaring(long long x, long long n){
if(n==0) return 1;
else if(n%2==0){
long long t=repeat_squaring(x,n/2);
return t*t%mod;
}
else
return x*repeat_squaring(x,n-1)%mod;
}
map<long long,long long> factor(long long p){
ll p1=p;
map<long long,long long>ret;
for(long long i=2;i*i<=p1;i++){
while(p%i==0){
ret[i]++;
p/=i;
}
}
if(p!=1)
ret[p]++;
return ret;
}
bool is_prime(long long N){
for(long long i=2;i*i<=N;i++){
if(N%i==0)
return false;
}
return true;
}
void chmax(long long &a,long long b){
a=max(a,b);
}
void chmin(long long &a,long long b){
a=min(a,b);
}
int main(){
ll N; cin >> N;
ll max_d = 0;
vector<ll> a(1e5 + 10);
bool NG = false;
rep(i, N){
ll d; cin >> d;
max_d = max(d, max_d);
a[d]++;
if((i == 0 && d != 0) || (i != 0 && d == 0)) NG = true;
}
ll res = 1;
rep(i, max_d+1){
for(int j = 0; j < a[i+1]; j++){
res *= a[i];
res %= mod;
}
}
if(NG){
cout << 0 << endl;
return 0;
}
cout << res << endl;
}
| 0 | 34,801,993 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, cs;
cin >> A >> B >> cs;
int ans = 0;
if(A <= cs) {
ans++;
}
if(cs <= A + B) {
ans++;
}
if(ans == 2) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<utility>
#define MAX 10000
using namespace std;
int compare(pair<int,int> a,pair<int,int> b)
{
return a>b;
}
int main()
{
int N,M;
while(cin>>N>>M&&N)
{
int d,p;
int P=0;
pair<int,int> pd[MAX];
int i;
for(i=0;i<N;i++)
{
cin>>d>>p;
pd[i]=make_pair(p,d);
}
sort(pd,pd+N,compare);
for(i=0;i<N;i++)
{
if(pd[i].second<=M)
M-=pd[i].second;
else
{
P+=(pd[i].second-M)*pd[i].first;
M=0;
}
}
cout<<P<<endl;
}
return 0;
}
| 0 | 29,659,139 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<unordered_map>
#include<iomanip>
#include<queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ll amari = 1000000007;
#define rep(n,x) for(ll i=0;i<n;i++) cin>>x[i];
#define forr(a,b) for(ll i=a;i<b;i++);
ll modpow(ll a, ll n, ll mod)
{
ll res = 1;
while (0 < n)
{
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll gcd(ll x, ll y)
{
if (x % y == 0) return y;
else return gcd(y, x % y);
}
ll prime(ll x)
{
for (ll i = 2; i * i <= x; i++)
{
if (x % i == 0) return 0;
}
return 1;
}
int main()
{
ll n;
cin >> n;
ll k = n;
ll x = sqrt(n);
vector<ll> a(x+10, 0);
for (ll i = 2; i < x + 5; i++)
{
while (k % i == 0)
{
a[i]++;
k /= i;
}
}
ll ans = 0;
ll y = 0;
for (ll i = 0; i < x+5; i++)
{
if (a[i] != 0)
{
y = 0;
while (y * (y + 1) <= 2 * a[i])
{
y++;
}
y--;
ans += y;
}
}
if(k!=1) ans++;
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr Int MOD = 1e9 + 7;
int main()
{
int N; cin >> N;
vector<int> A(N), B(N), mi(N, 1), ma(N, 2e9);
for (auto &a : A) cin >> a;
for (auto &b : B) cin >> b;
for (int i = 0; i < N; i++) {
int prev = (i == 0 ? 0 : A[i-1]);
if (prev < A[i]) mi[i] = max(mi[i], A[i]);
ma[i] = min(ma[i], A[i]);
}
for (int i = N-1; i >= 0; i--) {
int prev = (i == N-1 ? 0 : B[i+1]);
if (prev < B[i]) mi[i] = max(mi[i], B[i]);
ma[i] = min(ma[i], B[i]);
}
Int ans = 1;
for (int i = 0; i < N; i++) {
if (mi[i] > ma[i]) ans = 0;
else ans = ans * (ma[i] - mi[i] + 1) % MOD;
}
cout << ans << endl;
return 0;
}
| 0 | 48,309,514 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, m, x, y, big = -1e9, small = 1e9 + 2;
cin >> n >> m >> x >> y;
bool war = false;
for(int i = 0; i < n; ++i){
int element;
cin >> element;
big = max(big, element);
}
int z = big + 1;
for(int i = 0; i < m; ++i){
int elemnt;
cin >> elemnt;
small = min(small, elemnt);
}
if(x < z && z <= y){
if(z <= small){
cout << "No War" << endl;
return;
}
}
cout << "War" << endl;
}
int main()
{
solve();
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
long Num, Value, Min, Max, Sum;
std::cin >> Num;
Sum = 0;
for(long i = 0; i < Num; i++){
std::cin >> Value;
if(i == 0){
Min = Value;
Max = Value;
} else{
if(Value < Min) Min = Value;
if(Value > Max) Max = Value;
}
Sum += Value;
}
std::cout << Min << " " << Max << " " << Sum << std::endl;
}
| 0 | 61,797,883 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
signed main(){
int n,a,b;
cin >> n >> a >> b;
int p[n];
REP(i,n){
cin >> p[i];
}
int cnt_a = 0, cnt_b = 0, cnt_c = 0;
REP(i,n){
if(p[i] <= a){
cnt_a++;
}else if(p[i] <= b){
cnt_b++;
}else{
cnt_c++;
}
}
cout << min(cnt_a, min(cnt_b, cnt_c)) << endl;
}
|
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
signed main()
{
int K,N;
cin>>N>>K;
vector<int> memo[100000];
for(int i=0;i<N;i++)
{
int t,d;
cin>>t>>d;
t--;
memo[t].emplace_back(d);
}
vector<ll> q1,q2;
for(int i=0;i<N;i++)
{
sort(memo[i].rbegin(),memo[i].rend());
if(memo[i].size())
{
q1.emplace_back(memo[i][0]);
for(int j=1;j<memo[i].size();j++)q2.emplace_back(memo[i][j]);
}
}
sort(rbegin(q1),rend(q1));
sort(rbegin(q2),rend(q2));
for(int i=1;i<q2.size();i++)q2[i]+=q2[i-1];
ll ret=0,make=0;
for(int i=0;i<K&&i<q1.size();i++)
{
make+=q1[i];
ll rest=K-i-1;
if(rest<=q2.size())
{
ll odd=rest<=0?0:q2[rest-1];
ll tmp=make+odd+1LL*(i+1)*(i+1);
if(ret<tmp)ret=tmp;
}
}
cout<<ret;
return 0;
}
| 0 | 5,179,826 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
const int MAX_V=10;
int d[10][10];
int V;
const int INF=100000000;
void warshall_floyd(){
for(int k = 0; k < V; k++){
for(int i = 0; i < V; i++){
for(int j = 0; j < V; j++){
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
}
int main(){
int n;
while(cin>>n&&n!=0){
for(int i = 0; i < 10; i++)
fill(d[i],d[i]+10,INF);
set<int> s;
for(int i = 0; i < n; i++){
int a,b,c;
cin>>a>>b>>c;
d[a][b]=c;
d[b][a]=c;
s.insert(a);
s.insert(b);
}
V=s.size();
for(int i = 0; i < V; i++){
d[i][i]=0;
}
warshall_floyd();
int idx;
int minValue=INF;
for(int i = 0; i < V; i++){
int sum=0;
for(int j = 0; j < V; j++){
if(i!=j&&d[i][j]!=INF){
sum+=d[i][j];
}
}
if(minValue>sum){
minValue=sum;
idx=i;
}
}
cout<<idx<<" "<<minValue<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<int>a(N);
vector<int>b(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i) >> b.at(i);
}
vector<int>c(M);
vector<int>d(M);
for (int i = 0; i < M; i++) {
cin >> c.at(i) >> d.at(i);
}
vector<int>A(M);
for (int j = 0; j < N; j++) {
int MIN = 1000000000;
int B = 1;
for (int i = 0; i < M; i++) {
A.at(i) = abs(a.at(j)-c.at(i)) + abs(b.at(j)-d.at(i));
if (A.at(i) < MIN){
MIN = A.at(i);
B = i+1;
}
}
cout << B << endl;
}
}
| 0 | 13,657,340 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,m;
cin >> n >> m;
ll a = 1900*m + 100*(n-m);
a = a*pow(2,m);
cout << a;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
int ans = 0;
for (int i = 0; i < h; i++) cin >> s[i];
for (int i = 0; i < (1<<h); i++) {
for (int j = 0; j < (1<<w); j++) {
int count = 0;
for (int x = 0; x < h; x++) {
for (int y = 0; y < w; y++) {
if (i>>x & 1) continue;
if (j>>y & 1) continue;
if (s[x][y] == '#') count++;
}
}
if (count == k) ans++;
}
}
cout << ans << endl;
return 0;
}
| 0 | 32,406,002 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <math.h>
#include <vector>
using namespace std;
int main(){
int a,b,c; cin>>a>>b>>c;
int maxa=a;
if(b>maxa) maxa=b;
else if(c>maxa) maxa=c;
if (maxa==a) cout<<a*10+b+c;
else if(maxa==b) cout<<b*10+a+c;
else if(maxa==c) cout<<c*10+a+b;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void){
while(1){
string s;
vector<char> v;
getline(cin, s);
if(s[0] == '.') break;
int ptr = 0;
bool correct = true;
while(correct && ptr < s.length()){
switch( s[ptr] ){
case '(' :
v.push_back('(');
ptr++;
break;
case '[' :
v.push_back('[');
ptr++;
break;
case ')' :
if( !v.empty() && v.back() == '('){
v.pop_back();
ptr++;
}else{
correct = false;
}
break;
case ']' :
if( !v.empty() && v.back() == '['){
v.pop_back();
ptr++;
}else{
correct = false;
}
break;
default:
ptr++;
break;
}
}
if(v.empty() && correct){
cout << "yes" << endl;
}else{
cout << "no" << endl;
}
}
return 0;
}
| 0 | 68,508,777 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
int ans = 0;
for (int i = 1; i < N; i++){
if (a[i - 1] == a[i]){
ans++;
a[i] = 0;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
vector<ll> w(100);
bool isOK(ll index, ll key) {
if (w[index] >= key) return true;
else return false;
}
ll binary_search(ll key) {
ll ng = -1;
ll ok = (ll)w.size();
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (isOK(mid, key)) ok = mid;
else ng = mid;
}
return ok;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str;
cin>>n;
vector<ll> v(n);
rep(i,n) cin>>v[i];
sum+=v[0]-1;
v[0]=1;
ll size=2;
mini=1;
ll lastsum=0;
for(ll i=1;i<n;i++){
lastsum=sum;
if(v[i]<size) a=1;
else if(v[i]==size) {
size++;
}else{
ll effective =v[i]-1;
sum+=effective/size;
}
}
cout<<sum<<endl;
return 0;
}
| 0 | 75,709,059 |
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll df(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b - (a % b < 0);
}
ll dc(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b + (a % b > 0);
}
template <class T>
class FT
{
vector<T> ft;
public:
FT(int n) : ft(n + 1)
{
}
T rsq(int b)
{
T sum = 0;
for (; b; b -= (b & (-b)))
sum += ft[b];
return sum;
}
void adjust(int k, T v)
{
for (; k < ft.size(); k += (k & (-k)))
ft[k] += v;
}
void adjust(int l, int r, T v)
{
adjust(l, v);
adjust(r + 1, -v);
}
};
int x[200000];
ll h[200000];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
ll d, a;
cin >> n >> d >> a;
vector<ll> vp, wp;
vector<pair<ll, ll>> ev;
FT<ll> ft(n);
for (int i = 0; i < n; ++i)
{
cin >> x[i] >> h[i];
vp.push_back(x[i]);
ev.emplace_back(x[i], h[i]);
}
sort(all(ev));
for (int i = 0; i < n; ++i)
{
int xp, hp;
tie(xp, hp) = ev[i];
ft.adjust(i + 1, i + 1, hp);
}
sort(all(vp));
wp = vp;
reverse(all(wp));
ll sol = 0;
for (int i = 0; i < n; ++i)
{
int hp = ft.rsq(i + 1);
if (hp <= 0) continue;
int j = n - (lower_bound(all(wp), vp[i] + 2 * d, greater<ll>()) - wp.begin()) - 1;
sol += dc(hp, a);
ft.adjust(i + 1, j + 1, -dc(hp, a) * a);
}
cout << sol;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct edge {
ll to;
ll cost;
};
int n;
vector<vector<edge>> g;
vector<ll> d;
void dfs(ll s, ll di, ll pa = -1) {
d[s] = min(d[s], di);
for (auto t : g[s]) {
if (t.to == pa) continue;
dfs(t.to, di + t.cost, s);
}
}
int main() {
cin >> n;
g.resize(n);
d.resize(n, LINF);
for (int i = 0; i < n - 1; ++i) {
ll a, b, c; cin >> a >> b >> c;
--a; --b;
g[a].push_back(edge({b, c}));
g[b].push_back(edge({a, c}));
}
ll q, k; cin >> q >> k;
--k;
dfs(k, 0);
for (int i = 0; i < q; ++i) {
ll x, y; cin >> x >> y;
--x; --y;
ll ans = d[x] + d[y];
cout << ans << endl;
}
}
| 0 | 28,922,037 |
#include <iostream>
#include <unordered_set>
#include <cstdint>
#include <vector>
#include <sstream>
#include <string>
#include <climits>
#include <set>
#include <array>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <numeric>
#include <map>
#include <utility>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
for (int i = 0; i < t.size() - 1; i++)
{
if (s[i] != t[i])
{
cout << "No";
return 0;
}
}
cout << "Yes";
}
|
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li n;
li a[55];
int main() {
cin >> n;
rin{
cin >> a[i];
}
li res = 0;
sort(a, a + n);
li cnt = 0;
while (a[n - 1] >= n) {
cnt++;
li num = a[n - 1] / n;
a[n - 1] -= n * num;
res += num;
rep(i, n - 1) {
a[i] += num;
}
sort(a, a + n);
}
cout << res << endl;
return 0;
}
| 0 | 36,193,185 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
const int mod = 1000000007;
int dp[100005][2];
int main(){
string s; cin >> s;
int n = s.size();
dp[0][0] = 1;
rep(i,n){
if(s[i] == '0'){
(dp[i+1][0] += dp[i][0]) %= mod;
(dp[i+1][1] += dp[i][1]) %= mod;
}else{
(dp[i+1][1] += (dp[i][0] + dp[i][1]) % mod) %= mod;
}
if(s[i] == '0'){
(dp[i+1][1] += dp[i][1]*2 % mod) %= mod;
}else{
(dp[i+1][0] += dp[i][0]*2 % mod) %= mod;
(dp[i+1][1] += dp[i][1]*2 % mod) %= mod;
}
}
int ans = (dp[n][0] + dp[n][1]) % mod;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
string s; cin>>s;
bool flg=true;
while(flg){
flg=false;
int dream = s.rfind("dream");
int dreamer = s.rfind("dreamer");
int erase = s.rfind("erase");
int eraser = s.rfind("eraser");
if(5 == s.size() - dream){
s = s.substr(0,dream);
flg=true;
}
if(7 == s.size() - dreamer){
s = s.substr(0,dreamer);
flg=true;
}
if(5 == s.size() - erase){
s = s.substr(0,erase);
flg=true;
}
if(6 == s.size() - eraser){
s = s.substr(0,eraser);
flg=true;
}
}
if(s.size()==0){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
| 0 | 84,747,291 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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 ll;
using namespace std;
int main(void){
int x;cin>>x;
if(x<1200)cout<<"ABC"<<endl;
else cout<<"ARC"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,count=0;
cin >> n;
vector<ll>a(n);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.begin(),a.end());
if(n==2){
cout << a[1]-a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
vector<ll>x(n-1),y(n-1);
queue<ll>plus;
queue<ll>minus;
for(int i=0; i<n; i++){
if(a[i]>=0)plus.push(a[i]);
else minus.push(a[i]);
}
if(plus.size()==0){
for(int i=0; i<n-2; i++){
ll p = minus.front();
minus.pop();
minus.push(p);
}
ll minus1=minus.front();
minus.pop();
ll minus2=minus.front();
minus.pop();
plus.push(minus2-minus1);
x[count]=minus2;
y[count]=minus1;
count++;
}
if(minus.size()==0){
ll plus1=plus.front();
plus.pop();
ll plus2=plus.front();
plus.pop();
minus.push(plus1-plus2);
x[count]=plus1;
y[count]=plus2;
count++;
}
while(plus.size()>1){
ll P = plus.front();
ll M = minus.front();
plus.pop();
minus.pop();
minus.push(M-P);
x[count]=M;
y[count]=P;
count++;
}
while(minus.size()>0){
ll P = plus.front();
ll M = minus.front();
plus.pop();
minus.pop();
plus.push(P-M);
x[count]=P;
y[count]=M;
count++;
}
ll ans = plus.front();
cout << ans << endl;
for(int i=0; i<n-1; i++) cout << x[i] << " " << y[i] << endl;
return 0;
}
| 0 | 75,676,502 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const ll INF = 1ll << 60;
int main() {
int h, n, a, b;
cin >> h >> n;
vector<ll> dp(h + 1, INF);
dp[0] = 0;
rep(i, n) {
cin >> a >> b;
rep(j, h) dp[min(j + a, h)] = min(dp[min(j + a, h)], dp[j] + b);
}
cout << dp[h] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s1, s2; cin >>s1 >> s2;
int N=s1.size(), M = s2.size();
int dp[1010][1010];
for(int i=0; i<=N; i++){
for(int j=0; j<=M; j++){
if(i==0) dp[i][j]=j;
else if(j==0) dp[i][j]=i;
else dp[i][j]=100100;
}
}
for(int i=0; i<N; i++){
for(int j=0; j<M; j++){
if(s1.at(i)==s2.at(j)) dp[i+1][j+1]=min({dp[i+1][j]+1 ,dp[i][j+1]+1, dp[i][j]});
else dp[i+1][j+1] = min({dp[i+1][j],dp[i][j+1],dp[i][j]})+1;
}
}
cout << dp[N][M] << endl;
}
| 0 | 31,897,801 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) ll((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORD(i,a,b) for(int i=(a);i>=(b);--i)
const ll MOD = 1E9+7;
const ll INF = 1E18;
const double EPS = 1E-9;
const double PI = atan(1.0) * 4.0;
template<class T> T getbit(T s, int i) {return s>>i&1;}
template<class T> void flipbit(T& s, int i) {s^=(1LL<<i);}
constexpr int cntbit(ll x) {return __builtin_popcountll(x);}
constexpr int lg2(ll x) {return __lg(x);}
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
ll fpow(ll a,ll p){ll res=1LL;while(p){if(p&1LL) res=res*a%MOD;a=a*a%MOD;p>>=1LL;} return res;}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
ll res=0;
int n;cin>>n;
ll best=INF;
REP(i,n){
ll a,b;
cin>>a>>b;
res+=a;
if(a>b) best=min(best,b);
}
if(best==INF) exit(puts("0\n")*0);
cout<<res-best<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
void solve() {
int i,j,k,l,r,x,y; string s;
bool exit = false;
vector <int> cand;
x=0;
i=1;
int N;
cin>>N;
while(true){
x=(i+1)*i/2;
if(x<=100000){
cand.push_back(x);
}else{
break;
}
i++;
}
if(find(ALL(cand),N)==cand.end()){
cout<<"No"<<endl;
return;
}
cout<<"Yes"<<endl;
k=sqrt(N*2)+1;
cout<<k<<endl;
int table[k][k];
FOR(i,k){
FOR(j,k){
table[i][j]=-1;
}
}
int cnt=1;
FOR(i,k){
FOR(j,i){
table[i][j]=cnt;
table[j][i]=cnt;
cnt++;
}
}
FOR(i,k){
string ret="";
ret += to_string(k-1);
FOR(j,k){
if(i==j) continue;
ret += " ";
ret += to_string(table[i][j]);
}
cout<<ret<<endl;
}
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
| 0 | 7,282,824 |
#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;
}
map<long long int, int> prime_factorization(long long int a)
{
map<long long int, int>ans;
for (long long i = 2; i*i <= a; ++i) {
while (a%i == 0) {
ans[i]++;
a /= i;
}
}
if (a != 1)ans[a]++;
return ans;
}
long long int gcd(long long int x, long long int y){
if (x < y) swap(x,y);
while (y > 0){
long long int r = x % y;
x = y;
y = r;
}
return x;
}
int main()
{
int n;
cin >> n;
set<int> a;
rep(i, n){
int b;
cin >> b;
a.insert(b);
}
if (a.size() % 2 == 0){
cout << a.size() - 1 << endl;
} else {
cout << a.size() << endl;
}
return 0;
}
|
#include <iostream>
#include <numeric>
#include <algorithm>
using namespace std;
int main(){
int n;
while(cin >> n && n > 0){
int lst[n];
for(int i=0;i<n;i++){
cin >> lst[i];
}
int max;
max = lst[0];
for(int i=1;i<n;i++){
if(max < lst[i]){
max = lst[i];
}
}
int min;
min = lst[0];
for(int i=1;i<n;i++){
if(min > lst[i]){
min = lst[i];
}
}
cout << (accumulate(lst, lst+n, 0) - max - min)/(n-2) << endl;
}
return 0;
}
| 0 | 24,899,429 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define print(x) cout << #x << '=' << x << endl
int main()
{
long long a,b,c,d;
long long ans1,ans2,ans3,ans4;
cin >> a >> b >> c >> d;
ans1 = a*c;
ans2 = a*d;
ans3 = b*c;
ans4 = b*d;
cout << max(ans1 , max(ans2 , max(ans3,ans4))) << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
string str[10]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
int b=0,c=0;
for(int j=0;j<s.size();j++){
if(s[j]=='0'){
if(b){
cout<<str[b][c%str[b].size()];
}
b=0;
}else{
if(s[j]-'0'==b){
c++;
}else{
b=s[j]-'0';
c=0;
}
}
}
cout<<endl;
}
return 0;
}
| 0 | 51,066,969 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset ((a), 0 , sizeof(a))
#define set1(a) memset((a),-1,sizeof (a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl pair<long, long>
#define pll pair<long long, long long>
#define vll vector<long long>
#define vl vector<long>
#define vi vector<int>
#define vs vector<string>
#define vps vector< ps >
#define vpi vector< pi >
#define vpl vector< pl >
#define vpll vector< pll >
#define flash ios_base::sync_with_stdio(false); cin.tie(NULL);
#define tc(t,T) for(long long t=0;t<T;t++)
#define rep(i,s,n,d) for(long long i=s;i<n;i=i+d)
bool sortbysec(const pll &a,
const pll &b)
{
return (a.second < b.second);
}
void func(void)
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
}
ll gcd(ll a,ll b){
if(b==0)return a;
else return gcd(b,a%b);
}
void printStack(stack<string> s){
if(s.empty())return;
string x=s.top();
s.pop();
printStack(s);
cout<<x;
s.push(x);
}
ll binaryexp(ll n,ll p){
if(p==0) return 1;
if(p%2==0) return binaryexp((n%mod)*(n%mod),p/2);
else return ((n%mod)*binaryexp(((n%mod)*(n%mod))%mod,(p-1)/2)%mod);
}
#define meax 10000001
vll spf(meax,0);
void siv(){
spf[1]=1;
for(ll i=2;i<meax;i++)spf[i]=i;
for(ll i=4;i<meax;i+=2){
spf[i]=2;
}
for(ll i=3;i*i<meax;i++){
if(spf[i]==i){
for(ll j=i*i;j<meax;j+=i){
if(spf[j]==j){
spf[j]=i;
}
}
}
}
}
int main(){
ll k,n;
cin>>k>>n;
ll flag=1;
for(int i=0;i<=k;i++){
ll rest=n-i*10000;
if(rest>=0)
for(int j=0;j<=k-i;j++){
ll rest2=rest-j*5000;
if(rest2>=0){
if(rest2%1000==0){
if(rest2/1000<=k-j-i){
if(i+j+rest2/1000==k){
cout<<i<<" "<<j<<" "<<rest2/1000<<endl;
flag=0;
break;
}
}
}
}
}
if(flag==0)break;
}
if(flag==1){
cout<<"-1 -1 -1\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
#define ROF(i,a,b) for(ll i=a;i>=b;i--)
#define per(i,a) ROF(i,a,0)
const ll MOD=1000000007;
const ll MOD2=998244353;
const ld PI=acos(-1);
const ll INF=1e18;
st abc="abcdefghijklmnopqrstuvwxyz";
st ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge{ll to,cost;};
const ll MXN=200000;
vl G[MXN];
vl B(MXN,0),d(MXN,0),ans(MXN,0);
void bfs(ll x,ll p){
ans[x]=p;
B[x]=1;
rep(i,(ll)G[x].size()){
if(B[G[x][i]]==0){
bfs(G[x][i],p+d[G[x][i]]);
}
}
}
int main() {
ll N,Q;
cin >> N >> Q;
rep(i,N-1){
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i,Q){
ll p,x;
cin >> p >> x;
p--;
d[p]+=x;
}
bfs(0,d[0]);
rep(i,N){
cout << ans[i] << endl;
}
}
| 0 | 92,941,690 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = 1001002003004005006ll;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int q, h, s, d;
cin >> q >> h >> s >> d;
int n;
cin >> n;
q *= 4;
h *= 2;
mins(s, q);
mins(s, h);
if (n % 2 == 0) {
s *= 2;
mins(d, s);
cout << ll(n / 2) * d << endl;
}
else {
if (2 * s >= d) {
cout << ll((n - 1) / 2) * d + s << endl;
}
else {
cout << (ll)n * s << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-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;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
string s,t;cin>>s>>t;
vl a(26),b(26);
rep(i,s.size())a[s[i]-'a']++;
rep(i,t.size())b[t[i]-'a']++;
sort(all(a));
sort(all(b));
rep(i,26){
if(a[i] != b[i]){
out("No");
return 0;
}
}
out("Yes");
}
| 0 | 41,347,433 |
#include <bits/stdc++.h>
#define N 100010
using namespace std;
int main(){
int n,a[N],i,j,ansa,ansb;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
ansa=a[n-1];
for(i=n-2;i>=0;i--)
{
if(!i)
ansb=a[i];
if(min(a[i],a[n-1]-a[i])>=min(a[i-1],a[n-1]-a[i-1]))
{
ansb=a[i];
break;
}
}
cout<<ansa<<" "<<ansb<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T> inline bool chmin(T &x, const T &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T &x, const T &y) {if (x < y) {x = y; return 1;} return 0;}
struct IOSET {IOSET() {cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset;
int main() {
int n, k;
cin >> n >> k;
vector<int> t(n), d(n);
rep(i, n) {
cin >> t[i] >> d[i];
--t[i];
}
vector<int> nums(n);
rep(i, n) nums[i] = i;
sort(all(nums), [&](int x, int y) -> bool {return d[x] > d[y];});
ll sum = 0;
vector<int> cnt(n, 0);
vector<vector<int>> vec(n);
ll x = 0;
rep(i, k) {
sum += d[nums[i]];
if (!cnt[t[nums[i]]]) ++x;
++cnt[t[nums[i]]];
vec[t[nums[i]]].emplace_back(d[nums[i]]);
}
rep(i, n) sort(all(vec[i]));
vector<int> yobun;
rep(i, n) rep(j, (int)vec[i].size() - 1) yobun.emplace_back(vec[i][j]);
sort(all(yobun));
int now = 0;
ll ans = sum + x * x;
rep(i, k, n) {
if (now == yobun.size()) break;
if (cnt[t[nums[i]]]) continue;
++x;
++cnt[t[nums[i]]];
sum -= yobun[now];
sum += d[nums[i]];
++now;
chmax(ans, sum + x * x);
}
cout << ans << "\n";
}
| 0 | 42,224,523 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, suf = 0, pre = 0, mid = 0;
vector<long long> a;
int main() {
cin >> n >> k;
a.resize(n);
for (auto &p : a) cin >> p;
for (int i = k; i < n; ++i)
if (a[i] > 0) suf += a[i];
for (int i = 0; i < k; ++i) mid += a[i];
long long res = 0;
for (int i = k; i <= n; ++i) {
res = max({res, pre + mid + suf, pre + suf});
if (a[i - k] > 0) pre += a[i - k];
mid -= a[i - k];
if (i != n) {
mid += a[i];
if (a[i] > 0) suf -= a[i];
}
}
cout << res << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M;
while(cin >> N >> M && (N|M)) {
vector<pair<int, int> > vec;
int expect = 0;
for(int i=0; i<N; i++) {
int d, p;
cin >> d >> p;
vec.push_back(make_pair(p, d));
expect += d * p;
}
sort(vec.begin(), vec.end(), greater<pair<int, int> >());
for(int i=0; i<N; i++) {
expect -= vec[i].first * min(vec[i].second, M);
M -= vec[i].second;
if(M <= 0) break;
}
cout << expect << endl;
}
return 0;
}
| 0 | 47,487,382 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(),a.end()
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
const long long MOD = 1000000007, INF = 1e17;
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
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<typename T>vector<T>
make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}
template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
for(auto &e:t) fill_v(e,v);
}
void pv(vector<int>&v){
for(int i = 0;i<v.size();i++){
if(i)cout<<' ';
cout<<v[i];
}
cout<<endl;
}
signed main()
{
int N;
vector<int>ans;
while(cin>>N){
if(N==0)break;
int ma = -INF,mi = INF,sum = 0;
rep(i,0,N){
int t;
cin>>t;
chmin(mi,t);
chmax(ma,t);
sum+=t;
}
ans.push_back((sum-mi-ma)/(N-2));
}
for(auto e:ans){
cout<<e<<endl;
}
}
|
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a[ohara], b[ohara], c, d, tmp, m, h, w, x, y, sum, k, q;
priority_queue<P, vector<P>, greater<P>> que;
U_MAP mem;
ll decrease = LINF;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i] >> b[i];
rep(i, n) {
sum += a[i];
if (a[i] > b[i]) decrease = min(decrease, b[i]);
}
ans = sum - decrease;
ans = (decrease == LINF ? 0 : ans);
Cout(ans);
return 0;
}
| 0 | 94,594,517 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=s.size()-1;i>=1;i--){
if(i%2){
continue;
}
string t=s.substr(0,i/2);
if(t==s.substr(i/2,i/2)){
cout<<i<<endl;
break;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I1000000007 (1000000007)
#define I998244353 (998244353)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define yesno(cond) YESNO((cond), "Yes", "No")
#define YESNO(cond, a, b) cout << ((cond) ? (a) : (b)) << "\n"
template<class T> inline bool chmin(T& a, const T& b) {
if (a > b) { a = b; return true; } else return false;
}
template<class T> inline bool chmax(T& a, const T& b) {
if (a < b) { a = b; return true; } else return false;
}
namespace solver {
using namespace std;
using ll = long long;
int H, W, A, B;
void init() {
cin >> H >> W >> A >> B;
}
void solve() {
rep(i, H-B) {
rep(j, W-A) cout << 1;
rep(j, A) cout << 0;
cout << "\n";
}
rep(i, B) {
rep(j, W-A) cout << 0;
rep(j, A) cout << 1;
cout << "\n";
}
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solver::init();
solver::solve();
return 0;
}
| 0 | 84,181,299 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int a, b, c;
cin >>a >> b >> c;
bool ok = false;
if (a == 1) ok = true;
for (int i = 1; i < b; i++)
{
int p = i * a;
if (p % b == c) ok = true;
}
if (ok) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
void kaibun(string &S, string &ans) {
rep(i,S.size()/2) {
if (S.at(i) != S.at(S.size() - 1 - i)) {
ans = "No";
}
}
}
int main() {
string S;
cin >> S;
string ans = "Yes";
int N = S.size();
string bS = S.substr(0, (N - 1) / 2);
string eS = S.substr((N + 3) / 2 - 1);
kaibun(S, ans);
kaibun(bS, ans);
kaibun(eS, ans);
cout << ans << endl;
}
| 0 | 86,969,271 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i =0; i <(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N, M;
cin >> N >> M;
vector<P>A(N);
rep(i,N)cin >> A[i].first >> A[i].second;
sort(A.begin(),A.end());
ll ans = 0;
rep(i,N){
while(A[i].second){
ans += A[i].first;
A[i].second--;
M--;
if(M == 0){
cout << ans << endl;
return 0;
}
}
}
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
const int MAX_N = 1000010;
int id[MAX_N], sz[MAX_N];
void init(int n) {
REP(i,n) id[i] = i;
}
int root(int x) {
if (id[x] != x)
id[x] = root(id[x]);
return id[x];
}
bool same(int p, int q) {
return root(p) == root(q);
}
void unite(int p, int q) {
int i = root(p), j = root(q);
if (sz[i] < sz[j]) {
id[i] = j;
sz[j] += sz[i];
} else {
id[j] = i;
sz[i] += sz[j];
}
}
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, q, com, x, y;
cin >> n >> q;
init(n);
REP(i,q) {
cin >> com >> x >> y;
if (com == 0) unite(x, y);
else if (same(x, y)) cout << 1 << endl;
else cout << 0 << endl;
}
return 0;
}
| 0 | 57,811,614 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int count=3;
if(a==b){
count--;
}
if(a==c)
count--;
if(b==c)
count--;
if(count==0){
count=1;
}
cout<<count;
}
|
#include <iostream>
#include <vector>
#include <climits>
#include <set>
using namespace std;
static const int MAX = 50000;
int main()
{
int n, m;
set<int> coins;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
coins.insert(c);
}
vector<int> dp(MAX + 1, INT_MAX);
for (auto it = coins.begin(); it != coins.end(); ++it)
dp[*it] = 1;
for (int i = 1 ; i <= n; i++) {
for (auto it = coins.begin(); it != coins.end(); ++it) {
if (i - *it >= 1 && dp[i - *it] < INT_MAX) {
dp[i] = min(dp[i], dp[i - *it] + 1);
}
}
}
cout << dp[n] << endl;
return 0;
}
| 0 | 6,685,750 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
constexpr ll INF = 1LL << 62;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll H, W, N;
cin >> H >> W >> N;
unordered_map<ll, ll> m;
for (ll i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
a--; b--;
for (ll dh = -1; dh <= 1; dh++) {
for (ll dw = -1; dw <= 1; dw++) {
if (a + dh < 0 || a + dh > H - 1 || b + dw < 0 || b + dw > W - 1) {
continue;
}
m[(a + dh) * W + (b + dw)] += 1;
}
}
}
vector<ll> ans(10, 0);
ll non_zero = 0;
for (auto&& a : m) {
ll h = a.first / W;
ll w = a.first % W;
if (h <= 0 || h >= H - 1 || w <= 0 || w >= W - 1) {
continue;
}
ans[a.second] += 1;
non_zero += 1;
}
ans[0] = (H - 2) * (W - 2) - non_zero;
for (auto a : ans) {
cout << a << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end()
#define fi first
#define se second
#define foe(i,a,b) for(ll i=a;i<b;i++)
#define sz(s) s.size()
#define mem(a,s) memset(a,s,sizeof(a))
#define all(v) v.bi,v.ei
#define MAX 8000000000000000064LL
#define MIN -8000000000000000064LL
ll add(ll a, ll b){return (a%MOD + b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll sub(ll a, ll b){return (a%MOD - b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll mul(ll a, ll b){return ((a%MOD)*(b%MOD) + ((MAX)/MOD)*MOD)%MOD;}
bool isPrime(ll n)
{
if (n <= 1)
return false;
for (ll i = 2; i*i <= n; i++)
if (n % i == 0)
return false;
return true;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = mul(res,a);
a = mul(a,a);
b >>= 1;
}
return res%MOD;
}
bool compare(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.se>b.se);
}
ll lcm(ll a,ll b)
{
return(a*b)/__gcd(a,b);
}
ll fact[1000007]={0};
ll expo(ll x, ll y) {ll res=1;x=x%MOD;while(y>0){if(y&1)res=(1ll*res*x)%MOD;
y=y>>1;x=(1ll*x*x)%MOD;} return res;}
void facto() {fact[0]=1;fact[1]=1;for(ll i=2;i<1000007;i++)fact[i]=(fact[i-1]*i)%MOD;}
ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(expo(fact[r],MOD-2)))%MOD; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res;}
ll npr(ll n,ll r) {facto(); ll res=1; res=fact[n]; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res; }
int const N=2e5+9;
int const INF = 1e9+5;
void solve()
{
ll n;
cin>>n;
ll e=0,v=0,a,b;
foe(i,0,n-1)
{
cin>>a>>b;
if(a>b)swap(a,b);
e+=(a)*(n+1-b);
}
foe(i,1,n+1)
{
v+=(i)*(n+1-i);
}
cout<<v-e<<"\n";
}
int main()
{
fast
{
solve();
}
}
| 0 | 23,580,450 |
#include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
return num%mod;
}
}
double eps = .000000001;
int main ()
{
prep();
long long h, w, n;
cin >> h >> w >> n;
vector<pair<int, int> > v;
set<pair<int, int> > have;
for (int i=0; i<n; i++){
int x, y;
cin >> x >> y;
have.emplace(x, y);
v.emplace_back(x, y);
}
long long ones[10] = {0};
for (pair<int, int> p : v){
int x = p.first;
int y = p.second;
for (int i=x-2; i<x+1; i++){
for (int j=y-2; j<y+1; j++){
int cnt = 0;
for (int k=0; k<9; k++){
int newx = i+k/3;
int newy = j+k%3;
if (newx <= 0 || newy <= 0 || newx > h || newy > w){
cnt = 0;
break;
}
if (have.count({newx, newy})){
cnt++;
}
}
ones[cnt]++;
}
}
}
long long full = 0;
for (int i=1; i<=9; i++){
ones[i] /= i;
full += ones[i];
}
cout << (h-2)*(w-2)-full << '\n';
for (int i=1; i<=9; i++){
cout << ones[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
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 (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<P> vp;
vp.eb(s[0] - '0', 0);
rep(i, n) {
if (vp.back().fi == s[i] - '0') {
vp.back().se++;
} else {
vp.eb(s[i] - '0', 1);
}
}
int m = sz(vp);
int r = 0;
int now = 0;
int sm = 0;
int ans = 0;
for (int l = 0; l < m; ++l) {
while (now + (vp[r].fi == 0) <= k && r < m) {
now += (vp[r].fi == 0);
sm += vp[r].se;
r++;
}
chmax(ans, sm);
sm -= vp[l].se;
now -= (vp[l].fi == 0);
}
cout << ans << endl;
}
| 0 | 24,408,692 |
#include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
const int INF = 1e18, MOD = 998244353;
signed main() {
int n, cnt = 0, ans = 0, a;
cin>>n;
for (int i = 0; i < n; i++) {
cin>>a;
if (a == 0) ans += cnt / 2, cnt = 0;
else cnt += a;
}
ans += cnt / 2, cnt = 0;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<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; }
int main(){
ll H,W,D;
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);
}
ll Q;
cin >> Q;
vector<ll> L(Q),R(Q),S(H*W+2);
for(ll i=D;i<=H*W;i++){
S[i+1] = S[i+1-D] + abs(mp[i+1].first - mp[i+1-D].first) + abs(mp[i+1].second - mp[i+1-D].second);
}
rep(i,Q) cin >> L[i] >> R[i];
rep(i,Q){
cout << S[R[i]] - S[L[i]] << endl;
}
}
| 0 | 26,998,033 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll a, b, c, i, j, k, l, m, n, ans, tmp, hoge;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
if (a == 1 || b == 1)
cout << 1 << endl;
else
cout << (a * b + 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, f[105];
int main() {
scanf("%d", &n);
int mn = 1e9;
for(int i = 1; i <= n; i++) {
int x; scanf("%d", &x);
f[x]++;
mn = min(mn, x);
}
if(f[mn] > 2) {
printf("Impossible\n");
return 0;
}
int up = 2 * mn - (f[mn] == 2);
for(int i = mn + 1; i <= up; i++) {
if(f[i] < 2) {
printf("Impossible\n");
return 0;
}
}
for(int i = up + 1; i <= 100; i++) {
if(f[i] > 0) {
printf("Impossible\n");
return 0;
}
}
printf("Possible\n");
return 0;
}
| 0 | 4,047,664 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
ll x,y;
cin >> x >> y;
ll a = 0;
if(x > 0){
if(y <= -x){
a = - y - x + 1;
}
else if(y >= x){
a = y - x;
}
else if(y > 0 && y < x){
a = 2 - y + x;
}
else{
a = 1 + y + x;
}
}
else if(x < 0){
if(y < x){
a = 2 - y + x;
}
else if(y >= -x){
a = 1 + y + x;
}
else if(y > 0 && y < -x){
a = 1 - y - x;
}
else{
a =y - x;
}
}
else{
if(y >= 0){
a = y - x;
}
else{
a = -y - x + 1;
}
}
cout << a << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector < string > arr(n);
for (int i = 0; i < n; ++i)
cin >> arr[i];
for (int i = 0; i < n-1; ++i)
for (int j = n-1; j > i; --j) {
if (arr[j] < arr[j-1]) {
string temp;
temp = arr[j];
arr[j] = arr[j-1];
arr[j-1] = temp;
}
}
for (int i = 0; i < n ; ++i)
cout << arr[i];
return 0;
}
| 0 | 63,556,307 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
char C;
map<char, long> MA;
while (cin >> C) MA[C]++;
long ans = 1;
for (auto ma : MA) (ans *= (ma.second + 1)) %= 1000000007;
cout << ans - 1 << "\n";
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, _s, n) for(int i = _s, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
#define repi(itr, ds) for(auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for(T &x : vec) is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for(int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}\n ";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if(itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if(itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if(sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if(false)
#define dump(...)
#endif
typedef long long int ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, m;
cin >> n >> m;
auto x = vector<int>(n);
auto y = vector<int>(m);
REP(i, n) cin >> x[i];
REP(i, m) cin >> y[i];
ll sum_x = 0;
ll sum_y = 0;
REP(i, n - 1) {
ll left = i + 1;
ll right = n - left;
ll tmp = left * right;
tmp %= MOD;
tmp *= x[i + 1] - x[i];
tmp %= MOD;
sum_x += tmp;
sum_x %= MOD;
}
REP(i, m - 1) {
ll left = i + 1;
ll right = m - left;
ll tmp = left * right;
tmp %= MOD;
tmp *= y[i + 1] - y[i];
tmp %= MOD;
sum_y += tmp;
sum_y %= MOD;
}
ll ans = sum_x * sum_y % MOD;
cout << ans << endl;
}
| 0 | 100,595,577 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
const double PI = acos(-1);
const int MOD = 1e9+7;
const int MX = 2e5+5;
const ll INF = 1e18+5;
#define MP make_pair
#define PB push_back
#define fi first
#define se second
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define siii(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define sl(a) scanf("%lld", &a)
#define sll(a, b) scanf("%lld%lld", &a, &b)
#define slll(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
struct hash_pair {
template <class T1, class T2>
size_t operator()(const pair<T1, T2>& p) const
{
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b)
{
return (a/gcd(a, b)*b);
}
ll comb(ll a, ll b)
{
ll x = max(a-b, b), ans=1;
for(ll K=a, L=1; K>=x+1; K--, L++){
ans *= K;
ans /= L;
}
return ans;
}
int ara[100001];
vector<vi> edge(100001);
void task()
{
int n, m, x, y, ans=0;
cin >> n >> m;
for(int K=1; K<=n; K++) cin >> ara[K];
while(m--){
cin >> x >> y;
edge[x].PB(y);
edge[y].PB(x);
}
for(int K=1; K<=n; K++){
bool ok = 1;
for(int L=0; L<sz(edge[K]); L++){
if(K!=edge[K][L] && ara[edge[K][L]]>=ara[K]) ok = 0;
}
if(ok) ans++;
}
cout << ans << "\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
task();
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1e5+5;
int h,s[maxn];
int parent(int i)
{
return i/2;
}
int left(int i)
{
return i*2;
}
int right(int i)
{
return i*2+1;
}
int main()
{
scanf("%d",&h);
for(int i=1;i<=h;i++){
scanf("%d",&s[i]);
}
for(int i=1;i<=h;i++){
cout<<"node "<<i<<": key = "<<s[i]<<", ";
if(parent(i)>=1){
cout<<"parent key = "<<s[parent(i)]<<", ";
}
if(left(i)<=h){
cout<<"left key = "<<s[left(i)]<<", ";
}
if(right(i)<=h){
cout<<"right key = "<<s[right(i)]<<", ";
}
cout<<endl;
}
return 0;
}
| 0 | 12,309,182 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
rep(i, N + 1) cin >> A[i];
ll num = 1;
vector<ll> lim(N + 1);
rep(i, N + 1) {
lim[i] = num;
num -= A[i];
if(i != N && num <= 0) {
cout << -1 << endl;
return 0;
}
num = min(num * 2, LINF);
}
ll cnt = 0;
ll ans = 0;
for(int i = N; i >= 0; i--) {
if(cnt > (lim[i] - A[i]) * 2) {
cout << -1 << endl;
return 0;
}
if(cnt > lim[i] - A[i]) {
cnt = lim[i] - A[i];
}
cnt += A[i];
ans += cnt;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <numeric>
#include <algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int m[4][3][10]={};
for(int i=0;i<n;++i){
int b,f,r,v;
cin>>b>>f>>r>>v;
b=b-1;
f=f-1;
r=r-1;
m[b][f][r]+=v;
}
for(int i=0;i<4;++i){
for(int j=0;j<3;++j){
for(int k=0;k<10;++k){
cout<<" "<<m[i][j][k];
}
cout<<endl;
}
if(i!=3){
cout<<"####################"<<endl;
}
}
return 0;
}
| 0 | 83,609,845 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#define Y second
#ifdef tmd
#define IOS()
#define debug(...) fprintf(stderr,"#%d: %s = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
template<typename It> ostream& _printRng(ostream &os,It bg,It ed)
{
os<<"{";
for(It it=bg;it!=ed;it++) {
os<<(it==bg?"":",")<<*it;
}
os<<"}";
return os;
}
template<typename T> ostream &operator << (ostream &os,vector<T> &v){return _printRng(os,v.begin(), v.end());}
template<typename T> void pary(T bg, T ed){_printRng(cerr,bg,ed);cerr<<endl;}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(...)
#define pary(...)
#endif
const int MAXN = 100005;
const ll MOD = 1000000007;
int n, a[MAXN], b[MAXN];
int res[MAXN], lim[MAXN];
int main () {
IOS();
cin >> n;
int bst = 0;
memset(lim, 0x3f, sizeof(lim));
REP (i, n) {
cin >> a[i];
if (a[i] > bst) {
res[i] = a[i];
bst = a[i];
} else {
lim[i] = bst;
}
}
pary(res, res+n);
bst = 0;
REP (i, n) {
cin >> b[i];
}
for (int i=n-1; i>=0; i--) {
if (b[i] > bst) {
if (res[i] == 0 || res[i] == b[i]) {
res[i] = b[i];
bst = b[i];
} else {
cout << 0 << endl;
return 0;
}
} else {
lim[i] = min(lim[i], bst);
}
}
pary(res, res+n);
pary(lim, lim+n);
ll ans = 1;
REP (i, n) {
if (res[i] == 0) {
ans = ans * lim[i] % MOD;
} else if (res[i] > lim[i]) {
ans = 0;
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max((x),(y))
#define mins(x,y) x=min((x),(y))
#define show(x) cout<<#x<<" = "<<(x)<<endl;
#define all(a) ((a).begin()),((a).end())
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define bit(n) (1LL<<(n))
typedef long long ll;
typedef __int128_t lll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>using P=pair<T,Y>;
template<class T,class Y>ostream& operator<<(ostream&o,P<T,Y>&p){return o<<"("<<p.fi<<","<<p.se<<")";}
template<class T>ostream& operator<<(ostream&o,V<T>&v){for(T&t:v)o<<t<<",";return o;}
template<class T>void uniq(V<T>&v){sort(all(v));v.erase(unique(all(v)), v.end());}
template<class A,size_t N,class T>void Fill(A(&a)[N],const T&v){fill((T*)a,(T*)(a+N),v);}
const int MOD = 1e9+7;
lll gcd(lll a,lll b,lll&x,lll&y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m=MOD){lll x,y;gcd(a,m,x,y);return(x%m+m)%m;}
ll modPow(lll a,lll n,ll m=MOD){lll p=1;for(;n;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return p;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int N = 10000;
string s;
int n, p, c[N], x, t=1;
ll ans;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> p >> s;
if(p==2 || p==5){
FOR(i, 0, n) if((s[i]-'0')%p==0) ans += i+1;
cout << ans << endl;
return 0;
}
c[0] = 1;
FORR(i, n-1, 0){
x = (x+t*(s[i]-'0'))%p;
ans += c[x]++;
t = t*10%p;
}
cout << ans << endl;
}
| 0 | 61,084,560 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main()
{
ll n;
cin>>n;
ll ans=n+2;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ll t=i+n/i-2;
ans=min(ans,t);
}
}
cout<<ans;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(bit)
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b; return 1;} return 0;}
const long double pi = acos(-1.0);
const int MAX = 1000010;
const int INF = 1LL << 60;
const int MOD = 1000000007;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string a, b;
cin >> a >> b;
int n = a.size();
int m = b.size();
rep(i,n+m) {
if (i % 2 == 0) cout << a[i/2];
else cout << b[i/2];
}
cout << endl;
return 0;
}
| 0 | 44,235,821 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int a, b;
int main(){
cin >> a >> b;
if(a < b){
rep(i, b){
cout << a;
}
cout << endl;
}
else{
rep(i, a){
cout << b;
}
cout << endl;
}
}
|
#include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[3] = " \n";
int i, j, k, l, m, n;
double PI = acos(-1);
class Dice{
int t;
public:
int s[6];
Dice() {
rep(i,6) cin >> s[i];
}
void N() { t=s[0], s[0]=s[1], s[1]=s[5], s[5]=s[4], s[4]=t; }
void S() { t=s[0], s[0]=s[4], s[4]=s[5], s[5]=s[1], s[1]=t; }
void E() { t=s[0], s[0]=s[3], s[3]=s[5], s[5]=s[2], s[2]=t; }
void W() { t=s[0], s[0]=s[2], s[2]=s[5], s[5]=s[3], s[3]=t; }
};
int pat[7][5] = {
{1, 2, 4, 3, 1},
{0, 3, 5, 2, 0},
{0, 1, 5, 4, 0},
{0, 4, 5, 1, 0},
{0, 2, 5, 3, 0},
{2, 1, 3, 4, 2}
};
int d[6];
int idx(int x) {
int i;
rep(i,6) if (d[i]==x) return i;
exit(255);
}
int main() {
rep(i,6) cin >> d[i];
cin >> n;
rep(i,n) {
int a, b;
cin >> a >> b;
a = idx(a), b = idx(b);
rep(j,4) if (pat[a][j] == b) {
cout << d[pat[a][j+1]] << endl;
}
}
return 0;
}
| 0 | 52,498,345 |
#include <iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
for(int i=n;i>0;i/=10){
sum+=i%10;
}
if(n%sum)
cout<<"No";
else
cout<<"Yes";
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int N;
int cnt[101];
int main(){
cin>>N;
for(int i=2;i<=N;i++){
int x=i;
for(int j=2;j<=i;j++){
if(x%j==0){
x/=j;
cnt[j]++;
j--;
}
}
}
int c3=0,c5=0,c15=0,c25=0,c75=0;
repn(i,N){
if(cnt[i]>=74) c75++;
else if(cnt[i]>=24) c25++;
else if(cnt[i]>=14) c15++;
else if(cnt[i]>=4) c5++;
else if(cnt[i]>=2) c3++;
}
int ans=0;
ans+=(c5+c15+c25+c75)*(c5+c15+c25+c75-1)/2*(c3+c5+c15+c25+c75-2);
ans+=(c25+c75)*(c3+c5+c15+c25+c75-1);
ans+=(c15+c25+c75)*(c5+c15+c25+c75-1);
ans+=c75;
cout<<ans<<endl;
}
| 0 | 17,200,838 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#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) {
Int n, m;
cin >> n >> m;
Int a, b;
vector<Int> h(n);
vector<Int> max_h(n);
vector<bool> check(n, true);
for (Int i = 0; i < n; ++i) {
cin >> h[i];
max_h[i] = h[i];
}
vector<vector<Int> > table(n);
for (Int i = 0; i < m; ++i) {
cin >> a >> b;
--a; --b;
if (h[a] == h[b]) {
check[a] = false;
check[b] = false;
} else if (h[a] < h[b]) {
check[a] = false;
max_h[a] = max_h[b];
} else {
check[b] = false;
max_h[b] = max_h[a];
}
}
Int true_cnt = 0;
for (Int i = 0; i < n; ++i) {
if (check[i]) {
true_cnt++;
}
}
cout << true_cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll int
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str;
ll k;
cin>>k>>n;
a=n;
ll v[k+1];
ll w[(k+1)*(k+1)];
rep(i,k+1){
v[i]=i;
}
map<ll,ll> ma;
rep(i,k+1){
rep(j,k+1){
ma[i+j]++;
}
}
map<ll,ll> mp;
rep(j,k+1){
rep(i,k*2+1){
mp[i+j]+=ma[i];
}}
cout<<mp[a]<<endl;
return 0;
}
| 0 | 97,057,233 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long x,y;
cin>>x>>y;
long long z=abs(x-y);
if(z>=2)cout<<"Alice";
else cout<<"Brown";
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int H, W, D; cin >> H >> W >> D;
vector<pair<int, int> > A(H*W, pair<int, int>());
REP(i, H){
REP(j, W){
int tmp; cin >> tmp; tmp--;
A[tmp] = {i+1, j+1};
}
}
vector<int> AA(H*W, 0);
REP(i, D){
for(int j = i; j < H*W; j += D){
if(j >= D){
AA[j] = AA[j-D] + abs(A[j].first-A[j-D].first)+abs(A[j].second-A[j-D].second);
}
}
}
int Q; cin >> Q;
vector<int> L(Q);
vector<int> R(Q);
REP(i, Q){
cin >> L[i] >> R[i]; L[i]--; R[i]--;
}
REP(i, Q){
cout << AA[R[i]] - AA[L[i]] << endl;
}
}
| 0 | 39,696,517 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll int
#define mod 1000000007
map<string, int> m;
int main()
{
FAST;
ll n;
cin >> n;
ll x;
cin >> x;
ll a[n+4]; ll b[n+6];
for(ll i = 0; i < n; i++){
cin >> a[i];
b[i] = abs(x - a[i]);
}
sort(b, b + n);
ll m = b[0];
for(ll i = 1; i < n; i++){
m = __gcd(m, b[i]);
}
cout << m;
return 0;
}
|
#include<stdio.h>
int main ()
{
for(int i=1;i<10;i++){
for(int z=1;z<10;z++){
printf("%dx%d=%d\n", i, z, i*z);
}}
getchar();return 0;
}
| 0 | 17,388,035 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i =a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define PI 3.14159265359
int main(){
string s, t;
cin >> s;
cin >> t;
sort(all(s));
sort(rall(t));
if( s < t){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
|
#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> >;
void change(string& s) {
vector<Int> v(26, 0);
for (Int i = 0; i < (Int)s.length(); ++i) {
v[s[i] - 'a']++;
}
s = "";
for (Int i = 0; i < 26; ++i) {
for (Int j = 0; j < v[i]; ++j) {
s += ('a' + i);
}
}
return;
}
int main(void) {
Int n;
cin >> n;
vector<string> s(n);
for (Int i = 0; i < n; ++i) {
cin >> s[i];
change(s[i]);
}
sort(s.begin(), s.end());
Int result = 0;
Int start = 0;
Int end = 0;
for (Int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
end++;
} else {
result += ((end - start) * (end - start + 1) / 2);
start = i;
end = i;
}
}
result += ((end - start) * (end - start + 1) / 2);
cout << result << endl;
return 0;
}
| 0 | 44,327,370 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,m,i,ans;
cin >> n >> m;
if(n*2<=m){
ans=n;
m=m-n*2;
ans+=m/4;
}else{
ans=m/2;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
cout.tie(0);
#define FOR(i,l,r) for(ll i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(ll i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define SORT(name) sort(name.begin(), name.end())
#define RSORT(name)\
SORT(name);\
reverse(all(name));
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';}
inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';}
template <class T> inline void print(T x){ cout << x << '\n';}
template<typename T1,typename T2> inline void chmin(T1 &a, T2 b){ if(a > b) a = b; }
template<typename T1,typename T2> inline void chmax(T1 &a, T2 b){ if(a < b) a = b; }
const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const double DINF = std::numeric_limits<double>::infinity();
#pragma endregion
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# define DBG(fmt, ...)
#endif
const int MOD = 1000000007;
const int MAX_N = 100010;
int H, W, M;
map<int, int> row, col;
set<pii> exist;
signed main() {
IOS;
cin >> H >> W >> M;
int max_h = 0, max_w = 0;
REP(i, M) {
int h, w;
cin >> h >> w;
row[h]++;
col[w]++;
exist.insert(mp(h, w));
chmax(max_h, row[h]);
chmax(max_w, col[w]);
}
V<> row_v, col_v;
for(auto b : row) {
if(b.second == max_h) {
row_v.pb(b.first);
}
}
for(auto c : col) {
if(c.second == max_w) {
col_v.pb(c.first);
}
}
int ans = max_h + max_w - 1;
REP(i, row_v.size()) {
REP(j, col_v.size()) {
auto it = exist.find(mp(row_v[i], col_v[j]));
if(it == exist.end()) {
print(max_h + max_w);
return 0;
}
}
}
print(ans);
return 0;
}
| 0 | 19,949,749 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll A,B;
cin >>A>>B;
if(A<=8 && B<=8){
cout<<"Yay!"<<endl;
}else{
cout<<":("<<endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
int main(void)
{
int q;
cin>>q;
while (q --) {
ll a,b;
cin>>a>>b;
ll n = a * b;
if (a > b)
swap(a,b);
ll sq = 0;
for (ll k = 1ll << 30;k;k /= 2)
if ((n - 1) / (sq + k) / (sq + k) >= 1)
sq += k;
ll ans;
if (a >= b - 1)
ans = 2 * (a - 1);
else
if (sq * (sq + 1) >= n)
ans = 2 * sq - 2;
else
ans = 2 * sq - 1;
cout << ans << '\n';
}
return 0;
}
| 0 | 37,668,378 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.