code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(b<a){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill((T*)array, (T*)(array+N), val);}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
class debug
{
public:
template<typename T> void vdeb(T vec);
template<typename T1, typename T2> void adeb(T1 *arr, T2 n);
template<typename T> void mdeb(T mp);
};
#endif //INCLUDE_DEBUG_HPP
template<typename T> void debug::vdeb(T vec)
{
cout << "#vector set debug" << endl;
for(auto vv : vec) cout << vv << " ";
cout << endl;
}
template<typename T1, typename T2> void debug::adeb(T1 *arr, T2 n)
{
cout << "#adebug" << endl;
for(int i=0; i<=n; i++) cout << arr[i] << " ";
cout << endl;
}
template<typename T> void debug::mdeb(T mp)
{
cout << "#map pair debug" << endl;
for(auto const& m : mp) cout << m.first sp m.second << endl;
}
debug dbg;
class AThumbnail {
public:
void solve(std::istream& in, std::ostream& out)
{
int n;
in >> n;
double sum = 0.0;
vector<int> a(n);
for(int i=0; i<n; i++){
in >> a[i];
sum += (double)a[i];
}
double ave = sum / (double)n;
int res = 0;
double mi = inf;
for(int i=0; i<n; i++){
double diff = abs(ave - (double)a[i]);
if(diff < mi){
mi = diff;
res = i;
}
}
out << res << endl;
}
};
int main() {
AThumbnail solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
using pint = pair<ll, ll>;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> out;
for (int i = 0; i < N; ++i) cin >> A[i];
sort(A.begin(), A.end());
ll cnt = 1;
for (int i = 0; i < N-1; i++) {
if (A[i] == A[i + 1]) {
cnt++;
}
else{
if(cnt/2==1){
out.push_back(A[i]);
}
else if(cnt/2>=2){
out.push_back(A[i]);
out.push_back(A[i]);
}
cnt = 1;
}
}
if (cnt / 2 == 1) {
out.push_back(A[A.size()-1]);
} else if (cnt / 2 >= 2) {
out.push_back(A[A.size()-1]);
out.push_back(A[A.size()-1]);
}
if (out.size() < 2)
cout << 0 << endl;
else
cout << out[out.size() - 1] * out[out.size() - 2] << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
// #include "ane.cpp"
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 100005;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
// comment to disable debug functions
#define DEBUG
// frequently used macros
#if __cplusplus >= 201103L
#define ALL(v) begin(v),end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end(v), (x))
#else
#define ALL(v) (v).begin(),(v).end()
#define SORT(v) sort(v.begin(), v.end())
#define FIND(v,x) find(v.begin(), v.end(), (x))
#endif
#define MEMNEXT(from, to) do{ memmove((to), (from), sizeof(from)); \
memset((from), 0, sizeof(from)); } while(0)
#ifdef DEBUG
#define DUMP(x) do{ std::cerr << (#x) << ": " << x << std::endl; }while(0)
#else
#define DUMP(x) do{}while(0)
#endif
// frequent used aliases
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> pl;
typedef pair<ll, ll> pll;
typedef vector<int> vec;
typedef vector<ll> vecll;
typedef vector<vec> mat;
typedef vector<vecll> matll;
// frequently used constants
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};
// frequently used structs
struct edge{
int to,cost;
};
// printf for debug
#ifndef DEBUG
void debug(const char* format, ...){}
#else
void debug(const char* format, ...){
va_list arg;
va_start(arg, format);
vprintf(format, arg);
va_end(arg);
}
#endif
// dump vector
#ifdef DEBUG
#define DUMPV(v, c) do{ \
printf("%s: ", #v); \
for (int i = 0; i < (c); ++i) \
{ \
cout << (v)[i] << " "; \
} \
cout << endl; \
} while(0)
#else
#define DUMPV(v,c)
#endif
// std::fill of multi dimensions
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
// binary search
ll BSearch(ll _begin, ll _end, bool (*f)(int)){
ll mid;
while(_end - _begin > 1LL) {
mid = (_begin + _end) / 2LL;
if(f(mid)) {
debug("BSearch: f(%d) == true\n", mid);
_end = mid;
}
else
{
debug("BSearch: f(%d) == false\n", mid);
_begin = mid;
}
}
return _end;
}
ll N,M,K,A,B,C,D;
int dp[NMAX] = {};
std::vector<edge> G[NMAX];
edge E[MMAX];
ll ans = 0;
void solve(){
// main algorithm
priority_queue<p, vector<p>, greater<p> > que;
set<int> st;
que.push(p{0, 0});
while(!que.empty()) {
ll cc = que.top().first;
int i = que.top().second;
que.pop();
if(st.count(i)) continue;
// cout << cc << " " << i << endl;
ans += cc;
st.insert(i);
for(auto&& e : G[i]) {
if(!st.count(e.to)) que.push(p(e.cost, e.to));
}
}
}
void debug(){
// output debug information
}
void answer(){
// output answer
printf("%lld\n", ans);
}
int main(int argc, char const *argv[])
{
// operate inputs
// Fill(dp, -1);
scanf("%lld%lld", &N,&M);
for (int i = 0; i < M; ++i)
{
int f,t,c;
scanf("%d%d%d", &f, &t, &c);
G[f].push_back(edge{t, c});
G[t].push_back(edge{f, c});
}
solve();
#ifdef DEBUG
debug();
#endif
answer();
return 0;
} | #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 1145141919
#define ll long long
//#define scanf scanf_s
int v, e;
struct edge{ int from, to, cost; };
edge ed[100001];
int par[10001];
bool comp(const edge& e1, const edge& e2)
{
return e1.cost < e2.cost;
}
int find(int x)
{
if (par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
par[x] = y;
}
bool same(int x, int y)
{
return (find(x) == find(y));
}
int main()
{
cin >> v >> e;
int a, b, c;
REP(i, e)
{
cin >> a >> b >> c;
ed[i] = { a, b, c };
}
sort(ed, ed + e, comp);
int sum = 0;
REP(i, 10001) par[i] = i;
REP(i, e)
{
if (!same(ed[i].from,ed[i].to))
{
unite(ed[i].from, ed[i].to);
sum += ed[i].cost;
}
}
cout << sum << endl;
return 0;
} | 1 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int l = (m+1)/2, r = m/2;
rep(i,l) cout << i+1 << " " << 2*l - i << endl;
rep(i,r) cout << 2*l + i+1 << " " << 2*(l+r) - i + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
int target = 0;
for (int i=0 ; i<n ; i++)
target += l + i;
int ans;
vector<int> pie(n);
for (int i=0 ; i<n ; i++){
for (int j=0 ; j<n ; j++){
if (i == j)
continue;
pie.at(i) += l + j;
}
if (i == 0)
ans = pie.at(i);
else{
if (abs(pie.at(i)-target) < abs(ans-target))
ans = pie.at(i);
}
}
cout << ans << endl;
} | 0 |
#include<iostream>
#include<string>
#include<array>
#include<algorithm>
#define MAX 50
using namespace std;
typedef struct {
string name;
double rate;
}hurvest;
bool cmp(const hurvest &a,const hurvest &b){
return a.rate > b.rate;
}
int main(){
array<hurvest,MAX> data;
int n,seed_cost,time_sum,time,value,F,S,M,D,E;
while(1){
cin >> n;
if(n==0){
break;
}
for(int i=0;i<n;i++){
cin >> data[i].name>>seed_cost;
time_sum=0;
for(int j=0;j<5;j++){
cin >> time;
if(j==3){
D=time;
}
if(j==4){
E=time;
}
time_sum+=time;
}
cin >> F >> S >> M;
value=F*S;
if(M!=1){
value*=M;
time_sum+=(E+D)*(M-1);
}
data[i].rate=(double)(value-seed_cost)/(double)time_sum;
}
sort(data.begin(),data.end()-(50-n),cmp);
bool change=true;
hurvest temp;
while(change){
change=false;
for(int i=0;i<n-1;i++){
if(data[i].rate==data[i+1].rate){
if(data[i].name>data[i+1].name){
temp=data[i];
data[i]=data[i+1];
data[i+1]=temp;
change=true;
}
}
}
}
for(int i=0;i<n;i++){
cout << data[i].name<<endl;
}
cout << '#' <<endl;
}
return 0;
}
| #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <ctime>
#include <cassert>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long>vll;
typedef pair<int,int> pi;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;
/*---------------------------------------------------*/
typedef pair<double,string> PDS;
bool my_greater(PDS a, PDS b){
if(a.first==b.first){
return (a.second > b.second);
}else{
return a.first < b.first;
}
}
void solve(int n){
vector<PDS> vp(n);
string L;
double P,A,B,C,D,E,F,S,M;
for(int i=0;i<n;i++){
cin>>L>>P>>A>>B>>C>>D>>E>>F>>S>>M;
double res=(F*S*M-P)/(A+B+C+(D+E)*M);
vp[i]=mp(res,L);
}
sort(all(vp),my_greater);
reverse(all(vp));
for(int i=0;i<n;i++){
cout<<vp[i].second<<endl;
}
}
int main(){
int n;
while(cin>>n,n){
solve(n);
cout<<"#"<<endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll a[110];
int main(){
ll n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
ll ans=0;
for(int i=0;i<=min(n,k);i++)for(int j=0;j<=min(n,k)-i;j++){
vector<ll>v;
ll sum=0;
for(int l=1;l<=n;l++){
if((1<=l&&l<=i)||(n+1-j<=l&&l<=n)){
sum+=a[l];
v.push_back(a[l]);
}
}
ll num=k-i-j;
//cout<<sum<<' '<<v.size()<<endl;
sort(v.begin(),v.end());
for(int l=0;l<min(num,(long long)v.size());l++){
if(v[l]>=0)break;
sum-=v[l];
}
//cout<<num<<' '<<sum<<endl;
ans=max(ans,sum);
}
cout<<ans;
return 0;
}
| #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
//ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
////Read:
//Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),
int n,c,dp[55][55][55][55];
vi v;
int f(int i,int cnt,int mxgap,int lst){
if(i==n){
mxgap=max(mxgap,i-lst-1);
if(cnt+(n-cnt-mxgap)*2<=c)return 0;
return -INF;
}
int &ans=dp[i][cnt][mxgap][lst+1];
if(ans!=-INF)return ans;
ans=v[i]+f(i+1,cnt+1,max(mxgap,i-lst-1),i);
ans=max(ans,f(i+1,cnt,mxgap,lst));
return ans;
}
signed main(){
FASTER;
cin>>n>>c;
v=vi(n);cin>>v;
for(int i=0;i<55;i++){
for(int j=0;j<55;j++){
for(int k=0;k<55;k++){
for(int l=0;l<55;l++){
dp[i][j][k][l]=-INF;
}
}
}
}
cout<<f(0,0,0,-1);
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
void addWordCount(const vector<string>& cards, unordered_map<string, int>& wordCount);
void subWordCount(const vector<string>& cards, unordered_map<string, int>& wordCount);
int main() {
int numOfBlueCard = 0;
cin >> numOfBlueCard;
vector<string> blueCards;
for (int i = 0; i < numOfBlueCard; ++i) {
string blueCard;
cin >> blueCard;
blueCards.push_back(blueCard);
}
int numOfRedCard = 0;
cin >> numOfRedCard;
vector<string> redCards;
for (int i = 0; i < numOfRedCard; ++i) {
string redCard;
cin >> redCard;
redCards.push_back(redCard);
}
unordered_map<string, int> wordCount;
addWordCount(blueCards, wordCount);
subWordCount(redCards, wordCount);
unordered_map<string, int>::iterator maxValueWord = std::max_element(wordCount.begin(), wordCount.end(),
[](const pair<string, int>& p1, const pair<string, int>& p2) {
return p1.second < p2.second; });
int maxValue = maxValueWord->second;
if (maxValueWord->second < 0) {
maxValue = 0;
}
cout << maxValue << endl;
}
void addWordCount(const vector<string>& cards, unordered_map<string, int>& wordCount) {
for (string card : cards) {
++wordCount[card];
}
}
void subWordCount(const vector<string>& cards, unordered_map<string, int>& wordCount) {
for (string card : cards) {
--wordCount[card];
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, point = 0, max = 0;
cin >> N;
vector<string> blue(N);
set<string> ch;
for (int i = 0; i < N; ++i)
{
cin >> blue.at(i);
ch.insert(blue.at(i));
}
cin >> M;
vector<string> red(M);
for (int i = 0; i < M; ++i)
{
cin >> red.at(i);
ch.insert(red.at(i));
}
for (auto x : ch)
{
point = 0; //重要
for (int i = 0; i < N; ++i)
{
if (blue.at(i) == x)
{
++point;
}
}
for (int i = 0; i < M; ++i)
{
if (red.at(i) == x)
{
--point;
}
}
max = max < point ? point : max;
}
cout << max << endl;
} | 1 |
#include <iostream>
#include <climits>
using namespace std;
int main() {
int n; cin >> n;
int N[n], n_min = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> N[i];
if (N[i] < n_min) n_min = N[i];
}
for (int j = 1; j <= n_min; j++) {
bool div_all = true;
for (int i = 0; i < n; i++) if (N[i] % j != 0) div_all = false;
if (div_all == true) cout << j << endl;
}
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 1e9+7;
ll add(ll a,ll b)
{
a%=MOD; b%=MOD;
a+=b;a%=MOD;
if(a<0) a+=MOD;
return a;
}
ll mult(ll a, ll b)
{
a%=MOD; b%=MOD;
ll ans=(a*b)%MOD;
if(ans<0) ans+=MOD;
return ans;
}
ll pw(ll a, ll b)
{
ll r=1;
while(b){
if(b&1) r=mult(r,a);
a=mult(a,a);
b>>=1;
}
return r;
}
ll inverse(ll a)
{
return pw(a,MOD-2);
}
const int MAXN = 100005;
void NO(){ cout<<0<<'\n'; exit(0); }
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin>>n;
int a[n];
forn(i,0,n) cin>>a[i];
int c[3]{};
ll ans=1;
forn(i,0,n){
int cnt=0;
forn(j,0,3){
if(a[i]==c[j]) cnt++;
}
ans=mult(ans,cnt);
forn(j,0,3){
if(a[i]==c[j]){ c[j]++; break; }
}
}
cout<<ans<<'\n';
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll A, B, C, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
#define all(x) begin((x)), end((x))
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
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(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long double n,m,d;
cin>>n>>m>>d;
long double ans = (n-d) * 2 * (m-1) / (n*n);
if (d==0) {
ans = (m-1) / n;
}
printf("%.10Lf\n", ans);
return 0;
}
| 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#define all(c) (c).begin(),(c).end()
using namespace std;
int mergecount(vector<int> &a) {
int count=0,n=a.size();
if (n>1){
vector<int>b(a.begin(),a.begin()+n/2);
vector<int>c(a.begin()+n/2,a.end());
count+=mergecount(b);
count+=mergecount(c);
for (int i=0,j=0,k=0;i<n;i++)
if (k == c.size())a[i]=b[j++];
else if (j == b.size())a[i]=c[k++];
else if (b[j]<=c[k])a[i]=b[j++];
else a[i]=c[k++],count+=n/2-j;
}
return count;
}
int main(void){
int n;
cin >> n;
vector<int>v(n);
for(int i=0;i<n;i++)cin >> v[i];
int cnt=mergecount(v);
sort(all(v));
for(int i=0;i<n;i++)cout << v[i] << (i<n-1?" ":"\n");
cout << cnt << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
namespace {
// BubbleSort sorts the array |a| in ascending order, and then returns
// the number of swap operations.
int BubbleSort(int* a, int n) {
int nswap = 0;
bool flag = true;
while (flag) {
flag = false;
for (int j = n - 1; j >= 1; --j) {
if (a[j] < a[j - 1]) {
const int t = a[j - 1];
a[j - 1] = a[j];
a[j] = t;
++nswap;
flag = true;
}
}
}
return nswap;
}
void Print(const int* a, int n) {
for (int i = 0; i < n; ++i) {
if (i > 0) printf(" ");
printf("%d", a[i]);
}
printf("\n");
}
} // namespace
int main() {
int n;
cin >> n;
int a[100];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
const int r = BubbleSort(a, n);
Print(a, n);
cout << r << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
while (cin >> n, n) {
ll data[4001] = {};
bool uni[4001] = {};
vi order;
REP(i, n) {
ll a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
if (!uni[a]) {
uni[a] = true;
order.push_back(a);
}
data[a] += b * c;
}
bool f = false;
REP(i, order.size()) {
int num = order[i];
if (data[num] >= 1000000) {
printf("%d\n", num);
f = true;
}
}
if (!f) puts("NA");
}
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <sstream>
using namespace std;
#define REP(i,a,n) for(i=a; i<n; i++)
#define rep(i,n) REP(i,0,n)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define foreach(it,x) for(typeof(x.begin()) it=x.begin(); it!=x.end(); it++)
int matrix[16][16];
int main(){
int n,i,j;
while( cin >> n, n ){
// input
rep(i,n) rep(j,n) cin >> matrix[i][j];
// yoko
rep(i,n){
int yoko = 0;
rep(j,n) yoko += matrix[i][j];
matrix[i][n] = yoko;
}
// tate
rep(j,n){
int tate = 0;
rep(i,n) tate += matrix[i][j];
matrix[n][j] = tate;
}
int sum = 0;
rep(i,n) sum += matrix[i][n];
matrix[n][n] = sum;
// output
rep(i,n+1){
rep(j,n+1){
printf("%5d",matrix[i][j]);
}
puts("");
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
typedef long long ll;
ll a[N],n,m,v,p;
int ans;
bool cmp(ll x,ll y) {
return x>y;
}
int main() {
scanf("%lld%lld%lld%lld",&n,&m,&v,&p);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
sort(a+1,a+n+1,cmp);
ll d=a[p];
ans=p;
for(ll i=p+1;i<=n;i++) {
if(a[i]+m>=a[p]) {
ll cnt=max(0ll,v-(n-i+p)); //p~i-1 放的点数
if(cnt==0) ans++;
else {
if(d+cnt*m<=(a[i]+m)*(i-p))
ans++;
else break;
}
}
else break;
d+=a[i];
}
printf("%d\n",ans);
return 0;
}
| #include <iostream>
using namespace std;
long long numOfInvs(int a[], int from, int to, int t[]) {
if (from == to) {
return 0LL;
}
int mid = (from + to) / 2;
long long n = numOfInvs(a, from, mid, t) + numOfInvs(a, mid + 1, to, t);
int i = from, j = mid + 1, k = 0;
while (i <= mid && j <= to) {
if (a[i] <= a[j]) {
t[k++] = a[i++];
}
else {
n += mid - i + 1;
t[k++] = a[j++];
}
}
if (i == mid + 1) {
while (j <= to) {
t[k++] = a[j++];
}
}
else {
while (i <= mid) {
t[k++] = a[i++];
}
}
k = 0;
for (int i = from; i <= to; ++i) {
a[i] = t[k++];
}
return n;
}
long long numOfInvs(int a[], int n) {
int *t = new int[n];
int from = 0;
int to = n - 1;
long long ret = numOfInvs(a, from, to, t);
delete[] t;
return ret;
}
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
cout << numOfInvs(a, n) << endl;
delete[] a;
}
| 0 |
#include <bits/stdc++.h>
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
using namespace std;
int main(){
io
string s;
cin >> s;
int smaller = INT_MAX;
for(int i(0); i<s.length()-2; i++){
char temp[3];
temp[0] = s[i];
temp[1] = s[i+1];
temp[2] = s[i+2];
int n;
sscanf(temp, "%d", &n);
int dif = abs(753 - n);
if(dif < smaller) smaller = dif;
}
cout << smaller << ENDL;
return 0;
} | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// class
// ------------------------------------------------
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
// define
// ------------------------------------------------
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
// code
// ------------------------------------------------
int main() {
string s;
cin >> s;
bool ans = true;
rep(i,sz(s))
{
if(i % 2 == 0)
{
if(s[i] != 'h')
ans = false;
}
else
{
if(s[i] != 'i')
ans = false;
}
}
if(sz(s) % 2) ans = false;
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 5e5 + 2;
int main() {
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n, x;
cin >> n >> x;
ll a[n];
for (int i = 0; i < n; i++) cin >> a[i];
ll sum = 0;
for (int i = 0; i <= x; i++) {
for (int j = 0; i + j <= min(n, x); j++) {
priority_queue<ll, vector<ll>, greater<ll>> pq;
for (int k = 0; k < i; k++)
pq.push(a[k]);
for (int k = n - 1, c = 0; c < j; c++, k--)
pq.push(a[k]);
for (int k = i + j; k < x; k++) {
if (!pq.empty() && pq.top() < 0) pq.pop();
}
ll val = 0;
while(!pq.empty()) val += pq.top(), pq.pop();
sum = max(sum, val);
}
}
cout << sum;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const long long INF = 100000000;
int dp[300100][2];
int main()
{
int N; cin >> N;
string S; cin >> S;
dp[0][0] = 0;
dp[0][1] = 0;
for (int i = 1; i < N; i++) if (S.at(i) == 'E') dp[0][1]++;
for (int i = 0; i < N-1; i++) {
if (S.at(i) == 'E') dp[i + 1][0] = dp[i][0];
else dp[i + 1][0] = dp[i][0] + 1;
if (S.at(i+1) == 'E') dp[i + 1][1] = dp[i][1] - 1;
else dp[i + 1][1] = dp[i][1];
}
int ans = INF;
for (int i = 0; i < N; i++) chmin(ans, dp[i][0] + dp[i][1]);
cout << ans << endl;
return 0;
}
| 0 |
#include<iostream>
int main() {
int N,X,T;
std::cin >> N >> X >> T;
int tmp;
tmp = N / X;
if (N%X != 0) { tmp += 1; }
std::cout << tmp * T << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>
void show2dVector(vector<vector<T>>& v){
for(int i=0;i<v.size();i++){
int m=v[i].size();
cout<<i<<" : ";
for(int j=0;i<m;i++){
cout<<v[i][j]<<" ";
}
cout<<endl;
}
}
void bfs(const vector<vector<int>>&g, int v, vector<bool>& seen){
seen[v]=true;
cout<<v<<" ";
for(auto next: g[v]){
if(seen[next]){
continue;
}
bfs(g,next,seen);
}
}
bool dfs(vector<vector<int>> &g,int start,int goal,vector<bool>&seen){
bool res=false;
seen[start]=true;
if(start==goal){
return true;
}
for(auto next: g[start]){
if(seen[next]){
continue;
}
res=dfs(g,next,goal,seen);
if(res){
break;
}
}
return res;
}
ll gcd(ll a,ll b) {
return b? gcd(b,a%b): a;
}
ll lcm(ll a,ll b) {
return a*b/gcd(a,b);
}
bool isLowerCase(char c){
return (c>='a'&&c<='z');
}
char toLowerCase(char c){
if(isLowerCase(c)){
return c;
}else{
return c+'a'-'A';
}
}
char toUpperCase(char c){
if(isLowerCase(c)){
return c-('a'-'A');
}else{
return c;
}
}
ll powm(ll a,ll n, ll m){
ll ret=1;
while(n>0){
if(n%2==1){
ret=(ret*a)%m;
}
n>>=1;
a=(a*a)%m;
}
return ret;
}
const string yesno(bool ans){
return (ans?"Yes":"No");
}
int main() {
int n,h,w;cin>>n>>h>>w;
int ans=(n-h+1)*(n-w+1);
cout<<ans<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}
long long Maximum_Rectangle(vector<long long>& ar){
ar.push_back(0);
stack<pair<long long,long long>> st;
long long res = 0;
for(long long r = 0; r < ar.size(); ++r){
long long vr = ar[r];
if(st.empty()){
st.push({vr,r});
continue;
}
long long vl = st.top().first, l = st.top().second;
if(vl < vr) st.push({vr,r});
if(vl < vr || vl == vr) continue;
while(vl > vr) {
res = max(res,vl*(r - l));
st.pop();
if(st.size() && st.top().first > vr) vl = st.top().first, l = st.top().second;
else break;
}
st.push({vr,l});
}
ar.pop_back();
return res;
}
int main() {
ll H,W; cin >> H >> W;
string S1,S2;
cin >> S1;
V<V<ll>> flg(H,V<ll>(W,0)),cnt(H,V<ll>(W+1,0));
for(int i = 0; i < H - 1; ++i){
cin >> S2;
for(int j = 0; j < W - 1; ++j){
int a = (S1[j] == '#');
int b = (S1[j + 1] == '#');
int c = (S2[j] == '#');
int d = (S2[j + 1] == '#');
int tmp = a+b+c+d;
if(tmp == 1 || tmp == 3) flg[i][j] = 1;
}
S1 = S2;
}
for(int j = 0; j < W; ++j){
if(!flg[0][j]) cnt[0][j] = 1;
for(int i = 1; i < H; ++i){
if(flg[i][j]) continue;
cnt[i][j] = cnt[i-1][j] + 1;
}
}
ll ans = max(H,W);
for(int i = 1; i < H; ++i){
stack<pair<ll,ll>> st;
st.push({cnt[i-1][0]+1,0});
for(ll j = 1; j <= W; ++j){
ll vj = cnt[i-1][j]+1;
if(st.empty()){
st.push({vj,j});
continue;
}
ll vk = st.top().first, k = st.top().second;
if(vk < vj) st.push({vj,j});
if(vk < vj || vk == vj) continue;
while(1){
chmax(ans,vk*(j - k + (j!=W?1:0)));
st.pop();
if(st.size() && st.top().first > vj) vk = st.top().first, k = st.top().second;
else break;
}
st.push({vj,k});
}
}
//for(int i = 0; i < H; ++i) print(i,cnt[i]);
cout << ans << endl;
return 0;
}
| #include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#include <type_traits>
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1e17
#define rep(i,j,n) for(int i=j;i<n;i++)
#define P pair<int,int>
#define ps push_back
double pi = 3.141592653589793;
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
fill( (T*)array, (T*)(array+N), val );
}
//ここから始めよう
int p[214514],q[214514],c[214151];
vector<P> G[614514];
int lastid=0;
map<P,int> sid;
int getid(int v,int c){
P p(v,c);
if(sid.find(p)!=sid.end())return sid[p];
return sid[p]=lastid++;
}
void addedge(int p,int q,int c){
int v=getid(p,c);int u=getid(q,c);
G[v].ps(P(u,0));
G[u].ps(P(v,0));
}
signed main(){
int n,m;cin>>n>>m;
rep(i,0,m){
cin>>p[i]>>q[i]>>c[i];
p[i]--;q[i]--;
addedge(p[i],q[i],c[i]);
}
rep(i,0,m){
G[getid(p[i],c[i])].ps(P(lastid+p[i],1));
G[getid(q[i],c[i])].ps(P(lastid+q[i],1));
G[lastid+p[i]].ps(P(getid(p[i],c[i]),1));
G[lastid+q[i]].ps(P(getid(q[i],c[i]),1));
}
vector<int> d(lastid+n,mod);d[lastid]=0;
priority_queue<P> que;
que.push(P(0,lastid));
while(!que.empty()){
auto p=que.top();que.pop();
int u=p.second,dist=-p.first;
if(dist>d[u])continue;
for(auto e:G[u]){
int v=e.first,c=e.second;
if(d[v]>d[u]+c){
d[v]=d[u]+c;
que.push(P(-d[v],v));
}
}
}int ans=d[lastid+n-1];
if(ans==mod)ans=-1;
else ans/=2;
cout<<ans<<endl;return 0;
} | 0 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
using lld = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b)
{
if (a < b)
{
return gcd(b, a);
}
while (b != 0)
{
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
ll N;
cin >> N;
ll mn;
cin >> mn;
loop(0, 4, i) {
ll tmp;
cin >> tmp;
mn = min(mn, tmp);
}
ll bn;
if (N % mn == 0) {
bn = N/mn;
} else {
bn = N/mn + 1;
}
print(bn + 5 - 1);
} | #include <iostream>
using namespace std;
int main(){
int n;
int a[100001];
bool b[100001];
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int x = a[n - 1];
int i = -1;
for(int j = 0; j < n - 1; j++){
if(a[j] <= x){
i++;
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
int tmp = a[i + 1];
a[i + 1] = a[n - 1];
a[n - 1] = tmp;
for(int i = 0; i < n - 1; i++){
if(a[i] == x){
for(int j = 0; j < i; j++){
b[j] = false;
}
b[i] = true;
}else{
b[i] = false;
}
}
for(int i = 0; i < n - 1; i++){
if(b[i]){
cout << "[" << a[i] <<"] ";
}else{
cout << a[i] <<" ";
}
}
cout << a[n - 1] << endl;
return 0;
} | 0 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define SZ 1234567
int n,h_[SZ+SZ],*h=h_,dt=0; char s[SZ],t[SZ];
int main()
{
scanf("%d%s%s",&n,s+1,t+1);
if(strcmp(s+1,t+1)==0)
{
puts("0");
return 0;
}
int cr=n,cl=n+1,ans=0;
for(int i=n;i>=1;--i)
{
if(t[i-1]==t[i]) continue;
int x=min(cl-1,i);
while(x&&s[x]!=t[i]) --x;
if(!x)
{
puts("-1");
return 0;
}
int ir=i;
while(t[ir+1]==t[i]) ++ir;
while(cl>x)
h[--cl]=-dt;
while(cr>=ir)
ans=max(ans,h[cr--]+dt);
++h; ++dt;
}
while(cl>1)
h[--cl]=-dt;
while(cr>=1)
ans=max(ans,h[cr--]+dt);
printf("%d\n",ans);
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
using namespace std;
int n;
vector < vector<int> > g;
vector<int> gi;
vector<int> cl;
vector<int> p;
vector<long long> cycle;
bool dfs (int v) {
if(cl[v] == 2) return false;
if(cl[v] == 1){
while(cycle.back() != v){
p.push_back(cycle.back());
cycle.pop_back();
}
p.push_back(v);
reverse(p.begin(), p.end());
return true;
}
cl[v] = 1;
cycle.push_back(v);
long long u = -1;
for(int i = 0; i < g[v].size(); ++i){
long long to = g[v][i];
if(cl[to] == 1){
if(u == -1 || gi[to] > gi[u]) u = to;
}
}
if(u != -1){
dfs(u);
return true;
}
for (int i = 0; i < g[v].size(); i++) {
int y = g[v][i];
if (!cl[y]) {
gi[y] = gi[v] + 1;
if (dfs(y)) return true;
}
}
cycle.pop_back();
cl[v] = 2;
return false;
}
int main() {
long long m, in, ot;
cin >> n >> m;
g.resize(n);
gi.resize(n);
for(int i = 0; i < m; ++i){
cin >> in >> ot;
in--, ot--;
g[in].push_back(ot);
}
cl.resize(n);
for (int i = 0; i < n; ++i)
if (dfs (i))
break;
if (p.size() == 0){
cout << -1;
return 0;
}
vector<long long> q(n, -1);
for(int i = 0; i < p.size(); ++i)
q[p[i]] = i;
long long v = p[0];
vector<long long> res;
while(true){
res.push_back(v);
long long vv = v;
for(long long a: g[v])
if(q[a] > q[vv]) vv = a;
if(vv == v) break;
v = vv;
}
cout << res.size() << endl;
for(int i = 0; i < res.size(); ++i) cout << res[i] + 1 << endl;
} | 0 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double x1, x2, y1, y2, dis;
cin >> x1 >> y1 >> x2 >> y2;
dis = sqrt(pow(x2 - x1,2.0) + pow(y2 - y1,2.0));
cout << fixed << dis <<endl;
return 0;
} | //AOJ:Daice 1
//??????????????£?????¬?????????????????????????\?
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
int main(){
//nwes
int scube[4][6]={{2,6,3,4,1,5},{3,2,6,1,5,4},{4,2,1,6,5,3},{5,1,3,4,6,2}};
int cube[6],kcube[6];
char sk[102];
for(int i=1;i<=6;i++) scanf("%d",&cube[i]);
scanf("%s",sk);
for(int i=0;i<strlen(sk);i++){
if(sk[i]=='N'){
for(int j=0;j<6;j++){
kcube[j+1]=cube[scube[0][j]];
}
}else if(sk[i]=='W'){
for(int j=0;j<6;j++){
kcube[j+1]=cube[scube[1][j]];
}
}else if(sk[i]=='E'){
for(int j=0;j<6;j++){
kcube[j+1]=cube[scube[2][j]];
}
}else if(sk[i]=='S'){
for(int j=0;j<6;j++){
kcube[j+1]=cube[scube[3][j]];
}
}
for(int j=1;j<=6;j++) cube[j]=kcube[j];
}
printf("%d\n",cube[1]);
return 0;
} | 0 |
#include <stdio.h>
int main()
{
int j,i,n,ice[10],in;
scanf("%d",&n);
while(n != 0){
for(i = 0; i < 10; i++){
ice[i] = 0;
}
for(i = 0; i < n; i++){
scanf("%d",&in);
ice[in]++;
}
for(i = 0; i < 10; i++){
if(ice[i] == 0){
printf("-");
}
for(j = 0; j < ice[i]; j++){
printf("*");
}
printf("\n");
}
scanf("%d",&n);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N;
cin >> N;
vector<ll> dp(N+1,INF);
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
reverse(all(A));
rep(i,N){
ll inx;
inx = upper_bound(all(dp),A[i]) -dp.begin();
dp[inx] = A[i];
}
ll ans;
rep(i,N+1){
if(dp[i] == INF){
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a,b; cin >> a >> b;
if(a<9&&b<9){
cout << "Yay!";
}
else{
cout << ":(";
}
}
| #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#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 r; cin >> r;
if(r<1200) cout << "ABC" << endl;
else if(r<2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const char ok = '1';
const char no = '0';
struct P{
int x;
int y;
int z;
};
int main()
{
int a, b, c, n, v;
char ch[301];
P p;
while(cin>>a>>b>>c && (a+b+c)){
cin >> n;
fill(ch, ch+301, '2');
vector<P> vec;
while(n--){
cin >> p.x >> p.y >> p.z >> v;
if(v == 1){
ch[p.x] = ch[p.y] = ch[p.z] = ok;
} else {
vec.push_back(p);
}
}
for(int i = 0; i < vec.size(); i++){
if(ch[vec[i].x] == ok && ch[vec[i].y] == ok){
ch[vec[i].z] = no;
} else if(ch[vec[i].x] == ok && ch[vec[i].z] == ok){
ch[vec[i].y] = no;
} else if(ch[vec[i].y] == ok && ch[vec[i].z] == ok){
ch[vec[i].x] = no;
}
}
for(int i = 1; i <= a+b+c; i++){
cout << ch[i] << endl;
}
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define re register
#define rep(i,m,n) for(int i=m;i<=n;i++)
#define per(i,n,m) for(int i=m;i>=n;i--)
#define rrep(i,m,n) for(register int i=m;i<=n;i++)
#define rper(i,n,m) for(register int i=m;i>=n;i--)
#define ull unsigned long long
using namespace std;
const int INF =1e9+10;
const int N = 1e3 + 10;
int n,d1,d2,cnt;
int a[N][N];
void solve(int x){
int tmp=0;
while(x%4==0){
x/=4;
tmp++;
}
if(x&1){
rep(i,0,n*2-1){
rep(j,0,n*2-1){
if(((i>>tmp)+(j>>tmp))&1){
a[i][j]=1;
}
}
}
}else{
rep(i,0,n*2-1){
rep(j,0,n*2-1){
if(((i>>tmp))&1){
a[i][j]=1;
}
}
}
}
}
signed main() {
si(n);
si(d1);
si(d2);
solve(d1);
solve(d2);
rep(i,0,n*2-1){
rep(j,0,n*2-1){
if(cnt<n*n&&!a[i][j]){
printf("%d %d\n",i,j);
cnt++;
}
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 7;
int n, k;
int bit[N];
int ar[N];
void add(int x, int val)
{
while (x < N)
bit[x] += val, x += (x & -x);
}
int sum(int x)
{
int res = 0;
while (x)
res += bit[x], x -= (x & -x);
return res;
}
//Lamps with N radius
int getMax()
{
int res = 0;
for (int i = 1; i <= n; ++i)
res += (ar[i] == n);
return res;
}
void update()
{
memset(bit, 0, sizeof(bit));
for (int i = 1; i <= n; ++i)
{
add(max(1, i - ar[i]), 1);
add(min(n+1, i + ar[i] + 1), -1);
}
for (int i = 1; i <= n; ++i)
ar[i] = sum(i);
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> ar[i];
for (int i = 0; i < k; ++i)
{
update();
if (getMax() == n)
break;
}
for (int i = 1; i <= n; ++i)
{
if (i != 1) cout << " ";
cout << ar[i];
}
cout << '\n';
return 0;
} | #include <bits/stdc++.h>
#if DEBUG
template <typename Iter>
void debug_iter(Iter begin, Iter end);
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, size_t N>
void debug(const std::array<T, N>& a) {
debug_iter(a.begin(), a.end());
}
template <typename T>
void debug(const std::vector<T>& v) {
debug_iter(v.begin(), v.end());
}
template <typename T>
void debug(const std::set<T>& s) {
debug_iter(s.begin(), s.end());
}
template <typename T, typename U>
void debug(const std::map<T, U>& m) {
debug_iter(m.begin(), m.end());
}
template <typename T, typename U>
void debug(const std::pair<T, U>& p) {
std::cerr << "{";
debug(p.first);
std::cerr << ", ";
debug(p.second);
std::cerr << "}";
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
debug(value);
std::cerr << ", ";
debug(args...);
}
template <typename Iter>
void debug_iter(Iter begin, Iter end) {
std::cerr << "{";
for (Iter it = begin; it != end; ++it) {
if (it != begin) std::cerr << ", ";
debug(*it);
}
std::cerr << "}";
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")\n"; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define rd(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << '\n';
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define wt(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
for (T& vi : v) is >> vi;
return is;
}
template <typename T>
bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#include <boost/hana/functional/fix.hpp>
auto Fix = [](auto&& f) { return boost::hana::fix(f); };
using ll = long long;
template <typename T>
using low_priority_queue =
std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;
using namespace std;
int main() {
rd(ll, n, k);
vector<ll> a(n);
cin >> a;
rep(i, k) {
vector<ll> na(n);
rep(j, n) na[j] = 1;
{
low_priority_queue<ll> que;
rep(j, n) {
while (!que.empty() && que.top() < j) que.pop();
na[j] += que.size();
que.push(j + a[j]);
}
}
{
priority_queue<ll> que;
for (ll j = n - 1; j >= 0; --j) {
while (!que.empty() && que.top() > j) que.pop();
na[j] += que.size();
que.push(j - a[j]);
}
}
if (na == a) break;
swap(a, na);
}
rep(i, n) cout << a[i] << " ";
cout << endl;
}
| 1 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;
#define NUM 2147483647
int N = 1;
int* data;
void init(int first_N){
while(N < first_N)N *= 2;
}
void update(int update_left,int update_right,int new_value,int node_id,int node_left,int node_right){
if(update_right < node_left || update_left > node_right)return;
else if(update_left <= node_left && update_right >= node_right){
data[node_id] = new_value;
}else{
if(data[node_id] >= 0){
data[2*node_id+1] = data[node_id];
data[2*node_id+2] = data[node_id];
data[node_id] = -1;
}
update(update_left,update_right,new_value,2*node_id+1,node_left,(node_left+node_right)/2);
update(update_left,update_right,new_value,2*node_id+2,(node_left+node_right)/2+1,node_right);
}
}
int query(int search_left,int search_right,int node_id,int node_left,int node_right){
if(search_right < node_left || search_left > node_right){
return -1;
}else if(node_left <= search_left && node_right >= search_right && data[node_id] >= 0){
return data[node_id];
}else{
int left = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);
int right = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);
return max(left,right);
}
}
int main(){
int first_N,Q;
scanf("%d %d",&first_N,&Q);
init(first_N);
data = new int[270000];
for(int i = 0; i <= 2*N-2; i++)data[i] = NUM;
int command,left,right,value,loc;
for(int i = 0; i < Q; i++){
scanf("%d",&command);
if(command == 0){
scanf("%d %d %d",&left,&right,&value);
update(left,right,value,0,0,N-1);
}else{
scanf("%d",&loc);
printf("%d\n",query(loc,loc,0,0,N-1));
}
}
} | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define INIVAL 2147483647
int *a, *ts, c, s, t, v;
void update(int k, int l, int r)
{
if (r<s || t<=l) return;
if (s<=l && r<=t) {
a[k] = v;
ts[k] = c;
} else if (l<r-1) {
update(((k+1)<<1)-1, l, (l+r)>>1);
update((k+1)<<1, (l+r)>>1, r);
}
}
int main()
{
int i, k, n, z, w, latest;
char *p,buf[64] = {0};
buf[62] = '\n';
fgets(buf, 64, stdin);
for (n=0,p=buf; *p>' '; n=n*10+*(p++)-'0');
w = n>1 ? pow(2,(int)ceil(log2(n)))-1 : 1;
ts = (a = (int*)malloc((w+n)*2*sizeof(int))) + w+n;
for (i=0; i<w+n; i++) ts[i] = -1;
a[0] = INIVAL;
ts[0] = 0;
c = 0;
while (fgets(buf, 64, stdin)) {
for (s=0,p=buf+2; *p>' '; s=s*10+*(p++)-'0');
if (*buf=='0') { // update(s, t, x)
for (t=0,p++; *p>' '; t=t*10+*(p++)-'0');
for (v=0,p++; *p>' '; v=v*10+*(p++)-'0');
t++;
update(0, 0, w+1);
c++;
} else { // find(x) x->s
latest = -1;
for (k=w+s; ; k=(k-1)>>1) {
if (ts[k]>latest) {
latest = ts[k];
z = a[k];
}
if (k==0) break;
}
if (z<10) {
putc_unlocked('0'+z, stdout);
putc_unlocked('\n', stdout);
} else {
for (i=62; z>0; buf[--i]='0'+z%10,z/=10);
fputs(buf+i, stdout);
}
}
}
return 0;
}
| 1 |
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
string str;
cin>>str;
for(int i = 0;i<str.length();i++)
cout<<str[str.length()-(i+1)];
cout<<"\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
while(1){
cin>>str;
if (cin.eof())
break;
for(int i = (str.size()-1); i>=0; i--)
cout<<str[i];
cout<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
double kitaichi(vector<int> p, int start, int k){
double ans;
for (int i = 0; i < k; i++){
double sum = 0;
for (int j = 1; j <= p[start+i]; j++){
sum += j;
}
ans += sum/p[start+i];
}
return ans;
}
int main() {
cin >> n >> k;
vector<int> p(n);
for (int i = 0; i < n; i++){
cin >> p.at(i);
}
int sum = 0;
int start;
int s = 0;
for (int i = 0; i < 1; i++){
for (int j = 0; j < k; j++){
s += p.at(i+j);
}
sum = s;
start = i;
}
for (int i = 1; i + k <= n; i++){
s += p.at(i+k-1);
s -= p.at(i-1);
if (sum < s){
sum = s;
start = i;
}
}
cout << fixed << setprecision(15) << kitaichi(p, start, k) << endl;
} | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////
void solve(){
ll n,m;
cin >> n >> m;
Vi mods(n),sum(n+1);
rp(i,n){
cin >> mods.at(i);
mods.at(i)%=m;
}
sum[0]=0;
rp(i,n){
sum[i+1]=sum[i]+mods[i];
sum[i+1]%=m;
}
sort(all(sum));
ll ans=0;
ll ctr=1;
rp(i,n){
if(sum[i]==sum[i+1]){
ctr++;
}
else{
ans += ctr*(ctr-1)/2;
ctr=1;
}
}
ans+=ctr*(ctr-1)/2;
print(ans);
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
} | 0 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
while(1){
int n,a,u[10]={0,1,2,3,4,5,6,7,8,9},p[10]={};
cin >> n;
if(n==0)return 0;
for(int i=0;i<n;i++){
cin >> a;
for(int i=0;i<10;i++){
if(a==u[i])p[i]=p[i]+1;
/*cout << "p["<< i << "]=" << p[i];*/
}
/*cout << endl;*/
}
/*for(int i=0;i<10;i++){
cout << "p["<< i << "]=" << p[i];
}*/
for(int r=0;r<10;r++){
if(p[r]==0){cout << "-";}
else if(p[r]!=0){
for(int i=0;i<p[r];i++){
cout << "*";
}
}
cout << endl;
}
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n[20];
int c[20][10];
int l =0;
int k;
while(cin >> n[l]){
if(n[l] == 0){break;}
for (int i = 0; i< 10; i++){
c[l][i] = 0;
}
for(int i= 0;i < n[l] ;i++){
cin >> k;
c[l][k] ++;
}
l ++;
}
for(int i = 0;i < l;i++){
for(int j = 0;j<10;j++){
if (c[i][j] == 0){
cout << "-" << endl;
}
else{
for(int w = 0;w < c[i][j];w++){
cout << "*";
}
cout << endl;
}
}
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES";} else {return "NO";}}
int main(){
string S;
cin >> S;
string T = "AC";
bool ok = false;
rep(i, S.size()-1){
string s = S.substr(i, 2);
if(s == T) ok = true;
}
Cout(Yes(ok));
}
| #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;
string s,t;
cin >> s >>t;
int ans = s.size() + t.size();
int i = n;
int j = 0;
int leng = 1;
int counts = 0;
int kouho = 0;
int kotae = s.size() + t.size();
while(n--){
if(s.substr(i-1,leng) == t.substr(j,leng)){
kouho = ans - leng;
kotae = min(kotae,kouho);
}
i--;
leng++;
}
cout << kotae << endl;
}
// cout << fixed << setprecision(15) << << endl;
| 0 |
#include<bits/stdc++.h>
#define maxn 100005
using namespace std;
int n,m;
int main()
{
int x,y,l=0,r=maxn;
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
l=max(x,l),r=min(y,r);
}
if(l>r)printf("0");
else printf("%d\n",r-l+1);
return 0;
} | #include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
int m,n;
int mp[100005];
scanf("%d %d",&m,&n);
memset(mp,0,sizeof(mp));
int t=n;
while(t--)
{
int l,r;
scanf("%d %d",&l,&r);
for(int i=l;i<=r;i++)
{
mp[i]++;
}
}
int sum=0;
for(int i=1;i<=m;i++)
{
if(mp[i]==n)
sum++;
}
printf("%d\n",sum);
return 0;
} | 1 |
#include <cstdio>
int a[100010],sum[2],n;
bool flag;
int gcd(int a,int b)
{
if (b==0) return a;
else return gcd(b,a%b);
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if (a[i]>1) sum[a[i]&1]++;
}
if (n==1)
{
if (a[1]&1) printf("Second\n");
else printf("First\n");
return 0;
}
flag=false;
while (1)
{
if (!sum[0]&&!sum[1])
{
if (!flag) printf("Second\n");
else printf("First\n");
return 0;
}
if (sum[0]&1)
{
if (!flag) printf("First\n");
else printf("Second\n");
return 0;
}
if (sum[1]>1||!sum[1])
{
if (!flag) printf("Second\n");
else printf("First\n");
return 0;
}
int GCD=-1;
for (int i=1;i<=n;i++)
if (a[i]>1)
{
if (a[i]&1)
{
a[i]--;break;
}
}
for (int i=1;i<=n;i++)
if (GCD==-1) GCD=a[i];
else GCD=gcd(a[i],GCD);
sum[0]=sum[1]=0;
for (int i=1;i<=n;i++)
{
a[i]/=GCD;
if (a[i]>1) sum[a[i]&1]++;
}
flag^=1;
}
return 0;
}
//all is 1: who faces even number of even number, lose./odd number of even number, win. | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 510000;
static const ll MOD = 1000000007;
int main(){
int N;
cin>>N;
vector<ll> A(N);
for(int i=0; i<N; i++) cin>>A[i];
vector<ll> color(3,0);
ll ans = 1;
for(int i=0; i<N; i++){
ll kake = 0;
for(int j=0; j<3; j++){
if(color[j] == A[i]) kake++;
}
ans *= kake;
ans %= MOD;
for(int j=0; j<3; j++){
if(color[j] == A[i]){
color[j]++;
break;
}
}
}
cout<<ans<<endl;
} | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
double a[10];
double v[2];
double ans;
while(scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9],&v[0],&v[1]) != EOF)
{
double all = 0;
double kari = 0;
for(int i = 0;i < 10;i++) all += a[i];
ans = (v[0] * all) / (v[0] + v[1]);
if(ans == 0) printf("1\n");
else
{
for(int i = 0;i < 10;i++)
{
kari += a[i];
if(kari >= ans)
{
printf("%d\n",i+1);
break;
}
}
}
}
return 0;
} | #include <iostream>
#include <stack>
using namespace std;
int main(){
double l[10], t[10], a, b;
char c;
while(cin >> l[0] >> c){
t[0] = l[0];
for(int i = 1;i< 10;i++){cin >> l[i] >> c;t[i] = t[i-1] + l[i];}
cin >> a >> c >> b;
double tmp = t[9]/(a+b)*a;
int ans = 1;
while(tmp > t[ans-1]){
ans++;
}
cout << ans << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
int w;
cin >> s >> w;
string result;
for (int i = 0; i < s.size(); i += w) {
result += s[i];
}
cout << result << '\n';
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll A,ll B){
if (A%B==0)return(B);
else return(gcd(B,A%B));
}
ll keta(ll N){
int tmp{};
while( N > 0 ){
tmp += ( N % 10 );
N /= 10;
}
N = tmp;
return N;
}
vector<vector<ll>> combination(ll n, ll r){
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
for(ll i=0;i<v.size();++i){
v[i][0] = 1;
v[i][i] = 1;
}
for(ll i=1;i<v.size();++i){
for(ll j=0;j<i;++j){
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]);
}
}
return v;
}
bool kai(string S){
bool flag = true;
for(ll i=0;i<S.size()/2;++i){
if(S[i] != S[S.size()-i-1]){
flag = false;
break;
}
}
return flag;
}
// ---------------------------------------------
int main(){
string s;
cin>>s;
ll w;
cin>>w;
for(ll i=0;i<s.size();i+=w){
cout<<s[i];
}
cout<<endl;
return 0;
} | 1 |
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int main() {
double PI = 3.14159265358979, R; cin >> R;
printf("%.12lf\n", 2.0 * R * PI);
return 0;
} | #include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
int n, m;
cin >> n >> m;
vi a(m);
rep(i, m) cin >> a[i];
vi b = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vi dp(n + 1, -1);
dp[0] = 0;
rep(j, n) rep(i, m) {
if(dp[j] == -1) continue;
int nj = j + b[a[i]];
if(nj <= n) dp[nj] = max(dp[nj], dp[j] + 1);
}
int j = n;
string ans = "";
while(j) {
int num = 0;
rep(i, m) {
int nj = j - b[a[i]];
if(nj >= 0 && dp[nj] == dp[j] - 1) num = max(num, a[i]);
}
ans.push_back((char)(num + '0'));
j -= b[num];
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int read() {
char cc = getchar(); int cn = 0, flus = 1;
while(cc < '0' || cc > '9') { if( cc == '-' ) flus = -flus; cc = getchar(); }
while(cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
return cn * flus;
}
const int N = 1000 + 5 ;
#define rep( i, s, t ) for( register int i = s; i <= t; ++ i )
int n, m, book[N], w[N][N], vis[N], can[N];
bool check( int x ) {
memset( book, 0, sizeof(book) ), memset( can, 0, sizeof(can) ) ;
int flag ; rep( i, 1, n ) vis[i] = 1, ++ book[w[i][vis[i]]] ;
rep( i, 1, m ) {
flag = 1 ;
rep( j, 1, n ) {
int u = w[j][vis[j]] ;
if( book[u] > x ) {
can[u] = 1; flag = 0 ;
while( vis[j] <= n && can[w[j][vis[j]]] ) ++ vis[j] ;
if( vis[j] > n ) return 0;
++ book[w[j][vis[j]]] ;
}
}
if( flag ) return 1;
}
return 0 ;
}
signed main()
{
n = read(), m = read() ;
rep( i, 1, n ) rep( j, 1, m ) w[i][j] = read() ;
int l = 1, r = n, ans = 0, mid ;
while( l <= r ) {
mid = ( l + r ) >> 1 ;
if( check(mid) ) ans = mid, r = mid - 1 ;
else l = mid + 1 ;
}
printf("%d\n", ans ) ;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
long long n=s.size();
for(long long i=0;i<n-1;i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2 << endl;
return 0;
}
}
for(long long i=0;i<n-2;i++){
if(s[i]==s[i+2]&&s[i]!=s[i+1]){
cout << i+1 << " " << i+3 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
return 0;
}
| /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼ [￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣ 仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／ | 「ときめき」みたいなものを感じてくれたと思う。
￣￣￣￣￣￣￣￣￣￣|／ | 殺伐としたコンテストの中で、そういう気持ちを忘れないで欲しい
￣￣￣￣￣￣￣￣￣￣ | そう思って、この提出を投げたんだ。
(⊆⊇) (⊆⊇) (⊆⊇) |
|| || || | じゃあ、判定を聞こうか。
.／|＼ ／|＼ ／|＼
*/
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd second
#define ALL(obj) (obj).begin(),(obj).end()
#define debug(x) cerr << #x << " -> " << x << " (line:" << __LINE__ << ")" << '\n';
#define debugpair(x, y) cerr << "(" << #x << ", " << #y << ") -> (" << x << ", " << y << ") (line:" << __LINE__ << ")" << '\n';
typedef long long lint;
typedef priority_queue<int> p_que;
typedef priority_queue<int, vector<int>, greater<int>()> p_que_rev;
// const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const lint MOD = 1000000000 + 7;
const double EPS = 1e-9;
const double PI = acos(-1);
const int di[]{0, -1, 0, 1, -1, -1, 1, 1};
const int dj[]{1, 0, -1, 0, 1, -1, -1, 1};
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
lint k;
cin >> k;
const lint n = 50;
vector<lint> a(n);
for (int i=0; i<n; ++i){
a[i] = i;
}
lint p = k / n;
lint r = k % n;
if(r == 0){
for (int i=0; i<n; ++i){
a[i] = p + i;
}
}
else {
for (int i=r-1; i>=0; --i){
a[i] = n + p - (r - 1 - i);
}
for (int i=r; i<n; ++i){
a[i] = i - r + p;
}
}
bool isFst = true;
cout << n << endl;
for (int i=0; i<n; ++i){
if(isFst){
isFst = false;
cout << a[i];
}
else {
cout << " " << a[i];
}
}
cout << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
int N; cin >> N;
vector<int> A(N); for(int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
ll ans = 0;
for(int i = N-1; i >= 0; i--){
for(int j = 30; j >= 1; j--){
ll key = pow(2, j) - A[i];
if(key <= 0) break;
auto itr = lower_bound(A.begin(), A.end(), key);
if(*itr != key) continue;
int d = distance(A.begin(), itr);
if(i == d) {
continue;
}
A.erase(A.begin()+i);
A.erase(A.begin()+d);
//cout << d << " " << i << " " << A.size() << endl;
i--;
ans++;
break;
}
}
cout << ans << endl;
} | //include
//------------------------------------------
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <ctime>
// namespace
using namespace std;
// type alias
using ll = long long;
using ull = unsigned long long;
using comp = complex<double>;
// constant
static const ll MOD = 1000000007LL;
static const double PI = 3.14159265358979323846;
// conversion
inline ll toint(string s) { ll v; istringstream sin(s); sin >> v; return v; }
template<class t> inline string tostring(t x) { ostringstream sout; sout << x; return sout.str(); }
// print
#define RET(x) return cout << x << endl, 0;
// for loop
#define REP(i, a, b) for ((i) = (ll)(a);(i) < (ll)(b);(i)++)
#define REPD(i, a, b) for (ll i = (ll)(a);(i) < (ll)(b);(i)++)
#define REPI(v, vs) for (auto& v : vs)
//debug
#define DUMP(x) cerr << #x << " = " << (x) << endl
#define DEBUG(x) cerr << #x << " = " << (x) << " (l" << __LINE__ << ")" << " " << __FILE__ << endl
#define MAX_VALUE 9223372036854775807
inline ll get_highest_one_bit(ll a)
{
while ((a & (a - 1)) != 0)
{
a = a & (a - 1);
}
return a;
}
int solve() {
ll N;
cin >> N;
map<ll, ll> val_to_count;
ll a, b;
REPD(i, 0, N) {
cin >> a;
if (val_to_count.count(a) == 0) val_to_count[a] = 0;
++val_to_count[a];
}
ll res = 0;
vector<bool> used(N, false);
for (auto iter = val_to_count.end(); iter != val_to_count.begin(); ) {
--iter;
a = iter->first;
b = get_highest_one_bit(a) * 2LL - a;
if (val_to_count[a] == 0) continue;
if (val_to_count.count(b) > 0) {
if (a != b) {
ll count = min(val_to_count[a], val_to_count[b]);
val_to_count[a] -= count;
val_to_count[b] -= count;
res += count;
}
else {
ll count = val_to_count[a] / 2LL;
val_to_count[a] -= count * 2LL;
res += count;
}
}
}
RET(res);
return 0;
}
//main function
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
solve();
// ll t;
// cin >> t;
// REPD(i, 0, t) solve();
return 0;
}
| 1 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
vector<vector<int> >adj1,adj2;
map<int,int>mm;
int vis[200005];
int vis2[200005];
vector<int>comp;
int ans[200005];
int parent[200005];
void dfs(int ver)
{
comp.push_back(ver);
vis[ver]=1;
for(auto i:adj1[ver])
{
if(!vis[i])
{
dfs(i);
}
}
}
vector<int>temp;
void dfs2(int ver,int dest)
{
parent[ver]=dest;
vis2[ver]=1;
for(auto i:adj2[ver])
{
if(!vis2[i])
dfs2(i,dest);
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int n,k,l;
cin>>n>>k>>l;
int x,y;
adj1.resize(n+1);
adj2.resize(n+1);
for(int i=0;i<k;i++)
{
cin>>x>>y;
adj1[x].push_back(y);
adj1[y].push_back(x);
}
for(int i=0;i<l;i++)
{
cin>>x>>y;
adj2[x].push_back(y);
adj2[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!vis2[i])
dfs2(i,i);
}
for(int i=1;i<=n;i++)
{
if(!vis[i])
{
comp.clear();
mm.clear();
dfs(i);
for(auto j:comp)
{
mm[parent[j]]++;
}
for(auto j:comp)
{
ans[j]=mm[parent[j]];
}
}
}
for(int i=1;i<=n;i++)
{
cout<<ans[i]<<" ";
}
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}
ll N, M;
vector<int> to[100010];
int idx[100010];
int edge[100010];
int node[100010];
int oe[100010];
int judge[100010];
int es[200010];
ll ans = 0;
void dfs(int v, int id, int type){
idx[v] = id;
node[id]++;
oe[v] = type;
for(auto u : to[v]){
if(idx[u] != 0){
if(oe[u] == type) judge[id] = true;
}else{
dfs(u, id, (type + 1) & 1);
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M;
ans = N * N;
for(int i = 0; i < M; i++){
int u, v;
cin >> u >> v;
es[i] = u;
to[u].emplace_back(v);
to[v].emplace_back(u);
}
int id = 1;
for(int i = 1; i <= N; i++){
if(idx[i] == 0) dfs(i, id++, 0);
}
for(int i = 0; i < M; i++){
edge[idx[es[i]]]++;
}
ll nsum = 0, graph = 0, oc = 0;
for(int i = 1; i < id; i++){
if(node[i] == 1) continue;
nsum += node[i];
graph++;
if(!judge[i]) oc++;
}
cout << ans - (nsum * nsum) + (graph * graph) + (oc * oc) << endl;
return 0;
} | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>
using namespace std;
#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double
ostream& operator<< (ostream &a, const vector<int> &b) {
for (auto k : b) cout << k << " ";
return a;
}
istream& operator>> (istream& a, pii& b) {
cin >> b.first >> b.second;
return a;
}
ostream& operator<< (ostream& a, const pii& b) {
cout << "{" << b.first << ", " << b.second << "}";
return a;
}
template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {if (x > y) x = y;}
template <typename T1, typename T2> inline void chkmax(T1 &x, const T2 &y) {if (x < y) x = y;}
#ifdef LOCAL
#define dbg(x) cout << #x << " : " << (x) << "\n";
const int INF = 500;
// const int mod = 2600000069;
// const int p = 10;
// const ld PI = 3.1415926535;
#else
#define dbg(x)
const int INF = 1e18;
// const int mod = 2600000069;
// const int p = 179;
// const ld PI = 3.1415926535;
#endif
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
const int MAXN = 1e6 + 10;
int dp[MAXN][2];
int a[MAXN];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
for (int i = 0; i < MAXN; i++) {
dp[i][0] = dp[i][1] = INF;
}
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
a[i] = s[i] - '0';
}
dp[0][0] = a[0];
dp[0][1] = 2 + 9 - a[0];
for (int i = 1; i < n; i++) {
dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + a[i];
dp[i][1] = min(dp[i - 1][0] + 2, dp[i - 1][1]) + 9 - a[i];
}
cout << min(dp[n - 1][0], dp[n - 1][1]);
}
/*
*/
| #include <bits/stdc++.h>
using namespace std;
#define Fast ios::sync_with_stdio(false); cin.tie(0)
#define pb push_back
#define pf push_front
#define pp pop
#define ppb pop_back
#define ppf pop_front
#define mp make_pair
#define S second
#define F first
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 1e6 + 5;
ll inf = 1e18;
ll a[N];
ll sm[N];
int main(){
Fast;
ll n;
cin >> n;
for(int i = 0 ;i < n ;i ++)cin >> a[i];
sm[n-1] = a[n-1];
for(int i = n-2; i >= 0 ; i --){
sm[i] = a[i] + sm[i+1];
sm[i] %= mod;
}
ll ans = 0;
for(int i = 0 ; i < n-1 ;i ++){
ans += a[i] * sm[i+1];
ans %= mod;
}
cout << ans ;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// Optimization
//#pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) Fora(iiii, a) cout << iiii << ' '; cout << endl;
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) for (int iiii = l; iiii <= r; iiii++) cout << a[iiii] << ' '; cout << endl;
#define PrintAl(a, l, r) for (int iiii = l; iiii <= r; iiii++) cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(), _sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string> _itDEB(_ssDEB); DEB(_itDEB, args); }
void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
//#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
//mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
//int randt(int l, int r){ return (rando() % (r - l + 1) + l); }
// Data Structure
#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <ld> vld;
typedef vector <string> vs;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <vi > vvi;
typedef vector <vll > vvll;
typedef vector <pii > vpii;
typedef vector <pll > vpll;
const int N = 1e5 + 5;
int mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9, inf = 1e9 + 7;
ll infll = 1e18 + 7;
string s;
int a[26];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> s;
if (s.length() == 2 && s[0] == s[1]){
cout << 1<< ' '<< 2;
return 0;
}
For(i, 2, s.length()){
mset(a);
a[s[i - 2] - 'a']++;
a[s[i - 1] - 'a']++;
a[s[i] - 'a']++;
For(j, 0, 26){
if (a[j] == 2){
cout << i - 1 << ' ' << i + 1 << endl;
return 0;
}
}
}
cout << -1 << ' ' << -1 << endl;
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/ | #include<iostream>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//1000000000000223
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, m, vis[1009], vis2[1009],par[1009],go[1009][1009] ;
vector<int> v[1009];
vector<int> ans;
void solve()
{
int sz=ans.size();
for(int i=0; i<sz; i++)
{
for(int j=i+2; j<sz; j++)
if(go[ans[i]][ans[j]])
{
ans.erase(ans.begin()+i+1,ans.begin()+j);
solve();
return ;
}
int j=0;
if(i==sz-1)
j=1;
for(; j<i; j++)
if(go[ans[i]][ans[j]])
{
ans.erase(ans.begin()+i+1,ans.end());
ans.erase(ans.begin(),ans.begin()+j);
solve();
return ;
}
}
cout<<ans.size()<<endl;
for(auto i : ans)
cout<<i<<"\n";
}
void dfs(int node)
{
if(vis2[node])
{
int x=node;
while(par[x]!=node)
ans.push_back(x), x=par[x];
ans.push_back(x);
reverse(ans.begin(),ans.end());
solve();
exit(0);
}
if(vis[node])
return ;
vis2[node]++;
vis[node]++;
for(auto i : v[node])
{
par[i]=node;
dfs(i);
}
vis2[node]--;
}
int main()
{
IO
cin>>n>>m;
while(m--)
{
int x, y ;
cin>>x>>y;
go[x][y]=1;
v[x].push_back(y);
}
for(int i=1; i<=n; i++)
dfs(i);
cout<<-1;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
string n;
cin >> n;
string ans = "No";
rep(i, 3) if (n[i] == '7') ans = "Yes";
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
if(n%10==7||n/10%10==7||n/100%10==7) cout<<"Yes"; else cout<<"No";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
#define dint long double
// tourist
bool cmp(pii a, pii b) {
return (a.first + a.second < b.first + b.second);
}
const int inf = 1e18;
void solve() {
int n; cin >> n;
pii a[n+1];
for(int i=1; i<=n; i++) {
cin >> a[i].first >> a[i].second;
}
// First -> Strenght, Second -> Weight
sort(a+1, a+n+1, cmp);
int dp[n+1][n+1];
for(int i=0; i<=n; i++) for(int j=0; j<=n; j++) dp[i][j] = inf;
dp[0][0] = 0;
for(int i=0; i<n; i++) {
for(int j=0; j<=i; j++) {
int wt = dp[i][j];
if(wt == inf) continue;
dp[i+1][j] = min(dp[i+1][j], wt);
if(wt <= a[i+1].first) {
dp[i+1][j+1] = min(dp[i+1][j+1], wt + a[i+1].second);
}
}
}
int ans = 0;
for(int i=0; i<=n; i++) {
if(dp[n][i] != inf) {
ans = i;
}
}
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(12);
int T = 1;
//cin >> T;
for(int i=1; i<=T; i++) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void recursive_comb(int *indexes, int s, int rest, function<void(int *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0) return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
void foreach_comb(int n, int k, function<void(int *)> f) {
int indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
int calc(string c) {
int ret = 0;
char lastOp = '+';
for (int i = 0; i < c.size(); i++) {
if (c[i] == '+') {
lastOp = '+';
} else if (c[i] == '-') {
lastOp = '-';
} else {
int num = atoi(c.substr(i, 1).c_str());
if (lastOp == '+') {
ret += num;
} else {
ret -= num;
}
}
}
return ret;
}
int main() {
// 入力
vector<char> S(4);
for (int i = 0; i < (int)S.size(); i++)
cin >> S.at(i);
int n = S.size() - 1;
for (int k = 0; k <= n; k++) {
foreach_comb(n, k, [S, n, k](int *indexes) {
vector<char> op(n);
for (int i = 0; i < n; i++) {
op.at(i) = '+';
}
for (int i = 0; i < k; i++) {
op.at(indexes[i]) = '-';
}
// 一つの文字列に連結
string c = "";
for (int i = 0; i < S.size(); i++) {
c += S.at(i);
if (i < op.size()) {
c += op.at(i);
}
}
// その文字列を計算する
int ret = calc(c);
if (ret == 7) {
cout << c << "=" << ret << endl;
exit(0);
}
});
}
}
| 0 |
//%std
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read()
{
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-')
fh = -1, jp = getchar();
while (jp >= '0' && jp <= '9')
out = out * 10 + jp - '0', jp = getchar();
return out * fh;
}
void print(int x)
{
if (x >= 10)
print(x / 10);
putchar('0' + x % 10);
}
void write(int x, char c)
{
if (x < 0)
putchar('-'), x = -x;
print(x);
putchar(c);
}
const int P = 998244353;
int add(int a, int b)
{
return a + b >= P ? a + b - P : a + b;
}
void inc(int &a, int b)
{
a = add(a, b);
}
int mul(int a, int b)
{
return 1LL * a * b % P;
}
const int N = 300 + 10;
int n, m = 0, K, a[N], dp[N][N][N];
char buf[N];
int main()
{
scanf("%s", buf + 1), n = strlen(buf + 1), K = min(n, read());
int cnt = 0;
for (int i = 1; i <= n; ++i)
if (buf[i] == '0')
a[++m] = cnt, cnt = 0;
else
++cnt;
if (cnt)
a[++m] = cnt;
dp[m + 1][0][0] = 1;
for (int i = m; i >= 1; --i)
{
for (int j = 0; j <= n; ++j)
for (int k = n; k >= 0; --k)
dp[i][j][k] = add(dp[i][j][k + 1], dp[i + 1][j][k]);
for (int p = 1; p <= a[i]; ++p)
for (int j = 0; j + p <= n; ++j)
for (int k = 0; k + p <= n; ++k)
inc(dp[i][j + p][k + p], dp[i + 1][j][k]);
}
int ans = 0;
for (int j = 0; j <= K; ++j)
inc(ans, dp[1][j][0]);
write(ans, '\n');
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 305, M = 998244353;
int dp[N][N][N];
vector<int> a;
int k;
int solve(int x, int cur, int rem) {
if (cur > k || rem < 0) return 0;
if (x == -1) return (rem == 0);
int &ret = dp[x][cur][rem];
if (~ret) return ret;
ret = 0;
for (int i = 0; i <= a[x]; ++i) {
ret = (ret + solve(x - 1, cur + i, rem + i)) % M;
}
for (int i = 1; i <= rem; ++i) {
ret = (ret + solve(x - 1, cur, rem - i)) % M;
}
return ret;
}
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
string s;
cin >> s >> k;
memset(dp, -1, sizeof dp);
a.push_back(0);
for (auto i : s) {
if (i == '0') a.push_back(0);
else a.back()++;
}
cout << solve((int)a.size() - 1, 0, 0) << '\n';
}
| 1 |
#include <vector>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m = min(__builtin_ctz(a), m);
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N, A;
cin >> N;
int times = 0;
int answer = 30;
for (int i=0; i < N; i++) {
cin >> A;
while (A % 2 == 0) {
times +=1;
A /=2;
}
if (times <= answer) answer = times;
times = 0;
}
cout << answer << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n=2;
vector<int> p[2];
int ans[2];
for(int i=0;i<n;++i){
for(int j=0,point;j<10;++j){
cin>>point;
p[i].push_back(point);
}
sort(p[i].begin(),p[i].end(),greater<int>());
ans[i]=p[i][0]+p[i][1]+p[i][2];
}
for(int i=0;i<n;++i)cout<<ans[i]<<((i==n-1)?"\n":" ");
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
int main(){
int a[12];
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d"
,&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9],&a[10],&a[11]) != EOF){
int ans = 0;
double t = 0, d = 0;
int sum = 0;
for(int i = 0;i < 10;i++){
sum += a[i];
}
t = (double)sum / (a[10]+a[11]);
d = (double)a[10] * t;
sum = 0;
for(int i = 0;i < 10;i++){
sum += a[i];
if(sum >= d){
ans = i + 1;
break;
}
}
cout << ans << endl;
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main() {
string s;
while(cin>>s){
int l=s.length();
for(int i=0;i<l;i++){
if(i==0) cout<<'2';
else if(i==1) cout<<'0';
else if(i==2) cout<<'1';
else if(i==3) cout<<'8';
else cout<<s[i];
}
cout<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353;
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
string s;
cin >> s;
string t = s.substr(4);
printf("2018%s\n", t.c_str());
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int P,Q,R,a,b,c,d;
cin>>P>>Q>>R;
a=P+Q;
b=Q+R;
c=R+P;
d=min({a,b,c});
cout<<d<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
vector<ll> v;
for(int i = 0; i < n; i++){
auto itr = lower_bound(v.begin(), v.end(), a[i]);
if(i == 0){
v.push_back(a[i]);
}else{
int p = distance(v.begin(), itr);
if(p == 0){
v.insert(v.begin(), a[i]);
}else{
p--;
v[p] = a[i];
}
}
}
cout << v.size() << endl;
} | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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 <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
#define INF 100000000000000
#define MAX_V 101
int V;
LL d[MAX_V][MAX_V];
void wf(){
REP(k,V)REP(i,V)REP(j,V){
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
int main(){
int E;
cin>>V>>E;
REP(i,V)REP(j,V)d[i][j]=(i==j)?0:INF;
REP(i,E){
int a,b,c;
cin>>a>>b>>c;
d[a][b]=c;
}
wf();
REP(i,V)if(d[i][i]<0){
cout<<"NEGATIVE CYCLE"<<endl;
return 0;
}
REP(i,V){
REP(j,V){
if(d[i][j]>2*10e9)cout<<"INF";
else cout<<d[i][j];
if(j!=V-1)cout<<" ";
}
cout<<endl;
}
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>
using namespace std;
typedef long long Long;
#define whole(xs) xs.begin(), xs.end()
#define uniq(xs) (xs.erase(unique(xs.begin(), xs.end()), xs.end()))
template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
if (vs.empty()) return os << "[]";
os << "[" << vs[0];
for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
return os << "]";
}
const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF
int V, E;
struct Edge {
int s, t, w;
Edge(int s, int t, int w) : s(s), t(t), w(w) {}
bool operator<(const Edge& e) const {
return w < e.w;
}
};
vector<Edge> G;
void Input() {
cin >> V >> E;
for (int i = 0; i < E; i++) {
int s, t, w; cin >> s >> t >> w;
G.push_back(Edge(s, t, w));
}
}
struct UnionFind {
int N;
vector<int> P;
UnionFind(int N) : N(N) {
P.clear(); P.resize(N, -1);
}
int query(int x) {
if (P[x] == -1) return x;
return P[x] = query(P[x]);
}
void merge(int x, int y) {
x = query(x); y = query(y);
if (x == y) return;
P[y] = x;
}
};
void Solve() {
sort(whole(G));
UnionFind uf(V);
int Ans = 0;
for (int i = 0; i < E; i++) {
Edge& e = G[i];
if (uf.query(e.s) == uf.query(e.t)) continue;
Ans += e.w;
uf.merge(e.s, e.t);
}
cout << Ans << endl;
}
int main() {
Input(); Solve();
return 0;
} | 0 |
#include <stdio.h>
int main() {
int rows, columns, n, tempR = 1, tempC = 1;
scanf("%d %d %d", &rows, &columns, &n);
int i = 1, j = 1;
while(tempR < n && i <= rows) {
tempR = i * columns;
i++;
}
while(tempC < n && j <= columns) {
tempC = j * rows;
j++;
}
if(i == 1 && j == 1) printf ("1");
else if(i < j) printf("%d", i - 1);
else printf("%d", j - 1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define maxn 1000010
template <typename T>inline T read()
{
register T sum=0;
register char cc=getchar();
int sym=1;
while(cc!='-'&&(cc>'9'||cc<'0'))cc=getchar();
if(cc=='-')sym=-1,cc=getchar();
sum=sum*10+cc-'0';
cc=getchar();
while(cc>='0'&&cc<='9')sum=sum*10+cc-'0',cc=getchar();
return sym*sum;
}
template <typename T>inline T read(T &a)
{
a=read<T>();
return a;
}
template <typename T,typename... Others> inline void read(T& a, Others&... b)
{
a=read(a);
read(b...);
}
int n,up,down,ans;
char s[maxn],t[maxn];
queue<int>Q;
int main()
{
read(n);
scanf("%s %s",s+1,t+1);
if(strcmp(s+1,t+1)==0)
{
puts("0");
return 0;
}
up=n,down=n;
while(down)
{
while(down>1&&t[down-1]==t[down])
down-=1;
while(up&&(up>down||s[up]!=t[down]))
up-=1;
if(!up)
{
puts("-1");
return 0;
}
while(!Q.empty()&&Q.front()-(int)Q.size()>=down)
Q.pop();
if(up!=down)
Q.push(up);
ans=max(ans,(int)Q.size()+1);
down-=1;
}
printf("%d\n",ans);
return 0;
}
| 0 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int i,a[10],b[10],s,ss;
for(i=0;i<10;i++){
scanf("%d",&a[i]);
// printf("a=%d\n",a[i]);
}
sort(a,a+10);
for(i=0;i<10;i++){
}
for(i=0;i<10;i++){
scanf("%d",&b[i]);
}
sort(b,b+10);
for(i=0;i<10;i++){
}
s=a[7]+a[8]+a[9];
ss=b[7]+b[8]+b[9];
printf("%d %d\n",s,ss);
return 0;
}
| #include <iostream>
using namespace std;
int getResult(int N, int H, int W){
int hPattern = N - H + 1;
int wPattern = N - W + 1;
if(hPattern <= 0 || wPattern <= 0) return 0;
return hPattern * wPattern;
}
int main(){
int N, H, W;
cin >> N >> H >> W;
int result = getResult(N, H, W);
cout << result;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) (V).begin(),(V).end()
#define MOD 1000000007
#define mod 998244353
int rw[100010];
vector<int> W[100010];
int main(){
for (int i = 0;i < 100010;i++)rw[i] = -1;
ll N, L;
cin >> N;
vector<ll> X(N);
for (int i = 0;i < N;i++)
cin >> X[i];
cin >> L;
for (int j = 0;j < N;j++) {
if (rw[j] >= 0)continue;
for (int i = j;i < N;) {
W[j].push_back(i);
if (rw[i] >= 0)break;
rw[i] = j;
auto it = upper_bound(all(X), X[i] + L);
it--;
i = it - X.begin();
}
}
//for (int i = 0;i < N;i++)cout << rw[i] << " ";
ll Q, a, b, c, d, ans = 0;
cin >> Q;
for (int i = 0;i < Q;i++) {
ans = 0;
cin >> a >> b;
if (a > b)swap(a, b);
a--;b--;
c = rw[a];
while (1) {
auto it = W[c].end();
it--;
d = *it;
if (d >= b)break;
ans += it - find(all(W[c]), a);
//cout << ans << endl;
a = d;
c = rw[a];
}
auto it1 = find(all(W[c]), a);
auto it2 = lower_bound(all(W[c]), b);
ans += it2 - it1;
cout << ans << endl;
}
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define eprintf(...) 42
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
clock_t startTime;
double getCurrentTime() {
return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const int N = 100100;
const int LOG = 17;
int n, L, q;
int Q[N][2];
int ANS[N];
int a[N];
int b[LOG][N];
void solve() {
int p = 0;
for (int i = 0; i < n; i++) {
while(p + 1 < n && a[p + 1] - a[i] <= L) p++;
b[0][i] = p;
}
for (int k = 0; k < LOG - 1; k++)
for (int i = 0; i < n; i++)
b[k + 1][i] = b[k][b[k][i]];
for (int i = 0; i < q; i++) {
int v = Q[i][0], u = Q[i][1];
if (v > u) continue;
int ans = 0;
for (int k = LOG - 1; k >= 0; k--) {
if (b[k][v] < u) {
v = b[k][v];
ans += 1 << k;
}
}
ANS[i] = ans + 1;
}
}
int main()
{
startTime = clock();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d%d", &L, &q);
for (int i = 0; i < q; i++) {
scanf("%d%d", &Q[i][0], &Q[i][1]);
Q[i][0]--;
Q[i][1]--;
}
solve();
for (int i = 0; i < q; i++) {
Q[i][0] = n - 1 - Q[i][0];
Q[i][1] = n - 1 - Q[i][1];
}
reverse(a, a + n);
for (int i = 0; i < n; i++)
a[i] *= -1;
solve();
for (int i = 0; i < q; i++)
printf("%d\n", ANS[i]);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int line[110][110],col[110][110];
short dp[101][101][101][101];
int main()
{
int n,m,x,y;scanf("%d%d\n",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
line[i][j]=line[i][j-1];col[i][j]=col[i-1][j];
char ch=getchar();
if (ch=='E') {x=i;y=j;}
else if (ch=='o') {line[i][j]++;col[i][j]++;}
if (j==m) scanf("\n");
}
int all=0;
for (int i=x;i>=1;i--)
for (int j=y;j>=1;j--)
for (int k=x;k<=n;k++)
for (int l=y;l<=m;l++)
{
all=max(all,(int)dp[i][j][k][l]);
if ((1<i)&&(k+1<x+i)) dp[i-1][j][k][l]=max((int)dp[i-1][j][k][l],dp[i][j][k][l]+line[i-1][min(l,m-y+j)]-line[i-1][max(j-1,l-y)]);
if ((k<n)&&(x+k<n+i)) dp[i][j][k+1][l]=max((int)dp[i][j][k+1][l],dp[i][j][k][l]+line[k+1][min(l,m-y+j)]-line[k+1][max(j-1,l-y)]);
if ((1<j)&&(l+1<y+j)) dp[i][j-1][k][l]=max((int)dp[i][j-1][k][l],dp[i][j][k][l]+col[min(k,n-x+i)][j-1]-col[max(i-1,k-x)][j-1]);
if ((l<m)&&(y+l<m+j)) dp[i][j][k][l+1]=max((int)dp[i][j][k][l+1],dp[i][j][k][l]+col[min(k,n-x+i)][l+1]-col[max(i-1,k-x)][l+1]);
}
cout<<all<<endl;
} | #include <bits/stdc++.h>
using namespace std;
void chmax(int& a, int b){
a = max(a, b);
}
int main(){
int H, W;
cin >> H >> W;
string S[101];
S[0] = string('!', W+1);
int ER, EC;
for(int i=1; i<=H; i++){
cin >> S[i];
S[i].insert(0, "!");
if(S[i].find('E') != -1){
ER = i;
EC = S[i].find('E');
}
}
int RS[101][101] = {0}, CS[101][101] = {0};
for(int i=1; i<=H; i++) for(int j=1; j<=W; j++){
RS[i][j] = RS[i][j-1];
CS[i][j] = CS[i-1][j];
if(S[i][j] == 'o'){
RS[i][j]++;
CS[i][j]++;
}
}
static int dp[101][101][101][101];
for(int u=0; ER-u>0; u++) for(int d=0; ER+d<=H; d++){
for(int l=0; EC-l>0; l++) for(int r=0; EC+r<=W; r++){
int ub = max(ER-u, d+1), db = min(ER+d, H-u);
int lb = max(EC-l, r+1), rb = min(EC+r, W-l);
if(ER-u-1 > 0){
int add = 0;
if(ER-u-1 >= d+1) chmax(add, RS[ER-u-1][rb] - RS[ER-u-1][lb-1]);
chmax(dp[u+1][d][l][r], dp[u][d][l][r] + add);
}
if(EC-l-1 > 0){
int add = 0;
if(EC-l-1 >= r+1) chmax(add, CS[db][EC-l-1] - CS[ub-1][EC-l-1]);
chmax(dp[u][d][l+1][r], dp[u][d][l][r] + add);
}
if(ER+d+1 <= H){
int add = 0;
if(ER+d+1 <= H-u) chmax(add, RS[ER+d+1][rb] - RS[ER+d+1][lb-1]);
chmax(dp[u][d+1][l][r], dp[u][d][l][r] + add);
}
if(EC+r+1 <= W){
int add = 0;
if(EC+r+1 <= W-l) chmax(add, CS[db][EC+r+1] - CS[ub-1][EC+r+1]);
chmax(dp[u][d][l][r+1], dp[u][d][l][r] + add);
}
}
}
cout << dp[ER-1][H-ER][EC-1][W-EC] << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> ii;
int fact[2000005];
int mod = 998244353;
long long qexp(long long b, long long p){
long long res = 1;
while(p){
if(p&1) res = (res * b) % mod;
b = (b * b) % mod;
p >>= 1;
}
return res;
}
int inv(long long b){ return qexp(b, mod-2); }
int choose(int N, int C){
if(N < C) return 0;
int res = fact[N];
res *= inv(fact[C]);
res %= mod;
res *= inv(fact[N-C]);
res %= mod;
return res;
}
int split(int total, int N){ ///split total objects to N groups
return choose(N + total - 1, N - 1);
}
int ans = 0;
void fix(int &x){
x %= mod;
if(x < 0) x += mod;
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(0);
fact[0] = 1;
for(int i = 1;i <= 2000000;i++) fact[i] = (fact[i-1] * i) % mod;
int N, M; cin >> N >> M;
for(int ones = 0;ones <= M;ones++){
int zeros = N - ones;
int leftover = 3*M - ones;
if(leftover & 1) continue;
leftover /= 2; ///The number of 2s to assign elsewhere
int ways01 = choose(N, ones); ///ways to arrange the 0s and 1s
int total2 = split(leftover, N); ///total ways to assign
int oneTooBig = ones * split(leftover - M, N);
int zeroTooBig = zeros * split(leftover - M - 1, N);
total2 -= oneTooBig;
total2 -= zeroTooBig;
fix(total2);
ans += total2 * ways01;
fix(ans);
}
cout << ans;
}
| //c++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#include <fstream>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define sz(x) ((int)(x).size())
//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
//const int MOD = 1000000007;
const int MOD = 998244353;
//int MOD = 1000000007;
double EPS = 1e-10;
vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};
void pres(double A){printf("%.12lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}
ll pow_long(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2) res *= x;
x *= x; k /= 2;
}
return res;
}
ll pow_mod(ll x, ll k){
x %= MOD;
ll res = 1;
while(k > 0){
if(k % 2){
res *= x; res %= MOD;
}
x *= x; x %= MOD;
k /= 2;
}
return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y){
ll res = x / gcd(x, y);
res *= y;
return res;
};
//コンビネーション
const int MAXcomb = 3000010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAXcomb; 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;
}
}
ll comb(int n, int k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
if(kai_memo[N] != 0) return kai_memo[N];
if(N <= 1) return 1;
return kai_memo[N] = N * kai(N-1) % MOD;
}
ll disit(ll s, ll base = 10){
ll res = 0;
while(s){
res++;
s /= base;
}
return res;
}
//約数の列挙O(√n)
vector<int> divisor(int n){
vector<int> res(0);
for(int i = 1; i * i <= n; i++){
if(n % i == 0){
res.push_back(i);
if(i != n/i) res.push_back(n/i);
}
}
sort(res.begin(), res.end());
return res;
}
ll N, M;
void solve(){
COMinit();
cin >> N >> M;
ll ans = 0;
for(ll x = 0; x <= M; x++){//奇数がx個
if(x % 2 != M % 2) continue;
ll all = 3 * M - x;
all /= 2;
ans += comb(N, x) * comb(all+N-1, all) % MOD;
ans %= MOD;
}
for(ll x = 0; x <= M; x++){//奇数がx個
if(x % 2 != M % 2) continue;
ll all = M - x;
all /= 2;
ans += MOD - N * comb(N, x) % MOD * comb(all+N-1, all) % MOD;
ans %= MOD;
}
for(ll x = 0; x <= M; x++){//奇数がx個
if(x % 2 != M % 2) continue;
ll all = M - x;
all /= 2;
ans += N * comb(N-1, x) % MOD * comb(all+N-2, all) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
solve();
}
| 1 |
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using namespace atcoder;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll a[500010];
int main(){
int n, q;
cin >> n >> q;
fenwick_tree<ll> fw(n);
rep(i, n) {
int a; cin >> a;
fw.add(i, a);
}
rep(i, q){
int b; cin >> b;
if (b == 0) {
int p;
ll x;
cin >> p >> x;
fw.add(p, x);
}
else {
int l, r; cin >> l >> r;
cout << fw.sum(l, r) << endl;
}
}
return 0;
}
| //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion
// ???
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion
// Effective std
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion
// ?????°
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#define INF numeric_limits<int>::infinity()
#pragma endregion
int main()
{
vi v1, v2;
rep(i,10) {
int a;
cin >> a;
v1.push_back(a);
}
rep(i,10) {
int a;
cin >> a;
v2.push_back(a);
}
sort(v1);
sort(v2);
printf("%d %d\n", v1[9]+v1[8]+v1[7], v2[9]+v2[8]+v2[7]);
return 0;
} | 0 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int N=in();
out(180*(N-2));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const int INF = 2e9;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
ll n;
cin >> n;
print(180 * (n - 2));
} | 1 |
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int,P> Pa;
int a, b, c, n;
vector<Pa> test;
int A[100], B[100], C[100];
int main(){
while(scanf("%d%d%d", &a, &b, &c)){
if(a == 0 && b == 0 && c == 0) break;
vector<Pa> test;
for(int i = 0; i < 100; i++){
A[i] = 2; B[i] = 2; C[i] = 2;
}
scanf("%d", &n);
for(int i = 0; i < n; i++){
int p, q, r, s;
scanf("%d%d%d%d", &p, &q, &r, &s);
q -= a; r -= (a+b);
p--; q--; r--;
if(s){
A[p] = 1;
B[q] = 1;
C[r] = 1;
} else{
test.push_back(Pa(p,P(q,r)));
}
}
for(int i = 0; i < test.size(); i++){
if(A[test[i].first]==1&&B[test[i].second.first]==1) C[test[i].second.second] = 0;
else if(A[test[i].first]==1&&C[test[i].second.second]==1) B[test[i].second.first] = 0;
else if(B[test[i].second.first]==1&&C[test[i].second.second]==1) A[test[i].first] = 0;
}
for(int i = 0; i < a; i++) printf("%d\n", A[i]);
for(int i = 0; i < b; i++) printf("%d\n", B[i]);
for(int i = 0; i < c; i++) printf("%d\n", C[i]);
}
} | #include <iostream>
using namespace std;
int main(){
while(1){
int a, b, c, n, list[1001][4], parts[301], judge, defect;
cin >> a >> b >> c >> n;
if(a == 0 && b == 0 && c == 0){
break;
}
for(int i = 1; i <= a + b + c; i++){
parts[i] = 2;
}
for(int i = 0; i < n; i++){
for(int j = 0; j < 4; j++){
cin >> list[i][j];
}
if(list[i][3] == 1){
for(int k = 0; k < 3; k++){
parts[list[i][k]] = 1;
}
}
}
for(int i = 0; i < n; i++){
if(!list[i][3]){
judge = 0;
for(int j = 0; j < 3; j++){
if(parts[list[i][j]] == 1){
judge++;
} else{
defect = j;
}
}
if(judge == 2){
parts[list[i][defect]] = 0;
}
}
}
for(int i = 1; i <= a + b + c; i++){
cout << parts[i] << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m, d; cin >> n >> m >> d;
cout << fixed << setprecision(10) << (ld)(d==0 ? 1 : 2)*(n-d)*(m-1)/n/n << endk;
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1 };
namespace {
template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
// 標準出力
void Write(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Write(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T, typename U> void Write(const T& x, const U& y, const char* end = "\n") { std::cout << x << " " << y << end; }
template <typename T, typename U, typename V> void Write(const T& x, const U& y, const V& z, const char* end = "\n") { std::cout << x << " " << y << " " << z << end; }
//template <typename... Args> void Write(Args const&... args) { bool a = true; for (auto const& x : { args... }) { if (a) a = false; else std::cout << " "; std::cout << x; } std::cout << "\n"; }
template <typename T> void Write(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
template <typename T> void Write(const std::vector<std::vector<T>>& x, const char* sep = " ", const char* end = "\n") { for (auto v : x) Write(v, sep, end); }
// 標準入力
struct Read {
std::size_t szi, szj;
Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
template <typename T> operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
}
template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
std::vector<std::pair<T, U>> a(szi);
for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
}
};
struct Reads {
template <typename T> Reads(T& a) { std::cin >> a; }
template <typename T, typename U> Reads(T& a, U& b) { std::cin >> a >> b; }
template <typename T, typename U, typename V> Reads(T& a, U& b, V& c) { std::cin >> a >> b >> c; }
template <typename T, typename U, typename V, typename W> Reads(T& a, U& b, V& c, W& d) { std::cin >> a >> b >> c >> d; }
};
Read read;
}
int main() {
int n, m, d; Reads(n, m, d);
double ans;
// 隣同士の差がdであるものの個数の平均
ans = (double)((n - d) * 2) / (n * (double)n) * (m - 1);
if (d == 0) ans /= 2.0;
cout << fixed << setprecision(8) << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char arr[10];
scanf("%s", arr);
int rCount = 0, ans = 0;
for (int i = 0; i < 3; ++i) {
if (arr[i] == 'R') {
rCount++;
} else {
ans = max(ans, rCount);
rCount = 0;
}
}
ans = max(ans, rCount);
printf("%d\n", ans);
return 0;
} | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int N;
cin >> N;
cout << N / 3 << endl;
}
| 0 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-10;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
//ここから編集
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N, M;
cin >> N >> M;
vector<vector<int>> g(N);
REP(i,M){
int a, b; cin >> a >> b;
a--; b--;
g[a].push_back(b);
}
int mi = N+1;
vector<int> res;
for(int s = 0; s<N; s++){
vector<int> dist(N, -1);
vector<int> prev(N, -1);
queue<int> q;
q.push(s);
dist[s] = 0;
while(q.size()){
auto v = q.front();
q.pop();
for(auto u: g[v]){
if(dist[u] == -1){
dist[u] = dist[v] + 1;
prev[u] = v;
q.push(u);
}
}
}
for(int t = 0; t<N; t++){
if(t == s || dist[t] == -1) continue;
for(auto v: g[t]){
if(v == s){
vector<int> tmp({s});
int cur = t;
while(cur != s) tmp.push_back(cur), cur = prev[cur];
if(mi > tmp.size()){
mi = tmp.size();
res = tmp;
}
}
}
}
}
if(mi == N+1){
cout << -1 << endl;
}else{
cout << res.size() << endl;
for(auto e: res) cout << e+1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1001, M = 2001;
int n, m, a, b;
vector<int> edge[N];
vector<int> path;
unordered_map<int, int> mp;
bool check(int from, int to) {
int s = mp[from];
int e = mp[to];
// index [s, e] in path
for (int i = s; i <= e; ++i) {
int cur = path[i];
int next = (i == e ? path[s] : path[i + 1]);
for (int v : edge[cur]) {
if (v != next) {
if (mp.count(v) && mp[v] >= s) {
return false;
}
}
}
}
return true;
}
void dfs(int u) {
for (int v : edge[u]) {
if (mp.count(v)) {
// find cycle
if (check(v, u)) {
int s = mp[v];
int e = mp[u];
cout << e - s + 1 << endl;
for (int i = s; i <= e; ++i) {
cout << path[i] << endl;
}
exit(0);
}
} else {
path.push_back(v);
mp[v] = path.size() - 1;
dfs(v);
mp.erase(v);
path.pop_back();
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
edge[a].push_back(b);
}
for (int i = 1; i <= n; ++i) {
path.push_back(i);
mp[i] = 0;
dfs(i);
mp.erase(i);
path.pop_back();
}
cout << -1 << endl;
return 0;
}
| 1 |
#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;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define vint(a,n) vint a(n); rep(i, n) cin >> a[i];
#define vll(a,n) vll a(n); rep(i, n) cin >> a[i];
#define ALL(n) begin(n),end(n)
#define RALL(n) rbegin(n),rend(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vector<int>;
using vll=vector<ll>;
using vbool=vector<bool>;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
int n; cin >> n;
vll(a, n);
ll neg=0, sum=0, min=INFL;
rep(i, n){
if(a[i]<0) neg++;
sum += abs(a[i]);
chmin(min, abs(a[i]));
}
if(neg%2==0) pr(sum);
else pr(sum - 2*min);
return 0;} | //Name: Baseball Simulation
//Level: 1
//Category: やるだけ
//Note:
/**
* 仕様のとおりに実装する。
*
* オーダーは O(E)。
* ただし、Eはイベントの個数。
*/
#include <iostream>
#include <string>
using namespace std;
bool solve() {
int out = 0;
int b1 = 0, b2 = 0, b3 = 0;
int score = 0;
while(out < 3) {
string event;
cin >> event;
if(event == "HIT") {
if(b3) ++score;
b3 = b2; b2 = b1; b1 = 1;
} else if(event == "HOMERUN") {
score += b1+b2+b3+1;
b1 = b2 = b3 = 0;
} else if(event == "OUT") {
++out;
}
}
cout << score << endl;
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int T;
cin >> T;
while(T--) solve();
return 0;
} | 0 |
#define _GLIBCXX_DEBUG //vectorの範囲外アクセスなどのエラーメッセージが分かりやすくなるらしい
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
//#include <algorithm>
// using namespace std;
#include<numeric>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<cstring>
#include<cmath>
#include<complex>
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define FOR(i,c) for(typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define EXIST(e,s)((s).find(e)!=(s).end())
#define RESET(a) memset((a),0,sizeof(a))
#define SET(a) memset((a),-1,sizeof(a))
#define ll long long
using namespace std;
int main(void){
int n;
int p;
int temoto[50];
int wan;
bool flag;
while(cin >> n >> p, n || p){
flag = false;
memset(temoto, 0, sizeof(temoto[0])*50);
wan = p;
while(1){
for(int i=0; i<n; i++){
if(wan > 0){
wan--;
temoto[i]++;
if(temoto[i] == p){
cout << i << endl;
flag = true;
break;
}
}else{
wan += temoto[i];
temoto[i] = 0;
}
}
if(flag){
break;
}
}
}
return 0;
} | #include <iostream>
#include<iomanip>
using namespace std;
int main() {
int n;
while (cin >> n) {
if(n == 0)
break;
int A[51][51] = {};
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
cin >> A[i][j];
A[i][n] += A[i][j];
A[n][j] += A[i][j];
}
A[n][n] += A[i][n];
}
for(int i=0;i<=n;i++) {
for(int j=0;j<n;j++) {
cout << setw(5)<< A[i][j];
}
cout << setw(5)<< A[i][n];
cout << "\n";
}
}
return 0;
}
| 0 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <cstdint>
#include <istream>
#include <sstream>
#include <cctype>
#include <functional>
#include <iomanip>
#define rep(i,N) for(ll i=0;i<N;i++)
#define disp(a) cout << a << endl;
#define PI 3.1415926535897932384626433
//cout << fixed << setprecision(20) << ** << endl;
typedef long long ll;
using namespace std;
double deg2rad(double degree)
{
return degree * PI / 180.0000000000;
}
int main()
{
string s,ANS="Yes";
cin>>s;
if(s.size()%2!=0){
cout<<"No"<<endl;
}
else{
for(int i=0;i<s.size();i=i+2){
if(s[i]=='h'&&s[i+1]=='i'){
continue;
}
else{
ANS="No";
}
}
cout<<ANS<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=(a),_ed=(b);i<=_ed;++i)
#define DREP(i,a,b) for(int i=(a),_ed=(b);i>=_ed;--i)
typedef long long ll;
inline int read(){
register int x=0,f=1;register char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch)){x=x*10+(ch^'0');ch=getchar();}
return f?x:-x;
}
const char s[4][7][8]={{"aaba","ccba","abcc","abaa"},
{"aa.ab",".bbab","a.cca","a.a.a","bbabb"},
{"aaca..","bbca..","ac..aa","ac..bb","..aaca","..bbca"},
{"aaca...","bbca...","ac.bb..","ac...aa","..a.abb","..a.a.a","..ccbba"}};
int main(){
//freopen("in.in","r",stdin);
int n=read(),k=n%4+4;
if(n<3)return puts("-1"),0;
if(n==3)return puts("aab\nb.b\nbaa"),0;
for(int _=1,j=0;_<=n-k;_+=4,++j){
int m=j*4;
REP(t,0,3){
REP(i,1,m)putchar('.');
REP(i,0,3)putchar(s[0][t][i]);
REP(i,m+5,n)putchar('.');
puts("");
}
}
int m=k%4;
REP(t,0,k-1){
REP(i,1,n-k)putchar('.');
REP(i,0,k-1)putchar(s[m][t][i]);
puts("");
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
bool Solve(int n, const vector<int>& xs) {
if (n == 1) {
return false;
}
int even_count = 0;
for (int x : xs) {
if (x % 2 == 0) even_count++;
}
if (n % 2 == 0) {
return even_count % 2 == 1;
} else {
if (even_count <= n - 2) {
return even_count % 2 == 1;
} else {
vector<int> ys(n);
for (int i = 0; i < n; i++) {
if (xs[i] % 2 == 1) {
if (xs[i] == 1) return false;
ys[i] = xs[i] - 1;
} else {
ys[i] = xs[i];
}
}
int d = ys[0];
for (int i = 1; i < n; i++) {
d = gcd(ys[i], d);
}
for (int i = 0; i < n; i++) {
ys[i] /= d;
}
return !Solve(n, ys);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> xs(n);
for (int i = 0; i < n; i++) {
cin >> xs[i];
}
bool ans = Solve(n, xs);
if (ans) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
constexpr ll mod = 1000000007;
int main() {
int n;
scanf("%d",&n);
map<int,int> mp;
for(int i = 2; i <= n; i++) {
int m = i;
for(int j = 2; j <= n; j++) {
while(m % j == 0) {
mp[j]++;
m /= j;
}
}
}
ll ans = 1;
for(auto c : mp) {
ans *= c.second+1;
ans %= mod;
}
printf("%ld\n",ans);
} | 0 |
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fitr(it,it1,itr2) for(auto it=itr1;it!=itr2;++it)
#define fall(a) a.begin(),a.end()
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define eq equal_range
#define fs first
#define ss second
#define ins insert
#define mkp make_pair
#define PI 3.1415926535897932384626433832795
#define endl "\n"
using namespace std;
typedef vector<ll> vll;
typedef vector<int> vin;
typedef vector<char> vch;
typedef vector<string> vst;
typedef vector<vector<ll>> vvll;
typedef vector<pair<ll,ll>> vpll;
typedef set<ll> sll;
typedef set<int> sint;
typedef set<char> sch;
typedef set<string> sst;
typedef queue<ll> qll;
typedef priority_queue<ll> pqll;
typedef map<ll,ll> mll;
typedef pair<ll,ll> pll;
const ll MOD=1000000007;
ll pwr(ll b,ll p){ll res=1;while(p){if(p&1) {res*=b; p--;}else{b*=b; p>>=1;}}return res;}
int main()
{
ios_base::sync_with_stdio(false) , cin.tie(NULL) , cout.tie(NULL);
ll n;
cin>>n;
ll cnt=0;
cnt+=n/11;
cnt*=2;
int r=n%11;
if (r!=0 && r<=6) ++cnt;
else if (r!=0) cnt+=2;
cout<<cnt;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x;
cin >> x;
int64_t a = x/11*2;
if(x%11 == 0){
cout << a << endl;
}
else if(x%11 <= 6){
cout << a+1 << endl;
}
else{
cout << a+2 << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
ll x; cin >> x;
ll n = x / 11;
ll ans = 2 * n + ((x - 11 * n) + 5) / 6;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
ll x;
cin>>x;
ll d=x/11;
ll r=x%11;
if(0==r){
cout<<2*d<<endl;
}else{
if(r<7){
cout<<2*d+1ll<<endl;
}else{
cout<<2*d+2ll<<endl;
}
}
return 0;
} | 1 |
/**
* Sergey Kopeliovich ([email protected])
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 998244353;
typedef long long ll;
inline void add( int &a, int b ) { if ((a += b) >= MOD) a -= MOD; }
inline void sub( int &a, int b ) { if ((a -= b) < 0) a += MOD; }
inline int mul( int a, int b ) { return (ll)a * b % MOD; }
int Pow( int x, ll n ) {
if (n == 1) return x;
int y = Pow(x, n / 2);
return (n & 1) ? mul(mul(y, y), x) : mul(y, y);
}
int Inv( int a ) { return Pow(a, MOD - 2); }
int Div( int a, int b ) { return mul(a, Inv(b)); }
// int C( int n, int k ) {
// int res = 1;
// forn(i, k) {
// res = mul(res, n - i);
// res = mul(res, Inv(i + 1));
// }
// return res;
// }
const int N = 103;
int f[N][N];
int calc( int a, int b ) {
if (a < 0 || b < 0) return 0;
if (a > b) swap(a, b);
if (!a && !b)
return 0;
int &res = f[a][b];
if (!res) {
res = mul(Div(a, a + b), calc(a - 1, b));
add(res, mul(Div(b, a + b), 1 + calc(a, b - 1)));
}
return res;
}
double f2[N][N];
double calc2( int a, int b ) {
if (a < 0 || b < 0) return 0;
if (a > b) swap(a, b);
if (!a && !b)
return 0;
double &res = f2[a][b];
if (res == 0) {
res = 1. * a / (a + b) * calc2(a - 1, b) +
1. * b / (a + b) * (1 + calc2(a, b - 1));
}
return res;
}
double calc3( int last, int i, int balance, int n ) {
double add = 0;
if (balance == 0 && i < 2 * n)
add += 0.5;
// if (balance == 0)
// add += (i - last) / 2, last = i;
if (i == 2 * n)
return add;
if (i + balance < 2 * n) {
double rest = 2 * n - i, good = (rest + balance) / 2.0;
add += good / rest * calc3(last, i + 1, balance - 1, n);
add += (rest - good) / rest * calc3(last, i + 1, balance + 1, n);
} else {
add += calc3(last, i + 1, balance - 1, n);
}
return add;
}
int main() {
int n, m;
cin >> n >> m;
// assert(n == m);
if (n < m)
swap(n, m);
int res = n, tmp = 0;
vector<int> fact(2 * n + 1);
fact[0] = 1;
forn(i, 2 * n)
fact[i + 1] = mul(fact[i], i + 1);
auto C = [&]( int n, int k ) {
return Div(fact[n], mul(fact[n - k], fact[k]));
};
int all = C(n + m, n);
for (int i = 0; i < m; i++) {
add(tmp, mul(C(n + m - 2 * (m - i), i), C(2 * (m - i), m - i)));
}
add(res, Div(tmp, all * 2 % MOD));
printf("%d\n", res);
// printf("%d\n", calc(n, n));
// printf("%.7f\n", calc2(n, n));
// printf("%.7f\n", calc3(0, 0, 0, n) + n);
}
| #include<bits/stdc++.h>
#define fi first
#define se second
#define R register
#define mp make_pair
#define pb push_back
#define LL long long
#define Ldb long double
#define pii pair<int, int>
using namespace std;
const int N = 1e6 + 10;
const int mod = 998244353;
template <typename T> void read(T &x) {
int f = 0;
R char c = getchar();
while (c < '0' || c > '9') f |= (c == '-'), c = getchar();
for (x = 0; c >= '0' && c <= '9'; c = getchar())
x = x * 10 - '0' + c;
if (f) x = -x;
}
int Qpow(int x, int p) {
int ans = 1;
while (p) {
if (p & 1) ans = 1LL * ans * x % mod;
x = 1LL * x * x % mod;
p >>= 1;
}
return ans;
}
int Inv(int x) {
return Qpow(x, mod - 2);
}
// ------------------------------------------
int n, m;
int inv[N], fac[N], fav[N];
int C(int x, int y) {
return 1LL * fac[x] * fav[y] % mod * fav[x - y] % mod;
}
int main() {
read(n); read(m);
if (n > m) swap(n, m);
fac[0] = fav[0] = 1;
inv[1] = fac[1] = fav[1] = 1;
for (int i = 2; i <= n + m; ++i) {
inv[i] = 1LL * -mod / i * inv[mod % i] % mod +mod;
fac[i] = 1LL * fac[i - 1] * i % mod;
fav[i] = 1LL * fav[i - 1] * inv[i] % mod;
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
int tmp = 1LL * C(i * 2 - 1, i) * C(n + m - i * 2, n - i) % mod;
ans = (ans + tmp >= mod) ? (ans + tmp - mod) : (ans + tmp);
}
ans = (n - 1LL * ans * Inv(C(n + m ,n))) % mod;
ans = n + m - ans;
if (ans < 0) ans += mod;
cout << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int N = s.size();
bool b = true;
int l = 0, r = 0, eli = 0;
for (int i = 0; i < N; i++) {
if (!b && s[i] == 'S') {
b = true;
int p = min(l,r);
eli += 2*p;
l -= p; r = 0;
}
if (s[i] == 'S') l++;
if (s[i] == 'T') {
b = false;
r++;
}
}
eli += 2*min(l,r);
cout << N - eli << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
string N;cin>>N;
reverse(N.begin(),N.end());
vector<vector<ll>> dp(1000010,vector<ll>(2/*桁上がりあるか*/,INF));
dp[0][0]=0;
N.push_back('0');
for(ll i=0;i<N.size();i++){
ll now=N[i]-'0';
//前桁上がり判定ありの時
ll nowb=now+1;
if(dp[i][1]!=INF){
//今equal
chmin(dp[i+1][0],dp[i][1]+nowb);
//今もbigger
chmin(dp[i+1][1],dp[i][1]+(10-nowb));
}
//前桁上がり判定無し
if(dp[i][0]!=INF){
//今桁上がり判定無し
chmin(dp[i+1][0],dp[i][0]+now);
//今桁上がり判定あり
chmin(dp[i+1][1],dp[i][0]+(10-now));
}
}
cout<<min(dp[N.size()][0],dp[N.size()][1])<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n,m;
cin >> n >> m;
vector<int> box(n,10);
int ans = 0;
rep(i,m){
int s;
int c;
cin >> s >>c;
s--;
if(s==0&&c==0&&n!=1) ans = -1;
if(box[s]==c)continue;
if(box[s]==10)box[s]=c;
if(box[s]!=c)ans = -1;
}
if(n==1){
if(ans==-1) cout << -1 << endl;
else if(box[0]==10)cout << 0 << endl;
else cout << box[0] << endl;
return 0;
}
rep(i,n){
if((i==0)&&box[i]==10)box[i]=1;
if(box[i]==10)box[i]=0;
}
if(ans==-1)cout<<-1 <<endl;
else {
rep(i,n) cout << box[i];
cout << endl;
}
return 0;
}
| #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int MAXN=1e7+5;
int n,ans;
int deq[MAXN],l,r;
char s[MAXN],t[MAXN];
int main(){
scanf("%d%s%s",&n,s+1,t+1);
if(strcmp(s+1,t+1)==0) return puts("0"),0;
l=1,r=0;
for(int i=n,j=n;i>=1;i--){
if(t[i]==t[i-1]) continue;
j=min(i,j);
while(j&&t[i]!=s[j]) j--;
if(!j) return puts("-1"),0;
while(l<=r){
if(deq[l]-(r-l)>i) l++;
else break;
}
deq[++r]=j;
if(i!=j) ans=max(ans,r-l+1);
}
printf("%d",ans+1);
fclose(stdin);
fclose(stdout);
} | 0 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long a,b[2],c[2],d[2];
string bb,cc,dd,s[2];
s[0]="+";
s[1]="-";
cin>>a;
b[0]=(a/100)%10;
b[1]=(-1)*b[0];
c[0]=(a/10)%10;
c[1]=(-1)*c[0];
d[0]=a%10;
d[1]=(-1)*d[0];
a/=1000;
f(i,0,2){
f(j,0,2){
f(k,0,2){
if(a+b[i]+c[j]+d[k]==7){
bb=s[i];
cc=s[j];
dd=s[k];
break;
}
}
}
}
cout<<a<<bb<<b[0]<<cc<<c[0]<<dd<<d[0]<<"="<<7<<endl;
return 0;
}
| #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep01(i, n) for(int i = 0; i < (n) + 1; i++)
#define rep10(i, n) for(int i = 1; i < (n); i++)
#define all(a) (a).begin(), (a).end()
typedef long long int ll;
using namespace std;
//ABC079C
int main()
{
string s;
cin >> s;
int a[4];
rep(i, 4) a[i] = s[i] - 48;
char sig[3];
rep(i, 1 << 3) {
int sum = a[0];
rep(bit, 3) {
if (i & 1 << bit) {
sum += a[bit + 1];
sig[bit] = '+';
}
else {
sum -= a[bit + 1];
sig[bit] = '-';
}
}
if (sum == 7) break;
}
cout << s[0] << sig[0] << s[1] << sig[1] << s[2] << sig[2] << s[3] << "=7" << endl;
return 0;
} | 1 |
#include <stdio.h>
#include <string.h>
int
main(void)
{
char line[100];
char res[100];
auto chksep = [](char c) -> bool {
return (c == ' ' || c == '.' || c == '\n');
};
while (fgets(line, sizeof line, stdin)) {
int len = strlen(line);
int state = 0;
for (int s = 0; s < 26; s++) {
for (int i = 0; i < len; i++) {
if (chksep(line[i])) {
res[i] = line[i];
} else {
int c = line[i] + s;
; if (c > 'z') {
res[i] = c - 'z' + 'a' - 1;
} else {
res[i] = c;
}
}
switch (state) {
case 0:
if (res[i] == 't') {
state = 1;
}
break;
case 1:
if (res[i] == 'h') {
state = 2;
} else {
state = 0;
}
break;
case 2:
if (res[i] == 'e') {
state = 5;
} else if (res[i] == 'i') {
state = 3;
} else if (res[i] == 'a') {
state = 4;
} else {
state = 0;
}
break;
case 3:
if (res[i] == 's') {
state = 5;
} else {
state = 0;
}
break;
case 4:
if (res[i] == 't') {
state = 5;
} else {
state = 0;
}
break;
case 5:
if (chksep(res[i])) {
state = 99;
} else {
state = 0;
}
break;
}
}
if (state == 99) {
res[len] = 0;
printf("%s", res);
break;
}
}
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(){
int days[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
char week2[7][10] = {"Thursday","Friday","Saturday","Sunday","Monday","Tuesday","Wednesday"};
int month,day;
int sum;
cin >> month >> day;
while((month != 0) && (day != 0)){
sum = 0;
for(int i=0 ;i < month - 1;i++){
sum += days[i];
}
sum += day;
switch(sum % 7){
case 1:
printf("%s\n",week2[0]);
break;
case 2:
printf("%s\n",week2[1]);
break;
case 3:
printf("%s\n",week2[2]);
break;
case 4:
printf("%s\n",week2[3]);
break;
case 5:
printf("%s\n",week2[4]);
break;
case 6:
printf("%s\n",week2[5]);
break;
case 0:
printf("%s\n",week2[6]);
break;
}
cin >> month >> day;
}
} | 0 |
/*input
abracadabra
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;
int raise(int a,int n,int m = MOD){
if(n == 0)return 1;
if(n == 1)return a;
int x = 1;
x *= raise(a,n/2,m);
x %= m;
x *= x;
x %= m;
if(n%2)x*= a;
x %= m;
return x;
}
int floor1(int n,int k){
if(n%k == 0 || n >= 0)return n/k;
return (n/k)-1;
}
int ceil1(int n,int k){
return floor1(n+k-1,k);
}
int freq[26];
void solve(){
int n;
string s;
cin >> s;n = s.size();
s = "$"+s;
int ans = 0;
int dd = 0;
RE(i,n){
freq[s[i]-'a']++;
}
REP(i,26){
REP(j,i){
ans += freq[i]*freq[j];
}
}
cout << ans+1;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen(".in","r",stdin);freopen(".out","w",stdout);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int main(){
string s;
cin >> s;
map<char, long long> T;
for(long long i = 0; i < s.size(); i++){
if(T.find(s[i]) == T.end()) T[s[i]] = 1;
else T[s[i]]++;
}
map<char, long long>::iterator it;
long long ans = 0;
for(it = T.begin(); it != T.end(); it++){
if(it->second >= 2) ans += it->second*(it->second-1)/2;
}
cout << 1+s.size()*(s.size()-1)/2 - ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, std::string S, long long Q, std::vector<long long> k)
{
for (ll i = 0; i < Q; i++) {
ll D = 0;
ll M = 0;
ll DM = 0;
ll DMC = 0;
ll ans = 0;
for (ll j = 0; j < N; j++) {
if (j - k[i] >= 0) {
if (S[j - k[i]] == 'D') {
D--;
DM -= M;
}
if (S[j - k[i]] == 'M') {
M--;
}
}
if (S[j] == 'D') {
D++;
}
if (S[j] == 'M') {
M++;
DM += D;
}
if (S[j] == 'C') {
DMC += DM;
}
ans = max(ans, DMC);
}
cout << ans << "\n";
}
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main()
{
long long N;
scanf("%lld", &N);
std::string S;
std::cin >> S;
long long Q;
scanf("%lld", &Q);
std::vector<long long> k(Q - 1 - 0 + 1);
for (int i = 0; i < Q - 1 - 0 + 1; i++) {
scanf("%lld", &k[i]);
}
solve(N, S, Q, std::move(k));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
using ll = long long;
using V = vector<int>;
using Vll = vector<ll>;
using VV = vector<V>;
using VVll = vector<Vll>;
char s[1000000];
ll t[3][1000001];
int main() {
int n, q;
scanf("%d%s%d", &n, s, &q);
VV pos(3, V());
char dmc[3] = {'D', 'M', 'C'};
rep(i, n) rep(j, 3) {
t[j][i+1] = t[j][i];
if (s[i] == dmc[j]) {
++t[j][i+1];
pos[j].push_back(i);
}
}
rep(_, q) {
int k;
scanf("%d", &k);
ll ans = 0;
for (auto &c : pos[2]) ans += t[1][c] * (t[0][c] - t[0][max(c-k+1, 0)]);
for (auto &a : pos[0]) ans -= t[1][a+1] * (t[2][min(a+k, n)] - t[2][a+1]);
printf("%lld\n", ans);
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a)
#define chmin(x, a) x = min(x, a)
int main() {
int H, W, A, B; cin >> H >> W >> A >> B;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (j < A && i < B) cout << 1;
else if (j >= A && i >= B) cout << 1;
else cout << 0;
}
cout << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<char,int> P;
char S[1000001];
vector<P> V;
int main() {
scanf("%s",S);
char ch=S[0];
int cnt=0;
for(int i=0;S[i]!='\0';i++) {
if(ch==S[i]) {
cnt++;
}else {
V.push_back(P(ch,cnt));
cnt=1;
ch=S[i];
}
}
V.push_back(P(ch,cnt));
int ans=0;
for(int i=0;i+2<V.size();i++) {
if(V[i].first!='J'||V[i+1].first!='O'||V[i+2].first!='I') continue;
if(V[i].second>=V[i+1].second&&V[i+2].second>=V[i+1].second) {
ans=max(ans,V[i+1].second);
}
}
printf("%d\n",ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
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);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
int main() {
SPEED
string S; cin >> S;
int N = S.size();
int K; cin >> K;
auto R = multivector(N, 26,-1);
auto L = multivector(N, 26,-1);
vector<int> cnt(26,-1);
for(int i = 0; i < N; ++i) {
L[i] = cnt;
cnt[S[i]-'a'] = i;
}
for(int a = 0; a < 26; ++a){
cnt[a] = -1;
}
for(int i = N-1; 0 <= i; --i) {
R[i] = cnt;
cnt[S[i]-'a'] = i;
}
auto dp = multivector((K+2)*N*N,0);
for(int i = 0; i < N; ++i) {
for(int k = 0; k <= K; ++k) {
dp[k*N*N+i*N+i] = 1;
}
}
for(int i = 0; i+1 < N; ++i) {
for(int k = 0; k <= K; ++k) {
if(S[i]==S[i+1]) dp[k*N*N+i*N+i+1] = 2;
else dp[k*N*N+i*N+i+1] = (k?2:0);
}
}
for(int i = 0; i < N; ++i) {
for(int j = 0; j + i < N; ++j){
int l = j, r = j + i;
for(int k = 0; k <= K; ++k) {
//コストが発生しないとき
for(int a = 0; a < 26; ++a){
int x = L[l][a],y = R[r][a];
if(x==-1||y==-1) continue;
chmax(dp[k*N*N+x*N+y],dp[k*N*N+l*N+r]+2);
}
//コストが発生するとき
if(0<=l-1&&r+1<N) chmax(dp[(k+1)*N*N+(l-1)*N+r+1],dp[k*N*N+l*N+r]+2);
}
}
}
int ans = 0;
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N; ++j){
for(int k = 0; k <= K; ++k) {
chmax(ans,dp[k*N*N+i*N+j]);
}
}
}
cout << ans << endl;
return 0;
} | #include <cstdio>
typedef long long ll;
inline ll rd(){
ll x=0,p=1;
char a=getchar();
while((a<48||a>57)&&a!='-')a=getchar();
if(a=='-')p=-p,a=getchar();
while(a>47&&a<58)x=(x<<1)+(x<<3)+(a&15),a=getchar();
return x*p;
}
const int N=2002;
const ll mod=1e9+7;
inline ll fpow(ll b,ll p,ll mod){
ll ans=1,tmp=b;
while(p){
if(p&1)ans=ans*tmp%mod;
tmp=tmp*tmp%mod;
p>>=1;
}
return ans;
}
int n,k;
ll fac[N*N],inv[N*N],f[N][N];
inline ll C(int n,int m){
return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main(){
fac[0]=1;
n=rd(),k=rd();
if(k==1)return puts("1"),0;
for(int i=1;i<=4000000;i++)fac[i]=fac[i-1]*i%mod;
f[0][0]=1;
inv[4000000]=fpow(fac[4000000],mod-2,mod);
for(int i=3999999;i>=0;i--)inv[i]=(inv[i+1]*(i+1))%mod;
for(int i=1;i<=n;i++)
for(int j=0;j<=i;j++){
f[i][j]=f[i-1][j];
if(j)f[i][j]=(f[i][j]+f[i][j-1]*(n-j+1)%mod*C(n-i+(n-j+1)*(k-1)-1,k-2)%mod)%mod;
}
printf("%lld\n",f[n][n]);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> ans;
for (int i = 0; i < N; i++) {
auto it = lower_bound(ans.rbegin(), ans.rend(), A[i]);
if (it == ans.rbegin()) ans.push_back(A[i]);
else *(it-1) = A[i];
}
cout << sz(ans) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int> A(N), B(N), C(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
sort(A.begin(), A.end());
sort(B.begin(), B.end());
sort(C.begin(), C.end());
vector<int64_t> M(N);
for (int i = 0; i < N; i++) {
int l = -1;
int r = N;
while (r - l > 1) {
int mid = (l + r) / 2;
if (A.at(mid) < B.at(i)) {
l = mid;
}
else {
r = mid;
}
}
M.at(i) = (l + 1);
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
int l = -1;
int r = N;
while (r - l > 1) {
int mid = (l + r) / 2;
if (C.at(mid) > B.at(i)) {
r = mid;
}
else {
l = mid;
}
}
ans += (M.at(i) * (N - r));
}
cout << ans << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(true){
int n,m;
cin >> n ;
if(cin.eof()) break;
cin >> m;
vector<int> a(1000);
vector<int> b(1000);
vector<int> c(1000);
vector<bool> u(1000);
vector<int> ans(1000);
fill(u.begin(),u.end(),true);
for(int i=0;i<n;i++){
cin >> a[i];
};
for(int i=0;i<m;i++){
cin >> b[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(u[j] && a[i] <= b[j]){
u[j] = false;
ans[i]++;
}
}
}
int res = -1,ansnum = 0;;
for(int i=0;i<n;i++){
if(res < ans[i]){
res = ans[i];
ansnum = i + 1;
}
}
cout << ansnum << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main(){
int n,m,r,q,w=0;
vector<int> a;
vector<int> c;
cin>>n>>m;
for(int i=0; i<n; ++i){
cin>>q;
a.push_back(q);
c.push_back(0);
}
for(int i=0; i<m; ++i){
cin>>q;
for(int k=0; k<n; ++k)
if(a[k]<=q){
++c[k];
break;
}
}
q=0;
for(int i=0; i<n; ++i){
if(q < c[i]) q=c[i],w=i+1;
}
cout << w <<endl;
// cout<<endl;
// for(int i=0; i<n; ++i){
// cout<<a[i]<<" "<<c[i]<<endl;
// }
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
string S;
cin >> S;
string ans = "WA";
vector<int> up;
for (int i = 0; i < S.size(); ++i) {
if ('a' > S[i] || S[i] > 'z') {
up.push_back(i);
}
}
if (up.size() == 2 && up[0] == 0 && S[up[0]] == 'A') {
if (2 <= up[1] && up[1] <= S.size() - 2 && S[up[1]] == 'C') {
ans = "AC";
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int i,j,k,count1=0,count2=0;
int main(void){
int ans=0;
string s;
cin>>s;
if(s.length()%2==0){
for(i=0;i<s.length();i+=2){
if(s[i]=='h'&&s[i+1]=='i')count1++;
}
}
if(count1==s.length()/2)ans=1;
if(s.length()==1)ans=0;
cout<<(ans? "Yes" : "No")<<endl;
} | 0 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge
typedef long long cat;
#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif
void add(map<string, int> &M, string s) {
for(int i = 0; i <= (int)s.length(); i++) M[s.substr(0, i)] = 0;
}
void add_edges(map<string, int> &M, vector< vector<int> > &G, string end) {
ALL_THE(M, it) if(it->ff != end && G[it->ss].empty())
for(int k = 0; k < 2; k++) G[it->ss].push_back(M[it->ff+(char)('0'+k)]);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
string S;
cin >> S;
int N = S.length();
map<string, int> M;
add(M, "01");
add(M, "000");
add(M, "0011");
add(M, "0010");
add(M, "101");
add(M, "1000");
add(M, "1001");
add(M, "111");
add(M, "11000");
add(M, "11001");
add(M, "1101");
int m = 0;
ALL_THE(M, it) it->ss = m++;
vector< vector<int> > G(m);
G[M["01"]].push_back(M[""]);
G[M["000"]].push_back(M["0"]);
G[M["0011"]].push_back(M[""]);
G[M["0010"]].push_back(M["00"]);
G[M["101"]].push_back(M["1"]);
G[M["1000"]].push_back(M["10"]);
G[M["1001"]].push_back(M["10"]);
G[M["11000"]].push_back(M["110"]);
G[M["11001"]].push_back(M["110"]);
G[M["1101"]].push_back(M["11"]);
add_edges(M, G, "111");
vector<string> V(m);
ALL_THE(M, it) V[it->ss] = it->ff;
cat mod = 1000000007;
vector< vector<cat> > ans(N+1, vector<cat>(m, 0));
ans[0][0] = 1;
for(int i = 0; i < N; i++) for(int j = 0; j < m; j++) if(G[j].size() == 2)
for(int k = 0; k < 2; k++) if(S[i] == '?' || S[i] == '0'+k) {
string s = V[j] + (char)('0'+k);
int id = M[s];
while(G[id].size() == 1) id = G[id][0];
ans[i+1][id] += ans[i][j];
if(ans[i+1][id] >= mod) ans[i+1][id] -= mod;
}
cat ansF = 0, pw2 = 1;
for(int i = N-1; i >= 0; i--) {
if(S[i] == '?') pw2 = (pw2 * 2) % mod;
ansF += ans[i][M["111"]] * pw2 % mod;
}
for(int i = 0; i < m; i++) if(G[i].size() != 1) {
string s = V[i];
int sum = 0;
for(int j = 0; j < (int)s.length(); j++) sum += (s[j] == '1') ? 1 : -1;
if(sum > 0) ansF += ans[N][i];
}
ansF %= mod;
if(ansF < 0) ansF += mod;
cout << ansF << "\n";
// 01 -> .
// 000 -> 0
// 0011 -> .
// 0010 -> 00
// 101 -> 1
// 1000 -> 10
// 1001 -> 10
// 111 -> WIN
// 11000 -> 110
// 11001 -> 110
// 1101 -> 11
return 0;}
// look at my code
// my code is amazing
| #include <bits/stdc++.h>
#define trans(x) add(nxt[ d[i][x] ], cur[i])
const int N = 300054, mod = 1000000007;
const int d[8][2] = {{2, 3}, {6, 6}, {4, 5}, {6, 7}, {2, 2}, {2, 3}, {1, 3}, {7, 7}};
int dp_[2][8], *cur = *dp_, *nxt = dp_[1];
char s[N];
inline int & add(int &x, const int y) {return x += y - mod, x += x >> 31 & mod;}
int main() {
int i, ans; char *p = s; *nxt = 1;
for (scanf("%s", s); *p; ++p) {
std::swap(cur, nxt), memset(nxt, 0, sizeof *dp_);
for (i = 0; i < 8; ++i) *p == 48 || trans(1), *p == 49 || trans(0);
}
printf("%d\n", add(ans = nxt[3], nxt[7]));
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll cnt[66][2];
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
ll a;cin>>a;
int bit=0;
while(a){
if(a&1){
cnt[bit][1]++;
}else cnt[bit][0]++;
a/=2;
bit++;
}
for(int j=bit;j<=64;j++)cnt[j][0]++;
}
ll ans=0;
for(int i=0;i<=62;i++){
ll p=(1LL<<i);p%=mod;
ll hano=cnt[i][0]*cnt[i][1];
hano%=mod;
ans+=(p*hano);
ans%=mod;
}
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
//#include<iostream>
using namespace std;
typedef long long ll;
const int N = 2000006;
const ll MOD = 1000000007;
ll a[N];
int bts[66];
int stb[66];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
ll ans = 0;
for(int i=n;i>0;i--){
for(int j=0;j<61;j++){
ll t = (1ll<<j);
t %= MOD;
if((a[i])&(1ll<<j)){
ll b = stb[j];
bts[j]++;
ans += t*b;
ans %= MOD;
}else{
ll b = bts[j];
stb[j]++;
ans += t*b;
ans %= MOD;
}
}
}
cout<<ans;
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;
cin>>n;
int cnt = 0;
if(n<3){
cout<<0<<endl;
return 0;
}
cnt = 0;
while(n>=3){
cnt++;
n-=3;
}
cout<<cnt<<endl;
return 0;
} | #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 main()
{
int N;
cin >> N;
cout << N / 3 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
printf("%d %d %d", z, x, y);
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define EPS 1e-6
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 10;
int T;
int main()
{
int a, b, c;
while(cin >> a >> b >> c){
cout << c << " " << a << " " << b << endl;
}
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int order[4000];
bool search(int);
class Member {
public:
Member() {sum = 0;}
void add(long price, long num) {
sum += (long long int)price*num;
}
bool milion()
{
if (sum >= 1000000) return true;
else return false;
}
private:
long long int sum;
int id;
};
bool search(int num)
{
for (int i=0; i<4000; i++)
if (order[i] == num ) return true;
return false;
}
int main()
{
int n, idx, memNum;
long price, num;
bool nothing;
ios::sync_with_stdio();
while (1) {
Member *member = new Member[4000];
memNum=0;
nothing =true;
for (int i=0; i<4000; i++) order[i] = -1;
if (cin >> n, !n) break;
for (int i=0; i<n; i++) {
scanf("%d %ld %ld", &idx, &price, &num);
member[idx].add(price, num);
if (!search(idx)) order[memNum++] = idx;
}
for (int i=0; i<4000 && order[i] > 0; i++)
if (member[order[i]].milion()) { cout << order[i] << endl; nothing = false; }
if (nothing) cout << "NA" << endl;
}
} | #include <iostream>
using namespace std;
typedef long long ll;
//vector<pair<bool, ll>> v(4001);
unsigned long long int a[4001];
int main(){
int n, num, p, q;
while(cin >> n, n){
//fill(a, a+4001, 0);
int f = 1;
for(int i = 0;i < 4001;i++)a[i] = 0;
for(int i = 0;i < n;i++){
cin >> num >> p >> q;
a[num] += p * q;
if(a[num]>999999){
cout << num << endl;
f = 0;
}
}
if(f)cout << "NA" <<endl;
/*int f = 1;
for(int i = 1;i <= 4000;i++)if(a[i] >= 1000000)cout << i << endl, f = 0;
if(f)cout << "NA" << endl;*/
}
return 0;
}
/*
4
1001 2000 520
1002 1800 450
1003 1600 625
1001 200 1220
*/ | 1 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define si short int
using namespace std;
const int N=101;
si n,m,x,y,ans,dp[N][N][N][N],sum[N][N];
char g[N][N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f;}
template<typename I, typename... U> inline void read(I &x,U&... y){read(x); read(y...);}
template<typename I>inline I mx(const I&a,const I&b){return a>b ? a : b;}
template<typename I>inline I mi(const I&a,const I&b){return a<b ? a : b;}
template<typename I>inline void swp(I&a,I&b){I t=a; a=b; b=t;}
inline void cmx(si &a,si b){if(b>a) a=b;}
inline si s(int a,int b,int c,int d){
if(a>c) swp(a,c); if(b>d) swp(b,d);
return sum[c][d]-sum[c][b-1]-sum[a-1][d]+sum[a-1][b-1];
}
int main()
{
// freopen("Salvage Robots.in","r",stdin);
read(n,m);
for(RG int i=1;i<=n;i++)
{
scanf("%s",g[i]+1);
for(RG int j=1;j<=m;j++)
{
if(g[i][j]=='o') sum[i][j]=1;
else if(g[i][j]=='E') x=i, y=j;
sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
}
}
for(int i=x;i;i--)
for(int j=y;j;j--)
for(int k=x;k<=n;k++)
for(int l=y;l<=m;l++)
{
ans=mx(ans,dp[i][j][k][l]);
int li=l-y+1, ri=m-y+j, us=k-x+1, ds=n-x+i;
if(i-1>=us) cmx(dp[i-1][j][k][l],dp[i][j][k][l]+s(i-1,mx(li,j),i-1,mi(ri,l)));
if(j-1>=li) cmx(dp[i][j-1][k][l],dp[i][j][k][l]+s(mx(i,us),j-1,mi(k,ds),j-1));
if(k+1<=ds) cmx(dp[i][j][k+1][l],dp[i][j][k][l]+s(k+1,mx(li,j),k+1,mi(ri,l)));
if(l+1<=ri) cmx(dp[i][j][k][l+1],dp[i][j][k][l]+s(mx(i,us),l+1,mi(k,ds),l+1));
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define MAX 102
int h;
int w;
char buf[MAX][MAX];
short dp[MAX][MAX][MAX][MAX];
pair<int, int> E;
int im[MAX][MAX];
int gt(int a, int b){
if (a < 0 || b < 0){
return 0;
}
return im[a][b];
}
int rect(int x1, int x2, int y1, int y2){
return gt(x2, y2) + gt(x1 - 1, y1 - 1) - gt(x2, y1 - 1) - gt(x1 - 1, y2);
}
int dfs(int a, int b, int c, int d){
if (a > b || c > d)return 0;
return dp[a][b][c][d];
}
int main(){
cin >> h >> w;
for (int i = 0; i < h; i++){
scanf("%s", buf[i]);
}
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
if (buf[i][j] == 'E'){
E = make_pair(i, j);
}
if (buf[i][j] == 'o'){
im[i][j]++;
}
}
}
for (int i = 0; i < h; i++){
for (int j = 1; j < w; j++){
im[i][j] += im[i][j - 1];
}
}
for (int j = 0; j < w; j++){
for (int i = 1; i < h; i++){
im[i][j] += im[i - 1][j];
}
}
int a;
int b;
int c;
int d;
short int can;
short int add;
for (int rng = 1; rng <= h; rng++){
for (int rng2 = 1; rng2 <= w; rng2++){
for (int i = 0; i + rng <= h; i++){
for (int j = 0; j + rng2 <= w; j++){
a = i;
b = a + rng - 1;
c = j;
d = j + rng2 - 1;
{
can = E.first + a + 1;
if (a + 1 <= can&&can <= b){
add = rect(can, can, max(c, E.second - (w - d) + 1), min(d, E.second + c));
add += dfs(a + 1, b, c, d);
dp[a][b][c][d] = add;
}
}
//choose b
{
can = E.first - (h - b);
if (a <= can&&can <= b - 1){
add = rect(can, can, max(c, E.second - (w - d) + 1), min(d, E.second + c));
add += dfs(a, b - 1, c, d);
dp[a][b][c][d] = max(dp[a][b][c][d], add);
}
}
//choose c
{
can = E.second + c + 1;
if (c + 1 <= can&&can <= d){
add = rect(max(a, E.first - (h - b) + 1), min(b, E.first + a), can, can);
add += dfs(a, b, c + 1, d);
dp[a][b][c][d] = max(dp[a][b][c][d], add);
}
}
//choose d
{
can = E.second - (w - d);
if (c <= can&&can <= d - 1){
add = rect(max(a, E.first - (h - b) + 1), min(b, E.first + a), can, can);
add += dfs(a, b, c, d - 1);
dp[a][b][c][d] = max(dp[a][b][c][d], add);
}
}
}
}
}
}
int ans=dfs(0, h - 1, 0, w - 1);
cout << ans << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n),asum(n+1,0),bsum(n+1,0);
rep(i,n){
cin >> a[i];
asum[a[i]]++;
}
rep(i,n){
cin >> b[i];
bsum[b[i]]++;
}
rep(i,n+1){
if(asum[i] + bsum[i] > n){
cout << "No\n";
return 0;
}
}
rep(i,n){
asum[i+1] += asum[i];
bsum[i+1] += bsum[i];
}
int d = 0;
rep(i,n+1){
d = max(asum[i]-bsum[i-1],d);
}
cout << "Yes\n";
rep(i,n){
cout << b[(n+i-d)%n] << " ";
}
return 0;
} | #include <bits/stdc++.h>
#define maxn 200086
using namespace std;
int n;
int a[maxn], b[maxn];
int main(){
scanf("%d", &n);
for(int i = 1;i <= n;i++) scanf("%d", &a[i]);
for(int i = 1;i <= n;i++) scanf("%d", &b[i]);
reverse(b + 1, b + 1 + n);
int l = n, r = 1;
for(int i = 1;i <= n;i++){
if(a[i] == b[i]) l = min(l, i), r = max(r, i);
}
for(int i = 1;i <= n && l <= r;i++){
if(a[i] != a[l] && b[i] != a[l]) swap(b[i], b[l++]);
}
if(l <= r) return printf("No"), 0;
puts("Yes");
for(int i = 1;i <= n;i++) printf("%d ", b[i]);
} | 1 |
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<climits>
#include<string.h>
using namespace std;
int main(){
int m,n1,n2;
while(cin>>m>>n1>>n2,m){
int p[202];
vector<pair<int,int> >v;
for(int i=1;i<=m;i++){
cin>>p[i];
if(i-1>=n1&&i-1<=n2){
v.push_back(make_pair(p[i-1]-p[i],i-1));
}
}
sort(v.begin(),v.end());
cout<<v[v.size()-1].second<<endl;
}
} | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
char c;
vector<int> len(10);
for(int i=0; i<10; ++i){
if(!(cin >> len[i] >> c))
return 0;
}
int v1, v2;
cin >> v1 >> c >> v2;
int sumLen = accumulate(len.begin(), len.end(), 0);
int tmp = 0;
for(int i=0; i<10; ++i){
tmp += len[i];
if(sumLen * v1 <= tmp * (v1 + v2)){
cout << (i+1) << endl;
break;
}
}
}
} | 0 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
using namespace std;
#define MAXN (1 << 20)
int a[MAXN], b[MAXN], c[MAXN];
int main() {
int na, nb, m;
cin >> na >> nb >> m;
for (int i = 1; i <= na; i++) {
cin >> a[i];
}
for (int i = 1; i <= nb; i++) {
cin >> b[i];
}
int ret = MAXN;
for (int i = 1; i <= m; i++) {
int x, y, c;
cin >> x >> y >> c;
int cur = a[x] + b[y] - c;
ret = min(ret, cur);
}
sort(a + 1, a + na + 1);
sort(b + 1, b + nb + 1);
ret = min(ret, a[1] + b[1]);
cout << ret << endl;
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=100005;
int n,m,v,p,a[maxn],ans;
ll b[maxn];
inline int cmp1(int x,int y){
return x>y;
}
inline int read(){
int res=0,f_f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f_f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') res=(res<<3)+(res<<1)-'0'+ch,ch=getchar();
return res*f_f;
}
int main(){
n=read(),m=read(),v=read(),p=read(),ans=p;
for (int i=1;i<=n;i++){
a[i]=read();
}
sort(a+1,a+n+1,cmp1);
for (int i=1;i<=n;i++){
b[i]=b[i-1]+a[i];
}
for (int i=p+1;i<=n;i++){
if(a[i]+m<a[p]) continue;
ll delta=1ll*max(0,v-(p-1)-(n-i+1))*m;
if(delta==0){
ans++;
continue;
}
ll w=1ll*m*(i-p)-(b[i-1]-b[p-1]-1ll*a[i]*(i-p));
if(w>=delta) ans++;
}
printf("%d\n",ans);
return 0;
} | 0 |
// time-limit: 2000
// 23
#include <bits/stdc++.h>
using namespace std;
#define coutc "\033[48;5;196m\033[38;5;15m"
#define endc "\033[0m"
#define endl '\n'
#define M(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) \
M(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep4(_, x, n, s) \
for (int _ = x; (s < 0) ? _ > n : _ < n; _ += s)
#define rep3(_, x, n) rep4(_, x, n, (x < n ? 1 : -1))
#define rep2(_, n) rep3(_, 0, n)
#define rep1(n) rep2(i, n)
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define len(x) int(x.size())
#define lli __int128_t
#define li long long int
#define ld long double
#ifdef DEBUG
// 3
ostream &operator<<(ostream &o, pair<auto, auto> p) {
return o << "(" << p.fi << ", " << p.se << ")";
}
// 4
ostream &operator<<(ostream &o, vector<auto> v) {
rep(i, len(v)) o << setw(7) << right << v[i];
return o << endc << endl << coutc;
}
// 4
ostream &operator<<(ostream &o, map<auto, auto> m) {
for (auto &kv : m) o << kv;
return o;
}
// 7
void debug(const auto &e, const auto &... r) {
cout << coutc << e;
((cout << " " << r), ..., (cout << endc << endl));
}
#else
#define debug(...)
#endif
int sign(li x) { return x < 0 ? -1 : x > 0; }
// a / b
li ceil(li a, li b) {
if (sign(a) == sign(b) && a % b) return a / b + 1;
else return a / b;
}
void _main(int tc) {
int a, b;
cin >> a >> b;
// b = a + (a - 1) * X
// X = (b - a) / (a - 1)
// is ceiling because we need to assure that with X pipes we complete "b - a" lines.
// we add one because after fullfilling "b - a" we still need to complete with "a" lines.
cout << ceil(b - a, a - 1) + 1 << endl;
}
// 7
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
_main(0), exit(0);
int tc;
cin >> tc;
rep(i, tc) _main(i + 1);
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
int count = 0;
int ans = 1;
for (int i = 0; b > ans; i++)
{
ans += (a - 1);
count++;
}
cout << count << endl;
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX << " " << pointY << endl;
pointX = pointY = count = 0;
cin >> n;
}
} while (n != 0);
return 0;
} | #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int card[20000],i,j,a=0,b=0,c=1,n;
cin>>n;
while(n!=0){
for(i=0;i<2*n;i++){
cin>>card[i];
}
for(i=0;i<2*n;i=i+2){
if(card[i]>card[c]){
a=a+card[i]+card[c];
}
else if (card[i]==card[c]){
a=a+card[i];
b=b+card[c];
}
else{
b=b+card[i]+card[c];
}
c=c+2;
}
cout<<a<<" "<<b<<endl;
c=1;
a=0;
b=0;
cin>>n;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<int> r,p;
UnionFind(){}
UnionFind(int size){init(size);}
void init(int size){
r.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++) r[i]=1,p[i]=i;
}
int find(int x){
return (x==p[x]?x:p[x]=find(p[x]));
}
bool same(int x,int y){
return find(x)==find(y);
}
void unite(int x,int y){
x=find(x);y=find(y);
if(x==y) return;
if(r[x]<r[y]) swap(x,y);
r[x]+=r[y];
p[y]=x;
}
};
struct edge{
int from,to,cost;
edge(){}
edge(int from,int to,int cost):from(from),to(to),cost(cost){}
bool operator<(const edge& e) const{
return cost<e.cost;
}
};
int kruskal(int N,vector<edge> edges){
int res=0;
sort(edges.begin(),edges.end());
UnionFind uf(N+1);
for(int i=0;i<(int)edges.size();i++){
edge e=edges[i];
if(!uf.same(e.from,e.to)){
res+=e.cost;
uf.unite(e.from,e.to);
}
}
return res;
}
int main(){
int N,M;
cin>>N>>M;
vector<edge> edges(M);
for(int i=0;i<M;i++)
cin>>edges[i].from>>edges[i].to>>edges[i].cost;
cout<<kruskal(N,edges)<<endl;
return 0;
} | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
class ConnectNodeInfo{
vector<vector<pair<ll,ll>>> graph;
public:
ConnectNodeInfo(int node_num){
graph.resize(node_num);
}
void AddNonDirectionalConnection(ll u,ll v,ll w){
graph[u].emplace_back(v,w);
graph[v].emplace_back(u,w);
}
void AddDirectionalConnection(ll u,ll v,ll w){
graph[u].emplace_back(v,w);
}
vector<pair<ll,ll>>& operator[](ll index){
return graph[index];
}
size_t size(){return graph.size();}
};
class RootedNode{
public:
vector<ll> parent;
ll depth,dist;
RootedNode():depth(0),dist(0){}
};
class RootedTree{
int parent_size;
vector<int> pre,low;
int pre_count{0};
void DFS(ConnectNodeInfo& connection,ll child,ll parent,ll dep,ll dist){
pre[child] = low[child] = pre_count++;
node[child].parent[0] = parent;
node[child].depth = dep;
node[child].dist = dist;
bool isArticulation = false;
int ct = 0;
for(int i = 0;i < connection[child].size();i++){
ll next_child = connection[child][i].first;
if(pre[next_child]<0){
ct++;
DFS(connection,next_child,child,dep+1,dist+connection[child][i].second);
low[child] = min(low[next_child],low[child]);
if (~parent && pre[child] <= low[next_child]) isArticulation = true;
if (pre[child]<low[next_child]) bridge.emplace_back(min(child,next_child),max(child,next_child));
}
else if(next_child != parent){
low[child] = min(low[child],pre[next_child]);
}
}
if(parent==-1 && ct>1) isArticulation = true;
if(isArticulation) articulation.push_back(child);
}
public:
vector<RootedNode> node;
vector<pair<ll,ll>> bridge;
vector<ll> articulation;
RootedTree(ConnectNodeInfo& connection){
auto connection_size = connection.size();
parent_size = 1;
while((1LL<<parent_size)<connection_size) parent_size++;
node.resize(connection_size);
pre.resize(connection_size,-1);
low.resize(connection_size);
for(auto& x:node) x.parent.resize(parent_size,-1);
DFS(connection,0,-1,0,0);
for(int k=0;k<parent_size-1;k++){
for(int v=0,ev=connection_size;v<ev;v++){
if(node[v].parent[k] < 0) node[v].parent[k+1] = -1;
else node[v].parent[k+1] = node[node[v].parent[k]].parent[k];
}
}
}
ll FindLCA(ll u,ll v){
if(node[u].depth > node[v].depth) swap(u,v);
for(int k=0;k<parent_size;k++){
if((node[v].depth - node[u].depth) & (1LL<<k)){
v = node[v].parent[k];
}
}
if(u==v) return u;
for(int k=parent_size-1;k>=0;k--){
if(node[u].parent[k] != node[v].parent[k]){
u = node[u].parent[k];
v = node[v].parent[k];
}
}
return node[u].parent[0];
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int N=in(),M=in();
ConnectNodeInfo connect(N);
REP(i,M){
int u=in(),v=in();
connect.AddNonDirectionalConnection(u,v,1);
}
RootedTree tree(connect);
sort(ALL(tree.articulation));
for(auto& x:tree.articulation){
out(x);
}
return 0;
}
| 0 |
#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 int MOD = 998244353;
const ll INF = 1000000000000000000;
int p[200010];
double sum[200010];
int main()
{
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) cin >> p[i];
for (int i = 0; i < N; i++) {
sum[i + 1] = sum[i] + (double)(p[i] * (p[i] + 1) / 2) / p[i];
}
double ans = 0.0;
for (int i = 0; i < N - K + 1; i++) {
ans = max(ans, sum[i + K] - sum[i]);
}
printf("%.10f\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define pr(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
#define mod 1000000007 // ((a- b)% mod+ mod)% mod
void solve() {
int n, k; scanf("%d%d", &n, &k);
vector<int> v, csum(n+ 1);
for (int i= 0; i< n; i++) {
int x; scanf("%d", &x);
x++;
v.push_back(x);
}
for (int i= 1; i<= n; i++) csum[i]= csum[i- 1]+ v[i- 1];
double an= 0;
for (int i= 1; i<= n- k+ 1; i++) {
an= max(an, (double)csum[i+ k- 1]- csum[i- 1]);
}
an/= 2;
printf("%0.10f", an);
}
int32_t main(){
//ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
int T= 1;
//cin >> T;
while ( T-- ) {
solve();
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300 + 10;
typedef long long ll;
const ll mod = 998244353;
int tot, K;
char s[maxn];
int a[maxn];
ll f[maxn][maxn][maxn];
ll ans;
inline ll norm(const ll & x) { return x >= mod ? x - mod : x;}
int main()
{
scanf("%s%d", s + 1, &K);
K = min(K, 300);
int len = strlen(s + 1);
reverse(s + 1, s + len + 1);
int cur = 0;
for(int i = 1; i <= len; ++i)
if(s[i] == '0')
{
a[++tot] = cur;
cur = 0;
}
else
++cur;
a[++tot] = cur;
f[0][0][0] = 1;
for(int i = 1; i <= tot; ++i)
for(int k = 0; k <= K; ++k)
{
for(int j = k; ~j; --j)
f[i][j][k] = norm(f[i - 1][j][k] + f[i][j + 1][k]);
for(int j = 0; j <= k; ++j)
{
/*
for(int jd = j; jd <= k; ++jd)
f[i][j][k] = (f[i][j][k] + f[i - 1][jd][k]) % mod;
*/
int lim = min(j, a[i]);
for(int jd = 1; jd <= lim; ++jd)
f[i][j][k] = norm(f[i][j][k] + f[i - 1][j - jd][k - jd]);
}
}
for(int k = 0; k <= K; ++k)
ans = norm(ans + f[tot][0][k]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N,L;
int result = 0;
int mini = 10000;
cin >> N >> L;
for(int a = 0;a < N;a++){
result += a + L;
if(abs(mini) > abs(a + L))mini = a + L;
}
cout << result - mini << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> sumE(n+1), sumW(n+1);
sumE[0] = 0, sumW[0] = 0;
for (int i = 1; i <= n; i++){
sumE[i] = sumE[i-1];
sumW[i] = sumW[i-1];
if (s[i-1] == 'E'){
sumE[i] += 1;
}else{
sumW[i] += 1;
}
}
int ans = MOD;
for (int i = 1; i <= n; i++){
int temp1 = sumW[i-1];
int temp2 = sumE[n] - sumE[i];
ans = min(ans, temp1 + temp2);
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
#define ford(i,a,b) for(int i=(a);i>=b;i--)
#define rep1(i,a,b) for(int i=(a);(i)<=(b);(i)++)
#define rep(i,a,b) for(int i=(a);(i)<(b);(i)++)
#define ll long long
#define N 300005
#define pql priority_queue<ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define rev(a,n) reverse(a,a+n)
using namespace std;
int n,ans=300005,l[N],r[N];
char s[N];
int main() {
cin>>n;
rep1(i,1,n)cin>>s[i];
rep1(i,2,n){
l[i]=l[i-1]+(s[i-1]=='W');
}
ford(i,n-1,1){
r[i]=r[i+1]+(s[i+1]=='E');
}
rep1(i,1,n){
if(ans>l[i]+r[i]){
ans=l[i]+r[i];
}
}
cout<<ans;
return 0;
}
| 1 |
#include<iostream>
#include<cstdio>
using namespace std;
bool three(int x){
if(x%3==0)return true;
while(x>0){
if(x%10==3)return true;
x/=10;
}
return false;
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
if(three(i))cout<<" "<<i;
}
cout<<endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
string S;
int N;
int main(void)
{
cin >> S;
N = S.length();
int offset = 0;
int result = 0;
while(offset < N)
{
if(S[offset] == 'O')
{
int of = offset;
int c_O = 0;
while(S[of] == 'O')
{
of++;
c_O++;
}
bool OK = true;
for(int i = offset - 1;i >= offset - c_O;i--)
{
if(i >= 0)
{
if(S[i] != 'J')
{
OK = false;
break;
}
}
else
{
OK = false;
break;
}
}
for(int i = of;i < of + c_O;i++)
{
if(i < N)
{
if(S[i] != 'I')
{
OK = false;
break;
}
}
else
{
OK = false;
break;
}
}
if(OK)
{
result = max(result,c_O);
}
offset = of;
}
else
offset++;
}
cout << result << endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef vector <bool> VB;
typedef vector <VB> VVB;
int main( void )
{
int n, m;
while ( cin >> n >> m && n && m )
{
VVB G( n+1, VB( n+1, false ) );
for ( int i = 0; i < m; i++ )
{
int a, b; // a-bツづ債友ツ達
cin >> a >> b;
G[a][b] = G[b][a] = true;
}
VB F( n+1, false );
for ( int i = 0; i <= n; i++ )
{
if ( G[1][i] )
{
F[i] = true;
}
}
VB R( n+1, false );
for ( int i = 0; i <= n; i++ )
{
if ( F[i] == false ) continue;
for ( int j = 0; j <= n; j++ )
{
if ( j == 1 ) continue;
if ( G[i][j] )
{
R[j] = true;
}
}
}
int answer = 0;
for ( int i = 0; i <= n; i++ )
{
if ( F[i] || R[i] )
{
answer++;
}
}
cout << answer << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int friends[500];
int n,m;
pair<int, int> student[10000];
int result[100];
int I = 0;
for (int i = 0;; i++)
{
cin >> n;
cin >> m;
if (m == 0 && n == 0)
{
break;
}
for (int a = 0; a < 500; a++)
{
friends[a] = 0;
student[a].first = 0;
student[a].second = 0;
}
for (int a = 0; a < m; a++)
{
cin >> student[a].first >> student[a].second;
student[a].first--;
student[a].second--;
}
sort(student, student + m);
friends[0] = 1;
for (int a = 0; a < m; a++)
{
if (student[a].first == 0)
{
for (int b = 0; b < m; b++)
{
if (student[b].first == student[a].second)
{
friends[student[b].second] = 1;
}
if (student[b].second == student[a].second)
{
friends[student[b].first] = 1;
}
}
friends[student[a].second] = 1;
}
}
result[i] = -1;
for (int a = 0; a < n; a++)
{
if (friends[a] == 1)
{
result[i]++;
}
}
I++;
}
for (int a = 0; a < I;a++)
{
cout << result[a] << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1000000007;
const long double PI=3.1415926535;
int main() {
ll N;
cin>>N;
ll a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
ll ans=0,cnt=0,c=1;
if(a[0]!=0){
c=0;
}
for(int i=0;i<N;i++){
if(i==N-1){
ans+=a[i];
}
else if(a[i]+1==a[i+1]){
cnt++;
}
else if(a[i]+1<a[i+1]){
c=0;
break;
}
else{
ans+=a[i];
}
}
if(c){
cout<<ans;
}
else{
cout<<-1;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define V(a) a.begin(), a.end()
typedef vector<int> vi;
int main()
{
vi a[2], C;
for (auto &i : a) {
int n;
cin >> n;
i = vi(n);
for (int &j : i)
cin >> j;
sort(V(i));
}
set_intersection(V(a[0]), V(a[1]), inserter(C, C.end()));
cout << C.size() << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long double ld;
const int inf = 1e9;
const ll inf64 = 1e18;
const int mod = 998244353;
inline int _mul(int a, int b) {
return (1ll * a * b) % mod;
}
inline int _sum(int a, int b) {
return a + b < mod ? a + b : a + b - mod;
}
inline int _sub(int a, int b) {
return a >= b ? a - b : a - b + mod;
}
inline void _inc(int &x, int y) {
if ((x += y) >= mod) {
x -= mod;
}
}
inline void _dec(int &x, int y) {
if ((x -= y) < 0) {
x += mod;
}
}
inline int _binpow(int x, int p) {
int res = 1;
int tmp = x;
while (p > 0) {
if (p & 1) {
res = _mul(res, tmp);
}
tmp = _mul(tmp, tmp);
p >>= 1;
}
return res;
}
const int N = 3e6 + 5;
int fact[N];
int rfact[N];
void precalc() {
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = _mul(fact[i - 1], i);
}
rfact[N - 1] = _binpow(fact[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--) {
rfact[i] = _mul(rfact[i + 1], i + 1);
}
}
inline int CNK(int n, int k) {
if (n < k) {
return 0;
}
return _mul(fact[n], _mul(rfact[n - k], rfact[k]));
}
inline int F(int n, int k) {
return CNK(n + k - 1, k);
}
int main() {
precalc();
#ifdef debug
freopen("input.txt", "r", stdin);
#endif
int n, m;
cin >> n >> m;
int res = 0;
for (int i = m & 1; i <= m; i += 2) {
_inc(
res,
_mul(
CNK(n, i),
F(n, (3 * m - i) / 2)
)
);
}
_dec(
res,
_mul(
n,
F(n, m - 1)
)
);
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
const int N = 2500005, P = 998244353;
int n, m;
int fac[N], inv[N];
int qpow(int a, int b) {
int s = 1;
for (; b; b >>= 1) {
if (b & 1) {
s = 1ll * s * a % P;
}
a = 1ll * a * a % P;
}
return s;
}
void init(int n) {
fac[0] = 1;
for (int i = 1; i <= n; ++i) {
fac[i] = 1ll * fac[i - 1] * i % P;
}
inv[n] = qpow(fac[n], P - 2);
for (int i = n; i; --i) {
inv[i - 1] = 1ll * inv[i] * i % P;
}
}
int C(int n, int m) {
if (m < 0 || m > n) {
return 0;
}
return 1ll * fac[n] * inv[m] % P * inv[n - m] % P;
}
int main() {
read(n), read(m);
init(n + 3 * m);
int ans = 0;
for (int i = m & 1; i <= n && i <= m; i += 2) {
int S = (3 * m - i) >> 1, s = 0;
for (int j = 0; j <= i && m * j <= S; ++j) {
for (int k = 0; k <= n - i && m * j + (m + 1) * k <= S; ++k) {
int t = 1ll * C(i, j) * C(n - i, k) % P * C(S - m * j - (m + 1) * k + n - 1, n - 1) % P;
if ((j + k) & 1) {
s = (s + P - t) % P;
} else {
s = (s + t) % P;
}
}
}
ans = (ans + 1ll * s * C(n, i)) % P;
}
print(ans);
}
| 1 |
/*
ID: skipian1
PROB:
LANG: C++11
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF = 2000000000
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define X first
#define Y second
ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
string str;
cin >> str;
bool paren[2*n];
for (ll i = 0; i < 2*n; i++) {
if (i == 0) {
if (str.at(i) == 'W') {
cout << 0 << "\n";
return 0;
}
paren[0] = 0;
} else {
if (str.at(i) != str.at(i-1)) {
paren[i] = paren[i-1];
} else {
paren[i] = !paren[i-1];
}
}
}
ll parens = 0;
for (ll i = 0; i < 2*n; i++) {
if (paren[i]) parens--;
else parens++;
if (parens < 0) {
cout << 0 << "\n";
return 0;
}
}
if (parens != 0) {
cout << 0 << "\n";
return 0;
}
parens = 0;
ll ans = 1;
ll ind = 0;
for (ll i = 2*n-1; i >= 0; i--) {
if (paren[i]) parens++;
else {
ans *= parens-ind;
ind++;
ans %= MOD;
}
}
for (ll i = 1; i <= n; i++) {
ans *= i;
ans %= MOD;
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
using Graph = vector<vector<int>>;
Graph G;
int main(){
int d; cin >> d;
ll g; cin >> g;
vector<ll> p(d);
vector<ll> c(d);
rep(i, d) cin >> p[d - 1 - i] >> c[d - 1 - i];
int min_count = 100000000;
int count, sum;
bool flag;
for(int bit = 0; bit < (1 << d); bit++){
flag = false;
count = 0;
sum = 0;
for(int i = 0; i < d; i++){
if(bit & (1 << i)){
int num;
if((g - sum) > (d - i) * 100 * p[i] + c[i]){
sum += (d - i) * 100 * p[i] + c[i];
count += p[i];
}else{
num = min(((g - sum) + ((d - i) * 100) - 1) / ((d - i) * 100), p[i]);
count += num;
flag = true;
}
}
if(flag) break;
}
//cout << count << endl;
if(flag) min_count = min(count, min_count);
}
cout << min_count << endl;
} | 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 repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 111;
rep(i,n){
if(ans >= n){
cout << ans;
return 0;
}
ans +=111;
}
} | //#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i<=n ; i++)
#define make_unique(v) sort(all(v));v.erase(unique(all(v)), v.end());
#define rot(v) rotate(v.begin(), v.begin() + k, v.end());
#define rmv(v,a) v.erase(remove(v.begin(),v.end(), a), v.end());
#define max(x,y) ((x>y)?x:y)
#define min(x,y) ((x<y)?x:y)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define endl '\n'
#define fi first
#define se second
#define ajs(a) (a<0)?(-1*a):a
using namespace std;
typedef long long ll;
// use count() instead of find() in sets.
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double EPS = (1e-10);
const int dx4[4] = {0, 1, 0, -1};
const int dy4[4] = { -1, 0, 1, 0};
const int dx8[8] = { -1, -1, -1, 0, 1, 1, 1, 0};
const int dy8[8] = { -1, 0, 1, 1, 1, 0, -1, -1};
bool cmp(int X, int Y) {return X > Y;}
int dcp(double A, double B){return fabs(A-B)<=EPS ? 0 : A<B ? -1:1;}
ll gcd(ll a, ll b) {return !b ? a : gcd(b, a % b);}
ll lcm(ll a, ll b) {return (a / gcd(a, b)) * b;}
ll modpow(ll a, ll b, ll m ){a %= m; ll res = 1; while (b) {if (b & 1)res = (res * a) % m; a = (a * a) % m; b >>= 1;} return res;}
ll bpow(ll a, ll b){ll res = 1; while (b) {if (b & 1)res = res * a; a = a * a; b >>= 1;} return res;}
ll modinv(ll a, ll m = MOD) {return modpow(a, m - 2, m);}
int main()
{ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n;cin>>n;
ll c = 2*n;
ll a[c];
rep(i,c){cin>>a[i];}
sort(a,a+c);
ll sum = 0;
for(ll i = 0; i < 2*n ; i = i+2){
sum+=a[i];
}
cout<<sum;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli n, k;
int main(void){
cin >> n >> k;
vector<bool> r(10);
rep(i, k){
lli d;
cin >> d;
r[d] = true;
}
for(int i = n; i <= 10*n; i++){
string s = to_string(i);
bool ok = true;
rep(j, s.size()){
if(r[s[j]-'0']) ok = false;
}
if(ok){
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
vector<bool> d(10, true);
bool isvalid(int n)
{
int dec = n % 10;
if(!d[dec]) return false;
if(n/10 != 0) return isvalid(n/10);
return true;
}
int main()
{
int k, n;
cin >> n >> k;
for (int i = 0; i < k; i++){
int tmp; cin >> tmp;
d[tmp] = false;
}
while(!isvalid(n)) n++;
cout << n << '\n';
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int d = INT_MAX;
for (int i = 0, n = s.length() - 3; i <= n; i++)
d = min(d, abs(atoi(s.substr(i, 3).c_str()) - 753));
cout << d << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
using que_a = priority_queue<int, vector<int>, greater<int> >;
using que_d = priority_queue<int>;
using pint = pair<int,int>;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
}
int main(){
int n; cin >> n;
int cnt = 0;
for(int i = 2; i <= 55555; i++){
if(divisor(i).size() == 2 && i%5 == 1){
cout << i;
cnt++;
if(cnt == n) break;
cout << " ";
}
}
cout << endl;
return 0;
}
| 0 |
#include<stdio.h>
int GCD(int a, int b) {
int A, B, buff;
// A >= B
if (b > a) {
A = b; B = a;
}
else { A = a; B = b; }
while (A%B) {
buff = B;
B = A % B;
A = buff;
}
return B;
}
int main() {
int N, a, b, c;
int G;
int GC[1000000];
scanf("%d", &N);
if (!(N - 2)) {
scanf("%d %d", &a, &b);
G = GCD(a, b);
for (int i = 1; i <= G; i++) {
if (a%i == 0 && b%i == 0) {
GC[i] = i;
}
else GC[i] = -i;
}
for (int j = 1; j <= G; j++) {
if (GC[j] < 0)continue;
printf("%d\n", GC[j]);
}
}
else {
scanf("%d %d %d", &a, &b, &c);
G = GCD(c, GCD(a, b));
for (int i = 1; i <= G; i++) {
if (a%i == 0 && b%i == 0 && c%i == 0) {
GC[i] = i;
}
else GC[i] = -i;
}
for (int j = 1; j <= G; j++) {
if (GC[j] < 0)continue;
printf("%d\n", GC[j]);
}
}
return 0;
}
| #include<cstdio>
#include<algorithm>
#define N 100000
#define MAX (1<<31)-1
using namespace std;
int A[N], T[4*N], lazy[4*N];
void build(int l, int r, int k) {
if (l == r) {
T[k] = A[l];
return;
}
int mid = (l + r) / 2;
build(l, mid, k * 2);
build(mid + 1, r, k * 2 + 1);
T[k] = min(T[2 * k], T[2 * k + 1]);
}
void pushdown(int k) {
if (lazy[k] != -1) {
lazy[2*k] = lazy[k];
lazy[2*k+1] = lazy[k];
T[2*k] = lazy[k];
T[2*k+1] = lazy[k];
lazy[k] = -1;
}
}
void updata(int L, int R, int data ,int l, int r ,int k) {
if (L <= l && r <= R) {
T[k] = data;
lazy[k] = data;
return;
}
pushdown(k);
int mid = (l + r) / 2;
if (mid >= L) updata(L, R, data, l, mid, 2*k);
if (mid < R) updata(L, R, data, mid+1, r, 2*k+1);
T[k] = min(T[2 * k], T[2 * k + 1]);
}
int find(int L, int R, int l, int r, int k) {
if (L <= l && r <= R) return T[k];
pushdown(k);
int mid = (l + r) / 2;
int ans = MAX;
if (mid >= L) ans = min(ans, find(L, R, l, mid, k * 2));
if (mid < R) ans = min(ans, find(L, R, mid + 1, r, k * 2 + 1));
return ans;
}
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++)
A[i] = MAX;
for (int i = 0; i < 4*n; i++)
lazy[i] = -1;
build(0, n - 1, 1);
int com, s, t, x, y;
while (q--) {
scanf("%d", &com);
if (com == 0) {
scanf("%d%d%d", &s, &t, &x);
updata(s, t, x, 0, n - 1, 1);
}
else {
scanf("%d", &x);
printf("%d\n", find(x, x, 0, n - 1, 1));
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string s;
cin >> s;
long n=s.size();
vector<int>a(26);
rep(i,n){
a.at(s.at(i)-'a')++;
}
long ans=0;
rep(i,n){
ans+=n-a.at(s.at(i)-'a');
}
cout<<ans/2+1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T, typename U>
using pv=vector<pair<T,U>>;
template<typename T>
using matrix=vector<vector<T>>;
template<typename T>
using pque=priority_queue<T>;
template<typename T>
using lpque=priority_queue<T,vector<T>,greater<T>>;
using ll=long long;
using intpair=pair<int,int>;
using llpair=pair<ll,ll>;
using ilpair=pair<int,ll>;
using lipair=pair<ll,int>;
using intvec=vector<int>;
using llvec=vector<ll>;
using intq=queue<int>;
using llq=queue<ll>;
using intmat=vector<intvec>;
using llmat=vector<llvec>;
#define PI 3.141592653589793
#define INTINF 1<<30
#define LLINF 1LL<<60
#define MPRIME 1000000007
#define MPRIME9 998244353
#define MMPRIME (1ll<<61)-1
#define len length()
#define pushb push_back
#define fi first
#define se second
#define setpr fixed<<setprecision(15)
#define all(name) name.begin(),name.end()
#define rall(name) name.rbegin(),name.rend()
#define gsort(vbeg,vend) sort(vbeg,vend,greater<>())
template<class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline void outmat(T& a, int y, int x) {
for(int i=0; i<y; i++) {
for(int j=0; j<x; j++) cout<<a[i][j]<<" ";
cout<<endl;
}
}
template<class T>
inline void init(T& v) {
for(auto &a: v) cin>>a;
}
template<class T, class U>
inline void init(vector<pair<T,U>>& v) {
for(auto &a: v) cin>>a.first>>a.second;
}
template<class T, class N>
inline void init(T& v, N n) {
v.resize(n);
for(auto &a: v) cin>>a;
}
template<class T, class U, class N>
inline void init(vector<pair<T,U>>& v, N n) {
v.resize(n);
for(auto &a: v) cin>>a.first>>a.second;
}
template<class N>
void resiz(N n) {
//empty
}
template<class N, class T, class... U>
void resiz(N n, T&& hd, U&&... tl) {
hd.resize(n);
resiz(n,forward<U>(tl)...);
}
ll binpow(ll a, ll ex, ll p) { //繰り返し二乗法
ll result=1;
while(ex>0) {
if(ex&1) result=result*a%p;
ex>>=1;
a=a*a%p;
}
return result;
}
string S;
int alp[26];
void input() {
cin>>S;
}
void solve() {
ll res=(ll)S.len*(S.len-1)/2+1;
for(int i=0; i<S.len; i++) {
res-=alp[S[i]-'a'];
alp[S[i]-'a']++;
}
cout<<res<<endl;
}
int main() {
int t=1;
while(t) {
input();
solve();
t--;
}
}
| 1 |
Subsets and Splits