code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int main() {
string O, E;
cin >> O >> E;
int N = O.size();
if (N == E.size()) {
for (int i = 0; i < N; i++) {
cout << O[i] << E[i];
}
cout << endl;
}
else {
for (int i = 0; i < N - 1; i++) {
cout << O[i] << E[i];
}
cout << O[N - 1] << endl;
}
}
|
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define ull unsigned long long
#define ld long double
#define mod 1000000007
#define EULER 2.7182818284
#define INF 1000000000
#define pb push_back
#define ins insert
#define IT iterator
#define PQ priority_queue
#define nl "\n"
#define fi first
#define se second
#define maxe max_element
#define mine min_element
#define er erase
#define lb lower_bound
#define ub upper_bound
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define pi pair<int,int>
#define pll pair<ll,ll>
#define all(v) v.begin(),v.end()
#define mpi map<int,int>
#define mpl map<ll,ll>
#define umpi unordered_map<int,int>
#define umpl unordered_map<ll,ll>
#define si set<int>
#define sl set<ll>
#define msi multi_set<int>
#define msl multi_set<ll>
#define mem(v,i) memset(v,i,sizeof(v))
#define repab(i,a,b) for(int i=(a);i<=(b);i++)
#define reprab(i,a,b) for(int i=(a);i>=(b);i--)
#define repll(i,a,b) for(ll i=(a);i<=(b);i++)
#define rep(i,n) for(int i=(0);i<(n);i++)
#define repr(i,n) for(int i=(n);i>=0;i--)
#define bs bitset
#define bpc(a) __builtin_popcount(a)
#define tc int t;cin>>t;while(t--)
template<typename T> void TIME(T start, T end)
{
#ifndef ONLINE_JUDGE
double time_taken = chrono::duration_cast<chrono::nanoseconds>(end - start).count();
time_taken *= 1e-9;
cout << "\nExecuted in: " << fixed
<< time_taken << setprecision(9);
cout << " sec";
#endif
}
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
ll max(ll a,ll b)
{
if(a>b)return a;return b;
}
ll min(ll a,ll b)
{
if(a<b)return a;return b;
}
ll mypow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll gcd(ll a,ll b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int main()
{
auto start = chrono::high_resolution_clock::now();
fast
string s;
cin>>s;
int i,n=s.length(),cnt0=0,cnt1=0;
for(i=0;i<n;i++){
if(s[i]=='0')
cnt0++;
else
cnt1++;
}
cout<<2*min(cnt1,cnt0);
auto end = chrono::high_resolution_clock::now();
TIME(start, end);
return 0;
}
| 0
| 100,530,821
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> L(86+1);
L[0] = 2;
L[1] = 1;
for (int i=2; i<86+1; i++) L[i] = L[i-1] + L[i-2];
cout << L[n] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
string s, t;
cin >> N >> s >> t;
int ans = 2*N;
rep(i,N) {
if (s.substr(i,N-i) == t.substr(0,N-i) ){ ans = N+i; break;}
}
cout << ans << endl;
return 0;
}
| 0
| 71,372,129
|
#include <bits/stdc++.h>
using namespace std;
int n, m, ct, val[40];
bool s;
char ans[40000];
long long get_dis(pair <int, int> x, pair <int, int> y)
{
return (long long) abs(x.first - y.first) + abs(x.second - y.second);
}
int main()
{
m = 32;
val[1] = 1;
for (int i = 2; i <= m; i++)
val[i] = 1 << (i - 2);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
pair <int, int> now, goal, to;
scanf("%d%d", &goal.first, &goal.second);
if (i == 1) s = (goal.first + goal.second) & 1;
else if (s != ((goal.first + goal.second) & 1))
{
puts("-1");
return 0;
}
for (int j = m; j >= (s ? 2 : 1); j--)
{
char ch;
long long mini = 0x3f3f3f3f3f3f3f3fLL, tmp;
if (mini > (tmp = get_dis(goal, make_pair(now.first, now.second + val[j])))) ch = 'U', mini = tmp, to = make_pair(now.first, now.second + val[j]);
if (mini > (tmp = get_dis(goal, make_pair(now.first, now.second - val[j])))) ch = 'D', mini = tmp, to = make_pair(now.first, now.second - val[j]);
if (mini > (tmp = get_dis(goal, make_pair(now.first + val[j], now.second)))) ch = 'R', mini = tmp, to = make_pair(now.first + val[j], now.second);
if (mini > (tmp = get_dis(goal, make_pair(now.first - val[j], now.second)))) ch = 'L', mini = tmp, to = make_pair(now.first - val[j], now.second);
now = to;
ans[++ct] = ch;
}
ans[++ct] = '\n';
}
printf("%d\n", m - s);
for (int i = m; i >= (s ? 2 : 1); i--)
printf("%d ", val[i]);
puts("");
for (int i = 1; i <= ct; i++)
putchar(ans[i]);
return 0;
}
|
#include<stdio.h>
int main(void)
{
long long int s;
int n,i;
scanf("%d",&n);
s=1;
for(i=2;i<=n;i++){
s=s*i;
}
printf("%lld\n",s);
return 0;
}
| 0
| 61,569,991
|
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
}
|
#include <stdio.h>
long long n, k, s, x, z, y, m, b, l;
long long p[5000];
long long c[5000];
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", p + i);
p[i]--;
}
for (int i = 0; i < n; i++) {
scanf("%lld", c + i);
}
m = -1000000000;
for (int i = 0; i < n; i++) {
s = i;
x = 0;
b = 0;
while (p[s] != i) {
s = p[s];
x += c[s];
b++;
}
x += c[i];
b++;
if (k > b) {
l = b + k % b;
y = 0;
if (k > l) {
if (x > 0)y += (k - l) / b * x;
}
s = i;
for (int j = 0; j < l; j++) {
s = p[s];
y += c[s];
if (y > m)m = y;
}
}
else {
s = i;
y = 0;
for (int j = 0; j < k; j++) {
s = p[s];
y += c[s];
if (y > m)m = y;
}
}
}
printf("%lld\n", m);
}
| 0
| 87,308,079
|
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(long long i=(a),i##Len_=(b);i<i##Len_;i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int main()
{
ll N;
cin >> N;
ll a[N];
ll x = 0;
ll tmp = 0;
ll iMin = INF;
REP(i,N)
{
cin >> a[i];
tmp += a[i];
}
REP(i,N-1)
{
x += a[i];
iMin = min(iMin,abs(tmp -2*x));
}
cout << iMin << endl;
}
|
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
void b(int a,int count){
if(a == 1){
if(count%5==1) cout <<".";
else if(count%5==2) cout <<",";
else if(count%5==3) cout <<"!";
else if(count%5==4) cout <<"?";
else if(count%5==0) cout <<" ";
}
else if(a == 2){
if(count%3==1) cout <<"a";
else if(count%3==2) cout <<"b";
else if(count%3==0) cout <<"c";
}
else if(a == 3){
if(count%3==1) cout <<"d";
else if(count%3==2) cout <<"e";
else if(count%3==0) cout <<"f";
}
else if(a == 4){
if(count%3==1) cout <<"g";
else if(count%3==2) cout <<"h";
else if(count%3==0) cout <<"i";
}
else if(a == 5){
if(count%3==1) cout <<"j";
else if(count%3==2) cout <<"k";
else if(count%3==0) cout <<"l";
}
else if(a == 6){
if(count%3==1) cout <<"m";
else if(count%3==2) cout <<"n";
else if(count%3==0) cout <<"o";
}
else if(a == 7){
if(count%4==1) cout <<"p";
else if(count%4==2) cout <<"q";
else if(count%4==3) cout <<"r";
else if(count%4==0) cout <<"s";
}
else if(a == 8){
if(count%3==1) cout <<"t";
else if(count%3==2) cout <<"u";
else if(count%3==0) cout <<"v";
}
else if(a == 9){
if(count%4==1) cout <<"w";
else if(count%4==2) cout <<"x";
else if(count%4==3) cout <<"y";
else if(count%4==0) cout <<"z";
}
return;
}
int main(){
int n;
cin >> n;
rep(i,0,n){
string s;
cin >> s;
char pre[] = "0\0";
pre[0]=s[0];
int count = 0;
rep(i,0,s.size()){
if(pre[0] == s[i]){
count++;
}
else{
int bo = atoi(pre);
b(bo,count);
count=1;
pre[0]=s[i];
}
}
cout << endl;
}
return 0;
}
| 0
| 17,688,562
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
const int MAX_N = 1000;
int dp[MAX_N + 1][MAX_N + 1];
int main() {
int qn;
cin >> qn;
while (qn--) {
string x, y;
cin >> x >> y;
int xn = x.size(), yn = y.size();
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= xn; i++)
for (int j = 0; j <= yn; j++) {
if (i < xn && j < yn && x[i] == y[j] &&
dp[i + 1][j + 1] < dp[i][j] + 1)
dp[i + 1][j + 1] = dp[i][j] + 1;
if (i < xn && dp[i + 1][j] < dp[i][j])
dp[i + 1][j] = dp[i][j];
if (j < yn && dp[i][j + 1] < dp[i][j])
dp[i][j + 1] = dp[i][j];
}
printf("%d\n", dp[xn][yn]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin>>h>>w;
char a[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
}
}
int l[h][w],r[h][w],u[h][w],d[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(a[i][j]=='#') l[i][j]=0;
else if(j==0) l[i][j]=1;
else l[i][j]=l[i][j-1]+1;
}
}
for(int i=0;i<h;i++){
for(int j=w-1;j>=0;j--){
if(a[i][j]=='#') r[i][j]=0;
else if(j==w-1) r[i][j]=1;
else r[i][j]=r[i][j+1]+1;
}
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(a[i][j]=='#') d[i][j]=0;
else if(i==0) d[i][j]=1;
else d[i][j]=d[i-1][j]+1;
}
}
for(int i=h-1;i>=0;i--){
for(int j=0;j<w;j++){
if(a[i][j]=='#') u[i][j]=0;
else if(i==h-1) u[i][j]=1;
else u[i][j]=u[i+1][j]+1;
}
}
int ans=0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
ans=max(ans,l[i][j]+r[i][j]+u[i][j]+d[i][j]-3);
}
}
cout<<ans<<endl;
}
| 0
| 53,329,579
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - (A - B)) << '\n';
return 0;
}
|
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout<<(x)<<"\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll,vector<ll>,greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
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 dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
int main(){
ll n,k;
cin>>n>>k;
vll p(n),c(n);
rep(i,n){
cin>>p[i];
p[i]--;
}
rep(i,n) cin>>c[i];
ll ans=-INF;
rep(i,n){
vll syc(0);
ll cu=0;
ll now=i;
while(1){
now=p[now];
syc.pb(c[now]);
cu+=c[now];
if(i==now) break;
}
vll sycc(sz(syc)+1);
sycc[0]=0;
rep(j,sz(syc)){
sycc[j+1]=syc[j]+sycc[j];
}
ll ccu=-INF;
for(int j=1;j<=sz(syc);j++){
if(k<j) continue;
if(k-j>=sz(syc)){
if(cu>0){
chmax(ccu,sycc[j]+(k-j)/sz(syc)*cu);
}
else chmax(ccu,sycc[j]);
}
else{
chmax(ccu,sycc[j]);
}
}
chmax(ans,ccu);
}
COUT(ans);
}
| 0
| 38,997,931
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
int main(){
int n,m,k;
while(cin>>n>>m>>k,n){
vi a(n);
rep(i,n)cin>>a[i];
sort(all(a),[](int a,int b){return a>b;});
int out=0;
int outa=0;
loop(i,m,k+1){
int t=a[i-1]-a[i];
if(out<=t){
out=t;
outa=i;
}
}
cout<<outa<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;
#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))
int F()
{
char ch;
int x, a;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-');
if (ch == '-') ch = getchar(), a = -1;
else a = 1;
x = ch - '0';
while (ch = getchar(), ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + ch - '0';
return a * x;
}
const int N = 1e5 + 10;
int n, deg[N];
int64 A[N];
VI edge[N];
void dfs(int u, int fa)
{
if (deg[u] <= 1) return;
int64 x = 0, cnt = 0, la = 0;
for (auto v : edge[u])
{
if (v == fa) continue;
dfs(v, u);
x += A[v];
la = max(la, A[v]);
}
cnt = min(x >> 1, x - la);
if (x >= A[u] && x <= A[u] + cnt)
{
int64 c = x - A[u];
A[u] -= c;
}
else
{
puts("NO");
exit(0);
}
}
int main()
{
gi(n);
for (int i = 1; i <= n; ++i) gi(A[i]);
for (int i = 1; i < n; ++i)
{
int a, b;
gii(a, b);
edge[a].pb(b);
edge[b].pb(a);
++deg[a], ++deg[b];
}
if (n == 2)
{
puts(A[1] == A[2] ? "YES" : "NO");
return 0;
}
int root = 1;
for (; deg[root] == 1; ++root);
dfs(root, 0);
if (!A[root]) puts("YES");
else puts("NO");
}
| 0
| 48,020,614
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#define MAX_N 100
#define MIL_DAYS 196470
int main()
{
int i, N;
int y, m, d;
int days = 0;
scanf("%d", &N);
for (i = 0; i < N; i++)
{
scanf("%d %d %d", &y, &m, &d);
if(y % 3 == 0){
days += (d-1);
days += 20*(m-1);
}else{
days += (d-1);
days += (19+20)*((m-1)/2)+((m-1)%2)*20;
}
days += ((y-1)/3)*10*20+((y-1)-(y-1)/3)*5*(20+19);
printf("%d\n", MIL_DAYS-days);
days = 0;
}
return 0;
}
|
#include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define fr first
#define sc second
#define mp make_pair
typedef long long int64;
typedef pair< int, int > iP;
typedef pair< iP, int > iiP;
const int INF = 2 << 28;
const double EPS = 1e-10;
int main() {
string s;
while(getline(cin, s), s != ".") {
stack< char > cir;
bool judge = true;
for(int i = 0; i < s.size(); i++) {
if(s[i] == '(' || s[i] == '[') cir.push(s[i]);
else if(s[i] == ')' || s[i] == ']') {
if(cir.empty()) judge = false;
else {
if(s[i] == ')' && cir.top() != '(') judge = false;
if(s[i] == ']' && cir.top() != '[') judge = false;
cir.pop();
}
}
}
cout << (judge && cir.empty() ? "yes" : "no") << endl;
}
}
| 0
| 9,790,285
|
#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); }
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<string> v(h);
rep(i, 0, h) cin >> v[i];
vector<vector<int>> dp(h, vector<int>(w, 1e9));
if (v[0][0] == '#')
dp[0][0] = 1;
else
dp[0][0] = 0;
rep(i, 0, h) {
rep(j, 0, w) {
rep(k, 0, 2) {
int ni = i + dx[k], nj = j + dy[k];
if (ni >= h || nj >= w)
continue;
int add = 0;
if (v[ni][nj] == '#' && v[i][j] == '.')
add = 1;
chmin(dp[ni][nj], dp[i][j] + add);
}
}
}
cout << dp[h - 1][w - 1] << endl;
}
|
#include <iostream>
using namespace std;
int main (void) {
int m, f, r;
while (true) {
cin >> m >> f >> r;
int x = m+f;
char ans;
if (m+f+r==-3) {
break;
} else if(m==-1 || f==-1) {
ans = 'F';
} else if (x>=80) {
ans = 'A';
} else if (x>=65) {
ans = 'B';
} else if (x>=50) {
ans = 'C';
} else if (x>=30) {
if (r>=50) {
ans = 'C';
} else {
ans = 'D';
}
} else {
ans = 'F';
}
cout << ans << endl;
}
}
| 0
| 56,167,892
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
map<int,int> m;
rep(i,n){
int a;
cin >> a;
m[a]++;
}
for(auto p : m){
if(p.second > 1){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include<stdio.h>
int selectionSort(int A[], int N) {
int minj, i, j, v;
int count = 0;
for (i=0; i<N; i++) {
minj = i;
for (j=i+1; j<N; j++) {
if (A[minj]>A[j]) minj = j;
}
if (minj != i) {
v = A[i];
A[i] = A[minj];
A[minj] = v;
count++;
}
}
return count;
}
int main() {
int i, A[100], N;
scanf("%d", &N);
for (i=0; i<N; i++) scanf("%d", &A[i]);
int count = selectionSort(A, N);
for (i=0; i<N; i++) {
if (i>0) printf(" ");
printf("%d", A[i]);
}
printf("\n");
printf("%d", count);
printf("\n");
}
| 0
| 65,911,786
|
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
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; }
#define DEBUG_VLL(vec) REP(sz, vec.size()) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
int n, k;
vll a;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; i++) cin >> a[i];
ll ans = HIGHINF;
for (int state = 0; state < (1 << n); state++) {
if (__builtin_popcount(state) < k) continue;
ll tmpa = 0;
ll maxa = 0;
for (int i = 0; i < n; i++) {
if ((state >> i) & 1) {
if (maxa >= a[i]) {
tmpa += maxa + 1 - a[i];
maxa++;
}
}
chmax(maxa, a[i]);
}
chmin(ans, tmpa);
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n;
cin >> n;
vi h(n);
rep(i, n) cin >> h[i];
int ans = 0, cnt = 0;
rep(i, n-1) {
if (h[i]>=h[i+1]) ++cnt;
else {
ans = max(ans, cnt);
cnt = 0;
}
}
if (cnt > 0) ans = max(ans, cnt);
cout << ans << endl;
return 0;
}
| 0
| 59,904,301
|
#include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<iostream>
using namespace std;
long long int lcm(long long int a,long long int b){
long long int n;
n=a*b/__gcd(a,b);
return n;
}
using ll =long long int;
#define ci(a) cin>>a
#define co(a) cout<<a<<endl
#define gcd(a,b) __gcd(a,b)
#define vec vector<ll>
#define For(i,a,b) for(ll i=a;i<b;i++)
#define rFor(i,a,b) for(ll i=a;i>b;i--)
#define wFor(i,a,b) for(ll i=a;i<b;i+=2)
#define wrFor(i,a,b) for(ll i=a;i>b;i-=2)
#define sort(a,b) sort(a.begin(),b.end())
#define reverse(a,b) reverse(a.begin(),b.end())
int main() {
ll a;
ci(a);
co(a*a);
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
vector <long long> a(n);
for(auto&i : a)
scanf("%d",&i);
sort(a.begin() ,a.end());
for(int i=1; i<n; i++)
a[i] += a[i-1];
for(int i=n-2; ~i; i--)
if(2*a[i] < a[i+1]-a[i]){
cout << n-i-1 << endl;
return 0;
}
cout << n << endl;
}
| 0
| 94,765,233
|
#include<bits/stdc++.h>
using namespace std;
#define siii(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sl(a) scanf("%lld",&a);
#define sll(a,b) scanf("%lld%lld",&a,&b);
#define slll(a,b,c) scanf("%lld%lld%lld",&a,&b,&c);
#define sd(a) scanf("%lf",&a);
#define sdd(a,b) scanf("%lf%lf",&a,&b);
#define pb(a) push_back(a)
#define deb(a) printf("### %d ###\n",a)
#define mp make_pair
#define pf printf
#define fl(a, b, c) for(int a= b ;a<c;a++)
#define mx 100000
#define fread freopen("input.txt","r",stdin)
#define CLR(a,b) memset(a,b,szof(a))
#define ll long long
#define D(x) cout<<#x" = "<<x<<endl;
#define sz 10000
#define bl printf("\n")
#define spc printf(" ")
int main()
{
string ans ="";
string s;
cin>>s;
int w;
si(w);
int n = w;
int ln = s.length();
fl(i,0,ln){
if(n == w){
ans+=s[i];
}
n--;
if(!n){
n = w;
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> c(101);
for (int i = 0; i <= 100; i++)
c[i] = i;
for (ll i = 2; i * i <= 100; i++) {
if (c[i] != i)
continue;
for (ll j = i; j * i <= 100; j++) {
c[j*i] = i;
}
}
map<ll, ll> mp;
for (int i = 1; i <= n; i++) {
ll x = i;
while (x != 1) {
mp[c[x]]++;
x /= c[x];
}
}
vector<ll> cnt(76, 0);
for (auto p: mp) {
ll tmp = p.second;
if (2 <= tmp)
cnt[2]++;
if (4 <= tmp)
cnt[4]++;
if (14 <= tmp)
cnt[14]++;
if (24 <= tmp)
cnt[24]++;
if (74 <= tmp)
cnt[74]++;
}
ll ans = 0;
ans += (cnt[2]-cnt[4]) * cnt[4] * (cnt[4]-1) / 2;
ans += cnt[4] * (cnt[4]-1) * (cnt[4]-2) / 2;
ans += cnt[14] * (cnt[14]-1);
ans += cnt[14] * (cnt[4] - cnt[14]);
ans += cnt[24] * (cnt[24] - 1) ;
ans += cnt[24] * (cnt[2] - cnt[24]);
ans += cnt[74];
cout << ans << endl;
return 0;
}
| 0
| 28,006,369
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans=0;
if(k <= a){
ans = k;
} else {
k -= a;
ans += a;
if(k > b){
k -= b;
ans -= k;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N; cin >> N;
ll ans = 0;
rep1(i, N) ans += i;
cout << ans << endl;
}
int main(void)
{
solve();
}
| 0
| 13,227,164
|
#include<iostream>
using namespace std;
int main(){
int a,b,c,i,x,n;
cin >>a>>b>>c;
for(i=a; i<=b; i++){
x=c%i;
if (x==0) n++;
}
cout << n<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<long long> a(N), b(N), c(M), d(M), checkpoint(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a.at(i) >> b.at(i);
}
for (int i = 0; i < M; ++i) {
cin >> c.at(i) >> d.at(i);
}
for (int i = 0; i < N; ++i) {
long long min_place = 1000000000;
for (int j = 0; j < M; ++j) {
long long place = abs(a.at(i) - c.at(j)) + abs(b.at(i) - d.at(j));
if (min_place > place) {
checkpoint.at(i) = j + 1;
min_place = place;
}
}
}
for (int i = 0; i < N; ++i) {
cout << checkpoint.at(i) << endl;
}
return 0;
}
| 0
| 26,425,576
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
string S;
cin >> S;
long long answer = 0;
int countW = 0;
for(auto it = S.rbegin() ; it != S.rend() ; ++it){
if(*it == 'W'){
++countW;
} else{
answer += countW;
}
}
cout << answer << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
for(int i=N;i<1000;i++){
if(i/100==i%100/10&&i%100/10==i%100%10){
cout << i << endl;
break;
}
}
}
| 0
| 84,974,602
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int n;
cin >> n;
vector<ll>a(n);
ll sum=0;
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n-1;++i) {
if(a[i]>a[i+1]){
sum+=a[i]-a[i+1];
a[i+1]=a[i];
}
}
cout << sum << endl;
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 <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int x; std::cin >> x;
for (int i = 1; i <= 1000; i++) {
if (i * 100 <= x && x <= i * 100 + i * 5) {
std::cout << 1 << std::endl;
return 0;
}
}
std::cout << 0 << std::endl;
return 0;
}
| 0
| 36,622,026
|
#include <iostream>
#include <unordered_map>
using namespace std;
int is_prime_f(int n) {
int i;
if(n < 2)
return -1;
else if(n == 2)
return 1;
if(n % 2 == 0)
return -1;
for(i = 3; i <= n / i; i += 2)
if(n % i == 0)
return -1;
return 1;
}
unordered_map<int, int> map;
bool is_prime_map(int n) {
int is_prime = map[n];
if (is_prime == 0) {
is_prime = is_prime_f(n);
map[n] = is_prime;
}
return is_prime == 1;
}
int prime_num_count(int max) {
int count = 0;
for (int i = 1; i <= max; ++i) {
if (is_prime_map(i)) {
count++;
}
}
return count;
}
int main() {
string str;
while(getline(cin, str)) {
cout << prime_num_count(stoi(str.c_str())) << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
#include<string>
int main()
{
string a;
getline(cin, a);
for (unsigned i = 0; i < a.length(); i++) {
if (islower(a[i]))
a[i] = toupper(a[i]);
else
a[i] = tolower(a[i]);
}
cout << a << endl;
return 0;
}
| 0
| 18,851,037
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
template <class T>
T gcd(T a, T b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
template <class T>
T lcm(const T& a, const T& b) {
T n = gcd<T>(a, b);
if (a > b) {
return (a / n) * b;
} else {
return a * (b / n);
}
}
int main() {
int N;
cin >> N;
vector<long long> T(N);
for (int i = 0; i < N; i++) {
cin >> T[i];
}
long long ans = T[0];
for (int i = 1; i < N; i++) {
ans = lcm(ans, T[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e+18 + 10;
const int MAX_N = 100;
ll dp[MAX_N][MAX_N];
int main()
{
int n;
cin >> n;
vector<int> r;
for (int i = 0; i < n; i++)
{
int row, col;
cin >> row >> col;
if (i == 0)
{
r.push_back(row);
}
r.push_back(col);
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (i == j)
{
dp[i][i] = 0;
}
else
{
dp[i][j] = INF;
}
}
}
for (int j = 1; j < n; j++)
{
for (int i = 0; i + j < n; i++)
{
for (int k = 0; k <= i + j; k++)
{
ll prod = r[i] * r[k + 1] * r[i + j + 1];
dp[i][i + j] = min(dp[i][i + j], dp[i][k] + dp[k + 1][i + j] + prod);
}
}
}
cout << dp[0][n - 1] << endl;
return 0;
}
| 0
| 21,600,666
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int digit(ll n)
{
int res = 0;
while (n > 0)
{
res++;
n /= 10;
}
return res;
}
int main()
{
ll N;
cin >> N;
ll a = sqrt(N);
while (N % a != 0)
{
a--;
}
cout << digit(N / a) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
int findLowerBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto low = lower_bound(arr.begin(),
arr.end(), p);
return low - arr.begin();
}
int findUpperBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto up = upper_bound(arr.begin(),
arr.end(), p);
return up - arr.begin();
}
bool vis[200005];
vector<int> vec[2000005];
int child[2000005];
int parent[2000005];
int div1[100005];
void dfs(int node)
{
vis[node] = 1;
for (int i = 0; i < vec[node].size(); i++)
{
if (!vis[vec[node][i]])
{
parent[vec[node][i]] = node;
dfs(vec[node][i]);
}
}
}
void bfs(int node)
{
queue<int> qu;
qu.push(node);
vis[1] = 1;
while (!qu.empty())
{
int top = qu.front();
qu.pop();
vis[top] = 1;
for (int i = 0; i < vec[top].size(); i++)
{
if (!vis[vec[top][i]])
{
parent[vec[top][i]] = top;
qu.push(vec[top][i]);
vis[vec[top][i]] = 1;
}
}
}
}
void belman(int n, int m, vector<pair<int, pair<int, int>>> vec, int dis[])
{
for (int i = 0; i <= n + m - 1; i++)
{
for (int j = 0; j < vec.size(); j++)
{
int u = vec[j].second.first;
int v = vec[j].second.second;
int w = vec[j].first;
if (dis[u] + w < dis[v])
{
dis[v] = dis[u] + w;
}
}
}
}
int fun(int a, int b)
{
if (a > b)
return 0;
if (a == b)
return 1;
else
{
return fun(a + 1, b) + fun(a, b - a);
}
}
int32_t main()
{
int n;
cin >> n;
vector<int> vec;
int ans = 0;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
if (temp > n)
{
ans++;
}
else
{
vec.push_back(temp);
}
}
map<int, int> mp;
for (auto itr : vec)
mp[itr]++;
for (auto itr : mp)
{
if (itr.first > itr.second)
{
ans += (itr.second);
}
else
{
ans += (itr.second - itr.first);
}
}
cout << ans << "\n";
return 0;
}
| 0
| 51,666,440
|
#include <vector>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <map>
#include <array>
#include <cmath>
long long PRIME = 1e9 + 7;
using namespace std;
vector<vector<int>> E;
int main(){
int A, B;
cin >> A >> B;
A = (A + 12) % 14;
B = (B + 12) % 14;
if(A > B){
cout << "Alice";
}
else if(B > A){
cout << "Bob";
}
else{
cout << "Draw";
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define GCD(x,y) __gcd(x,y)
#define lb lower_bound
#define up upper_bound
#define setp setprecision
#define bs binary_search
#define all(x) x.begin(),x.end()
#define LCM(x,y) ((x*y)/__gcd(x,y))
#define spc(x) cout<<fixed<<setp(x)
const long long inf = 1e18;
const long long cs = 200005;
const long long mod = 1000000007;
const double PI = 2 * acos(0.0);
void solve()
{
ll t,n,m,a,b,c,d,e,i,j,k,x,y,z,cnt=0,cnt1=0;
bool flag = false;
cin>>n;
string s;
cin>>s;
x=s.length();
map<char,ll>ap;
for(i=0;i<x;i++)
{
ap[s[i]]++;
}
for(auto &ss:ap)
{
if(ss.S&1)
{
cout<<"No"<<endl;
return ;
}
}
cout<<"Yes"<<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
return 0;
}
| 0
| 96,315,596
|
#include<iostream>
using namespace std;
int main(){
int a,sum[2]={0};
for(int i=0;i<4;i++){
cin>>a;
sum[0]+=a;
}
for(int i=0;i<4;i++){
cin>>a;
sum[1]+=a;
}
cout<<(sum[0]<sum[1]?sum[1]:sum[0])<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
vector<ll>multiple;
void prime(int v){
multiple[0]=-1;
multiple[1]=-1;
for(int i=2; i<=v; i++){
if(multiple[i]!=0)continue;
for(int j=i*2; j<=v; j+=i){
multiple[j]=i;
}
}
}
int main(){
ll n;
cin >> n;
multiple.resize(n+1);
prime(n);
vector<ll>count(n+1);
for(int i=2; i<n+1; i++){
ll x = i;
ll j = 2;
while(x>1){
if(multiple[j]!=0){
j++;
continue;
}
while(x%j==0){
x/=j;
count[j]++;
}
j++;
}
}
ll c3=0,c5=0,c15=0,c25=0,c75=0;
for(int i=0; i<n+1; i++){
if(count[i]>=2 && count[i]<=3)c3++;
if(count[i]>=4 && count[i]<=13)c5++;
if(count[i]>=14 && count[i]<=23)c15++;
if(count[i]>=24 && count[i]<=73)c25++;
if(count[i]>=74)c75++;
}
ll ans=0;
ans+=c3*(c5+c15+c25+c75)*(c5+c15+c25+c75-1)/2;
ans+=(c5+c15+c25+c75)*(c5+c15+c25+c75-1)*(c5+c15+c25+c75-2)/2;
ans+=c5*(c15+c25+c75);
ans+=(c15+c25+c75)*(c15+c25+c75-1);
ans+=(c3+c5+c15)*(c25+c75);
ans+=(c25+c75)*(c25+c75-1);
ans+=c75;
cout << ans << endl;
}
| 0
| 47,482,044
|
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
string ss = s.substr(0,4);
if(ss == "YAKI") {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,m,a,b,i,ans=0;
multiset<int> s;
map<int,multiset<int>> mp;
cin>>n>>m;
for(i=0;i<n;i++){
cin>>a>>b;
if(a<=m){
if(mp.count(a)) mp.at(a).insert(b);
else mp[a].insert(b);
}
}
for(i=1;i<=m;i++){
if(mp.count(i)) for(auto j:mp[i]) s.insert(j);
if(s.size()>0){
auto it=prev(s.end(),1);
ans+=*it;
s.erase(it);
}
}
cout<<ans<<endl;
}
| 0
| 528,088
|
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
#define PB push_back
#define dump(x) cout << #x << " = " << (x) << endl;
#define SZ(x) ((ll)(x).size())
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define ps(s) cout << #s << endl;
#define pv(v) cout << (v) << endl;
#define pvd(v) cout << setprecision(16) << (v) << endl;
#define ALL(a) (a).begin(),(a).end()
#define RANGE(a, start_index, num) (a).begin()+(start_index),(a).begin()+(num)
int main() {
vector<int> a = { 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 k;
cin >> k;
pv(a[k - 1]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
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(){
ll N,M,K;
cin>>N>>M>>K;
bool flag=false;
rep(i,N+1){
rep(j,M+1){
if(i*(M-j)+j*(N-i)==K){
flag=true;
}
}
}
if(flag){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
| 0
| 57,149,789
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
int first = i % 10;
int fifth = i / 10000 % 10;
int second = i / 10 % 10;
int fourth = i / 1000 % 10;
if (first == fifth && second == fourth) ++ans;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
string s;
cin >> s;
ll k;
cin >> k;
ll n = s.size()-1;
ll ans = 0;
bool same = true;
ll now = 1;
vector<ll> can;
bool all = true;
for(ll i = 0; i < n; i++){
if(s[i] == s[i+1] && same){
now++;
} else if(s[i] == s[i+1]){
now++;
same = true;
} else {
all = false;
can.push_back(now);
now = 1;
}
}
if(all){
cout << s.size()*k/2 << endl;
return 0;
}
if(n > 0 && s[n-1] == s[n]) can.push_back(now);
same = false;
if(s[0] == s[n]) same = true;
for(auto p:can){
ans += p/2;
}
ans *= k;
if(can.empty()){
cout << k/2 << endl;
return 0;
}
if(can[0]%2 != 0 && can.back()%2 != 0 && same) ans += k-1;
cout << ans << endl;
}
| 0
| 57,771,458
|
#include <iostream>
using namespace std;
int main()
{
unsigned n, money = 100000;
for (cin >> n; n; n--) {
money *= 1.05;
if (money % 1000) {
money = money - money % 1000 + 1000;
}
}
cout << money << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
const int M = 39;
int main() {
int N;
cin >> N;
i64 S = (1ll << M) - 1;
i64 mod = -1;
vector<string> ans;
for(int i = 0; i < N; i++) {
i64 X, Y;
cin >> X >> Y;
if(!i) {
mod = (X + Y + 1) & 1;
} else {
if(mod != ((X + Y + 1) & 1)) {
cout << -1 << endl;
return 0;
}
}
string w = "";
if (mod) {
w = "L";
X++;
}
i64 V = X + Y + S;
i64 W = X - Y + S;
for(int i = 0; i < M; i++) {
int a = (V >> (i + 1)) & 1, b = (W >> (i + 1)) & 1;
char c;
if(a && b) {
c = 'R';
} else if(a && !b) {
c = 'U';
} else if(b && !a) {
c = 'D';
} else {
c = 'L';
}
w.push_back(c);
}
ans.push_back(w);
}
cout << M + mod << endl;
if(mod) cout << "1";
for (int i = mod; i < M + mod; i++) {
cout << (i ? " " : "") << (1ll << (i - mod));
}
cout << endl;
for(auto a : ans) {
cout << a << endl;
}
return 0;
}
| 0
| 83,407,742
|
#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i,n) for(lli i=0; i<n; i++)
#define loop(i, j, n) for(lli i=j; i<n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const double PI = acos(-1);
lli combi(lli n, lli r){
if(r==0 || r==n) return 1;
else return combi(n-1,r) + combi(n-1,r-1);
}
lli sigma1(lli n){return n*(n+1)/2;}
lli sigma2(lli s, lli n){return sigma1(n) - sigma1(s -1);}
using namespace std;
int main() {
map<int, int> s;
rep(i,3){
int a;
cin >> a;
s[a]++;
}
for(const auto& x : s){
if(x.second == 1) cout << x.first << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using ll = long long;
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> frnt;
vector<int> back;
rep(i, 0, n) {
int val;
cin >> val;
if (i % 2 == 0) {
frnt.push_back(val);
} else {
back.push_back(val);
}
}
if (n % 2 != 0) {
reverse(frnt.begin(), frnt.end());
for (int val : frnt) {
printf("%d ", val);
}
rep(i, 0, back.size()) {
printf("%d", back[i]);
if (i != back.size() - 1) {
printf(" ");
} else {
printf("\n");
}
}
} else {
reverse(back.begin(), back.end());
for (int val : back) {
printf("%d ", val);
}
rep(i, 0, frnt.size()) {
printf("%d", frnt[i]);
if (i != frnt.size() - 1) {
printf(" ");
} else {
printf("\n");
}
}
}
return 0;
}
| 0
| 38,842,280
|
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
rep(i, N) {
cin >> A[i];
sum += A[i];
}
ll ave1 = sum / N, ave2 = sum / N + 1, ave3 = sum / N - 1;
ll tmp1 = 0, tmp2 = 0, tmp3 = 0;
rep(i, N) {
tmp1 += (A[i] - ave1) * (A[i] - ave1);
tmp2 += (A[i] - ave2) * (A[i] - ave2);
tmp3 += (A[i] - ave3) * (A[i] - ave3);
}
cout << min(tmp1, min(tmp2, tmp3)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9+7;
#ifdef _DEBUG
#define debug(var) do{cout << #var << " :";view(var);}while(0)
#else
#define debug(...)
#endif
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vector<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vector<vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
int main(){
int n;
cin >> n;
map <int,int> a;
map <int,int> b;
REP(i,n){
int v;
cin >> v;
if(i%2 == 0) a[v]++;
else b[v]++;
}
int maxa = 0;
int maxkey_a = 0;
int maxb = 0;
int maxkey_b = 0;
for(auto x: a) {
if(x.second >= maxa){
maxa = x.second;
maxkey_a = x.first;
}
}
for(auto x: b) {
if(x.second >= maxb){
maxb = x.second;
maxkey_b = x.first;
}
}
if(maxkey_a == maxkey_b){
int max2a = 0;
int max2key_a = 0;
for(auto x: a){
if(x.first == maxkey_a) continue;
if(x.second >= max2a){
max2a = x.second;
max2key_a = x.first;
}
}
int max2b = 0;
int max2key_b = 0;
for(auto x: b){
if(x.first == maxkey_b) continue;
if(x.second >= max2b){
max2b = x.second;
max2key_b = x.first;
}
}
if(maxa - max2a >= maxb - max2b) maxb = max2b;
else maxa = max2a;
}
int ans = n - maxa - maxb;
cout << ans << endl;
return 0;
}
| 0
| 19,878,139
|
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define double long double
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define endl "\n"
#define repp(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define brep(i,a,b) for(int i=a;i>=b;i--)
#define deb1(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define deb3(x, y, z) cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define trace(v) for(auto it=v.begin();it!=v.end();it++)cout<<*it<<" ";cout<<endl;
#define tracearr(a,l,r) for(int iii=l;iii<=r;iii++)cout << a[iii] << " ";cout << endl;
#define PI 3.1415926535897932384626
#define F first
#define S second
#define clr(x,y) memset(x, y, sizeof(x))
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int N= 5000 + 5;
const int MOD=1e9 + 7;
int val[N];
int a[N];
int n,k;
int solve(int idx)
{
int mp[N];
clr(mp,0);
int cost = 0;
int len = 0;
vi v;
while(mp[idx]==0)
{
mp[idx]=1;
idx = a[idx];
cost += val[idx];
v.pb(val[idx]);
len++;
}
int ans = 0;
int times = k/len;
int left = k%len;
int flag = 0;
if(cost>0)
{
flag = 1;
ans = cost*times;
}
if(flag==1)
{
int cur = 0;
int sum = 0;
int temp = ans;
while(left>0)
{
idx = a[idx];
sum += val[idx];
cur = max(cur,sum);
left--;
}
ans += cur;
sum = 0;
cur = INT_MAX;
for(int j=v.size()-1;j>=0;j--)
{
sum += v[j];
cur = min(sum,cur);
}
if(cur<0)
temp -= cur;
ans = max(ans,temp);
}
else
{
clr(mp,0);
int kk = k;
int cur = INT_MIN;
int sum = 0;
while(kk>0 && mp[idx]==0)
{
mp[idx] = 1;
idx = a[idx];
sum += val[idx];
cur = max(cur,sum);
kk--;
}
ans += cur;
}
return ans;
}
int32_t main()
{
IOS;
int T=1;
std::cout << std::fixed << std::setprecision(12);
while(T--)
{
cin >> n >> k;
rep(i,1,n)
cin >> a[i];
rep(i,1,n)
cin >> val[i];
int ans = INT_MIN;
rep(i,1,n)
ans = max(ans,solve(i));
cout << ans;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const ll inf = 1e18;
const int mod = 10007;
int main() {
int n;
cin >> n;
vint a(n);
rep(i,n) cin >> a[i];
vint dp;
dp.push_back(-1);
dp.push_back(a[0]);
for (int i = 1; i < n; i++) {
for (int j = dp.size()-1; j >= 0; j--) {
if (dp[j] < a[i]) {
dp.push_back(a[i]);
break;
}
else if (dp[j] >= a[i] && dp[j-1] < a[i]) {
dp[j] = a[i];
break;
}
}
}
cout << dp.size() - 1 << endl;
}
| 0
| 81,044,648
|
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <list>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <map>
#define INFTY (1<<30)
using namespace std;
int h = 0, a[2000000+1];
void maxHeapify( int i) {
int l = 2*i, r = 2*i+1;
int largest;
if( l <= h && a[l] > a[i]) largest = l;
else largest = i;
if( r <= h && a[r] > a[largest]) largest = r;
if( largest != i) {
swap(a[i], a[largest]);
maxHeapify(largest);
}
return;
}
void increaseKey(int i, int k) {
if( k < a[i]) return;
a[i] = k;
while( i > 1 && a[i/2] < a[i]) {
swap(a[i], a[i/2]);
i = i/2;
}
}
int extract() {
if(h < 1) return -INFTY;
int max = a[1];
a[1] = a[h--];
maxHeapify(1);
return max;
}
int main(){
priority_queue<int> PQ;
while(1) {
char str[10];
int k;
scanf("%s", str);
if(str[0] == 'e' && str[1] == 'n') break;
else if(str[0] == 'i') {
cin >> k;
PQ.push(k);
} else {
cout << PQ.top() <<endl;
PQ.pop();
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string s, t;
int main(void){
cin >> s >> t;
if(s.size() < t.size()){
cout << "UNRESTORABLE" << endl;
return 0;
}
vector<string> r;
for(int i = 0; i < s.size()-t.size()+1; i++){
string p = s.substr(i, t.size());
for(int j = 0; j < p.size(); j++){
if(p[j] == '?') p[j] = t[j];
}
if(p == t) r.push_back(s.substr(0, i)+p+s.substr(i+p.size()));
}
if(r.size() == 0) cout << "UNRESTORABLE" << endl;
else{
sort(r.begin(), r.end());
string res = r[0];
for(int i = 0; i < res.size(); i++){
if(res[i] == '?') cout << 'a';
else cout << res[i];
}
cout << endl;
}
return 0;
}
| 0
| 22,847,547
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;i++)
#define get(a) fl(i,0,a.size()) cin>>a[i];
#define pra(a) fl(i,0,a.size()) cout<<a[i]<<" "; cout<<endl;
#define pr(a,n) fl(i,0,n) cout<<a[i]<<" "; cout<<endl;
const ll INF = 2e18;
const int inf = 2e9;
const int mod1 = 1e9 + 7;
int main(){
Shazam;
int n,m; cin>>n>>m;
vector<vector<int>> g(n+1);
for(int i = 0 ; i < m; i++){
int a,b; cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> p(n+1);
vector<int> d(n+1, 1e9);
set<pair<int,int>> q;
q.insert({0,1});
for(int i = 2; i <= n; i++){
q.insert({INT_MAX,i});
}
d[1] = 0;
d[0] = 0;
while(!q.empty()){
int v = q.begin()->ss;
q.erase(q.begin());
for(int next : g[v]){
if(d[next] > d[v] + 1){
q.erase({d[next],next});
d[next] = d[v] + 1;
p[next] = v;
q.insert({d[next],next});
}
}
}
if(*max_element(all(d))== INT_MAX) cout<<"No"<<endl;
else{
cout<<"Yes"<<endl;
for(int i = 2; i <=n; i++)
cout<<p[i]<<endl;
}
return 0;
}
|
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functional>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
using namespace std;
#define ll long long
#define all(v) (v).begin() , (v).end()
#define vi vector <ll>
#define vii vector <pair<ll,ll>>
#define ii pair<ll,ll>
#define sz(v) ((int)((v).size()))
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define pf push_front
#define F first
#define S second
#define endl "\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const double PI = 3.14159265358979323846;
const ll inf=2e9,MOD=998244353,MAX=1e2+2;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
ll n,a,b;
cin>>n>>a>>b;
if(a+b==0)
return cout<<0,0;
cout<<(n/(a+b))*a+min(n%(a+b),a);
}
| 0
| 1,064,740
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++){
int p;
cin >> p;
vec.at(i) = p;
}
sort(vec.begin(),vec.end());
int ans = 0;
for (int i = 0; i < k; i++){
ans += vec.at(i);
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <assert.h>
#include <numeric>
#include <time.h>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(c) (c).begin(), (c).end()
#define P pair<int, int>
#define chmin(x, y) x = min(x, y)
int main()
{
ll n;
int x, m;
cin >> n >> x >> m;
vector<int> a;
map<int, int> mp;
int cnt = 0;
ll tot = 0;
while (mp.count(x) == 0)
{
a.push_back(x);
mp[x] = cnt;
tot += x;
x = (ll)x * x % m;
cnt++;
}
if (n <= cnt)
{
ll ans = 0;
for (int i = 0; i < n; i++)
{
ans += a[i];
}
cout << ans << endl;
return 0;
}
ll c = 0;
for (int i = mp[x]; i < cnt; i++)
{
c += a[i];
}
ll ans = tot;
int lp = cnt - mp[x];
n -= cnt;
ans += n / lp * c;
n %= lp;
for (int i = 0; i < n; i++)
{
ans += a[mp[x] + i];
}
cout << ans << endl;
}
| 0
| 39,052,882
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >> S;
int N = S.length();
int sum0=0;
int sum1=0;
for (int i=0;i<N;i++){
if(i%2==0){
if(S[i]=='0') ++sum0;
else ++sum1;
}else{
if(S[i]=='0') ++sum1;
else ++sum0;
}
}
cout << N-max(sum0,sum1) << endl;
}
|
#include <iostream>
using namespace std;
int main(){
while(1){
int a,b;
cin >> a >> b;
if(a==0 && b==0)break;
for(int i=0; i<a; i++) {
for(int j=0; j<b; j++) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
}
| 0
| 34,421,371
|
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main(){
ios::sync_with_stdio(false);
double x1, y1, x2, y2, dist;
cin >> x1; cin >> y1; cin >> x2; cin >> y2;
dist = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
printf("%1.5f\n" , dist);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
long INF = (1LL << 60);
int main() {
int N;
cin>>N;
vi A(N+1);
REP(i, 0, N+1){
cin >> A[i];
}
if(N == 0){
if(A[0] == 1) cout << 1 << endl;
else cout << -1 << endl;
return 0;
}
vl maxN(N+1, 0);
vl node(N+1, 0);
maxN[0] = 1;
REP(i, 1, N+1){
maxN[i] = (long)min((maxN[i-1] - A[i-1]) * 2, INF);
}
node[N] = A[N];
for(int i = N-1; i >=0; i--){
if(maxN[i] >= node[i+1] + A[i]){
node[i] = node[i+1] + A[i];
}else if(maxN[i] >= (long)(node[i+1]+1)/2 + A[i]){
node[i] = maxN[i];
}else{
cout << -1 << endl;
return 0;
}
}
cout << accumulate(node.begin(), node.end(), 0LL) << endl;
}
| 0
| 49,039,933
|
#include <bits/stdc++.h>
using namespace std;
using ll = uint64_t;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,tot1 = 0;
cin >> n;
vector<ll> a(n);
for(ll i = 0; i < n; ++i){
cin >> a[i];
tot1 ^= a[i];
}
for(ll i = 0; i < n; ++i) a[i] &= ~tot1;
ll rank = 0;
for(int i = 59; i >= 0; --i){
ll idx = n;
for(ll j = rank; j < n; ++j){
if(a[j]&(1ll<<i)){
idx = j;
break;
}
}
if(idx == n) continue;
if(idx > rank) a[rank] ^= a[idx];
for(ll j = rank+1; j < n; ++j){
a[j] = min(a[j],a[j]^a[rank]);
}
++rank;
}
ll tot2 = 0;
for(ll i = 0; i < n; ++i) tot2 = max(tot2,tot2^a[i]);
cout << tot1+2*tot2;
return 0;
}
|
#include<stdio.h>
int main()
{
int n, count=0;
scanf("%d", &n);
while(n != 0)
{
if(n % 10 == 7)
{
count++;
break;
}
n = n/10;
}
if(count == 1)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 0
| 14,897,491
|
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
for (int i = 0; i < n; ++i)
cin >> p[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
ll ans = LLONG_MIN;
for (int i = 0; i < n; ++i) {
vector<bool> vis(n);
int idx = i;
vector<ll> sum = {0}, hi = {LLONG_MIN};
while (!vis[p[idx] - 1]) {
idx = p[idx] - 1;
vis[idx] = true;
sum.emplace_back(sum.back() + c[idx]);
hi.emplace_back(max(hi.back(), sum.back()));
}
int m = sum.size() - 1;
int f = k / m, rem = k % m;
ll result;
if (f > 0)
result = max(hi[m], max(sum[m] * f + (rem == 0 ? 0 : hi[rem]),
sum[m] * (f - 1) + hi[m]));
else
result = hi[rem];
ans = max(ans, result);
}
cout << ans;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void){
int H, W;
string hori;
int i;
while(!cin.eof()){
cin >> H >> W;
if(!H && !W) return 0;
hori = string(W, '#');
cout << hori << endl;
hori = "#" + string(W - 2, '.') + "#";
for(i = 1; i < H - 1; i++){
cout << hori << endl;
}
hori = string(W, '#');
cout << hori << endl;
cout << endl;
}
return 0;
}
| 0
| 28,427,953
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
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>
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 <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
for (int i = 0; i < sz(v); i++) {
os << v[i];
if (i < sz(v) - 1) os << " ";
}
return os;
}
int main() {
int x;
cin >> x;
cout << 10 - x / 200 << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
int main() {
int x;
cin >> x;
if (x < 1200) {
cout << "ABC";
} else {
cout << "ARC";
}
return 0;
}
| 0
| 3,457,096
|
#include <iostream>
#include<iomanip>
#include <string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#include<ctime>
#include<cstdlib>
#define INF 1001001001001001001
#define rep(i,n,m) for(int i=n;i<m;i++)
using namespace std;
int main() {
int n;
long long int k;
cin >> n >> k;
vector<long long int>a(n + 1);
a[0] = 0;
long long int x;
rep(i, 0, n) {
cin >> x;
a[i + 1] = (a[i] + x) % k;
}
long long int uns_i;
rep(i, 0, n + 1) {
uns_i = i % k;
a[i] = (a[i] - uns_i + k) % k;
}
long long int ans = 0;
map<int, int>m;
rep(i, 0, n + 1) {
if (i >= k) m[a[i - k]]--;
ans += m[a[i]];
m[a[i]]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
#define pb(n,m) n.push_back(m)
#define pi(n,m) n.insert(n.begin(),m);
#define ee(n) n.erase(n.end()-1)
#define eb(n) n.erase(n.begin())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int n,m=0,ans=0; cin>>n;
vector<int> a(n+1);
rep(i,0,n){
cin>>a[i];
m=max(m,a[i]);
}
a[n]=-1;
rep(i,1,m+1){
int c=0;
bool f=false;
rep(j,0,n+1){
if(a[j]>=i) f=true;
else if(f){
ans++;
f=false;
}
}
ans+=c;
}
co(ans);
return 0;
}
| 0
| 99,144,761
|
#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() {
double N, K;
cin>>N>>K;
double ans=0;
double tmpans;
int tmp;
for(int i=1;i<=N;++i) {
if(i>=K) ans += 1/N;
else {
tmpans = 1/N;
tmp = i;
while(tmp<K) {
tmpans /= 2;
tmp *= 2;
}
ans += tmpans;
}
}
cout<<setprecision(20)<<ans<<endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
using namespace std;
int main(){
int a;
int b;
int c;
int d;
cin >> d;
for (int i = 0; i < d; i++){
cin >> a >> b >> c;
int e = a*a;
int f = b*b;
int g = c*c;
if ( e + f== g || e + g == f || f + g == e){
cout << "YES" << endl;
}
else cout << "NO" << endl;
}
return 0;
}
| 0
| 46,512,696
|
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<math.h>
using namespace std;
typedef long long int lli;
int main()
{
double x1, x2, x3, xp;
double y1, y2, y3, yp;
double abc[3];
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp) {
abc[0] = (x3 - x2)*(yp - y2) - (y3 - y2)*(xp - x2);
abc[1] = (x1 - x3)*(yp - y3) - (y1 - y3)*(xp - x3);
abc[2] = (x2 - x1)*(yp - y1) - (y2 - y1)*(xp - x1);
if ((abc[0] > 0 && abc[1] > 0 && abc[2] > 0) || (abc[0] < 0 && abc[1] < 0 && abc[2] < 0)) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int sum = 0;
char number[1001];
while (1) {
cin >> number;
sum = 0;
for (int i = 0; i < 1000; i++) {
if (number[i] == 0)
break;
sum += number[i] - '0';
}
if (sum == 0)
break;
else
cout << sum << endl;
}
return 0;
}
| 0
| 17,046,462
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i< (int)(b); ++i)
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
typedef long double ld;
using ll=long long;
using namespace std;
const int mod=1e9+7;
const ll inf = 1LL << 60;
const ld pi = (acos(-1));
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int a,b,c; cin >> a >> b >> c;
cout << max(c-(a-b),0) << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
const ll INF = 1001001001001001001;
int main(){
int n, k;
cin >> n >> k;
vector<int> p(n+1);
for(int i = 1; i <= n; i++) cin >> p[i];
vector<int> c(n+1);
for(int i = 1; i <= n; i++) cin >> c[i];
vector<bool> isvisit(n+1, false);
ll ans = -INF;
for(int i = 1; i <= n; i++){
vector<int> path;
if(!isvisit[i]){
int cur = i;
path.push_back(i);
isvisit[i] = true;
while(p[cur] != i){
path.push_back(p[cur]);
isvisit[p[cur]] = true;
cur = p[cur];
}
ll cycletotal = 0;
for(int j = 0; j < path.size(); j++) cycletotal += c[path[j]];
ll coans = -INF;
for(int start = 0; start < path.size(); start++){
ll subtotal = 0;
for(int j = 0; j < min((int)path.size(), k); j++){
subtotal += c[path[(start+j)%path.size()]];
ll cyclepoint = 0;
if(cycletotal > 0) cyclepoint = cycletotal * ((k-j-1)/path.size());
if(coans < subtotal+cyclepoint) coans = subtotal+cyclepoint;
}
}
if(ans < coans) ans = coans;
}
}
cout << ans << endl;
return 0;
}
| 0
| 2,204,912
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define x first
#define y second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
template<typename T> bool smin(T &a, const T &b) { bool ret = b < a; return a = (ret ? b : a), ret; }
template<typename T> bool smax(T &a, const T &b) { bool ret = a < b; return a = (ret ? b : a), ret; }
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
mt19937 rnd;
const int N = 1e5 + 30;
const int B = 17;
int dp[N][B];
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int &i : a) {
cin >> i;
}
int L;
cin >> L;
a.push_back(a.back() + L);
dp[n - 1][0] = n;
dp[n][0] = n;
for (int i = n - 2; i >= 0; i--) {
dp[i][0] = dp[i + 1][0];
while (a[dp[i][0]] - a[i] > L) {
dp[i][0]--;
}
}
for (int b = 1; b < B; b++) {
for (int i = 0; i <= n; i++) {
dp[i][b] = dp[dp[i][b - 1]][b - 1];
}
}
int q;
cin >> q;
while (q--) {
int a, b;
cin >> a >> b;
a--, b--;
if (a > b) {
swap(a, b);
}
int ans = 0;
for (int bit = B - 1; a < b && bit >= 0; bit--) {
if (dp[a][bit] < b) {
a = dp[a][bit];
ans += (1 << bit);
}
}
cout << ans + 1 << "\n";
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
#define LM 1000000000000000000
int main() {
int n;
ll ans = 1;
int chk = 0;
ll buf;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
if (a[i] == 0)chk = 1;
}
if (chk == 0) {
rep(i, n) {
if (a[i] > LM / ans) {
ans = -1;
break;
}
ans *= a[i];
}
}
else ans = 0;
if (ans > LM)ans = -1;
cout << ans << endl;
return 0;
}
| 0
| 13,350,467
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s;
cin >> s;
string t0, t1;
for(long long i = 0; i < s.size(); i++){
if(i % 2 == 0){
t0.push_back('0');
t1.push_back('1');
}
else{
t0.push_back('1');
t1.push_back('0');
}
}
long long count1 = 0, count0 = 0;
for(long long i = 0; i < s.size(); i++){
if(t0[i] != s[i]){
count0++;
}
if(t1[i] != s[i]){
count1++;
}
}
cout << min(count0, count1) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi=acos(-1.0);
const ll mod=pow(10,9)+7;
const ll INF=pow(2,31)-1;
typedef pair<int,int> P;
typedef vector<int> vi;
ll gcd(ll a,ll b){
ll v0=a,v1=b,v2=a%b;
while(v2!=0){
v0=v1;
v1=v2;
v2=v0%v1;
}
return v1;
}
ll lcm(ll a,ll b){
return (a*b/gcd(a,b));
}
int main(){
ios::sync_with_stdio(false);
int n,record,ans=0,sum=0; cin>>n;
string s[n],x;
int t[n];
rep(i,n) cin >>s[i]>>t[i];
cin >>x;
rep(i,n) sum+=t[i];
rep(i,n){
if(s[i]==x){
record=i;
break;
}
}
for(int i=0;i<=record;i++){
sum-=t[i];
}
cout << sum <<endl;
return 0;
}
| 0
| 23,032,991
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
int hanako = 0;
int taro = 0;
for(int i=0;i<n;i++) {
string str1, str2;
cin >> str1 >> str2;
if(str1.compare(str2) == 0){
hanako++;
taro++;
}
else if(str1.compare(str2) < 0) taro += 3;
else hanako += 3;
}
cout << hanako << " " << taro << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int w[51];
long long int b[51];
long long int p[51];
void burg(int n){
w[0]=1; b[0]=0; p[0]=1;
for(int i=0;i<n;i++){
b[i+1]=2+2*b[i];
p[i+1]=1+2*p[i];
w[i+1]=b[i+1]+p[i+1];
}
}
long long int answer(long long int y,int level){
if(y==0)return 0;
else if(y==w[level] || y==w[level]-1)return p[level];
else if(y==1)return 0;
else if(y>=2+w[level-1])return 1+p[level-1]+answer(y-2-w[level-1],level-1);
else return answer(y-1,level-1);
}
int main(){
int n;
long long int x;
cin >> n >> x;
burg(n);
cout << answer(x,n) << endl;
}
| 0
| 21,592,314
|
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
const double PI = 3.14159265358979323846264338327950288;
int cnt[100010];
int main()
{
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--; b--;
cnt[a]++;
cnt[b]++;
}
for (int i = 0; i < N; i++) {
if (cnt[i] % 2 == 1) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
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; }
ll choose(ll n, ll r){
ll res = 1;
for(int i = 1; i <= r; i++){
res *= n--;
res /= i;
}
return res;
}
int main(){
int n, p;
cin >> n >> p;
vector<int> a(n);
rep(i,n) cin >> a[i];
int even = 0, odd = 0;
rep(i,n){
if (a[i] % 2 == 0) even++;
else odd++;
}
ll ans;
if (even == n){
if (p == 0) ans = 1LL << even;
else ans = 0;
}else if (odd == n){
ans = 0;
if (p == 1) for(int i = 1; i <= odd; i += 2) ans += choose(odd, i);
else for(int i = 0; i <= odd; i+=2 ) ans += choose(odd, i);
}else{
ll numE;
numE = 1LL << even;
if (p == 1) for(int i = 1; i <= odd; i += 2) ans += choose(odd, i);
else for(int i = 0; i <= odd; i+=2 ) ans += choose(odd, i);
ans *= numE;
}
cout << ans << endl;
return 0;
}
| 0
| 69,321,408
|
#include<bits/stdc++.h>
using namespace std;
const int MaxN = 2e5 + 25;
const int MOD = 1e9 + 7;
void make(vector <long long> & v)
{
map<long long, int> mp;
for(long long x : v)
mp[x];
int cur = 0;
for(map<long long, int>:: iterator it = mp.begin(); it != mp.end(); ++it)
it -> second = ++cur;
for(long long & x : v)
x = mp[x];
}
int main()
{
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
vector <long long> v;
long long n, a, b;
cin >> n >> a >> b;
if(a + b - 1 > n || a * b < n)
{
cout << -1 << '\n';
return 0;
}
long long k = n - (a + b - 1);
for(long long i = a * b - a + 1; i <= a * b; ++i)
v.push_back(i);
long long B = b - 1;
while(k)
{
v.push_back((B - 1) * a + 1);
long long p = min(k, a - 1);
k -= p;
for(int i = 2; i <= a && p; ++i, --p)
v.push_back((B - 1) * a + i);
--B;
}
while(B)
{
v.push_back((B - 1) * a + 1);
--B;
}
make(v);
for(int i = 0; i < v.size(); ++i)
cout << v[i] << ' ';
cout << '\n';
return 0;
}
|
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
size_t ldistance(string s, string t) {
size_t slen=s.length(), tlen=t.length();
vector<vector<size_t>> dp(slen+1, vector<size_t>(tlen+1));
for (size_t i=0; i<=slen; ++i)
dp[i][0] = i;
for (size_t j=0; j<=tlen; ++j)
dp[0][j] = j;
for (size_t i=1; i<=slen; ++i)
for (size_t j=1; j<=tlen; ++j) {
size_t cost=(s[i-1]!=t[j-1]);
dp[i][j] = min(min(dp[i-1][j], dp[i][j-1])+1, dp[i-1][j-1]+cost);
}
return dp[slen][tlen];
}
int main() {
char buf[1024];
scanf("%s", buf);
string s1(buf);
scanf("%s", buf);
string s2(buf);
printf("%zu\n", ldistance(s1, s2));
return 0;
}
| 0
| 22,023,354
|
#include <bits/stdc++.h>
#define For( i, j, k ) for( int i = j; i <= k; ++i )
using std::vector;
using std::pair;
using std::cin;
using std::cout;
typedef long long LONG;
typedef int INT;
const INT N = 100100;
char c[ N ];
INT n, ans[ N ];
void Print( )
{
For( i, 1, n )
cout << ( ans[ i ] ? 'W' : 'S' );
return;
}
void INIT( )
{
For( i, 3, n )
ans[ i ] = ans[ i - 2 ] ^ ans[ i - 1 ] ^ ( c[ i - 1 ] != 'o' );
return;
}
bool check( )
{
bool flag = 0;
For( i, 1, n )
{
int l = ( i - 1 == 0 ) ? n : i - 1, r = ( i + 1 > n ? 1 : i + 1 );
flag |= ( ans[ l ] ^ ans[ r ] != ( c[ i ] != 'o' ^ ans[ i ] ) );
}
return !flag;
}
int main( )
{
std::ios::sync_with_stdio( false );
cin >> n;
cin >> c + 1;
For( i, 0, 1 ) For( j, 0, 1 )
{
ans[ 1 ] = i, ans[ 2 ] = j;
INIT( );
if( check( ) )
{
Print( );
return 0;
}
}
cout << "-1";
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#define int long long
#define MOD7 1000000007
#define MOD9 1000000009
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}
void inputVector(vector<int> &v, int &n) {rep(i,n){v.push_back(nextInt());}}
void inputVector(vector<double> &v, int &n) {rep(i,n){v.push_back(nextDouble());}}
void inputVector(vector<string> &v, int &n) {rep(i,n){v.push_back(nextString());}}
class UnionFind {
private:
class Node {
public:
int parent;
Node(int parent) {
this->parent = parent;
}
};
int root(int x) {
int base = x;
while (x != node[x].parent) {
x = node[x].parent;
}
node[base].parent = x;
return x;
}
vector<Node> node;
public:
UnionFind(int size) {
for (int i = 0; i < size; i++) {
node.push_back(Node(i));
}
}
void unite(int x, int y) {
node[root(x)].parent = root(y);
}
bool same(int x, int y) {
return root(x) == root(y);
}
};
signed main() {
int n, q;
cin >> n >> q;
auto uf = UnionFind(n);
rep(i, q) {
int com, x, y;
cin >> com >> x >> y;
if (com == 0) {
uf.unite(x, y);
} else {
cout << (uf.same(x, y) ? 1 : 0) << endl;
}
}
return 0;
}
| 0
| 7,342,607
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n)rep(j, d) cin >> x[i][j];
vector<int> check(200);
for (int i = 1; i <= 200; i++) check[i] = i * i;
int ans = 0;
for (int i = 0; i < n-1; i++) {
for (int j = i + 1; j < n; j++) {
vector<int> y = x[i];
vector<int> z = x[j];
int dis = 0;
rep(i, d) {
int k = abs(y[i] - z[i]);
dis += k * k;
}
bool ok = false;
for (int i = 1; i <= 200; i++) {
if (check[i] == dis) ok = true;
}
if (ok) ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
int main(int argc, char const *argv[])
{
int a, b, c;
std::string answer = "No";
std::cin >> a >> b >> c;
if (a<b&&b<c) {
answer = "Yes";
}
std::cout << answer << std::endl;
return 0;
}
| 0
| 37,449,140
|
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int n, m, p;
while (1){
cin >> n >> m >> p;
if (n == 0 && m == 0 && p == 0) break;
int sum = 0;
int winner;
for (int i = 1; i <= n; i++){
int c;
cin >> c;
if (i == m){
winner = c;
}
sum += c;
}
if (winner == 0){
cout << 0 << endl;
continue;
}
int ans = floor((sum * 100 * (100 - p) / 100) / winner);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W;
cin >> H >> W;
vector<string> S(H);
rep(i, H) cin >> S[i];
bool ok = true;
rep(i, H) rep(j, W) {
if(S[i][j] == '#') {
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
bool ok2 = false;
rep(k, 4) {
int nx = i+dx[k], ny = j+dy[k];
if(nx < 0 || nx >= H || ny < 0 || ny >= W) continue;
ok2 |= (S[nx][ny]=='#');
}
ok &= ok2;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
}
| 0
| 52,785,546
|
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
using namespace std;
int main() {
int N;
string* W;
bool key = true;
cin >> N;
W = new string[N];
for (int i = 0; i < N; i++) {
cin >> W[i];
}
for (int i = 0; i < N - 1; i++) {
if (W[i][W[i].size() - 1] != W[i + 1][0]) {
key = false;
goto answer;
}
}
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (W[i] == W[j]) {
key = false;
goto answer;
}
}
}
answer:
if (key) {
cout << "Yes";
}
else {
cout << "No";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> vec;
vector<ll> divisor(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
string S;
cin >> N;
vec = divisor(N);
ll ans = LLINF;
REP(i,vec.size()){
ll tmp = N / vec.at(i);
double tmp1 = log10(vec.at(i));
double tmp2 = log10(tmp);
ll tmp3 = (ll)(max(tmp1, tmp2));
ans = min(ans, tmp3+1);
}
cout << ans << endl;
}
| 0
| 59,487,583
|
#include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
li solve(li x,const vector<li>& bgr,const vector<li>& pty,int n){
if(x<=n) return 0;
else if(x==bgr[n]){
return pty[n];
}else if(x>=bgr[n-1]+2){
return pty[n-1]+solve(x-bgr[n-1]-2,bgr,pty,n-1)+1;
}else if(x==bgr[n-1]+1){
return pty[n-1];
}else{
return solve(x-1,bgr,pty,n-1);
}
}
int main(){
int n; li x; cin >>n >>x;
vector<li> bgr(n+1,0),pty(n+1,0);
bgr[0]=1;pty[0]=1;
rep(i,n){
bgr[i+1]=bgr[i]*2+3;
pty[i+1]=pty[i]*2+1;
}
print(solve(x,bgr,pty,n));
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define int long long
#define yorn(f) puts((f)?"Yes":"No")
#define YORN(f) puts((f)?"YES":"NO")
typedef long long ll;
typedef pair<int, int> P;
int gcd(int a,int b){return b?gcd(b,a%b):a;};
int lcm(int a,int b){return a/gcd(a,b)*b;};
int mod(int a,int b){return (a+b-1)/b;};
template<typename A, size_t N, typename T>
void Fill(A(&array)[N],const T &val){std::fill((T*)array,(T*)(array+N),val);}
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;};
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;};
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
int cursum = 0;
mp[0]++;
rep(i, n) {
cursum += a[i];
mp[cursum % m]++;
}
int ans = 0;
for(auto &x : mp) {
ans += x.second * (x.second - 1) / 2;
}
cout << ans << endl;
return 0;
}
| 0
| 42,298,297
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define no cout << "no" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define AC cout << "AC" << endl;
#define WA cout << "WA" << endl;
#define out(s) cout << s << endl;
#define ll long long
#define ull unsigned long long
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const double PI = 3.14159265358979323846;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
#define H_MAX 500
#define W_MAX 500
#define INF 1e9 + 7
int main() {
int N, cnt = 0, cnt2 = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
int x = i;
cnt = 0;
while (x) {
cnt++;
x /= 10;
}
if (cnt % 2 == 1) {
cnt2++;
}
}
cout << cnt2 << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef long long ll;
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<int>city(n);
rep(i,n)cin>>city[i];
int l,q;
cin>>l>>q;
int nl=n,c=0;
while(nl>0){c++;nl/=2;}
vector<vector<int>>db(n,vector<int>(c,n));
int r=0;
rep(i,n)
{
while(r+1<n&&city[r+1]<=city[i]+l)r++;
db[i][0]=r;
}
rep(i,c-1)
{
rep(j,n)
{
db[j][i+1]=db[db[j][i]][i];
}
}
rep(i,q)
{
int a,b;
cin>>a>>b;
a--;b--;
if(a>b)swap(a,b);
int cnt=0;
int ma=lower_bound(all(db[a]),b)-db[a].begin();
for(int j=ma-1;j>=0;j--)
{
if(db[a][j]<b)
{
a=db[a][j];
cnt+=1<<j;
}
}
cout<<cnt+1<<"\n";
}
cout<<flush;
return 0;
}
| 0
| 8,911,289
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
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 namespace std;
int main(){
Init();
ll n, m; cin >> n >> m;
vector<vector<ll>> adj(n);
rep(i, m){
ll a, b; cin >> a >> b; a--; b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
ll start = 0, goal = n-1;
for(auto p: adj[start]){
for(auto q: adj[p]){
if(q == goal){
cout << "POSSIBLE" << endl;
return 0;
}
}
}
cout << "IMPOSSIBLE" << endl;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long n, m;
cin >> n >> m;
vector<vector<long long> > s(m);
for(long long i = 0; i < m; i++){
long long k;
cin >> k;
for(long long j = 0; j < k; j++){
long long a;
cin >> a;
s[i].push_back(a);
}
}
long long p[m];
for(long long i = 0; i < m; i++) cin >> p[i];
vector<bool> switch_on(n);
long long ans = 0;
for(long long bit = 0; bit < (1 << n); bit++){
for(long long mask = 0; mask < n; mask++){
if(bit & (1 << mask)) switch_on[mask] = true;
else switch_on[mask] = false;
}
long long light = 0;
for(long long i = 0; i < m; i++){
long long cnt_on = 0;
for(long long j = 0; j < s[i].size(); j++){
if(switch_on[s[i][j]-1] == true) cnt_on++;
}
if(p[i] == cnt_on % 2)light++;
}
if(light == m) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 65,674,958
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = B - A + 1;
for (int i = A; i <= B; i++) {
string s = to_string(i);
int j = 0, k = s.size() - 1;
while (j <= k) {
if (s.at(j) == s.at(k)) {
j++;
k--;
} else {
ans--;
break;
}
}
}
cout << ans;
}
|
#include <iostream>
using namespace std;
#define DEBUG
long long seriesXor(long long m, long long n)
{
long long ans = m;
for (long long i = m + 1; i <= n; i++) {
ans ^= i;
}
return ans;
}
long long calculate(long long x)
{
if (x % 4 == 0) {
return x;
} else if (x % 4 == 1) {
return 1;
} else if (x % 4 == 2) {
return x + 1;
} else if (x % 4 == 3) {
return 0;
} else {
return 0;
}
}
int main()
{
long long a, b, ans = 0;
scanf("%lld %lld", &a, &b);
ans = calculate(b) ^ calculate(a - 1);
printf("%lld\n", ans);
return 0;
}
| 0
| 88,523,129
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
LL A, B; cin >> A >> B;
LL A0 = A - (A % 4);
LL B0 = B - (B % 4);
LL SA = 0, SB = 0;
for (LL i = A0; i < A; ++i) SA ^= i;
for (LL i = B0; i <= B; ++i) SB ^= i;
LL S = SB ^ SA;
cout << S << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
for (int i = 0; i < 7; i++)
{
if(s.substr(0, i)+s.substr(s.size() - 7 + i) == "keyence") {
cout << "YES" << endl;
return 0;
}
}
if(s.substr(0, 7) == "keyence") cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
| 0
| 46,104,151
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x1 - (y2 - y1);
y4 = y1 + (x2 - x1);
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define RREP(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 FORD(i, m, n) for(int (i) = (m); (i) >= (n); (i)--)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
int a[200000]={0};
REP(i, n) {
cin>>a[i];
}
sort (a , a + n);
REP(i, n) {
if(a[i]==a[i+1]){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 6,597,629
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
typedef pair<int,int> P;
const int INF = 1001001001;
bool G[10][10];
int dfs(int v,int n, bool visited[10]){
bool ok = true;
rep(i,n){
if(visited[i]==false) ok = false;
}
if(ok) return 1;
int ret = 0;
rep(i,n){
if(G[v][i]==false) continue;
if(visited[i]) continue;
visited[i]=true;
ret+=dfs(i,n,visited);
visited[i]=false;
}
return ret;
}
int main() {
int n,m; cin >> n >> m;
rep(i,m){
int a, b; cin >> a >> b; --a,--b;
G[a][b]=G[b][a]=true;
}
bool visited[10];
rep(i,n){
visited[i]=false;
}
visited[0]=true;
cout << dfs(0,n,visited) << endl;
return 0;
}
|
#include <iostream>
#include <map>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int W,H;
bool box_is_in_range(int p, int q){
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(p+i < 1 || q+j < 1 || p+i > W || q+j > H) return false;
}
}
return true;
}
int main(){
int N;
cin >> H >> W >> N;
map<pair<long long,long long>,long long> mp;
for(int i=0;i<N;i++){
long long a,b;
cin >> a >> b;
for(int k=0;k<3;k++){
for(int l=0;l<3;l++){
if(a-k >= 1 && a-k <= H-2 && b-l >= 1 && b-l <= W-2){
mp[make_pair(a-k,b-l)]++;
}
}
}
}
long long ans[10];
fill(ans, ans+10,0);
ans[0] = 1ll * (H-2)*(W-2);
for(auto itr = mp.begin(); itr != mp.end(); ++itr){
ans[itr->second]++;
ans[0]--;
}
for(int i=0;i<10;i++){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 73,303,484
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
const int INF=1e9;
const ll MX = 1e18;
const ll MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MAX = 1000001;
long long 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 COM(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;}
int main() {
COMinit();
ll n;
cin>>n;
ll cnt,cnt2;
ll ja;
v(ll) a(n+1);
map<int,int> mp;
rep(i,n+1){
cin>>a[i];
mp[a[i]]++;
if(mp[a[i]]==2){
ja=a[i];
cnt2=i;
break;
}
}
rep(i,n+1){
if(a[i]==ja){
cnt=i;
break;
}
}
for(ll i=1;i<=n+1;i++){
ll ans=COM(n+1,i)-COM(cnt+n-cnt2,i-1);
if(ans<0) ans+=MOD;
cout<<ans<<endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<bool, int> P;
int W, H;
ll costw[100000 + 10], costh[100000 + 10];
pair<ll, P> sortlist[100000 * 2 + 10];
int main() {
cin >> W >> H;
for (int i = 0; i < W; i++) {
cin >> costw[i];
sortlist[i] = make_pair(costw[i], P(i, 0));
}
for (int i = 0; i < H; i++) {
cin >> costh[i];
sortlist[i + W] = make_pair(costh[i], P(i, 1));
}
sort(sortlist, sortlist + W + H);
ll ans = 0;
int cnth = 0, cntw = 0;
for (int i = 0; i < H + W; i++) {
if (sortlist[i].second.second == 0) {
ans += sortlist[i].first * (H + 1 - cnth);
cntw++;
}
else {
ans += sortlist[i].first * (W + 1 - cntw);
cnth++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 5,866,846
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int,int> m;
for(int i=0; i<n; i++){
int a;
cin >> a;
m[a]++;
}
vector<int> use;
for(auto p:m){
if(p.second>=4){
use.push_back(p.first);
use.push_back(p.first);
}
else if(p.second >=2){
use.push_back(p.first);
}
}
sort(use.begin(), use.end());
reverse(use.begin(), use.end());
if(use.size()<=1){
cout << 0 << endl;
return 0;
}
cout << (ll)use.at(0)*use.at(1) << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define mem0(x) memset(x,0,sizeof(x))
#define meminf(x) memset(x,0x3f,sizeof(x))
#define VI vector<int>
#define VL vector<ll>
using namespace std;
const int N = 1e6+5;
int a[N];
VI prime;int vis[N];
void getprime(){
rep(i,2,N-5){
if(!vis[i]){
prime.push_back(i);
}
for(int p:prime){
int v = p*i;
if(v>N-5) break;
vis[v] = 1;
if(i%p==0) break;
}
}
}
set<int> s[N];
int cntt[N];
int main(){
ios::sync_with_stdio(0);
getprime();
int n;cin>>n; int gd;int fg = 1;
rep(i,1,n){
cin>>a[i];
if(i>1&&gd != 1){
gd = __gcd(gd,a[i]);
}else if(i==1){
gd = a[i];
}
if(fg&&a[i]!=1){
if(!vis[a[i]]) {
++cntt[a[i]];
if(cntt[a[i]]>1){
fg=0;
}
}
else{
for(int p:prime){
if(a[i]%p==0){
++cntt[p];
if(cntt[p]>1){
fg=0;break;
}
if(!vis[a[i]/p]&&cntt[a[i]/p]>1){
fg=0;break;
}
}
}
}
}
}
if(!fg){
if(gd==1){
cout<<"setwise coprime"<<'\n';
}else{
cout<<"not coprime"<<'\n';
}
}else{
cout<<"pairwise coprime"<<'\n';
}
}
| 0
| 13,620,435
|
#include<bits/stdc++.h>
using namespace std;
bool visited[3][3];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int arr[3][3];
memset(visited,sizeof(visited),false);
map<int,int>track;
map<int,int>row;
map<int,int>column;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
cin>>arr[i][j];
track[arr[i][j]]++;
row[arr[i][j]]=i;
column[arr[i][j]]=j;
}
}
int n;
cin>>n;
while(n--)
{
int a;
cin>>a;
if(track[a]!=0)
{
visited[row[a]][column[a]]=true;
}
}
int r,c,d1,d2;
for(int i=0;i<3;i++)
{
r=0;
for(int j=0;j<3;j++)
{
if(visited[i][j]==true)
{
r++;
}
}
if(r==3)
{
cout<<"Yes"<<"\n";
return 0;
}
}
for(int i=0;i<3;i++)
{
c=0;
for(int j=0;j<3;j++)
{
if(visited[j][i])
c++;
}
if(c==3)
{
cout<<"Yes"<<"\n";
return 0;
}
}
if (visited[0][0] && visited[1][1] && visited[2][2])
{
cout<<"Yes"<<"\n";
return 0;
}
if(visited[0][2] && visited[1][1] && visited[2][0])
{
cout<<"Yes"<<"\n";
return 0;
}
cout<<"No"<<"\n";
}
|
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef unsigned int uint;
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b; b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) {
return a / gcd(a, b) * b;
}
bool isprime(lint n) {
if (n == 1)return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)return false;
}
return true;
}
template<typename T>
T mypow(T a, lint b) {
T res(1);
while(b){
if(b&1)res*=a;
a*=a;
b>>=1;
}
return res;
}
lint modpow(lint a, lint b, lint m) {
lint res(1);
while(b){
if(b&1){
res*=a;res%=m;
}
a*=a;a%=m;
b>>=1;
}
return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
rep(i, vec.size()){
std::cout << vec[i];
std::cout<<(i==(int)vec.size()-1?"\n":" ");
}
}
template<typename T>
void printArray(T l, T r) {
T rprev = std::prev(r);
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
if(b==0)return {1,0};
LP s=extGcd(b,a%b);
std::swap(s.first,s.second);
s.second-=a/b*s.first;
return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
lint p=extGcd(m1,m2).first;
lint tmp=(b2-b1)*p%m2;
lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
return std::make_pair(r,m1*m2);
}
template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
return [f=std::forward<F>(f)](auto&&... args){
return f(f,std::forward<decltype(args)>(args)...);
};
}
#line 2 "main.cpp"
int main(){
std::string ans;
int cnt=0;
rep(i,10){
int min=-1,max=10;
if(!i)min=0;
while(min+1<max){
int mid=(min+max)/2;
std::string s=ans+char(mid+'0'),res;
while(s.size()<10)s.push_back('9');
std::cout<<"? "<<s<<std::endl;
std::cin>>res;
if(res=="N")min=mid;
else max=mid;
}
ans.push_back(max+'0');
}
ans.push_back('0');
while(ans.back()=='0'){
ans.pop_back();
ans.push_back('1');
std::cout<<"? "<<ans<<std::endl;
std::string res;
std::cin>>res;
if(res=="N"){
ans.pop_back();
ans+="00";
break;
}
else ans.pop_back();
}
std::string s=std::to_string(std::stoi(ans)+1),res;
std::cout<<"? "<<s<<std::endl;
std::cin>>res;
if(s.size()!=ans.size()){
if(res=="Y")ans.push_back('0');
}
else{
if(res=="N")ans.push_back('0');
}
std::cout<<"! "<<ans<<std::endl;
return 0;
}
| 0
| 27,879,062
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n,k;
cin>>n>>k;
cout<<n-k+1;
}
|
#include<iostream>
#include<cstdio>
#include<vector>
#define INF 99999999999999999
#define ll long long
using namespace std;
struct edge
{
int from;
int to;
int cost;
};
const int MAX_N = 100;
const int MAX_M = 10000;
ll d[MAX_N][MAX_N];
edge es[MAX_M];
bool flag;
void shortest_path(int n,int m,int s)
{
int cnt = 0;
d[s][s] = 0;
while(true && cnt < n){
bool update = false;
for(int i=0;i<m;i++){
edge e = es[i];
if(d[s][e.from] != INF && d[s][e.to] > d[s][e.from] + e.cost){
d[s][e.to] = d[s][e.from] + e.cost;
update = true;
}
}
if(!update) break;
cnt++;
}
if(cnt == n){
flag = true;
}
}
int main()
{
int i,n,m,s;
cin >> n;
cin >> m;
for(int i=0;i<m;i++){
scanf("%d",&es[i].from);
scanf("%d",&es[i].to);
scanf("%d",&es[i].cost);
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
d[i][j] = INF;
}
}
flag = false;
for(int i=0;i<n;i++){
shortest_path(n,m,i);
if(flag){
break;
}
}
if(!flag){
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++){
if(d[i][j] == INF){
cout << "INF ";
}else{
cout << d[i][j] << " ";
}
}
if(d[i][n-1] == INF){
cout << "INF";
}else{
cout << d[i][n-1];
}
cout << "\n";
}
}else{
cout << "NEGATIVE CYCLE\n";
}
}
| 0
| 34,506,565
|
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <map>
#define INFTY (1<<30)
#define MAX 100000000
using namespace std;
int lcs(string x, string y) {
int m = x.size(), n = y.size();
int c[1000+1][1000+1];
x = ' ' + x; y = ' ' + y;
for( int i = 0; i <= m; i++) c[i][0] = 0;
for( int j = 0; j <= n; j++) c[0][j] = 0;
for( int i = 1; i <= m; i++) {
for( int j = 1; j <= n; j++) {
if(x[i] == y[j]) c[i][j] = c[i-1][j-1] + 1;
else if(c[i-1][j] >= c[i][j-1]) c[i][j] = c[i-1][j];
else c[i][j] = c[i][j-1];
}
}
return c[m][n];
}
int main(){
int q;
cin >> q;
for( int i = 0; i < q; i++) {
string s, t;
cin >> s >> t;
cout << lcs(s, t) <<endl;
}
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1e9 + 7) };
const int inf{ 2100000000 };
typedef long long ll;
using namespace std;
int main(void) {
int N, K; cin >> N >> K;
vector<int> H(N); rep(i, N)cin >> H[i];
sort(H.begin(),H.end(), greater<int>());
ll ans = 0;
for (int i = K; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
return 0;
}
| 0
| 55,850,473
|
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mod 1000000007
#define mod1 1000000009
#define hell 998244353
#define inf 1000000000000000000LL
#define pi 3.14159265358979323
const int N=200005;
using namespace std;
ll n,k,sum,q,res,m,val,ans;
ll x,y;
ll xx[]={1,0,-1,0};
ll yy[]={0,1,0,-1};
ll cnt[1000005];
void solve()
{
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>x>>y;
cnt[x]+=y;
}
ans=k;
for(int i=1;i<1000005;i++)
{
ans-=cnt[i];
if(ans<=0) {cout<<i<<"\n";return;}
}
}
int main()
{ ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll t=1;
for(ll i=1;i<=t;i++)
solve();
}
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
inline int mul (int a, int b, int m = MOD) {
return ((ll)a * b) % m;
}
inline int binpow (int a, int n, int m = MOD) {
int ans = 1;
for (; n; n >>= 1) {
if (n & 1) ans = mul(ans, a, m);
a = mul(a, a, m);
}
return ans;
}
inline void add (int &a, int x, int m = MOD) {
a += x;
if (a >= m) a -= m;
if (a < 0) a += m;
}
inline int sum (int a, int b, int m = MOD) {
a += b;
if (a >= m) a -= m;
if (a < 0) a += m;
return a;
}
inline int inv (int x, int m = MOD) {
return binpow(x, m - 2, m);
}
vector <int> f, fi;
inline void precalc_f (int n, int m = MOD) {
f.resize(n);
fi.resize(n);
f[0] = 1;
for (int i = 1; i < n; i++) {
f[i] = mul(f[i - 1], i, m);
}
fi[n - 1] = inv(f[n - 1], m);
for (int i = n - 2; i >= 0; i--) {
fi[i] = mul(fi[i + 1], i + 1, m);
}
}
inline int A (int n, int k, int m = MOD) {
return mul(f[n], fi[n - k], m);
}
inline int C (int n, int k, int m = MOD) {
return mul(A(n, k), fi[k], m);
}
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x, y;
cin >> x >> y;
precalc_f(x + y + 1);
int ans = 0;
for (int m = 1; m <= min(x, y); m++) {
int X = x - m;
int Y = y - m;
if (X + Y == m) {
add(ans, C(m, X));
}
}
cout << ans << '\n';
}
| 0
| 87,595,771
|
#include <bits/stdc++.h>
using namespace std;
#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define DEBUG_ENDL_S(S) ((S).size() ? "\n" : "") << flush;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename Head, typename... Tail> const Head& var_min(const Head &head, const Tail&... tail) { return min(head, var_min(tail...)); }
template <typename Head, typename... Tail> const Head& var_max(const Head &head, const Tail&... tail) { return max(head, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
void debug_func_preffix(const string &s) { if(s.size()) cout << s << " = "; }
template <typename T>
void debug_func(const T &t, const string &s = "") {
debug_func_preffix(s);
cout << t << DEBUG_ENDL_S(s);
}
template <typename T, typename U>
void debug_func(const P<T, U> &p, const string &s = "") {
debug_func_preffix(s);
cout << "(";
debug_func(p.first);
cout << ", ";
debug_func(p.second);
cout << ")" << DEBUG_ENDL_S(s);
}
template <typename T>
void debug_func(const V<T> &v, const string &s = "") {
for(ll i = 0; i < v.size(); i++) {
string t = s + "[" + to_string(i) + "]";
debug_func(v[i], t);
}
}
void init_io() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
ll N;
string S;
bool check(ll idx, const V<char> &lis) {
ll pre = (idx - 1 + N) % N;
ll nxt = (idx + 1) % N;
return lis[idx] == 'S' ? (S[idx] == 'o' ? lis[pre] == lis[nxt] : lis[pre] != lis[nxt])
: (S[idx] == 'o' ? lis[pre] != lis[nxt] : lis[pre] == lis[nxt]);
}
bool check_list(ll idx, V<char> &result) {
if(idx == N) return check(N - 1, result) && check(0, result);
result[idx] = 'S';
if(check(idx - 1, result)) {
return check_list(idx + 1, result);
} else {
result[idx] = 'W';
return check_list(idx + 1, result);
}
}
int main() {
init_io();
cin >> N >> S;
for(ll i = 0; i <= 1; i++) {
for(ll j = 0; j <= 1; j++) {
V<char> result(N);
result[0] = (i == 0 ? 'S' : 'W');
result[1] = (j == 0 ? 'S' : 'W');
if(check_list(2, result)) {
for(char c : result) cout << c;
cout << endl;
return 0;
}
}
}
cout << -1 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int row = 9;
int col = 9;
for (size_t i = 1; i <= row; i++)
{
for (size_t j = 1; j <= col; j++)
{
cout << i << "x" << j << "=" << i*j << endl;
}
}
return 0;
}
| 0
| 89,468,622
|
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358
typedef long long ll;
typedef long double ld;
int main() {
int n, m, x, ans = 1000000000, i, j;
cin >> n >> m >> x;
vector<vector<int>> set(n, vector<int>(m));
vector<int> skills(m), cost(m);
for(i = 0; i < n; i++) {
cin >> cost[i];
for(j = 0; j < m ; j++) {
cin >> set[i][j];
skills[j] = 0;
}
}
int se = 1 << n;
int t = 0;
for(int mask = 0; mask < se; mask++) {
t = 0;
for(i = 0; i < n; i++) {
if((mask >> i)&1) {
t += cost[i];
for(j = 0; j < m; j++) {
skills[j] += set[i][j];
}
}
}
bool ok = true;
for(j = 0; j < m; j++) {
if(skills[j] < x) {
ok = false;
}
skills[j] = 0;
}
if(ok) {
ans = min(ans, t);
}
}
if(ans == 1000000000) {
cout << -1 << "\n";
} else cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
std::vector< int > A(N);
for(int i=0; i<N; i++){
std::cin >> A[i];
}
std::vector< bool > b(N, false);
std::vector< bool > s(N, false);
int best = 1e9;
bool up = false;
for(int i=0; i<N; i++){
if(!up && best > A[i]){
best = A[i];
}else if(!up && best < A[i]){
b[i-1] = true;
up = true;
best = A[i];
}else if(up && best < A[i]){
best = A[i];
}else if(up && best > A[i]){
s[i-1] = true;
up = false;
best = A[i];
}
}
if(up){
s[N-1] = true;
}
int buy;
long long money = 1000;
for(int i=0; i<N; i++){
if(b[i]){
buy = A[i];
}else if(s[i]){
money = (money / buy) * A[i] + (money % buy);
}
}
std::cout << money << std::endl;
return 0;
}
| 0
| 76,002,474
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t a, b, c, k, sum = 0;
cin >> a >> b >> c >> k;
if (a >= k )sum = k;
else if (a + b >= k)sum = a;
else{
sum = a - (k - a - b);
}
cout << sum << '\n';
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
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 PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()
class Heap {
vector<int> v;
int getParentIndex(int index);
int getLeftChildIndex(int index);
int getRightChildIndex(int index);
void exchange(int i, int j);
bool isSmallerThanParent(int index);
bool isBiggerThanLeftChild(int index);
bool isBiggerThanRightChild(int index);
int getBiggerChildIndex(int index);
public:
void push(int n);
int getMax();
void eraseMax();
};
int Heap::getBiggerChildIndex(int index) {
int leftIndex = getLeftChildIndex(index);
int rightIndex = getRightChildIndex(index);
if (isBiggerThanLeftChild(index)) {
return rightIndex;
}
if (isBiggerThanRightChild(index)) {
return leftIndex;
}
if (v[getLeftChildIndex(index)] > v[getRightChildIndex(index)]) {
return leftIndex;
}else {
return rightIndex;
}
}
bool Heap::isBiggerThanLeftChild(int index) {
int leftIndex = getLeftChildIndex(index);
if (leftIndex == -1) return true;
else {
if (v[leftIndex] < v[index]) return true;
else return false;
}
}
bool Heap::isBiggerThanRightChild(int index) {
int rightIndex = getRightChildIndex(index);
if (rightIndex == -1) return true;
else {
if (v[rightIndex] < v[index]) return true;
else return false;
}
}
bool Heap::isSmallerThanParent(int index) {
int parentIndex = getParentIndex(index);
if (parentIndex == -1) return true;
else {
if (v[parentIndex] >= v[index]) return true;
else return false;
}
}
int Heap::getParentIndex(int index) {
return (index-1)/2;
}
int Heap::getLeftChildIndex(int index) {
int a = index*2+1;
if (a >= v.size()) {
return -1;
}else {
return a;
}
}
int Heap::getRightChildIndex(int index) {
int a = index*2+2;
if (a >= v.size()) {
return -1;
}else {
return a;
}
}
void Heap::exchange(int i, int j) {
iter_swap(v.begin() + i, v.begin() + j);
}
void Heap::push(int n) {
v.push_back(n);
int nindex = v.size()-1;
int parentIndex = getParentIndex(nindex);
while (!isSmallerThanParent(nindex)) {
exchange(nindex, parentIndex);
nindex = parentIndex;
parentIndex = getParentIndex(nindex);
}
}
int Heap::getMax() {
return v[0];
}
void Heap::eraseMax() {
exchange(0, v.size()-1);
v.pop_back();
int nindex = 0;
while (!(isBiggerThanLeftChild(nindex) && isBiggerThanRightChild(nindex))) {
int biggerChildIndex = getBiggerChildIndex(nindex);
exchange(nindex, biggerChildIndex);
nindex = biggerChildIndex;
}
}
int main() {
string s;
Heap heap;
while(cin >> s) {
if (s[0] == 'i') {
int k;
cin >> k;
heap.push(k);
}else if (s[1] == 'x') {
cout << heap.getMax() << endl;
heap.eraseMax();
}else {
break;
}
}
return 0;
}
| 0
| 30,416,119
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
vector<int> B(N + 10, 0);
for (int i = 0; i < N; i++) B.at(A.at(i))++;
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
int ans = 0;
for (int i = 0; i < N + 10; i++){
if (B.at(i) == 0){
cout << ans << endl;
break;
}
else if (i < K) continue;
else ans += B.at(i);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Combination {
int mod;
vector<int> fact;
vector<int> invf;
vector<vector<int> > part;
Combination(int sz, int mod) : fact(sz+1), invf(sz+1), mod(mod) {
fact[0] = 1;
for ( int i = 1; i < (int)fact.size(); i++ ) {
fact[i] = fact[i-1]*i%mod;
}
invf[sz] = inv(fact[sz]);
for ( int i = sz-1; i >= 0; i-- ) {
invf[i] = invf[i+1]*(i+1)%mod;
}
}
int pow(int x, int n) const {
int ret = 1;
while ( n > 0 ) {
if ( n & 1 ) (ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
int inv(int x) const {
return pow(x, mod - 2);
}
int P(int n, int r) const {
if ( r < 0 || n < r ) return (0);
return fact[n]*invf[n-r]%mod;
}
int C(int n, int r) const {
if ( r < 0 || n < r ) return (0);
return fact[n]*invf[r]%mod*invf[n-r]%mod;
}
int H(int n, int r) const {
if ( n < 0 || r < 0 ) return 0;
if ( n == 0 && r == 0 ) return 1;
return C(n+r-1, n);
}
int S(int n, int r) const {
int ret = 0;
for ( int i = 1; i <= r; i++ ) {
int add = C(r, i)*pow(i, n)%mod;
if ( (r-i)&1 ) ret += mod-add;
else ret += add;
ret %= mod;
}
(ret *= invf[r]) %= mod;
return ret;
}
int B(int n, int r) const {
int ret = 0;
for ( int i = 1; i <= r; i++ ) {
(ret += S(n, i)) %= mod;
}
return ret;
}
vector<vector<int> > built_part(int n, int r) {
part = vector<vector<int> >(n+1, vector<int>(r+1, 0));
part[0][0] = 1;
for ( int i = 0; i <= n; i++ ) {
for ( int j = 1; j <= r; j++ ) {
if ( i-j >= 0 ) {
(part[i][j] = part[i][j-1]+part[i-j][j]) %= mod;
} else {
part[i][j] = part[i][j-1];
}
}
}
return part;
}
};
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int N;
cin >> N;
int MOD = 1e9+7;
Combination comb(N+100, MOD);
vector<int> used(N+1, 0);
int l, r;
for ( int i = 0; i < N+1; i++ ) {
int a;
cin >> a;
if ( used[a] ) {
l = used[a]-1;
r = i;
} else {
used[a] = i+1;
}
}
int all = l+(N-r);
for ( int i = 1; i <= N+1; i++ ) {
int ans = comb.C(N+1, i) - comb.C(all, i-1);
cout << (ans+MOD) % MOD << endl;
}
return 0;
}
| 0
| 7,427,530
|
#include<iostream>
#include<fstream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<functional>
#include<array>
#include<set>
#include<map>
#include<climits>
#include<numeric>
#include<utility>
using namespace std;
#define pll pair<ll,ll>
#define pcl pair<char,ll>
#define psl pair<string, ll>
#define pls pair<ll,string>
#define plc pair<ll, char>
#define mll map<ll,ll>
#define msl map<string, ll>
#define mls map<ll, string>
#define mlb map<ll,bool>
#define msb map<string,bool>
#define mcl map<char, ll>
#define vl vector<ll>
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define IT_ ::iterator
#define F first
#define S second
#define M_P(x, y) make_pair(x, y)
#define PB(v,x) v.push_back(x)
#define PP(x) push(x)
#define RSZ(a , n) a.resize(n)
#define POB pop_back()
#define P_ pop()
#define CL_ clear()
#define LEN(s,cst) (cst)s.length()
#define SZ(s, a) (ll)s.size()
#define CNT(x) count(x)
#define FF first.first
#define FS first.second
#define SF second.first
#define SS second.second
#define B_ begin()
#define E_ end()
#define F_ front()
#define t_ top()
#define IN(s, a) s.insert(a)
#define ER_ erase
#define GT(x) getline(cin , x)
#define NL_ "\n"
#define SP_ " "
#define R_0 return 0
#define R_ return
#define ul unsigned long long int
#define ll long long int
#define TEST ll test; cin >> test; while(test--)
#define lcm(a, b) (a/__gcd(a,b))*b
#define INT(dp, v) memset(dp,v, sizeof(dp))
#define all(v) v.B_,v.E_
#define rall(v) v.rbegin(),v.rend()
#define fr(i ,a, n) for( ll i = a; i <= n; i++)
#define fe(x, n) for( ll i = x; i <= n; i++)
#define fa(x,a) for(auto &x : a)
#define mod(a) a%1000000007
#define pi acos(-1)
int main()
{
FAST;
ll x, a, b;
cin >> x >> a>> b;
if(a>=b) cout << "delicious";
else if(b-a <= x) cout << "safe";
else cout << "dangerous";
R_0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
string s[55];
int cnt[55][26];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i=0;i<n;i++){
cin >> s[i];
for(int j=0;j<s[i].length();j++){
cnt[i][s[i][j]-'a']++;
}
}
for(int i=0;i<26;i++){
int mn = 1e9;
for(int j=0;j<n;j++){
mn = min(mn, cnt[j][i]);
}
for(int j=0;j<mn;j++) printf("%c", i+'a');
}
}
| 0
| 79,861,272
|
#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9;
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
Int check(vector<vector<Int> > G, Int root,Int d){
function<Int(Int,Int,Int)> dfs = [&](Int pos,Int pre,Int dis){
Int res = dis;
for(Int to:G[pos]){
if(to == pre) continue;
res += dfs(to, pos, dis+1);
}
return res;
};
return dfs(root, -1, 0) == d;
}
signed main(){
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int n;
cin>>n;
vector<P> D(n);
map<Int,Int> num;
for(Int i=0;i<n;i++){
Int d;
cin>>d;
D[i] = P(d, i);
num[d] = i;
}
sort(D.begin(), D.end(), greater<P>());
vector<Int> sz(n, 1);
vector<vector<Int> > G(n);
auto add_edge = [&](Int a,Int b){
G[a].push_back(b);
G[b].push_back(a);
};
for(Int i=0;i<n-1;i++){
Int d, pos; tie(d, pos) = D[i];
Int x = sz[pos];
Int nd = d + x - (n - x);
if(!num.count(nd)){
cout<<-1<<endl;
return 0;
}
Int to = num[nd];
if(d <= nd){
cout<<-1<<endl;
return 0;
}
add_edge(pos, to);
sz[to] += sz[pos];
}
if(!check(G, D[n-1].second, D[n-1].first)){
cout<<-1<<endl;
return 0;
}
for(Int i=0;i<n;i++)
for(Int to:G[i]){
if(i > to) continue;
cout<<i+1<<" "<<to+1<<endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, h, maxA = 1;
cin >> n >> h;
int b[n];
for (int a, i = 0; cin >> a >> b[i]; ++i) {
maxA = max(maxA, a);
}
sort(b, b + n);
for (int i = 0; i < n; ++i) {
if (b[i] >= maxA) {
int result = 0;
for (int j = n - 1; j >= i && h > 0; --j) {
h -= b[j];
++result;
}
if (h > 0) {
result += (h - 1) / maxA + 1;
}
cout << result;
break;
}
}
return 0;
}
| 0
| 69,014,737
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}
const ll mod=1e9+7;
const ll inf=1e17;
const int INF=1e9;
const double PI=acos(-1);
const double EPS=1e-10;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
int n;
string s;
cin>>n>>s;
vector<int> ans(n+1,0);
auto solve=[&](int x,int y){
rep(i,n+1) ans[i]=0;
ans[0]=x,ans[1]=y;
FOR(i,1,n){
if(s[i]=='o'){
if(ans[i]==1) ans[i+1]=ans[i-1];
else ans[i+1]=-ans[i-1];
}else{
if(ans[i]==1) ans[i+1]=-ans[i-1];
else ans[i+1]=ans[i-1];
}
}
if(ans[0]!=ans[n]) return false;
if(s[0]=='o'){
if(ans[0]==1) return ans[n-1]==ans[1];
else return ans[n-1]!=ans[1];
}else{
if(ans[0]==1) return ans[n-1]!=ans[1];
else return ans[n-1]==ans[1];
}
};
if(solve(-1,1)){
rep(i,n){
if(ans[i]==1) cout<<'S';
else cout<<'W';
}
cout<<endl;
}else if(solve(1,-1)){
rep(i,n){
if(ans[i]==1) cout<<'S';
else cout<<'W';
}
cout<<endl;
}else if(solve(1,1)){
rep(i,n){
if(ans[i]==1) cout<<'S';
else cout<<'W';
}
cout<<endl;
}else if(solve(-1,-1)){
rep(i,n){
if(ans[i]==1) cout<<'S';
else cout<<'W';
}
cout<<endl;
}else{
cout<<-1<<endl;
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector <int> n;
int t;
for(int i=0;i<4;i++){
cin>>t;
n.push_back(t);
}
sort(n.begin(),n.end());
if(n[0]==1&&n[1]==4&&n[2]==7&&n[3]==9){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
}
| 0
| 2,831,061
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>vec(N),dp(N);
for(int i=0; i<N; i++){
cin >> vec[i];
}
dp[0] = 0,dp[1] = abs(vec[1]-vec[0]);
for(int i=2; i<N; i++){
dp[i] = min(dp[i-2]+abs(vec[i]-vec[i-2]),dp[i-1]+abs(vec[i]-vec[i-1]));
}
cout << dp[N-1] << endl;
}
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const int MOD = 1e9 + 7;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i, n)cin >> a[i];
ll res = 0, m = 1;
rep(i, n){
if(a[i] == m)m = a[i] + 1;
else {
res += (a[i] / m);
if(a[i] % m == 0)res--;
}
if(m == 1)m++;
}
cout << res << endl;
}
| 0
| 26,834,758
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_N = 1e5;
int N;
int A[MAX_N];
void solve() {
int idx[MAX_N];
for (int i = 0; i < N; i++) {
idx[i] = i;
}
sort(idx, idx + N, [](int a, int b) { return A[a] < A[b]; });
sort(A, A + N);
int x = lower_bound(A, A + N, 0) - A;
x = max(min(x, N - 1), 1);
int ans = 0;
for (int i = 0; i < N; i++) {
ans += (i < x) ? -A[i] : A[i];
}
cout << ans << endl;
for (int i = x; i < N - 1; i++) {
cout << A[0] << " " << A[i] << endl;
A[0] -= A[i];
}
for (int i = 0; i < x; i++) {
cout << A[N - 1] << " " << A[i] << endl;
A[N - 1] -= A[i];
}
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define foreps(i, m, n) for(int i = m;i < n;i++)
# define ALL(x) (x).begin(), (x).end()
# define rall(x) (x).rbegin(), (x).rend()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
ll N; cin >> N;
map<ll, ll> mp;
rep(i, N) {
ll a; cin >> a;
mp[a]++;
}
ll ans = 0;
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
if (itr->first != itr->second) {
if (itr->first < itr->second) ans += abs(itr->first - itr->second);
else ans += itr->second;
}
}
cout << ans << endl;
}
| 0
| 28,879,536
|
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
int a, b, c, n;
string s;
int main()
{
cin>>n;
cout<<180*(n-2)<<endl;
}
|
#include <algorithm>
#include <deque>
#include <iostream>
#include <list>
#include <string>
int main(int argc, char const *argv[])
{
int n;
std::cin >> n;
std::string command;
int key;
std::deque<int> l;
for (int i = 0; i < n; i++) {
std::cin >> command;
if (command[0] == 'i') {
std::cin >> key;
l.push_front(key);
} else if (command.length() == 6) {
std::cin >> key;
std::deque<int>::iterator itr = find(l.begin(), l.end(), key);
if (itr != l.end()) l.erase(itr);
} else if (command[6] == 'F') {
l.pop_front();
} else if (command[6] == 'L') {
l.pop_back();
}
}
for (int i = 0; i < l.size() - 1; i++) {
std::cout << l[i] << " ";
}
std::cout << l.back() << std::endl;
return 0;
}
| 0
| 90,738,108
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i=0; i<(int)S.size(); i++) {
if (S[i]=='1') {
cout << '9';
}
else {
cout << '1';
}
}
cout << endl;
}
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
string s; cin >> s;
ll dec = 0;
ll x = 0;
ll res = 0;
ll bef = 0;
REP(i, s.size()) {
if (s[i] == '>') {
dec++;
if (x > 0) {
bef = x;
x = 0;
} else {
if (dec <= bef) {
res += dec - 1;
} else {
res += dec;
}
}
} else {
dec = 0;
x++;
res += x;
}
}
cout << res << endl;
return 0;
}
| 0
| 20,915,502
|
#include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main(){
char s;
while(1){
scanf("%c", &s);
if(islower(s) != 0){
s = toupper(s);
}else if(isupper(s) != 0){
s = tolower(s);
}
printf("%c", s);
if(s == '\n')break;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
struct UF {
vector<int> data;
UF(int size) : data(size, -1) { }
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
bool find(int x, int y) {
return root(x) == root(y);
}
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) {
return -data[root(x)];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,q;cin>>n>>q;
UF uf(n+1);
for(int i=0;i<q;i++){
int com,x,y;cin>>com>>x>>y;
if(com){
cout<<(uf.find(x,y) ? 1 : 0)<<endl;
}
else uf.unite(x,y);
}
}
| 0
| 7,550,674
|
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
int n;
double ax, ay, bx, by, cx, cy, dx, dy;
cin >> n;
for ( int i = 0; i < n; i++ )
{
cin >> ax >> ay >> bx >> by >> cx >> cy >> dx >> dy;
if ( ( by - ay ) / ( bx - ax ) == ( dy - cy ) / ( dx - cx ) )
{
cout << "YES";
}
else
{
cout << "NO";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, k;
cin >> n >> k;
cout << k * (ll)pow(k - 1, n - 1);
}
| 0
| 14,943,412
|
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define putr(a) rep(testIncrement,0,a.size()) {puts(a[testIncrement]);} cout << endl
#define putrr(a) rep(Incr1,0,a.size()) {rep(Incr2,0,a[Incr1].size()) {puts(a[Incr1][Incr2]);} cout<<endl;} cout<<endl;
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define PI (acos(-1))
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
SINT64 N; cin >> N;
map<SINT64,SINT64> mp;
rep(i,2,N+1) {
SINT64 buf = i;
SINT64 ct = 2;
while(1) {
if ((buf % ct) == 0) {
buf /= ct;
mp[ct]++;
} else {
ct++;
}
if (buf == 1) break;
}
}
SINT64 ans = 1;
SINT64 ct1 = 0;
SINT64 ct2 = 0;
SINT64 ct3 = 0;
SINT64 ct4 = 0;
SINT64 ct5 = 0;
for(auto it=mp.begin();it!=mp.end();it++) {
if (it->S >= 2) ct1++;
if (it->S >= 4) ct2++;
if (it->S >= 14) ct3++;
if (it->S >= 24) ct4++;
if (it->S >= 74) ct5++;
}
ans = MAX(0,(ct1-2)*(ct2-1)*(ct2)/2);
ans += MAX(0,(ct3)*(ct2-1));
ans += MAX(0,(ct4)*(ct1-1));
ans += MAX(0,ct5);
put(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a/gcd(a,b) * b;
}
ll func2(ll n){
ll res = 0;
while(n%2 == 0){
n /= 2;
res++;
}
return res;
}
ll zyou(ll a,ll b){
ll res = 1;
for(int i = 1;i<=b;i++){
res *= a;
}
return res;
}
using Graph = vector<vector<char>>;
ll calc(ll a, ll b, ll p){
if(b == 0) return 1;
else if(b%2 == 0){
ll d = calc(a,b/2,p);
return (d*d)%p;
}
else if(b%2 == 1){
return (a * calc(a,b-1,p))%p;
}
}
typedef pair<int,int> P;
bool is_prime(int n){
if(n == 1) return false;
for(int i = 2;i*i <= n;i++){
if(n%i == 0) return false;
}
return true;
}
int factorial(int a){
int res = 1;
while(a){
res *= a;
a--;
}
return res;
}
int main(){
int N;
cin >> N;
vector<int> A(N);
rep(i,N){
cin >> A[i];
}
sort(A.begin(),A.end());
int c = 1;
int even = 0;
int odd = 0;
int ans = 0;
A.push_back(-1);
rep(i,N){
if(A[i] == A[i+1]) c++;
else {
if(c%2 == 0){
even++;
c = 1;
}
else if(c%2 == 1) {
odd++;
c = 1;
}
}
}
if(even%2 == 0){
ans = even + odd;
}
else if(even%2 == 1){
ans = even + odd -1;
}
cout << ans << endl;
}
| 0
| 100,479,113
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int inf = 1000000000;
const int mod = 1000000007;
const double eps = 1e-9;
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1};
const bool key[26] = {
1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1
};
int main() {
string s;
while (cin >> s, s != "#") {
int ans = 0;
int num = s[0] - 'a';
bool pre = key[num];
REP(i, 1, s.size()) {
num = s[i] - 'a';
if (pre != key[num]) {
ans++;
pre = key[num];
}
}
cout << ans << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#define all(v) v.begin(),v.end()
#define SZ(x) (int)x.size()
#define endl "\n"
#define thunder ios::sync_with_stdio(false);cin.tie(0);cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#endif
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
int main()
{
thunder
auto start = chrono::high_resolution_clock::now();
int n,t;cin>>n>>t;
vector<ll>v(n+1);
for(auto &x:v)cin>>x;
v[n]=INT_MAX;
ll ans=0;
for(int i=0;i<n;++i)
{
if(v[i+1]-v[i]>=t)
{
ans+=ll(t);
}
else
{
ans+=ll(v[i+1]-v[i]);
}
}
cout<<ans<<endl;
auto end = chrono::high_resolution_clock::now();
double time_taken = chrono::duration_cast<chrono::nanoseconds>(end - start).count();
time_taken *= 1e-9;
debug(time_taken);
}
| 0
| 91,742,116
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
double a, b, x;
cin>>a>>b>>x;
double theta;
if(a*a*b<2*x) {
theta = atan(2*(a*a*b-x)/(a*a*a));
theta *= 180/PI;
}
else {
theta = atan(a*b*b/(2*x));
theta *= 180/PI;
}
cout<<setprecision(20)<<theta<<endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpii = vector<pll>;
int main(){
ll H, W;
cin >> H >> W;
vvl A(H, vl(W, 0));
string row;
queue<vl> que;
rep(i, H){
cin >> row;
rep(j, W){
if(row[j] == '#'){
A[i][j] = 1;
que.push({i, j});
}
}
}
ll cnt = 0;
vl frt, bck;
while(true){
bck = que.back();
while(true){
frt = que.front();
que.pop();
if((frt[0] > 0) && (A[frt[0] - 1][frt[1]] == 0)){
A[frt[0] - 1][frt[1]] = 1;
que.push({frt[0] - 1, frt[1]});
}
if((frt[0] < H - 1) && (A[frt[0] + 1][frt[1]] == 0)){
A[frt[0] + 1][frt[1]] = 1;
que.push({frt[0] + 1, frt[1]});
}
if((frt[1] > 0) && (A[frt[0]][frt[1] - 1] == 0)){
A[frt[0]][frt[1] - 1] = 1;
que.push({frt[0], frt[1] - 1});
}
if((frt[1] < W - 1) && (A[frt[0]][frt[1] + 1] == 0)){
A[frt[0]][frt[1] + 1] = 1;
que.push({frt[0], frt[1] + 1});
}
if((bck[0] == frt[0]) && (bck[1] == frt[1])) break;
}
if(que.empty()) break;
cnt++;
}
cout << cnt << endl;
return 0;
}
| 0
| 23,702,548
|
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
read(x);read(a...);
}
template<class t> inline void write(t x){
if(x<0) putchar('-'),write(-x);
else{if(x>9) write(x/10);putchar('0'+x%10);}
}
#define pii pair<int,int>
#define x first
#define y second
int n,res;
vector<int> a,b;
vector<pii> ans;
signed main(){
read(n);
for(int i=1,x;i<=n;i++) read(x),x>=0?a.push_back(x):b.push_back(-x);
sort(a.begin(),a.end(),greater<int>());
sort(b.begin(),b.end(),greater<int>());
if(b.empty()){
if(a.size()==2) res=a[0]-a[1],ans.emplace_back(a[0],a[1]);
else{
for(int i=1;i<a.size()-1;i++) ans.emplace_back(a[n-1],a[i]),a[n-1]-=a[i];
ans.emplace_back(a[0],a[n-1]);
res=a[0]-a[n-1];
}
write(res);
}
else if(a.empty()){
for(int i=0;i<n;i++) b[i]=-b[i];
for(int i=0;i<b.size()-1;i++) ans.emplace_back(b[n-1],b[i]),b[n-1]-=b[i];
write(b[n-1]);
}
else{
for(int i=1;i<a.size();i++){
ans.emplace_back(-b[0],a[i]);
b[0]+=a[i];
}
for(int i=0;i<b.size();i++){
ans.emplace_back(a[0],-b[i]);
a[0]+=b[i];
}
write(a[0]);
}
for(auto x:ans) printf("\n%d %d",x.x,x.y);
}
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
const ll mod = 1e9+7;
int main(){
ll n,k;
cin>>n>>k;
ll st = 0;
ll en = n;
ll sts = 0;
ll sen = 0;
ll ans = 1;
for(int i=1;i<=n;i++){
sts+=st;
sen+=en;
st++;
en--;
if(i>=k){
ans+=(sen-sts+1ll);
ans%=mod;
}
}
cout<<ans<<endl;
}
| 0
| 21,299,805
|
#include <bits/stdc++.h>
using namespace std;
signed main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
printf(abs(c-a)<=d || abs(c-b)<=d && abs(b-a)<=d?"Yes":"No");
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
const int INF = 1<<29;
typedef long long int ll;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n>>b)&1; }
inline void set_bit(int & n, int b) { n |= two(b); }
inline void unset_bit(int & n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) { int res = 0; while(n && ++res) n-=n&(-n); return res; }
template<class T> void chmax(T & a, const T & b) { a = max(a, b); }
template<class T> void chmin(T & a, const T & b) { a = min(a, b); }
const int MOD=1000000007;
bool isPowerOfTwo (ll x)
{
return x && (!(x&(x-1)));
}
bool isPrime(int n)
{
if (n <= 1) return false;
if (n <= 3) return true;
if (n%2 == 0 || n%3 == 0) return false;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return false;
return true;
}
int highestPowerof2(unsigned int n)
{
if (n < 1)
return 0;
int res = 1;
for (int i=0; i<8*sizeof(unsigned int); i++)
{
int curr = 1 << i;
if (curr > n)
break;
res = curr;
}
return res;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t=1;
while(t--)
{
int n,k;
cin>>n>>k;
cout<<k*binpow(k-1,n-1)<<"\n";
}
return 0;
}
| 0
| 89,000,946
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define frw(i, a, b) for(int i = a; i < b; i++)
#define fi first
#define se second
#define pb push_back
#define in insert
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(a) int(a.size())
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define vpii vector<pii>
#define vpiii vector<piii>
#define vpll vector<pll>
#define vplll vector<plll>
#define mo 1000000007
#define mems(a,x) memset(a,x,sizeof(a))
inline ll modpow(ll x,ll n){if(n==0)return 1;if(n==1)return(x%mo);ll u=(modpow(x,n/2));u=(u*u)%mo;if(n%2!=0)u=(u*x%mo)%mo;return u;}
inline ll modinv(ll x){return modpow(x,mo-2);}
inline ll madd(ll a, ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;if(a+b>=mo)return(a+b)%mo;return(a+b);}
inline ll msub(ll a, ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;return(((a-b)%mo+mo)%mo);}
inline ll mmul(ll a,ll b){ if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;if(a*b>=mo)return(a*b)%mo;return(a*b);}
inline ll mdiv(ll a,ll bb){if(a>=mo)a=a%mo;ll b=modinv(bb);if(b>=mo)b=b%mo;if(a*b>=mo)return(a*b)%mo;return(a*b);}
int main() {
ll l,q;
cin>>l>>q;
string s;
cin>>s;
ll j=0,k=0;
ll o[l+1];
ll z[l+1];
ll i=0;
while(i<l)
{
ll n=0;
while(s[i]=='1'&&i<l)
{
n++;
i++;
}
o[j]=n;
j++;
n=0;
while(s[i]=='0'&&i<l)
{
n++;
i++;
}
z[k]=n;
k++;
n=0;
}
ll sum=0;
ll
ans=0;
for(int i=0;i<k;i++)
{
if(i<q)
{
if(i==0)
sum+=o[i];
sum+=z[i];
if(i+1<j)
sum+=o[i+1];
ans=max(ans,sum);
}
else
{
sum+=z[i];
sum-=z[i-q];
if(i+1<j)
sum+=o[i+1];
sum-=o[i-q];
ans=max(ans,sum);
}
}
cout<<ans;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#define rep(i, n) for(i=0; i<n; i++)
using namespace std;
int main() {
int i, n;
cin >> n;
vector<int> b;
rep(i, n-1){
int x;
cin >> x;
b.push_back(x);
}
int sum = b[0];
for(i=1; i<n-1; i++){
sum += min(b[i], b[i-1]);
}
sum += b[n-2];
cout << sum << endl;
return 0;
}
| 0
| 7,148,732
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
ll ans =0;
for(int i=0;i<N;i++){
ans += i;
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
#include <cassert>
using namespace std;
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define PP(p) cout<<(p)<<" ";
#define INF 1e18
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int pic(int n,int d){
rep(i,d-1)n/=10;
return n%10;
}
unsigned GetDigit(unsigned num){
unsigned digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
signed main(){
queue<int> q;
int cnt = 0,k;
cin>>k;
for(int i = 1;i<10;i++)q.push(i);
int t;
while(true){
t = q.front();
q.pop();
int t1 = t%10;
if(t1!=0){
q.push(10*t+t1-1);
if(cnt==k)break;
}
q.push(10*t+t1);
cnt++;
if(cnt==k)break;
if(t1!=9){
q.push(10*t+t1+1);
if(cnt==k)break;
}
}
cout << t << endl;
}
| 0
| 95,537,803
|
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define rrepSE(i,s,e) for (int i = (s); i > (e); i--)
#define ssort(v) sort(v.begin(), v.end())
#define gsort(v) sort(v.rbegin(), v.rend())
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> 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; }
#define DEBUG_PRINT(var) std::cout << #var << " = " << var << "\n";
int main()
{
int n, m;
cin >> n >> m;
vector<pll> ab;
rep(i,n) {
ll ai, bi;
cin >> ai >> bi;
ab.emplace_back(ai, bi);
}
ssort(ab);
ll ans = 0, rem = m;
rep(i,n) {
ll buy = min(rem, ab[i].second);
ans += buy * ab[i].first;
rem -= buy;
if (rem <= 0) break;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define REP( i , nn ) for(int i = 0 ; i < (int) nn; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
string S;
cin >> S;
int ans1 = 0;
char next_color = '0';
REP(i, S.size()){
if( S[i] != next_color){
ans1++;
}
next_color = '0' + 1 - (next_color - '0');
}
next_color = '1';
int ans2 = 0;
REP(i, S.size()){
if( S[i] != next_color){
ans2++;
}
next_color = '0' + 1 - (next_color - '0');
}
cout << min(ans1, ans2) << "\n";
}
int main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
#ifdef DEBUG
int TEST_CASES = 2;
while(TEST_CASES--){
#endif
solve();
#ifdef DEBUG
}
#endif
return 0;
}
| 0
| 17,522,659
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
vector<int> v(3);
for(int i=0;i<n;i++){
int p;
cin>>p;
v[(p<=a)+(p<=b)]++;
}
cout<<*min_element(v.begin(),v.end())<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, H;
cin >> N >> H;
vector<int> a(N), b(N);
for (int i = 0; i < N; i++)
{
cin >> a.at(i) >> b.at(i);
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
int res = 0;
int i = 0;
while (i < N && a.at(0) < b.at(i))
{
int bi = b.at(i);
i++;
H -= bi;
res++;
if (H <= 0)
{
cout << res << endl;
return 0;
}
}
int a0 = a.at(0);
res += (H + a0 - 1) / a0;
cout << res << endl;
}
| 0
| 66,151,645
|
#include <iostream>
using namespace std;
int main(){
int x,y;
while (true) {
cin >> x >> y;
if(x==0 && y==0){
break;
}
for(int i=0;i<x;i++){
for(int j=0;j<y;j++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int keta(int a){
int count = 0;
while(a>0){
a /=10;
count++;
}
return count;
}
int main(void){
int n;
cin >> n;
int ans = 0;
for(int i=1;i<=n;i++){
if(keta(i)%2 == 1){
ans++;
}
}
cout << ans << endl;
}
| 0
| 13,080,583
|
#include <bits/stdc++.h>
using namespace std;
#define sz size
#define pb push_back
const int N = 1e5 + 123;
int n, m, sum, cnt[N];
int main() {
cin >> n >> m;
for(int i = 1; i <= m; ++i) {
int l, r;
cin >> l >> r;
cnt[l]++;
cnt[r]--;
}
for(int i = 1; i < n; ++i) {
sum += cnt[i];
if(sum % 2 != 0) {
cout << "NO";
return 0;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
int m,n;
for(int i=0;i<1000010;i++){
if(i*8/100==a&&i/10==b){
cout << i << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
}
| 0
| 3,873,089
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n;
cin >> n;
string s, t;
cin >> s >> t;
for (int len = min(s.size(), t.size()); ; --len) {
if (s.substr((int)s.size() - len, len) == t.substr(0, len)) {
cout << s.size() + t.size() - len << endl;
exit(0);
}
}
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<vector<ll>> matrix;
string g[305];
char ret[305][305];
void solve() {
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> g[i];
int ans = 0;
for(int plus = 0; plus < n; plus++) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
ret[i][(j+plus)%n] = g[i][j];
}
}
bool good = true;
for(int i = 0; i < n; i++) {
for(int j = 0; j < i; j++) {
if(ret[i][j] != ret[j][i]) {
good = false;
}
}
}
if(good) ans += n;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
}
| 0
| 33,106,705
|
#include <iostream>
using namespace std;
int main (){
int len;
int wh;
int area;
int output;
cin >> len;
cin >> wh;
area = len*len;
output = area - wh;
cout << output;
return 0;
}
|
#include <iostream>
using namespace std;
char dic[64][2]={""};
int main(){
int n,i,tail;
char s;
while(1){
tail=0;
cin>>n;
if(!n) return 0;
while(n--){
cin>>dic[tail][0];
cin>>dic[tail++][1];
}
cin>>n;
while(n--){
for(cin>>s,i=0;i<tail;i++) if(s == dic[i][0]){ cout<<dic[i][1]; break;}
if(i==tail) cout<<s;
}
cout<<endl;
}
}
| 0
| 54,193,996
|
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <unordered_map>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ln cout << endl;
#define vi vector<int>
#define vll vector<long long>
#define sortl(vec) sort(vec.begin(), vec.end());
#define sortr(vec) sort(vec.rbegin(), vec.rend());
#define forn(i, x, n) for(long long i = x; i < n; i++)
#define revn(i, n, x) for(long long i = n; i >= x; i--)
#define in(vec) for(auto &it : vec) cin >> it;
#define out(vec) for(auto &it : vec) cout << it << " "; ln
#define ll long long
#define pb emplace_back
#define mp make_pair
#define um unordered_map
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define sec second
#define pi 3.14159265359
#define o(x) cout << x << endl;
#define all(a) a.begin(), a.end()
#define CLOCK cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
using namespace std;
const ll Nfact = 200005;
const ll mod = 1000000007;
const ll Nseive = 1000005;
vector<bool> is_prime(Nseive, true);
void seive() {
is_prime[0] = is_prime[1] = false;
for (ll i = 2; i * i <= Nseive; i++) {
if (is_prime[i]) {
for (ll j = i * i; j <= Nseive; j += i)
is_prime[j] = false;
}
}
}
ll bSearch(ll l, ll r, ll x, vll arr) {
while (l <= r) {
ll m = l + (r - l) / 2;
if (arr[m] == x)
return m;
if (arr[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}
void primeFactors(ll n) {
while (n % 2 == 0) {
n = n / 2;
}
for (ll i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
n = n / i;
}
}
if (n > 2)
cout << n << " ";
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modulo(ll a, ll b) {
ll c = a % b;
return (c < 0) ? c + b : c;
}
ll mul(ll x, ll y) {
return (x * y) % mod;
}
ll inv(ll x) {
return power(x, mod - 2, mod);
}
ll divide(ll x, ll y)
{
return mul(x, inv(y));
}
ll fact[Nfact];
void precalc() {
fact[0] = 1;
for (ll i = 1; i < Nfact; i++)
fact[i] = mul(fact[i - 1], i);
}
ll nCr(ll n, ll k) {
if (n < k)
return 0;
return divide(fact[n], mul(fact[k], fact[n - k]));
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
fastio
ll t = 1;
while (t--) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vll vec(n + 1);
forn(i, 0, n) {
if (s[i] == '0')
vec[i] = 0;
else
vec[i] = 1;
}
vec[n] = 5;
ll fir = vec[0], start = 0;
vector<pll>ans;
forn(i, 1, n + 1) {
if (vec[i] == fir) {
continue;
}
else {
ans.push_back({(i - start), fir});
fir = vec[i];
start = i;
}
}
ll m = ans.size();
vll pre(m);
pre[0] = ans[0].f;
forn(i, 1, m) {
pre[i] = ans[i].f + pre[i - 1];
}
ll sum = 0, maxa = INT_MIN;
forn(i, 0, m) {
if (ans[i].sec == 1) {
sum = pre[min(m - 1, i + 2 * k)] - (i == 0 ? 0 : pre[i - 1]);
}
else {
sum = pre[min(m - 1, i + 2 * k - 1)] - (i == 0 ? 0 : pre[i - 1]);
}
maxa = max(maxa, sum);
}
o(maxa)
}
CLOCK
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1000000009;
const ll LINF = 1e18;
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
int main() {
long long N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
}
long long ans = 0;
const auto &res = prime_factorize(N);
for (auto p : res) {
long long x = p.second;
long long b = 1;
while(b <= x) {
x -= b;
b++;
++ans;
}
}
cout << ans << endl;
}
| 0
| 87,096,090
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k, r, s, p; cin >> n >> k >> r >> s >> p;
string t; cin >> t;
vector<char> result(n, 'e');
int ans = 0;
for (int i = 0; i < t.size(); i++) {
if (i <= k - 1) {
if (t[i] == 'r') {
ans += p;
result[i] = 'p';
}
if (t[i] == 's') {
ans += r;
result[i] = 'r';
}
if (t[i] == 'p') {
ans += s;
result[i] = 's';
}
}
else {
if (t[i] == t[i - k]) {
if (t[i] == 'r') {
if (result[i - k] == 'p') {}
else {
ans += p;
result[i] = 'p';
}
}
else if (t[i] == 's') {
if (result[i - k] == 'r') {}
else {
ans += r;
result[i] = 'r';
}
}
else if (t[i] == 'p') {
if (result[i - k] == 's') {}
else {
ans += s;
result[i] = 's';
}
}
}
else {
if (t[i] == 'r') {
ans += p;
result[i] = 'p';
}
if (t[i] == 's') {
ans += r;
result[i] = 'r';
}
if (t[i] == 'p') {
ans += s;
result[i] = 's';
}
}
}
}
cout << ans << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, m, R;
cin >> n >> m >> R;
vi r(R);
rep(i, R) {
cin >> r[i];
--r[i];
}
sort(r.begin(), r.end());
vector<vector<pair<int, int> > > G(n);
rep(i, m) {
int a, b, c;
cin >> a >> b >> c;
--a;
--b;
G[a].push_back(make_pair(b, c));
G[b].push_back(make_pair(a, c));
}
vector<vector<int> > Gr(R, vi(R));
rep(i, R) {
queue<int> Q;
Q.push(r[i]);
vi dis(n, INT_MAX);
dis[r[i]] = 0;
while(!Q.empty()) {
int now = Q.front();
Q.pop();
for(auto next:G[now]){
if(dis[next.first] != INT_MAX) {
if(dis[next.first] > dis[now] + next.second) {
Q.push(next.first);
dis[next.first] = dis[now] + next.second;
} else if(dis[next.first] + next.second < dis[now]) {
dis[now] = dis[next.first] +next.second;
Q.push(now);
break;
} else {
continue;
}
}
dis[next.first] = dis[now] + next.second;
Q.push(next.first);
}
}
rep(j, R) {
Gr[i][j] = dis[r[j]];
}
}
int ans = INT_MAX;
vi vec(R);
rep(i, R) {
vec[i] = i;
}
do{
int d=0;
rep(i, R-1) {
d += Gr[vec[i]][vec[i+1]];
}
ans = min(ans, d);
} while(next_permutation(vec.begin(), vec.end()));
cout << ans << endl;
}
| 0
| 78,720,639
|
#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
using namespace std;
int main()
{
int h,w;
while(cin>>h>>w)
{
if(w==0)return 0;
REP(i,h)
{
REP(j,w)cout<<"#";
cout<<endl;
}
cout<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
int mod=1e9+7;
int po(int x,int y,int m) { if (y==0) return 1; int t=po(x,y/2,m)%m; t=(t*t)%m; if (y&1) return (t*x)%m; return t%m; }
const int mx=1000001;
vector<bool> prim(mx,true);
void seive(){
for (int p = 2;p*p<=1000001;p++) {
if (prim[p]==true)
for (int i=p * p;i<=1000001;i += p)
prim[i] = false;
}
}
int div(int n)
{
int total = 1;
for (int p = 2; p <= n; p++) {
if (prim[p]) {
int count = 0;
if (n%p==0) {
while (n%p == 0) {
n=n/p;
count++;
}
total *= (count + 1);
}
}
}
return total;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n;
cin>>n;
seive();
int ans=0;
for (int i=1;i<n;++i){
ans+=floor(n-1)/i;
}
cout<<ans<<endl;
return 0;
}
| 0
| 38,186,500
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x = n;
int sum = 0;
for (int i = 0; i < 9; i++){
sum += x % 10;
x /= 10;
}
if (n % sum == 0){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
ll n,a,t[100005]={},ans[2]={},r=0,k;
cin>>n;
map<ll,ll>m;
for(ll i=0;i<n;i++)
{
cin>>a;
m[a]++;
}
vector<ll>v;
for(auto i=m.begin();i!=m.end();i++)
{
ll s=i->second;
if(s>=4)r=i->first;
if(s>=2)v.push_back(i->first);
}
if(v.size()<2)k=0;
else k=v[v.size()-1]*v[v.size()-2];
cout<<max(r*r,k)<<endl;
return 0;
}
| 0
| 86,442,885
|
#include <iostream>
#include <stdio.h>
#include <string>
#include <cctype>
using namespace std;
int main() {
char c;
int numbers[26] = {0};
int num;
while (cin >> c) {
if (isupper(c)) c = tolower(c);
num = c - 'a';
numbers[num]++;
}
for (int i = 0; i < 26; i++) {
printf("%c : ", i+97);
cout << numbers[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define all(x) (x).begin(),(x).end()
ll t1,t2,t3;
const ll mod = 1000000007;
const int INF = 1e9;
const ll INFLONG = 1e18;
int main(){
ll n,k;
cin >> n >> k;
vector<ll> vec(k+1,0);
ll ans = 0;
for(ll i = k;i>0;i--){
ll mul = k / i;
ll t1 = n;
ll req = 1;
while(t1 != 0){
if(t1 & 1){
req *= mul;
req %= mod;
}
mul *= mul;
mul %= mod;
t1 = t1 >> 1;
}
t3 = req;
ll ward = i * 2;
while(ward <= k){
t3 -= vec[ward];
if(t3 < 0){
t3 += mod;
}
ward += i;
}
vec[i] = t3;
ans += t3 * i;
ans %= mod;
}
cout << ans << endl;
}
| 0
| 72,580,176
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <ctime>
#include <complex>
using namespace std;
#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;
int main(){
string s;
cin>>s;
s+="PPPPP";
if(s[0]=='Y'&&s[1]=='A'&&s[2]=='K'&&s[3]=='I'){
cout<<"Yes";
}else cout<<"No";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e+18;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
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...));
}
#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))
using vl=vector<ll>;
int main(){
ll N,K;
cin>>N>>K;
vl a(N);
ll sum=0;
REP(i,N){
cin>>a[i];
sum+=max(0LL,a[i]);
}
vl plus(N+1,0),minus(N+1,0);
REP(i,N){
plus[i+1]=plus[i]+max(0LL,a[i]);
minus[i+1]=minus[i]+max(0LL,-a[i]);
}
ll tmp=INF;
REP2(i,K,N+1){
tmp=min(tmp,minus[i]-minus[i-K]);
tmp=min(tmp,plus[i]-plus[i-K]);
}
sum-=tmp;
cout<<sum<<endl;
}
| 0
| 77,128,166
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << ' ' << H;
dbg_out(T...);
}
int main() {
#ifdef LOCAL
freopen("b.txt", "r", stdin);
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
ios::sync_with_stdio(0);
cin.tie(0);
#define endl '\n'
#define dbg(...) 18
#endif
int n, i;
string a, b;
double ans = 0, da, x;
cin >> n;
cout << fixed << setprecision(9);
while (n--) {
cin >> a >> b;
da = i = x = 0;
while (a[i] != '.' && i < SZ(a)) i++;
da = stoi(a.substr(0, i));
if (i != SZ(a)) {
x = stoi(a.substr(i + 1, SZ(a)));
da += (x / pow(10, SZ(a) - i - 1));
}
if (b == "BTC")
ans += (da * 380000);
else
ans += da;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
constexpr int MAX=2000000;
constexpr int INFTY=(1<<30);
int H, A[MAX+1];
int left(int i){ return i*2; }
int right(int i){ return i*2+1; }
int parent(int i){ return i/2; }
void maxHeapify(int i){
int l=left(i);
int r=right(i);
int largest;
if(l<=H && A[i]<A[l])
largest=l;
else
largest=i;
if(r<=H && A[largest]<A[r])
largest=r;
if(largest!=i){
swap(A[largest], A[i]);
maxHeapify(largest);
}
}
int extract(){
int maxv;
if(H<1) return -INFTY;
maxv=A[1];
A[1]=A[H--];
maxHeapify(1);
return maxv;
}
void IncreaseKey(int i, int key){
if(key<A[i]) return;
A[i]=key;
while(i>1 && A[parent(i)]<A[i]){
swap(A[i], A[parent(i)]);
i=parent(i);
}
}
void insert(int key){
H++;
A[H]=-INFTY;
IncreaseKey(H, key);
}
int main(){
int key;
string com;
while(true){
cin >> com;
if(com=="end") break;
if(com=="insert"){
cin >> key;
insert(key);
}
else
cout << extract() << endl;
}
}
| 0
| 29,255,337
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int ratea,rateb;
int p=0;
cin >> ratea ;
cin >> p ;
rateb = (p*2)-ratea;
cout << rateb << endl;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int N,M;
vi a;
ll match[9]={2,5,5,4,5,6,3,7,6};
bool stringMax(string &a,string b){
if(a == "LOWEST"){
a=b;
}else if(a.size() < b.size()){
a=b;
}else if(a.size() == b.size()){
if(a<b) a=b;
}else{
}
}
int main() {
cin >> N >> M;
rep(i,M){
ll x;
cin >> x;
a.push_back(x);
}
string dp[10010];
rep(i,10010){
dp[i] = "LOWEST";
}
dp[0]="";
rep(i,N){
if(dp[i] == "LOWEST") continue;
for(auto x:a){
stringMax(dp[i+match[x-1]],dp[i]+(char)('0'+x));
}
}
fin(dp[N]);
}
| 0
| 6,363,181
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int cnt[100100] = {};
for(int i = 0; i < n; i++) {
int a; cin >> a;
if(a > 0) cnt[a-1]++;
cnt[a]++;
cnt[a+1]++;
}
cout << *max_element(cnt, cnt + 100100) << endl;;
cout << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long) 1e9 + 7;
long factorials[500001];
int pre_factorials(int n){
factorials[0] = 1;
for (int i = 0; i < n; i++) {
factorials[i + 1] = (long)(i + 1) * factorials[i] % mod;
}
return 0;
}
long modpow(long a, long p){
if (p == 0) return 1;
if (p % 2 == 0) {
return modpow(a * a % mod, p / 2);
} else
return a * modpow(a, p - 1) % mod;
}
long comb(long a, long b){
long af = factorials[(int) a];
long bf = factorials[(int) b];
long abf = factorials[(int) (a - b)];
long res = af * modpow(bf, mod - 2) % mod * modpow(abf, mod - 2) % mod;
return res;
}
int main(){
long s, ans = 0;
cin >> s;
long t = s / 3;
pre_factorials(10000);
for(long i = 1; i <= t; i++){
ans += comb(s - 2 * i - 1, i - 1);
ans %= mod;
}
cout << ans << "\n";
return 0;
}
| 0
| 70,928,270
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++) {
scanf("%d",&a[i]);
}
int j = -1;
long long xor_sum = 0, sum = 0;
long long ret = 0;
for (int i = 0; i < n; i++) {
while (j + 1 < n && (xor_sum^a[j + 1]) == sum + a[j + 1]) {
xor_sum ^= a[j + 1];
sum += a[j + 1];
j++;
}
ret += j - i + 1;
xor_sum ^= a[i];
sum -= a[i];
}
cout << ret << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using Graph = std::vector<std::vector<int>>;
using WGraph = std::vector<std::vector<std::pair<int, long long>>>;
using ll = long long;
using namespace std;
int main() {
int n = 0, m = 0;
cin >> n >> m;
vector<int> a(m);
for (int i=0; i<m; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
vector<int> match = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> dp(n+1, -1e8);
dp.at(0) = 0;
for (int i=1; i<n+1; i++) {
for (int j=0; j<m; j++) {
int use = match.at(a.at(j));
if (i - use < 0) {
continue;
}
else {
dp.at(i) = max(dp.at(i), dp.at(i-use)+1);
}
}
}
vector<int> ret;
while (n > 0) {
for (int i=0; i<m; i++) {
int use = match.at(a.at(i));
if (n - use < 0) continue;
if (dp.at(n) == dp.at(n-use)+1) {
ret.push_back(a.at(i));
n -= use;
break;
}
}
}
for (int x : ret) {
cout << x;
}
cout << endl;
return 0;
}
| 0
| 25,750,603
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.