code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <cstdio>
using namespace std;
double cutup(double x) {
if (x - (double)((int)x / 1000) * 1000 > 0) {
x = (double)((((int)x / 1000) + 1) * 1000);
}
return x;
}
double money(double x, int target, int depth = 0) {
if (target == depth) { return x; }
return money(cutup(x * 1.05), target, depth + 1);
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int n, x;
cin >> n;
printf("%.0f\n", money(100000., n));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define RREP(i,n) for(int i=int(n)-1; i>=0; i--)
#define FOR(i,f,t) for(int i=int(f); i<=int(t); i++)
#define RFOR(i,f,t) for(int i=int(f); i>=int(t); i--)
#define ALL(vec) (vec).begin(),(vec).end()
#define ASORT(vec) sort(ALL(vec))
#define DSORT(vec) sort(ALL(vec), greater<int>());
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define YES(ans) if(ans) cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define Yes(ans) if(ans) cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define yes(ans) if(ans) cout<<"yes"<<endl; else cout<<"no"<<endl;
#define INF 1000000000000
#define NOD 1000000007
#define PI 3.141592653589793238462643
int main() {
ll n, m, s=0;
cin >> n >> m;
if(n >= m/2) {
cout << m/2 << endl;
} else {
s += n;
m -= 2*n;
s += m/4;
cout << s << endl;
}
}
| 0
| 77,534,922
|
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n, k, x, y;
cin >> n >> k >> x >> y;
int ans = 0;
if(n > k){
ans += x * k;
ans += (n-k)*y;
}else{
ans += x*n;
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i <= (n); ++i)
#define rep2(i, n) for(int i = 2; i < (n); ++i)
#define repr(i, n) for(int i = n; i >= 0; --i)
#define reprm(i, n) for(int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printLdb(a) printf("%.50Lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2LL)
#define pb push_back
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))
#define inf numeric_limits<double>::infinity();
#define linf numeric_limits<long double>::infinity()
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
constexpr long double eps = 1e-9;
const long double PI = acosl(-1.0L);
using namespace std;
void scans(string& str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')scanf("%c", &c);
while (c != '\n' && c != -1 && c != ' ') {
str += c;
scanf("%c", &c);
}
}
void scanc(char& str) {
char c;
scanf("%c", &c);
if (c == -1)return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) {
return PI / 2 - atan(x);
}
ll LSB(ll n) { return (n & (-n)); }
void WarshallFloyd(int n, vector<vector<ll>>& d) {
rep(i, n) {
rep(j, n) {
rep(k, n) {
d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
}
}
}
}
int main() {
int v, e;
scanf("%d%d", &v, &e);
vector<vector<ll>> g(v, vector<ll>(v));
rep(i, v)fill(all(g[i]), LINF / 2);
rep(i, v)g[i][i] = 0;
while (e--) {
int s, t, d;
scanf("%d%d%d", &s, &t, &d);
g[s][t] = d;
}
WarshallFloyd(v, g);
rep(i, v) {
if (g[i][i] < 0) {
puts("NEGATIVE CYCLE");
Please AC;
}
}
rep(i, v) {
rep(j, v) {
if (g[i][j] >= LINF / 4)printf("INF");
else printf("%lld", g[i][j]);
if (j != v - 1)printf(" ");
else puts("");
}
}
Please AC;
}
| 0
| 3,065,479
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename KeyType, typename ValueType>
std::pair<KeyType,ValueType> get_max( const std::map<KeyType,ValueType>& x ) {
using pairtype=std::pair<KeyType,ValueType>;
return *std::max_element(x.begin(), x.end(), [] (const pairtype & p1, const pairtype & p2) {
return p1.second < p2.second;
});
}
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
int main() {
double a, b, x;
cin >> a >> b >> x;
double s = x / a;
double ans = 0;
if (s > (a * b / 2)) {
double h = 2 * (a * b - s) / a;
ans = atan2(h, a) / acos(-1) * 180;
} else {
double hh = 2 * (x / (a * b));
ans = atan2(b, hh) / acos(-1) * 180;
}
cout << fixed << setprecision(15);
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<bits/stdtr1c++.h>
#include<vector>
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define zn(a,b,c) for(ll a=b;a<c;a++)
#define nz(a,b,c) for(ll a=b;a>c;a--)
using namespace std;
double nthRoot(int A, int N)
{
double xPre = rand() % 10;
double eps = 1e-3;
double delX = INT_MAX;
double xK;
while (delX > eps)
{
xK = ((N - 1.0) * xPre +
(double)A/pow(xPre, N-1)) / (double)N;
delX = abs(xK - xPre);
xPre = xK;
}
return xK;
}
void print(ll arr[],ll n){
zn(i,0,n){
cout<<arr[i]<<" ";
}
cout<<endl;
}
bool square(int n){
for(int i=1;i*i<=n;i++){
if((n%i==0) && (n/i==i)){
return true;
}
}
return false;
}
int main(){
long double n,x,t;
cin>>n>>x>>t;
ll c=ceil(n/x);
ll ans=c*t;
cout<<ans<<endl;
}
| 0
| 68,787,549
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;vector<int>A(26,100);
for(int i=0;i<N;i++){string S;cin>>S;vector<int>B(26);for(int j=0;j<S.size();j++)B[S.at(j)-'a']++;for(int j=0;j<26;j++)A[j]=min(A[j],B[j]);}
for(int i=0;i<26;i++)for(int j=0;j<A[i];j++)cout<<char(i+'a');
cout<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template<class T>
using reverse_priority_queue = priority_queue<T, vector<T>, greater<T>>;
int main(){
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n){ cin >> a.at(i); }
vector<ll> cs(n, 0), cs2(n, 0);
REP(i, n){
cs.at(i) = a.at(i);
cs2.at(i) = max(a.at(i), 0LL);
if(i > 0){
cs.at(i) += cs.at(i - 1);
cs2.at(i) += cs2.at(i - 1);
}
}
const auto rngsum = [](const vector<ll>& cs, ll l, ll r) -> ll {
if(l >= r || cs.size() == 0){ return 0; }
r = min((ll)cs.size(), r);
ll ret = cs.at(r - 1);
if(l > 0){
ret -= cs.at(l - 1);
}
return ret;
};
ll ans = numeric_limits<ll>::min();
REP(i, n - k + 1){
ll tmp = rngsum(cs2, 0, i) + rngsum(cs2, i + k, n);
ans = max(ans, tmp);
ans = max(ans, tmp + rngsum(cs, i, i + k));
}
cout << ans << endl;
return 0;
}
| 0
| 32,493,209
|
#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++)
typedef int64_t Int;
int main(){
string N;
int K, l;
cin >> N >> K;
l = N.size();
vector<int> n(l);
rep(i,l) n[i] = N.at(i) - '0';
vector<vector<Int>> dp0(l+1,vector<Int>(K+1, 0)), dp1(l+1,vector<Int>(K+1, 0));
dp0[1][1] = n[0] - 1;
dp1[1][1] = 1;
dp0[1][0] = 1;
rep1(i,l-1) rep(j,K+1) {
if (n[i] != 0) {
if (j > 0) dp0[i+1][j] = 9 * dp0[i][j-1] + dp0[i][j] + dp1[i][j-1] * (n[i] - 1) + dp1[i][j];
else dp0[i+1][j] = dp0[i][j] + dp1[i][j];
}
else {
if (j > 0) dp0[i+1][j] = 9 * dp0[i][j-1] + dp0[i][j];
else dp0[i+1][j] = dp0[i][j];
}
if (n[i] != 0) {
if (j > 0) dp1[i+1][j] = dp1[i][j-1];
}
else dp1[i+1][j] = dp1[i][j];
}
cout << dp0[l][K] + dp1[l][K] << endl;
}
|
#include<iostream>
using namespace std;
int main() {
int tate, yoko;
cin >> tate >> yoko;
while (tate != 0 || yoko != 0) {
for (int i = 0; i < yoko; i++)cout << "#";
cout << endl;
for (int i = 1; i < tate-1; i++) {
for (int j = 0; j < yoko; j++) {
if (j == 0||j==yoko-1)cout << "#";
else cout << '.';
}
cout << endl;
}
for (int i = 0; i < yoko; i++)cout << "#";
cout << endl;
cout << endl;
cin >> tate >> yoko;
}
return 0;
}
| 0
| 100,722,031
|
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORL(i,a,b) for(LL i=(a);i<(b);++i)
#define REPL(i,n) FORL(i,0,n)
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
const double EPS = 1e-10;
const double PI = acos(-1.0);
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k, const Iterator last)
{
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1)
{
if (*--itr1 < *itr2)
{
Iterator j = k;
while (!(*itr1 < *j)) ++j;
iter_swap(itr1,j);
++itr1;
++j;
itr2 = k;
rotate(itr1,j,last);
while (last != j)
{
++j;
++itr2;
}
rotate(k,itr2,last);
return true;
}
}
rotate(first,k,last);
return false;
}
inline double get_time_sec(void){
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count())/1000000000;
}
template<typename T>
T gcd(T a, T b) {
if(a > b) swap(a, b);
if(a == 0) return b;
else return gcd(b%a, a);
}
template<typename T>
map<T, T> prime_list(T n) {
map<T, T> ret;
for(T i = 2; i*i <= n; i++) {
if(n % i == 0) {
ret[i] = 0;
while(n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if(n != 1) ret[n]++;
return ret;
}
#define MOD 1000000007
LL mypow(LL a, LL n) {
if(n == 1) return a % MOD;
if(n % 2 == 1) return (a * mypow(a, n-1)) % MOD;
LL t = mypow(a, n/2);
return (t * t) % MOD;
}
int main(void) {
int n, m;
cin >> n >> m;
n -= m;
cout << (m * 1900 + n * 100) * pow(2, m) << endl;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
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; }
using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int>h(n);
rep(i,n)cin>>h[i];
const int INIT=300;
int min_val=INIT;
int ans=0;
int l;
do{
l=0;
rep(r,n+1){
if(r==n || h[r]==0){
reps(j,r,l){
h[j]-=min_val;
}
if(min_val!=INIT)ans+=min_val;
l=r+1;
min_val=INIT;
}
else{
min_val=min(min_val,h[r]);
}
}
}while(accumulate(h.begin(),h.end(),0));
cout<<ans<<endl;
return 0;
}
| 0
| 60,384,581
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
int cnt=0;
int len=S.size();
bool AC=true;
if(S[0]!='A'){
AC=false;
}
for(int i=2;i<len-1;i++){
if(S[i]=='C'){
cnt++;
}
}
if(cnt!=1){
AC=false;
}
rep(i,len-1){
if(S[i+1]<'a'&&S[i+1]!='C'){
AC=false;
break;
}
}
if(AC==true){
cout<<"AC"<<endl;
}
else{
cout<<"WA"<<endl;
}
}
|
#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() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
;
ll ans = 0;
rep(i, n) {
if(b[i] > a[i]) {
b[i] -= a[i];
ans += a[i];
if(b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
}
| 0
| 17,437,580
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
vector<pair<ll,ll>> a;
for(int i=0;i<n;i++){
ll b;
cin >>b;
a.push_back(make_pair(b,i+1));
}
sort(a.begin(),a.end());
for(int i=1;i<n+1;i++){
if(a[n-1].second==i)cout << a[n-2].first << endl;
else cout << a[n-1].first << endl;
}
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <limits>
#include <fstream>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
struct WarshallFloyd {
vector<int> a,b,c;
int V,E;
int INF;
vector<vector<int> > dist;
WarshallFloyd(int V, int E):V(V),E(E){
INF = 2e9;
a.resize(E,INF);
b.resize(E,INF);
c.resize(E,INF);
dist.resize(V, vector<int>(V, INF));
}
void calc(){
for(int i=0;i<V;i++){
dist[i][i]=0;
}
for(int i=0;i<E;i++){
dist[a[i]][b[i]] = min(dist[a[i]][b[i]], c[i]);
}
for(int k=0;k<V;k++){
for(int i=0;i<V;i++){
for(int j=0;j<V;j++){
if(dist[i][k]==INF||dist[k][j]==INF) continue;
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
}
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int V,E;
cin>>V>>E;
WarshallFloyd WF(V, E);
FOR(i,0,E){
cin>>WF.a[i]>>WF.b[i]>>WF.c[i];
}
WF.calc();
FOR(i,0,V){
if(WF.dist[i][i]<0){
cout<<"NEGATIVE CYCLE"<<endl;
return 0;
}
}
FOR(i,0,V) {
FOR(j,0,V) {
if(j) cout<<" ";
if(WF.dist[i][j]==2e9) cout<<"INF";
else cout<<WF.dist[i][j];
}
cout<<endl;
}
}
| 0
| 21,420,534
|
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ll long long
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define VAR(v, i) __typeof( i) v=(i)
#define forit(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
using namespace std;
const int maxn = (int)1e5 + 100;
const int mod = (int)1e9 + 7;
#define inf mod
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> Vll;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;
string s;
bool was[maxn];
void solve(){
cin >> s;
if(sz(s) == 26){
string nxt = s;
if(!next_permutation(all(nxt))){
cout << -1;
return;
}
forn(i, 0, sz(nxt) - 1){
if(nxt[i] > s[i]){
forn(j, 0, i) cout << nxt[j];
return;
}
}
cout << -1;
}else{
for(auto x : s) was[x - 'a'] = 1;
cout << s;
forn(i, 0, 25)
if(!was[i]){
putchar(i + 'a');
return;
}
}
}
int main () {
solve();
}
|
#include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
ll tmp = 0;
ll ans = 1e9;
rep(i,n){
cin >> a[i];
}
sort(ALL(a));
for(int i = -100;i<=100;i++){
tmp = 0;
rep(j,n){
tmp += (a[j]-i)*(a[j]-i);
}
ans = min(tmp,ans);
}
cout << ans << endl;
}
| 0
| 37,085,174
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(i==4){
cout<<" "<<flush;
}
cout<<s[i]<<flush;
}
cout<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define ANS cout << ans << endl
#define RETURN(x) \
cout << x << endl; \
return 0
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
init();
ll W, H, N;
cin >> W >> H >> N;
ll a1 = 0;
ll a2 = W;
ll a3 = 0;
ll a4 = H;
rep(i, N) {
ll x, y, a;
cin >> x >> y >> a;
if (a == 1) a1 = max(a1, x);
if (a == 2) a2 = min(a2, x);
if (a == 3) a3 = max(a3, y);
if (a == 4) a4 = min(a4, y);
}
W = W - a1 - (W - a2);
H = H - a3 - (H - a4);
if (0 < H && 0 < W) {
COUT(H * W);
} else {
COUT(0);
}
return 0;
}
| 0
| 21,778,103
|
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main()
{
int k,a,b,sum;
cin>>k>>a>>b;
sum = (b / k)* k;
if(a <= sum){
cout<<"OK";
}
else{
cout<<"NG";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<<#x<<" = "<<(x)<<"\n"
#define endl "\n"
using G = vector<vector<int>>;
using P = pair<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int,vector<int>,greater<int>>;
using V = vector<int>;
using ll = long long;
using edge = struct { int to; int cost; };
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int N,M,R;
vector<int> r(8);
vector<int> a(40000),b(40000),c(40000);
vector<vector<P>> g(40000);
int dp[200][200];
int ans = INF;
void warshall_floyd() {
REP(i,N) REP(j,N) {
dp[i][j] = j==i ? 0 : INF;
}
REP(i,M) {
dp[a[i]][b[i]] = c[i];
dp[b[i]][a[i]] = c[i];
}
REP(k,N) {
REP(i,N) {
REP(j,N) {
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
}
void dfs(vector<int> v) {
if (v.size() == R) {
int sum = 0;
REP(i,R-1) {
int from = r[v[i]], to = r[v[i+1]];
sum += dp[from][to];
}
chmin(ans,sum);
return;
}
REP(i,R) {
if (find(ALL(v), i) != v.end()) continue;
vector<int> nv = v;
nv.push_back(i);
dfs(nv);
}
return;
}
int main() {
IOS;
cin >> N >> M >> R;
REP(i,R) {
cin >> r[i];
r[i]--;
}
REP(i,M) {
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--;
}
warshall_floyd();
dfs(vector<int>());
COUT(ans);
return 0;
}
| 0
| 70,743,403
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int N; cin >> N;
vector<int> C(N, 0), S(N, 0), F(N, 0);
REP(i, N - 1) cin >> C[i] >> S[i] >> F[i];
REP(i, N - 1) {
int res = S[i] + C[i];
for (int j = i + 1; j < N - 1; j++) {
if (res < S[j])
res = S[j];
else if (res % F[j])
res += F[j] - (res % F[j]);
res += C[j];
}
cout << res << '\n';
}
cout << 0 << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll)x.size()
#define f first
#define s second
#define MAXN 2510
int OFF;
int ans[MAXN][MAXN];
int N,M,D,p;
queue<pair<pi, int>> Q;
vector<pair<pi,int>> V;
char mk[5] = {'A', 'R','Y','G','B'};
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>N>>M>>D;
if (D%2 == 1){
p = (D+1)/2;
Q.push(mp(mp(p+D,1+D), 1));
Q.push(mp(mp(1+D,p+1+D), 2));
Q.push(mp(mp(p+1+D,D+1+D), 3));
Q.push(mp(mp(D+1+D,p+D), 4));
int dx[] = {D+1,-D+1,-(D+1),-(-D+1)};
int dy[] = {D-1,D+1,-(D-1), -(D+1)};
while (SZ(Q)){
pi cur = Q.front().f;
int in = Q.front().s;
ans[cur.f][cur.s] = in;
V.pb(Q.front());
Q.pop();
for (int i=0;i<4;++i){
int cx = cur.f + dx[i];
int cy = cur.s + dy[i];
if (cx <= 0 || cy <= 0 || cx > N+2*D || cy > M+2*D)continue;
if (ans[cx][cy])continue;
ans[cx][cy] = in;
Q.push(mp(mp(cx,cy), in));
}
}
for (auto i : V){
pi t = i.f;
int in = i.s;
for (int j=1-p;j<=p-1;++j){
for (int k=1-p+abs(j); k<= p-1-abs(j);++k){
int cx = t.f + j;
int cy = t.s + k;
if (cx <= D || cy <= D || cx > N+D || cy > M+D)continue;
ans[cx][cy] = in;
}
}
}
for (int i=1;i<=N;++i){
for (int j=1;j<=M;++j)cout<<mk[ans[i+D][j+D]];
cout<<'\n';
}
}else {
p = D/2;
Q.push(mp(mp(D,D), 1));
Q.push(mp(mp(D+p,D-p), 2));
Q.push(mp(mp(D+p,D+p), 3));
Q.push(mp(mp(D,2*D), 4));
int dx[] = {0,0,D, -D};
int dy[] = {2*D,-2*D,-D, D};
while (SZ(Q)){
pi cur = Q.front().f;
int in = Q.front().s;
ans[cur.f][cur.s] = in;
V.pb(Q.front());
Q.pop();
for (int i=0;i<4;++i){
int cx = cur.f + dx[i];
int cy = cur.s + dy[i];
if (cx < 0 || cy < 0 || cx >= N+2*D || cy >= M+2*D)continue;
if (ans[cx][cy])continue;
ans[cx][cy] = in;
Q.push(mp(mp(cx,cy), in));
}
}
for (auto i : V){
pi t = i.f;
int in = i.s;
for (int j=1-p;j<=p-1;++j){
for (int k=1-p+abs(j); k<= p-abs(j);++k){
int cx = t.f + j;
int cy = t.s + k;
if (cx < D || cy < D || cx >= N+D || cy >= M+D)continue;
ans[cx][cy] = in;
}
}
}
for (int i=0;i<N;++i){
for (int j=0;j<M;++j)cout<<mk[ans[i+D][j+D]];
cout<<'\n';
}
}
}
| 0
| 57,993,362
|
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <fstream>
#include <unordered_map>
#define MAX_INT ((1 << 31) - 1);
using namespace std;
ifstream fin("../data.txt");
int n, x, sum, ans, diff;
vector<int> v;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ans = MAX_INT;
for (int i = -100; i <= 100; i++) {
sum = 0;
for (int j = 0; j < n; j++) {
diff = v[j] - i;
sum += diff*diff;
}
if (sum < ans) ans = sum;
}
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
int N,mem;
int A[100010];
int sum[100010] = {0};
int side = 0;
ll D[100010],R[100010];
ll power(ll a,ll b)
{
if(b == 0)return 1;
ll res = power(a * a % mod,b / 2);
if(b & 1)res = res * a % mod;
return res;
}
ll con(int a,int b)
{
if(a < b)return 0;
return (D[a] * R[b] % mod) * R[a - b] % mod;
}
int main()
{
scanf("%d",&N);
for(int i = 0; i < N + 1; i++){scanf("%d",&A[i]);sum[A[i]]++;}
for(int i = 0; i < N + 1; i++)if(sum[i] == 2)mem = i;
for(int i = 0; i < N + 1; i++)if(A[i] == mem){side += i;break;}
for(int i = N; i >= 0; i--)if(A[i] == mem){side += N - i;break;}
ll now = 1;
for(int i = 0; i < N + 2; i++){D[i] = now;now *= i + 1;now %= mod;}
for(int i = 0; i < N + 2; i++){R[i] = power(D[i],mod - 2);}
for(int i = 1; i < N + 2; i++)
{
if(i == 1)printf("%d\n",N);
else
{
printf("%lld\n",(con(N + 1,i) - con(side,i - 1) + mod) % mod);
}
}
return 0;
}
| 0
| 37,192,763
|
#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 main(){
int N, Y; cin >> N >> Y;
Y /= 1000;
for (int i = 0; i <= N; i++){
for (int j = 0; i + j <= N; j++){
int now = 10 * i + 5 * j + (N - i - j);
if (now == Y){
printf("%d %d %d\n", i, j, N - i - j);
return 0;
}
}
}
printf("-1 -1 -1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N,X;cin>>N>>X;
vector<int>x(N+1);
x[0]=X;
for(int i=1;i<=N;i++){
cin>>x[i];
}
sort(x.begin(),x.end());
int A[N];
for(int i=0;i<N;i++){
A[i]=x[i+1]-x[i];
}
long long ans=x[1]-x[0];
for(int i=1;i<N;i++){
ans=gcd(ans,A[i]);
}
cout<<ans<<endl;
return 0;
}
| 0
| 39,533,644
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m, k;
bool a = false;
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
int sum = 0;
for(int j = 1; j <= m; j++){
sum = (n - i) * j + (m - j)* i;
if(sum == k)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << (k == n * m ? "Yes":"No") << endl;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll DIV = 1000000007;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
long N, M;
cin >> N >> M;
std::vector<std::vector<long>> mat(N, vector<long>());
long a, b;
for(size_t i=0;i<M; i++)
{
cin >> a >> b;
a--;b--;
mat[a].push_back(b);
mat[b].push_back(a);
}
bool ok=false;
for(size_t i=0;i<mat[N-1].size(); i++)
{
long next_point = mat[N-1][i];
cerr << next_point << endl;
for(size_t j=0;j<mat[next_point].size(); j++)
{
long last_point = mat[next_point][j];
cerr << last_point << endl;
if(mat[next_point][j]==0) ok =true;
}
}
if(ok) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count() / 1000.0) << "[ms]" << endl;
#endif
return 0;
}
| 0
| 31,176,698
|
#include <cstdio>
using namespace std;
int n;
int y, m, d;
int main() {
scanf("%d", &n);
for (int i=0; i<n; i++) {
scanf("%d%d%d", &y, &m, &d);
int cnt = 0;
while (!(y == 1000 && m == 1 && d == 1)) {
int days = 19;
if (y%3 == 0 || m%2 == 1) days = 20;
cnt += days-d+1;
d = 1;
m++;
if (m == 11) {
m = 1;
y++;
}
}
printf("%d\n", cnt);
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1e9;
int main() {
int N; cin >> N;
vector<int> t(N + 1), v(N + 2);
for (int i = 1; i <= N; i++) {cin >> t[i]; t[i] *= 2;}
for (int i = 1; i <= N; i++) {cin >> v[i]; v[i] *= 2;}
vector<int> l(N + 2), r(N + 2);
l[0] = r[0] = 0; v[0] = 0;
for (int i = 1; i <= N; i++) {
l[i] = r[i - 1];
r[i] = l[i] + t[i];
}
l[N + 1] = r[N + 1] = r[N]; v[N + 1] = 0;
int T = r[N + 1];
vector<int> min_v(T + 1, INF);
for (int i = 0; i <= N + 1; i++) {
for (int j = 0; j <= T; j++) {
if (j < l[i]) min_v[j] = min(min_v[j], v[i] + l[i] - j);
else if (r[i] < j) min_v[j]= min(min_v[j], v[i] + j - r[i]);
else min_v[j] = min(min_v[j], v[i]);
}
}
double ans = 0;
for (int i = 1; i <= T; i++) {
ans += ((double)min_v[i - 1] + (double)min_v[i])/2.0;
}
cout << fixed << ans/4.0 << endl;
return 0;
}
| 0
| 86,815,871
|
#include<stdio.h>
using namespace std;
int main(){
while(true){
int m,f,r;
scanf("%d%d%d",&m,&f,&r);
if(m==-1&&f==-1&&r==-1)break;
if(m==-1 || f==-1)printf("F\n");
else if(m+f>=80)printf("A\n");
else if(m+f>=65&&m+f<80)printf("B\n");
else if(m+f>=50&&m+f<65)printf("C\n");
else if(m+f>=30&&m+f<50){
if(r>=50)printf("C\n");
else printf("D\n");
}
else if(m+f<30)printf("F\n");
}
}
|
#include <iostream>
#include <string>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <list>
#include <iomanip>
#include <vector>
#include <functional>
#include <algorithm>
#include <cstdio>
#include <random>
#include <ctime>
#include <cstdlib>
#include <unordered_map>
#include <string.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pint;
typedef pair<ll, ll> Pll;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
int H, W;
cin >> H >> W;
vector<vector<char>> C(H, vector<char>(W));
rep(0, i, H)
{
rep(0, j, W)
{
cin >> C.at(i).at(j);
}
}
rep(0, i, 2 * H)
{
rep(0, j, W)
{
cout << C.at(i / 2).at(j);
}
cout << endl;
}
}
| 0
| 18,400,295
|
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
double ans;
int n;
signed main(){
ios_base::sync_with_stdio(0);
cin>>n;
while(n--){
double x;
string s;
cin>>x>>s;
if(s=="BTC") x*=380000;
ans+=x;
}
cout<<ans;
re 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n, m, p;
int num[101];
while (cin >> n >> m >> p, n|m|p) {
int total = 0;
for (int i = 1; i <= n; i++) {
cin >> num[i];
total += num[i] * (100-p);
}
if (!num[m]) {
cout << 0 << endl;
continue;
}
cout << (total / num[m]) << endl;
}
return 0;
}
| 0
| 95,582,746
|
#include<bits/stdc++.h>
using namespace std;
int main(){
char s;
cin>>s;
if(isupper(s)) cout<<'A'<<endl;
else cout<<'a'<<endl;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF LLONG_MAX
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;
#define ARRAY_MAX 5005
int main(){
ll n;
while(cin >> n,n){
vector<ll> arr(ARRAY_MAX,0);
REP(i,n){
cin >> arr[i+1];
}
arr[0] = 0;
REP(i,n){
arr[i+1] += arr[i];
}
ll maxi = -INF;
for(int i = n;i >= 0;i--){
for(int j = 0;j < i;j++){
maxi = max(maxi,arr[i]-arr[j]);
}
}
cout << maxi << endl;
}
return 0;
}
| 0
| 79,583,839
|
#include<stdio.h>
int main()
{
long long int n;
while(scanf("%lld",&n)==1)
{
long long int sum=1;
for(long long int i=n;i>0;i--)
sum*=i;
printf("%lld\n",sum);
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <tuple>
#include <functional>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
using namespace std;
typedef long long int lli;
typedef tuple<int, int, int> tp;
template<typename T>
vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
class UnionFind {
public:
vector<int> par;
int cnt;
UnionFind(int n) {
par.resize(n);
REP(i, 0, n) {
par[i] = i;
}
cnt = n;
}
int Find(int n) {
return (n == par[n] ? n : par[n] = Find(par[n]));
}
bool Union(int a, int b) {
a = Find(a);
b = Find(b);
if (a == b) return false;
par[a] = b;
cnt--;
return true;
}
int getCnt() {
return cnt;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H;
cin >> W >> H;
priority_queue<tp, vector<tp>, greater<tp>> pq;
UnionFind uf[2] = {UnionFind(W + 1), UnionFind(H + 1)};
REP(i, 0, W) {
int p;
cin >> p;
pq.emplace(p, i, 0);
}
REP(i, 0, H) {
int q;
cin >> q;
pq.emplace(q, i, 1);
}
lli ans = 0;
while (pq.size()) {
int ind, t;
lli c;
tie(c, ind, t) = pq.top();
pq.pop();
ans += (uf[!t].getCnt()) * c;
uf[t].Union(ind, ind + 1);
}
cout << ans << endl;
return 0;
}
| 0
| 39,823,518
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int a[105];
int main() {
int n;
cin >> n;
for (int i = 1; i < n + 1; i++) {
int u = i;
for (int j = 2; j < n + 1; j++) {
while (u % j == 0) {
u /= j;
a[j]++;
}
}
}
int cou2 = 0;
int cou4 = 0;
for (int i = 0; i < n + 1; i++) {
if (a[i]<4&&a[i] >= 2)cou2++;
if (a[i] >= 4)cou4++;
}
int ans = cou2 * cou4 * (cou4 - 1) / 2 + cou4 * (cou4 - 1) * (cou4 - 2)/2 ;
int cou14 = 0;
cou4 = 0;
for (int i = 0; i < n + 1; i++) {
if (a[i] < 14 && a[i] >= 4)cou4++;
if (a[i] >= 14)cou14++;
}
ans += cou14 * cou4+cou14*(cou14-1);
int cou24 = 0;
cou2 = 0;
for (int i = 0; i < n + 1; i++) {
if (a[i] < 24 && a[i] >= 2)cou2++;
if (a[i] >= 24)cou24++;
}
ans += cou24 * cou2 + cou24 * (cou24 - 1);
int cou = 0;
for (int i = 0; i < n + 1; i++) {
if (a[i] >=74)cou++;
}
ans += cou;
cout << ans;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
ll n, m;
cin >> n >> m;
if (n == 1 && m == 1) {
put(1);
return 0;
}
if (n == 1) {
put(max(0LL, m - 2));
return 0;
}
if (m == 1) {
put(max(0LL, n - 2));
return 0;
}
put((m - 2) * (n - 2));
return 0;
}
| 0
| 45,615,019
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
vector<ll> A(n); rep(i, n) cin >> A[i];
vector<vector<bool>> dpl(n+1, vector<bool>(k+1)), dpr(n+1, vector<bool>(k+1));
dpl[0][0] = true;
dpr[n][0] = true;
rep(i, n) {
rep(j, k+1) {
dpl[i+1][j] = dpl[i][j] || dpl[i+1][j];
dpl[i+1][min(j+A[i], (ll)k)] = dpl[i][j] || dpl[i+1][min(j+A[i], (ll)k)];
}
}
rrep(i, n) {
rep(j, k+1) {
dpr[i][j] = dpr[i+1][j] || dpr[i][j];
dpr[i][min(j+A[i], (ll)k)] = dpr[i+1][j] || dpr[i][min(j+A[i], (ll)k)];
}
}
int ans = n;
rep(i, n) {
bool ok = false;
if(A[i] >= k) {
ans--;
continue;
}
vector<int> sum(k+2);
rep(j, k+1) sum[j+1] = sum[j] + dpr[i+1][j];
rep(j, k) {
if(dpl[i][j] && sum[k-j]-sum[max(k-A[i]-j, 0LL)]) ok = true;
}
if(ok) ans--;
}
cout << ans << endk;
return 0;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define sl(a) a.size()
#define mod 1000000007
#define lcm(a,b) (a*b)/__gcd(a,b)
#define MAX1 100006
#define f first
#define s second
#define pi 2*acos(0.0)
void solve()
{
ll x,y,a,b; cin>>x>>y>>a>>b;
ll lc=(a*b)/(__gcd(a,b));
cout<<(y-x+1)-((y/a)-((x-1)/a))-((y/b)-((x-1)/b))+((y/lc)-((x-1)/lc));
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt","w",stdout);
#endif
BOOST
int T=1;
while(T--) solve();
cerr<<"Time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<"\n";
cerr<<"My CLOCKS_PER_SEC= "<<CLOCKS_PER_SEC<<"\n";
return 0;
}
| 0
| 52,341,051
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
bool b=0;
int x[n];
for(int i=0;i<n;i++) cin>>x[i];
sort(x,x+n);
for(int i=0;i<n;i++)
if(x[i]==x[i+1]){
b=1;
break;
}
if(b==0)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
|
#include<iostream>
#define LL long long
LL K;
LL A[50];
int main(){
std::cin>>K;
std::cout<<50<<std::endl;
for(int i=0;i<50;i++){
A[i]=49+(K/50);
}
for(int i=0;i<K%50;i++){
A[i]+=50;
A[i]-=K%50-1;
}
for(int i=K%50;i<50;i++){
A[i]-=K%50;
}
for(int i=0;i<50;i++){
std::cout<<A[i];
if(i<49)std::cout<<" ";
else std::cout<<std::endl;
}
return 0;
}
| 0
| 71,627,668
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string o, e;
cin >> o >> e;
string ans = "";
for (int i = 0, j = 0; i < o.size() || j < e.size();)
{
if (i < o.size())
{
ans += o[i];
i++;
}
if (j < e.size())
{
ans += e[j];
j++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 200005;
const int MAXS = (1 << 26) + 5;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
AKNOI = flag * x;
}
char s[MAXN];
int n, dp[MAXS];
void solve() {
scanf("%s", s + 1);
n = strlen(s + 1);
mset(dp, 0x3f);
int S = dp[0] = 0;
for (int i = 1; i <= n; ++i) {
S ^= (1 << (s[i] - 'a'));
dp[S] = dp[S] + 1;
for (int j = 0; j < 26; ++j) {
dp[S] = min(dp[S], dp[S ^ (1 << j)] + 1);
}
if (i < n) dp[0] = 0;
}
printf("%d\n", dp[S]);
}
int main() {
solve();
return 0;
}
| 0
| 74,418,653
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <numeric>
typedef long long ll;
#define PI 3.14159265359
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mp make_pair
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define decp(n) cout<<fixed<<setprecision((int)n)
#define _GLIBCXX_DEBAC
#include <functional>
using namespace std;
ll gcd(ll a, ll b) {
ll c;
if (a < b) {
c = a; a = b; b = c;
}
while (b != 0) {
c = a % b; a = b; b = c;
}
return a;
}
ll lcm(ll a, ll b) {
ll c;
c = a * b / gcd(a, b);
return c;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z()
{
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i]; a[i] = a[minj]; a[minj] = t;
if (i != minj) sw += 1;
}
return sw;
}
bool is_prime(int x) {
if (x <= 1) return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) return false;
}
return true;
}
const ll mod = 1000000007;
map<string, int> memo;
using P=pair<int, int>;
ll findIndex(int value, vector<ll> a)
{
for (ll i = 0; i < a.size(); i++) {
if (a[i] == value) {
return i;
}
}
return -1;
}
ll nCr(ll n, ll r) {
ll a = 1;
for (ll i = n; i > n - r; --i) {
a = a * i;
}
for (ll i = 1; i < r + 1; ++i) {
a = a / i;
}
return a;
}
void comb(vector<vector <long long int> >& v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (ll j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
int n, m,X,Y;
cin >> n >> m>>X>>Y;
vector<int> x(n), y(m);
rep(i, n)cin >> x[i];
rep(i, m)cin >> y[i];
sort(rall(x)); sort(all(y));
x[0]++;
if (x[0] <= y[0]&&X<x[0]&&x[0]<=Y)cout << "No War";
else cout << "War";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % 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; }
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int k;
cin >> k;
vector<ll> A(k);
rep(i, k) cin >> A[i];
reverse(A.begin(), A.end());
ll min_val = 2;
ll max_val = 2;
rep(i, k){
ll a = A[i];
min_val = (min_val + a - 1) / a * a;
max_val = max_val / a * a;
if(max_val < min_val){
cout << -1 << endl;
return 0;
}
max_val = max_val + a-1;
}
cout << min_val << " " << max_val << endl;
return 0;
}
| 0
| 69,012,771
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)n;i++)
const int INF = (1LL<<31)-1;
int main(){
ll K; cin >> K;
vector<vector<P> > G(K);
for(int i=0;i<K-1;i++){
G[i].push_back({10*i%K,0});
G[i].push_back({(i+1),1});
}
G[K-1].push_back({10*(K-1)%K,0});
G[K-1].push_back({0,1});
vector<int> dist(K,INF);
deque<P> que; que.push_back({1,1});
while(!que.empty()){
P cur = que.front();
que.pop_front();
int v = cur.first;
int cost = cur.second;
if(dist[v]!=INF) continue;
dist[v] = cost;
for(auto nxt : G[v]){
int nv = nxt.first;
int c = nxt.second;
if(dist[nv]==INF){
if(c){
que.push_back({nv,cost+1});
}else{
que.push_front({nv,cost});
}
}
}
}
cout << dist[0] << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define FOR(i,a,b) for(ll i = (a); i < (ll)(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(ll i = (ll)(b)-1;i >= a;--i)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define eb(val) emplace_back(val)
const double PI = acos(-1);
const double EPS = 1e-10;
const ll MOD = 1e9+7;
void cioacc(){
cin.tie(0);
ios::sync_with_stdio(false);
}
signed main(){
string s;
cin >> s;
int n;
cin >> n;
REP(i,n){
string q;
int a,b;
cin >> q >> a >> b;
if(q=="print"){
cout << s.substr(a,b-a+1) << endl;
}else if(q=="reverse"){
auto sub = s.substr(a,b-a+1);
reverse(ALL(sub));
s.replace(a,b-a+1,sub);
}else{
string p;
cin >> p;
s.replace(a,b-a+1,p);
}
}
}
| 0
| 31,103,963
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
for (int k = 0; k < 10; k++)
for (int l = 0; l < 10; l++)
if (i + j + k + l == n)
ans++;
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main() {
int H,W,ans=0; cin>>H>>W;
vector<vector<char>> S(H,vector<char>(W));
queue<pair<int,int>> Q;
vector<vector<bool>> seen(H,vector<bool>(W,false));
rep(i,H){
rep(j,W){
cin>>S.at(i).at(j);
if(S.at(i).at(j)=='#'){
Q.push(make_pair(i,j));
seen[i][j]=true;
}
}
}
Q.push(make_pair(-1,-1));
while(!Q.empty()){
int x=Q.front().first,y=Q.front().second;
Q.pop();
if(x==-1&&y==-1){
if(Q.empty())continue;
ans++;
Q.push(make_pair(-1,-1));
continue;
}
rep(j,4){
int nx=x+dx[j],ny=y+dy[j];
if(nx<0 || nx>= H || ny<0 || ny>=W) continue;
if(seen[nx][ny]==false){
Q.push(make_pair(nx,ny));
seen[nx][ny]=true;
}
}
}
cout<<ans;
}
| 0
| 398,190
|
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int MOD = 1000000000 + 7;
struct UnionFind {
vector<int> parent;
UnionFind(int N) : parent(N) {
for (int i = 0; i < N; i++) {
parent[i] = -1;
}
}
int root(int i) {
if (parent[i] < 0) {
return i;
}
return (parent[i] = root(parent[i]));
}
bool unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx != ry) {
parent[ry] += parent[rx];
parent[rx] = ry;
return true;
}
else {
return false;
}
}
bool same(int x, int y) {
return root(x) == root(y);
}
int treeSize(int x) {
return -parent[root(x)];
}
};
long long int modpow(long long int base, long long int pow, long long int mod) {
if (pow == 1) {
return base;
}
else if (pow == 0) {
return 1;
}
if (pow % 2 == 0) {
auto temp = modpow(base, pow / 2, mod);
return (temp * temp) % mod;
}
else {
return base * modpow(base, pow - 1, mod) % mod;
}
}
long long int moddiv(long long int X, long long int Y, long long int mod) {
auto fermatDiv = modpow(Y, mod - 2, mod);
return (X * fermatDiv) % mod;
}
long long modCombination(long long left, long long right, long long int mod) {
long long answer = 1;
for (long long i = 0; i < right; i++) {
answer = (answer * (left - i)) % mod;
answer = moddiv(answer, (i + 1), mod);
}
return answer;
}
bool IsPrime(long long N) {
if (N == 1) {
return false;
}
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) {
return false;
}
}
return true;
}
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({ a, ex });
}
if (N != 1) res.push_back({ N, 1 });
return res;
}
long long euclid(long long a, long long b) {
if (a > b) {
long long temp = b;
b = a;
a = temp;
}
if (b % a == 0) {
return a;
}
else {
return euclid(a, b - a);
}
}
int main() {
long long N;
cin >> N;
cout << N * (N + 1) / 2 - N << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(int)n;i++)
typedef long long ll;
using namespace std;
long long modpow(long long a, long long n,ll mod){
long long r = 1;
while (n) {
r = r * ( (n%2)?a:1 ) %mod;
a = a * a % mod;
n >>= 1;
}
return r;
}
int main(void){
ll n,mod;cin>>n>>mod;
string s;cin>>s;
reverse(s.begin(),s.end());
ll res=0,now=0;
if(mod==2||mod==5){
reverse(s.begin(),s.end());
rep(i,n){
ll d=s[i]-'0';
if(d%mod==0)res+=(i+1);
}
cout<<res<<endl;
return 0;
}
map<ll,ll> mp;
rep(i,n){
ll t=modpow(10,i,mod);
ll d=s[i]-'0';
d*=t;
d+=now;
d%=mod;
mp[d]++;
now=d;
}
for(auto& p:mp){
ll x=p.first,y=p.second;
if(x==0){
res+=(y+1)*y/2;
}else{
y--;
res+=(y+1)*y/2;
}
}
cout<<res<<endl;
}
| 0
| 67,316,112
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, Bl, Br;
char dot;
cin >> A;
cin >> Bl >> dot >> Br;
int64_t result;
result = A * (Bl * 100 + Br);
result /= 100;
cout << result << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,h;
cin >> n >> h;
int a[n],b[n];
for(int i=0;i<n;i++)cin >> a[i] >> b[i];
sort(a,a+n);
sort(b,b+n);
int ans=0;
for(int i=n-1;i>=0;i--){
h -= b[i];
ans++;
if(h<=0)break;
if(a[n-1]>b[i-1])break;
}
if(h<=0){
cout << ans;
return 0;
}
cout << ans + (h+a[n-1]-1)/a[n-1];
}
| 0
| 43,288,495
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,i,j;cin>>n;int a[n];
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n;i++) a[i]-=(i+1);
sort(a,a+n);
ll s=0;
for(i=0;i<n;i++) s+=abs(a[i]-a[n/2]);
cout<<s;
return 0;
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
vector<int> G[200010];
int add[200010];
int ans[200010];
void dfs(int x = 0, int p = -1, int num = 0) {
num += add[x];
ans[x] = num;
for(auto& to: G[x]) {
if(to == p) continue;
dfs(to, x, num);
}
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i, Q) {
int p, x;
cin >> p >> x;
p--;
add[p] += x;
}
dfs();
rep(i, N) {
if(i != 0) cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
| 0
| 72,501,937
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int v,s,t;
cin>>v>>t>>s;
if (t*s>=v)
cout<<"Yes";
else
cout<<"No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
static const int INFH = (1<<30)-1;
static const int INFL = -INFH;
vector<pair<char, int>> runLength(string x)
{
char now = x[0];
int count = 1;
vector<pair<char, int>> ret;
for (int i = 1; i < x.size(); ++i)
{
if(x[i] != now)
{
ret.push_back(make_pair(now, count));
now = x[i];
count = 1;
}
else
{
++count;
}
}
ret.push_back(make_pair(now, count));
return ret;
}
long long int wa(int x)
{
long long int ret = 0;
for (int i = 1; i <= x; ++i)
{
ret += i;
}
return ret;
}
int main()
{
string in;
cin >> in;
vector<pair<char, int>> r = runLength(in);
long long int ans = 0;
if(r.size() == 1)
{
cout << wa(r[0].second) << endl;
return 0;
}
for (int i = 0; i < r.size(); ++i)
{
if(i == 0 && r[i].first == '>')
{
ans += wa(r[i].second);
}
else if (i == r.size() - 1 && r[i].first == '<')
{
ans += wa(r[i].second);
}
else
{
ans += wa(max(r[i].second, r[i + 1].second)) + wa(min(r[i].second, r[i + 1].second)-1);
++i;
}
}
cout << ans << endl;
return 0;
}
| 0
| 61,658,098
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define Q int tt,qq; cin>>tt ;for(qq=1;qq<=tt;qq++)
#define I ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main()
{
ll n,i,j,ans=0;
cin>>n;
ll a[n+1],b[n];
for(i=0;i<n+1;i++)cin>>a[i];
for(i=0;i<n;i++)cin>>b[i];
for(i=n-1;i>=0;i--)
{
ans+=min(a[i+1],b[i]);
b[i]-=a[i+1];
if(b[i]<1)continue;
ans+=min(a[i],b[i]);
if(b[i]>a[i])a[i]=0;
else a[i]-=b[i];
}
cout<<ans;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <array>
#include <vector>
#include <utility>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1e9 + 7;
ll n, m;
ll get_edge_len(ll n, vector<ll> X) {
ll xall = 0;
ll k = 0;
vector<ll> D(n - 1);
for (ll i = 0; i < n - 1; i++) {
D[i] = X[i + 1] - X[i];
}
ll len = D.size();
for (ll i = 0; i < len / 2; i++) {
k += len - 2 * i;
xall = (xall + ((k * D[i]) % MOD) + MOD) % MOD;
xall = (xall + ((k * D[len - 1 - i]) % MOD) + MOD) % MOD;
}
if (len % 2) {
ll i = len / 2;
k += len - 2 * i;
xall = (xall + ((k * D[i]) % MOD) + MOD) % MOD;
}
return xall;
}
int main(void) {
cin >> n >> m;
vector<ll> X(n), Y(m);
for (auto&& x : X) {
cin >> x;
}
for (auto&& y : Y) {
cin >> y;
}
ll xall = 0, yall = 0;
xall = get_edge_len(n, X);
yall = get_edge_len(m, Y);
cout << (xall * yall) % MOD << endl;
return 0;
}
| 0
| 43,114,335
|
#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 cl=99999;
int ans=0;
for(int i=0;i<N-1;i++){
if(a[i]==a[i+1]){
a[i+1]=cl;
cl--;
ans++;
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pb emplace_back
#define X first
#define Y second
const int N = 2e5 + 5;
typedef pair<int,int> ii;
ii F[1 << 18];
void upd(int i,int x) {
if (F[i].Y < x)
F[i].Y = x;
if (F[i].X < F[i].Y)
swap(F[i].X,F[i].Y);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for(int i = 0 ; i < (1 << n) ; ++i) {
int x; cin >> x;
upd(i,x);
}
for(int i = 0 ; i < n ; ++i)
for(int j = 0 ; j < (1 << n) ; ++j) if (j >> i & 1)
upd(j,F[j ^ (1 << i)].X),
upd(j,F[j ^ (1 << i)].Y);
int ans = 0;
for(int i = 1 ; i < (1 << n) ; ++i) {
int nxt = F[i].X + F[i].Y;
if (ans < nxt)
ans = nxt;
cout << ans << "\n";
}
}
| 0
| 71,711,705
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int i,j,k,l,n,cnt;
while(scanf("%d",&n)!=EOF) {
cnt=0;
for(i=0;i<=9;i++) {
for(j=0;j<=9;j++) {
for(k=0;k<=9;k++) {
for(l=0;l<=9;l++) {
if(i+j+k+l==n) {
cnt++;
}
}
}
}
}
printf("%d\n",cnt);
}
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pcc pair<char,char>
#define F first
#define S second
#define int long long
#define pi 3.141592653589793238462643383279502
#define M 1000000007
#define rep(i,a,n) for(int i=a;i<n;i++)
#define INF 10000000000000
#define N 100005
#define vi vector<int>
#define all(v) v.begin(),v.end()
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
set<pii>s;
if(((n-1)*(n-2))/2 < k)
{
cout<<-1<<endl;
}
else
{
for(int i=1;i<n;i++)
s.insert({i,n});
int c= ((n-1)*(n-2))/2 ;
for(int i=1;i<(n-1) && c>k;i++)
{
for(int j=(i+1);j<n && c>k;j++)
{
s.insert({i,j});
c--;
}
}
cout<<s.size()<<endl;
for(auto x:s)
cout<<x.F<<" "<<x.S<<endl;
}
}
| 0
| 61,294,982
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
ll n,a,t[100005]={},ans[2]={},r=0,k;
cin>>n;
map<ll,ll>m;
for(ll i=0;i<n;i++)
{
cin>>a;
m[a]++;
}
vector<ll>v;
for(auto i=m.begin();i!=m.end();i++)
{
ll s=i->second;
if(s>=4)r=i->first;
if(s>=2)v.push_back(i->first);
}
if(v.size()<2)k=0;
else k=v[v.size()-1]*v[v.size()-2];
cout<<max(r*r,k)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll MOD = 1e9 + 7;
int main(){
ll n, m;
cin >> n >> m;
ll po = 0, yo = 0;
for(ll i = 0; i < n; i++){
ll x;
cin >> x;
x *= (2 * i - n + 1);
po += x;
if(po < 0) po += -po / MOD * MOD + (-po % MOD ? MOD : 0);
po %= MOD;
}
for(ll i = 0; i < m; i++){
ll y;
cin >> y;
y *= (2 * i - m + 1);
yo += y;
if(yo < 0) yo += -yo / MOD * MOD + (-yo % MOD ? MOD : 0);
yo %= MOD;
}
cout << po * yo % MOD << endl;
return 0;
}
| 0
| 57,928,223
|
#include <cstdio>
using namespace std;
char s[] = "RGYB";
int n, m, k;
int main()
{
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; putchar(10), i++)
for (int j = 0; j < m; j++)
putchar(s[(i + j) / k % 2 * 2 + (i + m - j) / k % 2]);
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<V<T>>;
struct Idx {
ll i1, i2;
};
const ll S = (1ll << 18) + 10;
V<Idx> memo(S, Idx{0, 0});
V<ll> ans(S, 0);
int main() {
ll N;
cin >> N;
V<ll> A(1ll << N);
for (ll &a : A) cin >> a;
memo[1] = (A[0] < A[1] ? Idx{1, 0} : Idx{0, 1});
ans[1] = A[0] + A[1];
for (ll i = 2; i < A.size(); i++) {
ll idx1 = i, idx2 = 0;
if (A[idx1] < A[idx2]) swap(idx1, idx2);
bitset<60> bi(i);
for (ll j = 0; j < 60; j++) {
if (!bi.test(j)) continue;
ll idx = (bi ^ bitset<60>(1ll << j)).to_ullong();
V<ll> tmp = {idx1, idx2, memo[idx].i1, memo[idx].i2};
sort(tmp.begin(), tmp.end(), [&](ll a, ll b){ return A[a] > A[b]; });
auto ite = unique(tmp.begin(), tmp.end());
tmp.erase(ite, tmp.end());
idx1 = tmp[0];
idx2 = tmp[1];
}
memo[i] = Idx{idx1, idx2};
ans[i] = max(ans[i - 1], A[idx1] + A[idx2]);
}
for (ll i = 1; i < A.size(); i++) cout << ans[i] << '\n';
return 0;
}
| 0
| 81,274,327
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int,int>;
int main()
{
int n;cin >> n;
ll a[n+1];
rep(i,n)cin >> a[i];
sort(a,a+n);
ll ans = a[n-1] - a[0];
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int q;
int len[1005][1005];
int common(string a,string b,int m,int n){
int i,j;
for(i=0;i<=m;i++)len[i][0]=0;
for(i=0;i<=n;i++)len[0][i]=0;
for(i=0;i<m;i++){
for(j=0;j<n;j++){
if(a[i]==b[j])len[i+1][j+1]=len[i][j]+1;
else len[i+1][j+1]=max(len[i+1][j],len[i][j+1]);
}
}
return len[m][n];
}
int main()
{
cin>>q;
int i;
for(i=0;i<q;i++){
string a,b;
cin>>a>>b;
int m=a.length();
int n=b.length();
cout<<common(a,b,m,n)<<endl;
}
return 0;
}
| 0
| 25,349,610
|
#include <bits/stdc++.h>
using namespace std;
int main(){
constexpr int Ndig= 10;
int N;
string S;
cin >> N >> S;
vector<vector<int>> positions(Ndig);
for(int i=0; i<N; i++){
int d= stoi(S.substr(i,1));
positions.at(d).emplace_back(i);
}
vector<int> existdig;
for(int d=0; d<Ndig; d++){
if(!positions.at(d).empty()){
existdig.emplace_back(d);
}
}
int ans= 0;
for(auto head:existdig){
for(auto tail:existdig){
int pos_head= positions.at(head).at(0);
int pos_tail= positions.at(tail).back();
if(pos_head < pos_tail){
for(auto mid:existdig){
auto itr0= upper_bound(positions.at(mid).begin(), positions.at(mid).end(), pos_head);
auto itr1= lower_bound(positions.at(mid).begin(), positions.at(mid).end(), pos_tail)- 1;
if(distance(itr0, itr1) >= 0){
ans++;
}
}
}
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main()
{
fast;
ll n;
cin>>n;
ll arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
ll b[64]={0},ans=0,m=1e9+7,p=1;
for(ll i=0;i<64;i++)
for(ll j:arr)
if(j & (1ll<<i))
b[i]++;
for(ll i=0;i<64;i++)
{
p=pow(2,i);
p%=MOD;
ans+=((((n-b[i])*b[i])%MOD)*p%MOD);
ans%=MOD;
}
cout<<ans;
return 0;
}
| 0
| 42,383,320
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
cout << (n+k-1)/k - n/k << endl;
}
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 9223372036854775807
#define MOD 998244353
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll> a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi>b.fi;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin>>n;
V<ll>a(n);
for(ll i=0;i<n;i++)cin>>a[i];
sort(all(a));
ll ans=0;
ans=a[0];
V<Pll>out;
if(a[n-1]<=0){
ans=a[n-1];
for(ll i=n-2;i>=0;i--){
out.pb(mp(ans,a[i]));
ans-=a[i];
}
cout<<ans<<endl;
for(ll i=0;i<n-1;i++){
cout<<out[i].fi<<" "<<out[i].se<<endl;
}
return 0;
}
ll l=0,r=0;
for(ll i=1;i<n-1;i++){
if(a[i]>=0){
l=ans;
r=a[i];
ans-=a[i];
out.pb(mp(l,r));
}
}
r=ans;
l=a[n-1];
ans=a[n-1]-ans;
out.pb(mp(l,r));
for(ll i=1;i<n-1;i++){
if(a[i]<0){
l=ans;
r=a[i];
ans-=a[i];
out.pb(mp(l,r));
}
}
cout<<ans<<endl;
for(ll i=0;i<n-1;i++){
cout<<out[i].fi<<" "<<out[i].se<<endl;
}
return 0;
}
| 0
| 94,485,876
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <cmath>
#include <numeric>
#include <functional>
#include <stack>
#include <iomanip>
#include <map>
#include <cstdio>
int main() {
long long n;
std::cin >> n;
std::vector<long long> v(n);
for (long long i = 0; i < n; i++)
{
std::cin >> v[i];
}
long long ans = 0;
for (long long i = 0; i < n; i++)
{
while (v[i] > 0) {
for (long long j = i; j < n && v[j] > 0; j++)
{
v[j]--;
}
ans++;
}
}
std::cout << ans << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef long long ll;
typedef pair<ll,ll> pint;
int main(){
ll n,k;cin>>n>>k;
vector<ll> a(n);rep(i,n)cin>>a[i];
vector<ll> s(n+1,0);
vector<ll> v;
rep(i,n){
s[i+1]=s[i]+a[i];
}
rep(left,n){
REP(right,left+1,n+1){
v.push_back(s[right]-s[left]);
}
}
int m=v.size();
ll ans=0;
int b=50;
for(int i=50;0<=i;i--){
int cnt = 0;
ll p = pow(2.0,i);
rep(j,m){
ll y = v[j];
if(((ans+p)&y)==(ans+p)){
cnt++;
}
}
if(k<=cnt){
ans+=p;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 71,778,330
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define sort_be(a) sort(a.begin(), a.end());
#define reverse_be(a) reverse(a.begin(), a.end());
#define vi vector<int>
#define vvii(a, b, c) vector<vector<int>> a(b, vector<int>(c));
using namespace std;
using ll = long long;
int main(){
ll k, a, b;
cin >> k >> a >> b;
cout << max(k + 1 , ((k - a + 1) / 2) * (b - a) + a + (k - a + 1) % 2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
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; }
template<typename T>
void print1(T begin, T end) {
while (begin != end) {
cerr << (*begin) << " ";
*begin++;
}
cerr << endl;
}
template<typename T>
void print2(T Array, int height, int width) {
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
cerr << " " << Array[i][j];
}
cerr << endl;
}
}
void print() { std::cerr << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
std::cerr << head << " ";
print(std::forward<Tail>(tail)...);
}
template<class T>
void Add(T &a, const T &b, const T &mod=1000000007) {
int val = ((a % mod) + (b % mod)) % mod;
if (val < 0) { val += mod; }
a = val;
}
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
signed main() {
int n, k;
cin >> n >> k;
cout << n - k+1 << endl;
return 0;
}
| 0
| 66,524,676
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
string O, E;
cin>>O>>E;
string ans;
for(int i=0;i<O.size()+E.size();++i) {
if(i%2==0) ans += O[i/2];
else ans += E[(i-1)/2];
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
#define endl "\n"
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1000000007;
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N,0);
for(ll i=0;i<N;++i)cin>>A[i];
map<ll,ll> M;
vl B=A;
sort(B.begin(), B.end());
for(ll i=0;i<N;++i){
M[B[i]]=i;
}
ll ans=0;
for(ll i=0;i<N;++i){
if(i%2!=M[A[i]]%2)ans++;
}
prt(ans/2)
return 0;
}
| 0
| 10,328,505
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
ll dp[310][310][310];
int main() {
int N, K; cin >> N >> K;
vector<ll> H(N);
for(int i=0; i<N; i++) cin >> H[i];
vector<ll> M = H;
M.emplace_back(0);
sort(M.begin(), M.end());
M.erase(unique(M.begin(), M.end()), M.end());
fill(dp[0][0], dp[N+1][0], LONGINF);
dp[0][0][0] = 0;
for(int i=0; i<N; i++) {
for(int j=0; j<=K; j++) {
ll opt_less = LONGINF;
for(int k=0; k<(int)M.size(); k++) {
chmin(opt_less, dp[i][j][k]);
chmin(dp[i+1][j+(M[k]!=H[i])][k], opt_less);
if(k+1<(int)M.size()) opt_less += M[k+1] - M[k];
}
ll opt_more = LONGINF;
for(int k=(int)M.size()-1; k>=0; k--) {
chmin(opt_more, dp[i][j][k]);
chmin(dp[i+1][j+(M[k]!=H[i])][k], opt_more);
}
}
}
ll ans = LONGINF;
for(int j=0; j<=K; j++) {
for(int k=0; k<(int)M.size(); k++) {
chmin(ans, dp[N][j][k]);
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#define INF 10000
using namespace std;
struct edge {
int from, to, cost;
};
edge es[100];
int d[11];
int n,maxV=0;
int shortest_path(int s){
int sum=0;
for(int i=0;i<maxV+1;i++){
d[i] = INF;
}
d[s] = 0;
while(1){
bool update = false;
for(int i=0;i<2*n;i++){
edge e = es[i];
if(d[e.from] != INF && d[e.to] > d[e.from] + e.cost){
d[e.to] = d[e.from] + e.cost;
update = true;
}
}
if(!update){
break;
}
}
for(int i=0;i<maxV+1;i++){
if(d[i] != INF){
sum += d[i];
}
}
return sum;
}
int main(void){
while(cin >> n && n){
maxV = 0;
int a, b, c, tmp, min,sum2=100000;
for(int i=0;i<n;i++){
cin >> a >> b >> c;
es[i].from = a;
es[i].to = b;
es[i].cost = c;
es[i+n].from = b;
es[i+n].to = a;
es[i+n].cost = c;
if(maxV < b){
maxV = b;
}
if(maxV < a){
maxV = a;
}
}
for(int i=0;i<maxV+1;i++){
int tmp = shortest_path(i);
if(sum2 > tmp){
sum2 = tmp;
min = i;
}
}
cout << min << " " << sum2 << endl;
}
return 0;
}
| 0
| 10,219,432
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
string N;
cin>>N;
rep(i,4-3+1)
{
if(N[i]==N[i+1]&&N[i+1]==N[i+2])
{
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 1001001001001001;
int main() {
ll n; cin >> n;
ll k; cin >> k;
ll a[n];
rep(i,n) {
cin >> a[i];
a[i] %= k;
}
ll b[n+1]; b[0] = 0;
rep(i,n) {
b[i+1] = (b[i]+a[i])%k;
}
ll c[n+1];
ll x = k;
while (x < 1000000) {
x *= 2;
}
rep(i,n+1) {
c[i] = (b[i]+x-i)%k;
}
map<ll, ll> mp;
rep(i,min(k,n+1)) {
mp[c[i]]++;
}
ll ans = 0;
int idxr = (int)min(k,n+1);
for (int i = 0; i+idxr < n+1; i++) {
ans += (ll)(mp[c[i]]-1);
mp[c[i]]--;
mp[c[i+idxr]]++;
}
for (int i = n+1-idxr; i < n+1; i++) {
ans +=(ll)(mp[c[i]]-1);
mp[c[i]]--;
}
cout << ans << endl;
return 0;
}
| 0
| 18,077,516
|
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a+b<c+d)
cout<<"Right"<<endl;
else if(a+b>c+d)
cout<<"Left"<<endl;
else
cout<<"Balanced"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
if (i * j % 2019 == 0) {
cout << 0 << endl;
exit(0);
}
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
}
| 0
| 77,588,661
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a<b&&b<c){
printf("Yes\n");
}
else{
cout<<"No"<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, x, y;
int main(){
scanf("%d%d", &n, &m);
if(m >= (1<<n)) printf("-1\n");
else if(m == 0){
for(i=0; i<=(1<<n)-1; i++){
printf("%d %d ", i, i);
}
}
else if(n < 2) printf("-1\n");
else{
for(i=0; i<=(1<<n)-1; i=++x){
if((j=i^m) < i) continue;
for(x=i+1; (y=x^m)<x; x++);
printf("%d %d %d %d %d %d %d %d ", i, j, x, y, j, i, y, x);
}
}
return 0;
}
| 0
| 53,963,902
|
#include <iostream>
using namespace std;
void swap(int *, int *);
int main()
{
int x,y;
while (1)
{
cin >> x >> y;
if (x == 0 && y == 0)
break;
if (x>y)
swap(&x, &y);
cout << x << " " << y << endl;
}
return 0;
}
void swap(int *a, int *b)
{
int temp;
temp = *b;
*b = *a;
*a = temp;
}
|
#include <bits/stdc++.h>
#define llint long long int
#define MOD 2019
using namespace std;
int main()
{
int L, R;
cin >> L >> R;
if (R - L > 2 * MOD)
{
R = L + 2 * MOD;
}
int min = 2019;
for (int i = L; i <= R; i++)
{
for (int j = i + 1; j <= R; j++)
{
int val = ((i % MOD) * (j % MOD)) % MOD;
if (val < min)
{
min = val;
}
}
}
cout << min << endl;
}
| 0
| 5,673,914
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int MN = 100005;
unsigned long long s = 0;
ll n, a[MN];
ll max_p[MN];
int main() {
cin >> n;
for (int i = 0; i <= n; ++i) {
cin >> a[i];
s += a[i];
}
if (a[0] > 0) {
if (n == 0 && a[0] < 2) {
cout << a[0] << endl;
} else {
cout << -1 << endl;
}
return 0;
}
max_p[0] = 1;
for (int i = 1; i < n; ++i) {
max_p[i] = min((ll)s + 1, max_p[i - 1] * 2 - a[i]);
}
max_p[n] = 0;
for (int i = n - 1; i >= 0; --i) {
if (max_p[i] < 1 || max_p[i] * 2 < max_p[i + 1] + a[i + 1]) {
cout << -1 << endl;
return 0;
}
max_p[i] = min(max_p[i], max_p[i + 1] + a[i + 1]);
s += max_p[i];
}
cout << s << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
int main(){
int n;
cin >> n;
vector<int> a(n), r(n + 1, 0);
rep(i, n) cin >> a[i];
rep(i, n) r[i + 1] = r[i] + a[i];
int ans = inf;
rep2(i, 1, n) ans = min(abs(r[i] - r[0] - (r[n] - r[i])), ans);
cout << ans << endl;
return 0;
}
| 0
| 7,637,622
|
#include<bits/stdc++.h>
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
int p=1;
for(int i=1;i<=n;i++){
if(k>p)p*=2;
else p+=k;
}
cout<<p<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = -1;
for(int i = 0; i < (1 << n); i++) {
long long cost = 0;
long long hmax = 0;
int color = 0;
for(int j = 0; j < n; j++) {
if(1 & (i >> j)) {
color++;
if(a[j] <= hmax) {
hmax++;
cost += hmax - a[j];
} else {
hmax = a[j];
}
} else {
if(a[j] > hmax) {
color++;
hmax = a[j];
}
}
}
if(color >= k) {
if(ans == -1) {
ans = cost;
} else {
ans = min(ans, cost);
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 41,169,988
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
const int SIZE = 100000;
int dp[3][SIZE];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;cin>>n>>k;
int r, s, p;cin>>r>>s>>p;
string t;cin>>t;
vector<bool> success;
int ans = 0;
for (int i=0; i<n; i++)
{
switch (t[i])
{
case 'r':
if (i-k<0){
ans+=p;
success.push_back(true);
}
else if(t[i-k]!='r' || success[i-k]==false){
ans+=p;
success.push_back(true);
}
else success.push_back(false);
break;
case 's':
if (i-k<0){
ans+=r;
success.push_back(true);
}
else if(t[i-k]!='s' || success[i-k]==false){
ans+=r;
success.push_back(true);
}
else success.push_back(false);
break;
case 'p':
if (i-k<0){
ans+=s;
success.push_back(true);
}
else if(t[i-k]!='p' || success[i-k]==false){
ans+=s;
success.push_back(true);
}
else success.push_back(false);
break;
}
}
cout << ans << endl;
}
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
ll ans = 0;
rep(i, n) {
if(i >= k) {
ans += h.at(i);
}
}
cout << ans << endl;
return 0;
}
| 0
| 73,369,866
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,h; cin>>n>>h;
vector<int> a(n), b(n);
rep(i,n) cin>>a[i]>>b[i];
sort(etob(a));
int m=a[0];
sort(etob(b));
int cnt=n;
rep(i,n){
if(m>=b[i]){
cnt=i;
break;
}
}
int ans=0;
rep(i,cnt){
ans++;
h-=b[i];
if(h<=0){
cout<<ans<<endl;
return 0;
}
}
ans+=(h+m-1)/m;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, ans;
cin >> N;
if (N<105) {
ans=0;
}
else {
if (N<135) {
ans=1;
}
else {
if (N<165) {
ans=2;
}
else {
if (N<189) {
ans=3;
}
else {
if (N<195) {
ans=4;
}
else {
ans=5;
}
}
}
}
}
cout << ans << endl;
}
| 0
| 58,523,631
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
inline int getint()
{
static char c;
while ((c = getchar()) < '0' || c > '9');
int res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
return res;
}
const int MaxN = 100000;
int n;
vector<int> adj[MaxN + 1];
int f[MaxN + 1][2];
void dfs(int u, int fa)
{
f[u][0] = 0;
f[u][1] = 1;
for (int v : adj[u])
if (v != fa)
{
dfs(v, u);
f[u][0] += f[v][1];
f[u][1] += min(f[v][0], f[v][1]);
}
}
int main()
{
while (cin >> n)
{
for (int u = 1; u <= n; ++u)
adj[u].clear();
for (int i = 1; i < n; ++i)
{
int u = getint(), v = getint();
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(1, 0);
int n_matches = min(f[1][0], f[1][1]);
if (n_matches * 2 == n)
puts("Second");
else
puts("First");
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main(){
long long N, X, M;
cin >> N >> X >> M;
vector<long long> cnt;
cnt.push_back(X);
set<long long> s;
s.insert(X);
int ind;
while(1){
X = X * X % M;
if(s.count(X)) {
for(int i = 0; i < (int)cnt.size(); i++){
if(cnt[i] == X) ind = i;
}
break;
}
s.insert(X);
cnt.push_back(X);
}
int n = cnt.size();
long long ans = 0;
if(N <= n){
for(int i = 0; i < N; i++) ans += cnt[i];
}
else{
if(cnt[n - 1] != 0){
long long sum = 0;
for(int i = ind; i < n; i++){
sum += cnt[i];
}
long long t = n - ind;
for(int i = 0; i < ind; i++) ans += cnt[i];
ans += (N - ind) / t * sum;
for(int i = ind; i < ind + (N - ind) % t; i++){
ans += cnt[i];
}
}
else{
for(int i = 0; i < n; i++){
ans += cnt[i];
}
}
}
cout << ans << endl;
}
| 0
| 13,009,315
|
#include <bits/stdc++.h>
using namespace std ;
int main(){
string A,B;
cin >> A >> B;
int Ak = A.size();
int Bk = B.size();
int Ans=-1;
if(Ak>Bk)Ans=0;
else if(Ak<Bk)Ans =1;
else{
for(int i=0;i<A.size();i++){
if(A[i]>B[i]){
Ans =0;
break;
}else if(A[i]<B[i]){
Ans =1;
break;
}
}
}
if(Ans==0)cout << "GREATER" << endl;
else if(Ans ==1)cout << "LESS" << endl;
else cout << "EQUAL" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int INF = 1e18 + 5;
const int mod = 1e9 + 7;
const int N = 2e5 + 314;
const long double pi = 3.1415926535897932384626433832795;
void solve(){
int n, m;
cin>>n>>m;
char a[n][m];
string s="";
for(int i = 0; i < n; i++){
string pr="";
for(int j = 0; j < m; j++){
cin>>a[i][j];
pr+=a[i][j];
}
s+=pr;
s+='\n';
s+=pr;
s+='\n';
}
cout<<s;
}
signed main(){
speed;
int t=1;
while(t--)solve();
}
| 0
| 51,997,069
|
#include<cstdio>
bool done[21][21];
int W,H;
char s[21][21];
bool map[21][21];
void init(){
for(int i=0;i<21;i++){
for(int j=0;j<21;j++){
done[i][j]=false;
map[i][j]=false;
s[i][j]=0;
}}
}
void solve(int h,int w){
if(s[h][w]=='.' || s[h][w]=='@'){
map[h][w]=true;
done[h][w]=true;
if(h-1 >=0 && done[h-1][w]==false) solve(h-1,w);
if(h+1 < H && done[h+1][w]==false) solve(h+1,w);
if(w-1 >=0 && done[h][w-1]==false) solve(h,w-1);
if(w+1 <W && done[h][w+1]==false) solve(h,w+1);
}
else{
map[h][w]=false;
done[h][w]=true;
}
return;
}
int main(){
while(1){
init();
scanf("%d%d",&W,&H);
if(W==0 && H==0) break;
for(int i=0;i<H;i++)
scanf("%s",&s[i]);
int sw,sh;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(s[i][j]=='@'){
sw=j;
sh=i;
}}}
solve(sh,sw);
int ans=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(map[i][j]==true)
ans++;
}}
printf("%d\n",ans);
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define fill(a) memset(a, 0, sizeof(a))
const int MX = 1e6;
const int MI = -1e6;
const int MOD = 1e9 + 7;
const string ALPHA = "abcdefghijklmnopqrstuvwxyz";
const double PI = 3.1415926535;
#define rep(i, n) for(int i=0; i<n; i++)
const int mod=1e9+7;
inline int add(int x,int y)
{
x+=y;
if (x>=mod)
return x-mod;
return x;
}
inline int sub(int x,int y)
{
x-=y;
if (x<0)
return x+mod;
return x;
}
inline int mul(int x,int y)
{
return (x*1ll*y)%mod;
}
inline int power(int x,int y)
{
int ans=1;
while(y)
{
if (y&1) ans=mul(ans,x);
x=mul(x,x);
y>>=1;
}
return ans;
}
inline int inv(int x)
{
return power(x,mod-2);
}
inline int gcd(int x, int y)
{
return(y!=0)?gcd(y, x%y):x;
}
inline ll nPr(int n, int r)
{
ll i,result=1;
rep(i,r)
{
result*=(ll)(n-i);
}
return result;
}
inline ll nCr(int n,int r)
{
ll i,result=1;
rep(i,min(r,n-r))
{
result*=(ll)(n-i);
result/=(ll)(i+1);
}
return result;
}
bool prime(int n)
{
for (int i=2; i<n/2; i++)
{
if(n%i==0)
return false;
}
return true;
}
int main()
{
IOS;
int a, b, k;
cin >> k;
cin >> a >> b;
for (int i=min(a, b); i<=max(a, b); i++)
{
if (i%k==0)
{
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
return 0;
}
| 0
| 51,757,679
|
#include <bits/stdc++.h>
typedef unsigned long long int ull;
typedef long double ldb;
typedef long long int ll;
#define MOD1 1000000007
#define MOD2 998244353
#define PI 3.1415926535897932384626433832795
#define FILL(a, value) memset(a, value, sizeof(a))
#define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define what_is(x) cerr << #x << " is " << x << endl;
#define ASSERT(left,operator,right) { if(!((left) operator (right))){ std::cerr << "ASSERT FAILED: " << #left << #operator << #right << " @ " << __FILE__ << " (" << __LINE__ << "). " << #left << "=" << (left) << "; " << #right << "=" << (right) << std::endl; } }
#define rep01(k,n) for (ll i=k; i<n; i++)
#define rep02(k,n) for (ll j=k; j<n; j++)
#define rep03(k,n) for (ll k=k; k<n; k++)
#define rep11(k,n) for (ll i=k; i<=n; i++)
#define rep12(k,n) for (ll j=k; j<=n; j++)
#define rep13(k,n) for (ll k=k; k<=n; k++)
#define repIT(c,it) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
#define all(c) c.begin(), c.end()
using namespace std;
const double pi = acos(-1.0);
const double epsilon = 1e-9;
const int maxn = 1e6+10;
void solve()
{
ll n;
cin >> n;
vector<ll> d(n);
for(auto &i: d)
cin >> i;
sort(d.begin(), d.end());
cout << d[d.size()/2] - d[d.size()/2-1];
}
int main()
{
int t = 1;
while(t--)
solve();
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=1, tmp=0;
vector<ll> T, A, Tmins, Amins;
signed main(){
cin >> N;
Tmins.resize(N, 1);
tmp = 0;
for(int i=0;i<N;i++) {
ll a;
cin >> a;
T.push_back(a);
if(tmp<a) {
tmp = a;
Tmins[i] = tmp;
}
}
for(int i=0;i<N;i++) {
ll a;
cin >> a;
A.push_back(a);
}
reverse(A.begin(), A.end());
Amins.resize(N, 1);
tmp = 0;
for(int i=0;i<N;i++) {
if(tmp<A[i]) {
tmp = A[i];
Amins[i] = tmp;
}
}
reverse(A.begin(), A.end());
reverse(Amins.begin(), Amins.end());
for(int i=0;i<N;i++) {
A[i] = min(A[i], T[i]);
Amins[i] = max(Amins[i], Tmins[i]);
ans *= max(0LL,(A[i]-Amins[i]+1LL));
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| 0
| 81,773,923
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define print(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int bexp(int a, int b, int mod)
{
int res = 1;
while (b)
{
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
const int N = 100010;
const int mod = 998244353;
struct comp {
bool operator() (const pair<int, int> a, const pair<int, int> b) const
{
return a.ss > b.ss;
}
};
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int n, x, m;
cin >> n >> x >> m;
int p = x;
int f[m] = {};
vector<int> a;
a.pb(0);
while (n) {
if (f[p] == 1) {
break;
}
f[p]++;
n--;
a.pb(p + a.back());
p = p * p % m;
}
int ans = a.back();
int in = 0;
for (int i = 1; i < (int)a.size(); ++i)
{
if (a[i] - a[i - 1] == p) {
in = i;
break;
}
}
int no = a.size() - in;
if (in != 0)
ans = ans + n / no * (a.back() - a[in - 1]);
if (in != 0)
ans = ans + (a[in + n % no - 1] - a[in - 1]);
cout << ans << endl;
return 0;
}
|
#include<stdio.h>
int main(){
int A;
int B;
scanf("%d",&A);
scanf("%d",&B);
if(A==1&&B==2){
printf("%d\n",A+B);
}
else if(A==2&&B==1){
printf("%d\n",A+B);
}
else if(A==3&&B==1){
printf("%d\n",A-B);
}
else if(A==2&&B==3){
printf("%d\n",B-A);
}
else if(A==3&&B==2){
printf("%d\n",A-B);
}
else if(A==1&&B==3){
printf("%d\n",B-A);
}
return 0;
}
| 0
| 81,577,940
|
#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+5, M = 1e6+5, A = 1e7+5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
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, h, ans = 0; cin >> n >> h;
ll a[n], b[n];
rep(i, n) cin >> a[i] >> b[i];
sort(b, b+n);
ll mx = *max_element(a, a+n);
ll j = 0;
while(j < n && b[j] <= mx){
j++;
}
for(ll i = n-1; i >= j; i--) {
ans++; h -= b[i];
if(h <= 0) ANS(ans);
}
ans += (h + mx-1)/mx;
cout << ans;
}
int main(int argc, char const* argv[])
{
ll t = 1;
while(t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n); (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
#define yes pf("Yes")
#define no pf("No")
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; }
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a,ll b){
if(a < b)swap(a, b);
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
ll factorial(ll n){
ll ans = 1;
rep1(i, n){
ans *= i;
ans %= mod;
}
return ans;
}
ll power(ll a, ll b){
ll ans = 1;
a %= mod;
while(b) {
if(b & 1LL) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
int main(){
ll n,m;
cin >> n >> m;
vector<ll> c(n,0);
rep0(i, m){
ll a,b;
cin >> a >> b;
--a;--b;
++c[a];++c[b];
}
bool f = true;
rep0(i, n)if(c[i] % 2 == 1)f = false;
pf(f? "YES":"NO");
return 0;
}
| 0
| 63,053,856
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using pll = pair<ll, ll>;
int main() {
ll n; cin>>n;
vector<pll> v(n);
rep(i,n){cin>>v[i].first>>v[i].second;}
ll ans=0;
for(int i=n-1; i>=0; i--){
ll a = (v[i].first+ans) % v[i].second;
if(a !=0){ans+= v[i].second-a;}
}
cout<<ans;
}
|
#include <iostream>
#include <bits/stdc++.h>
#define rep(i,z) for(int i = 0; i<(int)(z); i++)
#define rep1(i,z) for(int i = 1; i<=(int)(z); i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
using pear = pair<int,int>;
int main(){
int x,n; cin>>x>>n;
int p[n];
rep(i,n) cin>>p[i];
bool neko=true;
rep(i,n){
if(p[i]==x) neko=false;
}
if(neko){
cout<<x<<endl;
return 0;
}
int a= x-1, b=x+1;
rep(i,n){
bool an=true,bn=true;
for(int j=0; j<n;j++){
if(p[j]==a) an=false;
if(p[j]==b) bn=false;
}
if(an){
cout<<a<<endl;
return 0;
}
if(bn){
cout<<b<<endl;
return 0;
}
a--; b++;
}
cout<<a<<endl;
}
| 0
| 15,364,301
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxN = 1e5+20;
int n;
int64_t v[mxN+1][3];
int64_t dp[mxN+1][4];
int64_t go(int idx, int last) {
if(idx == n) {
if(last == 1) {
return max(v[idx][1], v[idx][2]);
} else if(last == 2) {
return max(v[idx][0], v[idx][2]);
} else {
return max(v[idx][0], v[idx][1]);
}
}
if(idx > n) {
return (int64_t)-1e18;
}
if(dp[idx][last] != -1) {
return dp[idx][last];
}
int64_t ans = (int64_t)-1e18;
if(last != 1) {
ans = max(ans, v[idx][0] + go(idx+1, 1));
}
if(last != 2) {
ans = max(ans, v[idx][1] + go(idx+1, 2));
}
if(last != 3) {
ans = max(ans, v[idx][2] + go(idx+1, 3));
}
return dp[idx][last] = ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 0; j < 3; j++) {
cin >> v[i][j];
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < 4; j++) {
dp[i][j] = -1;
}
}
int64_t ans = go(1, 0);
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<bool> flg(n, false);
vector<int> cnt(n, 0);
rep(i, m) {
int p;
string s;
cin >> p >> s;
--p;
if (s == "AC") {
flg[p] = true;
}
else if (!flg[p] && s == "WA") {
++cnt[p];
}
}
int ac_ans = 0;
int wa_ans = 0;
rep(i, n) {
if (flg[i]) {
++ac_ans;
wa_ans += cnt[i];
}
}
cout << ac_ans << " " << wa_ans << endl;
return 0;
}
| 0
| 4,661,855
|
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long int sum = 0, t , d;
cin >> t;
vector <int> vec;
for (int i = 0; i < t; ++i)
{
cin >> d;
vec.push_back(d);
}
for (int i = 0; i < t - 1; ++i)
{
for (int j = i + 1; j < t; ++j)
{
sum += vec[i] * vec[j];
}
}
cout << sum << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>
using namespace std;
typedef long long int lint;
#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define mp make_pair
#define IP pair<int,int>
#define enld endl
#define MOD 998244353
int main() {
lint N;
while (cin >> N, N != 0) {
N = 1000 - N;
lint ans = 0;
ans += N / 500;
N %= 500;
ans += N / 100;
N %= 100;
ans += N / 50;
N %= 50;
ans += N / 10;
N %= 10;
ans += N / 5;
N %= 5;
ans += N / 1;
N %= 1;
cout << ans << enld;
}
}
| 0
| 86,173,471
|
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
using namespace std;
int MOD = 1000000007;
int n;
int a[101];
signed main(){
cin >> n;
int mini = 110;
int maxi = -1;
rep(i,n){
int val;
cin >> val;
a[val]++;
mini = min(mini,val);
maxi = max(maxi,val);
}
if(a[mini] == 1){
if(maxi != mini*2){
cout << "Impossible" << endl;
return 0;
}
for(int i = mini+1;i <= maxi;i++){
if(a[i] < 2){
cout << "Impossible" << endl;
return 0;
}
}
cout << "Possible" << endl;
}else if(a[mini] == 2){
if(maxi != mini*2-1){
cout << "Impossible" << endl;
return 0;
}
for(int i = mini+1;i <= maxi;i++){
if(a[i] < 2){
cout << "Impossible" << endl;
return 0;
}
}
cout << "Possible" << endl;
}else{
cout << "Impossible" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll =long long;
const ll INF =999999999;
ll gcd(ll a, ll b){
if (a%b==0){
return(b);
}else{
return(gcd(b,a%b));
}
}
ll lcm(ll a, ll b){
return a*b/gcd(a,b);
}
ll isprime(ll n){
bool prime=true;
for(int i=2;i<n;i++){
if(n%i==0){
prime=false; break;
}
}
if(prime){cout<<n<<" is prime"<<endl;
}else{cout<<n<<" is not prime"<<endl;}
}
ll factorial(ll n){
ll a=1;ll b=n;
for(int i=0;i<n;i++){
a*=b;
b--;
}
return a;
}
ll comb(ll a,ll b){
ll c;
c=factorial(a)/(factorial(a-b)*factorial(b));
return c;
}
int main(){
cout<<fixed<<setprecision(10);
int A,B,C;
cin>>A>>B>>C;
if(A+B>=C){
cout<<"Yes"<<endl;
}else{cout<<"No"<<endl;
}
}
| 0
| 59,632,319
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int N;
vector<int> C,S,F;
int next_time( int s, int i ){
int quo = ( s + (F[i]-1) ) / F[i];
int dep;
if ( quo < ( S[i] / F[i] ) ) dep = S[i];
else dep = F[i] * quo;
return dep + C[i];
}
int main() {
cin >> N;
C.resize(N-1); S.resize(N-1); F.resize(N-1);
REP(i,N-1) cin >> C[i] >> S[i] >> F[i];
REP(i,N-1){
int s = S[i];
for ( int j = i; j < N-1; ++j){
s = next_time(s,j);
}
cout << s << endl;
}
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define N 100005
using namespace std;
int n;
vector<int> g[N];
int dfs(int u, int fa) {
int sg = 0;
for(auto v : g[u]) {
if(v == fa) continue;
sg ^= dfs(v, u) + 1;
}
return sg;
}
int main() {
scanf("%d", &n);
for(int i = 1, u, v; i < n; ++i) {
scanf("%d %d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
puts(dfs(1, 0) ? "Alice" : "Bob");
return 0;
}
| 0
| 62,431,254
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int64_t N,K;
cin>>N>>K;
if(K%2!=0){
cout<<(N/K)*(N/K)*(N/K)<<endl;
}
else{
cout<<(N/K)*(N/K)*(N/K)+((N+K/2)/K)*((N+K/2)/K)*((N+K/2)/K)<<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
char fi[100][100];
int main(){
int a,b; cin >> a >> b;
cout << 100 << " " << 100 << endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(i<50)fi[i][j]='#';
else fi[i][j]='.';
}
}
a--; b--;
for(int i=0;i<50;i++){
for(int j=0;j<100;j++){
if(a==0)break;
if(i%2==0&&j%2==0){
fi[i][j]='.';
a--;
}
}
if(a==0)break;
}
for(int i=51;i<100;i++){
for(int j=0;j<100;j++){
if(b==0)break;
if(i%2==0&&j%2==0){
fi[i][j]='#';
b--;
}
}
if(b==0)break;
}
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
cout << fi[i][j];
}
cout << endl;
}
}
| 0
| 66,622,043
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
int S = 0;
rep(i, N) {
cin >> A[i];
S += A[i];
}
int ans = 0;
for(int x : A) {
if (x >= float(S) / (4*float(M))) {
ans++;
}
}
if (ans >= M) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
class ReverseSequence{
public:
void solve(string str){
int n=str.size();
for(int i=n-1;i>=0;i--){
printf("%c",str[i]);
}
printf("\n");
}
};
int main(){
string str;
cin>>str;
ReverseSequence inst;
inst.solve(str);
}
| 0
| 89,769,287
|
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size()
using namespace std;
int f(ll n){
int res=0;
while(n){
res+=n%10;
n/=10;
}
return res;
}
int main(){
ll n;
cin>>n;
cout<<(n%f(n)?"No":"Yes");
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x, n;
cin >> x >> n;
vector<bool> is_in(101, false);
for (int i = 0; i < n; ++i)
{
int p;
cin >> p;
is_in[p] = true;
}
int left = x, right = x;
while (is_in[x])
{
left--;
right++;
if (!is_in[right]) x = right;
if (!is_in[left]) x = left;
}
cout << x << endl;
}
| 0
| 16,715,592
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
using namespace std;
int main(void){
int n,k;cin>>n>>k;
vector<ll> v(n);
rep(i,n) cin>>v[i];
vector<ll> a(n+1,0),inva(n+1,0);
rep(i,n)a[i+1]=a[i]+v[i];
auto iv=v;
reverse(iv.begin(),iv.end());
rep(i,n)inva[i+1]=inva[i]+iv[i];
ll res=0;
for(int i=0;i<=k;i++){
for(int j=0;j<=min(i,n);j++){
for(int l=0;l<=j;l++){
ll tmp=0;
tmp+=a[l];
int r=j-l;
tmp+=inva[r];
int buf=i-j;
priority_queue<ll, vector<ll>, greater<ll> > que;
rep(x,l)que.push(v[x]);
rep(x,r)que.push(iv[x]);
rep(x,buf){
if(que.size()==0)break;
tmp-=que.top();que.pop();
}
chmax(res,tmp);
}
}
}
cout<<res<<endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define lw(vc,num) lower_bound(vc.begin(), vc.end(), num) - vc.begin();
#define hg(vc,num) upper_bound(vc.begin(), vc.end(), num) - vc.begin();
#define bn(v,x) binary_search (v.begin(), v.end(), x)
#define mx 100001
#define eps 0.00000000001
#define mod 1000000007
#define pi acos(-1)
#define inf 100000000
#define loop(i,b,n) for(int i=b;i<n;++i)
#define rev_loop(i,b,n) for(int i=b;i>=n;--i)
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
bool isprime(int n)
{
if(n == 1) return false;
if(n == 2 || n == 3) return true;
if(n%2 == 0 || n%3 == 0) return false;
for(int i=5; i*i<=n; i+=6){
if((n%i == 0)||(n%(i+2) == 0)) return false;
}
return true;
}
long long binpow(long long a, long long b) {
if (b == 0)
return 1;
long long res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
int main()
{
fio;
int n;
cin>>n;
int p = n/15;
int k = 800*n;
cout<<k-(200*p)<<endl;
return 0;
}
| 0
| 68,491,881
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll x, y;
cin >> x >> y;
y /= 2;
cout << x + y << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
static const int N = 100000;
static const int NIL = -1;
struct Node
{
int parent;
int left;
int right;
};
struct Node T[N];
int D[N];
void setDepth(int u, int parent)
{
D[u] = parent;
if (T[u].right != NIL) setDepth(T[u].right, parent);
if (T[u].left != NIL) setDepth(T[u].left, parent + 1);
}
void printNode(int u)
{
cout << "node " << u << ": ";
cout << "parent = " << T[u].parent << ", ";
cout << "depth = " << D[u] << ", ";
if (T[u].parent == NIL) cout << "root, ";
else if (T[u].left == NIL) cout << "leaf, ";
else cout << "internal node, ";
cout << "[";
for (int i = 0, child = T[u].left; child != NIL; i++, child = T[child].right)
{
if (i) cout << ", ";
cout << child;
}
cout << "]" << endl;
}
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
T[i].left = NIL;
T[i].right = NIL;
T[i].parent = NIL;
}
for (int i = 0; i < n; i++)
{
int nodeId, k;
int prevChild;
cin >> nodeId >> k;
for (int j = 0; j < k; j++)
{
int child;
cin >> child;
if (j == 0) T[nodeId].left = child;
else T[prevChild].right = child;
T[child].parent = nodeId;
prevChild = child;
}
}
int rootNode;
for (int i = 0; i < n; i++)
{
if (T[i].parent == NIL)
{
rootNode = i;
break;
}
}
setDepth(rootNode, 0);
for (int i = 0; i < n; i++)
printNode(i);
return 0;
}
| 0
| 92,210,418
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
int N,K;
cin>>N>>K;
vector<int>A(N);
vector<int>B(300000);
rep(i,N){
cin>>A[i];
B[A[i]]++;
}
int cnt=0;
sort(B.begin(),B.end());
rep(i,300000){
if(B[i]!=0){
cnt++;
}
}
cnt=cnt-K;
ll ans=0;
rep(i,300000){
if(cnt<=0){
break;
}
else{
if(B[i]!=0){
ans+=B[i];
cnt--;
}
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){
if(b == 0) return 1;
else if(b%2 == 0){
ll d = calc(a,b/2,p);
return (d*d)%p;
}
else if(b%2 == 1){
return (a * calc(a,b-1,p))%p;
}
}
typedef pair<int,int> P;
bool is_prime(int n){
if(n == 1) return false;
for(int i = 2;i*i <= n;i++){
if(n%i == 0) return false;
}
return true;
}
int factorial(int a){
int res = 1;
while(a){
res *= a;
a--;
}
return res;
}
int main(){
char a,b;
cin >> a >> b;
if(a == 'H'){
if(b == 'H') cout << 'H' << endl;
else cout << 'D' << endl;
}
else if(a == 'D'){
if(b == 'H') cout << 'D' << endl;
else cout << 'H' << endl;
}
}
| 0
| 92,742,892
|
#include<iostream>
#include<cstdio>
using namespace std;
const int N=200005;
const int MOD=1000000007;
int n;
char s[N];
int a[N];
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
if(s[1]=='W')
{
printf("0");
return 0;
}
a[0]=1;
for(int i=1;i<=n*2;i++)
if(s[i]==s[i-1]) a[i]=a[i-1]^1;
else a[i]=a[i-1];
int num=0;
long long ans=1;
for(int i=1;i<=n*2;i++)
{
if(a[i]==1) num++;
else ans=ans*num%MOD,num--;
if(num<0)
{
printf("0");
return 0;
}
}
if(num!=0)
{
printf("0");
return 0;
}
for(int i=1;i<=n;i++)
ans=ans*i%MOD;
printf("%lld",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
long long T;
cin >> N >> T;
long long ans = 0;
int last = 0;
for (int i = 0; i < N; i++) {
long long t;
cin >> t;
if (t < last) ans -= last - t;
ans += T;
last = t + T;
}
cout << ans << '\n';
return 0;
}
| 0
| 29,382,940
|
#include <bits/stdc++.h>
typedef long long ll;
ll n, x;
ll GetAns(ll a, ll b) {
if(a < b) std::swap(a, b);
return a % b ? GetAns(b, a % b) + 2 * (a / b) * b : 2 * (a / b) * b - b;
}
int main() {
scanf("%lld%lld", &n, &x);
printf("%lld", GetAns(x, n - x) + n);
return 0;
}
|
#include <math.h>
#include <iostream>
#include <iomanip>
#define PI 3.14159265358979
#define DEG_TO_RAD(deg) (((deg) / 180 ) * PI)
using namespace std;
int main()
{
double a, b, C;
double S, L, h;
double c;
cin >> a >> b >> C;
c = sqrt((a * a) + (b * b) - (2 * a * b * cos(DEG_TO_RAD(C))));
S = a * b * sin(DEG_TO_RAD(C)) / 2;
L = a + b + c;
h = b * sin(DEG_TO_RAD(C));
cout << fixed
<< setprecision(8)
<< S << endl
<< L << endl
<< h << endl;
return 0;
}
| 0
| 86,597,634
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) int(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e15;
const int MOD = 1e9+7;
const ll LINF = 1e18;
ll n,A,B,C;
vll l;
ll ans=INF;
void rec(ll i,ll a,ll b,ll c, ll cost){
if(i==n){
if(!a||!b||!c) return;
chmin(ans,abs(A-a)+abs(B-b)+abs(C-c)+cost);
return;
}
rec(i+1,a,b,c,cost);
rec(i+1,a+l[i],b,c,a==0?cost:cost+10);
rec(i+1,a,b+l[i],c,b==0?cost:cost+10);
rec(i+1,a,b,c+l[i],c==0?cost:cost+10);
}
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
cin>>n>>A>>B>>C;
l.resize(n);
rep(i,n) cin>>l[i];
rec(0,0,0,0,0);
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
ll ngcd(vector<ll> a){
ll res;
res = a.at(0);
for(ll i = 1; i < a.size() && res != 1; i++) {
res = gcd(a.at(i), res);
}
return res;
}
int main()
{
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A.at(i);
sort(all(A));
if(K <= A.at(N-1) && K % ngcd(A) == 0){
cout << "POSSIBLE" << endl;
}
else{
cout << "IMPOSSIBLE" << endl;
}
}
| 0
| 35,370,177
|
#include <bits/stdc++.h>
using namespace std;
int main(){
double a,b,c; cin >> a >> b >> c;
double rad = M_PI/180.0*c;
double h = b*sin(rad);
double S = 0.5*a*h;
double L = a + b + sqrt(a*a+b*b-2*a*b*cos(rad));
cout << fixed << setprecision(8) << S << endl;
cout << fixed << setprecision(8) << L << endl;
cout << fixed << setprecision(8) << h << endl;
return 0;
}
|
#include <iostream>
#include<bits/stdc++.h>
int main(int argc, const char * argv[]) {
std::string str;
std::cin>>str;
long long int sum=0;
std::vector <int>vec(str.length()+1);
vec.at(0)=0;
for(int i=0;i<str.length();i++){
if(str.at(i)=='<'){
vec.at(i+1)=vec.at(i)+1;
}
}
for(long long int i=str.size()-1;i>=0;i--){
if(str.at(i)=='>'){
vec.at(i)=std::max(vec.at(i+1)+1,vec.at(i));
}
}
for(int i=0;i<vec.size();i++){
sum+=vec.at(i);
}
std::cout<<sum<<std::endl;
return 0;
}
| 0
| 6,320,164
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
while(true){
int n;
cin>>n;
if(n==0)break;
vector<string> v;
rep(i,n){
string s;
cin>>s;
v.push_back(s);
}
int cnt=0;
rep(i,n-1){
if((v[i]=="lu"&&v[i+1]=="ru")||(v[i]=="ru"&&v[i+1]=="lu")
||(v[i]=="ld"&&v[i+1]=="rd")||(v[i]=="rd"&&v[i+1]=="ld")){cnt++; i++;}
}
cout<<cnt<<endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <cctype>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
locale l = locale::classic();
int main(){
ll a[26]={0};
while(1){
string s;
cin >> s;
if(cin.eof()) break;
rep(k,s.size()){
rep(i,26){
char c = 'a' + i;
if(s[k] == c) a[i]++;
c = 'A' + i;
if(s[k] == c) a[i]++;
}
}
}
rep(i,26){
char c = 'a' + i;
cout << c << " : " << a[i] << endl;
}
}
| 0
| 69,128,350
|
#ifndef _WIN32
#include<iostream>
#endif
#include<string>
#include<iomanip>
#include<vector>
#include<string>
using namespace std;
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main() {
int n;
while (cin >> n, n) {
int prv = 0;
int l = 0;
int r = 0;
int res=0;
REP(i, n) {
string s;
cin >> s;
if (s == "lu")l = 1;
if (s == "ru")r = 1;
if (s == "ld")l = 0;
if (s == "rd")r = 0;
if (l == r&&r != prv) {
prv = r;
res++;
}
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-1; (i)>=0; (i)--)
#define FOR(i, m, n) for(int (i)=(m); (i)<(n); i++)
#define FORR(i, m, n) for(int (i)=(n)-1; (i)>=(m); i--)
#define debug(x) cerr << #x << " = " << x << endl
typedef long long ll;
ll const MOD = 1e9+7;
int const inf = 1e9;
ll const INF = 1e18;
inline void ios_(){cin.tie(0); ios::sync_with_stdio(false);}
template<typename T> int size(const T& a){return (int)a.size();}
template<typename T> T Div(T a, T b){return (a + b - 1) / b;}
template<typename T> bool chmin(T& a, const T& b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, const T& b){if(a < b){a = b; return true;} return false;}
signed main(){
int n;
cin >> n;
vector<ll> v(n);
for(auto&& i : v) cin >> i;
ll ans = 0, low = 0;
REP(i, n){
ll a = (v[i] - 1) / (low + 1);
chmax(low, 1LL);
if(a <= 0){
chmax(low, v[i]);
}
else{
ans += a;
}
debug(low);
}
cout << ans << endl;
return 0;
}
| 0
| 12,508,754
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) for(ll i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(ll i=0; i<num; i++){ cout<<v[i]; if(i!=num-1) cout<<" ";}
cout << endl;
}
template <typename T>
void print_pairvec(const T &_pair, ll num=0){
cout << endl; for(pair<ll, int> x: _pair){ cout << x.first << " " << x.second << endl;}
}
template <typename T>
void print_vec2(const vector<vector<T>>& v){
cout << endl; cout << " ";
for(ll i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(ll i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(ll j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";
}
cout << "\x1B[0m" << endl;
}
}
int main(){
int N;
cin >> N;
vector<string> S(N);
for(int i=0; i<N; i++) cin >> S[i];
bool ans = true;
map<string, int> mp;
mp[S[0]]++;
for(int i=1; i<N; i++){
if(mp[S[i]] != 0) ans = false;
if(S[i-1].back() != S[i][0]) ans = false;
mp[S[i]]++;
}
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define mod 1000000007
#define pi 2 * acos(0.0)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rloop(i, a, b) for (int i = a; i >= b; i--)
void fun()
{
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
}
void solve()
{
int h, w;
cin >> h >> w;
vector<vector<char>> v(h, vector<char>(w));
for (auto &i : v)
for (auto &j : i)
cin >> j;
vector<vector<int>> dp(h + 1, vector<int>(w + 1, 0));
for (int i = 0; i < w; i++)
{
if (v[0][i] == '#')
break;
dp[1][i + 1] = 1;
}
for (int i = 0; i < h; i++)
{
if (v[i][0] == '#')
break;
dp[i + 1][1] = 1;
}
for (int i = 2; i <= h; i++)
{
for (int j = 2; j <= w; j++)
{
if (v[i - 1][j - 1] == '#')
continue;
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
}
}
cout << dp[h][w];
}
signed main()
{
fun();
int t = 1;
while (t--)
{
solve();
}
return 0;
}
| 0
| 21,580,729
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n);i++)
#define ll long long
#define llint long long int
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) if(ans)cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define Pint pair<int,int>
#define keta(a) fixed << setprecision(a)
constexpr auto INF = 100000000000;
constexpr auto mod = 1000000007;
struct edge { int to, cost; };
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll int c(ll int a, ll int b, ll int m) {
ll int ans = 1;
for (ll int i = 0; i < b; i++) {
ans *= a - i;
ans %= m;
}
for (ll int i = 1; i <= b; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
void dijkdtra(int s, int v, vector<int>& d, whei(edge)& G) {
priority_queue<Pint, vector<Pint>, greater<Pint>> que;
d[s] = 0;
que.push(Pint(0, s));
while (!que.empty()) {
Pint p = que.top();
que.pop();
int V = p.second;
if (d[V] < p.first)continue;
for (int i = 0; i < G[V].size(); i++) {
edge e = G[V][i];
if (d[e.to] > d[V] + e.cost) {
d[e.to] = d[V] + e.cost;
que.push(Pint(d[e.to], e.to));
}
}
}
}
int main() {
ll s;
cin >> s;
const int a = 1000000000;
ll x = (a - (s % a)) % a;
ll y = (s + x) / a;
cout << "0 0 1000000000 1 " << x << " " << y << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 2000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}
int h, w;
string s[26][26];
char ans;
int val;
int main() {
ios::sync_with_stdio ( false );
cin.tie ( 0 );
cin >> h >> w;
rep(i, 0, h) {
rep(j, 0, w) {
cin >> s[i][j];
if (s[i][j] == "snuke") {
ans = (char)('A' + j);
val = i + 1;
}
}
}
cout << ans << val << endl;
return 0;
}
| 0
| 40,614,544
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int64_t Gcd(int64_t n, int64_t m){
if(n%m==0) return m;
return Gcd(m,n%m);
}
int main(){
int64_t N,K; cin>>N>>K;
vector<int64_t> A;
rep(n,0,N) {
int64_t a; cin>>a;
A.emplace_back(a);
}
int64_t gcd=A.front(), maxA=A.front();
rep(i,1,N){
maxA=max(maxA,A.at(i));
gcd=Gcd(gcd,A.at(i));
}
string ans="IMPOSSIBLE";
if(K<=maxA && K%gcd==0) ans="POSSIBLE";
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n), y(n);
bool type;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
bool odd = (x[i] + y[i]) & 1;
if (!i) {
type = odd;
} else if (type != odd) {
cout << -1 << "\n";
return 0;
}
}
if (!type) {
for (int i = 0; i < n; ++i) {
++x[i];
}
}
vector<int> d(31);
for (int i = 0; i < 31; ++i) {
d[i] = 1 << i;
}
vector<string> ans(n, string(31, '.'));
for (int i = 0; i < n; ++i) {
for (int j = 30; ~j; --j) {
if (abs(x[i] + d[j]) < (1 << j) - abs(y[i])) {
ans[i][j] = 'L';
x[i] += d[j];
} else if (abs(x[i] - d[j]) < (1 << j) - abs(y[i])) {
ans[i][j] = 'R';
x[i] -= d[j];
} else if (abs(y[i] + d[j]) < (1 << j) - abs(x[i])) {
ans[i][j] = 'D';
y[i] += d[j];
} else {
ans[i][j] = 'U';
y[i] -= d[j];
}
}
}
if (!type) {
d.push_back(1);
for (int i = 0; i < n; ++i) {
ans[i].push_back('L');
}
}
cout << d.size() << "\n";
for (int i = 0; i < (int) d.size(); ++i) {
if (i) {
cout << " ";
}
cout << d[i];
}
cout << "\n";
for (int i = 0; i < n; ++i) {
cout << ans[i] << "\n";
}
return 0;
}
| 0
| 41,646,535
|
#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];
}
vector<int>X;
vector<int>Y;
for (int i = 0; i < N; ++i) {
if (0 == i%2) {
X.push_back(A[i]);
}
else {
Y.push_back(A[i]);
}
}
vector<int>Ans(N);
for (int i = 0;i<Y.size();++i) {
Ans[i] = Y[Y.size()-1-i];
}
for (int i = 0;i<X.size();++i) {
Ans[Y.size()+i] = X[i];
}
if (1 == N%2) {
reverse(Ans.begin(),Ans.end());
}
for (int i = 0; i < N; ++i) {
if(0 !=i){
cout << " ";
}
cout << Ans[i];
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<ll, int> P;
typedef tuple<int, int, int> T;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
template<typename T, typename U>
size_t operator()(const pair<T, U> &x) const {
size_t seed = hash<T>()(x.first);
return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);
int n;
int a[200100];
bool p[1000100];
int solve() {
map<int, int> m;
for (int i = 0; i < n; i++) m[a[i]]++;
int res = 0;
for (auto v : m) {
if (v.second == 1 && !p[v.first]) {
res++;
}
for (int i = v.first; i < 1000100; i += v.first) {
p[i] = true;
}
}
return res;
}
void input() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
}
| 0
| 75,494,188
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for(int i=0;i<n;++i)
#define rep(i, n) for(int i=1;i<=n;++i)
#define ll long long int
#define INF 1e9
#define LINF 1e18
#define MOD 1000000007
#define eps 1e-10
#define All(a) (a).begin(), (a).end()
using namespace std;
using P = pair<ll, ll>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
struct Edge {
int to;
ll weight;
Edge(int t, ll w) : to(t), weight(w) { }
};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T>
void printv(vector<T>& v) {
if (v.size() == 0) {
cout << "\n";
return;
}
Rep(i, v.size()) {
cout << v[i] << ((i + 1 < v.size()) ? ' ' : '\n');
}
}
ll N, K;
ll a[1100];
ll b[1100];
ll c[1100];
ll num[50];
int main () {
cin >> N >> K;
ll sum = 0;
rep(i, N) {
ll tmp;
cin >> tmp;
a[i] = tmp;
sum += tmp;
}
rep(i, N) {
b[i] = b[i-1] + a[i];
}
for (int i=N;i>=1;--i) {
c[i] = c[i+1] + a[i];
}
vector<ll> v;
for (int k=0;k<N;++k) {
for (int l=N+1;l>k+1;--l) {
v.push_back(sum-b[k]-c[l]);
}
}
int n = v.size();
vector<bool> ok;
ok.assign(n, true);
ll ans = 0;
for (ll s=60;s>=0;--s) {
int ct = 0;
Rep(i, n) {
bitset<59> bt(v[i]);
if (bt[s] && ok[i]) {
ct++;
}
}
if (ct >= K) {
ans += (1LL << s);
Rep(i, n) {
bitset<59> bt(v[i]);
if (!bt[s] && ok[i]) ok[i] = false;
}
}
}
cout << ans << "\n";
}
|
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
constexpr int f(int n) {
if (n % 2) return 3 * n + 1;
return n / 2;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int s;
cin >> s;
set<int> as;
int ai = s;
as.insert(ai);
for (int i = 2;; i++) {
ai = f(ai);
if (as.count(ai) > 0) {
cout << i << endl;
return 0;
}
as.insert(ai);
}
}
| 0
| 95,338,709
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int inf = 1000000007;
int main() {
int k, a, b;
cin >> k >> a >> b;
bool ok = false;
for (int i = 0; i < 5000; i++) {
if (ok) break;
if (a <= k * i && k * i <= b) ok = true;
}
if (ok)
cout << "OK" << endl;
else
cout << "NG" << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll inf = INT64_MAX / 4;
constexpr double pi = asin(1) * 2;
constexpr ll mod = 1000000007;
ll mpow(ll base, ll power) {
if (power == 0) return 1;
ll t = mpow(base, power / 2);
return (t * t * (power % 2 ? base : 1)) % mod;
}
int main() {
int n, k;
cin >> n >> k;
int m = ((n - 1) * (n - 2)) / 2;
if (k > m) {
cout << -1 << endl;
return 0;
}
vector<pair<int, int>> v;
for (int i = 0; i < n - 1; i++) {
v.emplace_back(1, i + 2);
}
int c = m - k;
for (int i = 2; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (c == 0) {
i = j = n + 1;
continue;
}
v.emplace_back(i, j);
c--;
}
}
cout << v.size() << '\n';
for(auto&e:v) cout << e.first << ' ' << e.second << '\n';
}
| 0
| 83,887,317
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
bool ok = false;
for(int i=1; i<=100; i++) {
if(a*i%b == c) ok = true;
}
cout << (ok ? "YES" : "NO") << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
int sum = accumulate(a.begin(), a.end(), 0);
int num = a.size();
int ave = sum / num;
int dist = 0;
REP(i, n) dist += pow(ave - a[i], 2);
int ave2 = sum / num + 1;
int dist2 = 0;
REP(i, n) dist2 += pow(ave2 - a[i], 2);
int ave3 = sum / num - 1;
int dist3 = 0;
REP(i, n) dist3 += pow(ave3 - a[i], 2);
cout << min({dist, dist2, dist3}) << '\n';
return 0;
}
| 0
| 44,389,956
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,diff;
cin >> a >> b >> c >> diff;
string ans= (abs(c-a) <= diff || (abs(b-a) <= diff && abs(c-b) <= diff)) ? "Yes" : "No";
cout << ans << endl;
}
|
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int MAX=2e5+5;
int main(){
int N;
cin>>N;
int k=-1;
rep1(i,500){
if((i*(i-1))/2==N)k=i;
}
if(k==-1)cout<<"No"<<endl;
else{
cout<<"Yes"<<endl;
cout<<k<<endl;
vi S[500];
int ind=1;
rep(i,k)rep(j,k)if(i<j){
S[i].push_back(ind);
S[j].push_back(ind);
ind++;
}
rep(i,k){
cout<<sz(S[i])<<" ";
rep(j,sz(S[i]))cout<<S[i][j]<<" ";
cout<<endl;
}
}
}
| 0
| 97,514,391
|
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#define mnlld -LLONG_MAX
#define mxd 2e8
#define mnd -2e8
#define pi 3.14159265359
using namespace std;
bool check(ll n, ll pos)
{
return n & (1LL << pos);
}
ll Set(ll n, ll pos)
{
return n = n | (1LL << pos);
}
ll arr[200005];
int main()
{
ll i, j, k, l, m, n, o, r, q;
ll testcase;
ll input, flag, tag, ans;
while(cin >> n)
{
ll ans = 0;
for(ll i = 1; i <= n; i++) cin >> arr[i];
for(ll i = 2; i <= n; i++)
{
ans += max(0LL, arr[i - 1] - arr[i]);
arr[i] = max(arr[i], arr[i - 1]);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i,s,e) for (int64_t i=s; i<e; i++)
#define pi 3.14159265358979323846264338327950L
using namespace std;
int main() {
int X, ans=0;
cin >> X;
if (X>=2000) {
ans=1;
}
else {
rep(h,0,20) {
rep(i,0,20) {
rep(j,0,20) {
rep(k,0,20) {
rep(l,0,20) {
rep(m,0,20) {
if (100*h+101*i+102*j+103*k+104*l+105*m==X) {
ans=1;
}
}
}
}
}
}
}
}
cout << ans << endl;
}
| 0
| 73,187,863
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
char s1,s2;
cin>>s1>>s2;
if((s1-'A')>(s2-'A'))cout<<">"<<endl;
else if((s1-'A')<(s2-'A'))cout<<"<"<<endl;
else cout<<"="<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main(){
int n;
cin >> n;
int s = 0, g = n - 1;
string info;
cout << n - 1 << "\n";
cout.flush();
cin >> info;
if(info == "Vacant"){
return 0;
}
while(true){
int mid = (s + g) / 2;
cout << mid << "\n";
cout.flush();
string res;
cin >> res;
if(res == "Vacant"){
return 0;
}
if(res == info && mid % 2 == (n - 1) % 2){
g = mid;
}else if(res != info && mid % 2 != (n - 1) % 2){
g = mid;
}else{
s = mid;
}
}
}
| 0
| 87,849,868
|
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b) a=b; return a<b; }
template<typename T> inline bool chmin(T &a, T b){ if(b<a) a=b; return b<a; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill((T*)array, (T*)(array+N), val);}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
class debug
{
public:
template<typename T> void vdeb(T vec);
template<typename T1, typename T2> void adeb(T1 *arr, T2 n);
template<typename T> void mdeb(T mp);
};
#endif
template<typename T> void debug::vdeb(T vec)
{
cout << "#vector set debug" << endl;
for(auto vv : vec) cout << vv << " ";
cout << endl;
}
template<typename T1, typename T2> void debug::adeb(T1 *arr, T2 n)
{
cout << "#adebug" << endl;
for(int i=0; i<=n; i++) cout << arr[i] << " ";
cout << endl;
}
template<typename T> void debug::mdeb(T mp)
{
cout << "#map pair debug" << endl;
for(auto const& m : mp) cout << m.first sp m.second << endl;
}
debug dbg;
class ABetweenTwoIntegers {
public:
void solve(std::istream& in, std::ostream& out)
{
int a, b, c;
in >> a >> b >> c;
ans(a<=c && c<=b, out);
}
};
int main() {
ABetweenTwoIntegers solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
ll sigma(ll n, ll m)
{
return ((n + m) * (m - n + 1) * 0.5);
}
void Main()
{
ll h, w; cin >> h >> w;
vvc s(h + 2, vc(w + 2, '.'));
for(ll i = 1;i <= h;i++)
{
for(ll j = 1;j <= w;j++)
{
cin >> s[i][j];
}
}
for(ll i = 1;i <= h;i++)
{
for(ll j = 1;j <= w;j++)
{
if(s[i][j] == '#'&&s[i + 1][j] == '.'&&s[i - 1][j] == '.'&&s[i][j + 1] == '.'&&s[i][j - 1] == '.')
fin("No");
}
}
fin("Yes");
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
}
| 0
| 27,518,370
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
const double PI=3.14159265358979323846;
using namespace std;
vector<int> dy={1,0,-1,0};
vector<int> dx={0,1,0,-1};
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
double dist(pair<double,double> a, pair<double,double> b) {
double ax,ay,bx,by;
tie(ax,ay)=a;
tie(bx,by)=b;
return sqrt((ax-bx)*(ax-bx)+(ay-by)*(ay-by));
}
int main() {
int n;
cin>>n;
vector<pair<double,double>> xy(n);
rep(i,n) {
double x,y;
cin>>x>>y;
xy[i]={x,y};
}
sort(all(xy), [](const auto &p1, const auto &p2) {
return atan2l(p1.second, p1.first) < atan2l(p2.second, p2.first);
});
rep(i,n) xy.push_back(xy[i]);
double ans=0;
rep(left,n) {
FOR(k,1,n) {
double x=0,y=0;
rep(i,k) {
x+=xy[left+i].first;
y+=xy[left+i].second;
}
ans=max(ans,dist({0,0},{x,y}));
}
}
cout<<fixed<<setprecision(12)<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, H;
cin >> N >> H;
vector<ll> a(N);
vector<ll> b(N);
for(int i = 0; i < N; i++) {
cin >> a[i] >> b[i];
}
ll am = *max_element(a.begin(), a.end());
sort(b.begin(), b.end(), greater<ll>());
ll ans = 0;
for(int i = 0; i < N; i++) {
if(b[i] <= am) break;
H -= b[i];
ans++;
if(H <= 0) {
cout << ans << endl;
return 0;
}
}
if(H % am == 0) {
ans += H / am;
} else {
ans += H / am + 1LL;
}
cout << ans << endl;
}
| 0
| 37,203,386
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int,int> P;
const int inf=1000000007;
const ll mod=1000000007;
const double PI=3.14159265358979323846;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int main(){
int N,K;
cin >> N >> K;
ll a[N];
rep(i,N) cin >> a[i];
ll ans = 1000000000000;
for(int bit=0; bit < (1<<N); bit++) {
vector<bool> ch;
int num = 0;
ll pre = 0;
ll tmp = 0;
rep(i,N) {
if(bit & (1<<i)) {
ch.push_back(true);
num++;
}
else ch.push_back(false);
}
if(num<K) continue;
rep(i,N) {
if(ch[i]) {
if(pre >= a[i]) {
pre++;
tmp += pre - a[i];
}
}
pre = max(pre,a[i]);
}
ans = min(ans,tmp);
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=100000+10;
int h[maxn],go[maxn*2],nxt[maxn*2];
int i,j,k,l,t,n,m,tot;
void add(int x,int y){
go[++tot]=y;
nxt[tot]=h[x];
h[x]=tot;
}
int dfs(int x,int y){
int l=0,t=h[x];
while (t){
if (go[t]!=y) l^=dfs(go[t],x)+1;
t=nxt[t];
}
return l;
}
int main(){
scanf("%d",&n);
fo(i,1,n-1){
scanf("%d%d",&j,&k);
add(j,k);add(k,j);
}
if (dfs(1,0)) printf("Alice\n");else printf("Bob\n");
}
| 0
| 99,649,863
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
string alp="abcdefghijklmnopqrstuvwxyz";
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll hpow(ll x,ll y){
ll ans=1;
ll i=x;
if(y==0)return 1;
while(y>0){
if(y%2==1){
ans=(ans*i)%i_7;
}
i=(i*i)%i_7;
y=y/2;
}
return ans;
}
int main(){
string l;cin>>l;
ll ans=1;
ll sum=0;
ll ls=l.size();
rep(i,0,ls-1){
if(l[i]=='1'){
sum=(sum+(ans*(hpow(3,ls-i-1)))%i_7)%i_7;
ans*=2;
ans=ans%i_7;
}
}
cout<<(sum+ans)%i_7<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x , y , z , k;
cin>>x>>y>>z>>k;
ll a[x], b[y], c[z];
for(int i = 0; i < x; i++){
cin>>a[i];
}
for(int i = 0; i < y; i++){
cin>>b[i];
}
for(int i = 0; i < z; i++){
cin>>c[i];
}
sort(a , a + x , greater<ll>());
sort(b , b + y , greater<ll>());
sort(c , c + z , greater<ll>());
vector<ll> ans;
for(int i = 0; i < x; i++){
for(int j = 0; j < y; j++){
for(int l = 0; l < z; l++){
if((i + 1)*(j + 1)*(l + 1) <= k){
ll sum = a[i] + b[j] + c[l];
ans.pb(sum);
}else{
break;
}
}
}
}
sort(all(ans) , greater<ll>());
for(auto it : ans){
if(k == 0){
break;
}
cout<<it<<"\n";
k--;
}
}
| 0
| 100,136,454
|
#include<iostream>
#include<cmath>
using namespace std;
#define EPS 1e-10
double x[4],y[4];
double det(){
double x1,x2,y1,y2;
x1 = x[0] - x[1];
y1 = y[0] - y[1];
x2 = x[2] - x[3];
y2 = y[2] - y[3];
return x1 * y2 - y1 * x2;
}
int main(void){
int n;
cin >> n;
while(n--){
for(int i = 0 ; i < 4 ; i ++)cin>>x[i]>>y[i];
cout<<(fabs(det())<EPS?"YES":"NO")<<endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
template<typename T>
bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string S=in<string>(),T=in<string>();
int SN=S.size(),TN=T.size();
vector<vector<ll>> dp(SN+1,vector<ll>(TN+1,1LL<<60));
REP(i,SN+1) dp[i][0]=i;
REP(i,TN+1) dp[0][i]=i;
REP(i,SN){
REP(j,TN){
int cost = (S[i]==T[j]) ? 0 : 1;
chmin(dp[i+1][j+1],dp[i][j]+cost);
chmin(dp[i+1][j+1],dp[i+1][j]+1);
chmin(dp[i+1][j+1],dp[i][j+1]+1);
}
}
out(dp[SN][TN]);
return 0;
}
| 0
| 88,885,890
|
#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 n;
cin>>n;
vector<int> p(n);
rep(i,n){
cin>>p[i];
}
int x=1;
int ans=n;
rep(i,n){
if(p[i]==x) {
ans--;
x++;
}
}
if(ans==n) cout << -1 << endl;
else cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl "\n"
int main()
{
faster;
ll n;
cin >> n;
vector<ll> a(n);
ll balance = 1000,stock = 0;
for(auto &x: a) cin >> x;
for(ll i = 0; i < n; i++){
if(i != n-1 && a[i] < a[i+1]){
ll temp = balance/a[i];
balance %= a[i];
stock += temp;
}
else if(i == n-1 || a[i] > a[i+1]){
balance += (stock * a[i]);
stock = 0;
}
}
cout << balance << endl;
return 0;
}
| 0
| 46,637,576
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define re register
#define ll long long
inline int gi()
{
int f=1,sum=0;char ch=getchar();
while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9'){sum=(sum<<3)+(sum<<1)+ch-'0';ch=getchar();}
return f*sum;
}
typedef pair<ll,int>pli;
typedef pair<int,int>pii;
#define mp make_pair
const int N=100010;
ll d[N];int n,siz[N];vector<pii>ans;pli p[N];
int main()
{
n=gi();
for(int i=1;i<=n;i++)scanf("%lld",&d[i]),p[i].first=d[i],p[i].second=i,siz[i]=1;
sort(p+1,p+n+1);ll dis=0;
for(int i=n;i>1;i--)
{
ll nd=p[i].first-n+(siz[p[i].second]<<1);
int pos=lower_bound(p+1,p+n+1,mp(nd,0))-p;
if(p[pos].first!=nd)return puts("-1"),0;
int u=p[i].second,v=p[pos].second;
ans.push_back(mp(u,v));siz[v]+=siz[u];
dis+=siz[u];
}
if(dis!=p[1].first)return puts("-1"),0;
for(pii now:ans)printf("%d %d\n",now.first,now.second);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
vector<vector<int> > g(n);
for(int i = 0;i < n-1;i++){
int x, y;
scanf("%d %d", &x, &y);
x -= 1;
y -= 1;
g[x].push_back(y);
g[y].push_back(x);
}
vector<int> tmp(n);
function<int (int, int)> go = [&](int i, int par) {
int xx = 0;
for (int j : g[i]) if (j != par) {
xx ^= go(j, i) + 1;
}
return xx;
};
int ret = go(0, -1);
if(ret)
printf("Alice\n");
else
printf("Bob\n");
return 0;
}
| 0
| 42,803,675
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
#define endl '\n'
#define PB push_back
#define F first
#define S second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)x.size()
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define MOD 1000000007
#define mem(a,b) memset(a, b, sizeof(a) )
#define sqr(a) ((a) * (a))
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(0); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
ll gcd ( ll a, ll b ) { return __gcd ( a, b ); }
ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }
int dx[] = { 0, 0, +1, -1, -1 +1, -1, +1 };
int dy[] = { +1, -1, 0, 0, -1, +1, +1, -1 };
int stoi ( char c ) {return c-'0';}
int main()
{
optimize();
ll a;
cin >> a;
string s;
cin >> s;
ll b = stoi ( s[0] ) * 10;
b += stoi ( s[2] );
b *= 10;
b += ( stoi ( s[3] ) );
a *= b;
a /= 100;
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m,x;
cin>>n>>m>>x;
int c[n],a[n][m];
rep(i,n){
cin>>c[i];
rep(j,m) cin>>a[i][j];
}
ll ans=123456789;
rep(bi,(1<<n)){
vector<int> level(m);
ll cost=0;
rep(i,n){
if((bi>>i)&1){
cost+=c[i];
rep(j,m) level[j]+=a[i][j];
}
}
bool flag=true;
rep(j,m) if(level[j]<x) flag=false;
if(flag) ans=min(ans,cost);
}
if(ans==123456789) cout<<-1;
else cout<<ans;
}
| 0
| 69,225,988
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
template<typename Monoid>
struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while(sz < n) sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) {
seg[k + sz] = x;
}
void build() {
for(int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while(k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if(a & 1) L = f(L, seg[a++]);
if(b & 1) R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const {
return seg[k + sz];
}
template< typename C >
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while(a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if(check(nxt)) a = 2 * a + type;
else M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template<typename C>
int find_first(int a, const C &check) {
Monoid L = M1;
if(a <= 0) {
if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if(a & 1) {
Monoid nxt = f(L, seg[a]);
if(check(nxt)) return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template<typename C>
int find_last(int b, const C &check) {
Monoid R = M1;
if(b >= sz) {
if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for(b += sz; a < b; a >>= 1, b >>= 1) {
if(b & 1) {
Monoid nxt = f(seg[--b], R);
if(check(nxt)) return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
REP(i, N) cin >> A[i];
SegmentTree<int> sum(N, [](int a, int b) { return a+b; }, 0);
SegmentTree<int> seg(N, [](int a, int b) { return a+b; }, 0);
REP(i, N) sum.set(i, A[i]);
REP(i, N) seg.set(i, max(0ll, A[i]));
sum.build();
seg.build();
int ans = 0;
REP(i, N-K+1){
chmax(ans, seg.query(0, i)+max(0ll, sum.query(i, i+K))+seg.query(i+K, N+1));
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using namespace std;
int main()
{
string s;
long long k;
cin >> s;
cin >> k;
long long ans = 0;
int check = 1;
for (long long i = 0;i < s.size()-1;i++){
if (s[i] != s[i+1]) {
check = 0;
break;
}
}
if (check){
ans = (s.size()*k)/2;
}
else {
long long t = 1;
for (long long i = 0;i < s.size()-1;i++){
if (s[i] == s[i+1]){
t++;
}
else {
ans += t/2;
t = 1;
}
}
ans += t/2;
if (s[0] == s[s.size()-1]){
long long sta = 1;
long long end = 1;
for (long long i = 0;i < s.size()-1;i++){
if (s[i] != s[i+1]) break;
sta++;
}
for (long long i = s.size()-1;i >= 1;i--){
if (s[i] != s[i-1]) break;
end++;
}
ans = ans*k-(sta/2+end/2-(sta+end)/2)*(k-1);
}
else {
ans *= k;
}
}
cout << ans << endl;
}
| 0
| 55,706,554
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e5+7;
int n,k;
ll sum[MAXN],sum2[MAXN],a[MAXN],ans;
int main() {
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) {
scanf("%lld",&a[i]);
if(a[i]>0) sum[i]+=a[i];
}
for(int i=1;i<=n;i++) {
sum[i]+=sum[i-1];
sum2[i]=sum2[i-1]+a[i];
}
for(int i=k;i<=n;i++)
ans=max(ans,sum[n]-sum[i]+sum[i-k]+max(0ll,sum2[i]-sum2[i-k]));
printf("%lld",ans);
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define NIL -1
using namespace std;
int count(const string& X, int i, const string Y, int j,
vector<vector<int> >& MEMO){
if (i >= X.size() || j >= Y.size()) return 0;
if (MEMO[i][j] != NIL) return MEMO[i][j];
int next_X = count(X, i + 1, Y, j, MEMO);
int j_next = Y.find(X[i], j);
if (j_next == string::npos) return MEMO[i][j] = next_X;
int saiyou = count(X, i + 1, Y, j_next + 1, MEMO) + 1;
return MEMO[i][j] = max(saiyou, next_X);
}
int main(){
int q;
cin >> q;
for (int i = 0; i < q; i++) {
string X, Y;
cin >> X >> Y;
vector<vector<int> > MEMO(X.size(), vector<int>(Y.size(), NIL));
cout << count(X, 0, Y, 0, MEMO) << endl;
}
return 0;
}
| 0
| 20,465,396
|
#include <bits/stdc++.h>
using namespace std;
int lr(char a){
if(a == 'q') return 0;
else if(a == 'w') return 0;
else if(a == 'e') return 0;
else if(a == 'r') return 0;
else if(a == 't') return 0;
else if(a == 'a') return 0;
else if(a == 's') return 0;
else if(a == 'd') return 0;
else if(a == 'f') return 0;
else if(a == 'g') return 0;
else if(a == 'z') return 0;
else if(a == 'x') return 0;
else if(a == 'c') return 0;
else if(a == 'v') return 0;
else if(a == 'b') return 0;
else return 1;
}
int main(){
while(1){
string s;
int cnt = 0;
cin >> s;
if(s == "#") break;
int len = s.size();
int past = lr(s[0]);
for(int i = 1; i < len; i++){
if(past != lr(s[i])) cnt += 1;
past = lr(s[i]);
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(void){
int n,d;
cin>>n>>d;
vector<vector<int>> vec(n+1, vector<int>(d+1));
for(int i=1;i<=n;i++){
for(int j=1;j<=d;j++){
cin>>vec[i][j];
}
}
int answer=0;
for(int i=1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
long double ans=0;
for(int k=1;k<=d;k++){
ans+=pow((vec[i][k]-vec[j][k]),2);
}
ans= sqrt(ans);
if(ans==(int)ans)
answer++;
}
}
cout<<answer;
}
| 0
| 31,384,551
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int cnt[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cnt[x]++;
}
vector<int> c, p;
for (int i = 1; i <= n; i++) {
if (cnt[i])
c.push_back(cnt[i]);
}
sort(c.begin(), c.end());
p.push_back(c[0]);
int sz = c.size();
for (int i = 1; i < sz; i++) {
p.push_back(p.back() + c[i]);
}
for (int i = 1; i <= n; i++) {
int l = 0, r = n / i;
while (l < r) {
int mid = (l + r) / 2 + 1;
int id = lower_bound(c.begin(), c.end(), mid) - c.begin();
int t = c.size() - id;
if (id != 0)
t += p[id - 1] / mid;
if (t >= i)
l = mid;
else
r = mid - 1;
}
cout << l << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,int>
#define pdd pair<double,double>
#define pll pair<ll,ll>
#define sz(x) ((long long)x.size())
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define frev(a,b,c) for(int a=c; a>=b; a--)
#define rep(a,b,c) for(int a=b; a<c; a++)
#define trav(a,x) for(auto &a:x)
#define all(con) con.begin(),con.end()
#define deb(x) cout << x << endl
#define done(x) {cout << x << endl;return;}
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<int, int>> vpii;
typedef map<int, int> mii;
typedef set<int> si;
typedef set<pair<int,int>> spii;
typedef queue<int> qi;
const int N = 2e5 + 5;
void solve() {
int r,c,k,ans=0;
cin>>r>>c>>k;
vvi a(r,vi(c));
rep(i,0,r)
rep(j,0,c){
char ch;
cin>>ch;
a[i][j]=ch=='#';
}
rep(m1,0,1<<r){
rep(m2,0,1<<c){
int cnt = 0;
rep(i,0,r)
rep(j,0,c)
cnt+=a[i][j]&&((m1>>i)&1)&&((m2>>j)&1);
ans+=cnt==k;
}
}
cout<<ans<<endl;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
int t = 1;
while (t--)
solve();
#ifdef aa
cout << endl << endl << endl << endl << "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
int powm(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (res*a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int divide(int a, int b) {
return (a % mod) * powm(b, mod - 2) % mod;
}
int norm(int a) {
while (a >= mod) a -= mod;
while (a < 0) a += mod;
return a;
}
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
| 0
| 38,038,351
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
const int MAX=1e5+5;
int n,f[MAX];
ii a[MAX];
vector<iii> V;
int32_t main() {
cin>>n;
for(int i=1;i<=n;i++) {
cin>>a[i].first;
a[i].second=i;
}
sort(a+1,a+n+1);
V.push_back({a[1],1});
for(int i=2;i<=n;i++)
if(a[i].first>a[i-1].first)
V.push_back({a[i],1});
else
V.back().second++;
int minId=1e9,cnt=0;
for(int i=V.size()-1;i>=0;i--) {
minId=min(minId,V[i].first.second);
cnt+=V[i].second;
f[minId]+=(V[i].first.first-(i==0?0:V[i-1].first.first))*cnt;
}
for(int i=1;i<=n;i++)
cout<<f[i]<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
int right = 0;
int sum = 0;
for (int left = 0; left < n; ++left) {
while (right < n && (sum ^ a[right]) == (sum + a[right])){
sum += a[right];
++right;
}
ans += right - left;
if (left == right) ++right;
else sum -= a[left];
}
cout << ans << endl;
return 0;
}
| 0
| 92,046,926
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
int main() {
ll m = INF;
int n;
cin >> n;
vector<int> xs(n);
rep(i, n) cin >> xs[i];
for (int i = 1; i <= 100; i++) {
ll sum = 0;
rep(j, n) { sum += (xs[j] - i) * (xs[j] - i); }
m = min(m, sum);
}
cout << m << endl;
return 0;
}
|
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
#define INF 100000000
#define MAXN 10010
typedef long long ll;
int n, q;
int par[MAXN], rank[MAXN];
void init(int s) {
for (int i = 0; i < s; i++) {
par[i] = i;
rank[i] = 0;
}
}
int find(int x) {
if (x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x); y = find(y);
if (x == y) return;
if (rank[x] < rank[y]) par[x] = y;
else {
par[y] = x;
if (rank[x] == rank[y]) rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
int main(void) {
cin >> n >> q;
init(n);
for (int i = 0; i < q; i++) {
int com, x, y;
cin >> com >> x >> y;
if (com == 0) {
unite(x, y);
} else {
if (same(x, y)) cout << 1 << endl;
else cout << 0 << endl;
}
}
return 0;
}
| 0
| 8,933,806
|
#include <iostream>
#include <stdio.h>
typedef long long ll;
using namespace std;
int main() {
ll K, A, B;
cin >> K >> A >> B;
ll res = 0;
if (A >= B - 2 || A + 1 > K) {
res = K + 1;
} else {
K -= A + 1;
ll t = K / 2;
res = (t + 1) * B - t * A + K % 2;
}
printf("%lld\n", res);
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> b(n);
for(int i = 1 ; i<=n;++i){
b[i-1]=a[i-1]-i;
}
sort(b.begin(),b.end());
ll mean;
if(b.size()%2==1) mean = (b.size()-1)/2;
else mean = b.size()/2;
ll ans = 1<<20;
ll count = 0;
rep(i,n){
count+=abs(b[i]-b[mean]);
}
cout << count << endl;
}
| 0
| 16,592,286
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
string S;
cin >> S;
int year = 0, month = 0, day = 0;
for (int i = 0; i < 4; i++) {
year += (S[i] - '0') * pow(10, 3 - i);
}
for (int i = 5; i < 7; i++) {
month += (S[i] - '0') * pow(10, 6 - i);
}
string ans = "TBD";
if (year < 2019) ans = "Heisei";
else if (year == 2019) {
if (month <= 4) ans = "Heisei";
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int size,k;cin>>size;string s;
cin>>s>>k;
for(int i=0;i<size;i++)
{
if(!(s[i]==s[k-1]))
s[i]='*';
}cout<<s<<endl;
return 0;
}
| 0
| 47,745,681
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.