code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include <iostream>
#include<map>
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main()
{
int K,X;
cin >> K >> X;
if(K*500 >= X) fin("Yes");
else fin("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
vector<int> h(N);
REP(i, N) cin >> h[i];
ll ans = 0;
for (int num = 1; num < 101; num++) {
bool pooring = false;
REP(i,N){
if(num<=h[i]){
pooring = true;
}else{
if(pooring){
pooring = false;
ans++;
}
}
}
if (pooring) ans++;
}
cout << ans << endl;
}
| 0
| 84,313,115
|
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
ll N, K, S;
cin >> N >> K >> S;
vector<ll> A(N);
ll count = 0;
rep(i, N) {
if (count < K) {
cout << S << " ";
}
else if(S != pow(10, 9)){
cout << S + 1 << " ";
}
else {
cout << S - 1 << " ";
}
count++;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
const ll inf = 1000000001;
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T &t)
{
t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &... rest)
{
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &... rest)
{
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
ll gcd(ll a, ll b)
{
while (b)
{
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b)
{
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.end(), x.begin()
#define range(a) a.begin(), a.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
#define sz(x) (int)(x).size()
int mx = -100000;
int mn = 1001001001;
int main()
{
VAR(int, N, M);
vector<pair<int, int>> A(N);
for (int i = 0; i < N; ++i)
{
cin >> A[i].first >> A[i].second;
}
sort(ALL(A));
ll ans = 0;
rep(i, N)
{
int use = min(M, A[i].second);
M -= use;
ans += (long long)(use)*A[i].first;
}
pr(ans);
}
| 0
| 19,142,141
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool find(string s, string p)
{
for(int i = 0; i < s.size(); ++i){
for(int j = 0; j < p.size(); ++j){
if(i+j >= s.size() || s[i+j] != p[j]) break;
if(j == p.size() - 1) return true;
}
}
return false;
}
int main()
{
string s;
string p;
cin >> s >> p;
s += s;
if(find(s, p) == false){
cout << "No" << endl;
}else{
cout << "Yes" << endl;
}
return 0;
}
|
#include<stdio.h>
void right_triangle(int x, int y, int z);
int main(void)
{
int n;
scanf("%d", &n);
int i = 0;
int x, y, z;
while (i < n) {
scanf("%d %d %d", &x, &y, &z);
right_triangle(x, y, z);
i++;
}
return 0;
}
void right_triangle(int x, int y, int z)
{
int i, j, k;
i = x * x;
j = y * y;
k = z * z;
if(i == j + k || j == k + i || k == i + j) {
printf("YES\n");
} else {
printf("NO\n");
}
}
| 0
| 84,177,851
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main(){
int H, W, M;
cin >> H >> W >> M;
vector<int> Hi(H, 0);
vector<int> Wi(W, 0);
set<pair<int,int>> bom;
for(int i = 0; i<M; i++){
int h,w;
cin >> h >> w;
Hi[h-1]++;
Wi[w-1]++;
bom.insert(make_pair(h-1,w-1));
}
int max_h = 0;
int max_w = 0;
for(int i = 0; i<H; i++){
max_h = max(max_h, Hi[i]);
}
for(int i = 0; i<W; i++){
max_w = max(max_w, Wi[i]);
}
vector<int> X(0);
vector<int> Y(0);
for(int i = 0; i<H; i++){
if(Hi[i] == max_h){
X.push_back(i);
}
}
for(int i = 0; i<W; i++){
if(Wi[i] == max_w){
Y.push_back(i);
}
}
for(auto p: X){
for(auto q: Y){
if(bom.find(make_pair(p,q))==bom.end()){
cout << max_h+max_w << endl;
return 0;
}
}
}
cout << max_h+max_w-1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int phi;
cin >> phi;
for (int i = 1; i <= 360; ++i) {
if ((i * phi) % 360 == 0) {
cout << i << "\n";
break;
}
}
return 0;
}
| 0
| 93,207,451
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF (1 << 30)
#define REP(i, m, n) for(int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0, cnt = 1;
REP(i, 1, n) {
if(a[i] == a[i-1]) cnt++;
else {
ans += cnt/2;
cnt = 1;
}
}
ans += cnt/2;
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i,k,n) for (int i = k; i < (int)(n); i++)
#define repd(i,n) for (int i = n-1; i >= 0; i--)
#define rrepd(i,k,n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define F first
#define S second
#define PB push_back
#define MP make_pair
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using P = pair<int,int>;
using Pll = pair<ll, ll>;
const ll mod = 1000000007;
const ll inf = 1000000000000;
int main() {
VVi v(3,Vi(3));
VVi whe(100,Vi(2,-1));
VVb bingo(3,Vb(3,0));
rep(i,3)rep(j,3){
int x;
cin >> x;
whe[x-1][0]=i;
whe[x-1][1]=j;
}
int n;
cin >> n;
rep(i,n){
int x;
cin >> x;
x--;
if(whe[x][0]==-1) continue;
int a=whe[x][0],b=whe[x][1];
bingo[a][b]=1;
}
bool ok=0;
rep(i,3){
bool tate=1;
rep(j,3){
if(bingo[i][j]==0) tate=0;
}
if(tate) ok=1;
}
rep(i,3){
bool tate=1;
rep(j,3){
if(bingo[j][i]==0) tate=0;
}
if(tate) ok=1;
}
if(bingo[0][0]&&bingo[1][1]&&bingo[2][2]) ok=1;
if(bingo[0][2]&&bingo[1][1]&&bingo[2][0]) ok=1;
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 44,886,176
|
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9+7;
const ll LINF = 1LL<<60;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
ll n, m;
cin >> n >> m;
ll sum = 0;
sum += min(n, m / 2);
if (m - sum * 2 > 0) {
sum += (m - sum * 2) / 4;
}
cout << sum << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
int getMaxKByO(const vector<int>& counts, const vector<int>& sums, int O) {
auto pos = lower_bound(counts.begin(), counts.end(), O);
int pos_idx = pos - counts.begin();
if (pos_idx == 0) {
return counts.size();
} else {
return counts.size() - pos_idx + sums[pos_idx - 1] / O;
}
}
int getMaxO(const vector<int>& counts, const vector<int>& sums, int N, int K) {
int lo_o = 0;
int hi_o = N / K;
if (getMaxKByO(counts, sums, hi_o) >= K) {
return hi_o;
}
while (lo_o + 1 < hi_o) {
int mid_o = (lo_o + hi_o) / 2;
if (getMaxKByO(counts, sums, mid_o) >= K) {
lo_o = mid_o;
} else {
hi_o = mid_o;
}
}
return lo_o;
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
unordered_map<int, int> num_count;
int max_count = 0;
for (int num : A) {
num_count[num] += 1;
max_count = max(max_count, num_count[num]);
}
vector<int> counts;
counts.reserve(num_count.size());
for (auto it = num_count.begin(); it != num_count.end(); ++it) {
counts.push_back(it->second);
}
sort(counts.begin(), counts.end());
vector<int> sums(counts.size());
for (int i = 0; i < sums.size(); ++i) {
sums[i] = i == 0 ? counts[i] : counts[i] + sums[i - 1];
}
for (int K = 1; K <= N; ++K) {
cout << getMaxO(counts, sums, N, K) << endl;
}
}
| 0
| 43,173,946
|
#include<stdio.h>
int main(void){
int i;
for(i=1;i<10;i++){
printf("%dx1=%d\n",i,i*1);
printf("%dx2=%d\n",i,i*2);
printf("%dx3=%d\n",i,i*3);
printf("%dx4=%d\n",i,i*4);
printf("%dx5=%d\n",i,i*5);
printf("%dx6=%d\n",i,i*6);
printf("%dx7=%d\n",i,i*7);
printf("%dx8=%d\n",i,i*8);
printf("%dx9=%d\n",i,i*9);
}
return 0;
}
|
#pragma region
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<cstring>
#include<string>
typedef long long ll;
template <typename T>void read(T &x){x=0;char ch=getchar();ll f=1;while(!isdigit(ch)){if(ch=='-')f*=-1;ch=getchar();}while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}x*=f;}
#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
#pragma endregion
int main() {
IO;
int n, m;
cin >> n >> m;
if (n&1) {
for (int i = 1; i <= m;++i)
cout << i << " " << n - i << endl;
}else {
for (int i = 1; i <= m;++i) {
if (i<=n/4)
cout << i << " " << n - i + 1 << endl;
else
cout << i << " " << n - i << endl;
}
}
}
| 0
| 44,904,016
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
#define scl1(a) scanf("%lld", &a)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a) printf("%lld\n", a)
#define prl2(a, b) printf("%lld %lld\n", a, b)
#define ssl1(s) scanf(" %[^\n]", s)
#define scd1(a) scanf("%lf", &a)
#define scd2(a, b) scanf("%lf %lf", &a, &b)
#define prd(a) printf("%lf\n", a)
#define prld(a) printf("%Lf\n", a)
#define prcase(cs) printf("Case %lld: ", cs)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cot1(a) cout << a << "\n"
#define cot2(a, b) cout << a << " " << b << "\n"
#define cot3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline cout << "\n"
#define cotminus cout << "-1\n"
#define cot0 cout << "0\n"
#define cotyes cout << "YES\n"
#define cotno cout << "NO\n"
#define cotcase(cs) cout << "Case " << cs << ": "
#define reversed(s) reverse(s.begin(), s.end())
#define asort(s) sort(s.begin(), s.end())
#define dsort(s) sort(s.rbegin(), s.rend())
#define all(s) s.begin(), s.end()
#define uniq(s) s.resize(distance(s.begin(),unique(s.begin(), s.end())))
#define found(s, x) (s.find(x) != s.end())
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define fora(i, a, b) for (i = a; i <= b; i++)
#define forb(i, b, a) for (i = b; i >= a; i--)
#define fori(it, s) for(auto it = s.begin(); it != s.end(); it++)
#define FR ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
#define pi acos(-1)
const ll INF = LLONG_MAX;
const ll SZ = 4e5+5;
const ll mod = 1e9+7;
ll n, k;
ll a[SZ];
ll md[SZ];
ll b[SZ];
unordered_map <ll, ll> m;
int main() {
ll cs = 0, tc = 1, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
string s, s1, s2;
cin2(n, k);
for1(i, n) {
cin1(a[i]);
md[i] = (md[i-1] + a[i]) % k;
}
m[0] = 1;
for1(i, n) {
j = i-k;
if(j >= 0) m[b[j]]--;
b[i] = ((md[i] - i)%k + k) % k;
ans += m[b[i]];
m[b[i]]++;
}
cot1(ans);
return 0;
}
|
#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 fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main(){
ll n,m;cin>>n>>m;
ll s[n+1],t[m+1];rep(i,1,n)cin>>s[i];
rep(i,1,m)cin>>t[i];
ll dp[n+1][m+1];
rep(i,0,n){
dp[i][0]=1;
}
rep(i,0,m){
dp[0][i]=1;
}
rep(i,0,n-1){
rep(j,0,m-1){
if(s[i+1]!=t[j+1]){
dp[i+1][j+1]=((dp[i+1][j]+dp[i][j+1]-dp[i][j])%i_7+i_7)%i_7;
}else{
dp[i+1][j+1]=(dp[i+1][j]+dp[i][j+1])%i_7;
}
}
}
cout<<dp[n][m]<<endl;
return 0;
}
| 0
| 21,426,916
|
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#define LL long long
#define ull unsigned long long
#define PI acos(-1.0)
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pLL pair<LL,LL>
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define SQR(a) ((a)*(a))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))
#define vi vector <int>
#define vL vector <LL>
#define LB(a,x) (lower_bound(all(a),x)-a.begin())
#define UB(a,x) (upper_bound(all(a),x)-a.begin())
#define prec(n) fixed << setprecision(n)
#define MEM(a,x) memset(a,x,sizeof(a))
#define SORT(v) sort(v.begin(),v.end())
#define REV(v) reverse(v.begin(),v.end())
#define Unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,b) for(int i=0;i<b;i++)
#define IT(it,x) for(it=x.begin();it!=x.end();it++)
int main()
{
int n,k;
cin>>n>>k;
int mp[n+1];
MEM(mp,0);
for(int i=0;i<k;i++)
{
int p;
cin>>p;
for(int j=0;j<p;j++)
{
int x;
cin>>x;
mp[x]++;
}
}
int cnt=0;
for(int i=1;i<=n;i++)
{
if(mp[i]==0)cnt++;
}
cout<<cnt;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int M = 8000;
string s;
int X, Y;
vector<int> A[2];
int dp[2][16001];
int tmp[16001];
void solve(){
for(int idx=0;idx<2;idx++){
dp[idx][M] = 1;
for(int i=0;i<(int)A[idx].size();i++){
int d = A[idx][i];
memset( tmp, 0, sizeof(tmp) );
for(int j=0;j<=16000;j++){
if( dp[idx][j] ){
if( !( idx == 0 && i == 0 ) && j - d >= 0 ) tmp[j-d] = 1;
if( j + d <= 16000 ) tmp[j+d] = 1;
}
}
for(int j=0;j<=16000;j++) dp[idx][j] = tmp[j];
}
}
if( dp[0][X] && dp[1][Y] ) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
signed main(){
cin>>s;
cin>>X>>Y;
X += M;
Y += M;
int cnt = 0, idx = 0;
s += 'T';
for(int i=0;i<(int)s.size();i++){
if( s[i] == 'F' ) cnt++;
else{
A[idx].push_back( cnt );
cnt = 0;
idx = !idx;
}
}
solve();
return 0;
}
| 0
| 82,906,308
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
string L;
cin >> L;
ll n = L.size();
vector<ll> dp1(n + 1);
vector<ll> dp2(n + 1);
dp2[0] = 1;
for (ll i = 0; i < n; i++) {
if (L[i] == '0') {
dp1[i + 1] = dp1[i] * 3;
dp2[i + 1] = dp2[i] * 1;
} else {
dp1[i + 1] = dp1[i] * 3 +
dp2[i] * 1;
dp2[i + 1] = dp2[i] * 2;
}
dp1[i + 1] %= mod;
dp2[i + 1] %= mod;
}
cout << (dp1[n] + dp2[n]) % mod << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int n;
int k;
int main(){
scanf("%d%d" , &n , &k);
int xr = 0;
for(int i = 1; i < (1 << n); i++){
if(i == k)
continue;
xr ^= i;
}
if(k == 0){
for(int i = 0; i < (1 << n); i++){
printf("%d %d " , i , i);
}
return 0;
} else if(n >= 2 && xr == k){
printf("%d " , k);
for(int i = (1 << n) - 1; i >= 0; i--){
if(i == k)
continue;
printf("%d " , i);
}
printf("%d " , k);
for(int i = 0; i < (1 << n); i++){
if(i == k)
continue;
printf("%d " , i);
}
puts("");
return 0;
}
puts("-1");
}
| 0
| 56,952,905
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define INF 1e9
#define DEBUG(x) cout<<"debug: "<<x<<endl
int s, w;
int main() {
cin >> s >> w;
if(w >= s) cout << "unsafe" << endl;
else cout << "safe" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
for(int i = 0; i < h; i++) cin >> s[i];
int dy[4] = {0,0,1,-1};
int dx[4] = {-1,1,0,0};
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == '#'){
bool ok = false;
for(int k = 0; k < 4; k++){
if(0 <= dy[k]+i && dy[k]+i < h && 0 <= dx[k]+j && dx[k]+j < w){
int y = dy[k]+i;
int x = dx[k]+j;
if(s[y][x] == '#') ok = true;
}
}
if(!ok){
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 80,128,801
|
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define sum(x) accumulate(ALL(x), 0LL)
#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))
#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))
using namespace std;
const int MOD = (int)(1e9 + 7);
const int INF = (int)(1e13 + 7);
const double EPS = 1e-14;
const double PI = acos(-1);
int CEIL(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
int mod(int a, int b) { return a >= 0 ? a % b : a - (b * CEIL(a, b)); }
int bpm(int a, int b) {
int res = 1;
for (a %= MOD; b; a = a * a % MOD, b >>= 1)
if (b & 1) res = res * a % MOD;
return res;
}
class DKatanaThrower {
public:
static void solve(istream &cin, ostream &cout) {
int N, H;
cin >> N >> H;
vector<int> a(N);
vector<int> b(N);
rep(i, N) {
cin >> a[i] >> b[i];
}
if (MAX(a) >= MAX(b)) {
cout << CEIL(H, MAX(a)) << endl;
} else {
int ans = 0;
sort(ALL(a));
sort(ALL(b));
while (b[b.size() - 1] > a[a.size() - 1]) {
H -= b[b.size() - 1];
b.pop_back();
ans++;
if (H <= 0) {
cout << ans << endl;
return;
} else if (b.size() == 0) {
break;
}
}
ans += CEIL(H, a[a.size() - 1]);
cout << ans << endl;
}
}
};
signed main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(15);
DKatanaThrower solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;
int main(){
string s;
cin >> s;
ll l = 0, r = s.size() - 1, ans = 0;
while(l < r){
if(s[l] == s[r]){
l++;
r--;
}
else if(s[l] == 'x'){
ans++;
l++;
}
else if(s[r] == 'x'){
ans++;
r--;
}
else{
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 65,917,263
|
#include<bits/stdc++.h>
using namespace std;
const int N=1001;
long long n,x[N],y[N],q[N],t;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>x[i]>>y[i];
for(int i=1;i<=n;i++)
if((x[i]+y[i]+x[1]+y[1])&1)
{
cout<<-1;
return 0;
}
for(int i=30;i>=0;i--)
q[++t]=1<<i;
if((x[1]+y[1]+1)&1)
q[++t]=1;
cout<<t<<'\n';
for(int i=1;i<=t;i++)
cout<<q[i]<<" ";
cout<<'\n';
for(int i=1;i<=n;i++)
{
if(t==32)
x[i]++;
for(int j=1;j<=31;j++)
if(abs(x[i])>=abs(y[i])&&x[i]>=0)
cout<<'R',x[i]-=q[j];
else if(abs(x[i])>=abs(y[i])&&x[i]<0)
cout<<'L',x[i]+=q[j];
else if(y[i]>=0)
cout<<'U',y[i]-=q[j];
else
cout<<'D',y[i]+=q[j];
if(t==32)
cout<<'L';
cout<<'\n';
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int graph[101][101] = {0};
int num;
int hon;
int eda;
int ver;
cin>>num;
for(int i=0;i<num;i++){
cin>>eda;
cin>>hon;
for(int j=0;j<hon;j++){
cin>>ver;
graph[eda][ver]++;
}
}
for(int i=1;i<=num;i++){
for(int j=1;j<=num;j++){
cout<<graph[i][j];
if(j==num)
break;
cout<<" ";
}
cout<<endl;
}
return 0;
}
| 0
| 49,286,665
|
#include <iostream>
#include <fstream>
using namespace std;
int main(){
int raw,j,a[100];
while (1) {
cin >> raw;
if (raw == 0) { break;
}
else {
for (j = 0; j < raw; j++) { cin >> a[j]; }
int min = a[0], max = a[0];
for (j = 0; j < raw; j++) {
if (a[j] < min) { min = a[j]; }
if (a[j] > max) { max = a[j]; }
}
int sum = 0;
for (j = 0; j < raw; j++) { sum = sum+a[j]; }
cout << (sum - min - max) / (raw - 2)<<endl;
}
}
return 0;}
|
#include<cstdio>
typedef long long ll;
const int mod=1000000007;
char s[200050];
bool d[200050];
int sum[200050];
int main(){
int n,i,ans=1,cnt=0;
scanf("%d%s",&n,s+1);
if(s[1]=='W'||s[n<<1]=='W'){
puts("0");
return 0;
}
for(i=2,d[1]=0,sum[1]=1;i<=(n<<1);++i)sum[i]=sum[i-1]+!(d[i]=d[i-1]^(s[i]==s[i-1]));
if(sum[n<<1]!=n){
puts("0");
return 0;
}
for(i=2;i<=(n<<1);++i)if(d[i]){
ans=(ll)ans*(sum[i-1]-cnt)%mod;
++cnt;
}
for(i=2;i<=n;++i)ans=(ll)ans*i%mod;
printf("%d\n",ans);
return 0;
}
| 0
| 45,906,029
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
bool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.first < secondElof.first;
}
bool pairCompareSecond(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.second < secondElof.second;
}
#define MAX_N 100100
#define MOD 998244353
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
int main(){
ll n,ans=0;
string s;
cin >> n >> s;
for (ll i=0;i<10;i++){
for (ll j=0;j<10;j++){
for (ll k=0;k<10;k++){
char a[3];
a[0]='0'+i;
a[1]='0'+j;
a[2]='0'+k;
ll c=0;
for (ll l=0;l<s.size();l++){
if (a[c]==s[l]){
a[c]='0'-1;
c++;
}
}
bool f=true;
for (ll l=0;l<3;l++){
if (a[l]!='0'-1)f=false;
}
if (f)ans++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<map>
#include<vector>
#define ll long long
using namespace std;
map<ll,int>mp;
struct DIAN
{
int bh;
long long d;
}ak[100010];
bool cmp(const DIAN&xx,const DIAN&yy)
{
return xx.d>yy.d;
}
vector<int>G[100010];
ll sz[100010];
ll dep[100010];
int n;
void dfs(int x,int fx)
{
int i;
dep[x]=dep[fx]+1;
for(i=0;i<G[x].size();i++)
{
if(G[x][i]==fx)continue;
dfs(G[x][i],x);
}
}
void dfss(int x,int fx)
{
int i;
for(i=0;i<G[x].size();i++)
{
if(G[x][i]==fx)continue;
printf("%d %d\n",x,G[x][i]);
dfss(G[x][i],x);
}
}
int main()
{
int i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%lld",&ak[i].d);
ak[i].bh=i;
mp[ak[i].d]=i;
}
ll bli=ak[1].d;
sort(ak+1,ak+n+1,cmp);
for(i=1;i<n;i++)
{
sz[ak[i].bh]++;
if(n-2*sz[ak[i].bh]<=0)
{
printf("-1\n");
return 0;
}
ll qwq=ak[i].d-1ll*(n-2*sz[ak[i].bh]);
if(mp.find(qwq)==mp.end())
{
printf("-1\n");
return 0;
}
G[ak[i].bh].push_back(mp[qwq]);
G[mp[qwq]].push_back(ak[i].bh);
sz[mp[qwq]]+=sz[ak[i].bh];
}
dfs(1,0);
ll alk=0;
for(i=1;i<=n;i++)
alk+=(dep[i]-1ll);
if(alk!=bli)
{
printf("-1\n");
return 0;
}
dfss(1,0);
return 0;
}
| 0
| 87,851,426
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int main(){
char c; cin >> c;
if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int A,B,X;
cin >> A >> B >> X;
X -= A;
bool ok = 1;
if(X < 0)ok = 0;
if(X > B)ok = 0;
cout << (ok ? "YES" : "NO") << "\n";
}
| 0
| 99,344,142
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>> ;
using GraphEdge = vector<vector<int>> ;
long long modinv(long long a, long long m=MOD) {long long b = m, u = 1, v = 0;while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}u %= m; if (u < 0) u += m;return u;}
int gcd(int a, int b){if (a%b == 0){return(b);}else{return(gcd(b, a%b));}}
int lcm(int a, int b){return a * b / gcd(a, b);}
int main(){
int N;cin>> N;
int X;cin >> X;
int x[100001];
rep(i,N){
cin>>x[i];
}
x[N] = X;
sort(x,x+N+1);
int mi = x[1] - x[0];
Rep(i,N-1){
mi = gcd(mi, x[i+1]- x[i]);
}
cout << mi << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long int
#define pll pair<int , int>
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define pii 3.14159265358979323
#define inf LLONG_MAX
#define ones(x) __builtin_popcount(x)
#define fill(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
#define hell 998244353
ll mod_pow(ll a,ll b,ll m)
{
ll res = 1;
while(b)
{
if(b&1)
{
res=(res*a) % m;
}
a=(a*a) % m;
b>>=1;
}
return res;
}
ll mod_inverse(ll a)
{
return mod_pow(a , mod-2 , mod);
}
void solve()
{
int x , a;
cin >> x >> a;
if(x < a) {
cout << 0;
}
else {
cout << 10;
}
}
signed main() {
fast;
int t = 1;
while(t--) {
solve();
}
return 0;
}
| 0
| 45,688,129
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
ll fac(ll a) { return a > 1 ? fac(a - 1) * a : 1; }
int solve(){
ll x,y;
cin >> x >> y;
if(x % y == 0)puts("-1");
else cout << x << endl;
return 0;
}
int main(){
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector< vector<int> >
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int N;
cin >> N;
vector<int> A(N + 1), L(N + 1);
for(int i = 1; i <= N; i++) cin >> A[i];
L[0] = -1;
int len = 0;
for(int i = 1; i <= N; i++){
if(L[len] < A[i]){
len++;
L[len] = A[i];
} else {
*lower_bound(L.begin(), L.begin() + len, A[i]) = A[i];
}
}
cout << len << endl;
}
| 0
| 7,780,481
|
#include<iostream>
using namespace std;
int main(void){
int n,cnt=1;
while(1){
cin>>n;
if(n==0)break;
cout<<"Case "<<cnt<<": "<<n<<endl;
cnt++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
int n, m;
vector<pair<int, int> > graph[100010];
int cost[100010];
bool flag = true;
void dfs(int idx, int num){
if(!flag) return;
cost[idx] = num;
for(int i = 0;i < graph[idx].size();i++){
if(cost[graph[idx][i].first] != INF){
if(cost[graph[idx][i].first] != num + graph[idx][i].second){
flag = false;
return;
}
}else{
dfs(graph[idx][i].first, num+graph[idx][i].second);
}
}
return;
}
int main(){
cin >> n >> m;
int a, b, c;
for(int i = 0;i < m;i++){
cin >> a >> b >> c;
a--, b--;
graph[a].push_back(make_pair(b, c));
graph[b].push_back(make_pair(a, -c));
}
for(int i = 0;i < n;i++){
cost[i] = INF;
}
for(int i = 0;i < n;i++){
if(cost[i] == INF){
dfs(i, 0);
}
}
if(flag){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
| 0
| 70,849,319
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " = " << x << endl
#define Yes(c) cout << ((c) ? "Yes" : "No") << endl;
#define YES(c) cout << ((c) ? "YES" : "NO") << endl;
#define yes(c) cout << ((c) ? "yes" : "no") << endl;
#define possible(c) cout << ((c) ? "possible" : "impossible") << endl;
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE" : "INPOSSIBLE") << endl;
int main() {
string s;
cin >> s;
if ( s[0] != 'A' ){
cout << "WA" << endl;
return 0;
}
int ichi,hantei = 0,count = 0;
for ( int i = 2; i < s.size() -1; i++){
if ( s[i] == 'C' ){
hantei = 1;
ichi = i;
count++;
}
}
if ( hantei == 0 || count >= 2 ){
cout << "WA" << endl;
return 0;
}
for ( int i = 1; i < s.size(); i++){
if ( i == ichi ){
continue;
}
if ( s[i] < 97 || s[i] > 122 ){
cout << "WA" << endl;
return 0;
}
}
cout << "AC" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> a(9);
for (int i = 0; i < 9; i++) {
cin >> a.at(i);
}
int n;
cin >> n;
int b = 0;
for (int i = 0; i < n; i++) {
int bi;
cin >> bi;
for (int i = 0; i < 9; i++) {
if (a.at(i) == bi) {
b |= 1 << i;
}
}
}
if ((b & 448) == 448)
cout << "Yes" << endl;
else if ((b & 56) == 56)
cout << "Yes" << endl;
else if ((b & 7) == 7)
cout << "Yes" << endl;
else if ((b & 292) == 292)
cout << "Yes" << endl;
else if ((b & 146) == 146)
cout << "Yes" << endl;
else if ((b & 73) == 73)
cout << "Yes" << endl;
else if ((b & 273) == 273)
cout << "Yes" << endl;
else if ((b & 84) == 84)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 0
| 69,960,508
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double N, A;
cin >> N >> A;
double R = N * N - A;
cout << R << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int n;
cin >> n;
string s, t;
cin >> s >> t;
rep(i, n + 1) {
if (s.substr(i) == t.substr(0, n - i)) {
cout << n + i << '\n';
return 0;
}
}
return 0;
}
| 0
| 28,599,999
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vll vector<ll>
#define vpll vector<pll>
#define eb emplace_back
#define MAX 999999999999999
int main(){
ll n, ans = 0;
cin >> n;
for (int i = 2; i <= 2000000; i++){
if (n % i == 0){
ll c = 0, bruh;
while (n % i == 0) n /= i, c++;
for (int j = 1; j < 100; j++){
if (c < (j * (j + 1) / 2)){
bruh = j;
break;
}
}
ans += bruh - 1;
}
}
if (n != 1) ans++;
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REPA(i,a) for(ll i=0;i<(ll)(a.size());i++);
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i,a) for(ll i=0;i<(ll)(a.size());i++) {cout << (a)[i] << " ";} cout << endl;
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T>
void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) {
cout << i << ":" << v[i] << " ";
}
cout << endl;
#else
(void)v;
#endif
}
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const unsigned int BIT_FLAG_8 = (1 << 8);
const unsigned int BIT_FLAG_9 = (1 << 9);
const unsigned int BIT_FLAG_10 = (1 << 10);
const unsigned int BIT_FLAG_11 = (1 << 11);
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI=3.14159265358979323846;
constexpr int MOD = 1000000007;
void Main() {
ll r, d, x2000;
cin >> r >> d >> x2000;
ll x = x2000;
REP(i, 10) {
x = r * x - d;
COUT(x);
}
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| 0
| 16,216,837
|
#include <stdio.h>
int main ()
{
int apel;
int potongan;
scanf("%d %d", &apel, &potongan);
int rumus = (((apel*3) + (potongan))/2);
printf("%d", rumus);
return 0;
}
|
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define fi first
#define se second
#define show(x) cout << #x << " = " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo {cout<<"Yes";}else{cout<<"No";}
#define YESNO {cout<<"YES";}else{cout<<"NO";}
#define v(T) vector<T>
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
template<class A, class B> istream& operator>>(istream& i, pair<A, B>& p) {
return i >> p.first >> p.second;
}
template<class A, class B, class C> istream& operator>>(istream& i, tuple<A, B, C>& t) {
return i >> get<0>(t) >> get<1>(t) >> get<2>(t);
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
F0R(i, v.size()) {
o << v[i] << ' ';
}
o << newl;
return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
for (auto& p : m) {
o << p.first << ": " << p.second << newl;
}
o << newl;
return o;
}
#if 1
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
unordered_map<int, int> a, b;
F0R(i, n) {
int v;
cin >> v;
if (i & 1) {
++a[v];
}
else {
++b[v];
}
}
vector<pair<int,int>> c, d;
for (auto& p : a) c.emplace_back(p.second, p.first);
for (auto& p : b) d.emplace_back(p.second, p.first);
sort(rrng(c), lcmp<int>);
sort(rrng(d), lcmp<int>);
c.emplace_back(0, -1);
d.emplace_back(0, -1);
int r;
if (c[0].second != d[0].second)
r = n - c[0].first - d[0].first;
else {
r = n - max(c[0].first + d[1].first, c[1].first + d[0].first);
}
cout << r;
}
#endif
| 0
| 19,371,476
|
#include <stdio.h>
int main(void){
int t[19];
int n = 0;
int c = 0;
for(int i=0;i<19;++i){
t[i] = 0;
}
for(int i=0;i<=9;++i){
for(int j=0;j<=9;++j){
t[i+j]++;
}
}
while(scanf("%d", &n) != EOF){
c = 0;
for(int i=0;i<19&&i<=n; ++i){
if(n - i > 18){ continue; }
c += t[i] * t[n - i];
}
printf("%d\n", c);
}
return 0;
}
|
#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z) lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y)
#define deg2rad(deg) ((((double)deg)/((double)360)*2*M_PI))
#define rad2deg(rad) ((((double)rad)/(double)2/M_PI)*(double)360)
#define Find(set, element) set.find(element) != set.end()
#define Decimal(x) cout << fixed << setprecision(10) << x << endl;
#define endl "\n"
#define Case(x) printf("Case #%d: ", x);
typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<char> vch;
typedef vector<vector<char>> vvch;
constexpr ll LINF = 1001002003004005006ll;
constexpr int INF = 1001001001;
constexpr int n_max = 2e5+10;
template<class T>
inline bool chmax(T &a, T b) { if(a<b) { a=b; return true; } return false; };
template<class T>
inline bool chmin(T &a, T b) { if(a>b) { a=b; return true; } return false; };
template<class T, class U>
T POW(T x, U n) {T ret=1; while (n>0) {if (n&1) {ret*=x;} x*=x; n>>=1;} return ret;};
template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string &s) {return '"' + s + '"';};
string to_string(const char c) {return to_string((string) &c);};
string to_string(bool b) {return (b ? "true" : "false");};
template <size_t N>
string to_string(bitset<N> v){
string res = "";
for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
return res;
};
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for(const auto &x : v) {
if(!first) res += ", ";
first = false; res += to_string(x);
}
res += "}";
return res;
};
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
void debug_out() {cerr << endl;};
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); };
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 71
#endif
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
};
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
};
template <class T>
void print(vector<vector<T>> &df) {
for (auto& vec : df) {
print(vec);
}
};
PI solve(string &s) {
int n = s.size();
vvi table(26);
rep(i, 0, 26) {
char ch = 'a'+i;
rep(j, 0, n) {
if (s[j] == ch) table[i].pb(j);
}
}
rep(i, 0, 26) {
rep(j, 0, table[i].size()-1) {
if (table[i][j+1]-table[i][j] < 3) {
return make_pair(table[i][j]+1,table[i][j+1]+1);
}
}
}
return make_pair(-1, -1);
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s; cin >> s;
PI ans = solve(s);
cout << ans.first << " " << ans.second << endl;
return 0;
};
| 0
| 21,469,333
|
#include<bits/stdc++.h>
using namespace std;
#define ll "%I64d"
const int max1=100010;
int main()
{
string s1,s2;
cin>>s1>>s2;
int k=0;
for(int i=0;i<s1.size();i++)
{
if(s1[i]==s2[i])
{
k++;
}
}
cout<<k<<"\n";
}
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
void solve() {
int n,k,a,b;
cin >> n >> k;
map<int,LL> m;
REP(i,0,n) {
cin >> a >> b;
if (a > k) continue;
m[a] += b;
}
set<int> s;
s.insert(k);
REP(i,0,30) {
if (!(k & (1<<i))) continue;
s.insert((k & ~(1<<i)) | ((1<<i)-1));
}
LL ans = 0;
for (const int &t: s) {
LL sum = 0;
for (const auto &p: m) {
int a = p.first;
LL b = p.second;
if ((t | a) != t) continue;
sum += b;
}
ans = max(ans, sum);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 0
| 37,603,498
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int a[MAXN]= {0};
map<int,int>mm;
int solve(int n) {
int f;
for(int j=1; j*j<=n; j++) {
if(n%j==0) {
f=0;
mm[n]--;
if(mm[j]||mm[n/j]) {
f=1;
}
mm[n]++;
if(f)
return 0;
}
}
return 1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i=0; i<n; i++) {
cin >> a[i];
mm[a[i]]++;
}
int ans = 0;
for(int i=0; i<n; i++) {
ans+=solve(a[i]);
}
cout <<ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
string A, B;
cin >> A >> B;
if (A == B) {
cout << "EQUAL" << endl;
return 0;
}
if (A.size() > B.size()) {
cout << "GREATER" << endl;
}
else if (A.size() < B.size()){
cout << "LESS" << endl;
}
else {
for (int i = 0; i < A.size(); ++i) {
if (A[i] > B[i]) {
cout << "GREATER" << endl;
break;
}
else if (A[i] < B[i]) {
cout << "LESS" << endl;
break;
}
}
}
return 0;
}
| 0
| 55,687,382
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0);
string s; cin >> s;
map<char,int> m {};
for (char c : s)
m[c]++;
if (m.size() != 2)
cout << "No";
else
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n){
int j = i+1;
while(s[i] == s[j]){
j++;
}
ans++;
i = j-1;
}
cout << ans << endl;
}
| 0
| 37,894,321
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) return a;
a %= b;
return gcd(b, a);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
ll g = a[0];
for (int i = 1; i < n; i++) {
g = gcd(g, a[i]);
}
for (int i = 0; i < n; i++) {
if (((a[i] - k) % g == 0) && (a[i] >= k)) {
cout << "POSSIBLE" << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
return 0;
}
|
#include <iostream>
int count_pattern( unsigned int const& n )
{
int ans=0;
for ( unsigned int a = 0; a < 10; ++a )
{
for ( unsigned int b = 0; b < 10; ++b )
{
for ( unsigned int c = 0; c < 10; ++c )
{
for ( unsigned int d = 0; d < 10; ++d)
{
if ( a+b+c+d == n ) ++ans;
}
}
}
}
return ans;
}
int main()
{
int n;
while (std::cin >> n)
{
std::cout << count_pattern(n) << std::endl;
}
return 0;
}
| 0
| 85,228,463
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount(bit) __builtin_popcount(bit)
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x)))
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
ll ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return -1;
}
template <typename T>
string make_string(T N)
{
string ret;
T now = N;
while (now > 0)
{
T x = now % 10;
ret += (char)('0' + x);
now /= 10;
}
reverse(all(ret));
return ret;
}
template <typename T>
T gcd(T a, T b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
template <typename T>
T lcm(T x, T y)
{
T z = gcd(x, y);
return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++)
{
if (n % i == 0)
{
return false;
}
i++;
}
return true;
}
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;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main()
{
cout << fixed << setprecision(30);
ll N, K;
cin >> N >> K;
vector<ll> t(N), d(N);
loop(i, N)
{
cin >> t[i] >> d[i];
}
vector<pair<ll, ll>> pairs(N);
loop(i, N) pairs[i] = make_pair(d[i], t[i]);
sort(all(pairs));
reverse(all(pairs));
loop(i, N)
{
t[i] = pairs[i].second;
d[i] = pairs[i].first;
}
t.push_back(100008);
d.push_back(-1e18 + 9);
ll kind = 0;
vector<bool> seen(100010, false);
vector<ll> num(100010);
ll ans = 0;
loop(i, K)
{
ans += d[i];
if (!seen[t[i]])
kind++;
seen[t[i]] = true;
num[t[i]]++;
}
ans += kind * kind;
vector<ll> trade;
for (ll i = K - 1; i >= 0; i--)
{
if (num[t[i]] > 1)
{
trade.push_back(d[i]);
num[t[i]]--;
}
}
ll ind = 0;
ll preans = ans;
loop(i, N - K)
{
if (!seen[t[K + i]] && ind != trade.size())
{
seen[t[K + i]] = true;
preans -= trade[ind];
preans += d[K + i];
preans += 2 * kind + 1;
kind++;
ans = max(ans, preans);
ind++;
}
}
putout(ans);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define endl '\n'
const int INF = (1 << 30);
using namespace std;
typedef long long int ll;
bool solve(){
int n, smax=0, smin=INF, sum=0, s;
cin >> n;
if(!n) return false;
REP(i,n){
cin >> s;
smax = max(s, smax);
smin = min(s, smin);
sum += s;
}
cout << (sum - smin - smax) / (n-2) << endl;
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while(solve());
}
| 0
| 5,219,319
|
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main(){
ll A, B;
cin >> A >> B;
cout << A * B - (A + B - 1) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
bool rev(long long int a,long long int b)
{
if(a>b)return true;
else return false;
}
bool compa(pair<string,pair<int,int>>a,pair<string,pair<int,int>>b)
{
if(a.first==b.first)
{
if(a.second.first>b.second.first)
return true;
else
return false;
}
if(a.first<b.first)
return true;
else
return false;
}
long long int gcd(long long int bdda,long long int chota)
{
if(chota==0)
return bdda;
return gcd(chota,bdda%chota);
}
void solve()
{
string s;
cin>>s;
int sr=0,sb=0;
for(int i=0;i<s.length();i++)
{
if(s[i]=='0')sr++;
else sb++;
}
cout<<(long long int )min(sr,sb)*2;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
solve();
}
}
| 0
| 53,672,159
|
#define NUMBER_OF_DIGITS 6
#include <bits/stdc++.h>
#ifdef DEBUG
#include <chrono>
#endif
using namespace std;
int main()
{
#ifdef DEBUG
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
ios::sync_with_stdio(false);
int n;
string s;
cin >> n;
cin >> s;
int counter = 0;
vector<bool> flags1;
for (int number = 0; number < 10; number++)
{
flags1.push_back(false);
}
for (int i = 0; i < (n - 2); i++)
{
char c1 = s[i];
if (flags1[c1 - '0'] == true)
{
continue;
}
flags1[c1 - '0'] = true;
vector<bool> flags2;
for (int number = 0; number < 10; number++)
{
flags2.push_back(false);
}
for (int j = (i + 1); j < (n - 1); j++)
{
char c2 = s[j];
if (flags2[c2 - '0'] == true)
{
continue;
}
flags2[c2 - '0'] = true;
vector<bool> flags3;
for (int number = 0; number < 10; number++)
{
flags3.push_back(false);
}
for (int k = (j + 1); k < n; k++)
{
char c3 = s[k];
if (flags3[c3 - '0'] == true)
{
continue;
}
flags3[c3 - '0'] = true;
counter++;
}
}
}
cout << counter << endl;
#ifdef DEBUG
end = chrono::system_clock::now();
double elapsed = chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
cout << elapsed << "[ms]" << endl;
#endif
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef ARTEM
#define deb(x) x
#else
#define deb(x)
const int inf = 1000500;
#endif
void solve();
int main() {
solve();
}
void solve() {
int n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
}
| 0
| 51,686,638
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
if(N == 4*i + 7*j){
count++;
}
}
}
string ans;
if(count != 0){
ans = "Yes";
}else{
ans = "No";
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) std::cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) std::cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) std::cout << x << endl;
#define println(x) std::cout << x << endl;
using namespace std;
void Main()
{
ll n;
cin >> n;
vector<ll> A(n);
rep(i, n) cin >> A[i];
unordered_map<int, int> cnt;
rep(i, n) cnt[A[i]] = 0;
rep(i, n) cnt[A[i]]++;
ll remove = 0;
for (auto& kv: cnt) {
remove += kv.second - 1;
}
ll nOp = (remove + 1) / 2;
ll res = n - nOp * 2;
put(res);
}
signed main(){ Main();return 0;}
| 0
| 1,504,226
|
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <list>
#include <set>
#include <queue>
#include <iterator>
#include <bitset>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#define ll long long
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define loop for(i=0;i<n;i++)
#define pb push_back
#define tc() int t;cin>>t;while(t--)
using namespace std;
ll i,j,temp;
int main()
{_
char name1[4];
char name2[4];
char name3[4],x;
int flag=0;
cin>>name1>>name2;
for(i=0,j=2;i<3;i++,j--){
if(name1[i]!=name2[j]){
flag = 0;
break;
}
else{
flag = 1;
}
}
if(flag){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define print cout <<
#define printl(s) cout << s << endl;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
const ll modseed = pow(10,9) + 7;
template <typename T>
vector<T> getValues(int num){
vector<T> values(num);
for(int i=0;i<num;i++){
cin >> values.at(i);
}
return values;
}
int calcDigit(ll N){
int digit = 0;
while(N>0){
N/= 10;
digit++;
}
return digit;
}
int main(){
ll N;
cin >> N;
int ans = calcDigit(N);
for(ll A=1;A*A<=N;A++){
if(N%A!=0){
continue;
}
ll B = N /A;
int tmp = max(calcDigit(A),calcDigit(B));
if(ans > tmp){
ans = tmp;
}
}
printl(ans);
}
| 0
| 9,191,241
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
void yes(){
cout << "Yes" << endl;
}
void no (){
cout << "No" << endl;
}
ll cel (ll a, ll b){
if (a % b == 0) return a / b;
else return a / b + 1;
}
ll gcds(ll a, ll b){
ll c = a % b;
while (c != 0){
a = b;
b = c;
c = a % b;
}
return b;
}
int main() {
int n; cin >> n;
cout << 1110 - n << endl;
}
|
#include<iostream>
using namespace std;
#include<algorithm>
int main() {
int n, m, x;
cin >> n >> m >> x;
int bk[n][m+1];
for(int i = 0; i < n; i++) {
for(int j = 0; j <= m; j++) {
cin >> bk[i][j];
}
}
int res = 100000000, sk[m], tempres;
bool flag;
for(int bit = 0; bit < (1<<n); bit++) {
tempres = 0;
flag = true;
for(int i = 0; i < m; i++) {
sk[i] = 0;
}
for(int i = 0; i < n; i++) {
if(bit & (1<<i)) {
tempres += bk[i][0];
for(int j = 0; j < m; j++) {
sk[j] += bk[i][j+1];
}
}
}
for(int i = 0; i < m; i++) {
if(sk[i] < x) flag = false;
}
if(flag) res = min(res, tempres);
}
switch (res) {
case 100000000:
cout << -1 << endl;
break;
default:
cout << res << endl;
}
return 0;
}
| 0
| 24,269,565
|
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k, n, k) {
int a[100005];
for (int i = 0;i < n;i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0;i <= n - k;i++) {
int s = 0;
for (int j = 0;j < k;j++) {
s += a[i + j];
}
if (s > ans)ans = s;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
vector<vector<ll>> g(100010);
vector<ll> dist(100010);
int main(){
ll n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n)cin >> v[i];
ll ans = 0;
rep(i, min(n, k) + 1)rep(j, min(n, k) + 1 - i){
vector<ll> tmp = v;
tmp.erase(tmp.begin()+i, tmp.end()-j);
sort(ALL(tmp));
rep(l, k - (i+j) && !tmp.empty()){
if(tmp.front() < 0)tmp.erase(tmp.begin());
}
ll res = 0;
rep(l, tmp.size())res += tmp[l];
ans = max(ans, res);
}
cout << ans << endl;
}
| 0
| 28,379,139
|
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define int ll
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pb push_back
#define reset(x,v) memset(x,v,sizeof(x))
#define mod 1000000007
using namespace std;
void dfs(vector<int> adj[], int sv, vector<bool> &vis){
vis[sv] = true;
for(int i = 0; i < adj[sv].size(); i++){
if(!vis[adj[sv][i]]){
dfs(adj, adj[sv][i], vis);
}
}
}
ll power(ll x, ll y){
if(x == 1 || y == 0)
return 1;
ll res = 1;
x = x % mod;
if (x == 0)
return 0;
while (y > 0){
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
ll nCr(ll n, ll r) {
ll x = 1, y = 1;
rep(i, 0, r) {
x = x * (n - i) % mod;
y = y * (i + 1) % mod;
}
return x * power(y, mod - 2) % mod;
}
signed main(){
FASTIO
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
ll p[a], q[b], r[c];
rep(i, 0, a)
cin >> p[i];
rep(i, 0, b)
cin >> q[i];
rep(i, 0, c)
cin >> r[i];
vector<ll> v;
ll ans = 0;
sort(p, p + a, greater<ll>());
sort(q, q + b, greater<ll>());
sort(r, r + c, greater<ll>());
rep(i, 0, x)
v.pb(p[i]);
rep(i, 0, y)
v.pb(q[i]);
rep(i, 0, c)
v.pb(r[i]);
sort(v.begin(), v.end(), greater<ll>());
rep(i, 0, x + y)
ans += v[i];
cout << ans;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmin(T &a, T b){
if(a>b){
a = b;
return true;
}
return false;
}
int main(){
ll n,m,v,p;
cin >> n >> m >> v >> p;
vector<ll>a(n);
rep(i,n)cin >> a[i];
sort(all(a));
vector<ll>s(n);
for(int i=0;i<n;i++){
s[i] += a[i];
if(i!=0)s[i] += s[i-1];
}
ll t = a[n-p];
int res = 0;
for(int i=0;i<n;i++){
if(a[i]+m<t)continue;
if(i>=n-p){
res++;
continue;
}
ll T = a[i]+m;
ll id = n-p;
ll pid = upper_bound(all(a),a[i])-a.begin();
pid--;
ll tmp = 0;
tmp += (pid+1) * m;
if(pid!=0)tmp += T*(id-pid+1) - (s[id]-s[pid-1]);
else tmp += T*(id-pid+1) - (s[id]);
if(tmp >= m*(v-p+2)){
res++;
}
}
cout << res << endl;
return 0;
}
| 0
| 40,815,360
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int m;
cin>>m;
REP(i,m){
string str;
int num[5000]={0};
char now;
int out=0;
char one[5]={'.',',','!','?',' '};
cin >> str;
int hoge = str.size();
REP(i,hoge){
num[i] = str[i] - '0';
};
REP(c,hoge){
int k=0;
if(num[c]==1){
while(num[c]==1){
k++;
c++;
}
out=(k+4)%5;
cout << one[out];
}else if(num[c]==2){
while(num[c]==2){
k++;
c++;
}
out=(k+2)%3;
now = 'a'+out;
cout << now;
}else if(num[c]==3){
while(num[c]==3){
k++;
c++;
}
out=(k+2)%3;
now = 'd'+out;
cout << now;
}else if(num[c]==4){
while(num[c]==4){
k++;
c++;
}
out=(k+2)%3;
now = 'g'+out;
cout << now;
}else if(num[c]==5){
while(num[c]==5){
k++;
c++;
}
out=(k+2)%3;
now = 'j'+out;
cout << now;
}else if(num[c]==6){
while(num[c]==6){
k++;
c++;
}
out=(k+2)%3;
now = 'm'+out;
cout << now ;
}else if(num[c]==7){
while(num[c]==7){
k++;
c++;
}
out=(k+3)%4;
now = 'p'+out;
cout << now;
} else if(num[c]==8){
while(num[c]==8){
k++;
c++;
}
out=(k+2)%3;
now = 't'+out;
cout << now;
}else if(num[c]==9){
while(num[c]==9){
k++;
c++;
}
out=(k+3)%4;
now = 'w'+out;
cout << now;
}
}
cout << endl;
}}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int n,m,x;
cin >>n>>m>>x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i, n){
cin >> c[i];
rep(j, m){
cin >> a[i][j];
}
}
int ans=12345678;
rep(tmp, (1<<n)){
vector<int> level(m);
int cnt=0;
rep(i, n){
if((tmp>>i)&1){
cnt += c[i];
rep(j, m){
level[j] += a[i][j];
}
}
}
bool ok = true;
rep(j, m){
if(level[j]<x)
ok=false;
}
if(ok) ans = min(ans,cnt);
}
if(ans==12345678) cout << -1 << endl;
else cout << ans << endl;
}
| 0
| 62,588,067
|
#include<iostream>
using namespace std;
int main(){
int n,m;
while(1){
cin>>n>>m;
if(n==0&&m==0) break;
if(n>m) cout<<m<<" "<<n<<endl;
else if(n<m) cout<<n<<" "<<m<<endl;
else cout<<n<<" "<<m<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main()
{
int a,b;
cin >> a >> b;
if(a%3==0||b%3==0||(a+b)%3==0){
cout << "Possible"
<< "\n";
}else{
cout << "Impossible"
<< "\n";
}
return 0;
}
| 0
| 27,786,020
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int n, k; cin >> n >> k;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++) cin >> h[i];
using vll = vector<long long>;
vector<vector<vll>> dp(n + 1, vector<vll>(n + 1, vll(k + 1, INF)));
dp[0][0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int r = 0; r < i; r++) {
for (int c = 0; c <= k; c++) {
auto val = dp[i - 1][r][c];
if (val == INF) continue;
int cost = max(0, h[i] - h[r]);
chmin(dp[i][i][c], val + cost);
if (c < k) chmin(dp[i][r][c + 1], val);
}
}
}
long long mi = INF;
for (int r = 0; r <= n; r++) mi = min(mi, dp[n][r][k]);
cout << mi << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
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...));
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
const int INF = 2100100100;
const int MOD = 1e9 + 7;
int N, M, K, Q, W, H, R, C;
string S;
int main() {
cin >> N >> K;
vector<vector<int>> G = make_vec<int>(N, N);
REP(i, N) {
REP(j, N) { G[i][j] = 1; }
}
if (N == 2) {
if (K == 0) {
cout << 1 << endl;
cout << "1 2" << endl;
} else {
cout << -1 << endl;
}
return 0;
}
if (K > (N - 1) * (N - 2) / 2) {
cout << -1 << endl;
return 0;
} else {
int cnt = 0;
REP(i, N) {
if (cnt == K) break;
FOR(j, i + 1, N - 1) {
if (cnt == K) break;
G[i][j] = 0;
cnt++;
}
}
cout << N * (N - 1) / 2 - K << endl;
REP(i, N) {
FOR(j, i + 1, N) {
if (G[i][j] > 0) {
cout << i + 1 << " " << j + 1 << endl;
}
}
}
return 0;
}
}
| 0
| 94,349,072
|
#include <iostream>
#include <algorithm>
using namespace std;
char alph[26];
void solve() {
string s;
cin >> s;
for (char c: s) {
++alph[c - 'a'];
if (alph[c-'a'] > 1) {
cout <<"no";
return;
}
}
cout << "yes";
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(),s.end())
#define reverse(s) reverse(s.begin(),s.end())
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
const ll mod = 1e9+7;
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
bool isPrime(ll x){
ll i;
if(x < 2)return 0;
else if(x == 2) return 1;
if(x%2 == 0) return 0;
for(i = 3; i*i <= x; i += 2) if(x%i == 0) return 0;
return 1;
}
int digsum(ll n) {
int res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
int dignum(ll n) {
int res = 0;
while(n > 0) {
res++;
n /= 10;
}
return res;
}
ll stringcount(string s,char c){
return count(s.cbegin(),s.cend(),c);
}
ll ka(ll i){
ll res=1;
while(i>0){
res=res*i;
i--;
}
return res;
}
ll ncr(ll x,ll y){
ll a = x;
ll b = 1;
if(y>(x/2)){
y=x-y;
}
for(ll i=1;i<y;i++){
a*=x-i;
b*=i+1;
}
return a/b;
}
ll f(ll x){
ll dp[x+1];
dp[1]=1;
dp[2]=1;
for(ll i=3;i<=x;i++){
dp[i]=dp[i-1]+dp[i-2];
}
return dp[x];
}
int ctoi(char c){
return c-'0';
}
int main(){
int n;
cin >> n;
int x = n/15;
cout << n*800-x*200 << endl;
}
| 0
| 14,534,484
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
#define MAX_H 250
const int INV = -2147483645;
int main(void)
{
int H, node, parent, left, right;
int ary_BinaryHeap[MAX_H + 1];
for(int i = 0; i < MAX_H; i++)
{
ary_BinaryHeap[i] = INV;
}
cin >> H;
for(int i = 1; i <= H; i++)
{
cin >> node;
ary_BinaryHeap[i] = node;
}
for(int i = 1; i <= H; i++)
{
cout << "node " << i << ": ";
cout << "key = " << ary_BinaryHeap[i] << ", ";
parent = i / 2;
left = 2 * i;
right = ( 2 * i ) + 1;
if( parent > 0 )
{
cout << "parent key = " << ary_BinaryHeap[parent] << ", ";
}
if( left <= H
&& ary_BinaryHeap[left] != INV )
{
cout << "left key = " << ary_BinaryHeap[left] << ", ";
}
if( right <= H
&& ary_BinaryHeap[right] != INV )
{
cout << "right key = " << ary_BinaryHeap[right] << ", ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;
#define foreach(ix,i) for(auto& (ix) : (i))
typedef long double ld;
const int mod =1000000007;
int main(){
ll n,m;cin>>n>>m;
ll sum=0;
map<ll,ll>mo;
rep(i,n){
ll a;
cin>>a;
a%=m;
sum +=a;
sum%=m;
mo[sum]++;
}
ll ans =0;
mo[0]++;
for(auto i :mo){
ll sm = i.second;
ans+=(sm*(sm-1))/2;
}
cout<<ans<<endl;
}
| 0
| 21,519,991
|
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <math.h>
using namespace std;
string MCXI ="ixcm";
int main(int argc, char const *argv[])
{
string s1,s2;
int n;
string ans;
int d1,d2;
int temp,f;
cin>>n;
for(int i1=0;i1<n;i1++){
cin>>s1>>s2;
temp=1;
d1=0;
for(int i2=0;i2<s1.size();i2++){
f=MCXI.find(s1[i2]);
if(f!=-1) {
d1+=temp*pow(10,f);
temp=1;
}
else temp=s1[i2]-48;
}
temp=1;
d2=0;
for(int i2=0;i2<s2.size();i2++){
f=MCXI.find(s2[i2]);
if(f!=-1) {
d2+=temp*pow(10,f);
temp=1;
}
else temp=s2[i2]-48;
}
d1+=d2;
f=0;
ans="";
while(d1!=0){
if(d1%10!=0){
ans+=MCXI[f];
if(d1%10!=1){
ans+=(d1%10+48);
}
}
d1=d1/10;
f++;
}
reverse(ans.begin(), ans.end());
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
const int MOD=1000000007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> P;
ll N;
string s;
string ans="";
void judgement(char zero,char one)
{
char animals[100005];
animals[0]=zero;
animals[1]=one;
char lastanimal;
for (int i = 0; i < N; ++i)
{
if(s[i]=='o' && animals[i]=='S')
{
if(i==0)
{
lastanimal=animals[i+1];
}
else if(i<N-1)
{
animals[i+1]=animals[i-1];
}
else if(i==N-1)
{
if(animals[i]==lastanimal)
{
if(animals[i-1]==animals[0])
{
for(int i=0;i<N;i++) ans+=animals[i];
}
}
}
}
else if(s[i]=='x' && animals[i]=='S')
{
if(i==0)
{
if(animals[i+1]=='S')
{
lastanimal='W';
}
else
{
lastanimal='S';
}
}
else if(i<N-1)
{
if(animals[i-1]=='S')
{
animals[i+1]='W';
}
else
{
animals[i+1]='S';
}
}
else
{
if(animals[i]==lastanimal)
{
if(animals[i-1]!=animals[0])
{
for(int i=0;i<N;i++) ans+=animals[i];
}
}
}
}
else if(s[i]=='o' && animals[i]=='W')
{
if(i==0)
{
if(animals[i+1]=='S')
{
lastanimal='W';
}
else
{
lastanimal='S';
}
}
else if(i<N-1)
{
if(animals[i-1]=='S')
{
animals[i+1]='W';
}
else
{
animals[i+1]='S';
}
}
else
{
if(animals[i]==lastanimal)
{
if(animals[i-1]!=animals[0])
{
for(int i=0;i<N;i++) ans+=animals[i];
}
}
}
}
else if(s[i]=='x' && animals[i]=='W')
{
if(i==0)
{
lastanimal=animals[i+1];
}
else if(i<N-1)
{
animals[i+1]=animals[i-1];
}
else if(i==N-1)
{
if(animals[i]==lastanimal)
{
if(animals[i-1]==animals[0])
{
for(int i=0;i<N;i++) ans+=animals[i];
}
}
}
}
}
}
int main(void)
{
cin >> N;
cin >> s;
judgement('S','S');
judgement('S','W');
judgement('W','S');
judgement('W','W');
if(int(ans.size())==0)
{
cout << -1 << endl;
}
else
{
for(int i=0;i<N;i++)
{
cout << ans[i];
}
cout << endl;
return 0;
}
return 0;
}
| 0
| 80,792,664
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = INTINF;
int tmp;
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int > l;
REP(i, n) {
cin >> tmp;
l.push_back(tmp);
}
int aa, bb, cc;
REP(i, 1 << (2*n)){
aa = 0;
bb = 0;
cc = 0;
tmp = 0;
REP(j, n){
int v = ((i >>(2*j)) & 3);
if(v == 0){
if(aa != 0) tmp += 10;
aa += l[j];
}
if(v == 1){
if(bb != 0) tmp += 10;
bb += l[j];
}
if(v == 2){
if(cc != 0) tmp += 10;
cc += l[j];
}
}
if(!(aa && bb && cc)) continue;
tmp += abs(aa - a);
tmp += abs(bb - b);
tmp += abs(cc - c);
ans = min(tmp, ans);
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
const ll mod = 1000000007;
const ll INF = mod * mod;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
ll qp(ll a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm (ll a, ll b){return a/gcd(a,b)*b;}
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,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){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T1, typename T2> pair<T1, T2> operator<(const pair<T1, T2> l, const pair<T1, T2> r) { return (l.first < r.first); }
template<typename T1, typename T2> pair<T1, T2> operator>(const pair<T1, T2> l, const pair<T1, T2> r) { return (l.first > r.first); }
void solve() {
ll N; cin >> N;
vec A(N); cin >> A;
sort(all(A));
ll MAX = A.back();
ll tmp_cnt = 0;
ll res = 1;
ll tmp_size=0;
rep(i,N-1){
tmp_size += A[i];
if(tmp_size*2>=MAX){
res += tmp_cnt + N - i - 1;
break;
}
if(tmp_size*2>=A[i+1]){
tmp_cnt++;
}
else{
tmp_cnt = 0;
}
}
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
std::cout << fixed << setprecision(10);
solve();
return 0;
}
| 0
| 38,687,504
|
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int p=0,q=0,r=0;
cin>>p>>q>>r;
cout<<min({p+q,p+r,q+r})<<endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
class Cycle {
private:
ll _index = 1;
ll _cycle_entrance = -1;
ll _cycle_length = -1;
ll _cycle_sum = 0;
vector<ll> _list;
map<ll, ll> _m;
public:
Cycle() {
_list.emplace_back(-1);
}
bool add(ll value) {
if (_m[value]) {
_cycle_entrance = _m[value];
_cycle_length = _index - _cycle_entrance;
ll cycle_sum = 0;
for (ll i = 0; i < _cycle_length; i++) {
ll index = _cycle_entrance + i;
cycle_sum += _list[index];
}
_cycle_sum = cycle_sum;
return false;
}
_m[value] = _index;
_list.emplace_back(value);
_index++;
return true;
}
ll sum(ll length) {
ll result = 0;
ll rest = length;
for (ll i = 1; i < _cycle_entrance; i++) {
if (rest <= 0) {
break;
}
result += _list[i];
rest--;
}
ll cycle_num = rest / _cycle_length;
result += (_cycle_sum * cycle_num);
rest = rest % _cycle_length;
for (ll i = 0; i < rest; i++) {
ll index = _cycle_entrance + i;
result += _list[index];
}
return result;
}
};
int main() {
ll N, X, M;
scanf("%lld %lld %lld", &N, &X, &M);
auto cycle = Cycle();
ll x = X;
for (;;) {
if (!cycle.add(x)) {
break;
}
x = x * x % M;
}
cout << (cycle.sum(N)) << endl;
}
| 0
| 66,514,282
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct edge{ll to, cost;};
int main(){
ll n, i, a, b, c, q, k,x,y, f;
scanf("%lld", &n);
vector<edge> V[n];
ll d[n] = {};
for(i=0; i<n-1;i++){
scanf("%lld%lld%lld", &a, &b, &c);a--;b--;
V[a].push_back(edge{b, c});
V[b].push_back(edge{a, c});
}
scanf("%lld%lld", &q, &k);
k--;
queue<ll> Q;
Q.push(k);
while(!Q.empty()){
f = Q.front();
Q.pop();
for(i=0;i<V[f].size();i++){
if(d[V[f][i].to] == 0){
d[V[f][i].to] = d[f] + V[f][i].cost;
Q.push(V[f][i].to);
}
}
}
for(i=0;i<q;i++){
scanf("%lld%lld", &x, &y);
x--;
y--;
printf("%lld\n", d[x]+d[y]);
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define MAX 100
#define NIL -2
int n, G_list[MAX+1];
int G[MAX+1][MAX+1];
int d[MAX+1][2];
void init(void){
for(int i=0; i<=MAX; i++){
d[i][0]=-1;
}
}
void make_graph(void){
scanf("%d", &n);
for(int i=0; i<n; i++){
int cnt, num, m;
scanf("%d %d", &num, &cnt);
G_list[i]=num;
for(int j=0; j<cnt; j++){
scanf("%d", &m);
G[num][m]=1;
}
}
}
void check_depth(void){
queue<int> Q;
Q.push(G_list[0]);
d[G_list[0]][0]=0;
d[G_list[0]][1]=NIL;
while(!Q.empty()){
int top=Q.front();
Q.pop();
for(int j=0; j<n; j++){
if(G[top][G_list[j]] == 1 && d[G_list[j]][1] != NIL){
d[G_list[j]][0]=d[top][0]+1;
d[G_list[j]][1]=NIL;
Q.push(G_list[j]);
}
}
}
}
void print(void){
for(int i=0; i<n; i++){
printf("%d %d\n", G_list[i], d[G_list[i]][0]);
}
}
int main(void){
init();
make_graph();
check_depth();
print();
return 0;
}
| 0
| 28,064,773
|
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <iostream>
#include <numeric>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
int INF = 1e9;
int main(){
int n;cin >> n;
vector<int> a(n);
int tot = 0;
rep(i,n){
cin >> a[i];
tot += a[i];
}
int av1 = tot/n;
int av2 = tot/n+1;
int sum1=0,sum2=0;
rep(i,n){
sum1 += (a[i]-av1)*(a[i]-av1);
sum2 += (a[i]-av2)*(a[i]-av2);
}
cout << min(sum1,sum2) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
for (;;) {
scanf("%d %d",&h,&w);
if (h==0) break;
for (int i=0;i<h;i++) {
for (int j=0;j<w;j++) {
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
}
| 0
| 65,428,408
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
const ll ATCODER_AMARI = 1000000007;
const ll INF = 10000000000000;
ll factorial(ll k){
ll sum = 1;
for(int i = 1 ; i < k + 1; i++) {
sum *= i;
}
return sum;
}
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;
}
int main() {
ll n;
cin >> n;
if(n == 1) {
cout << 0 << endl;
return 0;
}
const auto &res = prime_factorize(n);
const auto r_size = res.size();
ll ans = 0;
rep(i,r_size) {
ll tmp = res.at(i).second;
ll count = 1;
while(tmp >= count) {
tmp -= count;
count++;
ans++;
}
}
cout << ans << endl;
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#define REP(i,n) for(long long int (i)=0;(i)<(n);i++)
using namespace std;
int main(){
string str;
int n,h;
while(cin >> str){
if(str=="-")break;
cin >> n;
REP(i,n){
cin >> h;
string cat = str.substr(0,h);
str.erase(0,h);
str+=cat;
}
cout << str << endl;
}
return 0;
}
| 0
| 26,332,575
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100010;
const int MAXM = 200010;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for(; !isdigit(ch); ch = getchar()) if(ch=='-') f=-1;
for(; isdigit(ch); ch = getchar()) x = (x*10)+(ch^48);
return x * f;
}
int st[MAXN], to[MAXM<<1];
int e, nxt[MAXM<<1];
inline void Add(int u, int v) {
to[++e] = v, nxt[e] = st[u];
st[u] = e;
}
int n, m, size;
bool vis[MAXN], col[MAXN];
ll ans;
inline bool dfs(int u) {
vis[u] = true, size++;
bool res = false;
int i;
for(i = st[u]; i; i = nxt[i]) {
int v = to[i];
if(vis[v]) {
if(col[v] == col[u]) res = true;
continue;
}
col[v] = col[u]^1, res |= dfs(v);
}
return res;
}
int main() {
int i;
n = read(), m = read();
for(i = 1; i <= m; i++) {
int u = read(), v = read();
Add(u, v), Add(v, u);
}
ll cnt0 = 0, cnt1 = 0, cnt2 = 0;
bool oc;
for(i = 1; i <= n; i++) {
if(vis[i]) continue;
size = 0, oc = dfs(i);
if(size == 1) cnt2++;
else if(oc) cnt1++;
else cnt0++;
}
ans = cnt2*((n-cnt2)<<1)+cnt2*cnt2;
ans += cnt0*cnt0*2+cnt1*cnt1+cnt0*cnt1*2;
printf("%lld\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define all(x) (x).begin() (x).end()
#define rall(x) (x).rbegin() (x).rend()
typedef long long ll;
int main(){
char a;
cin>>a;
if(isupper(a))cout<<"A"<<endl;
else cout<<"a"<<endl;
}
| 0
| 90,790,439
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> cnt(26);
for (char c : s) {
++cnt[c - 'a'];
}
int res = 1;
const int md = 1e9 + 7;
for (int i = 0; i < 26; i++) {
res = (long long) res * (cnt[i] + 1) % md;
}
cout << (res + md - 1) % md << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll h, w; cin >> h >> w;
char field[101][101];
ll fcnt[101][101];
fill(fcnt[0], fcnt[101], 999);
rep(i, h+1){
rep(j, w+1){
if(i == h || j == w) field[i][j] = 'X';
else cin >> field[i][j];
}
}
if(field[h-1][w-1] == '#') fcnt[h-1][w-1] = 1;
else fcnt[h-1][w-1] = 0;
for(ll x = w-1; x >= 0; --x){
for(ll y = h-1; y >= 0; --y){
if(x == w-1 && y == h-1) continue;
char now = field[y][x], down = field[y+1][x], right = field[y][x+1];
if(now == '#'){
if(right == down){
fcnt[y][x] = min(fcnt[y+1][x], fcnt[y][x+1]);
if(right == '.')
fcnt[y][x]++;
}else if(now == right && now != down)
fcnt[y][x] = min(fcnt[y][x+1], fcnt[y+1][x]+1);
else if(now != right && now == down)
fcnt[y][x] = min(fcnt[y][x+1]+1, fcnt[y+1][x]);
else if(right == 'X'){
if(now == down)
fcnt[y][x] = fcnt[y+1][x];
else
fcnt[y][x] = fcnt[y+1][x] + 1;
}else if(down == 'X'){
if(now == right)
fcnt[y][x] = fcnt[y][x+1];
else
fcnt[y][x] = fcnt[y][x+1] + 1;
}
}
else{
if(right == 'X')
fcnt[y][x] = fcnt[y+1][x];
else if(down == 'X')
fcnt[y][x] = fcnt[y][x+1];
else
fcnt[y][x] = min(fcnt[y+1][x], fcnt[y][x+1]);
}
}
}
printf("%lld\n", fcnt[0][0]);
return 0;
}
| 0
| 72,927,005
|
#include <bits/stdc++.h>
using namespace std;
bool lrp[2];
int lr[2];
void c(bool f,char s){
if(s=='u'){
if(lrp[f]==0){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=1;
}else {
if(lrp[f]==1){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=0;
}
}
int main(){
int n;
while(cin>>n&&n){
string s;
lrp[0]=lrp[1]=0;
lr[0]=lr[1]=0;
while(n--){
cin>>s;
if(s[0]=='l') c(0,s[1]);
else c(1,s[1]);
}
cout<<min(lr[0],lr[1])<<endl;
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define fi first
#define se second
#define debug(x) cout << #x << ": " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> void Print(vector<T> v) {
F0R(i, v.size()) {
cout << v[i] << ' ';
}
cout << newl;
}
#if 1
template<class Element, class Lazy>
class SegmentTree {
using A = function<Element(const Element&, const Element&)>;
using B = function<void(Element&, const Lazy&, int elementCount)>;
using C = function<void(Lazy&, const Lazy&)>;
using ECallback = function<void(const Element&, const Lazy&)>;
constexpr int parent(int v) {
return ((v + 1) >> 1) - 1;
}
constexpr bool hasChild(int v) {
return v <= size - 2;
}
constexpr int lchild(int v) {
return ((v + 1) << 1) - 1;
}
constexpr int rchild(int v) {
return (v + 1) << 1;
}
public:
SegmentTree(int size, A mergeElements, B applyLazyToElement, C mergeLazies) :
mergeTT(mergeElements), mergeTE(applyLazyToElement), mergeEE(mergeLazies) {
int n = 1;
while (n < size) n <<= 1;
this->size = n;
int segCount = n * 2 - 1;
es = vector<Element>(segCount);
ls = vector<Lazy>(segCount);
lazyFlag = vector<bool>(segCount, false);
lefts = vector<int>(segCount);
rights = vector<int>(segCount);
mp = vector<int>(segCount);
for (int i = 0, l = 0, w = n; i < segCount; i++) {
lefts[i] = l;
rights[i] = lefts[i] + w;
mp[i] = lefts[i] + (w >> 1);
if (rights[i] >= n) {
w >>= 1; l = 0;
}
else {
l += w;
}
}
}
void Set(const vector<Element>& vs) {
int index = 0;
while (hasChild(index)) index = lchild(index);
F0R(i, min<int>(vs.size(), this->size)) {
es[index++] = vs[i];
}
recalc();
}
void Set(const Lazy& value, int left, int right, int segIndex = 0) {
if (left <= lefts[segIndex] && rights[segIndex] <= right) {
add(segIndex, value);
resolve(segIndex);
}
else {
resolve(segIndex);
auto l = lchild(segIndex), r = rchild(segIndex);
if (left < mp[segIndex]) {
Set(value, left, right, l);
}
else {
resolve(l);
}
if (mp[segIndex] < right) {
Set(value, left, right, r);
}
else {
resolve(r);
}
es[segIndex] = mergeTT(es[l], es[r]);
}
}
Element Get(int left, int right, int segIndex = 0) {
if (right <= left) return Element();
resolve(segIndex);
if (left <= lefts[segIndex] && rights[segIndex] <= right) {
return es[segIndex];
}
else {
if (left < mp[segIndex]) {
if (mp[segIndex] < right) {
return mergeTT(Get(left, right, lchild(segIndex)), Get(left, right, rchild(segIndex)));
}
return Get(left, right, lchild(segIndex));
}
else if (mp[segIndex] < right) {
return Get(left, right, rchild(segIndex));
}
}
}
void Print(ECallback c) {
F0R(i, es.size()) {
c(es[i], ls[i]);
if (((i + 2) & (i + 1)) == 0) {
cout << "." << newl;
}
}
}
protected:
void resolve(int segIndex) {
if (!lazyFlag[segIndex]) return;
mergeTE(es[segIndex], ls[segIndex], rights[segIndex] - lefts[segIndex]);
if (hasChild(segIndex)) {
auto l = lchild(segIndex), r = rchild(segIndex);
add(l, ls[segIndex]);
add(r, ls[segIndex]);
}
ls[segIndex] = Lazy();
lazyFlag[segIndex] = false;
}
void add(int segIndex, const Lazy& value) {
if (lazyFlag[segIndex]) {
mergeEE(ls[segIndex], value);
}
else {
ls[segIndex] = value;
lazyFlag[segIndex] = true;
}
}
void recalc(int segIndex = 0) {
if (hasChild(segIndex)) {
recalc(lchild(segIndex));
recalc(rchild(segIndex));
es[segIndex] = mergeTT(es[lchild(segIndex)], es[rchild(segIndex)]);
}
}
A mergeTT;
B mergeTE;
C mergeEE;
vector<Element> es;
vector<Lazy> ls;
vector<bool> lazyFlag;
vector<int> lefts, rights, mp;
int size;
};
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
vector<vector<int>> G(N);
F0R(i, N - 1) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<pair<int, int>> lr(N);
int idx = 0;
auto dfs = [&](auto dfs, int v, int p)->void {
lr[v].first = idx++;
for (auto c : G[v]) {
if (c == p) continue;
dfs(dfs, c, v);
}
lr[v].second = idx;
};
dfs(dfs, 0, -1);
struct Elem {
i64 Val = 0;
};
struct Lazy {
i64 Add = 0;
};
auto c1 = [](const Elem& l, const Elem& r) -> Elem {
Elem o;
o.Val = l.Val;
return o;
};
auto c2 = [](Elem& l, const Lazy& r, int elementCount) -> void {
if (r.Add) {
l.Val += r.Add;
}
};
auto c3 = [](Lazy& l, const Lazy& r) -> void {
l.Add += r.Add;
};
auto qAdd = [](i64 value) -> Lazy {
Lazy l;
l.Add = value;
return l;
};
auto stPrint = [](const Elem& v, const Lazy& l)->void {
};
SegmentTree<Elem, Lazy> st(N, c1, c2, c3);
F0R(i, Q) {
int p, x;
cin >> p >> x;
p--;
st.Set(qAdd(x), lr[p].first, lr[p].second);
}
vector<int> rs(N);
idx = 0;
auto dfs2 = [&](auto dfs2, int v, int p)->void {
auto e = st.Get(idx, idx + 1);
rs[v] = e.Val;
idx++;
for (auto c : G[v]) {
if (c == p) continue;
dfs2(dfs2, c, v);
}
};
dfs2(dfs2, 0, -1);
F0R(i, N) {
cout << rs[i] << ' ';
}
}
#endif
| 0
| 98,555,007
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int a,b;
signed main() {
cin>>a>>b;
cout<<a-b+1<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,n) for (int i = a; i < (int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define whole(f,x,...) ([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
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;}
using ll = int_fast64_t;
using PII = pair<int, int>;
constexpr ll INF = (1e9);
constexpr ll MOD = (1e9+7);
int main() {
ll h, w, n; cin >> h >> w >> n;
map<PII, ll> mp;
REP(i,n) {
int a, b; cin >> a >> b;
a--; b--;
REP(j, 3) REP(k, 3) {
if (a - j >= 0 && b - k >= 0
&& a - j < h-2 && b - k < w-2) mp[make_pair(a-j, b-k)]++;
}
}
vector<ll> ans(10,0);
for (const auto &p : mp) {
ans[p.second]++;
}
ans[0] = (h-2)*(w-2) - whole(accumulate, ans, 0L);
REP(i,10) cout << ans[i] << endl;
return 0;
}
| 0
| 43,830,302
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 1e6 + 5;
int n;
int a[N];
int have[N], mark[N];
void work()
{
for(int i = 1; i < N; i++)
{
if(have[i])
{
if(have[i] >= 2)
mark[i] = 1;
for(int j = 2; i * j < N; j++)
mark[i * j] = 1;
}
}
}
int32_t main()
{
IOS;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
have[a[i]]++;
}
int ans = 0;
work();
for(int i = 1; i <= n; i++)
ans += !mark[a[i]];
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout<<"\n";
long long prime[1000000];
void sieve()
{
prime[0]=0;
prime[1]=0;
for(int i=2;i<1000000;i++)
prime[i]=1;
for(int i=2;i*i<1000000;i++)
if(prime[i]==1)
for(int j=i*i;j<1000000;j+=i)
prime[j]=0;
}
bool isPrime(int n)
{
if (n <= 1)
return false;
for (ll i = 2; i <= floor(sqrt(n)); i++)
if (n % i == 0)
return false;
return true;
}
int factorial(int n)
{
int f=1;
for(int i = 1;i<=n ; i++)
f = (f*i)%mod;
return f;
}
int gcd(int a, int b)
{
return !b ? a : gcd(b, a % b);
}
int lcm(int a, int b)
{
return (a / gcd(a, b)) * b;
}
int fastExponentiation(int n, int x, int modulo)
{
int res = 1;
while(x > 0)
{
if(x & 1)
res = (res*n) % modulo;
x = x >> 1;
n = (n * n) % modulo;
}
return res;
}
int power(int n , int p )
{
if(p==0)
return 1;
int res = power((n*n)%mod,p/2);
if(p%2==1)
res = (n*res)%mod;
return res;
}
bool isPowerOfTwo(int n)
{
return n && (!(n&(n-1)));
}
bool isSet(int n,int i)
{
return n & (1 << i);
}
bool valid_coordinate(ll x,ll y,ll n,ll m)
{
if(x<0 || y<0)
return false;
else if(x>=n || y>=m)
return false;
else
return true;
}
int sod(int n)
{
int sum=0;
while(n)
{
sum+=(n%10);
n/=10;
}
return sum;
}
void solve()
{
ll n;
cin>>n;
cout<<n*n<<endl;
}
int32_t main()
{
solve();
return 0;
}
| 0
| 66,471,961
|
#include<iostream>
using namespace std;
int main() {
long long int n, m;
cin>>n>>m;
cout<<n-m+1<< endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
void go(){
int n,k;cin>>n>>k;
int x=1;
while(n--) {
if(x*2<x+k) {
x*=2;
}else {
x+=k;
}
}
cout<< x;
}
int main(){
fastio();
cin.tie(0);
cout.tie(0);
go();
return 0;
}
| 0
| 59,942,993
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<iomanip>
#include<queue>
#include<stack>
#include<time.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define ggr getchar(); getchar();return 0;
using namespace std;
bool prime(ll n) {
if (n == 1)return false;
for (int i = 2; i*i <= n; i++) {
if (n%i == 0)return false;
}
return true;
}
ll a[114514], b[114514];
signed main() {
ll n, m;
cin >> n >> m;
ll memo1 = 0, memo2 = 0;
rep(i, n)cin >> a[i];
rep(i, m)cin >> b[i];
for (int i = 0; i < n; i++) {
if ((n - 1 - 2 * i) >= 0)memo1 += (a[n - 1 - i] - a[i])*(n - 1 - 2 * i);
memo1 %= 1000000007;
}
for (int i = 0; i < m; i++) {
if ((m - 1 - 2 * i) >= 0)memo2 += (b[m - 1 - i] - b[i])*(m - 1 - 2 * i);
memo2 %= 1000000007;
}
cout << memo1 * memo2 % 1000000007 << endl;
ggr
}
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using vc = vector<char>;
using pll = pair<ll, ll>;
template<class T> void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T> void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U> bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U> bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool even(T n) { return ! (n & 1); }
template<class T> bool odd(T n) { return n & 1; }
template<class T> ll rup(T a, T b) { return a % b ? a / b + 1 : a / b; }
template<class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll intpow(ll a, ll n, ll _mod=numeric_limits<ll>::max()) { ll p=1; while (n) { if (n&1) p=p*a%_mod; a=a*a%_mod; n>>=1; } return p; }
ll modc(ll a, char op, ll b, ll _mod=mod)
{
a %= _mod; b %= _mod; ll res = 1;
switch(op) {
case '+': res = (a + b) % _mod; break;
case '-': res = (a - b) % _mod; break;
case '*': res = a * b % _mod; break;
case '/': res = modc(a, '*', modc(b, '^', _mod-2, _mod), _mod); break;
case '^': res = intpow(a, b, _mod); break;
case 'P': rep(i, a-b+1, a+1) res = modc(res, '*', i, _mod); break;
case 'C': res = modc(modc(a, 'P', b, _mod), '/', modc(b, 'P', b, _mod)); break;
}
if (res < 0) { res += _mod; } return res;
}
int main()
{
ll N, M, K;
cin >> N >> M >> K;
rep(a, 0, M+1) {
ll b = M - a;
rep(x, 0, N+1) {
ll y = N - x;
if (a*x + b*y == K) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 70,156,741
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
char pn;
ll nm, nx, nd, ans;
cin>>nm>>nx>>pn>>nd;
nx = (nx*100) + nd;
ans = (nm*nx)/100;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define vi vector<int>
template <class t, class u>
bool chmax(t &a, u b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class t, class u>
bool chmin(t &a, u b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
int main()
{
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, n + 1)
{
if (i * r > n)
{
break;
}
rep(j, n + 1)
{
if (i * r + j * g > n)
{
break;
}
if ((n - i * r - j * g) % b == 0)
{
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 29,927,860
|
#include <bits/stdc++.h>
using namespace std;
const int LIM=1e5, MOD=1e9+7;
set<int> adjl[LIM+1];
vector<int> lvl(LIM+1,0);
long long int dp[LIM+1];
void dfs(int u)
{
long long int white_ways=1, black_ways=1;
for(int v: adjl[u])
{
if(lvl[v]==0)
{
lvl[v]=lvl[u]+1;
dfs(v);
white_ways*=dp[v];
white_ways%=MOD;
for(int w: adjl[v])
{
if(lvl[w]>lvl[v])
{
black_ways*=dp[w];
black_ways%=MOD;
}
}
dp[u]=(white_ways+black_ways)%MOD;
}
}
if(adjl[u].size()==1 && u!=1) dp[u]=2;
}
int main()
{
int n;
cin>>n;
if(n==1)
{
cout<<2;
return 0;
}
for(int i=1;i<n;i++)
{
int x, y;
cin>>x>>y;
adjl[x].insert(y);
adjl[y].insert(x);
}
lvl[1]=1;
dfs(1);
cout<<dp[1];
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
ll time2sec(string time){
ll hour, min, sec;
hour = 10*(time[0]-'0') + (time[1]-'0');
min = 10*(time[3]-'0') + (time[4]-'0');
sec = 10*(time[6]-'0') + (time[7]-'0');
return 3600*hour + 60*min + sec;
}
int main(){
while(true){
ll n;
cin >> n;
if(n == 0)break;
ll cnt[100000] = {};
rep(i, n){
string s, g;
cin >> s >> g;
cnt[time2sec(s)]++;
cnt[time2sec(g)]--;
}
rep(i, 86400)cnt[i+1] += cnt[i];
ll ans = 0;
rep(i, 86410)ans = max(ans, cnt[i]);
cout << ans << endl;
}
}
| 0
| 62,589,528
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
int i = 0;
while(i < min((int)s.length(),(int)t.length())){
if(s[i]<t[i]){cout << "Yes"; return 0;}
if(s[i]>t[i]){cout << "No"; return 0;}
i++;
}
if(i < (int)s.length()) cout << "No";
else if(i==(int)s.length() && i==(int) t.length()) cout << "No";
else cout << "Yes";
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin >> n;
vector<ll> a(n);
REP(i,n){
cin >> a[i];
}
vector<ll> dp(n);
dp[0]=1000;
FOR(i,1,n){
dp[i]=dp[i-1];
FOR(j,0,i){
chmax(dp[i],dp[j]+dp[j]/a[j]*(a[i]-a[j]));
}
}
cout << dp[n-1] << endl;
}
| 0
| 58,977,426
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s, t;
bool ok;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s >> t;
int n = s.length();
for (int i = 0; i < n; ++i) {
int idx = i;
ok = true;
for (int j = 0; j < n; ++j) {
if (s[idx] != t[j]) {
ok = false;
break;
}
idx = (idx + 1) % n;
}
if (ok)
break;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (auto &t : a) {
cin >> t;
}
vector<int> seen = a;
sort(seen.begin(), seen.end());
seen.resize(unique(seen.begin(), seen.end()) - seen.begin());
reverse(seen.begin(), seen.end());
seen.push_back(0);
map<int, int> moc;
map<int, int> occ;
for (int i = 0; i < n; i++) {
if (!moc.count(a[i])) moc[a[i]] = i;
occ[a[i]]++;
}
int cm = n;
int cnt = 0;
for (int i = 0; i + 1 < (int)seen.size(); i++) {
cm = min(cm, moc[seen[i]]);
cnt += occ[seen[i]];
ans[cm] += (seen[i] - seen[i + 1]) * cnt;
}
for (auto t : ans) {
cout << t << ' ';
}
cout << '\n';
}
| 0
| 68,316,370
|
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll l,r,i,j;
cin >> l >> r;
if(r-l>=2019){
cout << 0 << endl;
return 0;
}
ll ans=2000000000;
for(i=l;i<=r;i++){
for(j=i+1;j<=r;j++){
ans=min(ans,i*j%2019);
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N;
cin>>N;
int A[N];
for(int i=0;i<N;++i) cin>>A[i];
int index = -1;
for(int i=0;i<N-1;++i) {
if(A[i]!=A[i+1]) {
index = i;
break;
}
}
if(index==-1) {
cout<<1000<<endl;
return 0;
}
bool up;
ll money, kabu;
if(A[index]<A[index+1]) {
money = 1000%A[index];
kabu = 1000/A[index];
up = true;
}
else {
money = 1000;
kabu = 0;
up = false;
}
for(int i=index+1;i<N-1;++i) {
if(up) {
if(A[i]>A[i+1]) {
money += kabu*A[i];
kabu = 0;
up = false;
}
}
else {
if(A[i]<A[i+1]) {
kabu = money/A[i];
money = money%A[i];
up = true;
}
}
}
money += kabu*A[N-1];
cout<<money<<endl;
}
| 0
| 48,555,196
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a,b,x;
cin >> a >> b >> x;
bool ans = false;
if (a <= x && a+b > x) ans = true;
cout << ((ans) ? "YES" : "NO") << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) for(ll i=begin;i<=end;i++)
#define rlp(i,begin,end) for(ll i=end;i>=begin;i--)
#define prec(n) fixed<<setprecision(n)
#define initial(a,i) memset(a,i,sizeof(a))
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define F first
#define S second
#define all(a) (a).begin(),(a).end()
#define BPC(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
ll gcd(ll a,ll b) {if (a==0) return b;return gcd(b%a,a);}
ll power(ll x,ll n)
{
ll result = 1;
while (n)
{
if (n & 1)
result = result * x;
n = n / 2;
x = x * x;
}
return result;
}
void solution(ll compte)
{
ll n,k;
cin>>n>>k;
ll arr[n];
for(ll i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
ll ans = 0;
for(ll i=0;i<k;i++)
{
ans+=arr[i];
}
cout<<ans<<"\n";
}
int main()
{
ll compte = 1;
solution(compte);
compte++;
return 0;
}
| 0
| 76,264,320
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
if(a%3==0 || b%3==0 || (a+b)%3==0)
cout << "Possible" << endl;
else cout << "Impossible" << endl;
return 0;
}
|
#include "bits/stdc++.h"
#define MOD 1000000007
#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()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
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;
}
ll modinv(ll a, ll mod){
ll b=mod, u=1, v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a, b);
u-=t*v; swap(u, v);
}
u%=mod;
if(u<0)u+=mod;
return u;
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
if(n%i==0)res=false;
return res;
}
int main(){
ll N;
cin >> N;
llvec s(N);
ll A=0,B=0;
rep(i, N){
ll a, b;
cin >> a >> b;
A+=a;
B+=b;
s[i] = a+b;
}
sort(rALL(s));
ll ans = -B;
rep(i, N){
if(i%2==0){
ans += s[i];
}
}
cout << ans <<endl;
return 0;
}
| 0
| 43,450,513
|
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputLongArray(a,N) long a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputIntArray2(a,b,N) int a[N]; int b[N]; for(int i=0;i<N;i++){cin >> a[i] >> b[i];}
#define output(answer) cout << answer << endl;
#define fN(i,N) for(int i=0; i<N; i++)
#define fSE(i,s,e) for(int i=s; i<=e; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i,N) for(int i=0; i<N; i++)
#define cinv(v,N) vector<int> v(N); for(int i=0; i<N; i++){ cin >> v[i]; }
#define mt make_tuple
#define vll vector<long long int>
#define vvll vector<vector<long long int>>
#define all(v) (v).begin(),(v).end()
const ll MOD2 = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K; cin >> N >> K;
vll a(N); FOR(i,N){ cin >> a[i]; a[i]--; a[i] %= K; }
ll ans = 0;
vll s(N+1); s[0] = 0; FOR(i,N){ s[i+1] = (s[i]+a[i])%K; }
map<ll,ll> mp;
FOR(i,N+1){
mp[s[i]] ++;
if(i>=K){
mp[s[i-K]] --;
}
ans += (mp[s[i]]-1);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) {
cin >> l[i] >> r[i];
}
vector<int> left(m), right(m);
int ans;
bool flag = true;
rep(i, m) {
if (i == 0) {
left[i] = l[i];
right[i] = r[i];
} else {
if (l[i] > right[i-1] || r[i] < left[i-1]) {
flag = false;
break;
} else {
if (l[i] > left[i-1]) left[i] = l[i];
else left[i] = left[i-1];
if (r[i] < right[i-1]) right[i] = r[i];
else right[i] = right[i-1];
}
}
}
if (flag) {
if (right[m-1] <= n) {
ans = right[m-1] - left[m-1] + 1;
} else if (left[m-1] >= n) {
ans = n - left[m-1] + 1;
} else {
ans = 0;
}
} else {
ans = 0;
}
cout << ans << endl;
}
| 0
| 59,856,212
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b / 2 * 2 == a * b * 0.5 * 2 ) {
cout << "Even" << endl;
}
if (a * b / 2 * 2 != a * b * 0.5 * 2 ) {
cout << "Odd" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i < (n); i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define ALL(i) (i).begin(),(i).end()
#define RALL(i) (i).begin(),(i).end(),greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
#define TENFIVE2 200005
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double EPS = 1e9 + 7;
const double PI = acos(-1);
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
inline int in(){int x;std::cin>>x;return x;}
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int> >;
using vl = vector<long long>;
using vp = vector<pint>;
template <typename T> void print(T x) { std::cout << x << '\n'; }
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
signed main(){
int r, D, x;
cin>>r>>D>>x;
rep(i,10){
int newx = r*x -D;
print(newx);
x = newx;
}
return 0;
}
| 0
| 44,854,999
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,ans=INT_MAX;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i];
for(int i=-100;i<=100;i++)
{
int cost=0;
for(int j=0;j<v.size();j++)
cost=cost+pow(i-v[j],2);
if(cost<ans)
ans=cost;
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i < int(n); ++i)
#define repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((a) <= (x) && (x) < (b))
#define OUT(a, x, b) ((x) < (a) || (x) < (b))
typedef long long ll;
typedef long double ld;
const ll INF = 1e18;
const ll MOD = 1000000007;
int main()
{
string S;
char c;
int ans = 0;
cin >> S;
c = S[0];
rep1(i, S.length())
{
if (c != S[i])
{
c = S[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 4,099,388
|
#include <iostream>
#include <stack>
int main() {
std::stack<int> st;
int inp;
while (std::cin >> inp)
{
if (inp == 0) {
std::cout << st.top() << std::endl;
st.pop();
}
else {
st.push(inp);
}
}
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j,k
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(),a.end())
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
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;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
llfor;
int main(){
ll n;sc(n);
vector<string>s;
string t;
rep(i,0,n){
sc(t);
push(s,t);
}
ll len;
ll cnt[100][100];
rep(i,0,100){
rep(j,0,100){
cnt[i][j]=0;
}
}
rep(i,0,n){
t=s[i];
len=t.length();
rep(j,0,len){
cnt[i][t[j]-'a']++;
}
}
ll k;bool flag=false;
string ans;
char b;
rep(i,0,26){
ll tmp=0;
flag=false;
while(!flag){
tmp++;
rep(j,0,n){
if(cnt[j][i]<tmp){
flag=true;break;
}
}
if(!flag){
b='a'+i;
ans+=b;
}
}
}
sort(ans);
pr(ans);
return 0;}
| 0
| 90,525,974
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> length(N);
for(int i = 0; i < N; i++) cin >> length.at(i);
sort(length.begin(), length.end(), greater<int>());
int sum = 0;
for(int i = 0; i < K; i++){
sum += length.at(i);
}
cout << sum << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int> P;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
vector<ll> a(n);
for(int i=0;i<n;i++)cin>>a[i];
int m;cin>>m;
vector<vector<ll>> dp(100,vector<ll>(n,-1));
for(int i=0;i<n;i++){
ll tmp=a[i]+m;
int ite=upper_bound(all(a),tmp)-a.begin();
ite--;
dp[0][i]=ite;
}
for(int i=0;i<99;i++){
for(int j=0;j<n;j++){
dp[i+1][j]=dp[i][dp[i][j]];
}
}
int q;
cin>>q;
while(q--){
int a,b;
cin>>a>>b;
a--;b--;
if(a>b)swap(a,b);
int l=-1,r=200000;
while(r-l!=1){
int mid=(l+r)/2;
int tmp=mid;
int j=0;
bool can=false;
int now=a;
while(tmp!=0){
if(tmp&1){
now=dp[j][now];
}
tmp>>=1;
j++;
if(now>=b)can=true;
}
if(can)r=mid;
else l=mid;
}
cout<<r<<endl;
}
}
| 0
| 11,648,524
|
#include <bits/stdc++.h>
#define int long long
#define INF 1e+9
using namespace std;
signed main(){
int n,a[100000],ma = 0,b = INF;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
ma = max(ma,a[i]);
}
bool flag = false;
for(int i = 0;i < n;i++){
if(!flag && a[i] == ma) flag = true;
else if(min(abs(b - ma / 2),abs(b - (ma + 1) / 2)) > min(abs(a[i] - ma / 2),abs(a[i] - (ma + 1) / 2))) b = a[i];
}
cout << ma << " " << b << endl;
return 0;
}
|
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a[ohara], b[ohara], c, d, tmp, m, h, w, x, y, sum, k, q;
priority_queue<P, vector<P>, greater<P>> que;
U_MAP mem;
ll decrease = LINF;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i] >> b[i];
rep(i, n) {
sum += a[i];
if (a[i] > b[i]) decrease = min(decrease, b[i]);
}
ans = sum - decrease;
ans = (decrease == LINF ? 0 : ans);
Cout(ans);
return 0;
}
| 0
| 84,275,390
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string s, e, ans = "NO";
cin >> s;
for(int i = 0; i < s.size(); i++){
for(int j = 0; j <= s.size() - i; j++){
e = s;
if(e.erase(i,j) == "keyence") {
ans = "YES";
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
const int MOD = 1000000007;
typedef pair<int,int> P;
ll gcd(ll a,ll b){
if (a%b == 0){
return b;
}
else{
return gcd(b,a%b);
}
}
ll lcm(ll a,ll b){
return a /gcd(a,b) * b;
}
bool is_prime(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 p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
int binary(int bina){
int ans = 0;
for (int i = 0; bina>0 ; i++)
{
ans = ans+(bina%2)*pow(10,i);
bina = bina/2;
}
return ans;
}
int main() {
int n;
cin >> n;
if (n >= 100 && n <= 111) cout << 111 << endl;
if (n >= 112 && n <= 222) cout << 222 << endl;
if (n >= 223 && n <= 333) cout << 333 << endl;
if (n >= 334 && n <= 444) cout << 444 << endl;
if (n >= 445 && n <= 555) cout << 555 << endl;
if (n >= 556 && n <= 666) cout << 666 << endl;
if (n >= 667 && n <= 777) cout << 777 << endl;
if (n >= 778 && n <= 888) cout << 888 << endl;
if (n >= 889 && n <= 999) cout << 999 << endl;
}
| 0
| 50,582,793
|
#include <stdio.h>
#include <string.h>
int main(){
char arry[20];
scanf("%s",&arry);
int ln=strlen(arry),i;
for(i=ln-1;i>=0;i--)
{
printf("%c",arry[i]);
}
printf("\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
int ans[N];
int visited[N];
int n, m;
vector<int> graph[N];
int main(){
ios::sync_with_stdio(false);
cin.tie();
cin>>n>>m;
for(int i = 0; i < m; i++){
int a, b;
cin>>a>>b;
a--; b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
queue<int> q;
memset(visited, 0, sizeof(visited));
q.push(0);
ans[0] = 0;
visited[0] = 1;
while(!q.empty()){
int p = q.front();
q.pop();
if(visited[p] == 1)
for(int i = 0; i < graph[p].size(); i++){
if(visited[graph[p][i]] == 0){
q.push(graph[p][i]);
ans[graph[p][i]] = p;
visited[graph[p][i]] = 1;
}
}
}
for(int i = 0; i < n; i++){
if(visited[i] == 0){
cout<<"No";
return 0;
}
}
cout<<"Yes"<<endl;
for(int i = 1; i < n; i++){
cout<<ans[i]+1<<endl;
}
return 0;
}
| 0
| 75,450,804
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n,m; cin >> n >> m;
if(n % 2) {
rep(i,m) cout << 1+i << " " << n-1-i << endl;
return 0;
}
int a = n/2-1;
vector<vector<int>> ans(a);
if(n%4 == 0) {
rep(i,a/2) {
ans[i].push_back(i+1);
ans[i].push_back(n-1-i);
}
rep(i,a/2+1){
ans[i+a/2].push_back(i+a/2+1);
ans[i+a/2].push_back(n-2-a/2-i);
}
}else{
rep(i,a){
ans[i].push_back(i+1);
ans[i].push_back(n-2-i);
}
rep(i,a/2) ans[i][1]++;
}
rep(i,m) cout << ans[i][0] << " " << ans[i][1] << endl;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uld = unsigned long long;
using P = pair<int,int>;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
template<class T> inline bool chmax(T &a,T& b){if(a < b){a = b; return true;} else return false;}
template<class T> inline bool chmin(T &a,T& b){if(a > b){a = b; return true;} else return false;}
int main(){
string a, b;
cin >> a >> b;
bool check = true;
if(a.size() == b.size()){
rep(i,a.size()){
if(a[i] == b[i]) continue;
else{
check = false;
cout << (a[i] > b[i] ? "GREATER" : "LESS") << endl;
break;
}
}
}
else{
check = false;
cout << (a.size() > b.size() ? "GREATER" : "LESS") << endl;
}
if(check) cout << "EQUAL" << endl;
}
| 0
| 87,155,051
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(b==1){
cout<<0<<endl;
}
else{
cout<<a-b<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
template <class Abel> struct BIT {
vector<Abel> dat[2];
Abel UNITY_SUM = 0;
BIT(int n) { init(n); }
void init(int n) { for (int iter = 0; iter < 2; ++iter) dat[iter].assign(n + 1, UNITY_SUM); }
inline void sub_add(int p, int a, Abel x) {
for (int i = a; i < (int)dat[p].size(); i += i & -i)
dat[p][i] = dat[p][i] + x;
}
inline void add(int a, int b, Abel x) {
sub_add(0, a, x * -(a - 1)); sub_add(1, a, x); sub_add(0, b, x * (b - 1)); sub_add(1, b, x * (-1));
}
inline Abel sub_sum(int p, int a) {
Abel res = UNITY_SUM;
for (int i = a; i > 0; i -= i & -i) res = res + dat[p][i];
return res;
}
inline Abel sum(int a, int b) {
return sub_sum(0, b - 1) + sub_sum(1, b - 1) * (b - 1) - sub_sum(0, a - 1) - sub_sum(1, a - 1) * (a - 1);
}
void print() {
for (int i = 1; i < (int)dat[0].size(); ++i) cout << sum(i, i + 1) << ",";
cout << endl;
}
};
signed main()
{
gearup;
ll n,k; cin >> n >> k;
vl a(n);
rep(i,n)cin>>a[i];
rep(j,min(1LL*100,k)){
BIT<int> bit(n+1);
rep(i,n){
ll left = max(i-a[i],0LL);
ll right = min(n,i+a[i]+1);
bit.add(left+1,right+1,1);
}
rep(i,n){
a[i] = bit.sum(i+1,i+2);
}
}
rep(i,n){
if(i) cout << " ";
cout << a[i];
}
cout << endl;
}
| 0
| 13,340,251
|
#include <iostream>
using namespace std;
int main(){
char b;
cin >> b;
switch(b)
{
case 'A':cout << 'T';break;
case 'C':cout << 'G';break;
case 'G':cout << 'C';break;
case 'T':cout << 'A';break;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
long long n;
cin>>n;
if(n==1){
cout<<"0";
return 0;
}
long long a,count=0,i;
a=sqrt(n)+1;
map<int,int> mp;
for(i=2;i<=a;i++){
while(n%i==0){
n/=i;
mp[i]++;
a=sqrt(n)+1;
}
}
if(n!=1){
mp[n]++;
}
int ans=0;
for(auto a:mp){
for(int i=1;a.second-i>=0;i++){
a.second-=i;
ans++;
}
}
cout<<ans;
}
| 0
| 71,176,729
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr ll INF = (1LL << 55);
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> g(n, vector<int>(n, 0));
rep(i,m) {
int a, b;
cin >> a >> b;
a--; b--;
g[a][b] = 1;
g[b][a] = 1;
}
vector<int> v(n);
rep(i,n) v[i] = i;
int res = 0;
do {
int ok = 1;
for (int i = 0; i < n-1; i++) {
ok &= (g[v[i]][v[i+1]]);
}
res += ok;
} while (next_permutation(v.begin() + 1, v.end()));
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int N = 50;
int n, k, v[N];
int main() {
cin >> n >> k;
rep(i, n) cin >> v[i];
int ans = 0;
for (int l = 0; l <= n; l++) {
for (int r = 0; l + r <= min(n, k); r++) {
vector<int> taken;
rep(i, l) taken.push_back(v[i]);
rep(i, r) taken.push_back(v[n - i - 1]);
sort(taken.begin(), taken.end());
int now = 0;
rep(i, taken.size()) now += taken[i];
rep(i, k - l - r) {
if (i >= taken.size()) break;
if (taken[i] >= 0) break;
now -= taken[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
return 0;
}
| 0
| 47,045,438
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
int a,b,c;
cin>>a>>b>>c;
if(c>=a && c<=b){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
signed main(){
solve();
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define MAX_INT 15
#define fi(a, b, c, d) for(int a = b; a < c; a += d)
#define fl(a, b, c, d) for(ll a = b; a < c; a += d)
#define fei(a, b, c, d) for(int a = b; a <= c; a += d)
#define fel(a, b, c, d) for(ll a = b; a <= c; a += d)
#define quit exit(0)
ll N, M, A, B, C;
ll arr[MAX_INT], arr1[MAX_INT], data[MAX_INT];
vector<ll> V;
ll modSum(ll A, ll B, ll C) {
return (A + B) % C;
}
ll modMul(ll A, ll B, ll C) {
return (A * B) % C;
}
int main() {
scanf("%lld %lld", &N, &M);
string S = "";
cin >> S;
ll rem = 0;
ll val = 1;
ll ans = 0;
ll ans2 = 0;
ll ans5 = 0;
ll ans10 = 0;
unordered_map<ll, ll> mp;
mp[0]++;
if(M == 2 || M == 5 || M == 10) {
fi(i, 0, S.size(), 1) {
if((S[i] - '0') % 2 == 0) {
ans2 += i + 1;
}
if((S[i] - '0') % 5 == 0) {
ans5 += i + 1;
}
if((S[i] - '0') % 10 == 0) {
ans10 += i + 1;
}
}
}
if(M == 2) {
cout << ans2 << "\n";
quit;
}
if(M == 5) {
cout << ans5 << "\n";
quit;
}
if(M == 10) {
cout << ans10 << "\n";
quit;
}
for(int i = S.size() - 1; i >= 0; i--) {
rem = (modSum(rem, modMul(val, (S[i] - '0'), M), M));
ans += mp[rem];
mp[rem]++;
val = modMul(10, val, M);
}
cout << ans << "\n";
return 0;
}
| 0
| 91,687,075
|
#include <iostream>
using namespace std;
int main(void)
{
int r, D, x;
cin >> r >> D >> x;
for (int count = 0; count < 10; count++)
{
x = r * x - D;
cout << x << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int N;
string s;
cin>>N>>s;
int l= 0;
int r = 0;
for (int i=0; i<N; i++){
if (s[i]=='(') l++;
else l--;
if (l<0){
l=0;
r++;
}
}
while(r--) cout<<'(';
cout << s;
while(l--) cout<<')';
}
| 0
| 59,282,915
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, m, x; cin >> n >> m >> x;
vector<int> p(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i=0; i<n; i++) {
cin >> p[i];
for (int j=0; j<m; j++) {
cin >> a[i][j];
}
}
int mn = INT_MAX;
for (int i=0; i<(1<<n); i++) {
int cost = 0;
vector<int> u(m, 0);
for (int j=0; j<n; j++) {
if ((i>>j)&1==1) {
cost += p[j];
for (int k=0; k<m; k++) {
u[k] += a[j][k];
}
}
}
if (*min_element(u.begin(), u.end()) >= x) {
mn = min(mn, cost);
}
}
if (mn < INT_MAX) {
cout << mn;
}
else {
cout << -1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
ll gcd(ll a,ll b) {return b ? gcd(b,a%b) : a;}
const long long INF = 1LL << 60;
const int mod = 1000000007;
const double PI = acos(-1.0);
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int main () {
ll a,b;
cin >> a>>b;
ll A,B;
if(a%2==0&&b%2==0){
if((b-a)/2%2==0){
cout << b <<endl;
return 0;
}
else {
ll ans = b^1;
cout << ans <<endl;
return 0;
}
}
if(a%2==0&&b%2==1){
if((b-a+1)/2%2==0){
cout << 0 <<endl;
return 0;
}
else {
cout << 1 <<endl;
return 0;
}
}
if(a%2==1&&b%2==0){
if((b-1-a)/2%2==0){
ll ans = a^b;
cout << ans <<endl;
return 0;
}
else {
ll ans = a^b^1;
cout << ans <<endl;
return 0;
}
}
if(a%2==1&&b%2==1)
{
if((b-a)/2%2==0){
cout << a<<endl;
return 0;
}
else{
ll ans = a^1;
cout << ans <<endl;
return 0;}
}
}
| 0
| 18,216,589
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll r,g,b,n;
cin >> r >> g >> b >> n;
ll cnt=0;
rep(i,n+1){
rep(j,n+1){
if(i*r+g*j<=n&&(n-(i*r+g*j))%b==0){
cnt++;
}
}
}
cout << cnt << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define rforn(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define SQ(a) (a)*(a)
int main(){
fast;
int n, l;
cin >> n >> l;
vector<string> v;
for(int i = 0; i < n; i++){
string s;
cin >> s;
v.push_back(s);
}
sort(v.begin(),v.end());
for(string s : v){
cout << s;
}
return 0;
}
| 0
| 73,439,286
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define sayyes cout<<"Yes"<<endl;
#define sayno cout<<"No"<<endl;
#define vv(a,b) vector< vector<int> > v(a,vector<int>(b,0));
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int mod =1e9+7;
const int di[]={-1,0,1,0},dj[]={0,-1,0,1};
int main()
{
int h,w;
cin>>h>>w;
vector< vector<char> > m(h,vector<char>(w));
queue<P> que;
vector< vector<int> > depth(h,vector<int>(w,-1));
rep(i,h)
{
rep(j,w)
{
cin>>m[i][j];
if(m[i][j]=='#')
{
que.push(P(i,j));
depth[i][j]=0;
}
}
}
while(!que.empty())
{
P now=que.front();
que.pop();
rep(i,4)
{
P np=P(now.first+di[i],now.second+dj[i]);
if(np.first>=0 && np.first<h && np.second>=0 && np.second<w && m[np.first][np.second]=='.')
{
m[np.first][np.second]='#';
que.push(np);
depth[np.first][np.second]=depth[now.first][now.second]+1;
}
}
}
int ans=0;
rep(i,h)rep(j,w)
{
ans=max(ans,depth[i][j]);
}
cout<<ans;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
void solve(long long H, long long W, long long A, long long B){
rep(i,H-B) {
rep(j,W-A) {
std::cout << 1;
}
rep(j,A) {
std::cout << 0;
}
std::cout << std::endl;
}
rep(i,B) {
rep(j,W-A) std::cout << 0;
rep(j,A) std::cout << 1;
std::cout << std::endl;
}
}
int main(){
long long H;
scanf("%lld",&H);
long long W;
scanf("%lld",&W);
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
solve(H, W, A, B);
return 0;
}
| 0
| 75,143,057
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
std::vector<int> d(n);
rep(i,n) cin >> d.at(i);
int total = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
total += d.at(i) * d.at(j);
}
}
cout << total << endl;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define mem(a,b) memset(a, b, sizeof a)
#define vii vector<pair<int,int>>
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr <<#x<<" = "<<x<<"\n"
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for (int i = a; i<b; ++i)
#define len(s) s.length()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int power(int a,int b,int m=mod)
{int ans=1;while(b>0){if(b&1)ans=(ans*a)%m;a=(a*a)%m;b>>=1;}
return ans;}
void angshuGod()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 1e5+1;
const double pi = acos(-1);
void solve(){
int n;
cin>>n;
vi v(n);
mii m;
fo(i,n){
cin>>v[i];
m[v[i]]++;
}
int cnt = 0;
for(auto i : m){
if(i.ss>1){
cnt += (i.ss*(i.ss-1))/2;
}
}
for(int i = 0;i<n;i++){
if(m[v[i]]<2) cout<<cnt<<"\n";
else if(m[v[i]]==2) cout<<cnt-1<<"\n";
else{
int x = m[v[i]];
cout<<cnt - x*(x-1)/2 + (x-1)*(x-2)/2<<"\n";
}
}
}
int32_t main()
{
angshuGod();
int t;
t = 1;
while(t--){
solve();
}
return 0;
}
| 0
| 75,375,727
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[7],b,c,d;
for(int i=1;i<=6;i++){
cin>>a[i];
}
cin>>b;
for(int i=0;i<b;i++){
cin>>c>>d;
if(c==a[1]){
if(d==a[2])cout<<a[3]<<endl;
if(d==a[3])cout<<a[5]<<endl;
if(d==a[5])cout<<a[4]<<endl;
if(d==a[4])cout<<a[2]<<endl;
}else if(c==a[2]){
if(d==a[1])cout<<a[4]<<endl;
if(d==a[4])cout<<a[6]<<endl;
if(d==a[6])cout<<a[3]<<endl;
if(d==a[3])cout<<a[1]<<endl;
}else if(c==a[3]){
if(d==a[1])cout<<a[2]<<endl;
if(d==a[2])cout<<a[6]<<endl;
if(d==a[6])cout<<a[5]<<endl;
if(d==a[5])cout<<a[1]<<endl;
}else if(c==a[4]){
if(d==a[1])cout<<a[5]<<endl;
if(d==a[5])cout<<a[6]<<endl;
if(d==a[6])cout<<a[2]<<endl;
if(d==a[2])cout<<a[1]<<endl;
}else if(c==a[5]){
if(d==a[1])cout<<a[3]<<endl;
if(d==a[3])cout<<a[6]<<endl;
if(d==a[6])cout<<a[4]<<endl;
if(d==a[4])cout<<a[1]<<endl;
}else if(c==a[6]){
if(d==a[2])cout<<a[4]<<endl;
if(d==a[4])cout<<a[5]<<endl;
if(d==a[5])cout<<a[3]<<endl;
if(d==a[3])cout<<a[2]<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq;
typedef priority_queue<ll> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int L=a+b,R=c+d;
if(L>R){
cout<<"Left"<<endl;
}else if(L<R){
cout<<"Right"<<endl;
}else{
cout<<"Balanced"<<endl;
}
}
| 0
| 30,392,242
|
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int main(){
string s,str1,str2;
map<string,int> mp;
while(cin >> s){
if(mp.find(s) == mp.end()) mp[s] = 1;
else mp[s]++;
if(mp[s] > mp[str1]) str1 = s;
if(s.size() > str2.size()) str2 = s;
}
cout << str1 << ' ' << str2 << endl;
return (0);
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
void yes(int n){
cout << "Yes" << endl;
}
void no (int n){
cout << "No" << endl;
}
ll cel (ll a, ll b){
if (a % b == 0) return a / b;
else return a / b + 1;
}
ll gcds(ll a, ll b){
ll c = a % b;
while (c != 0){
a = b;
b = c;
c = a % b;
}
return b;
}
vector<ll> zen(51);
vector<ll> pat(51);
ll ans (int n, ll k, ll ima){
if (k == 0LL) return ima;
if (n == 0) return ima + 1LL;
if (k == 1LL) return ima;
if (1LL < k && k < zen[n-1]+2LL) return ans(n-1,k-1LL,ima);
if (k == zen[n-1]+2LL) return ima + pat[n-1] + 1LL;
if (zen[n-1]+2LL < k && k < zen[n]) return ans(n-1,k-zen[n-1]-2LL,ima+pat[n-1]+1LL);
if (k == zen[n]) return ima + pat[n];
}
int main() {
int n; cin >> n;
ll k; cin >> k;
zen[0] = 1LL;
pat[0] = 1LL;
rep(i,50){
zen[i+1] = 2LL * zen[i] + 3LL;
pat[i+1] = 2LL * pat[i] + 1LL;
}
cout << ans(n,k,0LL) << endl;
}
| 0
| 21,105,769
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
}
int pos = -1;
for (int i = 0; i < N - 1; i++){
if (a[i] + a[i + 1] >= L){
pos = i + 1;
}
}
if (pos == -1){
cout << "Impossible" << endl;
} else {
cout << "Possible" << endl;
for (int i = 1; i < pos; i++){
cout << i << endl;
}
for (int i = N - 1; i > pos; i--){
cout << i << endl;
}
cout << pos << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int N=S.size();
string T="keyence";
int count=0;
for(int i=0;i<7;i++){
if(S.at(i)==T.at(i)){
count++;
}else{
break;
}
}
for(int i=6;i>=0;i--){
if(S.at(N-7+i)==T.at(i)){
count++;
}else{
break;
}
}
if(count>=7){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
}
| 0
| 98,214,637
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<int> A(M),B(M);
for(int i=0;i<M;i++)
cin >> A[i] >> B[i];
vector<vector<int>> G(N+1);
for(int i=0;i<M;i++){
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
queue<int> que;
que.push(1);
int nowdist = 1;
const int NOT_REACHED = 1000000;
int dists[N+1],signs[N+1];
for(int i=0;i<=N;i++){
dists[i] = NOT_REACHED;
signs[i] = 0;
}
while(!que.empty()){
int now = que.front();
que.pop();
for(auto v : G[now]){
if(dists[v] > nowdist){
que.push(v);
dists[v] = nowdist;
signs[v] = now;
}
}
}
cout << "Yes" << endl;
for(int i=2;i<=N;i++){
cout << signs[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a[3][3];
rep(i,3) rep(j,3) cin >> a[i][j];
int n;
cin >> n;
rep(i,n){
int b;
cin >> b;
rep(j,3) rep(k,3) if(a[j][k] == b) a[j][k] = 0;
}
rep(i,3){
if(a[i][0] == a[i][1] && a[i][1] == a[i][2]){
cout << "Yes" << endl;
return 0;
}
}
rep(j,3){
if(a[0][j] == a[1][j] && a[1][j] == a[2][j]){
cout << "Yes" << endl;
return 0;
}
}
if(a[0][0] == a[1][1] && a[1][1] == a[2][2]){
cout << "Yes" << endl;
return 0;
}
if(a[0][2] == a[1][1] && a[1][1] == a[2][0]){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
| 0
| 71,675,405
|
#include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
if(a<b &&b<c){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
using namespace std;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e7 * 2, S2 = 1e7 * 2;
char nt(char a) {
if (a == 'S') return 'W';
return 'S';
}
int main() {
fastInp;
ll n;
string s;
cin >> n;
cin >> s;
string ans;
for (int i = 0; i < 4; i++) {
ans.clear();
if (i % 2 == 0) {
ans.push_back('S');
}
else {
ans.push_back('W');
}
if (i / 2 == 0) {
ans.push_back('S');
}
else {
ans.push_back('W');
}
ans.resize(n);
for (int i = 1; i < n - 1; i++) {
if (ans[i] == 'S') {
if (s[i] == 'o') {
ans[i + 1] = ans[i - 1];
}
else {
ans[i + 1] = nt(ans[i - 1]);
}
}
if (ans[i] == 'W') {
if (s[i] == 'o') {
ans[i + 1] = nt(ans[i - 1]);
}
else {
ans[i + 1] = (ans[i - 1]);
}
}
}
bool flag = true;
if (ans[n - 1] == 'S') {
if (ans[0] != ans[n - 2] && s[n - 1] == 'o') flag = false;
if (ans[0] == ans[n - 2] && s[n - 1] == 'x') flag = false;
}
if (ans[n - 1] == 'W') {
if (ans[0] != ans[n - 2] && s[n - 1] == 'x') flag = false;
if (ans[0] == ans[n - 2] && s[n - 1] == 'o') flag = false;
}
bool flag2 = true;
if (ans[0] == 'S') {
if (ans[n - 1] != ans[1] && s[0] == 'o') flag2 = false;
if (ans[n - 1] == ans[1] && s[0] == 'x') flag2 = false;
}
if (ans[0] == 'W') {
if (ans[n - 1] != ans[1] && s[0] == 'x') flag2 = false;
if (ans[n - 1] == ans[1] && s[0] == 'o') flag2 = false;
}
if (flag2 && flag) {
cout << ans;
return 0;
}
}
cout << "-1";
return 0;
}
| 0
| 13,618,829
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
int ans=0;
rep(i,n){
a[i]--;
if(ans==a[i]){
ans++;
}
}
if(ans==0){
cout<<"-1"<<endl;
return 0;
}
cout<<n-ans<<endl;
}
|
#include <iostream>
using namespace std;
int main ()
{
int n,x,c = 0;
while (1)
{
c=0;
cin >> n >> x;
for (int q = 1; q <= n; q++)
{
for (int e = q + 1; e <= n; e++)
{
for (int y = e + 1; y <= n; y++)
{
if (q + e + y == x)
{
c++;
}
}
}
}
if (n == 0 && x == 0)
{
break;
}
cout << c << endl;
}
return 0;
}
| 0
| 94,347,228
|
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define DEBUG(x) cerr << #x << ": " << x << "\n"
#define DEBUG2(x, y) cerr << #x << ": " << x << " " << #y << ": " << y << "\n"
#define DEBUG3(x, y, z) \
cerr << #x << ": " << x << " " << #y << ": " << y << " " << #z << ": " << z \
<< "\n"
#define PRINTALL(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << "\n";
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair< int, int >
#define ld long double
using namespace std;
template < class T > bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template < class T > bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template < class T > using vec = std::vector< T >;
template < class T > void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF = 1061109567, INF2 = INF * INF;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N, K;
cin >> N >> K;
vec< int > a(N);
REP(i, N) cin >> a[i];
vec< int > l(N + 1, 0);
vec< int > r(N + 1, 0);
REP(i, N) {
l[i + 1] = l[i] + (a[i] > 0 ? a[i] : 0);
r[i + 1] = r[i] + (a[N - 1 - i] > 0 ? a[N - 1 - i] : 0);
}
int val = 0;
REP(i, K) val += a[i];
int ans = (val > 0 ? val : 0) + l[0] + r[N - K];
REP(i, N - K) {
val += -a[i] + a[i + K];
chmax(ans, (val > 0 ? val : 0) + l[i + 1] + r[N - K - i - 1]);
}
print(ans);
}
|
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string S;
cin >> S;
vector<int> val(4);
for(int i=0; i<4; i++){
val[i] = S[i] - '0';
}
int target = 7;
int ans = val[0];
for(int i=0; i < 1<<3; i++){
ans = val[0];
int x0 = (i >> 0) & 1;
int x1 = (i >> 1) & 1;
int x2 = (i >> 2) & 1;
ans = (x0 == 0)? ans - val[1] : ans + val[1];
ans = (x1 == 0)? ans - val[2] : ans + val[2];
ans = (x2 == 0)? ans - val[3] : ans + val[3];
if(ans == target){
char c0 = (x0 == 0)? '-' : '+';
char c1 = (x1 == 0)? '-' : '+';
char c2 = (x2 == 0)? '-' : '+';
cout << val[0] << c0 << val[1] << c1 << val[2] << c2 << val[3] << "=7" << endl;
break;
}
}
return 0;
}
| 0
| 15,883,278
|
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 100;
const int INF = 1e9;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a, b;
ll ans = 0LL;
for (int i = 0; i < n-1; i++){
cin >> a >> b;
if (a > b) swap(a, b);
ans -= (ll)a * (ll)(n - b + 1);
}
for (int i = 1; i <= n; i++){
ans += (ll)i * (ll)(n - i + 1);
}
cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ii pair<int,int>
#define Max 100000+5
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define f first
#define s second
#define pb push_back
int mod = 1000000007;
int mod1 = 998244353;
vector<int> g[Max];
bool vis[Max];
int d, x, y;
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
void ex(int A, int B) {
if(B == 0) {
d = A;
x = 1;
y = 0;
}
else {
ex(B, A%B);
int temp = x;
x = y;
y = temp - (A/B)*y;
}
}
void dfs(int u){
vis[u]=1;
for(int i=0;i<g[u].size();i++){
int v=g[u][i];
if(vis[v]!=1)
dfs(v);
}
}
int power(int a,int b){
if(b==1)return a;
if(a>mod)a%=mod;
int r=1;
while(b){
if(b&1)r=r%mod*a%mod;
a=a%mod*a%mod;
b/=2;
}
return r;
}
class uf{
vector<int> v;
vector<int> sz;
public :
uf(int n){
v.resize(n+1);
iota(v.begin()+1,v.end(),1);
sz.resize(n+1,1);
}
int root(int b){
while(v[b]!=b){
b = v[b];
}
return b;
}
void u(int a, int b){
int ra=root(a);
int rb=root(b);
if(ra==rb)return ;
if(sz[ra]<sz[rb]){
v[ra] = v[rb];
sz[rb]+=sz[ra];
}else{
v[rb]=v[ra];
sz[ra]+=sz[rb];
}
}
bool f(int a,int b){
return (root(a)==root(b));
}
};
vector<int> matmul(vector<int> a,vector<int> b){
vector<int> c(4,0);
c[0] = (a[0]%mod*b[0]%mod + a[1]%mod*b[2]%mod)%mod;
c[1] = (a[0]%mod*b[1]%mod + a[1]%mod*b[3]%mod)%mod;
c[2] = (a[2]%mod*b[0]%mod + a[3]%mod*b[2]%mod)%mod;
c[3] = (a[2]%mod*b[1]%mod + a[3]%mod*b[3]%mod)%mod;
return c;
}
vector<int> id={1,0,0,1};
int32_t main(){
IO
int n;
cin>>n;
vector<pair<int,int> > v;
for(int i=0;i<n;i++){
int temp;
cin>>temp;
v.push_back({temp,i+1});
}
sort(all(v));
for(int i=0;i<v.size();i++)cout<<v[i].second<<" ";
}
| 0
| 84,961,689
|
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define vc vector
#define vi vc<int>
#define vl vc<ll>
#define dbg(x) cout<<x<<endl;
#define mp(x,y) make_pair(x,y)
#define yes dbg("YES")
#define no dbg("NO")
#define tst int t;cin>>t;while(t--)
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.begin(),v.end(),greater<int>());
#define rj ios::sync_with_stdio(false);cin.tie(0);
#define rvs(v) reverse(v.begin(),v.end());
#define F first
#define S second
#define mod 1000000007
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pii pair<int,int>
#define fr(i,a,b) for(ll i=a;i<=b;i++)
#define coutv(v) for(auto it:v)cout<<it<<' ';cout<<endl;
#define cinv(v) for(auto &it:v)cin>>it;
using namespace std;
void solve()
{
string s;
cin>>s;
ll sum_of_digits=0;
for(auto it:s) sum_of_digits+=(it-'0');
if(sum_of_digits%9==0) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
int main()
{
rj
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[105][4][2];
int main(){
string n;
int K;
cin >> n >> K;
int digit = n.size();
dp[0][0][0] = 1;
for(int i=0;i<digit;i++){
for(int j=0;j<4;j++){
for(int k=0;k<2;k++){
int nd=n[i]-'0';
for(int d=0;d<10;d++){
int ni=i+1,nj=j,nk=k;
if(d!=0) nj++;
if(nj>K) continue;
if(k==0){
if(d>nd) continue;
if(d<nd) nk=1;
}
dp[ni][nj][nk] += dp[i][j][k];
}
}
}
}
cout << dp[digit][K][1]+dp[digit][K][0] << endl;
}
| 0
| 85,873,772
|
#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 1000000009
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
ll n ;
cin>>n;
ll ans =1000000000001;
for(ll i = 1;i*i<=n;i++)
{
if(n%i==0)
ans = min(ans,(i-1)+(n/i-1));
}
std::cout<<ans<<endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n)
{
cin >> a[i];
}
vector<int64_t> b(n + 1), c(n + 1);
irep(i, n)
{
if (i == 0) {
b[i] = c[i] = 0;
} else {
b[i] = b[i - 1] + a[i - 1];
c[i] = c[i - 1] + max(a[i - 1], 0);
}
}
int64_t result = 0;
irep(i, n - k)
{
int64_t score = max(b[i + k] - b[i], 0L) + c[i] + (c[n] - c[i + k]);
result = max(result, score);
}
cout << result << endl;
return 0;
}
| 0
| 92,579,004
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
}
else {
int F = S.size();
int D = T.size();
vector<char> ans(F);
for (int j = 0; j < F; j++) {
ans.at(j) = 'z';
}
bool ok = false;
int K = (S.size() - T.size());
for (int i = 0; i <= K; i++) {
vector<char> B(F);
for (int j = 0; j < F; j++) {
if (S.at(j) == '?') {
B.at(j) = 'a';
}
else {
B.at(j) = S.at(j);
}
}
int k = 0;
bool good = true;
for (int j = i; j < i + D; j++) {
if (S.at(j) == '?') {
B.at(j) = T.at(k);
}
else if (S.at(j) != T.at(k)) {
good = false;
break;
}
else {
B.at(j) = S.at(j);
}
k++;
}
if (good) {
ok = true;
if (ans > B) {
for (int j = 0; j < F; j++) {
ans.at(j) = B.at(j);
}
}
}
}
if (ok) {
for (int j = 0; j < F; j++) {
cout << ans.at(j);
}
cout << endl;
}
else {
cout << "UNRESTORABLE" << endl;
}
}
}
|
#include<bits/stdc++.h>
#define pb(a) push_back(a)
#define ms(x,y) memset(x,y,sizeof(x))
#define sci(a) scanf("%d",&a)
#define scl(a) scanf("%lld",&a)
#define scd(a) scanf("%lf",&a)
#define ll unsigned long long
using namespace std;
namespace Fread{
const int SIZE=1<<20;
char buf[SIZE],*S,*T;
inline char getchar(){
if(S==T){
T=(S=buf)+fread(buf,1,SIZE,stdin);
if(S==T)return EOF;
}
return *S++;
}
}
namespace Fwrite{
const int SIZE=1<<20;
char buf[SIZE],*S=buf,*T=buf+SIZE;
inline void flush(){
fwrite(buf,1,S-buf,stdout);
S=buf;
}
inline void putchar(char c){
*S++=c;
if(S==T)flush();
}
struct _{
~_(){flush();}
}__;
}
#ifdef ONLINE_JUDGE
#define getchar Fread::getchar
#define putchar Fwrite::putchar
#endif
template<typename T>inline void read(T& x){
x=0;int f=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+(c-'0'),c=getchar();
x*=f;
}
template<typename T>inline void write(T x,bool _enter=0,bool _space=0){
if (!x)putchar('0');else{
if(x<0)putchar('-'),x=-x;
static char dig[41];
int top=0;
while(x)dig[++top]=(x%10)+'0',x/=10;
while(top)putchar(dig[top--]);
}
if(_enter)putchar('\n');
if(_space)putchar(' ');
}
namespace Fastio{
struct reader{
template<typename T>reader& operator>>(T& x){::read(x);return *this;}
reader& operator>>(char& c){
c=getchar();
while(c=='\n'||c==' ')c=getchar();
return *this;
}
reader& operator>>(char* str){
int len=0;
char c=getchar();
while(c=='\n'||c==' ')c=getchar();
while(c!='\n'&&c!=' ')str[len++]=c,c=getchar();
str[len]='\0';
return *this;
}
}cin;
const char endl='\n';
struct writer{
template<typename T>writer& operator<<(T x){::write(x,0,0);return *this;}
writer& operator<<(char c){putchar(c);return *this;}
writer& operator<<(const char* str){
int cur=0;
while(str[cur])putchar(str[cur++]);
return *this;
}
}cout;
}
#define cout Fastio::cout
#define endl Fastio::endl
const int maxn=100005;
ll a[maxn];
ll an[maxn];
const ll m=1e9+7;
int main(){
string s1,s2;
cin>>s1>>s2;
int n1=s1.length(),n2=s2.length();
int ans=n2;
for(int i=0;i<=n1-n2;++i){
int t=0;
for(int j=0;j<n2;++j)
if(s1[i+j]!=s2[j])
t++;
ans=min(ans,t);
}
cout<<ans<<endl;
return 0;
}
| 0
| 78,628,445
|
#include <iostream>
using namespace std;
int main()
{
int x,y,z;
cin >>x;
cin >>y;
cin >>z;
if(x<y && y<z)
cout <<"Yes"<<endl;
else
cout <<"No"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a[n], b[n];
pair<int, int> p[n];
rep(i, n) {
cin >> a[i] >> b[i];
p[i] = {a[i] + b[i], i};
}
sort(p, p + n, greater<pair<int, int>>());
ll ans = 0;
rep(i, n) {
if (i % 2)
ans -= b[p[i].second];
else
ans += a[p[i].second];
}
cout << ans << endl;
return 0;
}
| 0
| 87,929,847
|
#include<bits/stdc++.h>
using namespace std;
int i,j,bo,ans;
string st;
int main()
{
getline(cin,st);
i=0;j=st.size()-1;
while(i<=j)
{
if(st[i]==st[j]) {i++;j--;continue;}
if(st[i]=='x') {i++;ans++;continue;}
if(st[j]=='x') {j--;ans++;continue;}
bo=1;break;
}
if(bo!=1) cout<<ans<<"\n";
else cout<<-1<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<priority_queue<ll>> S(N);
for (int i = 0; i < N; i++) {
int t;
ll d;
cin >> t >> d;
t--;
S[t].push(d);
}
vector<ll> tops;
vector<ll> others;
int T = 0;
for (int i = 0; i < N; i++) {
if (S[i].empty()) {
continue;
}
T++;
tops.push_back(S[i].top());
S[i].pop();
while (!S[i].empty()) {
others.push_back(S[i].top());
S[i].pop();
}
}
sort(tops.begin(), tops.end(), greater<ll>());
sort(others.begin(), others.end(), greater<ll>());
for (int i = 1; i < (int)tops.size(); i++) {
tops[i] += tops[i - 1];
}
for (int i = 1; i < (int)others.size(); i++) {
others[i] += others[i - 1];
}
ll ans = 0;
for (ll k = 1; k <= min(T, K); k++) {
if (K - k - 1 >= (int)others.size()) {
continue;
}
ll sum = k * k + tops[k - 1];
if (k == K) {
sum += 0;
} else {
sum += others[K - k - 1];
}
ans = max(ans, sum);
}
cout << ans << endl;
}
| 0
| 73,167,249
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int n,m;
cin>>n>>m;
int L, R;
L = 1;
R = 100010;
rep(_, n){
int l, r;
cin >> l >> r;
L = max(L, l);
R=min(R, r);
}
if(R>=L)
cout << R - L + 1 << endl;
else
cout << 0 << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
using namespace std;
typedef long long ll;
typedef long double ld;
ll const MOD=1000000007;
int N,M;
int main(){
cin>>N>>M;
vector<vector<int>> v(N);
rep(i,M){
int a,b;
cin>>a>>b;
v[a-1].push_back(b-1);
v[b-1].push_back(a-1);
}
int table[8];
rep(i,8) table[i]=i;
int ans=0;
do{
rep(i,N-1){
bool flag=false;
rep(j,v[table[i]].size()){
if(v[table[i]][j]==table[i+1]) flag=true;
}
if(!flag) goto a;
}
ans++;
a:;
}while(next_permutation(table+1,table+N));
cout<<ans<<endl;
}
| 0
| 43,391,290
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r;
bool flag=false;
string str,ptr;
cin>>str>>ptr;
ptr.pop_back();
if(str==ptr)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint h, w, a, b;
scanf("%lld", &h);
scanf("%lld", &w);
scanf("%lld", &a);
scanf("%lld", &b);
for (int i = 0; i < h; ++i)
{
if (i < h - b)
printf("%s\n", (std::string((w - a), '1') + std::string(a, '0')).c_str());
else
printf("%s\n", (std::string((w - a), '0') + std::string(a, '1')).c_str());
}
return 0;
}
| 0
| 84,590,082
|
#include <iostream>
#include <vector>
using namespace std;
#define C
#ifdef C
#define BIL 4
#define FLO 3
#define ROO 10
int main(void)
{
unsigned char rooms[BIL][FLO][ROO] = {};
int num;
cin >> num;
for (size_t i = 0; i < num; i++)
{
int b, f, r, v;
cin >> b >> f >> r >> v;
rooms[b - 1][f - 1][r - 1] += v;
}
for (size_t i = 0; i < BIL; i++)
{
if (i!=0)
{
for (size_t j = 0; j < ROO; j++)
{
cout << "##";
}
cout << endl;
}
for (size_t j = 0; j < FLO; j++)
{
for (size_t k = 0; k < ROO; k++)
{
cout << " "<< static_cast<int>(rooms[i][j][k]);
}
cout << endl;
}
}
return 0;
}
#endif
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main(){
int S,W;cin >> S >> W;
if(S>W)cout << "safe" << endl;
else cout << "unsafe" << endl;
return 0;
}
| 0
| 56,735,749
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n,m,d; cin >> n >> m >> d;
if (d==0) {
cout << std::fixed << std::setprecision(15) << (m-1) / n << endl;
}
else {
cout << std::fixed << std::setprecision(15) << 2 * (n-d) * (m-1) / pow(n,2) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,l;
cin >> n >> l;
string a;
multiset<string> s;
while(n--){
cin >> a;
s.insert(a);
}
for(auto i=s.begin();i!=s.end();++i){
cout << *i;
}
return 0;
}
| 0
| 55,925,871
|
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<vector<char> >ar(n,vector<char>(m));
vector<vector<long long int> >dp(n,vector<long long int>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>ar[i][j];
}
}
bool flag=true;
for(int i=0;i<n;i++)
{
dp[i][0]=1;
if(ar[i][0]=='#')
flag=false;
if(flag==false)
dp[i][0]=0;
}
flag=true;
for(int i=0;i<m;i++)
{
dp[0][i]=1;
if(ar[0][i]=='#')
flag=false;
if(flag==false)
dp[0][i]=0;
}
for(int i=1;i<n;i++)
{
for(int j=1;j<m;j++)
{
if(ar[i][j]=='#')
dp[i][j]=0;
else
{
dp[i][j]=(dp[i-1][j]%mod+dp[i][j-1]%mod)%mod;
}
}
}
cout<<dp[n-1][m-1];
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int n;
void countingSort(int a[], int b[], int k) {
int c[k + 1];
for (int i = 0; i < k + 1; i++) {
c[i] = 0;
}
for (int i = 0; i < n; i++) {
c[a[i]]++;
}
for (int i = 1; i < k + 1; i++) {
c[i] += c[i - 1];
}
for (int i = n - 1; i >= 0; i--) {
b[c[a[i]] - 1] = a[i];
c[a[i]]--;
}
}
int main() {
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int maxi = a[0];
for (int i = 0; i < n; i++) {
maxi = max(a[i], maxi);
}
int b[n];
countingSort(a, b, maxi);
cout << b[0];
for (int i = 1; i < n; i++) {
cout << ' ' << b[i];
}
cout << endl;
}
| 0
| 93,857,833
|
#include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
const ll MAX=510000;
vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a>b) { a=b; return 1; } return 0; }
int main(){
ll N,D,A,B=0,cnt=0;
cin>>N>>D>>A;
vector<pair<ll,ll>> p(N);
queue<pair<ll,ll>> q;
pair<ll,ll> y;
for(ll i=0;i<N;i++){
cin>>p[i].first>>p[i].second;
}
sort(p.begin(),p.end());
for(ll i=0;i<N;i++){
while(q.size()){
pair<ll,ll> d;
d=q.front();
if(d.first>=p[i].first) break;
if(d.first<p[i].first){
q.pop();
B-=d.second*A;
}
}
p[i].second-=B;
if(p[i].second<=0) continue;
ll b=p[i].second/A;
if(p[i].second%A!=0) b++;
q.push(pair<ll,ll>(p[i].first+2*D,b));
B+=b*A;
cnt+=b;
}
cout<<cnt<<endl;
}
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main(){
int n;
cin >> n;
VEC(ll, a, n);
ll res = 0;
vector<ll> sum(n, 0);
rep(i, n){
if(i == 0)sum[i] = a[i];
else sum[i] = sum[i - 1] + a[i];
}
map<ll, ll> mp;
rep(i, n){
mp[sum[i]]++;
}
for(auto m : mp){
if(m.first == 0)res += m.second;
res += (m.second * (m.second - 1) / 2);
}
cout << res << endl;
}
| 0
| 31,449,850
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a,long long b) {
if (a < b) swap(a,b);
if (b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
return ((a * b == 0)) ? 0 : (a / gcd(a,b) * b);
}
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main(){
ll a;
double b;
cin >> a >> b;
ll bi = ll((b * 100) + 0.0001);
cout << a * bi / 100 << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> xs(n),ys(n);
for(Int i=0;i<n;i++) cin>>xs[i]>>ys[i];
using D = double;
D ans=0;
for(Int i=0;i<n;i++){
Int gx=xs[i],gy=ys[i];
for(Int k=0;k<4;k++){
{
Int nx=-gy,ny=gx;
gx=nx;
gy=ny;
}
Int sx=0,sy=0;
Int px=0,py=0;
Int qx=0,qy=0;
auto dot=[&](Int x1,Int y1,Int x2,Int y2){return x1*x2+y1*y2;};
auto cross=[&](Int x1,Int y1,Int x2,Int y2){return x1*y2-x2*y1;};
for(Int j=0;j<n;j++){
Int res=dot(xs[j],ys[j],gx,gy);
if(res<0) continue;
if(res>0){
sx+=xs[j];
sy+=ys[j];
continue;
}
if(cross(xs[j],ys[j],gx,gy)>0){
px+=xs[j];
py+=ys[j];
}else{
qx+=xs[j];
qy+=ys[j];
}
}
for(Int t=0;t<4;t++){
D bx=sx,by=sy;
if(t&1) bx+=px,by+=py;
if(t&2) bx+=qx,by+=qy;
chmax(ans,bx*bx+by*by);
}
}
}
cout<<fixed<<setprecision(12)<<sqrt(ans)<<endl;
return 0;
}
| 0
| 51,973,583
|
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, val;
map<int, int> cnt;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> val;
cnt[i+1] += val;
}
ll ans = 0;
for(auto& p: cnt) {
ans += p.second / 2;
p.second %= 2;
if (cnt.count(p.first+1) > 0) {
int mn = min(p.second, cnt[p.first+1]);
ans += mn;
p.second -= mn;
cnt[p.first+1] -= mn;
}
}
cout << ans << endl;
return 0;
}
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define debug(v) cout << #v<< ": " << v <<endl;
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL<<60;
ll M = 1000000007;
bool dcl(P a, P b){
return a.first - a.second < b.first - b.second;
}
int main(){
ll N; cin >> N;
vector<P> seq(N);
bool e = true;
ll sm = 0;
ll mn = 10000000000000;
rep(i, 0, N){
ll a, b; cin >> a >> b;
if(a != b){
e = false;
}
if(a > b){
mn = min(mn, b);
}
seq[i] = mp(a, b);
sm += a;
}
if(e){
prtl(0);
return 0;
}
prtl(sm - mn);
}
| 0
| 21,359,640
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.