code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<iostream>
using namespace std;
int main(){
int sx, sy, tx,ty;
cin >> sx >> sy >> tx >> ty;
for(int i = 0; i<(ty- sy); i++){
cout << 'U';
}
for(int i = 0; i<(tx- sx); i++){
cout << 'R';
}
for(int i = 0; i<(ty- sy); i++){
cout << 'D';
}
for(int i = 0; i<(tx- sx); i++){
cout << 'L';
}
int csx = sx, csy =sy, ctx = tx,cty = ty;
csx -= 1;
cty += 1;
cout << 'L';
for(int i = 0; i<(cty- csy); i++){
cout << 'U';
}
for(int i = 0; i<(ctx- csx); i++){
cout << 'R';
}
cout << 'D';
ctx = tx +1;
csy = sy -1;
csx = sx, cty = ty;
cout << 'R';
for(int i = 0; i<(cty- csy); i++){
cout << 'D';
}
for(int i = 0; i<(ctx- csx); i++){
cout << 'L';
}
cout << 'U';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int mi=(-1000000);
int main() {
int k,x; cin >> k >> x;
if(x-k+1<mi) {
for(int i=mi;i<mi+k;i++) cout << i;
cout << endl;
return 0;
}
for(int i=x-k+1;i<x+k;i++) cout << i << ' ';
cout << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define ll long long
#define read1(x) cin>>x
#define read2(x,y) cin>>x>>y
#define print(x) cout<<x<<endl
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define vd vector<double>
#define vs vector<string>
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define vpii vector<pii>
#define umap unordered_map
#define uset unordered_set
#define clr(a,b) memset(a,b,sizeof a)
#define all(ds) ds.begin(), ds.end()
#define rev(ds) ds.rbegin(), ds.rend()
#define asc(A) sort(A.begin(), A.end())
#define dsc(A) sort(A.begin(), A.end(), greater<int>())
#define gcd(x,y) __gcd(x,y)
#define clr(a,b) memset(a,b,sizeof a)
#define fr(i, n) for(int i=0; i<n;++i)
#define fr1(i, n) for(int i=1; i<=n; ++i)
#define rfr(i, n) for(int i=n-1; i>=0; --i)
#define printVector(v) for(int i= 0;i<v.size();i++) {cout<<v[i]<<" ";} cout<<endl;
#define precise(x) cout<<fixed<<setprecision(x)
#define inf 10000000000000
ll lcm(ll a, ll b) {return (a*b)/__gcd(a, b); }
ll power(ll x, ll y, ll m) { if(!y) return 1; ll p=power(x, y>>1, m)%m; p=p*p%m; return (y&1)?(x*p)%m:p;}
ll modInverse(ll a, ll m){ return power(a, m-2, m); }
bool isPrime(ll num){bool flag=true;for(ll i =2;i<=num/2;i++){if(num%i==0) {flag=false; break;} }return flag;}
ll sumofdigits(ll n){ll c=0;while(n>0){c++;n/=10;}return c;}
bool sortinrev(const pair<int,int>&a,const pair<int,int>&b) {return a.first > b.first; }
bool sortbysec(const pair<int,int> &a, const pair<int,int> &b) {return a.second < b.second; }
//const double PI= 2*acos(0.0);
const long long MOD= 1000000007;
void solve(){
int n; cin>>n;
vi v;
fr(i, n){
int x; cin>>x;
v.push_back(x);
}
sort(all(v));
if(v.size() <= 2){
print(0);
return;
}
int count = 0;
for(int i = 0; i < n-2; ++i){
for(int j = i+1; j < n-1; ++j){
if(v[i] == v[j])continue;
for(int k = j+1; k < n; ++k){
if(v[i] == v[k] || v[j] == v[k])continue;
if(v[i] + v[j] > v[k])count++;
}
}
}
cout<<count<<endl;
}
int main()
{
#ifndef ONLINE_JUDGE
input_output
#else
fastio
#endif
int t =1 ;
// cin>>t;
while(t--){
solve();
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int swap_count = 0; // number of swaps
void insertion_sort(vector<int> &sort_vec, int n, int interval) {
for (int i = interval; i < n; ++i) {
int pivot = sort_vec[i];
int j = i - interval;
while (j >= 0 && sort_vec[j] > pivot) { //
sort_vec[j + interval] = sort_vec[j]; // perform swap
j = j - interval; // drop by interval
swap_count++;
}
sort_vec[j + interval] = pivot; // put pivot in proper place
}
}
int main() {
int n; //number of entries
cin >> n;
vector<int> sort_vec;
//initialize unsorted vector
for (int i = 0; i < n; ++i) {
int entry;
cin >> entry;
sort_vec.push_back(entry);
}
vector<int> intervals;
//initialize array according to formula k_next = 3*k_prev + 1 (Knuth)
int next = 1;
while (true) {
intervals.push_back(next);
next = next * 3 + 1;
if (next >= n) break;
}
int intervals_size = intervals.size();
//shell sort
for (int i = intervals_size - 1; i >= 0; --i) {
insertion_sort(sort_vec, n, intervals[i]);
}
//print results
cout << intervals_size << endl; // number of intervals
for (int i = intervals_size - 1; i >= 0; --i) {
cout << intervals[i];
if (i <= n - 1) cout << " ";
}
cout << endl;
cout << swap_count << endl; // number of swaps
for (int i = 0; i < n; ++i) { // sorted vector
cout << sort_vec[i] << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
if(v.size() >= 200) {
return "Too big container";
}
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const int INFI = (1 << 30) - 1;
const long long INFLL = (1LL << 62) - 1;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, X; cin >> N >> X;
ll ans = 0;
ll left; cin >> left;
rep(i, N - 1) {
ll a; cin >> a;
ll over = (left + a) - X;
if(over > 0) {
ans += over;
if(over > a) {
left = 0;
} else {
left = a - over;
}
} else {
left = a;
}
}
print(ans);
}
| #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
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>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<int> VI;
typedef pair<ll,ll> PLL;
typedef pair<int,int> PII;
#define pb push_back
#define F first
#define S second
#define SZ(a) int((a).size())
#define ALL(a) a.begin(),a.end()
#define fr(i,x,y) for(int i=x;i<y;i++)
#define frr(i,x,y) for(int i=x-1;i>=y;i--)
#define inf 1e18+1
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int mod=1000000007;
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
ll power(ll a,ll b){ll ans=1;while(b!=0){if(b&1){ans*=a;}a=a*a;b>>=1;}return ans;}
ll powerm(ll a,ll b){ll ans=1;while(b!=0){if(b&1){ans*=a;ans%=mod;}a=a*a;a%=mod;b>>=1;}return ans%mod;}
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
void solve()
{
ll n,x;
cin>>n>>x;
ll ct=0;
VL arr(n);
fr(i,0,n)
cin>>arr[i];
fr(i,1,n)
{
if((arr[i]+arr[i-1])>x)
{
ll rem=(arr[i]+arr[i-1])-x;
ll f=min(rem,arr[i]);
rem-=f;
arr[i]-=f;
ct+=f;
if((arr[i]+arr[i-1])>x)
{
ct+=rem;
}
}
}
cout<<ct<<endl;
return;
}
int main()
{
IOS;
ll t=1;
//cin>>t;
while(t--)
{
//cout<<"Case #"<<pp-t<<":\n";
solve();
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
*/
/*
recursion - matrix exponential
*/
// BITMASK:
// 1)When some constrall is of the order of 15-20, think of bitmask DP.
// 2)When some constrall is around 40, try out meet in the middle
// 3) See Strings,palindromes,prefix,suffix etc -> KMP,Z algorithm | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if( abs(A-B) < 2 ){
cout << "Yay!" << endl;
}
else{
cout << ":(" << endl;
}
}
| #include <stdio.h>
int main () {
int N, K, A = 1;
scanf("%d %d", &N, &K);
for (int i = 1; i <= N; i++) {
if (A * 2 < A + K) {
A *= 2;
}
else {
A += K;
}
}
printf("%d", A);
} | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
string tmp_s;
rep(i, s.length()) {
tmp_s += s[i];
if ( tmp_s + "FESTIVAL" == s ) break;
}
cout << tmp_s << endl;
return 0;
}
| #include <stdio.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
int main(void) {
int ans = 0, n, min = 101;
rep(i, 4) {
scanf("%d", &n);
ans += n;
if(n < min) min = n;
}
ans -= min;
min = 101;
rep(i, 2) {
scanf("%d", &n);
ans += n;
if(n < min) min = n;
}
ans -= min;
printf("%d\n", ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll nature(ll a){//絶対値を返す
if(a>=0){return(a);}
else{return(-1*a);}
}
int main(){
long long N,count=0,count0=0;
cin>>N;
long long ans=0,m=10000000007;
vector<long long> vec(N);
for(int i=0;i<N;i++){
cin>>vec.at(i);
if(vec.at(i)==0){
count0++;
}
if(vec.at(i)<0){
count++;
}
long long M=nature(vec.at(i));
ans+=M;
m=min(m,M);
}
for(int i=0;i<N;i++){
}
if(count%2==0){
cout<<ans<<endl;
}
else{
cout<<ans-2*m<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int64_t Z=0,MIN=167167167167617,A=1;
for(int i=0;i<N;i++){
int64_t a;
cin>>a;
if(a<0){
A*=-1;
a*=-1;
}
Z+=a;
MIN=min(MIN,a);
}
cout<<Z-MIN+A*MIN<<endl;
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
policy_set;
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
#define fill(a) memset(a, 0, sizeof (a))
#define ALL(c) c.begin(),c.end()
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
void preprocess(){
}
const ll N=3e5+7;
const ll INF=1e18+1;
const ll MOD=1e9+7;
//Have to ramp up more on implementation skillz to do it fast,
// and debug skillz, it is not as easy as you think with two pointers
ll n,a[N],pref[N];
ll f(ll l1,ll r1,ll l2, ll r2){
return abs((pref[r1]-pref[l1-1])-(pref[r2]-pref[l2-1]));
}
// So we will implement the two pointer solution to this also
// very well
// So in ternary search we always need to check 4 values near, the start,end
// like in that cf problem, no need to do this all over again
ll find_left(ll i){
ll start=1,end=i-1;
while(start<=end){
ll mid1=(2*start+end)/3,mid2=(start+2*end)/3;
// cout<<start<<" "<<mid1<<" "<<mid2<<" "<<end<<"\n";
if(f(1,mid1,mid1+1,i)>f(1,mid2,mid2+1,i))
start=mid1+1;
else
end=mid2-1;
}
// cout<<start<<" "<<end<<"\n";
ll arr[]={start,end},ans=1e18,ansidx=start;
for(ll j=0;j<2;j++)
for(ll jj=-1;jj<=1;jj++){
ll idx=arr[j]+jj;
if(idx<1 || idx>i-1)continue;
if(ans>f(1,idx,idx+1,i))ans=f(1,idx,idx+1,i),ansidx=idx;
}
return ansidx;
}
// I remember facing this problem before
ll find_right(ll i){
ll start=i+1,end=n-1;
while(start<=end){
ll mid1=(2*start+end)/3,mid2=(start+2*end)/3;
if(f(i+1,mid1,mid1+1,n)>f(i+1,mid2,mid2+1,n))
start=mid1+1;
else
end=mid2-1;
}
ll arr[]={start,end},ans=1e18,ansidx=start;
for(ll j=0;j<2;j++)
for(ll jj=-1;jj<=1;jj++){
ll idx=arr[j]+jj;
if(idx<i+1 || idx>n)continue;
if(ans>f(i+1,idx,idx+1,n))ans=f(i+1,idx,idx+1,n),ansidx=idx;
}
return ansidx;
}
void solve(){
cin>>n;
for(ll i=1;i<=n;i++)cin>>a[i],pref[i]=pref[i-1]+a[i];
ll ans=INT64_MAX;
// cout<<find_left(4)<<" "<<f(1,1,2,4)<<" "<<f(1,2,3,4)<<" "<<f(1,3,4,4)<<"\n";
// return;
for(ll i=1;i<=n;i++){
//i ins the middle split, in this case
// 1..left left+1..i i+1..right right+1..n
ll left=find_left(i),right=find_right(i);
// cout<<left<<" "<<right<<"\n";
vector<ll> vecs({pref[left],pref[i]-pref[left],pref[right]-pref[i],pref[n]-pref[right]});
sort(all(vecs));
ans=min(ans,vecs.back()-vecs[0]);
}
cout<<ans<<"\n";
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
preprocess();
int t=1;
//cin>>t;
//cout<<t<<endl;
for(int i=0;i<t;i++)
solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 1000100
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solve(void)
{
int n;cin>>n;
vector<int> vec (n,0);
for (int i = 0; i < n; i++)
{
cin>>vec[i];
if(i != 0)
vec[i] += vec[i-1];
}
int i1 = 0;
int i2 = 1;
int i3 = 2;
int res = INF;
while(i2 < n-2)
{
while(i1 < i2 - 1)
{
if(abs(vec[i1] - (vec[i2] - vec[i1])) > abs(vec[i1+1] - (vec[i2] - vec[i1+1])) )
i1 ++;
else
{
break;
}
}
while(i3 < n - 2)
{
if(abs(vec[n-1] - vec[i3] - (vec[i3] - vec[i2])) >abs(vec[n-1] - vec[i3+1] - (vec[i3+1] - vec[i2])) )
i3 ++;
else
{
break;
}
}
int p1 = vec[i1];
int p2 = vec[i2] - vec[i1];
int p3 = vec[i3] - vec[i2];
int p4 = vec[n-1] - vec[i3];
int m1 = max(max(p1,p2),max(p3,p4));
int m2 = min(min(p1,p2),min(p3,p4));
chmin(res,m1 - m2);
i2++;
}
cout<<res<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| 1 |
#include<cstdio>
int main(){
int a[] = {0,0,31,60,91,121,152,182,213,244,274,305,335,366};
int m, d;
char day[7][10] = {"Monday", "Tuesday", "Wednesday", "Thursday","Friday","Saturday","Sunday"};
scanf("%d %d", &m, &d);
while(m || d){
printf("%s\n", day[(a[m] + d + 2) % 7]);
scanf("%d %d", &m, &d);
}
} | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-6;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
int dd[12]={31,29,31,30,31,30,31,31,30,31,30,31};
vector<string>v;
v.push_back("Wednesday");
v.push_back("Thursday");
v.push_back("Friday");
v.push_back("Saturday");
v.push_back("Sunday");
v.push_back("Monday");
v.push_back("Tuesday");
int mo,da;
while(cin>>mo>>da,mo){
int d=da;
for(int i=0;i<mo-1;i++){
d+=dd[i];
}
cout<<v[d%7]<<endl;
}
}
| 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <map>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
while(cin >> n && n) {
vector<pair<double,string> > v;
map<double,vector<string> > ma;
rep(i,n) {
string l;
int p,a,b,c,d,e,f,s,m;
cin >> l >> p >> a >> b >> c >> d >> e >> f >> s >> m;
double sum = a + b + c + d + e;
sum += (m-1) * (d + e);
int num = f*s*m - p;
v.push_back(make_pair(num/sum,l));
ma[num/sum].push_back(l);
}
vector<string> ans;
map<double,vector<string> >::iterator ite;
for(ite = ma.begin();ite != ma.end();ite++) {
sort(ite->second.begin(),ite->second.end(),greater<string>());
rep(i,ite->second.size()) {
ans.push_back(ite->second[i]);
// cout << ite->first << " " << ite->second[i] << endl;
}
}
reverse(ans.begin(),ans.end());
rep(i,ans.size()) cout << ans[i] << endl;
cout << "#" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
const int sqrtN = 512;
const ll inf = (1LL<<31)-1;
int n, q;
cin >> n >> q;
int bucket_sz = (n+sqrtN-1)/sqrtN;
vector<ll> a(n, inf);
vector<ll> bucketUp(bucket_sz, 0);
vector<bool> bucketFlag(bucket_sz, false);
auto push = [&](int k) {
bucketFlag[k] = false;
int l = k*sqrtN, r = (k+1)*sqrtN;
for(int i = l; i < r; ++i) a[i] = bucketUp[k];
};
auto update = [&](int s, int t, int x) {
for(int i = 0; i < bucket_sz; ++i) {
int l = i*sqrtN, r = (i+1)*sqrtN;
if(r <= s || t <= l) continue;
if(s <= l && r <= t) {
bucketUp[i] = x;
bucketFlag[i] = true;
} else {
if(bucketFlag[i]) push(i);
for(int j = max(s, l); j < min(t, r); ++j) {
a[j] = x;
}
}
}
};
auto get = [&](int k)->ll{
if(bucketFlag[k/sqrtN]) push(k/sqrtN);
return a[k];
};
while(q--) {
int t;
cin >> t;
if(t == 0) {
ll s, t, x;
cin >> s >> t >> x;
update(s, t+1, x);
} else {
int k;
cin >> k;
cout << get(k) << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string s, t;
cin >> N >> s >> t;
for(int l=N; l<=2*N; l++) {
string S(l, ' ');
rep(i, N) S[i] = s[i];
bool ok = true;
rep(i, N) if(S[l-N+i] != ' ' && S[l-N+i] != t[i]) ok = false;
if(ok) {
cout << l << "\n";
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main(){
int n;
cin >> n;
string s, t;
cin >> s >> t;
rep(i, n){
if (s.substr(i) == t.substr(0,n-i)) {
// cout << s << t.substr(n-i) << endl;
cout << s.size() + t.substr(n-i).size() << endl;
return 0;
}
}
cout << 2 * n << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
rep(i, M) {
int a, b;
cin >> a >> b;
--a, --b;
G[a].push_back(b);
}
vector<bool> vis(N);
vector<int> path;
vector<int> ans;
function<void(int, int)> dfs = [&](int tmp, int par) {
if(vis[tmp]) {
auto from = find(all(path), tmp);
int size = path.end() - from;
if(size != 0) {
if(ans.size() == 0 || size < (int)ans.size()) {
ans = vector<int>(size);
copy(from, path.end(), ans.begin());
}
}
return;
}
path.push_back(tmp);
vis[tmp] = true;
for(int ne: G[tmp]) dfs(ne, tmp);
path.pop_back();
};
rep(i, N) dfs(i, -1);
if(ans.size() == 0) {
cout << -1 << endl;
} else {
auto check = [&](vector<int>& path) {
set<int> se;
for(int v: path) se.insert(v);
int n = path.size();
rep(i, n) {
for(int ne: G[path[i]]) {
if(se.count(ne) && ne != path[(i+1)%n]) {
return make_pair(path[i], ne);
}
}
}
return make_pair(-1, -1);
};
while(true) {
auto ret = check(ans);
if(ret.first == -1) break;
vector<int> newPath;
int n = ans.size();
int begin = find(all(ans), ret.second) - ans.begin();
int end = find(all(ans), ret.first) - ans.begin();
for(int i=begin; i!=end; i=(i+1)%n) {
newPath.push_back(ans[i]);
}
newPath.push_back(ans[end]);
ans = vector<int>(newPath.size());
copy(all(newPath), ans.begin());
}
cout << ans.size() << endl;
for(int a: ans) cout << a+1 << endl;
}
return 0;
}
| #include<iostream>
using namespace std;
#define NMAX 20
int main(){
int M,N,l;
int x[NMAX],y[NMAX];
char d;
bool ok[21][21];
while(1){
cin>>N;
if(N==0) break;
for(int i=0;i<N;i++){
cin>>x[i]>>y[i];
}
cin>>M;
int nx=10,ny=10;
for(int i=0;i<21;i++){
for(int j=0;j<21;j++){
ok[i][j]=false;
}
}
ok[10][10]=true;
for(int i=0;i<M;i++){
cin>>d>>l;
for(int j=0;j<l;j++){
if(d=='N') ny++;
if(d=='S') ny--;
if(d=='W') nx--;
if(d=='E') nx++;
ok[ny][nx]=true;
}
}
bool f=true;
for(int i=0;i<N;i++){
if(!ok[y[i]][x[i]]) f=false;
}
if(f) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
} | 0 |
# include <bits/stdc++.h>
using namespace std;
namespace Base{
# define mr make_pair
typedef long long ll;
typedef double db;
const int inf = 0x3f3f3f3f, INF = 0x7fffffff;
const ll infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll;
template<typename T> void read(T &x){
x = 0; int fh = 1; double num = 1.0; char ch = getchar();
while (!isdigit(ch)){ if (ch == '-') fh = -1; ch = getchar(); }
while (isdigit(ch)){ x = x * 10 + ch - '0'; ch = getchar(); }
if (ch == '.'){
ch = getchar();
while (isdigit(ch)){num /= 10; x = x + num * (ch - '0'); ch = getchar();}
}
x = x * fh;
}
template<typename T> void chmax(T &x, T y){x = x < y ? y : x;}
template<typename T> void chmin(T &x, T y){x = x > y ? y : x;}
}
using namespace Base;
const int N = 2010;
int f[N][N * 3], P, ans, n;
int main(){
read(n); read(P);
f[0][0] = 1;
for (int i = 0; i <= n; i++)
for (int j = 1; j <= 3 * n; j++){
if (j > 0) f[i][j] = (f[i][j] + f[i][j - 1]) % P;
if (j > 1 && i > 0) f[i][j] = (f[i][j] + 1ll * f[i - 1][j - 2] * (3 * n - j + 1)) % P;
if (j > 2 && i > 0) f[i][j] = (f[i][j] + 1ll * f[i - 1][j - 3] * (3 * n - j + 2) % P * (3 * n - j + 1)) % P;
}
for (int i = 0; i <= n; i++)
ans = (ans + f[i][3 * n]) % P;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
int H, W;
vector<string> grids;
vector<vector<bool>> visited;
Pii link_size(int i, int j) {
visited[i][j] = true;
bool color = grids[i][j] == '#';
Pii ret = Pii(0, 0);
if (color) ret.first++;
else ret.second++;
Pii t;
if (i > 0 && grids[i][j] != grids[i-1][j] && !visited[i-1][j]) {
t = link_size(i-1, j);
ret.first += t.first;
ret.second += t.second;
}
if (i < H-1 && grids[i][j] != grids[i+1][j] && !visited[i+1][j]) {
t = link_size(i+1, j);
ret.first += t.first;
ret.second += t.second;
}
if (j > 0 && grids[i][j] != grids[i][j-1] && !visited[i][j-1]) {
t = link_size(i, j-1);
ret.first += t.first;
ret.second += t.second;
}
if (j < W-1 && grids[i][j] != grids[i][j+1] && !visited[i][j+1]) {
t = link_size(i, j+1);
ret.first += t.first;
ret.second += t.second;
}
return ret;
}
int main() {
cin >> H >> W;
grids.resize(H);
for (int i = 0; i < H; i++) cin >> grids[i];
visited.resize(H);
for (int i = 0; i < H; i++) visited[i].resize(W);
for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) visited[i][j] = false;
ll ans = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (!visited[i][j]) {
Pii t = link_size(i, j);
ans += (ll)t.first * (ll)t.second;
}
}
}
cout << ans << endl;
} | 0 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string s,ans;
cin >> s;
ans = s;
map<char, int>m;
rep(i, 26)m[char('a' + i)]++;
if(s.size() == 26){
char c = ' ';
for (int i = 25; i > 0;i--) {
if (s[i-1] < s[i]) {
ans = s.substr(0, i - 1);
c = s[i -1];
break;
}
}
for (auto ss : ans)m[ss]--;
for (auto mm : m) {
if (mm.second == 1 && c < mm.first) {
ans += mm.first;
break;
}
}
}
else {
for (auto ss : s)m[ss]--;
for (auto mm : m) {
if (mm.second == 1) {
ans = s + mm.first;
break;
}
}
}
if (s != ans) {
cout << ans << endl;
}
else {
cout << -1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int RLEN=1<<18|1;
inline char nc() {
static char ibuf[RLEN],*ib,*ob;
(ib==ob) && (ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob) ? -1 : *ib++;
}
inline int rd() {
char ch=nc(); int i=0,f=1;
while(!isdigit(ch)) {if(ch=='-')f=-1; ch=nc();}
while(isdigit(ch)) {i=(i<<1)+(i<<3)+ch-'0'; ch=nc();}
return i*f;
}
const int N=1e5+50;
int n,a[N];
inline int calc_status() {
int c1=0, c2=0;
for(int i=1;i<=n;i++)
(a[i]&1) ? ++c1 : ++c2;
if(c2&1) return 1;
else if(c1>=2) return 0;
else {
int g=0;
for(int i=1;i<=n;i++) {
if(a[i]&1) {
if(a[i]==1) return 0;
else --a[i];
}
g=__gcd(a[i],g);
}
for(int i=1;i<=n;i++) a[i]/=g;
return calc_status() ? 0 : 1;
}
}
int main() {
n=rd();
if(n==1) {puts("Second"); return 0;}
for(int i=1;i<=n;i++) a[i]=rd();
if(calc_status()==1) puts("First");
else puts("Second");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); //for debug
cin.rdbuf(in.rdbuf()); //for debug
#endif
const int w = 52;
const int h = 100;
char field[h][w];
int a, b;
cin >> a >> b;
a--, b--;
rep(i, h / 2)
{
rep(j, w)
field[i][j] = '.';
}
rep(i, h / 2)
{
rep(j, w)
field[i + h / 2][j] = '#';
}
rep(i, 20)
{
if (b == 0)
break;
else
{
rep(j, 25)
{
if (b == 0)
break;
else
{
field[2 * i + 1][2 * j + 1] = '#';
b--;
}
}
}
}
rep(i, 20)
{
if (a == 0)
break;
else
{
rep(j, 25)
{
if (a == 0)
break;
else
{
field[2 * i + h / 2 + 1][2 * j + 1] = '.';
a--;
}
}
}
}
cout << h << " " << w << endl;
rep(i, h)
{
rep(j, w)
cout
<< field[i][j];
cout << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
cout << 100 << " " << 100 << endl;
vector< vector<int> > grad(100, vector<int>(100));
for(int i=0; i<50; i+=2) {
for(int j=0; j<100; j+=2) {
if(A > 1) {
grad[i][j] = 1;
--A;
}
}
}
for(int i=50; i<100; i++) {
for(int j=0; j<100; j++) {
grad[i][j] = 1;
if(B > 1 && i>50 && i%2 == 1 && j%2) {
grad[i][j] = 0;
--B;
}
}
}
for(int i=0; i<100; i++) {
for(int j=0; j<100; j++) {
if(grad[i][j]) {
cout << '.';
} else {
cout << '#';
}
}
cout << endl;
}
return 0;
}
| 1 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N, K;
scanf("%d %d", &N, &K);
int l[50];
for (int i = 0; i < N; i++) {
scanf("%d", &l[i]);
}
sort(l, l + N, greater<int>());
int ans = 0;
for (int i = 0; i < K; i++) {
ans += l[i];
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,n) for(int i = l; i <= (int)(n); i++)
#define drep(i,n) for(int i = (int)(n-1); i >= 0; i--)
#define drepn(i,n) for(int i = (int)(n); i >= 0; i--)
#define size(s) (int)s.size()
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
template<typename T> inline istream& operator>>(istream &i, vector<T> &v) {rep(j, size(v)) i >> v[j]; return i;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T> T gcd(T a, T b) {if(b==0)return a; else return gcd(b,a%b);}
template<class T> T lcm(T a, T b) {return a/gcd(a,b)*b;}
template<class T = int> using V = vector<T>;
template<class T = int> using VV = vector<V<T>>;
bool isIn(int i, int j, int h, int w) {return i >= 0 && i < h && j >= 0 && j < w;}
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void err() {cout << -1 << endl;}
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ep emplace_back
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
V<> a(n);
cin >> a;
sort(rall(a));
int ans = accumulate(a.begin(), a.begin() + k, 0);
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define mod2 998244353
#define pii pair<ll,ll>
#define pb push_back
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vector<T> arr) {
for (auto t: arr)
cout << t << " ";
cout << "\n";
}
template<typename T>
void debugarr(T arr, int n) {
for (int i=0;i<n;i++) cout << arr[i] << " ";
cout << "\n";
}
ll __min(ll a, ll b) {
return a < b ? a : b;
}
ll __max(ll a, ll b) {
return a > b ? a : b;
}
const int maxn = 1e5+1;
ll arr[maxn], n, m, t, k, q;
unordered_map<ll,ll> u;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int arr[26]={0};
string s;
cin>>s;
for (char c: s) arr[c-'a']++;
for (int i=0;i<26;i++) {
if (arr[i] == 0) {
char c = 'a' + i;
cout << c << endl;
exit(0);
}
}
cout << "None\n";
}
| #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 s;
cin >> s;
vector<bool> found(26, false);
rep(i, s.size()) found[s[i] - 'a'] = true;
int a = -1;
rep(i, 26) if (found[i] == false) {
a = i;
break;
}
if (a == -1) cout << "None" << endl;
else {
char c = a + 'a';
cout << c << endl;
}
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#define maxn 200005
using namespace std;
int n,k,l;
int father1[maxn];
int father2[maxn];
map<pair<int,int>,int>mp;
int find1(int x)
{
if(father1[x]!=x)
father1[x]=find1(father1[x]);
return father1[x];
}
int find2(int x)
{
if(father2[x]!=x)
father2[x]=find2(father2[x]);
return father2[x];
}
void unionn1(int x,int y)
{
int fa=find1(x);
int fb=find1(y);
if(fa!=fb)
father1[fa]=fb;
}
void unionn2(int x,int y)
{
int fa=find2(x);
int fb=find2(y);
if(fa!=fb)
father2[fa]=fb;
}
int main()
{scanf("%d%d%d",&n,&k,&l);
for(int i=0;i<=n;i++)
{father1[i]=i;
father2[i]=i;
}
int p,q;
for(int i=1;i<=k;i++)
{scanf("%d%d",&p,&q);
unionn1(p,q);
}
int r,s;
for(int i=1;i<=l;i++)
{scanf("%d%d",&r,&s);
unionn2(r,s);
}
for(int i=1;i<=n;i++)
mp[make_pair(find1(i),find2(i))]++;
for(int i=1;i<=n;i++)
if(i!=n)
printf("%d ",mp[make_pair(find1(i),find2(i))]);
else
printf("%d\n",mp[make_pair(find1(i),find2(i))]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<char> b(m);
for (int i = 0; i < m; i++)
{
cin >> a[i] >> b[i];
if (n != 1)
{
if (a[i] == 1)
{
if (b[i] == '0')
{
cout << -1 << endl;
return 0;
}
}
}
a[i]--;
}
for (int i = 0; i < m - 1; i++)
{
for (int j = i + 1; j < m; j++)
{
if (a[i] == a[j])
{
if (b[i] != b[j])
{
cout << -1 << endl;
return 0;
}
}
}
}
int nx = pow(10, n);
for (int i = 0; i < nx; i++)
{
string str = to_string(i);
if (str.size() != n) continue;
int flg = 1;
for (int j = 0; j < m; j++)
{
if (str[a[j]] != b[j]) flg = 0;
}
if (flg)
{
cout << i << endl;
return 0;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long n,now=0;
cin>>n;
string s,t;
cin>>s>>t;
while(1){
if(s.substr(now,n-now)==t.substr(0,n-now)){
break;
}
now++;
}
cout<<n+now<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string s, t;
cin >> N >> s >> t;
for(int l=N; l<=2*N; l++) {
string S(l, ' ');
rep(i, N) S[i] = s[i];
bool ok = true;
rep(i, N) if(S[l-N+i] != ' ' && S[l-N+i] != t[i]) ok = false;
if(ok) {
cout << l << "\n";
return 0;
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define rand rund
#define pb push_back
#define eb emplace_back
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef unsigned long long int ull;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w)
{
cout<<w.size()<<endl;
for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
if (w.size()) cout<<w[w.size()-1]<<endl;
}
void M998()
{
swap(MOD,MOD2);
}
ll raand()
{
ll a=rand();
a*=RAND_MAX;
a+=rand();
return a;
}
ll raaand()
{
return raand()*(MOD-7)+raand();
}
string to_upper(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
return a;
}
string to_lower(string a)
{
for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
return a;
}
ll sti(string a)
{
ll k=0;
for (int i=0;i<(int)a.size();++i)
{
k*=10;
k+=a[i]-'0';
}
return k;
}
string its(ll k)
{
if (k==0) return "0";
string a;
while (k)
{
a.push_back((k%10)+'0');
k/=10;
}
reverse(a.begin(),a.end());
return a;
}
ll min(ll a,int b)
{
if (a<b) return a;
return b;
}
ll min(int a,ll b)
{
if (a<b) return a;
return b;
}
ll max(ll a,int b)
{
if (a>b) return a;
return b;
}
ll max(int a,ll b)
{
if (a>b) return a;
return b;
}
ll gcd(ll a,ll b)
{
if (b==0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
return a/gcd(a,b)*b;
}
template<class T,class K>
pair<T,K> mp(T a,K b)
{
return make_pair(a,b);
}
inline int mult(ll a,ll b)
{
return (a*b)%MOD;
}
inline int pot(int n,int k)
{
if (k==0) return 1;
ll a=pot(n,k/2);
a=mult(a,a);
if (k%2) return mult(a,n);
else return a;
}
int divide(int a,int b)
{
return mult(a,pot(b,MOD-2));
}
inline int sub(int a,int b)
{
if (a-b>=0) return a-b;
return a-b+MOD;
}
inline int add(int a,int b)
{
if (a+b>=MOD) return a+b-MOD;
return a+b;
}
bool prime(ll a)
{
if (a==1) return 0;
for (int i=2;i<=round(sqrt(a));++i)
{
if (a%i==0) return 0;
}
return 1;
}
ll has(string x)
{
ll h1=0,h2=0;
x=to_lower(x);
for (char a: x)
{
h1*=bases[0];
h1+=a-'a';
h1%=bases[3];
h2*=bases[1];
h2+=a-'a';
h2%=bases[4];
}
return h1*(MOD+13893829)+h2;
}
const int N=300010;
ll k;
ll e,a[N];
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i=0;i<10;++i) bases.push_back((raand()%MOD+13893829)%MOD);
cin>>k;
e=10;
e*=1000;
e*=1000;
e*=1000;
e*=1000;
e*=1000;
for (int n=2;n<=50;++n) if (k<=e*n)
{
ll z=(k+n-1)/n;
for (int i=0;i<n-1;++i) a[i]=z+n-1;
a[n-1]=z;
int imp=z*n-k;
if (imp)
{
--a[n-1];
--imp;
}
int st=n-2;
while (imp)
{
a[st]-=st+1;
--imp;
--st;
}
cout<<n<<endl;
for (int i=0;i<n;++i) cout<<a[i]<<' ';
break;
}
}
| #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
long long k;
cin >> k;
vector<long long> a(50, 49);
long long x = (k + 50) / 50, y = (k % 50);
for(int i = 0; i < 50; i++){
a[i] += x;
if(i >= y) a[i] -= y + 1;
}
cout << 50 << endl;
for(int i = 0; i < 49; i++){
cout << a[i] << " ";
}
cout << a[49] << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
char getClass(int m, int e, int j) {
if (m == 100 || e == 100 || j == 100 || (m + e) / 2 >= 90
|| (m + e + j) / 3 >= 80)
return 'A';
if ((m + e + j) / 3 >= 70 || (m + e + j) / 3 >= 50 && m >= 80 || e >= 80)
return 'B';
return 'C';
}
int main() {
int n, pm, pe, pj;
while (cin >> n && n) {
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
cout << getClass(pm, pe, pj) << endl;
}
}
return 0;
} | #include <stdio.h>
int dividing(int math, int english, int japanese)
{
if (math == 100 || english == 100 || japanese == 100) {
printf("A\n");
}else if (math + english >= 180) {
printf("A\n");
}else if (math + english + japanese >= 240) {
printf("A\n");
} else if (math + english + japanese >= 210) {
printf("B\n");
} else if (math + english + japanese >= 150 && math >= 80) {
printf("B\n");
} else if (math + english + japanese >= 150 && english >= 80) {
printf("B\n");
} else {
printf("C\n");
}
}
int main(void)
{
while (1) {
int number;
scanf("%d", &number);
if (number == 0) {
break;
}
for (int i = 0; i < number; i++) {
int math;
int english;
int japanese;
scanf("%d %d %d", &math, &english, &japanese);
dividing(math, english, japanese);
}
}
} | 1 |
/**
* ???????????? I
?¬?????±??????????????????????????????????????????¢??????????????\??¬????????§????????????????????°????????????????????????????????????
????????????????????¢??????????????¨????????? 1 ?????? 6 ????????????????????????????????????????????????
??\?????¨??????????????????????????¢?????????????????????????????°?????¨?????¢?????????????????????????????????????????§???????????????????????¢?????°?????????????????????????????????????????\??¬????????§??????????????¶?????????????????¨?????????????????????????????§?????????????????????????????????????????¨????????????
Input
?????????????????¢?????°???????????????????????????????????????????????????????????§?????????????????????
???????????????????????¨????????????????????????????????????????????????????????????????????????????????????????????¨?????????
E???N???S???W ????????????????????§??????
Output
???????????????????????????????????????????????????????????¢?????°???????????????????????????????????????
Constraints
0??? ??\?????????????????????????????¢?????°??? ???100
0??? ???????????¨????????????????????? ???100
Note
?¶???????????????? Dice III, Dice IV
??§???????????°????????????????????±????????§???????????????????????????????§?????????§?????????????????????????????????
Sample Input 1
1 2 4 8 16 32
SE
Sample Output 1
8
?????¢??? 1, 2, 4, 8, 16, 32 ??¨??????????????????????????? S ??????????????¢???????????????E
??????????????¢????????¨????????¢?????°?????? 8 ??????????????????
Sample Input 2
1 2 4 8 16 32
EESWN
Sample Output 2
32
*/
#include <iostream>
#include <sstream>
class Dice {
private:
unsigned short Top = 1;
unsigned short Back = 2;
unsigned short Right = 3;
unsigned short Left = 4;
unsigned short Front = 5;
unsigned short Bottom = 6;
public:
Dice() {
}
Dice(std::string Param) {
setNumbers(Param);
}
unsigned short getTop();
void lotate(std::string);
void setNumbers(std::string);
};
unsigned short Dice::getTop() { return Top; }
void Dice::lotate(std::string Direction) {
for (const auto &e : Direction) {
unsigned int Tmp;
if (e == 'N') {
Tmp = Front;
Front = Top;
Top = Back;
Back = Bottom;
Bottom = Tmp;
} else if (e == 'E') {
Tmp = Right;
Right = Top;
Top = Left;
Left = Bottom;
Bottom = Tmp;
} else if (e == 'W') {
Tmp = Left;
Left = Top;
Top = Right;
Right = Bottom;
Bottom = Tmp;
} else if (e == 'S') {
Tmp = Back;
Back = Top;
Top = Front;
Front = Bottom;
Bottom = Tmp;
}
}
}
void Dice::setNumbers(std::string Str) {
std::istringstream iss(Str);
unsigned short n;
size_t i = 0;
while (iss >> n) {
switch (i++) {
case 0:
Top = n;
break;
case 1:
Back = n;
break;
case 2:
Right = n;
break;
case 3:
Left = n;
break;
case 4:
Front = n;
break;
case 5:
Bottom = n;
break;
}
}
}
int main(int argc, char const *argv[]) {
std::string Param;
getline(std::cin, Param);
Dice D(Param);
getline(std::cin, Param);
D.lotate(Param);
std::cout << D.getTop() << std::endl;
return 0;
} | #include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main(){
int n,m;
string S;
int dice[6];
for(int i=0;i<6;i++){
cin>>dice[i];
}
cin>>S;
for(int i=0;i<S.size();i++){
if(S[i]=='N'){
m=dice[0];
dice[0]=dice[1];
dice[1]=dice[5];
dice[5]=dice[4];
dice[4]=m;
}
else if(S[i]=='S'){
m=dice[0];
dice[0]=dice[4];
dice[4]=dice[5];
dice[5]=dice[1];
dice[1]=m;
}
else if(S[i]=='W'){
m=dice[0];
dice[0]=dice[2];
dice[2]=dice[5];
dice[5]=dice[3];
dice[3]=m;
}
else if(S[i]=='E'){
m=dice[0];
dice[0]=dice[3];
dice[3]=dice[5];
dice[5]=dice[2];
dice[2]=m;
}
m=0;
}
cout<<dice[0]<<endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
/* --------------------------------------------------- */
int main() {
int x, y;
cin >> x >> y;
int ans = 0;
if(x == 1) ans += 300000;
if(x == 2) ans += 200000;
if(x == 3) ans += 100000;
if(y == 1) ans += 300000;
if(y == 2) ans += 200000;
if(y == 3) ans += 100000;
if(x == 1 && y == 1) ans += 400000;
cout << ans << endl;
return 0;
} | #include "iostream"
using namespace std;
int main(){
int x,y,price=0;
cin>>x>>y;
for (int i=1; i<=3; i++) {
if (x==i) {
price+=(4-i)*100000;
}
if (y==i) {
price+=(4-i)*100000;
}
}
if (x==1&&y==1) {
cout<<"1000000"<<endl;
} else {
cout<<price<<endl;
}
}
| 1 |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define pb push_back
#define f first
// #define s second
#define int long long
#define float long double
#define all(c) (c).begin(), (c).end()
#define endl '\n'
ll pow(ll a,ll p,ll m=mod)
{ll res=1;while(p>0){if(p&1)res=(res*a)%m;a=(a*a)%m;p>>=1;}
return res;}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
// int t;
// cin >> t;
// while(t--){
// }
int k;
string s;
cin >> k >> s;
int n = s.length();
if(k >= n)cout << s << endl;
else{
string res;
fo(i,0,k)res += s[i];
res += "...";
cout << res << endl;
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int k;
string s;
cin >> k>>s;
auto out = s;
if(s.size()>k) out = s.substr(0,k) + "...";
cout << out << endl;
return 0;
} | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
using i64=long long;
template <typename T>
struct BinaryIndexedTree {
size_t n;
vector<T> tree;
BinaryIndexedTree(size_t n, T e=0): n(n) {
tree = vector<T>(n+1, e);
}
void add(size_t i, T w) {
// v[i] += w;
// i in [1, n]
for (size_t j=i; j<=n; j+=j&-j)
tree[j] += w;
}
T sum(T m) {
// returns sum of v[i] for i in [1, m]
T sum_=0;
for (size_t i=m; i>0; i-=i&-i)
sum_ += tree[i];
return sum_;
}
};
int main() {
size_t n;
scanf("%zu", &n);
vector<int> a(n);
for (size_t i=0; i<n; ++i)
scanf("%d", &a[i]);
map<int, size_t> m;
for (size_t i=0; i<n; ++i)
m[a[i]] = i;
vector<int> b(n);
int rank_=1;
for (pair<const int, size_t> p: m)
b[p.second] = rank_++;
BinaryIndexedTree<i64> tree(n+1);
i64 res=0;
for (size_t i=0; i<n; ++i) {
res += i-tree.sum(b[i]);
tree.add(b[i], 1);
}
printf("%lld\n", res);
return 0;
} | #include <iostream>
#include <vector>
#define SENTINEL 1000000001
using namespace std;
long long cnt = 0;
void merge(vector<int> &A, int left, int mid, int right)
{
int n1 = mid - left;
int n2 = right - mid;
vector<int> L(n1 + 1), R(n2 + 1);
for (int i = 0; i < n1; i++)
{
L[i] = A[left + i];
}
for (int i = 0; i < n2; i++)
{
R[i] = A[mid + i];
}
L[n1] = SENTINEL;
R[n2] = SENTINEL;
int i = 0;
int j = 0;
for (int k = left; k < right; k++)
{
if (L[i] <= R[j])
{
A[k] = L[i];
i++;
}
else
{
A[k] = R[j];
cnt += n1 - i; // L[]は昇順に整列されているので、i番目以降のL[]の要素(n1 - i)個はすべてR[j]より大きくなる
j++;
}
}
}
void mergeSort(vector<int> &A, int left, int right)
{
if (left + 1 < right)
{
int mid = (left + right) / 2;
mergeSort(A, left, mid);
mergeSort(A, mid, right);
merge(A, left, mid, right);
}
}
int main() {
int n;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; i++)
{
cin >> S[i];
}
mergeSort(S, 0, n);
cout << cnt << endl;
return 0;
}
| 1 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) FOR(i,0,(n))
typedef pair<int,int> P;
class CGridRepainting2 {
public:
void solve(std::istream& in, std::ostream& out) {
int h,w;
in >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
REP(i,h)REP(j,w){
in >> s[i][j];
}
vector<P> action = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};
REP(i,h) REP(j,w){
if(s[i][j] == '#') {
bool f = false;
for (P p : action) {
if (i + p.first >= 0 && i + p.first < h && j + p.second >= 0 && j + p.second < w) {
f |= s[i + p.first][j + p.second] == '#';
}
}
if (!f) {
out << "No" << endl;
return;
}
}
}
out << "Yes" << endl;
}
};
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout << fixed;
CGridRepainting2 solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| #include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int main() {
char buf[1<<10];
size_t q;
scanf("%s %zu", buf, &q);
string str(buf);
for (size_t i=0; i<q; ++i) {
size_t a, b;
scanf("%s %zu %zu", buf, &a, &b);
string instr(buf);
if (instr == "print") {
printf("%s\n", str.substr(a, b-a+1).c_str());
} else if (instr == "reverse") {
reverse(str.begin()+a, str.begin()+b+1);
} else if (instr == "replace") {
scanf("%s", buf);
string p(buf);
str.replace(a, b-a+1, p);
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int A, B, C, D, E, K;
cin >> A >> B >> C >> D >> E >> K;
cout << (E - A > K ? ":(" : "Yay!");
} | //----------------------Shanu Garg here---------------------
//-------------Search on youtube : Shanu Garg---------------
//-Studying at National Institute of Technology Delhi(NITD)-
//---------------------From Delhi, India--------------------
#include<bits/stdc++.h>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define memset(a,first,last,val) fs(i,first,last,1) a[i]=val
#define nl cout<<"\n";
#define chk(x) cout<<#x<<x<<" ", nl
#define ll long long int
#define ull unsigned long long int
#define vi vector<int>
#define vvi vector<vi>
#define pr pair<ll, ll>
#define vii vector<pair<int, int>>
#define vll vector<pr>
#define vl vector<ll>
#define m(a,b) map<a, b>
#define mid(a,b) ((a+b)/2)
#define pb push_back
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
vl vb;
int N;
class triplet{ll f, s, t;};
vl in(ll n){
vl ar;
ll x;
f(i,n)
cin>>ar[i];
return ar;
}
vll in_pr(ll n){
vll ar;
ll x,y;
f(i,n)
{cin>>x>>y;
ar[i]={x,y};
}return ar;
}
void out(vl v, char ch='\0'){
fl(i,v)
cout<<i<<ch;
}
void printArray(vector<int> arr, int n)
{
ll num=0;
for (int i = 0; i < n; i++)
num*=10, num+=i;
if(n==N)
vb.pb(num);
}
int printfactorialof(int n){
if(n<=1)
return 1;
return n*printfactorialof(n-1);
}
void solve(){
ll a,b;
cin>>a>>b;
if(a+b <= 16){
if(a<=8 && b<=8)
cout<<"Yay!",nl
else
{
cout<<":(",nl
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
scanf("%d", &N);
int maximum;
scanf("%d", &maximum);
long long ans = 0;
for(int i = 1; i < N; i++)
{
int person;
scanf("%d", &person);
if(person >= maximum)
maximum = person;
else
ans += maximum - person;
}
printf("%lld", ans);
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x;
cin>>x;
ll a[x];
ll ans = 0;
ll maxT = 0;
for(int i=0;i<x;i++) {
cin>>a[i];
if(i == 0) {
maxT = a[0];
}
if(i > 0) {
if(a[i] < a[i-1]) {
ans += (a[i-1]-a[i]);
a[i] = a[i-1];
}
maxT = a[i];
}
}
// 2 1 5 4 3
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
if (s.size()>k) {
string sub = s.substr(0, k);
cout << sub << "..." <<endl;
}
else{
cout << s <<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int a,b;
cin >> a >> b;
if(a>8||b>8){
cout << ":(";
}else{
cout << "Yay!";
}
} | 0 |
#include<bits/stdc++.h>
#define N 200005
using namespace std;
int n,a[4][N],f[N],g[N],w[N];
void biu()
{
puts("No");
exit(0);
}
void add(int x)
{
for (int i=x;i<=n;i+=i&-i)
w[i]++;
}
int qry(int x)
{
int ans=0;
for (int i=x;i;i-=i&-i)
ans+=w[i];
return ans;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=3;i++)
for (int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
int s1=0,s2=0,a1=0,a2=0;
for (int i=1;i<=n;i++)
{
if ((a[2][i]-2)%3) biu();
f[i]=(a[2][i]+1)/3;
if ((f[i]^i)&1) biu();
if (a[1][i]==a[2][i]-1) g[i]=0;
else if (a[1][i]==a[2][i]+1) g[i]=1;
else biu();
if (a[1][i]+a[3][i]!=a[2][i]*2) biu();
}
for (int i=n;i>=1;i-=2)
{
a1^=g[i];
s1+=qry(f[i]);
add(f[i]);
}
memset(w,0,sizeof w);
for (int i=n-1;i>=1;i-=2)
{
a2^=g[i];
s2+=qry(f[i]);
add(f[i]);
}
if ((a2!=(s1&1))||(a1!=(s2&1))) biu();
puts("Yes");
} | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = std::pair<ll, ll>;
constexpr ll INF = 1ll<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }
template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }
ll N;
ll A[100010];
int main()
{
std::cin >> N;
ll sum = 0;
rep( i, N ) {
std::cin >> A[i];
sum ^= A[i];
}
ll ans = sum;
rep( i, N )
A[i] &= ~sum;
ll r = 0;
repd( i, 61 ) {
ll j = r;
for( ; j < N; ++j ) {
if( A[j]>>i&1 ) {
std::swap( A[r], A[j] );
break;
}
}
if( j == N )
continue;
rep( j, N ) {
if( j == r )
continue;
if( A[j]>>i&1 )
A[j] ^= A[r];
}
++r;
}
ll x = 0;
rep( i, r )
x ^= A[i];
ans += x*2;
std::cout << ans << std::endl;
return 0;
} | 0 |
//#include "atcoder/all"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
// using namespace atcoder;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d) \
vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) fixed << setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll X, Y;
cin >> X >> Y;
if (Y >= X)
cout << min(Y - X, abs(X + Y) + 1) << endl;
else
cout << min(X - Y + 2, abs(X + Y) + 1) << endl;
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 998244353; //1000000007;
template<class _T> static void get(_T& a) {
std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
if (a < (_T)0) {
a *= (_T)-1;
}
return a;
}
static void exec();
int main()
{
exec();
fflush(stdout);
return 0;
}
static void exec()
{
int x, y;
get(x, y);
int ans = 0;
if (tp_abs(x) < tp_abs(y)) {
if (x < 0) {
ans++;
}
ans += tp_abs(y) - tp_abs(x);
if (y < 0) {
ans++;
}
}
else {
if (x > 0) {
ans++;
}
ans += tp_abs(x) - tp_abs(y);
if (y > 0) {
ans++;
}
}
printf("%d\n", ans);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL<<61;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P){if(P==0) return 1;
if(P%2==0){ll t = jou(N, P/2);return t*t % mod;
}return (N * jou(N, P-1)) % mod;} //jou(n,mod-2)で逆元
//intの最大値2147483647 ≒ 2×10^9
//long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
//実行時間制約2秒では２×10^8回くらいまで計算できる
int main() {
ll n,k;
cin>>n>>k;
vector<ll> p(n);
ll x,y;
cin>>x;
ll dai=x;
repo(i,n){
cin>>p[i];
x=gcd(x,p[i]);
dai=max(dai,p[i]);
}
cout << (k%x==0 && k<=dai ? "POSSIBLE":"IMPOSSIBLE") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------------------------------
void MAIN() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &i : a) cin >> i;
int g = a[0];
for (int i = 1; i < n; i++) {
g = __gcd(g, a[i]);
}
for (int i = 0; i < n; i++) {
if (a[i] >= k && (a[i] - k) % g == 0) {
cout << "POSSIBLE" << '\n';
return;
}
}
cout << "IMPOSSIBLE" << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| 1 |
//----------------------Shanu Garg here---------------------
//-------------Search on youtube : Shanu Garg---------------
//-Studying at National Institute of Technology Delhi(NITD)-
//---------------------From Delhi, India--------------------
#include<bits/stdc++.h>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define memset(a,first,last,val) fs(i,first,last,1) a[i]=val
#define nl cout<<"\n";
#define chk(x) cout<<#x<<x<<" ", nl
#define ll long long int
#define ull unsigned long long int
#define vi vector<int>
#define vvi vector<vi>
#define pr pair<ll, ll>
#define vii vector<pair<int, int>>
#define vll vector<pr>
#define vl vector<ll>
#define m(a,b) map<a, b>
#define mid(a,b) ((a+b)/2)
#define pb push_back
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
vl vb;
int N;
class triplet{ll f, s, t;};
vl in(ll n){
vl ar;
ll x;
f(i,n)
cin>>ar[i];
return ar;
}
vll in_pr(ll n){
vll ar;
ll x,y;
f(i,n)
{cin>>x>>y;
ar[i]={x,y};
}return ar;
}
void out(vl v, char ch='\0'){
fl(i,v)
cout<<i<<ch;
}
void printArray(vector<int> arr, int n)
{
ll num=0;
for (int i = 0; i < n; i++)
num*=10, num+=i;
if(n==N)
vb.pb(num);
}
int printfactorialof(int n){
if(n<=1)
return 1;
return n*printfactorialof(n-1);
}
void solve(){
ll a,b;
cin>>a>>b;
if(a+b <= 16){
if(a<=8 && b<=8)
cout<<"Yay!",nl
else
{
cout<<":(",nl
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
//int型vectorを出力
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
//LLi型vectorを出力
void PVL(vector<LLi> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
int main(){
int a, b;
cin>> a >> b;
if(a<=8 && b<=8) cout<< "Yay!" << endl;
else cout<< ":(" << endl;
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define maxn 100010
using namespace std;
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,K,ans;
int head[maxn],nxt[maxn],to[maxn],tot;
void add(int u,int v)
{
tot++;
nxt[tot]=head[u];
head[u]=tot;
to[tot]=v;
}
int dep[maxn];
void dfs(int x,int las)
{
for(int i=head[x];i;i=nxt[i])
{
dfs(to[i],x);
dep[x]=max(dep[x],dep[to[i]]);
}
dep[x]++;
if(dep[x]==K&&las!=1) ans++,dep[x]=0;
}
int main()
{
n=read();K=read();
for(int i=1;i<=n;i++)
{
int x=read();
if(i==1) ans+=(x!=1);
else{
add(x,i);
}
}
for(int i=head[1];i;i=nxt[i]) dfs(to[i],1);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
string s;
cin >> n >> s;
vector<ll> c(n + 1, 0);
for (ll i = 0; i < n; i++)
{
c[i + 1] = c[i];
if (s[i] == 'W')
{
c[i + 1]++;
}
}
ll ans = n;
for (ll i = 1; i < n + 1; i++)
{
ans = min(ans, c[i - 1] + (n - i) - (c[n] - c[i]));
}
cout << ans << endl;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int a[200010];
int b[200010];
int main(){
int n;
cin >> n;
rep(i, n) cin >> a[i+1];
for(int i = (n+1)/2; i <= n; i++){
b[i] = a[i];
}
for(int k = n; k >= 1; k--){
int tmp = 0;
for(int i = 2 * k; i <= n; i += k){
tmp += b[i];
}
tmp += a[k];
if (tmp%2 == 0) b[k] = 0;
else b[k] = 1;
}
int cnt = 0;
rep(i, n) cnt += b[i+1];
cout << cnt << endl;
if (cnt == 0) return 0;
rep(i, n) if (b[i+1] > 0) cout << i+1 << " ";
cout << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
vector<long long> divisor(long long n){//nの約数列挙
vector<long long> res;
for(long long 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(){
int N;
cin >> N;
vector<int> a(N + 1);
for(int i = 1; i < N + 1; i++) cin >> a[i];
vector<int> sum(N + 1, 0);
vector<int> ko(N + 1, 0);
int cnt = 0;
for(int i = N; i > 0; i--){
if(sum[i] % 2 != a[i]){
ko[i]++;
sum[i]++;
cnt++;
vector<long long> d = divisor(i);
for(int j = 0; j < d.size(); j++){
if(d[j] != i){
sum[d[j]]++;
}
}
}
}
cout << cnt << endl;
for(int i = 1; i <= N; i++){
if(ko[i] == 1){
cout << i << endl;
}
}
} | 1 |
#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 pbpair(a,b) push_back(make_pair(a,b))
#define MOD 1000000007
#define INF 9223372036854775807
#define pairint pair<int,int>
typedef pair< int , int> P;
int gcd( int x, int y ){
return y ? gcd(y, x%y) : x;
}
bool pairCompare(const P& firstElof, const P& 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;
while( std::cin >> x>>y){
if(x==0)return 0;
std::vector< int > v(x);
rep(i,x)std::cin >> v[i];
sort(rall(v));
rep(i,x){
if((i+1)%y==0)continue;
z+=v[i];
}
std::cout << z << '\n';
z=0;
}
}
| #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
int n;
cin >> n;
if(n == 0)
return 0;
vector<vector<int> > num(n+1, vector<int>(n+1, 0));
for(int i=0; i<n; ++i){
for(int j=0; j<n; ++j){
cin >> num[i][j];
num[i][n] += num[i][j];
num[n][j] += num[i][j];
num[n][n] += num[i][j];
}
}
for(int i=0; i<=n; ++i){
for(int j=0; j<=n; ++j){
cout << setw(5) << num[i][j];
}
cout << endl;
}
}
} | 0 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
class Dice{
private:
int label[6];
public:
void initialize(int number[]);
void command(char houkou);
int getResult();
};
//ラベルに数字を代入
void Dice::initialize(int number[])
{
for(int i = 0; i < 6; i++){
label[i] = number[i];
}
}
//命令を実行
void Dice::command(char houkou)
{
int temp[6];
for(int i = 0; i < 6; i++) {
temp[i] = label[i];
}
if(houkou == 'E'){
label[0] = temp[3];
label[2] = temp[0];
label[3] = temp[5];
label[5] = temp[2];
}
else if(houkou == 'W'){
label[0] = temp[2];
label[2] = temp[5];
label[3] = temp[0];
label[5] = temp[3];
}
else if(houkou == 'N'){
label[0] = temp[1];
label[1] = temp[5];
label[4] = temp[0];
label[5] = temp[4];
}
else if(houkou == 'S'){
label[0] = temp[4];
label[1] = temp[0];
label[4] = temp[5];
label[5] = temp[1];
}
}
//結果を取得
int Dice::getResult()
{
return label[0];
}
int main(){
Dice dice;
int number[6];
for(int i = 0; i < 6; i++){
cin >> number[i];
}
dice.initialize(number);
string meirei;
cin >> meirei;
for(int i = 0; i < meirei.length(); i++){
dice.command(meirei[i]);
}
cout << dice.getResult() << endl;
return 0;
} | //by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod=1e9+7;
ll qpow(ll x, ll k) {return k==0? 1: 1ll*qpow(1ll*x*x%mod,k>>1)*(k&1?x:1)%mod;}
const int maxn = 300111;
char s[maxn];
int n;
int dp[maxn][3][3];
void upd(int &x, int v) {x=(x+v)%mod;}
int main()
{
scanf("%s", s);
n = strlen(s);
dp[0][0][0] = 1;
for (int i=0; i<n; i++)
{
for (int x=0; x<3; x++)
{
for (int y=0; y<3; y++)
{
int cur = dp[i][x][y];
if (!cur) continue;
for (int t=0; t<2; t++)
{
if (s[i]!='?'&&s[i]-'0'!=t) continue;
int nx, ny;
if (x==2) nx=2, ny=0;
else
{
if (t==0) nx=x, ny=y+1==3?1:y+1;
else
{
if (y==0) nx=x+1, ny=0;
else nx=x, ny=y-1;
}
}
upd(dp[i+1][nx][ny], cur);
}
}
}
}
int ans = 0;
upd(ans, dp[n][2][0]);
upd(ans, dp[n][1][0]);
upd(ans, dp[n][0][0]);
cout<<ans<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 305;
ld dp[N][N][2];
int n, t[4];
void table() {
for (int t3 = 0; t3 <= t[3]; t3++){
int pr1 = t3 % 2, pr2 = (pr1 + 1) % 2;
for (int t2 = 0; t2 <= n; t2++)
for (int t1 = 0; t1 <= n; t1++) {
int t0 = n - (t1 + t2 + t3);
ld &ans = dp[t1][t2][pr1];
if (t0 == n)
ans = 0;
else {
ans = 1;
if (t1)
ans += dp[t1 - 1][t2][pr1] * ((ld) t1 / n);
if (t2)
ans += dp[t1 + 1][t2 - 1][pr1] * ((ld) t2 / n);
if (t3)
ans += dp[t1][t2 + 1][pr2] * ((ld) t3 / n);
ans /= (1 - ((ld) t0 / n));
}
}
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
t[a]++;
}
table();
cout << fixed << setprecision(12) << dp[t[1]][t[2]][t[3] % 2];
return 0;
}
| /*------------------RandomStuff------------------*/
// Author: CNH_Tourist
// Date: 30/08/2020
// Time: 15:26:22
/*-----------------------------------------------*/
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unrolled-loops")
using namespace std;
/*---------------------Define--------------------*/
#define filename "TestCode"
#define pi acos(-1)
#define endl '\n'
#define X first
#define Y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ll long long
#define ull unsigned long long
#define hash OoOoO
#define gcd __gcd
#define y1 FlyingTuna
/*-----------------------------------------------*/
const long long mod = 1e9+7;
const long long mod2 = 1e9+9;
const long long INF = 1e15;
const long long oo = 2e18+7;
const long long base = 31;
const double eps = 1e-8;
int test=1;
/*-----------------------------------------------*/
void FlyingTuna()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
/*
ifstream *fi = new ifstream (filename".inp");
ofstream *fo = new ofstream (filename".out");
if(*fi)
{
cin.rdbuf( fi->rdbuf() );
cout.rdbuf( fo->rdbuf() );
}
*/
}
/*-------------------Global----------------------*/
int n;
ll d[100010];
ll f[100010], a[17][17];
/*------------------Functions--------------------*/
/*-----------------------------------------------*/
void In()
{
cin >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
cin >> a[i][j];
}
void Solve()
{
In();
for(int mask = 1; mask < 1 << n; mask ++)
{
for(int i = 0; i < n; i ++)
for(int j = i + 1; j < n; j++)
if((1 & (mask >> i)) == 1 && (1 & (mask >> j)) == 1)
d[mask] += a[i+1][j+1];
}
for(int mask = 1; mask < 1 << n; mask ++)
{
f[mask] = max(f[mask], d[mask]);
for(int i = mask; i > 0; i =((i-1)&mask))
f[mask] = max(f[mask], f[i] + d[i^mask]);
}
int t = (1 << n) - 1;
cout << f[t];
}
int32_t main()
{
FlyingTuna();
//cin>>test;while(test--)
Solve();
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c) for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define mp make_pair
#define pb push_back
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }
const double INF = 1000000000;
const ll MOD = 1000000007LL;
const double EPS = 1E-12;
template<typename T> T add(T x, T y){ if(abs(x+y) < EPS*(abs(x)+abs(y))) return 0; return x + y; }
template<typename T> inline bool semieq(T x, T y){ return abs(x - y) < EPS; }
template<typename T> inline bool semige(T x, T y){ return y - x < -EPS; }
template<typename T> inline bool semile(T x, T y){ return x - y < -EPS; }
const int MAX_N = 10;
const int n = MAX_N;
double x[MAX_N+1];
double v[2];
int main()
{
while(~scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf", &x[0], &x[1], &x[2], &x[3], &x[4], &x[5], &x[6], &x[7], &x[8], &x[9], &v[0], &v[1])){
double len = 0.0;
rep(i, n) len += x[i];
double left = 0.0;
double right = INF;
double t;
while(semile(left, right)){
t = (left + right) / 2.0;
if((v[0] + v[1]) * t > len) right = t;
else left = t;
}
rep(i, n-1) x[i+1] += x[i];
cout << upper_bound(x, x+n, v[0] * t) - x + 1<< endl;
}
return 0;
} | // 2016-12-03
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int m, min, max, n;
int p[200];
while (cin >> m >> min >> max, m) {
for (int i = 0; i < m; i++) {
cin >> p[i];
}
n = min - 1;
for (int i = min; i < max; i++) {
if (p[i] - p[i + 1] >= p[n] - p[n + 1]) {
n = i;
}
}
cout << n + 1 << endl;
}
return 0;
} | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 300000
int n, pm, pe, pj;
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
while(n-- > 0) {
scanf("%d %d %d", &pm, &pe, &pj);
if(max(pm, max(pe, pj)) == 100 || pm + pe >= 180 || pm + pe + pj >= 240)
puts("A");
else if(pm + pe + pj >= 210 || pm + pe + pj >= 150 && max(pm, pe) >= 80)
puts("B");
else
puts("C");
}
}
} |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cassert>
using namespace std;
bool solve(){
int n;
cin>> n;
if(!n) return false;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>> a[i];
}
string str;
cin>> str;
for(int i=0;i<str.size();i++){
int k = a[i%n];
k %= 52;
char c = str[i];
if(k>26){
if(islower(c)){
c = toupper(c);
}else{
c = tolower(c);
}
k -= 26;
}
if(islower(c)){
if(islower(c-k)){
c -= k;
}else{
k -= c - 'a';
c = 'Z' - (k - 1);
}
}else if(isupper(c)){
if(isupper(c-k)){
c -= k;
}else{
k -= c - 'A';
c = 'z' - (k - 1);
}
}
cout<< c;
}
cout<< endl;
return true;
}
int main(){
cout.setf(ios::fixed);
cout.precision(10);
while(solve()){}
return 0;
}
| 0 |
#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MN 21001
#define int long long
using namespace std;
int read_p,read_ca;
inline int read(){
read_p=0;read_ca=getchar();
while(read_ca<'0'||read_ca>'9') read_ca=getchar();
while(read_ca>='0'&&read_ca<='9') read_p=read_p*10+read_ca-48,read_ca=getchar();
return read_p;
}
const int MOD=1e9+7;
int n,a[MN],B[MN],x,mmh=0,mm[20][20][2][2];
inline int M(int x){return x<0?x+10:x;}
inline void work(int p,int n,int a,int b){
if (mm[p][n][a][b]!=-1) {mmh+=mm[p][n][a][b];return;}
int u=mmh;
if (p+p-1==n){
if (a==0&&b==0) mmh+=10*(B[p]==0);else
if (a==1&&b==1) mmh+=10*(B[p]==9);
return;
}
if (p+p-1>n){
mmh+=a==b;
return;
}
for (int i=p==1;i<=9;i++)
for (int j=0;j<=9;j++)
if (M(i-j-b)==B[p]&&(a==(j<i)||j==i)&&(M(j-i)==B[n+1-p]||M(j-1-i)==B[n+1-p])){
if (a){
if (j==i&&B[n+1-p]==0) continue;
work(p+1,n,M(j-1-i)==B[n+1-p],i-b-j<0);
}else{
if (j==i&&B[n+1-p]==9) continue;
work(p+1,n,M(j-1-i)==B[n+1-p],i-b-j<0);
}
}
mm[p][n][a][b]=mmh-u;
}
signed main(){
int i,j,k;
x=n=read();
if (n%9) return puts("0"),0;
for (k=1;k<=10&&x;k++) B[k]=x%10,x/=10;k--;
for (int i=k;i<=18;i++) memset(mm,-1,sizeof(mm)),work(1,i,0,0);
printf("%lld\n",mmh);
}
| #include <iostream>
#include <string>
using namespace std;
int getvalue(char c){
if(c == 'I'){
return 1;
}else if(c == 'V'){
return 5;
}else if(c == 'X'){
return 10;
}else if(c == 'L'){
return 50;
}else if(c == 'C'){
return 100;
}else if(c == 'D'){
return 500;
}else if(c == 'M'){
return 1000;
}
return -1;
}
int parseStr(string str){
int ret=0;
int now;
int next;
for(int i=0;i<str.size();i++){
now = getvalue(str[i]);
if(i != str.size() - 1){
next = getvalue(str[i+1]);
}else{
next = -1;
}
if(now >= next){
ret += now;
}else{
ret += next - now;
i++;
}
}
return ret;
}
int main(void){
string tmp;
while(cin >> tmp){
cout << parseStr(tmp) << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int n; std::cin >> n;
bool used[1000000] = {};
std::vector<int> ans;
for (int i = 2; i <= 55555; i++) {
if (used[i]) continue;
if (i % 5 == 1) ans.push_back(i);
int w = i;
while (w <= 555555) {
used[w] = true;
w += i;
}
}
for (int i = 0; i < n; i++) std::cout << ans[i] << " \n"[i == n - 1];
return 0;
}
| #include<stdio.h>
int main()
{
int i,j,n;
const int N=10001;
bool p[N];
for(i=2;i<N;++i)p[i]=true;
for(i=2;i<=N/2;++i)if(p[i])for(j=2*i;j<N;j+=i)p[j]=false;
while(scanf("%d",&n),n){for(i=n;;--i)if(p[i]&&p[i-2])break;printf("%d %d\n",i-2,i);}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> v(n);
for (size_t i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
v[l-1]++;
v[r]--;
}
int ans = 0, num = 0;
for (size_t i = 0; i < n; i++) {
num += v[i];
if (num == m) ans++;
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std ;
int main() {
int N , M ;
cin >> N >> M ;
int max_L = 0 ;
int min_R = 5+ 10e5 ;
for(int i = 0 ; i < M ; i++ ){
int L , R ;
cin >> L >> R ;
max_L = max(max_L , L);
min_R = min(min_R , R);
}
min_R++ ;
if(min_R > max_L){
cout << min_R - max_L << endl ;
}
else{
cout << 0 << endl ;
}
} | 1 |
#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
if(Bufferhead==Buffertail){
int l=fread(buffer,1,BufferSize,stdin);
if(!l){Terminal=1;return 0;}
Buffertail=(Bufferhead=buffer)+l;
}
return *Bufferhead++;
}
template<class T>inline bool read(T &x){
x=0;char c=Getchar(),rev=0;
while(c<'0'||c>'9'){c=Getchar();rev|=c=='-';if(Terminal)return 0;}
while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
if(c=='.'){
c=Getchar();double t=0.1;
while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
}
x=rev?-x:x;
return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
char c=Getchar();
while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
while(c>=33&&c<=126) (*x++)=c,c=Getchar();
*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
if(!x){putchar('0');putchar(c);return;}
if(x<0) putchar('-'),x=-x;
int m=0,a[20];
while(x) a[m++]=x%10,x/=10;
while(m--) putchar(a[m]+'0');
putchar(c);
}
//--------------------------------------------------head--------------------------------------------------
const int inf=0x3f3f3f3f;
const int N=1000005,M=100005,mod=998244353;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
int ans=1;
while(y){
if(y&1) ans=(ll)ans*x%mod;
x=(ll)x*x%mod;y>>=1;
}return ans;
}
int n,m,fac[N],ifac[N];
int main(){
#ifdef rqgao2014
freopen("input.txt","r",stdin);
#endif
n=1000000;fac[0]=1;
for(int i=1;i<=n;i++) fac[i]=(ll)fac[i-1]*i%mod;
ifac[n]=exp(fac[n],mod-2);
for(int i=n;i;i--) ifac[i-1]=(ll)ifac[i]*i%mod;
read(n,m);
int ans=0;
for(int i=1;i<=min(n,m);i++)
ch(ans,(ll)ifac[i]*ifac[i]%mod*ifac[n-i]%mod*ifac[m-i]%mod*fac[i*2-1]%mod*fac[n+m-2*i]%mod*i);
ans=(ll)ans*fac[n]%mod*fac[m]%mod*ifac[n+m]%mod;
ch(ans,max(n,m));
print(ans);
return 0;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(j, m) for (int j = 0; j <= (int)(m); j++)
int main()
{
int d;
ll g;
vector<ll> p, c;
cin >> d >> g;
p.resize(d);
c.resize(d);
rep(i, d)
{
cin >> p[i] >> c[i];
}
ll res = 1 << 29;
for (int bit = 0; bit < (1 << d); ++bit)
{
ll sum = 0;
ll num = 0;
rep(i, d)
{
if (bit & (1 << i))
{
sum += c[i] + p[i] * 100 * (i + 1);
num += p[i];
}
}
if (sum >= g)
{
res = min(res, num);
}
else
{
for (int i = d - 1; i >= 0; i--)
{
if (bit & (1 << i))
{
continue;
}
rep(j, p[i])
{
if (sum >= g)
{
break;
}
sum += 100 * (i+1);
num++;
}
}
res = min(res, num);
}
}
cout << res << endl;
} | 0 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
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;}
int main(){
int k, x; cin >> k >> x;
int pos=max(x-k+1, -1000000);
while(pos <= 1000000 && pos <= x+k-1){
cout << pos << " ";
pos++;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int K, X;
cin >> K >> X;
int min_P, max_P;
min_P = X-K+1;
max_P = X+K-1;
FOR(i, min_P, max_P){
cout << i << " ";
}
cout << "\n";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
static const int INF = 99999;
int main(){
int n,array[100][100];
cin>>n;
for(int i=0; i<n; i++){
fill(array[i],array[i]+n,INF);
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
int tmp;
cin>>tmp;
if(tmp!=-1) array[i][j]=tmp;
}
}
int ans=INF;
for(int k=0; k<n; k++){
bool flag[100];
fill(flag,flag+n,false);
flag[k]=true;
int tmp=0;
while(1){
int u=-1,minv=INF;
for(int i=0; i<n; i++){
if(!flag[i]) continue;
for(int j=0; j<n; j++){
if(!flag[j] && array[i][j]<=minv){
minv = array[i][j];
u = j;
}
}
}
if(minv==INF){
break;
}else{
tmp += minv;
flag[u]=true;
}
}
ans = min(ans,tmp);
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<double>; using vvd = vector<vd>;
#define REP(i,n) for(auto i = 0 * n; i < (n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define FOR(i,s,e) for (ll i = s; i < (ll)e; i++)
#define TEN(x) ((ll)1e##x)
class UnionFind {
typedef size_t U;
vector<int32_t> v;
public:
UnionFind(U n) : v(n, -1) {}
U find(U x) { return v[x] < 0 ? x : (v[x] = find((U)v[x])); }
bool same(U x, U y) { return find(x) == find(y); }
U size(U x) { return (U)-v[find(x)]; }
void unite(U x, U y) {
x = find(x); y = find(y);
if (x != y) {
if (-v[x] < -v[y]) swap(x, y);
v[x] += v[y];
v[y] = x;
}
}
};
struct Edge{ uint32_t to, id; };
typedef vector<vector<Edge>> Graph;
template<class T> struct Kruskal{
typedef uint32_t U;
template<class V> Kruskal(U n, const V & u, const V & v, const vector<T> & w) : g(n) {
vector<U> es(w.size());
iota(es.begin(), es.end(), 0);
sort(es.begin(), es.end(), [&](U i, U j) { return w[i] < w[j]; });
UnionFind uf(n);
for (U i : es) {
if (!uf.same(u[i], v[i])) {
uf.unite(u[i], v[i]); cost += w[i];
g[u[i]].push_back({ (U)v[i], i }); g[v[i]].push_back({ (U)u[i], i });
}
}
}
Graph g; T cost = 0;
};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(50);
ll n; cin >> n;
vl u, v, w;
REP(i, n) REP(j, n) {
ll x; cin >> x;
if (x != -1) {
u.push_back(i);
v.push_back(j);
w.push_back(x);
}
}
Kruskal<ll> mst(n, u, v, w);
cout << mst.cost << endl;
} | 1 |
#include<bits/stdc++.h>
#define MN 600
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
pair<int,int> q[MN+5];
int n,d,D,s[MN+5][MN+5],vis[MN+5][MN+5],num[4],top;
void Mark(int x,int y,int c,int S)
{
if(S) s[x][y]|=c;vis[x][y]=1;
for(int j=1;j<=top;++j)
for(int dx=-1;dx<=1;dx+=2) for(int dy=-1;dy<=1;dy+=2)
{
int nx=x+dx*q[j].first,ny=y+dy*q[j].second;
if(nx>0&&ny>0&&nx<=n<<1&&ny<=n<<1&&!vis[nx][ny]) Mark(nx,ny,c,S^1);
}
}
void Solve(int d,int c)
{
top=0;
for(int i=0;i*i<=d;++i)
{
int j=d-i*i,flag=-1;
for(int k=0;k*k<=j;++k) if(k*k==j) flag=k;
if(flag>=0) q[++top]=make_pair(i,flag);
}
memset(vis,0,sizeof(vis));
for(int i=1;i<=n<<1;++i) for(int j=1;j<=n<<1;++j) if(!vis[i][j]) Mark(i,j,c,0);
}
int main()
{
n=read();d=read();D=read();
Solve(d,1);Solve(D,2);
for(int i=1;i<=n<<1;++i) for(int j=1;j<=n<<1;++j) ++num[s[i][j]];
for(int k=0;k<4;++k) if(num[k]>=n*n)
{
int left=n*n;
for(int i=1;i<=n<<1;++i) for(int j=1;j<=n<<1;++j)
if(s[i][j]==k&&left) --left,printf("%d %d\n",i-1,j-1);
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
string f, e;
cout << 0 << endl;
cin >> f;
if( f == "Vacant" ) return 0;
cout << N - 1 << endl;
cin >> e;
if( e == "Vacant" ) return 0;
int l = 0;
int r = N - 1;
while( r - l > 1 ) {
int m = (l + r) / 2;
string now;
cout << m << endl;
cin >> now;
if( now == "Vacant" ) return 0;
int s = r - m;
if( s % 2 == 0 && now != e || s % 2 && now == e ) {
l = m;
f = now;
}
else {
r = m;
e = now;
}
}
}
| 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 10005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 +c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
const int MOD = 1000000007;
int N,M,s[2],l[2];
int inc(int a,int b) {
return a + b >= MOD ? a + b - MOD : a + b;
}
int mul(int a,int b) {
return 1LL * a * b % MOD;
}
void update(int &x,int y) {
x = inc(x,y);
}
void Solve() {
read(N);read(M);
int x;
for(int i = 1 ; i <= N ; ++i) {
read(x);
x = (x + MOD) % MOD;
update(l[0],inc(mul(i - 1,x),MOD - s[0]));
update(s[0],x);
}
int y;
for(int i = 1 ; i <= M ; ++i) {
read(y);
y = (y + MOD) % MOD;
update(l[1],inc(mul(i - 1,y),MOD - s[1]));
update(s[1],y);
}
out(mul(l[0],l[1]));
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
}
| #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
string s; cin >> s;
vector<ll> num(26,0);
ll ans = 0;
rep(i,s.size()){
for(char c = 'a'; c<='z'; c++){
if(c == s[i]) num[c - 'a']++;
}
}
rep(i,26) ans += (num[i]*(num[i]-1))/2;
cout << (s.size()*(s.size()-1))/2 - ans + 1 << endl;
} | 0 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll modpow(ll x, ll n){
ll res = 1;
ll mul = x;
while(n){
if(n % 2) res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
struct Combination
{
int maxn;
vector<ll> fmemo;
vector<ll> imemo;
vector<ll> ifmemo;
Combination(int maxn) : maxn(maxn){
fmemo.resize(maxn + 1);
imemo.resize(maxn + 1);
ifmemo.resize(maxn + 1);
for(ll i = 1; i <= maxn; i++){
imemo[i] = modpow(i, MOD - 2);
}
}
ll fact(ll n){
if(n == 0) return 1;
if(fmemo[n]) return fmemo[n];
return fmemo[n] = n * fact(n - 1) % MOD;
}
ll ifact(ll n){
if(n == 0) return 1;
if(ifmemo[n]) return ifmemo[n];
return ifmemo[n] = imemo[n] * ifact(n - 1) % MOD;
}
ll com(ll n, ll k){
if(k > n || k < 0) return 0;
if(k == n || k == 0) return 1;
return (fact(n) * ifact(k) % MOD) * ifact(n - k) % MOD;
}
};
ll dp[305][305][305];
int main()
{
string s;
cin >> s;
int n = s.size();
int d[305];
int m = 0;
int c = 0;
for(int i = 0; i < n; i++){
if(s[i] == '0'){
d[m] = c;
m++;
c = 0;
}
else c++;
}
d[m] = c;
m++;
int b[305];
b[m] = 0;
for(int i = m - 1; i >= 0; i--) b[i] = b[i + 1] + d[i];
int p;
cin >> p;
dp[m - 1][0][d[m - 1]] = 1;
for(int i = m - 1; i > 0; i--){
for(int j = 0; j <= min(p, b[i]); j++){
for(int k = d[i - 1]; k <= b[i - 1]; k++){
for(int l = max(d[i], k - d[i - 1]); l <= b[i - 1]; l++){
if(k - d[i - 1] < l - d[i]) dp[i - 1][j][k] = (dp[i - 1][j][k] + dp[i][j][l]) % MOD;
else dp[i - 1][j + (k - d[i - 1]) - (l - d[i])][k] = (dp[i - 1][j + (k - d[i - 1]) - (l - d[i])][k] + dp[i][j][l]) % MOD;
}
}
}
}
ll ans = 0;
for(int j = 0; j <= min(p, 300); j++){
for(int k = 0; k <= 300; k++) ans = (ans + dp[0][j][k]) % MOD;
}
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 998244353LL
#define llMAX 9223372036854775807LL
#define llMIN -9223372036854775808LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n,x,y,K_;
int main(){
ll ans=0;
string s;cin>>s;
cin >> K_;
n=s.length();
ll zn=0;
for(ll i=0;i<n;i++){
if (s[i]=='0')zn++;
}
ll nn=n-zn;//1の数
K_=min(K_,nn);
if ((n==zn)|(zn==0)|(K_==0)){
cout<<1<<endl;
return 0;
}
zn++;
vvi zrange(zn, vi(2));//0からみて左に1が今何個減らせるか、最大何個まで増やせるか
ll znw=zn-1;
ll totalone=0;
s+="0";
for(ll i=n;i>=0;i--){
if (s[i]=='0')
{
zrange[znw][1]=totalone;
for(;;)
{
i--;
if (i==-1)break;
if (s[i]=='1'){
zrange[znw][0]++;
totalone++;
}else{i++;break;}
}
znw--;
}else{
totalone++;
}
}
/*
for(ll i=0;i<zn;i++){
cout<<zrange[i][0]<<" "<<zrange[i][1]<<endl;
}
*/
/*
for(ll i=0;i<zn;i++){
zrange[i][1]+=zrange[i][0];
}
*/
vi dp(nn+1,0);
vi dp_n(nn+1,0);
vvi score(nn+1, vi(K_*2+1,0));
vvi score_n(nn+1, vi(K_*2+1,0));
dp[0]=1;
score[0][0]=1;
for(ll i=0;i<zn;i++){//さいがいループ、0の左に何個つけられるか
for(ll j=0;j<nn+1;j++){
dp_n[j]=0;
for(ll k=max(j-zrange[i][1],0LL);k<=min(j+zrange[i][0],nn);k++){
dp_n[j]+=dp[k];
for(ll l=0;l+abs(j-k)<K_*2+1;l++){
score_n[j][l+abs(j-k)]+=score[k][l];
score_n[j][l+abs(j-k)]%=MOD;
}
}
dp_n[j]%=MOD;
}
/*
for(ll j=0;j<nn+1;j++){
dp[j]=dp_n[j];
dp_n[j]=0;
}
*/
dp.swap(dp_n);
for(ll j=0;j<nn+1;j++){
for(ll k=0;k<K_*2+1;k++){
score[j][k]=score_n[j][k];
score_n[j][k]=0;
}
}
//score.swap(score_n);
}
//cout<<dp[0]<<endl;
for(ll i=0;i<K_*2+1;i++){
//cout<<score[0][i]<<endl;
ans+=score[0][i];
ans%=MOD;
}
cout<<ans<<endl;
return 0;
} | 1 |
#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;
}
}
struct edge {
ll to, cost;
};
int main() {
int N, M, X, Y; cin >> N >> M >> X >> Y;
vector<int> x(N); REP(i, N) cin >> x[i];
vector<int> y(M); REP(i, M) cin >> y[i];
sort(all(x)); sort(all(y));
string ans = "War";
for(int i = X + 1; i <= Y; ++i) {
if(x[N - 1] < i && i <= y[0]) ans = "No War";
}
cout << ans << endl;
} | # include <bits/stdc++.h>
using namespace std ;
bool is_war ( const vector <int >& x , const vector <int >& y ) {
for ( int Z = -100; Z <= 100; ++ Z ) {
bool is_ok = true ;
for ( int i = 0; i < x . size (); ++ i ) {
if ( x [ i ] >= Z ) is_ok = false ;
}
for ( int i = 0; i < y . size (); ++ i ) {
if ( y [ i ] < Z ) is_ok = false ;
}
if ( is_ok ) return false ;
}
return true ;
}
int main () {
int N , M ; cin >> N >> M ;
vector <int > x ( N +1) , y ( M +1);
cin >> x [0] >> y [0];
for ( int i = 0; i < N ; ++ i ) {
cin >> x [ i +1];
}
for ( int i = 0; i < M ; ++ i ) {
cin >> y [ i +1];
}
if ( is_war (x , y )) {
cout << " War " << endl ;
}
else {
cout << "No War " << endl ;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1e9+7;
int main() {
int n;
cin >> n;
vector<int64_t>arr(n);
for(auto & i : arr)
cin >> i;
vector<int64_t>sufsum;
sufsum.push_back(0);
for(int i = n-1; i > 0; --i){
auto a = sufsum.back();
a+=arr[i];
sufsum.push_back(a);
}
reverse(sufsum.begin(),sufsum.end());
int64_t ans = 0;
for(int i = 0 ; i < n; ++i){
ans+=(arr[i]*(sufsum[i]%mod));
ans%=mod;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1e9+7;
int main(){
ll n;
scanf("%lld",&n);
ll a[n+1];
ll sum=0;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
sum=(sum+a[i])%mod;
}
ll ans=0;
for(int i=1;i<n;i++){
sum=(sum+mod-a[i])%mod;
ans=(ans+a[i]*sum)%mod;
}
cout<<ans%mod<<endl;
} | 1 |
#include <iostream>
#include <string>
using namespace std;
class BNode{
public:
int value;
BNode *right,*left;
};
class BTree{
BNode *root;
void Inorder(BNode *cur){
if(cur){
Inorder(cur->left);
cout << " " << cur->value;
Inorder(cur->right);
}
}
void Preorder(BNode *cur){
if(cur){
cout << " " << cur->value;
Preorder(cur->left);
Preorder(cur->right);
}
}
public:
BTree(){
root = NULL;
}
void Insert(int v){
BNode *cur = root;
BNode *prt = NULL;
BNode *node = new BNode();
node->value = v;
while(cur){
prt = cur;
if(cur->value < v){
cur = cur->right;
}else{
cur = cur->left;
}
}
if(prt){
if(prt->value > v){
prt->left = node;
}else{
prt->right = node;
}
}
if(!root){
root = node;
}
}
void PrintInorder(){
Inorder(root);
cout<<endl;
}
void PrintPreorder(){
Preorder(root);
cout<<endl;
}
void Find(int v){
BNode *cur = root;
while(cur){
if(cur->value == v){
cout<<"yes"<<endl;
return;
}else if(cur->value > v){
cur = cur->left;
}else{
cur = cur->right;
}
}
cout<<"no"<<endl;
}
BNode* Next(BNode *cur){
cur = cur->right;
while(cur->left){
cur = cur->left;
}
return cur;
}
void Delete(int v){
BNode *cur = root;
BNode *prt = NULL;
while(cur){
if(cur->value == v){
if(cur->left==NULL && cur->right==NULL){
if(prt){
if(prt->value > v){
prt->left = NULL;
}else{
prt->right = NULL;
}
}else{
root = NULL;
}
}else if(cur->left!=NULL && cur->right==NULL){
if(prt){
if(prt->value > v){
prt->left = cur->left;
}else{
prt->right = cur->left;
}
}else{
root = cur->left;
}
}else if(cur->left==NULL && cur->right!=NULL){
if(prt){
if(prt->value > v){
prt->left = cur->right;
}else{
prt->right = cur->right;
}
}else{
root = cur->right;
}
}else{
int temp = Next(cur)->value;
Delete(temp);
cur->value = temp;
}
return;
}else if(cur->value > v){
prt = cur;
cur = cur->left;
}else{
prt = cur;
cur = cur->right;
}
}
}
};
int main() {
BTree bt;
int m, v;
string com;
cin>>m;
for(int i=0;i<m;++i){
cin>>com;
if(com=="insert"){
cin>>v;
bt.Insert(v);
}else if(com=="print"){
bt.PrintInorder();
bt.PrintPreorder();
}else if(com=="find"){
cin>>v;
bt.Find(v);
}else if(com=="delete"){
cin>>v;
bt.Delete(v);
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
const string v = "Vacant";
const string m = "Male";
const string f = "Female";
int main(){
int n;
cin >> n;
cout << 0 << endl;
string sl;
cin >> sl;
if(sl == v) return 0;
string sr;
cout << n-1 << endl;
cin >> sr;
if(sr == v) return 0;
int l = 0, r = n-1;
rep(i, 20){
int m = (l+r)/2;
cerr << l << " " << m << " " << r << endl;
int dl = m - l, dr = r - m;
cout << m << endl;
string sm;
cin >> sm;
if(sm == v) return 0;
if(dl % 2 == 0){
if(sl == sm){
l = m;
}else{
sr = sm;
r = m;
}
}else{
if(sl != sm){
sl = sm;
l = m;
}else{
sr = sm;
r = m;
}
}
}
return 1;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, g;
cin >> r;
cin >> g;
cout << g - r + g << endl;
} | #include <iostream>
#include<set>
#include<vector>
#include<string>
#include<iterator>
#include<iomanip>
#include<cmath>
#include<map>
#include<string.h>
#include<algorithm>
using namespace std;
void ll(){
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(0);
}
int main() {
ll();
int x, y,ave=0;
cin >> x >> y;
ave = (2 * y) - x;
cout << ave << endl;
} | 1 |
//
// Created by Koki Igarashi on 7/28/20.
//
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<pii, Int> ppi;
typedef pair<double, Int> pdp;
typedef vector<Int> veci;
typedef vector<double> vecd;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<double> vecd;
typedef vector<pii> vecpii;
typedef vector<ppi> vecppi;
typedef vector<veci> mati;
typedef vector<vecll> matll;
typedef vector<vecd> matd;
#define PB(x) push_back(x)
#define EB(x) emplace_back(x)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (x).size()
#define CLR(x) memset(x,0,sizeof x)
#define pdebug() printf("%d\n",__LINE__)
#define REP(i, a, b) for(int i = (a);i <= (b);i++)
#define FORO(i, n) REP(i,0,(int)n-1)
#define FORI(i, n) REP(i,1,(int)n)
#define FORIT(i, t) for(auto i = t.begin();i != t.end();i++)
#define eps 1e-6
#define sqr(x) ((x)*(x))
#define dist(_a, _b) sqrt(sqr(_a.A-_b.A)+sqr(_a.B-_b.B))
#define norm(_a) sqrt(sqr(_a.A)+sqr(_a.B))
#define DEBUG 1
#if DEBUG
#define DUMP(a) do { std::cout << #a " = " << (a) << ", "; } while(false)
#define DUMPLN(a) do { std::cout << #a " = " << (a) << std::endl; } while(false)
#else
#define DUMP(a)
#define DUMPLN(a)
#endif
template<typename T, typename U>
inline void getMin(T &a, U b) { if (a > b) a = b; }
template<typename T, typename U>
inline void getMax(T &a, U b) { if (a < b) a = b; }
template<typename T>
vector<T> getVector(const int n) { return vector<T>(n); }
template<typename T>
vector<T> getVector(const int n, const T a) { return vector<T>(n, a); }
template<typename T>
vector<T> getEmptyVector() { return vector<T>(); }
template<typename T>
void appendAll(vector<T> &a, vector<T> b) { a.insert(a.end(), b.begin(), b.end()); }
// #define X first
// #define Y second
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
const ll MOD = 1000000007;
const int MAXN = 1 << 17;
const int inf = 1 << 20;
const int NIL = -inf;
int popcount(int x) { return __builtin_popcount(x); }
int N;
mati A;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
A.resize(N);
FORO(i, N) {
A[i].resize(N - 1);
FORO(j, N - 1) {
cin >> A[i][j];
}
}
veci idx(N);
int day = 0;
int gcnt = 0;
while(gcnt < N * (N - 1) / 2) {
day++;
veci used(N);
bool no_game = true;
for(int i = 0;i < N;i++) {
if(used[i] || idx[i] == N - 1) continue;
int opp = A[i][idx[i]] - 1;
if(used[opp]) continue;
if(A[opp][idx[opp]] == i + 1) {
idx[opp]++;
idx[i]++;
used[i] = used[opp] = 1;
gcnt++;
no_game = false;
}
}
if(no_game) break;
}
cout << (gcnt == N * (N - 1) / 2 ? day : -1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#define EACH(value, var) for (auto value : var)
#define SORT(var) sort(var.begin(), var.end())
#define REVERSE(var) reverse(var.begin(), var.end())
#define RSORT(var) SORT(var); REVERSE(var)
#define OPTIMIZE_STDIO ios::sync_with_stdio(false); cin.tie(0); cout.precision(10); cout << fixed
#define endl '\n'
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using P = pair<int, int>;
void solve(istream& cin, ostream& cout) {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
REP(i, n) {
REP(j, n - 1) {
cin >> a[i][j];
a[i][j]--;
}
REVERSE(a[i]);
}
vector<P> que;
auto check = [&](int i) {
if (a[i].size() == 0) return;
int j = a[i].back();
if (a[j].back() == i) {
if (i > j) que.push_back(P(j, i));
else
que.push_back(P(i, j));
}
};
REP(i, n) {
check(i);
}
int day = 0;
while (que.size() > 0) {
day++;
SORT(que);
que.erase(unique(que.begin(), que.end()), que.end());
vector<P> prevQ;
swap(prevQ, que);
EACH(p, prevQ) {
int i = p.first;
int j = p.second;
a[i].pop_back();
a[j].pop_back();
}
EACH(p, prevQ) {
int i = p.first;
int j = p.second;
check(i);
check(j);
}
}
REP(i, n) {
if (a[i].size() != 0) {
cout << -1 << endl;
return;
}
}
cout << day << endl;
}
#ifndef TEST
int main() {
OPTIMIZE_STDIO;
solve(cin, cout);
return 0;
}
#endif
| 1 |
#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <string.h>
using namespace std;
static const int INF = 1e9;
static const int SIZE = 10001;
typedef pair<int, int> P;
struct edge
{
int to;
int cost;
};
bool isUsed[SIZE];
vector<edge> G[SIZE];
void solve()
{
int V, E;
cin >> V >> E;
for (int i = 0; i < E; ++i)
{
int from, to, cost;
cin >> from >> to >> cost;
edge e1, e2;
e1.to = to;
e1.cost = cost;
e2.to = from;
e2.cost = cost;
G[from].push_back(e1);
G[to].push_back(e2);
}
memset(isUsed, 0, sizeof(isUsed));
int ans = 0;
priority_queue<P, vector<P>, greater<P> > pque;
pque.push(P(0, 0));
while (!pque.empty())
{
P p = pque.top();
pque.pop();
int v = p.second;
if (isUsed[v])
{
continue;
}
isUsed[v] = true;
ans += p.first;
for (int i = 0; i < G[v].size(); ++i)
{
edge e = G[v][i];
pque.push(P(e.cost, e.to));
}
}
cout << ans << endl;
}
int main()
{
solve();
return(0);
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include<stdio.h>
#include <map>
using namespace std;
int uni[100100];
int oya(int a){
if (uni[a]<0){
return a;
}
else{
uni[a]=oya(uni[a]);
return oya(uni[a]);
}
}
bool ren(int a,int b){
a=oya(a);
b=oya(b);
if(a==b){
return false;
}
else{
return true;
}
}
int main() {
int co=0;
vector <pair<int, int> > be;
int e,v;
cin>>v>>e;
for(int y=0;y<v;y++){
uni[y]=-1;
}
for(int u=0;u<e;u++){
int z,x,c;
cin>>z>>x>>c;
be.push_back(pair<int, int>(c,z*100100+x));
}
sort(be.begin(), be.end());
for(int y=0;y<e;y++){
int z,x,c;
c=be[y].first;
z=(be[y].second)/100100;
x=(be[y].second)%100100;
if(ren(z,x)==true){
co=co+c;
uni[oya(z)]=x;
}
}
cout<<co<<endl;
return 0;
} | 1 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
ll mod=1e9+7;
double eps=1e-7;
ll exp(ll x,ll y){if(y<0) return 0; ll ret=1;for(;y;y>>=1,x=(x*x)%mod){if(y&1)ret=(ret*x)%mod;}return ret;}
ull pexp(ull x,ull y){if(y<0) return 0; ull ret=1; for(;y;y>>=1,x=(x*x)){if(y&1)ret=(ret*x);}return ret;}
ll gcd(ll x,ll y){if(!x||!y) return x+y; return x%y==0?y:gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll bsum(ll u,ll b){ll ret=0;if(u<b)return u;while(u){ret+=u%b;u/=b;}return ret;}
ll prival(ll u,ll p){ll cn=0;while(u%p==0){cn++;u=u/p;}return cn;}
ll minv(ll a,ll b){return 1<a?b-minv(b%a,a)*b/a:1;}
ll extm(ll a,ll b){ll ret=0;while(a!=0){if(a%2==1){ret+=b;ret%=mod;}a>>=1;b=(2*b)%mod;}return ret;}
ll eaphi(ll x){ll t=x,ret=x,i;for(i=2;i*i<=x;i++){if(t%i==0){ret-=ret/i;while(t%i==0) t/=i;}}if(t!=1) ret-=ret/t;return ret;}
ll eadivc(ll x){ll ret=0;ll i;for(i=1;i*i<=x;i++){if(x%i==0 && i*i!=x) ret+=2;if(x%i==0 && i*i==x) ret+=1;}return ret;}
ll eadivs(ll x){ll ret=0;ll i;for(i=1;i*i<=x;i++){if(x%i==0 && i*i!=x) ret+=i+x/i;if(x%i==0 && i*i==x) ret+=i;}return ret;}
ll ndig(ll x, ll b){ll ret=0;while(x){x/=b; ret++;}return ret;}
ll rev(ll n, ll b){ll ret=0;while(n){ret=b*ret+n%b; n/=b;}return ret;}
ll sq(ll x){ll t=(ll)sqrt(x); for(ll i=t-2 ; i<=t+2 ; i++) if(i*i==x) return abs(i); return -1;}
ll extexp(ll x,ll y){if(y<0) return 0; ll ret=1;for(;y;y>>=1,x=extm(x,x)){if(y&1)ret=extm(ret,x);}return ret;}
bool isprime(ll x){if(x<=1) return false; for(ll i=2;i*i<=x;i++){if(x%i==0){return false;}}return true;}
ll n, k, T, x, y, cnt;
ll vv[55];
int main(void)
{
cin>>k; n=50; T=k/n; ll i;
x=T+2*n-k%n; y=x-n-1;
for(i=1 ; i<=k%n ; i++) vv[i]=x;
for(i=k%n+1 ; i<=n ; i++) vv[i]=y;
cout<<n<<"\n";
for(i=1 ; i<=n ; i++) cout<<vv[i]<<" ";
return 0;
}
// 제출하기 전에 생각햇나요?
// it may be easier/harder than you think
// ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
bool check(long long a,long long b,long long c){
return true;
}
int main(){
string str;
cin >> str;
if(str.size()%2!=0){
cout << "No" << endl;
return 0;
}
for(int i=0; i<str.size()-1; i+=2){
if(str.at(i)=='h' && str.at(i+1)=='i'){
continue;
}
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int n, k, m;
set<int> t;
void ck(int* b) {
int s = 0;
for (int i = 0; i < k; i++) {
if (b[i] > 9)
s = s * 100 + b[i];
else
s = s * 10 + b[i];
}
if (t.find(s) == t.end()) {
t.insert(s);
m++;
}
}
int main()
{
cin >> n >> k;
while (n > 0 || k > 0) {
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
m = 0;
int i = (1 << k) - 1;
t.clear();
while (i < (1 << n)) {
vector<int> b;
for (int j = 0; j < n; j++) {
if((1 << j) & i)
b.push_back(j);
}
do {
vector<int> c;
for (int i = 0; i < k; i++)
c.push_back(a[b[i]]);
ck(&c[0]);
} while (next_permutation(b.begin(), b.end()));
int x = i & -i, y = i + x;
i = ((i & ~y) / x >> 1) | y;
}
cout << m << endl;
cin >> n >> k;
}
return 0;
}
| #include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define REP(i,s,e) for(int i=int(s);i<=int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)
int f(int n){
if(n==0) return 1;
else return 10*f(n-1);
}
int main(){
int n,k;
while(1){
cin >> n >> k;
if(n==0 && k==0) break;
vector<int>card(n);
rep(i,n) cin >> card[i];
if(k==2){
vector<int>u;
rep(i,n){
rep(j,n){
if(i!=j){
vector<int>v;
if(card[i]/10!=0) v.push_back(card[i]/10);
v.push_back(card[i]%10);
if(card[j]/10!=0) v.push_back(card[j]/10);
v.push_back(card[j]%10);
int s=v.size(); int p=0;
rep(i,s) p+=v[i]*f(s-1-i);
u.push_back(p);
v.clear();
}
}
}
sort(u.begin(),u.end());
vector<int>::iterator it=unique(u.begin(),u.end());
u.erase(it,u.end());
cout << u.size() << endl;
u.clear();
}
if(k==3){
vector<int>u;
rep(i,n){
rep(j,n){
rep(k,n){
if(i!=j && i!=k && j!=k){
vector<int>v;
if(card[i]/10!=0) v.push_back(card[i]/10);
v.push_back(card[i]%10);
if(card[j]/10!=0) v.push_back(card[j]/10);
v.push_back(card[j]%10);
if(card[k]/10!=0) v.push_back(card[k]/10);
v.push_back(card[k]%10);
int s=v.size(); int p=0;
rep(i,s) p+=v[i]*f(s-1-i);
u.push_back(p);
v.clear();
}
}
}
}
sort(u.begin(),u.end());
vector<int>::iterator it=unique(u.begin(),u.end());
u.erase(it,u.end());
cout << u.size() << endl;
u.clear();
}
if(k==4){
vector<int>u;
rep(i,n){
rep(j,n){
rep(k,n){
rep(l,n){
if(i!=j && i!=k && i!=l && j!=k && j!=l && k!=l){
vector<int>v;
if(card[i]/10!=0) v.push_back(card[i]/10);
v.push_back(card[i]%10);
if(card[j]/10!=0) v.push_back(card[j]/10);
v.push_back(card[j]%10);
if(card[k]/10!=0) v.push_back(card[k]/10);
v.push_back(card[k]%10);
if(card[l]/10!=0) v.push_back(card[l]/10);
v.push_back(card[l]%10);
int s=v.size(); int p=0;
rep(i,s) p+=v[i]*f(s-1-i);
u.push_back(p);
v.clear();
}
}
}
}
}
sort(u.begin(),u.end());
vector<int>::iterator it=unique(u.begin(),u.end());
u.erase(it,u.end());
cout << u.size() << endl;
u.clear();
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979
#define EPS 1e-8
#define mod 998244353
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
const ll INF=1e15;
const int N=2e5+50;
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modinverse(ll a,ll m)
{
return binpow(a,m-2,m);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(0);
ll n;
cin>>n;
stack<ll> st[1005];
for(ll i=1;i<=n;i++)
{
vector<ll> v;
for(ll j=1;j<n;j++)
{
ll val;cin>>val;
v.pb(val);
}
reverse(v.begin(),v.end());
for(ll j=0;j+1<n;j++)
{
st[i].push(v[j]);
}
}
ll cnt=0;
ll c1=0;
while(c1<((n*(n-1))/2))
{
ll c=0;
cnt++;
vector<ll> vis(1005,0);
for(ll i=1;i<=n;i++)
{
if(!st[i].empty() && !vis[i])
{
ll j=st[i].top();
if(!st[j].empty() && st[j].top()==i && !vis[j])
{
//cout<<i<<" "<<j<<endl;
st[i].pop();
st[j].pop();
c=1;
c1++;
vis[i]=vis[j]=1;
}
}
}
if(!c)
{
cout<<-1;
exit(0);
}
}
cout<<cnt;
}
| #include<bits/stdc++.h>
using namespace std;
vector<int>e[1500001];
int dp[1500001];
int vis[1500001];
int dfs(int u)
{
if(vis[u]==1){printf("-1");exit(0);}
if(dp[u]) return dp[u];
vis[u]=1;
int ans=1;
for(int i=0;i<e[u].size();i++)
{
//printf("%d::%d %d\n",u,e[u][i],dfs(e[u][i])+1);
ans=max(ans,dfs(e[u][i])+1);
}
vis[u]=0;
return dp[u]=ans;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int pre=0;
for(int j=1;j<n;j++)
{
int x;
scanf("%d",&x);
int now=min(i,x)*n+max(i,x);
e[pre].push_back(now);
pre=now;
}
}
int ans=dfs(0);
printf("%d",ans-1);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
double n;
cin>>n;
vector<vector<double>> d(n,vector<double>(2));
rep(i,n)rep(j,2) cin>>d[i][j];
vector<int> t(n);
rep(i,n) t[i]=i;
double sum=0;
int cnt=0;
do{
for(int i=1;i<n;i++){
sum+=sqrt((d[t[i]][0]-d[t[i-1]][0])*(d[t[i]][0]-d[t[i-1]][0])+(d[t[i]][1]-d[t[i-1]][1])*(d[t[i]][1]-d[t[i-1]][1]));
}
cnt++;
}while(next_permutation(all(t)));
printf("%.10f\n",sum/cnt);
} | //算数的な問題
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int f(int n){
if (n == 0) return 1;
else return n * f(n - 1);
}
int main(void){
int N;
cin >> N;
vector <int> x(N), y(N);
rep(i,N) cin >> x[i] >> y[i];
//ラムダ式
//点iと点jの距離
auto dist = [&](int i, int j){
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return sqrt(dx * dx + dy * dy);
};
//順列を使わない方法
double len = 0;
rep(i,N)rep(j,i){
len += dist(i,j);
}
double ans = (len * 2) / N;
//順列を使う方法
// vector <int> p(N);
// rep(i,N) p[i] = i;
// double len = 0; //長さ
// int cnt = 0;
// do {
// rep(i,N-1){
// len += dist(p[i], p[i + 1]);
// }
// cnt ++;
// } while (next_permutation(all(p)));
// double ans = len/cnt;
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
using Graph = vector<vector<int>>;
Graph G;
int main(){
int n; cin >> n;
ll x; cin >> x;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
_rep(i, 1, n){
if(a[i - 1] > x){
ans += a[i - 1] - x;
ans += a[i];
a[i] = 0;
}else if(a[i - 1] + a[i] > x){
ans += (a[i - 1] + a[i] - x);
a[i] = x - a[i - 1];
}
}
cout << ans << endl;
} | // This template belongs to Juan Carlo Vieri
/* ____ __
/ _/ | | __ __
__| |__ | | /_/ | |
|__ __| | | __ ____ | | __ ___ _ ___
| | | | | | / _/ | |/ / / _ \ | |/ _/
| | | | | | | |_ | \ | __/ | /
|__| |__| |__| \___\ |__|\__\ \___\ |__|
*/
#include <bits/stdc++.h>
using namespace std;
typedef int_fast64_t ll;
typedef long double ld;
typedef int_fast64_t intt;
typedef int_fast32_t tmp_m;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define from(x, y, arr) (arr[y] - ((x > 0) ? (arr[x - 1]) : (0)))
#define min(a, b) (a > b ? b : a)
#define max(a, b) (a < b ? b : a)
#define puts(x) cout << x << endl
#define deb(x) cout << #x << ' ' << x << endl
#define rep(i, cmp1, cmp2) for (tmp_m i = (tmp_m)cmp1; i < (tmp_m)cmp2; ++i)
#define repp(i, cmp1, cmp2) for (tmp_m i = (tmp_m)cmp1; i >= (tmp_m)cmp2; --i)
#define pb push_back
#define st stack
#define pa pair
#define vc vector
#define qu queue
#define pq priority_queue
#define fr first
#define sc second
#define mp map
const ld pi = acos(-1.0);
const intt mod = 1e9 + 7;
struct pr {
intt x;
intt y;
intt dst;
pr() {}
pr(intt x, intt y, intt dst) : x(x), y(y), dst(dst) {}
inline bool operator<(const pr& cmp2) const {
if (dst != cmp2.dst) return dst < cmp2.dst;
if (x != cmp2.x) return x < cmp2.x;
return y < cmp2.y;
}
inline bool operator==(const pr& cmp2) const {
return (cmp2.dst == dst) && (cmp2.x == x) && (cmp2.y == y);
}
inline bool operator>(const pr& cmp2) const {
if (dst != cmp2.dst) return dst > cmp2.dst;
if (x != cmp2.x) return x > cmp2.x;
return y > cmp2.y;
}
};
struct point {
intt x;
intt y;
point() {}
point(intt x, intt y) : x(x), y(y) {}
inline bool operator<(const point& cmp2) const {
if (cmp2.x != x) return cmp2.x < x;
return cmp2.y < y;
}
inline bool operator==(const point& cmp2) const {
return (cmp2.x == x) && (cmp2.y == y);
}
inline bool operator>(const point& cmp2) const {
if (cmp2.x != x) return cmp2.x > x;
return cmp2.y > y;
}
};
namespace std {
template<typename T>
struct hash<vector<T> > {
size_t operator()(const vector<T>& k) const {
size_t ret = 0xf3ee477d;
for (size_t i = 0; i != k.size(); ++ i)
ret ^= hash(hash(k[i]) + i);
return ret;
}
};
template<>
struct hash<pr>{
size_t operator()(const pr& cmp1) const {
return (hash<intt>()(cmp1.x)) ^ (hash<intt>()(cmp1.y)) ^
(hash<intt>()(cmp1.dst));
}
};
template<>
struct hash<point>{
size_t operator()(const point& cmp1) const {
return (hash<intt>()(cmp1.x)) ^ (hash<intt>()(cmp1.y));
}
};
}
inline bool spoint(const point& cmp1, const point& cmp2) {
// swap(cmp1, cmp2);
if (cmp1.x != cmp2.x) return cmp1.x < cmp2.x;
return cmp1.y < cmp2.y;
}
inline bool spr(const pr& cmp1, const pr& cmp2) {
// swap(cmp1, cmp2);
if (cmp1.dst != cmp2.dst) return cmp1.dst < cmp2.dst;
if (cmp1.x != cmp2.x) return cmp1.x < cmp2.x;
return cmp1.y < cmp2.y;
}
void sub() {
}
void solve() {
// intt t; cin >> t;
// while (t--) sub();
intt n;
cin >> n;
vc<intt> arr(n);
intt nol = 0;
intt neg = 0;
rep(i, 0, n){
cin >> arr[i];
if(arr[i] == 0)nol = 1;
if(arr[i] < 0)++neg;;
}
if(neg % 2 == 0 || nol){
intt ans = 0;
rep(i, 0, n){
ans += abs(arr[i]);
}
cout << ans << endl;
return;
} else{
rep(i, 0, n){
arr[i] = abs(arr[i]);
}
sort(arr.begin(), arr.end());
intt ans = -(arr[0]);
rep( i, 1, n){
ans += arr[i];
}
cout << ans << endl;
}
}
void init() {
// remove if interactive
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(0));
// memset(dp, -1, sizeof dp);
}
int main() {
init();
solve();
return 0;
}
| 0 |
#include <iostream>
using namespace std;
int main()
{
string w;
cin >> w;
int c = 0;
if (w == "RRR")
{
c = 3;
}
else if (w== "RRS" || w == "SRR")
{
c= 2;
}
else if (w == "SRS" || w == "RSR" || w == "SSR" || w == "RSS")
{
c = 1;
}
cout << c << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin>>s;
int ans = 0;
int ma = INT_MIN;
for(int i=0;i<s.size();i++) {
if(s[i] == 'R') {
ans++;
}
else {
ma = max(ma, ans);
ans = 0;
}
}
ma = max(ma, ans);
cout<<ma<<endl;
}
| 1 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <cstdlib>
#include <iomanip>
#define rep(i,x) for(ll i=0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ld = long double;
using ll = long long;
const ll INF = 10010010010;
typedef pair<ll, ll> P;
using graph = vector<vector<ll>>;
const ll mod = 1000000007;
ll gcd(ll a, ll b) {//a>b
if (a < b)swap(a, b);
if (a % b == 0) return b;
else return gcd(b, a % b);
}/*フィボナッチテンプレ
ll memo[50];
ll fibo(ll n) {
if (memo[n] != 0)return memo[n];
if (n <= 1)return memo[n] = n;
else return memo[n] = fibo(n - 1) + fibo(n - 2);
}
*/
bool isp(ll n) {
bool res = true;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
int main() {
ll N;
cin >> N;
if(N == 1)cout << "Hello World" << endl;
else{
ll a,b;
cin >> a >> b;
cout << a + b << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max((x),(y))
#define mins(x,y) x=min((x),(y))
#define show(x) cout<<#x<<" = "<<(x)<<endl;
#define all(a) ((a).begin()),((a).end())
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define bit(n) (1LL<<(n))
typedef long long ll;
typedef __int128_t lll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>using P=pair<T,Y>;
template<class T,class Y>ostream& operator<<(ostream&o,P<T,Y>&p){return o<<"("<<p.fi<<","<<p.se<<")";}
template<class T>ostream& operator<<(ostream&o,V<T>&v){for(T&t:v)o<<t<<",";return o;}
template<class T>void uniq(V<T>&v){sort(all(v));v.erase(unique(all(v)), v.end());}
template<class A,size_t N,class T>void Fill(A(&a)[N],const T&v){fill((T*)a,(T*)(a+N),v);}
const int MOD = 1e9+7; //998244353;
lll gcd(lll a,lll b,lll&x,lll&y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m=MOD){lll x,y;gcd(a,m,x,y);return(x%m+m)%m;}
ll modPow(lll a,lll n,ll m=MOD){lll p=1;for(;n;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return p;}
//V<ll>Fac,Rac;void setF(int n,int m=MOD){Fac=Rac=V<ll>(++n);Fac[0]=1;FOR(i,1,n)Fac[i]=Fac[i-1]*i%m;Rac[n-1]=modInv(Fac[n-1],m);FORR(i,n-1,1)Rac[i-1]=Rac[i]*i%m;}
//ll comb(int a,int b,int m=MOD){return a<b||b<0?0:Fac[a]*Rac[b]%m*Rac[a-b]%m;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int N = 4e5;
int t, n;
ll a[200];
string s;
int f(){
cin >> n;
FOR(i, 0, n) cin >> a[i];
cin >> s;
V<ll> v;
FORR(i, n-1, 0){
ll e = a[i];
for(ll l:v) mins(e, e^l);
if(!e) continue;
if(s[i]-'0'){
return 1;
}else{
v.pb(e);
}
}
return 0;
}
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> t;
FOR(_, 0, t) cout << f() << endl;
} | 0 |
#include<bits/stdc++.h>
//g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
set<ll> S;
map<ll, ll> M;
rep(i, N) {
set<ll>::iterator it = S.lower_bound(A[i]);
if(S.size() == 0 || it == S.begin()) {
S.insert(A[i]);
M[A[i]]++;
} else {
it--;
M[*it]--;
if(M[*it] == 0) {
M.erase(*it);
S.erase(*it);
}
S.insert(A[i]);
M[A[i]]++;
}
}
ll ans = 0;
for(pair<ll, ll> item: M) {
ans += item.second;
}
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
using namespace std;
#define int long long
#define ll long long
#define double long double
#define pii pair<int, int>
#define vec vector
#define u_map unordered_map
#define u_set unordered_set
#define str string
#define all(el) el.begin(), el.end()
#define allr(el) el.rbegin(), el.rend()
#define sz(el) (int)el.size()
#define f first
#define s second
#define pb push_back
#define in insert
#define mp make_pair
#define endl "\n"
#define forn(i, n) for (int i = 0; i < n; ++i)
inline int maxi(int &a, int b) { if (b > a) { a = b; return 1; } return 0; }
inline int mini(int &a, int b) { if (b < a) { a = b; return 1; } return 0; }
inline int maxi(double &a, double b) { if (b > a) { a = b; return 1; } return 0; }
inline int mini(double &a, double b) { if (b < a) { a = b; return 1; } return 0; }
int bin_pow(int x, int p) {
if (p < 0) {
return 0;
}
if (p == 0) {
return 1;
}
if (p % 2 == 0) {
int ans = bin_pow(x, p / 2);
return ans * ans;
}
return x * bin_pow(x, p - 1);
}
int gcd(int a, int b) {
if (!b) {
return a;
}
return gcd(b, a % b);
}
signed main() {
int n;
cin >> n;
multiset<int> hv;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
auto pos = hv.upper_bound(-x);
if (pos == hv.end()) {
ans++;
} else {
hv.erase(pos);
}
hv.in(-x);
}
cout << ans;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define mems(a,x) memset(a,x,sizeof(a))
#define first fi
#define second se
using namespace std;
typedef long long ll;
const int mod=1e9+7,N=105;
const double eps=1e-8,pi=3.1415926535898;
ll inv(ll x){return x==1?x:(mod-mod/x)*inv(mod%x)%mod;}
ll inv(ll x,ll mod){return x==1?x:(mod-mod/x)*inv(mod%x,mod)%mod;}
ll qpow(ll a,ll n){ll ans=1;while(n){if(n&1) ans=ans*a%mod;a=a*a%mod;n>>=1;}return ans;}
ll mul(ll a,ll b){ll ans=0;while(b){if(b&1) ans=(ans+a)%mod;a=(a+a)%mod;b>>=1;};return ans;}
ll qpow(ll a,ll n,ll mod){ll ans=1;while(n){if(n&1) ans=ans*a%mod;a=a*a%mod;n>>=1;}return ans;}
ll mul(ll a,ll b,ll mod){ll ans=0;while(b){if(b&1) ans=(ans+a)%mod;a=(a+a)%mod;b>>=1;};return ans;}
struct vec
{
double x,y;
int id;
vec(double x=0,double y=0):x(x),y(y){}
vec operator+(const vec&o)const{ return vec(x+o.x,y+o.y);}
vec operator-(const vec&o)const{ return vec(x-o.x,y-o.y);}
double operator*(const vec&o)const{ return x*o.x+y*o.y;}
double operator^(const vec&o)const{ return x*o.y-y*o.x;}
vec operator/(const double&o)const{ return vec(x/o,y/o);}
vec operator*(const double&o)const{ return vec(x*o,y*o);}
void sc(){scanf("%lf%lf",&x,&y);}
double len(){return sqrt(x*x+y*y);}
}a[N],s[N];
int n,top;
bool cmp(vec x,vec y)
{
double k1=atan2(x.y-a[1].y,x.x-a[1].x),k2=atan2(y.y-a[1].y,y.x-a[1].x);
if(fabs(k1-k2)<eps) return x.x<y.x;
return k1<k2;
}
double ans[N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) a[i].sc(),a[i].id=i;
for(int i=1;i<=n;i++)
if(a[i].y<a[1].y||a[i].y==a[1].y&&a[i].x<a[1].x)
swap(a[i],a[1]);
sort(a+2,a+1+n,cmp);
for(int i=1;i<=n;i++)
{
while(top>=2&&((s[top-1]-a[i])^(s[top]-a[i]))<=0) top--;
s[++top]=a[i];
}
if(top==1) ans[s[1].id]=1;
else if(top==2) ans[s[1].id]=ans[s[2].id]=0.5;
else
for(int i=1;i<=top;i++)
{
vec l,r;
if(i==1) l=s[top];
else l=s[i-1];
if(i==top) r=s[1];
else r=s[i+1];
double res=(r-s[i])*(l-s[i]);
res/=(r-s[i]).len()*(l-s[i]).len();
res=pi-acos(res);
res/=2*pi;
ans[s[i].id]=res;
}
for(int i=1;i<=n;i++)
printf("%.10f\n",ans[i]);
}
| #include<iostream>
#include<complex>
#include<math.h>
#include<algorithm>
using namespace std;
int n,i,j;
double x[100],y[100],a[101],Ans[100];
complex<double>z[100];
int main()
{
cin >> n;
for(i=0;i<n;i++){
cin >> x[i] >> y[i];
z[i]=complex<double>(x[i],y[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
a[j]=fmod(arg(z[j]-z[i])+2*M_PI,2*M_PI);
}
sort(a,a+n);
a[n]=a[1]+2*M_PI;
for(j=1;j<n;j++){
if(a[j+1]-a[j]>=M_PI){Ans[i]=(a[j+1]-a[j]-M_PI)/2/M_PI;
}
}
cout << Ans[i] << endl;
}
} | 1 |
#include <stdio.h>
int main(){
long long n, sum = 0;
scanf("%lld", &n);
for(long long i = 1 ; i <= n ; i++){
if(i%3 != 0 && i%5 != 0){
sum+=i;
}
}
printf("%lld\n", sum);
return 0;
} | #define rep(i,n) for (int i=0;i<n;i++)
#include <vector>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
string s;
cin >> s;
int co=0;
rep(i,3){
if(s.at(i)=='R') co++;
}
if(co==3)
cout << 3 << endl;
else if(co==2 && s.at(1)!='S')
cout << 2 << endl;
else if(co==0)
cout << 0 << endl;
else
cout << 1 << endl;
} | 0 |
#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=5e18;
int main() {
ll a;
cin >> a;
if(a<1200) cout << "ABC" << endl;
else if(a<2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
// i桁目まで見て j枚多く払う時(0 or 1)
ll dp[1000100][2];
int main() {
string s;
cin >> s;
s = '0' + s;
int n = (int)s.size();
memset(dp, 0, sizeof(dp));
dp[0][1] = 1;
for (int i = 1; i < n; i++) {
int current = s[i] - '0';
dp[i][0] = min(dp[i - 1][0] + current, dp[i - 1][1] + (10 - current));
dp[i][1] = min(dp[i - 1][0] + current + 1, dp[i - 1][1] + (9 - current));
}
cout << dp[n - 1][0] << '\n';
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
int main(){
ll h, w, k;
cin >> h >> w >> k;
ll dp[110][10] = {};
dp[0][0] = 1;
rep(i, h)rep(j, w)rep(k,(1<<(w-1))){
bool isok = true;
rep(l, w-2)if(k & (1<<l) && k & (1<<(l+1))){
isok = false;
break;
}
if(isok){
if(j > 0 && (1<<(j-1) & k)){
dp[i+1][j-1] += dp[i][j];
dp[i+1][j-1] %= MOD;
}
else if(j < w-1 && (1<<j) & k){
dp[i+1][j+1] += dp[i][j];
dp[i+1][j+1] %= MOD;
}
else {
dp[i+1][j] += dp[i][j];
dp[i+1][j] %= MOD;
}
}
}
cout << dp[h][k-1] << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
#define bit(n, k) ((n) >> (k) & 1)
const int MOD = (int)1e9 + 7;
template<class T> void add(T &a, T b) { (a += (b % MOD + MOD) % MOD) %= MOD; }
int main() {
int h, w; cin >> h >> w;
int K; cin >> K; K--;
vector<vector<int>> num(w, vector<int>(w));
for (int mask = 0; mask < 1 << (w - 1); mask++) {
bool ok = true;
for (int i = 0; i + 1 < w - 1; i++) {
if (bit(mask, i) && bit(mask, i + 1)) ok = false;
}
if (!ok) continue;
vector<int> p(w);
iota(p.begin(), p.end(), 0);
for (int i = 0; i < w - 1; i++) if (bit(mask, i)) swap(p[i], p[i + 1]);
for (int i = 0; i < w; i++) num[i][p[i]]++;
}
vector<vector<long long>> dp(h + 1, vector<long long>(w));
dp[0][0] = 1;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) for (int k = 0; k < w; k++) {
add(dp[i + 1][k], dp[i][j] * num[j][k]);
}
}
cout << dp[h][K] << endl;
return 0;
}
| 1 |
#include <iostream>
#include <string>
using namespace std;
char decode(char c, int n) {
if ('a' <= c && c <= 'z') {
if (c - 'a' >= n)
return c-n;
else
return decode('Z', n-(c-'a'+1));
}
if ('A' <= c && c <= 'Z') {
if (c - 'A' >= n)
return c-n;
else
return decode('z', n-(c-'A'+1));
}
}
int main() {
int len;
while(cin >> len, len) {
int list[len];
for(int i=0; i<len; i++)
cin >> list[i];
string s;
cin >> s;
for(int i=0; i<s.size(); i++)
s[i] = decode(s[i],list[i%len]);
cout << s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
ll N, x[100500], M, K, a[100050];
ll dp[100050][70];
ll ans_delta[100050];
int f(int index, ll time) {
//cout << index << " " << time << endl;
if(time == 0) {
return index;
}
ll now = 1;
ll dp_index = 0;
while(now * 2 <= time) {
now *= 2;
dp_index++;
}
int NEW = dp[index][dp_index];
return f(NEW, time - now);
}
int main() {
cout.precision(10);
cin >> N;
for(int i = 1; i <= N; i++) {
cin >> x[i];
}
cin >> M >> K;
//cout << N << " " << M << " " << K << endl;
for(int i = 1; i <= M; i++) {
cin >> a[i];
}
for(int i = 1; i < N; i++) {
dp[i][0] = i;
}
for(int i = 1; i <= M; i++) {
swap(dp[a[i] - 1][0], dp[a[i]][0]);
}
for(int i = 1; i < N; i++) {
//cout << i << " " << dp[i][0] << endl;
}
for(int i = 1; i < 70; i++) {
for(int delta = 1; delta < N; delta++) {
int before = dp[delta][i - 1];
dp[delta][i] = dp[before][i - 1];
//cout << i << " " << delta << " " << dp[delta][i] << endl;
}
}
for(int i = 1; i < N; i++) {
ans_delta[i] = f(i, K);
//cout << i << " " << ans_delta[i] << endl;
}
ll sum = x[1];
cout << sum << endl;
for(int i = 1; i < N; i++) {
ll delta = x[ans_delta[i] + 1] - x[ans_delta[i]];
sum += delta;
cout << sum << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define rep(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(){
int e;
while(cin>>e,e){
int ans = 1 << 20;
for(int i = 0;i*i*i<=e;i++){
int yyx = e - i*i*i;
int y = (int)sqrt(yyx);
ans = min(yyx-y*y+y+i,ans);
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <cstring>
using namespace std;
const char i = 'I', v = 'V', x = 'X', l = 'L', c = 'C', d = 'D', m = 'M';
int number(char s)
{
switch (s) {
case i: return 1;
case v: return 5;
case x: return 10;
case l: return 50;
case c: return 100;
case d: return 500;
case m: return 1000;
}
}
int main()
{
string str;
while (cin >> str) {
int i = 0;
int ans = 0;
while (i < str.size()) {
int tmp = 0;
char s = str[i];
while (s == str[i] && i < str.size()) {
tmp += number(s);
i++;
}
if (number(s) < number(str[i])) ans -= tmp;
else ans += tmp;
}
cout << ans << endl;
}
return 0;
} | 0 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
template<class T> using V=vector<T>;
using Graph = vector<vector<int>>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
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; }
const ll INF=1e18;
ll s[200005],t[200005];
ll mod_pow(ll x,ll n,ll m){
if(n==0) return 1;
ll res=mod_pow(x*x%m,n/2,m);
if(n&1) res=res*x%m;
return res;
}
int main(){
ll n,m,k;
cin>>n>>m>>k;
ll A=n*m;
ll B=A-2;
ll ans=0;
ll cnt=1;
ll c;
ll ma=n+m-2;
s[0]=t[0]=0;
for(ll i=1;i<=ma+2;i++){
s[i]=i*(i+1)/2;
t[i]=i*(i+1)*(i+2)/6;
}
for(ll i=0;A-2-i>A-k;i++) cnt=(cnt*(A-2-i))%mod;
for(ll i=2;i<=k-2;i++) cnt=(cnt*mod_pow(i,mod-2,mod))%mod;
c=cnt;
ll i=1,j=1;
while(true){
ll now=0;
now=(now+s[m-j])%mod;
if(j==1){
now=(now+(t[m-j+n-i]-t[m-j]-t[n-i-1])%mod)%mod;
}else if(j==m){
now=(now+(t[j+n-i-1]-t[j-1]-t[n-i-1])%mod)%mod;
}else{
now=(now+(t[m-j+n-i]-t[m-j]-t[n-i-1])%mod)%mod;
now=(now+(t[j+n-i-1]-t[j-1]-t[n-i-1])%mod)%mod;
now-=s[n-i];
while(now<0) now=now+mod;
}
ans=(ans+(now*cnt)%mod)%mod;
if(j==m){
i++;j=1;
}else{
j++;
}
if(i==n&&j==m) break;
}
cout<<ans<<endl;
} | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll Mod = 1e9 + 7;
ll fact[200100];
long long fastpower(long long a,long long b)
{
if(b==0)
return 1;
if(b==1)
return a;
long long res = fastpower(a,b/2)%Mod;
res = (res %Mod * res % Mod )%Mod;
if(b%2!=0)
res*=a;
return res % Mod;
}
ll C(ll n , ll k){
if(n < k) return 0;
ll x = fact[n];
ll y = (fact[k] * fact[n - k])%Mod;
return ((x * fastpower(y , Mod - 2))%Mod);
}
void add_self(ll &x , ll y){
x = (x + y)%Mod;
}
void sub_self(ll &x , ll y){
x = ((x - y)%Mod)+Mod;
}
vector < ll > v , v2;
int main()
{
ll n,m,k; cin >> n >> m >> k;
fact[0] = 1;
for(int i = 1;i<=200000;i++) fact[i] = (fact[i - 1] * i) % Mod;
ll sum = 0;
for(int i = 1;i<=n;i++){
for(int j = 1;j<=m;j++){
v.push_back(i);
v2.push_back(j);
}
}
sort(v.begin() , v.end());
sort(v2.begin() , v2.end());
ll Ans = 0;
for(ll i = 0;i<v.size();i++){
ll Ways = C(n * m - 2 , k - 2);
sub_self(Ans , v[i] * ((ll)v.size() - (i + 1)) * Ways + Mod);
add_self(Ans , v[i] * i % Mod * Ways);
}
for(ll i = 0;i<v2.size();i++){
ll Ways = C(n * m - 2 , k - 2);
sub_self(Ans , v2[i] * ((ll)v2.size() - (i + 1)) * Ways + Mod);
add_self(Ans , v2[i] * i % Mod * Ways);
}
cout << Ans;
return 0;
}
| 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
const double EPS = 1e-10;
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
int main(){
int n; cin >> n;
vector<ll> a(n);
rep(i,n){
double b;
cin >> b;
b *= 1000000000;
a[i] = (ll)(b+0.0005);
}
map<Pi,int> cnt;
rep(i,n){
ll now = a[i];
int cnt2 = 0;
while(now%2 == 0){
cnt2++;
now /= 2;
}
now = a[i];
int cnt3 = 0;
while(now%5 == 0){
cnt3++;
now /= 5;
}
cnt[Pi(cnt2,cnt3)]++;
}
ll ans = 0;
ll ans2 = 0;
for(auto p1: cnt){
for(auto p2: cnt){
if(p1.first.first+p2.first.first >= 18 && p1.first.second+p2.first.second >= 18){
if(p1 == p2){
ans2 += (ll)p1.second*(p1.second-1)/2;
}
else ans += (ll)p1.second*p2.second;
}
}
}
ans = ans/2+ans2;
cout << ans << endl;
}
| #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 1000000007;
ll power(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x *= x; p /= 2; } else { a *= x; p--; } }return a; }
ll mpower(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x = x * x % mod; p /= 2; } else { a = a * x % mod; p--; } }return a; }
ll ac(ll n, ll k) { ll a = 1; rep(i, 1, k) { a *= n - i + 1; a /= i; }return a; }
ll mc(ll n, ll m) { ll k = 1, l = 1; rep(i, n - m + 1, n + 1) k = k * i % mod; rep(i, 1, m + 1) l = l * i % mod; l = mpower(l, mod - 2); return k * l % mod; }
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) { rep(i, 0, N)par[i] = i;}
int root(int x) { return par[x] == x ? x : par[x] = root(par[x]);}
void unite(int x, int y) {if (!same(x, y)) par[root(x)] = root(y); }
bool same(int x, int y) {return root(x) == root(y);}
};
int main()
{
int H, W;
ll ans = 0;
cin >> H >> W;
vector<string> S(H);
UnionFind tree(W * H);
rep(i, 0, H)cin >> S[i];
rep(i, 0, H) {
rep(i2, 0, W) {
if (i != H - 1 && S[i][i2] != S[i + 1][i2]) {
tree.unite(i * W + i2, i * W + W + i2);
}
if (i2 != W - 1 && S[i][i2] != S[i][i2 + 1]) {
tree.unite(i * W + i2, i * W + 1 + i2);
}
}
}
map<int, pair<int, int>>mp;
rep(i, 0, H * W) {
if(S[i / W][i % W] == '#')mp[tree.root(i)].first++;
else mp[tree.root(i)].second++;
}
for (auto m : mp) {
ans += (ll)m.second.first * m.second.second;
}
printf("%lld\n", ans);
return 0;
}
| 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(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, input;
cin >> n;
int mn = n, cnt = 0;
for(int i = 0; i < n; i++){
cin >> input;
if(input < mn)
mn = input;
if(mn >= input)
cnt++;
}
cout << cnt;
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define f(x) x*x
using namespace std;
int ans;
int main(){
int ma,n;
while(cin>>n){
for(int i=n;i<600;i+=n){
ans += (f(i) * n);
}
cout<<ans<<endl;
ans=0;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int n,r;
scanf("%d%d",&n,&r);
int ans;
if(n<10)
{
ans=r+(10-n)*100;
}
else ans=r;
printf("%d",ans);
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if((b - 1) % (a - 1) == 0){
cout << (b - 1) / (a - 1) << endl;
} else{
cout << (b - 1) / (a - 1) + 1 << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main(){
int A,B,i,sum=1,count=0;
cin >> A >> B;
for(i=0;i==0;i){
if(sum<B){
sum=sum-1+A;
count++;
}
else{
break;
}
}
cout << count << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef vector<int> Vi;
typedef vector<lli> Vl;
typedef pair<int, int> Pii;
typedef pair<lli, lli> Pll;
//===
const int MOD = (int)1e9 + 7;
int main()
{
int N, X;
cin >> N >> X;
vector<int> S(N);
for (int i = 0; i < N; ++i) cin >> S[i];
sort(S.begin(), S.end());
vector<Vl> dp(N + 1, Vl(X + 1));
for (int x = 0; x <= X; ++x) dp[0][x] = x;
for (int i = 0; i < N; ++i) {
for (int x = 0; x <= X; ++x) {
dp[i + 1][x] = (dp[i][x % S[i]] + i * dp[i][x]) % MOD;
}
}
cout << dp[N][X] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k; cin >> n >> k;
vector<double> v(n);
vector<double> expected(n);
for(int i = 0; i < n; ++i)
{
cin >> v[i];
expected[i] = ((v[i]*(v[i]+1.0))/2.0)/v[i];
if(i)
expected[i] += expected[i-1];
}
double maxi = expected[k-1];
double tolerance = 0.0000001;
for(int i = k-1; i < n; ++i)
{
int pre = i - k;
if(pre >= 0)
{
double cur = expected[i] - expected[pre];
if(cur-maxi > tolerance)
maxi = cur;
}
}
cout << setprecision(17) << maxi;
return 0;
} | 0 |
#include <iostream>
using namespace std;
bool check(string S){
if(S[0]!='A') return false;
int C=0;
for (int i = 2 ; i < S.length()-1; i++) {
if(S[i]=='C'){
C++;
}
}
if(C!=1) return false;
int upper=0;
for (int i = 0; i < S.length(); i++) {
if(S[i]>='A'&&S[i]<='Z'){
upper++;
}
}
if(upper!=2) return false;
return true;
}
int main(){
string S;
cin >> S;
if(check(S)){
cout << "AC" << endl;
} else {
cout << "WA" << endl;
}
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_accepted(void) {
string s;
cin >> s;
bool judge_a = false, judge_b = false, judge_c = false;
int cnt_c = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
if (s[i] == 'A') judge_a = true;
else break;
}
else if (s[i] == 'C'){
if (i >= 2 && i < s.size() - 1) {
cnt_c++;
}
}
else {
if (s[i] < 'a') {
judge_c = false;
break;
}
else judge_c = true;
}
}
if (cnt_c == 1) judge_b = true;
if (judge_a & judge_b & judge_c) {
cout << "AC" << endl;
}
else {
cout << "WA" << endl;
}
}
int main()
{
b_accepted();
return 0;
} | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int n, k;
cin >> n >> k;
if(n % k == 0) cout << 0 << ln;
else cout << 1 << ln;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n, m; cin >> n >> m;
ll res = 1;
for (ll i = 1; i*i <= m; i++) {
if (m%i == 0) {
if (i*n <= m) res = max(res, i);
if (m/i != i) {
if (m/i*n <= m) res = max(res, m/i);
}
}
}
cout << res << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
//if(B<=A) cout<<0<<endl;
if(B==1) cout<<0<<endl;
else if(A==B) cout<<1<<endl;
else if((B-A)%(A-1)==0) cout<<(B-1)/(A-1)<<endl;
else cout<<1+(B-1)/(A-1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
int a,b,ans,pl;
cin >> a >> b;
pl=1;
for(ans=0;pl<b;ans++){
pl += a-1;
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int N,M;
int FS[310][310];
vector<int>K;
int main(){
cin>>N>>M;
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
cin>>FS[i][j];
}
}
for(int i=1;i<=M;i++){
K.push_back(i);
}
int eachmaxcnt=0;
int maxcnt=300;
int C[310];
int temp=0;
//ゲームの種類分回す
for(int i=0;i<M;i++){
//各ゲームの参加者数を初期化
for(int i=1;i<=M;i++){
C[i]=0;
}
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
//最初にでてくるゲームの参加者を加算
if(FS[i][j] != -1){
C[FS[i][j]]++;
break;
}
}
}
//最大参加者数を求める
eachmaxcnt=0;
for(int i=1;i<=M;i++){
if(eachmaxcnt<C[i]){
eachmaxcnt=C[i];
temp=i;
}
}
//最大参加者数の更新
maxcnt=min(maxcnt,eachmaxcnt);
//最大参加者のゲームを-1にする
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
if(FS[i][j]==temp){
FS[i][j]=-1;
}
}
}
}
cout<<maxcnt<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 2010;
bool board[maxn][maxn];
int n, m;
int len[2][maxn][maxn];
void init(bool asd)
{
//cout << asd << " : " << endl;
for(int i = 1; i <= m; i ++)
len[asd][1][i] = m + 1;
for(int i = 2; i <= n; i ++)
{
int p = 0;
for(int j = 1; j <= m; j ++)
{
p = max(p, j);
for(p; p <= m && board[i][p] == (board[i - 1][p] ^ asd); p ++);
//cout << i << " " << j << " " << p << endl;
len[asd][i][j] = p;
}
}
/*
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= m; j ++)
cout << len[asd][i][j] << " ";
cout << endl;
}
*/
}
int ans = 0;
int sta[maxn], cnt = 0;
int l[maxn];
void get(int x)
{
//cout << x << " ---------------------- " << endl;
cnt = 0;
sta[++ cnt] = 1;
l[1] = 0;
for(int i = 2; i <= n; i ++)
{
l[i] = max(len[0][i][x], len[1][i][x]) - x;
//cout << i << " " << l[i] << endl;
while(cnt > 0 && l[sta[cnt]] > l[i])
{
//cout << sta[cnt] << " : " << endl;
ans = max(ans, (i - sta[cnt - 1]) * l[sta[cnt]]);
//cout << ans << endl;
cnt --;
}
sta[++ cnt] = i;
}
while(cnt > 0)
{
ans = max(ans, (n - sta[cnt - 1] + 1) * l[sta[cnt]]);
cnt --;
}
}
int main()
{
std::ios::sync_with_stdio(false);
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= m; j ++)
{
char a;
cin >> a;
if(a == '#')
board[i][j] = 1;
else
board[i][j] = 0;
}
}
init(0);
init(1);
for(int a = 1; a <= m; a ++)
get(a);
cout << max(ans, max(n, m)) << endl;
return 0;
} | 0 |
#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rep(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////
string s;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
cin>>s;
ll aa = -1,bb = -1;
rep(i,s.size()){
if(i-1>=0){
if(s[i]==s[i-1]){
aa = i;
bb = i+1;
break;
}
}
if(i-2>=0){
if(s[i-2]==s[i]){
aa = i-1;
bb = i+1;
break;
}
}
}
cout<<aa<<" "<<bb<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int res = 100000;
for (int i = 0; i + 2 < S.size(); ++i) {
int val = (S[i]-'0')*100 + (S[i+1]-'0')*10 + (S[i+2]-'0');
res = min(res, abs(val - 753));
}
cout << res << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll x;
cin >>x;
ll ans;
if(x%11==0){
ans=x/11*2;
}else if((x-x/11*11)<=6){
ans=x/11*2+1;
}else{
ans=x/11*2+2;
}
cout << ans<< endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int n, m, a[200001];
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t; cin >> t;
if(t < 1200)cout << "ABC" << endl;
else if(t < 2800)cout << "ARC" << endl;
else cout << "AGC" << endl;
return 0;
}
| 0 |
/*
g++ --std=c++17 A.cpp
*/
#include <iostream>
#include <iomanip> //! for setprecision(20)
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <limits.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define dump(c) { for (auto it = c.begin(); it != c.end(); ++it) if (it == c.begin()) cout << *it; else cout << ' ' << *it; cout << endl; }
#define dumpMap(m) { for (auto it: m) cout << it.first << "=>" << it.second << ' '; }
const int dx[4] = { 0, -1, 1, 0 };
const int dy[4] = { -1, 0, 0, 1 };
const int MOD = 1000000007;
int dist[50][50];
string s[50];
int main()
{
const int INF = 1e9;
cin.tie(0);
ios::sync_with_stdio(0);
int h, w;
cin >> h >> w;
rep(i, h) cin >> s[i];
int whiteCount = 0;
rep(y, h) rep(x, w) {
dist[y][x] = INF;
if (s[y][x] == '.') ++whiteCount;
}
dist[0][0] = 1;
queue<pair<int, int>> q;
q.push({0, 0});
while (!q.empty()) {
int y = q.front().first; int x = q.front().second; q.pop();
int d = dist[y][x] + 1;
rep(i, 4) {
int ny = y + dy[i];
int nx = x + dx[i];
if (0 <= ny && ny < h && 0 <= nx && nx < w && s[ny][nx] == '.' && d < dist[ny][nx]) {
dist[ny][nx] = d;
q.push({ny, nx});
}
}
}
int ans = -1;
if (dist[h-1][w-1] != INF) {
ans = whiteCount - dist[h-1][w-1];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1000000007;
int main(){
int H,W;cin >> H >> W;
vector<string> S(H);
int cnt=0;
for(int i=0;i<H;i++){
cin >> S[i];
for(int j=0;j<W;j++){
if(S[i][j]=='#'){
cnt ++;
}
}
}
vector<vector<bool>> P(H,vector<bool>(W,false));
queue<int> X;
queue<int> Y;
queue<int> D;
X.push(0);
Y.push(0);
D.push(1);
P[0][0] = true;
int goalD=0;
while(!X.empty()){
int x = X.front(),y=Y.front(),d=D.front();
X.pop();Y.pop();D.pop();
if(x==H-1&&y==W-1){
goalD = d;
break;
}
if(x-1>=0){
if(S[x-1][y]=='.'&&!P[x-1][y]){
X.push(x-1);Y.push(y);D.push(d+1);
P[x-1][y] = true;
}
}
if(x+1<H){
if(S[x+1][y]=='.'&&!P[x+1][y]){
X.push(x+1);Y.push(y);D.push(d+1);
P[x+1][y] = true;
}
}
if(y-1>=0){
if(S[x][y-1]=='.'&&!P[x][y-1]){
X.push(x);Y.push(y-1);D.push(d+1);
P[x][y-1] = true;
}
}
if(y+1<W){
if(S[x][y+1]=='.'&&!P[x][y+1]){
X.push(x);Y.push(y+1);D.push(d+1);
P[x][y+1] = true;
}
}
}
if(P[H-1][W-1]){
cout << H*W - cnt - goalD << endl;
}else{
cout << -1 << endl;
}
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
int sum = 0;
vector<int> vec_1(4); vector<int> vec_2(2);
for (int i = 0; i < 4; i++) cin >> vec_1[i];
for (int i = 0; i < 2; i++) cin >> vec_2[i];
sort(vec_1.begin(), vec_1.end(), greater<int>());
sort(vec_2.begin(), vec_2.end(), greater<int>());
for (int i = 0; i < 3; i++) sum += vec_1[i];
for (int i = 0; i < 1; i++) sum += vec_2[i];
cout << sum << endl;
return 0;
}
| #include<stdio.h>
int main(void)
{
int n,x,cnt[10],i,j;
while(1){
for(i=0;i<10;i++){
cnt[i]=0;
}
scanf("%d",&n);
if(n<1)break;
for(i=0;i<n;i++){
scanf("%d",&x);
cnt[x]++;
}
for(i=0;i<10;i++){
if(cnt[i]>0){
for(j=0;j<cnt[i];j++){
printf("*");
}
printf("\n");
}
else{
printf("-\n");
}
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
ll gcd(ll a, ll b){
ll r;
while (b != 0){
r = a % b;
a = b;
b = r;
}
return a;
}
ll *calc_z(string s){
ll n = s.size();
ll *z = new ll[n] {0};
ll l = 0, r = 0;
for (ll i = 1; i < n; i++){
if (r >= i) z[i] = min(z[i-l], r-i+1);
while (z[i]+i < n && s[z[i]] == s[z[i]+i]) z[i]++;
if (i + z[i] - 1 > r){
l = i;
r = i+z[i]-1;
}
}
return z;
}
ll find_lower(ll *a, ll n, ll v){
ll l = -1, r = n;
while (r>l+1){
ll m = (l+r)/2;
if (a[m] >= v) r = m;
else l = m;
}
if (r == n) return n-1;
if (a[r] == v) return r;
return r == 0 ? 0 : r-1;
}
void init(){
}
int bin(int *p, int n, int x){
int l = 0, r = n-1;
while (r >= l){
int m = (l+r)/2;
if (p[m] == x) return m;
if (p[m] > x) r = m-1;
else l = m+1;
}
return -1;
}
void solve(){
ll a, b;
cin >> a >> b;
cout << a*b << '\n';
}
int main(){
//init();
ios::sync_with_stdio(0);
cin.tie(0);
//ll t; cin >> t; while (t--)
solve();
return 0;
}
| #define _USE_MATH_DEFINES
#include <iostream>
#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>
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; }
signed main()
{
int N, A, B;
cin >> N;
if (N == 1)
{
cout << "Hello World" << endl;
}
else
{
cin >> A >> B;
cout << A + B << endl;
}
}
| 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <math.h> // sqrt
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <iomanip> // setprecision
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int main() {
string sa, sb, sc;
cin >> sa >> sb >> sc;
deque<char> da, db, dc;
for (char c : sa) {
da.push_back(c);
}
for (char c : sb) {
db.push_back(c);
}
for (char c : sc) {
dc.push_back(c);
}
bool A = true, B = false;
while(true) {
if (A) {
if (da.empty()) {
cout << "A" << endl;
return 0;
}
if (da.front() == 'b') {
B = true;
A = false;
}
else if (da.front() == 'c') {
A = false;
}
da.pop_front();
}
else if (B) {
if (db.empty()) {
cout << "B" << endl;
return 0;
}
if (db.front() == 'a') {
A = true;
B = false;
}
else if (db.front() == 'c') {
B = false;
}
db.pop_front();
}
else {
if (dc.empty()) {
cout << "C" << endl;
return 0;
}
if (dc.front() == 'a') {
A = true;
}
else if (dc.front() == 'b') {
B = true;
}
dc.pop_front();
}
}
}
| #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
read(x);read(a...);
}
template<class t> inline void write(t x){
if(x<0) putchar('-'),write(-x);
else{if(x>9) write(x/10);putchar('0'+x%10);}
}
int ans,x,y;
signed main(){
read(x,y);
if(x==1) ans+=3e5;
if(x==2) ans+=2e5;
if(x==3) ans+=1e5;
if(y==1) ans+=3e5;
if(y==2) ans+=2e5;
if(y==3) ans+=1e5;
if(x==1&&y==1) ans+=4e5;
write(ans);
} | 0 |
#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 fi first
#define se second
#define mp make_pair
#define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
typedef long long llong;
char moji[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
char moji2[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
char moji3[10]={'0','1','2','3','4','5','6','7','8','9'};
#define Sort(a) sort(a.begin(),a.end());
#define Reverse(a) reverse(a.begin(),a.end());
#define print(a) cout << a << endl;
#define MOD llong(1e9+7)
#define MAX int(2 * 1e5 +5)
#define debug(x) cout << #x << " = " << (x) << endl;
#define pi acos(-1.0)
#define int llong
#define INF llong(1e17)
template<class T> bool chmax(T &a, T b) {if(a<b){a=b; return 1;} return 0;}
template<class T> bool chmin(T &a, T b) {if(a>b){a=b; return 1;} return 0;}
bool Add(int &a,int b){a = (a + b) % MOD;}
void myprint(int* A,int A_num){
REP(i,A_num) cout << A[i] << " ";
cout << endl;
}
const int x_max = 100004;
const int n_max = 205;
signed main(){
int n,x;
cin >> n >> x;
int A[n];
REP(i,n) cin >> A[i];
sort(A,A+n);
int dp[2][x_max];
REP(j,x_max) dp[0][j] = j % A[0];
FOR(i,1,n){
REP(j,x_max){
dp[i%2][j] = 0;
Add(dp[i%2][j],dp[(i-1)%2][j % A[i]]);
Add(dp[i%2][j],i * dp[(i-1)%2][j]);
}
}
cout << dp[(n-1)%2][x] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200 + 10, M = 100000 + 10;
const int mod = 1e9 + 7;
void add(ll &x,ll y){
x += y;
if(x>=mod) x -= mod;
}
ll qpow(ll n,ll k){
ll res = 1;
while(k){
if(k&1) res = res * n % mod;
n = n * n % mod;
k >>= 1;
}
return res;
}
ll fac[N],inv[N];
ll push(int x,int y){
return fac[x+y] * inv[x] % mod;
}
int a[N],n;
ll f[N][M];
ll calc(int i,int j){
if(j<a[n]){
// cout<<i<<' '<<j<<' '<<fac[n-i]*j<<endl;
return fac[n-i] * j % mod;
}
ll &ans = f[i][j];
if(ans!=-1) return f[i][j];
ans = 0;
int x = 0, y = 0;
for(int k=i+1;k<=n;k++){
if(a[k]<=j){
// cout<<i<<','<<j<<','<<k<<','<<calc(k,j%a[k])*push(n-k,y)%mod*push(n-i-x,x)%mod<<endl;
add(ans,calc(k,j%a[k])*push(n-k,y)%mod*push(n-i-x,x)%mod);
}
if(a[k]<=j) y++;
else x++;
}
// cout<<i<<' '<<j<<' '<<ans<<endl;
return ans;
}
int main(){
fac[0] = 1; for(int i=1;i<N;i++) fac[i] = fac[i-1] * i % mod;
inv[N-1] = qpow(fac[N-1],mod-2);
for(int i=N-2;i>=0;i--) inv[i] = inv[i+1] * (i + 1) % mod;
ios::sync_with_stdio(0);
int x; cin>>n>>x;
for(int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+1+n,greater<int>());
memset(f,-1,sizeof(f));
cout<<calc(0,x)<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s)
{
return '"' + s + '"';
}
string to_string(const char* s)
{
return to_string((string) s);
}
string to_string(bool b)
{
return (b ? "true" : "false");
}
string to_string(vector<bool> v)
{
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++)
{
if (!first)
{
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v)
{
string res = "";
for (size_t i = 0; i < N; i++)
{
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v)
{
bool first = true;
string res = "{";
for (const auto &x : v)
{
if (!first)
{
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p)
{
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p)
{
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p)
{
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out()
{
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
const long long INF = 1e18;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
vector<long long> dp1(n + 1, -INF), dp0(n + 1, -INF);
dp0[1] = a[1];
dp1[1] = -a[1];
for (int i = 2; i < n; i++)
{
dp0[i] = max(dp0[i - 1] + a[i], dp1[i - 1] - a[i]);
dp1[i] = max(dp0[i - 1] - a[i], dp1[i - 1] + a[i]);
}
long long ans = max(dp0[n - 1] + a[n], dp1[n - 1] - a[n]);
cout << ans;
return 0;
}
| #include <iostream>
#include <algorithm>
using namespace std;
static const int N = 100;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
int main(void){
int n,p[N+1],m[N+1][N+1];
cin>>n;
loop(i,1,n+1){
cin>>p[i-1]>>p[i];
}
loop(i,1,n+2)m[i][i] = 0;
loop(l,2,n+1){
loop(i,1,n-l+2){
int j = i + l - 1;
m[i][j] = (1<<21);
loop(k,i,j){
m[i][j] = min(m[i][j],m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]);
}
}
}
cout << m[1][n] << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double rate;
int pfm,hrate;
cin>>rate>>hrate;
cout<<hrate*2-rate<<endl;
} | #include<iostream>
using namespace std;
int main(){
int a,i,j,k;
int s=0;
while(cin>>a){
for(i=a;i<600;i+=a){
s+=i*i*a;
}
cout<<s<<endl;
s=0;
}
return 0;
} | 0 |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
const int INF=11;
int w,h;
int field[22][22];
int sx,sy;
int gx,gy;
int ans=INF;
int hx[4]={1,-1,0,0,},hy[4]={0,0,1,-1,};
void dfs(int field2[22][22],int x,int y,int mx,int my,int c){
int a;
if(c>10)return;
if(c>ans)return;
if(x>0 && x<=w && y>0 && y<=h);else return;
if(field2[x][y]==3){
if(ans>c)ans=c;
return;
}
if(field2[x+mx][y+my]==1){
field2[x+mx][y+my]=0;
for(a=0;a<4;a++){
if(field2[x+hx[a]][y+hy[a]]!=1)dfs(field2,x,y,hx[a],hy[a],c+1);
}
field2[x+mx][y+my]=1;
}else dfs(field2,x+mx,y+my,mx,my,c);
return;
}
int main(void){
int a,b;
while(1){
for(b=0;b<21;b++){
for(a=0;a<21;a++){
field[a][b]=0;
}
}
ans=INF;
sx=0;
sy=0;
gx=0;
gy=0;
cin >> w >> h;
if(w==0 && h==0)break;
for(b=1;b<=h;b++){
for(a=1;a<=w;a++){
cin >> field[a][b];
if(field[a][b]==2)sx=a,sy=b,field[a][b]=0;
if(field[a][b]==3)gx=a,gy=b;
}
}
for(a=0;a<4;a++){
if(field[sx+hx[a]][sy+hy[a]]!=1)dfs(field,sx,sy,hx[a],hy[a],1);
}
printf("%d\n",ans<=10?ans:-1);
}
return 0;
} | #include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int n,y;
int i,j,flg=0;
scanf("%d %d",&n,&y);
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
if(n-(i+j)<0) {
break;
}
if(i+j+n-(i+j)==n&&y==i*10000+j*5000+(n-(i+j))*1000){
flg=1;
break;
}
}
if(flg==1) break;
}
if(flg==1){
printf("%d %d %d\n",i,j,n-(i+j));
}
else if(flg==0||flg==2){
printf("-1 -1 -1\n");
}
return 0;
} | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <queue>
#include <functional>
#define N 101
#define INF 200000000
using namespace std;
int main(void){
int a,b,c,d;
int n,m;
while(cin>>n>>m,n||m){
int dp[m+1][m+1];
int dp1[m+1][m+1];
for(int i=1;i<=m;i++){
for(int j=1;j<=m;j++){
if(i==j)dp[i][j]=dp1[i][j]=0;
else dp[i][j]=dp1[i][j]=INF;
}
}
for(int i=0;i<n;i++){
cin>>a>>b>>c>>d;
dp[b][a]=c;
dp[a][b]=c;
dp1[b][a]=d;
dp1[a][b]=d;
}
for(int k=1;k<=m;k++){
for(int u=1;u<=m;u++){
for(int v=1;v<=m;v++){
dp[u][v]=min(dp[u][v],dp[u][k]+dp[k][v]);
dp1[u][v]=min(dp1[u][v],dp1[u][k]+dp1[k][v]);
}
}
}
int k;
cin>>k;
while(k--){
cin>>a>>b>>c;
if(c) cout<<dp1[a][b]<<endl;
else cout<<dp[a][b]<<endl;
}
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
bool cmp(pair<double, string> p, pair<double, string> q)
{
return (p.first > q.first) || (p.first == q.first && p.second < q.second);
}
int main()
{
int n;
while (cin >> n) {
if (!n)
break;
vector<pair<double, string> > crop;
for (int i = 0; i < n; i++) {
int p, a, b, c, d, e, f, s, m;
string l;
double income = 0.0;
cin >> l >> p >> a >> b >> c >> d >> e >> f >> s >> m;
income = (double)(m * s * f - p) / ((a + b + c) + (d + e) * m);
crop.push_back(pair<double, string>(income, l));
}
sort(crop.begin(), crop.end(), cmp);
for (int i = 0; i < crop.size(); i++)
cout << crop[i].second << endl;
cout << "#\n";
}
return 0;
} | 0 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define LAST(x) x[x.size()-1]
#define ALL(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a -= b)
#define CEIL(a,b) ((a+b-1)/b)
int FACT(int a) {
if (a == 0)
return 1;
else
return a * FACT(a - 1);
}
int nPr(int n, int r) {
int s = n-r+1;
int sum = 1;
for(int i =s;i<=n;i++)
sum *= i;
return sum;
}
//int nCr1(int n, int r)
//int nCr2(int n, int r)
int GCD(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return GCD(b, a % b);
}
int LCM(int a, int b) // assuming a,b >= 1
{
return a * b / GCD(a, b);
}
double LOG(int a, int b) {
return log(b) / log(a);
}
inline bool BETWEEN(int x, int min, int max) {
if (min <= x && x <= max)
return true;
else
return false;
}
using namespace std;
#pragma endregion
signed main() {
int K, N;
cin >> K >> N;
cout << K - N + 1;
} | #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)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n, k;
cin >> n >> k;
k--;
cout << n - k << endl;
} | 1 |
#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);
map<int,int> cnts;
cnts[0] += 1;
int n, m;
cin >> n >> m;
long long res = 0;
long long sum = 0;
for (int i = 0; i < n; ++i) {
long long x;
cin >> x;
sum += x;
res += cnts[sum % m];
cnts[sum % m] += 1;
}
cout << res << '\n';
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <numeric>
#include <iomanip>
#define ll long long
#define pi 3.14159265358979323846
using namespace std;
using p = pair<ll, ll>;
ll dx[4] = {-1, 0, 1, 0};
ll dy[4] = {0, 1, 0, -1};
/* BFS
vector<vector<ll>> g(n+1);
for(ll i = 0; i < m; i++){
ll a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<ll> dist(n+1, -1);
queue<ll> que;
que.push(1);
dist[1] = 0;
while(!que.empty()){
ll v = que.front();
que.pop();
for(ll nv : g[v]){
if(dist[nv]!=-1) continue;
dist[nv] = dist[v]+1;
que.push(nv);
}
}
*/
int main(){
ll n, m;
cin >> n >> m;
ll a[n];
map<ll, ll> I{};
for(ll i = 0; i < n; i++){
cin >> a[i];
a[i] %= m;
I[a[i]]++;
}
ll sum[n+1];
sum[0] = a[0]%m;
for(ll i = 1; i < n; i++){
sum[i] = sum[i-1]+a[i];
sum[i]%=m;
}
sort(sum, sum+n);
sum[n] = -11111111111;
ll ans = 0;
ll count = 1;
for(ll i = 0; i < n; i++){
// cout << sum[i] << endl;
if(sum[i]==0) ans++;
if(sum[i]==sum[i+1]) count++;
else {
ans += count*(count-1)/2;
count = 1;
}
}
ans += count*(count-1)/2;
cout << ans << endl;
return 0;
}
| 1 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vector<int>>;
static long long INF = (1LL<<62);
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
if(A < B){
if(A < C && C < B){
printf("Yes\n");
}
else{
printf("No\n");
}
}
else{
if(B < C && C < A){
printf("Yes\n");
}
else{
printf("No\n");
}
}
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
int a,b,c;
cin>>a>>b>>c;
while(a!=b){
if(a==c){
cout<<"Yes"<<endl;
return 0;
}
if(a<b) a++;
else a--;
}
cout<<"No"<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1e9+7
using namespace std;
typedef long long ll;
const double pi=acos(-1);
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int n;
string s;
cin >> n >> s;
ll r=0,g=0,b=0;
for(int i=0;i<n;i++){
if(s[i]=='R') r++;
else if(s[i]=='G') g++;
else b++;
}
ll sum=r*g*b;
for(int i=0;i<n-2;i++){
for(int j=i+2;j<n;j++){
if((i+j)%2!=0) continue;
if(s[i]!=s[(i+j)/2] && s[i]!=s[j] && s[j]!=s[(i+j)/2]) sum--;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
const int INF = 100000000;
typedef long long ll;
int W,H;
int sy, sx, gy, gx;
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
bool movable(vector<vector<char>> &c, vector<vector<int>> &mat, int h, int w, int hb, int wb) {
if ((h<0) || (h>=H) || (w<0) || (w>=W)) {
return false;
}
else if (mat[h][w]!=INF || (c[h][w]==c[hb][wb])) {
return false;
}
else {
return true;
}
}
ll bfs(vector<vector<char>> &c, vector<vector<int>> &mat, pair<int,int> &q) {
ll k,s;
s=0;
k = 1;
queue<P> que;
que.push(q);
if (mat[q.first][q.second] != INF) return 0;
else (mat[q.first][q.second] = 0);
while(que.size()) {
P p = que.front();
que.pop();
rep(i,4){
if (movable(c,mat,p.first+dy[i],p.second+dx[i],p.first,p.second)) {
que.push(P(p.first+dy[i],p.second+dx[i]));
mat[p.first+dy[i]][p.second+dx[i]]=mat[p.first][p.second]+1;
if (c[p.first+dy[i]][p.second+dx[i]]=='.') s++;
else k++;
}
}
}
return k*s;
}
int main() {
cin >> H >> W;
vector<vector<char>> c(H,vector<char> (W));
vector<pair<int,int>> P;
rep(h,H) {
string s;
cin >> s;
rep(w,W) {
c[h][w] = s[w];
if (s[w]=='#') {
P.push_back(make_pair(h,w));
}
}
}
vector<vector<int>> mat(H,vector<int> (W, INF));
ll ans = 0;
for (auto p: P) {
ll tmp = bfs(c,mat,p);
ans += tmp;
}
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string c(ll n);
int main() {
ll n;
cin >> n;
cout << c(n);
}
string c(ll n) {
// n >= 1
string ans = "";
while(n) {
n--;
ans += (char)('a' + (n % 26));
n/=26;
}
reverse(ans.begin(), ans.end());
return ans;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
int po[22];
int dfs(int i,int dif,int L){
if(i==L/2){
return dif==0;
}
int u=po[L-1-i]-po[i];
int x;
if(dif>=0){
x=(dif+u-1)/u;
}
else{
x=dif/u;
}
int ret=0;
for(int uku=0;uku<2;uku++,x--){
if(x<-9||9<x)continue;
int tmp=dfs(i+1,dif-u*x,L);
int k=10-abs(x);
if(i==0&&x>=0)k--;
ret+=tmp*k;
}
return ret;
}
signed main(){
po[0]=1;
for(int i=1;i<22;i++)po[i]=po[i-1]*10;
int D;cin>>D;
int ans=0;
for(int i=2;i<=18;i++){
int w;
if(i&1)w=10;
else w=1;
ans+=w*dfs(0,D,i);
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;
template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}
ll modPow(ll x, ll n) {
ll ret = 1;
while(n) {
if(n&1LL) (ret *= x) %= MOD;
n >>= 1;
(x *= x) %= MOD;
}
return ret;
}
ll dp[41][(1<<17)+10];
int main(){
int n;
vi v(3);
cin >> n;
rep(i, 3) cin >> v[i];
int sum_v = v[0] + v[1] + v[2];
dp[0][0] = 1;
auto check = [&](int mask) {
bool f = true;
f &= (mask >>=(v[2]-1)) & 1;
f &= (mask >>=v[1]) & 1;
f &= (mask >>=v[0]) & 1;
return f;
};
auto pop_mask = [&](int mask) {
if(mask == 0) return 0;
bool f = true;
repr(i, sum_v) {
if(mask & (1<<i)) {
if(f) {
mask -= (1<<i);
f = false;
break;
}
}
}
return mask;
};
auto getSize = [&](int mask) {
if(mask == 0) return 0;
repr(i, sum_v) {
if(mask&(1<<i)) {
return i+1;
}
}
return 0;
};
auto push_mask = [&](int mask, int add) {
if(add > sum_v) return 0;
while(getSize(mask)+add > sum_v) {
mask = pop_mask(mask);
}
mask <<= add;
mask |= 1<<(add-1);
return mask;
};
rep(i, n) rep(mask, 1<<sum_v) {
REP(k, 1, 11) {
int nxt = push_mask(mask, k);
if(check(mask) || check(nxt)) continue;
(dp[i+1][nxt] += dp[i][mask]) %= MOD;
}
}
ll sum = 0LL;
rep(mask, 1<<sum_v) (sum += dp[n][mask]) %= MOD;
ll ans = modPow(10, n);
(ans += MOD - sum) %= MOD;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#define int long long
using namespace std;
const int mod=1000000007;
int f[42][1<<18],n,x,y,z,i,j,k,lim,tmp;
signed main()
{
cin>>n>>x>>y>>z;
tmp=(1<<(x+y+z-1));
tmp|=(1<<(y+z-1));
tmp|=(1<<(z-1));
lim=(1<<(x+y+z))-1;
f[0][0]=1;
for(i=1;i<=n;i++){
for(j=0;j<=lim;j++){
if(f[i-1][j]==0) continue;
for(k=1;k<=10;k++){
int now=((j<<k)|(1<<(k-1)));
now&=lim;
if((now&tmp)!=tmp) f[i][now]=(f[i][now]+f[i-1][j])%mod;
}
}
}
int ans=1;
for(i=1;i<=n;i++) ans=ans*10%mod;
for(i=0;i<=lim;i++) ans=(ans-f[n][i]+mod)%mod;
cout<<ans<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
int n;
cin >> n;
vector<tuple<ll, ll, ll>> vec;
rep(i, n){
ll a, b;
cin >> a >> b;
vec.push_back(make_tuple(a+b, a, b));
}
sort(all(vec), greater<tuple<ll, ll, ll>>());
ll sumA=0, sumB=0;
rep(i, n){
if(i%2==0){
sumA += get<1>(vec[i]);
}else{
sumB += get<2>(vec[i]);
}
}
cout << sumA-sumB << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e18+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=40000;
#define pq priority_queue
#define ff first
#define ss second
#define pb push_back
#define lb lower_bound
int main()
{
int i,j,k,l,m,n;
string s;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
l=0;
sort(a,a+n);
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
for(k=j+1;k<n;k++)
{
if(a[i]==a[j]||a[i]==a[k]||a[j]==a[k])
continue;
if(a[i]+a[j]>a[k])
l++;
}
}
}
cout<<l;
} | 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
long long F(long long A){
long long ta = A;
long long fa = 0;
for(int i = 0; i <= 10; i++){
if(ta <= 0) break;
ta /= 10;
fa++;
}
return fa;
}
int main() {
long long N;
cin >> N;
long long n = sqrt(N);
long long min = 10;
for(int i = 1; i <= n; i++){
if(N%i == 0){
long long A = i;
long long B = N / i;
long long m;
if(F(A) > F(B)) m = F(A);
else m = F(B);
if(min > m) min = m;
}
}
cout << min << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
//cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
// https://github.com/atcoder/live_library
// cppdbg: test.exeのterminalに標準入力を打てる
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll; //long long
typedef pair<int,int> pii; //pair<int,int>
typedef pair<long long,long long> pllll; //pair<ll,ll>
typedef vector<int> vi; //vector<int>
typedef vector<vector<int>> vvi; //vector<vector<int>>
typedef vector<ll> vll; //vector<long long>
typedef vector<vector<ll>> vvll; //vector<vector<long long>>
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq; //逆順priority_queue
typedef priority_queue<ll> pq;
//const int MOD=998244353;
const int MOD=1000000007; //10^9+7
const long double PI=3.1415926535897932;
int main(){
string S;cin>>S;
int L=S.size();
if(S[0]!='A'){
cout<<"WA"<<endl;return 0;
}
int c_count=0;
for(int i=2;i<L-1;i++){
if(S[i]=='C')c_count++;
}
if(c_count!=1){
cout<<"WA"<<endl;return 0;
}
for(int i=1;i<L;i++){
if((S[i]<'a'||'z'<S[i]) && S[i]!='C'){
cout<<"WA"<<endl;return 0;
}
}
cout<<"AC"<<endl;return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb(x) push_back(x)
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int di[4] = {1,0,-1,0};
const int dj[4] = {0,1,0,-1};
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll ans = 0;
for (int i=1; i<n; i++) {
if (a[i-1]<=a[i]) continue;
ans += a[i-1]-a[i];
a[i] += a[i-1]-a[i];
}
cout << ans << endl;
} | #include<cstdint>
#include<limits>
#include<cstdbool>
#include<cmath>
#include<iostream>
#include<vector>
#include<array>
#include<list>
#include<string>
#include<sstream>
#include<algorithm>
int main(){
int n,h,w;
std::cin>>n>>h>>w;
std::cout<<1+(n-h)+(n-w)+(n-h)*(n-w);
}
| 0 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
const ll mod = 1e9 + 7;
ll add(ll x, ll y){
return (x+y)%mod;
}
ll mul(ll x, ll y){
return (x%mod)*(y%mod)%mod;
}
ll powll(ll x, ll y){
x %= mod;
ll res = 1LL;
while(y){
if (y & 1LL)
res *= x;
res %= mod;
x = (x*x) % mod;
y >>= 1LL;
}
return res;
}
ll naive(VI a, int x){
// cout << "naive" << endl;
int n = a.size();
VVL dp(n + 1, VL(2));
dp[0][0] = 1;
int y = 0;
REP(i,n){
y ^= a[i];
if (y == x){
REP(j,i+1) dp[i+1][1] += dp[j][0];
}
if (y == 0){
REP(j,i+1) dp[i+1][0] += dp[j][1];
}
// cout << dp[0] << " " << dp[1] << endl;
}
// REP(i,n+1) cout << dp[i][0] << " " << dp[i][1] <<endl;
return dp[n][0];
}
ll calc(VL a, VL b){
int n = a.size();
if (n == 1) return a[0];
VL dp(n);
dp[0] = a[0];
ll sum = dp[0], tmp = 0;
REP(i,n-1){
tmp = (tmp + b[i] * sum) % mod;
dp[i + 1] = ((tmp + 1) * a[i + 1]) % mod;
sum = (sum + dp[i + 1]) % mod;
}
ll ret = 0;
REP(i,n) ret = (ret + dp[i]) % mod;
return ret;
}
int main() {
int n;
cin >> n;
VI a(n);
int x = 0;
REP(i,n){
a[i] = in();
x ^= a[i];
}
if (x != 0){
VL dp(2);
dp[0] = 1;
int y = 0;
REP(i,n){
y ^= a[i];
if (y == x){
dp[1] = (dp[1] + dp[0]) % mod;
}
if (y == 0){
dp[0] = (dp[0] + dp[1]) % mod;
}
}
cout << dp[0] << endl;
return 0;
}
ll cnt = 0;
int j = 0;
map<int, VL> mpc, mpl;
map<int, int> last;
REP(i,n){
x ^= a[i];
if (x == 0){
map<int, ll> tmp;
int p = 0;
FOR(k,j,i-1){
p ^= a[k];
tmp[p]++;
}
// FOR(k,j,i){
// cout << a[k] << " ";
// }
// cout << endl;
for (auto hoge : tmp){
int p = hoge.first;
ll c = hoge.second;
mpc[p].push_back(c);
if (last.count(p)){
mpl[p].push_back(cnt - last[p]);
}
last[p] = cnt;
}
cnt++;
j = i + 1;
}
}
// cout << cnt << " " << powll(2, cnt - 1) << endl;
ll ans = powll(2, cnt - 1);
for (auto tmp : mpc){
int x = tmp.first;
// cout << "x" << x << endl;
// for (int c : mpc[x]) cout << c << " ";
// cout << endl;
// for (int l : mpl[x]) cout << l << " ";
// cout << endl;
// cout << naive(a, x) << endl;
ans = (ans + calc(mpc[x], mpl[x])) % mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< pii >
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; cin >> x;
#define int2(x, y) Int(x); Int(y);
#define int3(x, y, z) Int(x); int2(y, z);
#define in(x, a, b) ((a) <= (x) && (x) < (b))
#define fir first
#define sec second
#define ffir first.first
#define fsec first.second
#define sfir second.first
#define ssec second.second
#define Decimal fixed << setprecision(10)
//int dxy[5] = {0, 1, 0, -1, 0};
// cmd
signed main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
Int(n);
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
Rep(i, n) data[i] ^= data[i-1];
vi dp0(1 << 20, 1), dp1(1 << 20, 0), zeros(1 << 20, 0);
// 始点に 0 があると考えるので全ての x について初期0数1個
int zero = 0;
rep(i, n) {
if (!data[i]) {
zero++;
} else {
(dp0[data[i]] += dp1[data[i]] * (zero - zeros[data[i]])) %= MOD; // 0 の累積を求める
(dp1[data[i]] += dp0[data[i]]) %= MOD; // i 番目の解が求められ、区間の値 k = data[i] の時の解の累積が増える
zeros[data[i]] = zero;
//std::cout << dp0[data[i]] << " , " << dp1[data[i]] << std::endl;
}
}
if (data.back()) {
std::cout << dp0[data.back()] << std::endl;
} else {
int ans = 1;
rep(i, zero-1) ans = (ans * 2) % MOD;
rep(i, dp1.size()) ans += dp1[i];
std::cout << ans % MOD << std::endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
while(getline(cin,s)){t=s;
for(int i=0;i<26;i++){
s=t;
for(int j=0;j<s.size();j++){
if(s[j]>='a'&&s[j]<='z')for(int k=0;k<i;k++){
s[j]++;
if(s[j]>'z')s[j]-=26;
}
}
if((s.find("the")!=s.npos||s.find("this")!=s.npos||s.find("that")!=s.npos))break;
}
cout<<s<<endl;}
} | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;
//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
int H, W, A, B; cin >> H >> W >> A >> B;
rep(i, H){
rep(j, W){
if(i<B){
if(j<A) cout << 1;
else cout << 0;
}else{
if(j<A) cout << 0;
else cout << 1;
}
}
cout << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//init();
//int t; cin >> t; rep(i, t)solve();
solve();
// stop
return 0;
}
| 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.