code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
int H1, M1, H2, M2, K;
cin >> H1 >> M1 >> H2 >> M2 >> K;
int m1 = H1 * 60 + M1;
int m2 = H2 * 60 + M2;
cout << m2 - m1 - K << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
const ll N = 1e5;
const ll M = 1e6;
const ll A = 1e7;
const ll inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10;
const double pi = 3.141592653589793238463;
const ll lx[4] = {0, 0, 1, -1};
const ll ly[4] = {1, -1, 0, 0};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
void solve()
{
ll n, m; cin >> n >> m;
char a[n][n], b[m][m];
rep(i, n) rep(j, n) cin >> a[i][j];
rep(i, m) rep(j, m) cin >> b[i][j];
rep(i, n-m+1)
{
rep(j, n-m+1)
{
ll f = 0;
rep(k, m)
{
rep(l, m)
{
if(a[i+k][j+l] != b[k][l] ) {f = 1; break;}
}
if(f) break;
}
if(!f) ANS("Yes");
}
}
ANS("No");
}
int main(int argc, char const* argv[])
{
ll t = 1;
while(t--) {
solve();
}
return 0;
}
| 0
| 89,885,220
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int sl, tl;
sl = (int) S.length();
tl = (int) T.length();
if (sl + 1 != tl) {
cout << "No" << endl;
return 0;
}
for (int i=0; i<sl; i++){
if (S.at(i) != T.at(i)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int count =0;
cin>>s;
string ans="AC";
if(s[0]!='A')
{
ans="WA";
}
int a=s.length();
for(int i=1;i<a;i++)
{
if(isupper(s[i]))
{
if(i==1|| i==a-1||s[i]!='C')
{
ans="WA";
}
count++;
}
}
if(count!=1)
{
ans= "WA";
}
cout<<ans<<"\n";
return 0;
}
| 0
| 53,964,154
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n) != EOF) {
int cnt = 0;
for (int a = 0; a <= 9; a++) {
for (int b = 0; b <= min(n - a, 9); b++) {
for (int c = 0; c <= min(n - a - b, 9); c++) {
if (0 <= n - a - b - c && n - a - b - c <= 9) cnt++;
}
}
}
cout << cnt << endl;
}
}
|
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int H, W, D; cin >> H >> W >> D;
vector<vector<int>> a(H, vector<int>(W));
vector<pair<int, int>> b(H * W + 1);
rep(i, H)rep(j, W){
int num;
cin >> num;
b[num] = make_pair(i, j);
a[i][j] = num;
}
vector<vector<int>> cost(D + 1);
for(int i = 1; i <= D; i++){
int k = 1;
cost[i].push_back(0);
while(i + k * D <= H * W){
cost[i].push_back(abs(b[i + k * D].first - b[i + (k - 1) * D].first) + abs(b[i + k * D].second - b[i + (k - 1) * D].second) + cost[i][k - 1]);
k++;
}
}
int Q;
cin >> Q;
vector<int> ans;
rep(i, Q){
int L, R; cin >> L >> R;
int t = L % D;
if(t == 0) t = D;
R -= D;
L -= D;
ans.push_back(cost[t][(R + (D - 1)) / D] - cost[t][(L + (D - 1)) / D]);
}
rep(i, Q)cout << ans[i] << endl;
}
| 0
| 96,532,198
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
getline(cin, s);
for (int i = 0; i < s.size(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
s[i] += 'A' - 'a';
}
else if (s[i] >= 'A' && s[i] <= 'Z') {
s[i] += 'a' - 'A';
}
}
cout << s << endl;
return 0;
}
|
#include <stdio.h>
int main (){
long long int n;
long long int t=1;
scanf("%lld",&n);
long long int A[n];
for(int i=0; i<n; i++){
scanf("%lld", &A[i]);
}
for(int j=0; j<n; j++){
if(A[j] == 0){
printf("0");
return 0;
}
}
for(int k=0; k<n; k++){
if(A[k] <= 1000000000000000000/t){
t = t*A[k];
}
else {
printf("-1");
return 0;
}
}
printf("%lld", t);
return 0;
}
| 0
| 61,745,296
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int ans;
if (B <= C || D <= A) ans = 0;
else ans = min(B, D) - max(A, C);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char& c){
string res;
return "'" + res + c + "'";
}
string to_string(bool b) {
return (b ? "True" : "False");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr<<endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "\t[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int numA, numB, A, B, C;
cin >> numA >> numB >> A >> B >> C;
vector<int> a1(A), b1(B), c(C);
for (int i = 0; i < A; ++i)
cin >> a1[i];
for (int i = 0; i < B; ++i)
cin >> b1[i];
for (int i = 0; i < C; ++i)
cin >> c[i];
sort(a1.rbegin(), a1.rend());
sort(b1.rbegin(), b1.rend());
sort(c.rbegin(), c.rend());
vector<int> a(a1.begin(), a1.begin() + numA);
vector<int> b(b1.begin(), b1.begin() + numB);
long long a_sum = accumulate(a.begin(), a.end(), (long long) 0);
long long b_sum = accumulate(b.begin(), b.end(), (long long) 0);
debug(a, b);
for (int i = 0; i < C; ++i) {
int diff1 = (a.empty() ? - 1 : c[i] - a.back());
int diff2 = (b.empty() ? -1 : c[i] - b.back());
if (diff1 >= diff2 && diff1 > 0) {
a_sum += diff1;
a.pop_back();
}
else if (diff2 > diff1 && diff2 > 0) {
b_sum += diff2;
b.pop_back();
}
}
long long ans = a_sum + b_sum;
cout << ans << '\n';
return 0;
}
| 0
| 84,267,263
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N + 1);
int a;
for(int i = 0; i < N; i++){
cin >> a;
A.at(a)++;
}
int b = 0;
for(int i = 0; i < A.size(); i++){
if(A.at(i) != 0){
b++;
}
}
int c = b - K;
sort(A.begin(), A.end());
int sum = 0;
if(c > 0){
for(int i = 0; i < A.size(); i++){
if(A.at(i) != 0){
sum += A.at(i);
c--;
}
if(c == 0){
break;
}
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF_LL 1LL << 40
#define INF 1 << 31
#define MOD 1000000007
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;
typedef vector<vector<int>> matrix;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int sign[2] = {1, -1};
template <class T> bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
struct edge {
int to, cost;
};
ll dp[301][301][301];
int main() {
rep(i, 301) rep(j, 301) rep(k, 301) dp[i][j][k] = INF_LL;
dp[0][0][0] = 0;
int n, a;
cin >> n >> a;
vi h(n + 1, 0);
rep(i, n) cin >> h[i + 1];
rep(i, n) rep(j, i + 2) rep(k, i + 1) {
if(dp[i][j][k] == INF_LL) {
continue;
}
chmin(dp[i + 1][j + 1][k], dp[i][j][k]);
chmin(dp[i + 1][j][i + 1], dp[i][j][k] + max(0, h[i + 1] - h[k]));
}
ll ans = INF_LL;
rep(j, n + 1) chmin(ans, dp[n][a][j]);
cout << ans << endl;
}
| 0
| 19,577,658
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int K,A,B;
cin >> K >> A >> B;
for(int i=A;i<B+1;i++){
if(i%K==0){
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int n;
cin >> n;
int b = 0;
int bPrev = 0;
int64_t sum = 0;
for(int i=1;i<n;i++){
cin >> b;
if(i==1){
bPrev = b;
sum = b;
continue;
}
sum += min(b,bPrev);
bPrev = b;
}
sum += b;
cout << sum << endl;
return 0;
}
| 0
| 30,878,057
|
#include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double lb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main() {
ll N,M;
cin >> N >> M;
vector<ll> L(M),R(M);
rep(i,M){
cin >> L[i] >> R[i];
}
ll maxValue=LLONG_MAX,minValue=0;
rep(i,M){
minValue = max(minValue,L[i]);
maxValue = min(maxValue,R[i]);
}
ll ans=0;
rep(i,N+1){
if(minValue <= i+1 && i+1 <= maxValue){
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)
template<class T, class U> bool chmax(T &a, U b) { if (a < b) a = b; return true; }
template<class T, class U> bool chmin(T &a, U b) { if (a > b) a = b; return true; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
int ans = 1, mx = 0;
rep2(i, 1, n) {
int score = 0;
int j = i;
while (j % 2 == 0) {
j /= 2;
++score;
}
if (mx < score) {
mx = score;
ans = i;
}
}
cout << ans << endl;
return (0);
}
| 0
| 46,660,360
|
#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
typedef long long ll;
int main()
{
ll k,x;
scanf("%lld%lld",&k,&x);
if(k*500>=x){
printf("Yes");
}
else{
printf("No");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
int cnt = 0;
long long sumM = 0;
for (int i = 0; i < N; i++) {
int B;
cin >> B;
A[i] -= B;
if (A[i] < 0) {
sumM += -A[i];
cnt++;
}
}
if (cnt == 0) {
cout << 0 << endl;
return 0;
}
sort(A.begin(), A.end(), greater<int>());
long long sumP = 0;
int ans = cnt;
for (int i = 0; i < N - cnt; i++) {
sumP += A[i];
ans++;
if (sumP >= sumM) break;
}
if (sumP >= sumM) cout << ans << endl;
else cout << -1 << endl;
}
| 0
| 82,665,112
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int current, target;
cin >> current >> target;
cout << target * 2 - current << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define all(x) (x).begin(),(x).end()
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
map<string,ll> m;
ll N;
string S;
cin>>N>>S;
rep(i,0,N){
ll now = ll(S[i]-'0');
rep(j,0,100){
string l = j<=9?"0" + to_string(j):to_string(j);
if(m[l] > 0){
if(m[l+to_string(now)] == 0)m[l+to_string(now)]++;
}
}
rep(j,0,10){
if(m[to_string(j)] > 0){
if(m[to_string(j)+to_string(now)] == 0)m[to_string(j)+to_string(now)]++;
}
}
if(m[to_string(now)] == 0)m[to_string(now)]++;
}
ll ans=0;
rep(i,0,1000){
string l;
if(i <= 9)l += "0";
if(i <= 99)l += "0";
l += to_string(i);
if(m[l] >= 1){
ans++;
}
}
cout<<ans;
return 0;
}
| 0
| 68,837,867
|
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define ALLr(x) (x).rbegin(), (x).rend()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
const int INF = 1001001001;
int main(void){
ll n, k;
cin >> n >> k;
double ans = 0;
REP(i, n){
ll d = i+1;
ll m = 0;
while(d < k){
m++;
d *= 2;
}
double p = 1.0/n * pow(0.5, m);
ans += p;
}
printf("%.10f\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
void c_p_c()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
int a, b;
cin >> a >> b;
int p = a * b;
if (p & 1)
cout << "Odd";
else
cout << "Even";
}
| 0
| 52,937,112
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,r) for(int i = 0; i < (r); i++)
#define pb push_back
#define ALL(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define uint unsigned long long
#define endl '\n'
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const map<T,T> &vec){ os<< "{"; for (auto p : vec) os << "(" << p.first << "," << p.second << "), "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_map<T,T>&vec){ os<< "{"; for (auto p : vec) os << "(" << p.first << "," << p.second << "), "; os << "}"; return os; }
string n;
int k;
int dp[110][2][5];
int solve(int i, int flag, int n0) {
if (n0 > k) return 0;
if (i == n.size()) {
return (n0 == k);
}
int& res = dp[i][flag][n0];
if (res != -1) return res;
res = 0;
int maxi = flag ? n[i] - '0' : 9;
for (int idx = 0; idx <= maxi; idx++) {
res += solve(i + 1, flag && (idx == maxi), n0 + (idx != 0));
}
return res;
}
signed main() {
fastio;
cin >> n >> k;
memset(dp, -1, sizeof(dp));
cout << solve(0, 1, 0) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
string s;
cin>>s;
ll cnt = 0;
int b=0;
REP(i,0,s.length()-1) {
if(s[i]=='W')cnt+=b;
else b++;
}
cout<<cnt;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
| 0
| 1,993,958
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int c;
string s;
cin>>s;
if(s=="RSR"||s=="RSS"||s=="SSR"||s=="SRS")c=1;
else if(s=="RRR"){c=3;}
else if(s=="SSS"){c=0;}
else c=2;
cout<<c;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll dp[101][4][2];
int main() {
string N;
int K;
cin >> N >> K;
int L = N.size();
dp[0][0][0] = 1;
rep(i, L) rep(j, 4) rep(l, 2) {
int nd = N[i] - '0';
rep(d, 10) {
int ni = i + 1;
int nj = j;
int nl = l;
if (d > 0) nj++;
if (nj > K) continue;
if (l == 0) {
if (d > nd) continue;
if (d < nd) nl = 1;
}
dp[ni][nj][nl] += dp[i][j][l];
}
}
ll ans = dp[L][K][0] + dp[L][K][1];
cout << ans << endl;
return 0;
}
| 0
| 65,476,401
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N=2e5+9;
const int mod=1e9+7;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int x,y;
cin>>x>>y;
for(int i=0;i<=x;i++){
for(int j=0;j<=x;j++){
int c=i+j;
int cc=i*2+j*4;
if(c==x&&cc==y){
cout<<"Yes";
return 0;
}
}
}
cout<<"No";
}
|
#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
int gcd(int a,int b){
return b ? gcd(b, a % b) : a;
}
int lcm(int a,int b){
return b / gcd(a,b) * a;
}
signed main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> a(n),b(n);
for(int i = 0;i < n;i ++) cin >> a.at(i) >> b.at(i);
int ans = 0;
for(int i = n-1;i >= 0;i --){
int c = a.at(i) + ans;
if(c % b.at(i) == 0) continue;
else ans += (b.at(i) - c % b.at(i));
}
cout << ans << endl;
}
| 0
| 40,018,455
|
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int l = S.size();
int Ans = 1000;
for ( int i=0; i<=l-3; i++ ) {
int num = ( S[i]-'0' )*100 + ( S[i+1]-'0' )*10 + ( S[i+2]-'0');
Ans = min( Ans, abs( num-753 ) );
}
cout << Ans << endl;
}
|
#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 (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
void Main()
{
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll pred = 0;
ll v = a[0];
repi(i, n) {
ll gcd = GCD(v, a[i]);
v = v * (a[i]) / gcd;
}
v /= 2;
rep(i, n) {
if (v % a[i] != a[i] / 2) {
put(0);
return;
}
}
put((m / v + 1) / 2);
}
signed main(){ Main();return 0;}
| 0
| 27,034,790
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
if(s[5]=='1'||s[6]>'4')cout<<"TBD"<<endl;
else cout<<"Heisei"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
vector<vector<int>> adj;
vector<pair<int, int>> DP;
const int inf = (int)1e9 + 7;
void dfs(int i, int p)
{
long long n1 = 1, n2 = 1;
for (auto x : adj[i])
{
if (x == p)
continue;
dfs(x, i);
n1 *= (long long) (DP[x].first + DP[x].second);
n2 *= DP[x].first;
n1 %= inf;
n2 %= inf;
}
DP[i].first = n1;
DP[i].second = n2;
}
int main()
{
cin >> n;
adj.resize(n + 1);
DP.resize(n + 1);
int a, b;
for (int i = 0; i < n - 1; i++)
{
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(1, 1);
cout << (DP[1].first + DP[1].second)%inf << endl;
}
| 0
| 17,309,947
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int left = a + b;
int right = c + d;
string lr = "";
if (left > right){
lr = "Left";
} else if (left == right){
lr = "Balanced";
} else {
lr = "Right";
}
cout << lr << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
cin >> N;
vector<int> a(N+1,0);
rep(i,N) cin >> a[i];
ll ans = 0;
rep(i,N){
ans += a[i]/2;
a[i] %= 2;
if(a[i] & (a[i + 1]>0)){
ans++;
a[i+1]--;
}
}
cout << ans << endl;
}
| 0
| 77,021,843
|
#include<iostream>
using namespace std;
int main(){
int n,max=0;
int a[101];
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(max<a[i]-a[j]){max=a[i]-a[j];}
}
}
cout << max;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define il inline
#define INF 0x3f3f3f3f
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dep(i,a,b) for(int i=(a);i>=(b);--i)
#define pb push_back
const int mod = 1e9 + 7;
const int maxn = 1e3 + 10;
const int maxm = 2e5 + 10;
const double PI = acos(-1.0);
struct point{
double x,y;
}s[maxn];
bool cmp(point &a, point &b) {
if(atan2(a.y,a.x) != atan2(b.y,b.x)) return atan2(a.y,a.x) < atan2(b.y,b.x);
return a.x < b.x;
}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
int n;
cin >> n;
rep(i,1,n) cin >> s[i].x >> s[i].y;
sort(s + 1, s + 1 + n , cmp);
rep(i,1,n) s[i + n] = s[i];
double ans = 0;
rep(i,1,n) {
double xx = 0, yy = 0;
rep(j,i,i + n - 1) {
xx += s[j].x;
yy += s[j].y;
ans = max(ans, xx * xx + yy * yy);
}
}
cout << setprecision(30) << sqrt(ans) << endl;
return 0;
}
| 0
| 48,050,912
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define drep(i, n) for(int i = n - 1; i >= 0; i--)
#define itrep(itr, base) for (auto itr = base.begin(); itr != base.end(); itr++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define yes cout << "yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define no cout << "no" << endl
#define PI 3.14159265359
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
void P(int x) {cout << x << endl;}
void P(long x) {cout << x << endl;}
void P(double x) {cout << x << endl;}
void P(ll x) {cout << x << endl;}
void P(string x) {cout << x << endl;}
void P(char x) {cout << x << endl;}
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() {
int h[2], m[2], k;
cin >> h[0] >> m[0] >> h[1] >> m[1] >> k;
int up = h[0] * 60 + m[0];
int down = h[1] * 60 + m[1];
if (down - up - k < 0) {
P(0);
} else {
P(down - up - k);
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define all(x) (x).begin(),(x).end()
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
ll N,M;
cin>>N>>M;
v A(N);
rep(i,0,N)cin>>A[i];
v sum(N,0);
map<ll,ll> m;
sum[0] = A[0]%M;
m[sum[0]]++;
rep(i,1,N){
sum[i] = (sum[i-1] + A[i]) % M;
m[sum[i]]++;
}
ll ans = 0;
for(pair<ll,ll> elem : m){
if(elem.first == 0)ans+=elem.second * (elem.second+1)/2 ;
else ans += elem.second*(elem.second-1)/2;
}
cout<<ans;
return 0;
}
| 0
| 24,584,310
|
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = 1<<30;
const ll mod = 1000000007LL;
int main() {
ll N;
cin>>N;
vector<ll> v(N);
for(ll i = 0; i < N; i++) cin>>v[i];
map<ll,ll> m;
for(ll i = 0; i < N; i++) m[v[i]]=i;
sort(v.begin(),v.end());
ll cnt = 0LL;
for(ll i = 0; i < N; i++){
ll t = i-m[v[i]];
if(t%2LL!=0) cnt++;
}
cout<<cnt/2<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int divisors(int n)
{
int ret = 0;
for (int i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret++;
if (n / i != i)
ret++;
}
}
return ret;
}
int main()
{
int n;
cin >> n;
int ans = 0;
rep (i, n + 1)
if (divisors(i) == 8 && i % 2 == 1)
ans++;
cout << ans << endl;
return 0;
}
| 0
| 81,449,513
|
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define uniq(v) v.erase(unique(v.begin(),v.end()),v.end())
#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())
using Pair = pair<ll,pair<int,int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod=1000000007;
const ld pi=acos(-1.0);
const ll INF = 1LL<<61;
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 x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a;
cin>>a;
int cnt=1;
vector<bool> p(1000005,false);
while(1){
if(p[a]){
cout << cnt << endl;
return 0;
}
p[a]=true;
cnt++;
if(a%2==0) a/=2;
else a=a*3+1;
}
}
|
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <set>
#include <map>
#define INF 100000
using namespace std;
typedef long long int ll;
int main(){
vector<int> era(10000000,0);
for (int i=1; i<era.size(); i++) {
era[i]=1;
}
for (int i=2; i<era.size(); i++) {
if (era[i]!=0) {
int q = i + i;
while (q<era.size()) {
era[q]=0;
q += i;
}
}
}
int n;
while (cin >> n) {
int ans=-1;
for (int i=1; i<=n; i++) {
if (era[i]) {
ans++;
}
}
cout << ans <<endl;
}
}
| 0
| 9,255,996
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define gcd __gcd
#define rep(i,s,end) for(int i = (s); i < (end); ++i)
#define rep0(i, end) for(int i = 0; i <= (end); ++i)
#define rep1(i, end) for(int i = 1; i <= (end); ++i)
#define lb lower_bound
#define ub upper_bound
#define vt vector
#define endl "\n"
#define fileopen(filename, in_type, out_type) if (fopen(filename in_type, "r")) {freopen(filename in_type, "r", stdin);freopen(filename out_type, "w", stdout);}
#define local_input(x) if (x && fopen("input.txt","r")) freopen("input.txt","r",stdin);
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define fscan(x) scanf("%d", &x)
#define fscandb(x) scanf("%lf", &x)
#define fscanll(x) scanf("%lld",&x)
#define db double
#define ll long long
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define pi 3.1415926535897932
#define mn 1 << 18
int n;
int id1[mn],id2[mn],dp1[mn],dp2[mn];
signed main()
{
cin >> n; rep(i,0,1 << n){
cin >> dp1[i]; id1[i] = i, dp2[i] = id2[i] = -1;
}
rep(i,1,1 << n){
rep(j,0,n) if(i & (1 << j)){
int jj = i ^ (1 << j);
if(jj){
if(id1[i] == id1[jj]) continue;
else if(dp1[i] <= dp1[jj]){
dp2[i] = dp1[i], id2[i] = id1[i];
dp1[i] = dp1[jj], id1[i] = id1[jj];
if(dp2[i] <= dp2[jj] && id2[i] != id2[jj]){
dp2[i] = dp2[jj], id2[i] = id2[jj];
}
}
else if(dp2[i] <= dp1[jj] && id2[i] != id1[jj]){
dp2[i] = dp1[jj], id2[i] = id1[jj];
}
}
else{
if(dp1[0] > dp1[i]){
dp2[i] = dp1[i], id2[i] = id1[i];
dp1[i] = dp1[0], id1[i] = id1[0];
}
else if(dp1[0] > dp2[i]){
dp2[i] = dp1[0], id2[i] = id1[0];
}
}
}
}
int ans = 0;
rep(i,1,1 << n){
cout << (ans = max(ans, dp1[i] + dp2[i])) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fill(x,v) memset(x,v,sizeof(x))
#define FOR(i,a,b) for(int i = int(a); i < int(b); ++i)
#define trace(x) cout << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define N 100050
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
ll dp[N];
ll solve(int k){
priority_queue<ii,vector<ii>,greater<ii> > pq;
FOR(i,0,k) dp[i] = LLONG_MAX;
FOR(i,1,10){
pq.push(ii(i,i%k));
dp[i%k] = i;
}
while(1){
ii top = pq.top();
pq.pop();
ll sum = top.first, mod = top.second;
if(mod == 0) return sum;
FOR(i,0,10){
ll nmod = (mod*10+i)%k, nsum = sum + i;
if(dp[nmod] > nsum){
dp[nmod] = nsum;
pq.push(ii(nsum,nmod));
}
}
}
return 0;
}
int main(){
int k;
cin >> k;
cout << solve(k) << endl;
return 0;
}
| 0
| 45,298,480
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;cin>>s;
int n = s.size();
sort(s.begin(),s.end());
rep(i,n-1)if(s[i+1]==s[i]){
cout<<"no"<<endl;
return 0;
}
cout<<"yes"<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
{
int N,ANS=0;
cin >> N;
for(int i=0;i<N;i++){
int a,b;
cin >> a >> b;
ANS=ANS+b-a+1;
}
cout << ANS << endl;
}
| 0
| 32,208,063
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll x,y;
cin >> x >> y;
if(x*y>0){
if(y>=x) cout << y-x << endl;
else cout << x-y+2 << endl;
}
else if(x*y==0){
if(y<0 || x>0) cout << abs(x+y)+1 << endl;
else cout << abs(x+y) << endl;
}
else{
x = abs(x),y=abs(y);
if(y>=x) cout << y-x+1 << endl;
else cout << x-y+1 << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int x, y;
while (cin>>x>>y) {
if (x==0 && y==0) continue;
if (x > y) {
cout << y << ' ' << x << endl;
} else {
cout << x << ' ' << y << endl;
}
}
return 0;
}
| 0
| 23,963,973
|
#include <iostream>
using namespace std;
int main()
{
string x;
while (cin >> x, x != "0") {
int y = 0;
while (!x.empty()) {
y += x[0] - '0';
x = x.substr(1);
}
cout << y << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, mod = 1e9+7;
vector<ll> x, y;
ll f(vector<ll> &v){
int p = v.size()-1;
vector<ll> a(p, 0), b(p, 0);
a[0] = v[0];
b[0] = v[0];
for(int i=1; i<p; ++i){
b[i] = b[i-1] + (i+1)*v[i];
b[i] %= mod;
a[i] = a[i-1] + b[i];
a[i] %= mod;
}
return a[p-1];
}
int main(){
cin >> n >> m;
x.resize(n);
y.resize(m);
for(int i=0; i<n; ++i) cin >> x[i];
for(int i=0; i<m; ++i) cin >> y[i];
for(int i=0; i<n-1; ++i) x[i] = x[i+1] - x[i];
for(int i=0; i<m-1; ++i) y[i] = y[i+1] - y[i];
cout << f(x) * f(y) % mod << "\n";
}
| 0
| 4,077,676
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int flag = 1;
int cnt = 0;
rep(i,n) {
if (flag == s[i] - '0') {
cnt++;
} else {
v.push_back(cnt);
cnt = 1;
flag = 1 - flag;
}
}
if (cnt) v.push_back(cnt);
if (v.size() % 2 == 1) v.push_back(0);
vector<int> sum(v.size() + 1);
rep(i,v.size()) sum[i+1] = sum[i] + v[i];
int ans = 0;
for (int i = 0; i < (int) sum.size(); i += 2) {
int t = sum[min(i + 2 * k + 1, (int) sum.size() - 1)] - sum[i];
ans = max(ans, t);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <deque>
using namespace std;
int main() {
long long N, P;
string S;
cin >> N >> P;
cin >> S;
long long ans = 0;
if (P == 2) {
for (int i = 0; i < N; i++) {
int s = S[i] - '0';
if (s % 2 == 0) {
ans += i + 1;
}
}
cout << ans << endl;
return 0;
}
if (P == 5) {
for (int i = 0; i < N; i++) {
int s = S[i] - '0';
if (s % 5 == 0) {
ans += i + 1;
}
}
cout << ans << endl;
return 0;
}
else {
long long dp[P] = {0};
dp[0] = 1;
long long val = 0;
long long moddigit = 1;
for (int i = 0; i < N; i++) {
val = (val + (S[N - 1 - i] - '0') * moddigit) % P;
dp[val]++;
moddigit = (moddigit * 10) % P;
}
for (int i = 0; i < P; i++) {
ans += dp[i] * (dp[i] - 1) / 2;
}
cout << ans << endl;
return 0;
}
}
| 0
| 48,947,755
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define ve vector
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
using ll = long long;
const ll INF = LLONG_MAX - 100;
ll mod = 1e9 + 7;
int dx[] = {-1,0,1,0}, dy[] = {0,1,0,-1};
vector<ll> prime;
class fact {
public:
int fmod = 1e9+7;
vector<int> fac, inv;
fact (int n, int Mod = 1e9+7) {
fmod = Mod;
fac = vector<int>(n,0);
inv = vector<int>(n,0);
fac[0] = 1; for (int i = 1; i < n; i++) fac[i] = fac[i-1] * i % fmod;
for (int i = 0;i < n;i++) inv[i] = fact::POW(fac[i],fmod-2);
}
ll nCr(ll n, ll r) {return (fac[n] * inv[r] % fmod) * inv[n-r] % fmod;}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%fmod;}a = a * a%fmod; b >>= 1;}return c;}
};
template <class T = ll> T in() {T x; cin >> x; return (x);}
void DEBUG(vector<int> a) {for(int i=0;i<a.size();i++)cout<<a[i]<<" ";cout<<endl;}
void EMP(int x) {cout<<"!!!"<<x<<"!!!"<<endl;}
ll GCD(ll a, ll b) {ll c; while (b != 0) {c = a % b; a = b; b = c;}return a;}
ll LCM(ll a, ll b) {return a * b / GCD(a, b);}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%mod;}a = a * a%mod; b >>= 1;}return c;}
void PRI(ll n) {bool a[n + 1LL]; for (int i = 0; i < n + 1LL; i++) {a[i] = 1LL;}for (int i = 2; i < n + 1LL; i++) {if (a[i]) {prime.pb(i); ll b = i; while (b <= n) {a[b] = 0; b += i;}}}}
template <typename T> T chmin(T& a, T b) {if(a>b)a=b;return a;}
template <typename T> T chmax(T& a, T b) {if(a<b)a=b;return b;}
bool isSqrt(ll a) {return pow(sqrt(a),2) == a ? 1 : 0;}
void YesNo(bool a) {if (a) cout << "Yes"; else cout << "No"; cout << endl;}
void yesno(bool a) {if (a) cout << "yes"; else cout << "no"; cout << endl;}
void YESNO(bool a) {if (a) cout << "YES"; else cout << "NO"; cout << endl;}
bool solve() {
int x,y; cin >> x >> y;
if (abs(x-y)<=1) cout << "Brown" << endl;
else cout << "Alice" << endl;
}
signed main() {
solve();
}
|
#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
| 52,693,705
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<n; i++)
#define rep2(i, s, n) for (int i=s; i<n; i++)
int main() {
int a,b;
cin >> a >> b;
int cnt = 0;
rep2(i, a, b+1) {
string wk = to_string(i);
if (wk[0]==wk[4] && wk[1]==wk[3]) {
cnt++;
}
}
cout << cnt << endl;
}
|
#include <iostream>
#include <utility>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
typedef pair<int, int> pii;
const int N_SIZE = 100;
int dp[N_SIZE + 1][N_SIZE + 1];
void solve(int n, pii rc[])
{
REP(i, n)
dp[i][i] = rc[i].first * rc[i].second;
REP(i, n - 1)
dp[i][i + 1] = dp[i][i] * rc[i + 1].second;
for(int i = 2; i < n; i++){
for(int j = 0, k = i + j, m = 100000000; k < n; j++, k++){
for(int l = j, x; l < k; l++){
x = ((j == l) ? dp[j][l] * rc[k].second : dp[j][l]) + ((l + 1 == k) ? dp[l + 1][k] * rc[j].first : dp[l + 1][k]);
if(j != l && l + 1 != k)
x += rc[j].first * rc[l].second * rc[k].second;
m = min(m, x);
}
dp[j][k] = m;
m = 100000000;
}
}
}
int main()
{
int n;
cin >> n;
pii rc[n];
REP(i, n)
cin >> rc[i].first >> rc[i].second;
if(n == 1){
cout << "0" << endl;
}else{
solve(n, rc);
cout << dp[0][n - 1] << endl;
}
}
| 0
| 68,977,540
|
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
int main() {
string s;
cin >> s;
cout << s.substr(0, 4) << " " << s.substr(4, 8) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<queue<char>> s(n);
for(int i = 0; i < n; i++){
string a;
cin >> a;
for(char b : a){
s.at(i).push(b);
}
}
for(int i = 1; i < n; i++){
int t = s.at(0).size();
for(int j = 0; j < t; j++){
char tmp = s.at(0).front();
s.at(0).pop();
int u = s.at(i).size();
for(int k = 0; k < u; k++){
char tar = s.at(i).front();
s.at(i).pop();
if(tmp == tar){
s.at(0).push(tmp);
break;
}
s.at(i).push(tar);
}
}
}
vector<char> ans;
while(s.at(0).size() > 0){
ans.push_back(s.at(0).front());
s.at(0).pop();
}
sort(ans.begin(), ans.end());
for(char c : ans){
cout << c;
}
cout << endl;
}
| 0
| 363,627
|
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
#define mod 1000000007
int N,M,ans=0;
pair<int,int>AB[111111];
priority_queue<int>pq;
int main() {
cin>>N>>M;
for(int i=0;i<N;i++)cin>>AB[i].first>>AB[i].second;
sort(AB,AB+N);
AB[N].first=999999;
int ok=0;
for(int i=1;i<=M;i++){
while(AB[ok].first<=i){
pq.push(AB[ok].second);
ok++;
}
if(pq.size()==0)continue;
ans+=pq.top();
pq.pop();
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N;
cin >> N;
vector<int> a(N+1,0);
rep(i, N){
cin >> a[i];
}
int s = 0;
int ans = 0;
rep(i, N){
if(a[i] == a[i+1]){
s++;
}else{
ans += (s+1)/2;
s = 0;
}
}
cout << ans << endl;
return 0;}
| 0
| 93,388,903
|
#include <stdio.h>
int main(void){
int n;
int i=1;
scanf("%d", &n);
while (n != 0){
printf("Case %d: %d\n", i, n);
scanf("%d", &n);
i++;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N,K;
cin >> N >> K;
vector<int> A(N+1);
for(int i = 0;i < N;i++) cin >> A[i];
int limit = min(K,100);
for(int i = 0;i < limit;i++) {
vector<int> B(N+1);
for(int j = 0;j < N;j++) {
int l = max(0,j-A[j]);
int r = min(N,j+A[j]+1);
B[l]++; B[r]--;
}
for(int j = 0;j < N;j++) {
B[j+1] += B[j];
A[j] = B[j];
}
}
for(int i = 0;i < N;i++) cout << A[i] << " ";
cout << endl;
}
| 0
| 38,982,118
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
#define mp(a, b) make_pair(a, b)
const int MOD = 1e9+7;
const int INF = 1001001001;
const ll llINF = 1e18+9;
vector<pii> edge[100010];
int main(){
int N;
cin >> N;
rep(i, 0, N-1){
int a, b, c;
cin >> a >> b >> c;
edge[a-1].push_back(mp(b-1, c));
edge[b-1].push_back(mp(a-1, c));
}
int Q, K;
cin >> Q >> K;
K--;
vector<ll> dist(N, llINF);
dist[K] = 0;
queue<pair<int, ll>> q;
q.push(mp(K, 0));
while (!q.empty()){
int now = q.front().first;
ll nowd = q.front().second;
q.pop();
for (auto x:edge[now]){
int fol = x.first;
ll d = x.second;
ll nextd = nowd+d;
if (dist[fol] < nextd) continue;
dist[fol] = nextd;
q.push({fol, nextd});
}
}
rep(i ,0 , Q){
int x, y;
cin >> x >> y;
--x, --y;
ll ans = dist[x] + dist[y];
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))
const int dx[] = {-1,0,0,1},dy[] = {0,1,-1,0};
typedef long long int ll;
using namespace std;
int main(){
int ans = 0;
REP(i,4){
int t;
cin >> t;
ans += t;
}
int s = 0;
REP(i,4){
int t = 0;
cin >> t;
s += t;
}
ans = max(ans,s);
cout << ans << endl;
return 0;
}
| 0
| 55,749,337
|
#include <iostream>
using namespace std;
int main(){
int x=10000;
int input[x];
int temp=1;
int count=0;
while(temp!=0){
cin >> temp;
input[count] = temp;
++count;
}
for(int i; i<count-1; ++i){
cout << "Case " << i+1 << ": " << input[i] << endl;
}
}
|
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main(){
string s;
cin >> s;
int n;
cin >> n;
string q;
int a, b;
for (int i = 0; i < n; i ++) {
cin >> q >> a >> b;
if (q == "print") {
string t = s.substr(a, b - a + 1);
cout << t << endl;
} else if (q == "reverse") {
string t = s.substr(a, b - a + 1);
int j = b - a;
for (int i = a; i <= b; i ++) {
s[i] = t[j];
j --;
}
} else if (q == "replace") {
string p;
cin >> p;
for (int i = 0; i < b - a + 1; i ++) {
s[i + a] = p[i];
}
}
}
}
| 0
| 57,395,059
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int n,a; cin >>n >> a;
if (n % 500 <= a)
cout << "Yes\n";
else
cout << "No\n";
return (0);
}
|
#include<bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define M1 (ll)1000000007
#define M2 (ll)998244353
#define Pi 3.141592653
#define exp 2.71828
#define ll long long
#define ull unsigned long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define di deque<int>
#define dl deque<ll>
#define dii deque<pi>
#define dll deque<pl>
#define vvi vector<vi>
#define vvl vector<vl>
#define vii vector<pi>
#define vll vector<pl>
#define pb push_back
#define pp pop_back
#define pf push_front
#define pt pop_front
#define mp make_pair
#define in insert
#define er erase
#define ff first
#define ss second
#define ub upper_bound
#define lb lower_bound
#define rp(i,a,b) for(int i=a;i<b;i++)
#define rpt(i,a,b,t) for(int i=a;i<b&&t<1;i++)
#define rep(i,n) for(int i = 0 ; i<n ; i++)
#define rept(i,n,t) for(int i = 0 ; i<n&&t<1 ; i++)
#define repr(i,n) for(int i = n-1 ; i>=0 ; i--)
#define reprt(i,n,t) for(int i=n-1;i>=0&&t<1;i--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define SORT(v) sort(v.begin(),v.end())
int main() {
fast
int n,k;
cin>>n>>k;
ll c[n+1];
for(int i=1;i<n+1;++i) cin>>c[i];
ll dp[n+1][k+1];
for(int i=0;i<n+1 ;++i) for(int j=0;j<k+1;++j) dp[i][j]=0;
for(int i=0;i<n+1;++i) dp[i][0]=1;
for(int i=1;i<n+1 ;++i){
for(int j=1;j<k+1;++j){
ll x = (j>c[i])?dp[i-1][j-c[i]-1]:0;
dp[i][j] = (((dp[i][j-1]%M1)+dp[i-1][j]%M1)%M1-x%M1+M1)%M1;
}
}
cout<<dp[n][k];
}
| 0
| 50,268,880
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string str,com,rep;
char work;
int n,a,b;
cin >> str;
cin >> n;
for(int i=0; i<n; ++i){
cin >> com >> a >> b;
if(com == "replace"){
cin >> rep;
for(int k=a; k<=b; ++k){
str[k] = rep[k - a];
}
}else if(com == "reverse"){
string str2 = str;
int l = b - a + 1;
int counter = 0;
for(int k = a; k<=b; ++k){
str[k] = str2[b-counter];
++counter;
}
}else{
for(int k = a; k<=b; ++k){
cout << str[k];
}
cout << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
random_device rnd;
mt19937 mt(rnd());
const int IINF = 1 << 28;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;
int main()
{
int n, m;
cin >> n >> m;
VVI cost(n, VI(n, IINF));
vector<pair<PII, int>> g;
rep(i, m)
{
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
cost[a][b] = c;
cost[b][a] = c;
g.push_back({{a, b}, c});
}
rep(k, n) rep(i, n) rep(j, n)
{
chmin(cost[i][j], cost[i][k] + cost[k][j]);
}
int ans = 0;
rep(i, m)
{
int a = g[i].first.first;
int b = g[i].first.second;
int c = g[i].second;
if (c > cost[a][b])
{
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 38,591,277
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& x: vec) { is >> x; }
return is;
}
int main() {
ll ans = 1;
ll tmp;
int n, k; cin >> n >> k;
ans *= k;
REP(i, n-1) ans *= k-1;
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main(){
char a[1001],b[1001];
long least,var,lena=0,lenb=0,l=1;
cin>>a>>b;
for(;b[lenb];lenb++);
for(;a[lena];lena++);
for(int i=0;i<=lena-lenb;i++){
var=0;
for(int j=0;j<lenb;j++){
if(a[i+j]!=b[j]){
var++;
}
}
if(var<least||l)least=var;
if(l)l=0;
}
cout<<least;
return 0;
}
| 0
| 58,261,381
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
swap(a, b);
}
if (a < c) {
swap(a, c);
}
int res = a * 10 + b + c;
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int x, m;
int next(int a) {
return (long long) a * a % m;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> x >> m;
vector<int> a;
vector<bool> used(m, 0);
int cur = x;
for (; !used[cur]; cur = next(cur)) {
used[cur] = 1;
a.push_back(cur);
}
vector<int> preperiod;
int from = 0;
while (a[from] != cur) {
preperiod.push_back(a[from]);
from++;
}
vector<int> period;
for (int i = from; i < a.size(); i++)
period.push_back(a[i]);
long long ans = 0;
int min_ = min<long long>(n, preperiod.size());
n -= min_;
for (int i = 0; i < min_; i++)
ans += preperiod[i];
long long full = n / period.size();
for (int x : period)
ans += full * x;
n %= period.size();
for (int i = 0; i < n; i++)
ans += period[i];
cout << ans;
return 0;
}
| 0
| 74,619,819
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
vector<int> par;
vector<ll> dfromp;
ll dfr(int x) {
if (par[x] != x) {
return dfromp[x] + dfr(par[x]);
}
else {
return 0;
}
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
dfromp[x] = dfr(x);
par[x] = root(par[x]);
return par[x];
}
}
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i <= N; i++) {
par.push_back(i);
dfromp.push_back(0);
}
for (int i = 0; i < M; i++) {
int l, r, d; cin >> l >> r >> d;
if (root(l) == root(r)) {
if (dfr(r) != dfr(l) + d) {
cout << "No"; return 0;
}
} else {
if (dfr(r) > dfr(l) + d) {
dfromp[root(l)] = dfr(r) - dfr(l) - d;
par[root(l)] = root(r);
}
else {
dfromp[root(r)] = dfr(l) + d - dfr(r);
par[root(r)] = root(l);
}
}
}
cout << "Yes";
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
char c1[] = { ' ', '.', ',', '!', '?', };
char c2[] = { 'c', 'a', 'b', };
char c3[] = { 'f', 'd', 'e', };
char c4[] = { 'i', 'g', 'h', };
char c5[] = { 'l', 'j', 'k', };
char c6[] = { 'o', 'm', 'n', };
char c7[] = { 's', 'p', 'q', 'r', };
char c8[] = { 'v', 't', 'u', };
char c9[] = { 'z', 'w', 'x', 'y', };
char get_c(char a, int cnt) {
if (a == '1') return c1[cnt % 5];
if (a == '2') return c2[cnt % 3];
if (a == '3') return c3[cnt % 3];
if (a == '4') return c4[cnt % 3];
if (a == '5') return c5[cnt % 3];
if (a == '6') return c6[cnt % 3];
if (a == '7') return c7[cnt % 4];
if (a == '8') return c8[cnt % 3];
if (a == '9') return c9[cnt % 4];
return 0;
}
int main() {
int n;
cin >> n;
while (n --) {
string s;
cin >> s;
bool doing = false;
int cnt = 0;
char now;
for (int i = 0; i < s.size(); i ++) {
if (s[i] != '0') {
doing = true;
cnt ++;
now = s[i];
} else {
if (!doing) continue;
else {
cout << get_c(now, cnt);
}
doing = false;
cnt = 0;
}
}
cout << endl;
}
return 0;
}
| 0
| 43,839,571
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int t[n],x[n],y[n];
for(int i=0;i<n;i++)cin>>t[i]>>x[i]>>y[i];
for(int i=0;i<n;i++){
int dis,time;
if( i==0 ){
dis = x[i]+y[i];
time = t[i];
}
else{
time = t[i]-t[i-1];
dis = abs(x[i]-x[i-1])+abs(y[i]-y[i-1]);
}
if(dis>time){
cout<<"No\n";
return 0;
}
else{
int rem = time-dis;
if( rem%2!=0 ){
cout<<"No\n";
return 0;
}
}
}
cout<<"Yes\n";
return 0;
}
|
#include <stdio.h>
int main()
{
int h, w, i, j;
while (1) {
scanf("%d %d", &h, &w);
if (h == 0 && w == 0) {
break;
}
else if (h != 0 && w != 0) {
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
if (i != 0 && i != (h-1) && j != 0 && j != (w-1)) {
printf(".");
} else {
printf("#");
}
}
printf("\n");
}
}
printf("\n");
}
return 0;
}
| 0
| 94,617,449
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
int main(){
ll n, m;
cin >> n >> m;
if(m - 2*n < 0){
cout << m/2 << endl;
}
else{
cout << n + (m - 2*n)/4 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<x<<endl
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll inf = 1e18;
const int N = 2e5 + 10;
int main(){
int n;
cin >> n;
vector<string> w(n);
map<string, int> z;
rep(i,n){
cin >> w[i];
z[w[i]] += 1;
}
for(auto x : z){
if(x.second>=2){
cout("No");
return 0;
}
}
bool can = true;
rep(i,n-1){
int l = (int)w[i].size();
string end = w[i].substr(l-1,1);
string start = w[i+1].substr(0,1);
if(end != start){
can = false;
break;
}
}
if(can) cout("Yes");
else cout("No");
return 0;
}
| 0
| 67,724,332
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl '\n'
int t=1;
void solve(){
int n,l;
cin >> n >> l;
for(int i=0;i<=n;i++){
if((l+2*i)==4*n){cout << "Yes" <<endl;return;}
}
cout << "No" <<endl;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
for(int i=1;i<=t;i++){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
if(s.size()<4)cout << "No" << endl;
else{
bool a=true;
if(s.at(0)!='Y')a=false;
if(s.at(1)!='A')a=false;
if(s.at(2)!='K')a=false;
if(s.at(3)!='I')a=false;
if(a)cout << "Yes" << endl;
else cout << "No" << endl;
}
}
| 0
| 7,981,311
|
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
long gcd(long a, long b) {
while (true) {
if (a < b) swap(a, b);
if (b == 0) return a;
a %= b;
}
}
int main(void) {
long N, X;
cin >> N >> X;
cout << (N / gcd(N, X) - 1) * 3 * gcd(N, X) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int pos[(1<<26)+20];
char s[maxn];
int dp[maxn];
int main()
{
scanf("%s",s+1);
int len=strlen(s+1);
memset(pos,-1,sizeof(pos));
for (int i=1;i<=len;i++)dp[i]=len;
pos[0]=0;
int x=0;
for (int i=1;i<=len;i++){
s[i]-='a';
x^=(1<<s[i]);
dp[i]=dp[i-1]+1;
for (int j=0;j<26;j++){
if (pos[x^(1<<j)]==-1)continue;
dp[i]=min(dp[i],dp[pos[x^(1<<j)]]+1);
}
if (~pos[x])dp[i]=min(dp[i],dp[pos[x]]+1);
if (pos[x]==-1)pos[x]=i;
if (dp[i]<dp[pos[x]]) pos[x]=i;
}
printf("%d",dp[len]);
}
| 0
| 33,624,666
|
#include <bits/stdc++.h>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
signed main(){
string s;cin>>s;
cout << s.substr(0,4) << " " << s.substr(4,8) << endl;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int m = (n-1)*(n-2)/2;
if(k > m){
cout << -1 << endl;
return 0;
}
cout << n-1 + m-k << endl;
for(int i = 2; i <= n; ++i) cout << 1 << " " << i << endl;
int x = 2, y = 3;
rep(i,m-k){
if(y > n){
++x;
y = x + 1;
}
cout << x << " " << y << endl;
++y;
}
return 0;
}
| 0
| 99,801,771
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int n;
int c[500], s[500], f[500];
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> c[i] >> s[i] >> f[i];
}
for (int i = 0; i < n - 1; i++) {
int now = 0;
for (int j = i; j < n - 1; j++) {
if (now <= s[j]) {
now = s[j] + c[j];
}
else {
int co1 = 0;
for (;;) {
co1 += f[j];
if (now - co1 <= s[j]) {
now = s[j] + c[j] + co1;
break;
}
}
}
}
cout << now << endl;
}
cout << "0" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
int divNum = -1;
for(int i = 0; i < n; i++){
int target = i + 1;
int tmpCnt = 0;
while(target%2==0){
target/=2;
tmpCnt++;
if(target==0)break;
}
if(tmpCnt>divNum){
ans = i + 1;
divNum = tmpCnt;
}
}
cout << ans << endl;
}
| 0
| 18,305,750
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int x;
cin >> x;
int div = x / 100;
int rem = x % 100;
bool ok = false;
if (x < 100) ok = false;
else if (rem == 0) ok = true;
else if (x >= div * 100 && x <= div * 105) {
ok = true;
}
if (ok) cout << 1 << '\n';
else cout << 0 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
const ll MOD = 1000000007;
const ll INF = 9999999999;
int main() {
int n; cin >>n;
vector<int> A(100001, 0);
for (int i=0; i<n; i++){
int buf; cin >>buf;
A.at(buf)++;
}
int ans = 0;
bool ok = false;
for (int i=0; i<100001; i++){
if (A.at(i) == 0) continue;
if (A.at(i) % 2 == 1) ans++;
else{
if (ok){
ans+=2; ok = false;
}else{
ok = true;
}
}
}
cout <<ans <<endl;
}
| 0
| 32,761,736
|
#include <bits/stdc++.h>
#define sz(v) (int)v.size()
#define debug(var) cout << #var << ": " << var << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int h, w, m;
cin >> h >> w >> m;
vector<int> cntrow(h + 1), cntcol(w + 1);
set<pair<int, int>> targets;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
cntrow[x]++, cntcol[y]++;
targets.insert({x, y});
}
int mxcntrow = 0;
for (int e : cntrow)
mxcntrow = max(mxcntrow, e);
int mxcntcol = 0;
for (int e : cntcol)
mxcntcol = max(mxcntcol, e);
vector<int> rows, cols;
for (int i = 0; i < sz(cntrow); i++) {
int &e = cntrow[i];
if (e == mxcntrow)
rows.push_back(i);
}
for (int i = 0; i < sz(cntcol); i++) {
int &e = cntcol[i];
if (e == mxcntcol)
cols.push_back(i);
}
int flag_perfect = 0;
for (int ei : rows) {
for (int ej : cols)
if (targets.find({ei, ej}) == targets.end()) {
flag_perfect = 1;
break;
}
if (flag_perfect)
break;
}
cout << mxcntrow + mxcntcol - 1 + flag_perfect;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T;
char c = 'W';
for (int i = 0; i < N * 2; i++){
if (S[i] != c){
T += 'L';
c = 'B' + 'W' - c;
} else {
T += 'R';
c = 'B' + 'W' - c;
}
}
int cnt = 0;
for (int i = 0; i < N * 2; i++){
if (T[i] == 'L'){
cnt++;
}
}
if (cnt != N){
cout << 0 << endl;
} else {
int L = 0;
long long ans = 1;
for (int i = 0; i < N * 2; i++){
if (T[i] == 'L'){
L++;
} else {
ans *= L;
ans %= MOD;
L--;
}
}
for (int i = 1; i <= N; i++){
ans *= i;
ans %= MOD;;
}
cout << ans << endl;
}
}
| 0
| 98,650,305
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template <typename T>
void print(const T &v);
int main()
{
ll A, B;
cin >> A >> B;
if (A == B)
{
cout << A << endl;
return 0;
}
ll a_after = ((A + 3) / 4) * 4;
ll b_before = (B / 4) * 4;
ll ans = 0;
for (ll i = A; i < a_after; i++)
{
ans ^= i;
}
for (ll i = b_before; i <= B; i++)
{
ans ^= i;
}
cout << ans << endl;
return 0;
}
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define int long long
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define _GLIBCXX_DEBUG
int INF = 1e9+7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if(dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main(){
int N,M; cin>>N>>M;
vector<int>A(M);
vector<char>B(M);
vector<int>AC(N+1);
vector<int>WA(N+1);
rep(i,M){
string C;
cin>>A[i]>>C;
B[i]=C.at(0);
if(AC[A[i]]==1)continue;
if(B[i]=='A'){
AC[A[i]]++;
}
else{
WA[A[i]]++;
}
}
int ac=0;
int wa=0;
rep(i,N+1){
if(AC[i]){
ac+=AC[i];
wa+=WA[i];
}
}
cout<<ac<<" "<<wa<<endl;
}
| 0
| 59,914,517
|
#include <iostream>
int main()
{
unsigned n, x;
while (std::cin >> n >> x, n) {
unsigned count{};
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++) {
for (int k = 1; k < j; k++) {
if (i+j+k == x) {
count++;
break;
}
}
}
}
std::cout << count << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl "\n"
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define co(x) cout << x << endl
#define coel cout << endl
#define pb push_back
#define sz(v) ((ll)(v).size())
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 100000000000;
#define pp pair<ll, pair<ll, ll>>
int main(){
ll n; cin >> n;
Vl a(n);
bool f1 = false, f2 = false;
rep(i, 0, n){
cin >> a[i];
if(a[i] > 0) f1 = true;
else if(a[i] < 0) f2 = true;
}
sort(ALL(a));
if(f1 && !f2){
ll ans = 0;
ans -= a[0];
rep(i, 1, n) ans += a[i];
co(ans);
ll lf = a[0];
rep(i, 0, n-2){
co(lf << " " << a[i+1]);
lf -= a[i+1];
}
co(a[n-1] << " " << lf);
}
if(!f1 && f2){
reverse(ALL(a));
ll ans = a[0];
rep(i, 1, n) ans -= a[i];
co(ans);
ll lf = a[0];
rep(i, 0, n-1){
co(lf << " " << a[i+1]);
lf -= a[i+1];
}
}
if(f1 && f2){
ll ans = 0;
rep(i, 0, n) ans += abs(a[i]);
co(ans);
Vl a1, a2;
rep(i, 0, n){
if(a[i] <= 0) a1.push_back(a[i]);
else a2.push_back(a[i]);
}
rep(i, 0, sz(a2)-1){
co(a1[0] << " " << a2[i]);
a1[0] -= a2[i];
}
rep(i, 0, sz(a1)){
co(a2[sz(a2)-1] << " " << a1[i]);
a2[sz(a2)-1] -= a1[i];
}
}
if(!f1 && !f2){
co(0);
rep(i, 0, n-1) co(0 << " " << 0);
}
return 0;
}
| 0
| 95,205,268
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
int N; cin>>N;
vector<int> a(N+1,0),ck(N+1,1);
rep(i,N) cin>>a[i+1];
int now=1, count=0;
ck[1]=0;
bool flg = false;
while(ck[a[now]]){
now = a[now];
ck[now]=0;
count++;
if(now==2){
flg = true;
break;
}
}
if(flg){
cout << count << endl;
}else{
cout << -1 << endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main()
{
ll n, p;
cin >> n >> p;
string s;
cin >> s;
if (p == 5 || p == 2)
{
ll cnt = 0;
for (ll j = 0; j < s.length(); j++)
{
auto num = s[j] - '0';
if (num % p == 0)
{
cnt += j + 1;
}
}
cout << cnt << endl;
return 0;
}
string reversed = s;
reverse(reversed.begin(), reversed.end());
vector<ll> mods = {};
auto mod = 0;
auto digit_mod = 1;
for (auto i = 0; i < reversed.length(); i++)
{
auto digit = reversed[i] - '0';
if (i != 0)
{
digit_mod = digit_mod * 10 % p;
}
mod = (mod + digit_mod * digit) % p;
mods.push_back(mod);
}
reverse(mods.begin(), mods.end());
map<ll, ll> comb = {};
for (auto i = 0; i < mods.size(); i++)
{
auto m = mods[i];
if (comb.count(m))
{
comb[m] = comb[m] + 1;
}
else
{
comb[m] = 1;
}
}
ll cnt = 0;
for (auto value : comb)
{
if (value.first == 0)
{
cnt += value.second;
}
if (value.second > 1)
{
cnt += value.second * (value.second - 1) / 2;
}
}
cout << cnt << endl;
return 0;
}
| 0
| 38,612,926
|
#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()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<ll> a(N), b(N);
REP(i, N) cin >> a[i];
REP(i, N) cin >> b[i];
ll cnt = 0;
REP(i, N) {
if (a[i] < b[i]) {
ll c = (b[i] - a[i] + 1) / 2;
a[i] += c * 2;
cnt += c;
}
if (a[i] > b[i]) {
cnt -= a[i] - b[i];
}
}
cout << (cnt >= 0 ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
int n; cin >> n;
int cur = 1;
int ans = 0;
vector<int> a(n+1);
vector<bool> l(n+1);
rep(i,n) cin >> a[i+1];
rep(i,n) l[i+1] = false;
while(1){
if(l[cur]) break;
else{
if(cur == 2) break;
l[cur] = true;
cur = a[cur];
ans ++;
}
}
if(cur == 2) cout << ans;
else cout << -1;
return 0;
}
| 0
| 8,524,921
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b && b == c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
int main() {
int N;
cin >> N;
ll A[N];
REP(i, N){
cin >> A[i];
}
sort(A, A+N);
ll res = gcd(A[0], A[1]);
FOR(i, 2, N-1){
res = gcd(res, A[i]);
if(res == 1){
break;
}
}
cout << res << endl;
}
| 0
| 17,105,565
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int N; cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<long long> s(N+1, 0);
map<long long, long long> nums;
for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];
for (int i = 0; i < N+1; ++i) nums[s[i]]++;
long long res = 0;
for (auto it : nums) {
long long num = it.second;
res += num * (num - 1) / 2;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long long ll;
typedef pair<int, int> P;
ll gcd(int x, int y){ return y?gcd(y, x%y):x;}
ll lcm(ll x, ll y){ return (x*y)/gcd(x,y);}
int main()
{
string s;
cin >> s;
bool isok = true;
int ans = 0;
for(int i = 0, j = s.size()-1; i<j;){
if (s[i] == s[j]) i++, j--;
else if (s[i] == 'x') i++,ans++;
else if (s[j] == 'x') j--,ans++;
else isok = false;
if (!isok) break;
}
if(isok) cout << ans << endl;
else cout << -1 << endl;
}
| 0
| 53,054,943
|
#include <iostream>
using namespace std;
int w, h;
char tile[21][21];
const int mx[] = {0, 0, 1, -1};
const int my[] = {1, -1, 0, 0};
int func(int x, int y){
if(x < 0 || x >= w || y < 0 || y >= h || tile[y][x] == '#'){
return 0;
}
int res = 1;
tile[y][x] = '#';
for(int i = 0; i < 4; ++i){
for(int j = 0; j < 4; ++j){
res += func(x + mx[i], y + my[i]);
}
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
while(cin >> w >> h && w != 0 && h != 0){
int sx = 0, sy = 0;
for(int i = 0; i < h; ++i){
for(int j = 0; j < w; ++j){
cin >> tile[i][j];
if(tile[i][j] == '@'){
sy = i;
sx = j;
}
}
}
cout << func(sx, sy) << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
#include <fstream>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e7
typedef long long ll;
typedef long double ld;
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>> maze(h+2,vector<char> (w+2));
vector<vector<int>> dist(h+2,vector<int> (w+2, INF));
queue<pair<int,int>> que;
REP(i,h+2)REP(j,w+2){
if(i==0||j==0||i==h+1||j==w+1)continue;
else{
cin>>maze[i][j];
if(maze[i][j]=='#'){
que.push(make_pair(i,j));
dist[i][j]=0;
}
}
}
vector<int> movel={1,-1,0,0}, movec={0,0,1,-1};
while(!que.empty()){
pair<int,int> p=que.front();
int l=p.first, c=p.second;
que.pop();
REP(i,4){
int nl=l+movel[i], nc=c+movec[i];
if(maze[nl][nc]=='.'){
maze[nl][nc]='#';
dist[nl][nc]=dist[l][c]+1;
que.push(make_pair(nl,nc));
}
}
}
int ans=0;
FOR(i,1,h+1)FOR(j,1,w+1){
if(ans<dist[i][j]){
ans=dist[i][j];
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 20,429,418
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
string a, b; cin >> a >> b;
while (a.size() && b.size()) {
if (a == b) {
cout << "Yes";
return;
}
b.pop_back();
}
cout << "No";
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
ll calc(ll n){
for(ll i = 2; ;i++)
if(i*(i+1)/2 > n)
return i-1;
}
void solve(){
ll n;
cin>>n;
ll ans = 0;
for(ll i = 2; i*i <= n; i++){
int cnt = 0;
while(n%i == 0){
n /= i;
++cnt;
}
if(cnt == 0)
continue;
ans += calc(cnt);
}
if(n != 1)
++ans;
cout<<ans;
}
int main(){
hs;
ll t;
t=1;
for (int i=1; i<=t; i++){
solve();
}
return 0;
}
| 0
| 52,703,742
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()
const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(const vector<T> &v)
{
if (v.size() == 0)
return;
int n = v.size() - 1;
rep(i, n) cout << v[i] << wsp;
cout << v[n] << rt;
return;
}
template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
int n = v.size();
rep(i, n) show1dvec(v[i]);
}
template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
int n = v.size();
rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
return;
}
template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
int n = v.size();
rep(i, n)
{
t.push_back(v[i].first);
s.push_back(v[i].second);
}
return;
}
template <typename T>
void maxvec(vector<T> &v)
{
T s = v[0];
int n = v.size();
rep(i, n - 1)
{
if (s > v[i + 1])
{
v[i + 1] = s;
}
s = v[i + 1];
}
}
template <typename T, typename S>
bool myfind(T t, S s)
{
return find(t.cbegin(), t.cend(), s) != t.cend();
}
bool check(int y, int x, int h, int w)
{
return 0 <= y && y < h && 0 <= x && x < w;
}
bool iskadomatsu(int a, int b, int c)
{
return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}
VS split(string s, char c)
{
VS ret;
string part;
s += c;
rep(i, s.length())
{
if (s[i] == c)
{
ret.emplace_back(part);
part = "";
}
else if (s[i] != c)
{
part += s[i];
}
}
return ret;
}
template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
ll ret = 1, r = p;
while (q)
{
if (q % 2)
ret *= r, ret %= mod;
r = (r * r) % mod, q /= 2;
}
return ret % mod;
}
template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
ll ret = 1, r = p;
while (q)
{
if (q % 2)
ret *= r;
r = (r * r), q /= 2;
}
return ret;
}
void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
rep(i, frac_list.size() - 1)
{
frac_list[i + 1] *= frac_list[i] * (i + 1);
frac_list[i + 1] %= mod;
frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
frac_inv_list[i + 1] %= mod;
}
}
ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
if (a < b)
return 0;
if (b < 0)
return 0;
ll ret = frac_list[a];
ret *= frac_inv_list[b];
ret %= mod;
ret *= frac_inv_list[a - b];
ret %= mod;
return ret;
}
struct goods
{
ll weight;
ll value;
};
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
string s, t;
cin >> s >> t;
int ls, lt, a;
ls = s.length(), lt = t.length();
VVI dp(ls + 1, VI(lt + 1, ls + lt));
dp[0][0] = 0;
rep(i, ls) dp[i + 1][0] = i + 1;
rep(i, lt) dp[0][i + 1] = i + 1;
rep(i, ls) rep(j, lt)
{
dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i + 1][j] + 1);
dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j + 1] + 1);
a = (s[i] == t[j] ? 0 : 1);
dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + a);
}
cout << dp[ls][lt] << rt;
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 REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
const int MAX_N = 100;
int n;
int r[MAX_N], c[MAX_N];
int dp[MAX_N][MAX_N];
int main() {
cin >> n;
REP(i, n) cin >> r[i] >> c[i];
REP(i, n) {
REP(j, n) dp[i][j] = MOD;
}
REP(i, n) dp[i][i] = 0;
REP2(k, 1, n) {
REP(i, n - k) {
int j = i + k;
REP2(l, i, j) {
dp[i][j] = min(dp[i][j], dp[i][l] + dp[l+1][j] + r[i]*c[l]*c[j]);
}
}
}
PRINT(dp[0][n-1]);
return 0;
}
| 0
| 39,817,339
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int min1 = min(a, b);
int min2 = min(c, d);
cout << min1 + min2 << endl;
return 0;
}
|
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#define ll long long
#define int ll
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e18;
const int mod=1e9+7;
const int M=10005;
int n,m,len;
int a[12];
int dp_len[M];
int cost[]={0,2,5,5,4,5,6,3,7,6};
int solve(int rem)
{
if(rem<0)return -inf;
if(rem==0)return 0;
int &ret=dp_len[rem];
if(ret!=(-1))return ret;
ret=0;
for(int i=1;i<=m;i++)
{
ret=max(ret,1+solve(rem-cost[a[i]]));
}
return ret;
}
vector<int>dp[M];
int yo(int baki,int pos)
{
if(baki<0)return 0;
if(pos>len)
{
if(baki==0)return 1;
else return 0;
}
int &ret=dp[baki][pos];
if(ret!=(-1))return ret;
ret=0;
for(int i=1;i<=m;i++)
{
int x=yo(baki-cost[a[i]],pos+1);
if(x==1)ret=1;
}
return ret;
}
main()
{
fast
cin>>n>>m;
f(i,1,m)
{
cin>>a[i];
}
sort(a+1,a+m+1);
reverse(a+1,a+m+1);
memset(dp_len,-1,sizeof dp_len);
len=solve(n);
f(i,0,n+2)dp[i].assign(len+5,-1);
string ses="";
int has=n;
for(int i=1;i<=len;i++)
{
for(int j=1;j<=m;j++)
{
if(yo(has-cost[a[j]],i+1))
{
has=has-cost[a[j]];
ses+=(a[j]+'0');
break;
}
}
}
cout<<ses<<endl;
return 0;
}
| 0
| 19,471,064
|
#include<bits/stdc++.h>
using namespace std;
int dp[1002][1002];
int main(){
int T;
cin>>T;
while(T--){
#ifdef LCS
string s;
cin>>s;
int len=s.size();
int *dp=new int[len+1];
dp[0]=1;
int ans=1;
for(int i=1;i<len;i++){
char ch=s[i];
int cnt=0;
for(int j=0;j<=i-1;j++){
if(s[j]<ch) cnt=max(cnt,dp[j]);
}
dp[i]=cnt+1;
ans=max(ans,dp[i]);
}
cout<<ans<<endl;
#endif
string s1,s2;
cin>>s1>>s2;
int len1=s1.size(),len2=s2.size();
int len=max(len1,len2);
for(int i=0;i<=len;i++) {
dp[0][i]=0;
dp[i][0]=0;
}
int ans=0;
for(int i=0;i<len1;i++){
for(int j=0;j<len2;j++){
if(s1[i]==s2[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[len1][len2]<<endl;
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define fo(i,a,b) for(int i = a; i<=b ; i++)
#define rfo(i,a,b) for(int i = a; i>=b ; i--)
#define vii vector<int>
#define vll vector<ll>
#define pq priority_queue
#define uom unordered_map
#define all(v) v.begin(),v.end()
#define mp make_pair
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define mii map<int,int>
#define vvii vector<vii>
#define vvll vector<vll>
#define mod 1000000007
#define MIN -1e9
#define pi 3.1415926535897932384626433832795
using namespace std;
void INPUT()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 101;
const int M = 100005;
ll dp[N][M];
ll v[N];
void solve()
{
int n, k;
cin >> n >> k;
fo(i, 0, n - 1) cin >> v[i];
fo(i, 0, n)
{
fo(j, 0, k) dp[i][j] = 0;
}
fo(i, 0, v[0]) dp[0][i] = 1;
fo(i, 0, n - 1) dp[i][0] = 1;
fo(i, 1, n - 1)
{
vll pre(k + 1, 0);
pre[0] = dp[i - 1][0];
fo(j, 1, k) pre[j] = (pre[j - 1] + dp[i - 1][j]) % mod;
fo(j, 1, k)
{
dp[i][j] = pre[j];
if (j > v[i]) dp[i][j] -= pre[j - v[i] - 1];
dp[i][j] = (dp[i][j] % mod + mod) % mod;
}
}
cout << dp[n - 1][k] << endl;
}
int main() {
FIO
INPUT();
int t;
t = 1;
fo(i, 0, t - 1)
{
solve();
}
return 0;
}
| 0
| 35,073,480
|
#include <algorithm>
#include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#include <iostream>
#include <vector>
using bint = boost::multiprecision::cpp_int;
template <class T>
void combination(const std::vector<T>& seed, const int& target_size, std::vector<std::vector<int>>& ans)
{
std::vector<int> indices(target_size);
const int seed_size = seed.size();
int start_index = 0;
int size = 0;
int ans_index = 1;
while (size >= 0) {
for (int i = start_index; i < seed_size; ++i) {
indices[size++] = i;
if (size == target_size) {
std::vector<T> comb(target_size);
for (int x = 0; x < target_size; ++x) {
comb[x] = seed[indices[x]];
}
ans.at(comb[0] - 1).emplace_back(ans_index);
ans.at(comb[1] - 1).emplace_back(ans_index);
ans_index++;
break;
}
}
size--;
if (size < 0) {
break;
}
start_index = indices[size] + 1;
}
}
int main()
{
int N;
std::cin >> N;
std::vector<int> applies{};
bint n = 2;
bint max = 1;
for (int i = 0; i < 10; i++) {
max *= 10;
}
while (true) {
bint nC2 = n * (n - 1) / 2;
if (nC2 > max) {
break;
}
applies.emplace_back(nC2);
n++;
}
auto it = std::find(applies.begin(), applies.end(), N);
if (it == applies.end()) {
std::cout << "No" << std::endl;
return 0;
}
std::cout << "Yes" << std::endl;
int k = std::distance(applies.begin(), it) + 2;
std::cout << k << std::endl;
std::vector<std::vector<int>> ans(k);
std::vector<int> comb(k);
for (int i = 0; i < k; i++) {
comb.at(i) = i + 1;
}
combination<int>(comb, 2, ans);
for (const auto& row : ans) {
std::cout << row.size() << " ";
for (const auto& col : row) {
if (col != row.at(row.size() - 1)) {
std::cout << col << " ";
} else {
std::cout << col << " ";
}
}
std::cout << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define REP(i,a,b) for(int i=(int)(a); i<(int)(b); i++)
#define RREP(i,a,b) for(int i=(int)(a); i>=b; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,n,0)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
#define dump(x) (cerr << #x << "=" << x << endl)
template<class T> ostream& osContainer(ostream& os,T c) { os<<'[';for(decltype(c.begin()) it=c.begin();it!=c.end();it++)os<<*it<<',';os<<']';return os; }
template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { return osContainer(os,v); }
template<class T> ostream& operator<<(ostream& os,const set<T>& s) { return osContainer(os,s); }
template<class T> ostream& operator<<(ostream& os,const multiset<T>& s) { return osContainer(os,s); }
template<class T,class S> ostream& operator<<(ostream& os,const map<T,S>& m) { return osContainer(os,m); }
template<class T,class S> ostream& operator<<(ostream& os,const multimap<T,S>& m) { return osContainer(os,m); }
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p){ os << '(' << p.first << ',' << p.second << ')'; return os; }
const int dx[] = {0,1,0,-1};
const int dy[] = {1,0,-1,0};
char check[20][20];
char field[21][21];
void solve()
{
int w, h;
while (cin >> w >> h, w || h) {
memset(check, 0, sizeof(check));
int sx, sy;
rep(i, h) {
rep(j, w){
char c;
cin >> c;
field[i][j] = c;
if (c == '@') {
sy = i, sx = j;
check[sy][sx] = 1;
}
}
cin.ignore();
}
queue<pair<int, int>> q;
q.push(mp(sy, sx));
int s = 1;
while(!q.empty()) {
auto p = q.front();q.pop();
int y = p.first, x = p.second;
rep(i, 4) {
int ddy = y + dy[i], ddx = x + dx[i];
if (0 <= ddy && ddy < h && 0 <= ddx & ddx < w && field[ddy][ddx] == '.' && !check[ddy][ddx]) {
s++;
check[ddy][ddx] = 1;
q.push(mp(ddy, ddx));
}
}
}
cout << s << endl;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(12);
solve();
}
| 0
| 51,385,514
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
int n, k; cin >> n >> k;
double ans = 0;
for (int res = 1; res <= n; res++) {
int temp = res;
double xar = 1;
while (temp >= 1 && temp <= k - 1) {
temp *= 2;
xar /= 2;
}
ans += xar / n;
}
cout << fixed << setprecision(10) << ans;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define SIZE 201
int to_num(string s){
char c[5] = "mcxi";
int t[4] = {1000,100,10,1};
int ret = 0;
for(int i=0;i<s.size();i++){
for(int j=0;j<4;j++){
if(s[i]==c[j]){
if(i==0 || !('0'<=s[i-1] && s[i-1]<='9')) ret += t[j];
else ret += t[j] * (s[i-1]-'0');
}
}
}
return ret;
}
string to_mcxi(int a){
char c[5] = "ixcm";
string ret;
for(int i=0;i<4;i++){
if(a%10>0) ret += c[i];
if(a%10>1) ret += '0'+(a%10);
a/=10;
}
reverse(ret.begin(),ret.end());
return ret;
}
bool calc(){
string a,b;
cin >> a >> b;
cout << to_mcxi(to_num(a)+to_num(b)) << endl;
return true;
}
int main(){
int m;
scanf("%d",&m);
for(int i=0;i<m;i++){
calc();
}
return 0;
}
| 0
| 64,921,403
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
int n, k;
cin >> n >> k;
int r,s,p;
cin >> r >> s >> p;
string jan;
cin >> jan;
map<char, int> v;
v['r'] = p;
v['s'] = r;
v['p'] = s;
v_string t(k);
rep(i,n) {
t[i%k] += jan[i];
}
ll ans = 0;
rep(i,k) {
int m = t[i].size();
ll dp[m+1][2];
rep(j,m+1) {
rep(k,2) {
dp[j][k] = 0;
}
}
char pre = 'z';
rep(j,m) {
chmax(dp[j+1][0], max(dp[j][0], dp[j][1]));
if(pre == t[i][j]) {
chmax(dp[j+1][1], dp[j][0]+v[t[i][j]]);
} else {
chmax(dp[j+1][1], max(dp[j][0], dp[j][1])+v[t[i][j]]);
}
pre = t[i][j];
}
ans += max(dp[m][0], dp[m][1]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INFL = 1000000000000000010;
int INF = 2000000000;
ll MOD = 998244353;
int main() {
while(true){
int N,K;
cin >> N >> K;
if(N == 0 && K == 0)break;
vector<int> a(N);
vector<int> wa(N+1);
wa.at(0) = 0;
for(int i = 0; i < N; i++){
cin >> a.at(i);
wa.at(i+1) = a.at(i) + wa.at(i);
}
int ANS = -INF;
for(int i = 0; i < N - K +1; i++){
int ans = wa.at(i+K) - wa.at(i);
ANS = max(ANS, ans);
}
cout << ANS << endl;
}
}
| 0
| 98,410,291
|
#include <bits/stdc++.h>
#define rep(i,l,n) for(i=l;i<n;i++)
using namespace std;
int main(){
int d,s,i,n;
while(scanf("%d",&d)!=EOF){
s=0;
n=600/d;
rep(i,1,n){
s+=d*i*d*i*d;
}
cout<<s<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define fi first
#define se second
signed main()
{
string S;
bool izryt = false, flag = true;
stack < char > st;
cin.ignore();
while(getline(cin, S), izryt || S != ".") {
izryt = true;
Rep(i, S.size()) {
if(S[i] == '.' && i == (int)S.size() - 1) {
izryt = false;
} else if(S[i] == '(' || S[i] == '[') {
st.push(S[i]);
} else if(S[i] == ')' || S[i] == ']') {
if(!st.empty() && (S[i] == ')' && st.top() == '(' || S[i] == ']' && st.top() == '[')) {
st.pop();
} else {
flag = false;
}
}
}
if(!izryt) {
if(flag && st.empty()) cout << "yes" << endl;
else cout << "no" << endl;
while(!st.empty()) {
st.pop();
}
flag = true;
}
}
return 0;
}
| 0
| 11,865,424
|
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
using namespace std;
#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define rep(i,n) for(unsigned int i=0;i<(n);i++)
#define tr(it,container) for(typeof(container.begin()) it = container.begin(); \
it != container.end(); ++it)
typedef long long ll;
typedef complex<double> P;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,-1,0,1};
const double EPS = 1e-9;
const int days[] = {31,28,31,30,31,30,31,31,30,31,30,31};
const int daysleap[] = {31,29,31,30,31,30,31,31,30,31,30,31};
string hidari = "qwertasdfgzxcvb";
string migi = "yuiophjklnm";
bool phidari(char c){
return find(all(hidari),c)!=hidari.end();
}
int main(){
while(true){
string s;
cin >> s;
if(s=="#") break;
bool fhidari = phidari(s[0]);
int c = 0;
for(int i=0;i<s.length();i++){
bool ishidari = phidari(s[i]);
if(ishidari != fhidari) c++;
fhidari = ishidari;
}
cout << c << endl;
}
return 0;
}
|
#include <iostream>
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int debt = 100000;
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
debt += debt / 20;
if (debt % 1000 != 0) {
debt += 1000 - (debt % 1000);
}
}
std::cout << debt << std::endl;
}
| 0
| 82,198,405
|
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int a,b;
cin >> a >> b;
int c[3] = {a,b,a+b};
bool ok = 0;
rep(i,3) if(c[i]%3==0)ok = 1;
if(ok)cout << "Possible" << endl;
else cout << "Impossible" << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
ll gcd(ll a, ll b)
{
if (b == 0)
{
return a;
}
return gcd(b, a%b);
}
ll lcm(ll a, ll b)
{
return (a/gcd(a, b))*b;
}
int main() {
int N;
cin >> N;
vector<ll>T(N);
rep(i, 0, N){
cin >> T[i];
}
ll ans = 0;
rep(i, 0, N-1){
T[i+1] = lcm(T[i], T[i+1]);
}
rep(i, 0, N){
if(ans < T[i]){
ans = T[i];
}
}
cout << ans << endl;
return 0;
}
| 0
| 47,108,799
|
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <math.h>
const int MOD = 1000000007;
using namespace std;
int main(){
int a,b;
float x;
cin >> a >> b;
x = float(a + b)/2;
cout << ceil(x) << endl;
}
|
#include <iostream>
using namespace std ;
long long int arr[60] ;
int main()
{
long long int k ;
cin >> k ;
if (k == 0) {
cout << 2 << endl;
cout << 1 << " " << 1;
return 0;
}
for(int i = 0 ; i < 50 ; i++)
arr[i] = i ;
for(int i = 0 ; i < 50 ; i++)
arr[i] += (k) / 50 ;
if (k % 50 != 0) {
for(int i = 0 ; i < k % 50 ; i++)
{
arr[i] += 50 ;
for(int j = 0 ; j < 50 ; j++)
if(j != i)
arr[j]-- ;
}
}
cout << 50 << endl ;
for(int i = 0 ; i < 50 ; i++)
cout << arr[i] << " " ;
cout << endl ;
return 0 ;
}
| 0
| 11,272,738
|
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define Rev(a) reverse(a.begin(), a.end())
#define MATHPI acos(-1)
#define itn int
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int 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 io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-19;
signed main() {
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
ll sum = 0;
vll rap(a), gap(b), cap(c);
rep(i, a) {
cin >> rap[i];
}
rep(i, b) {
cin >> gap[i];
}
rep(i, c) {
cin >> cap[i];
}
rSort(rap);
rSort(gap);
rSort(cap);
vll pap(x+y);
rep(i, x) {
pap[i] = rap[i];
}
rep(i, y) {
pap[x+i] = gap[i];
}
Sort(pap);
rep(i, x+y) {
if (i < c && pap[i] < cap[i]) {
pap[i] = cap[i];
}
sum += pap[i];
}
mes(sum);
}
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int main(){
string s;cin>>s;
int cnt=0;
for(char c:s){
cnt+=c-'0';
}
puts(cnt%9==0?"Yes":"No");
}
| 0
| 73,620,348
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int x, t;
cin >> x >> t;
int ans=x-t;
if(ans<0) cout << 0 << endl;
else cout << ans << endl;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<cstring>
using namespace std;
int canReach[2][16001];
bool DP(vector<int> v,int t,int start){
memset(canReach,0,sizeof(canReach));
canReach[0][8000+start]=1;
if(v.size()==0)
return canReach[0][8000+t];
int i;
for(i=1;i<=v.size();i++){
for(int j=0;j<=16000;j++){
canReach[i%2][j]=((j+v[i-1])>16000?0:canReach[(i-1)%2][j+v[i-1]])||((j-v[i-1])<0?0:canReach[(i-1)%2][j-v[i-1]]);
}
}
return canReach[(i-1)%2][8000+t];
}
int main(){
string S;
int tx,ty;
cin>>S>>tx>>ty;
bool whichAxis=0;
vector<int> vx;
vector<int> vy;
int count=0;
int len=S.size();
char c;
for(int i=0; i<len; i++){
c=S[i];
if(c=='T'){
((whichAxis==0)?vx:vy).push_back(count);
count=0;
whichAxis=!whichAxis;
}
else{
count++;
}
}
((whichAxis==0)?vx:vy).push_back(count);
int start=vx[0];
vx.erase(vx.begin());
if(DP(vx,tx,start)&&DP(vy,ty,0))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
| 0
| 7,671,509
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
bool ans = false;
vector<vector<int> > A(3,vector<int>(3));
for (size_t i = 0; i < 3; i++)
{
for (size_t j = 0; j < 3; j++)
{
cin >> A.at(i).at(j);
}
}
int N = 0;
cin >> N;
vector<int> l(N,0);
for(int i = 0; i < N; i++) {
cin >> l.at(i);
for (size_t j = 0; j < 3; j++)
{
for (size_t k = 0; k < 3; k++)
{
if (A.at(k).at(j) == l.at(i))
{
A.at(k).at(j) = 0;
}
}
}
}
for (size_t i = 0; i < 3; i++)
{
if(A.at(0).at(i) == A.at(1).at(i) && A.at(2).at(i) == A.at(1).at(i))ans = true;
if(A.at(i).at(0) == A.at(i).at(1) && A.at(i).at(1) == A.at(i).at(2))ans = true;
}
if(A.at(0).at(0) == A.at(1).at(1) && A.at(2).at(2) == A.at(1).at(1))ans = true;
if(A.at(0).at(2) == A.at(1).at(1) && A.at(2).at(0) == A.at(1).at(1))ans = true;
if(ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
int n,m;
cin >> n >> m;
vector<vector<ll>> v(3, vector<ll>(n));
REP(i,n)cin >> v[0][i] >> v[1][i] >> v[2][i];
ll ans=-1;
REP(i,8){
vector<pair<ll, int>> arr;
REP(j,n){
ll tmp=0;
REP(k,3){
if(i>>k & 1){
tmp += v[k][j];
}else{
tmp -= v[k][j];
}
}
arr.push_back(make_pair(tmp, j));
}
sort(ALL(arr));
reverse(ALL(arr));
ll x=0;
ll y=0;
ll z=0;
REP(j,m){
x+= v[0][arr[j].second];
y+= v[1][arr[j].second];
z+= v[2][arr[j].second];
}
ans=max(ans,abs(x)+abs(y)+abs(z));
}
cout << ans << endl;
}
| 0
| 6,635,918
|
#include <bits/stdc++.h>
using namespace std;
priority_queue<int, vector<int>, less<int>> a, b, c, d;
int main() {
int x, y, A, B, C;
cin >> x >> y >> A >> B >> C;
int t;
for (int i = 1; i <= A; i++) {
cin >> t;
a.push(t);
}
for (int i = 1; i <= B; i++) {
cin >> t;
b.push(t);
}
for (int i = 1; i <= C; i++) {
cin >> t;
c.push(t);
}
for (int i = 1; i <= x; i++) {
c.push(a.top());
a.pop();
}
for (int i = 1; i <= y; i++) {
c.push(b.top());
b.pop();
}
long long ans = 0;
for (int i = 1; i <= x + y; i++) {
ans += (long long)c.top();
c.pop();
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int N, K;
ll V[55], ans = 0;
int main(){
scanf("%d%d", &N, &K);
for (int i = 0; i < N; i++) scanf("%lld", V + i);
for (int L = 0; L <= min(N, K); L++){
for (int R = 0; L + R <= min(N, K); R++){
priority_queue <ll, vector<ll>, greater<ll> > que;
ll now = 0;
for (int i = 0; i < L; i++){
now += V[i];
if (V[i] < 0) que.push(V[i]);
}
for (int i = 0; i < R; i++){
now += V[N - 1 - i];
if (V[N - 1 - i] < 0) que.push(V[N - 1 - i]);
}
int cnt = 0;
while (!que.empty() && cnt < K - (L + R)){
ll Q = que.top(); que.pop();
cnt++;
now -= Q;
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
}
| 0
| 70,999,047
|
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define rep(i, N) for(int i = 0; i < N; i++)
#define rep2(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000000000000
#define MAX 200001
const ll MOD = 1000000007;
template <typename T > inline string toString(const T &a) {ostringstream oss; oss << a; return oss.str();};
int main(){
int K,N;
cin >> K >> N;
vector<int> A(N);
int ans;
rep(i,N) cin >> A[i];
rep(i,N){
if(i==0){
ans = A[N-1]-A[0];
}
else{
ans = min(K-A[i] + A[i-1], ans);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
#define dump(x) cerr<<#x<<": "<<x<<endl;
#define bit(k) (1LL<<(k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << "{" <<p.first << ", " << p.second << "}";
return os;
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = (ll)1e9+7;
const double PI = acos(-1.0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int K;
cin >> K;
vector<ll> A(K);
rep(i,K)cin>>A[i];
auto f = [&](ll X){
for(int i = 0; i < K; i++){
X = X / A[i] * A[i];
}
return X;
};
ll ok = INFLL, ng = 0;
while(ok - ng > 1){
ll mid = (ok + ng)>>1;
if(f(mid) >= 2)ok = mid;
else ng = mid;
}
ll l = ok;
ok = 0, ng = INFLL;
while(ng - ok > 1){
ll mid = (ok + ng)>>1;
if(f(mid)<=2)ok = mid;
else ng = mid;
}
ll r = ok;
if(l > r){
cout << -1 << endl;
return 0;
}
cout << l << " " << r << endl;
}
| 0
| 87,443,425
|
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<queue>
#include<stack>
#include<algorithm>
#include<string>
#include<math.h>
#include <iomanip>
#include <numeric>
#define _USE_MATH_DEFINES
using namespace std;
int main()
{
int n,m;cin>>n>>m;
long long int ans = (n*(n-1))/2 + (m*(m-1))/2;
cout<<ans<<endl;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void dump_func()
{
cerr << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&h, Tail &&... t)
{
cerr << h << (sizeof...(Tail) == 0 ? "" : ", "),
dump_func(forward<Tail>(t)...);
}
#define dump(...) \
cerr << "\n\n";
typedef long long ll;
int main()
{
ll a, b, c, k;
cin >> a >> b >> c >> k;
ll res = a - b;
if (k % 2 != 0) {
res *= -1;
}
cout << res << endl;
}
| 0
| 57,078,573
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(int x,int y){
while(y != 0){
ll tmp = y;
y = x % tmp;
x = tmp;
}
return x;
}
int main(){
ll a,b,g;
cin >> a >> b;
if(a<b){
g = gcd(b,a);
}else{
g = gcd(a,b);
}
cout << a * b / (g) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
template<class T> using V = vector<T>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
const int inf = (1<<30)-1;
const ll infll = (1LL<<62)-1;
ll ceil(const ll &a, const ll &b){return ((a)+(b)-1)/b;}
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 n;
cin >> n;
V<V<int>> g(n);
rep(i,n) {
int a;
cin >> a;
a--;
int k;
cin >> k;
rep(j,k) {
int b;
cin >> b;
b--;
g[a].push_back(b);
}
}
V<int> d(n,-1);
d[0] = 0;
queue<int> q;
q.push(0);
while(sz(q)) {
int v = q.front(); q.pop();
for(int nv : g[v]) {
if(d[nv] != -1) continue;
d[nv] = d[v] + 1;
q.push(nv);
}
}
rep(i,n) {
printf("%d %d\n", i+1, d[i]);
}
}
| 0
| 46,813,422
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define rrep(i,n) RFOR(i,n,0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
ll n = 50;
cout << n << endl;
ll a = k / n - k % n + n - 1;
rep(i,n) cout << (i < k % n ? a + n + 1 : a) << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int x[10] = {-1,2,5,5,4,5,6,3,7,6};
void chmax(int &a, const int &b) { if (a < b) a = b; return; }
int main(){
int n, m; cin >> n >> m;
vector<int> data(m);
for (int i = 0; i < m; i++) cin >> data[i];
sort(data.begin(),data.end(),greater<int>());
vector<int> keta(n+1,-1); keta[0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < m; j++) {
if (i - x[data[j]] >= 0) chmax(keta[i], keta[i - x[data[j]]] + 1);
}
}
while (n > 0) {
for (int i = 0; i < m; i++) {
if (n - x[data[i]] >= 0 && keta[n] == keta[n - x[data[i]]] + 1) {
cout << data[i];
n -= x[data[i]];
break;
}
}
}
return 0;
}
| 0
| 384,701
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define rpd(i,s,e,d) for(int i=(s);i<(int)(e);i+=(d))
int gcd_all(vi &A){ int g = 0; for(int a:A) g = gcd(g, a); return g; }
int sum_array(vi &C, int start, int end, int step){
int c = 0;
rpd(i, start, end, step) c += C[i];
return c;
}
bool is_pairwise(vi &A){
int MAX_A = 1000000 + 1;
vi C(MAX_A, 0); for(int a:A) C[a]++;
if(sum_array(C, 2, MAX_A, 2) > 1) return false;
rpd(i, 3, MAX_A, 2) if(sum_array(C, i, MAX_A, i) > 1) return false;
return true;
}
int solve(vi &A){
if(is_pairwise(A)) return 0;
if(gcd_all(A) == 1) return 1;
return 2;
}
int main(){
int N; cin>>N;
vi A(N); for(auto& a:A) cin>>a;
cout<< vector<string>{"pairwise","setwise","not"}[solve(A)] <<" coprime\n";
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <utility>
using namespace std;
typedef long long signed int ll;
constexpr ll inf = INT64_MAX / 2;
int main() {
int n, k;
vector<pair<int, int>> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
v.emplace_back(x, y);
}
sort(v.begin(), v.end());
ll res = inf;
vector<pair<int, int>> v2;
for (auto i = v.begin();i + (k-1) < v.end(); i++) {
for (auto j = i + (k-1); j < v.end(); j++) {
v2.clear();
for (auto l = i; l <= j; l++) {
v2.push_back(*l);
}
sort(v2.begin(), v2.end(), [](pair<int, int> a, pair<int, int> b) {
return a.second < b.second;
});
for (auto l = v2.begin(); l != v2.end() && (l+(k-1)) != v2.end(); l++) {
ll x = j->first - i->first;
ll y = (l + k - 1)->second - l->second;
res = min(res, x*y);
}
}
}
cout << res << endl;
}
| 0
| 37,244,194
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(); cout.tie(0)
#define MAXX 1005
int n , k;
string s;
int main()
{
_FastIO;
cin >> n;
cin >> s;
cin >> k;
char c = s[k - 1];
for(int i = 0; i < n; i++){
if(s[i] != c){
cout << "*";
}
else
cout << c;
}
cout << endl;
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cassert>
#include<vector>
#include<queue>
#include<set>
using namespace std;
const int INF = 100000;
const int MAX_N = 50000;
const int MAX_M = 20;
int C[MAX_N + 1];
int T[MAX_M + 1][MAX_N + 1];
int n, m;
int CoinProblem();
int main(void)
{
for(int i = 0; i < MAX_M + 1; i++)
{
for(int j = 0; j < MAX_N + 1; j++)
{
if( j == 0 )
{
T[i][j] = 0;
}
else
{
T[i][j] = INF;
}
}
}
cin >> n >> m;
for(int i = 1; i <= m; i++)
{
cin >> C[i];
}
CoinProblem();
printf("%d\n", T[m][n]);
return 0;
}
int CoinProblem()
{
for(int j = 0; j <= n; j++)
{
for(int i = 1; i <= m; i++)
{
int num = j - C[i];
if( num >= 0 )
{
T[i][j] = T[i][num] + 1;
}
else
{
T[i][j] = T[i - 1][j];
}
T[i][j] = min(T[i - 1][j], T[i][j]);
}
}
return 0;
}
| 0
| 38,827,646
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using garph = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
signed main (){
int n;cin>>n;
vecrep(n,s,string);
int b=0,a=0,ans=0,ab=0;
rep(i,0,n){
if(s[i][0]=='B')b++;
if(s[i][s[i].size()-1]=='A')a++;
if(s[i][0]=='B'&&s[i][s[i].size()-1]=='A')ab++;
rep(j,0,s[i].size()-1){
if(s[i][j]=='A'&&s[i][j+1]=='B')ans++;
}
}
ans+=min(min(a,b),n-1);
if(a==ab&&b==ab&&ab!=n&&ab!=0)ans-=1;
cout<<ans<<nnn;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main() {
int X,Y,Z,K;
cin>>X>>Y>>Z>>K;
vector<ll> A(X),B(Y),C(Z);
rep(i,X)cin>>A.at(i);
rep(i,Y)cin>>B.at(i);
rep(i,Z)cin>>C.at(i);
sort(A.begin(),A.end());
vector<ll> BC(Y*Z);
rep(i,Y*Z){
BC.at(i)=B.at(i/Z)+C.at(i%Z);
}
sort(BC.begin(),BC.end());
ll r=-1,l=A.back()+BC.back()+1;
while(l-r>1){
ll m=(r+l)/2;
ll count=0;
rep(i,X){
count+=BC.end()-lower_bound(BC.begin(),BC.end(),m-A.at(i));
}
if(count<=K){l=m;}
else{r=m;}
}
vector<ll> ans(0);
reverse(A.begin(),A.end());
reverse(BC.begin(),BC.end());
rep(i,X){
rep(j,Y*Z){
if(A.at(i)+BC.at(j)>=l){ans.pb(A.at(i)+BC.at(j));}
else{break;}
}
}
sort(ans.rbegin(),ans.rend());
rep(i,sz(ans)){
cout<<ans.at(i)<<endl;
}
rep(i,K-sz(ans)){
cout<<r<<endl;
}
}
| 0
| 10,685,640
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int y , m , d,n;
void solve(){
bool birthDay = false;
int ans = 0;
int maxDay;
for(int year = 1; year < 1000 ; year++){
for(int month = 1 ; month <= 10 ; month++){
if(year % 3 == 0) maxDay = 20;
else if(month % 2 == 0) maxDay = 19;
else maxDay = 20;
for(int day = 1; day <= maxDay; day++){
if(year == y && month == m && day == d){
birthDay = true;
}
if(birthDay) ans++;
}
}
}
cout << ans << endl;
}
int main(){
cin >> n;
for(int input = 0; input < n; input++){
cin >> y >> m >> d;
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (ll)(m); --i)
#define rep(i, n) REP(i, 0, n)
#define rep2(i, n) REP2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define rall(hoge) (hoge).rbegin(), (hoge).rend()
#define en '\n'
using Edge = pair<ll, ll>;
using Graph = vector<vector<Edge>>;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
using ld = long double;
static const ld pi = 3.141592653589793L;
template <class T> inline void print(T x) { cout << x << '\n'; }
template <class T> bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T& a, const T& b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x / gcd(x,y)*y ;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll res = 1;
rep(i,n) {
ll t;
cin >> t;
res = lcm(res,t);
}
print(res);
return 0;
}
| 0
| 10,507,715
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
ll n;
cin >> n;
if(n%2 == 1) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
ll cnt = 10;
while(cnt <= n){
ans += n/cnt;
cnt *= 5;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw "\n"
int main(void)
{
CIN;
ll tc,l,k,sum=0,x=0,y,z=0,m=1,n=0,ans=0;
map<ll,ll>mp;
cin>>n;
for(m=1;;m++){
cin>>n;
if(mp[n])return cout<<m,0;
mp[n]++;
n=(n%2?3*n+1:n/2);
}
}
| 0
| 98,552,465
|
#include <iostream>
using namespace std;
int isPrime(int n);
int dp[1000000]={};
int main(){
int n;
for(int i=2;i<=1000000;i++){
if(isPrime(i)) dp[i]=dp[i-1]+1;
else dp[i]=dp[i-1];
}
while(cin >> n){
cout << dp[n]<< endl;
}
}
int isPrime(int n){
for(int i=2;i*i<=n;i++){
if(n%i==0) return 0;
}
return 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, m;
cin >> a >> b >> m;
int minrei = 100000;
vector<int> reizoko(a);
for (int i = 0; i < a; i++) {
cin >> reizoko.at(i);
minrei = min(minrei,reizoko.at(i));
}
int minden = 100000;
vector<int> denshi(b);
for (int i = 0; i < b; i++) {
cin >> denshi.at(i);
minden = min(minden,denshi.at(i));
}
long minsum = minrei + minden;
for (int i = 0; i < m; i++) {
long sum = 0;
long x, y, c;
cin >> x >> y >> c;
sum = reizoko.at(x-1) + denshi.at(y-1) - c;
minsum = min(minsum,sum);
}
cout << minsum << endl;
}
| 0
| 92,957,899
|
#include<bits/stdc++.h>
#define pb push_back
#define sz(v) (v).size()
#define all(v) (v).begin(),(v).end()
#define inf 1000000007
#define mod inf
using namespace std;
template <typename T> void chmax(T &x,T y){x=x>y?x:y;return;}
template <typename T> void chmin(T &x,T y){x=x<y?x:y;return;}
typedef long long ll;
typedef unsigned long long ull;
int n,k;
ll ans,f[100005];
ll fpow(int x,int y)
{
if(y==0) return 1;
ll ret=fpow(x,y/2);
ret*=ret,ret%=mod;
if(y%2==1) ret*=x,ret%=mod;
return ret;
}
int main()
{
cin>>n>>k;
for(int i=k;i>=1;i--)
{
f[i]=fpow(k/i,n);
for(int j=i+i;j<=k;j+=i) f[i]-=f[j],f[i]+=mod,f[i]%=mod;
ans+=ll(i)*f[i],ans%=mod;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using graph=vector<vector<int>>;
using field=vector<string>;
using p =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
ll n,Y;
cin>>n>>Y;
for(int x=0;x<=n;++x){
for(int y=0;y<=n-x;++y){
int sum=x*10000+y*5000+(n-x-y)*1000;
if(sum==Y){
cout<<x<<" "<<y<<" "<<n-x-y<<endl;
return 0;
}
}
}
cout<<-1<<" "<<-1<<" "<<-1<<endl;
}
| 0
| 14,199,194
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n) ;i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF=1e18;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b){ a = b; return 1; } return 0; }
int main(int argc, char const *argv[]) {
string s;
int w;
cin >> s >> w;
w;
for(int i=0; i<sz(s); i++){
if(i%w==0) cout << s[i];
}
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using graph = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
int mpow(int a,int b,int mod){
int ans = 1;
rep(i,0,b)ans=(ans*a)%mod;
if(b==0)return 0;
else return ans;
}
signed main (){
int n;cin>>n;
map<int,int>m{};
int t = 0,ans = 1;
rep(i,0,n){
int a;cin>>a;
if(i==0&&a!=0){
cout<<0<<nnn;
return 0;
}
m[a]++;
t = max(t,a);
}
if(m[0]!=1){
cout<<0<<nnn;
return 0;
}
rep(i,1,t+1){
ans=(ans*mpow(m[i-1],m[i],998244353))%998244353;
}
cout<<ans<<nnn;
return 0;
}
| 0
| 80,267,937
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
string s, t;
cin >> s >> t;
sort(all(s));
sort(all(t), greater<char>());
if (s < t) cout << "Yes" << '\n';
else cout << "No" << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) solve();
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define STRMAX 256
int main(void)
{
char str[STRMAX];
char out[STRMAX];
int num;
int num2;
int i,j,k;
while (1) {
memset(str, '\0', sizeof(str));
scanf("%s", str);
if (str[0] == '-') {
break;
}
else {
scanf("%d", &num);
for (i=0; i<num; i++) {
scanf("%d", &num2);
j = num2;
k = 0;
memset(out, '\0', sizeof(out));
while (str[j] != '\0') {
out[k] = str[j];
k++;
j++;
}
for (j=0; j<num2; j++) {
out[k] = str[j];
k++;
}
out[k] = '\0';
strcpy(str, out);
}
printf("%s\n", str);
}
}
return 0;
}
| 0
| 64,816,219
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
int n, m;
cin >> n >> m;
vector<int> gl(m), gr(m);
rep(i,m) cin >> gl[i] >> gr[i];
int l = 0;
int r = INF;
rep(i,m) {
l = max(l, gl[i]);
r = min(r, gr[i]);
}
cout << max(0, r-l+1) << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef pair<double,double> PD;
typedef priority_queue<P,vector<P>,greater<P> > P_queue;
typedef priority_queue<Pd,vector<Pd>,greater<Pd> > Pd_queue;
const ll MOD=998244353;
const ll mod=1000000007;
const ll INF=1e15;
const double DEL=1e-6;
#define _GLIBCXX_DEBUG
#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define ALL(a) a.begin(),a.end()
#define SORT(a) sort(ALL(a))
#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());
#define ADD(a,b) a=(a+b)%mod
#define MUL(a,b) a=(a*b)%mod
ll N,K;
vec p,c;
void input(){
cin>>N>>K;
c.resize(N);
rep(i,N){
ll x; cin>>x; x--;
p.pb(x);
}
rep(i,N) cin>>c[i];
}
ll memo_k[5001], memo_score[5001];
ll ANS=-INF;
ll dfs(ll x, ll k, ll score){
if(k!=K) ANS=max(ANS,score);
if(!k) return score;
if(memo_k[x]<0){
memo_k[x]=k; memo_score[x]=score;
return dfs(p[x],k-1,score+c[p[x]]);
}
if(2*(memo_k[x]-k)<=k){
ll kk=memo_k[x]-k, ss=-memo_score[x]+score;
return dfs(x,kk+(k%kk),score+ss*((k/kk)-1));
}
return dfs(p[x],k-1,score+c[p[x]]);
}
void init(){
rep(i,N) memo_k[i]=-1;
rep(i,N) memo_score[i]=0;
return;
}
int main(){
input();
vec ans(N,0);
rep(i,N){
init();
ans[i]=dfs(i,K,0);
}
cout<<ANS<<endl;
}
| 0
| 37,777,993
|
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
int main(){
int W,H,x0,y0;
char t[20][20];
bool visit[20][20];
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
typedef pair<int,int>P;
queue<P>Q;
while(cin>>W>>H){
if(W==0||H==0)break;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin>>t[i][j];
if(t[i][j]=='@'){
x0=j;
y0=i;
}
visit[i][j]=true;
}
}
int sum=0;
Q.push(P(x0,y0));
visit[y0][x0]=false;
while(!Q.empty()){
int srcx=Q.front().first;
int srcy=Q.front().second;
Q.pop();
sum++;
for(int i=0;i<4;++i){
int curx=srcx+dx[i];
int cury=srcy+dy[i];
if(t[cury][curx]=='#') continue;
if(curx<0||curx>=W||cury<0||cury>=H) continue;
if(!visit[cury][curx]) continue;
visit[cury][curx]=false;
Q.push(P(curx,cury));
}
}
cout<<sum<<endl;
}
}
|
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define boolsize 1000001
#define pi pair<ll,ll>
#define vi vector<ll>
#define vii vector<pi>
using namespace std;
template<typename T>
void showvector(vector <T> v)
{
for(T x:v)
cout<<x<<" ";
cout<<endl;
}
template<typename T>
void showvector1(vector <T> v)
{
ll n=v.size();
fo1(i,n-1)
cout<<v[i]<<endl;
}
template<typename T>
void showset(set <T> s)
{
for(T x: s)
cout<<x<<" ";
cout<<endl;
}
template<class T>
void showvectorpair(vector<T> v)
{
for(auto it=v.begin();it!=v.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T,typename P>
void showmap(map <T,P> m)
{
for(auto it=m.begin();it!=m.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T>
bool comp(T a,T b)
{
return (a>b);
}
template<class T>
bool comppair(T a,T b)
{
if(a.first==b.first)
return(a.second>b.second);
return (a.first>b.first);
}
bool sameparity(ll a,ll b)
{
return (a%2==b%2);
}
bool difparity(ll a,ll b)
{
return !(a%2==b%2);
}
bool isprime(ll x)
{ if(x<=1)
return false;
for(ll i=2;i<=sqrt(x);i++)
{
if(x%i==0)
return false;
}
return true;
}
bool iseven(ll x)
{
return !(x%2);
}
bool isodd(ll x)
{
return (x%2);
}
void vfun()
{
ll n,k;
cin>>n;
vector <ll> v(n);
fo(i,n)
cin>>v[i];
}
static ll cnt=0;
void dfs(ll ind,ll siz,vector <ll> visited,vector <ll> v[],int c)
{
if(c==siz)
{
cnt++;
return;
}
visited[ind]=1;
for(ll i=0;i<v[ind].size();i++)
{
if(!visited[v[ind][i]])
dfs(v[ind][i],siz,visited,v,c+1);
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll test=1;
while(test--)
{
ll n,e,a,b;
cin>>n>>e;
vector <ll> v[n+1];
fo(i,e)
{
cin>>a>>b;
v[a].pb(b);
v[b].pb(a);
}
vector <ll> visited(n+1,0);
dfs(1,n,visited,v,1);
cout<<cnt;
}
}
| 0
| 56,697,434
|
#include <iostream>
using namespace std;
int many(int, int);
int main()
{
int a, b, c;
cin >> a;
cin >> b;
while (a != 0 || b != 0) {
c = many(a, b);
cout << c << endl;
cin >> a;
cin >> b;
}
return 0;
}
int many(int x, int y)
{
int n, m, r, p, q = 0;
for (n = 1; n <= x; n++) {
for (m = 1; m <= x; m++) {
for (r = 1; r <= x; r++) {
if (n < m && m < r) {
p = n + m + r;
if (p == y) {
q = q + 1;
}
}
}
}
}
return q;
}
|
#include <iostream>
#include <set>
#include <map>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <climits>
#include <math.h>
#include <cassert>
#include <unordered_map>
using namespace std;
#pragma warning(disable : 4996)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll MOD = 1e9 + 7;
ll pw(ll a, ll p) {
ll res = 1;
while (p > 0) {
if (p & 1) {
res = (res * a) % MOD;
}
a = (a * a) % MOD;
p /= 2;
}
return res;
}
int main() {
#ifdef _DEBUG
freopen("input1.txt", "r", stdin);
freopen("output2.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> have(k + 1);
ll ans = 0;
for (ll i = k; i >= 1; i--) {
ll cur = pw(k / i, n);
for (int j = i + i; j <= k; j += i) {
cur -= have[j];
if (cur < 0)cur += MOD;
}
have[i] = cur;
cur = (cur * i) % MOD;
ans = (ans + cur) % MOD;
}
cout << ans;
}
| 0
| 52,350,145
|
#include<iostream>
#include<string>
#include<cmath>
#include<array>
#include<vector>
#include<numeric>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
int main(){
ll N;
cin>>N;
cout.precision(20);
std::vector<ll> xs,ys;
ll rN=0;
for(ll i=0;i<N;++i){
ll x,y;
cin>>x>>y;
if(x!=0 || y!=0){
xs.push_back(x);
ys.push_back(y);
rN++;
}
}
N=rN;
ll centx=std::accumulate(xs.begin(),xs.end(),0ll);
ll centy=std::accumulate(ys.begin(),ys.end(),0ll);
std::vector<ll> sxs,sys;
auto calcn=[](ll dx,ll dy,ll x,ll y)->ll{
return -x*dy+y*dx;
};
auto calcp=[](ll dx,ll dy,ll x,ll y)->ll{
return x*dx+y*dy;
};
double ans;
if(N==0){
}else if(N==1){
sxs.push_back(xs.at(0));
sxs.push_back(-xs.at(0));
sys.push_back(ys.at(0));
sys.push_back(-ys.at(0));
}else{
ll x0=xs.at(0);
ll y0=ys.at(0);
ll ind=-1;
for(ll i=1;i<N;++i){
ll xi=xs.at(i);
ll yi=ys.at(i);
if(xi*y0-yi*x0!=0){
ind=i;
break;
}
}
if(ind==-1){
if(x0!=0){
ll sabsx=0;
for(auto& x:xs){
sabsx+=std::abs(x);
}
ll po=centx>0?centx+sabsx:centx-sabsx;
ans=std::abs(static_cast<double>(po)*std::sqrt(x0*x0+y0*y0)/x0/2);
}else{
ll sabsy=0;
for(auto& y:ys){
sabsy+=std::abs(y);
}
ll po=centy>0?centy+sabsy:centy-sabsy;
ans=std::abs(static_cast<double>(po)*std::sqrt(x0*x0+y0*y0)/y0/2);
}
cout<<ans<<endl;
return 0;
}
ll x1=xs.at(ind);
ll y1=ys.at(ind);
xs.erase(xs.begin());
xs.erase(xs.begin()+ind-1);
ys.erase(ys.begin());
ys.erase(ys.begin()+ind-1);
ll pro=x0*y1-x1*y0;
if(pro>0){
sxs.push_back(x0+x1);
sxs.push_back(-x0+x1);
sxs.push_back(-x0-x1);
sxs.push_back(x0-x1);
sys.push_back(y0+y1);
sys.push_back(-y0+y1);
sys.push_back(-y0-y1);
sys.push_back(y0-y1);
}else{
sxs.push_back(x1+x0);
sxs.push_back(-x1+x0);
sxs.push_back(-x1-x0);
sxs.push_back(x1-x0);
sys.push_back(y1+y0);
sys.push_back(-y1+y0);
sys.push_back(-y1-y0);
sys.push_back(y1-y0);
}
}
for(ll i=0;i<N-2;++i){
ll x=xs.at(i);
ll y=ys.at(i);
std::vector<ll> nsxs,nsys;
ll siz=sxs.size();
for(ll j=0;j<siz;++j){
ll jm=j==0?siz-1:j-1;
ll jp=j==siz-1?0:j+1;
ll nj=calcn(x,y,sxs.at(j),sys.at(j));
ll njm=calcn(x,y,sxs.at(jm),sys.at(jm));
ll njp=calcn(x,y,sxs.at(jp),sys.at(jp));
if(nj>njm && nj>njp){
nsxs.push_back(sxs.at(j)+x);
nsys.push_back(sys.at(j)+y);
nsxs.push_back(sxs.at(j)-x);
nsys.push_back(sys.at(j)-y);
}else if(nj<njm && nj<njp){
nsxs.push_back(sxs.at(j)-x);
nsys.push_back(sys.at(j)-y);
nsxs.push_back(sxs.at(j)+x);
nsys.push_back(sys.at(j)+y);
}else if(nj>njm || nj<njp){
nsxs.push_back(sxs.at(j)+x);
nsys.push_back(sys.at(j)+y);
}else if(nj<njm || nj>njp){
nsxs.push_back(sxs.at(j)-x);
nsys.push_back(sys.at(j)-y);
}
}
sxs=nsxs;
sys=nsys;
}
auto itx=sxs.begin();
auto ity=sys.begin();
ll max=0;
for(;itx!=sxs.end();itx++,ity++){
ll sx=*itx+centx;
ll sy=*ity+centy;
ll sqn=sx*sx+sy*sy;
if(sqn>max){
max=sqn;
}
}
ans=std::sqrt(static_cast<double>(max)/4);
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
bool comp1(pair<pair<int,int>,int>a,pair<pair<int,int>,int>b)
{
return a.first.first<b.first.first;
}
bool comp2(pair<pair<int,int>,int>a,pair<pair<int,int>,int>b)
{
return a.first.second<b.first.second;
}
int parent[100005];
int sz[100005];
int find_parent(int ver)
{
if(ver==parent[ver])
return ver;
return parent[ver]=find_parent(parent[ver]);
}
bool merge(int a,int b)
{
a=find_parent(a);
b=find_parent(b);
if(a!=b)
{
if(sz[a]<sz[b])
swap(a,b);
sz[a]+=sz[b];
parent[b]=a;
return true;
}
return false;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int x,y;
cin>>x>>y;
if(abs(x-y)>1)
cout<<"Alice";
else
cout<<"Brown";
}
| 0
| 58,897,905
|
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int A[2000010];
int C[100010];
int main (){
int n;
cin>>n;
for(int i=0;i<100000;i++) C[i]=0;
for(int i=0;i<n;i++) {
cin>>A[i];
C[A[i]]++;
}
int flag=0;
for(int i=0;i<100000;i++){
for(int j=C[i];j>0;j--) if(flag) {
cout<<" "<<i;
flag++;
}
else {cout<<i;flag++;}
}
cout<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
struct Dice{
int f[7];
int n[100];
int right[7][7] = { {0, 0, 0, 0, 0, 0, 0},
{0, 0, 3, 5, 2, 4, 0},
{0, 4, 0, 1, 6, 0, 3},
{0, 2, 6, 0, 0, 1, 5},
{0, 5, 1, 0, 0, 6, 2},
{0, 3, 0, 6, 1, 0, 4},
{0, 0, 4, 2, 5, 3, 0} };
void move(char dir){
int sw;
switch(dir){
case 'E':
sw = f[1];
f[1] = f[4];
f[4] = f[6];
f[6] = f[3];
f[3] = sw;
break;
case 'N':
sw = f[1];
f[1] = f[2];
f[2] = f[6];
f[6] = f[5];
f[5] = sw;
break;
case 'S':
sw = f[1];
f[1] = f[5];
f[5] = f[6];
f[6] = f[2];
f[2] = sw;
break;
case 'W':
sw = f[1];
f[1] = f[3];
f[3] = f[6];
f[6] = f[4];
f[4] = sw;
break;
}
}
int getright(int up, int front){
return f[right[up][front]];
}
};
int main() {
Dice dice;
for(int i = 1; i <= 6; ++i){
cin >> dice.f[i];
dice.n[dice.f[i]] = i;
}
int n;
cin >> n;
int up, front;
for(int i = 0; i < n; ++i){
cin >> up; cin >> front;
cout << dice.getright(dice.n[up], dice.n[front]) << endl;
}
return 0;
}
| 0
| 69,596,505
|
#include <iostream>
using namespace std;
bool uruu(int y) {
return y % 3 == 0;
}
int main() {
int n; cin >> n;
int days[11] = {20, 19, 20, 19, 20, 19, 20, 19, 20, 19};
int Days[11];
for (int i = 0; i < 10; ++i) {
Days[i] = days[i];
}
for (int i = 0; i < 10; ++i) {
days[i+1] += days[i];
}
for (int t = 0; t < n; ++t) {
int Y, M, D; cin >> Y >> M >> D;
int ans = 0;
if (Y < 1000) {
if (uruu(Y)) {
ans += 20 * (10-M);
ans += 20 - D;
}
else {
ans += days[10]-days[M-1];
ans += Days[M-1] - D;
}
}
while (++Y < 1000) {
ans += uruu(Y) ? 20*10 : days[10];
}
cout << ans+1 << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int n;
cin>>n;
int ans=1;
int m=n;
while(1){
if(m%360==0){
cout<<ans<<endl;
return 0;
}
ans++;
m+=n;
m%=360;
}
}
| 0
| 12,303,520
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
const int MOD = 1E9 + 7;
ll exp(int a, int n) {
if (n == 0) return 1;
ll b = exp(a, n / 2);
(b *= b) %= MOD;
if (n & 1) (b *= a) %= MOD;
return b;
}
void _main() {
int n; cin >> n;
vector<ll> a(n); cin >> a;
ll ans = 0;
for (int bit = 60; bit >= 0; bit--) {
ll cnt[2]{};
for (int i = 0; i < n; i++) {
cnt[!!(1LL << bit & a[i])]++;
}
ans += cnt[0] * cnt[1] % MOD * exp(2, bit) % MOD;
ans %= MOD;
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pii pair<int,int>
const int mod = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
ll dp[n + 5][k + 5] = {};
memset(dp, 0x3f, sizeof(dp));
f1(k) {
dp[0][i] = 0;
}
dp[0][0] = 0;
ll v[n + 5] = {};
f1 (n) {
cin >> v[i];
fr (j, 0, k + 1) {
fr(z, 1, min(j + 1,i) + 1) {
dp[i][j] = min(dp[i][j], dp[i-z][j-z+1] + max(0LL,v[i] - v[i-z]));
}
}
}
ll mi = 1e18;
f(n+1) {
if (i + k >= n) {
mi = min(mi, dp[i][k-n+i]);
}
}
cout << mi << '\n';
}
| 0
| 64,089,262
|
#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
struct ch {
char num,eng;
};
void bubblesort(struct ch str[], int n);
void selectionsort(struct ch str[], int n);
int main()
{
int n,i,j;
ch str1[100],str2[100];
cin >> n;
for (i = 0; i < n; i++) {
cin >> str1[i].eng >> str1[i].num;
}
for (i = 0; i < n; i++) str2[i] = str1[i];
bubblesort(str1,n);
selectionsort(str2, n);
for (i = 0; i < n; i++) {
cout << str1[i].eng << str1[i].num;
if (i != n - 1) {
cout << " ";
}
else {
cout << endl;
break;
}
}
cout << "Stable" << endl;
j = 1;
for (i = 0; i < n; i++) {
cout << str2[i].eng << str2[i].num;
if (j == 1 && str2[i].eng == str1[i].eng && str1[i].num==str2[i].num) {
j = 1;
}else {
j = 0;
}
if (i != n - 1) {
cout << " ";
}
else {
cout << endl;
break;
}
}
if (j == 1) {
cout << "Stable" << endl;
}
else {
cout << "Not stable" << endl;
}
}
void bubblesort(struct ch str[], int n) {
int i,j,flag=1;
struct ch temp;
while (flag) {
flag = 0;
for (j = n - 1; j > 0; j--) {
if (str[j].num < str[j - 1].num) {
swap(str[j], str[j - 1]);
flag = 1;
}
}
}
}
void selectionsort(struct ch str[], int n) {
struct ch temp;
int i, j,min;
for (i = 0; i < n; i++) {
min = i;
for (j = i; j < n; j++) {
if (str[j].num < str[min].num) {
min = j;
}
}
swap(str[i], str[min]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Maxn = 5005;
const ll Inf = 1000000000000000000ll;
int n, k;
int P[Maxn];
int C[Maxn];
bool tk[Maxn];
vector <int> seq;
ll res = -Inf;
int main()
{
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &P[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &C[i]);
for (int i = 1; i <= n; i++) if (!tk[i]) {
seq.clear();
int cur = i;
ll sum = 0;
while (!tk[cur]) {
sum += C[cur];
seq.push_back(C[cur]);
tk[cur] = true;
cur = P[cur];
}
for (int i = 0; i < seq.size(); i++) {
ll cand = 0;
for (int j = 0; j < seq.size() && j + 1 <= k; j++) {
cand += seq[(i + j) % int(seq.size())];
if (sum > 0) res = max(res, cand + ll(k - j - 1) / ll(seq.size()) * sum);
else res = max(res, cand);
}
}
}
cout << res << endl;
return 0;
}
| 0
| 87,471,658
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
for (char i = 'a'; i <= 'z'; ++i)
if (s.find(i) == -1)
{
cout << i << endl;
return 0;
}
cout << "None" << endl;
}
|
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
#define fi first
#define se second
#define set20 cout<<fixed<<setprecision(20) ;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
double pi=acos(-1) ;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
string s ; cin>> s ;
ll k= s.size() ;
string t ="" ;
rep(i,k){
if(s[i]!='x') t+= s[i] ;
}
ll z = t.size() ;
bool ok=1 ;
rep(i,z/2){
if(t[i]!=t[z-1-i]) ok= 0 ;
}
if(!ok) cout<<-1<<endl ;
else{
ll x= z+1 ;
vector<ll> A(x) ;
ll j= 0 ;
rep(i,k){
if(s[i]=='x') A[j] ++ ;
else j++ ;
}
ll ans=0 ;
rep(i,x/2){
ans+= max(A[i],A[x-1-i]) - min(A[i],A[x-1-i]) ;
}
cout<<ans<<endl ;
}
return 0 ;
}
| 0
| 55,265,979
|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(ll, n, q);
vector<vector<int>> g(n + 1);
rep(i, n - 1) {
in(int, a, b);
g[a].push_back(b);
g[b].push_back(a);
}
vector<ll> xs(n + 1);
rep(i, q) {
in(ll, p, x);
xs[p] += x;
}
vector<ll> result(n + 1);
function<void(ll, int, int)> dfs = [&](ll x, int node, int parent) {
x += xs[node];
result[node] = x;
for (int child : g[node]) {
if (child == parent) continue;
dfs(x, child, node);
}
};
dfs(0, 1, -1);
rep(i, n) {
if (i) cout << " ";
cout << result[i + 1];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define xrep(i,x,n) for(ll i = (ll) x; i < (ll) n; i++)
#define vl vector<long long>
#define vs vector<string>
int main() {
ll a,b; cin >> a >> b;
ll A = a,B = b;
rep(i,b-1){
A *= 10;
A += a;
}
rep(i,a-1){
B *= 10;
B += b;
}
if(a<b) cout << A << endl;
else cout << B << endl;
}
| 0
| 99,468,054
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
long long gcd(long long a, long long b) {
if (a%b == 0) {
return(b);
}
else {
return(gcd(b, a%b));
}
}
long long lcm(long long a, long long b) {
long long tmp = max(a,b)/gcd(a,b);
return min(a,b)*tmp;
}
int main() {
int N;
cin >> N;
ll ans;
rep(i,N) {
ll t;
cin >> t;
if (i==0) {
ans = t;
}
else if (ans%t==0) {
continue;
}
else if (t%ans==0) {
ans = t;
}
else {
ans = lcm(ans,t);
}
}
cout << ans << endl;
}
|
#include <queue>
#include <iostream>
#include <algorithm>
#define ll long long
#define INF 100000000000000
using namespace std;
ll *par, *rk;
void init(ll n){
n++;
par = new ll[n];
rk = new ll[n];
for(ll i = 0; i < n; i++){
par[i] = i;
rk[i] = 0;
}
}
ll ufind(ll x){
if(par[x] == x)
return x;
return par[x] = ufind(par[x]);
}
void merge(ll x, ll y){
x = ufind(x);
y = ufind(y);
if(rk[x] < rk[y]){
par[x] = y;
}else if(rk[x] > rk[y]){
par[y] = x;
}else{
par[x] = y;
rk[y]++;
}
}
bool same(ll x, ll y){
return ufind(x) == ufind(y);
}
int main(){
ll n, q;
cin >> n >> q;
init(n);
for(ll i = 0; i < q; i++){
ll com, x, y;
cin >> com >> x >> y;
if(com == 0){
merge(x,y);
}else{
if(same(x,y))
cout << 1 << endl;
else
cout << 0 << endl;
}
}
}
| 0
| 99,278,611
|
#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> d(n);
rep(i,n) cin >> d[i];
int ans=0;
for(int i=0; i<n-1; i++){
for(int j=i+1; j<n; j++){
ans += d[i]*d[j];
}
}
cout << ans << endl;
}
|
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef stack<int> SI;
typedef queue<int> QI;
typedef pair<int,int> PII;
typedef long long LL;
#define d(x) cout<<#x<<" = "<<(x)<<endl;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EMP empty()
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define REACH(i,c) for(typeof((c).rbegin()) i=(c).rbegin(); i!=(c).rend(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c,n) sort(c,c+n)
#define VSORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define DFOR(i,b,a) for(int i=(b)-1;i>=(a);--i)
#define DREP(i,n) DFOR(i,n,0)
#define INF 1000000000
const double EPS = 1e-10;
const double PI = acos(-1.0);
class DisjointSet
{
public:
vector<int> rank,p;
DisjointSet(){}
DisjointSet(int size)
{
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++)makeSet(i);
}
void makeSet(int x)
{
p[x]=x;
rank[x]=0;
}
bool same(int x,int y)
{
return findSet(x)==findSet(y);
}
void unite(int x,int y)
{
link(findSet(x),findSet(y));
}
void link(int x,int y)
{
if(rank[x]>rank[y])
{
p[y]=x;
}
else
{
p[x]=y;
if(rank[x]==rank[y])
{
rank[y]++;
}
}
}
int findSet(int x)
{
if(x!=p[x])
{
p[x]=findSet(p[x]);
}
return p[x];
}
};
int main()
{
int n,a,b,q;
int t;
cin>>n>>q;
DisjointSet ds=DisjointSet(n);
for(int i=0;i<q;i++)
{
cin>>t>>a>>b;
if(t==0)ds.unite(a,b);
else if(t==1)
{
if(ds.same(a,b))cout<<1<<endl;
else cout<<0<<endl;
}
}
return 0;
}
| 0
| 13,017,807
|
#include<string>
#include<iostream>
int main(){
std::string str;
std::cin>>str;
if(str=="abc"||str=="acb"||str=="cab"||str=="bac"||str=="bca"||str=="cba")
std::cout<<"Yes"<<std::endl;
else std::cout<<"No"<<std::endl;
return 0;
}
|
#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);
int n,d,x;
cin>>n>>d>>x;
vector<int> a;
a.resize(n);
rep(i,n)cin>>a[i];
int ans=x;
d--;
rep(i,n){
ans+=1+(d/a[i]);
}
cout<<ans<<"\n";
}
| 0
| 39,479,194
|
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#include <random>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, m, n) for(int i = m; i < n; ++i)
#define rrep(i,n) for(int i = n; i >= 0; --i)
#define RREP(i, m, n) for(int i = n; i >= m; --i)
#define llrep(i, n) for(ll i = 0; i < n; ++i)
#define llREP(i, m, n) for(ll i = m; i < n; ++i)
#define llrrep(i,n) for(ll i = n; i >= 0; --i)
#define llRREP(i, m, n) for(ll i = n; i >= m; --i)
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
using pil = std::pair<int, long long>;
using pli = std::pair<long long, int>;
using plpii = std::pair<long long, std::pair<int, int>>;
using pdd = std::pair<double, double>;
using pis = std::pair<int, std::string>;
const long long INF = 1000000000000000001;
const long long _MOD_ = 1000000000000000009;
const long long _MOD = 1000000007;
const long long MOD = 998244353;
const int ALPHABET = 27;
const double pi = 3.14159265358979;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string l;
cin >> l;
ll* sum = new ll[l.length() + 1];
sum[0] = 1;
REP(i, 1, l.length() + 1) {
sum[i] = 2 * sum[i - 1] + sum[i - 1];
sum[i] %= _MOD;
}
ll ans = 0;
ll t = 1;
rep(i, l.length()) {
if (l[i] == '1') {
if(t != 1) ans += ((sum[l.length() - 1 - i] - 1) * t) % _MOD;
else ans += sum[l.length() - 1 - i];
ans %= _MOD;
ans += 2 * t;
ans %= _MOD;
t *= 2;
t %= _MOD;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define Rep(i,a,b) for(ll i = a; i <= b; ++i)
#define rep(i,b) Rep(i,0,b-1)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1 };
using namespace std;
int n, k;
namespace {
template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void Write(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Write(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T, typename U> void Write(const T& x, const U& y, const char* end = "\n") { std::cout << x << " " << y << end; }
template <typename T, typename U, typename V> void Write(const T& x, const U& y, const V& z, const char* end = "\n") { std::cout << x << " " << y << " " << z << end; }
template <typename T> void Write(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
template <typename T> void Write(const std::vector<std::vector<T>>& x, const char* sep = " ", const char* end = "\n") { for (auto v : x) Write(v, sep, end); }
struct Read {
std::size_t szi, szj;
Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
template <typename T> operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
}
template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
std::vector<std::pair<T, U>> a(szi);
for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
}
};
struct Read1 {
std::size_t szi, szj;
Read1(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { std::vector<T> a(szi + 1); for (std::size_t i = 1; i <= szi; ++i) std::cin >> a[i]; return a; }
template <typename T> operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 1; i <= szi; ++i) for (std::size_t j = 1; j <= szj; ++j) cin >> a[i][j]; return a;
}
template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
std::vector<std::pair<T, U>> a(szi);
for (std::size_t i = 1; i <= szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
}
};
struct Reads {
template <typename T> Reads(T& a) { std::cin >> a; }
template <typename T, typename U> Reads(T& a, U& b) { std::cin >> a >> b; }
template <typename T, typename U, typename V> Reads(T& a, U& b, V& c) { std::cin >> a >> b >> c; }
template <typename T, typename U, typename V, typename W> Reads(T& a, U& b, V& c, W& d) { std::cin >> a >> b >> c >> d; }
};
Read read;
}
signed main() {
Reads(n, k);
vector<int> p = Read1(n);
vector<int> c = Read1(n);
int ans = -2e18;
Rep (start, 1, n) {
int cycLen = 0;
int score = 0;
int cur = start;
while (true) {
cur = p[cur];
score += c[cur];
++cycLen;
if (cur == start) break;
}
int canWalk = cycLen + k % cycLen;
int sure = max(0LL, k / cycLen - 1);
if (sure >= 1) chmax(ans, sure * score);
int add = 0;
cur = start;
Rep(i, 1, canWalk) {
cur = p[cur];
add += c[cur];
if (i <= k)
chmax(ans, add);
if (sure * cycLen + i <= k)
chmax(ans, add + sure * score);
}
}
Write(ans);
}
| 0
| 8,524,570
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main()
{
ll n , gcd , x;
cin >> n;
for(ll i = 0 ; i < n ; i++)
{
cin >> x;
if(!i)
gcd = x;
gcd = __gcd ( x , gcd);
}
cout << gcd << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
long long ans;
cin >> ans;
n--;
while(n--) {
long long x;
cin >> x;
ans = ans / __gcd(x, ans) * x;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 21,186,757
|
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
int main(){
int a,b;
double x;
cin >> a >> b;
x = ceil((a+b) / (double)2.0);
cout << x << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using pll = pair<ll,ll> ;
void mysort(vector<pll> &a){sort(a.begin(),a.end()) ;}
void myrev(vll &a){reverse(a.begin(),a.end()) ;}
int main(){
ll n,k ;
cin >> n >> k ;
vector<pll> p(n) ;
for(int i=0;i<n;i++) cin >> p.at(i).first >> p.at(i).second ;
mysort(p) ;
ll ans = -1 ;
for(int i=0;i<n-k+1;i++){
for(int j=i+k-1;j<n;j++){
ll w = p.at(j).first - p.at(i).first ;
ll cnt = 0 ;
vll subp ;
ll sky = max(p.at(i).second,p.at(j).second) ;
ll grn = min(p.at(i).second,p.at(j).second) ;
for(int l=i;l<=j;l++){
if(grn<=p.at(l).second&&p.at(l).second<=sky) cnt++ ;
else subp.push_back(p.at(l).second) ;
}
sort(subp.begin(),subp.end()) ;
myrev(subp) ;
ll h ;
if(cnt>=k) h = sky-grn ;
else{
ll small = 30000000000 ;
for(int l=0;l<subp.size()-(k-cnt)+1;l++){
if(subp.at(l)<grn) small = min(small,sky-subp.at(l+(k-cnt)-1)) ;
else if(subp.at(l+(k-cnt)-1)>sky) small = min(small,subp.at(l)-grn) ;
else small = min(small,subp.at(l)-subp.at(l+(k-cnt)-1)) ;
}
h = small ;
}
if(ans==-1) ans = w*h ;
else ans = min(ans,w*h) ;
}
}
cout << ans << endl ;
}
| 0
| 11,851,539
|
#include <iostream>
#include <string>
using namespace std;
inline void reverse(char* dst, const char* rbegin, const char* rend) {
int i = 0;
for (const char* p = rbegin; p != rend; --p)
dst[i++] = *p;
dst[i] = '\0';
}
int main() {
string str;
int q;
cin >> str;
cin >> q;
string op;
int a;
int b;
string p;
char buf[1024];
for (int i = 0; i < q; ++i) {
cin >> op >> a >> b;
if (op == "replace")
cin >> p;
if (op == "print") {
for (size_t i = a; i <= b; ++i)
cout << str[i];
cout << endl;
} else if (op == "reverse") {
reverse(buf, str.data() + b, str.data() + a - 1);
str.replace(a, b - a + 1, buf);
} else if (op == "replace") {
str.replace(a, p.length(), p);
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Tree{
private:
struct Element{
int point;
int rank;
};
vector<Element> Content;
public:
Tree(int contentsnum);
int FindSet(int x);
void Link(int x, int y);
void Unite(int x ,int y);
bool Same(int x, int y);
};
Tree::Tree(int contentsnum){
Content.resize(contentsnum);
for (int c = 0; c < contentsnum;++c){
Content[c].rank = 0;
Content[c].point = c;
}
}
int Tree::FindSet(int x){
if (x != Content[x].point){
Content[x].point = FindSet(Content[x].point);
}
return Content[x].point;
}
void Tree::Link(int x, int y){
if (Content[x].rank < Content[y].rank){
Content[x].point = y;
} else{
Content[y].point = x;
if (Content[x].rank = Content[y].rank)
++Content[y].rank;
}
}
void Tree::Unite(int x, int y){
Link(FindSet(x), FindSet(y));
}
bool Tree::Same(int x, int y){
return FindSet(x) == FindSet(y);
}
int main(){
int contentnum;
cin >> contentnum;
Tree tree(contentnum);
int ordernum = 0;
cin >> ordernum;
int a = 0, b = 0;
for (int i = 0; i < ordernum; ++i){
cin >> a;
if (a == 0){
cin >> a; cin >> b;
tree.Unite(a, b);
} else{
cin >> a; cin >> b;
cout << (tree.Same(a, b) ? 1 : 0) << endl;
}
}
return 0;
}
| 0
| 95,326,379
|
#include <iostream>
#include <iomanip>
#include <math.h>
#include <fstream>
#include <string>
#include <time.h>
#include <ctime>
#include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <cstdlib>
using namespace std;
void trace(int A[],int N){
for(int i=0;i<N;i++){
if(i>0)cout << ' ';
cout << A[i];
}
cout << endl;
}
void selectionSort(int A[],int N){
int minj,count=0;
for(int i=0;i<N;i++){
minj = i;
for(int j=i;j<N;j++){
if(A[j]<A[minj]){
minj= j;
}
}
swap(A[i],A[minj]);
if(i!=minj)count++;
}
trace(A,N);
cout << count;
cout << endl;
}
int main(){
int N;
int A[100];
cin >> N;
for(int i=0;i<N;i++){
cin >> A[i];
}
selectionSort(A,N);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N, M, K;
cin >> N >> M >> K;
ll blackCnt = 0;
string ans;
ans = "No";
rep(ni, N + 1){
rep(mi, M + 1){
blackCnt = (ll)ni * M + mi * N - 2 * ni * mi;
if(blackCnt == K){
ans = "Yes";
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 36,909,254
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
#define rep(i, s, n) for(int i = s; i < n; i++)
int main() {
string s, t;
cin >> s >> t;
int dp[s.size()+1][t.size()+1];
rep(i, 0, s.size()+1) {
dp[i][0] = i;
}
rep(i, 0, t.size()+1) {
dp[0][i] = i;
}
rep(i, 1, s.size()+1) {
rep(j, 1, t.size()+1) {
int cost = 0;
if(s[i-1] == t[j-1]) cost = 0;
else cost = 1;
dp[i][j] = min(dp[i-1][j]+1, min(dp[i][j-1]+1, dp[i-1][j-1]+cost));
}
}
cout << dp[s.size()][t.size()] << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
#define MAX 10000100
LL pow(LL x, LL n){
LL ans = 1;
while(n>0){
if((n&1)==1){
ans = ans * x;
}
x = x * x;
n >>= 1;
}
return ans;
}
int main() {
LL n;
vector<LL> abc(3);
cin >> n >> abc[0] >> abc[1] >> abc[2];
vector<LL> l(n);
vector<LL> l_sum(3);
vector<LL> l_num(3);
LL num=pow(4, n);
LL min_ans=MAX;
LL ans=0;
for(LL i=0; i<n; i++){
cin >> l[i];
}
for(LL i=0; i<num; i++){
LL tmp=i;
LL num_minus=0;
LL num_plus=0;
LL idx;
for(LL j=0; j<3; j++){
l_sum[j]=0;
l_num[j]=0;
}
for(LL j=0; j<n; j++){
idx=tmp%4;
if(idx!=0){
l_sum[idx-1]+=l[j];
l_num[idx-1]++;
}
tmp = tmp >> 2;
}
if(l_num[0]==0 || l_num[1]==0 || l_num[2]==0){
continue;
}
for(LL j=0; j<3; j++){
if(abc[j]-l_sum[j]>0){
num_plus+=(abc[j]-l_sum[j]);
}else if(l_sum[j]-abc[j]>0){
num_minus+=(l_sum[j]-abc[j]);
}
}
ans=(l_num[0]+l_num[1]+l_num[2]-3)*10+num_plus+num_minus;
if(min_ans>ans){
min_ans=ans;
}
}
cout << min_ans << endl;
return 0;
}
| 0
| 63,616,213
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.