code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<int,int> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
int main() {
int N;cin >> N;
vector<int> retu(N);
int ans = 0;
for(int i = 0;i<N;i++) cin >> retu.at(i);
for(int i = 0;i<N-1;i++){
if(retu.at(i) == retu.at(i+1)){
retu.at(i+1) = 114514;
ans++;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> cnt(1e5+1, 0);
rep(i, m) {
int a, b;
cin >> a >> b;
++cnt[a], ++cnt[b];
}
rep(i, 1e5+1) {
if (cnt[i]&1) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 78,917,052
|
#include <bits/stdc++.h>
using namespace std;
int main () {
long N, K;
cin >> N >> K;
vector<pair<long, long>> data(N);
vector<long> x(N), y(N);
for(int i = 0; i < N; i++){
cin >> data.at(i).first >> data.at(i).second;
x.at(i) = data.at(i).first;
y.at(i) = data.at(i).second;
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
long ans = ((long)1000000000 * 2) * ((long)1000000000 * 2) + 1;
long count;
for(int i = 0; i < N; i++){
for(int j = i + 1; j < N; j++){
if(x.at(i) == x.at(j))continue;
for(int k = 0; k < N; k++){
for(int l = k + 1; l < N; l++){
if(y.at(k) == y.at(l))continue;
count = 0;
for(int m = 0; m < N; m++){
if(x.at(i) <= data.at(m).first && x.at(j) >= data.at(m).first){
if(y.at(k) <= data.at(m).second && y.at(l) >= data.at(m).second){
count++;
}
}
if(count >= K)ans = min(ans, (x.at(j) - x.at(i)) * (y.at(l) - y.at(k)) );
}
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
string s, t;
cin >> s;
rep (i, 0, s.size()) {
if (s[i] == 'x') continue;
t += s[i];
}
rep (i, 0, t.size()) {
if (t[i] != t[t.size() - 1 - i]) {
cout << -1 << "\n";
return 0;
}
}
int nl = 0, nr = s.size() - 1;
int ans = 0;
while (nl < nr) {
int cntl = 0, cntr = 0;
while (s[nl] == 'x') {
nl++;
cntl++;
}
while (s[nr] == 'x') {
nr--;
cntr++;
}
nl++, nr--;
ans += abs (cntr - cntl);
}
cout << ans << "\n";
}
| 0
| 35,325,497
|
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
#define yes cout<<"Yes"<<'\n';
#define no cout<<"No"<<'\n';
using namespace std;
int main()
{
godspeed
ll i,j,k,l,n,b;
string s;
cin>>n>>b;
cout<<n*n-b<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <numeric>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = n-1; i >= 0; --i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define all(vec) (vec).begin(),(vec).end()
#define debug(vec) for(auto v : vec) cout << v << " "; cout << endl;
#define debug2D(vec2D) for(auto vec : vec2D) { for (auto v : vec) cout << v << " "; cout << endl; }
#define debugP(vec) for(auto v : vec) cout << "(" << v.first << "," << v.second << ") "; cout << endl;
#define debug2DP(vec2D) for(auto vec : vec2D) { for (auto v : vec) cout << "(" << v.first << "," << v.second << ") "; cout << endl; }
typedef long long ll;
constexpr ll INF = 1000000000;
constexpr ll MOD = 1000000007;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; }
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<int> digit(20,0);
ll ans = 0;
int r = 0;
rep(l, n) {
while (r < l) r++;
bool ok = true;
if (r < n) rep(i,20) if (a[r] >> i & 1 && digit[i] >= 1) ok = false;
while (r < n && ok) {
rep(i, 20) if (a[r] >> i & 1) digit[i]++;
r++;
if (r < n) rep(i, 20) if (a[r] >> i & 1 && digit[i] >= 1) ok = false;
}
ans += (r-l);
rep(i, 20) if (a[l] >> i & 1) digit[i]--;
}
cout << ans << endl;
}
| 0
| 9,099,799
|
#include <bits/stdc++.h>
using namespace std;
using lint = int64_t;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(v) begin(v), end(v)
#define in []{lint n; cin>>n; return n;}()
int main(){
int N = in;
vector<int> A(N);
rep( i, N ) A[i] = in;
int M = INT_MIN;
rep( i, N ) M = max( M, A[i] );
int R = INT_MIN;
rep( i, N ) if( A[i] != M && abs(M/2-A[i]) < abs(M/2-R) ) R = A[i];
cout << M << " " << R << "\n";
}
|
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll inf = 1LL << 60;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N, L, Q;
cin >> N;
vector<ll> x(N+1);
x[N] = inf;
Rep (i, N) cin >> x[i];
cin >> L >> Q;
vector<ll> a(Q), b(Q);
Rep (i, Q) {
cin >> a[i] >> b[i];
a[i]--; b[i]--;
}
vector<vector<ll>> dpi(20, vector<ll>(N, 0)), dpd(20, vector<ll>(N, 0));
Rep (i, N) {
dpi[0][i] = upper_bound(x.begin(), x.end(), x[i]+L) - x.begin() - 1;
}
Rep (i, 19) {
Rep (j, N) {
dpi[i+1][j] = dpi[i][dpi[i][j]];
}
}
Rep (i, Q) {
if (a[i] > b[i]) swap(a[i], b[i]);
ll day = 0;
for (ll j = 19; j >= 0; j--) {
if (dpi[j][a[i]] < b[i]) {
a[i] = dpi[j][a[i]];
day += 1 << j;
}
}
cout << day + 1 << "\n";
}
}
| 0
| 22,390,685
|
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323;
long long int N,D,A,X[200100]={},H[205500],res=0,sum=0;
string S[100200],T;
long double va,vb;
pll pl[200040];
priority_queue<pll,vector<pll>,greater<pll>> pq;
int main()
{
cout << fixed << setprecision(18);
cin>>N>>D>>A;
for(long long int i = 0; i < N; i++){
cin>>X[i]>>H[i];
pq.push({X[i],(H[i]+A-1)/A});
}
long long int bomb=0;
while(!pq.empty()){
pll tmp=pq.top();
pq.pop();
if(tmp.second>=0&&bomb>=tmp.second){
continue;
}
if(tmp.second<0){
bomb+=tmp.second;
continue;
}
res+=tmp.second-bomb;
pq.push({tmp.first+2*D+1,-(tmp.second-bomb)});
bomb=tmp.second;
}
cout<<res<<endl;
}
|
#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;
int main() {
ios::sync_with_stdio(false);
int m, k, z[270000] = {};
cin >> m >> k;
if (k >= (1 << m)) {cout << -1; return 0;}
if (m == 1) {
if (k == 0) cout << "0 0 1 1";
else cout << -1;
return 0;
}
for (int i = 0; i < (1 << m); i++) if (i != k) cout << i << ' ';
cout << k << ' ';
for (int i = (1 << m) - 1; i >= 0; i--) if (i != k) cout << i << ' ';
cout << k;
}
| 0
| 31,563,808
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x,y) sort(x,x+y)
#define REV(a,b) reverse(a,a+b)
#define VSRT(x) sort(x.begin(),x.end())
#define VREV(x) reverse(x.begin(),x.end())
int main()
{
_SAD()
int a,b;
cin>>a>>b;
a--;
b--;
cout<<a*b<<nl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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,a,b,c;
cin >> n >> a >> b >> c;
vector<int> l(n);
rep(i,n) cin >> l[i];
int m = (1<<n)-1;
vector<pair<ll,ll>> ls(m);
ls[0].first = 1e9;
rep(x,m){
rep(i,n){
if((x&(1<<i))>0){
ls[x].first += l[i];
ls[x].second++;
}
}
}
ll ans = 1e9;
rep(i,m){
if(ls[i].second>a) continue;
rep(j,m){
if((i&j)>0) continue;
if(ls[j].second>b) continue;
rep(k,m){
if((i&k)>0 || (j&k)>0) continue;
if(ls[k].second>c) continue;
ll temp = abs(ls[i].first-a) + 10*(ls[i].second-1)
+ abs(ls[j].first-b) + 10*(ls[j].second-1)
+ abs(ls[k].first-c) + 10*(ls[k].second-1);
ans = min(ans,temp);
}
}
}
cout << ans << endl;
}
| 0
| 7,792,763
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long N;
main()
{
cin>>N;
vector<long>d;
for(long i=1;i*i<=N;i++)
{
if(N%i==0)
{
d.push_back(i);
if(N/i!=i)d.push_back(N/i);
}
}
long ans=0;
for(int i=0;i<d.size();i++)
{
long M=d[i];
if(M==1)continue;
M--;
if(N/M==N%M)ans+=M;
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
void printRect(int w, int h)
{
while (h-- > 0)
{
for (int x = 0; x < w; x++)
{
cout << '#';
}
cout << endl;
}
}
int main(void)
{
while (1)
{
int h, w;
cin >> h >> w;
if (h == 0 && w == 0)
break;
printRect(w, h);
cout << endl;
}
return 0;
}
| 0
| 1,570,337
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b) {if (a < b){a = b;return true;}return false;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll s; cin>>s;
ll v = 1000000000;
ll x = (v - s % v) % v;
ll y = (s+x)/v;
cout<<"0 0 1000000000 1 "<<x<<' '<<y<<endl;
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#define ll long long int
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
using namespace std;
int mx4[] = {0,1,0,-1};
int my4[] = {1,0,-1,0};
int mx2[] = {1,0};
int my2[] = {0,1};
class ARotation {
public:
void solve(istream& in, ostream& out) {
char c[2][3];
rep(i,2) rep(j,3) in >> c[i][j];
bool ok = true;
rep(i,2) rep(j,3) {
if(c[i][j] == c[1-i][2-j]) continue;
else ok = false;
}
if(ok) out << "YES" << endl;
else out << "NO" << endl;
}
};
int main() {
ARotation solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0
| 5,534,797
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000
#define MOD 10000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
ll conv(int a) {
return a / 2 * (a -1);
}
int main(int argc, char const *argv[]) {
int k,s; cin >> k >> s;
ll ans = 0;
REP(i,k + 1) {
REP(j,k + 1) {
if (s - i - j >= 0 && s - j - i <= k)
ans++;
}
}
cout << ans << endl;
return 0;
}
|
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
void bfs(int v, vi &dist, vector<vi> &graph)
{
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++)
{
for (auto u : graph[q[i]])
{
if (dist[u] == -1)
{
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
ll log10(ll x)
{
if (x < 10) re 1;
re 1 + log10(x / 10);
}
ll sqr(ll x)
{
return x * x;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vll x(n + 1);
cin >> x[0];
forn(i, n) cin >> x[i + 1];
sort(all(x));
ll g = x[1] - x[0];
forn(i, n) g = __gcd(g, x[i + 1] - x[i]);
cout << g;
}
| 0
| 93,884,275
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int a[N],b[N],c[N];
int main()
{
int n,ans=0;scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+n+1);
for(int i=1;i<=n;i++)a[i]=lower_bound(b+1,b+n+1,a[i])-b;
for(int i=1;i<=n;i++)c[a[i]]=i;
for(int i=1;i<=n;i++)if(abs(c[i]-i)%2)ans++;
cout<<ans/2<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
string s;
cin>>s;
int n=s.size();
ll arr[n+1]={0};
for(int i=0;i<n;i++)
{
if(s[i]=='<')
{
arr[i+1]=arr[i]+1;
}
}
for(int i=n-1;i>=0;i--)
{
if(s[i]=='>')
{
arr[i]=max(arr[i+1]+1,arr[i]);
}
}
ll ans=0;
for(int i=0;i<n+1;i++)
{
ans+=arr[i];
}
cout<<ans<<endl;
}
| 0
| 29,331,523
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
#include <queue>
#define _PI (3.141592653589793)
int main()
{
std::string S, T;
std::cin >> S >> T;
T.resize(T.size() - 1);
if (T == S) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int> pq;
rep(i, n) {
int a;
cin >> a;
pq.push(a);
}
while (m > 0) {
int p = pq.top();
pq.pop();
pq.push(p / 2);
m--;
}
ll ans = 0;
while (!pq.empty()) {
ans += pq.top();
pq.pop();
}
cout << ans << endl;
return 0;
}
| 0
| 66,948,008
|
#include<iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
int main()
{
int N;
cin >>N;
vector<string> strlist;
string str;
cin >> str;
strlist.push_back(str);
for (int i = 0; i < N - 1; i++)
{
cin >> str;
for (int n = 0; n < strlist.size(); n++)
{
if (strlist[n] == str)
{
cout << "No" << endl;
return 0;
}
}
if (strlist[strlist.size() - 1][strlist[strlist.size() - 1].size() - 1] != str[0])
{
cout << "No" << endl;
return 0;
}
strlist.push_back(str);
}
cout << "Yes"<< endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void)
{
int n;
int ans[100]={0};
int kari;
while(cin>>n)
ans[n]++;
kari=ans[0];
for(int i=1;i<99;i++)
{
if(kari<ans[i])
kari=ans[i];
}
for (int i=0; i<100; i++)
{
if(kari==ans[i])
cout<<i<<endl;
}
return 0;
}
| 0
| 39,459,302
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES"<<endl;
#define Yes cout<<"Yes"<<endl;
#define NO cout<<"NO"<<endl;
#define No cout<<"No"<<endl;
#define yes cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a,a+n);
#define sr() sort(a,a+n,greater<ll>());
#define v() sort(v.begin(),v.end());
#define vr() sort(v.begin(),v.end(),greater<ll>());
#define mod 1000000007
#define fast() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll gcd(ll a, ll b){if(!b)return a;return gcd(b, a % b);}
ll power(ll x,ll y,ll p){ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
int main() {
fast();
{
ll n,ans=0;
map<ll,ll>a;
cin>>n;
for(int i=0;i<n;i++)
{
ll x;
cin>>x;
a[x]++;
}
for(auto t:a)
{
if(t.fi!=t.se)
{
if(t.se>t.fi)
{
ans+=(t.se-t.fi);
}
else
{
ans+=t.se;
}
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string S;
string T;
cin >> S >> T;
vector<string> ress = {};
bool flg = false;
for (int i = 0; i < S.size(); i++) {
if (i + T.size() > S.size()) break;
string S2 = S;
bool is_match = true;
for (int j = 0; j < T.size(); j++) {
if (S.at(i + j) == T.at(j) || S.at(i + j) == '?') {
S2.at(i + j) = T.at(j);
} else {
is_match = false;
break;
}
}
if (is_match) {
for (int i = 0; i < S.size(); i++) {
if (S2.at(i) == '?') S2.at(i) = 'a';
}
ress.push_back(S2);
}
}
if (ress.size() == 0) {
cout << "UNRESTORABLE" << endl;
} else {
sort(ress.begin(), ress.end());
cout << ress[0] << endl;
}
}
| 0
| 40,023,926
|
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth == 0)
{
ret.push_back(s);
return ret;
}
for (ll i = 0; i < symbol.size(); i++)
{
auto vec = dfs(s + symbol[i], depth - 1, symbol);
for (auto &&e : vec)
{
ret.push_back(e);
}
}
return ret;
}
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
enum Tenki
{
Sunny,
Cloudy,
Rainy
};
int main()
{
char a, b;
cin >> a >> b;
bool honest = true;
if (a == 'H' && b == 'D') {
honest = false;
}
if (a == 'D' && b == 'H') {
honest = false;
}
if (honest) {
cout << "H" << endl;
} else {
cout << "D" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
const ll MOD = 1000000007LL;
int main(){
string s;
cin >> s;
vector<char> c;
int f = 0;
ll ans = 0;
rep(i, s.size()){
if(i == 0) {
c.push_back(s[i]);
continue;
}
if(f < 0) {
c.push_back(s[i]);
f++;
continue;
}
if(s[i] != c[f]){
ans += 2;
c.pop_back();
f--;
}else{
c.push_back(s[i]);
f++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 43,543,079
|
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC return 0;
using namespace std;
int freq[10005], n, p, p10(1), curr;
long long res;
string s;
int main() {
DAU
cin >> n >> p >> s;
if (p == 2 || p == 5) {
for (int i = 0; i < n; ++i)
if ((s[i] - '0') % p == 0)
res += i + 1;
cout << res;
PLEC
}
reverse(s.begin(), s.end());
freq[0] = 1;
for (const char& ch : s) {
curr = (curr + p10 * (ch - '0')) % p;
res += freq[curr];
++freq[curr];
p10 = (10 * p10) % p;
}
cout << res;
PLEC
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
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; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
string ans="";
rep(i,3){
cin>>s;
ans+=toupper(s[0]);
}
cout<<ans<<"\n";
}
| 0
| 98,496,056
|
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int a,b,num = 0;
cin >> a >> b;
for(int i = 0; a <= b; i++) {
bool flag = 0;
string s = to_string(a);
int n = s.size();
for(int j = 0; j < double(n/2); j++) {
if(s[j] == s[n-1-j])
flag = 1;
else {
flag = 0;
break;
}
}
if(flag) num++;
a++;
}
cout << num << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
int min_ai = INT_MAX;
for (int i = 0; i < A; i++)
{
cin >> a.at(i);
min_ai = min(min_ai, a.at(i));
}
vector<int> b(B);
int min_bi = INT_MAX;
for (int i = 0; i < B; i++)
{
cin >> b.at(i);
min_bi = min(min_bi, b.at(i));
}
int res = min_ai + min_bi;
int xi, yi, ci;
for (int i = 0; i < M; i++)
{
cin >> xi >> yi >> ci;
xi--;
yi--;
res = min(res, a.at(xi) + b.at(yi) - ci);
}
cout << res << endl;
}
| 0
| 6,543,760
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
while(n--){
string mcxi1, mcxi2;
cin >> mcxi1 >> mcxi2;
int dec1 = 0, dec2 = 0;
int mlp = 1;
for(int i = 0; i < mcxi1.size(); i++){
if('0' <= mcxi1[i] && mcxi1[i] <= '9') mlp = (mcxi1[i] - '0');
else {
switch(mcxi1[i]){
case 'm': dec1 += mlp * 1000; break;
case 'c': dec1 += mlp * 100; break;
case 'x': dec1 += mlp * 10; break;
case 'i': dec1 += mlp; break;
}
mlp = 1;
}
}
mlp = 1;
for(int i = 0; i < mcxi2.size(); i++){
if('0' <= mcxi2[i] && mcxi2[i] <= '9') mlp = (mcxi2[i] - '0');
else {
switch(mcxi2[i]){
case 'm': dec2 += mlp * 1000; break;
case 'c': dec2 += mlp * 100; break;
case 'x': dec2 += mlp * 10; break;
case 'i': dec2 += mlp; break;
}
mlp = 1;
}
}
int add = dec1 + dec2;
string tani = "mcxi";
int idx = 0;
for(int i = 1000; i > 0; i /= 10){
if(add / i > 1) cout << add / i << tani[idx];
else if(add / i == 1) cout << tani[idx];
add %= i;
idx++;
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, __VA_ARGS__)
#else
# define DBG(fmt, ...)
#endif
#define MOD 1000000007
#define INF 1000000000
#define MAX_N 100010
ll N, M;
ll X[MAX_N] = {};
ll Y[MAX_N] = {};
int main()
{
cin >> N >> M;
REP(i, N) { cin >> X[i]; }
REP(i, M) { cin >> Y[i]; }
ll ans_x = 0, ans_y = 0;
REP(i, N) {
ans_x = (ans_x + (X[i] * i)) % MOD;
ans_x = (ans_x - (X[i] * (N - 1 - i)) + MOD) % MOD;
}
REP(i, M) {
ans_y = (ans_y + (Y[i] * i)) % MOD;
ans_y = (ans_y - (Y[i] * (M - 1 - i)) + MOD) % MOD;
}
printf("%lld\n", (ans_x * ans_y) % MOD);
return 0;
}
| 0
| 15,699,286
|
#include<cstdio>
#include<cstring>
using namespace std;
char s[102];
int a[101];
int main(){
scanf("%s",s+1);
int n=strlen(s+1),k;
scanf("%d",&k);
for(int i=1,o=1;i<=n;i++){
if(s[i]!=s[i+1]){
a[++a[0]]=i-o+1;
o=i+1;
}
}
long long ans=0;
if(s[1]==s[n]){
if(a[0]==1)ans=1ll*n*k/2;
else{
for(int i=2;i<a[0];i++)
ans+=1ll*a[i]/2*k;
ans+=a[1]/2+a[a[0]]/2;
ans+=1ll*(a[1]+a[a[0]])/2*(k-1);
}
}
else for(int i=1;i<=a[0];i++)
ans+=1ll*a[i]/2*k;
printf("%lld\n",ans);
}
|
#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 compareg(Pi a, Pi b) {
if(a.second != b.second){
return a.second > b.second;
}else{
return a.first > b.first;
}
}
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() {
char b;
char ans;
cin>>b;
if(b == 'A'){
ans = 'T';
}else if(b == 'C'){
ans = 'G';
}else if(b == 'G'){
ans = 'C';
}else {
ans = 'A';
}
cout<<ans<<endl;
return 0;
}
| 0
| 83,324,220
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define mp make_pair
int BS(vector<int> &v, int low, int high, int k){
while(low<=high){
int mid=(low+high)/2;
if(v[mid]==k) return mid;
else if(v[mid]>k) high=mid-1;
else low=mid+1;
}
return -1;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int k,n;
cin >> k >> n;
vector<int> v;
for(int i=0;i<n;i++){
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(),v.end());
if(n==0){
cout << k;
return 0;
}
int i=0;
int ans;
while(1){
int x=BS(v,0,n-1,k-i);
int y=BS(v,0,n-1,k+i);
if(x==-1){
ans=k-i;
break;
}
if(y==-1){
ans=k+i;
break;
}
i++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
template< typename T >
vector< T > dijkstra(WeightedGraph< T > &g, int s) {
const auto INF = numeric_limits< T >::max();
vector< T > dist(g.size(), INF);
using Pi = pair< T, int >;
priority_queue< Pi, vector< Pi >, greater< Pi > > que;
dist[s] = 0;
que.emplace(dist[s], s);
while(!que.empty()) {
T cost;
int idx;
tie(cost, idx) = que.top();
que.pop();
if(dist[idx] < cost) continue;
for(auto &e : g[idx]) {
auto next_cost = cost + e.cost;
if(dist[e.to] <= next_cost) continue;
dist[e.to] = next_cost;
que.emplace(dist[e.to], e.to);
}
}
return dist;
}
int main() {
int n;
cin >> n;
WeightedGraph<ll> G(n);
rep (i, n-1) {
ll a, b, c;
cin >> a >> b >> c;
--a; --b;
G[a].emplace_back(b, c);
G[b].emplace_back(a, c);
}
int q, k;
cin >> q >> k;
auto dist = dijkstra(G, k-1);
rep (i, q) {
int a, b;
cin >> a >> b;
cout << dist[--a] + dist[--b] << endl;
}
}
| 0
| 46,888,838
|
#include <bits/stdc++.h>
#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 pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
int main() {
ll N;
cin>>N;
ll a[N];
rep(i,N) cin>>a[i];
ll ans=a[0];
rep(i,N){
ans=lcm(ans,a[i]);
}
cout<<ans<<endl;
}
|
#include <stdio.h>
int main() {
int n;
int x[1000];
int y;
int h, i, j, k;
int di, an;
for(;;){
scanf("%d", &n);
if(n == 0) break;
else{
for(h = 1; h < n + 1; h++){
scanf("%d", &x[h]);
}
for(i = 2; i < n + 1; i++){
j = i - 1;
while(j > 0 && x[j] > x[j+1]){
y = x[j+1];
x[j+1] = x[j];
x[j] = y;
j = j - 1;
}
}
an = 1000000;
for(k = 1; k < n; k++){
di = x[k+1] - x[k];
if(an > di) an = di;
}
printf("%d\n", an);
}
}
return 0;
}
| 0
| 56,470,692
|
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int n, m, a, b, c, _end;
int x[10][10];
int bfs(int p, int a) {
int s[10], minx = 114514, sum;
sum = 0;
memset(s, 127, sizeof(s));
s[a] = 0;
for (int l = 0; l < p; l++) {
for (int o = 0; o < p; o++) {
if (s[o] < 114514) {
for (int q = 0; q < p; q++) {
if (x[o][q] < 114514) {
s[q] = min(s[q], s[o] + x[o][q]);
}
}
}
}
}
for (int l = 0; l < p; l++) {
sum += s[l];
}
minx = min(minx, sum);
return minx;
}
int search(int p) {
int t[10], maxn = 114514, maxid;
for (int k = 0; k < p; k++) {
t[k] = bfs(p, k);
}
for (int k = 0; k < p; k++) {
if (maxn > t[k]) {
maxn = t[k];
maxid = k;
}
}
return maxn * 100 + maxid;
}
void _cin() {
memset(x, 51, sizeof(x));
n = 0;
_end = 0;
cin >> m;
if (m == 0) { _end = 1; return; }
for (int i = 0; i < m; i++) {
cin >> a >> b >> c;
n = max(n, max(a, b));
x[a][b] = c;
x[b][a] = c;
}
n += 1;
}
int main() {
while (true) {
_cin();
if (_end == 1) { break; }
cout << search(n) % 100 << ' ' << search(n) / 100 << endl;
}
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string S, ans = "None", alp = "abcdefghijklmnopqrstuvwxyz";
bool found = true;
cin >> S;
vector<int> a(26);
for(char i : S){
a[i - 'a']++;
}
for(int j; j < 26; j++){
if(a[j] == 0){
cout << alp[j] << endl;
found = false;
break;
}
}
if(found) cout << ans << endl;
}
| 0
| 45,631,429
|
#include <bits/stdc++.h>
using namespace std;
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define LL long long
#define mp make_pair
#define pb push_back
LL max(LL a, LL b) { return (a > b ? a : b); }
#define K 600001
int n, k;
LL a[K], s[K];
LL b[K];
int main() {
scanf("%d%d", &n, &k);
FOE(i, 1, n) scanf("%lld", &a[i]);
FOE(i, 1, n) s[i] = s[i - 1] + a[i];
FOE(i, 1, n) b[i] = b[i - 1] + max(0, a[i]);
LL ret = s[n];
FOE(i, 1, n - k + 1) {
LL s1 = s[i + k - 1] - s[i - 1];
LL s2 = b[i - 1];
LL s3 = b[n] - b[i + k - 1];
ret = max(ret, max(s1, 0) + s2 + s3);
}
printf("%lld\n", ret);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Debug
istream &operator>>(istream &is, P &a)
{
return is >> a.first >> a.second;
}
ostream &operator<<(ostream &os, const P &a) { return os << "(" << a.first << "," << a.second << ")"; }
template <typename T>
void view(const std::vector<T> &v)
{
for (const auto &e : v)
{
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T>
void view(const std::vector<std::vector<T>> &vv)
{
for (const auto &v : vv)
{
view(v);
}
}
#pragma endregion
int parseTime(string s)
{
int res = 0;
res += (s[0] - '0') * 10 * 3600;
res += (s[1] - '0') * 3600;
res += (s[3] - '0') * 600;
res += (s[4] - '0') * 60;
res += (s[6] - '0') * 10;
res += s[7] - '0';
return res;
}
const int TMAX = 24 * 60 * 60;
int c[TMAX + 1];
int main()
{
int n;
while (cin >> n, n)
{
memset(c, 0, sizeof(c));
rep(i, n)
{
string s;
cin >> s;
int t = parseTime(s);
c[t]++;
cin >> s;
t = parseTime(s);
c[t]--;
}
int ans = 0;
int now = 0;
rep(i, TMAX + 1)
{
now = now + c[i];
ans = max(ans, now);
}
cout << ans << endl;
}
return 0;
}
| 0
| 4,339,799
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
map<int,int> m;
vector<ll> d;
rep(i,n){
int a;
cin >> a;
m[a]++;
if(m[a]==2)d.push_back(a);
if(m[a]==4)d.push_back(a);
}
ll ans = 0;
if(d.size()>=2){
sort(d.rbegin(),d.rend());
ans = d[0]*d[1];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int x, y;
cin >> x >> y;
int ans = 0;
if (x >= 0) {
if (abs(x) > abs(y)) {
ans++;
x = -x;
}
}
else {
if (abs(x) < abs(y)) {
ans++;
x = -x;
}
}
if (abs(x) < abs(y)) {
ans += abs(y) - abs(x);
if (y < 0) ans++;
}
else if (abs(x) > abs(y)) {
ans += abs(x) - abs(y);
if (y > 0) ans++;
}
else {
if (x != y) ans++;
}
cout << ans << '\n';
return 0;
}
| 0
| 89,219,762
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <iomanip>
using namespace std;
#define int long long
signed main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,m; cin >> n >> m;
vector<string> a(n),b(m);
for(int i = 0;i < n;i ++) cin >> a.at(i);
for(int i = 0;i < m;i ++) cin >> b.at(i);
for(int i = 0;i < n-m+1;i ++){
for(int j = 0;j < n-m+1;j ++){
int hantei = 1;
for(int k = 0;k < m;k ++){
for(int l = 0;l < m;l ++){
if(b.at(k).at(l) != a.at(i+k).at(j+l)) hantei = 0;
}
}
if(hantei == 1){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (ll i = (ll)(start); i < (ll)(n); ++i)
static const ll INFTY = 1L << 62L;
ll solver(string S, ll K)
{
ll ans = 0, tmp = 0;
bool flag = true;
rep(i, 0, S.size() - 1)
{
if (S[i] != S[i + 1])
{
flag = false;
break;
}
}
if (flag)
ans = S.size() * K / 2;
else
{
ll front = 0, back = S.size() - 1, cnt = 0;
if (S.front() == S.back())
{
rep(i, 1, S.size())
{
if (S.front() != S[i])
{
front = i;
break;
}
}
for (int i = S.size() - 2; i >= 0; --i)
{
++cnt;
if (S.back() != S[i])
{
back = i;
break;
}
}
ans = (front + cnt) / 2 * (K - 1);
rep(i, 0, front)
{
if (S[i] == S[i + 1])
{
++ans;
++i;
}
}
rep(i, back + 1, S.size())
{
if (S[i] == S[i + 1])
{
++ans;
++i;
}
}
}
rep(i, front, back)
{
if (S[i] == S[i + 1])
{
++tmp;
++i;
}
}
ans += tmp * K;
}
return ans;
}
int main()
{
string S;
ll K;
cin >> S >> K;
cout << solver(S, K) << endl;
}
| 0
| 82,713,772
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main() {
int n;
cin>>n;
int a,b,l=0,ans=MOD;
for(int i=0;i<n;i++){
cin>>a>>b;
l+=a;
if(a>b)ans=min(ans,b);
}
if(ans==MOD)cout<<0;
else cout<<l-ans;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=a;i>b;i--)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define INF 9000000000000000000
#define MOD 1000000007
#define PAI 3.14159265358979
using namespace std;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
signed main() {
cout << fixed << setprecision(14);
int n,k;
cin >> n >> k;
if(k==gcd(n,k)) cout << -1 << endl;
else cout << n << endl;
return 0;
}
| 0
| 22,061,519
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int h, w; cin >> h >> w;
vector<string> s(h), res(h * 2);
for (int i = 0; i < h; i++) cin >> s[i];
for (int i = 0; i < 2 * h; i++) {
res[i] = s[i / 2];
}
for (int i = 0; i < 2 * h; i++) cout << res[i] << '\n';
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
string s;
int m, h;
while (true) {
cin >> s;
if (s == "-") break;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h;
string sub = s.substr(0, h);
s.erase(0, h);
s += sub;
}
cout << s << endl;
}
}
| 0
| 37,535,896
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define int ll
signed main ()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
double now;
cin >> now;
now /= 3.0;
cout << fixed << setprecision(10) << now*now*now << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;
signed main(){
int n;
while(cin>>n,n){
string s="";
REP(i,n){
string t;
cin>>t;
s+=t;
}
int ans=0;
if(s.size()<=2)cout<<0<<endl;
else{
REP(i,s.size()-3){
string t=s.substr(i,2);
string u=s.substr(i+2,2);
if((t=="lu"&&u=="ru")||(t=="ru"&&u=="lu"))ans++;
if((t=="ld"&&u=="rd")||(t=="rd"&&u=="ld"))ans++;
}
cout<<ans<<endl;
}
}
return 0;
}
| 0
| 85,063,131
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,l) for(lli i=s;i<l;i++)
#define DEBUG 0
#define INF (1LL<<50)
#define MOD 1000000007
signed main(){
lli n,k;
cin>>n>>k;
vector<lli> a(n);
REP(i,0,n)cin>>a[i];
vector<lli> data(n+1,0);
data[0] = max(0LL,a[0]);
REP(i,1,n)data[i] = data[i-1] + max(0LL,a[i]);
data[n] = data[n-1];
lli sum = 0;
REP(i,0,k)sum += a[i];
lli ans = -INF;
ans = max(ans,max(sum,0LL)+ data[n-1]-data[k-1]);
for(lli i=k;i<n;i++){
sum += a[i];
sum -= a[i-k];
ans = max(ans,max(sum,0LL) + data[n-1] - data[i] + data[i-k]);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (int i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(v) for (int i = 0; i < v.size(); i++)
#define SORT(i,v) sort(v.begin(), v.end())
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e7;
const ll MOD = INF + 7;
ull ans[10];
map<pair<int, int>, int> mp;
int main()
{
int h, w, n;
cin>>h>>w>>n;
ans[0] = (ull)(h-2) * (w-2);
REP(i,n) {
int a, b;
cin>>a>>b;
FOR(dx,-1,2) {
FOR(dy,-1,2) {
if (a+dx<2 || a+dx>h-1 || b+dy<2 || b+dy>w-1)
continue;
pair<int, int> tmpp = {a+dx,b+dy};
if (mp.find(tmpp) == mp.end()) {
mp[tmpp] = 1;
ans[0]--;
} else {
mp[tmpp]++;
}
}
}
}
for (auto itr : mp) {
ans[itr.second]++;
}
REP(i,10) {
cout<<ans[i]<<endl;
}
return 0;
}
| 0
| 82,486,384
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 10000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int N;
string S;
int main() {
cin >> S;
int bNum=0;
N = S.size();
rep(i, N) {
if (S.at(i) == '1')bNum++;
}
int ans = min(bNum, N - bNum);
cout << ans * 2 << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void){
string s;
cin >> s;
for(int i =0;i!=s.size();i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2<<endl;
return 0;
}
if(s[i]==s[i+2]){
cout<< i+1 << " "<< i+3 << endl;
return 0 ;
}
}
cout << "-1 -1" << endl;
return 0;
}
| 0
| 7,724,915
|
#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <numeric>
#include <vector>
#include <iterator>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <cmath>
#include <stack>
#include <cctype>
#include <bitset>
#define double long double
#define int long long int
#define ll int
#define ibs ios_base::sync_with_stdio(false)
#define cti cin.tie(0)
#define bp __builtin_popcount
#define pb push_back
#define res(v) v.resize(unique(v.begin(), v.end()) - v.begin());
#define cnt_res(v) std::distance(v.begin(),std::unique(v.begin(), v.end()));
#define timer cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using pii = std::pair<int,int>;
using vpii = std::vector<pii>;
using vvpii = std::vector<vpii>;
#define mp make_pair
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define per(i,b,a) for (int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
using namespace std;
const int N=2e6+10;
const int inf = 1e18+10;
const int M = 1e9+7 ;
const double Pi = 3.14159265;
#define F first
#define S second
int n,x,y;vi a[N];
int mul(int x,int y){
return ((x%M)*(y%M))%M;
}
int add(int x,int y){
return ((x%M)+(y%M))%M;
}
pii dfs(int u,int p=0){
pii dpu={1,1};
for(auto i:a[u])
if(i!=p)
{
pii dpi=dfs(i,u);
dpu.F=mul(dpu.F,dpi.S);
dpu.S=mul(dpu.S,add(dpi.F,dpi.S));
}
return dpu;
}
void solve(){
cin>>n;
rep(i,0,n-2){
cin>>x>>y;
a[x].pb(y);
a[y].pb(x);
}
auto z=dfs(1);
cout<<add(z.F,z.S);
}
int32_t main()
{
ibs;cti;
solve()
;
int xx=0;
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 (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using namespace std;
ll merge_cnt(vector<int> &a)
{
int n = a.size();
if (n <= 1)
{
return 0;
}
ll cnt = 0;
vector<int> b(a.begin(), a.begin() + n / 2);
vector<int> c(a.begin() + n / 2, a.end());
cnt += merge_cnt(b);
cnt += merge_cnt(c);
int ai = 0, bi = 0, ci = 0;
while (ai < n)
{
if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci]))
{
a[ai++] = b[bi++];
}
else
{
cnt += n / 2 - bi;
a[ai++] = c[ci++];
}
}
return cnt;
}
int main(int argc, char const *argv[])
{
int n;
cin >> n;
vector<int> a(n);
vector<int> v(n);
rep(i, n)
{
cin >> v[i];
}
auto w = v;
sort(ALL(v));
map<int, int> mp;
rep(i, n) mp[v[i]] = i;
int ans = 0;
rep(i, n)
{
a[i] = mp[w[i]];
if ((i % 2) != (a[i] % 2))
ans++;
}
cout << ans / 2 << endl;
return 0;
}
| 0
| 71,500,785
|
#include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using usize = std::size_t;
i32 a[200000];
auto main() -> i32 {
i32 n, k;
scanf("%d%d", &n, &k);
for (i32 i = 0; i < n; i += 1) {
scanf("%d", a + i);
}
i32 b[200001];
for (i32 step = 0; step < std::min(64, k); step += 1) {
std::fill(b, b + n + 1, 0);
for (i32 i = 0; i < n; i += 1) {
b[std::max(0, i - a[i])] += 1;
b[std::min(n, i + a[i] + 1)] -= 1;
}
a[0] = b[0];
for (i32 i = 1; i < n; i += 1) {
b[i] += b[i - 1];
a[i] = b[i];
}
}
for (i32 i = 0; i < n; i += 1) {
printf("%d%c", a[i], i == n - 1 ? '\n' : ' ');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll i = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll i = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for(ll i = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for(ll i = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
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;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
void co(void){cout << '\n';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); co();}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); co();}
template <typename T>
void ce(const T n){cerr << n << endl;}
void sonic(){ios::sync_with_stdio(false); cin.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
constexpr int INF = 1e9+1;
constexpr ll LINF = 1e18+1;
constexpr ll MOD = 1e9+7;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);
int main(void){
ll n;
cin >> n;
ll ans = 0;
for (ll i = 1; i * i < n; ++i){
if (n % i == 0 && i < n / i - 1) ans += n / i - 1;
}
co(ans);
return 0;
}
| 0
| 27,691,909
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long int;
using ui64 = unsigned long long int;
int main()
{
const int day = 24 * 60 * 60;
vector<int> imos;
int n;
while(cin >> n,n){
imos.assign(day + 1, 0);
for(int i=0;i<n;i++){
string s,t;
cin >> s >> t;
int ts = stoi(s.substr(0,2)) * 60 * 60 + stoi(s.substr(3,2)) * 60 + stoi(s.substr(6,2));
int tt = stoi(t.substr(0,2)) * 60 * 60 + stoi(t.substr(3,2)) * 60 + stoi(t.substr(6,2));
imos[ts]++;imos[tt]--;
}
for(int i=0;i<day;i++){
imos[i+1] += imos[i];
}
int res = 1;
for(int i=0;i<day+1;i++){
res = max(res,imos[i]);
}
cout << res << endl;
}
}
|
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
ll Max(ll(a), ll(b), ll(c)) {
return max(max(a, b), c);
}
ll Min(ll(a), ll(b), ll(c)) {
return min(min(a, b), c);
}
int main() {
ll N;
cin >> N;
vector<ll> A(N);
bool check = true;
rep(i, N) {
cin >> A[i];
if (A[i] > N - 1)check = false;
}
ll an = 0;
while (check==false) {
check = true;
ll S = 0;
rep(i, N) {
S += A[i] / N;
}
an += S;
rep(i, N) {
A[i] += (S - A[i] / N) - (A[i] / N) * N;
if (A[i] > N - 1)check = false;
}
}
cout << an << endl;
}
| 0
| 72,061,054
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
ll x, a, b; cin >> x >> a >> b;
if(b <= a) cout << "delicious" << endl;
else if(b <= a+x) cout << "safe" << endl;
else cout << "dangerous" << endl;
}
|
#include <bits/stdc++.h>
#include <ext/rope>
#define VALHALLA cin.tie(0);ios_base::sync_with_stdio(false);cout<<fixed<<setprecision(13);cerr<<fixed<<setprecision(5);
#define endl "\n"
#define pb push_back
#define all(v) v.begin(),v.end()
#define debug(x) std::cerr << #x << ": " << (x) << '\n';
#define sz(x) (int)x.size()
#define fast(map_name) map_name.reserve(1024);map_name.max_load_factor(0.25);
using namespace std;
using namespace __gnu_cxx;
typedef long long int ll;
typedef pair<int,int> ii;
typedef complex<double> point;
const double epsilon=1e-9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod=1e9+7;
int globe[int(1e6)];
double dot(point a,point b){ return (conj(a)*b).real() ; }
double cross(point a,point b){ return (conj(a)*b).imag() ; }
double dist(point a, point b){ return abs(a-b); }
struct neal {
static uint64_t splitmix64(uint64_t x)
{
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const
{
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct HASH{
size_t operator()(const pair<int,int>&x)const{
return (size_t) x.first * 37U + (size_t) x.second;
}
};
bool isprime(ll n) {
if (n == 2 || n == 3) return true;
if (n < 2 || n % 2 == 0 || n % 3 == 0) return false;
for (ll i = 6; (i - 1) * (i - 1) <= n; i += 6) {
if (n % (i - 1) == 0 || n % (i + 1) == 0) {
return false;
}
}
return true;
}
inline ll exp(ll a, ll b, ll mod) {
ll n = 1;
ll p = a;
while (b > 0) {
if (b % 2 == 1) {
n *= p;
n %= mod;
}
p *= p;
p %= mod;
b /= 2;
}
return n;
}
inline bool comp(double a,double b)
{
return (fabs(a-b)<epsilon);
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v; u = v; v = r;
}
return u;
}
int main()
{
VALHALLA
int cnt=0;
string s;cin>>s;
for(int i=0;i+1<sz(s);++i)
{
if(s[i]!=s[i+1])
cnt++;
}
cout<<cnt<<endl;
}
| 0
| 37,133,880
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, ll> mp;
rep(i, 0, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto m : mp) {
ll x = m.second;
x--;
ans += (x * (x + 1)) / 2;
}
cout << ans << endl;
}
|
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <vector>
#include <stack>
#include <queue>
#include <utility>
#include <algorithm>
#include <string>
#include <bitset>
using namespace std;
#define THR 200
#define OTH 195
int main(void)
{
int n;
cin >> n;
int y[n], m[n], d[n];
for (int i = 0; i < n; i++)
cin >> y[i] >> m[i] >> d[i];
for (int i = 0; i < n; i++) {
int date;
int ninet = 0;
int twe = 0;
if (y[i]%3 == 0) {
date = 21 - d[i];
twe = 10 - m[i];
}
else {
if (m[i]%2 == 0) {
date = 20 - d[i];
int tmp = (10-m[i])/2;
twe = tmp;
ninet = tmp;
}
else {
date = 20 - d[i];
int tmp = (10-m[i])/2;
twe = 10-m[i]-tmp;
ninet = tmp;
}
}
twe *= 20;
ninet *= 19;
int year = 0;
for (int j = y[i]+1; j < 1000; j++) {
if (j%3 == 0)
year += THR;
else
year += OTH;
}
cout << year+twe+ninet+date << endl;
}
return 0;
}
| 0
| 8,416,893
|
#include<iostream>
#include<string.h>
using namespace std;
int main(){
string str;
int h,m,l;
while(cin >> str){
if( str == "-")break;
cin >> m;
l = str.size();
for (int i = 0 ; i < m ; i++){
cin >> h;
string left = str.substr(0,h);
string right = str.substr(h, l);
str = right + left;
}
cout << str << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s[n] = {};
for ( int i = 0 ; i < n ; i++ ) cin >> s[i];
for ( int i = 0 ; i < 26 ; i++ ) {
char a = i + 'a';
int b = 0 , c = 0;
for ( int j = 0 ; j < n ; j++ ) {
b = 0;
for ( int k = 0 ; k < s[j].length() ; k++ ) {
if ( s[j][k] == a ) b++;
}
if( j == 0 ) c = b;
c = min( b , c );
}
for ( int j = 0 ; j < c ; j++ ) cout << a;
}
}
| 0
| 36,388,967
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N, M;
cin>>N>>M;
vector<vector<int> > edge(N);
int a, b;
for(int i=0;i<M;++i) {
cin>>a>>b;
a--;
b--;
edge[a].push_back(b);
edge[b].push_back(a);
}
vector<int> arr(N);
for(int i=0;i<N;++i) arr[i] = i;
bool can;
bool tmpcan;
int ans = 0;
do {
if(arr[0]!=0) continue;
can = true;
for(int i=0;i<N-1;++i) {
tmpcan = false;
for(int j=0;j<edge[arr[i]].size();++j) {
if(edge[arr[i]][j]==arr[i+1]) tmpcan = true;
}
if(!tmpcan) can = false;
}
if(can) {
ans++;
}
}while(next_permutation(arr.begin(), arr.end()));
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<pair<string,ll> > svp;
#define spc ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair
#define GCD(x,y) __gcd(x,y)
#define PI 2*acos(0.0);
#define lb lower_bound
#define bs binary_search
#define all(x) x.begin(),x.end()
#define LCM(x,y) ((x*y)/__gcd(x,y))
#define btpc __builtin_popcountll
#define sp(x) cout<<fixed<<setprecision(x)
const long long cs=2e5+5;
const long long inf=1e18;
const long long mod=1e9+7;
char s[cs],s1[cs];
void solve()
{
ll t,n,m,a,b,d,e,i,j,k,x,y,z,cnt=0,cnt1=0,cnt2=0;
bool flag = false;
char c;
cin>>c;
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u')
cout<<"vowel"<<endl;
else {
cout<<"consonant"<<endl;
}
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
return 0;
}
| 0
| 7,291,349
|
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define INF (1 << 30) - 1
#define LLINF (1LL << 61) - 1
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,k;
cin>>a>>b>>k;
rep(i,k){
if(i%2==0){
if(a%2==1) a--;
a/=2;
b+=a;
}
else{
if(b%2==1) b--;
b/=2;
a+=b;
}
}
cout<<a<<" "<<b<<endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static const int MAX = 10000;
int solve_coin_changing1(vector<int> coins, int target) {
vector<vector<int>> com = {{0}};
com.push_back(coins);
bool data[50000] = {false};
for (int n = 2; n <= 10000; n++) {
vector<int> b;
cout << n << endl;
for (int i = 1; i <= n / 2; i++) {
for (int j = 0; j < com[i].size(); j++) {
for (int k = j; k < com[n - i].size(); k++) {
int val = com[i][j] + com[n - i][k];
if (val == target) {
return n;
}
if (!data[val]) {
b.push_back(val);
data[val] = true;
}
}
}
}
cout << b.size() << endl;
com.push_back(b);
}
return -1;
}
int solve_coin_changing2(vector<int> coins, int target) {
int need_ncoin[50001];
sort(coins.begin(), coins.end());
auto cp = coins.begin();
for (int i = 1; i <= target; i++) {
if (*cp == i) {
need_ncoin[i] = 1;
cp++;
continue;
}
int minimum = 50000;
for (int j = 1; j <= i / 2; j++) {
int ncoin = need_ncoin[i - j] + need_ncoin[j];
minimum = min(minimum, ncoin);
if (ncoin == 2)
break;
}
need_ncoin[i] = minimum;
}
return need_ncoin[target];
}
#define T_NMAX 50000
#define NCOIN_MAX 20
int solve_coin_changing(vector<int> coins, int target) {
sort(coins.begin(), coins.end());
int need_ncoin[T_NMAX + 1];
for (int j = 0; j <= target; j++) {
need_ncoin[j] = j;
}
for (int i = 1; i < coins.size(); i++) {
for (int j = 1; j <= target; j++) {
int not_use_i = need_ncoin[j];
int use_i = (j-coins[i] >= 0) ? need_ncoin[j - coins[i]] + 1 : T_NMAX;
need_ncoin[j] = min(use_i, not_use_i);
}
}
return need_ncoin[target];
}
int main() {
int ncoin, target;
cin >> target >> ncoin;
vector<int> coins;
for (int i = 0; i < ncoin; i++) {
int val;
cin >> val;
coins.push_back(val);
}
cout << solve_coin_changing(coins, target) << endl;
}
| 0
| 55,095,770
|
#include<bits/stdc++.h>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define all(x) x.begin(),x.end()
#define puts(x) cout << x << "\n"
using namespace std;
int x, y, z, k, a[1234], b[1234], c[1234];
priority_queue<int, vector<int>, greater<int>> pq;
vector<int>v, ans;
signed main() {
cin >> x >> y >> z >> k;
for1(i, x)cin >> a[i];
for1(j, y)cin >> b[j];
for1(l, z)cin >> c[l];
for1(j, y)for1(l, z) {
pq.push(b[j] + c[l]);
if (pq.size() > k)pq.pop();
}
while (pq.size()) {
v.push_back(pq.top());
pq.pop();
}
for (int vp : v)for1(i, x) {
pq.push(vp + a[i]);
if (pq.size() > k)pq.pop();
}
while (pq.size()) {
ans.push_back(pq.top());
pq.pop();
}
sort(all(ans), greater<int>());
for0(i, k)puts(ans[i]);
}
|
#include<iostream>
using namespace std;
int main(){
int count[100];
int b;
int ans[100];
int ans2[100];
int ans3;
ans3 = 0;
for(int i=0;i<100;i++){
ans[i] = 0;
ans2[i] = 0;
count[i] = 0;
}
while(cin>>b) count[b-1]++;
for(int i=0;i<100;i++){
if(ans[ans3]<count[i]){
ans[i] = count[i];
ans2[i] = i + 1;
ans3 = i;
for(int k=0;k<100;k++) if(k!=i) ans2[k] = 0;
}
else if(ans[ans3]==count[i]&&ans3!=0) ans2[i] = i + 1;
}
for(int i=0;i<100;i++) if(ans2[i]!=0) cout << ans2[i] << endl;
return 0;
}
| 0
| 42,820,651
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
for (;;) {
int n; cin >> n;
if (n == 0) break;
vector<string> f(n);
for (int i = 0; i < n; i++) cin >> f[i];
int cnt = 0;
for (int i = 0; i + 1 < n; i++)
if (f[i][1] == f[i + 1][1]) cnt++;
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int N;
int A[100];
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
int cnt = 0;
for(int i=0;i<N;i++){
int minj = i;
for(int j=i;j<N;j++){
if(A[j]<A[minj]) minj = j;
}
if(A[i] != A[minj]) cnt++;
int tmp = A[i];
A[i] = A[minj];
A[minj] = tmp;
}
cout << A[0];
for(int i=1;i<N;i++) cout << ' ' << A[i];
cout << endl << cnt << endl;
return 0;
}
| 0
| 60,515,359
|
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
typedef complex<double> P;
inline double inp(const P& a, const P& b) {
return (conj(a)*b).real();
}
P vs[105];
int main(void) {
int n;
scanf("%d", &n);
REP(i, n) {
int x, y;
scanf("%d%d", &x, &y);
vs[i] = P(x, y);
}
vector<P> cands;
REP(i, n) {
if(abs(vs[i]) > 0) {
cands.push_back(vs[i]);
cands.push_back(vs[i] * P(0, 1));
cands.push_back(vs[i] * P(0, -1));
cands.push_back(vs[i] * P(1, 1));
cands.push_back(vs[i] * P(1, -1));
REP(j, i) {
cands.push_back(vs[i] + vs[j]);
}
}
}
double res = 0;
for(P d : cands) {
P cur(0, 0);
REP(i, n) {
if(inp(d, vs[i]) > 0) {
cur += vs[i];
}
}
res = max(res, abs(cur));
}
printf("%.15f\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x) for(int i=0;i<x;++i)
#define rrep(i,x) for(int i=x-1;i>=0;--i)
int dp[1010][1010];
int main()
{
int q; cin >> q;
rep(_, q) {
string a,b; cin >> a>>b;
int n = a.size(), m = b.size();
rep(i, n) {
rep(j, m) {
if (a[i] == b[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
} else {
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
}
}
}
cout << dp[n][m] << endl;
}
}
| 0
| 30,256,610
|
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
std::vector<int> num;
if (x < 0) {
putchar('-');
x = -x;
}
for (; x; x /= 10) {
num.push_back(x % 10);
}
while (!num.empty()) {
putchar(num.back() ^ '0');
num.pop_back();
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
int n;
int a[100005];
long long b[100005];
void solve() {
read(n);
for (int i = 0; i <= n; ++i) {
read(a[i]);
}
b[n] = a[n];
for (int i = n - 1; ~i; --i) {
b[i] = b[i + 1] + a[i];
}
b[0] = 1;
for (int i = 0; i < n; ++i) {
b[i + 1] = std::min(b[i + 1], 2ll * (b[i] - a[i]));
}
long long ans = 0;
for (int i = 0; i <= n; ++i) {
if (b[i] < a[i]) {
print(-1);
return;
}
ans += b[i];
}
print(ans);
}
int main() {
int T = 1;
while (T--) {
solve();
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define ld long double
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238463;
const int MAXN = 1000030;
bool isPrime[MAXN];
vector<ll> ans;
void sieve()
{
memset(isPrime, 1, sizeof isPrime);
isPrime[0] = isPrime[1] = 0;
for (int i = 2; i * i <= MAXN; i += 1 + (i & 1))
{
if (isPrime[i])
{
for (int j = i * i; j < MAXN; j += i)
isPrime[j] = 0;
}
}
for(int i=0; i<MAXN; i++)
{
if(isPrime[i])
{
ans.push_back(i);
}
}
}
int main()
{
FAST
ll n;
cin>>n;
ll temp=n;
ll cnt=0;
for(ll j=2; j*j<=temp; j++)
{
if(temp%j==0)
{
ll c=0;
while(temp % j == 0)
{
c++;
temp /= j;
}
ll sum=0;
for(int i=1;; i++)
{
sum+=i;
if(sum>c)
{
cnt+=(i-1);
break;
}
}
}
}
if(temp>1)
cnt++;
cout<<cnt<<endl;
return 0;
}
| 0
| 6,656,244
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if(a == 1)
a += 13;
if(b == 1)
b += 13;
if(a > b)
cout << "Alice" << endl;
else if(a < b)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pairs;
#define MOD 998244353
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
bool primeNumber(ll n){
if(n < 2) return false;
else{
for(ll i = 2; i * i <= n; i++){
if(n % i == 0) return false;
}
return true;
}
}
int main(){
ll a,b,c; cin>>a>>b>>c;
if(a<b && b<c)puts("Yes");
else puts("No");
return 0;
}
| 0
| 30,168,200
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
int ab=0, bxa=0, bxx=0, xxa=0;
rep(i,n) {
string s;
cin >> s;
for(int j=0; j<s.size()-1; j++) {
if(s[j]=='A'&&s[j+1]=='B') ab++;
}
if(s[0]=='B'&&s[s.size()-1]=='A') bxa++;
else if(s[0]=='B') bxx++;
else if(s[s.size()-1]=='A') xxa++;
}
if(bxa+xxa+bxx==0) {
cout << ab << endl;
}
else if(xxa+bxx==0) {
cout << ab+bxa-1 << endl;
}
else {
cout << ab+bxa+min(xxa,bxx) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
ll N,M;
bool flg[100010];
ll cnt[100010];
mem0(cnt);
mem0(flg);
ll ACcnt = 0,WAcnt = 0;
cin >> N >> M;
for (int i = 0; i < M; i++) {
ll p; string s;
cin >> p >> s;
p--;
if(s == "AC"){
if(flg[p] == false){
flg[p] = true;
ACcnt++;
WAcnt += cnt[p];
}
} else {
if(flg[p] == false){
cnt[p]++;
}
}
}
cout << ACcnt << " " << WAcnt << endl;
}
| 0
| 14,314,967
|
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#define MOD 1e9+7;
#define INF 1e17+9;
#define PI acos(-1);
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++){
cin >> a[i];
}
long long cnt=0;
for(int i=1;i<=n;i++){
if(a[a[i]]==i)cnt++;
}
cout << cnt/2 << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(bool x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define all(s) s.begin(),s.end()
void vout(vector<int> v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
lli a,b,c;
cin>>a>>b>>c;
a%=b;
lli ac=a%b;
while(a!=0){
if(a%b==c){
out("YES");
return 0;
}
a+=ac;
a%=b;
}
out("NO");
}
| 0
| 34,314,985
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
ll modpow(ll b,ll i){
ll s=1;
while(i){
if(i%2) s=(s*b)%MOD;
b=(b*b)%MOD; i/=2;
}
return s;
}
int main(){
int x,y; cin >>x >>y;
int m=2*y-x,n=2*x-y;
if(m<0||n<0||m%3||n%3){cout <<0; return 0;}
else{
ll p=(m+n)/3,q=min(m,n)/3,pp=1,qq=1;
for(int i=0; i<q; i++){
pp=(pp*(p-i))%MOD; qq=(qq*(q-i))%MOD;
}
cout <<(pp*modpow(qq,MOD-2))%MOD<<endl;
}
return 0;}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define INF 0x3f3f3f3f
#define NIL (-1)
#define M 1046527
using namespace std;
int T[M+1];
void trans(char *s){
for(int i = 0; i < strlen(s); i++){
if(s[i] == 'A') s[i] = '4';
else if(s[i] == 'C') s[i] = '1';
else if(s[i] == 'G') s[i] = '2';
else if(s[i] == 'T') s[i] = '3';
}
}
int stringToInt(char s[]){
int t = 0;
int p = 1;
for(int i = strlen(s)-1; i >= 0; i--){
t += (s[i]-'0')*p;
p *= 5;
}
return t;
}
int h1(int a){
return (int)(a % M);
}
int h2(int a){
return 1+(int)(a % (M-1));
}
int h(int a, int i){
return (h1(a) + i * h2(a))%M;
}
void insert(int c){
int i = 0;
while(true){
int temp = h(c, i);
if(T[temp] == NIL){
T[temp] = c;
return ;
}
else{
i++;
}
}
}
int find(int d){
int i = 0;
while(true){
int temp = h(d, i);
if(T[temp] == NIL){
return -1;
}
else if(T[temp] == d){
return 1;
}
else{
i++;
if(i >= M) return -1;
}
}
}
int main(){
for(int i = 0; i < M; i++) T[i] = NIL;
int n;
scanf("%d", &n);
while(n--){
char a[10], b[14];
scanf("%s %s", a, b);
if(a[0] == 'i'){
trans(b);
int c = stringToInt(b);
insert(c);
}
else{
trans(b);
int d = stringToInt(b);
if(find(d) != -1){
printf("yes\n");
}
else{
printf("no\n");
}
}
}
return 0;
}
| 0
| 95,395,698
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using intpair=pair<int,int>;
using llpair=pair<ll,ll>;
using llvec=vector<ll>;
using llmat=vector<vector<ll>>;
#define PI 3.141592653589793
#define llmattp(name,a,b,num) name(a,vector<ll>(b,num))
#define INTINF 1<<30
#define LLINF 1LL<<60
#define ABS(x) ( (x)>0 ? (x) : -(x) )
#define gsort(vbeg,vend) sort(vbeg,vend,greater<>())
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if(a==0||b==0) return 0;
if(a<b) swap(a,b);
ll tmp = a%b;
while(tmp!=0) {
a = b;
b = tmp;
tmp = a%b;
}
return b;
}
ll factorial(ll x) {
ll f=1;
for(ll i=2; i<x; i++) {
f*=i;
}
return f;
}
ll nPr(ll n, ll r) {
ll result=1;
for(ll i=r+1; i<=n; i++) result*=i;
return result;
}
ll nCr(ll n, ll r) {
if (n == r) { return 1; }
if (r > n) { return 0; }
if (r > n / 2) { r = n - r; }
if (n == 0) { return 0; }
if (r == 0) { return 1; }
if (r == 1) { return n; }
double result = 1;
for (double i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (ll)result;
}
ll GreaterBinarySearch(ll *array, ll key, ll max, ll min) {
if(array[max]<array[min]) {
return NULL;
} else {
ll mid = max + (min-max)/2;
if(array[mid]<key) {
return GreaterBinarySearch(array,key,max,mid-1);
} if(array[mid]>key) {
return GreaterBinarySearch(array,key,mid+1,min);
} else {
return mid;
}
}
}
int DigitNum(ll n) {
int digit=0;
ll wari=1LL;
while(n/wari) {
digit++;
wari*=10;
}
return digit;
}
bool IsPrime(ll num) {
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
vector<ll> Divisor(ll x) {
vector<ll> result;
ll i=1LL;
for( ; i*i<x; i++) {
if(x%i) continue;
result.push_back(i);
result.push_back(x/i);
}
if(i*i==x&&x%i==0)
result.push_back(i);
sort(result.begin(),result.end());
return result;
}
vector<llpair> PrimeFact(ll x) {
vector<llpair> result;
ll ex=0LL;
if(x%2==0) {
while(x%2==0) {
x/=2;
ex++;
}
result.push_back({2,ex});
}
for(ll i=3LL; i*i<=x; i+=2) {
if(x%i) continue;
ex=0LL;
while(x%i==0) {
x/=i;
ex++;
}
result.push_back({i,ex});
}
if(x!=1) result.push_back({x,1});
return result;
}
bool Palind(string s) {
return s == string(s.rbegin(), s.rend());
}
int main() {
ll S; cin>>S;
ll x1=0LL, y1=0LL;
ll x2=1000000000LL,y2=1LL;
ll x3=(1000000000LL-S%1000000000LL)%1000000000LL;
ll y3=(S+x3)/1000000000LL;
printf("%lld %lld %lld %lld %lld %lld\n",x1,y1,x2,y2,x3,y3);
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
struct S{int a,b,c,d;};
bool operator<(S a,S b){
if(a.a!=b.a)return a.a<b.a;
if(a.b!=b.b)return a.b<b.b;
if(a.c!=b.c)return a.c<b.c;
return a.d<b.d;
}
bool operator==(S a,S b){
return a.a==b.a && a.b==b.b && a.c==b.c && a.d==b.d;
}
signed main(){
int X,Y,Z,K;
cin>>X>>Y>>Z>>K;
vector<int> A(X),B(Y),C(Z);
for(int &i:A)cin>>i;
for(int &i:B)cin>>i;
for(int &i:C)cin>>i;
sort(A.begin(),A.end());
sort(B.begin(),B.end());
sort(C.begin(),C.end());
priority_queue<S> Q;
Q.push(S{A[X-1]+B[Y-1]+C[Z-1],X-1,Y-1,Z-1});
S n{-1,-1,-1,-1};
for(int i=0;i<K;){
S a=Q.top();
Q.pop();
if(a==n)continue;
n=a;
if(a.b)Q.push(S{a.a-A[a.b]+A[a.b-1],a.b-1,a.c,a.d});
if(a.c)Q.push(S{a.a-B[a.c]+B[a.c-1],a.b,a.c-1,a.d});
if(a.d)Q.push(S{a.a-C[a.d]+C[a.d-1],a.b,a.c,a.d-1});
cout<<a.a<<endl;
i++;
}
}
| 0
| 50,067,761
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double PI = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
vector<int> a(3);
rep(i, 3)
{
cin >> a[i];
}
sort(ALL(a));
cout << a[0] + a[1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int A, B, K; cin >> A >> B >> K;
vector<int> C;
int i = 1;
while(i <= min(A, B)) {
if(A % i == 0 && B % i == 0) {
C.push_back(i);
}
i++;
}
cout << C[C.size() - K] << endl;
}
| 0
| 67,660,938
|
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
char a,b; cin>>a>>b;
if(a=='H'){
cout<<b<<endl;
}
else{
if(b=='H')cout<<'D'<<endl;
else cout<<'H'<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int N;
cin>>N;
vector<int>a(N);
for(int i=0;i<N;i++){
cin>>a[i];
}
int ans=0;
for(int i=0;i<N;i++){
if(i+1<N&&a[i]==a[i+1]){
int cnt=1;
while(i+1<N&&a[i]==a[i+1]){
cnt++;
i++;
}
ans+=(cnt/2);
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 78,175,414
|
#include<bits/stdc++.h>
using namespace std;
#define sz 10010
#define MOD 1000000007
#define ll long long
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ll n; cin >> n;
vector<ll>ans;
ll cnt = 0;
for (ll i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
ll cur = 0;
ll add = 0;
while (n % i == 0)
{
n = n / i;
cur++;
if ((add + 1) * (add + 2) / 2 <= cur)
add++;
}
cnt += add;
}
}
if (n != 1)
cnt++;
cout << cnt;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.14159265358979323846
#define all(a) a.begin(),a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define tc(t) int t; cin >> t; while (t--)
int mod = 1000000007;
int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}
int lcm(int a, int b) {return a * b / gcd(a, b); }
intt bpow(intt a,intt b)
{
intt res = 1;
while (b > 0) {
if (b & 1)res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
intt fact(intt n) {
if ((n==0)||(n==1))
return 1;
else
return n*fact(n-1);
}
void go()
{
#ifndef ONLINE_JUDGE
freopen("inn.txt","r",stdin);
freopen("ouut.txt","w",stdout);
#endif
}
int main()
{
fast_io
go();
int n,k;cin>>n>>k;
if(500*n>=k)
cout << "Yes" <<"\n";
else
cout <<"No" <<"\n";
}
| 0
| 36,985,229
|
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
const double PI = 3.14159265358979323846;
const ll MOD = (pow(10, 9) + 7);
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll f(ll n) {
if (n == 0 || n == 1) return 1;
else return (n * f(n - 1));
}
ll dignum(ll N, ll d) {
ll x = pow(10, d);
N %= x;
ll y = pow(10, d - 1);
N /= y;
return N;
}
ll divcnt(ll N, ll d) {
ll ans = 0;
while (1) {
if (N%d == 0) {
ans++;
N /= d;
}
else break;
}
return ans;
}
bool prime(ll num) {
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) return false;
}
return true;
}
vector<ll> memo(pow(10, 6) + 1);
ll fibo(ll n) {
if (n == 1) return 1;
else if (n == 2) return 1;
else if (memo[n] != 0) return memo[n];
else return memo[n] = fibo(n - 1) + f(n - 2);
}
int main() {
vector<ll> a(3), b(3); rep(i, 3)cin >> a[i] >> b[i];
map<ll, ll> p;
rep(i, 3) {
p[a[i]]++;
p[b[i]]++;
}
ll f= 0, s = 0;
auto begin = p.begin(), end = p.end();
for (auto it = begin; it != end; it++) {
if (it->second == 1) f++;
if (it->second == 2) s++;
}
if (f == 2 && s == 2)cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <map>
using std::cin;
using std::cout;
using std::endl;
using std::terminate;
using std::map;
using std::make_pair;
void solve() {
int n; cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
map<int, long> m;
for (int i = 0; i < n; ++i) {
map<int, long>::iterator it = m.find(a[i]);
if (it != m.end()) {
m[a[i]]++;
} else {
m.insert(make_pair(a[i], 1));
}
}
long s = 0;
for (map<int, long>::iterator it = m.begin(); it != m.end(); ++it) {
s += (it->second * (it->second - 1)) / 2;
}
for (int i = 0; i < n; ++i) {
long y = 0;
y = s - (m[a[i]] - 1);
cout << y << endl;
}
}
int main() {
#ifdef DEV
std::ifstream in("Banned K.input");
cin.rdbuf(in.rdbuf());
int t; cin >> t;
for (int x = 1; x <= t; ++x) {
solve();
}
#else
solve();
#endif
return 0;
}
| 0
| 12,238,085
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/4
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
template<class T> inline bool chmax(T &a, T b){if(a < b){a = b;return true;}return false;}
template<class T> inline bool chmin(T &a, T b){if(a > b){a = b;return true;}return false;}
const int MOD = 1000000007;
signed main(){
string s;
cin >> s;
int n = s.size() + 1;
int L = 0;
int R = 0;
char now = '<';
int ans = 0;
for(auto c:s){
if(now == c){
if(c == '<')L++;
if(c == '>')R++;
}
else if(now == '<' && c == '>'){
now = '>';
R++;
}
else if(now == '>' && c == '<'){
now = '<';
int mini = min(L,R);
int maxi = max(L,R);
ans += mini*(mini-1)/2 + maxi*(maxi+1)/2;
L = 1;
R = 0;
}
}
int mini = min(L,R);
int maxi = max(L,R);
ans += mini*(mini-1)/2 + maxi*(maxi+1)/2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
set<ll> a;
for(int i = 0; i < n; i++)
{
ll tmp;
cin >> tmp;
a.insert(tmp);
}
set<ll>::iterator itr = a.end();
ll x = *--itr;
ll y = 0;
ll border = x/2;
if(x % 2 == 1) border++;
ll cand1 = *lower_bound(a.begin(), a.end(), border);
ll cand2 = *--lower_bound(a.begin(), a.end(), border);
ll c1 = abs(cand1 - border);
ll c2 = abs(cand2 - border);
if(c1 < c2)
{
y = cand1;
}
else
{
y = cand2;
}
cout << x << " " << y << endl;
}
| 0
| 44,636,191
|
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N; cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
ll res = 0; int nx = 1;
for (int i = 0; i < N; ++i) {
if (A[i] % nx) {
res += A[i] / nx;
A[i] -= A[i] / nx * nx;
}
else if (A[i] > nx) {
res += A[i] / nx - 1LL;
A[i] = 1;
}
if (A[i] >= nx) ++nx;
}
cout << res << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
bool gt(string s, string t) {
if(s.size() > t.size()) return true;
if(s.size() < t.size()) return false;
return s > t;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> A(m);
rep(i, m) cin >> A[i];
vector<int> K = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<string> dp(n + 1, "X");
dp[0] = "";
for(int j = 1; j <= n; j++) {
rep(i, m) {
int k = K[A[i]];
if(j - k < 0) continue;
if(dp[j - k] == "X") continue;
char c = '0' + A[i];
string s = dp[j - k] + c;
if(dp[j] == "X" || gt(s, dp[j])) {
dp[j] = s;
}
}
}
cout << dp[n] << endl;
return 0;
}
| 0
| 60,115,282
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
int minDiff = 10000;
for (int i = 0; i < S.size() - 2; i++) {
int subS = (S.at(i) - '0') * 100 + (S.at(i + 1) - '0') * 10 + (S.at(i + 2) - '0') * 1;
int diff = abs(753 - subS);
minDiff = min(minDiff, diff);
}
cout << minDiff << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a,ll b)
{
if(a>b)
return a;
return b;
}
ll power(ll x, ll y,ll mod)
{
ll temp;
if( y == 0)
return 1;
temp = power(x, y/2,mod);
if (y%2 == 0)
return (temp*temp)%mod;
else
return (((x*temp)%mod)*temp)%mod;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=nxt();
vector <int> v(n);
generate(all(v),nxt);
sort(v.begin(),v.end());
vector <int> v2;
int i=0;
while(i<n)
{
int x=i;
while(i<n&&v[x]==v[i])
i++;
v2.push_back(i-x);
}
sort(v2.begin(),v2.end());
int m=v2.size();
vector <int> prefix(m);
prefix[0]=v2[0];
for(int i=1;i<m;i++)
prefix[i]=prefix[i-1]+v2[i];
vector <int> v3(n+1);
for(int k=1;k<=n;k++)
{
int l=0,r=m-1;
int test=m;
while(l<=r)
{
int mid=(l+r)/2;
if(v2[mid]>=k)
{
test=mid;
r=mid-1;
}
else
l=mid+1;
}
v3[k]=m-test;
if(test-1>=0)
v3[k]+=(prefix[test-1]/k);
}
for(int i=1;i<=n;i++)
{
int ans=0;
int l=1,r=n;
while(l<=r)
{
int mid=(l+r)/2;
if(v3[mid]>=i)
{
ans=mid;
l=mid+1;
}
else
r=mid-1;
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 8,444,329
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n; cin >> n;
ll sum = 0;
ll i = 1;
for(; i * i < n; i++) {
if(n / i == n % i)sum += i;
}
for(; i >= 1; i--) {
ll tmp = (n - i);
if(tmp == 0)continue;
ll m = tmp / i;
if(tmp % i)continue;
if(n / m == n % m)sum += m;
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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(a) (a).begin(), (a).end()
int main()
{
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i, n)
{
cin >> c[i];
rep(j, m) cin >> a[i][j];
}
int ans = 1001001001;
for (int bit = 0; bit < (1 << n); bit++)
{
int price = 0;
vector<int> algo(m, 0);
for (int i = 0; i < n; i++)
{
if (bit & (1 << i))
{
price += c[i];
rep(j, m) algo[j] += a[i][j];
}
}
bool ck = true;
rep(i, m)
{
if (algo[i] < x)
ck = false;
}
if (ck)
ans = min(ans, price);
}
cout << (ans == 1001001001 ? -1 : ans) << '\n';
return 0;
}
| 0
| 90,708,546
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,s;
cin>>n>>k>>s;
for(int i=0;i<k;i++)cout<<s<<" ";
if(s==1e9)for(int i=k;i<n;i++)cout<<1<<" ";
else for(int i=k;i<n;i++)cout<<s+1<<" ";
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % mod;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
}
else {
break;
}
}
return ans;
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes(){
cout<<"Yes"<<endl;
}
void No(){
cout<<"No"<<endl;
}
void YES(){
cout<<"YES"<<endl;
}
void NO(){
cout<<"NO"<<endl;
}
#define fin(i) scanf("%lld",&i)
#define fout(i) printf("%lld",i)
#define fendl printf("\n")
template <class T>
class LazySegTree {
int n;
vector<T> data;
vector<T> lazy;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
public:
LazySegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
void change(int i, int j, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) {
return _query(a, b, 0, 0, n);
}
T operator[](int i) {
return data[i + n - 1];
}
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
int n,k,ans;
vector<int> a;
signed main() {
cin>>n>>k;
rep(i,n){
int l;
fin(l);
a.push_back(l);
}
ans=inf;
rep(i,mypow(2, n)){
bitset<20> bits(i);
vector<int> na=a;
int now=0;
int kans=0;
rep(i,n){
if (bits[i]) {
if (now>=na[i]) {
kans+=now+1-na[i];
na[i]=now+1;
now++;
}
else now=na[i];
}
else chmax(now, na[i]);
}
now=0;
map<int, bool> mp;
rep(i,n){
if (now<na[i]) {
mp[na[i]]=1;
now=na[i];
}
}
if (mp.size()>=k) {
chmin(ans, kans);
}
}
cout<<ans<<endl;
}
| 0
| 24,132,115
|
#include<iostream>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p) {
if (n == 0 && m == 0 && p == 0)break;
int a = 0;
int w;
for (int i = 0;i < n;i++) {
int b;
cin >> b;
a += b;
if (i + 1 == m)w = b;
}
a *= 100;
a = a*(100 - p) / 100;
if (w == 0)cout << '0' << endl;
else cout << a / w << 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);
LL n, d, a;
cin >> n >> d >> a;
vector<LP> v(n);
for(int i = 0; i < n; ++i) {
cin >> v[i].F >> v[i].S;
}
sort(all(v));
queue<LP> q;
int pos = 0;
LL res = 0;
LL sum = 0;
while(pos < n) {
while(!q.empty() && v[pos].F > q.front().F) {
sum -= q.front().S;
q.pop();
}
v[pos].S -= sum;
if(v[pos].S > 0) {
LL tmp = v[pos].S / a;
if(v[pos].S % a != 0) ++tmp;
sum += a * tmp;
res += tmp;
q.push(MP(v[pos].F + d * 2, a * tmp));
}
++pos;
}
cout << res << endl;
return 0;
}
| 0
| 50,014,329
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
int n,m,x;
cin>>n>>m>>x;
vector<vector<int>> matrix(n,vector<int>(m));
vector<int> costs(n);
for(int i=0;i<n;i++) {
int c;
cin>>c;
costs[i]=c;
for(int j=0;j<m;j++) {
int num;
cin>>num;
matrix[i][j]=num;
}
}
int all=1<<n;
int ans=123456789;
for(int mask=0;mask<all;mask++) {
vector<int> levels(m);
int total_cost=0;
for(int i=0;i<n;i++) {
if((mask>>i)&1) {
total_cost+=costs[i];
for(int j=0;j<m;j++) {
levels[j]+=matrix[i][j];
}
}
}
bool ok=true;
for(int i=0;i<m;i++) {
if(levels[i]<x) {
ok=false;
}
}
if(ok) {
ans=min(ans, total_cost);
}
}
if(ans==123456789) {
cout<<-1<<endl;
}
else {
cout<<ans<<endl;
}
}
|
#include <stdio.h>
#include <string.h>
int main(){
char s[200],work;
unsigned int m,h,i,j,k;
while(1){
scanf("%s",s);
if(s[0]=='-') break;
scanf("%d",&m);
for(i=0; i<m; ++i){
scanf("%d",&h);
for(j=0; j<h; ++j){
for(k=0; k < strlen(s) ; ++k){
if(k==0)
work=s[0];
else
s[k-1]=s[k];
}
s[strlen(s)-1]=work;
}
}
printf("%s\n",s);
}
return 0;
}
| 0
| 35,222,468
|
#include <iostream>
#include <string>
int main(int argc, char const *argv[])
{
std::string word;
while(true){
std::cin >> word;
if(word == "-") break;
int times;
std::cin >> times ;
int idx = 0;
int h = 0;
for(int i = 0 ; i < times ; i ++ ){
std::cin >> h;
idx += h;
idx %= word.length();
}
for(unsigned int i = 0 ; i < word.length() ;i ++){
std::cout << word.at((i+idx)%word.length());
}
std::cout << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> C(n-1), S(n-1), F(n-1);
rep(i, n-1) cin >> C[i] >> S[i] >> F[i];
rep(s, n-1) {
int t = S[s];
for (int i = s; i < n - 1; i++) {
t = S[i] + max(0, (t - S[i] + F[i] - 1) / F[i] * F[i]);
t = t + C[i];
}
put(t);
}
put(0);
return 0;
}
| 0
| 84,387,667
|
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
int Min = min(a, b), Max = max(a, b);
rep(i, Max) cout << Min;
cout << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include<algorithm>
#include<math.h>
#include<stdio.h>
int main()
{
char n;
std::cin >> n;
if (n <= 90) {
std::cout << "A" << std::endl;
}
else
{
std::cout << "a" << std::endl;
}
}
| 0
| 62,238,781
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,c,p,i;
cin>>n;
vector<int> a(n);
for (i=0;i<n;i++) {
cin>>a.at(i);
}
p=1;
c=1;
while (a.at(p-1)!=2 && c<n) {
p=a.at(p-1);
c++;
}
if (c<n) cout<<c<<endl;
else cout<<-1<<endl;
}
|
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
#include <map>
#include <stack>
#include <set>
#include <cmath>
#include <deque>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int main() {
int N, A, B;
while (~scanf("%d %d %d", &N, &A, &B)) {
if (A + B - 1 > N || (LL)A * B < (LL)N) puts("-1");
else {
while (N > 0) {
int now = min(A, N - (B - 1));
for (int i = N - now + 1; i <= N; i++) printf("%d ", i);
N -= now;
B--;
}
puts("");
}
puts("");
}
return 0;
}
| 0
| 65,903,139
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int a,b;
cin>>a>>b;
cout<<(a%3==0||b%3==0||(a+b)%3==0?"Possible\n":"Impossible\n");
}
|
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll) (x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
#define int ll
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll MAX = 1100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[8] ={1,0,-1,0,1,-1,1,-1};
ll dy[8] ={0,1,0,-1,1,-1,-1,1};
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; }
struct Timer{
chrono::system_clock::time_point start, end;
Timer(){ start = chrono::system_clock::now(); }
~Timer(){
end = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(end - start).count();
cerr<<"time : "<<msec<<" ms"<<endl;
}
};
void solve(){
double l;
cin>>l;
double a=l/3;
cout<<a*a*a<<endl;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 0
| 7,731,278
|
#include<iostream>
using namespace std;
int main()
{
int A,B,C;
cin>>A>>B>>C;
if(A>=1&&B>=1&&C>=1)
{
if(A+B>=C)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
}
|
#include<cstdio>
#include<functional>
#include<algorithm>
#include<cstring>
using namespace std;
int main(void)
{
int i,j,a[9],flg[9],b,n,f;
int che[8][3]={{0,1,2},{3,4,5},{6,7,8},
{0,3,6},{1,4,7},{2,5,8},
{0,4,8},{2,4,6}};
for(i=0;i<9;i++) scanf("%d",&a[i]);
for(i=0;i<9;i++) flg[i]=0;
scanf("%d",&n);
for(i=0;i<n;i++) {
scanf("%d",&b);
for(j=0;j<9;j++) {
if(b==a[j]) flg[j]=1;
}
}
f=0;
for(i=0;i<8;i++) {
if(flg[che[i][0]]==1 && flg[che[i][1]]==1
&& flg[che[i][2]]==1) {
f=1; break;
}
}
if(f==1) printf("Yes\n");
else printf("No\n");
return 0;
}
| 0
| 22,672,690
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> light(N);
for(int i = 0; i < N; i++){
int num;
cin >> num;
light.at(i) = num - 1 ;
}
int count = 0;
int now = 0;
while(true){
if(now == 1){
cout << count << endl;
break;
}
if(count >= N){
cout << -1 << endl;
break;
}
count++;
now = light.at(now);
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=100005,INF=1<<28;
int main(){
std::ifstream in("text.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
while(1){
int N,L,R;cin>>N>>L>>R;
if(N==0) break;
vector<int> A(N);
for(int i=0;i<N;i++) cin>>A[i];
int ans=-1,point=-1;
for(int i=L;i<=R;i++){
if(ans<=A[i-1]-A[i]){
ans=A[i-1]-A[i];
point=i;
}
}
cout<<point<<endl;
}
}
| 0
| 30,748,629
|
#include <iostream>
using namespace std;
int main() {
size_t n;
cin >> n;
size_t d, x;
cin >> d >> x;
unsigned long long sum = x;
for (size_t i = 0; i < n; ++i) {
size_t a;
cin >> a;
for (size_t j = 0; j < d; ++j) {
if (j * a + 1 <= d) {
++sum;
}
else {
break;
}
}
}
cout << sum << endl;
return EXIT_SUCCESS;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll n,k,a[200010],s[200010],i;
cin >> n >> k;
for(i=0;i<n;i++){
cin >> a[i];
}
s[0]=0;
for(i=0;i<n;i++){
s[i+1]=s[i]+a[i];
s[i+1]=s[i+1]%k;
}
ll x[200010];
map<ll,ll> mp;
for(i=0;i<n+1;i++){
x[i]=s[i]+n-i;
x[i]=x[i]%k;
mp[x[i]]++;
}
ll ans=0;
for(i=0;i<n;i++){
if(mp[x[i]]!=0){
ans+=mp[x[i]]*(mp[x[i]]-1)/2;
mp[x[i]]=0;
}
}
ll ans1=0;
map<ll,ll> mp1;
for(i=k;i<n+1;i++){
mp1[x[i]]++;
}
for(i=0;i<=n-k;i++){
if(mp1[x[i]]!=0){
ans1+=mp1[x[i]];
}
mp1[x[i+k]]--;
}
cout << ans-ans1 << endl;
}
| 0
| 34,126,924
|
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<int, ii> iii;
ll pwr(ll base, ll p, ll mod=MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a%b);
}
int r, c, d;
char arr[1005][1005], block[2][5][5];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>r>>c>>d;
string chars = "RGYB";
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
int x = (i+j)%(2*d) / d;
int y = (i-j+500*d)%(2*d) / d;
cout<<chars[x*2+y];
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
vector<pair<ll, ll>> v;
int main(){
ll h,w;
int n;
cin>>h>>w>>n;
for(int i=0;i<n;i++){
ll x,y; cin>>x>>y;
for(int i=-2;i<=0;i++){
for(int j=-2;j<=0;j++){
if(1<=x+i&&x+i<=h-2&&1<=y+j&&y+j<=w-2){
v.push_back({x+i,y+j});
}
}
}
}
sort(v.begin(),v.end());
ll j[10]={};
for(int i=0;i<v.size();i++){
int count=1;
while(i+1<v.size()&&v[i]==v[i+1]){
count++;
i++;
}
j[count]++;
}
j[0]=(h-2)*(w-2);
for(int i=1;i<10;i++) j[0]-=j[i];
for(int i=0;i<10;i++){
cout<<j[i]<<endl;
}
return 0;
}
| 0
| 89,406,907
|
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
scanf("%d %d", &n, &m);
printf("%d", (n * n - n + m * m - m) / 2);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
int h,m,n,i,j,k,len;
char work;
char s[200];
while(1){
scanf("%s",s);
len=strlen(s);
if(s[0]=='-')break;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&h);
for(j=0;j<h;j++){
work=s[0];
for(k=0;k<len-1;k++){
s[k]=s[k+1];
}
s[len-1]=work;
}
}
printf("%s\n",s);
}
return 0;
}
| 0
| 6,290,227
|
#include <stdio.h>
#include <string.h>
int main() {
int index = 0;
char s[11], output[11];
scanf("%s", s);
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] == '0') {
output[index] = '0';
index++;
} else if (s[i] == '1') {
output[index] = '1';
index++;
} else if (s[i] == 'B') {
if (index > 0) {
index--;
output[index] = '\0';
}
}
}
output[index] = '\0';
printf("%s", output);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define all(x) x.begin(),x.end()
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
const int INF=INT_MAX;
const ld PI=acos(-1);
const ld E=2.71828183;
const int MOD=1e9+7;
vi bfs(vector<vi>adj,int src){
queue<int>q;
q.push(src);
vi dst(adj.size(),INF);
dst[src]=0;
while(!q.empty()){
int c=q.front();
q.pop();
for(int nbr:adj[c]){
if(dst[nbr]==INF){
dst[nbr]=dst[c]+1;
q.push(nbr);
}
}
}
return dst;
}
vi bfsParents(vector<vi>adj,int src){
vi parents=vi(adj.size(),INF);
parents[src]=-1;
queue<int>q;
q.push(src);
vi dst(adj.size(),INF);
dst[src]=0;
while(!q.empty()){
int c=q.front();
q.pop();
for(int nbr:adj[c]){
if(dst[nbr]==INF){
parents[nbr]=c;
dst[nbr]=dst[c]+1;
q.push(nbr);
}
}
}
return parents;
}
vi shortestPath(vector<vi>adj,int src,int dst){
vi bfsParetns=bfsParents(adj,src);
vi ans;
while(src!=dst){
if(bfsParetns[src]==INF)
return {};
ans.push_back(src);
src=bfsParetns[src];
}
return ans;
}
int powMod(int base,int exp,int mod){
int ans=1;
for(int i=0; i<exp; i++)
ans=((ans%mod)*(base%mod))%mod;
return ans;
}
vi divisorsOf(int n){
vi ans;
for(int i=1; i*i<=n; i++){
if(n%i==0)
ans.push_back(i);
if(i*i!=n && i!=1)
ans.push_back(n/i);
}
return ans;
}
ll gcd(ll a,ll b){if(a%b==0) return b; else return gcd(b,a%b);}
ld log (ld a,ld b){return log(b)/log(a);}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
ll power(ll base, ll exp){ll res=1;while(exp){exp--;res*=base;}return res;}
void solve();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
while(t--)
solve();
return 0;
}
void solve (){
ll a,b;
cin >> a >> b;
cout << lcm(a,b)<<"\n";
}
| 0
| 75,249,161
|
#include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long B, long long C){
vector<long long> d(3, 0);
d[0] = max(A, max(B, C)) - A;
d[1] = max(A, max(B, C)) - B;
d[2] = max(A, max(B, C)) - C;
sort(d.begin(), d.end());
long long ans = 0;
ans += d[1];
d[2] -= d[1];
d[1] -= d[1];
if(d[2] % 2 == 0) ans += d[2]/2;
else ans += d[2]/2 + 2;
cout << ans << endl;
return;
}
int main(){
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
long long C;
scanf("%lld",&C);
solve(A, B, C);
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
using namespace std;
ll factorial(ll n){
if(n==0){
return 1;
}
else{
return n*factorial(n-1);
}
}
double dist(pair<double,double> a,pair<double,double> b){
return sqrt(pow((a.first - b.first) ,2) + pow((a.second - b.second),2));
}
double ism(double aa,ll p){
double ap=aa;
double ans=1;
while(p>0){
if(p&1){
ans*=ap;
}
p/=2;
ap=ap*ap;
}
return ans;
}
ll ismm(ll aa,ll p,ll m){
ll ap=aa;
ll ans=1;
while(p>0){
if(p&1){
ans=(ans*ap)%m;
}
p/=2;
ap=(ap*ap)%m;
}
return ans;
}
struct all_init
{
all_init()
{
cout << fixed << setprecision(9);
}
} All_init;
int main()
{
ll n,m,ans=0;
cin>>n>>m;
ans=min(n,m/2);
m-=ans*2;
ans+=m/4;
cout<<ans<<endl;
}
| 0
| 14,732,135
|
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
long long i, cnt=0, ans=0;
cin>>s;
for(i=0; i<s.size(); i++)
{
if(s[i]=='B')
cnt++;
else
ans+=cnt;
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rem(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;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int q, h, s, d;
int n;
cin >> q >> h >> s >> d >> n;
ll dmin = min(min(q * 8, h * 4), min(s * 2, d));
if (n % 2 == 0)
{
cout << dmin * n / 2 << "\n";
}
else
{
int m = n / 2;
ll smin = min(min(q * 4, h * 2), s);
cout << dmin * m + smin << "\n";
}
return 0;
}
| 0
| 84,426,876
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 1005;
int c[MAX_N][MAX_N];
int main()
{
string X,Y;
cin >> X;
cin >> Y;
for(int i=0;i<=X.length();i++){
c[i][0] = i;
}
for(int j=0;j<=Y.length();j++){
c[0][j] = j;
}
for(int i=1;i<=X.length();i++){
for(int j=1;j<=Y.length();j++){
int p,q,r;
if(X[i-1] == Y[j-1]){
p = c[i-1][j-1];
}else{
p = c[i-1][j-1] + 1;
}
q = c[i][j-1] + 1;
r = c[i-1][j] + 1;
c[i][j] = min(min(p,q),r);
}
}
cout << c[X.length()][Y.length()] << "\n";
}
|
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define pb push_back
#define vec vector<int>
#define fo(i, n) for (int i = 0; i < n; i++)
#define foo(i, a, b) for (int i = a; i < b; i++)
#define mp make_pair
#define deb(x) cout << #x << " --> " << x << endl;
#define deb1a(v) cout << #v << "--->" << endl; for (auto it : v) cout << it << " "; cout << endl;
#define deb2a(v) cout << #v << "--->" << endl;for (auto it:v){for(auto it1 : it){cout << it1 << " ";}cout<< endl;}
#define deb3a(v) cout << #v << "-->" << endl; for(auto it:v){cout << it.fi << " " << it.se << endl;}
#define mod 998244353
#define so(v) sort(v.begin(),v.end())
#define fi first
#define se second
#define db1(x) cout<<#x<<"="<<x<<endl
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl
int power(int x, unsigned int y, int p){ int res = 1;x = x % p;while (y > 0) { if (y & 1)res = (res*x) % p;y = y>>1; x = (x*x)% p;} return res;}
int mI(int a, int m) {return power(a, m - 2, m);}
#define double long double
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
n++;
vec pos(n+5,1);
vec m(n + 5, 0);
vec v(n);
fo(i,n){
cin >> v[i];
}
if(n==1){
if(v[0]==1){
cout << 1;
return 0;
}
else{
cout<<-1;
return 0;}
}
if(v[0]!=0){
cout << -1;
return 0;
}
int in = 0;
int ans = 0;
int curr = 0;
foo(i,1,n){
int vall = v[i];
if(i==n-1)
vall--;
while(vall>0){
if(in>=i){
cout << -1;
return 0;
}
int fii = pos[in]+curr;
if(fii>vall){
ans += (vall) * (i - in);
m[i] -= vall;
m[in + 1] += vall;
pos[in] -= vall;
vall = 0;
}
else{
ans += (fii) * (i - in);
m[i] -= fii;
m[in + 1] += fii;
vall -= fii;
in++ ;
curr += m[in];
}
}
}
cout << n + ans;
}
| 0
| 87,307,225
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define REV(v) reverse(v.begin(), v.end())
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define SZ(v) (int)v.size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
class BIT {
int n;
vector<ll> node;
public:
BIT(int N) : n(N), node(N + 1) {}
void add(int i, ll x) {
for (++i; i <= n; i += i & -i) { node[i] += x; }
}
ll sum(int i) {
ll s = 0;
for (; i > 0; i -= i & -i) { s += node[i]; }
return s;
}
};
class RSQ {
int n;
BIT a, b;
public:
RSQ(int N) : n(N), a(N), b(N) {}
void add(int l, int r, ll x) {
int t = r - l;
a.add(l, -l * x);
a.add(r, r * x);
b.add(l, x);
b.add(r, -x);
}
ll sum(int i) { return a.sum(i) + i * b.sum(i); }
};
class Main {
int N, K;
vector<int> A;
void input() {
cin >> N >> K;
A.resize(N);
REP(i, N) { cin >> A[i]; }
}
void output() {
REP(_, K) {
vector<ll> imos(N + 2);
REP(i, N) {
imos[max(0, i - A[i]) + 1] += 1;
imos[min(N, i + A[i] + 1) + 1] -= 1;
}
REP(i, N) {
imos[i + 1] += imos[i];
A[i] = imos[i + 1];
}
if (*min_element(A.begin(), A.end()) == N) break;
}
REP(i, N) { cout << A[i] << " "; }
cout << endl;
}
public:
Main() {
input();
output();
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n, i, j, p, x, a[20009], b[20009];
cin >> n;
for(i = 0; i < n; i++)
a[i] = i+1;
for(i = n-1; i >= 0; i--)
b[i] = n-i;
for(i = 0; i < n; i++)
{
cin >> p;
a[p-1] += i;
for(j = p-1; j < n; j++)
{
a[j] += n;
b[j] -= n;
}
}
x = 1 - b[n-1];
for(i = 0; i < n; i++)
{
a[i] += x;
b[i] += x;
}
for(i = 0; i < n; i++)
cout << a[i] << " ";
cout << "\n";
for(i = 0; i < n; i++)
cout << b[i] << " ";
}
| 0
| 42,017,785
|
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) {
long long d = gcd(a, b);
return a / d * b;
}
int main(){
int n;
cin >> n;
long long ans = 1;
for(int i=0; i<n; i++){
long long num;
cin >> num;
ans = lcm(ans, num);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using plll=pair<ll,pll>;
using graph=vector<vector<int>>;
const ll MOD=1000000007;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll abs1(ll a){
if(a>=0)return a;
else return -a;
}
ll pow1(ll a,ll b,ll p=LLONG_MAX){
ll ret=1;
while(b!=0){
if((b&1)==1){
ret*=a;
}
a*=a;
if(a>=p)a%=p;
b=b>>1;
}
return ret;
}
int digit(ll a,ll b){
int i=0;
while(a!=0){
a/=b;
i++;
}
return i;
}
ll gcd1(ll a,ll b){
if(a==0 && b==0)return 0;
ll n;
while(a%b!=0){
n=a%b;
a=b;
b=n;
}
return b;
}
ll solveLinear(ll n,ll m,ll c){
if(n==0 && m==0)return 0;
ll a[100],b[100];
a[0]=n;b[0]=m;
int i=1;
while(b[i-1]!=0){
a[i]=b[i-1];
b[i]=a[i-1]%b[i-1];
i++;
}
n=i;
if(c%a[n-1]!=0){
return 0;
}
ll x=c/a[n-1],y=0;
for(i=1;i<n;i++){
ll cnt=x;
x=y;
y=cnt-(a[n-i-1]/b[n-i-1])*y;
}
return x;
}
ll modRev(ll a,ll p=MOD){
a%=p;
ll n=solveLinear(a,p,1);
n%=p;
if(n<0)return n+p;
return n;
}
ll fact(ll n,ll p=MOD){
if(n<0)return 0;
int i;
ll ret=1;
for(i=0;i<n;i++){
ret=ret*(i+1);
if(ret>=p)ret%=p;
}
return ret;
}
ll perm(ll n,ll k,ll p=MOD){
if(n<0 || k<0 || n<k)return 0;
int i;
ll ret=1;
for(i=0;i<k;i++){
ret=ret*(n-i);
if(ret>=p)ret%=p;
}
return ret;
}
ll binom(ll n,ll k,ll p=MOD){
if(n<0 || k<0 || n<k)return 0;
int i;
ll ret=1,fact=1;
for(i=0;i<k;i++){
ret=ret*(n-i);
fact*=i+1;
if(ret>=p)ret%=p;
if(fact>=p)fact%=p;
}
return (ret*modRev(fact))%p;
}
void pushHeap(vector<int>& h,int n){
int i=h.size();
h.push_back(n);
while(i!=0 && h[(i-1)/2]<h[i]){
swap(h[i],h[(i-1)/2]);
i=(i-1)/2;
}
h[i]=n;
}
int popHeap(vector<int>& h){
int n=h.size()-1;
if(n==-1)return 0;
int i,ret=h[0];
swap(h[0],h[n]);
h.pop_back();
for(i=0;i<n;){
int j=2*i+1;
if(j>=n)break;
if(j!=n-1 && h[j]<h[j+1])j++;
if(h[i]<h[j]){
swap(h[i],h[j]);
}
i=j;
}
return ret;
}
vector<bool> ver;
void dfs(const graph &g,int v){
for(auto i:g[v]){
if(ver[i])continue;
dfs(g,i);
}
}
int main(){
int i,j,k,cnt=0;
ld n,m,d;
cin>>n>>m>>d;
ld a;
if(d!=0)a=n+max((ld)0,n-2*d);
else a=n;
printf("%.12llf\n",a*(m-1)/(n*n));
}
| 0
| 100,053,648
|
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const int maxn=1e2+5;
const int maxk=1e5+5;
int a[maxn];
ll num[maxk],front[maxk];
void update(int k)
{
front[0]=num[0];
for(int i=1;i<=k;i++)
front[i]=(front[i-1]+num[i]-(front[i-1]+num[i]>=mod)*mod);
return;
}
ll query(int l,int r)
{
if(l==-1) return front[r];
else return (front[r]-front[l]+(front[r]-front[l]<0)*mod);
}
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
num[0]=1;
update(k);
for(int i=1;i<=n;i++)
{
memset(num,0,sizeof(num));
for(int j=0;j<=k;j++)
num[j]=query(max(0,j-a[i])-1,j);
update(k);
}
printf("%lld\n",num[k]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T>
void compression(vector<T> &v)
{
vector<T> t = v;
sort(ALL(t));
t.erase(unique(ALL(t)), t.end());
for (size_t i = 0; i < v.size(); i++)
{
v[i] = distance(t.begin(), lower_bound(ALL(t), v[i]));
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a[i];
compression<int>(a);
int cnt = 0;
for(int i=0;i<n;i++){
if((a[i]+1)%2 != (i+1)%2) cnt++;
}
cout << cnt / 2 << endl;
}
| 0
| 61,730,605
|
#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)
using namespace std;
typedef long long ll;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;
cin >> N >> M;
UnionFind uf(N+1);
vector<int> P(N);
rep(i, N) cin >> P[i];
rep(i, M) {
int x,y; cin >> x >> y;
uf.merge(x, y);
}
int ans = 0;
rep(i, N) {
if(uf.same(P[i], i + 1)) {
ans++;
}
}
cout << ans << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> v(n);
REP(i,n){
int a,b;
cin >> a >> b;
v[i].first = a;
v[i].second = b;
}
sort(v.begin(),v.end());
ll ans = 0;
ll i = 0;
while(m > 0){
if(v[i].second <= m){
ans += v[i].first * v[i].second;
m -= v[i].second;
}
else{
ans += v[i].first * m;
m = 0;
}
i++;
}
cout << ans << endl;
}
| 0
| 48,340,098
|
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#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())
using namespace std;
typedef long long ll;
typedef pair<string,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> P(m), Y(m);
rep(i, m) {
cin >> P[i] >> Y[i];
P[i]--;
}
vector<vector<int>> A(n);
rep(i, m) {
A[P[i]].push_back(Y[i]);
}
rep(i, n) {
sort(ALL(A[i]));
}
rep(i, m) {
printf("%06d", P[i] + 1);
int id = lower_bound(ALL(A[P[i]]), Y[i]) - A[P[i]].begin();
printf("%06d\n", id + 1);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false);
#define ll long long
#define ld long double
#define db(x) cout << "[" << #x << ": " << (x) << "]\n"
#define db2(x,y) cout << "[" << #x << ": " << (x) << "] [" << #y << ": " << (y) << "]\n"
#define db3(x,y,z) cout << "[" << #x << ": " << (x) << "] [" << #y << ": " << (y) << "] [" << #z << ": " << (z) << "]\n"
#define cn 107
#define sn 1007
#define bn 200007
#define M 1000000007
#define inf LLONG_MAX
int main()
{
ios;
ll n; cin >> n;
string s; cin >> s;
if(n%2) { cout << "No"; exit(0);}
for(ll i = 0; i < n/2; i++)
{
if(s[i] == s[i+n/2]) continue;
cout << "No"; exit(0);
}
cout << "Yes";
}
| 0
| 96,351,097
|
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define M 1000000007
using namespace std;
int main()
{
ll n,x,sum=0;
vector<ll>v;
for(ll i=0; i<3; i++)
{
cin>>x;
v.pb(x);
}
sort(v.begin(),v.end());
for(ll i=0; i<v.size()-1; i++)
{
sum+=(v[i+1]-v[i]);
}
cout<<sum<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> A){
for(auto a : A){
if(a == 0){
cout << 0 << endl;
return;
}
}
long long ans = 1;
for (int i = 0; i < N; i++)
{
if(A[i] <= 1000000000000000000/ans) ans *= A[i];
else{
cout << -1 << endl;
return;
}
}
cout << ans << endl;
return;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, std::move(A));
return 0;
}
| 0
| 89,878,579
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef long long ll;
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<int>city(n);
rep(i,n)cin>>city[i];
int l,q;
cin>>l>>q;
int nl=n,c=0;
while(nl>0){c++;nl/=2;}
vector<vector<int>>db(n,vector<int>(c,n));
int r=0;
rep(i,n)
{
while(r+1<n&&city[r+1]<=city[i]+l)r++;
db[i][0]=r;
}
rep(i,c-1)
{
rep(j,n)
{
db[j][i+1]=db[db[j][i]][i];
}
}
auto check=[&](int s,int t,int day){
rep(i,c)
{
if(day&(1<<i))
{
s=db[s][i];
}
}
return s>=t;
};
rep(i,q)
{
int a,b;
cin>>a>>b;
a--;b--;
if(a>b)swap(a,b);
int ok=n,ng=0;
while(ok-ng>1)
{
int mid=(ok+ng)/2;
if(check(a,b,mid))ok=mid;
else ng=mid;
}
cout<<ok<<"\n";
}
cout<<flush;
return 0;
}
|
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
using std::set;
using std::multiset;
using std::unordered_set;
using std::map;
using std::multimap;
using std::unordered_map;
using std::pair;
using std::cin;
using std::cout;
using boost::multiprecision::cpp_int;
using cpp_dec_float_1000 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1000, boost::int128_type>>;
typedef uintmax_t ull;
typedef intmax_t ll;
typedef uint64_t ul;
typedef uint32_t ui;
typedef uint8_t uc;
constexpr char CRLF = '\n';
constexpr char SPACE = ' ';
constexpr char VECTOR_COUT_SEPARATOR = SPACE;
constexpr ll INF = 1000'000'007;
constexpr int MOD = 1000'000'007;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> std::ostream& operator<< (std::ostream& os, const std::vector<T>& vc) { for(auto it = vc.begin(); it != vc.end(); ++it) { if (std::next(it) == vc.end()) os << *it; else os << *it << VECTOR_COUT_SEPARATOR; } return os; }
template<class T1, class T2> inline std::ostream & operator<< (std::ostream & os, const std::pair<T1, T2> & p) { return os << p.first << ' ' << p.second; }
template<class T> T modinv(T a, T m) { T b = m, u = 1, v = 0; while (b) { T t = a / b; a -= t * b; boost::swap(a, b); u -= t * v; boost::swap(u, v); } u %= m; if (u < 0) u += m; return u; }
template<class T> inline bool isSosuu(const T& n) { if (n == T(1)) { return false; } for (T i = 2; i*i <= n; ++i) { if (n % i == 0) { return false; } } return true; }
template<class T> vector<vector<T>> split (const vector<T>& S, T delim) { vector<vector<T>> ret{}; vector<T> buff{}; for (auto c : S) { if (c == delim) { if (!buff.empty()) ret.push_back(buff); buff.clear(); } else { buff.push_back(c); } } if (!buff.empty()) ret.push_back(buff); return ret; }
template<class T> inline void printYesNo(const T& t) { cout << (t ? "Yes" : "No") << CRLF; }
template<class T = int64_t> T modpow(T N, T P, T M) { T ret{1}; N %= M; while (P) { if (P & 0x01) { ret *= N; ret %= M; } P >>= 1; N *= N; N %= M; } return ret; }
int gErr = 0;
#define ASSERT(p) if(!(p)){ gErr = 1; }else{ ; }
struct Tmp
{
public:
int N;
Tmp(int N)
: N(N)
{}
};
void solve(void)
{
string s; cin >> s;
int N = s.size();
string keyence = "keyence";
int k = N - keyence.size();
for (int i = 0; i < N; ++i) {
auto sub1 = s.substr(0, i);
if (i + k < N) {
auto sub2 = s.substr(i+k, N);
auto s1 = sub1 + sub2;
if (s1 == keyence) {
cout << "YES" << CRLF;
return;
}
} else {
continue;
}
}
cout << "NO" << CRLF;
return;
}
int main(void)
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
}
| 0
| 50,490,202
|
#include <cmath>
#include <cstdio>
int a, b, c; double d, s, l, f, h, t;
int main() {
scanf("%d%d%d", &a, &b, &c);
d = 1.0 * c / 180.0 * 3.14159265358979;
h = b * sin(d);
f = sqrt(b * b - h * h);
t = a + (c > 90 ? 1.0 : -1.0) * f;
s = a * h / 2.0;
l = a + b + sqrt(t * t + h * h);
printf("%.9f\n", s);
printf("%.9f\n", l);
printf("%.9f\n", h);
return 0;
}
|
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
int n;
int a[210000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long tot = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
tot += a[i];
}
long long ans = 1000000000000000000LL;
long long curt = 0;
for (int i = 0; i < n-1; i++) {
curt += a[i];
ans = min(ans, abs( tot-2*curt ));
}
cout << ans << endl;
return 0;
}
| 0
| 73,980,275
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << ' ' << H;
dbg_out(T...);
}
int main() {
#ifdef LOCAL
freopen("a.txt", "r", stdin);
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
ios::sync_with_stdio(0);
cin.tie(0);
#define endl '\n'
#define dbg(...) 18
#endif
string a, b;
cin >> a >> b;
sort(a.begin(), a.end());
sort(b.rbegin(), b.rend());
dbg(a, b);
if (a < b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int N = 1e5 + 10;
int n , L , T , x[N] , w[N] , ed[N] , ans[N];
int main(){
scanf("%d%d%d",&n,&L,&T);
int pos = 0;
rep(i,0,n) {
scanf("%d%d",x+i,w+i);
if(w[i] == 1) {
ed[i] = (x[i] + T) % L;
pos += (x[i] + T) / L;
pos %= n;
} else {
ed[i] = ((x[i] - T) % L + L) % L;
pos += (x[i] - T) / L - (x[i] < T && (x[i] - T) % L != 0);
pos = (pos % n + n) % n;
}
}
sort(ed , ed + n);
rep(i,0,n) printf("%d\n",ed[(pos+i)%n]);
return 0;
}
| 0
| 31,805,046
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main()
{
int n;
cin >> n;
vector<int> a(n + n);
for(int i = 0; i < n + n; i++)cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
for(int i = 0; i < n; i++){
ans += a[i * 2];
}
cout << ans << endl;
}
|
#include <iostream>
#include <stdlib.h>
using namespace std;
int main(){
string str, code;
int code_num;
cin >> str >> code_num;
for(int i=0; i<code_num; i++){
cin >> code;
int start, end;
string buf;
if(code == "replace"){
cin >> start >> end >> buf;
for(int i=0; i<=end-start; i++){
str[start + i] = buf[i];
}
}else if(code == "reverse"){
cin >> start >> end;
buf = str;
for(int i=0; i<=end-start; i++){
str[start + i] = buf[end - i];
}
}else if(code == "print"){
cin >> start >> end;
for(int i=start; i<=end; i++){
cout << str[i];
}
cout << endl;
}
}
return(0);
}
| 0
| 83,881,434
|
#include<bits/stdc++.h>
using namespace std;
main(){
int n,x,t; cin>>n>>x>>t;
cout<<((n+x-1)/x)*t;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define paf(L,R) pair<L,R>
#define mod 1000000007
#define MAX 510000
#define ALL(a) a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
lli A,B,C,D,E,F,N,M,K,L,X,Y,Z,H,W,sum=0,num=0,flag=0;string S,T;
cin >> N;
vector<int>P{1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
Out(P[N-1]);
}
| 0
| 39,499,707
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cstdint>
#include <vector>
#include <algorithm>
using namespace std;
static const long long MOD = 1000000007LL;
typedef long long ll;
int main()
{
string a;
cin>>a;
for(int i=0;i<4;i++)
cout<<a[i];
cout<<" ";
for(int i=4;i<12;i++)
cout<<a[i];
cout<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <map>
#include <set>
#include <utility>
#include <queue>
#include <bitset>
#include <math.h>
#include <numeric>
using namespace std;
#define rep(i,m,n) for(int i=m;i<(int)(n);i++)
#define endl '\n'
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin>>n;
vector<int> a(n);
rep(i,0,n){
cin>>a[i];
}
int res=0;
rep(i,0,n-1){
if(a[i]==a[i+1]){
res++;
a[i+1]=i+1e9;
}
}
cout<<res<<endl;
}
| 0
| 48,747,063
|
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
const int MAX_N = int(1e6) + 10;
long long int MOD=1e9+7;
const long long int INF=1e18;
typedef long long int ll;
typedef unsigned long long int llu;
inline ll mul(ll a,ll b){
a=(a+MOD)%MOD;
b=(b+MOD)%MOD;
ll c=a*b;
c=(c+MOD)%MOD;
return c;
}
inline ll add(ll a,ll b){
a=(a+MOD)%MOD;
b=(b+MOD)%MOD;
ll ans=(a+b);
ans=(ans+MOD)%MOD;
return ans;
}
ll power(ll a,ll b,ll c=0){
ll ans=1;
while(b){
if(b&1){
ans=mul(ans,a);
}
a=mul(a,a);
b=b/2;
}
return ans;
}
#define all(x) (x).begin(),(x).end()
ll fun(ll &x){
ll low=1;
ll high=100;
ll ans=-1;
while(low<=high){
ll mid=(low+high)/2LL;if(mid*(mid+1)/2LL<=x){ans=mid;low=mid+1;}else{high=mid-1;}
}
return ans;
}
int main(){
ll n;
cin>>n;
map<ll,ll> mp;
for(ll i=2;i*i<=n;i++){
if(n%i==0){
ll cnt=0;
while(n%i==0){
mp[i]++;
n=n/i;
}
}
}
if(n>1){
mp[n]++;
}
ll ans=0;
for(auto it:mp){
ans+=fun(it.second);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
ll solve(int n,int* t,int* a){
int maxh[100000],h[100000];
fill(maxh,maxh+100000,0);
fill(h,h+100000,0);
ll res = 1;
bool isP = 1;
h[0] = t[0];
for(int i = 1;i < n;i ++){
if(t[i]!=t[i-1]) h[i] = t[i];
else maxh[i] = t[i];
}
for(int i = n-1;i >=0;i --){
if(i==n-1||a[i]!=a[i+1]){
if(h[i] && a[i]!=h[i]) {isP = 0;break;}
else h[i] = a[i];
if(maxh[i] && h[i] > maxh[i]) {isP = 0;break;}
}else{
if(a[i]<h[i]) {isP = 0;break;}
else maxh[i] = min(a[i],maxh[i]);
}
}
if(!isP) return 0;
else{
for(int i = 0;i < n;i ++){
if(!h[i]) res = (res*maxh[i])%mod;
}
}
return res;
}
int main(){
int n,t[100000],a[100000];
cin >> n;
for(int i = 0;i < n;i ++){
cin >> t[i];
}
for(int i = 0;i < n;i ++){
cin >> a[i];
}
cout << solve(n,t,a) << endl;
return 0;
}
| 0
| 54,987,875
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < m; i++){
cin >> a[i];
}
int s = 0;
for(int i = 0; i < m;i++)
s += a[i];
if (s > n)
{
cout << "-1" << endl;
}
else
{
cout << n - s << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
for (int c = 0; c < 26; c++) {
int tmp = n - 4 * c;
if (tmp < 0) {
continue;
}
if (tmp % 7 == 0) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| 0
| 46,497,992
|
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#define pb push_back
using namespace std;
const int Maxn = 100010;
vector<int> edge[Maxn];
int n, siz[100010];
void dfs(int u, int fa) {
siz[u] = 1;
int cnt = 0;
for(int it = 0; it < edge[u].size(); ++it)
if(edge[u][it] != fa) {
dfs(edge[u][it], u);
siz[u] += siz[edge[u][it]];
if(siz[edge[u][it]]&1) cnt++;
}
if((n-siz[u])&1) cnt++;
if(cnt >= 2) {
puts("First");
exit(0);
}
}
int main() {
scanf("%d", &n);
for(int i = 1; i < n; ++i) {
int u, v;
scanf("%d%d", &u, &v);
edge[u].pb(v);
edge[v].pb(u);
}
dfs(1, 0);
puts("Second");
return 0;
}
|
#include<stdio.h>
#include<algorithm>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <iostream>
#include <string>
#include <time.h>
#include <functional>
using namespace std;
int dp[1001][1001] = { 0 };
int n, m;
string st1, st2;
int main(void) {
cin >> st1;
cin >> st2;
n = st1.size();
m = st2.size();
dp[0][0] = 0;
for (int i = 0; i <= n; ++i) dp[i][0] = i;
for (int j = 0; j <= m; ++j) dp[0][j] = j;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (st1[i - 1] == st2[j - 1]) dp[i][j] = dp[i - 1][j - 1];
else {
int min = dp[i][j - 1] + 1;
if (min > dp[i - 1][j] + 1) { min = dp[i - 1][j] + 1; }
if (min > dp[i - 1][j - 1] + 1) { min = dp[i - 1][j - 1] + 1; }
dp[i][j] = min;
}
}
}
printf("%d\n", dp[n][m]);
}
| 0
| 14,236,852
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h[i];
int ans=0;
int active=0;
rep(i,n){
if(active >= h[i]){
active = h[i];
}
else{
ans += h[i]-active;
active=h[i];
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
vector<vector<ll> >d(310,vector<ll>(310,inf));
void Warshall_Floyd(ll n){
REP(k,1,n+1){
REP(i,1,n+1){
REP(j,1,n+1)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
int main(){
ll n,m,R;cin>>n>>m>>R;
vector<ll>r(R);
rep(i,R){
cin>>r[i];
}
sort(all(r));
rep(i,m){
ll a,b,c;cin>>a>>b>>c;
d[a][b]=c;
d[b][a]=c;
}
Warshall_Floyd(n);
ll ans=inf*inf;
do{
ll cnt=0;
rep(i,R-1){
cnt+=d[r[i]][r[i+1]];
}
ans=min(ans,cnt);
}while(next_permutation(all(r)));
cout<<ans<<endl;
}
| 0
| 16,627,095
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
using namespace std;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e5 + 10, S2 = 1e7 * 2;
vector<pair<ll, ll>> vec;
vector<ll> cnt, pref;
vector<ll> add[SIZE];
int main() {
fastInp;
ll n;
cin >> n;
cnt.resize(n);
pref.resize(n);
ll curMx = -1, ind = -1;
vector<ll> k(n);
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
k[i] = a;
if (curMx < a) {
vec.push_back({ a, i });
}
else {
}
if (curMx < a) {
ind = i;
}
curMx = max(curMx, a);
}
sort(vec.rbegin(), vec.rend());
curMx = -1, ind = -1;
for (int i = 0; i < n; i++) {
ll a;
a = k[i];
if (curMx < a) {
}
else {
int l = -1, r = vec.size();
while (r - l > 1) {
int mid = (l + r) / 2;
if (vec[mid].first >= a) {
l = mid;
}
else {
r = mid;
}
}
add[l].push_back(a);
}
if (curMx < a) {
ind = i;
}
curMx = max(curMx, a);
}
ll curAdd = 0; vec.push_back({ 0, 0 });
for (int i = 0; i < vec.size() - 1; i++) {
ll s = 0;
for (auto cur : add[i]) {
s += abs(vec[i + 1].first - cur);
}
cnt[vec[i].second] += (i + 1 + curAdd) * abs(vec[i].first - vec[i + 1].first) + s;
curAdd += add[i].size();
}
for (int i = 0; i < n; i++) {
cout << cnt[i] << "\n";
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
int p[n];
for(int i=0;i<n;i++){
cin>>p[i];
}
bool flag=true,flag2=true;
int ans=0;
for(int i=0;i<=n+1||flag2;i++){
int s=x-i;
flag=true;
for(int j=0;j<n;j++){
if(p[j]==s){
flag=false;
break;
}
}
if(flag&&flag2){
ans=s;
flag2=false;
}
flag=true;
s=x+i;
for(int j=0;j<n;j++){
if(p[j]==s){
flag=false;
break;
}
}
if(flag&&flag2){
ans=s;
flag2=false;
}
}
cout<<ans<<"\n";
return(0);
}
| 0
| 87,980,583
|
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main(void)
{
int i,j,k,m[27]={};
char ch;
while ( scanf("%c", &ch) != EOF ){
ch = tolower(ch);
i = ch - 'a' + 1;
m[i] = m[i] + 1;
}
for(k = 1; k <= 26; k++){
j = 0x60 + k;
cout << (char)j << " : " << m[k] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
using namespace std;
int main()
{
int h,w;
while(cin>>h>>w)
{
if(w==0)return 0;
REP(i,h)
{
REP(j,w)cout<<"#";
cout<<endl;
}
cout<<endl;
}
}
| 0
| 79,921,754
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <utility>
#include <tuple>
#include <cctype>
#include <bitset>
#include <complex>
#include <cmath>
#include <array>
#include <numeric>
using namespace std;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pint;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pint> vpint;
int dx[8]={0,0,-1,1,1,1,-1,-1};
int dy[8]={-1,1,0,0,1,-1,1,-1};
const int SIZE=100050;
int main() {
int N;
cin>>N;
vll A;
ll sxor=0;
for(int i=0;i<N;i++){
ll a;
cin>>a;
A.pb(a);
sxor^=a;
}
for(int i=0;i<N;i++)
A[i]&=~sxor;
int r=0;
for(int idx=60;idx>=0;idx--){
bool flag=0;
for(int i=r;i<N;i++){
if((A[i]>>idx)&1){
swap(A[i],A[r]);
flag=1;
break;
}
}
if(flag){
for(int i=0;i<N;i++){
if(i!=r && ((A[i]>>idx)&1))
A[i]^=A[r];
}
r++;
}
}
ll ans=0;
for(int i=0;i<N;i++)
ans^=A[i];
cout<<2LL*ans+sxor<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
int n,k; cin>>n>>k;
int a[n+9];
for(int i=0; i<n; i++) cin>>a[i];
vector<int> dp(n+9, INT_MAX);
dp[0]=0;
if(n==1)
{
cout<<dp[0]<<endl;
return 0;
}
dp[1]= abs(a[0]-a[1]);
if(n==2)
{
cout<<dp[1]<<endl;
return 0;
}
for(int i=2;i<n;i++)
{
for(int j=1;j<=k;j++)
{
if(i-j>=0) dp[i]=min(dp[i-j]+abs(a[i]-a[i-j]),dp[i]);
}
}
cout<<dp[n-1]<<endl;
return 0;
}
| 0
| 10,599,970
|
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int K;
cin >> K;
int dp[105][2][105];
memset(dp, 0, sizeof(dp));
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
int ni = s[i] - '0';
for (int j = 0; j < 105; j++) {
dp[i + 1][1][j + 1] += dp[i][1][j] * 9;
dp[i + 1][1][j] += dp[i][1][j];
if (ni == 0) {
dp[i + 1][0][j] += dp[i][0][j];
} else if (ni != 0) {
dp[i + 1][1][j + 1] += dp[i][0][j] * (ni - 1);
dp[i + 1][1][j] +=
dp[i][0]
[j];
dp[i + 1][0][j + 1] += dp[i][0][j];
}
}
}
ll ans = dp[n][1][K] + dp[n][0][K];
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n;
cin >> n;
vl t(n), l(n + 2), r(n + 2), v(n + 2);
ll now = 0;
rep(i, n) {
cin >> t[i];
l[i] = now;
now += t[i];
r[i] = now;
}
l[n] = now;
r[n] = now;
v[n] = l[n + 1] = r[n + 1] = v[n + 1] = 0;
rep(i, n) cin >> v[i];
ll m = now * 2 + 1;
vd s(m, 1e18);
rep(i, m) rep(j, n + 2) {
double now;
if(i < 2 * l[j])
now = -double(i) / 2.0 + double(l[j]) + double(v[j]);
else if(i > 2 * r[j])
now = double(i) / 2.0 - double(r[j]) + double(v[j]);
else
now = double(v[j]);
s[i] = min(s[i], now);
}
double ans = 0;
rep(i, m - 1) ans += (s[i] + s[i + 1]) / 4.0;
printf("%.15f\n", ans);
}
| 0
| 20,205,486
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A > B) {
cout << "safe" << endl;
}
else {
cout << "unsafe" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
typedef long long ll;
int main(){
ll hh,ww,ans=1e11,s[3];cin>>hh>>ww;
if(!(hh%3)||!(ww%3)) ans=0;
else{
REP(k,2){
ll h,w;
if(k) h=hh,w=ww;
else h=ww,w=hh;
for(ll i=1;i<w;i++){
s[0]=h*i;
if(!(h%2)||!((w-i)%2)) s[1]=s[2]=h*(w-i)/2;
else{
s[1]=min(h,w-i)*(max(h,w-i)/2);
s[2]=h*w-s[0]-s[1];
}
ans=min(ans,max({s[0],s[1],s[2]})-min({s[0],s[1],s[2]}));
}
}
}
cout<<ans<<endl;
}
| 0
| 86,910,048
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001001;
int main(){
int n,m;
cin >> n >> m;
vector<ll> H(n);
rep(i,n) cin >> H[i];
vector<vector<int>> X(n,vector<int>(0));
rep(i,m){
int a,b;
cin >> a >> b;
a--; b--;
X[a].push_back(b);
X[b].push_back(a);
}
int tot = 0;
rep(i,n){
bool ans = true;
for(const auto&it:X[i]){
if(H[i]<=H[it])ans = false;
}
if(ans) tot++;
}
cout << tot << endl;
}
|
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long n,ans=1,sum=0;
cin>>n;
long long a[n+1];
vector <long long> s(n+1,0);
f(i,1,n+1){
cin>>a[i];
}
while(ans!=2&&s[ans]==0){
sum+=1;
s[ans]++;
ans=a[ans];
}
if(ans==2){
cout<<sum<<endl;
}
else{
cout<<-1<<endl;
}
return 0;
}
| 0
| 20,367,204
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define REPI(i, s, e) for (int i = (s); i <= (e); i++)
#define rep(i, n) REP(i, 0, n)
#define repi(i, n) REPI(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define dump(x) (cout << #x << " = " << x << endl)
#define dump2(x, y) (cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl)
typedef long long ll;
typedef pair<int, int> pii;
int day(int y, int m)
{
return (y%3==0||m%2!=0)?20:19;
}
int millennium(int ey, int em, int ed)
{
int cnt = 0;
for (int y = 1; y <= ey; y++) {
for (int m = 1; m <= 10; m++) {
for (int d = 1; d <= day(y, m); d++) {
if (y == ey && m == em && d == ed)
return cnt;
cnt++;
}
}
}
}
int main(void)
{
int n;
cin >> n;
rep(t, n) {
int y, m, d;
cin >> y >> m >> d;
cout << millennium(1000, 1, 1)-millennium(y, m, d) << endl;
}
return 0;
}
|
#include <iostream>
#include <set>
#include <vector>
#include <string>
using namespace std;
void fnDictionary(set<string> &a_rsesKey, vector<string> &a_rvsFind)
{
int iCommandCnt;
cin >> iCommandCnt;
for (int i = 0; i < iCommandCnt; i++)
{
string sCommand;
string sKey;
cin >> sCommand >> sKey;
if (sCommand[0] == 'i')
a_rsesKey.insert(sKey);
else if (sCommand[0] == 'f')
{
auto itsesKey = a_rsesKey.find(sKey);
if (itsesKey != end(a_rsesKey))
a_rvsFind.push_back("yes");
else
a_rvsFind.push_back("no");
}
}
}
void fnResult(const vector<string> &a_cnrvsFind)
{
for (int i = 0; i < a_cnrvsFind.size(); i++)
cout << a_cnrvsFind[i] << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
set<string> sesKey;
vector<string> vsFind;
fnDictionary(sesKey, vsFind);
fnResult(vsFind);
return 0;
}
| 0
| 71,339,651
|
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i,n) for(int i=0; i<n; i++)
#define repm(i,s,n) for(int i=s; i<n; i++)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 1e9+7;
void cout_ynl(bool b) {cout << (b ? "Yes" : "No") << endl;}
void cout_YNU(bool b) {cout << (b ? "YES" : "NO") << endl;}
int ctoi(char c){
if(isdigit(c)) return c - '0';
else if(islower(c)) return c - 'a';
else if(isupper(c)) return c - 'A';
else return -1;
}
char itocd(int i){char c = i+'0'; if(isdigit(c)) return c; else return 0x00;}
char itocl(int i){char c = i+'a'; if(islower(c)) return c; else return 0x00;}
char itocu(int i){char c = i+'A'; if(isupper(c)) return c; else return 0x00;}
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; }
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void graphDijkstra(){}
void graphBellmanFord(){}
void graphWarshallFloyd(){}
ll gcd(ll A, ll B) {if (A%B == 0) {return(B);} else {return(gcd(B, A%B));}}
ll lcm(ll A, ll B) {return A * B / gcd(A, B);}
ll divTimes(ll N, ll D) {ll res = 0; while(N%D == 0) {N/=D; res++;} return res;}
ll powMod(ll B, ll P) {
if(P == 0) return 1;
if(P%2 == 0){ll t = powMod(B, P/2); return t*t % MOD;}
return B * powMod(B, P-1) % MOD;
}
const int FAC_INIT_SIZE = 1e6+9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_INIT_SIZE; 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 factMod(ll N){return fac[N] % MOD;}
ll factInvMod(ll N){return finv[N] % MOD;}
ll permMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else return factMod(N) * factInvMod(N-K) % MOD;
}
ll combMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else if (N < FAC_INIT_SIZE){ return factMod(N) * (factInvMod(K) * factInvMod(N-K) % MOD) % MOD;}
else {
ll ans = 1; ll Ks = K < N-K ? K : N-K;
for (ll i = N; i > N-Ks; i--) {ans *= i; ans %= MOD;}
return ans * factInvMod(Ks) % MOD;
}
}
vector<bool> sieve;
void sieveInit(ll size){
sieve.clear();
if(size < 0 || size > INF) return;
int ss = (int)size+9;
int ssq = sqrt(ss+0.1);
sieve.resize(ss);
sieve[2] = sieve[3] = true;
int n = 0;
for (int z = 1; z <= 5; z += 4) {
for (int y = z; y <= ssq; y += 6) {
for (int x = 1; x <= ssq && (n = 4*x*x+y*y) < ss; x++) sieve[n] = !sieve[n];
for (int x = y+1; x <= ssq && (n = 3*x*x-y*y) < ss; x += 2) sieve[n] = !sieve[n];
}
}
for (int z = 2; z <= 4; z += 2) {
for (int y = z; y <= ssq; y += 6) {
for (int x = 1; x <= ssq && (n = 3*x*x+y*y) < ss; x += 2) sieve[n] = !sieve[n];
for (int x = y+1; x <= ssq && (n = 3*x*x-y*y) < ss; x += 2) sieve[n] = !sieve[n];
}
}
for (int z = 1; z <= 2; z++) {
for (int y = 3; y <= ssq; y += 6) {
for (int x = z; x <= ssq && (n = 4*x*x+y*y) < ss; x += 3) sieve[n] = !sieve[n];
}
}
for (int k = 5; k <= ssq; k++)
if (sieve[k])
for (int n = k*k; n < ss; n += k*k) sieve[n] = false;
}
map<ll, map<ll, ll>> primeFactorMap;
map<ll, set<ll>> primeFactorSet;
void primeFactorizeInit(){primeFactorMap.clear(); primeFactorSet.clear();}
void primeFactorize(ll N){
if (N < 0 || N > INF_L) return;
ll Nc = N, Nsq = sqrt(N+0.1);
for (int k = 2; k <= Nsq; k++) {
ll dt = 0; while(Nc%k == 0) {dt++; Nc /= k;}
if(dt > 0) primeFactorMap[N][k] = dt;
if(N%k == 0) {primeFactorSet[N].insert(k); primeFactorSet[N].insert(N/k);}
}
if (Nc != 1) primeFactorMap[N][Nc] = 1;
primeFactorSet[N].insert(1);
primeFactorSet[N].insert(N);
}
void solve() {
ll X, Y, A, B, C; cin >> X >> Y >> A >> B >> C;
ll p[A]; rep(i, A) cin >> p[i]; sort(p, p+A, greater<ll>());
ll q[B]; rep(i, B) cin >> q[i]; sort(q, q+B, greater<ll>());
ll r[C]; rep(i, C) cin >> r[i]; sort(r, r+C, greater<ll>());
ll res = 0, pq[X+Y];
rep(i, X) {pq[i] = p[i]; res += pq[i];}
rep(i, Y) {pq[i+X] = q[i]; res += pq[i+X];}
sort(pq, pq+X+Y);
rep(i, C) {
if(r[i] > pq[i]) res += r[i] - pq[i];
else break;
}
cout << res << endl;
}
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const ll INF = 2e15;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main(){
ll n,k;
cin>>n>>k;
ll sum=0;
for(ll i=k;i<=n+1;i++){
ll mini=i*(i-1)/2-1;
ll maxi=(n*(n+1)/2)-((n-i)*(n-i+1)/2);
sum+=maxi-mini;
sum%=MOD;
}
print(sum);
}
| 0
| 78,758,126
|
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
#define pb(n) push_back(n)
#define mp(n,m) make_pair(n,m)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,a,b) for(int i=(a); i<(b); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int IMAX=((1<<30)-1)*2+1;
const double EPS=1e-10;
string t[10]={
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main(){
int n;
string s;
cin>>n;
rep(i,n){
cin>>s;
string a;
rep(j,s.size()){
if(s[j]!='0'){
char c=t[s[j]-'0'][0];
int k=0;
while(1){
j++;
if(j>s.size())break;
if(s[j]=='0'){
a+=c;
break;
}
k=(k+1)%t[s[j]-'0'].size();
c=t[s[j]-'0'][k];
}
}
}
cout<<a<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
vector<int> problem(3);
for(int i=0; i<n; i++){
int p;
cin >> p;
if(p <= a) problem[0] += 1;
if(a+1 <= p && p <= b) problem[1] += 1;
if(b+1 <= p) problem[2] += 1;
}
sort(problem.begin(),problem.end());
cout << problem[0] << endl;
return 0;
}
| 0
| 95,962,561
|
#include <iostream>
using namespace std;
int num[105];
int main() {
int N, mx=0; cin >> N;
for(int i=0; i<N; ++i){
int a;
cin >> a;
++num[a];
mx=max(mx, a);
}
bool flag=true;
for(int i=1; i<=mx; ++i){
if(i*2<=mx-1){
if(num[i]>0) flag=false;
}
else if(i==(mx+1)/2){
if(num[i]!=mx%2+1) flag=false;
}
else if(num[i]<2) flag=false;
}
cout << (flag ? "Possible" : "Impossible") << endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
string hyo[]={".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",};
main(){
string in;
int n;
cin>>n;
while(n--){
cin>>in;
string out;
int zen='0';
int c=0;
for(int i=0;i<in.size();i++){
if(in[i]=='0' && zen!='0'){
zen-='1';
int s=hyo[zen].size();
--c;
c%=s;
out+=hyo[zen][c];
c=0;
zen=in[i];
}else if(in[i]=='0' && zen=='0'){
continue;
}else if(zen=='0' && in[i]!=0){
c=1;
zen=in[i];
}else if(in[i]==zen){
++c;
}
}
cout<<out<<endl;
}
}
| 0
| 85,384,672
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax, m) {
V a(m);
rep(i, m) cin >> a[i];
int ans = -1;
int ma_gap = -1;
rep(i, m) {
if (nmin <= i + 1 && i + 1 <= nmax) {
int now_gap = a[i] - a[i + 1];
if (now_gap >= ma_gap) {
ans = i + 1;
ma_gap = now_gap;
}
}
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n;
ll a[100005];
ll ans;
ll mx, mn;
ll f(ll p)
{
for(ll i = 1; i <= n; i++)
{
p = p / a[i] * a[i];
}
return p;
}
int main()
{
scanf("%lld", &n);
for(ll i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
}
ll lt, rt, mid, ans;
lt = 2;
rt = 4e18;
while(lt <= rt)
{
mid = (lt + rt) / 2;
if(f(mid) > 2) rt = mid - 1;
else ans = mid, lt = mid + 1;
}
mx = ans;
lt = 2;
rt = 4e18;
while(lt <= rt)
{
mid = (lt + rt) / 2;
if(f(mid) < 2) lt = mid + 1;
else ans = mid, rt = mid - 1;
}
mn = ans;
if(mn > mx) printf("-1\n");
else printf("%lld %lld\n", mn, mx);
return 0;
}
| 0
| 19,838,422
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n; cin >> n;
cout << n * (n+1) / 2 << endl;
}
|
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
typedef struct{
double x;
double y;
}XY;
bool flagfirst=true;
bool test=true;
int counter=0;
void kochCurve(XY p1,XY p2,int n){
XY s,u,t;
s.x=(2*p1.x+p2.x)/3;
s.y=(2*p1.y+p2.y)/3;
t.x=(p1.x+2*p2.x)/3;
t.y=(p1.y+2*p2.y)/3;
u.x=(t.x-s.x)*cos(M_PI/3)-(t.y-s.y)*sin(M_PI/3)+s.x;
u.y=(t.x-s.x)*sin(M_PI/3)+(t.y-s.y)*cos(M_PI/3)+s.y;
if(flagfirst==true) {
printf("%.8f %.8f\n",p1.x,p1.y);
flagfirst=false;
}
if(n>0){
kochCurve(p1,s,n-1);
printf("%.8f %.8f\n",s.x,s.y);
kochCurve(s,u,n-1);
printf("%.8f %.8f\n",u.x,u.y);
kochCurve(u,t,n-1);
printf("%.8f %.8f\n",t.x,t.y);
kochCurve(t,p2,n-1);
}
}
int main(){
int n;
XY p1,p2;
cin >>n;
p1.x=0;
p1.y=0;
p2.x=100;
p2.y=0;
kochCurve(p1,p2,n);
printf("%.8f %.8f\n",p2.x,p2.y);
return 0;
}
| 0
| 35,345,264
|
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e9+7;
void solve(){
char a, b; cin>>a>>b;
cout<<(a!=b?"D":"H")<<endl;
}
int main(){
solve();
Bye;
}
|
#include <stdio.h>
#define N 100000
#define NIL -1
int Depth(int );
void display(int );
struct Node {
int parent;
int left;
int right;
};
struct Node T[N];
int n,D[N];
int main()
{
int a,b,i,j,l,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
T[i].parent=NIL;
T[i].left=NIL;
T[i].right=NIL;
}
for(i=0;i<n;i++)
{
scanf("%d%d",&l,&m);
for(j=0;j<m;j++)
{
scanf("%d",&a);
if(j==0) T[l].left=a;
else T[b].right=a;
b=a;
T[a].parent=l;
}
}
for(i=0;i<n;i++)
{
D[i]=Depth(i);
}
for(i=0;i<n;i++)
{
display(i);
}
return 0;
}
int Depth(int a)
{
int d=0;
while(T[a].parent!=-1)
{
a=T[a].parent;
d++;
}
return d;
}
void display(int x)
{
int i,j;
printf("node %d: parent = %d, depth = %d, ",x,T[x].parent,D[x]);
if(T[x].parent==-1) printf("root, ");
else if(T[x].left==-1) printf("leaf, ");
else printf("internal node, ");
printf("[");
for(i=0,j=T[x].left;j!=NIL;i++,j=T[j].right)
{
if(i) printf(", ");
printf("%d",j);
}
printf("]\n");
}
| 0
| 67,469,021
|
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll mininf = -922337203685477;
const ll nax = 0;
int n, arr[105], cnt=0;
int main(){
IOS
cin >> n;
for(int i=0;i<n;i++){
cin >> arr[i];
}
cnt=arr[0];
for(int i=1;i<n;i++){
if(arr[i]>=arr[i-1]){
cnt+=arr[i]-arr[i-1];
}
}
printf("%d\n", cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return result;
}
int gcd(int a,int b)
{
if(b==0)
{
return a;
}
return gcd(b,a%b);
}
void sieve()
{
memset(isPrime,1,sizeof(isPrime));
isPrime[0] = isPrime[1] = 0;
for(int i=2;i*i<=1000000;i++)
{
if(isPrime[i])
{
for(int j=i*i;j<=1000000;j+=i)
{
isPrime[j] = 0;
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL),cout.tie(NULL);
string s1,s2;
cin>>s1>>s2;
int count = 0;
for(int i=0;i<s1.size();i++)
{
if(s1[i]!=s2[i])
{
count++;
}
}
cout<<count;
return 0;
}
| 0
| 70,062,160
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.