code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <iostream>
#include <string>
int main(){
std::string sent;
int gyou,num=0;
std::cin >> gyou;
getline(std::cin, sent);
for(int i=0;i<gyou;++i){
num=0;
getline(std::cin, sent);
std::string bef="Hoshino",aft="Hoshina";
while(num!=-1){
num=(int)(sent.find(bef));
if(num!=-1){
sent.replace(num,bef.size(),aft);
}
}
std::cout << sent << std::endl;
/*if(i<gyou-1)
std::cout << std::endl;*/
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int ctoi(char c) {return c-'0';}// char to int
int gcd(ll a,ll b){return b?gcd(b,a%b):a;}//MAX
int lcm(ll a,ll b){return a*b/gcd(a,b);}//MIN
int main(){
string s;
cin >> s;
int n;
cin >> n;
for(int i=0;i<s.size();i+=n){
cout<<s.at(i);
}
cout<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
int main(){
ll counte=0,countw=0;
string str;
cin>>str>>str;
vector<ll> w((ll)str.size());
vector<ll> e((ll)str.size());
for(ll i=0;i<(ll)str.size();i++){
if(i==0){
if(str.at(i)=='E'){e.at(i)=1;w.at(i)=0;counte++;}
else{e.at(i)=0;w.at(i)=1;countw++;}
}
else{
if(str.at(i)=='E'){e.at(i)=e.at(i-1)+1;w.at(i)=w.at(i-1);counte++;}
else{e.at(i)=e.at(i-1);w.at(i)=w.at(i-1)+1;countw++;}
}
}
ll ans;
for(ll i=0;i<(ll)str.size();i++){
if(i==0){ans=counte-e.at(0);}
else if(i==(ll)str.size()-1){ans=min(ans,w.at(i));}
else{ans=min(ans,w.at(i-1)+counte-e.at(i));}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define tt int t; cin>>t; while(t--)
#define be(a) (a).begin(),(a).end()
#define rbe(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a,b,sizeof(a))
#define yes cout<<"YES"<<nl
#define no cout<<"NO"<<nl
#define su ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define frac cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
void f()
{
int a,b;
cin>>a>>b;
cout<<max(a+b,max(2*a-1,2*b-1))<<nl;
}
int main()
{
su;
f();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;
#define reps(i, a, b) for (int i = a; i < b; ++i)
#define rep(i, n) reps(i, 0, n)
#define REPS(i, a, b) reps(i, a, b)
#define REP(i, n) rep(i, n)
#define deps(i, a, b) for (int i = a; i >= b; --i)
#define dep(i, n) deps(i, n, 0)
#define DEPS(i, a, b) deps(i, a, b)
#define DEP(i, n) dep(i, n)
#define pf push_front
#define pb push_back
#define mp make_pair
#define fst first
#define FST fst
#define sec second
#define SEC sec
#define sz(obj) ((int)(obj).size())
#define all(v) (v).begin(), (v).end()
#define ALL(v) all(v)
const int INF = 999999999;
const int MOD = 1e9 + 7;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; std::cin >> x; return x;}
template <typename T>
void print(std::vector<T>& v, char c = ' ') {
REP(i, v.size()) {
if (i != 0) std::cout << c;
std::cout << v[i];
}
std::cout << endl;
}
template <typename T> void print(T x) { std::cout << x << '\n'; }
signed main()
{
vi v(4);
rep(i, 4) v[i] = in();
sort(all(v));
print(v[1] + v[2] + v[3] + max(in(), in()));
return (0);
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
//const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
//const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main()
{
vector<int> a(4);
REP(i, 4) cin >> a[i];
vector<int> b(2);
REP(i, 2) cin >> b[i];
sort(ALL(a), greater<int>());
sort(ALL(b), greater<int>());
int sum = 0;
REP(i, 3) sum += a[i];
sum += b[0];
cout << sum << endl;
}
| 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>//sort,reverse
#include<utility>//pair
#include<queue>//queue,priority_queue
#include<deque>//double_ended queue
#include<map>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;//Pでpair<-,->を表す。
typedef map<LL,LL>::iterator Itr;
LL MOD=1000000007;
struct S{
LL x;LL y;LL z;
bool operator<(const S&a)const{
return x<a.x||(x==a.x&&y<a.y)||(x==a.x&&y==a.y&&z<a.z);
}
bool operator==(const S&a)const{
return (x==a.x)&&(y==a.y)&&(z==a.z);
}
};
int main()
{
LL n,Q;
cin>>n>>Q;
vector<S> v;
for(int i=0;i<n;i++){
LL a,b,c;
cin>>a>>b>>c;
S s;
s.x=c;s.y=a;s.z=b;
v.push_back(s);
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
/*for(int i=0;i<v.size();i++){
S s=v[i];
cout<<s.x<<' '<<s.y<<' '<<s.z<<endl;
}*/
map<LL,LL> m;
for(int i=0;i<Q;i++){
LL a;
cin>>a;
m.insert(P(a,i));
}
LL ans[Q];
for(int i=0;i<n;i++){
S s=v.back();
v.pop_back();
LL begin=s.y-s.x;
LL end=s.z-s.x;
vector <LL>d;
for(Itr itr=m.lower_bound(begin);itr!=m.lower_bound(end);advance(itr,1)){
ans[(*itr).second]=s.x;
d.push_back((*itr).first);
}
while(!d.empty()){m.erase(d.back());d.pop_back();}
}
for(Itr itr=m.begin();itr!=m.end();advance(itr,1)){
ans[(*itr).second]=-1;
}
for(int i=0;i<Q;i++){
cout<<ans[i]<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << (#x) << "] = [", _print(x)
#else
#define debug(x...)
#endif
#pragma endregion
typedef long long ll;
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define sz(v) int((v).size())
#define int ll
#pragma region
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#pragma endregion
int N,T;
vector<pair<int,int>> p;
int dp[6666];
void solve()
{
cin>>N>>T;
p.resize(N);
forn(i, N) cin>>p[i].f>>p[i].s;
//
sort(p.begin(), p.end());
for(auto& it: p)
{
for (int now = T - 1; now>= 0; --now)
{
dp[now+it.f] = max(dp[now+it.f], dp[now] + it.s);
}
}
int ans = 0;
forn(i, 6666) ans = max(ans, dp[i]);
cout << ans << '\n';
}
signed main()
{
int T = 1;
ios_base::sync_with_stdio(0); cin.tie(0);
cout << fixed << setprecision(22);
// cin >> T;
for(int i=1;i<=T;++i)
{
//cout << "Case #" << i << ": ";
solve();
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,l,ans=1e9; cin>>n>>l;
int S[n], sum=0;
for(int i=0; i<n; i++){
S[i] = l+i+1-1;
sum+=S[i];
}
for(int i=0; i<n; i++){
int x = abs(sum - (sum-S[i]));
ans = min(ans, x);
}
if(sum>=0)cout<<sum-ans<<endl;
else cout<<sum+ans<<endl;
}
| #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
int sum = n*(l-1) + (n*(n+1))/2;
if((l+n-1) < 0) {
sum -= l+n-1;
} else if(0 < l) {
sum -= l;
}
cout << sum << endl;
return 0;
}
| 1 |
#include<iostream>
using namespace std;
const int coin[2] = {5,500};
int main(){
int money,happy;
cin >> money;
int C[2] = {0,0};
for(int i = 1;i >= 0;i--){
C[i] = money / coin[i];
money -= coin[i]*C[i];
}
happy = C[0]*5 + C[1]*1000;
cout << happy << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int big = x/500;
int rest = x%500;
int small = rest/5;
cout << 1000*big + 5*small << endl;
} | 1 |
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
#include <set>
#include <list>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
namespace patch
{
template <typename T>
string to_string(const T& n)
{
ostringstream stm;
stm << n;
return stm.str();
}
int stoi(string str)
{
int ret;
istringstream stm(str);
stm >> ret;
if (stm.fail())
{
throw -1;
}
return ret;
}
vector<string> split(const string &str)
{
istringstream stm(str);
vector<string> ret;
copy(istream_iterator<string>(stm),
istream_iterator<string>(),
back_inserter(ret));
return ret;
}
vector<string> split(const string &str, char delim)
{
istringstream stm(str);
vector<string> ret;
string buf;
while (getline(stm, buf, delim))
{
ret.push_back(buf);
}
return ret;
}
}
int bubbleSort(vector<int>& vs)
{
int end = vs.size();
if (end == 1)
{
return 0;
}
int cnt = 0;
for (int j = 0; j < end - 1; ++j)
{
for (int i = 0; i < end - j - 1; ++i)
{
if (vs[i] > vs[i+1])
{
swap(vs[i], vs[i+1]);
++cnt;
}
}
}
return cnt;
}
// bubble sort
int main()
{
ios::sync_with_stdio(false);
// line 1
string s1;
getline(cin, s1);
int n = patch::stoi(s1);
// line 2
vector<int> vs(n);
vector<string> ss;
string s2;
getline(cin, s2);
ss = patch::split(s2);
for (int n = 0, sz = ss.size(); n < sz; ++n)
{
vs[n] = patch::stoi(ss[n]);
}
int cnt = bubbleSort(vs);
bool isFirst = true;
for (int n : vs)
{
//cout << n << " ";
if (isFirst)
{
cout << n;
isFirst = false;
}
else
{
cout << " " << n;
}
}
cout << "\n";
cout << cnt << "\n";
return 0;
} | #include <iostream>
#define N 101
using namespace std;
void swap(int *x, int *y){
int z = *x;
*x = *y;
*y = z;
}
int bubbleSort(int *A, int n){
int count = 0, flag = 1;
while(flag){
flag = 0;
for(int j=n-1;j>0;j--){
if(A[j] < A[j-1]){
swap(A[j], A[j-1]);
count++;
flag = 1;
}
}
}
return count;
}
int main(){
int n, A[N], change;
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i];
}
change = bubbleSort(A, n);
for(int i=0;i<n;i++){
if(i!=0) cout<<" ";
cout<<A[i];
}
cout<<endl<<change<<endl;
return 0;
} | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
#define bet(x, a, b) (a) <= (x) && (x) < (b)
typedef long long ll;
typedef unsigned long long ull;
int main()
{
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
return 0;
}
| #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
int a, b;
cin >> a >> b;
int ans;
ans = (b - 1) /(a - 1);
if((b-1)%(a-1)!=0) ans++;
cout << ans << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, ai;
cin >> N;
map <int,int> A;
for(int i=0;i<N;i++){
cin >> ai;
if(A.count(ai) > 0){ cout << "NO" << endl; return 0;}
else A[ai] = 1;
}
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
string s;
cin>>s;
for(i=0;i<s.length()-1;i++){
if(s[i]=='A'&&s[i+1]=='C'){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
string str;
cin>>str;
cout<<2018<<str.substr(str.find('7')+1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl vector<pll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pr_d(x) cout << fixed << setprecision(15) << x << endl
#define ud(c, x) distance(c.begin(), upper_bound(all(c), x))
#define ld(c, x) distance(c.begin(), lower_bound(all(c), x))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep3(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep4(i, a, b) for (int i = (a); i > (b); --i)
#define pb push_back
#define out(x) cout << x << "\n"
bool odd(int i) { return i % 2; }
#define all(v) v.begin(), v.end()
#define size(x) int(x.size())
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
void Yes_No(bool f) {
if (f)
printf("Yes\n");
else
printf("No\n");
}
void YES_NO(bool f) {
if (f)
printf("YES\n");
else
printf("NO\n");
}
template <typename T>
void deb1(T x) {
cout << x << "\n";
}
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//-------------------ここから回答する-----------------------
void solve(void) {
string s;
cin >> s;
set<char> st;
rep(i, 26) st.insert('a' + i);
rep(i, size(s)) st.erase(s[i]);
if (size(st) != 0)
out(*st.begin());
else
out("None");
}
int main(void) { solve(); } | 0 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 2200
using namespace std;
int a[N][N],f[N][N],l[N],r[N],b[N],id[N];
int n,m,ans;
char s[N];
int check(int x,int y){
return ((a[x][y]==a[x-1][y])&&(a[x][y-1]==a[x-1][y-1]))||((a[x][y]!=a[x-1][y])&&(a[x][y-1]!=a[x-1][y-1]));
}
bool cmp(int x,int y){
return b[x]>b[y];
}
int solve(){
for(int i=1;i<=n;i++)id[i]=i;
sort(id+1,id+1+n,cmp);
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
for(int i=1;i<=n;i++){
int x=id[i];
l[x]=x;
r[x]=x;
if(l[x-1])l[x]=min(l[x],l[x-1]);
if(r[x+1])r[x]=max(r[x],r[x+1]);
r[l[x]]=r[x];
l[r[x]]=l[x];
ans=max(ans,(r[x]-l[x]+1)*b[x]+((l[x]-1>0)?b[x]:0));
l[0]=0;
r[0]=0;
}
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%s",s+1);
for(int j=1;j<=m;j++)a[i][j]=s[j]=='.';
}
for(int i=1;i<=m;i++)f[1][i]=i;
for(int i=2;i<=n;i++){
f[i][1]=1;
for(int j=2;j<=m;j++){
if(check(i,j))f[i][j]=f[i][j-1]+1;
else f[i][j]=1;
}
}
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++)b[j]=f[j][i];
solve();
}
printf("%d\n",ans);
} | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
using namespace std;
template<typename S,typename T>auto&operator<<(auto&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(auto&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(auto&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(auto&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(auto&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}};
template<typename S,typename T,typename U>
auto& operator<<(auto& o,TRI<S,T,U>& t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}
typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;
const int MAX_N = 2005;
int t[MAX_N][MAX_N], a[MAX_N][MAX_N];
int h, w;
int calc()
{
int ans = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(a[i][j]) t[i+1][j] = 0;
else t[i+1][j] = t[i][j] + 1;
}
t[i+1][w] = 0;
stack<pair<int, int> > st;
for(int j = 0; j <= w; j++){
if(st.empty()){
st.push({j, t[i+1][j]});
continue;
}
pair<int, int> p = st.top();
if(p.second < t[i+1][j]){
st.push({j, t[i+1][j]});
}else if(p.second > t[i+1][j]){
int pos;
while(p.second >= t[i+1][j]){
ans = max(ans, (p.second+1)*(j-(pos=p.first)+1));
st.pop();
if(!st.empty()) p = st.top();
else break;
}
st.push({pos, t[i+1][j]});
}
}
}
return ans;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w;
rep(i,h){
string s;
cin >> s;
rep(j,w){
t[i][j] = (s[j] == '#');
}
}
h--, w--;
rep(i,h){
rep(j,w){
a[i][j] = (t[i][j]+t[i+1][j]+t[i][j+1]+t[i+1][j+1])%2;
}
}
rep(j,w+1){
t[0][j] = 0;
}
cout << max({h+1, w+1, calc()}) << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a;
double b;
cin >> a >> b;
int B = b * 100;
long long c = a * B / 100;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e9+7;
int main(){
ll a,b;
cin>>a>>b;
cout << a*b;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n ;
int result;
result = 1;
int k;
cin >> k;
for (int i = 0; i < n; i++)
{
if (result+k < result*2)
{
result = result + k;
}
else if (result*2 <= result+k)
{
result = result*2;
}
}
cout << result << endl;
// ここにプログラムを追記
} | #include <bits/stdc++.h>
#define N 1005
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;
typedef long long ll;
ll ans;
int main(){
ll n, t;
cin >> n >> t;
ll arr[n];
for(int i=0; i<n; i++) cin >> arr[i];
ans = n*t;
for(int i=1; i<n; i++){
if(t-(arr[i]-arr[i-1]) > 0) ans-=t-(arr[i]-arr[i-1]);
}
cout << ans;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(n);++j)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define int long long
#define pb(a) push_back(a)
#define eraser(v,i) (v).erase(v.begin()+(i))
#define pbpair(a,b) push_back(make_pair(a,b))
#define MOD 1000000007
#define INF 9223372036854775807
#define pairint pair<int,int>
int num[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
bool uru(int checkyear){if(checkyear%4==0){if(checkyear%100!=0||checkyear%400==0)return true;}return false;}
int gcd( int x, int y ){return y ? gcd(y, x%y) : x;}
bool pairCompare(const pairint& firstElof, const pairint& secondElof)
{
if(firstElof.second!= secondElof.second) return firstElof.second> secondElof.second;
else return firstElof.first< secondElof.first;
}
signed main() {
int x=0,y=0,z=0,w=0,n=0,m=0;
std::vector<int> v(10);
while (std::cin >> x,x) {
rep(i,10)v[i]=0;
rep(i,x){
std::cin >> y;
v[y]++;
}
rep(i,10){
if(v[i]>0){
Rep(j,v[i]){
std::cout << "*";
}
std::cout<< '\n';
}else std::cout << "-" << '\n';
}
}
}
| #include <iostream>
#include <cmath>
#include <map>
#include <string>
using namespace std;
int main()
{
map<char,int> roman;
roman['I'] = 1;
roman['V'] = 5;
roman['X'] = 10;
roman['L'] = 50;
roman['C'] = 100;
roman['D'] = 500;
roman['M'] = 1000;
string s;
while(cin >> s)
{
int ans = 0;
for(int i=0;i<s.size()-1;i++)
{
if(roman[s[i]] >= roman[s[i+1]]) ans += roman[s[i]];
else ans -= roman[s[i]];
}
ans += roman[s[s.size()-1]];
cout << ans << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <string>
using namespace std;
void swapD(double *a,double *b){
double tmp = *a;
*a = *b;
*b = tmp;
}
void swapString(string *a,string *b){
string tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
int n;
string str[60];
double data[60];
for(int i=0;i<60;i++){
data[i]=10000000;
}
while(cin>>n){
if(n==0)break;
for(int i=0;i<n;i++){
data[i]=0;
int p,a,b,c,d,e,f,s,m;
cin>>str[i]>>p>>a>>b>>c>>d>>e>>f>>s>>m;
int cnt=0;
cnt = a+b+c+d+e;
data[i]=s*f;
m--;
for(int j=0;j<m;j++){
cnt+=(d+e);
data[i]+=f*s; }
data[i]-=p;
data[i]/=(double)cnt;
}
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(data[j]>=data[j-1] ){
swapD(&data[j],&data[j-1]);
swapString(&str[j],&str[j-1]);
}
}
}
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(data[j]>=data[j-1] && str[j]<=str[j-1]){
swapD(&data[j],&data[j-1]);
swapString(&str[j],&str[j-1]);
}
}
}
for(int i=0;i<n;i++){
//cout<<str[i]<<" "<<data[i]<<endl;
cout<<str[i]<<endl;
}
cout<<"#"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
//const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
vector<vector<int>> grid(h, vector<int>(w, 0));
rep(y, h) rep(x, w) {
if ((y < b && x < a) || (b <= y && a <= x)) {
grid[y][x] = 1;
}
}
rep(y, h) {
rep(x, w) {
cout << grid[y][x];
}
cout << endl;
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename K,typename V>
using umap = unordered_map<K,V>;
template <typename V>
using uset = unordered_set<V>;
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; }
#define REP(i,n) for(int i=0;i<n;i++)
#define REPD(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define ALL(v) v.begin(),v.end()
#define INF 1'000'000'000'000 //10^12
#define MOD 1'000'000'007
int main(){
int n;
cin >> n;
int a[n];
REP(i,n){
cin >> a[i];
}
uset<int> a_set;
REP(i,n){
if(a_set.find(a[i]) == a_set.end()){
a_set.insert(a[i]);
}else{
a_set.erase(a[i]);
}
}
cout << a_set.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
using pii = pair<int, int>;
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());
int ans = 0;
set<int> hako;
map<int, int> s;
for (int i = 0; i < n; i++) {
s[a[i]]++;
}
for (auto it = s.begin(); it != s.end(); it++) {
if ((it->second % 2) != 0) {
ans++;
}
}
cout << ans << endl;
} | 1 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
typedef long long ll;
using namespace std;
ll n, m;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar(); }
while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * w;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("cpp.in", "r", stdin), freopen("cpp.out", "w", stdout);
#endif
n = read <ll> (), m = n / 11 * 2ll, n %= 11;
if(!n) { printf("%lld\n", m); return 0; }
else if(n <= 6) { printf("%lld\n", m + 1); return 0; }
else printf("%lld\n", m + 2);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799;
ll x;
ll ans;
int main(){
cin >> x;
ans = x / 11 * 2;
if(x % 11 >= 7) ans+=2;
else if(x%11 != 0) ans++;
cout<<ans <<endl;
} | 1 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P> PP;
static const double EPS = 1e-8;
int main(){
int N,Q;
while(~scanf("%d %d",&N,&Q)){
if(N==0 && Q==0) break;
map<int,int> freq;
for(int i=0;i<N;i++){
int num;
scanf("%d",&num);
for(int j=0;j<num;j++){
int day;
scanf("%d",&day);
freq[day]++;
}
}
int maxv=0;
int min_day=INF;
for(map<int,int>::iterator it = freq.begin(); it!=freq.end();it++){
if(it->second >= Q){
if(maxv < it->second){
maxv = it->second;
min_day=it->first;
}
else if(maxv == it->second){
min_day=min(min_day,it->first);
}
}
}
printf("%d\n",min_day >= INF ? 0 : min_day);
}
} | #include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
const int MAX_V=102;
int vote[MAX_V];
int main(){ _;
int n,q,m,tmp,result,resultCount;
while(cin>>n>>q,(n|q)!=0){
REP(i,MAX_V) vote[i]=0;
REP(i,n){
cin>>m;
REP(j,m){
cin>>tmp;
vote[tmp]++;
}
}
result=0;
resultCount=q-1;
REP(i,MAX_V){
if(vote[i]>resultCount){
result=i;
resultCount=vote[i];
}
}
cout<<result<<endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
using Edge = pair<ll,ll>;
using Graph = vector<vector<Edge>>;
int N;
Graph G;
vector<ll> res;
void bfs(ll v) {
queue<vector<ll>> que;
que.push({v,-1,0});
while(que.size()) {
auto p = que.front();
que.pop();
if (p[1]!=-1) {
res[p[0]] = res[p[1]] + p[2];
}
else {
res[p[0]] = 0;
}
for (auto e:G[p[0]]) {
if (res[e.first]==-1) que.push({e.first, p[0], e.second});
}
}
}
int main(){
cin >> N;
G.assign(N, vector<Edge>());
for (int i=0; i<N-1; i++) {
ll a,b,c;
cin >> a >> b >> c;
a--;
b--;
G[a].push_back(Edge(b,c));
G[b].push_back(Edge(a,c));
}
res.assign(N,-1);
int Q,K;
cin >> Q >> K;
K--;
bfs(K);
rep(i,Q) {
int x,y;
cin >> x >> y;
x--,y--;
cout << res[x] + res[y] << endl;
}
} | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
// 二部グラフ判定
vector<ll> color;
bool dfs(mat G,ll v,ll cur = 0) {
color[v] = cur;
for(auto next_v : G[v]) {
// 隣接頂点がすでに色確定していた場合
if (color[next_v] != -1) {
if (color[next_v] == cur) return false; // 同じ色が隣接したらダメ
continue;
}
// 隣接頂点の色を変えて、再帰的に探索 (一回でも false が返ってきたら false)
if (!dfs(G, next_v , 1 - cur)) return false;
}
return true;
}
int main(){
ll n,m;
cin >> n >> m;
mat G(n);
vec a(m),b(m);
for(ll i=0;i<m;i++){
cin >> a[i] >> b[i];
G[a[i]-1].push_back(b[i]-1);
G[b[i]-1].push_back(a[i]-1);
}
vec d(n,-1);
d[0]=0;
queue<ll> q;
q.push(0);
while(!q.empty()){
ll v=q.front();
q.pop();
for(ll i=0;i<G[v].size();i++){
if(d[G[v][i]]!=-1)continue;
d[G[v][i]]=d[v]+1;
q.push(G[v][i]);
}
}
bool ok=true;
for(ll i=0;i<m;i++){
if((d[a[i]-1]-d[b[i]-1])%2==0)ok=false;
}
color=vec(n,-1);
if(!ok){
cout << n*(n-1)/2-m << endl;
}
else{
ll b=0;
for(ll i=0;i<n;i++)b+=(d[i]&1);
cout << b*(n-b)-m << endl;
}
} | 0 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353 //1000000007 // //100000000
#define INF 1000000000000000000
#define ll long long
//#define M_PI 3.141592653589793238463
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popcount __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
//~~~~~~fancy print~~~~~~~//
#define printpii(a) cout << a.ft << " " << a.sd << endl;
#define printpiii(a) cout << a.ft << " " << a.sd.ft << " " << a.sd.sd << endl;
#define print(a, n) rep(i, n) cout << a[i] << " "; cout << endl;
#define printv(v) for(auto x: v)cout << x << " "; cout << endl;
#define printm(a, n, m) rep(i, n) { rep(j, m) cout << a[i][j] << "\t"; cout << endl;}
ll dx[4] = {0, 0, 1, -1};
ll dy[4] = {1, -1, 0, 0};
void fast(){ios_base::sync_with_stdio(false);cin.tie(0);cout << setprecision(12) << fixed;}
void solve(){
string s;
cin >> s;
if(s[0] != 'A') ANS("WA");
ll f = 0;
for(ll i = 2; i < s.size()-1; i++){
if(s[i] == 'C'){
if(f == 1) {ANS("WA");}
else f = i;
}
}
if(f == 0) ANS("WA");
for(ll i = 1; i < s.size(); i++){
if(i != f && s[i] >= 'A' && s[i] <= 'Z') ANS("WA");
}
ANS("AC");
}
main(){
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
fast();
ll t = 1; //cin >> t;
while(t--){
solve();
}
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<fixed<<setprecision(n)
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sort(a) sort((a).begin(), (a).end())
#define uniq(a) SORT(a);(a).erase(unique((a).begin(), (a).end()), (a).end())
#define reverse(a) reverse((a).begin(), (a).end())
#define ctos(c) string(1, (c))
#define out(d) cout << (d)
#define outl(d) std::cout<<(d)<<"\n"
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define ceil(x, y) ((x + y - 1) / (y))
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define debug2(x, y) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\n'
#define debug3(x, y, z) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " << (z) << '\n'
#define dbg(v) for (size_t _ = 0; _ < v.size(); ++_){ cerr << #v << "[" << _ << "] : " << v[_] << '\n'; }
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007; // 10^9 + 7
void solve() {
string s; cin >> s;
if (s.size() == 3) reverse(s);
outl(s);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
srand((unsigned)time(NULL));
fix(12);
solve();
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
//Zeller's conguence
int main()
{
int h, y, m, d;
h = 20;
y = 4;
while (true)
{
cin >> m >> d;
if (m == 0 && d == 0)
break;
if (m == 1 || m == 2)
{
m += 12;
y--;
}
int r = 5 * h + h / 4;
int w = {d + ((13 * (m + 1)) / 5) +
y + y / 4 + r + 5};
int ans = w % 7 + 1;
switch (ans)
{
case 7:
cout << "Sunday" << endl;
break;
case 1:
cout << "Monday" << endl;
break;
case 2:
cout << "Tuesday" << endl;
break;
case 3:
cout << "Wednesday" << endl;
break;
case 4:
cout << "Thursday" << endl;
break;
case 5:
cout << "Friday" << endl;
break;
case 6:
cout << "Saturday" << endl;
break;
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int i, j, k, m, d, ans;
int m0[13] = {0, 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335};
char w[7][25] = {
"Wednesday",
"Thursday",
"Friday",
"Saturday",
"Sunday",
"Monday",
"Tuesday"
};
while( 1 ) {
scanf("%d%d", &m, &d);
if(!m && !d) break;
ans = m0[m] + d;
ans %= 7;
printf("%s\n", w[ans]);
}
return 0;
}
| 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
int N; cin >> N;
if (N == 0) {
cout << 0 << endl;
return 0;
}
vector<int> vs;
while (abs(N) > 0) {
int r = abs(N) % 2;
if (r == 1) N--;
vs.push_back(r);
N /= -2;
}
for (auto it = vs.rbegin(); it != vs.rend(); ++it) {
cout << *it;
}
cout << endl;
}
| #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
int q = 0;
int cnt = 0;
int left = 0, right = n;
vector<int> es(n);
while(true) {
cout << q << endl;
string tmp;
cin >> tmp;
if(tmp == "Vacant"){
return 0;
}else if(tmp =="Male"){
if(cnt == 0) {
for(int i = 0; i < n; i++){
if(i % 2 == 0){
es[i] = 0;
}else{
es[i] = 1;
}
}
} else {
if(es[q] == 0){
left = q;
} else {
right = q;
}
}
}else{
if(cnt == 0) {
for(int i = 0; i < n; i++){
if(i % 2 == 0){
es[i] = 1;
}else{
es[i] = 0;
}
}
} else {
if(es[q] == 1){
left = q;
} else {
right = q;
}
}
}
q = (left + right) / 2;
cnt++;
}
return 0;
} | 0 |
#include<iostream>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
cout<<n*m<<endl;
} | #include <cstdio>
typedef long long ll;
#define rep(i,a,n) for (int i=a;i<n;i++)
ll mod;
int n;
ll powmod(ll a,ll b) {ll res=1;a%=mod; for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll ipw2[10100],ipw3[10100],fac[10100],fnv[10100];
int main() {
scanf("%d%lld",&n,&mod);
fac[0]=1;
rep(i,1,10000) fac[i]=fac[i-1]*i%mod;
rep(i,0,10000) fnv[i]=powmod(fac[i],mod-2),ipw2[i]=powmod(2,mod-1-i),ipw3[i]=powmod(3,mod-1-i);
int s=0;
rep(i,0,n+1) rep(j,0,n-i+1) s=(s+fnv[i]*fnv[j]%mod*fnv[3*n-3*i-2*j]%mod*ipw3[i]%mod*ipw2[j])%mod;
printf("%d\n",s*fac[3*n]%mod);
} | 0 |
/*
* Author: .-O_O-.
*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(int a=b;a<c;a++)
#define in insert
#define len length()
#define si size()
#define lb lower_bound
#define ub upper_bound
#define beg begin()
#define en end()
#define f first
#define s second
#define pr(a) cout<<a
#define pr2(a,b) cout<<a<<" "<<b<<"\n"
#define nx cout<<"\n"
#define int long long
// void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]"<<endl;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define deb(x...)
#endif
const ll mod = 1000000007;
const ll N = 105;
const ll mm = 1e+18;
bool isprime(long long n){
if(n<=1) return false;
for(long long i=2;i<=sqrt(n);i++){
if(n%i==0) return false;
}
return true;
}
void solve()
{
int n;
cin>>n;
int ans=1;
rep1(i,n){
if(isprime(i)){
int ff=0;
repp(j,i,n+1){
int x=j;
while(x%i==0){
ff++;
x/=i;
}
}
ans=(ans*(ff+1))%mod;
}
}
cout<<ans;
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
//cin>>t;
rep1(_i,t){
//cout<<"Case #"<<_i<<": ";
solve();
//nx;
}
return 0;
} | //itp1_5-d
#include <iostream>
using namespace std;
int include3(int x){
return (! x) ? 0 : (x%10==3 || include3(x/10));
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
if(i%3==0) cout<<" "<<i;
else if(include3(i)) cout<<" "<<i;
}
cout<<endl;
return 0;
} | 0 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
const ll N = 100005;
int main(){
//入力
vector<int> v;
ll n, m, A[N]; cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> A[i];
vector<int> odds;
vector<int> ans_A;
for (int i = 0; i < m; i++) //奇数の抽出
{
if (A[i]%2==1)
{
odds.emplace_back(A[i]);
}
if (odds.size() == 3)
{
cout << "Impossible";
return 0;
}
}
if (odds.size() == 0)
{
for (int i = 0; i < m; i++)
{
ans_A.emplace_back(A[i]);
}
}
else if (odds.size() != 0)
{
ans_A.emplace_back(odds[0]);
for (int i = 0; i < m; i++)
{
if(A[i] % 2 == 1) continue;
ans_A.emplace_back(A[i]);
}
if (odds.size() == 2)
{
ans_A.emplace_back(odds[1]);
}
}
for (int i = 0; i < ans_A.size(); i++)
{
cout << ans_A[i] << " "; //aの表示
}
cout << endl;
int B_size = ans_A.size();
if (ans_A.size()==1){
B_size++;
ans_A.emplace_back(1);
}
else
{
ans_A[ans_A.size()-1]++;
}
if (ans_A[0] == 1){
B_size--;
}
cout << B_size << endl; //bの大きさの表示
if (ans_A[0] != 1)
{
cout << ans_A[0]-1 << " ";
}
for (int i = 1; i < ans_A.size(); i++)
{
cout << ans_A[i] << " " ;
}
cout << endl;
} | #include <cstdio>
const int N = 1000064;
int A[N], B[4];
int main() {
int m, x, *a = A, *b = B;
scanf("%*d%d",&m);
if (m == 1) {
scanf("%d",&x);
if (x == 1) puts("1\n1\n1");
else printf("%d\n2\n1 %d",x,x-1);
return 0;
}
while (m--) {
scanf("%d",&x);
*(x&1 ? b : a)++ = x;
if (b > B+2) {puts("Impossible"); return 0;}
}
while (b != B+2) *b++ = *--a;
printf("%d ",B[1]);
for (int *i = a; i != A;) printf("%d ",*--i);
printf("%d\n%d\n%d",*B,int(a-A)+1+(*B>1),B[1]+1);
for (int *i = a; i != A;) printf(" %d",*--i);
if (--*B) printf(" %d",*B);
return 0;
} | 1 |
#include <iostream>
using namespace std;
int func(int x, int y, int z){
// cout << x << " " << y << " " << z << endl;
if (x==y||y==z||z==x) return false;
if (x+y>z&&y+z>x&&z+x>y){
// cout << "ok" << endl;
return true;
}
return false;
}
int main(void){
int n,ans;
int len[200];
cin >> n;
for (int i=0; i<n; i++) cin >> len[i];
ans = 0;
for (int i=0; i<n; i++){
for (int j=i+1; j<n; j++){
for (int k=j+1; k<n; k++){
ans += func(len[i], len[j], len[k]);
}
}
}
cout << ans << endl;
return 0;
} | #define DIN freopen("input.txt","r",stdin);
#define DOUT freopen("output.txt","w",stdout);
#include <bits/stdc++.h>
#include <cstdio>
#define mem(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=(a);i<=(int)(b);i++)
#define REP_(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
using namespace std;
typedef long long LL;
typedef std::vector<int> VI;
typedef std::pair<int,int> P;
int read()
{
int x=0,flag=1; char c=getchar();
while((c>'9' || c<'0') && c!='-') c=getchar();
if(c=='-') flag=0,c=getchar();
while(c<='9' && c>='0') {x=(x<<3)+(x<<1)+c-'0';c=getchar();}
return flag?x:-x;
}
int main()
{
int a[105],n;
n=read();
REP(i,1,n) a[i]=read();
sort(a+1,a+n+1);
int ans=0;
for(int i=1;i<n;i++)
for(int j=i+1;j<n;j++)
for(int k=j+1;k<=n;k++)
if(a[i]+a[j]>a[k] && a[i]!=a[j] && a[j]!=a[k])
ans++;
cout<<ans;
return 0;
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
int dp[50];
rep(i,50)dp[i]=0;
dp[0]=1;
rep(i,40){
dp[i+1]+=dp[i];
dp[i+2]+=dp[i];
dp[i+3]+=dp[i];
}
int n;
while(cin>>n){
if(n==0)break;
int num = (int)((dp[n]-1)/3650)+1;
cout<<num<<endl;
}
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int tmp;
int dp[100];
cin>> tmp;
do{
fill(dp,dp+100,0);
dp[0] = 1;
for (int i = 0; i<tmp;i++)
{
for(int j = 1;j < 4;j++)
dp[i+j] += dp[i];
}
cout << dp[tmp]/3650 + 1<<endl;
cin >> tmp;
}while(tmp);
} | 1 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define MOD 1000000007
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pii pair<int, int>
ll ans;
int N;
void solve(){
cout << 180 * (N - 2) << endl;
}
int main(){
cin >> N;
solve();
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0; i<(n); i++)
ll d, c, ans, u;
int main(){
scanf("%lld", &d);
for(int i=1; i<=18; i++) rep(j,1<<(i-1)){
c = d; u = 1;
int a[20] = {};
rep(k,i){
a[k] = c % 10;
if(j>>k&1){
a[k] -= 10;
c += 10;
}
if(a[k] < -9 && a[k] > 9) u = 0;
c /= 10;
}
if(c) u = 0;
rep(k,(i+1)/2){
if(a[k] + a[i-1-k]) u = 0;
u *= 10 - abs(a[k]-(!k&&a[0]<=0));
}
ans += u;
}
printf("%lld\n", ans);
} | 0 |
#include <iostream>
#define MAX 1000
using namespace std;
class Contest {
public:
Contest() {}
Contest(int _id, int _cost, int _vote) {
id = _id;
cost = _cost;
vote = _vote;
}
bool compare_cost(int _cost) {
return cost <= _cost;
}
bool compare_vote(int _vote) {
return vote < _vote;
}
void output_id() {
cout << id << endl;
}
void voting(int _vote) {
vote += _vote;
}
int getVote() {
return vote;
}
private:
int id, cost, vote;
};
int main()
{
int n, m;
cin >> n >> m;
Contest *contests = new Contest[MAX];
int cost;
for(int i = 0; i < n; i += 1){
cin >> cost;
contests[i] = Contest(i+1, cost, 0);
}
for(int i = 0; i < m; i += 1) {
cin >> cost;
for(int j = 0; j < n; j += 1) {
if(contests[j].compare_cost(cost)){
contests[j].voting(1);
break;
}
}
}
Contest contest = contests[0];
for(int i = 1; i < n; i += 1) {
if(contest.compare_vote(contests[i].getVote())){
contest = contests[i];
}
}
contest.output_id();
delete[] contests;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[1000],t[1000];int n,m;
cin >> n >> m;
for(int i = 0;i<1000;i++){
a[i]= 0;
t[i]= 0;
}
for(int i = 0;i<n;i++){
cin >> a[i];
}
for(int i = 0;i<m;i++){
int p;
cin >> p;
int o = 0;
while(a[o]>p){o++;}
t[o]++;
}
int ans = 0;
for(int i = 0;i<n;i++){
if(t[ans]<t[i]){ans = i;}
}
cout << ans+1 << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
const int MOD = 1e9 + 7;
using namespace std;
int main(){
string K;
cin >> K;
int D;
cin >> D;
vector<vector<vector<long long>>> dp(K.size() + 1, vector<vector<long long>>(D, vector<long long>(2, 0)));
dp[0][0][1] = 1;
for(int i = 0; i < (int)K.size(); i++){
for(int j = 0; j < D; j++){
for(int k = 0; k < 10; k++){
dp[i + 1][(j + k) % D][0] += dp[i][j][0];
if(k < K[i] - '0'){
dp[i + 1][(j + k) % D][0] += dp[i][j][1];
}else if(k == K[i] - '0'){
dp[i + 1][(j + k) % D][1] += dp[i][j][1];
}
dp[i + 1][(j + k) % D][0] %= MOD;
dp[i + 1][(j + k) % D][1] %= MOD;
}
}
}
cout << ((dp[K.size()][0][0] + dp[K.size()][0][1] - 1) % MOD + MOD) % MOD << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
string sa;
ll d,dp[10010][110];
ll dfs_dp(int pos,ll sta,bool lim)
{
if(pos==sa.size())
return sta%d==0;
if(!lim && dp[pos][sta]!=-1)
return dp[pos][sta];
ll up=lim?(sa[pos]-'0'):9,res=0;
for(int i=0;i<=up;i++)
res=(res+dfs_dp(pos+1,(sta+i)%d,lim&(i==up)))%mod;
if(!lim)
dp[pos][sta]=res;
return res;
}
ll work()
{
return dfs_dp(0,0,1);
}
int main()
{
memset(dp,-1,sizeof(dp));
cin>>sa>>d;
cout<<(work()+mod-1)%mod<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve(std::vector<long long> H, std::vector<long long> M, long long K){
int t = (H[1] * 60 + M[1]) - (H[0] * 60 + M[0]) - K;
cout << t << endl;
}
// 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(){
std::vector<long long> H(2);
std::vector<long long> M(2);
for(int i = 0 ; i < 2 ; i++){
scanf("%lld",&H[i]);
scanf("%lld",&M[i]);
}
long long K;
scanf("%lld",&K);
solve(std::move(H), std::move(M), K);
return 0;
}
| #include<stdio.h>
int main()
{
int h1, m1, h2, m2, k, ans;
scanf("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
int sum1 = (h1 * 60) + m1;
int sum2 = (h2 * 60) + m2;
if(sum1 > sum2){
ans = sum1 - sum2 - k;
}else{
ans = sum2 - sum1 - k;
}
printf("%d\n", ans);
} | 1 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
string s;
cin >> s;
set<ll> mi;
rep(i, 26) mi.insert(i);
ll n = s.size();
string ans = "";
rep(i, n) {
ll idx = s[i] - 'a';
if (mi.find(idx) != mi.end()) {
mi.erase(idx);
ans += s[i];
} else {
auto citr = mi.begin();
ans += *citr + 'a';
mi.erase(citr);
}
} // i
if (s == ans) {
if (!mi.empty()) {
rep(i, 26) {}
ans += *mi.begin() + 'a';
} else {
vector<char> tst;
rep(i, 26) tst.push_back(s[i]);
next_permutation(tst.begin(), tst.end());
string cmp = "";
for (char c : tst) cmp += c;
if (cmp < s) {
puts("-1");
return 0;
} else {
rep(i,26) if(ans[i] != cmp[i]){
ans = cmp.substr(0, i+1);
break;
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
const int MOD = 1e9 + 7;
int N;
int main() {
cin >> N;
vector<ll> A(N);
vector<ll> sum(N + 1, 0); // sum[i+1] := A[i] までの和
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum[i + 1] = sum[i] + A[i];
}
ll P, Q, R, S;
ll ans = 1e18;
for (int i = 2; i <= N - 2; i++) { // [0,i) と[i,N) に分ける
// [0,id) と [id, i)
int id = lower_bound(ALL(sum), sum[i] / 2) - sum.begin();
if (i - id < 1) {
id--;
} else {
if (abs(sum[i] - sum[id - 1] * 2) < abs(sum[i] - sum[id] * 2)) id--;
}
P = sum[id];
Q = sum[i] - sum[id];
// [i, id2) と[id2, N)
int id2 = lower_bound(ALL(sum), (sum[N] - sum[i]) / 2 + sum[i]) - sum.begin();
if (N - id2 < 1) {
id2--;
} else {
if (abs((sum[N] - sum[id2 - 1]) - (sum[id2 - 1] - sum[i])) < abs((sum[N] - sum[id2]) - (sum[id2] - sum[i]))) id2--;
}
R = sum[N] - sum[id2];
S = sum[id2] - sum[i];
//cout << 0 << " " << id << " " << i << " " << id2 << " " << N << " " << P << " " << Q << " " << R << " " << S << " " << ans << endl;
chmin(ans, max(P, max(Q, max(R, S))) - min(P, min(Q, min(R, S))));
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long Int;
int main(){
map<int,Int> table;
vector<int> ids;
int n;
bool flug;
while(cin >> n, n != 0){
flug = false;
table.clear();
ids.clear();
for(int i=1; i<=n; i++){
int id;
Int tanka;
Int number;
cin >> id >> tanka >> number;
table[id] += (tanka*number);
vector<int>::iterator fIter = find(ids.begin(), ids.end(), id);
if(fIter == ids.end()){
ids.push_back(id);
}
}
for(vector<int>::iterator Iter = ids.begin(); Iter != ids.end(); Iter++){
if(table[*Iter] >= 1000000){
cout << *Iter << endl;
flug = true;
}
}
if(flug == false){
cout << "NA" << endl;
}
}
return 0;
} | #include <iostream>
int main(int argc, char const* argv[])
{
int i, n, a, b, a_score, b_score;
while (true) {
a_score = 0;
b_score = 0;
std::cin >> n;
if (n == 0) { break; }
for (i = 0; i < n; i++) {
std::cin >> a;
std::cin >> b;
if (a > b) {
a_score += (a + b);
} else if (b > a) {
b_score += (a + b);
} else {
a_score += a;
b_score += b;
}
}
std::cout << a_score << " " << b_score << std::endl;
}
return 0;
} | 0 |
#include <stdio.h>
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define mx 1000008
#define pii pair<int,int>
#define pi acos(-1.0)
#define pb push_back
#define ss second
#define ff first
typedef long long int ll;
///adjacent move
int fx[4]={0,+1,0,-1};
int fy[4]={+1,0,-1,0};
///knight
ll prime[mx];
void seive()
{
for(int i=2;i<mx;i+=2) prime[i]=2;
for(int i=3;i<mx;i+=2) prime[i]=i;
ll sq=sqrt(mx);
for(int i=3;i<=sq;i+=2){
if(prime[i]==i){
for(int j=i*i;j<mx;j+=i){
if(prime[j]==j) prime[j]=i;
}
}
}
}
int a[1000004];
ll f[2000004];
ll po[2000004];
int main()
{
//seive();
int t=1;
//cin>>t;
int c=0;
vector<ll>vec;
for(int i=2;i<mx;i++){
if(prime[i]==i){
vec.push_back(i);
}
}
while(t--){
ll n,m;
cin>>n;
ll a[n*2+7];
for(int i=1;i<=2*n;i++) cin>>a[i];
ll sum=0;
sort(a+1,a+2*n+1);
for(int i=1;i<=2*n;i++){
if(i&1) sum+=a[i];
}
cout<<sum<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
vector <int> L(2*n);
for (int i=0; i<L.size(); i++)
cin >> L[i];
sort (L.begin(), L.end());
int res = 0;
for (int i=0; i<L.size(); i+=2) {
res += min (L[i], L[i+1]);
}
cout << res;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;
int main() {
int H,W; cin >> H >> W;
vector<vector<int>> A(H,vector<int>(W));
rep(i,H)rep(j,W) cin >> A[i][j];
vector<vector<int>> B(H,vector<int>(W));
rep(i,H)rep(j,W) cin >> B[i][j];
vector<vector<int>> before(W,vector<int>(12800,0));
vector<vector<int>> now(W,vector<int>(12800,0));
before[0][6400] = 1;
rep(i,H) {
rep(j,W) {
int a = A[i][j];
int b = B[i][j];
rep(k,12800) {
if (before[j][k] == 0) continue;
if (0 <= k + a - b && k + a - b < 12800) {
if (j + 1 < W) before[j + 1][k + a - b] = 1;
if (i + 1 < H) now[j][k + a - b] = 1;
}
if (0 <= k + b - a && k + b - a < 12800) {
if (j + 1 < W) before[j + 1][k + b - a] = 1;
if (i + 1 < H) now[j][k + b - a] = 1;
}
}
}
if (i == H - 1) break;
swap(before,now);
now = vector<vector<int>>(W,vector<int>(12800,0));
}
//rep(i,W)for (int j = 6200;j< 6500;j ++) printf("before[%d][%d] %d ",i,j,before[i][j]);
int ans = INF;
int a = A[H - 1][W - 1],b = B[H - 1][W - 1];
rep(i,12800) {
if ((0 <= i + a - b && i + a - b < 12800 && before[W - 1][i + a - b])
|| (0 <= i + b - a && i + b - a < 12800 && before[W - 1][i + b - a])) {
ans = min(ans,abs(i - 6400));
}
}
cout << ans << endl;
return 0;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const int MOD = 1000000007;
//const int MOD = 998244353;
template<class T> inline int add(T& a, T b, T M = MOD){a=(a+M)%M;b=(b+M)%M;a=(a+b)%M;return a;};
template<class T> inline int mul(T& a, T b, T M = MOD){if(a>=M)a%=M;if(b>=M)b%=M;a*=b;if(a>=M)a%=M;return a;};
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
////////////////////////////////////////////////////////////////////
///////////////////////___modpow___////////////////////
ll modpow(ll a, ll n, const ll &MOD = MOD){
ll ret = n == 0 ? 1 : modpow(a, n/2, MOD);
(ret *= ret);
if(n%2)((ret *= a));
return ret;
}
///////////////////////___modinv___////////////////////
ll modinv(ll d, const ll &MOD = MOD){
return modpow(d, MOD-2, MOD);
}
vector<ll> fac, finv, inv;
void COMinit(const int MAX = 5000000, const ll &MOD = MOD){
fac.resize(MAX);finv.resize(MAX);inv.resize(MAX);
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
repd(i,2,MAX){
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 COM(int n, int k){
if(n < k)return 0;
if(n < 0 || k < 0)return 0;
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}
////////////////////////////////////////////////////////////////////
int h,w,a[100][100],b[100][100],c[100][100];
bool dp[85][85][20000];
signed main(){
cin>>h>>w;
rep(i,h)rep(j,w)cin>>a[i][j];
rep(i,h)rep(j,w)cin>>b[i][j];
rep(i,h)rep(j,w)c[i][j] = abs(a[i][j] - b[i][j]);
dp[0][0][abs(c[0][0])] = true;
rep(i,h){
rep(j,w){
rep(d,15000){
if(!dp[i][j][d])continue;
dp[i][j+1][d+c[i][j+1]] = j+1 < w;
dp[i][j+1][abs(d-c[i][j+1])] = j+1 < w;
dp[i+1][j][d+c[i+1][j]] = i+1 < h;
dp[i+1][j][abs(d-c[i+1][j])] = i+1 < h;
}
}
}
rep(i,15000){
if(dp[h-1][w-1][i]){
cout << i << endl;return 0;
}
}
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string s;
cin>>s;
vector<int>sumW(n+1,0);
for(int i=0;i<n;i++){
if(s[i]=='W'){
sumW[i+1]=sumW[i]+1;
}
else{
sumW[i+1]=sumW[i];
}
}
vector<int>sumE(n+1,0);
for(int i=0;i<n;i++){
if(s[i]=='E'){
sumE[i+1]=sumE[i]+1;
}
else{
sumE[i+1]=sumE[i];
}
}
int minn=1e9;
for(int i=0;i<n+1;i++){
minn=min(minn,(sumW[i]+sumE[n]-sumE[i]));
}
cout<<minn<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>data(N);
for(int i;i<N;i++){
char a;
cin >> a;
if(a=='W') data.at(i)=0;
else data.at(i)=1;
}
vector<int>r(N);
int one=0;
for(int i=1;i<N;i++){
one+=data.at(i);
}
r.at(0)=one;
for(int i=1;i<N;i++){
int a=0;
if(data.at(i)==1) a--;
if(data.at(i-1)==0) a++;
r.at(i)=r.at(i-1)+a;
}
sort(r.begin(),r.end());
cout << r.at(0) << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int elem[n];
int cnt=0;
for(int i=0;i<n;i++){
cin>>elem[i];
}
for(int i=0;i<n-1;++i){
for(int j=0;j<n-1-i;++j){
if(elem[j]>elem[j+1]){
++cnt;
elem[j]^=elem[j+1];
elem[j+1]^=elem[j];
elem[j]^=elem[j+1];
}
}
}
for(int i=0;i<n;++i){
cout<<elem[i];
if(i!=n-1)cout<<" ";
else cout<<endl;
}
cout<<cnt<<endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int bubble_sort(int n,vector<int> &vec);
int main() {
int n,count;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
count=bubble_sort(n,a);
for (int i = 0; i < n; i++) {
cout << a[i];
if (i != n - 1) { cout << " "; }
}
cout << "\n" << count << endl;
}
int bubble_sort(int n,vector<int> &vec) {
int count = 0;
bool flag = true;
while (flag) {
flag = false;
for (int j = 1; j < n; j++) {
if (vec[j] < vec[j - 1]) {
swap(vec[j], vec[j - 1]);
count++;
flag = true;
}
}
}
return count;
}
| 1 |
//g++ -std=c++14 test.cpp -o test.out
//問題URL
//https://atcoder.jp/contests/agc019/tasks/agc019_b
//参考：
//https://oraclesqlpuzzle.ninja-web.net/kyoupro/kyoupro-10-019-b.html
//ポイント：
//A[i]とA[j]が同じ文字の時、
//それに内包される文字列を反転させたものと
//A[i],A[j]を含んだ文字列を反転させても被るので除外する
//例えば
//文字列eabceにおいてはabc,eabceどちらを反転させても
//同じecbaeができる
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (1LL<<60);
const int INF_INT = 2147483647-1e6-1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
string S;
LL ans = 0;
void solve(){
LL N = S.size();
ans = N*(N-1)/2;
vector<LL> alpha(26,0);
for(int i=0;i<N;i++) alpha[S[i]-'a']++;
for(int i=0;i<26;i++) ans -= alpha[i]*(alpha[i]-1)/2;
ans++;
}
int main(){
cin >> S;
solve();
cout << ans << endl;
return 0;
} | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
char s[200005];
int n,cnt[26];
ll ans=0;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++)cnt[s[i]-'a']++;
ans=1;
for(int i=0;i<26;i++)for(int j=i+1;j<26;j++)ans+=1ll*cnt[i]*cnt[j];
printf("%lld\n",ans);
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
for(int i=0; i<n; i++) arr[i]++;
for(int i=1; i<n; i++) arr[i]+=arr[i-1];
int maxsum = arr[k-1];
for(int i=k; i<n; i++) maxsum = max(maxsum,arr[i]-arr[i-k]);
cout<<maxsum/2<<".";
if(maxsum%2) cout<<5;
else cout<<0;
cout<<"00000000";
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
v1 a(1001, 0);
for(int i = 1; i <1001; i++){
a[i] = a[i-1] + i;
}
int n, k;
cin >> n >> k;
vector<double> q(n+1, 0);
q[0] = 0;
for(int i = 1; i<=n; i++){
int p;
cin >> p;
double sum = static_cast<double>(a[p]) / static_cast<double>(p) + q[i-1];
q[i] = sum;
}
int j = 0;
double ans = 0;
for(int i = k; i <= n; i++){
ans = max(ans, q[i]-q[j]);
j++;
}
cout <<fixed << setprecision(15) << ans << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
vi a(3);
rep(i,3){
cin >> a.at(i);
}
sort(ALL(a));
int b,ans=0;
cin >> b;
rep(i,b){
a.at(2)*=2;
}
cout << a.at(0)+a.at(1)+a.at(2);
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
vector<int> v(3);
v.at(0) = A;
v.at(1) = B;
v.at(2) = C;
sort(v.begin(), v.end());
int n = v.back();
while (K) {
n *= 2;
K--;
}
cout << v.at(0) + v.at(1) + n << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<pair<string,P> >vec;
#define MAX_N 200001
long long par2[MAX_N]; // 親
long long rankuf2[MAX_N]; // 木の深さ
// n要素で初期化
void init2(long long n) {
for (long long i = 0; i < n; i++) {
par2[i] = i;
rankuf2[i] = 0;
}
}
// 木の根を求める
long long find2(long long x) {
if (par2[x] == x) {
return x;
} else {
return par2[x] = find2(par2[x]);
}
}
// xとyの属する集合を併合
void unite2(long long x, long long y) {
x = find2(x);
y = find2(y);
if (x == y) return;
if (rankuf2[x] < rankuf2[y]) {
par2[x] = y;
} else {
par2[y] = x;
if (rankuf2[x] == rankuf2[y]) rankuf2[x]++;
}
}
// xとyが同じ集合に属するか否か
bool same2(long long x, long long y) {
return find2(x) == find2(y);
}
long long par[MAX_N]; // 親
long long rankuf[MAX_N]; // 木の深さ
// n要素で初期化
void init(long long n) {
for (long long i = 0; i < n; i++) {
par[i] = i;
rankuf[i] = 0;
}
}
// 木の根を求める
long long find(long long x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
// xとyの属する集合を併合
void unite(long long x, long long y) {
x = find(x);
y = find(y);
if (x == y) return;
if (rankuf[x] < rankuf[y]) {
par[x] = y;
} else {
par[y] = x;
if (rankuf[x] == rankuf[y]) rankuf[x]++;
}
}
// xとyが同じ集合に属するか否か
bool same(long long x, long long y) {
return find(x) == find(y);
}
int main(){
long long K;
long long N;
long long L;
scanf("%lld",&N);
scanf("%lld",&K);
init(N+1);
init2(N+1);
vector<long long> q(K-1+1);
vector<long long> p(K-1+1);
scanf("%lld",&L);
vector<long long> r(L-1+1);
vector<long long> s(L-1+1);
for(int i = 0 ; i <= K-1 ; i++){
scanf("%lld",&p[i]);
scanf("%lld",&q[i]);
unite(p[i]-1, q[i]-1);
}
for(int i = 0 ; i <= L-1 ; i++){
scanf("%lld",&r[i]);
scanf("%lld",&s[i]);
unite2(r[i]-1, s[i]-1);
}
map<P, ll> m;
rep(i, N) {
m[P(find(i), find2(i))]++;
}
ll cnt = 0;
rep(i, N-1) {
cout << m[P(find(i), find2(i))] << " ";
}
cout << m[P(find(N-1), find2(N-1))] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vi parent,rankk,sz;
void init(ll n){
parent=vi(n);
rankk=vi(n);
sz=vi(n,1);
rep(i,n)parent[i]=i;
}
ll root(ll i){if(parent[i]==i)return i;return root(parent[i]);}
ll getsize(ll i){return sz[root(i)];}
bool same(ll a,ll b){return root(a)==root(b);}
bool heigou(ll x,ll y){
x=root(x);y=root(y);
if(x==y)return false;
if(rankk[x]<rankk[y]){parent[x]=y;sz[y]+=sz[x];}
else{parent[y]=x;sz[x]+=sz[y];}
if(rankk[x]==rankk[y])rankk[x]++;
return true;
}
int main(){
ll n,k,m;cin>>n>>k>>m;
init(n);
rep(i,k){
ll a,b;cin>>a>>b;a--;b--;
heigou(a,b);
}
vvi g(n);
rep(i,m){
ll a,b;cin>>a>>b;a--;b--;
g[a].pb(b);
g[b].pb(a);
}
vi ans(n);
vb used(n,false);
rep(i,n)if(!used[i]){
queue<ll> q;
q.push(i);
used[i]=true;
vp v;
while(!q.empty()){
ll t=q.front();q.pop();
v.pb(root(t),t);
for(ll x:g[t])if(!used[x]){
used[x]=true;
q.push(x);
}
}
sort(all(v));
int w=0,k=0;
while(w<v.size()){
k=w;
while(w<v.size()){
if(v[w].fi!=v[k].fi)break;
w++;
}
REP(j,k,w)ans[v[j].se]=w-k;
}
}
outv(ans);
} | 1 |
#include <stdio.h>
char zf1[1000010],zf2[1000010];
struct SZt
{
int l,r,h;
SZt(){}
SZt(int L,int R,int H)
{
l=L;
r=R;
h=H;
}
};
SZt dl[1000010];
int main()
{
// freopen("a.in","r",stdin);
// freopen("game.out","w",stdout);
int n,jg=0,he=0,ta=0,py=0;
scanf("%d%s%s",&n,zf1,zf2);
bool bt=false;
for(int i=0;i<n;i++)
{
if(zf1[i]!=zf2[i])
{
bt=true;
break;
}
}
if(!bt)
{
printf("0\n");
return 0;
}
for(int i=n-1;i>=0;i--)
{
while(he<ta&&dl[he].l-py>i)
he+=1;
if(he<ta)
{
if(dl[he].h+py+1>jg)
jg=dl[he].h+py+1;
if(i>0&&zf2[i]==zf2[i-1])
continue;
py+=1;
dl[he].r=i-1+py;
int la=dl[ta-1].l-py;
while(la>=0&&zf1[la]!=zf2[i])
la-=1;
if(la==-1)
{
printf("-1");
return 0;
}
dl[ta]=SZt(la+py,dl[ta-1].r-1,1-py);
ta+=1;
}
else
{
py=0;
if(jg<1)jg=1;
if(i>0&&zf2[i]==zf2[i-1])
continue;
int la=i;
while(la>=0&&zf1[la]!=zf2[i])
la-=1;
if(la==i)continue;
if(la==-1)
{
printf("-1");
return 0;
}
dl[ta++]=SZt(la,i-1,1);
}
}
printf("%d",jg);
return 0;
} | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int n,x[1000010],p;
char s[1000010],t[1000010];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int i,j,k,l;
scanf("%d%s%s",&n,&s,&t);
for(i=n-1,j=n,k=0,l=0;i>=0;i--)
{
if(j>i && t[i]!=s[i])
j=i;
if(j<=i && t[i]!=s[j])
{
for(;j>=0 && t[i]!=s[j];j--);
if(j<0)
{
printf("-1\n");
return 0;
}
k++;
l++;
x[j+l]++;
p=max(p,k);
}
k-=x[i+l];
x[i+l]=0;
}
printf("%d\n",p);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
class Dice{
public:
int num[6],t;//t=top
void North(){
/*
dice.num[0] = ???
dice.num[1] = ???
dice.num[2] = ???
dice.num[3] = ???
dice.num[4] = ???
dice.num[5] = ???*/
t = num[0];
num[0] = num[1];//??????1?????¨???
num[1] = num[5];//??????2?????¨???
num[5] = num[4];//??????6?????¨???
num[4] = t;//??????5?????¨???
}
void East(){
t = num[0];
num[0] = num[3];//??????1?????¨???
num[3] = num[5];//??????4?????¨???
num[5] = num[2];//??????6?????¨???
num[2] = t;//??????3?????¨???
}
void West(){
t = num[0];
num[0] = num[2];//??????1?????¨???
num[2] = num[5];//??????5?????¨???
num[5] = num[3];//??????6?????¨???
num[3] = t;//??????2?????¨???
}
void South(){
t = num[0];
num[0] = num[4];//??????1?????¨???
num[4] = num[5];//??????3?????¨???
num[5] = num[1];//??????6?????¨???
num[1] = t;//??????3?????¨???
}
void Rotation(){//?????¢??????????????§?????¢???????????¨???
t = num[1];
num[1] = num[2];//?????¢???2?????¨???
num[2] = num[4];//?????¢???3?????¨???
num[4] = num[3];//?????¢???5?????¨???
num[3] = t;//?????¢???4?????¨???
}
};
int main()
{
Dice d[100];//2<=n<=100
int n;
cin >>n;
for(int i=0; i<n; i++){//dice
cin >> d[i].num[0] >> d[i].num[1] >> d[i].num[2] >> d[i].num[3] >> d[i].num[4] >> d[i].num[5];
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(i == j)continue;
for(int k=0; k<6; k++){//dice?????°???
if (k == 4){
d[i].East();
}
if(k == 5){//dice?????°?????¨????????????
d[i].East();
d[i].East();
}
for(int l=0; l<4; l++){//dice?????°??????4???????????????????????????Rotation
d[i].Rotation();
//?????????????????????????????´??????No
if( d[i].num[0] == d[j].num[0] &&
d[i].num[1] == d[j].num[1] &&
d[i].num[2] == d[j].num[2] &&
d[i].num[3] == d[j].num[3] &&
d[i].num[4] == d[j].num[4] &&
d[i].num[5] == d[j].num[5] )
{cout << "No" << endl;
return 0;
}
}
}
}
}
cout << "Yes" << endl;
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<functional>
#include<vector>
#include<queue>
using namespace std;
#define f(i,n) for(int i=0;i<(int)n;i++)
#define MOD 1000000009
struct dice{
int up;
int down;
int east;
int west;
int north;
int south;
};
dice a, b;
dice d[100];
char s[101]="NNNNENWNNNNENWNNNNENWNNNNENWENNNNWWNNNNE";
int x;
dice input(){
dice c;
scanf("%d", &x);
c.up = x;
scanf("%d", &x);
c.south = x;
scanf("%d", &x);
c.east = x;
scanf("%d", &x);
c.west = x;
scanf("%d", &x);
c.north = x;
scanf("%d", &x);
c.down = x;
return c;
}
void nr(){
x = a.north;
a.north = a.up;
a.up = a.south;
a.south = a.down;
a.down = x;
return;
}
void sr(){
x = a.south;
a.south = a.up;
a.up = a.north;
a.north = a.down;
a.down = x;
return;
}
void er(){
x = a.east;
a.east = a.up;
a.up = a.west;
a.west = a.down;
a.down = x;
return;
}
void wr(){
x = a.west;
a.west = a.up;
a.up = a.east;
a.east = a.down;
a.down = x;
return;
}
bool comp(){
if (a.up == b.up&&a.north == b.north&&a.east == b.east&&a.down == b.down&&a.south == b.south&&a.west == b.west)return true;
else return false;
}
int main(void){
int n,m;
scanf("%d", &m);
f(i, m)d[i] = input();
n = strlen(s);
bool ans = false;
for (int j = 0; j < m; j++){
for (int k = j + 1; k < m; k++){
a = d[j];
b = d[k];
f(i, n){
if (s[i] == 'N'){
nr();
}
else if (s[i] == 'S'){
sr();
}
else if (s[i] == 'E'){
er();
}
else if (s[i] == 'W'){
wr();
}
ans = comp();
if (ans == true)break;
}
if (ans == true)break;
}
if (ans == true)break;
}
if(ans==true)printf("No\n");
else printf("Yes\n");
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll h,m;
cin >> h >> m;
ll s=h*60+m;
cin >> h >> m;
ll g=h*60+m;
ll k;
cin >> k;
cout << g-s-k << endl;
} | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fil(a,b) memset((a),(b),sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef pair<ll,ll> PA;
typedef vector<int> poly;
inline ll read(){
ll x=0,f=1;char c=getchar();
while ((c<'0'||c>'9')&&(c!='-')) c=getchar();
if (c=='-') f=-1,c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
int h1,m1,h2,m2,k;
int main(){
h1=read(),m1=read(),h2=read(),m2=read(),k=read();
printf("%d\n",h2*60+m2-h1*60-m1-k);
} | 1 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
auto gcd = [](int mm, int nn) {
function<int(int, int)> f = [&f](int m, int n) {
if (n == 0) {
return m;
}
else {
return f(n, m % n);
}
};
return f(max(mm, nn), min(mm, nn));
};
auto gcd3 = [gcd](int n, int m, int o) { return gcd(n, gcd(m, o)); };
vector<int> r;
if (n == 2) {
int a, b;
cin >> a >> b;
const auto s = gcd(a, b);
for (int i = 1; i <= s; ++i) {
if (a % i == 0 && b % i == 0) {
r.push_back(i);
}
}
}
else {
int a, b, c;
cin >> a >> b >> c;
const auto s = gcd3(a, b, c);
for (int i = 1; i <= s; ++i) {
if (a % i == 0 && b % i == 0 && c % i == 0) {
r.push_back(i);
}
}
}
for (auto i : r) {
cout << i << endl;
}
}
| #include<stdio.h>
int main(void)
{
int n;
int a[3],b,c;
int i,j,temp;
b=1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
if(n==2){
if(a[0]<a[1]){
temp=a[0];
a[0]=a[1];
a[1]=temp;
}
while(b!=a[1]){
for(i=0;i<a[1];i++){
if(a[0]%b==0 && a[1]%b==0){
printf("%d\n",b);
}
b++;
}
break;
}
}
else if(n==3){
for(i=0;i<2;i++){
for(j=i+1;j<3;j++){
if(a[i]<a[j]){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
while(b!=a[2]){
for(i=0;i<a[2];i++){
if(a[0]%b==0 && a[1]%b==0 && a[2]%b==0){
printf("%d\n",b);
}
b++;
}
break;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
// Template Headers {{{
using pii = pair<int, int>; using vpii = vector<pii>;
using vi = vector<int>; using vvi = vector<vi>;
using ll = long long; using vll = vector<long long>;
template <class T> using min_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> istream &operator>>(istream &, vector<T> &);
template <class T> ostream &operator<<(ostream &, const vector<T> &);
template <class T, class U> istream &operator>>(istream &, pair<T, U> &);
template <class T, class U> ostream &operator<<(ostream &, const pair<T, U> &);
template <class T> struct Inf { static constexpr T inf() { return std::numeric_limits<T>::has_infinity() ? std::numeric_limits<T>::infinty() : std::numeric_limits<T>::max(); } };
template <> struct Inf<int> { static constexpr int inf() { return 0x3f3f3f3f; } };
template <> struct Inf<long long> { static constexpr long long inf() { return 0x3f3f3f3f3f3f3f3fLL; } };
constexpr int INF = Inf<int>::inf(); constexpr ll BINF = Inf<ll>::inf();
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// }}}
int solve() {
int n, m; cin >> n >> m;
vvi g(n);
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
g[u].push_back(v); g[v].push_back(u);
}
int timer = 0;
vi stTime(n, INF), enTime(n, INF);
vi low(n);
vi ans(n);
function<void(int, int)> dfs = [&] (int u, int p) {
stTime[u] = timer++;
low[u] = stTime[u];
int jai = 0;
for (int v : g[u]) {
if (v == p) continue;
if (stTime[v] >= INF) {
// tree edge
dfs(v, u);
low[u] = min(low[u], low[v]);
if (low[v] >= stTime[u] && p != -1) ans[u] = 1;
jai++;
} else if (enTime[v] >= INF) {
// back edge
low[u] = min(low[u], stTime[v]);
}
}
enTime[u] = timer;
if (p == -1 && jai > 1) ans[u] = 1;
};
dfs(0, -1);
for (int i = 0; i < n; i++) if (ans[i]) cout << i << endl;
return 0;
}
// Template Main {{{
int main() {
ios::sync_with_stdio(0);
// precompute();
// int t; cin >> t; for (int i=1;i<=t;i++)
solve();
// cout << "Case #" << i << ": ", solve();
return 0;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto it=v.begin();it!=v.end();++it) is >> *it;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it=v.begin();it!=v.end();) os << *it, os << " \n"[++it==v.end()];
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
return is >> p.first >> p.second;
}
template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << p.first << ' ' << p.second;
}
// }}}
// vim: fdm=marker
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
vector<int> problems;
vector<int> bonus;
int solve(const int bits, const int D, const ll G) {
ll score = 0;
int ans = 0;
priority_queue<int> que;
for (int i = 0; i < D; i++) {
if (bits & (1 << i)) {
score += (i + 1) * 100 * problems[i];
score += bonus[i];
ans += problems[i];
} else {
for (int j = 0; j < max(0, problems[i] - 1); j++) {
que.push((i + 1) * 100);
}
}
}
while (!que.empty() && score < G) {
auto v = que.top();
que.pop();
score += v;
ans++;
}
if (score < G) {
return -1;
} else {
return ans;
}
}
int main(void) {
int D;
ll G;
cin >> D >> G;
problems.resize(D);
bonus.resize(D);
for (int i = 0; i < D; i++) {
cin >> problems[i] >> bonus[i];
}
int ans = INT_MAX / 2;
for (int bits = 0; bits < (1 << D); bits++) {
int cand = solve(bits, D, G);
if (cand >= 0) {
// printf("bits: %x, required: %d\n", bits, cand);
chmin(ans, cand);
}
}
cout << ans << endl;
return 0;
}
| 0 |
///A drunk man will find his way home, but a drunk bird may get lost forever...
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
//template <typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef tree<double, null_type, less_equal<double>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int long long
typedef long long ll;
typedef double dd;
typedef long double ldd;
typedef pair <int, int> pii;
typedef pair <pii , int> ppii;
#define pb push_back
#define pf push_front
#define ppb pop_back()
#define ppf pop_front()
#define f first
#define s second
#define sz(x) (int)x.size()
#define smin(x , y) x = min(x , y)
#define smax(x , y) x = max(x , y)
#define mp make_pair
#define all(x) x.begin() , x.end()
#define debug(x) cerr<< #x << " = " << x << endl
#define ddebug(x, y) cerr<< #x << " = " << x << ", " << #y << " = " << y << endl
#define uop(x, y) pii(min(x, y), max(x, y))
#define out return cout << "No" << endl, 0
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
const int mx = 6e3 + 10;
int n, m, fact[mx], inv[mx], C[mx][mx], M2[mx], M3[mx], p[mx];
int _pow(int a, int b){
if(!b)
return 1;
return ((_pow((a * a) % m, b >> 1) * ((b & 1) ? a : 1)) % m);
}
void pre(){
fact[0] = 1;
for(int i = 1; i <= 3 * n; i++)
fact[i] = (fact[i - 1] * i) % m;
inv[3 * n] = _pow(fact[3 * n] , m - 2);
for(int i = 3 * n - 1; ~i; i--)
inv[i] = (inv[i + 1] * (i + 1)) % m;
for(int i = 0; i <= 3 * n; i++)
for(int j = 0; j <= i; j++)
C[i][j] = fact[i] * inv[j] % m * inv[i - j] % m;
M2[0] = 1;
for(int i = 2; i <= 3 * n; i += 2)
M2[i] = M2[i - 2] * C[i][2] % m;
M3[0] = 1;
for(int i = 3; i <= 3 * n; i += 3)
M3[i] = M3[i - 3] * C[i][3] % m;
p[0] = 1;
for(int i = 1; i <= 3 * n; i++)
p[i] = p[i - 1] * 2 % m;
return;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
pre();
int ans = 0;
for(int a = 0; a <= n; a++)
for(int b = 0; b <= n; b++){
int c = 3 * n - 3 * a - 2 * b;
if(c < b)
continue;
int cnt = (C[3 * n][3 * a] * p[a] % m * M3[3 * a] % m * inv[a] % m) % m;
cnt = cnt * (C[3 * n - 3 * a][2 * b] * M2[2 * b] % m * inv[b] % m) % m;
ans = (ans + cnt) % m;
}
cout << ans << endl;
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DynamicMod.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "IntMod.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Range.h"
#include "Rational.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif
#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif
int N, MOD;
LL DP[6001][9001];
void add(LL& a, LL b) {
a += b;
if (a >= MOD) {
a -= MOD;
}
}
int main() {
cin >> N >> MOD;
N *= 3;
const int Q = N / 2;
DP[0][Q] = 1;
REP(i, 0, N) {
REP(k, -(i / 2), i + 1) {
if (i + 1 <= N) add(DP[i + 1][Q + k + 1], DP[i][Q + k]);
if (i + 2 <= N) add(DP[i + 2][Q + k - 1], DP[i][Q + k] * (i + 1) % MOD);
if (i + 3 <= N) add(DP[i + 3][Q + k + 0], DP[i][Q + k] * (i + 1) % MOD * (i + 2) % MOD);
}
}
LL sum = 0;
REP(k, 0, N + 1) {
add(sum, DP[N][Q + k]);
}
cout << sum << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli,lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define all(x) x.begin(),x.end()
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define testcase() int t;cin>>t;while(t--)
#define clean(x) memset(x,0,sizeof(x))
#define FOR(x,y) for(int i=x;i<=y;i++)
const lli maxn = 2e5+9;
vector<lli> catlan(int n) {
vector<lli> dp(n + 1, 0);
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i ++) {
for (int j = 0; j < i; ++ j) {
dp[i] += dp[j] * dp[i - j - 1];
}
}
return dp;
}
lli b_ex(lli n,lli a){lli res=1;while(n){if(n%2==1)res*=a;n>>=1;a=a*a;}return res;}
lli ncr(lli n,lli k){lli ans=1;if(k>n-k)k=n-k;for(lli i=1;i<=k;i++){ans*=(n-i+1),ans=ans/i;}return ans;}
lli power(lli a , lli n){lli ans = 1;while(n){if(n % 2)ans = (ans * a) % mod;n /= 2;a = (a * a) % mod;}return ans;}
lli lcm(lli a,lli b){lli ans=(a*b)/(__gcd(a,b));return ans;}
lli set_bits(lli n)
{
int c=0;
if(n==0)return 0;
while(n)
{
if((n&1)==1)
{
cout<<c<<" ";
}
c++;
n=n>>1;
}
return c;
}
string X="IF THE CONSTRAINTS ARE LOW JUST BRUTE FORCE IT!!!!!!!!!!!!!!!!!!!!!";
///------------------ALWAYS lli-----TEMP TSF99--------------------------------------------------------------------------------------///
void solve()
{
string z="";
int a,b,c,d;cin>>a>>b>>c>>d;
/// 1st traversal
int dx=c-a,dy=d-b;
cout<<string(dy,'U') <<string(dx,'R');
cout<<string(dy,'D')<<string (dx,'L');
cout<<'L'<<string(dy+1,'U')<<string(dx+1,'R')<<'D';
cout<<'R'<<string(dy+1,'D')<<string(dx+1,'L')<<'U';
cout<<endl;
}
int main()
{
solve();
}
| #include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("No");}
#define printd(x) printf("%.12f\n", ans);
template<class T> bool chmin(T& a, const T& b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> bool chmax(T& a, const T& b) {if (a < b) {a = b; return 1;} return 0;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
ll a, b, k;
cin >> a >> b >> k;
rep (i, k) {
if (i % 2 == 0) {
if (a % 2 == 1) {
a--;
}
a /= 2;
b += a;
}
else {
if ( b % 2) {
b--;
}
b /= 2;
a += b;
}
}
cout << a << " " << b << endl;
return 0;
} | 0 |
#include <stdio.h>
#include <limits.h>
#define MAX 200000
#define INF INT_MAX
typedef long long ll;
void merge(int*, int, int, int);
void mergesort(int*, int, int);
ll ans;
int n, a[MAX];
int main(){
int i;
scanf("%d" ,&n);
for(i = 0 ; i < n ; i++){
scanf("%d" ,a + i);
}
mergesort(a,0,n);
printf("%lld\n" ,ans);
return 0;
}
void merge(int a[], int left, int mid, int right){
int n1 = mid - left, n2 = right - mid;
int L[n1+1], R[n2+1], i, j, k;
for(i = 0 ; i < n1 ; i++){
L[i] = a[left + i];
}
for(i = 0 ; i < n2 ; i++){
R[i] = a[mid + i];
}
L[n1] = R[n2] = INF;
for(i = 0, j = 0, k = left ; k < right ; k++){
if(i < n1 && (j == n2 || L[i] <= R[j])){
a[k] = L[i++];
}else{
ans += (n1 + n2) / 2 - i;
a[k] = R[j++];
}
}
}
void mergesort(int a[], int left, int right){
int mid;
if(left + 1 < right){
mid = (left + right) / 2;
mergesort(a, left, mid);
mergesort(a, mid, right);
merge(a, left, mid, right);
}
}
| #include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
#define MAX_N 200010
#define int long long
int bit[MAX_N], n, a[MAX_N], ma, b[MAX_N];
int sum(int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i , int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
signed main(){
int ans = 0;
map<int,int> ma;
cin>>n;
for(int i = 0; i < n; i++){
scanf("%d", &b[i]);
b[i]++;
a[i] = b[i];
}
sort(b,b+n);
for(int i = 0; i < n; i++)
ma[b[i]] = i+1;
for(int i = 0; i < n; i++)
a[i] = ma[a[i]];
for(int i = 0; i < n; i++){
ans += i - sum(a[i]);
add(a[i],1);
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void) {
char list[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
while(true) {
int n,k[200];
char s[150]={};
scanf("%d", &n);
if(!n) break;
for(int i=0; i<n; i++)
scanf("%d", &k[i]);
scanf("%s",s);
for(int i=0; s[i]; i++) {
printf("%c", list[((lower_bound(list, list+52, s[i])-list)-k[i%n]+52)%52]);
}
printf("\n");
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n,t;
while(cin >> n, n)
{
int k[10] = {0};
while(n--)
{
cin >> t;
k[t]++;
}
for(int i=0; i<10; i++)
{
if(k[i])
{
for(int j=0; j<k[i]; j++)
{
cout << '*';
}
cout << endl;
}
else
{
cout << '-' << endl;
}
}
}
} | 0 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,e,n,k,maxi=0,f=0,mini=INF,sum=0,q;
string str,stra,straa;
ll x,y,w,z;
char ca,cb,cc;
cin>>a>>b>>c>>k;
d=max(max(a,b),c);
e=d;
sum=a+b+c;
rep(i,k){
d*=2;
}
cout<<sum+d-e<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int A, B, C;
cin >> A >> B >> C;
int K;
cin >> K;
int multi;
for (int i = 0; i < K; i++)
{
multi = max(A, max(B, C)) * 2;
if (A * 2 == multi) A = multi;
else if (B * 2 == multi)
{
B = multi;
}
else
{
C = multi;
}
}
cout << A + B + C << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
vector<ll> v(2); int k;
cin>>v[0]>>v[1]>>k;
for (int i=0; i<k; i++) {
if (v[i%2]%2) {
v[i%2]--;
} else {
}
int o = 1^(i%2);
v[o] += (v[i%2]/2);
v[i%2] /= 2;
}
cout<<v[0]<<" "<<v[1]<<endl;
return 0;
}
| // tsukasa_diary's programing contest code template
#include <bits/stdc++.h>
using namespace std;
// define
#define for_(i,a,b) for(int i=a;i<b;++i)
#define for_rev(i,a,b) for(int i=a;i>=b;--i)
#define allof(a) a.begin(),a.end()
#define minit(a,b) memset(a,b,sizeof(a))
#define size_of(a) (int)a.size()
// typedef
typedef long long lint;
typedef double Double;
typedef pair<int, int> pii;
//
typedef vector< int > Array;
typedef vector< Array > Matrix;
typedef vector< Double > DArray;
typedef vector< DArray > DMatrix;
typedef vector< string > SArray;
typedef vector< pii > PArray;
// popcount
inline int POPCNT(int _x) { return __builtin_popcount(_x); }
inline int POPCNT(lint _x) { return __builtin_popcountll(_x); }
// inf
const int iINF = 1L << 30;
const lint lINF = 1LL << 60;
// eps
Double EPS = 1e-9;
// in range
inline bool in_range(int _v, int _mx, int _mi) { return _mi <= _v && _v < _mx; }
inline bool in_range(Double _v, Double _mi, Double _mx) { return -EPS < _v - _mi && _v - _mx < EPS; }
inline bool in_range(int _x, int _y, int _W, int _H) { return 0 <= _x && _x < _W && 0 <= _y && _y < _H; }
// neighbor clockwise
const int DX[4] = {0,1,0,-1}, DY[4] = {-1,0,1,0};
const int DX_[8] = {0,1,1,1,0,-1,-1,-1}, DY_[8] = {-1,-1,0,1,1,1,0,-1};
int pointW[10], pointK[10];
void solve() {
sort(pointW, pointW + 10, greater<int>());
sort(pointK, pointK + 10, greater<int>());
cout << pointW[0] + pointW[1] + pointW[2] << " " << pointK[0] + pointK[1] + pointK[2] << endl;
}
int main() {
for_(i,0,10) cin >> pointW[i];
for_(i,0,10) cin >> pointK[i];
solve();
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x<10) putchar(x+'0');
else
{
write(x/10);
putchar(x%10+'0');
}
}
void print(int x,char c='\n')
{
write(x);
putchar(c);
}
signed main()
{
int n=read(),k=read();
print(n-k+1);
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int k;
cin>>k;
string s,S;
cin>>s;
if(s.length()<=k)
cout<<s;
else{
for(int i=0;i<k;i++){
cout<<s[i];
}
cout<<"...";
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define P = pair<int,int>;
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; }
signed main(){
int n,m;
cin >> n >> m;
vint A(n-1+m),B(n-1+m);
vvint to(n);
vint in(n);
vint dist(n,0);
rep(i,0,n-1+m){
cin >> A[i] >> B[i];
A[i]--;B[i]--;
to[A[i]].push_back(B[i]);
in[B[i]]++;
}
queue<int> que;
vint ans(0,0);
rep(i,0,n){
if(in[i] == 0) que.push(i);
}
while(!que.empty()){
int now = que.front();
que.pop();
ans.push_back(now);
for(auto p : to[now]){
in[p]--;
if(in[p] == 0) que.push(p);
dist[p] = max(dist[now]+1,dist[p]);
}
}
vint par(n,-1);
rep(i,0,n-1+m){
int a = A[i];
int b = B[i];
if(dist[b] - dist[a] == 1) par[b] = a;
}
rep(i,0,n) cout << par[i]+1 << endl;
} | #include <bits/stdc++.h>
#define N 100020
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0')ch=='-'&&(f=0)||(ch=getchar());
while(ch<='9'&&ch>='0')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return f?x:-x;
}
int a[N];
vector<int> sig;
int main(int argc, char const *argv[]) {
int n = read(), m = read();
for (int i = 1; i <= m; ++ i) {
a[i] = read();
if (a[i] & 1) {
sig.push_back(i);
}
}
size_t sigsize = sig.size();
if (sigsize > 2) {
return puts("Impossible"), 0;
}
if (sigsize > 0) {
swap(a[1], a[sig[0]]);
}
if (sigsize > 1) {
swap(a[m], a[sig[1]]);
}
if (m == 1) {
if (a[1] == 1) {
puts("1\n1\n1");
} else {
printf("%d\n2\n%d 1\n", a[1], a[1] - 1);
}
return 0;
}
for (int i = 1; i <= m; ++ i) {
printf("%d ", a[i]);
}
puts("");
printf("%d\n", a[m] == 1 ? m - 1 : m);
printf("%d", a[1] + 1);
for (int i = 2; i < m; ++ i) {
printf(" %d", a[i]);
}
if (a[m] != 1) {
printf(" %d\n", a[m] - 1);
} else {
puts("");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,ans=0;
cin >> N;
vecp A(N),B(N);
rep(i,N){
cin >> B.at(i).first >> B.at(i).second;
}
rep(i,N){
cin >> A.at(i).first >> A.at(i).second;
}
sort(all(A));
sort(all(B));
set<ll> C;
ll j=0;
rep(i,N){
while(j<N&&B.at(j).first<A.at(i).first){
C.insert(B.at(j).second);
j++;
}
if(!C.empty()){
auto a=C.lower_bound(A.at(i).second);
if(a!=C.begin()){
a--;
ans++;
C.erase(a);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n;
int h[N], e[N], ne[N], idx;
int match[N];
bool st[N];
PII point[N];
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
bool find(int u)
{
for (int i = h[u]; ~i; i = ne[i])
{
int j = e[i];
if (!st[j])
{
st[j] = true;
if (match[j] == 0 || find(match[j]))
{
match[j] = u;
return true;
}
}
}
return false;
}
int main()
{
memset(h, -1, sizeof h);
cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> point[i].F >> point[i].S;
for (int i = n + 1; i <= 2 * n; i ++ ) cin >> point[i].F >> point[i].S;
for (int i = 1; i <= n; i ++ )
for (int j = n + 1; j <= 2 * n; j ++ )
if (point[i].F < point[j].F && point[i].S < point[j].S)
add(i, j);
int res = 0;
for (int i = 1; i <= n; i ++ )
{
memset(st, 0, sizeof st);
if (find(i)) res ++ ;
}
cout << res << endl;
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const long long oo=1e15;
struct Node
{
Node *lch,*rch;
int l,r;
long long v1,v2,lz;
}*rt;
void update(Node *x)
{
x->v1=min(x->lch->v1,x->rch->v1);
x->v2=min(x->lch->v2,x->rch->v2);
}
void add(Node *x,long long v)
{
x->lz+=v;
x->v1+=v;
x->v2+=v;
}
void down(Node *x)
{
if(x->lz)
{
add(x->lch,x->lz);
add(x->rch,x->lz);
x->lz=0;
}
}
int a,b;
Node *Build(int l,int r)
{
Node *ret=new Node;
ret->l=l;
ret->r=r;
ret->lz=0;
if(l==r)
{
ret->v1=abs(l-a)-l;
ret->v2=abs(l-a)+l;
ret->lch=ret->rch=NULL;
return ret;
}
int mid=(l+r)>>1;
ret->lch=Build(l,mid);
ret->rch=Build(mid+1,r);
update(ret);
return ret;
}
long long query(Node *x,int l,int r,int dir)
{
if(l<=x->l&&r>=x->r)
{
if(dir==1)
return x->v1;
else
return x->v2;
}
down(x);
int mid=(x->l+x->r)>>1;
long long ret=oo;
if(l<=mid)
ret=min(ret,query(x->lch,l,r,dir));
if(mid<r)
ret=min(ret,query(x->rch,l,r,dir));
return ret;
}
void modify(Node *x,int p,long long v)
{
if(x->l==x->r)
{
x->v1=min(x->v1,v-p);
x->v2=min(x->v2,v+p);
return ;
}
down(x);
int mid=(x->l+x->r)>>1;
if(p<=mid)
modify(x->lch,p,v);
else
modify(x->rch,p,v);
update(x);
}
long long findans(Node *x)
{
if(x->l==x->r)
return x->v1+x->l;
down(x);
return min(findans(x->lch),findans(x->rch));
}
int main()
{
int n,q,la,x;
long long mi;
scanf("%d%d%d%d",&n,&q,&a,&b);
la=b;
rt=Build(1,n);
for(int i=1;i<=q;i++)
{
scanf("%d",&x);
mi=min(query(rt,1,x,1)+x,query(rt,x,n,2)-x);
add(rt,abs(x-la));
modify(rt,la,mi);
la=x;
}
printf("%lld",findans(rt));
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) ((n) | (1LL << (i)))
#define togglebit(n, i) ((n) ^ (1LL << (i)))
#define lastone(n) ((n) & (-(n)))
char gap = 32;
template<typename T>
ostream& operator<<(ostream &os, const vector<T> &v) {
os << '{';
for (const auto &x : v) os << gap << x;
return os << '}';
}
template<typename A, typename B>
ostream& operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << gap << p.second << ')';
}
template <class T>
void read(T &x) {
char c;
for (c = getchar(); c < '0' || c > '9'; c = getchar())
;
for (x = 0; c <= '9' && c >= '0'; c = getchar()) x = x * 10 + (c & 15);
}
#define ll long long
#define lll __int128_t
#define pb push_back
#define mp make_pair
typedef pair < int,int> ii;
typedef vector<ii> vii;
typedef vector<ll>vl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
ll count1(string s){
ll mini = 0;
ll cnt = 0;
ll sz = s.size();
for (ll i = 0; i < sz;i++){
if(s[i]==')')
cnt--;
else
{
cnt++;
}
mini = min(mini, cnt);
}
return abs(mini);
}
ll count2(string s){
ll mini = 0;
ll cnt = 0;
ll sz = s.size();
for (ll i = sz - 1; i >= 0; i--)
{
if(s[i]=='(')
cnt--;
else
{
cnt++;
}
mini = min(mini, cnt);
}
return abs(mini);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
ll i, j, k, l, n, m;
cin >> n;
vector<pair<ll, ll>> type1, type2, type3;
ll bal = 0;
ll bal1 = 0;
for (i = 1; i <= n;i++){
string s;
cin >> s;
for(auto x:s){
if(x=='(')
bal++;
else
{
bal--;
}
}
ll cnt1 = count1(s);
bal1 += cnt1;
ll cnt2 = count2(s);
bal1 -= cnt2;
if(cnt1+cnt2==0)
continue;
if(cnt2-cnt1>=0){
type1.pb({cnt1, cnt2});
}
else{
type2.pb({cnt2, cnt1});
}
}
sort(type1.begin(), type1.end());
sort(type2.begin(), type2.end());
if (bal!=0||bal1!=0){
cout << "No\n";
return 0;
}
ll prev = 0;
ll sz1 = type1.size();
ll sz2 = type2.size();
for (i = 0; i < sz1;i++){
if(type1[i].first>prev){
cout << "No\n";
return 0;
}
else{
prev -= type1[i].first;
prev += type1[i].second;
}
}
for (i = sz2-1; i >=0;i--){
if(type2[i].second>prev){
cout << "No\n";
return 0;
}
else{
prev += type2[i].first;
prev -= type2[i].second;
}
}
cout << "Yes\n";
return 0;
} | 0 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int main(){
ll n;
ll i;
cin >> n;
i=0;
while((i+1)*(i+1)<=n) i++;
cout << i*i;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
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 vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) { // 発見できたとき
return 1;
}
else { // 発見できなかったとき
return 0;
}
}
map< ll, int > prime_factor(ll n) {
map< ll, int > ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
int main() {
int N; cin >> N;
map<ll, int> m;
for(int i = 1; i <= N; ++i) {
auto a = prime_factor(i);
for(auto x : a) {
m[x.first] += x.second;
}
}
ll ans = 1;
for(auto x : m) {
ans = ans * (x.second + 1) % 1000000007;
}
cout << ans << endl;
} | 0 |
//cwystc <--> 陈威宇是天才 --by cwy
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const double PI=acos(-1);
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i,a,b) for (int i=(a);i<=(b);i++)
#define per(i,a,b) for (int i=(a);i>=(b);i--)
#define Rep(i,a,b) for (int i=(a);i<(b);i++)
#define Per(i,a,b) for (int i=(a);i>(b);i--)
#define travel_set(it,a) for (set<int>::iterator (it)=(a).begin();(it)!=(a).end();(it)++)
#define travel_map(it,a) for (map<int>::iterator (it)=(a).begin();(it)!=(a).end();(it)++)
#define travel_vec(it,a) for (vector<int>::iterator (it)=(a).begin();(it)!=(a).end();(it)++)
#define p(x) cout << x << endl;
#define def cout << "find" << endl;
#define what_is(x) cout << #x << " is " << x << endl;
template <class T>T sqr(T x){return x*x;}
template <class T>T alex(T x){return (x>0)?x:-x;}
template <class T>void read(T&x){
x=0;T f=1;char ch=getchar();
while ((ch<48||ch>57)&&ch!=45)ch=getchar();
if (ch==45)f=-1,ch=getchar();
while (ch>=48&&ch<=57)x=x*10+ch-48,ch=getchar();
x*=f;
}
//-------------------------------------------------head-------------------------------------------------
#define maxn 305
int f[maxn][maxn][maxn];
char s[maxn],_s[maxn];int k,len;
int main(){
scanf("%s",s+1);len=strlen(s+1);read(k);
rep(i,1,len)_s[i]=s[len-i+1];
// rep(i,0,len)f[i][0][0]=f[0][i][0]=0;
rep(i,1,len)rep(j,1,len)if (i!=0&&j!=0){
f[i][j][0]=max(max(f[i-1][j][0],f[i][j-1][0]),f[i-1][j-1][0]+(s[i]==_s[j]));
rep(kk,1,k){
f[i][j][kk]=max(max(f[i-1][j][kk],f[i][j-1][kk]),f[i-1][j-1][kk-(s[i]!=_s[j])]+1);
}
}
int res=0;
rep(i,1,len)rep(kk,0,k)res=max(f[i][len-i][k]*2,res);
rep(i,1,len)rep(kk,0,k)res=max(f[i-1][len-i][kk]*2+1,res);printf("%d\n",res);return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
string s;
bool done[334][334][334];
int memo[334][334][334];
int solve(int i, int j, int k){
int l;
if(done[i][j][k]){
return memo[i][j][k];
}
done[i][j][k] = true;
if(i==j){
return memo[i][j][k] = 1;
}else if(i>j){
return memo[i][j][k] = 0;
}
memo[i][j][k] = max(solve(i+1,j,k),solve(i,j-1,k));
if(s[i]==s[j]){
memo[i][j][k] = max(memo[i][j][k],solve(i+1,j-1,k)+2);
}else if(k){
memo[i][j][k] = max(memo[i][j][k],solve(i+1,j-1,k-1)+2);
}
return memo[i][j][k];
}
int main(void){
int k;
cin >> s >> k;
cout << solve(0,s.l_ength()-1,k) << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main(){
Hello
int n, m;
cin >> n >> m;
int mx = 0, mn = 1e9;
for(int i = 0, l, r; i < m; i++){
cin >> l >> r;
mx = max(mx, l);
mn = min(mn, r);
}
cout << max(0, mn - mx + 1);
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define REV(v) reverse(v.begin(), v.end())
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define SZ(v) (int)v.size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int K, T;
cin >> K >> T;
vector<int> a(T);
priority_queue<P> pq;
REP(i, T) {
cin >> a[i];
pq.emplace(a[i], i);
}
while (pq.size() >= 2) {
int b, c, i, j;
tie(b, i) = pq.top();
pq.pop();
tie(c, j) = pq.top();
pq.pop();
if (b > 1) {
pq.emplace(b - 1, i);
}
if (c > 1) {
pq.emplace(c - 1, j);
}
}
cout << pq.top().first - 1 << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
long double pi = acos(-1);
const int INF = 1001001001;
// 最小公倍数を求める
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,ll b){
ll u = 1;
ll d = 1;
while(b != 0){
u *= a;
d *= b;
a--;
b--;
}
return u / d;
}
int strtoint(char s){
return (int(s-'0'));
}
int fact(int n){
if(n == 1)return 1;
return n * fact(n-1);
}
int main(){
int a[4];
rep(i,4)cin >> a[i];
cout << min(a[0],a[1])+min(a[2],a[3]) << endl;
} | #include <iostream>
using namespace std;
int main (void){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a <= b) {
if(c < d){
cout << a + c << endl;
}else{
cout << a + d << endl;
}
}else{
if(c < d){
cout << b + c << endl;
}else{
cout << b + d << endl;
}
}
return 0;
}
| 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int findNum(vector<pair<int, long long> > comm, int num) {
for(int i=0; i<comm.size(); i++) {
if(comm[i].first == num) {
return i;
}
}
return comm.size();
}
int main() {
int n;
cin>>n;
while(n != 0) {
int m = n;
vector<pair<int, long long> > comm;
while(m--) {
int num;
long long price, unit;
cin>>num>>price>>unit;
int dataNum = findNum(comm, num);
if(dataNum == comm.size()) {
comm.push_back(make_pair(num, price*unit));
}
else {
comm[dataNum].second += price*unit;
}
}
bool flag = true;
for(int i=0; i<comm.size(); i++) {
if(comm[i].second >= 1000000) {
cout<<comm[i].first<<endl;
flag = false;
}
}
if(flag == true) {
cout<<"NA"<<endl;
}
cin>>n;
}
} | #include<iostream>
#include<cmath>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
vector<int> divisor(int n){
vector<int>res;
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);
}
}
return res;
}
int main(void){
int p,l,n,m;
vector<int>L,N,M;
cin >> p;
if(p==2){
cin >> n >> m;
N.clear();
M.clear();
N=divisor(n);
M=divisor(m);
sort(N.begin(),N.end());
sort(M.begin(),M.end());
for(int i=0;i<N.size();i++)
if(binary_search(M.begin(),M.end(),N[i]))cout << N[i] << endl;
}
else if(p==3){
cin >> l >> n >> m;
L.clear();
N.clear();
M.clear();
L=divisor(l);
N=divisor(n);
M=divisor(m);
sort(L.begin(),L.end());
sort(N.begin(),N.end());
sort(M.begin(),M.end());
for(int i=0;i<N.size();i++)
if(binary_search(M.begin(),M.end(),N[i]) &&
binary_search(L.begin(),L.end(),N[i]))cout << N[i] << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define pb(x) push_back(x)
#define vll vector<long long>
#define pll pair<long long, long long>
#define mll map<long long, long long>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define gcd __gcd
#define clr(x) memset(x, 0, sizeof(x))
#define mod 1000000007LL
#define mod2 998244353LL
#define INF 1e18
typedef long long ll;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> o_tree;
bool comp(array<ll,2> a,array<ll,2> b)
{
if(a[0]==b[0])
{
return a[1]>b[1];
}
return a[0]<b[0];
}
void solve()
{
ll n,t;
cin>>n>>t;
ll i,j;
ll mx=5000+t;
ll dp[n][mx];
clr(dp);
array<ll,2>a[n];
for(i=0;i<n;i++)
{
cin>>a[i][0]>>a[i][1];
}
sort(a,a+n,comp);
// reverse(a,a+n);
for(i=0;i<n;i++)
{
for(j=0;j<mx;j++)
{
dp[i][j]=max(dp[i][j],(i>0)?dp[i-1][j]:0ll);
}
for(j=0;j<t;j++)
{
if(j+a[i][0]<mx)
{
dp[i][a[i][0]+j]=max(dp[i][a[i][0]+j],(i>0?dp[i-1][j]:0ll)+a[i][1]);
}
}
}
ll res = *max_element(dp[n-1],dp[n-1]+mx);
cout<<res<<"\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
if (fopen("input.txt", "r"))
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
cout << setprecision(20);
ll t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
} | #include <bits/stdc++.h>
int main(){
int N, T;
std::cin >> N >> T;
std::vector< std::pair< int, int > > AB(N);
for(int i=0; i<N; i++){
std::cin >> AB[i].first >> AB[i].second;
}
std::sort(AB.begin(), AB.end());
std::vector< std::vector< int > > dp(N + 1, std::vector< int >(T));
dp[0].assign(T, 0);
int max = 0;
for(int i=1; i<N+1; i++){
if(max < dp[i-1][T-1] + AB[i-1].second){
max = dp[i-1][T-1] + AB[i-1].second;
}
for(int j=0; j<T; j++){
if(j < AB[i-1].first){
dp[i][j] = dp[i-1][j];
}else{
dp[i][j] = std::max(dp[i-1][j], dp[i-1][j-AB[i-1].first] + AB[i-1].second);
}
}
}
std::cout << max << std::endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N;
vector<string> blue(N);
int MAX = 0;
for(int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for(int i = 0; i < M; i++){
cin >> red.at(i);
}
int count;
string S;
for(int i = 0; i < N; i++){
count = 0;
S = blue.at(i);
for(int j = 0; j < N; j++){
if(S == blue.at(j)){
count++;
}
}
for(int k = 0; k < M; k++){
if(S == red.at(k)){
count--;
}
}
if(MAX < count){
MAX = count;
}
}
if(MAX < 1){
cout << 0 << endl;
}else{
cout << MAX << endl;
}
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
int N;
int M;
map<string, int> S;
map<string, int> T;
signed main()
{
cin >> N;
REP(i, N)
{
string s;
cin >> s;
if (CONTAINS_MAP(S, s))
{
S[s]++;
}
else
{
S[s] = 1;
}
}
cin >> M;
REP(i, M)
{
string s;
cin >> s;
if (CONTAINS_MAP(T, s))
{
T[s]++;
}
else
{
T[s] = 1;
}
}
int ma = 0;
for (auto pair : S)
{
int n = pair.second;
if (CONTAINS_MAP(T, pair.first))
{
n -= T[pair.first];
}
ma = max(ma, n);
}
cout << ma << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
string res = "";
while(n != 0)
{
if(n % 2 == 0) res = "0" + res;
else
{
res = "1" + res;
n--;
}
n /= -2;
}
if(res == "") res = "0";
cout << res << endl;
} | #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<ll, ll>;
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() {
ll n;
cin >> n;
if(n == 0) {
cout << 0 << endl;
return 0;
}
vl v(62, 0);
rep(i, 62) v[i] = pow(2, i);
ll now = 0;
vl ans(62, 0);
ll i = 0;
if(n < 0) {
n = abs(n);
i = 1;
}
for(; now < n; i += 2) {
now += v[i];
ans[i] = 1;
}
for(; i >= 0; i--) {
if(now - v[i] >= n) {
now -= v[i];
ans[i] = 1 - ans[i];
}
}
reverse(all(ans));
bool ok = false;
rep(i, 62) {
if(ans[i] == 1) ok = true;
if(ok) cout << ans[i];
}
cout << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-8;
int n;
double x[102], y[102];
vector<double> v;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i ++) {
scanf("%lf %lf", &x[i], &y[i]);
}
for (int i = 1; i <= n; i ++) {
v.clear();
for (int j = 1; j <= n; j ++) if (i != j) {
double a1 = atan2(y[j]-y[i], x[j]-x[i]);
v.push_back(a1);
}
sort(v.begin(), v.end());
v.push_back(v[0] + 2*PI);
int gg = 0; double gap = 0;
for (int j = 0; j < (int)v.size() - 1; j ++) {
//printf("%.3f\n", v[j]);
if (v[j+1] - v[j] + EPS > PI) {
gg ++; gap = v[j+1] - v[j];
}
}
if (gg >= 2 || gap < PI) {
printf("%.7f\n", 0.0);
continue;
}
//printf("%.6f\n", gap);
printf("%.7f\n", (gap-PI) / 2 / PI);
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
vector<int> X(N);
vector<int> Y(N);
vector<char> U(N);
REP(i,N) cin >> X[i] >> Y[i] >> U[i];
int ans = INF;
vector<vector<pair<int,char>>> H(1e6);//縦方向
REP(i,N){
if(U[i]=='U' || U[i]=='D'){
H[X[i]].push_back({Y[i],U[i]});
}
}
REP(i,H.size()){
if(H[i].size()==0) continue;
sort(ALL(H[i]));
REP(j,H[i].size()-1){
if(H[i][j].second=='U' && H[i][j+1].second=='D'){
ans = min(ans, 5*(H[i][j+1].first - H[i][j].first));
}
}
}
vector<vector<pair<int,char>>> V(1e6);//横方向
REP(i,N){
if(U[i]=='R' || U[i]=='L'){
V[Y[i]].push_back({X[i],U[i]});
}
}
REP(i,V.size()){
if(V[i].size()==0) continue;
sort(ALL(V[i]));
REP(j,V[i].size()-1){
if(V[i][j].second=='R' && V[i][j+1].second=='L'){
ans = min(ans, 5*(V[i][j+1].first - V[i][j].first));
}
}
}
vector<int> XX(N);
vector<int> YY(N);
REP(i,N){//45度回転
XX[i] = X[i]-Y[i]+200000;
YY[i] = X[i]+Y[i]+200000;
}
vector<vector<pair<int,char>>> V1(1e6);//横方向
REP(i,N){
if(U[i]=='R' || U[i]=='U'){
V1[YY[i]].push_back({XX[i],U[i]});
}
}
REP(i,V1.size()){
if(V1[i].size()==0) continue;
sort(ALL(V1[i]));
REP(j,V1[i].size()-1){
if(V1[i][j].second=='R' && V1[i][j+1].second=='U'){
ans = min(ans, 5*(V1[i][j+1].first - V1[i][j].first));
}
}
}
vector<vector<pair<int,char>>> V2(1e6);//横方向
REP(i,N){
if(U[i]=='D' || U[i]=='L'){
V2[YY[i]].push_back({XX[i],U[i]});
}
}
REP(i,V2.size()){
if(V2[i].size()==0) continue;
sort(ALL(V2[i]));
REP(j,V2[i].size()-1){
if(V2[i][j].second=='D' && V2[i][j+1].second=='L'){
ans = min(ans, 5*(V2[i][j+1].first - V2[i][j].first));
}
}
}
vector<vector<pair<int,char>>> H1(1e6);//横方向
REP(i,N){
if(U[i]=='R' || U[i]=='D'){
H1[XX[i]].push_back({YY[i],U[i]});
}
}
REP(i,H1.size()){
if(H1[i].size()==0) continue;
sort(ALL(H1[i]));
REP(j,H1[i].size()-1){
if(H1[i][j].second=='R' && H1[i][j+1].second=='D'){
ans = min(ans, 5*(H1[i][j+1].first - H1[i][j].first));
}
}
}
vector<vector<pair<int,char>>> H2(1e6);//横方向
REP(i,N){
if(U[i]=='U' || U[i]=='L'){
H2[XX[i]].push_back({YY[i],U[i]});
}
}
REP(i,H2.size()){
if(H2[i].size()==0) continue;
sort(ALL(H2[i]));
REP(j,H2[i].size()-1){
if(H2[i][j].second=='U' && H2[i][j+1].second=='L'){
ans = min(ans, 5*(H2[i][j+1].first - H2[i][j].first));
}
}
}
if(ans == INF) cout << "SAFE" << endl;
else cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define dump_4(x1, x2, x3, x4) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define dump_5(x1, x2, x3, x4, x5) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#define dump(...) \
CHOOSE((__VA_ARGS__, dump_5, dump_4, dump_3, dump_2, dump_1, ~))(__VA_ARGS__)
#define check(s) cerr << s << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
const ll LINF = 2e18;
const int INF = 1e9;
ll N;
std::vector<ll> a;
vector<vector<vector<double>>> dp;
double f(ll c1, ll c2, ll c3) {
if (dp[c1][c2][c3] != -1.0) return dp[c1][c2][c3];
if (c1 == 0 && c2 == 0 && c3 == 0) return 0.0;
double ret = 0.0;
if (c1 > 0) ret += f(c1 - 1, c2, c3) * c1;
if (c2 > 0) ret += f(c1 + 1, c2 - 1, c3) * c2;
if (c3 > 0) ret += f(c1, c2 + 1, c3 - 1) * c3;
ret += N;
ret *= 1.0 / (c1 + c2 + c3);
return dp[c1][c2][c3] = ret;
}
void solve() {
dp.resize(310, vector<vector<double>>(310, vector<double>(310, -1.0)));
ll c1 = 0, c2 = 0, c3 = 0;
rep(i, N) {
if (a.at(i) == 1) c1++;
if (a.at(i) == 2) c2++;
if (a.at(i) == 3) c3++;
}
cout << f(c1, c2, c3) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
scanf("%lld", &N);
a.resize(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
solve();
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int ll
//#define endl '\n'
// use unique(x) - removec consecutive items, returns vec.begin() + number of items
// for vector: sort(all(vec)); vec.erase(unique(all(vec)), vec.end());
// use iota(all(vec), 0) for filling a vector with 0,1,2...
// use fill(all(vec), 1) for filling a vector with 1,1,1...
// use rotate(vec.begin(), vec.begin() + 1, vec.end()) to rotate a vector | middle arg becomes first
// print number in binary -> cout << bitset<20>(n);
const int N=303,mod=1e9+7;
int n;
int cnt[4];
double dp[N][N][N],ev[N][N][N];
main(){
cin.tie(0);cin.sync_with_stdio(0);
cin>>n;
for(int i=0;i<n;++i){
int a;cin>>a;++cnt[a];
}
dp[cnt[1]][cnt[2]][cnt[3]]=1;
for(int k=n;k>=0;--k)
for(int j=n;j>=0;--j)
for(int i=n;i>=0;--i)
if(i||j||k){
double pwaste=double(n-(i+j+k))/n;
double evwaste=pwaste/(1-pwaste)+1;
ev[i][j][k]+=evwaste*dp[i][j][k];
if(i)dp[i-1][j][k]+=dp[i][j][k]*i/(i+j+k);
if(j)dp[i+1][j-1][k]+=dp[i][j][k]*j/(i+j+k);
if(k)dp[i][j+1][k-1]+=dp[i][j][k]*k/(i+j+k);
if(i)ev[i-1][j][k]+=ev[i][j][k]*i/(i+j+k);
if(j)ev[i+1][j-1][k]+=ev[i][j][k]*j/(i+j+k);
if(k)ev[i][j+1][k-1]+=ev[i][j][k]*k/(i+j+k);
}
cout<<setprecision(10)<<fixed<<ev[0][0][0]<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h+2, vector<char>(w+2));
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> a[i][j];
}
}
int di[] = {1, 0, -1, 0};
int dj[] = {0, 1, 0, -1};
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
if(a[i][j] == '.') {
continue;
}
int x = 0;
for (int k = 0; k < 4; k++) {
x += (a[i + di[k]][j + dj[k]] == '#');
}
if(!x) {
cout << "No";
return;
}
}
}
cout << "Yes";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#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; }
//name[i][j]-> vvl name(i,vl(j))
//map<int,int>mp
//余りを切り上げる => (a + b - 1) / b
vi vx={-1,0,1,0};
vi vy={0,1,0,-1};
using pi = pair<int,int>;
signed main(){
int a,b; cin>>a>>b;
vvi v(a,vi(b));
queue<pi> q;
rep(i,0,a){
rep(j,0,b){
char c; cin>>c;
if(c=='#'){
v[i][j]=1;
q.push(make_pair(i,j));
}
else v[i][j]=0;
}
}
while(!q.empty()){
pi p=q.front(); q.pop();
int k,l; tie(k,l)=p;
bool ok=false;
rep(i,0,4){
k+=vx[i]; l+=vy[i];
if(k>=0 && k<a){
if(l>=0 && l<b){
if(v[k][l]==1)ok=true;
}
}
k-=vx[i]; l-=vy[i];
}
if(!ok){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << endl;}
#define bug4( x , y , z , w) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << endl;}
#define bug5( x , y , z , w ,p) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << endl;}
#define bug6( x , y , z , w ,p , q) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << " " << (#q) <<"="<< q << endl;}
#define bugn( x , n ) {cerr << (#x) <<":";for(int i=0;i<n;i++)cerr << x[i] <<" "; cerr << endl;}
#define bugnm( x , n , m ) {cerr << (#x)<<endl;for(int i=0;i<n;i++){cerr << "Row #" << i<< ":";for(int j=0;j<m;j++)cerr << x[i][j] << " ";cerr << endl;}}
typedef long long ll;
typedef long double ld;
using namespace std;
const int maxn = 1e5+10;
vector<int>g[maxn],vis(maxn),clr(maxn);
int cnt[2]={0,0};
int n,m,biparite=1;
void dfs(int u,int c){
vis[u]=1;
clr[u]=c;
cnt[clr[u]]++;
for(auto v:g[u]){
if( !vis[v]){
dfs(v,c^1);
}else if( clr[v] == c){
biparite=0;
}
}
}
int32_t main(){
IOS
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v;cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1,0);
if( ! biparite ){
cout << ( n * ( n - 1 ) / 2 - m ) << endl;
}else{
cout << cnt[0] * cnt[1] - m << endl;
}
}
/*
* long long or int?
* index out of bound?
* Tested on own test case?corner?
* Make more general solution.
* Read Read Read Read ....
*/
| #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pi std::pair<int, int>
#define mkp std::make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
//{{{IO
namespace IO{
template <class I> void read(I &x){
x = 0; char ch = getchar(); bool f = false;
for(; !isdigit(ch); ch = getchar()) f |= (ch == '-');
for(; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + ch - '0';
return ;
}
int read_int(){ int x; return read(x), x;}
ll read_ll(){ ll x; return read(x), x;}
template <class I>
void chmax(I &x, I y){x = x > y ? x : y;}
template <class I>
void chmin(I &x, I y){x = x < y ? x : y;}
#define ri read_int()
#define rl read_ll()
}
using IO::read_int;
using IO::read_ll;
using IO::chmax;
using IO::chmin;
//}}}
//{{{Mod
namespace Mod{
// const int mod = 1e9 + 7;
// const int mod = 1004535809;
const int mod = 998244353;
inline void MOD(int &x){ x -= x >= mod ? mod : 0;}
inline void add(int &x, int y){ x = x + y >= mod ? x + y - mod : x + y;}
inline int Add(int x, int y){ return x + y >= mod ? x + y - mod : x + y;}
inline void mul(int &x, int y){ x = 1ll * x * y % mod;}
inline int Mul(int x, int y){ return 1ll * x * y % mod;}
}
//}}}
#define N 100005
int n, s, cnt;
int x[N], num[N];
ll a[N];
void solve(int l, int r){
if(l > r) return ;
if(l == r) return num[++cnt] = l, void();
if(x[l] > s){
while(r >= l) num[++cnt] = r--;
return ;
}
if(x[r] < s){
while(r >= l) num[++cnt] = l++;
return ;
}
if(a[l] >= a[r]){
num[++cnt] = r; a[l] += a[r]; solve(l, r - 1);
}
else{
num[++cnt] = l; a[r] += a[l]; solve(l + 1, r);
}
return ;
}
int main(){
n = ri; s = ri;
for(int i = 1; i <= n; ++i)
x[i] = ri, a[i] = ri;
solve(1, n); ll res = 0;
// for(int i = cnt; i >= 1; --i)
// debug("%d ", num[i]);
for(int i = cnt; i >= 1; --i)
res += abs(x[num[i]] - s), s = x[num[i]];
printf("%lld\n", res);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#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++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const ll inf=1e9+7;
const ll INF=1e18;
int main(){
int n;cin>>n;
vector<queue<int>> tennis(n);
int a;
rep(i,n)rep(j,n-1){
cin>>a;
tennis[i].push(a-1);
}
vector<queue<int>> match(2);
rep(i,n)match[0].push(i);
int ans=0,cnt=0,tmp,res=0;;bool can;
while(1){
ans++;
vbo already(n,false);
can=false;
while(match[res].size()){
int i=match[res].front();match[res].pop();
if(tennis[i].size()==0)continue;
if(!already[i]){
tmp=tennis[i].front();
if(i==tennis[tmp].front()&&!already[tmp]){
cnt++;
tennis[i].pop(); tennis[tmp].pop();
match[(res+1)%2].push(i);match[(res+1)%2].push(tmp);
already[i]=true;already[tmp]=true;
can=true;
}
}
}
if(cnt==n*(n-1)/2){
cout<<ans<<endl;
return 0;
}
if(!can){
cout<<-1<<endl;
return 0;
}
res=(res+1)%2;
}
} | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 1000010, M = 1010;
int n, m;
int h[N], e[N], ne[N], idx;
int q[N], d[N], st[N];
int g[M][M], match[M][M];
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
int top_sort()
{
int hh = 0, tt = -1;
for (int i = 1; i <= m; i ++ )
if (!d[i])
{
q[ ++ tt] = i;
st[i] = 1;
}
while (hh <= tt)
{
int t = q[hh ++ ];
for (int i = h[t]; ~i; i = ne[i])
{
int j = e[i];
if ( -- d[j] == 0)
{
q[ ++ tt] = j;
st[j] = st[t] + 1;
}
}
}
int res = 0;
for (int i = 1; i <= m; i ++ )
if (!st[i]) return -1;
else res = max(res, st[i]);
return res;
}
int main()
{
memset(h, -1, sizeof h);
scanf("%d", &n);
for (int i = 1; i <= n; i ++ )
for (int j = 0; j < n - 1; j ++ )
{
int a = i, b;
scanf("%d", &b);
g[i][j] = b;
if (match[a][b]) continue;
match[a][b] = match[b][a] = ++ m;
}
for (int i = 1; i <= n; i ++ )
for (int j = 0; j < n - 2; j ++ )
{
int a = match[i][g[i][j]], b = match[i][g[i][j + 1]];
d[b] ++ ;
add(a, b);
}
printf("%d\n", top_sort());
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
ll n, x;
cin >> n >> x;
vector<ll> b(n);
vector<ll> l(n);
vector<ll> u(n);
vector<ll> score(n);
ll ascore = 0;
ll bsum = 0;
for(int i = 0; i < n; i++)
{
cin >> b[i] >> l[i] >> u[i];
score[i] = l[i] * b[i] + (u[i] * (x-b[i]));
ascore += b[i] * l[i];
bsum += b[i];
}
vector<int> ord(n);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int lhs, int rhs)
{
return score[lhs] > score[rhs];
});
vector<ll> sum(n+1);
for(int i = 0; i < n; i++) sum[i+1] = sum[i] + score[ord[i]];
ll h = bsum;
ll le = -1;
while(h - le > 1)
{
ll mid = (h + le) >> 1;
ll num = mid / x;
ll y = mid % x;
ll tmax = 0;
for(int i = 0; i < n; i++)
{
ll tmp;
if(num > i) tmp = sum[num+1] - score[ord[i]];
else tmp = sum[num];
int nn = ord[i];
if(y > b[nn]) tmp += b[nn] * l[nn] + (y - b[nn]) * u[nn];
else tmp += y * l[nn];
tmax = max(tmax, tmp);
}
if(tmax - ascore >= 0)
{
h = mid;
}
else
{
le = mid;
}
}
cout << h << endl;
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long ll;
//typedef pair<int,int> Pint;
typedef pair<ll, ll> P;
//typedef pair<int, pair<int, int>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll INFL = 1000000000000000010;//10^18 = 2^60
int INF = 1000000000;//10^9
ll MOD = 1000000007;
//vector<int> dy = {0,0,1,-1};
//vector<int> dx = {1,-1,0,0};
ll N, X;
vector<tuple<ll, ll, ll, ll>> test(100010);
ll A;
vector<ll> sum(100010);
bool can(ll point){
if(point == N * X) return 1;
ll rest = point % X;
ll perfect = point / X;
rep(i, N){
ll T = 0;
if(perfect <= i) T += sum[perfect];
else T += sum[perfect+1] - get<0>(test[i]);
if(rest >= get<1>(test[i])) T += rest * get<3>(test[i]) - get<1>(test[i]) * (get<3>(test[i]) - get<2>(test[i]));
else T += rest * get<2>(test[i]);
if(T >= A) return 1;
}
return 0;
}
// 貢献度, b, l, u 0 1 2 3
int main(void){
cin >> N >> X;
test.resize(N);
sum.resize(N+1);
rep(i, N){
cin >> get<1>(test[i]) >> get<2>(test[i]) >> get<3>(test[i]);
get<0>(test[i]) = X * get<3>(test[i]) - get<1>(test[i]) * (get<3>(test[i]) - get<2>(test[i]));
A += get<1>(test[i]) * get<2>(test[i]);
}
sort(test.begin(), test.end());
reverse(test.begin(), test.end());
rep(i, N) sum[i+1] = sum[i] + get<0>(test[i]);
ll lose = -1, win = N * X;
ll mid;
while(win - lose > 1){
mid = (lose + win) / 2;
if(can(mid)){
win = mid;
}else{
lose = mid;
}
}
cout << win << endl;
}
| 1 |
/**********************************************
* author : deepak nayan
* file : e:/Solutions/atcoder/abc089_a.cpp
* time : Thu Apr 30 18:03:36 2020
* quest : A - Grouping 2
*********************************************/
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
cout << ((n < 3) ? 0 : (n / 3)) << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string N;
cin >> N;
rep(i, 3) {
if (N[i] == '7') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265358979;
vector<pair<ll, ll>> pf(ll n){
vector<pair<ll, ll>> res;
for (ll i = 2; i*i <= n; i++){
if (n%i != 0){
continue;
}
else{
ll ex = 0;
while (n%i == 0){
ex++;
n /= i;
}
res.push_back({i, ex});
}
}
if (n != 1){
res.push_back({n, 1});
}
return res;
//素因数分解
//入力:ll
//出力:vector<pair<ll, ll>>
//res[i].first == i番目に小さい素因数
//res[i].second == res[i].firstの指数
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b;
cin >> a >> b;
ll g = gcd(a,b);
vector<pair<ll, ll>> x = pf(g);
cout << x.size()+1 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repe(i,n) for(int i=0;i<n;i++)
#define repa(i,j,n) for(int i=j;i<n;i++)
//#define v.all() v.begin(),v.end()
#define repr(i,n) for(int i=n;i>=0;i--)
#define int long long int
#define vi vector<int>
#define vpi vector<pair<int,int>>
int gcd(int a,int b){
if(b==0) return a;
else return gcd(b,a%b);
}
vi primef(int n){
vi a,ref;
a.push_back(1);
while(n%2==0) {
a.push_back(2);
n/=2;
}
for(int i=3;i<=sqrt(n);i+=2){
while(n%i==0){
a.push_back(i);
n/=i;
}
}
if(n>2) a.push_back(n);
sort(a.begin(), a.end());
ref.push_back(a[0]);
for(int i=1;i<a.size();i++){
if(a[i]!=a[i-1]) {
ref.push_back(a[i]);
}
}
return ref;
}
signed main(){
int t=1;
//cin>>t;
while(t--) {
int ai,bi;
cin>>ai>>bi;
vi a,b;
a=primef(ai);
b=primef(bi);
// for(int i=0;i<a.size();i++){
// cout<<a[i]<<" ";
// }
// cout<<endl;
// for(int i=0;i<b.size();i++){
// cout<<b[i]<<" ";
// }
// cout<<endl;
int ct=0;
map<int,int> m;
rep(i,a.size()) m[a[i]]=0;
rep(i,b.size()) m[b[i]]=0;
rep(i,a.size()) m[a[i]]=1;
rep(i,b.size()){
if(m[b[i]]==1) {ct++;}
}
cout<<ct<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#include <chrono>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<int, null_type,less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
static T randint(T lo, T hi){
return uniform_int_distribution<T>(lo, hi)(rng);
}
pii get(string s){
stack<char> st;
pii ans = {0, 0};
for(auto &c : s){
if(c == '(')
st.push(c);
else{
if(st.empty())
ans.first++;
else{
st.pop();
}
}
}
ans.second = (int)st.size();
return ans;
}
bool balanced(string &s){
int bal = 0;
for(auto &c : s){
if(c == '(')
bal++;
else
bal--;
if(bal < 0)
return false;
}
return bal == 0;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int n;
cin >> n;
vector<pii> v1, v2;
for(int i = 0; i < n; i++){
string s;
cin >> s;
pii x = get(s);
if(x == pii(0, 0))
continue;
if(x.second > x.first)
v1.push_back(x);
else
v2.push_back(pii(x.second, x.first));
}
sort(v1.begin(), v1.end());
sort(v2.rbegin(), v2.rend());
string s = "";
for(auto &p : v1){
for(int i = 0; i < p.first; i++)
s += ")";
for(int i = 0; i < p.second; i++)
s += "(";
}
for(auto &p : v2){
for(int i = 0; i < p.second; i++)
s += ")";
for(int i = 0; i < p.first; i++)
s += "(";
}
if(balanced(s))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
typedef complex<ld> com;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n;
string s;
cin >> n >> s;
rep(i, 4) {
string t = "";
rep(j, 2) {
if ((i >> j) & 1) t += 'S';
else t += 'W';
}
for (int i = 1; i < n - 1; i++) {
int cnt = 0;
if (t[i - 1] == 'S') cnt ^= 1;
if (t[i] == 'S') cnt ^= 1;
if (s[i] == 'o') cnt ^= 1;
if (cnt) t += 'S';
else t += 'W';
}
int check = 0;
if (t[n - 2] == 'S') check ^= 1;
if (t[n - 1] == 'S') check ^= 1;
if (t[0] == 'S') check ^= 1;
if (s[n - 1] == 'o') check ^= 1;
if (check) continue;
if (t[n - 1] == 'S') check ^= 1;
if (t[0] == 'S') check ^= 1;
if (t[1] == 'S') check ^= 1;
if (s[0] == 'o') check ^= 1;
if (check) continue;
cout << t << '\n';
return 0;
}
cout << -1 << '\n';
} | 0 |
#include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> Q; Q.push(make_pair(0, 1));
bool visited[N]; for (int i = 0; i < N; i++) visited[i] = false;
visited[0] = true;
int score = -1;
while (!Q.empty()) {
auto front = Q.front(); Q.pop();
int u = front.first, d = front.second;
if (u == H*W-1) { score = white_num-d; break; }
vector<int> e;
if (u >= W) e.push_back(u-W);
if (u % W > 0) e.push_back(u-1);
if (u % W < W-1) e.push_back(u+1);
if (u / W < H-1) e.push_back(u+W);
for (int v : e) {
if (A[v] && !visited[v]) {
visited[v] = true;
Q.push(make_pair(v, d+1));
}
}
}
cout << score << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
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; }
// Mod int
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x;
mint():x(0){}
mint(ll x):x((x%mod+mod)%mod){}
// mint(ll x):x(x){}
mint& fix() { x = (x%mod+mod)%mod; return *this;}
mint operator-() const { return mint(0) - *this;}
mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
mint operator+(const mint& a)const{ return mint(*this) += a;}
mint operator-(const mint& a)const{ return mint(*this) -= a;}
mint operator*(const mint& a)const{ return mint(*this) *= a;}
bool operator<(const mint& a)const{ return x < a.x;}
bool operator==(const mint& a)const{ return x == a.x;}
};
istream& operator>>(istream&i,mint&a){i>>a.x;return i;}
ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}
//
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vvi dist(h, vi(w, INF));
if (s[0][0] == '#') {cout<<-1<<endl; return 0;};
vvi used(h, vi(w, 0));
dist[0][0] = 0;
used[0][0] = 1;
queue<P> q;
q.emplace(0, 0);
while (!q.empty()) {
int i = q.front().first, j = q.front().second;
q.pop();
int d = dist[i][j];
rep(dir, 4) {
int ni = i + di[dir], nj = j + dj[dir];
if (ni<0||nj<0||ni>=h||nj>=w) continue;
if (s[ni][nj] == '#') continue;
if (used[ni][nj]) continue;
dist[ni][nj] = d + 1;
used[ni][nj]++;
q.emplace(ni, nj);
}
}
if (dist[h-1][w-1] == INF) {cout << -1 << endl; return 0;};
int ans = h*w;
rep(i, h) rep(j, w) if (s[i][j] == '#') ans--;
ans -= dist[h-1][w-1] + 1;
cout << ans << endl;
} | 1 |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int INF = (int)1e9;
int board[128][128];
int main()
{
int w, h;
while (scanf("%d %d", &w, &h), w){
int xs, ys;
int xg, yg;
scanf("%d %d", &xs, &ys);
scanf("%d %d", &xg, &yg);
int n;
scanf("%d", &n);
memset(board, 0, 128 * 128);
while (n-- > 0){
int c, d, x, y;
scanf("%d %d %d %d", &c, &d, &x, &y);
board[y][x] = board[y][x + 1] = c;
board[y + 1][x] = board[y + 1][x + 1] = c;
if (d == 0){
board[y][x + 2] = board[y][x + 3] = c;
board[y + 1][x + 2] = board[y + 1][x + 3] = c;
}
else {
board[y + 2][x] = board[y + 3][x] = c;
board[y + 2][x + 1] = board[y + 3][x + 1] = c;
}
}
queue<P> que;
bool flag = false;
int color = board[ys][xs];
if (!color){
puts("NG");
continue;
}
for (que.push(P(xs, ys)); que.size(); que.pop()){
P p = que.front();
int x = p.first;
int y = p.second;
if (board[y][x] != color) continue;
if (x == xg && y == yg){
flag = true;
break;
}
board[y][x] = !color;
que.push(P(x + 1, y));
que.push(P(x - 1, y));
que.push(P(x, y + 1));
que.push(P(x, y - 1));
}
puts(flag ? "OK" : "NG");
}
return 0;
} | #include<iostream>
#include<string>
#include<queue>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int board[100][100];
void init_board() {
int i, j;
for (i=0; i<100; i++) {
for (j=0; j<100; j++) {
board[i][j] = 0;
}
}
}
void put_block(int c, int d, int x, int y) {
int i, j;
int i_stop = d? 2+x: 4+x;
int j_stop = d? 4+y: 2+y;
for (i=x; i<i_stop; i++) {
for (j=y; j<j_stop; j++) {
board[i][j] = c;
}
}
}
string trace(int xs, int ys, int xg, int yg) {
int x, y, nx, ny, i, c;
queue<pair<int, int> > q;
q.push(make_pair(xs, ys));
c = board[xs][ys];
if (c == 0) {
return "NG";
}
board[xs][ys] = 0;
while (q.size() > 0) {
x = q.front().first;
y = q.front().second;
q.pop();
if (x==xg && y==yg) {
return "OK";
}
for (i=0; i<4; i++) {
nx = x+dx[i];
ny = y+dy[i];
if (nx<0 || ny<0 || nx>=100 || ny>=100) {
continue;
}
if (board[nx][ny] == c) {
q.push(make_pair(nx, ny));
board[nx][ny] = 0;
}
}
}
return "NG";
}
int main() {
int w, h, xs, ys, xg, yg, n, c, d, x, y, i;
while (true) {
cin >> w >> h;
if (w==0 && h==0) {
break;
}
cin >> xs >> ys;
cin >> xg >> yg;
cin >> n;
init_board();
for (i=0; i<n; i++) {
cin >> c >> d >> x >> y;
put_block(c, d, x, y);
}
cout << trace(xs, ys, xg, yg) << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0){
return 0;
}
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
vector<int> b(n+1);
b.at(0)=0;
for(int i=1;i<=n;i++){
b.at(i)=b.at(i-1)+a.at(i-1);
}
int ans=b.at(1);
for(int i=1;i<=n;i++){
for(int j=0;j<i;j++){
ans=max(ans,b.at(i)-b.at(j));
}
}
cout<<ans<<endl;
}
}
| #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<list>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;
string a[7] = {
"Monday",
"Tuesday",
"Wednesday",
"Thursday",
"Friday",
"Saturday",
"Sunday"
};
int b[13] = { 0,31,29,31,30,31,30,31,31,30,31,30,31 };
int main() {
for (int m, d; cin >> m >> d&&m;) {
while (m)
d += b[--m];
cout << a[(d - 1 + 3) % 7] << endl;
}
return 0;
} | 0 |
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<queue>
#include<bitset>
#include<cstdlib>
#include<set>
#include<unordered_map>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define low(x) (x&(-x))
#define IL inline
#define reg register
#define LL long long
#define N 500010
#define MOD 998244353
#define MO 1000000007
#define INF 0x3f3f3f3f
using namespace std;
int T,n,m,i,j,k,y,z,pos,l,r;
LL Ans,x;
int a[N],b[N];
char c[N];
IL LL Min(LL a,LL b){return (a<b)?a:b;}
IL LL Max(LL a,LL b){return (a>b)?a:b;}
IL int read(){
int p=0,f=1; char c=getchar();
while (c<48||c>57) {if (c=='-') f=-1; c=getchar();}
while (c>=48&&c<=57) p=(p<<1)+(p<<3)+c-48,c=getchar();
return p*f;
}
struct Segtree{
struct Tree{
int l,r;
LL d,lz;
}t[N*4];
IL void Maketree(int x,int low,int high){
int mid=(low+high)>>1;
t[x].l=low; t[x].r=high;
if (low==high){t[x].d=a[low]; return;}
Maketree(l(x),low,mid); Maketree(r(x),mid+1,high);
t[x].d=Min(t[l(x)].d,t[r(x)].d);
}
IL void Push(int x){
LL p=t[x].lz;
t[l(x)].d+=p; t[r(x)].d+=p;
t[l(x)].lz+=p; t[r(x)].lz+=p;
t[x].lz=0;
}
IL void Add(int x,int low,int high,LL val){
reg int mid=(t[x].l+t[x].r)>>1;
if (t[x].l==low && t[x].r==high){
t[x].d+=val; t[x].lz+=val;
return;
}
if (t[x].lz) Push(x);
if (high<=mid) Add(l(x),low,high,val);
else if (low>mid) Add(r(x),low,high,val);
else Add(l(x),low,mid,val),Add(r(x),mid+1,high,val);
t[x].d=Min(t[l(x)].d,t[r(x)].d);
}
IL LL Query(int x,int low,int high){
reg int mid=(t[x].l+t[x].r)>>1;
if (t[x].l==low && t[x].r==high) return t[x].d;
if (t[x].lz) Push(x);
if (high<=mid) return Query(l(x),low,high);
else if (low>mid) return Query(r(x),low,high);
else return Min(Query(l(x),low,mid),Query(r(x),mid+1,high));
}
}T1,T2;
struct Tree{
int l,r;
LL d,lz;
}t[N*4];
int main(){
#ifdef __Marvolo
freopen("zht.in","r",stdin);
freopen("zht.out","w",stdout);
#endif
n=read(); m=read();
T1.Maketree(1,1,m);
for (i=1;i<=m;i++) a[i]=-i;
T2.Maketree(1,1,m);
for (i=1;i<=n;i++){
l=read(); r=read();
if (r<m){
Ans=T2.Query(1,1,r); x=T1.Query(1,r+1,r+1);
if (Ans+r+1<x) T1.Add(1,r+1,r+1,Ans+r+1-x),T2.Add(1,r+1,r+1,Ans+r+1-x);
}
T1.Add(1,l,r,INF); T2.Add(1,l,r,INF);
T1.Add(1,1,m,1); T2.Add(1,1,m,1);
Ans=T1.Query(1,1,m);
if (Ans>=INF) puts("-1");
else printf("%lld\n",Ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int h, w;
cin >> h >> w;
map<int, int> cur2start;
multiset<int> values;
for (int i = 0; i < w; i++) {
cur2start[i] = i;
values.insert(0);
}
for (int i = 0; i < h; i++) {
int left, right;
cin >> left >> right;
auto it = cur2start.lower_bound(left - 1);
int right_bound_of_start = -1;
while (it != cur2start.end() && it->first <= right) {
right_bound_of_start = max(right_bound_of_start, it->second);
values.erase(values.find(it->first - it->second));
cur2start.erase(it++);
}
if (right_bound_of_start != -1 && right < w) {
values.insert(right - right_bound_of_start);
cur2start[right] = right_bound_of_start;
}
int ans = -1;
if (values.size() > 0) {
ans = *values.begin() + i + 1;
}
cout << ans << endl;
}
} | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int main() {
ll K;
cin >> K;
cout << 50 << endl;
vector<ll> a(50);
for (int i = 0; i < 50; i++) {
a[i] = i + K / 50 - K % 50;
if (i < K % 50) a[i] += 51;
}
for (int i = 0; i < 50; i++) cout << a[i] << " ";
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
vector<vector<ll>> a(500,vector<ll>(500,0));
vector<int> isPrime(5000,true);
vector<ll> primes;
for(int i=2;i<isPrime.size();i++){
if(isPrime[i]){
primes.push_back(i);
for(int j=2;j<isPrime.size();j+=i){
isPrime[j]=false;
}
}
}
set<ll> vs;
swap(primes[0],primes[213]);
swap(primes[1],primes[224]);
swap(primes[2],primes[171]);
for(int i=499;i>=0;i--){
for(int j=i%2;j<500;j+=2){
a[i][j]=primes[i/2]*primes[j/2];
int tmp=2;
while(vs.count(a[i][j])){
a[i][j]=a[i][j]/(tmp-1)*tmp;
tmp++;
}
vs.insert(a[i][j]);
}
}
auto isRange=[](int x,int y){
return 0<=x && x<500 && 0<=y && y<500;
};
auto lcm=[](ll x,ll y){
return x/__gcd(x,y)*y;
};
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
for(int i=0;i<500;i++){
for(int j=(i+1)%2;j<500;j+=2){
ll v=1;
for(int k=0;k<4;k++){
if(isRange(i+dx[k],j+dy[k])){
v=lcm(v,a[i+dx[k]][j+dy[k]]);
}
}
a[i][j]=v;
int tmp=2;
while(vs.count(a[i][j]+1)){
a[i][j]=a[i][j]/(tmp-1)*tmp;
tmp++;
}
a[i][j]++;
if(a[i][j]<=1e15) vs.insert(a[i][j]);
}
}
ios_base::sync_with_stdio(false);
int n;
cin>>n;
int cnt=0;
for(int i=0;i<n;i++){
for(int j=0;j+1<n;j++){
if(a[i][j]>1e15){
cnt++;
cerr<<i<<" "<<j<<endl;
vs.insert(a[i][j]);
}
cout<<a[i][j]<<" ";
}
cout<<a[i][n-1]<<"\n";
}
cerr<<cnt<<endl;
return 0;
} | 0 |
#include <iostream>
using namespace std;
bool div_ok(int n) {
if (n % 3 == 0) {
return true;
} else {
return false;
}
}
bool num_dispear(int n) {
while (n > 0) {
if (n % 10 == 3) {
return true;
}
n /= 10;
}
return false;
}
int main () {
bool loop = true;
int i = 1;
int n;
cin >> n;
bool div_check = false;
while (i <= n) {
if (div_ok(i)) {
cout << " " << i;
div_check = true;
}
if (!div_check && num_dispear(i)) {
cout << " " << i;
}
i++;
div_check = false;
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
#include<sstream>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
void call(int n){
for(int i=1;i<=n;i++){
stringstream ss;
ss<<i;
char c[8];
ss>>c;
if(i%3==0||strstr(c,"3"))
cout<<" "<<i;
}
cout<<endl;
}
int main(){ _;
int n;cin>>n;
call(n);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
#define bit(x, y) ((x >> y) & 1)
#define sz(s) ((int) (s).size())
const int MOD = 998244353;
int dp[305][100000];
int dp2[305][100000];
int n, a[305];
int main() {
ios::sync_with_stdio(false); cin.tie(0);
cout.tie(0);
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
bool flag = (sum % 2 == 0);
sum = (sum - 1) / 2 + 1;
dp[0][0] = 1;
dp2[0][0] = 1;
int ans = 1;
for (int i = 1; i <= n; i++) {
ans = 1LL * ans * 3 % MOD;
for (int j = 0; j <= 90000; j++) {
dp2[i][j] = dp2[i - 1][j];
dp[i][j] = dp[i - 1][j] * 2 % MOD;
if (j >= a[i]) {
dp[i][j] = (dp[i][j] + dp[i - 1][j - a[i]]) % MOD;
dp2[i][j] = (dp2[i][j] + dp2[i - 1][j - a[i]]) % MOD;
}
}
}
int tmpAns = 0;
for (int i = sum; i <= 90000; i++) {
tmpAns = (tmpAns + dp[n][i]) % MOD;
}
tmpAns = 1LL * tmpAns * 3 % MOD;
if (flag) tmpAns = (tmpAns - 3LL * dp2[n][sum]) % MOD;
if (tmpAns < 0) tmpAns += MOD;
ans = (ans - tmpAns) % MOD;
if (ans < 0) ans += MOD;
cout << ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int main(){
int64_t N;
cin>>N;
map<int64_t,int64_t>M;
M[-1]=3;
for(int64_t i=0;i<N;i++)
M[i]=0;
int64_t ans=1;
for(int64_t i=0;i<N;i++){
int64_t a;
cin>>a;
M.at(a)++;
if(M.at(a-1)<M.at(a)){
ans=0; break;
}else{
ans=((1+M.at(a-1)-M.at(a))*ans)%mod;
}
}cout<<ans<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
string s;
cin >> s;
cout << 2018;
rep(i, s.size()-4){
cout << s[i+4];
}
} | #include <iostream>
#include <string>
int main(){
char s[10];
for (int i = 0; i < 10; i++){
std::cin >> s[i];
if (i == 3){
s[i] = '8';
}
}
for (int i = 0; i < 10; i++){
std::cout << s[i];
}
std::cout << std::endl;
return 0;
} | 1 |
#include<iostream>
using namespace std;
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#define int long long int
int function2(int memo[],int turn[],int n,map<int,int> &sticks)
{
if(n<0)
{
return -1000000000;
}
if(n==0)
{
return 0;
}
if(memo[n]!=-1)
{
return memo[n];
}
else
{
map<int,set<int>> mp;
int here=-1000000000;
mp[here].insert(-1);
for(auto &p:sticks)
{
int val=1+function2(memo,turn,n-p.second,sticks);
mp[val].insert(p.first);
}
auto it=mp.end();
it--;
int answer=*it->second.rbegin();
turn[n]=answer;
memo[n]=it->first;
return it->first;
}
}
int32_t main()
{
int n,m;
cin>>n>>m;
int value[10]={0,2,5,5,4,5,6,3,7,6};
map<int,int> sticks;
int j;
for(j=0;j<m;j++)
{
int x;
cin>>x;
sticks.insert({x,value[x]});
}
int memo[n+1],turn[n+1];
for(j=0;j<=n;j++)
{
memo[j]=-1;
turn[j]=-1;
}
int val=function2(memo,turn,n,sticks);
while(n!=0)
{
int here=turn[n];
cout<<here;
n-=value[here];
}
cout<<endl;
}
| #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a)/__gcd((a),(b))*(b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<int> Div(int n) {
vector<int> ret;
for(int i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
const int match[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string str[] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};
string dp[10][10005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> v(m);
for(int i = 0; i < m; ++i) {
cin >> v[i];
}
sort(all(v), greater<int>());
for(int i = 0; i < m; ++i) {
int mvi = match[v[i]];
for(int j = 1; j <= n; ++j) {
if(i == 0) {
if(j % mvi == 0) {
dp[i][j] = dp[i][j - mvi];
dp[i][j] += str[v[i]];
}
} else {
string s1 = dp[i - 1][j];
string s2;
if(j % mvi == 0 || (j >= mvi && dp[i][j - mvi].size() != 0)) {
s2 = dp[i][j - mvi];
s2 += str[v[i]];
}
if(s1 == s2 && s1.size() == 0) {
continue;
}
if(s2.size() == 0) dp[i][j] = s1;
else {
if(s1.size() < s2.size()) {
dp[i][j] = s2;
} else if(s1.size() > s2.size()){
dp[i][j] = s1;
} else {
if(s1 < s2) {
dp[i][j] = s2;
} else {
dp[i][j] = s1;
}
}
}
}
}
}
cout << dp[m - 1][n] << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s, n) for(int i = s; i < (int)(n); i++)
#define co(x) cout<<x<<endl
#define SQvec(i,j) vector<vector<int>> data(i, vector<int>(j))
#define mod 1000000007
typedef long long int lint;
int main() {
string S;
cin >> S;
int ans=0;
bool fin = false;
rep(i,0,S.size() - 1){
if(S[i] == S[i + 1]){
cout << i + 1 << " " << i + 2 << endl;
fin = true;
break;
}
}
if(fin == false){
rep(i,0,S.size() - 2){
if(S[i] == S[i + 2]){
cout << i + 1 << " " << i + 3 << endl;
fin = true;
break;
}
}
if(fin == false){cout << -1 << " " << -1 << endl;}
}
} | #include<iostream>
#include<cstdio>
#include<cstring>
namespace ShengXianTi
{
const int N=301000,MOD=1000000007;
inline void inc(int a,int &b){b=(a+b)%MOD;}
int f[N][2][3][3];
char s[N];
int n;
void dp()
{
s[n+1]='1',f[0][1][0][0]=1;
for(int p=0;p<=n;p++)
for(int r=0;r<2;r++)
for(int k=0;k<3;k++)
for(int sta=0;sta<3;sta++)
{
int v=f[p][r][k][sta];
if(s[p+1]=='?' || s[p+1]=='0')
{
if(k==0)inc(v,f[p+1][r][1][sta]);
else inc(v,f[p+1][r][k^3][sta]);
}
if(s[p+1]=='?' || s[p+1]=='1')
{
if(sta==2)
inc(v,f[p+1][r^(k!=1)][0][sta]);
else if(sta==1)
inc(v,f[p+1][r^(k!=1)][0][sta+(r==0 && k==0)]);
else if(sta==0)
inc(v,f[p+1][r^(k!=1)][0][sta+(r==1 && k==0)]);
}
}
}
void solve()
{
scanf("%s",s+1);
n=strlen(s+1);
dp();
int ans=0;
inc(f[n+1][0][0][2],ans);
inc(f[n+1][1][0][2],ans);
printf("%d\n",ans);
}
}
int main()
{
ShengXianTi::solve();
return 0;
}
| 0 |
#include <cstdio>
#include <cstring>
#include <algorithm>
const int MOD = 998244353;
const int MAXN = 5e5 + 10;
int n, m;
namespace {
inline int add(int x) { return x >= MOD ? x - MOD : x; }
inline int sub(int x) { return x < 0 ? x + MOD : x; }
inline int mul(int x, int y) { return 1ll * x * y % MOD; }
inline int pwr(int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = mul(x, x)) {
if (y & 1) ans = mul(ans, x);
}
return ans;
}
}
int fact[MAXN << 1], invf[MAXN << 1];
int choose(int x, int y) {
return x < y ? 0 : mul(fact[x], mul(invf[y], invf[x - y]));
}
int main() {
scanf("%d%d", &n, &m);
fact[0] = 1, invf[0] = 1;
if (n < m) std::swap(n, m);
for (int i = 1; i <= 2 * n; i++) {
fact[i] = mul(fact[i - 1], i);
invf[i] = pwr(fact[i], MOD - 2);
}
int ans = 0;
for (int i = 1; i <= m; i++) {
ans = add(ans + mul(choose(2 * i - 1, i), choose(n + m - 2 * i, n - i)));
}
printf("%d\n", add(n + mul(ans, pwr(choose(n + m, n), MOD - 2))));
}
| #include <stdio.h>
using ll = long long;
const int MX = 1000005, MM = 998244353;
ll F[MX], I[MX], IF[MX];
ll C(int x,int y){return F[x+y]*IF[x]%MM*IF[y]% MM;}
int main()
{
int N, M, i;
I[1]=F[0]=IF[0]=F[1]=IF[1]=1;
for(i = 2; i < MX; i++){
I[i] = (MM - MM/i) * I[MM%i] % MM;
F[i] = F[i-1] * i % MM;
IF[i] = IF[i-1] * I[i] % MM;
}
scanf("%d%d", &N, &M);
if( N > M ) N^=M^=N^=M;
ll ans = M, tot = IF[N+M] * F[N] % MM * F[M] % MM;
for(i = 1; i <= N; i++){
ans = (ans + tot * C(N-i, M-i) % MM * C(i, i) % MM * I[2]) % MM;
}
printf("%lld\n", ans);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N;
cin >> N;
vector<ll> A(N);
ll s = 0;
for ( int i = 0; i < N; i++ ) {
cin >> A[i];
s += A[i];
}
ll m = 1000000, ix = 0;
for ( int i = 0; i < N; i++ ) {
ll x = abs(A[i]*N-s);
if ( m > x ) {
m = x;
ix = i;
}
}
return ix;
}
int main() {
auto ans = solve();
cout << ans << "\n";
return 0;
} | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//Tariquzzaman Faisal
//_Faisal101_
//IUT_CSE'19
//190041101
#include<iostream>
#include<stdio.h>
#include<vector>
#include<deque>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<cstring>
#include<climits>
#include<cmath>
#include<iterator>
#include<set>
#define fileOut freopen("out.txt","w",stdout)
#define fileIn freopen("in.txt","r",stdout)
#define testcases ll TC,T; cin >> TC; for(T=1; T<=TC; T++)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define INFLL 9223372036854775807
#define INF 2147483647
#define pi acos(-1.0)
#define ll long long
#define endll printf("\n")
#define CASE printf("Case %lld: ",T)
#define ff first
#define ss second
#define mem(ara,n) memset(ara,n,sizeof ara)
#define ull unsigned long long
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define mid3(a,b,c) min(max(a,b),max(b,c),max(a,b))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define endl '\n'
#define ld long double
using namespace std;
int main(){
ll n;
cin >> n;
ll x;
set <ll> st;
while(n--){
cin >> x;
if(!st.count(x)){
st.insert(x);
}
else{
st.erase(st.find(x));
}
}
cout<< st.size() <<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string A, B, C;
int cnt = 0;
cin >> A;
cin >> B;
cin >> C;
if(A[A.size() - 1] == B[0])
cnt++;
if(B[B.size() - 1] == C[0])
cnt++;
if(cnt == 2) cout << "YES" << "\n";
else cout << "NO" << "\n";
return 0;
}
| #include<iostream>
#include<string>
using namespace std;
int main(){
string a, b, c;
cin >> a >> b >> c;
if(*(--a.end()) == *(b.begin()) && *(--b.end()) == *(c.begin())){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | 1 |
//%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;
}
char s[12];
int main()
{
scanf("%s", s);
int n = strlen(s);
if (n & 1)
puts("No");
else
{
for (int i = 0; i < n; i += 2)
if (s[i] != 'h' || s[i + 1] != 'i')
{
puts("No");
return 0;
}
puts("Yes");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
ll a=1,b;
for(ll i=2;i*i<=n;i++){
if(n%i==0){
a=i;
}
}
b=n/a;
ll ans=0;
while(b>0){
ans++;
b/=10;
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll r;cin>>r;
if(r<1200)puts("ABC");
else if(r<2800)puts("ARC");
else puts("AGC");
return 0;
} | #include "iostream"
#include "string"
using namespace std;
int main(){
string a;
cin>>a;
a[3]='8';
cout<<a<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 200001
#define BMAX 100002
#define INFI 2100000000
int S[MAX];
int n;
int L[BMAX], R[BMAX];
long Merge(int left, int mid, int right){
int n1 = mid-left;
int n2 = right-mid;
long cnt = 0;
for(int i=0;i<n1;i++){
L[i] = S[left+i];
}
for(int i=0;i<n2;i++){
R[i] = S[mid+i];
}
L[n1] = INFI;
R[n2] = INFI;
int i=0,j=0;
for(int k=0;k<n1+n2;++k){
if(L[i]<=R[j]){
S[left+k] = L[i];
i++;
}
else{
S[left+k] = R[j];
cnt += (n1-i);
j++;
}
}
return cnt;
}
long countInversion(int left, int right){
if(left+1<right){
long v1,v2,v3;
int mid = (left+right)/2;
v1 = countInversion(left,mid);
v2 = countInversion(mid,right);
v3 = Merge(left,mid,right);
return v1+v2+v3;
}
return 0;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%d",&S[i]);
}
long cnt = countInversion(0,n);
printf("%ld\n",cnt);
return 0;
}
| #include <iostream>
#include <vector>
#include <iomanip>
int main(int argc, char const* argv[])
{
int n{};
std::cin >> n;
while (n) {
std::vector<int> table{};
for (int i = 0; i < n * n; i++) {
int d;
std::cin >> d;
table.push_back(d);
}
for (int i = 0; i < n; i++) {
auto hsum = 0;
for (int j = 0; j < n; j++) {
auto current = table[i * n + j];
hsum += current;
std::cout << std::setw(5) << std::right << current ;
}
std::cout << std::setw(5) << std::right << hsum;
std::cout << std::endl;
}
int sum{};
for (int i = 0; i < n; i++) {
auto vsum = 0;
for (int j = 0; j < n; j++) {
auto current = table[j * n + i];
vsum += current;
}
std::cout << std::setw(5) << std::right << vsum;
sum += vsum;
}
std::cout << std::setw(5) << std::right << sum;
std::cout << std::endl;
std::cin >> n;
}
return 0;
} | 0 |
#include <iostream>
#include <cmath>
int main()
{
double R;
std::cin >> R;
std::cout << 2.0 * M_PI * R << std::endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <string>
using namespace std;
int main() {
int r;
cin >> r;
string s;
if (r < 1200) {
s = "ABC";
} else if (r < 2800) {
s = "ARC";
} else {
s = "AGC";
}
cout << s << endl;
return 0;
}
| 0 |
#include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
const LL mod = 1000000007;
LL N, X;
std::vector<LL>S;
std::vector<std::vector<LL>>memo;
LL dp(LL i, LL j)
{
if (j == N) return i;
if (memo[i][j] != -1) return memo[i][j];
LL res1 = dp(i%S[j], j + 1);
LL res2 = (dp(i, j + 1)*(N - j - 1)) % mod;
return memo[i][j] = (res1 + res2) % mod;
}
int main()
{
in >> N >> X;
S.resize(N);
rep(i, N) in >> S[i];
memo.resize(X + 1, std::vector<LL>(N + 1, -1));
std::sort(S.begin(), S.end(), std::greater<LL>());
out << dp(X, 0) << std::endl;
}
| #include<bits/stdc++.h>
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
#define ms(a,b) memset(a,b,sizeof(a));
#define mp make_pair
#define pb push_back
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const ll MAXN = 1e6+1;
using namespace std;
const ll mod = 1e9+7;
char _;
ll N, D, dp[10100][110][2][2]; string s;
// dp holds position, previous sum % MOD, lmt,
ll solve (ll pos,ll prevsum, bool lmt, bool zero){
ll ret = dp[pos][prevsum][lmt][zero];
if (ret!= -1) return ret;
if(pos == s.size()) return (prevsum%D==0);
int v = s[pos] - '0', bound = lmt? v : 9; ret = 0;
for(int i = (zero && pos == s.size()-1); i <= bound; ++i){
ret += solve(pos+1, (prevsum+i)%D, lmt && i == v, zero && i == 0);
ret %= mod;
}
return dp[pos][prevsum][lmt][zero] = ret;
}
int main()
{
ms(dp, -1);
cin>>s;
cin>>D;
cout<<solve(0,0,1,1)<<endl;
return 0;
}
| 0 |
#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;
#endif
//BEGIN CUT HERE
template<typename T>
struct VoronoiMST{
int n;
using E = pair<int, T>;
using P = pair<T, int>;
vector<vector<E> > G;
VoronoiMST(vector<T> &x){
n=x.size();
G.assign(n<<1,vector<E>());
for(int i=0;i<n;i++) G[i].emplace_back(n+i,x[i]);
}
void add_edge(int u,int v,T c){
G[u+n].emplace_back(v+n,c);
G[v+n].emplace_back(u+n,c);
}
vector<vector<E> > build(){
priority_queue<P, vector<P>, greater<P> > pq;
const T INF = numeric_limits<T>::max();
vector<T> dist(n<<1,INF);
vector<int> from(n<<1,-1);
for(int i=0;i<n;i++){
dist[i]=0;from[i]=i;
pq.emplace(dist[i],i);
}
while(!pq.empty()){
T d;
int v;
tie(d,v)=pq.top();pq.pop();
if(dist[v]<d) continue;
for(E e:G[v]){
int u=e.first;
T c=e.second;
if(dist[u]<=dist[v]+c) continue;
dist[u]=dist[v]+c;
from[u]=from[v];
pq.emplace(dist[u],u);
}
}
vector<vector<E> > H(n);
for(int v=0;v<(n<<1);v++){
for(E e:G[v]){
int u=e.first;
T c=e.second;
if(from[v]==from[u]) continue;
int x=from[v],y=from[u];
T z=dist[v]+dist[u]+c;
H[x].emplace_back(y,z);
H[y].emplace_back(x,z);
}
}
return H;
}
};
//END CUT HERE
#ifndef call_from_test
#define call_from_test
#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
#endif
//BEGIN CUT HERE
struct FastIO{
FastIO(){
cin.tie(0);
ios::sync_with_stdio(0);
}
}fastio_beet;
//END CUT HERE
#ifndef call_from_test
signed main(){
return 0;
}
#endif
#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
#endif
//BEGIN CUT HERE
template<typename T>
struct Kruskal{
struct edge{
int from,to;
T cost;
int used;
edge(int from,int to,T cost):
from(from),to(to),cost(cost),used(0){}
bool operator<(const edge& e) const{
return cost<e.cost;
}
};
int n;
vector<int> r,p;
vector<edge> es;
Kruskal(){}
Kruskal(int n):n(n),r(n,1),p(n){
iota(p.begin(),p.end(),0);
}
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;
}
void add_edge(int u,int v,T c){
es.emplace_back(u,v,c);
}
T build(){
sort(es.begin(),es.end());
T res=0;
for(auto &e:es){
if(!same(e.from,e.to)){
res+=e.cost;
unite(e.from,e.to);
e.used=1;
}
}
return res;
}
};
//END CUT HERE
#ifndef call_from_test
int main(){
return 0;
}
#endif
#undef call_from_test
//INSERT ABOVE HERE
signed CF17FINAL_J(){
using ll = long long;
int n;
cin>>n;
vector<ll> x(n);
for(int i=0;i<n;i++) cin>>x[i];
VoronoiMST<ll> vo(x);
for(int i=1;i<n;i++){
int a,b,c;
cin>>a>>b>>c;
a--;b--;
vo.add_edge(a,b,c);
}
auto G=vo.build();
Kruskal<ll> ks(n);
for(int v=0;v<n;v++){
for(auto e:G[v]){
int u=e.first;
ll c=e.second;
if(v<u) ks.add_edge(v,u,c);
}
}
cout<<ks.build()<<endl;
return 0;
}
/*
verified on 2019/01/16
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_j
*/
signed KEYENCE2019_E(){
using ll = long long;
int n,d;
cin>>n>>d;
vector<ll> a(n);
for(int i=0;i<n;i++) cin>>a[i];
VoronoiMST<ll> vo(a);
for(int i=1;i<n;i++){
vo.add_edge(i-1,i,d);
}
auto G=vo.build();
Kruskal<ll> ks(n);
for(int v=0;v<n;v++){
for(auto e:G[v]){
int u=e.first;
ll c=e.second;
if(v<u) ks.add_edge(v,u,c);
}
}
cout<<ks.build()<<endl;
return 0;
}
/*
verified on 2019/01/16
https://atcoder.jp/contests/keyence2019/tasks/keyence2019_e
*/
signed main(){
//CF17FINAL_J();
KEYENCE2019_E();
return 0;
}
#endif
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, int>;
using E = pair<ll, pair<int, int> >;
const ll INF = 1LL << 60;
template <typename T>
struct SegmentTree {
int n;
vector<T> data;
T INITIAL_VALUE;
//使うときは、この2つを適宜変更する
static T merge(T x, T y);
void updateNode(int k, T x);
SegmentTree(int size, T initial_value) {
n = 1;
INITIAL_VALUE = initial_value;
while (n < size) n *= 2;
data.resize(2 * n - 1, INITIAL_VALUE);
}
T getLeaf(int k) {
return data[k + n - 1];
}
void update(int k, T x) {
k += n - 1; //葉の節点
updateNode(k, x);
while (k > 0) {
k = (k - 1) / 2;
data[k] = merge(data[k * 2 + 1], data[k * 2 + 2]);
}
}
//区間[a, b)に対するクエリに答える
//k:節点番号, [l, r):節点に対応する区間
T query(int a, int b) {
T vl = INITIAL_VALUE, vr = INITIAL_VALUE;
for (int l = a + n, r = b + n; l != r; l >>= 1, r >>= 1) {
if (l & 1) vl = merge(vl, data[l++ - 1]);
if (r & 1) vr = merge(vr, data[--r - 1]);
}
return merge(vl, vr);
}
};
//使うときは以下2つを変更
template <typename T>
T SegmentTree<T>::merge(T x, T y) {
return min(x, y);
}
template <typename T>
void SegmentTree<T>::updateNode(int k, T x) {
data[k] = x;
}
int n;
ll D;
ll a[200005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> D;
vector< vector<int> > vs(n);
vector<int> root(n), idxs(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
vs[i].push_back(i);
root[i] = i;
idxs[i] = i;
}
SegmentTree<P> st1(n, P(INF, -1)), st2(n, P(INF, -1));
for (int i = 0; i < n; i++) {
st1.update(i, P(a[i] - D * i, i));
st2.update(i, P(a[i] + D * i, i));
}
int max_size = 1;
ll ans = 0;
while (max_size < n) {
vector< E > es;
for (int i : idxs) {
if (vs[i].empty()) continue;
for (int j : vs[i]) {
st1.update(j, P(INF, -1));
st2.update(j, P(INF, -1));
}
P p(INF, -1);
for (int j : vs[i]) {
P q1 = st1.query(0, j);
q1.first += a[j] + D * j;
P q2 = st2.query(j + 1, n);
q2.first += a[j] - D * j;
P p2 = min(q1, q2);
if (p > p2) p = p2;
}
for (int j : vs[i]) {
st1.update(j, P(a[j] - D * j, j));
st2.update(j, P(a[j] + D * j, j));
}
if (p.second == -1) continue;
es.emplace_back(p.first, make_pair(i, p.second));
}
for (E& e : es) {
int ri = root[e.second.first];
int r = root[e.second.second];
if (ri == r) continue;
ans += e.first;
if (vs[ri].size() >= vs[r].size()) {
for (int j : vs[r]) {
vs[ri].push_back(j);
root[j] = ri;
}
vs[r].clear();
max_size = max(max_size, (int)vs[ri].size());
} else {
for (int j : vs[ri]) {
vs[r].push_back(j);
root[j] = r;
}
vs[ri].clear();
max_size = max(max_size, (int)vs[r].size());
}
}
}
cout << ans << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
long long int gcd(long long int bdda,long long int chota)
{
if(chota==0)
return bdda;
return gcd(chota,bdda%chota);
}
void solve()
{
int a,b;
cin>>a>>b;
string s;
cin>>s;
if(s[a]!='-')
{
cout<<"No";return;
}
for(int i=0;i<a+b+1;i++)
{
if(i!=a && s[i]=='-')
{
cout<<"No";return;
}
}
cout<<"Yes";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
//cin>>t;
while(t--)
{
solve();
}
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a,b;cin>>a>>b;
int c[3];
c[0]=a+b;
c[1]=a-b;
c[2]=a*b;
sort(c,c+3);
cout<<c[2]<<endl;
return 0;
} | 0 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
const int N = 2e5 + 5;
typedef long long ll;
using namespace std;
int n, A, B, x[N];
ll ans;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar(); }
while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * w;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("cpp.in", "r", stdin);
#endif
n = read <int> (), A = read <int> (), B = read <int> ();
for(int i = 1; i <= n; i++) x[i] = read <int> ();
for(int i = 1; i < n; i++) ans += min(1ll * B, 1ll * A * (x[i + 1] - x[i]));
printf("%lld\n", ans);
return 0;
}
| #include <cstdint>
#include <utility>
#include <vector>
using namespace std;
size_t partition(uint32_t array[], size_t start, size_t end)
{
int32_t mid = array[end];
int32_t less_than = 0;
for (uint32_t i = start; i < end; i++) {
if (array[i] <= mid) {
swap(array[less_than], array[i]);
less_than++;
}
}
swap(array[end], array[less_than]);
return less_than;
}
#if !defined(TEST)
#include <iostream>
#include <vector>
static vector<uint32_t> vec;
int32_t main()
{
uint32_t n;
cin >> n;
for (uint32_t i = 0; i < n; i++) {
uint32_t val;
cin >> val;
vec.push_back(val);
}
size_t mid = partition(&vec[0], 0, vec.size() - 1);
for (uint32_t i = 0; i < vec.size(); i++) {
if (i != 0) cout << " ";
if (i == mid) cout << "[";
cout << vec[i];
if (i == mid) cout << "]";
}
cout << endl;
return 0;
}
#endif | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
double n, m;
cin >> n >> m;
vector<int> L(m), R(m);
rep(i, m) cin >> L[i] >> R[i];
int maxi = *max_element(L.begin(), L.end());
int mini = *min_element(R.begin(), R.end());
if(mini < maxi) {
cout << 0 << endl;
} else {
cout << mini - maxi + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N=200000+10;
const int INF=10000000;
int p1[N],p2[N];
map<pair<int,int>,int>m;
int find(int x,int *p)
{
return p[x]==x?p[x]:p[x]=find(p[x],p);
}
void cha(int x,int y,int *p)
{
int px=find(x,p);
int py=find(y,p);
if(px!=py)
{
p[px]=py;
}
}
int main()
{
int n,k,l;
cin>>n>>k>>l;
for(int i=1;i<=n;i++)
p1[i]=i,p2[i]=i;
for(int i=1;i<=k;i++)
{
int x,y;
scanf("%d%d,",&x,&y);
cha(x,y,p1);
}
for(int i=1;i<=l;i++)
{
int x,y;
scanf("%d%d,",&x,&y);
cha(x,y,p2);
}
for(int i=1;i<=n;i++)
{
find(i,p1);
find(i,p2);
}
for(int i=1;i<=n;i++)
m[make_pair(p1[i],p2[i])]++;
for(int i=1;i<=n;i++)
printf("%d ",m[make_pair(p1[i],p2[i])]);
return 0;
} | 0 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int r;
cin >> r;
if (r < 1200) {
cout << "ABC\n";
} else if (r < 2800) {
cout << "ARC\n";
} else {
cout << "AGC\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
if (s == "SSS") {
cout << 0 << endl;
return 0;
}
int ans = 1;
if (s[0] == 'R' && s[1] == 'R') ans++;
if (s[1] == 'R' && s[2] == 'R') ans++;
cout << ans << endl;
}
| 0 |
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
#include <set>
#include <list>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
namespace patch
{
template <typename T>
string to_string(const T& n)
{
ostringstream stm;
stm << n;
return stm.str();
}
int stoi(string str)
{
int ret;
istringstream stm(str);
stm >> ret;
if (stm.fail())
{
throw -1;
}
return ret;
}
vector<string> split(const string &str)
{
istringstream stm(str);
vector<string> ret;
copy(istream_iterator<string>(stm),
istream_iterator<string>(),
back_inserter(ret));
return ret;
}
vector<string> split(const string &str, char delim)
{
istringstream stm(str);
vector<string> ret;
string buf;
while (getline(stm, buf, delim))
{
ret.push_back(buf);
}
return ret;
}
}
int bubbleSort(vector<int>& vs)
{
int end = vs.size();
if (end == 1)
{
return 0;
}
int cnt = 0;
for (int j = 0; j < end - 1; ++j)
{
for (int i = 0; i < end - j - 1; ++i)
{
if (vs[i] > vs[i+1])
{
swap(vs[i], vs[i+1]);
++cnt;
}
}
}
return cnt;
}
// bubble sort
int main()
{
ios::sync_with_stdio(false);
// line 1
string s1;
getline(cin, s1);
int n = patch::stoi(s1);
// line 2
vector<int> vs(n);
vector<string> ss;
string s2;
getline(cin, s2);
ss = patch::split(s2);
for (int n = 0, sz = ss.size(); n < sz; ++n)
{
vs[n] = patch::stoi(ss[n]);
}
int cnt = bubbleSort(vs);
bool isFirst = true;
for (int n : vs)
{
//cout << n << " ";
if (isFirst)
{
cout << n;
isFirst = false;
}
else
{
cout << " " << n;
}
}
cout << "\n";
cout << cnt << "\n";
return 0;
} | #include <iostream>
using namespace std;
void print(int *p, int n)
{
cout << p[0];
for (int i = 1; i < n; i++) cout << " " << p[i];
cout << endl;
}
int bubblesort(int *p, int n)
{
int i, v;
bool flag = true;
int count = 0;
while (flag)
{
flag = false;
for (i = n - 1; i >= 1; i--)
{
if (p[i] < p[i - 1])
{
v = p[i];
p[i] = p[i - 1];
p[i - 1] = v;
count++;
flag = true;
}
}
}
return count;
}
int main(void)
{
int A[100];
int N;
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
int count = bubblesort(A, N);
print(A, N);
cout << count << endl;
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int main()
{
double r;
cin >> r;
double result = r * 2 * M_PI;
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
reverse (s.begin(),s.end());
cout<<s<<endl;
return 0;
}
| 0 |
#include <stdio.h>
int main() {
int i, k, v,an1,an2,suu;
int MAX_V = 10000;
int prime[MAX_V+1];
for(i = 0; i <= MAX_V; i++) {
prime[i] = 1;
}
for(i = 2; i*i <= MAX_V; i++) {
if(prime[i]) {
for(k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0;
}
}
}
while(1){
scanf("%d",&suu);
if(suu != 0){
for(k=2;k<=suu;k++){
if(prime[k-2]==1 && prime[k]==1){
an1=k-2;
an2=k;
}
}
printf("%d %d\n",an1,an2);
}
else{
break;
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
vector<vector<string>>boards={
{},{},{},
{
"aab",
"c.b",
"cdd"
},
{
"abcc",
"abdd",
"eefg",
"hhfg",
},
{
"abc..",
"abc..",
"deeff",
"d.ghh",
"iigjj"
},
{
"abc...",
"abc...",
"d.eeff",
"dghh..",
".g.ijj",
"kk.ill",
},
{
"abc....",
"abc....",
"def....",
"def....",
"g..hhii",
"g..jjkk",
".llmmnn",
}
};
int n;
char ans[2000][2000];
void print(int x,int y,int d){
rep(i,d)rep(j,d){
ans[x+i][y+j]=boards[d][i][j];
}
}
void answer(){
rep(i,n)printf("%s\n",ans[i]);
exit(0);
}
int main(){
cin>>n;
if(n==2){puts("-1");return 0;}
rep(i,n)rep(j,n)ans[i][j]='.';
if(n==3){
print(0,0,3);
answer();
}
int x=0;
while(1){
if(n-x>=8){
print(x,x,4);
x+=4;
}
else{
print(x,x,n-x);
answer();
}
}
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
typedef long long ll;
const int INF = 1e9+1;
const int MOD = 2e9 + 9;
const ll LINF = 1e18;
using namespace std;
int main(){
string s, t;
cin >> s >> t;
cout << t + s << endl;
return 0;
}
| #include <stdio.h>
int main() {
char aa[105], bb[105];
scanf("%s %s", aa, bb);
printf("%s%s", bb, aa);
return 0;
} | 1 |
Subsets and Splits