code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
#include <stack>
#include <iomanip>
#include <limits>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
using Graph=vector<vector<int>>;
using edge= struct{int to;ll cost;};
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
typedef priority_queue<ll> PQ_HIGH;
typedef priority_queue<ll,VL,greater<ll>> PQ_LOW;
int main(){
int n;cin>>n;
vector<string> data(n);
for(int i=0;i<n;i++){
string tmp;cin>>tmp;
sort(tmp.begin(),tmp.end());
data[i]=tmp;
}
sort(data.begin(),data.end());
string past=data[0];
ll ans=0;
ll gar=1;
for(int i=1;i<data.size();i++){
string now=data[i];
if(now!=past){
past=now;
ans+=gar*(gar-1)/2;
gar=1;
}else{
gar++;
}
}
if(gar!=1){
ans+=gar*(gar-1)/2;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,m,a[101][101],row[101],col[101];
string str;
int main() {
cin>>n>>m;
for (int i=0; i<n; i++) {
cin>>str;
for (int j=0; j<m; j++) a[i][j]=(str[j]=='.');
}
for (int i=0; i<n; i++) {
int x=0;
for (int j=0; j<m; j++) {
if (a[i][j]==0) x=1;
}
if (!x) row[i]=1;
}
for (int i=0; i<m; i++) {
int x=0;
for (int j=0; j<n; j++) {
if (a[j][i]==0) x=1;
}
if (!x) col[i]=1;
}
for (int i=0; i<n; i++) {
if (row[i]) continue;
for (int j=0; j<m; j++) {
if (col[j]) continue;
if (a[i][j]) cout<<'.';
else cout<<'#';
}
cout<<'\n';
}
}
| 0
| 82,469,356
|
#include<iostream>
#include<string>
using namespace std;
class trans {
public:
string str;
void print(int a, int b) {
for (int i = a; i < b + 1; i++){
cout << str[i];
}
cout << endl;
}
void reverse(int a, int b){
string s;
for (int i = 0; i < b + 1 - a; i++){
s += str[i + a];
}
for (int i = 0; i < b + 1 - a; i++) {
str[i + a] = s[s.size() - i - 1];
}
}
void replace(int a, int b, string s) {
for (int i = 0; i < b + 1 - a; i++){
str[i + a] = s[i];
}
}
};
int main() {
trans t;
cin >> t.str;
int n;
cin >> n;
for (int i = 0; i < n; i++){
int a, b;
string s;
cin >> s >> a >> b;
if (s == "print")
t.print(a, b);
else if (s == "reverse")
t.reverse(a, b);
else if (s == "replace"){
cin >> s;
t.replace(a, b, s);
}
}
char c; cin >> c;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
ll cur = 1, ans = 0; int pos = 0;
while (true) {
while (pos < n && a[pos] < cur) pos++;
if (pos >= n) break;
if (a[pos] == cur) cur++;
else ans += (a[pos] - 1) / cur, a[pos] = 1;
}
cout << ans << endl;
return 0;
}
| 0
| 41,104,030
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
for(int i =0; i<N; i++)cin >> A.at(i);
vector<int>B(100011);
for(int i=0; i<N; i++){
B.at(A.at(i)) ++;
B.at(A.at(i)+1) ++;
B.at(A.at(i)+2) ++;
}
sort(B.begin(), B.end());
cout << B.at(100010) << endl;
}
|
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
void bfs(int v, vi &dist, vector<vi> &graph)
{
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++)
{
for (auto u : graph[q[i]])
{
if (dist[u] == -1)
{
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
vector<ll> x(4);
x[0] = n;
x[1] = -n;
x[2] = m;
x[3] = -m;
vector<vector<ll> > dist(4, vector<ll>(4, INFLL));
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 4; j++)
{
if (x[i] <= x[j]) dist[i][j] = min(dist[i][j], x[j] - x[i]);
if (abs(x[i]) == abs(x[j]) && x[i] != x[j]) dist[i][j] = min(dist[i][j], 1ll);
if (x[i] == x[j]) dist[i][j] = 0ll;
}
}
forn(k, 4) forn(i, 4) forn(j, 4) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
cout << dist[0][2];
}
| 0
| 50,405,163
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
string p;
int i,len;
cin>>s;
cin>>p;
len=s.size();
for(i=0 ; i<len ; i++){
s.push_back(s[i]);
}
if(s.find(p)!=string::npos){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#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 PI 3.141592653589793
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#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)
#define mem(x, a) memset(x, a, sizeof x)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pcl pair<char, ll>
#define psl pair<string, ll>
ll N, M, A, B, C;
ll arr[MAX_INT], arr1[MAX_INT], data[MAX_INT];
vector<ll> V;
unordered_map<ll, ll> mp;
set<char> s;
string S = "";
ll cases;
int main() {
go;
cin >> S;
fi(i, 0, S.size(), 1) {
s.insert(S[i]);
}
if(s.size() == S.size()) {
cout << "yes\n";
quit;
}
cout << "no\n";
return 0;
}
| 0
| 63,912,841
|
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ull mod = 1e9+7;
#define fo(i, n) for (int i = 0; i < n; i++)
#define sc(n) scanf("%d", &n)
using namespace std;
void solve() {
int n, k; sc(n); sc(k);
int a[n]; fo(i, n) sc(a[i]);
int g = 0;
int el = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
if (a[i] > a[j]) g++;
else if (a[i] < a[j]) el++;
}
}
ull num1 = (ull) k * (k+1);
num1 /= 2; num1 %= mod;
ull num2 = (ull) k * (k-1);
num2 /= 2; num2 %= mod;
num1 *= (ull) g; num1 %= mod;
num2 *= (ull) el; num2 %= mod;
ull ans = (num1 + num2) % mod;
cout << ans;
}
int main() {
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
vector<long long> dp(100001,0);
for(long long i=1;i<=100000;i++){
long long com=1000000;
for(long long j=1;i-j>=0;j*=6) com=min(com,dp[i-j]);
for(long long j=1;i-j>=0;j*=9) com=min(com,dp[i-j]);
dp[i]=com+1;
}
cout << dp[n] << endl;
}
| 0
| 62,300,773
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
#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 Cinint(n) int n;\
cin >> n;
#define Cinvecint(a, n) vector<int> a(n);\
for (int i = 0; i < (int)(n); i++) {\
int num;\
cin >> num;\
a.at(i) = num;\
}
#define Cinstring(s) string s;\
cin >>s;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n+1);
for (int i= 1; i< n+1; i++) {
int num;
cin >> num;
h.at(i) = num;
}
h.at(0) = -100;
vector<int> a(m);
vector<int> b(m);
rep(i, m) {
int aa, bb;
cin >> aa >> bb;
a.at(i) = aa;
b.at(i) = bb;
}
vector<bool> check(n+1, true);
check.at(0) = false;
rep(i, m) {
if (h.at(a.at(i)) == h.at(b.at(i))) {
check.at(a.at(i)) = false;
check.at(b.at(i)) = false;
}
else {
int numa = h.at(a.at(i));
int numb = h.at(b.at(i));
int mini = min(h.at(a.at(i)), h.at(b.at(i)));
if (mini == numa) {
check.at(a.at(i)) = false;
}
else if (mini == numb) {
check.at(b.at(i)) = false;
}
}
}
int count = 0;
rep(i, n+1) {
if (check.at(i)) {
count++;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<string, int> psi;
typedef pair<char, int> pci;
typedef pair<int, char> pic;
const ll MOD = (ll)1e9 + 7;
const long double PI = 3.141592653589793238462643383279502884197;
ll fac[1], inv[1];
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll mp(ll a,ll b){ll ret=1;while(b){if(b&1)ret=ret*a%MOD;a=a*a%MOD;b>>=1;}return ret;}
ll cmb(ll r, ll c) {return fac[r] * inv[c] % MOD * inv[r - c] % MOD;}
priority_queue<int, vector<int>, greater<int>> pq;
vector<int> v;
int n;
int vec[1 << 18];
pii dp[1 << 18][2];
int main() {
memset(dp, -1, sizeof(dp));
scanf("%d", &n);
int mav = 0;
for (int i = 0; i < (1<<n); i++) {
scanf("%d", &vec[i]);
pii now = {vec[i], i};
if (dp[i][1] < now) {
swap(dp[i][1], now);
if (dp[i][0] < dp[i][1])
swap(dp[i][0], dp[i][1]);
}
for (int j = 0; j < n; j++) {
int bit = i | 1 << j;
if (i == bit) continue;
now = dp[i][0];
if (dp[bit][1].second == now.second || dp[bit][0].second == now.second);
else {
if (dp[bit][1] < now) {
swap(dp[bit][1], now);
if (dp[bit][0] < dp[bit][1])
swap(dp[bit][0], dp[bit][1]);
}
}
now = dp[i][1];
if (dp[bit][1].second == now.second || dp[bit][0].second == now.second);
else {
if (dp[bit][1] < now) {
swap(dp[bit][1], now);
if (dp[bit][0] < dp[bit][1])
swap(dp[bit][0], dp[bit][1]);
}
}
}
mav = max(mav, dp[i][0].first + dp[i][1].first);
if (i) printf("%d\n", mav);
}
}
| 0
| 92,321,163
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
if(a%b == 0){
return b;
}else{
return gcd(b, a%b);
}
}
int gcd_arr(vector<int> &a){
int n = a.size();
for(int i=n-2; i>=0; i--){
a[i] = gcd(a[i], a[i+1]);
}
return a.front();
}
int main(void){
long long int i=0,j,c=0,n,m=0,ans=0,z=0;
string s;
cin >> n >> m;
vector<int> x(n);
for(i=0;i<n;i++)
{
cin >> x[i];
x[i]=abs(m-x[i]);
}
c=gcd_arr(x);
cout << c << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#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 < (int64_t)(n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (int64_t)(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--)
#define chmax(a, b) (a) = max(a, b)
#define chmin(a, b) (a) = min(a, b)
int main() {
vector<vector<int>> cnt(2, vector<int>(26, 0));
rep(i, 2) {
string s;
cin >> s;
rep(j, s.size()) { cnt[i][s[j] - 'a']++; }
}
vector<string> s2(2);
rep(c, 26) {
rep(j, cnt[0][c]) { s2[0].push_back(c + 'a'); }
}
rrep(c, 26) {
rep(j, cnt[1][c]) { s2[1].push_back(c + 'a'); }
}
cout << (s2[0] < s2[1] ? "Yes" : "No") << endl;
return 0;
}
| 0
| 64,897,977
|
#include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int n=s.length(),sum=0;
if(s[0]=='A' && s[1]>='a' && s[1]<='z' && s[n-1]>='a' && s[n-1]<='z'){
for(int i=2;i<n-1;i++){
if(s[i]!='C' && s[i]>='A' && s[i]<='Z')
break;
if(s[i]=='C')sum++;
}
if(sum==1) cout<<"AC";
else cout<<"WA";
}
else cout<<"WA";
return 0;
}
|
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define rrepi(i, a, b) for(intl i = (intl)(a); i > (intl)(b); i--)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,1,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define alength(a) (sizeof(a) / sizeof(a[0]))
#define cin(i, a) rep(i, alength(a))cin >> a[i]
#define ccin(i, j, a) rep(i, alength(a))rep(j, alength(a[i]))cin >> a[i][j]
#define debug(x) cout << #x << ":" << x << endl
#define rdebug(i,x) rep(i, alength(x))cout << #x << "[" << i << "]:" << x[i] << endl
#define sqrt sqrtl
#define itn int
#define double ld
#define pb push_back
#define mp make_pair
#define pii pair<intl,intl>
const intl INF = 1e9;
const intl MOD = 1e9+7;
const ld eps = 1.0e-14;
void fp(bool f){cout << (f ? "Yes" : "No") << endl;}
void fp(bool f, string s, string t){cout << (f ? s : t) << endl;}
intl kai(intl k){
intl a = 1;
for(int i = 2; i <= k; i++){
a *= i;
}
return a;
}
intl gcd(intl a, intl b){
if(!b)return a;
return gcd(b, a % b);
}
intl lcm(intl a,intl b){
return a / gcd(a, b) * b;
}
intl digit10(intl a){
intl b = 0;
do{
a /= 10;
b++;
}while(a);
return b;
}
signed main(){
cout << fixed << setprecision(10);
intl n;
cin >> n;
ld ans = 0.0;
rep(i,n){
ld a;
string s;
cin >> a >> s;
if(s == "JPY")ans += a;
else ans += 380000.0 * a;
}
cout << ans << endl;
return 0;
}
| 0
| 9,001,979
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
int val = 0;
if (j >= a)
val = 1 - val;
if (i >= b)
val = 1 - val;
cout << val;
}
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
int main() {
int H, W; cin >> H >> W;
vector<vector<char>> table(H+2, vector<char>(W+2,'.'));
for (int i=1; i<H+1; i++){
for (int j=1; j<W+1; j++){
cin >> table.at(i).at(j);
}
}
for (int i=1; i<H+1; i++){
for (int j=1; j<W+1; j++){
if(table.at(i).at(j)=='#'){
int counter = 0;
if (table.at(i-1).at(j)=='#') counter++;
if (table.at(i+1).at(j)=='#') counter++;
if (table.at(i).at(j-1)=='#') counter++;
if (table.at(i).at(j+1)=='#') counter++;
if (counter == 0){
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 1,122,780
|
#include <bits/stdc++.h>
#define N 1000099
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define LL long long
using namespace std;
int n;
LL S;
int main()
{
cin >> S;
LL t = sqrt(S);
if (t * t < S)
t++;
cout << "0 0 " << t << " " << t * t - S << " 1 " << t << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define endl '\n'
#define rep(i, s, e) for (int i = s; i < e; i++)
using namespace std;
struct UnionFind
{
vector<int> par;
UnionFind(int N) : par(N)
{
for (int i = 0; i < N; i++)
par[i] = -1;
}
int root(int x)
{
if (par[x] < 0)
return x;
return par[x] = root(par[x]);
}
int size(int x)
{
return -par[root(x)];
}
void unite(int x, int y)
{
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
if (size(rx) < size(ry))
{
swap(rx, ry);
}
par[rx] += par[ry];
par[ry] = rx;
}
bool same(int x, int y)
{
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main()
{
int N, M;
cin >> N >> M;
UnionFind A(N);
rep(i, 0, M)
{
int a, b;
cin >> a >> b;
A.unite(a, b);
}
int res = 0;
rep(i, 0, N)
{
res = max(res, A.size(i));
}
cout << res << endl;
}
| 0
| 41,972,886
|
#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;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0, tt = 0;
for(int i = n-1; i >= 0; i--){
if(h[i] <= h[i-1]) tt++;
else tt = 0;
ans = max(ans, tt);
}
cout << ans << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
using namespace std;
#define N 2003
#define mod 1000000007
int dp[N][N];
int add(int x,int y) {
int ret = x+y;
if(ret>=mod) {
ret -= mod;
}
if(ret<0) {
ret += mod;
}
return ret;
}
int s[N],t[N];
void solve() {
int n,m;scanf("%d %d",&n,&m);
for(int i=0;i<n;++i) scanf("%d ", &s[i]);
for(int i=0;i<m;++i) scanf("%d ", &t[i]);
for(int i=n-1;i>=0;--i) {
for(int j = m-1;j>=0;--j) {
int tmp = 0;
if(s[i]==t[j]) {
tmp = dp[i+1][j+1] + 1;
}
dp[i][j] = add(dp[i+1][j],dp[i][j+1]);
dp[i][j] = add(dp[i][j],-dp[i+1][j+1]);
dp[i][j] = add(dp[i][j],tmp);
}
}
int ret = add(dp[0][0],1);
printf("%d\n", ret);
}
int main() {
solve();
return 0;
}
| 0
| 22,341,025
|
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <regex>
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,j,n) for(int i = j; i < n; i++)
#define RFOR(i,j,n) for(int i = j-1; i >= n; i--)
#define PREC(n) fixed << setprecision(n)
#define print_array(v) REP(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
#define YesorNo(a) printf(a?"Yes\n":"No\n")
#define _LIBCPP_DEBUG 0
using namespace std;
int64_t MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d;
cin >> a >> b >> c >> d;
bool f = false;
if(abs(c - a) <= d) f = true;
if(abs(b - a) <= d && abs(c - b) <= d) f = true;
YesorNo(f);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rrep(i,n) for(int i=n;i>=0;i--)
#define rrepa(i,a,n) for(int i=n;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
#define vc vector
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
int main(){
string s;
cin>>s;
map<char,int> m;
rep(i,4){
m[s[i]]++;
}
if(m.size()==2 && m[s[0]]==2)cout<<"Yes\n";
else cout<<"No\n";
return 0;
}
| 0
| 68,828,941
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#define ll long long int
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
using namespace std;
int mx4[] = {0,1,0,-1};
int my4[] = {1,0,-1,0};
int mx2[] = {1,0};
int my2[] = {0,1};
class ARatingGoal {
public:
void solve(istream& in, ostream& out) {
int a, b; in >> a >> b;
out << 2 * b - a << endl;
}
};
int main() {
ARatingGoal solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<fixed<<setprecision(n)
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sort(a) sort((a).begin(), (a).end())
#define uniq(a) SORT(a);(a).erase(unique((a).begin(), (a).end()), (a).end())
#define reverse(a) reverse((a).begin(), (a).end())
#define ctos(c) string(1, (c))
#define out(d) cout << (d)
#define outl(d) std::cout<<(d)<<"\n"
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define ceil(x, y) ((x + y - 1) / (y))
#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 dbg(v) for (size_t _ = 0; _ < v.size(); ++_){ cerr << #v << "[" << _ << "] : " << v[_] << '\n'; }
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
void solve() {
int n; cin >> n;
vector<int> a(n); rep(i, n) cin >> a[i];
int ans = 0;
int i = 1;
while (i < n) {
if (a[i-1] == a[i]) {
i += 2;
ans++;
} else {
i++;
}
}
outl(ans);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
srand((unsigned)time(NULL));
fix(12);
solve();
}
| 0
| 46,286,634
|
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n),n){
int stage[100000] = {0};
for(int i = 1;i <= n; i++){
scanf("%d",&stage[i]);
}
int x = 0;
int ans = -1000000;
for(int i = 1;i <= n; i++){
for(int j = i;j <= n; j++){
x += stage[j];
ans = max(ans,x);
}
x = 0;
}
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
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); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int len;
cin >> len;
vector<vector<int>> arr(len, vector<int> (3));
for(int i = 0; i < len; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
for(int i = 0; i < len - 1; i++) {
int ans = 0;
ans += arr[i][1] + arr[i][0];
for(int j = i + 1; j < len - 1; j++) {
if(ans <= arr[j][1])
ans = arr[j][1];
else {
while(ans % arr[j][2] != 0)
ans++;
}
ans += arr[j][0];
}
cout << ans << endl;
}
cout << 0;
}
| 0
| 84,692,422
|
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
using namespace std;
int main() {
int N;
cin>>N;
for(int i=0;i<900;i++){
if((N+i)%111==0){
cout<<N+i;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define erep(n) for (ll i = 0; i <= n; ++i)
#define erep2(i, n) for (ll i = 0; i <= n; ++i)
#define erep3(i, a, b) for (ll i = a; i <= b; ++i)
#define erep4(i, a, b, c) for (ll i = a; i <= b; i += c)
#define rrep(i, a, b) for (ll i = a; i > b; --i)
#define rrep2(i, a, b, c) for (ll i = a; i > b; i -= c)
#define errep(i, a, b) for (ll i = a; i >= b; --i)
#define errep2(i, a, b, c) for (ll i = a; i >= b; i -= c)
#define print(a) cout << a << endl;
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define cin(x) cin >> x;
const ll MOD = 1000000007;
const double PI = 3.14159265358979323846264338327950;
inline int newline() { putchar('\n'); return 0; }
int main() {
ll n;
cin(n);
vector<ll> a(n + 1), b(n);
rep2(i, n + 1) cin(a[i]);
rep2(i, n) cin(b[i]);
ll ans = 0;
rep3(i, 1, n + 1) {
ll ta = a[i - 1] + a[i];
ll tb = b[i - 1];
if (ta > tb) {
ans += tb;
if (a[i - 1] < b[i - 1]) {
ll temp = a[i] - tb + a[i - 1];
if (temp > 0) a[i] = temp;
else a[i] = 0;
}
} else {
ans += ta;
a[i] = 0;
}
}
print(ans);
return 0;
}
| 0
| 15,024,583
|
#include <bits/stdc++.h>
const std::int64_t INF = 1e18;
int main() {
std::int32_t N; std::cin >> N;
std::vector<std::int64_t> A(N + 1), B(N + 1);
for (std::int32_t i = 0; i <= N; ++i) {
std::cin >> A[i];
}
B[N] = A[N];
for (std::int32_t i = N - 1; i >= 0; --i) {
B[i] = B[i + 1] + A[i];
}
B[0] = 1;
for (std::int32_t i = 1; i <= N; ++i) {
B[i] = std::min(B[i], 2 * (B[i - 1] - A[i - 1]));
}
std::int64_t ans = 0;
for (std::int32_t i = 0; i <= N; ++i) {
if (B[i] < A[i]) {
std::cout << -1 << std::endl;
return 0;
}
ans += B[i];
}
std::cout << ans << std::endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a = "AtCoder Beginner Contest ";
string b = "AtCoder Regular Contest";
int s1 = a.size();
int s2 = b.size();
a[0] = toupper(a[0]);
b[0] = toupper(b[0]);
int x;
cin >> x;
if(x<1200)
{
for(int i =0; i<s1; i++)
{
if(a[i-1] == ' ')
a[i] = toupper (a[i]);
}
cout << "ABC" <<endl;
}
else if(x>=1200)
{
for(int j =0; j<s2; j++)
{
if(b[j-1] == ' ')
b[j] = toupper (b[j]);
}
cout << "ARC" <<endl;
}
return 0;
}
| 0
| 84,377,244
|
#include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
vector<vector<ll>> a(3,vector<ll>(3));
rep(i,3){
rep(j,3){
cin>>a[i][j];
}
}
ll n;cin>>n;
rep(i,n){
ll b;cin>>b;
rep(j,3){
rep(l,3){
if(a[j][l]==b) a[j][l]=-1;
}
}
}
bool check=false;
rep(i,3){
bool hai=true;
rep(j,2){
if(a[i][j]!=a[i][j+1]) hai=false;
}
if(hai==true){
check=true;
break;
}
}
rep(i,3){
bool hai=true;
rep(j,2){
if(a[j][i]!=a[j+1][i]) hai=false;
}
if(hai==true){
check=true;
break;
}
}
if(a[0][0]==a[1][1] && a[1][1]==a[2][2]){
check=true;
}
if(a[0][2]==a[2][0] && a[1][1]==a[0][2]){
check=true;
}
if(check) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
long long a[100000];
pair <long long, int> a_ind[100000];
long long ans[100000];
int main(){
int N;
cin >> N;
long long left = 0;
for(int i = 0; i < N; i++){
int a;
cin >> a;
left += a;
a_ind[i] = make_pair(a, -i);
}
sort(a_ind, a_ind + N);
long long cur_max = a_ind[N - 1].first;
long long before_ind = - a_ind[N - 1].second;
long long bigger_total = 0;
long long bigger_num = 0;
for(int i = N - 1; i >= 0; i--){
if((- a_ind[i].second) >= before_ind){
bigger_total += a_ind[i].first;
bigger_num ++;
} else {
ans[before_ind] = bigger_total - a_ind[i].first * bigger_num;
left -= bigger_total - a_ind[i].first * bigger_num;
cur_max = a_ind[i].first;
before_ind = - a_ind[i].second;
bigger_num++;
bigger_total = cur_max * bigger_num;
}
}
ans[0] = left;
for(int i = 0; i < N; i++){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 2,584,314
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<string> str(n);
rep(i,n) cin >> str[i];
int table[51][26] = {0};
string alp = "abcdefghijklmnopqrstuvwxyz";
rep(i,n){
rep(j,str[i].length()){
int num = (int)(str[i][j] - 'a');
table[i][num]++;
}
}
vector<int> mindata(26,1000);
rep(i,26){
rep(j,n){
mindata[i] = min(mindata[i],table[j][i]);
}
}
rep(i,26){
rep(j,mindata[i]){
cout << alp[i];
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int v[100001] = {};
bool a[100001] = {};
for (int i = 0; i < n; i++) {
int xi;
cin >> xi;
v[i] = xi;
}
int now = 0;
int acc = 0;
while (!a[now]) {
a[now] = true;
if (v[now] == 2) {
a[1]=true;
break;
}
now = v[now] - 1;
acc += 1;
}
if (a[1]) {
cout << acc + 1 << endl;
} else {
cout << -1 << endl;
}
}
| 0
| 93,936,487
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i<n;i++)
int main(){
int n;
cin >> n;
cout << min(n/2, (n-1)/2) <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF=1e18;
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<endl;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b){ a = b; return 1; } return 0; }
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
long long ans = 0;
ll MaxNum = 0;
for (int i = 0; i < n; i++)
{
MaxNum = max(MaxNum, a[i]);
int Bi = MaxNum;
ans += Bi - a[i];
}
cout << ans << endl;
return 0;
}
| 0
| 70,396,440
|
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) { if(a<b) {a=b; return true;} return false;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int K, N; cin >> K >> N;
vector<int> A(N*2);
rep(i,N) cin >> A[i];
rep(i,N) A[N+i] = K + A[i];
sort(A.begin(), A.end());
int ans = INF;
rep(i, N)
chmin(ans, A[i+N-1]-A[i]);
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <unordered_map>
#include <set>
#include <queue>
int main() {
int n;
std::cin >> n;
std::unordered_map<int, std::vector<int>> Adj(n);
for (int i = 0; i < n; i ++) {
int u, k;
std::cin >> u >> k;
std::vector<int> V(k);
for (int& v : V) {
std::cin >> v;
}
Adj[u] = V;
}
std::set<int> nodes_unvisited;
std::unordered_map<int, int> distances;
for (int i = 1; i <= n; i ++) {
nodes_unvisited.insert(i);
distances[i] = -1;
}
nodes_unvisited.erase(1);
distances[1] = 0;
std::queue<int> queue;
queue.push(1);
while (!queue.empty()) {
int u = queue.front();
queue.pop();
for (int v : Adj[u]) {
if (nodes_unvisited.find(v) != nodes_unvisited.end()) {
nodes_unvisited.erase(v);
distances[v] = distances[u] + 1;
queue.push(v);
}
}
}
for (int i = 1; i <= n; i ++) {
std::cout << i << " " << distances[i] << std::endl;
}
}
| 0
| 18,705,058
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>pii;
int main(){
int H,W,D;
map<int, pii> m;
cin >> H >> W >> D;
ll ans = 0;
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
int tmp;
cin >> tmp;
tmp--;
m[tmp] = make_pair(i,j);
}
}
vector<int> v(H*W, 0);
for(int i = 0; i < H*W; i++){
if(i < D){
v[i] = 0;
} else {
v[i] = v[i-D] + abs(m[i].first - m[i-D].first) + abs(m[i].second - m[i-D].second);
}
}
int Q;
cin >> Q;
for(int i = 0; i < Q; i++){
int L,R;
cin >> L >> R;
L--; R--;
cout << v[R] - v[L] << endl;
}
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int h,w;
vector<vector<char>> v(100);
int main(){
cin >> h >> w;
rep(i,h){
vector<char> r(w);
rep(j,w){
cin >> r.at(j);
}
v.at(i) = r;
}
vector<vector<int>> dp(h);
rep(i,h)
{
vector<int> r(w);
dp.at(i) = r;
}
rep(i,h)
{
rep(j,w){
char cur = v.at(i).at(j);
int ra = INF,rb = INF;
if(i==0 && j == 0){
if(v.at(0).at(0) == '#') ra = 1;
else ra = 0;
}
if(j > 0){
ra = dp.at(i).at(j-1);
if(cur == '#' && v.at(i).at(j-1) == '.'){
ra++;
}
}
if(i > 0){
rb = dp.at(i-1).at(j);
if(cur == '#' && v.at(i-1).at(j) == '.'){
rb++;
}
}
dp.at(i).at(j) = min(ra,rb);
}
}
cout << dp.at(h-1).at(w-1) << endl;
return 0;
}
| 0
| 7,327,784
|
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << (a-1)*(b-1) << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int f(int x) {
int y = 1;
for (int i = 1; i <= x; i++) {
y *= i;
}
return y;
}
int main() {
ll N, p = 0, q = 0;
cin >> N;
vector<ll> P(N), Q(N), pu(N, 0), qu(N, 0);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
P[i]--;
pu[P[i]] = 1;
for (int j = 0; j < P[i]; j++) {
if (pu[j] == 0) p += f(N - 1 - i);
}
}
for (int i = 0; i < N; i++) {
cin >> Q.at(i);
Q[i]--;
qu[Q[i]] = 1;
for (int j = 0; j < Q[i]; j++) {
if (qu[j] == 0) q += f(N - 1 - i);
}
}
cout << abs(q - p) << endl;
}
| 0
| 13,574,703
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 5010;
int n, k;
int p[N], c[N];
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++)
{
scanf("%d", &p[i]);
}
for(int i = 1; i <= n; i++)
{
scanf("%d", &c[i]);
}
ll ans = -1e18;
for(int i = 1; i <= n; i++)
{
ll circle_sum = 0;
int circle_cnt = 0;
int v = i;
while(true)
{
circle_cnt++;
circle_sum += c[p[v]];
v = p[v];
if(v == i) break;
}
ll path = 0;
int cnt = 0;
while(true)
{
cnt++;
path += c[p[v]];
if(cnt > k) break;
int num = (k - cnt) / circle_cnt;
ll score = path + max(0ll, circle_sum) * num;
ans = max(ans, score);
v = p[v];
if (v == i) break;
}
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
string s;
cin >> n >> p;
cin >> s;
long long ans = 0;
if(p == 2 | p == 5) {
for(int i = 0; i < n; i++) {
if((s[i] - '0') % p == 0) {
ans += (i + 1);
}
}
} else {
vector<int> cnt(p);
cnt[0] = 1;
long long tmp = 1;
long long sum = 0;
for(int i = n - 1; i >= 0; i--) {
sum = ((s[i] - '0') * tmp + sum) % p;
ans += cnt[sum];
cnt[sum]++;
tmp = tmp * 10 % p;
}
}
cout << ans << endl;
return 0;
}
| 0
| 54,541,354
|
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s1, s2; cin >> s1 >> s2;
vector<vector<int>>dp(s1.length() + 1, vector<int>(s2.length() + 1));
rep(i, 0, s1.length() + 1)dp[i][0] = i;
rep(i, 0, s2.length() + 1)dp[0][i] = i;
rep(i, 1, s1.length() + 1)rep(j, 1, s2.length() + 1)
dp[i][j] = min(dp[i - 1][j] + 1, min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + (s1[i - 1] != s2[j - 1])));
cout << dp[s1.length()][s2.length()] << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string s;
cin >> s;
deque<char> q;
for (int i = 0; i < s.length(); i++) {
q.push_back(s[i]);
}
ll cnt = 0;
if (s.length() == 1) {
cout << 0 << endl;
return 0;
}
while (!q.empty()) {
if (q.front() == q.back()) {
q.pop_front();
q.pop_back();
} else if (q.front() == 'x') {
cnt++;
q.pop_front();
} else if (q.back() == 'x') {
cnt++;
q.pop_back();
} else {
cout << -1 << endl;
return 0;
}
if (q.size() == 1 || q.size() == 0) break;
}
cout << cnt << endl;
return 0;
}
| 0
| 55,014,525
|
#include <stdio.h>
#include <algorithm>
void trace(int a[], int size) {
for (int i = 0; i < size; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", a[i]);
}
printf("\n");
}
void SelectionSort(int A[], int N) {
int count = 0;
for (int i = 0; i < N; ++i) {
int min = i;
for (int j = i; j < N; ++j) {
if (A[j] < A[min]) {
min = j;
}
}
if (i != min) {
std::swap(A[i], A[min]);
count++;
}
}
trace(A, N);
printf("%d\n", count);
}
int main() {
int N;
int A[100];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
SelectionSort(A, N);
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <string>
#include <cctype>
using namespace std;
int main() {
string number;
int num;
int result;
while(1) {
cin >> number;
if (number == "0") break;
result = 0;
for (int i = 0; i < number.size(); i++) {
num = number[i] - '0';
result += num;
}
cout << result << endl;
}
return 0;
}
| 0
| 64,265,964
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repm(i,m,n) for(ll i=m;i<n;i++)
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define YesNo(a) (a)?cout<<"Yes"<<endl:cout<<"No"<<endl
#define YESNO(a) (a)?cout<<"YES"<<endl:cout<<"NO"<<endl
#define INF (2e9)
#define PI (acos(-1))
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
typedef long long ll;
int main(){
string s; cin >> s;
int ans;
if(s == "SSS") ans = 0;
else if(s == "RRR") ans = 3;
else if(s == "RRS" || s == "SRR") ans = 2;
else ans = 1;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
multiset<int> a;
void extract(){
cout << *(--a.end()) << endl;
a.erase(--a.end());
}
int main(void){
char command[10];
int temp;
while(true){
scanf("%s", command);
if(command[0] == 'i'){
cin >> temp;
a.insert(temp);
}else if(command[1] == 'x'){
extract();
}else{
break;
}
}
return 0;
}
| 0
| 53,013,126
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,from,n) for(int i = from; i < n; i++)
#define mreps(i,from,n) for(int i = from; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x,val) x.erase(remove(all(x), val), x.end())
typedef long long ll;
typedef pair<int, int> P;
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; }
ll MOD = 1000000007;
int INF = 1001001001;
void solve()
{
int n; cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
rep(i, n-1)
{
if(a[i] == a[i+1])
{
ans++;
i++;
}
}
cout << ans << endl;
return;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
|
#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 __builtin_popcount
#define flag(x) (1 << 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 & (1 << 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 Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return 0;
}
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;
}
const ll dx[4] = {0, 0, 1, 1};
const ll dy[4] = {0, 1, 0, 1};
int main()
{
cout << fixed << setprecision(30);
ll N;
string s;
cin >> N >> s;
bool exist = false;
vec ans;
loop(d, 4)
{
vector<ll> check(N, -1);
check[0] = dx[d];
check[1] = dy[d];
Loop(i, 1, N - 1)
{
if (s[i] == 'o')
{
if (check[i] == 1)
{
check[i + 1] = check[i - 1];
}
else
{
if (check[i - 1])
check[i + 1] = 0;
else
check[i + 1] = 1;
}
}
if (s[i] == 'x')
{
if (check[i] == 0)
{
check[i + 1] = check[i - 1];
}
else
{
if (check[i - 1])
check[i + 1] = 0;
else
check[i + 1] = 1;
}
}
}
if (s[0] == 'o')
{
if (check[0] == 1 && check[1] != check[N - 1])
continue;
if (check[0] == 0 && check[1] == check[N - 1])
continue;
}
if (s[0] == 'x')
{
if (check[0] == 1 && check[1] == check[N - 1])
continue;
if (check[0] == 0 && check[1] != check[N - 1])
continue;
}
if (s[N - 1] == 'o')
{
if (check[N - 1] == 1 && check[0] != check[N - 2])
continue;
if (check[N - 1] == 0 && check[0] == check[N - 2])
continue;
}
if (s[N - 1] == 'x')
{
if (check[N - 1] == 1 && check[0] == check[N - 2])
continue;
if (check[N - 1] == 0 && check[0] != check[N - 2])
continue;
}
exist = true;
ans = check;
}
if (exist)
{
loop(i, N)
{
if (ans[i])
cout << "S";
else
cout << "W";
}
putout("");
}
else
putout(-1);
return 0;
}
| 0
| 56,502,720
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll dp[100010][2];
int main() {
string s;
cin>>s;
dp[0][0]=1;
for(ll i=0;i<s.size();i++){
if(s[i]=='0'){
dp[i+1][0]+=dp[i][0];
dp[i+1][1]+=dp[i][1];
dp[i+1][1]+=(dp[i][1]*2)%inf;
}
else{
dp[i+1][1]+=dp[i][0];
dp[i+1][0]+=(dp[i][0]*2)%inf;
dp[i+1][1]+=dp[i][1];
dp[i+1][1]+=(dp[i][1]*2)%inf;
}
dp[i+1][0]%=inf;
dp[i+1][1]%=inf;
}
cout << (dp[s.size()][1]+dp[s.size()][0])%inf;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
using ll = long long;
int digits(ll n) {
int cnt = 0;
while (n) {
cnt++;
n /= 10;
}
return cnt;
}
int main() {
ll N;
cin >> N;
ll ans = (1 << 20);
for (ll i = 1; i * i <= N; i++) {
if (N % i != 0) continue;
ans = min(ans, (ll)max(digits(i), digits(N / i)));
}
cout << ans << endl;
}
| 0
| 22,682,772
|
#include <iostream>
using namespace std;
int main() {
int h[10000];
int i;
for (i = 0; ; i++) {
cin >> h[i];
if (h[i] == 0) {
break;
}
}
for (int j = 0; j < i; j++) {
cout << "Case " << j + 1 << ": " << h[j] << endl;
}
}
|
#line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<
using namespace std;
template <class T> void say(bool val, T yes = "Yes", T no = "No") { cout << (val ? yes : no) << endl; }
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
#line 2 "tmp.cpp"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> t(n + 2, 0);
vector<double> v(n + 2, 0);
int sum = 0;
REP(i, n) {
cin >> t[i + 1];
sum += t[i + 1];
t[i + 1] += t[i];
}
t[n + 1] = sum;
REP(i, n) { cin >> v[i + 1]; }
vector<double> ans(2 * sum + 1, 0.0);
FOR(j, 1, 2 * sum + 1) {
double tmp = 2 * sum;
double time = (double)j / 2;
FOR(i, 1, n + 1) {
if (time < t[i - 1]) {
chmin(tmp, t[i - 1] - time + v[i]);
} else if (t[i] < time) {
chmin(tmp, time - t[i] + v[i]);
} else {
chmin(tmp, v[i]);
}
}
chmin(tmp, time);
chmin(tmp, sum - time);
ans[j] = tmp;
}
double val = 0;
FOR(i, 1, 2 * sum + 1) { val += (ans[i] + ans[i - 1]) / 4; }
coutd(5) << val << endl;
return 0;
}
| 0
| 14,808,676
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
string S;
cin >> N >> S;
enum RGBtype : int64_t { kR = 0L, kG, kB, kNumber };
vector<int64_t> A(N);
vector<int64_t> counts(3, 0);
for (int64_t i = 0; i < N; ++i) {
const char ch = S.c_str()[i];
if (ch == 'R') {
A[i] = kR;
++counts[kR];
} else if (ch == 'G') {
A[i] = kG;
++counts[kG];
} else if (ch == 'B') {
A[i] = kB;
++counts[kB];
}
}
vector<int64_t> rgb_index = {0, 1, 2};
int64_t result = 1;
for (const int64_t count : counts) {
result *= count;
}
for (int64_t i = 0; i < N; ++i) {
for (int64_t j = i + 1; j < N; ++j) {
const int64_t k = j * 2LL - i;
if (k < N && A[i] != A[j] && A[j] != A[k] && A[i] != A[k]) {
--result;
}
}
}
cout << result << endl;
return 0;
}
|
#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 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 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>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N, M;
cin >> N >> M;
vll x(N), y(N), z(N);
vllvll cands;
vector<tuple<ll, ll, ll, ll>> data(N);
ll ans = -inf;
rep(i, 0, N) {
ll a, b, c;
cin >> a >> b >> c;
x[i] = a;
y[i] = b;
z[i] = c;
data[i] = make_tuple(a, b, c, i);
}
if (M == 0) {
cout << 0 << endl;
return 0;
}
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return p + q + r < pp + qq + rr;
} );
ll xtmp, ytmp, ztmp;
xtmp = ytmp = ztmp = 0;
ll sm;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return p + q - r < pp + qq - rr;
} );
xtmp = ytmp = ztmp = 0;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return p - q + r < pp - qq + rr;
} );
xtmp = ytmp = ztmp = 0;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return p - q - r < pp - qq - rr;
} );
xtmp = ytmp = ztmp = 0;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return -p + q + r < -pp + qq + rr;
} );
xtmp = ytmp = ztmp = 0;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return -p + q - r < -pp + qq -rr;
} );
xtmp = ytmp = ztmp = 0;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return -p - q + r < -pp - qq +rr;
} );
xtmp = ytmp = ztmp = 0;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
sort(data.rbegin(), data.rend(), [](auto a, auto b) {
ll p = get<0>(a);
ll q = get<1>(a);
ll r = get<2>(a);
ll pp = get<0>(b);
ll qq = get<1>(b);
ll rr = get<2>(b);
return -p - q - r < -pp - qq -rr;
} );
xtmp = ytmp = ztmp = 0;
sm = 0;
rep(i, 0, M) {
xtmp += get<0>(data[i]);
ytmp += get<1>(data[i]);
ztmp += get<2>(data[i]);
}
sm = abs(xtmp) + abs(ytmp) + abs(ztmp);
chmax(ans, sm);
cout << ans << endl;
}
| 0
| 97,852,680
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n, long long modvalue) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2, modvalue);
return t * t % modvalue;
} else {
return modpow(m, n - 1, modvalue) * m % modvalue;
}
}
long long moddiv(long long a, long long b, ll modvalue) { return (a * modpow(b, mod - 2, modvalue)) % modvalue; }
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k, ll modvalue) {
ll numera = 1;
for (int i = n; i > n - k; i--) {
numera *= i;
numera %= modvalue;
}
ll denomi = 1;
REP(i, k) {
denomi *= (i + 1);
denomi %= modvalue;
}
return moddiv(numera, denomi, modvalue);
}
map<ll, ll> cnt;
void primeFactors(long long n) {
while (n % 2 == 0) {
cnt[2]++;
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
cnt[i]++;
n = n / i;
}
}
if (n > 2) {
cnt[n]++;
}
}
bool check(string s, string t){
map<char, char> cnt;
REP(i, s.size()) {
if (cnt[s[i]] == 0) {
cnt[s[i]] = t[i];
} else if (t[i] != cnt[s[i]]) {
return false;
}
}
return true;
}
int main() {
string s, t;
cin >> s >> t;
if(check(s,t) && check(t,s))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>
void printIter(const T &a, string delimiter) {
if (a.size() == 0) return;
auto it = a.begin();
cout << *it;
it++;
while (it != a.end()) {
cout << delimiter << *it;
it++;
}
cout << endl;
}
int main() {
int H, N;
cin >> H >> N;
vector<pair<int, int>> spell(N);
int mm = 0;
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
mm = max(mm, a);
spell[i] = make_pair(a, b);
}
vector<int> dp(H + mm + 1);
for (int i = 0; i < H + mm + 1; ++i) {
for (int j = 0; j < N; ++j) {
if (i + spell[j].first <= mm || H + mm + 1 <= i + spell[j].first) continue;
else if (dp[i + spell[j].first] == 0) dp[i + spell[j].first] = dp[i] + spell[j].second;
else dp[i + spell[j].first] = min(dp[i + spell[j].first], dp[i] + spell[j].second);
}
}
int m = 0;
cout << dp[H+mm] << endl;
}
| 0
| 97,503,972
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
int mod = 1000000000+7;
int main(){
int n;
cin>>n;
int a[n];
map<int,int> mp;
rep(i,n){
cin>>a[i];
mp[a[i]]++;
}
sort(a,a+n);
int ans=n;
for(auto itr = mp.begin();itr!=mp.end();++itr){
if(itr->second >= 3){
if(itr->second %2 == 0){
ans-=itr->second-2;
itr->second=2;
}
else {
ans-=(itr->second-1);
itr->second = 1;
}
}
}
int j=0;
for(int i=0;i<n;i++){
if(mp[a[i]]==2){
for(int j=n-1;j>=i;j--){
if(mp[a[j]]==2){
mp[a[i]]--;
mp[a[j]]--;
ans-=2;
break;
}
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14159265358979323844
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define endl "\n"
#define sqr(a) (a)*(a)
#define __lcm(m,n) m*(n/__gcd(m,n))
#define inputarr(a,n) for(int xxx=0;xxx<n;++xxx) cin>>(a)[xxx]
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define display(x) for(auto &a:x) cout<<a<<" ";cout<<endl
#define debug cerr<<"bhau"<<endl
#define between(n,a,b) (a<=n&&n<=b)
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');std::cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
template<typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template<typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
template<typename T,typename U> std::ostream& operator<<(std::ostream& out, std::pair<T,U> a) {
out<<a.fi<<" "<<a.se;
return out;
}
template<typename T,typename U> std::istream& operator>>(std::istream& in, std::pair<T,U> &a) {
in>>a.fi>>a.se;
return in;
}
inline long long toint(const std::string &s) {std::stringstream ss; ss << s; long long x; ss >> x; return x;}
inline std::string tostring(long long number) {std::stringstream ss; ss << number; return ss.str();}
inline std::string tobin(long long x) {return std::bitset<63>(x).to_string();}
std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pii std::pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vii vector<pii >
#define point complex<ll>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define int long long
void meowmeow321()
{
int n,m,k;
cin>>n>>m>>k;
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= m; ++j) {
int cnt=i*m + j*n - 2*(i*j);
if(cnt==k){
cout<<"Yes\n";return;
}
}
}
cout<<"No\n";
}
signed main()
{
FAST;
int testcases=1;
for(int i=0;i<testcases;++i)
{
meowmeow321();
}
cerr<<endl<<"Time Elasped : "<<elasped_time<<endl;
return 0;
}
| 0
| 57,472,283
|
#include<stdio.h>
#include<string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,N) for(long i=0;i<(long)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline long IN(void)
{
long x=0,f=0,c=getchar();while(c<48||c>57){f^=c==45,c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f?-x:x;
}
static inline void OUT(long a)
{
if(a<0)PUT('-'),a=-a;
int d[40],i=0;do{d[i++]=a%10;}while(a/=10);
while(i--){PUT(d[i]+48);}PUT('\n');
}
int MOD;
static inline int MPow(long a,long b){return b?1l*MPow(1l*a*a%MOD,b>>1)*(b&1?a:1)%MOD:1;}
int main()
{
long N=IN(),calc=0;int X=IN(),vis[100001];
MOD=IN();int val[100001];
if(N<=MOD){rep(i,N){calc+=X;X=MPow(X,2);}return OUT(calc),0;}
else
{
rep(i,MOD+1)
{
val[i+1]=X;
if(vis[X])
{
rep(j,vis[X]){calc+=val[j+1];}
int k=vis[X]+1;while(k<=i+1){calc+=1l*(N-vis[X]+i+1-k)/(i+1-vis[X])*val[k];k++;}
return OUT(calc),0;
}
vis[X]=i+1;X=MPow(X,2);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int n, k, l, counter;
cin >> n >> k;
ll s, ans, a[n], a_sum[n+1], m, p;
vector<ll> number, new_number;
s = 0;
a_sum[0] = 0;
rep(i, n){
cin >> a[i];
s += a[i];
a_sum[i+1] = s;
}
rep(i, n)
rep2(j, i, n){
number.push_back(a_sum[j+1] - a_sum[i]);
}
l = 0;
m = a_sum[n];
while (m){
l++;
m /= 2;
}
ans = 0;
rep(i, l){
p = pow(2, l-i-1);
counter = 0;
for (auto x : number){
if (x & p){
counter++;
new_number.push_back(x);
}
}
if (counter >= k){
ans += p;
number = new_number;
}
new_number.clear();
}
cout << ans << endl;
return 0;
}
| 0
| 8,361,840
|
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
int N, X;
cin >> N >> X;
vector<int> x(N), dx(N);
for (int i=0; i<N; i++) {
cin >> x[i];
}
x.push_back(X);
int mdx=1000000001;
sort(x.begin(), x.end());
for (int i=0; i<N; i++) {
dx[i]=x[i+1]-x[i];
mdx=min(mdx, dx[i]);
}
int M=1;
priority_queue<int,vector<int>, greater<int>> Q;
if (dx.size()==1) {
M=dx[0];
goto OUT;
}
for (int i=2; i<=mdx; i++) {
if (mdx%i==0) {
Q.push(i);
}
}
while (Q.size()>0) {
int q=Q.top();
Q.pop();
while (true) {
int fin=0;
for (int i=0; i<N; i++) {
if (dx[i]%q!=0) {
fin=1;
break;
}
}
if (fin==1) {break;}
for (int i=0; i<N; i++) {
dx[i]/=q;
}
M*=q;
}
}
OUT:
cout << M << endl;
}
|
#include <iostream>
using namespace std;
string shuffle(string str, int n)
{
string leftString = str.substr(0, n);
string rightString = str.substr(n, str.size());
return rightString + leftString;
}
int main()
{
string str;
int m, n;
while (true) {
cin >> str;
if (!str.compare("-")) {
return 0;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> n;
str = shuffle(str, n);
}
cout << str << endl;
}
}
| 0
| 42,928,676
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin>>a;
if(a>='a'&&a<='z') cout<<"a";
else cout<<"A";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int sum = 0;
for (int i = a; i < b + 1; i++){
int c_1 = i / 10000;
int c_2 = (i % 10000) / 1000;
int c_3 = (i % 100) / 10;
int c_4 = i % 10;
if (c_1 == c_4 && c_2 == c_3){
sum++;
}
}
cout << sum << endl;
}
| 0
| 35,493,600
|
#include <bits/stdc++.h>
#define int long long int
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>auto&operator<<(ostream&s,const vector<T>&v){s<<"[";bool a=1;for(auto e:v){s<<(a?"":" ")<<e;a=0;}s<<"]";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const pair<T,U>&p){s<<"("<<p.first<<","<<p.second<<")";return s;}
template<typename T>auto&operator<<(ostream&s,const set<T>&st){s<<"{";bool a=1;for(auto e:st){s<<(a?"":" ")<<e;a=0;}s<<"}";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const map<T,U>&m){s<<"{";bool a=1;for(auto e:m){s<<(a?"":" ")<<e.first<<":"<<e.second;a=0;}s<<"}";return s;}
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl;
struct edge { int to, cost; };
const int INF = 1e18;
const int MOD = 1e9+7;
signed main()
{
int n, k; cin >> n >> k;
V<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
V<int> s(n+1);
for (int i = 0; i < n; i++) {
s[i+1] = s[i] + a[i];
}
V<int> s2(n+1);
for (int i = 0; i < n; i++) {
s2[i+1] = s2[i] + max(a[i], 0LL);
}
int maxsum = -INF;
for (int i = 0; i+k <= n; i++) {
chmax(maxsum, max(s[i+k] - s[i], 0LL) + (s2[i] + s2[n] - s2[i+k]));
}
cout << maxsum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, sum = 0;
cin >> A >> B;
for (int num = A; num < B+1; num++){
int reverse = 0;
int a = num;
for (int i = 0; i < 5; i++){
int remaind = 0;
remaind = a % 10;
reverse = reverse * 10 + remaind;
a /= 10;
}
if (num == reverse) sum++;
}
cout << sum << endl;
}
| 0
| 689,833
|
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
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;
const int INF = 1e9;
int main() {
char a;
cin >> a;
if (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u') {
cout << "vowel\n";
} else {
cout << "consonant\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n],b[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n; i++){
cin >> b[i];
}
long long sum = 0,sum1 = 0;
int cnt = 0;
for(int i = 0; i < n; i++){
sum += a[i] - b[i];
if(a[i] < b[i]){
sum1 += b[i] - a[i];
cnt++;
}
}
int c[n];
for(int i = 0; i < n; i++){
c[i] = a[i] - b[i];
}
sort(c,c+n);
reverse(c,c+n);
for(int i = 0; i < n; i++){
if(c[i] > 0 && sum1 > 0){
sum1 -= c[i];
cnt++;
}
}
if(sum < 0 || sum1 > 0){
cout << -1 << endl;
}else{
cout << cnt << endl;
}
return 0;
}
| 0
| 90,336,279
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvs = vector<vector<string>>;
template<typename T> using vv = vector<vector<T>>;
template<typename T> using vvv = vector<vector<vector<T>>>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1e9;
const ll LINF = 1e18;
const ll MOD = 1e9 + 7;
const int DX[4] = {1, 0, -1, 0};
const int DY[4] = {0, 1, 0, -1};
#define _sel(_1, _2, x, ...) x
#define repn(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, ...) _sel(__VA_ARGS__, reps, repn)(i, __VA_ARGS__)
#define reppn(i, n) for (ll i = 1; i <= (n); i++)
#define repps(i, a, b) for (ll i = (a); i <= (b); i++)
#define repp(i, ...) _sel(__VA_ARGS__, repps, reppn)(i, __VA_ARGS__)
#define rrepn(i, n) for (ll i = (n) - 1; i >= 0; i--)
#define rreps(i, a, b) for (ll i = (b) - 1; i >= (a); i--)
#define rrep(i, ...) _sel(__VA_ARGS__, rreps, rrepn)(i, __VA_ARGS__)
#define rreppn(i, n) for (ll i = (n); i >= 1; i--)
#define rrepps(i, a, b) for (ll i = (b); i >= (a); i--)
#define rrepp(i, ...) _sel(__VA_ARGS__, rrepps, rreppn)(i, __VA_ARGS__)
#define pb push_back
#define fi first
#define se second
#define rng(v) (v).begin(), (v).end()
#define rrng(v) (v).rbegin(), (v).rend()
#define siz(x) int((x).size())
#define pow2(x) (1ll << (x))
#define bit(x, n) ((x) >> (n) & 1)
#define prt(x) cout << (x) << endl
#define dbg(x) dbgn(#x, x)
template<typename T, typename U> inline bool umax(T& m, U x) { if (m < x) { m = x; return true; } return false; }
template<typename T, typename U> inline bool umin(T& m, U x) { if (m > x) { m = x; return true; } return false; }
template<typename T> inline void errv(T& v) { for (auto x: v) cerr << x << " "; cerr << endl; }
inline void errv(vb& v) { for (auto x: v) cerr << (x ? 1 : 0) << " "; cerr << endl; }
template<typename T> inline void dbgn(string n, T x) { cerr << n << ": " << x << endl; }
template<typename T> inline void dbgn(string n, vector<T>& v) { cerr << n << ": "; errv(v); }
template<typename T> inline void dbgn(string n, vv<T>& m) { cerr << n << ":" << endl; for (auto& v: m) errv(v); }
int main() {
ll n, m;
cin >> n >> m;
vl a(n);
rep(i, n) cin >> a[i];
ll hlcd = 1;
rep(i, n) {
hlcd = lcm(hlcd, a[i] / 2);
}
rep(i, n) {
if ((hlcd * 2 / a[i]) % 2 == 0) {
prt(0);
return 0;
}
}
prt((m / hlcd + 1) / 2);
return 0;
}
|
#define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const long long INF = 1LL << 60;
ll MOD = 1e9+7;
vector<int> Graph[2*100000+1];
vector<bool> visitGraph(2*100000+1,false);
vector<int> ansGraph(2*100000+1, 0);
void bfs(){
queue<int> q;
q.push(1);
visitGraph[1] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto v :Graph[u]) {
if(visitGraph[v]==true) continue;
visitGraph[v] = true;
ansGraph[v] = u;
q.push(v);
}
}
}
int main() {
int N,M; cin>>N>>M;
int A,B;
for (int i = 0; i < M; ++i) {
cin>>A>>B;
Graph[A].push_back(B);
Graph[B].push_back(A);
}
bfs();
bool ok = true;
for (int i = 2; i <= N; ++i) {
if(ansGraph[i]==0){
ok = false; break;
}
}
if(!ok){
cout<<"No"<<endl;
}else{
cout<<"Yes"<<endl;
for (int i = 2; i <= N; ++i) {
cout<<ansGraph[i]<<endl;
}
}
return 0;
}
| 0
| 60,782,781
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int a,b,c; cin >> a >> b >> c;
if (a+b >= c)
cout << "Yes\n";
else
cout << "No\n";
return (0);
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#define pb push_back
const ll INF = 1000000000000000;
const ll MOD = 1000000007;
const double PI = acos(-1);
#define DBG(a,b,c,d)
signed main(){
IO_STREAM;
int a,b;
cin>>a>>b;
string ans;
if(a<=b){
string c;
c=to_string(a);
rep(i,0,b) ans+=c;
}
else{
string c;
c=to_string(b);
rep(i,0,a) ans+=c;
}
cout<<ans<<endl;
return 0;
}
| 0
| 78,643,738
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
int c, r;
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
string s;
cin >> s;
if(s == "snuke"){
c = j;
r = i;
}
}
}
cout << (char)('A'+c) << r+1 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long signed int ll;
constexpr ll NIL = -20000000000;
ll a[20000000] ={NIL};
int h;
ll rk(int n) {
if(n*2+1 <= h) return a[n*2+1];
return NIL;
}
ll lk(int n) {
if(n*2 <= h) return a[n*2];
return NIL;
}
ll pk(int n) {
if(n/2 <= h) return a[n/2];
return NIL;
}
void print(int n){
cout << "node " << n << ": key = " << a[n] << ", ";
pk(n);lk(n);rk(n);
cout << endl;
}
void heaplify(int n) {
int l = n;
if(a[l] < rk(n)) l = n*2+1;
if(a[l] < lk(n)) l = n*2;
if(l != n){
swap(a[l],a[n]);
heaplify(l);
}
}
void ins(int v) {
a[h] = v;
int d = h;
h++;
while(pk(d) < a[d]){
swap(a[d/2],a[d]);
d = d / 2;
}
}
ll ext() {
ll res = a[1];
h--;
a[1] = a[h];
a[h] = NIL;
heaplify(1);
return res;
}
int main() {
h = 1;
a[0] = -NIL;
string s;
int t;
while(!cin.eof()) {
cin >> s;
if(s == "extract") cout << ext() << endl;
else {
cin >> t;
ins(t);
}
}
return 0;
}
| 0
| 35,677,274
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
int n;
cin >> n;
long long int a[n],b[n];
long long int a_sum = 0,b_sum = 0;
for(int i = 0;i < n;i++)
{
cin >> a[i];
a_sum += a[i];
}
for(int i = 0;i < n;i++)
{
cin >> b[i];
b_sum += b[i];
}
if(b_sum > a_sum)
{
cout << "-1\n";
}
else
{
vector<long long int> v;
long long int sum = 0;
int count = 0;
for(int i = 0;i < n;i++)
{
if(a[i] - b[i] < 0)
{
sum += b[i] - a[i];
count++;
}
else if(a[i] - b[i] > 0)
{
v.push_back(a[i] - b[i]);
}
}
if(count == 0)
{
cout << "0\n";
}
else
{
sort(v.begin(),v.end(),greater<int>());
long long int d = 0;
int i = 0;
while(d < sum)
{
d += v[i];
i++;
}
cout << count + i << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define pan(i,n) for(int i=0;i<n;i++)
#define pans(i,n,a) for(int i=a;i<n;i++)
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define INF 1000000007
#define PI 3.141592653
#define inf 100007
#define P pair<ll,ll>
using namespace std;
int main(){
string s,d="";
cin>>s;
int n=s.size(),ans=0,i=0;
while(i<n){
if(s[i]==s[n-1]){
i++,n--;
}
else{
if(s[i]=='x') ans++,i++;
else if(s[n-1]=='x') ans++,n--;
else{
ans=-1;
break;
}
}
}
cout<<ans;
}
| 0
| 46,896,021
|
#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 ll MX=1e18;
int main(){
int n;
cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
ll ans=1;
sort(a.begin(),a.end());
rep(i,n){
if(a[i]==0){
cout << 0 << endl;
return 0;
}
if(ans>MX || MX/ans<a[i]){
cout << -1 << endl;
return 0;
}
ans*=a[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn];
int n;
int id[maxn], num[maxn], top;
bool check(int MAX)
{
top=0;
id[top]=1;
num[top]=a[0];
top++;
for(int i=1;i<n;i++)
{
if(a[i]>a[i-1]){
num[top]=a[i]-a[i-1];
id[top]=1;
top++;
}
else{
int last = a[i-1];
while(last > a[i]){
if(last - num[top-1] >= a[i]){
last-=num[top-1];
top--;
}
else{
num[top-1]-=(last-a[i]);
last=a[i];
}
}
bool flag=0;
for(int j=top-1; j>=0; j--)
{
if(id[j]<MAX){
if(num[j]==1){
id[j]++;
top=j+1;
}
else{
num[j]--;
num[j+1]=1;
id[j+1]=id[j]+1;
top=j+2;
}
flag=1;
break;
}
last-=num[j];
}
if(flag){
if(last!=a[i]){
num[top]=a[i]-last;
id[top]=1;
top++;
}
}
else {
return false;
}
}
}
return true;
}
int main() {
scanf("%d",&n);
for(int i=0; i < n; i++)
{
scanf("%d", a + i);
}
int l = 1, r = n, ans=1;
while(l<=r)
{
int mid=(l+r)>>1;
if(check(mid)){
r=mid-1;
ans=mid;
}
else{
l=mid+1;
}
}
printf("%d\n", ans);
return 0;
}
| 0
| 20,391,230
|
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 1e5 + 5;
int n, k, cnt[A];
int mul(int x, int y) {return (1LL * x * y) % mod;}
int add(int x, int y) {return ((x + y) % mod + mod) % mod;}
int fp(int x, int y)
{
if (!y) return 1;
ll acc = fp(x, y / 2);
acc = mul(acc, acc);
if (y & 1)
acc = mul(acc, x);
return acc;
}
int solve(int x)
{
int ret = fp(k / x, n);
for (int i = 2 * x; i <= k; i += x)
ret = add(ret, -cnt[i]);
return cnt[x] = ret;
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin >> n >> k;
int ans = 0;
for (int i = k; i > 0; i--)
ans = add(ans, mul(i, solve(i)));
cout << ans;
return 0;
}
|
#include<iostream>
#include<fstream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<map>
using namespace std;
int k;
struct pa{
int x,y;
};
deque<pa>p;
bool vis[10000000];
void bfs(){
while(p.size())
{
pa n=p.front();p.pop_front();
if(vis[n.x])
{
continue;
}
vis[n.x]=1;
if(!n.x)
{
cout<<n.y;
return;
}
pa a;
a.x=n.x*10%k;a.y=n.y;
p.push_front(a);
a.x=(n.x+1)%k;a.y=n.y+1;
p.push_back(a);
}
}
int read()
{
int x=0,f=1;
char ch;
while((ch=getchar())<'0'||ch>'9')
{
if(ch=='-')
{
x=-1;
}
}
while(ch>='0'&&ch<='9')
{
x=x*10+ch-48;
ch=getchar();
}
return x*f;
}
int main()
{
k=read();
pa b;
b.x=1;b.y=1;
p.push_front(b);
bfs();
return 0;
}
| 0
| 31,437,800
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, M;
vector<pair<int, int>> ans;
cin >> N >> M;
if (N % 2)
{
for (int l = 0, r = N - 1; l < r; l++, r--)
{
ans.emplace_back(l, r);
}
}
else
{
bool flag = true;
for (int l = 0, r = N - 1; l < r; l++, r--)
{
if (flag && r - l <= N / 2)
{
r--;
flag = false;
}
ans.emplace_back(l, r);
}
}
for (int i = 0; i < M; i++)
{
cout << ans[i].first + 1 << ' ' << ans[i].second + 1 << endl;
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int q;
cin >> q;
for (auto i=0; i<q; i++) {
string M;
cin >> M;
int a, b;
cin >> a >> b;
if (M == "print") {
cout << S.substr(a, b-a+1) << endl;
} else if (M == "reverse") {
reverse(S.begin()+a, S.begin()+b+1);
} else {
string p;
cin >> p;
for (auto i=0; i<p.size(); i++) {
S[a+i] = p[i];
}
}
}
return 0;
}
| 0
| 78,155,818
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, S;
cin >> N;
vector<int> W(N), M(N+1,0);
for (int i=0; i<N; i++) {
cin >> W[i];
S+=W[i];
M[i+1]+=M[i]+W[i];
}
int m=10000000;
for (int i=0; i<=N; i++) {
m=min(m, abs(S-2*M[i]));
}
cout << m << endl;
}
|
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
using std::string;
int main(){
int n;
int y,m,d;
cin >> n;
int summ,sumd;
summ = 0;
sumd = 0;
for(int i = 1;i < 1000;i++){
summ += 20*10;
if(i % 3 != 0){
summ -= 5;
}
}
summ += 1;
for(int i= 0 ;i < n;i++){
sumd = 0;
cin >> y >> m >> d;
for(int j = 1;j < y;j++){
sumd += 10*20;
if(j%3 != 0){
sumd -= 5;
}
}
if(y % 3 == 0){
for(int j = 1;j < m;j++){
sumd += 20;
}
}else{
for(int j = 1;j < m;j++){
if(j % 2 == 0){
sumd += 19;
}else{
sumd += 20;
}
}
}
sumd += d;
cout << summ - sumd << endl;
}
}
| 0
| 13,061,599
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int count = 0;
for(int i=0; i<N; i++)
{
int l,r;
cin >> l >> r;
count += r-l+1;
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
ll n; cin >> n;
vector<ll> A(n,0),K(n);
rep(i,n){
cin >> K[i];
A[K[i]-1]++;
}
ll cnt = 0;
vector<ll> B(n);
rep(i,n){
B[i] = A[i]*(A[i]-1)/2;
cnt += B[i];
}
rep(i,n){
if(A[K[i]-1] != 0)
cnt += - B[K[i]-1] + (A[K[i]-1]-1)*(A[K[i]-1]-2) / 2;
cout << cnt << endl;
if(A[K[i]-1] != 0)
cnt += B[K[i]-1] - (A[K[i]-1]-1)*(A[K[i]-1]-2) / 2;
}
}
| 0
| 35,496,273
|
#include <iostream>
#include <vector>
#include <queue>
#include<map>
#include<algorithm>
#include<set>
#include<iomanip>
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1; i<=n;i++)
#define ALL(a) a.begin(),a.end()
#define PI acos(-1)
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T & val) {
std::fill((T*)array, (T*)(array + N), val);
}
typedef long long int ll;
typedef long double ld;
int main() {
int n, m, k, a, ans = 0; cin >> n >> m;
vector<vector<int>> G(11,vector<int>(11,0));
rep(i, m) {
cin >> k;
rep(j, k) {
cin >> a; a--;
G[i][a] = 1;
}
}vector<int> p(m);
rep(i, m) cin >> p[i];
rep(i, 1 << n) {
int u = 0;
rep(j, m) {
int cnt = 0;
rep(k, n) {
if (G[j][k] && i & (1 << k))cnt++;
}
if (cnt % 2 == p[j]) u++;
}
if (u == m) ans++;
}cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n;
string ans;
cin >> n;
vector<string> s(n);
vector<vector<int>> num_list(n, vector<int>(26, 0));
vector<int> ans_list(26);
for(int i=0; i<n; i++){
cin >> s[i];
}
for(int i=0; i<n; i++){
for(int j=0; j<s[i].size(); j++){
int tmp = s[i][j] - 'a';
num_list[i][tmp]++;
}
}
for(int i=0; i<26; i++){
int tmp=num_list[0][i];
for(int j=1; j<n; j++){
tmp=min(tmp, num_list[j][i]);
}
ans_list[i]=tmp;
}
for(int i=0; i<26; i++){
while(ans_list[i]>0){
char tmp = 'a'+i;
cout << tmp;
ans_list[i]--;
}
}
cout << endl;
return 0;
}
| 0
| 29,516,614
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
#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 < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#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 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 << ' ';
pr(b);
}
using Graph = vector<vector<int>>;
int N, M;
Graph G;
void solve()
{
vector<int> dist(N, -1);
vector<int> prev(N, -1);
queue<int> que;
que.push(0);
dist[0] = 0;
while (!que.empty())
{
int v = que.front();
que.pop();
for (auto nv : G[v])
{
if (dist[nv] == -1)
{
dist[nv] = dist[v] + 1;
prev[nv] = v;
que.push(nv);
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i)
cout << prev[i] + 1 << endl;
}
int main()
{
cin >> N >> M;
G.assign(N, vector<int>());
for (int i = 0; i < M; ++i)
{
int a, b;
cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
solve();
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
# define ll int64_t
# define str string
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define PI 3.141592653589793
# define vec vector
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define INF 2000000000
#define MAX_V 10
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
bool my_compare(pair<string,ll> a,pair<string,ll> b){
if(a.first != b.first) return a.first<b.first;
if(a.second != b.second) return a.second>b.second;
else return true;
}
ll modpow(ll a,ll n,ll mod1) {
ll res=1;
while(n>0){
if(n&1) res=res*a%mod1;
a = a*a%mod1;
n >>= 1;
}
return res;
}
ll factorial(ll n){
ll x=1;
rrep(i,n) (x*=i)%=mod;
return x;
}
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;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m,sum=0;
cin>>n>>m;
if(m>=n*2){
sum+=n;
m-=(n*2);
sum+=m/4;
}else{
sum=m/2;
}
cout<<sum<<endl;
return 0;
}
| 0
| 1,434,076
|
#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, K;
cin>>N>>K;
vector<int> p(N);
for(int i=0;i<N;++i) cin>>p[i];
sort(p.begin(), p.end());
int ans = 0;
for(int i=0;i<K;++i) ans += p[i];
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
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;
}
void hr() {
cerr << "--------------" << endl;
}
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
ll a, b, k;
cin >> a >> b >> k;
ll A = max((ll)0, a - k);
k -= a - A;
ll B = max((ll)0, b - k);
printf("%lld %lld\n", A, B);
return 0;
}
| 0
| 48,393,510
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int r, d, x;
cin >> r >> d >> x;
rep(i,10) {
x = r * x - d;
cout << x << endl;
}
return 0;
}
|
#include<cstdio>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005;
int n,a[N],stk[N],c[N],top,ans;
inline bool check(CI lim)
{
if (lim==1)
{
for (RI i=2;i<=n;++i) if (a[i]<=a[i-1]) return 0; return 1;
}
top=0; for (RI i=2;i<=n;++i) if (a[i]<=a[i-1])
{
int x=a[i]; while (top&&stk[top]>x) --top;
while (top&&stk[top]==x&&c[top]==lim) --top,--x;
if (!x) return 0; if (stk[top]==x) ++c[top]; else stk[++top]=x,c[top]=2;
}
return 1;
}
int main()
{
RI i; for (scanf("%d",&n),i=1;i<=n;++i) scanf("%d",&a[i]);
int l=1,r=n,mid; while (l<=r)
if (check(mid=l+r>>1)) ans=mid,r=mid-1; else l=mid+1;
return printf("%d",ans),0;
}
| 0
| 93,040,370
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i ++)
static const long long MOD = 1000000007;
long long fact[101010];
long long extgcd(long long a, long long b, long long& x, long long& y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
long long inv(long long a) {
long long x, y;
extgcd(a, MOD, x, y);
return (x % MOD + MOD) % MOD;
}
long long nCr(long long n, long long r){
if (n < r) return 0;
if (n - r < r) r = n - r;
long long ans = fact[n] * inv(fact[r]) % MOD * inv(fact[n - r]) % MOD;
return ans;
}
void init() {
fact[0] = 1;
for (int i = 1; i < 101010; i ++) fact[i] = fact[i - 1] * i % MOD;
}
int main() {
init();
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(n + 1, 0);
rep(i, n + 1) {
cin >> a[i];
cnt[a[i]] ++;
}
int twice;
rep(i, n + 1) {
if (cnt[i] >= 2) {
twice = i;
}
}
int left = 0, mid = 0, right = 0;
int i = 0;
while (a[i] != twice) {
left ++;
i ++;
}
i ++;
while (a[i] != twice) i ++;
i ++;
while (i < n + 1) {
right ++;
i ++;
}
int sum = left + right;
for (int k = 1; k <= n + 1; k ++) {
long long ans;
if (sum >= k - 1) ans = ((nCr(n + 1, k) - nCr(sum, k - 1) % MOD) + MOD) % MOD ;
else ans = nCr(n + 1, k) % MOD;
cout << ans % MOD << endl;
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
using namespace std;
int n, a[110000];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int mi = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > mi + 1) {
ans += (a[i] - 1) / (mi + 1);
mi = max(mi, 1);
}else {
mi = max(mi, a[i]);
}
}
cout << ans << endl;
}
| 0
| 92,883,728
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string str, ord, p,ans;
int m, a, b,y;
cin >> str >> m;
for (int i = 0; i < m; i++){
cin >> ord;
if (ord == "replace"){
cin >> a >> b >> p;
for (int k = 0; k < b - a + 1; k++){
str[a + k] = p[k];
}
}
if (ord == "reverse"){
cin >> a >> b;
for (int j = a; j < b ; j++){
y = b;
ans[j] = str[j];
str[j] = str[y];
str[y] = ans[j];
b--;
}
}
if (ord == "print"){
cin >> a >> b;
cout << str.substr(a,b-a+1) << endl;
}
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep(i,N) for (ll i=0;i<N;i++)
#define loop(i,N,M) for(ll i=N;i<M;i++)
#define MAX(v) *max_element(v.begin(),v.end())
#define MIN(v) *min_element(v.begin(),v.end())
#define SORTL2S(type,v) sort(v.begin(),v.end(),greater<type>())
#define SORTS2L(type,v) sort(v.begin(),v.end())
#define SORTMF(v,func) sort(v.begin(),v.end(),func)
#define MP(a,b) make_pair(a,b)
#if __has_include("debug.hpp")
#include "debug.hpp"
#else
template<typename T>
void debug(T& obj) {}
#endif
template<typename T>
T in(){
T val;
cin >> val;
return val;
}
template<typename T>
vector<T> inv(ll num) {
vector<T> val(num);
rep(i,num) cin >> val[i];
return val;
}
void solve() {
ll n,k;
cin >> n >> k;
vector<ll> vec(n);
rep(i,n) cin >> vec[i];
SORTS2L(ll,vec);
ll sum = 0;
rep(i,n-k) sum += vec[i];
cout << sum;
}
int main(int argc, char* argv[]) {
solve();
return 0;
}
| 0
| 13,670,716
|
#include <iostream>
using namespace std;
int n,ans;
string s[300],t[300];
bool solve(void){
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(t[i][j]!=t[j][i])return false;
}
}
return true;
}
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
t[i]=s[i];
}
ans+=solve();
for(int i=1;i<n;i++){
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
t[(j+i)%n][k]=s[j][k];
}
}
ans+=solve();
}
cout<<ans*n<<endl;
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int N, K;
cin >> N >> K;
vector<ll> a(N);
for(auto i = 0; i < N; ++i)
{
cin >> a[i];
}
vector<ll> sum(N + 1);
vector<ll> sumPlus(N + 1);
for (auto i = 0; i < N; ++i)
{
sum[i + 1] = sum[i] + a[i];
sumPlus[i + 1] = sumPlus[i];
if (a[i] > 0)
{
sumPlus[i + 1] += a[i];
}
}
auto ans = 0ll;
for (auto i = 0; i <= N - K; ++i)
{
auto temp = sumPlus[i] + sumPlus[N] - sumPlus[i + K];
auto temp2 = sum[i + K] - sum[i];
if (temp2 > 0)
{
temp += temp2;
}
ans = max(temp, ans);
}
cout << ans << endl;
return 0;
}
| 0
| 11,338,435
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int INF = 1e9 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;;
vector<int> a(n);
vector<int> dp(n, INF);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1] << "\n";
return 0;
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, L;
cin >> N >> L;
int a[100010];
rep(i, N) cin >> a[i];
int idx = -1;
rep(i, N - 1) {
if(a[i] + a[i + 1] >= L) idx = i;
}
if(idx == -1) {
cout << "Impossible" << endl;
return 0;
}
cout << "Possible" << endl;
REP(i, 0, idx - 1) {
cout << i + 1 << endl;
}
RREP(i, N - 2, idx + 1) {
cout << i + 1 << endl;
}
cout << idx + 1 << endl;
return 0;
}
| 0
| 39,839,159
|
#include "bits/stdc++.h"
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
int main() {
int N, M;
cin >> N >> M;
vector<int>P(N);
vector<int>X(M);
vector<int>Y(M);
for (int n = 0; n < N; ++n) {
cin >> P[n];
--P[n];
}
for (int n = 0; n < M; ++n) {
cin >> X[n] >> Y[n];
--X[n];
--Y[n];
}
UnionFind uf(N);
for (int n = 0; n < M; ++n) {
uf.merge(X[n], Y[n]);
}
int ans = 0;
for (int n = 0; n < N; ++n) {
if (uf.root(P[n]) == uf.root(n)) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 9223372036854775807
typedef long long ll;
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define ORREP(i,n) for(int i=(n);i>=1;--i)
#define ZREP(i,n) for(int i=1;i<(n);++i)
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)
#define rollcall cout<<"I'm Sucu."<<endl;
#define YES(s) s?cout << "YES" << endl:cout << "NO" << endl
#define Yes(s) s?cout << "Yes" << endl:cout << "No" << endl
#define Taka(s) s?cout << "Takahashi" << endl:cout << "Aoki" << endl
#define out(s,t,u) s?cout << t << endl:cout << u << endl
#define int ll
#define Endl endl
signed main(){
int A,B;
cin >> A >> B;
A--;B--;
cout << "100 100" << endl;
char C[570][570];
REP(i,100){
REP(j,50){
C[i][j]='#';
C[i][j+50]='.';
}
}
REP(i,A){
C[2*(i/20) +1][2*(i%20)]='.';
}
REP(i,B){
C[2*(i/20) +1][50+2*(i%20)+1+5]='#';
}
REP(i,100){
REP(j,100){
cout << C[i][j];
}cout << endl;
}cout << endl;
return 0;
}
| 0
| 3,950,059
|
#include<bits/stdc++.h>
using namespace std;
int main ()
{
string a,b,c; cin>>a>>b>>c;
char m='A'-'a';
printf("%c%c%c\n",a[0]+m,b[0]+m,c[0]+m);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
int main(){
int N;
cin>>N;
vector<ll> a(N),b(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
cin>>b.at(i);
}
ll a_count=0,b_count=0;
for(int i=0;i<N;i++){
if(a.at(i)>b.at(i)){
b_count+=a.at(i)-b.at(i);
}else{
if((b.at(i)-a.at(i))%2==0){
a_count+=(b.at(i)-a.at(i))/2;
}else{
a_count+=(b.at(i)-a.at(i)-1)/2+1;
b_count++;
}
}
}
if(a_count>=b_count){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
| 0
| 41,645,063
|
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};
ll MOD = 1000000007;
const int MAX_N = 100000;
const int MAX_M = 200000;
struct edge{int to, cost;};
vector<edge> G[MAX_N];
int V[MAX_N];
int n, m;
int l[MAX_M], r[MAX_M], d[MAX_M];
bool used[MAX_N];
bool dfs(int v) {
if(used[v]) return true;
used[v] = true;
bool res = true;
REP(i, G[v].size()){
if(used[G[v][i].to]) res = res & (G[v][i].cost == V[v] - V[G[v][i].to]);
else {
V[G[v][i].to] = V[v] - G[v][i].cost;
res = res & dfs(G[v][i].to);
}
}
return res;
}
int main(){
cin >> n >> m;
REP(i, m) {
cin >> l[i] >> r[i] >> d[i];
l[i]--; r[i]--;
G[l[i]].push_back(edge{r[i], d[i]});
G[r[i]].push_back(edge{l[i], -d[i]});
}
REP(i, n) used[i] = false;
bool ans = true;
REP(i, n) {
if(!used[i]) V[i] = 0;
ans = ans & dfs(i);
}
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#define mp make_pair
#define all(v) v.begin(),v.end()
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
ll power(ll a, ll n)
{
ll ans=1;
while(n)
{
if(n&1) ans*=a;
a*=a;
n>>=1;
}
return ans;
}
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int main()
{
IOS;
ll n;
cin>>n;
ll a[n+1]={0};
repf(i,0,n)
{
ll x;
cin>>x;
a[x]++;
}
vector<ll> v,c;
repf(i,1,n+1) if(a[i]) v.pb(a[i]);
sort(all(v));
c.pb(v[0]);
repf(i,1,v.size())
{
c.pb(c[c.size()-1]+v[i]);
}
repf(i,1,n+1)
{
ll lo=0,hi=n/i,ans=0,mid;
while(lo<=hi)
{
mid=(lo+hi)/2;
int x=lower_bound(all(v),mid)-v.begin();
ll val=v.size()-x;
if(x!=0) val+=c[x-1]/mid;
if(val>=i)
{
ans=max(ans,mid);
lo=mid+1;
}
else hi=mid-1;
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 98,343,619
|
#include <bits/stdc++.h>
using namespace std;
void input(string& rsTarget)
{
cin >> rsTarget;
}
int parse(string sTarget)
{
const vector<string> cnvsWord{"dream", "dreamer", "erase", "eraser"};
int ixBgn, ixEnd;
ixBgn = sTarget.size();
while (ixBgn)
{
bool bReslt = false;
ixEnd = ixBgn;
for (int i = 0; i < cnvsWord.size(); i++)
{
ixBgn = ixEnd - cnvsWord[i].size();
if (ixBgn < 0) continue;
if (sTarget.substr(ixBgn, cnvsWord[i].size()) == cnvsWord[i])
{
bReslt = true;
break;
}
}
if (!bReslt) return 0;
}
return 1;
}
int main()
{
string sTarget;
input(sTarget);
if (parse(sTarget)) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long double LD;
typedef long long ll;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define INF 2147483647
#define endl "\n"
#define FasterIO ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0) ;
#define precision(a) cout << fixed << setprecision(a)
#define bug(a,b) cout<<a<<"\t"<<b<<"\n";
#define Case(a,b) cout<<"Case "<<a<<": "<<b<<"\n";
#define reset(a,b) memset(a,b,sizeof(a));
#define For(x,n) for(int i=x; i<n; i++)
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const int mod = 1e9+7;
const double PI=acos(-1);
int strtoint(string str){
stringstream ss(str);
int x = 0;
ss >> x ;
return x ;
}
string intostr(int x){
stringstream ss;
ss << x;
string str = ss.str();
return str;
}
void rem(string &s, const string &c) {
auto pos = s.find(c);
if (pos == string::npos) {
cout << -1 << endl;
exit(0);
}
s.erase(0, pos + 1);
}
void println (int n){
cout<<n<<"\n";
}
void printvec(vector <int> &a){
for (int i=0;i<a.size();i++){
cout<<a[i]<<" ";
}
cout<<"\n";
}
void printgraph(vector <int> g[],int e){
for (int i=0;i<e;i++){
cout<<i<<" --> ";
for (int j=0;j<g[i].size();j++){
cout<<g[i][j]<<" ";
}
cout<<"\n";
}
}
void printmap (map <int,int> &mymap){
for (auto itr = mymap.begin(); itr != mymap.end(); ++itr) {
cout << '\t' << itr->first
<< '\t' << itr->second << '\n';
}
cout << "\n";
}
char grid[1005][1005];
int dp[1005][1005];
void solve(){
int n,m;
cin>>n>>m;
for (int i=0;i<n;i++){
cin>>grid[i];
}
for (int i=0;i<n;i++){
for (int j=0;j<m;j++){
if (grid[i][j]=='#')continue;
if (i==0 && j==0){
dp[i][j]=1;
continue;
}
if (i>0)dp[i][j]+=dp[i-1][j];
if (j>0)dp[i][j]+=dp[i][j-1];
dp[i][j]=dp[i][j]%mod;
}
}
cout<<dp[n-1][m-1]<<endl;
}
int main(){
solve();
return 0;
}
| 0
| 41,948,549
|
#include<bits/stdc++.h>
using namespace std;
int k,num=9;queue<long long>q;
void bfs()
{
while(!q.empty())
{
long long x=q.front(),lst=x%10;q.pop();
for(int i=lst-1;i<=lst+1;++i)
{
if(i<0||i>9) continue;
q.push(x*10+i);++num;
if(num==k)
{
cout<<x*10+i;
return;
}
}
}
}
int main()
{
cin>>k;
for(int i=1;i<=9;++i)
q.push(i);
if(k<=9) cout<<k;
else bfs();
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
char S[15], T[15], U[15];
int A, B;
scanf ("%s %s", S, T);
scanf ("%d %d", &A, &B);
scanf ("%s", U);
(strcmp (S,U) == 0) ? A-- : B--;
printf ("%d %d", A, B);
return 0;
}
| 0
| 30,849,177
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int n; cin >> n;
while(true){
int a=n%10, b=n/10%10, c=n/100;
if(a==b && b==c && c==a) break;
n++;
}
cout << n << ln;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) { \
cerr << ((hoge) ? "," : "") << x[hoge]; \
} \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N, M;
cin >> N >> M;
cout << N * (N - 1) / 2 + M * (M - 1) / 2 << endl;
return 0;
}
| 0
| 41,345,544
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define data pair<int,pii>
int N;
vector<data> V;
signed main()
{
cin >> N;
rep(i, N)
{
int a, b;
cin >> a >> b;
V.push_back({a + b, {a, b}});
}
sort(V.rbegin(), V.rend());
int ans = 0;
rep(i, N)
{
if(i & 1)ans -= V[i].second.second;
else ans += V[i].second.first;
}
cout << ans << 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;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr 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, b, c, d, tmp, m, h, w, x, y, sum, k, q;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
ans = LINF;
if (b - a <= 5000) {
rrep(i, a, b + 1) {
rrep(j, a, b + 1) {
if (i >= j) continue;
ans = min(ans, (i * j) % 2019);
}
}
} else
ans = 0;
Cout(ans);
return 0;
}
| 0
| 19,577,167
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long int ll;
template<typename T> T changeMax(T& a, T b){if(a < b)a = b;return 0;}
int main()
{
int n;
cin >> n;
if(n < 1200)cout << "ABC" << endl;
else if(n < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
system("pause");
}
|
#include <cstdio>
#include <cctype>
int main(){
int i=0, a[26]={0};
char ch;
while( scanf("%c", &ch) != EOF ){
if( isupper(ch) )
ch = tolower(ch);
if('a'<=ch && ch<='z')
++a[ ch-'a' ];
++i;
}
for(int x=0; x<26; ++x)
printf("%c : %d\n", 'a'+x, a[x]);
return 0;
}
| 0
| 12,944,535
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=30;
const ll INF=0x3f3f3f3f3f3f3f;
ll p,q,mux[MAX][MAX],tmp[MAX];
ll find_mux(ll a,ll b){
int tmp[MAX];
if(mux[a][b]==-1){
mux[a][b]=0;
for(ll i=0;i<MAX;i++) tmp[i]=0;
for(ll i=2;i<=a;i+=2) tmp[find_mux(a-i,b+i/2)]=1;
for(ll i=2;i<=b;i+=2) tmp[find_mux(a+i/2,b-i)]=1;
for(ll i=0;i<MAX;i++){
if(!tmp[i]) break;
mux[a][b]++;
}
}
return mux[a][b];
}
int main(){
scanf("%lld%lld",&p,&q);
if(abs(p-q)<=1) printf("Brown\n");
else printf("Alice\n");
}
|
#include<bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll,ll>>
#define pii pair<int,int>
#define REP(i,a) for(int (i)=0; (i)<(a); (i)++)
#define RREP(i,a) for(int (i)=a-1; (i)>=(0); (i)--)
#define REP2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define m0(x) memset(x,0,sizeof(x))
typedef long long ll;
using namespace std;
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = (ans*x) % MOD;
x = (x*x) % MOD;
n = n >> 1;
}
return ans;
}
ll cnt[100] = {};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, ans = 0; cin >> N;
vector<ll> A(N);
REP(i,N){
cin >> A[i];
REP(j,60) cnt[j] += (A[i] >> j) & 1;
}
REP(j,60){
ans += ((cnt[j] * (N-cnt[j])) % MOD) * mpow(2, j);
ans %= MOD;
}
cout << ans;
return 0;
}
| 0
| 67,780,365
|
#include <iostream>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
for (int i = 0; i <= N; i++) {
for (int j = 0; i+j <= N; j++) {
int total = 10000 * i + 5000 * j + 1000 * (N-i-j);
if (total == Y) {
cout << i << " " << j << " " << N-i-j << endl;
return 0;
}
}
}
cout << -1 << " " << -1 << " " << -1 << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define close std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define eps 1e-8
typedef long long ll;
const double PI = acos(-1.0);
constexpr int INF = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3f;
constexpr int mod = 1e9+7;
constexpr int maxn = 1e6+100;
int main(){
close;
string s;
cin >> s;
int n = s.size();
int ans = 0, tp = 0;
for(int i = 0; i < n; i++){
if(s[i] == 'R'){
tp++;
}else {
ans = max(ans , tp);
tp = 0;
}
}
ans = max(ans , tp);
cout << ans << endl;
return 0;
}
| 0
| 62,352,545
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#include<functional>
#include<ios>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int main()
{
ll K,A,B;
cin>>K>>A>>B;
if(K>=(A+1)&&B-A>1)
{
ll fc=K-(A-1);
ll cnt=fc/2;
ll c=B+(cnt-1)*(B-A);
ll cc=fc%2;
cout<<c+cc<<endl;
}
else
{
cout<<K+1<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
int __stoi(string s){ return atoi(s.c_str()); }
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
template<class T> void chmax(T& a, T b){ if(a<b){a=b;} }
template<class T> void chmin(T& a, T b){ if(a>b){a=b;} }
template<class T> bool isIn(T a,vector<T> v){ for(T x:v){ if(a==x){return true;}} return false;}
string strReplace(string s,string target, string replacement){
if (!target.empty()) {
std::string::size_type pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
s.replace(pos, target.length(), replacement);
pos += replacement.length();
}
}
return s;
}
const ll MOD = 1e9+7;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MP make_pair
bool DEBUG = 0;
template<class T> void dprint(T s){
if(DEBUG){ cout << s << "\n"; }
}
map<int,int> mp1,mp2;
vector<int> ns1,ns2;
bool func1(int a,int b){
return mp1[a]>mp1[b];
}
bool func2(int a,int b){
return mp2[a]>mp2[b];
}
int main(int argc,char* argv[]){
if(argc>1 && argv[1][0]=='D'){ DEBUG=1;}
dprint("start");
int N; cin>>N;
int v[N];
REP(i,N){
cin>> v[i];
if(i%2==0){
++mp1[ v[i] ];
if(mp1[ v[i] ]==1){
ns1.push_back(v[i]);
}
}else{
++mp2[ v[i] ];
if(mp2[ v[i] ]==1){
ns2.push_back(v[i]);
}
}
}
sort(ALL(ns1),func1);
sort(ALL(ns2),func2);
int ans = 0;
if(ns1[0]!=ns2[0]){
ans = N - mp1[ ns1[0] ] - mp2[ ns2[0] ];
}else{
ans = min( N - mp1[ ns1[0] ], N - mp2[ ns2[0] ] );
if(ns1.size()>1){
chmin(ans, N - mp1[ ns1[1] ] - mp2[ ns2[0] ]);
}
if(ns2.size()>1){
chmin(ans, N - mp1[ ns1[0] ] - mp2[ ns2[1] ]);
}
}
cout << ans << "\n";
}
| 0
| 7,976,551
|
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int d[1005][1005];
int main(){
string s1,s2;
cin>>s1>>s2;
s1=' '+s1;
s2=' '+s2;
int l1=s1.size();
int l2=s2.size();
int i,j;
for( i=1;i<l1;i++)d[i][0]=i;
for( j=1;j<l2;j++)d[0][j]=j;
for( i=1;i<l1;i++){
for( j=1;j<l2;j++){
if(s1[i]==s2[j]){
d[i][j]=d[i-1][j-1];
}else{
d[i][j]=min(d[i][j-1],min(d[i-1][j],d[i-1][j-1]))+1;
}
}
}cout<<d[l1-1][l2-1]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define dump_4(x1, x2, x3, x4) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define dump_5(x1, x2, x3, x4, x5) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#define dump(...) \
CHOOSE((__VA_ARGS__, dump_5, dump_4, dump_3, dump_2, dump_1, ~))(__VA_ARGS__)
#define check(s) cerr << s << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
using namespace std;
using ll = long long;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
const ll LINF = 2e18;
const int INF = 1e9;
void solve(ll N) { cout << N * (N - 1) / 2 << endl; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll N;
scanf("%lld", &N);
solve(N);
return 0;
}
| 0
| 85,614,059
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
map <ll, ll> ma;
bool flag = true;
for(int i=0; i<n; i++){
int a; cin >> a;
ma[a]++;
if(ma[a]==2) flag=false;
}
if(flag) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
const int mod = 1e9 + 7;
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...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define RESET(a, b) memset(a, b, sizeof(a))
#define EB emplace_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define size(v) (int)v.size()
#define endl "\n"
#define UMO unordered_map
#define USO unordered_set
#define setBits(n) __builtin_popcountll(n)
#define MX *max_element
#define MN *min_element
#define TC int t; cin >> t; while (t--)
void Panda() {
int a, b;
cin >> a >> b;
int cnt = 0;
for(int i = a; i <= b; i++) {
string s = to_string(i);
reverse(ALL(s));
if(s == to_string(i)) cnt++;
}
cout << cnt << endl;
}
int32_t main() {
FAST;
Panda();
return 0;
}
| 0
| 36,512,495
|
#include <iostream>
using namespace std;
using ll = long long;
ll labs(ll a)
{
if (a >= 0) return a;
else return -a;
}
ll diffabs(ll a, ll b)
{
if (a >= b) return a - b;
else return b - a;
}
int main()
{
ll x, y;
cin >> x >> y;
int ans = diffabs(labs(x), labs(y));
if (x * y > 0 && x > y)
ans += 2;
else if (x * y == 0 && x > y)
ans += 1;
else if (x * y < 0)
ans += 1;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int rainy = 0;
int maxrainy = 0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
rainy++;
} else {
rainy = 0;
}
if(rainy > maxrainy){
maxrainy = rainy;
}
}
cout << maxrainy << endl;
}
| 0
| 74,271,311
|
#include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<bitset>
using namespace std;
size_t count(const string& str, const string& sub, const size_t ini = 0, const size_t fin = string::npos) {
size_t pos = str.find(sub, ini);
size_t cnt = 0;
while (pos < fin) {
cnt += 1;
pos = str.find(sub, pos + sub.length());
}
return cnt;
}
int main() {
string S;
cin >> S;
string ALP = "ABDEFGHIJKLMNOPQRSTUVWXYZ";
bool jdg = true;
string str;
size_t cnt;
if ("A" == S.substr(0, 1)) {
str = S.substr(2, S.length() - 3);
cnt = count(str, "C");
if (cnt != 1) {
jdg = false;
}
else {
str = S.substr(1, S.length() - 1);
for (int i = 0; i < str.length(); i++) {
if (string::npos != ALP.find(str.substr(i, 1))) {
jdg = false;
break;
}
}
}
}
else {
jdg = false;
}
if (jdg == true) {
cout << "AC" << endl;
}
else {
cout << "WA" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int,int>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
const ll MAX=1e18;
int main() {
int n; cin>>n;
vll a(100010);
ll ans=1;
rep(i,n) {
cin>>a[i];
if(a[i]==0) {
cout<<0<<endl;
return 0;
}
}
rep(i,n) {
if(ans<=MAX/a[i]) {
ans*=a[i];
} else {
ans=-1;
break;
}
}
cout<<ans<<endl;
}
| 0
| 96,140,152
|
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = n;i >= m;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define ALL(n) n.begin(),n.end()
int main() {
int h, w;
cin >> h >> w;
REP(i, h) {
REP(j, w) {
string a;
cin >> a;
if (a == "snuke") {
char s = j + 'A';
cout << s << i + 1 << endl;
}
}
}
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
int main()
{
_LL n;
cin >> n;
_LL a = 10;
_LL ans = 0;
if( n % 2 == 1 )
{
cout << 0;
return 0;
}
while( a <= n )
{
ans += ( n / a );
a *= 5;
}
cout << ans;
return 0;
}
| 0
| 73,184,596
|
#include <iostream>
#include <unordered_map>
using namespace std;
int fib(int);
unordered_map<int, int> memoFib;
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
}
int fib(int n) {
if(memoFib.count(n)) return memoFib[n];
int a;
a = memoFib[n] = n == 0 || n == 1 ? 1 : fib(n - 1) + fib(n - 2);
return a;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define pp pair<int,int>
#define ll long long
#define ld long double
int inf=100000000;
ll INF=4000000000000000000;
ll MOD=1000000007;
int main() {
int n;
string s;
cin >> n >> s;
s+=s.at(0);
rep(j,4){
vector<int> a(n);
a.at(0)=j/2;
a.at(1)=j%2;
int c;
if (s.at(1)=='o') {c=(a.at(0)+a.at(1))%2;}
else c=(a.at(0)+1-a.at(1))%2;
for (int i=2;i<n-1;i++){
a.at(i)=c;
if (s.at(i)=='o') {c=(a.at(i-1)+a.at(i))%2;}
else c=(a.at(i-1)+1-a.at(i))%2;
}
a.at(n-1)=c;
if (s.at(n-1)=='o') {
if ((a.at(n-2)+a.at(n-1))%2!=a.at(0)) continue;
}
else if ((a.at(n-2)+1-a.at(n-1))%2!=a.at(0)) continue;
if (s.at(0)=='o') {
if ((a.at(n-1)+a.at(0))%2!=a.at(1)) continue;
}
else if ((a.at(n-1)+1-a.at(0))%2!=a.at(1)) continue;
string u;
rep(i,n){
if (a.at(i)==0) u.push_back('S');
else u.push_back('W');
}
cout << u << endl;
return 0;
}
cout << -1 << endl;
}
| 0
| 59,421,788
|
#include<iostream>
#include<vector>
using namespace std;
int get_square(int x){
return x*x;
}
int main(){
vector<int> area_anss;
int d;
while(cin>>d){
int area=0;
for(int i=1;i<600/d;i++){
area=area+get_square(i*d)*d;
}
area_anss.push_back(area);
}
for(int i=0;i<area_anss.size();i++){
cout<<area_anss[i]<<endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define rt return
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define eps 1e-6
#define gg(x) getInt(&x)
#define db(x) cout<<"== [ "<<x<<" ] =="<<endl;
using namespace std;
typedef long long ll;
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;}
ll powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
inline void getInt(int* p);
const int maxn=1000010;
const int inf=0x3f3f3f3f;
int n,k;
struct info
{
int x,v;
}a[maxn];
bool cmp(info one,info two)
{
return one.v>two.v;
}
int vis[maxn];
stack<int> s;
int main()
{
scanf("%d %d",&n,&k);
repd(i,1,n)
{
scanf("%d %d",&a[i].x,&a[i].v);
}
sort(a+1,a+1+n,cmp);
ll cnt=0;
ll tp=0;
ll res=0;
ll ans=0ll;
repd(i,1,n)
{
if(cnt<k)
{
if(vis[a[i].x]==0)
{
vis[a[i].x]=1;
tp++;
}else
{
s.push(a[i].v);
}
res+=a[i].v;
cnt++;
ans=max(ans,res+1ll*tp*tp);
}
else{
if(s.empty())
break;
if(vis[a[i].x])
continue;
vis[a[i].x]=1;
tp++;
res-=s.top();
res+=a[i].v;
s.pop();
ans=max(ans,res+tp*tp);
}
}
printf("%lld\n",ans);
return 0;
}
inline void getInt(int* p) {
char ch;
do {
ch = getchar();
} while (ch == ' ' || ch == '\n');
if (ch == '-') {
*p = -(getchar() - '0');
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 - ch + '0';
}
}
else {
*p = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 + ch - '0';
}
}
}
| 0
| 61,963,822
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define COUNT(V,X) (upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X))
#define debug(x) cerr<<#x<<':'<<x<<endl;
#define DEBUG(v) cerr<<#v<<':';for(auto xXx:v)cerr<<xXx<<' ';cerr<<endl;
#define Yes(X) if(X){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YES(X) if(X){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define ctoi(C) (C-'0')
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int,int>;
using pl = pair<long long,long long>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
const long long dx[] = {1,0,-1,0};
const long long dy[] = {0,1,0,-1};
const long long dx8[] = {1,1,0,-1,-1,-1,0,1};
const long long dy8[] = {0,1,1,1,0,-1,-1,-1};
const long long dx9[] = {1,1,0,-1,-1,-1,0,1,0};
const long long dy9[] = {0,1,1,1,0,-1,-1,-1,0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
long long max(long long x,int y){return max(x,(long long)y);}
long long max(int x,long long y){return max((long long)x,y);}
long long min(long long x,int y){return min(x,(long long)y);}
long long min(int x,long long y){return min((long long)x,y);}
bool check(vl d,vl A){
vl copy = d,yay(d.size(),0);
ll N = d.size();
ll MAX = *max_element(ALL(d));
FOR(i,0,N)d[i] -= MAX;
ll counter = 0;
FOR(i,0,N){
if(d[i]%N)return 0;
counter += d[i]/N;
}
FOR(i,0,N){
yay[i] -= counter;
yay[i] += d[i];
}
ll sum = 0;
FOR(i,0,N)sum += A[i];
if(sum%((N)*(N+1)/2))return 0;
return (sum/((N)*(N+1)/2)+counter)%N == 0 && sum/((N)*(N+1)/2)+counter >= 0 && copy == yay;
}
signed main(){
ll N;
cin >> N;
vl A(N);
FOR(i,0,N)cin >> A[i];
vl d(N);
d[0] = A[0] - A[N-1];
FOR(i,1,N)d[i] = A[i] - A[i-1];
YES(check(d,A));
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
const int mod = 1000000007;
signed main() {
int N, M; cin >> N >> M;
vector<bool> t(N, true);
rep(i, M) {
int a; cin >> a;
t[a] = false;
}
vector<int> dp(N+1, 0);
dp[0] = 1;
rep(i, N) {
if(!t[i]) continue;
if(t[i+1]) {
dp[i+1] += dp[i];
dp[i+1] %= mod;
}
if(i < N-1 && t[i+2]) {
dp[i+2] += dp[i];
dp[i+2] %= mod;
}
}
cout << dp[N] << endl;
}
| 0
| 15,111,616
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
typedef long long ll;
const int MAX = 1e7+10;
const int MAX1 = 1e5+10;
const int INF = 1e9+10;
double eps = 1e-6;
int cnt[MAX];
int main(){
IOS
int n;
cin >> n;
for(int i = 1;i < 1e7+5;i++){
for(int j = i;j < 1e7+5;j += i){
++cnt[j];
}
}
ll sum = 0;
for(int i = 1;i <= n;i++){
sum += (ll) i*cnt[i];
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T>
void print(const vector<T> &x) {
int n = x.size();
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i,n) {
rep(j,x[i].size()) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<typename T>
void print(const vector<T> &x, int n) {
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x, int n, int m) {
rep(i,n) {
rep(j,m) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void input_init() {
cin.tie(0); ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int n = 4;
vector<ll> a(n);
rep(i,n) cin>>a[i];
ll ans = -LINF;
rep(i,2) {
for (int j = 2; j < n; ++j) {
chmax(ans, a[i]*a[j]);
}
}
cout << ans << '\n';
return 0;
}
| 0
| 2,975,608
|
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using LP = pair<int, int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
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 double PI=3.14159265358979323846;
int mod = 1e9+7;
const long long INF = 1LL<<60;
int main(){
string str;
cin >> str;
ll K;
cin >> K;
for(int i=0; i<min((ll)str.size(), K); i++){
if(str[i] != '1'){
cout << str[i] << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
|
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int n; cin >> n;
vector<int> to[n];
rep(_,n){
int u; cin >> u; --u;
int k; cin >> k;
rep(i,k){
int v; cin >> v; --v;
to[u].push_back(v);
}
}
int dist[n];
rep(i,n) dist[i] = -1;
queue<int> q;
q.push(0);
dist[0] = 0;
while(!q.empty()){
int u = q.front(); q.pop();
for(int v: to[u]){
if(dist[v] == -1){
dist[v] = dist[u]+1;
q.push(v);
}
}
}
rep(i,n){
printf("%d %d\n", i+1, dist[i]);
}
}
| 0
| 56,977,691
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
ll n;
vl a(3);
cin >> n >> a[0] >> a[1]>> a[2];
vl l(n);
rep(i,n)cin>>l[i];
ll res = L_INF;
for(int a1=1;a1<(1<<n);a1++){
for(int a2=1;a2<(1<<n);a2++){
if(a1 & a2) continue;
for(int a3=1;a3<(1<<n);a3++){
if(a1 & a3)continue;
if(a2 & a3)continue;
vl sum(3,0),cnt(3,0);
rep(j,n){
if(a1 & (1<<j)){
sum[0]+=l[j];
cnt[0]++;
}
if(a2 & (1<<j)){
sum[1]+=l[j];
cnt[1]++;
}
if(a3 & (1<<j)){
sum[2]+=l[j];
cnt[2]++;
}
}
ll ans = 0;
rep(j,3){
ans += abs(a[j] - sum[j]);
ans += 10 * (cnt[j]-1);
}
res = min(ans,res);
}
}
}
out(res);
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
vector<int> h(n);
for(int i=0;i<n;i++)
{
cin>>h[i];
}
vector<int> dp(n,INT_MAX);
dp[0]=0;
dp[1]=abs(h[1]-h[0]);
for(int i=2;i<n;i++)
{
for(int j=i-1,jump=0; j>=0&&jump<k;j--,jump++){
dp[i]=min(dp[i],dp[j]+abs(h[j]-h[i]));
}
}
cout<<dp[n-1]<<endl;
return 0;
}
| 0
| 56,530,721
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+100;
struct Node{
int index, number;
}a[N];
int n;
bool cmp(const Node &x,const Node &y)
{
return x.number < y.number;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].number);
a[i].index = i;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++)
{
printf("%d ",a[i].index);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int h,w;
cin>>h>>w;
char c[h][w],ans[2*h][w];
rep(i,h){
rep(j,w){
cin>>c[i][j];
}
}
for(int i=0;i<2*h;i++){
for(int j=0;j<w;j++){
ans[i][j]=c[i/2][j];
}
}
rep(i,2*h){
rep(j,w){
cout<<ans[i][j];
}
cout<<endl;
}
}
| 0
| 34,145,006
|
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
string s;
cin >> s;
bool ok = true;
for (int i = 0; i < a+b+1 && ok; ++i) {
if (i != a) {
if (s.at(i) == '-') {
ok = false;
}
} else {
if (s.at(i) != '-') {
ok = false;
}
}
}
if (ok) {
cout << "Yes";
} else {
cout << "No";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <boost/hana/functional/fix.hpp>
#if DEBUG
template <typename Iter>
void debug_iter(Iter begin, Iter end);
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T>
void debug(const std::vector<T>& v) {
debug_iter(v.begin(), v.end());
}
template <typename T>
void debug(const std::set<T>& s) {
debug_iter(s.begin(), s.end());
}
template <typename T, typename U>
void debug(const std::map<T, U>& m) {
debug_iter(m.begin(), m.end());
}
template <typename T, typename U>
void debug(const std::pair<T, U>& p) {
std::cerr << "{";
debug(p.first);
std::cerr << ", ";
debug(p.second);
std::cerr << "}";
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
debug(value);
std::cerr << ", ";
debug(args...);
}
template <typename Iter>
void debug_iter(Iter begin, Iter end) {
std::cerr << "{";
for (Iter it = begin; it != end; ++it) {
if (it != begin) std::cerr << ", ";
debug(*it);
}
std::cerr << "}";
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")\n"; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define rd(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << '\n';
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define wt(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
for (T& vi : v) is >> vi;
return is;
}
template <typename T>
bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;
using namespace std;
int main() {
rd(int, n);
vector<int> target(3);
cin >> target;
vector<int> l(n);
cin >> l;
vector<int> current(3);
int ans = numeric_limits<int>::max();
boost::hana::fix([&](auto f, int depth, int used_mp) {
if (depth == n) {
rep(i, 3) {
if (current[i] == 0) return;
used_mp += abs(target[i] - current[i]);
}
chmin(ans, used_mp);
return;
}
rep(i, 4) {
int mp = 0;
if (i < 3) {
if (current[i] != 0) {
mp += 10;
}
current[i] += l[depth];
}
f(depth + 1, used_mp + mp);
if (i < 3) {
current[i] -= l[depth];
}
}
})(0, 0);
wt(ans);
}
| 0
| 88,105,411
|
#include <cstdio>
const char c[]={'R','Y','G','B'};
int n,m,d,b;
int main(){
scanf("%d%d%d",&n,&m,&d);b=10000*d;
for(int i=0;i<n;++i,putchar(10))
for(int j=0;j<m;++j)
putchar(c[(((i+j)/d&1)<<1)|((i-j+b)/d&1)]);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define ggr getchar();getchar();return 0;
#define prique priority_queue
constexpr auto mod = 1000000007;
#define inf 1e15
#define key 1e9
using namespace std;
typedef pair<int, int>P;
template<class T> inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template<class T> inline void chmin(T& a, T b) {
a = std::min(a, b);
}
const int MAX = 2330000;
int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COMB(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)cnt++;
}
if (cnt != 1)return false;
else return n != 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= (i % mod); res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
class UnionFind {
protected:
int* par, * rank, * size;
public:
UnionFind(unsigned int size) {
par = new int[size];
rank = new int[size];
this->size = new int[size];
rep(i, size) {
par[i] = i;
rank[i] = 0;
this->size[i] = 1;
}
}
int find(int n) {
if (par[n] == n)return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m)return;
if (rank[n] < rank[m]) {
par[n] = m;
size[m] += size[n];
}
else {
par[m] = n;
size[n] += size[m];
if (rank[n] == rank[m])rank[n]++;
}
}
bool same(int n, int m) {
return find(n) == find(m);
}
int getsize(int n) {
return size[find(n)];
}
};
int dight(int n) {
int ans = 1;
while (n >= 10) {
n /= 10;
ans++;
}
return ans;
}
int dight_sum(int n) {
int sum = 0;
rep(i, 20)sum += (n % (int)pow(10, i + 1)) / (pow(10, i));
return sum;
}
int dight_min(int n) {
int ans = 9;
while (n >= 10) {
ans = min(ans, n % 10);
n /= 10;
}
ans = min(ans, n);
return ans;
}
int dight_max(int n) {
int ans = 0;
while (n >= 10) {
ans = max(ans, n % 10);
n /= 10;
}
ans = max(ans, n);
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int f(int l, int x) {
if (l == 1 && x == 1)return 1;
if (x == 1)return 0;
if (x <= pow(2, l) - 2)return f(l - 1, x - 1);
if (x == pow(2, l) - 1)return f(l - 1, x - 2) + 1;
if (x != pow(2, l + 1) - 3)return f(l - 1, pow(2, l) - 3) + f(l - 1, x - pow(2, l) + 1) + 1;
return f(l - 1, pow(2, l) - 3) * 2 + 1;
}
signed main() {
int n, x;
cin >> n >> x;
n++;
cout << f(n, x) << endl;
ggr
}
| 0
| 8,528,454
|
#include<iostream>
int x = 0 , y = 1 ;
int main()
{
for(;(x != 0) || (y != 0);)
{
std::cin >> x >> y;
if(( x != 0 ) || ( y != 0 ))
{
if(x <= y)
{
std::cout << x << " " << y << std::endl ;
}
else
{
std::cout << y << " " << x << std::endl ;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, N_max=0, M_max=0, max;
cin >> N;
vector<string> N_s(N);
for(int i=0;i<N;i++){
cin >> N_s.at(i);
}
cin >> M;
vector<string> M_t(M);
for(int i=0;i<M;i++){
cin >> M_t.at(i);
}
for(int i=0;i<N;i++){
int cnt = 0;
for(int j=0;j<N;j++){
if(N_s.at(i)==N_s.at(j)){
cnt++;
}
}
for(int j=0;j<M;j++){
if(M_t.at(j)==N_s.at(i))cnt--;
}
if(i==0){
N_max=cnt;
}
else if(cnt>N_max){
N_max = cnt;
}
}
for(int i=0;i<M;i++){
int cnt = 0;
for(int j=0;j<M;j++){
if(M_t.at(i)==M_t.at(j)){
cnt--;
}
}
for(int j=0;j<N;j++){
if(N_s.at(j)==M_t.at(i))cnt++;
}
if(i==0){
M_max=cnt;
}
else if(cnt>M_max){
M_max = cnt;
}
}
if(M_max > N_max)max = M_max;
else max=N_max;
if(max<0)max = 0;
cout << max << endl;
}
| 0
| 10,732,971
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, w;
cin >> s >> w;
if(w >= s) {
cout << "unsafe\n";
}else{
cout << "safe\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define pb push_back
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int kaijo[2000010];
struct edge{int to,cost;};
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
bool prime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
void init_fact(){
kaijo[0]=1;
for(int i=1;i<=2000000;i++){
kaijo[i]=kaijo[i-1]*i;
kaijo[i]%=MOD;
}
}
int modpow(int a,int b){
if(b==0)return 1;
if(b%2)return modpow(a,b-1)*a%MOD;
int memo=modpow(a,b/2);
return memo*memo%MOD;
}
int comb(int a,int b){
if(!kaijo[0])init_fact();
return kaijo[a]*modpow(kaijo[a-b],MOD-2)%MOD*modpow(kaijo[b],MOD-2)%MOD;
}
int inv(int x){
x=modpow(x,MOD-2);
return x;
}
bool kosa(double ax,double ay,double bx,double by,double cx,double cy,double dx,double dy){
double ta=(cx-dx)*(ay-cy)+(cy-dy)*(cx-ax);
double tb=(cx-dx)*(by-cy)+(cy-dy)*(cx-bx);
double tc=(ax-bx)*(cy-ay)+(ay-by)*(ax-cx);
double td=(ax-bx)*(dy-ay)+(ay-by)*(ax-dx);
return tc*td<0&&ta*tb<0;
}
double dist(double ax,double ay,double bx,double by){
return sqrt((bx-ax)*(bx-ax)+(ay-by)*(ay-by));
}
int k,d[100010];
deque<P>q;
signed main(){
cin>>k;
rep(i,k)d[i]=INF;
d[1]=1;
q.push_back({1,1});
while(!q.empty()){
P p=q.front();
q.pop_front();
if(d[p.se]<p.fi)continue;
if(d[(p.se+1)%k]>p.fi+1){
d[(p.se+1)%k]=p.fi+1;
q.push_back({p.fi+1,(p.se+1)%k});
}
if(d[(p.se*10)%k]>p.fi){
d[(p.se*10)%k]=p.fi;
q.push_front({p.fi,(p.se*10)%k});
}
}
cout<<d[0]<<endl;
return 0;
}
| 0
| 34,929,785
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
for (int i = 1; i < 1000000; ++i)
{
int p = a*i;
if(p%b == c){cout<< "YES"<<"\n"; return 0;}
}
cout<<"NO"<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct edge {
ll to;
ll cost;
};
struct UnionFind {
vector<int> UF;
vector<int> SIZE;
UnionFind(int N) : UF(N), SIZE(N, 1) {
for(int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) {
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(x));
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) {
return;
}
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
}
else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) {
return SIZE.at(root(x));
}
};
int ctoi(char c){
if (c == '0') return 0;
if (c == '1') return 1;
if (c == '2') return 2;
if (c == '3') return 3;
if (c == '4') return 4;
if (c == '5') return 5;
if (c == '6') return 6;
if (c == '7') return 7;
if (c == '8') return 8;
if (c == '9') return 9;
return -1;
}
char to_char(int i){
if (i == 0) return '0';
if (i == 1) return '1';
if (i == 2) return '2';
if (i == 3) return '3';
if (i == 4) return '4';
if (i == 5) return '5';
if (i == 6) return '6';
if (i == 7) return '7';
if (i == 8) return '8';
if (i == 9) return '9';
return ' ';
}
bool PN(int x) {
if (x <= 1) return false;
if (x == 2) return true;
for (int i = 2; i < sqrt(x) + 1; i++) {
if (x % i == 0) return false;
}
return true;
}
ll modpow(ll A, ll N, ll M) {
ll ans = 1;
while (N > 0) {
if (N & 1) ans = ans * A % M;
A = A * A % M;
N >>= 1;
}
return ans;
}
int S(ll X) {
int A = 0;
while (X > 0) {
X /= 10;
A++;
}
return A;
}
int main() {
cout << fixed << setprecision(16);
ll N;
cin >> N;
int ans = INF;
for (int i = 1; i < sqrt(N) + 1; i++) {
if (N % i == 0) {
ans = min(ans, max(S(i), S(N / i)));
}
}
cout << ans << endl;
}
| 0
| 69,287,988
|
#include<bits/stdc++.h>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=1e5+5;
#define ll long long
#define inf 0x3f3f3f3f
#define mem(x) memset(x,0,sizeof(x))
#define sca(x) scanf("%d",&x)
#define scall(x) scanf("%lld",&x)
#define eps 1e-6
int main()
{
int x,n;sca(x);sca(n);
int vis[105];
mem(vis);
for(int i=0;i<n;i++)
{
int y;sca(y);
vis[y]=1;
}
int flag=0,minn=inf;
for(int i=0;i<=101;i++)
{
if(vis[i]==0)
{
if(abs(i-x)<minn)
{
minn=abs(i-x);
flag=i;
}
}
}
cout<<flag<<endl;
}
|
#include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;
int main(){
string input, longest, many;
int len = 0, count = 0;;
map<string, int> wordCount;
while(cin >> input){
if(len < input.size()){
len = input.size();
longest = input;
}
wordCount[input]++;
if(count < wordCount[input]){
count = wordCount[input];
many = input;
}
}
cout << many << ' ' << longest << endl;
}
| 0
| 32,833,152
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int result;
result = 0;
if (
(n=="a")||
(n=="i")||
(n=="u")||
(n=="e")||
(n=="o")
)
{
cout << "vowel" << endl;
}
else
{
cout << "consonant" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void Main(){
int n, k;
cin >> n >> k;
VI ansv(n, 0);
REP(i, k) {
int d;
cin >> d;
REP(i, d) {
int j;
cin >> j;
ansv[j-1]++;
}
}
int ans = 0;
REP(i, n) {
if (ansv[i] == 0) {
ans++;
}
}
cout << ans << en;
return;
}
int main(void){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
int t=1;
REP(_,t) Main();
return 0;
}
| 0
| 90,586,603
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N;
cin>>N;
int is_reverse=0;
deque<int> deq;
rep(i,N)
{
int a;
cin>>a;
if(is_reverse)
{
deq.push_front(a);
}
else
{
deq.push_back(a);
}
(is_reverse+=1)%=2;
}
rep(i,N)
{
if(is_reverse) cout<<deq.back();
else cout<<deq.front();
if(i!=N) cout<<" ";
if(is_reverse) deq.pop_back();
else deq.pop_front();
}
cout<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
int main() {
ll N;
cin >>N;
vector<ll> a(N);
rep(i,N){
cin >> a[i];
}
ll now =1;
ll ans = 0;
rep(i,N){
if(a[i] == now){
now++;
}else{
ans++;
}
}
if(ans == N){
ans = -1;
}
cout << ans << endl;
return 0;
}
| 0
| 50,309,238
|
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <deque>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n; cin >> n;
long long p_total = 0;
long long zero = 0;
vector<long long> a(n + 1);
vector<long long> b(n + 1);
for(int i = 1; i < n + 1; i++) cin >> a[i] >> b[i];;
reverse(a.begin() + 1 , a.end());
reverse(b.begin() + 1 , b.end());
for(int i = 1; i < n + 1; i++){
p_total += max( zero, (b[i] - ((a[i] + p_total) % b[i])) % b[i]);
}
cout << p_total << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define MP make_pair
typedef long long ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
using namespace std;
int main() {
int n,m,p;
while(1){
cin>>n>>m>>p;
if(n==0&&m==0&&p==0)break;
m--;
vector<int> v(n,0);
int sum=0;
rep(i,0,n){
cin>>v[i];
sum+=v[i]*100;
}
sum-=(sum*p)/100;
cout<<((v[m]==0)?0:sum/v[m])<<endl;
}
return 0;
}
| 0
| 70,039,945
|
#include <iostream>
using namespace std;
int n, q, P[1000000], buff1, buff2, buff3;
int x[100000], y[100000];
bool com[100000];
int root(int x){
if(P[x]==x) return x;
P[x] = root(P[x]);
return P[x];
}
bool is_same_set(int x, int y){
return root(x) == root(y);
}
void unite(int x, int y){
P[root(x)] = root(y);
}
int main(){
cin >> n >> q;
for(int i = 0; i < q; ++i){
cin >> buff1 >> buff2 >> buff3;
com[i] = buff1; x[i] = buff2; y[i] = buff3;
}
for (int i = 0; i < n; ++i){
P[i] = i;
}
for(int i = 0; i < q; ++i){
if(com[i]){
cout << is_same_set(x[i], y[i]) << endl;
} else {
unite(x[i], y[i]);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define endl "\n"
#define fast_io ios::sync_with_stdio(false); cin.tie(0);
#define file_io freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(x) begin(x), end(x)
#define debug(x) cerr <<"Line "<< __LINE__ <<" : "<< #x " = "<< x <<endl;
template<typename T, typename TT>
ostream& operator<<(ostream &os, const pair<T, TT> &t) { return os<<"("<<t.first<<", "<<t.second<<")"; }
template<typename T>
ostream& operator<<(ostream& os, const vector<T> &t) { for(auto& i: t) os<<i<<" "; return os; }
int main(int argc, char** argv) {
fast_io
int a, b, c;
cin >> a >> b >> c;
cout << (a < b && b < c ? "Yes\n" : "No\n");
return 0;
}
| 0
| 49,877,588
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, pair<int, int> > p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if(A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) {
cout << "Possible" << endl;
} else {
cout << "Impossible" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(int n,int mn,int mx){
int t,st=0,maxx=0,ans=0;
vector<int> v;
cin >> st;
for(int i=0;i<n-1;i++){
cin >> t;
v.push_back(st-t);
st=t;
}
for(int i=mn-1;i<mx;i++){
if(maxx<v[i]){
maxx=v[i];
}
if(maxx<=v[i]){
ans=i+1;
}
}
cout<<ans<<endl;
}
int main(void){
int a,b,c;
while(cin>>a>>b>>c,a){
solve(a,b,c);
}
}
| 0
| 31,165,436
|
#include <iostream>
using namespace std;
int main() {
int d[7], g;
cin >> d[1] >> d[2] >> d[3] >> d[4] >> d[5] >> d[6] >> g;
for (int i = 0; i < g; i++) {
int x, y; cin >> x >> y;
if (x != d[1]) {
if (x == d[2]) {
int t = d[2];
d[2] = d[6];
d[6] = d[5];
d[5] = d[1];
d[1] = t;
} else if (x == d[3]) {
int t = d[3];
d[3] = d[6];
d[6] = d[4];
d[4] = d[1];
d[1] = t;
} else if (x == d[4]) {
int t = d[4];
d[4] = d[6];
d[6] = d[3];
d[3] = d[1];
d[1] = t;
} else if (x == d[5]) {
int t = d[5];
d[5] = d[6];
d[6] = d[2];
d[2] = d[1];
d[1] = t;
} else {
int t = d[6];
d[6] = d[1];
int u = d[2];
d[2] = d[5];
d[5] = u;
d[1] = t;
}
}
if (y != d[2]) {
if (y == d[3]) {
int t = d[3];
d[3] = d[5];
d[5] = d[4];
d[4] = d[2];
d[2] = t;
} else if (y == d[4]) {
int t = d[4];
d[4] = d[5];
d[5] = d[3];
d[3] = d[2];
d[2] = t;
} else {
int t = d[5];
int u = d[4];
d[5] = d[2];
d[2] = t;
d[4] = d[3];
d[3] = u;
}
}
cout << d[3] << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
bool isAC(const string &S) {
if (S[0] != 'A') return false;
int cnum = 0;
bool exist = false;
for (int i = 1; i < S.size(); ++i) {
if (i >= 2 && i + 1 < S.size() && S[i] == 'C') ++cnum;
if (S[i] >= 'A' && S[i] <= 'Z' && S[i] != 'C') exist = true;
}
if (cnum != 1) return false;
if (exist) return false;
return true;
}
int main() {
string S;
cin >> S;
if (isAC(S)) cout << "AC" << endl;
else cout << "WA" << endl;
}
| 0
| 58,053,640
|
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
void printArray(int* A, int n) {
for (int i = 0; i < n; ++i) {
if (i != 0) { cout << " "; }
cout << A[i];
}
cout << endl;
}
void countingSort(int* A, int* B, int n, int k) {
int* C = new int[k+1];
for (int i = 0; i <= k; ++i) {
C[i] = 0;
}
for (int i = 0; i < n; ++i) {
++C[A[i]];
}
for (int i = 1; i <= k; ++i) {
C[i] += C[i-1];
}
for (int i = n-1; i >= 0; --i) {
B[--C[A[i]]] = A[i];
}
delete[] C;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int* A = new int[n];
int* B = new int[n];
int k = 0;
for (int i = 0; i < n; ++i) {
cin >> A[i];
if (k < A[i]) {
k = A[i];
}
}
countingSort(A, B, n, k);
printArray(B, n);
return 0;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 350000;
const int K = 19;
int n, q;
int mod = 1e9 + 7;
int s1[N], s2[N], a[N], ans[N], f[N], invf[N];
string t[N], d[N], s;
int binpow(int x, int y){
if (y == 0) return 1;
if (y % 2) return x * binpow(x, y - 1) % mod;
int z = binpow(x, y / 2);
return z * z % mod;
}
int c(int n, int k){
if (k < 0) return 0;
return f[n] * invf[k] % mod * invf[n - k] % mod;
}
int check (int x){
for (int i = 1; i <= q; i++){
if (s[x - 1] == t[i][0]){
if (d[i] == "L"){
if (x == 1) return -1;
x--;
} else{
if (x == n) return 1;
x++;
}
}
}
return 0;
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
for (int i = 1; i <= 3; i++){
int x, y;
cin >> x >> y;
a[x]++;
a[y]++;
}
int x, y;
x = y = 0;
for (int i = 1; i <= 4; i++) if (a[i] == 1) x++; else if (a[i] == 2) y++;
if (x == 2 && y == 2) cout << "YES"; else cout << "NO";
}
| 0
| 71,168,800
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
char grid[2020][2020];
vector<int> bh[2020],bw[2020];
bool isOK(int index, int i, vector<int> &vec){
if(vec[index]<i) return 1;
else return 0;
}
int nibutan(int i, vector<int> &vec){
int left = 0, right = vec.size()-1;
while(right-left>1){
int middle=(left+right)/2;
if(isOK(middle,i,vec)) left = middle;
else right = middle;
}
return vec[right]-vec[left]-1;
}
int main(){
int h,w;
cin>>h>>w;
rep(i,h)rep(j,w) cin>>grid[i][j];
rep(i,h){
bh[i].push_back(-1);
rep(j,w){
if(grid[i][j]=='#') bh[i].push_back(j);
}
bh[i].push_back(w);
}
rep(j,w){
bw[j].push_back(-1);
rep(i,h){
if(grid[i][j]=='#') bw[j].push_back(i);
}
bw[j].push_back(h);
}
int ans=0;
rep(hi,h)rep(wi,w){
if(grid[hi][wi]=='#') continue;
int H = nibutan(wi,bh[hi]), W = nibutan(hi,bw[wi]);
ans=max(ans,H+W-1);
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstdio>
#include <bitset>
#define M 8005
using namespace std;
int x, y, z, c;
string s;
bitset<M * 2> bs[2];
int main() {
int i;
cin >> s >> x >> y;
for (i = 0; s[i] == 'F'; i++);
bs[0][i + M] = bs[1][M] = 1;
for (; i <= s.size(); i++) {
if (s[i] == 'F') c++;
else bs[z] = (bs[z] << c) | (bs[z] >> c), z = !z, c = 0;
}
cout << (bs[0][x + M] & bs[1][y + M] ? "Yes" : "No");
return 0;
}
| 0
| 44,094,695
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int heights[10];
for(int i = 0; i <= 9 ; i++){
cin >> heights[i];
}
sort(heights , heights + 10);
cout << heights[9] << endl << heights[8] << endl << heights[7] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int ans;
if (h2 < h1 || (h1 == h2 && m2 < m1)) {
h2 += 24;
}
ans = max(0, 60*h2+m2 - (60*h1+m1) - k);
cout << ans << endl;
}
| 0
| 54,537,359
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr,0,sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1;
while(tc--){
int a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int n;
cin >> n;
cout << a[n - 1] << '\n';
}
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod=1e9+7;
int main(){
int n;
cin >> n;
vector<ll> a(n);
vector<ll> pl,mi;
rep(i,n){
cin >> a[i];
if(a[i]>=0){
pl.emplace_back(a[i]);
} else {
mi.emplace_back(a[i]);
}
}
sort(pl.rbegin(),pl.rend());
sort(mi.begin(),mi.end());
if(mi.empty()){
mi.emplace_back(pl.back());
pl.pop_back();
}
if(pl.empty()){
pl.emplace_back(mi.back());
mi.pop_back();
}
vector<pair<ll,ll>> act;
ll ans = mi[0];
int plsz = pl.size();
rep(i,plsz-1){
act.emplace_back(ans,pl[i]);
ans -= pl[i];
}
act.emplace_back(pl[plsz-1],ans);
ans = pl[plsz-1]-ans;
int misz = mi.size();
REP(i,1,misz){
act.emplace_back(ans,mi[i]);
ans -= mi[i];
}
cout << ans << endl;
for(auto it:act){
cout << it.F << " " << it.S << endl;
}
return 0;
}
| 0
| 35,608,294
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<int> x(n), y(m);
rep(i, 0, n) cin >> x[i];
rep(i, 0, m) cin >> y[i];
int x_max = *max_element(x.begin(), x.end());
int y_min = *min_element(y.begin(), y.end());
if (X < y_min && y_min <= Y && x_max < y_min)
cout << "No War" << endl;
else
cout << "War" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
int main(){
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> c;
int now=1;
int cnt=0;
rep(i,n){
if(s[i] == (char)(now + '0')) cnt++;
else{
c.push_back(cnt);
now=1-now;
cnt = 1;
}
}
c.push_back(cnt);
if(c.size()%2==0) c.push_back(0);
int m=c.size();
vector<int> S(m+1);
rep(i,m) S[i+1] = S[i] + c[i];
int ans=0;
for(int i=0; i<m; i+=2){
int left=i;
int right=min(i+2*k+1,m);
chmax(ans,S[right]-S[left]);
}
cout << ans << endl;
}
| 0
| 96,252,492
|
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int p,q,r;
cin>>p>>q>>r;
cout<<min(min(p+q,p+r),q+r)<<endl;
}
|
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = LLONG_MAX/4;
const ll MOD = 1e9+7;
const int n_max = 1e5+10;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;cin >> s;
ll n = s.size();
Pll res;
bool ok = false;
rep(i,n-1){
if(s[i] == s[i+1]){
res = Pll(i+1,i+2);
ok = true;
break;
}
}
rep(i,n-2){
if(s[i] == s[i+2]){
res = Pll(i+1,i+3);
ok = true;
break;
}
}
auto print = [&](Pll x){
cout << x.first << " " << x.second << endl;
};
ok ? print(res) : print(Pll(-1,-1));
}
| 0
| 3,382,858
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
ll n,m;
cin>>n>>m;
ll gcd=__gcd(n,m);
ll lcm=(n*m)/gcd;
cout<<lcm<<"\n";
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;
const int Max=10000000;
bool prime[Max];
int main(void){
int in;
for(int i=0;i<Max;i++)prime[i]=true;
prime[1]=false;
for(int i=2;i<Max;i++){
if(prime[i]){
for(int s=i*2;s<=Max;s+=i)prime[s]=false;
}
}
while(cin>>in){
int cnt=0;
for(int i=1;i<=in;i++){
if(prime[i])cnt++;
}
cout << cnt << "\n";
}
return 0;
}
| 0
| 47,992,761
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, H, W;
cin >> N >> H >> W;
ll ans = 0;
rep(i, N) {
ll A, B;
cin >> A >> B;
if(H <= A && W <= B) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define read freopen("input.txt", "r", stdin);
#define write freopen("output.txt", "w", stdout);
#define endd '\n'
#define ll long long
#define sq(a) ((a) * (a))
using namespace std;
int main()
{
faster;
double pi = 2 * acos(0.0);
ll int n,i,t,j,k,m=0,a=0,b=0,c=0,d=0,p=0,q,r,x=250,y=10,z,count=0;
cin>>n>>a>>b;
if(a==b)cout<<"1"<<endl;
else if(b<a || n==1)cout<<"0"<<endl;
else{
p=(b-a)*(n-2);
cout<<p+1<<endl;
}
return 0;
}
| 0
| 16,875,379
|
#include <iostream>
#include <vector>
using namespace std;
int A, B, C;
int X;
int myrand() {
int res = X;
X = (A*X + B) % C;
return res;
}
bool solve() {
int N;
cin >> N >> A >> B >> C >> X;
if(!N && !A && !B && !C && !X) return false;
vector<int> ys(N);
for(int i = 0; i < N; ++i) {
cin >> ys[i];
}
int turn = 0;
int pos = 0;
for(; turn <= 10000; ++turn) {
int rv = myrand();
if(rv == ys[pos]) {
++pos;
if(pos == N) break;
}
}
cout << (turn > 10000 ? -1 : turn) << endl;
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
for(int case_num = 1; solve(); ++case_num) ;
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int s[10001];
int finds(int n)
{
if(s[n]==n)
return n;
else return s[n]=finds(s[n]);
}
int unionh(int a,int b)
{
a=finds(a); b=finds(b);
s[a]=b;
}
int main()
{
for(int i=0; i<=10000; i++) s[i]=i;
int n,q,op,x,y;
scanf("%d%d",&n,&q);
for(int i=0;i<q;i++)
{
scanf("%d%d%d",&op,&x,&y);
if(op==0) unionh(x,y);
else{
if(finds(x)==finds(y)) printf("1\n");
else printf("0\n");
}
}
}
| 0
| 871,090
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef long long ll;
typedef long double ld;
int main(){
ll n,m,a,b;
cin>>n>>m;
vector<pair<ll,ll>> v(n);
REP(i,n){
cin>>a>>b;
v[i]=make_pair(a,b);
}
sort(ALL(v));
ll bottles=0, cost=0, i=0;
while(bottles<m){
bottles+=v[i].second;
cost+=v[i].first*v[i].second;
if(bottles>=m){
break;
}
i++;
}
while(bottles>m){
bottles--;
cost-=v[i].first;
}
cout<<cost;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t>a(n);
vector<int64_t>b(n);
for(int i=0;i<n;i++)
cin >> a.at(i);
for(int i=0;i<n;i++)
cin >> b.at(i);
vector<int64_t>h(n);
for(int i=0;i<n;i++)
h.at(i)=b.at(i)-a.at(i);
sort(h.begin(),h.end(),greater());
int64_t ans=0,m=0;
for(int i=0;i<n;i++){
if(h.at(i)>0){
m+=h.at(i);
ans++;
}else{
break;
}
}
for(int i=h.size()-1;i>=0;i--){
if(m<=0)
break;
m+=h.at(i);
ans++;
}
if(m>0)
cout << -1 << endl;
else
cout << ans << endl;
return 0;
}
| 0
| 11,424,801
|
#include <bits/stdc++.h>
#define MOD
#define MAXN
#define MAXM
#define LL long long
#define ll long long
#define mem(a) memset(a,0,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a))
using namespace std;
inline int read(){
int x=0,f=1;
char ch=getchar();
while (ch<'0'||ch>'9'){
if (ch=='-') f=-1;
ch=getchar();
}
while (ch>='0'&&ch<='9'){
x=(x*10)+(ch-'0');
ch=getchar();
}
return x*f;
}
const string S="RYGB";
int main(){
int h=read(),w=read(),d=read();
for (register int i=1;i<=h;++i){
for (register int j=1;j<=w;++j){
int x=i+j+w,y=i-j+w;
int p=((int)(x/d)+2)%2,q=((int)(y/d)+2)%2;
putchar(S[(p<<1)+q]);
}
putchar('\n');
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pmin priority_queue < ll, vector<ll>, greater<ll> >
#define pmax priority_queue <ll>
#define endl '\n'
#define mii map<ll , ll >
#define pii pair< ll, ll >
#define vi vector<ll>
#define all(a) (a).begin(), (a).end()
#define DEBUG cerr<<"/n>>>I'm Here<<</n"<<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 bs binary_search
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define p1(i) cout<<i<<endl;
#define p2(i,j) cout<<i<<" "<<j<<endl;
#define line cout<<endl;
#define prt(s,b,n) rep(i,(b),(n)) { cout<<(s)[i]<<" ";} line
#define lower(u) transform(u.begin(), u.end(), u.begin(), ::tolower);
#define upper(u) transform(u.begin(), u.end(), u.begin(), ::toupper);
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define hell 1e6+3
#define mod 998244353
using namespace std;
void solve()
{
ll n,k;
cin>>n>>k;
vi a(n); rep(i,0,n){ cin>>a[i];}
ll d[n+1];
rep(i,0,n+1) d[i]=INT_MAX;
d[0]=0;
d[1]=0;
d[2]=abs(a[0]-a[1]);
rep(i,3,n+1)
{ rep(j,1,k+1)
{
if((i-1-j)>=0)
d[i]=min( d[i], d[i-j]+ abs(a[i-1]-a[i-1-j]) );
}
}
cout<<d[n]<<endl;
return;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt" , "r", stdin);
freopen("out12.txt" , "w", stdout);
#endif
ll TESTS = 1;
while (TESTS--)
{
solve();
}
return 0;
}
| 0
| 84,317,490
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.