code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) {
string tmp;
cin >> tmp;
for(int j = 0; j < w; j++) {
int idx=i*w+j;
if(tmp[j]=='#'){
a[idx]=true;
que.push(idx);
}
}
}
int cnt=0;
int ans=0;
while(cnt<h*w) {
int n=que.size();
cnt+=n;
for(int i = 0; i < n; i++) {
int idx=que.front();
int add[4]={1,-1,w,-w};
for(int j = 0; j < 4; j++) {
int t=idx+add[j];
int r=idx/w+add[j]/w;
int c=idx%w+add[j]%w;
if(r<0||r>=h||c<0||c>=w||a[t]==true) continue;
a[t]=true;
que.push(t);
}
que.pop();
}
ans++;
}
cout << ans-1 << "\n";
return 0;
} | #include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
const int INF=1e5;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int main(){
int h,w,a[1009][1009];
string s[1009];
cin >> h >> w;
memset(a, -1, sizeof(a));
for(int i=0;i<h;i++)cin >> s[i];
queue<P> q;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(s[i][j]=='#'){
a[i][j]=0;
q.push(P(i,j));
}
}
}
int mx=0;
while(!q.empty()){
P p=q.front();q.pop();
int ci=p.first;
int cj=p.second;
for(int i=0;i<4;i++){
int ni=ci+dy[i];
int nj=cj+dx[i];
if(!(0<=ni&&ni<h&&0<=nj&&nj<w))continue;
if(a[ni][nj]==-1){
a[ni][nj]=a[ci][cj]+1;
mx = max(mx, a[ni][nj]);
q.push(P(ni, nj));
}
}
}
cout << mx << endl;
}
| 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
void yes(){
cout << "Yes" << endl;
}
void no (){
cout << "No" << endl;
}
ll cel (ll a, ll b){
if (a % b == 0) return a / b;
else return a / b + 1;
}
ll gcds(ll a, ll b){
ll c = a % b;
while (c != 0){
a = b;
b = c;
c = a % b;
}
return b;
}
int hen(vector<ll> p){
int ans = 1;
ll mi = p[1];
rep(i,2){
if (mi > p[i+2]){
mi = p[i+2];
ans = i+2;
}
}
return ans;
}
int main() {
int n; cin >> n;
if (n == 1) cout << "Hello World" << endl;
else if (n == 2){
int a, b; cin >> a >> b;
cout << a + b << endl;
}
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <limits>
#include <iomanip>
using namespace std;
using ll = long long;
constexpr ll INF = 1010000000000000017LL;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
ll GCD(ll a, ll b) { if(b==0) return a; else return GCD(b, a%b); }
ll LCM(ll a, ll b) { return a/GCD(a,b)*b; }
class AProgrammingEducation {
public:
void solve(std::istream& in, std::ostream& out) {
int n;in>>n;
if(n==1){
out<<"Hello World"<<endl;
} else {
int a,b;in>>a>>b;
out<<a+b<<endl;
}
}
};
int main() {
AProgrammingEducation solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll k;
int main(){
scanf("%lld",&k);
int n=50;
vector<ll> v(n,n-1);
for(int i=0;i<n;i++)v[i]+=k/n;
for(int i=0;i<n;i++)v[i]-=k%n;
for(int i=0;i<k%n;i++)v[i]+=n+1;
printf("%d\n",n);
for(int i=0;i<n;i++)printf("%lld ",v[i]);
printf("\n");
return 0;
} |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
#define capi(x) int x;cin>>x
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using vi = vector<int>;
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b){if(b<a){a=b;return 1;}return 0;}
#define P (1'000'000'007)
template<int MOD=P>
struct Mod {
public:
long long signed value;
Mod(long long signed val): value(val % MOD) {
if (value < 0) value += MOD;
}
constexpr Mod& operator+=(const Mod& other) noexcept {
value += other.value;
value %= MOD;
return *this;
}
constexpr Mod& operator-=(const Mod& other) noexcept {
value -= other.value;
if (value < 0) value += MOD;
return *this;
}
constexpr Mod& operator*=(const Mod& other) noexcept {
value *= other.value;
value %= MOD;
return *this;
}
constexpr Mod operator-() noexcept {
return value == 0 ? 0 : MOD - value;
}
constexpr Mod operator+(const Mod& other) const noexcept { return Mod(*this) += other; }
constexpr Mod operator-(const Mod& other) const noexcept { return Mod(*this) -= other; }
constexpr Mod operator*(const Mod& other) const noexcept { return Mod(*this) *= other; }
constexpr bool operator==(const Mod& other) const noexcept { return this->value == other.value; }
constexpr bool operator!=(const Mod& other) const noexcept { return this->value != other.value; }
};
signed main() {
capi(n);
int d[61][2] = {0};
rep(i, n) {
capi(a);
rep(j, 61) {
++d[j][a & 1];
a >>= 1;
}
}
Mod ans(0);
rep(j, 61) {
Mod x(1ll << j);
x *= d[j][0] * d[j][1];
ans += x;
}
cout << ans.value;
return 0;
}
| 0 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<list>
#include<stack>
#include<queue>
#include<cctype>
#include<iomanip>
#include<functional>
#include<numeric>
#define EPS 1e-10
using namespace std;
typedef long long llong;
void whatday(int m, int d) {
int z;
if (m == 1)z = d;
else if (m == 2)z = 31 + d;
else if (m == 3)z = 60 + d;
else if (m == 4)z = 91 + d;
else if (m == 5)z = 121 + d;
else if (m == 6)z = 152 + d;
else if (m == 7)z = 182 + d;
else if (m == 8)z = 213 + d;
else if (m == 9)z = 244 + d;
else if (m == 10)z = 274 + d;
else if (m == 11)z = 305 + d;
else if (m == 12)z = 335 + d;
if (z % 7 == 5)cout << "Monday" << endl;
else if (z % 7 == 6 % 7)cout << "Tuesday" << endl;
else if (z % 7 == 0 % 7)cout << "Wednesday" << endl;
else if (z % 7 == 1 % 7)cout << "Thursday" << endl;
else if (z % 7 == 2 % 7)cout << "Friday" << endl;
else if (z % 7 == 3 % 7)cout << "Saturday" << endl;
else if (z % 7 == 4 % 7)cout << "Sunday" << endl;
}
int main() {
int m, d;
while (cin >> m >> d&&m&&d) {
whatday(m, d);
}
return 0;
} | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;
int N;
int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };
int day = 0, month = 0;
void input(void) {
CI month >> day;
return;
}
int main(void) {
int weekday = 0;
int y = 2004;
string dayname[] = { "Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday" };
while (true) {
input();
if (day == 0) {
break;
}
if (month < 3) {
y--; month += 12;
}
weekday = (y + (y / 4) - (y / 100) + (y / 400) + (13 * month + 8) / 5 + day) % 7;
y = 2004;
CO dayname[weekday] E
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j) -> bool { return abs(i) < abs(j); });
using namespace std;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using ll = long long;
double pi=3.14159265359;
//出力するよ
void output(vector<int> s)
{
int n = s.size();
for (int i = 0; i < n; i++)
{
if (i != 0)
cout << " ";
cout << s[i]; //<<endl;
}
cout << endl;
}
int MOD = pow(10, 9) + 7;
//各要素で最低操作回数を数える
pair<int,int> count(vector<int> a,vector<int> b){
int n=a.size();
int a_cnt=0,b_cnt=0;
for(int i=0;i<n;i++){
if(a[i]>b[i]){
b_cnt+=(a[i]-b[i]);
}
if(a[i]<b[i]){
if((b[i]-a[i])%2==0){
a_cnt+=(b[i]-a[i])/2;
}else{
a_cnt+=(b[i]-a[i])/2 +1;
}
}
}
return make_pair(a_cnt,b_cnt);
}
signed main(){
//スタックで処理することでいい感じに出来る。
//STが作れたら上の要素をポップしていく。最終的にスタックの長さが答えになる。
stack<char> st;
string s; cin>>s;
int n=s.length();
for(int i=0;i<n;i++){
//cout<<s[i]<<endl;
if(st.size()==0) st.push(s[i]);
else{
char c=st.top();
if(c=='S'&&s[i]=='T'){
st.pop();
}else st.push(s[i]);
}
}
cout<<st.size()<<endl;
} | #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 rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#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;
int main(){
string s;
cin >> s;
stack<char> stk;
int co = 0;
rep(i, s.size()){
if(s.at(i) == 'S'){
stk.push('S');
}else{
if(!stk.empty()){
stk.pop();
co++;
}
}
}
cout << s.size()-2*co << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef pair<int,int> int_pair;
typedef pair<ll,ll> ll_pair;
#define N 1002
#define INF 1e9+1
int Levenshtein(string s1,string s2){//hensyu kyori
vector<vector<int> > dp;
int ss1=s1.size(),ss2=s2.size();
int n=max(ss1,ss2)+1;
dp.resize(n);for(int i=0;i<n;i++)dp[i].resize(n);
for(int i=0;i<ss1+1;i++)dp[i][0]=i;
for(int i=0;i<ss2+1;i++)dp[0][i]=i;
for(int i=1;i<ss1+1;i++){
for(int j=1;j<ss2+1;j++){
int a,b=1;
if(s1[i-1]==s2[j-1])b=0;
a=min(dp[i-1][j]+1,dp[i][j-1]+1);
a=min(a,dp[i-1][j-1]+b);
dp[i][j]=a;
}
}
return dp[s1.size()][s2.size()];
}
string s1,s2;
int main(){
cin>>s1>>s2;
cout<<Levenshtein(s1,s2)<<endl;
return 0;
}
| #include <stdint.h>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <iostream>
#include <bitset>
#include <array>
#include <stdio.h>
using namespace std;
# define MAX 1000
uint64_t D0[MAX]={0}, HP[MAX]={0}, HN[MAX]={0}, VP[MAX]={0}, VN[MAX]={0};
uint64_t Cmap[MAX][20] = {};
int Mayer(size_t M, size_t N, string &a, string &b){
unsigned int tmax = (M - 1) >> 6;
unsigned int tlen = M - tmax * 64;
// cout << "M:" << M << " " << "N:" << N << endl;
// cout << "tmax:" << tmax << endl;
// cout << "tlen:" << tlen << endl;
for(size_t i = 0; i < tmax; ++i) {
for(size_t j = 0; j < 64; ++j) Cmap[a[i * 64 + j]][i] |= (1L << j);
}
for(size_t i = 0; i < tlen; ++i){
Cmap[a[tmax * 64 + i]][tmax] |= (1L << i);
// printf("%c\n", a[tmax * 64 + i]);
}
int D = tmax * 64 + tlen;
uint64_t top = (1L << (tlen - 1));
uint64_t lmb = (1L << 63);
for(size_t i = 0; i < tmax; ++i) VP[i] = ~0;
for(size_t i = 0; i < tlen; ++i) VP[tmax] |= (1L << i);
for(size_t i = 0; i < N; ++i) {
uint64_t *PM = Cmap[b[i]];
for(int r = 0; r <= tmax; ++r) {
uint64_t X = PM[r];
if(r > 0 && (HN[r - 1] & lmb)) X |= 1L;
D0[r] = (((X & VP[r]) + VP[r]) ^ VP[r]) | X | VN[r];
HP[r] = VN[r] | ~(D0[r] | VP[r]);
HN[r] = D0[r] & VP[r];
X = (HP[r] << 1L);
if(r == 0 || HP[r - 1] & lmb) X |= 1L;
VP[r] = (HN[r] << 1L) | ~(D0[r] | X);
if(r > 0 && (HN[r - 1] & lmb)) VP[r] |= 1L;
VN[r] = D0[r] & X;
}
if(HP[tmax] & top) ++D;
else if(HN[tmax] & top) --D;
}
// free(D0), free(HP), free(HN), free(VP), free(VN);
return D;
}
int main() {
string str1, str2;
std::cin >> str1 >> str2;
if(str1.length() > str2.length()){
string tmp = str1;
str1 = str2;
str2 = tmp;
}
// int res = edit_distance_fixed_<1000, string, 1000>(str1,str2);
int res = Mayer(str1.length(), str2.length(), str1, str2);
std::cout << res << std::endl;
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <numeric>
#include <iomanip>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second
#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
#define MAX_N 20000
#define MAX_M 16
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
string s;
vector<P> p;//fi:pos se:co
int main(){
cin >> s;
int ans = 0;
int pos = 0;
int co = 0;
REP(i, s.size()){
if (s[i] == 'O'){
if (co == 0)pos = i;
co++;
}
else if (co > 0){
if (s[i] != 'O'){
p.push_back(P(pos, co));
co = 0;
}
}
}
if (co > 0)p.push_back(P(pos, co));
REP(i, p.size()){
int po = p[i].first;
int w = p[i].second;
//cout << po << " " << w << endl;
bool f = 1;
if (po - w >= 0){
string t = s.substr(po - w, w);
//cout << t << endl;
REP(j, t.size()){
if (t[j] != 'J')f = 0;
}
}
else f = 0;
if (po + w + w - 1 <= s.size() - 1){
string t = s.substr(po + w, w);
//cout << t << endl;
REP(j, t.size()){
if (t[j] != 'I')f = 0;
}
}
else f = 0;
if (f)ans = max(ans, w);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,l) for(lli i=s;i<l;i++)
#define DEBUG 0
#define INF (1LL<<50)
#define MOD 1000000007
#define rev(v) reverse(v.begin(), v.end());
bool comp(int a, int b){
return (a<b);
}
int main(){
int n; cin >> n;
int a, b;
if(n==1) cout << "Hello World";
else{
cin >> a >> b;
cout << a+b;
}
cout << endl;
return 0;
} | 0 |
#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() {
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.insert(c);
for (auto &i : s) d.erase(i);
if (d.size()) {
s += *d.begin();
cout << s << '\n';
return;
}
set<char> g;
while (s.size()) {
char c = s.back();
s.pop_back();
auto it = g.upper_bound(c);
if (it != g.end()) {
s += *it;
cout << s << '\n';
return;
}
g.insert(c);
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <random>
#include <cassert>
#include <numeric>
#define ll long long int
#define LL unsigned long long
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
using namespace std;
int mx8[] = {0,0,1,-1,-1,1,-1,1};
int my8[] = {-1,1,0,0,-1,-1,1,1};
int mx4[] = {1,-1,0,0};
int my4[] = {0,0,-1,1};
const int MOD = 1000000007;
ll y[10000005];
int main() {
string s; cin >> s;
int n = s.size();
map<char,int> mp;
rep(i,n) mp[s[i]]++;
rep(i,26){
if(!mp[char (i+97)]){
cout << s + char(i+97) << endl;
return 0;
}
}
if(s == "zyxwvutsrqponmlkjihgfedcba") cout << -1 << endl;
else {
for(int i = n-1; i >= 1; i--){
if(s[i-1] < s[i]){
rep(j,i-1){
cout << s[j];
}
for(int j = n-1; j>=1;j--){
if(s[i-1] < s[j]){
cout << s[j];
return 0;
}
}
return 0;
}
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
int field[606][606][2];
int D[2];
int N;
vector<int> dx[2];
vector<int> dy[2];
void bfs(int x, int y, int index, int val) {
if(x < 0 || x >= 2 * N || y < 0 || y >= 2 * N) return;
if(field[x][y][index] != 0) return;
field[x][y][index] = val;
for(int i = 0; i < dx[index].size(); i++) {
bfs(x+dx[index][i], y+dy[index][i], index, 3 - val);
}
}
void print(vector<l_l> in) {
for(int i = 0; i < N * N; i++) {
cout << in[i].first << " " << in[i].second << endl;
}
}
int main() {
//cout.precision(10);
cin >> N >> D[0] >> D[1];
for(int index = 0; index < 2; index++) {
for(int x = 0; x < 2 * N; x++) {
for(int y = 0; y < 2 * N; y++) {
if(x * x + y * y == D[index]) {
dx[index].push_back(x);
dx[index].push_back(x);
dx[index].push_back(-x);
dx[index].push_back(-x);
dy[index].push_back(y);
dy[index].push_back(-y);
dy[index].push_back(y);
dy[index].push_back(-y);
}
}
}
}
for(int index = 0; index < 2; index++) {
for(int x = 0; x < 2 * N; x++) {
for(int y = 0; y < 2 * N; y++) bfs(x, y, index, 1);
}
}
/*
for(int index = 0; index < 2; index++) {
for(int x = 0; x < 2 * N; x++) {
for(int y = 0; y < 2 * N; y++) cerr << field[x][y][index] << " ";
cerr << endl;
}
cerr << endl;
}
*/
vector<l_l> ans;
for(int val = 1; val <= 2; val++) {
ans.clear();
for(int x = 0; x < 2 * N; x++) {
for(int y = 0; y < 2 * N; y++) {
if(field[x][y][0] == 1 && field[x][y][1] == val) ans.push_back({x, y});
}
}
if(ans.size() >= N * N) {
print(ans);
return 0;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int n,D_1,D_2,cnt;
bool chk(int i,int j,int d){
int u=__builtin_ctz(d);
if(u&1)return!(i>>(u/2)&1);
else return!((i^j)>>(u/2)&1);
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>D_1>>D_2;
for(int i=0;i<2*n;++i)
for(int j=0;j<2*n;++j)
if(chk(i,j,D_1)&&chk(i,j,D_2)){
cout<<i<<' '<<j<<'\n';
if(++cnt>=n*n)return 0;
}
return 0;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
int main(){
int N,Q,M,Date[101],i,l,k;
while(0<=scanf("%d%d",&N,&Q)){
for(i=0;i<101;i++){
Date[i]=0;
}
if((N==0) && (Q==0)){
break;
}
for(k=0;k<N;k++){
scanf("%d",&M);
if(M==0){
continue;
}else{
for(i=0;i<M;i++){
scanf("%d",&l);
++Date[l];
}
}
}
l=0;
i=0;
for(k=0;k<100;k++){
if(i<Date[k] && Date[k]>=Q){
i=Date[k];
l=k;
}
}
printf("%d\n",l);
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second
#define PI acos(-1.0)
#define INF 1000000007
#define MOD 1000000007
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
typedef pair<int, string> PSI;
int n, q;
int m;
int main(){
while (cin >> n >> q&&n + q){
int num, ans = 0, ma = q;
int cnt[100] = {};
REP(i, n){
cin >> m;
REP(j, m){
cin >> num;
cnt[num]++;
}
}
REP(i, 100){
ma = max(ma, cnt[i]);
}
REP(i, 100){
if (ma == cnt[i]){
ans = i;
break;
}
}
cout << ans << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<double,string> pds;
bool hikaku(pds lhs,pds rhs){
if(lhs.first>rhs.first) return true;
else if(lhs.first==rhs.first)return lhs.second<rhs.second;
else return false;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin>>n,n){
string l;
double p,a,b,c,d,e,f,s,m;
vector<pds> v;
for(int i=0;i<n;i++){
cin >>l>>p>>a>>b>>c>>d>>e>>f>>s>>m;
double eff=(f*s*m-p)/(a+b+c+m*(d+e));
v.push_back(make_pair(eff,l));
//cout<<eff<<" "<<l<<endl;
}
sort(v.begin(),v.end(),hikaku);
for(int i=0;i<n;i++){
cout << v[i].second <<endl;//<< " "<<v[i].first<< endl;
}
cout <<"#" << endl;
}
} | #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
struct Info{
char name[21];
double seed_price,before_leaf,after_leaf,num,sell_price,count,rate;
};
//???????????????????????????3,left?????????????????´??????1,right?????????????????¨??????2
int strCmp2(char* left,char* right){
int i;
for(i=0;left[i] != '\0' && right[i] != '\0'; i++){
if(left[i] != right[i]){
if(left[i] < right[i])return 1;
else{
return 2;
}
}
}
if(left[i] == '\0')return 1;
else{
return 2;
}
}
void func(int N){
Info info[N];
double A,B,C,D,E,sum,total_time;
for(int loop = 0; loop < N; loop++){
scanf("%s %lf %lf %lf %lf %lf %lf %lf %lf %lf",info[loop].name,&info[loop].seed_price,&A,&B,&C,&D,&E,&info[loop].num,&info[loop].sell_price,&info[loop].count);
info[loop].before_leaf = A+B+C;
info[loop].after_leaf = D+E;
sum = 0;
total_time = info[loop].before_leaf;
for(int i = 0; i < info[loop].count; i++){
total_time += info[loop].after_leaf;
sum += info[loop].sell_price*info[loop].num;
}
sum -= info[loop].seed_price;
info[loop].rate = sum/total_time;
}
for(int i = 1; i <= N-1; i++){
for(int k = N-1; k >= i; k--){
if(info[k].rate > info[k-1].rate)swap(info[k],info[k-1]);
else if(info[k].rate == info[k-1].rate && strCmp2(info[k].name,info[k-1].name) == 1)swap(info[k],info[k-1]);
}
}
for(int i = 0; i < N; i++)printf("%s\n",info[i].name);
printf("#\n");
}
int main(){
int N;
while(true){
scanf("%d",&N);
if(N == 0)break;
func(N);
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300 + 10;
typedef long long ll;
const ll mod = 998244353;
int tot, K;
char s[maxn];
int a[maxn];
ll f[maxn][maxn][maxn];
ll ans;
inline ll norm(const ll & x) { return x >= mod ? x - mod : x;}
int main()
{
scanf("%s%d", s + 1, &K);
K = min(K, 300);
int len = strlen(s + 1);
reverse(s + 1, s + len + 1);
int cur = 0;
for(int i = 1; i <= len; ++i)
if(s[i] == '0')
{
a[++tot] = cur;
cur = 0;
}
else
++cur;
a[++tot] = cur;
f[0][0][0] = 1;
for(int i = 1; i <= tot; ++i)
for(int k = 0; k <= K; ++k)
{
for(int j = k; ~j; --j)
f[i][j][k] = norm(f[i - 1][j][k] + f[i][j + 1][k]);
for(int j = 0; j <= k; ++j)
{
/*
for(int jd = j; jd <= k; ++jd)
f[i][j][k] = (f[i][j][k] + f[i - 1][jd][k]) % mod;
*/
int lim = min(j, a[i]);
for(int jd = 1; jd <= lim; ++jd)
f[i][j][k] = norm(f[i][j][k] + f[i - 1][j - jd][k - jd]);
}
}
for(int k = 0; k <= K; ++k)
ans = norm(ans + f[tot][0][k]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#define se second
#define bw(i, r, l) for (int i = r - 1; i >= l; i--)
#define fw(i, l, r) for (int i = l; i < r; i++)
#define fa(i, x) for (auto i: x)
using namespace std;
const int mod = 998244353, inf = 1061109567;
const long long infll = 4557430888798830399;
const int N = 4005;
int n, k, fac[N], ifac[N];
void add(int &x, int y) {
x += y; if (x >= mod) x -= mod;
}
void rem(int &x, int y) {
x -= y;
if (x < 0) x += mod;
}
int mul(int x, int y) {
return 1ll * x * y % mod;
}
int fpow(int a, int p) {
if (!p) return 1;
int tmp = fpow(a, p >> 1);
tmp = mul(tmp, tmp);
if (p & 1) tmp = mul(tmp, a);
return tmp;
}
int inv(int a) {
return fpow(a, mod - 2);
}
int C(int n, int k) {
if (n < k || k < 0) return 0;
return mul(fac[n], mul(ifac[k], ifac[n - k]));
}
int solve(int i, int tot) {
int special = 0, vari = 0;
fw (j, 1, k + 1) {
int other = i - j;
if (other > 0 && other <= k) {
if (j < other) special++, vari++;
} else vari++;
}
int ans = 0, curPow = 1;
fw (j, 0, special + 1) {
int cntWays = C(special, j);
int cntLeft = vari - special;
add(ans, mul(mul(cntWays, curPow), C(tot + cntLeft - 1, j + cntLeft - 1)));
curPow = mul(curPow, 2);
}
return ans;
}
signed main() {
#ifdef BLU
in("blu.inp");
#endif
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
fac[0] = ifac[0] = 1;
fw (i, 1, N) {
fac[i] = 1ll * fac[i - 1] * i % mod;
ifac[i] = inv(fac[i]);
}
cin >> k >> n;
fw (i, 2, 2 * k + 1) {
int ans = 0;
if (i & 1) {
add(ans, solve(i, n));
} else {
fw (haveHalf, 0, 2) add(ans, solve(i, n - haveHalf));
}
cout << ans << "\n";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int N;long long base=1000000007LL;
int main() {
cin >> N;
long long A[3][N];long long count=3LL;
for (int i=0;i<N;i++) {
for (int j=0;j<3;j++) {
A[j][i]=0LL;
}
}
for (int i=0;i<N;i++) {
long long x;cin >> x;
if (i==0) {
A[0][0]=1LL;
if (x!=0) count=0LL;
}
else {
long long y=0LL;bool tuika=false;
for (int j=0;j<3;j++) {
if (A[j][i-1]==x) {
y++;
if (!tuika) {
A[j][i]=A[j][i-1]+1LL;
tuika=true;
}
else A[j][i]=A[j][i-1];
}
else A[j][i]=A[j][i-1];
}
count*=y;
count=count%base;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<int,int>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = 1<<30;
const ll mod = 1000000007LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin>>N;
vector<int> A(N);
rep(i,N) cin>>A[i];
map<int,int> m;
m[0]=3;
ll ans = 1;
rep(i,N){
ans = (ans*m[A[i]])%mod;
m[A[i]]--;
m[A[i]+1]++;
}
cout<<ans<<endl;
} | 1 |
#include <iostream>
using namespace std;
int main(void){
long long n,a,min=1000000,max=-1000000,s=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a>max)max=a;
if(a<min)min=a;
s=s+a;
}
cout<<min<<" "<<max<<" "<<s<<endl;
}
| #include <bits/stdc++.h>
using namespace std ;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a,a+3);
int Ans = a[0]+a[1];
cout << Ans << endl;
} | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define INF (1<<27)
int cost[100][100];
int main() {
int n,k;
while(scanf("%d %d",&n,&k),n) {
fill((int*)cost,(int*)(cost+100),INF);
for(int i=0;i<k;i++) {
int a,b,c;
scanf("%d",&a);
if(a==0) {
scanf("%d %d",&a,&b);
if(cost[a-1][b-1]==INF)
printf("-1\n");
else
printf("%d\n",cost[a-1][b-1]);
}else {
scanf("%d %d %d",&a,&b,&c);
if(cost[a-1][b-1]>c) {
cost[a-1][b-1]=cost[b-1][a-1]=c;
for(int k=0;k<n;k++) {
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);
}
}
}
}
}
}
}
} | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <utility>
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
using namespace std;
typedef pair<int, int> P;
const int inf = 1e9;
int n, k;
vector<P> vec[101];
int d[101];
void dijkstra(int s){
pq<P, vector<P>, greater<P> > q;
q.push(mk(0, s));
d[s] = 0;
while(!q.empty()){
P p = q.top(); q.pop();
int at = p.second;
int dis = p.first;
if(d[at] < dis)continue;
for(auto itr = vec[at].begin(); itr != vec[at].end(); ++itr){
int to = (*itr).second;
int cost = (*itr).first;
if(d[to] > dis + cost){
d[to] = dis + cost;
q.push(mk(d[to], to));
}
}
}
}
int main(int argc, char const* argv[])
{
do{
cin >> n >> k;
for(int i = 0; i < n; i++){
vec[i].erase(vec[i].begin(), vec[i].end());
}
for(int i = 0; i < k; i++){
int a;
cin >> a;
if(a == 0){
int b, c;
cin >> b >> c;
b--; c--;
fill(d, d+n, inf);
dijkstra(b);
if(d[c] == inf)cout << -1 << endl;
else cout << d[c] << endl;
}else{
int b, c, dd;
cin >> b >> c >> dd;
b--; c--;
vec[b].pb(mk(dd, c));
vec[c].pb(mk(dd, b));
}
}
}while(n != 0);
return 0;
}
| 1 |
#include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x);
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
const int INF = 1e9;
const double EPS = 1e-8;
const double PI = 3.14159;
int dx[4]={0, 1, 0, -1}, dy[4]={-1, 0, 1, 0};
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
/* struct P {
int x, y, n;
P(int n, int x, int y):n(n), x(x), y(y){}
P(){}
}; */
/** Problem0207 : Block **/
int main()
{
int W, H;
while (cin>>W>>H, W||H) {
vector<vector<int> > board(W, vector<int>(H));
int sx, sy, gx, gy;
cin>>sx>>sy>>gx>>gy;
sx--, sy--, gx--, gy--;
int N; cin>>N;
while (N--) {
int c, d, x, y; cin>>c>>d>>x>>y;
x--, y--;
if (d==0) {
board[x][y] = board[x+1][y] = board[x+2][y] = board[x+3][y] = c;
board[x][y+1] = board[x+1][y+1] = board[x+2][y+1] = board[x+3][y+1] = c;
} else {
board[x][y] = board[x][y+1] = board[x][y+2] = board[x][y+3] = c;
board[x+1][y] = board[x+1][y+1] = board[x+1][y+2] = board[x+1][y+3] = c;
}
}
/**
rep(i, H) {
rep(j, W) {
cerr << board[j][i] << " ";
}
cerr << endl;
} **/
queue<P> Q;
bool vis[100][100]={0};
Q.push(P(sx, sy));
vis[sx][sy]=true;
while (Q.size()) {
P p = Q.front(); Q.pop();
if (p.first == gx && p.second == gy) {
cout << "OK" << endl;
goto end;
}
rep(i, 4) {
int nx = p.first+dx[i], ny = p.second+dy[i];
if_range(nx, ny, W, H) {
if (!vis[nx][ny] && board[nx][ny] == board[p.first][p.second]) {
Q.push(P(nx, ny));
vis[nx][ny] = true;
}
}
}
}
cout << "NG" << endl;
end:;
}
} | #include <stdio.h>
const int INF=2147483647;
struct segment_tree{
int map[2000010];
void build(int now,int l,int r){
if(l==r){
map[now]=INF;
return;
}
map[now]=-1;
int mid=(l+r)/2;
build(now*2+1,l,mid);
build(now*2+2,mid+1,r);
return ;
}
void change(int n,int now,int L,int R,int l,int r){
if(R<l||L>r)return;
if(L>=l&&R<=r){
map[now]=n;
return;
}
if(map[now]!=-1){
map[now*2+1]=map[now*2+2]=map[now];
map[now]=-1;
}
int mid=(L+R)/2;
change(n,now*2+1,L,mid,l,r);
change(n,now*2+2,mid+1,R,l,r);
return ;
}
int find(int now,int L,int R,int n){
if(L==R)return map[now];
if(map[now]!=-1){map[now*2+1]=map[now*2+2]=map[now];
int temp=map[now];
map[now]=-1;
return temp;
}
int mid=(L+R)/2;
if(mid>=n)return find(now*2+1,L,mid,n);
else return find(now*2+2,mid+1,R,n);
}
};
int main(){
int n,m,k,l,r;
segment_tree arr;
scanf("%d%d",&n,&m);
arr.build(0,0,n-1);
while(m--){
scanf("%d",&k);
if(k==0){
scanf("%d%d%d",&l,&r,&k);
arr.change(k,0,0,n-1,l,r);
}
else {
scanf("%d",&k);
printf("%d\n",arr.find(0,0,n-1,k));
}
}
} | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int n,h,w; cin>>n>>h>>w;
cout<<(n-h+1)*(n-w+1)<<endl;
return 0;
}
| /*************************************
* problem: AT2164 Rabbit Exercise.
* user ID: 63720.
* user name: Jomoo.
* time: 2019-08-14.
* language: C++.
* upload place: Luogu.
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define puts_return(x) { puts(x); return 0; }
#define write_return(x) { write(x); return 0; }
typedef signed char int8;
typedef unsigned char uint8;
typedef short int16;
typedef unsigned short uint16;
typedef int int32;
typedef unsigned uint32;
typedef long long int64;
typedef unsigned long long uint64;
template <typename Int>
inline Int read()
{
Int flag = 1;
char c = getchar();
while ((!isdigit(c)) && c != '-') c = getchar();
if (c == '-') flag = -1, c = getchar();
Int init = c & 15;
while (isdigit(c = getchar())) init = (init << 3) + (init << 1) + (c & 15);
return init * flag;
}
template <typename Int>
inline void write(Int x)
{
if (x < 0) putchar('-'), x = ~x + 1;
if (x > 9) write(x / 10);
putchar((x % 10) | 48);
}
template <typename Int>
inline void write(Int x, char nextch)
{
write(x);
putchar(nextch);
}
uint64 n, m, k;
vector<int32> x, a, to, ans;
vector<bool> vis;
int main()
{
n = read<uint64>();
x.resize(n);
to.resize(n);
ans.resize(n);
vis.resize(n);
for (size_t i = 0; i < n; i++) x[i] = read<int32>(), to[i] = i;
for (size_t i = n - 1; i > 0; i--) x[i] -= x[i - 1];
m = read<uint64>();
a.resize(m);
k = read<uint64>();
for (auto num : a) num = read<int32>(), swap(to[num], to[num - 1]);
for (size_t i = 0; i < n; i++)
if (!vis[i]) {
vector<int32> s;
for (int j = i; !vis[j]; j = to[j]) s.push_back(j), vis[j] = true;
for (size_t j = 0; j < s.size(); j++) ans[s[j]] = x[s[(j + k) % s.size()]];
}
// ans[0] = x[0];
// ans[n - 1] = x[n - 1];
int64 tot = 0;
for (auto answer : ans) write(tot += answer, 10);
return 0;
} | 0 |
#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 a,b,c;
signed main(){
read(a,b,c);
a=max(a,b);
write(c/a+(c%a>0));
} | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
#define PB push_back
#define dump(x) cout << #x << " = " << (x) << endl; //debug
#define SZ(x) ((ll)(x).size())
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define ps(s) cout << #s << endl;
#define pv(v) cout << (v) << endl;
#define pvd(v) cout << setprecision(16) << (v) << endl;
#define ALL(a) (a).begin(),(a).end()
#define RANGE(a, start_index, num) (a).begin()+(start_index),(a).begin()+(num)
int main() {
int h, w, n;
cin >> h >> w >> n;
int tmp = max(h, w);
n += tmp - 1;
int res = n / tmp;
pv(res)
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int arr[55], pref[55];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> arr[i];
pref[i] = arr[i] + pref[i - 1];
}
int answer = -2e9;
int sum1 = 0;
for (int i = 0; i <= n; ++i) {
int sum2 = 0;
for (int j = i + 1; j <= n + 1; ++j) {
if (i + n - j + 1 <= k) {
multiset<int> l, r;
for (int x = 1; x <= i; ++x) {
if (arr[x] < 0) {
l.insert(arr[x]);
}
}
for (int x = n; x >= j; --x) {
if (arr[x] < 0) {
r.insert(arr[x]);
}
}
int sum1 = 0;
auto p1 = l.begin();
for (int x = 0; x <= l.size(); ++x) {
if (x > 0) {
sum1 += *p1;
++p1;
}
int sum2 = 0;
auto p2 = r.begin();
for (int y = 0; y <= r.size(); ++y) {
if (y > 0) {
sum2 += *p2;
++p2;
}
if (x + y <= k - (i + n - j + 1)) {
answer = max(answer, pref[i] + pref[n] - pref[j - 1] - sum1 - sum2);
}
}
}
}
}
}
cout << answer;
} | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP make_pair //pairのコンストラクタ
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
#define dump(x) cout << #x << " = " << (x) << endl; //debug
#define SZ(x) ((ll)(x).size())
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define ps(s) cout << #s << endl;
#define pv(v) cout << (v) << endl;
#define pvd(v) cout << setprecision(16) << (v) << endl;
#define ALL(a) (a).begin(),(a).end()
#define RANGE(a, start_index, num) (a).begin()+(start_index),(a).begin()+(num)
int main() {
int n, k;
cin >> n >> k;
deque<ll> d;
FOR(i, 1, n) {
int v;
cin >> v;
d.push_back(v);
}
ll res = 0;
int lim = min(k, n);
FOR(i, 0, lim) {
FOR(j, 0, i) {
deque<ll> d2 = d;
vector<ll> jw;
FOR(left, 1, j) {
jw.push_back(d2.front());
d2.pop_front();
}
FOR(right, 1, i - j) {
jw.push_back(d2.back());
d2.pop_back();
}
sort(ALL(jw));
FOR(index, 0, k - i - 1) {
if (index <= i - 1 && jw[index] < 0) {
jw[index] = 0;
}
}
ll tmp = accumulate(ALL(jw), 0LL);
res = max(res, tmp);
}
}
pv(res)
} | 1 |
#include <bits/stdc++.h>
using namespace std;
bool nabeatsu(int n){
if(n % 3 == 0) return true;
int temp = n;
while(temp > 0){
if(temp % 10 == 3) return true;
temp /= 10;
}
return false;
}
int main(){
int n; cin >> n;
for(int i = 1; i <= n; i++){
if(nabeatsu(i)){
cout << ' ' << i;
}
}
cout << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int powerOf2(int n) {
int res = 0;
while (n % 2 == 0) {
res++;
n /= 2;
}
return res;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int pow2 = 1e9;
for (int i = 0; i < n; i++) {
pow2 = min(pow2, powerOf2(a[i]));
}
cout << pow2 << endl;
return 0;
}
| 0 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
if (S.length() == 3) {
reverse(S.begin(), S.end());
cout << S << endl;
}
else {
cout << S << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>
void show2dVector(vector<vector<T>>& v){
for(int i=0;i<v.size();i++){
int m=v[i].size();
cout<<i<<" : ";
for(int j=0;i<m;i++){
cout<<v[i][j]<<" ";
}
cout<<endl;
}
}
void bfs(const vector<vector<int>>&g, int v, vector<bool>& seen){
seen[v]=true;
cout<<v<<" ";
for(auto next: g[v]){
if(seen[next]){
continue;
}
bfs(g,next,seen);
}
}
bool dfs(vector<vector<int>> &g,int start,int goal,vector<bool>&seen){
bool res=false;
seen[start]=true;
if(start==goal){
return true;
}
for(auto next: g[start]){
if(seen[next]){
continue;
}
res=dfs(g,next,goal,seen);
if(res){
break;
}
}
return res;
}
ll gcd(ll a,ll b) {
return b? gcd(b,a%b): a;
}
ll lcm(ll a,ll b) {
return a*b/gcd(a,b);
}
bool isLowerCase(char c){
return (c>='a'&&c<='z');
}
char toLowerCase(char c){
if(isLowerCase(c)){
return c;
}else{
return c+'a'-'A';
}
}
char toUpperCase(char c){
if(isLowerCase(c)){
return c-('a'-'A');
}else{
return c;
}
}
ll powm(ll a,ll n, ll m){
ll ret=1;
while(n>0){
if(n%2==1){
ret=(ret*a)%m;
}
n>>=1;
a=(a*a)%m;
}
return ret;
}
const string yesno(bool ans){
return (ans?"Yes":"No");
}
int main() {
string n;cin>>n;
if(n.size()==3){
char c=n[0];
n[0]=n[2];
n[2]=c;
}
cout<<n<<endl;
return 0;
}
| 1 |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
rep(i,a.size()) cout << a[i] << " ";
cout << endl;
}
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;
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
template<class T>
void add(T&a,T b){
a+=b;
if(a >= mod) a-=mod;
}
string str;
int n, k;
ll dp[305][305][305];
int main(){
cin >> str;
n = str.size();
cin >> k; chmin(k, n);
dp[0][0][0] = 1;
for(int i=0;i<n;i++){
int pre = n-1-i;
while(pre >= 0 && str[pre] == '1') pre--;
rep(j, i+1){
rep(all, k+1){
if(dp[i][j][all] == 0) continue;
if(str[n-1-i] == '0'){
//0 & 0
add(dp[i+1][j+1][all], dp[i][j][all]);
//0 & 1
if(i > j){
add(dp[i][j+1][all], dp[i][j][all]);
}
}
else{
//1 & 0
if(pre != -1 && all+n-1-i-pre <= k) add(dp[n-pre][j+1][all+n-1-i-pre], dp[i][j][all]);
//1 & 1
add(dp[i+1][j+1][all], dp[i][j][all]);
}
}
}
}
//cout << dp[2][1][1] << endl;
ll ans = 0;
rep(j, n+1) rep(i, k+1) ans += dp[n][j][i];
cout << (ans%mod) << endl;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=605;
int n,d1,d2;
bool vis[N][N];
bool fill(int d) {
int t=0;
for(;!(d&3);d>>=2) t++;
if ((d&3)==1) fo(i,0,n-1) fo(j,0,n-1) vis[i][j]|=((i>>t)+(j>>t))&1;
else fo(i,0,n-1) fo(j,0,n-1) vis[i][j]|=(i>>t)&1;
}
int main() {
scanf("%d",&n);n<<=1;
scanf("%d%d",&d1,&d2);fill(d1);fill(d2);
int m=n*n>>2;
fo(i,0,n-1) fo(j,0,n-1)
if (!vis[i][j]) {
printf("%d %d\n",i,j);
if (!(--m)) return 0;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = 0x3F3F3F3F;
const int NEGINF = 0xC0C0C0C0;
const int NULO = -1;
const double EPS = 1e-10;
const ll mod = 1e9 + 7;
inline int cmp(double x, double y = 0)
{
if(fabs(x - y) < EPS)
return 0;
return x > y ? 1 : -1;
}
ll exp(ll a, ll b)
{
ll ans = 1;
while(b)
{
if(b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
const int maxn = 1005;
vector<int>graph[maxn];
vector<int>ans;
int n,m;
int vis[maxn];
void dfs(int u, int target)
{
vis[u] = 1;
for(const auto &v: graph[u])
{
if(vis[v] == 1)
{
if(v == target)
{
vector<int>cycle;
for(int i = 1; i <= n ; i++)
if(vis[i] == 1)
cycle.push_back(i);
if(ans.size() == 0 || cycle.size() < ans.size())
ans = cycle;
}
}
else if(vis[v] == 0)
{
dfs(v, target);
}
}
vis[u] = 2;
}
int main()
{
ios::sync_with_stdio(false);
cin >> n >> m;
for(int i = 0 ; i < m ; i++)
{
int u,v;
cin >> u >> v;
graph[u].push_back(v);
}
for(int i = 1 ; i <= n ; i++)
{
MSET(vis, 0);
dfs(i, i);
}
if(ans.size() == 0)
cout << "-1\n";
else
{
cout << ans.size() << endl;
for(int i = 0; i < ans.size(); i++)
{
cout << ans[i] << endl;
}
}
return 0;
} | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N, Q; cin >> N >> Q;
string S; cin >> S;
int c[N];
c[0] = 0;
rep(i,N-1) {
if (S.substr(i,2)=="AC") c[i+1] = 1;
else c[i+1] = 0;
}
rep(i,N){
if (i==0) continue;
else c[i] += c[i-1];
}
rep(q,Q){
int l, r;
cin >> l >> r;
cout << c[r-1] - c[l-1] << endl;
}
// cout << fixed << setprecision(10);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
// REPEAT
// ----------------------------------------
#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 REPA(i,a) for(ll i=0;i<(ll)(a.size());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 COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i,a) for(ll i=0;i<(ll)(a.size());i++) {cout << (a)[i] << " ";} cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T>
void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) {
cout << i << ":" << v[i] << " ";
}
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI=3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll n;
cin >> n;
vll a(n), ans(n, 0);
REP(i, n) {
cin >> a[i];
}
REPD(i, n) {
ll total = 0;
ll index = i + 1; // 3, 2, 1
FOR(j, 2, n) {
if (index * j <= n) {
total += ans[index * j - 1];
}
else {
break;
}
}
if (total % 2 == 0) {
ans[index - 1] = a[index - 1];
}
else {
if (a[index - 1] == 0) {
ans[index - 1] = 1;
}
else {
ans[index - 1] = 0;
}
}
}
ll count=0;
vll ball_list;
REP(i, n) {
if (ans[i] == 1) {
ball_list.pb(i + 1);
count++;
}
}
COUT(count);
if (ball_list.size()) {
COUTA(i, ball_list);
}
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
5 2
3 1 2 5
2 2 3
1 0
*/
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 2e5 + 5;
int n;
int a[N];
int cnt[N];
int res;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = n; i >= 1; --i) {
int Cnt = 0;
for (int j = i + i; j <= n; j += i) {
Cnt += cnt[j];
}
Cnt %= 2;
if (a[i] != Cnt) {
++res;
cnt[i] = 1;
}
}
cout << res << endl;
for (int i = 1; i <= n; ++i) {
if (cnt[i]) {
cout << i << ' ';
}
}
if (res)
cout << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N, M;
cin >> N >> M;
int max = 0;
if(M%N == 0){
cout << M / N <<endl;
return 0;
}
for(int i = 1; i <= M/N; i++){
if(M % i == 0 && M % i <= N){
max = i;
}
}
cout << max <<endl;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename A,typename B>inline bool chmin(A &a,const B &b){if(a>b){a=b;return true;}else{return false;}}
template<typename A,typename B>inline bool chmax(A &a,const B &b){if(a<b){a=b;return true;}else{return false;}}
int main()
{
ll x,y;
cin >> x >> y;
ll A = abs(abs(x)-abs(y));
ll B = 0;
if(( x>0 && y>0 )||( x<0 && y<0 )){
if((x>0 && abs(x) > abs(y)) || (x<0 && abs(x) < abs(y)))B = 2;
}else{
B=1;
if((x<0 && y==0) || (x==0 && y>0))B = 0;
}
cout << (A+B) << endl;
} | 0 |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
bool chk(int bit, vector<vector<P>> &p)
{
bool result = true;
for (int i = 0; i < (int)p.size(); i++)
{
if (!(bit & (1 << i)))
{
continue;
}
for (int j = 0; j < (int)p[i].size(); j++)
{
int tx = p[i][j].first;
int ty = p[i][j].second;
if ((ty == 1 && (bit & (1 << tx))) ||
(ty == 0 && (~bit & (1 << tx))))
{
continue;
}
else
{
result = false;
}
}
}
return result;
}
int main()
{
int n;
int a;
vector<vector<P>> p;
int cnt = 0, ans = 0;
// 入力
cin >> n;
p.resize(n);
for (int i = 0; i < n; i++)
{
cin >> a;
p[i].resize(a);
for (int j = 0; j < a; j++)
{
cin >> p[i][j].first >> p[i][j].second;
--p[i][j].first;
}
}
// 処理
for (int bit = 0; bit < (1 << n); bit++)
{
if (chk(bit, p))
{
cnt = 0;
for (int i = 0; i < n; i++)
{
if (bit & (1 << i))
cnt++;
}
ans = max(ans, cnt);
}
}
// 出力
cout << ans << endl;
return 0;
}
| #ifdef __GNUC__
#pragma GCC target("avx2")
#pragma GCC optimize ("O20")
#pragma GCC optimize ("tree-vectorize")
#pragma GCC optimize("unroll-loops")
#define iss std::cin
#endif
#include "bits/stdc++.h"
#define rep(i, times) for(ll i = 0; i < (times); ++i)
#define p(x) (cout << x << "\n")
using ll = long long; using ld = long double; using namespace std;
#ifndef __GNUC__
string text =
R"X(
2
1
2 0
1
1 0
)X";
stringstream iss{text};
#endif
class HonestOrUnkind2
{
ll N{0};
vector<bool> h;//正直かどうかの仮定
vector<vector<ll>> s;//証言
void inp( ) {
iss >> N;
h.resize(N);
s.resize(N, vector<ll>(N, 3));//3:言及せず 0:不親切呼ばわり 1:正直者認定
rep(n, N) {
ll K; iss >> K;//証言個数
rep(k, K) {
ll p, hn; iss >> p >> hn;//p番目の人は(n番が言うには)正直か
s[n][--p] = hn;
}
}
}
inline bool consistentQ( ) {//仮定と矛盾しないかだけ調べる
for (ll n = 0; n < N; ++n) {
if (!h[n]) continue; //不親切なら無視
for (ll p = 0; p < N; ++p) {//n番目の人がp番目の人に対して証言
if (s[n][p] == 3) continue;
if ((s[n][p] == 1) && !h[p]) return false;
if ((s[n][p] == 0) && h[p]) return false;
}
}
return true;
}
void changeSeikaku( ) {
size_t NH{0}; // 正直者の最大人数
const ll maxB{(1 << N)};
for (ll b = 0; b < maxB; ++b) {//全員の状態を変える
rep(n, N) { h[n] = (b >> n) & 1; }//n番の人が正直と仮定したか
if (consistentQ( )) NH = max(NH, bitset<32>(b).count( ));
}
p(NH);
}
public:
void procedures( ) {
inp( );
changeSeikaku( );
}
};
int main( ) {
cin.tie(0); ios::sync_with_stdio(0);
class HonestOrUnkind2 a; a.procedures( );
} | 1 |
#include<stdio.h>
int main()
{
int N,R,A;
scanf("%d %d", &N, &R);
A =100*(10-N);
if(N>=10){
printf("%d", R);
}
else{
printf("%d", R + A);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a=0,b=0;
cin >> a;
cin >> b;
cout << 2 * b - a << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int main() {
string abcd;
cin >> abcd;
rep(i, 1<<3) {
bitset<3> bit(i);
int sum = abcd[0] - '0';
string ans = "";
ans += abcd[0];
rep(j, 3) {
if (bit[j] == 0) {
sum += abcd[j+1] - '0';
ans += "+";
ans += abcd[j+1];
}
else {
sum -= abcd[j+1] - '0';
ans += "-";
ans += abcd[j+1];
}
}
if (sum == 7) {
ans += "=7";
cout << ans << endl;
return 0;
}
}
}
| #include<bits/stdc++.h>
using namespace std;
const int MAX = 2e5 ;
const int INF = 1e9 + 1e5 + 2;
const int mod= 1e9+7;
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define what_is(x) cerr << #x << " = " << x << endl;
#define eps 1e-15
#define F first
#define S second
typedef long long ll;
ll fib[100006];
int main()
{
fastIO
string s;
cin>>s;
int a=s[0]-'0';
int b=s[1]-'0';
int c=s[2]-'0';
int d=s[3]-'0';
if (a+b+c+d==7)
cout<<a<<"+"<<b<<"+"<<c<<"+"<<d<<"="<<7;
else if (a-b-c-d==7)
cout<<a<<"-"<<b<<"-"<<c<<"-"<<d<<"="<<7;
else if (a-b+c+d==7)
cout<<a<<"-"<<b<<"+"<<c<<"+"<<d<<"="<<7;
else if (a+b-c+d==7)
cout<<a<<"+"<<b<<"-"<<c<<"+"<<d<<"="<<7;
else if (a+b+c-d==7)
cout<<a<<"+"<<b<<"+"<<c<<"-"<<d<<"="<<7;
else if (a-b-c+d==7)
cout<<a<<"-"<<b<<"-"<<c<<"+"<<d<<"="<<7;
else if (a-b+c-d==7)
cout<<a<<"-"<<b<<"+"<<c<<"-"<<d<<"="<<7;
else if (a+b-c-d==7)
cout<<a<<"+"<<b<<"-"<<c<<"-"<<d<<"="<<7;
}
| 1 |
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(v) ((int)v.size())
#define pb push_back
#define mp make_pair
int main(void)
{
cin.sync_with_stdio(false);
string str;
while(cin >> str){
reverse(ALL(str));
cout << str << endl;
}
return 0;
} | #include<iostream>
#include<string.h>
using namespace std;
int main(){
char str [21];
cin >> str;
for(int i = strlen(str)-1; i >= 0; i--){
cout << str[i];
}
cout << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
char str[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> str;
int len = strlen(str);
str[len - 8] = 0;
cout << str << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P =pair<int,int>;
int main(){
string S;
cin>>S;
rep(i,S.size()-1){
if(S.at(i)=='A'){
if(S.at(i+1)=='C'){
cout<<"Yes"<<endl;
return 0;
}
}
}
cout<<"No"<<endl;
return 0;}
/*compile
g++ code.cpp
./a.out
run*/
/*
int f(int x){
int y=int((x*x+4.0)/8.0);
return y;
}
*/ | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define mem(a,h) memset(a, (h), sizeof(a))
#define fi first
#define se second
#define por(a,b) (((a%MOD) * (b%MOD))%MOD)
#define forg(i, b, e, c) for (ll i = (ll)b; i < (ll)e; i+=c)
#define forr(i, b, e) for (ll i = b; i < e; i++)
using namespace std;
using namespace __gnu_pbds;
typedef double lldb;
typedef pair<ll, ll> ii;
typedef pair<ll, ii> iii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll INF = 1e9;
const double PI = acos(-1);
#define offset
const ll MOD= 1e9+7;
#define initseg ll new_nodo=(nodo*2),mid=(iz+der)/2;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define tam 223455
ll D;
ll m;
map<ll,ll> ways;
ll vexp[tam],pot[tam];
ll f(ll pos,ll D2)
{
if (pos==m)
{
return (D2==D);
}
ll formas=0;
ll maxx=-9,minn=9;
forr(delt,-9,10)
{
if (D2+vexp[pos]*delt<=D)
maxx=delt;
if (D2+vexp[pos]*delt>D)
minn=min(minn,delt);
}
formas+=f(pos+1,minn*vexp[pos]+D2)*ways[minn];
if (maxx!=minn)
formas+=f(pos+1,maxx*vexp[pos]+D2)*ways[maxx];
return formas;
}
ll go(ll digs)
{
m=(digs/2);
//cout<<digs<<' '<<m<<": ";
forr(i,0,m)
{
vexp[i]=(pot[digs-1-i]-pot[i]);
//cout<<vexp[i]<<" ";
}
//cout<<endl;
ll total=0;
forr(i,-9,10)
{
total+=f(1,vexp[0]*i)*(ways[i]-1);
//cout<<total<<" "<<i<<' '<<ways[i]-1<<endl;
}
if (digs%2==1)
total= total*10;
return total;
}
int main()
{
forr(i,0,10)
{
forr(j,0,10)
{
ways[i-j]++;
}
}
pot[0]=1;
forr(i,1,19)
pot[i]=pot[i-1]*10;
cin>>D;
ll formas=0;
forr(digs,2,19)
{
formas+=go(digs);
//cout<<formas<<'\n';
}
cout<<formas<<endl;
}
// PLUS ULTRA!ac | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
// Corner cases
if (n <= 1)
return 1;
if (n <= 3)
return 2;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return 1;
return 2;
}
ll fact(ll n){ll res = 1;for (ll i = 2; i <= n; i++)res = res * i,res%=1000000007;
return res; }
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll findlcm(ll arr[], int n)
{
ll ans = arr[0];
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) /
(gcd(arr[i], ans)));
return ans;
}
int main()
{
fast;
ll t=1;
//cin>>t;
while(t--)
{
ll n,sum=0;
cin>>n;
ll A[n];
map<ll,ll>B;
for(ll i=0;i<n;i++)
{
cin>>A[i];
B[A[i]]++;
}
sort(A,A+n);
for(ll i=0;i<n;i++)
{
sum=sum+(B[A[i]]%2);
i=i+B[A[i]]-1;
}
cout<<sum;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define loop(i,n)for(i=0;i<n;i++)
#define INF 1000000000
using ll = long long int;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
#define MAX 100005
int main()
{
IOS;
//freopen("inputfile.txt","r",stdin);
ll n;cin>>n;
ll ar[n];
ll count = 0;ll mi;
for(ll i=0;i<n;i++)
{
ll x;cin>>x;
if(i==0)mi = x;
else if(x>mi)count++;
else mi = x;
}
cout<<n-count<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn=1e6;
int arr[maxn],n;
int main() {
cin>>n;
bool flag;
int ans=1;
int temp;
cin>>arr[0];
temp=arr[0];
for(int i=1;i<n;i++)
{
cin>>arr[i];
if(arr[i]<temp)
ans+=1;
temp=min(arr[i],temp);
}
cout<<ans;
} | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n; cin >> n;
if(n == 0){
cout << 0 << endl; return 0;
}
string bin = "";
while(n != 0){
ll foo = n%((ll)-2);
n /= ((ll)-2);
if(foo < 0){
foo += abs((ll)-2);
n++;
}
bin = to_string(foo)+bin;
}
cout << bin << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n;
cin >> n;
if (n == 0) {
cout << 0 << endl;
return 0;
}
vector<int64_t> ans;
while (n != 0) {
if (n % 2 != 0) {
ans.push_back(1);
--n;
} else {
ans.push_back(0);
}
n /= -2;
}
for (auto a : ans | reversed) {
cout << a;
}
cout << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int q;
string s;
set<int> ac;
vector<int> wa(n+1, 0);
for(int i=0; i<m; i++) {
cin >> q >> s;
if(ac.count(q)) continue;
if(s=="AC") ac.insert(q);
else wa[q]++;
}
for(int i=1; i<n+1; i++) if(!ac.count(i)) wa[i] = 0;
cout << ac.size() << " " << accumulate(wa.begin(), wa.end(), 0) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
int main(void){
int N,M;
cin >>N>>M;
bool AC[N];
int WA[N];
int WAsum=0;
int ACsum=0;
rep(i,N){
WA[i]=0;
AC[i]=false;
}
while(M>0){
int p;
string s;
cin >> p>>s;
M--;
if(AC[p-1]==true){
continue;
}
if(s=="AC"){
WAsum+=WA[p-1];
ACsum++;
AC[p-1]=true;
}
else if(s=="WA"){
WA[p-1]++;
}
}
cout << ACsum << " "<< WAsum << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> PlP;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll N;
cin >> N;
string S = "";
ll cur = 1;
if(N==0){
cout << 0 << endl;
return 0;
}
while(N){
if(N % -2){
S = "1" + S;
N--;
}else{
S = "0" + S;
}
N /= -2;
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if(A[1]=='A' && A[2]=='C'||A[0]=='A'&& A[1]=='C'||A[2]=='A'&&A[3]=='C'||A[3]=='A'&&A[4]=='C'){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 |
#include<iostream>
#include<cstring>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
#define MAX 500000
#define INF 2e9
int L[MAX/2+2],R[MAX/2+2];
long long cnt=0;
long long merge(int A[],int n,int left,int mid,int right)
{
long long cnt=0;
int n1=mid-left;
int n2=right-mid;
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]=INF;
R[n2]=INF;
int i=0,j=0;
for(int k=left;k<right;k++)//合并
{
if(L[i]<=R[j])
A[k]=L[i++];
else
{
A[k]=R[j++];
cnt=cnt+(n1-i);
}
}
return cnt;
}
long long mergeSort(int A[],int n,int left,int right)
{
long long v1,v2,v3;
if(left+1<right)
{
int mid=(left+right)/2;
v1=mergeSort(A,n,left,mid);
v2=mergeSort(A,n,mid,right);
v3=merge(A,n,left,mid,right);
return (v1+v2+v3);
}
else
return 0;
}
int main()
{
int A[MAX],n;
cnt=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i];
cnt=mergeSort(A,n,0,n);
cout<<cnt<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int M = 1 << 18 + 1;
int N;
cin >> N;
vector<int> A(N), a(N), ord(N);
for ( int i = 0; i < N; i++ ) {
cin >> A[i];
a[i] = A[i];
}
sort(a.begin(), a.end());
for ( int i = 0; i < N; i++ ) {
ord[i] = lower_bound(a.begin(), a.end(), A[i]) - a.begin();
}
ll ans = 0;
vector<int> bit(M);
int k,sum;
for ( int i = 0; i < N; i++ ) {
// add
k = ord[i] + 1;
while ( k <= M ) {
bit[k]++;
k += k & -k;
}
// sum
sum = 0;
k = ord[i] + 1;
while ( k > 0 ) {
sum += bit[k];
k -= k & -k;
}
ans += i + 1 - sum;
}
cout << ans << '\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = (1e+9)+7;
int main(){
int n;
cin >> n;
vector<int> a(n);
ll sm = 0;
for(int i=0; i<n; i++){
cin >> a[i];
sm = (sm + a[i]) % MOD;
}
ll ans = 0;
for(int i=0; i<n; i++){
sm -= a[i];
if(sm < 0) sm += MOD;
ans = (ans + (a[i] * (sm)) % MOD) % MOD;
}
cout << ans << endl;
} | #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;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
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; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
using Graph = vector<vector<int>>;
ll N,M;
vector<ll> A;
int main(){
cin>>N>>M;
A.resize(N);
rep(i,N)cin>>A[i];
vector<ll> V(N);
V[0] = A[0]%M;
rep1(i,N-1)V[i] = (V[i-1] + A[i])%M;
sort(V.begin(),V.end());
map<ll,ll> r;;;;
rep(i,N) r[V[i]]++;
ll res = 0;
for(auto p:r){
ll amari = p.first;
ll cnt = p.second;
if(amari==0){
res += cnt;
res += cnt*(cnt-1)/2;
}else{
res += cnt*(cnt-1)/2;
}
}
cout<<res<<endl;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
double PI = 3.1415926535897932;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
int n, m;
ll k;
int x[100000];
int d[100000];
int D[100000];
int to[100000];
int a[100000];
int tmp[100000];
bool saw[100000];
int main() {
cin >> n;
rep(i,n) cin >> x[i];
rep(i,n-1) d[i] = x[i+1]-x[i];
rep(i,n-1) to[i] = i;
cin >> m >> k;
rep(i,m) cin >> a[i];
rep(i,m) a[i]--;
rep(j,m) {
swap(to[a[j]-1], to[a[j]]);
}
rep(i,n-1) {
if (saw[i]) continue;
int p = i;
int si = 0;
saw[p] = true;
tmp[si++] = p;
while (!saw[to[p]]) {
saw[to[p]] = true;
p = to[p];
tmp[si++] = p;
}
rep(j,si) {
D[tmp[j]] = d[tmp[(j+k)%si]];
}
}
ll pos = x[0];
cout << pos << endl;
rep(i,n-1) {
pos += D[i];
cout << pos << endl;
}
} | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
string str, cmd, p, tmp;
int q, i, j, a, b;
cin >> str >> q;
rep(i,q) {
cin >> cmd;
if (cmd == "print") {
cin >> a >> b;
cout << str.substr(a,b-a+1) << endl;
} else if (cmd == "reverse") {
cin >> a >> b;
tmp = str.substr(a,b-a+1);
reverse(tmp.begin(),tmp.end());
rep(j,b-a+1) str[a+j] = tmp[j];
} else if (cmd == "replace") {
cin >> a >> b >> p;
rep(j,p.length()) str[a+j] = p[j];
} else cout << "Input Error";
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
int main(){
int n;
while(scanf("%d", &n), n){
vector<int> k(n);
rep(i,n){
scanf("%d", &k[i]);
}
char s[103];
scanf("%s", s);
int len=strlen(s);
rep(i,len){
if(s[i]>='a' && s[i]<='z'){
s[i]=s[i]-k[i%n];
if(s[i]<'a'){
s[i]+='Z'-'a'+1;
if(s[i]<'A') s[i]+='z'-'A'+1;
}
} else {
s[i]=s[i]-k[i%n];
if(s[i]<'A'){
s[i]+='z'-'A'+1;
if(s[i]<'a') s[i]+='Z'-'a'+1;
}
}
}
cout<<s<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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 T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n,k;
ll ans=1LL;
cin >>n>>k;
cout << (n-k+1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
signed main()
{
int a,b,c=1,d;
cin>>a>>b;
d=a;
for(int i=1;i<=d;i++){
if(a>b){
a-=b;
a+=b-1;
c++;
}
}
cout<<c<<"\n";
}
| 1 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f
#define pi 3.1415926535898
#define mod 998244353
#define N 1000010
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int l=1,r=m+1;
while(l<r)
{
cout<<l++<<" "<<r--<<endl;
}
l=m+2,r=2*m+1;
while(l<r)
{
cout<<l++<<" "<<r--<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) ((n) | (1LL << (i)))
#define togglebit(n, i) ((n) ^ (1LL << (i)))
char gap = 32;
template < typename T >
ostream& operator<<(ostream &os, const vector < T > &v) {
os << '{';
for (const auto &x: v) os << gap << x;
return os << '}';
}
template < typename A, typename B >
ostream& operator<<(ostream &os, const pair < A, B > &p) {
return os << '(' << p.first << gap << p.second << ')';
}
template < class T >
void read(T &x) {
char c;
for (c = getchar(); c < '0' || c > '9'; c = getchar());
for (x = 0; c <= '9' && c >= '0'; c = getchar()) x = x * 10 + (c & 15);
}
#define ll long long
#define lll __int128_t
#define pb push_back
#define mp make_pair
typedef pair < int, int > ii;
typedef vector < ii > vii;
typedef vector < ll > vl;
typedef vector < int > vi;
typedef vector < vi > vvi;
typedef tree <
int,
null_type,
less < int >,
rb_tree_tag,
tree_order_statistics_node_update >
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
ll dp[1001][1001];
ll mod=1000000007;
vector<string>Data;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll i,j,k,l,n,m;
cin>>n>>m;
vector<pair<ll,ll>>res;
ll ini=1;
ll fina=n;
vector<ll>used(n+1,0);
ll kola1=(m+1)/2;
while(kola1--){
used[ini]=1;used[fina]=1;
res.pb({ini++,fina--});
}
m=m/2;
ll cnt=2*m;
while(m--){
while(used[ini]==1) ini++;
res.pb(make_pair(ini,ini+cnt));
used[ini]=1;
used[ini+cnt]=1;
cnt-=2;
}
for(auto x:res) cout<<x.first<<" "<<x.second<<'\n';
} | 1 |
#include<iostream>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdio>
using namespace std ;
typedef vector<int> vi ;
typedef vector<vi> vvi ;
typedef vector<string> vs ;
typedef pair<int, int> pii;
typedef long long ll ;
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
int main(void){
string num;
getline(cin,num);
int n = atoi(&num[0]);
while(n--){
string s;
getline(cin,s);
rep(i,s.size()){
if(s[i]=='H'&&s[i+1]=='o'&&s[i+2]=='s'&&s[i+3]=='h'&&s[i+4]=='i'&&s[i+5]=='n'&&s[i+6]=='o'){
s[i+6]='a';
}
if(s[i]=='\n'){cout<<endl;n--;break;cout<<"test"<<n<<endl;}
}
cout<<s<<endl;
}
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
string::size_type t;
cin >> n;
getchar();
while (n--) {
getline(cin, s);
t = 0;
while ((t = s.find("Hoshino", t)) != string::npos) {
s[t + 6] = 'a';
t += 1;
}
cout << s << endl;
}
return 0;
} | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<numeric>
#include<algorithm>
#include<tuple>
#include<cmath>
#include <iomanip>
typedef unsigned long long ull;
typedef long long ll;
ll DENOM = 1000000000LL + 7LL;
using namespace std;
ll n, m, k;
ll h, w;
int main(){
cin >> n;
vector<ull> a(n);
for (ll i=0; i<n; ++i){
cin >> a[i];
}
ull asu=0, asq=0;
for (ll i=0; i<n; ++i){
asu += a[i];
asu %= DENOM;
asq += a[i] *a[i];
asq %= DENOM;
}
ll ret = ((asu * asu) - asq) % DENOM;
if (ret %2 ==0){
ret /= 2;
}else{
ret = (ret + DENOM) / 2;
}
cout << ret << endl;
return 0;
} | /* Perseverance can make miracle happens */
/* If u identify me then u r my frnd */
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define pq priority_queue<int>
#define mpi map<int,int>
#define pb push_back
#define ff first
#define ss second
#define forn(i,n) for(int i=0;i<n;i++)
#define M 1000000007
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
int mod(long long x) {
return ((x % M + M) % M);
}
int add(int a, int b) {
return mod(mod(a) + mod(b));
}
int diff(int a, int b) {
return mod(mod(a) - mod(b));
}
int mul(int a, int b) {
return mod(mod(a) * mod(b));
}
void solve() {
int n; cin >> n;
int a[n];
int s = 0;
forn(i, n) {
cin >> a[i];
s += a[i];
}
int ps[n];
ps[0] = a[0];
for (int i = 1; i < n; i++) {
ps[i] = add(ps[i - 1] , a[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = add(mod(ans) , mul(a[i] , (s - ps[i])));
}
cout << ans << endl;
}
int32_t main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
// int t; cin >> t;
int t = 1;
while (t--) {
solve();
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int get_rate=0;
int get_goal=0;
cin >> get_rate >> get_goal;
cout << 2*get_goal-get_rate;
} | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const int MaxN = 1000000;
int n;
char s[MaxN + 2], t[MaxN + 2];
int q_l, q_r;
int q[MaxN + 1];
inline int solve()
{
if (!strcmp(s + 1, t + 1))
return 0;
q_l = 1, q_r = 0;
int l = 0, last = n + 1;
int res = 0;
for (int i = n, j = n; i; --i)
{
if (i > 1 && t[i] == t[i - 1])
continue;
while (j > i || (j && s[j] != t[i]))
--j;
if (j == 0)
return -1;
q[++q_r] = j + ++l;
while (q_l <= q_r && q[q_l] - l >= last)
++q_l;
res = max(res, q_r - q_l + 1);
last = i - 1;
}
return res;
}
int main()
{
scanf("%d", &n);
scanf("%s%s", s + 1, t + 1);
cout << solve() << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int* mallocint(int si)
{
return (int*) malloc(si * sizeof(int));
}
int* inputint(int n)
{
int *ans = mallocint(n);
for( int i = 0; i < n; i++ ) cin >> ans[i];
return ans;
}
#define _INF -2000000001
int main()
{
int n;
cin >> n;
int *a = inputint(n);
long long f0[2][3];
long long f1[2][3];
int wmax = (n % 2 == 0) ? 1 : 2;
int index = 0;
f0[0][0] = a[0];
f0[0][1] = _INF;
f0[0][2] = _INF;
f1[0][0] = _INF;
f1[0][1] = 0;
f1[0][2] = _INF;
index = 0;
for( int i = 1; i < n; i++ )
{
int next = (index + 1) % 2;
for( int w = 0; w <= wmax; w++ )
{
f0[next][w] = f1[index][w];
if( f0[next][w] != _INF ) f0[next][w] += (long long)a[i];
if( w > 0)
{
f1[next][w] = max(f1[index][w - 1], f0[index][w]);
}
else
{
f1[next][w] = f0[index][w];
}
}
index = next;
}
long long ans = max(f0[index][wmax], f1[index][wmax - 1]);
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
string date;
cin>> date;
date[3]='8';
cout<<date;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x))) //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x)) //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x)) //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return -1;
}
template <typename T>
string make_string(T N)
{
string ret;
T now = N;
while (now > 0)
{
T x = now % 10;
ret += (char)('0' + x);
now /= 10;
}
reverse(all(ret));
return ret;
}
template <typename T>
T lcm(T x, T y)
{
T z = gcd(x, y);
return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++)
{
if (n % i == 0)
{
return false;
}
i++;
}
return true;
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b; // aをbで更新
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b; // aをbで更新
return true;
}
return false;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));
int main()
{
cout << fixed << setprecision(30);
ll N, M;
cin >> N >> M;
vector<bool> available(M + 1, true); //実施されるかどうか
vector<vector<ll>> A(N, vector<ll>(M));
loop(i, N) loop(j, M) cin >> A[i][j];
ll ans = 1e9;
loop(i, M)
{
vector<ll> count(M + 1); //各競技の参加者の数
loop(j, N)
{
loop(k, M)
{
ll now = A[j][k];
if (available[now])
{
count[now]++;
break;
}
}
}
ll maxx = 0;
Loop(j, 1, M + 1) if (available[j]) maxx = max(maxx, count[j]);
Loop(j, 1, M + 1) if (available[j]) if (count[j] == maxx)
{
available[j] = false;
break;
}
ans = min(ans, maxx);
}
putout(ans);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define Nitroboost ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
const int mod=1e9+7;
const int N=1e6+5;
int main()
{
Nitroboost;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n,m;
cin>>n>>m;
map<int,int>mp;
for(int i=1;i<=m;i++)
mp[i]=i;
multiset<int>v;
for(int i=1;i<=m;i++)
v.insert(0);
for(int i=1;i<=n;i++)
{
int l,r;
cin>>l>>r;
r++;
auto it=mp.lower_bound(l);
int t=-1;
while(it!=mp.end() && it->first<=r)
{
t=max(t,it->second);
v.erase(v.find(it->first-it->second));
mp.erase(it++);
}
if(t!=-1 && r<=m)
{
v.insert(r-t);
mp[r]=t;
}
if(v.size()>0)
cout<<i+(*v.begin())<<"\n";
else
cout<<"-1\n";
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std ;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define ar array
#define inf() ifstream cin("d.txt")
#define onf() ofstream cout("test.txt")
#define mod 1000000007
#define pb push_back
#define endl cout<<"\n";
#define prt1(a) cout<<a<<" "
#define prt2(a,b) cout<<a<<" "<<b<<" "
#define prt3(a,b,c) cout<<a<<" "<<b<<" "<<c<<" "
#define in(a) cin>>a
#define inn(a,b) cin>>a>>b
#define innn(a,b,c) cin>>a>>b>>c
#define rep(i,st,end) for(int i=st;i<end;i++)
#define repv(i,st,end) for( i=st;i>=end;i--)
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define TEST ll tc;cin>>tc;while(tc--)
#define EACH(x, a) for (auto& x: a)
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class T> void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d=stod(t);
}
void read(long double& d) {
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
read(h);
read(t...);
}
template<class A> void read(vt<A>& x) {
EACH(a, x)
read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
EACH(a, x)
read(a);
}
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a <<"\n";
err(++it, args...);
}
void solve()
{
ll d,t,s;
read(d,t,s);
ll di = s*t ;
if(di>=d)
cout<<"Yes";
else
cout<<"No";
}
int main()
{
fio;
ll k = 1;
ll tc = 1;
// cin>>tc;
while(tc--){
// cout<<"Case #"<<k<<": ";k++;
solve();
endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int const MX = 2e5 + 2;
int main()
{
int d, s, t;
cin>>d>>t>>s;
int time = (d + s - 1)/s;
if(time <= t) cout<<"Yes\n";
else cout<<"No\n";
}
| 1 |
#include <stdio.h>
void grade(int students)
{
while(students != 0) {
for(int i = 0; i < students; ++i) {
int math, english, japanese;
scanf("%d %d %d", &math, &english, &japanese);
int mean = (math + english + japanese) / 3;
if ((math == 100) || (english == 100) || (japanese == 100)) {
printf("A\n");
} else {
if (((math + english) / 2 >= 90) || mean >= 80) {
printf("A\n");
} else if ((mean >= 70) || ((mean >= 50) && ((math >= 80) || (english >= 80)))) {
printf("B\n");
} else {
printf("C\n");
}
}
}
scanf("%d", &students);
}
}
int main(void)
{
int students;
scanf("%d", &students);
grade(students);
return 0;
} | #include <bits/stdc++.h>
#define loop(v, f, l) for(int v = (f), v##_ = (l); v < v##_; ++v)
using namespace std;
typedef long long int lint;
static inline int in(){ int x; scanf("%d", &x); return (x); }
static inline lint inl(){ lint x; scanf("%lld", &x); return (x); }
int main()
{
int point[3];
int n;
int ave;
int me_ave;
bool has100point;
while( true )
{
n = in();
if( n == 0 )break;
for(int i = 0; i < n; i++)
{
ave = me_ave = 0;
has100point = false;
for(int j = 0; j < 3; j++)
{
point[j] = in();
if( point[j] == 100 )has100point = true;
}
ave = (point[0] + point[1] + point[2]) / 3;
me_ave = (point[0] + point[1]) / 2;
if( has100point || me_ave >= 90 || ave >= 80 )
{
puts("A");
}
else if( ave >= 70 || (ave >= 50 && (point[0] >= 80 || point[1] >= 80)) )
{
puts("B");
}
else
{
puts("C");
}
}
}
return (0);
} | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=1050;
int a[N],b[N],col,n,m,com,tot;
const long long mod=1e9+7;
long long ans=0;
bool vis[2][N*N];
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) {
scanf("%d",&a[i]);
vis[0][a[i]]=true;
}
for(int j=1;j<=m;j++) {
scanf("%d",&b[j]);
vis[1][b[j]]=true;
}
sort(a+1,a+n+1);
sort(b+1,b+m+1);
ans=1;
for(int i=1;i<n;i++) if(a[i]==a[i+1]) ans=0;
for(int j=1;j<m;j++) if(b[j]==b[j+1]) ans=0;
col=n;com=m;
for(int i=m*n;i>=1;i--){
while(col>=1&&a[col]>=i) col--;
while(com>=1&&b[com]>=i) com--;
tot=(n-col)*(m-com)-(n*m-i);
if(tot<=0) ans=0;
if(vis[0][i]&&vis[1][i]) tot=1;
else if(vis[0][i]) tot=m-com;
else if(vis[1][i]) tot=n-col;
ans=ans*tot%mod;
}
printf("%lld\n",ans);
} | #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--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define INF 1000000000000000LL
using namespace std;
int main(){
int n,m;cin>>n>>m;
vector<int>a(n), b(m);
rep(i, n)cin>>a[i];
rep(i, m)cin>>b[i];
map<int, int>ma, mb;
for(auto c:a)ma[c]++;
for(auto p: ma)if(p.second>1) { cout<<0<<endl; return 0; }
for(auto c:b)mb[c]++;
for(auto p: mb)if(p.second>1) { cout<<0<<endl; return 0; }
vector<int> counter_a(n*m+1);
vector<int> counter_b(n*m+1);
for(auto c: a)counter_a[c]++;
for(auto c: b)counter_b[c]++;
rrep1(i, n*m)counter_a[i-1] += counter_a[i];
rrep1(i, n*m)counter_b[i-1] += counter_b[i];
ll result=1;
rrep1(c, n*m){
ll cca = counter_a[c];
ll ccb = counter_b[c];
ll reduce = (n*m-c);
if(ma[c]>0 && mb[c]>0);
else if(ma[c]>0){
result = result*ccb%MOD;
}else if(mb[c]>0){
result = result*cca%MOD;
}else{
result = result*(cca*ccb-reduce)%MOD;
}
}
cout<<result<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
const ll INF = 9e18;
const ll MODULO = 998244353L;
void print() { cout << endl; }
template <typename Head, typename... Tail>
void print(Head head, Tail... tail) {
int size = sizeof...(Tail);
cout << head;
if (size > 0) {
cout << " ";
}
print(tail...);
}
void print0() {}
template <typename Head, typename... Tail>
void print0(Head head, Tail... tail) {
cout << head;
print0(tail...);
}
ll mod_pow(ll x, ll n, ll modval) {
if (n == 0) {
return 1;
}
ll res = mod_pow(x * x % modval, n / 2, modval);
if (n & 1) {
res = res * x % modval;
}
return res;
}
ll pow(ll x, ll n) {
return mod_pow(x, n, MODULO);
}
ll mod(ll n) {
return n % MODULO;
}
const ll COMBMAX = 200000;
ll factorial[COMBMAX+1], invfactor[COMBMAX+1];
void combination_init() {
factorial[0] = 1;
factorial[1] = 1;
invfactor[0] = 1;
invfactor[1] = 1;
for (ll i = 2; i <= 1 + COMBMAX; i++) {
factorial[i] = (i * factorial[i-1]) % MODULO;
invfactor[i] = pow(factorial[i], MODULO-2);
}
}
ll combination(ll n, ll k) {
return mod(mod(factorial[n]*invfactor[k])*invfactor[n-k]);
}
int main() {
ll N, M, K;
cin >> N >> M >> K;
combination_init();
ll result = 0;
for (ll j = 0; j <= K; j++) {
result = mod(result + mod(combination(N - 1, j) * mod(M * pow(M - 1, N - j - 1))));
}
print(result);
}
| // #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
// #include <windows.h>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, class T2> using P = pair<T1, T2>;
using I = int;
using D = double;
using B = bool;
using C = char;
using S = string;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = P<I, I>;
using VPII = V<PII>;
using PLL = P<LL, LL>;
using VPLL = V<PLL>;
using VI = V<I>;
using VVI = VV<I>;
using VLL = V<LL>;
using VVLL = VV<LL>;
using VC = V<C>;
using VVC = VV<C>;
using VS = V<S>;
using VVS = VV<S>;
using VB = V<B>;
using VVB = VV<B>;
#define REP(type, i, n) for (type i = 0; i < (type)(n); ++i)
#define REP2(type, i, m, n) for (type i = (m); i < (type)(n); ++i)
#define REPR(type, i, n) for (type i = (n)-1; i >= 0; --i)
#define REPR2(type, i, m, n) for (type i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define SORTR(a, type) sort(ALL(a), greater<type>())
#define SORTF(a, comp) sort(ALL(a), comp)
#define REVERSE(a) reverse(ALL(a))
#define SIZE(a, type) ((type)(a).size())
#define bit_search(bit, n) REP(LL, bit, 1LL<<(n))
#define bit_check(bit, i) ((bit>>(i)) & 1)
#define setpre(n) fixed << setprecision((n))
#define UNIQUE(a) do {SORT(a); (a).erase(unique(ALL(a)), (a).end());} while(0)
#define MAX(a) *max_element(ALL(a))
#define MIN(a) *min_element(ALL(a))
#define bisect_left(a, x) (lower_bound(ALL(a), (x)) - a.begin())
#define bisect_right(a, x) (upper_bound(ALL(a), (x)) - a.begin())
#define INPUT(a) REPx(&x, a) cin >> x;
#define INPUT2(a) REPx(&x, a) INPUT(x);
#define INPUTP(a) REPx(&x, a) cin >> x.first >> x.second;
#define ENDL cout << endl;
const int INF = 2e9;
// const LL INF = 9e18;
const LL MOD = 1e9+7;
template<class T> using PRIORITY_QUEUE = priority_queue< T, V<T>, greater<T> >;
template<class T> inline bool chmin(T &a, T b){if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){if (a < b) {a = b; return true;} return false;}
template<class T> inline void debug1(V<T> A){REP(int, i, SIZE(A, int)){if (A[i] == INF) cout << "I ";else cout << A[i] << " ";}ENDL}
template<class T> inline void debug2(VV<T> A){REP(int, i, SIZE(A, int)){REP(int, j, SIZE(A[i], int)){if (A[i][j] == INF) cout << "I "; else cout << A[i][j] << " ";}ENDL}}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s, t;
cin >> n >> s >> t;
REP(int, i, n)
{
string a = "", b = "";
REP2(int, j, i, n) a += s[j];
REP(int, j, n-i) b += t[j];
if (a == b)
{
cout << n + i << endl;
return 0;
}
}
cout << 2*n << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e7+1;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
typedef long long int ll;
typedef vector<ll> vi;
typedef vector < pair<ll, ll > > vp;
typedef vector <string> vs;
typedef vector <char> vc;
typedef list <ll> lst;
ll n,m, k, ans = 0, sum = 0, cnt = 0;
string s;
char c;
/*--------------------template--------------------*/
ll a[105];
int main()
{
while (1) {
cin >> n >> k;
if (n == 0 && k == 0) {
return 0;
} else {
fill(a, a + 105, 0);
ll ma = 0;
REP(i, n)
{
cin >> m;
REP(j, m)
{
ll b;
cin >> b;
a[b]++;
}
}
ll p;
REP(i, 105)
{
if (ma < a[i]) {
ma = a[i];
p = i;
}
}
if (ma < k) {
cout << 0 << endl;
} else {
cout << p << endl;
}
}
}
} | #include <iostream>
#include <vector>
#include <algorithm>
//#include <fstream>
using namespace std;
int main()
{
// cut here before submit
// freopen ("testcase.thanksgiving", "r", stdin );
int n, m;
while (cin >> n >> m && n && m){
vector <int> bp(n + 1);
int i;
bp[0] = 10001;
for (i = 1; i <= n; ++i){
cin >> bp[i];
} // end while
sort (bp.begin(), bp.end(), greater<int>() );
int res = 0;
for (i = 1; i <= n; ++i){
if (i % m == 0){
continue;
} // end if
res += bp[i];
} // end for
cout << res << endl;
} // end loop
return 0;
} | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int card[4];
char c;
while(cin >> card[0] ){
for(int i=1;i<5;i++){
cin >> c >> card[i];
}
sort(card, card+5);
int two = 0;
bool three = 0;
bool four = 0;
for(int i=0;i<5;i++){
int count = 1;
for(int j=i+1;j<5;j++){
if(card[i]==card[j]){
count++;
}
else{
break;
}
}
if(count==2){
two+=1;
i+=1;
}
else if(count==3){
three=1;
i+=2;
}
else if(count==4){
four=1;
i+=3;
}
}
if(two && three){
cout << "full house" << endl;
}else if(two==2){
cout << "two pair" <<endl;
}else if(two==1){
cout << "one pair" <<endl;
}else if(three){
cout << "three card" <<endl;
}else if(four){
cout << "four card" <<endl;
}else{
bool straight_flag = 1;
bool ace_flag = 1;
bool has_13 = 0;
if(card[4]==13){
has_13=1;
}
for(int i=3;i>=0;i--){
if(ace_flag && card[i+1]-1==card[i]){
//cout<<1;
}else if(ace_flag && has_13 && card[i]==i+1){
//cout<<0;
ace_flag=0;
}else{
straight_flag=0;
break;
}
}
if(straight_flag){
cout << "straight" << endl;
}else{
cout << "null" << endl;
}
}
}
return 0;
} | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <utility>
#include <numeric>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
const ullong MOD = 1000000000 + 7;
int main()
{
string s;
for (; cin >> s;)
{
vector<int> a(14);
stringstream ss;
ss << s;
for (int i = 0; i < 5; i++)
{
int x;
ss >> x;
a.at(x - 1)++;
if (x == 1)
{
a.at(13)++;
}
ss.ignore();
}
int maxn = 0;
int cnt = 0;
int len = 0;
bool str = false;
for (int i = 0; i < 14; i++)
{
if (a.at(i) > 0)
{
maxn = max(maxn, a.at(i));
if (i < 13)
{
cnt++;
}
len++;
if (len >= 5)
{
str = true;
}
}
else
{
len = 0;
}
}
if (maxn == 4)
{
cout << "four card" << endl;
}
else if (maxn == 3)
{
if (cnt == 2)
{
cout << "full house" << endl;
}
else
{
cout << "three card" << endl;
}
}
else if (maxn == 2)
{
if (cnt == 3)
{
cout << "two pair" << endl;
}
else
{
cout << "one pair" << endl;
}
}
else
{
if (str)
{
cout << "straight" << endl;
}
else
{
cout << "null" << endl;
}
}
}
}
| 1 |
#include <iostream>
using namespace std;
int main() {
class Dice {
public:
int men[6];
void setMen(int i, int value) {men[i] = value;}
void getMen() {cout << men[0] << endl;}
void SwitchMen (char Alpha) {
switch (Alpha) {
case 'S':
ChangeMen(men[4], men[0], men[2], men[3], men[5], men[1]);
break;
case 'N':
ChangeMen(men[1], men[5], men[2], men[3], men[0], men[4]);
break;
case 'E':
ChangeMen(men[3], men[1], men[0], men[5], men[4], men[2]);
break;
case 'W':
ChangeMen(men[2], men[1], men[5], men[0], men[4], men[3]);
break;
}
}
void ChangeMen (int tmp1, int tmp2, int tmp3, int tmp4, int tmp5, int tmp6) {
men[0] = tmp1;
men[1] = tmp2;
men[2] = tmp3;
men[3] = tmp4;
men[4] = tmp5;
men[5] = tmp6;
}
};
Dice dice;
for(int i = 0; i < 6; i++) {
int tmp;
cin >> tmp;
dice.setMen(i, tmp);
}
char Alpha;
while(cin >> Alpha) {
dice.SwitchMen(Alpha);
}
dice.getMen();
// for(int i = 0; i < 6; i++) {
// cout << dice.men[i] << endl;
// }
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
signed main(){
int n,a,b,c;
while(1){
cin>>a>>b>>c;
n=a+b+c;
if(n==0) break;
int m;
cin>>m;
vi d(n+1,2),x(m),y(m),z(m),f(m);
rep(i,0,m){
cin>>x[i]>>y[i]>>z[i]>>f[i];
if(f[i]==1){
d[x[i]]=1;
d[y[i]]=1;
d[z[i]]=1;
}
}
rep(i,0,m){
if(f[i]==0){
if(d[x[i]]==1 && d[y[i]]==1) d[z[i]]=0;
else if(d[z[i]]==1 && d[y[i]]==1) d[x[i]]=0;
else if(d[x[i]]==1 && d[z[i]]==1) d[y[i]]=0;
}
}
rep(i,1,n+1){
o(d[i]);
}
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define MOD 1000000007
int32_t main(){
int d, t, s;
cin >> d >> t >> s;
if(((double)d/(double)s) <= t)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
}
void read(ll &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
}
int main()
{
int S,T,V;
read(S),read(T),read(V);
if(T*V>=S) puts("Yes");
else puts("No");
return 0;
}
| 1 |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int gcd(int x, int y) {
if (y == 0) return x;
return gcd(y, x % y);
}
bool solve(int n, vector<int> a) {
int parity = 0, odds = 0, minelem = a[0];
for (int i = 0; i < n; ++i) {
parity = (parity + a[i] - 1) % 2;
if (a[i] & 1) ++odds;
minelem = min(minelem, a[i]);
}
if (parity == 1) return true;
if (minelem == 1 || odds >= 2) return false;
int g = -1;
for (int i = 0; i < n; ++i) {
if (a[i] & 1) --a[i];
if (i == 0) g = a[i];
else g = gcd(g, a[i]);
}
for (int i = 0; i < n; ++i) {
a[i] /= g;
}
bool res = solve(n, a);
return !res;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
bool res = solve(n, a);
cout << (res ? "First" : "Second") << endl;
return 0;
} | #include<bits/stdc++.h>
/*zzzzdfadfadfad*/
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
const int N=100500;
int read(int &n)
{
char ch=' ';int q=0,w=1;
for(;(ch!='-')&&((ch<'0')||(ch>'9'));ch=getchar());
if(ch=='-')w=-1,ch=getchar();
for(;ch>='0' && ch<='9';ch=getchar())q=q*10+ch-48;n=q*w;return n;
}
int m,n,ans;
int a[N];
int g[N];
int gcd(int x,int y){return y?gcd(y,x%y):x;}
int main()
{
int w;
/*zzzzdfadfadfad*/
LL q;
read(n);
fo(i,1,n)q+=(LL)read(a[i]);
if(n==1&&a[1]==1)return printf("Second\n"),0;
if(n==1)return printf("First\n"),0;
if(!(n&1))
{
if(q&1)printf("First\n");
else printf("Second\n");
return 0;
}
if(!(q&1))return printf("First\n"),0;
for(bool I=0;1;I=!I)
{
g[n]=a[n];
LL t=a[n]-1;
/*zzzzdfadfadfad*/
fod(i,n-1,1)g[i]=gcd(g[i+1],a[i]),t+=(LL)a[i];
bool OK=0;
q=a[1];
if(a[1]-1&&(1&(t/(ans=gcd(g[2],a[1]-1)))))OK=1,--a[1];
else fo(i,2,n)if(a[i]-1)
{
w=gcd(q,a[i]-1);
if(i<n)w=gcd(w,g[i+1]);
if((1&(t/(ans=w))))
{
OK=1,--a[i];
break;
}
/*zzzzdfadfadfad*/
q=gcd(q,a[i]);
}else break;
if(!OK)
/*zzzzdfadfadfad*/
{
if(I)printf("First\n");
else printf("Second\n");
return 0;
}
fo(i,1,n)a[i]/=ans;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
vector<long long >v;
vector<long long >t;
vector<long long >f;
set<long long>s;
set<long long>::iterator it;
map<long long,long long>m;
for(int i=0;i<n;i++)
{
long long x;
cin>>x;
m[x]+=1;
s.insert(x);
}
long long mx=0;
for(it=s.begin();it!=s.end();it++)
{
if(m[*it]>=2)
{
t.push_back(*it);
}
if(m[*it]>=4)
{
f.push_back(*it);
}
}
if(f.size()!=0)
{
mx=max(mx,f[f.size()-1]*f[f.size()-1]);
}
if(t.size()>=2)
{
mx=max(mx,t[t.size()-1]*t[t.size()-2]);
}
cout<<mx<<endl;
}
| #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int main(){
int n;
cin >> n;
ll a[n];
FOR(i,n) cin >>a[i];
sort(a,a+n);
int j=n-1;
while(j>=1 && a[j]!=a[j-1]) j--;
if(j==0) {
cout <<0;
return 0;
}
else {
int k=j-2;
while(k>=1 && a[k]!=a[k-1]) k--;
if(k==0) {
cout << 0;
return 0;
}
else cout << a[j]*a[k];
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
int main(){
ll N;
cin>>N;
cout<<2*N*PI<<endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using gt = greater<int>;
using minq = priority_queue<int, vector<int>, gt>;
using P = pair<ll,ll>;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
//clang++ -std=c++11 -stdlib=libc++
int main() {
int A,B; cin >> A >>B;
int ans = 0;
if (A==B) ans = A+B;
else ans = max(A,B) * 2 -1;
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
vector<int> x = {1,-1,0,0};
vector<int> y = {0,0,-1,1};
int main(){
set<ll> data;
ll n;
cin >> n;
rep(i,0,n){
ll a;
cin >> a;
if(data.count(a)){
data.erase(a);
}else{
data.insert(a);
}
}
cout<<data.size()<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n, m;
cin >> n;
cin >> m;
int a[1000] = {};
int b[1000] = {};
int point[1000] = {};
int selected;
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < m; i++){
cin >> b[i];
}
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
if(a[j] <= b[i]){
point[j]++;
break;
}
}
}
selected = 0;
for(int i = 1; i < n; i++){
if(point[selected] < point[i]){
selected = i;
}
}
cout << selected + 1 << endl;
return 0;
} | 0 |
/* 十 聖イシドールスよ、迷えるプログラマを導き給え！ 十 */
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <deque>
#define rep(i, n) for(int i = 0; i < n; i++)
//const long long INF = 1LL << 60;
const int INF = 1e9;
using ll = long long;
int main()
{
int N, Q;
std::cin >> N >> Q;
std::vector<int> ACGT(N, 0); // AGCT[i]文字目までに何個現れたか
std::string S;
std::cin >> S;
// 前処理...ACの数を数えておく
char pre = S[0];
for( int i = 1; i < N; i++ )
{
char now = S[i];
//printf( "%c:%c", pre, now );
ACGT[i] = ACGT[i-1];
if( pre == 'A' )
{
if( now == 'C')
{
//printf("now!");
ACGT[i] = ACGT[i-1] + 1;
}
}
//printf("\n");
pre = now;
}
// printf("===\n");
// rep( i, N )
// {
// printf( "%d\n", ACGT[i]);
// }
// printf("===\n");
// 問題をとく
for( int i = 0; i < Q; i++ )
{
int l, r;
std::cin >> l >> r;
l--; r--;
int ans = ACGT[r] - ACGT[l];
if( ( S[l] == 'A' ) && ( S[r] == 'C' ) )
{
//ans++;
}
std::cout << ans << std::endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct StQuery
{
StQuery() : m_nLeft(0), m_nRigt(0) { }
int m_nLeft;
int m_nRigt;
};
void input(string& rsStr, vector<StQuery>& rvoQuery)
{
int nStrSiz, nQuerySiz;
cin >> nStrSiz >> nQuerySiz;
rvoQuery.resize(nQuerySiz);
cin >> rsStr;
for (StQuery& roQuery : rvoQuery)
cin >> roQuery.m_nLeft >> roQuery.m_nRigt;
}
void calcSubStrACCnt(string sStr, const vector<StQuery>& cnrvoQuery)
{
vector<int> vnCumlSum(sStr.size() + 1); // 累積和
//vnCumlSum_ix 0 1 2 3 4 5 6 7 8
//sStr_pos 1 2 3 4 5 6 7 8
//sStr A C A C T A C G
//sStr_ix 0 1 2 3 4 5 6 7
for (int nBgn = 0; nBgn < vnCumlSum.size() - 1; nBgn++)
{
vnCumlSum[ nBgn + 2 ] = vnCumlSum[ nBgn + 1 ];
if (sStr[nBgn] == 'A' && sStr[nBgn + 1] == 'C')
vnCumlSum[ nBgn + 2 ]++;
}
for (int i = 0; i < cnrvoQuery.size(); i++)
{
cout << vnCumlSum[ cnrvoQuery[i].m_nRigt ] - vnCumlSum[ cnrvoQuery[i].m_nLeft ];
cout << endl;
}
}
int main()
{
string sStr;
vector<StQuery> voQuery;
input(sStr, voQuery);
calcSubStrACCnt(sStr, voQuery);
return 0;
} | 1 |
#include <stdio.h>
int main() {
char s1[101], s2[101];
scanf("%s %s", s1, s2);
printf("%s%s\n", s2, s1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair < int , int >
const int N=1;
int main()
{
string x,y;
cin>>x>>y;
cout<<y+x;
}
| 1 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int dist[1005][1005];
int dx[4] = {-1,1,0,0};
int dy[4] = {0,0,-1,1};
int main(){
int h,w;cin >> h >> w;
queue<int> q;
rep(i,h)rep(j,w){
char ch;cin >> ch;
if(ch == '#'){
dist[i][j]=0;
q.push(w*i+j);
}else dist[i][j] = -1;
}
while(q.size()){
int ind = q.front();
q.pop();
int y = ind/w;
int x = ind%w;
for(int i = 0;i < 4;i++){
int ny = y + dy[i];
int nx = x + dx[i];
if(ny < 0 || nx < 0 || h <= ny || w <= nx) continue;
if(dist[ny][nx]!=-1) continue;
dist[ny][nx] = dist[y][x] + 1;
q.push(w*ny+nx);
}
}
int ans = 0;
rep(i,h){
rep(j,w){
ans = max(ans,dist[i][j]);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long M=1000000007;
vector<int> num;
int isprime[105];
int n,m,d;
string a,b;
long long dp[10005][2][2][105];
long long solve(int idx,int flag,int flag2,int rem)
{
//cout<<rem<<endl;
if(idx==b.size())
{
if(rem==0)
return 1;
else
return 0;
}
if(dp[idx][flag][flag2][rem]!=-1)
return dp[idx][flag][flag2][rem];
int lim=flag?9:(b[idx]-'0');
int lim1=flag2?0:(a[idx]-'0');
long long ans=0;
for(int i=lim1;i<=lim;i++)
{
ans=(ans+solve(idx+1,flag||(i<lim),flag2||(i>lim1),(rem+i)%m)%M)%M;
}
return dp[idx][flag][flag2][rem]=ans%M;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//ios_base& scientific (ios_base& str);
{
memset(dp,-1,sizeof(dp));
a="1";
cin>>b;
cin>>m;
n=b.size();
for(int i=0;i<n-1;i++)
a="0"+a;
cout<<solve(0,0,0,0)<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int fac[2000005], ifac[2000005];
void gen_fac()
{
fac[0] = 1;
rep1(i, 2000000) fac[i] = 1LL * fac[i - 1] * i % MOD;
ifac[1] = 1;
for(int i = 2; i <= 2000000; i ++) ifac[i] = MOD - 1LL * ifac[MOD % i] * (MOD / i) % MOD;
ifac[0] = 1;
rep1(i, 2000000) ifac[i] = 1LL * ifac[i - 1] * ifac[i] % MOD;
}
int comb(int n, int m)
{
if(n < m) return 0;
return 1LL * fac[n] * ifac[n - m] % MOD * ifac[m] % MOD;
}
int solve(int n, int m, int k)
{
int tot = comb((3 * m - k) / 2 + n - 1, n - 1);
tot = (tot - 1LL * k * comb((m - k) / 2 + n - 1, n - 1) % MOD + MOD) % MOD;
tot = (tot - 1LL * (n - k) * comb((m - k - 2) / 2 + n - 1, n - 1) % MOD + MOD) % MOD;
return tot;
}
int main()
{
gen_fac();
int n, m;
scanf("%d%d", &n, &m);
int ans = 0;
for(int i = 0; i <= m; i ++)
if(!(m - i & 1)) ans = (ans + 1LL * comb(n, i) * solve(n, m, i)) % MOD;
printf("%d\n", ans);
return 0;
} | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
//template<class T>void max(T a,T b){if(a<b)return b;else return a;}
//template<class T>void min(T a,T b){if(a>b)return b;else return a;}
//template<class T>bool Max(T&a, T b){if(a < b){a = b;return 1;}return 0;}
//template<class T>bool Min(T&a, T b){if(a > b){a = b;return 1;}return 0;}
//////////////////////////
ll po(ll i,ll p){
if(p==0)return 1;
else{
i=mod(i);
if(p==1)return i;
if(p%2==0)return po(mod(i*i),p/2);
return mod(i*po(i,p-1));
}
}
ll bunbo(ll n){
return po(n,i_5);
}
#define N 6000004
ll kai[N];
ll kai2[N];
void calc(){
kai[0]=1;
kai2[0]=1;
rep(i,1,N-1){
kai[i]=mod(kai[i-1]*i);
}
kai2[N-1]=po(kai[N-1],i_5);
for(ll i=N-2;i>=0;i--){
kai2[i]=mod(kai2[i+1]*(i+1));
}
}
ll comb(ll n,ll k){
if(n<k)return 0;
if(n==0)return 1;
return mod(mod(kai[n]*kai2[n-k])*kai2[k]);
}
int main(){fastio
calc();
ll n,m;cin>>n>>m;
ll a1,a2=0,a3=0;
a1=comb(3*m+n-1,n-1);
rep(ma,2*m+1,3*m){
ll res=3*m-ma;
Add(a2,comb(res+n-2,n-2));
}
a2=mod(a2*n);
rep(i,m+1,3*m){
if((3*m-i)%2==1)continue;
if(n<i)continue;
ll res=(3*m-i)/2;
Add(a3,comb(n,i)*comb(res+n-1,n-1));
}
cout<<mod(a1-a2-a3)<<endl;
return 0;
}
| 1 |
#include<cstdio>
int main()
{
while(true) {
int a, b, c, n;
int test[3000], r[1000];
int ans[1000];
scanf("%d%d%d", &a, &b, &c);
if(a == 0)
break;
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d%d%d%d", test + i * 3, test + i * 3 + 1, test + i * 3 + 2, r + i);
test[i * 3] -= 1, test[i * 3 + 1] -= 1, test[i * 3 + 2] -= 1;
}
for(int i = 0; i < a + b + c; ++i)
ans[i] = 2;
for(int i = 0; i < n; ++i) {
if(r[i] != 1)
continue;
for(int j = i * 3; j < i * 3 + 3; ++j)
ans[test[j]] = 1;
}
for(int i = 0; i < n; ++i) {
if(r[i] != 0)
continue;
int correct = 0;
for(int j = i * 3; j < i * 3 + 3; ++j)
correct += (ans[test[j]] == 1);
if(correct != 2)
continue;
for(int j = i * 3; j < i * 3 + 3; ++j) {
if(ans[test[j]] != 1)
ans[test[j]] = 0;
}
}
for(int i = 0; i < a + b + c; ++i)
printf("%d\n", ans[i]);
}
return 0;
} |
#include<iostream>
using namespace std;
struct Test{
int A[3];
bool R;
};
Test tests[1000];
int info[301], M[3], N;
int main()
{
while(true)
{
for(int i = 0; i <= 300; i++)
info[i] = 2;
cin >> M[0] >> M[1] >> M[2];
if(!(M[0] || M[1] || M[2]))
break;
cin >> N;
for(int i = 1; i <= N; i++)
cin >> tests[i].A[0] >> tests[i].A[1] >> tests[i].A[2] >> tests[i].R;
bool b = true;
while(b)
{
b = false;
for(int i = 1; i <= N; i++)
{
if(tests[i].R)
{
for(int j = 0; j < 3; j++)
{
if(info[tests[i].A[j]] != 1)
{
info[tests[i].A[j]] = 1;
b = true;
}
}
}
else
{
int tmp = 0;
bool f = false;
for(int j = 0; j < 3; j++)
{
tmp += info[tests[i].A[j]] == 1;
}
if(tmp == 2)
{
for(int j = 0; j < 3; j++)
{
if(info[tests[i].A[j]] == 2)
{
info[tests[i].A[j]] = 0;
b = true;
}
}
}
}
}
}
for(int i = 1; i <= M[0] + M[1] + M[2]; i++)
{
cout << info[i] << endl;
}
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
/*"itob" int to "N"base */ template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());return ret;}
/*"chmin" a = MAX*/ template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
/*"chmax" a = MIN*/ template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
/*"ctoi" char to int*/ int ctoi(char c) {return c-'0';}
/*"gcd" MAX Euclidean */ ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
/*"lcm" MIN*/ ll lcm(ll a,ll b){ll g = gcd(a,b);return a/g*b;}
/*"primecheck"If prime,return true.*/bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
ll modpow(ll a,ll n, ll mod){ll res = 1;while(n>0){if (n%2==1){res = res * a % mod;}a = a * a % mod;n/=2;}return res;}
int main() {
double n;
cin >> n;
vector<double>a(n);
double sum =0;
for(int i=0;i<n;i++){
cin >>a.at(i);
sum+=a.at(i);
}
sum/=n;
vector<pair<double,int>>d(n);
for(int i=0;i<n;i++){
if(sum==a.at(i)){
cout <<i<<endl;
return 0;
}
d.at(i)=make_pair(abs(sum-a.at(i)),i);
}
sort(d.begin(),d.end());
cout << d.at(0).second<<endl;
}
| #include <iostream>
#include <algorithm>
#include <stdlib.h>
using namespace std;
int main(void){
int n;cin>>n;
int a[n];
for (int i =0;i<n;i++){
cin>>a[i];
}
int sm=0;
for (int i =0;i<n;i++){
sm+=a[i];
}
for (int i =0;i<n;i++){
a[i]*=n;
}
int mn = 1000000;
int ans =-1;
for (int i =0;i<n;i++){
if (mn>abs(sm-a[i])){
ans = i;
mn=abs(sm-a[i]);
}
}
cout<<ans;
}
| 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<set>
#include<cmath>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(a) a.begin(),a.end()
typedef long long ll;
typedef long double ld;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
int n, m, x, y,q;ll z, w=0, sum = 0, ans = 0;
const int MAX = 510000;
const int MOD = 1000000007;
int dp[10010][2][110];
int main(void) {
string s; int d; cin >> s >> d;
Fill(dp, 0);
dp[0][1][0] = 1;
rep(i, s.size()) {
rep(j, d) {
rep(k, 10) {
dp[i + 1][0][(j + k) % d] += dp[i][0][j];
dp[i + 1][0][(j + k) % d] %= MOD;
}
int Si = s[i] - '0';
rep(k, Si) {
dp[i + 1][0][(j + k) % d] += dp[i][1][j];
dp[i + 1][0][(j + k) % d] %= MOD;
}
dp[i + 1][1][(j + Si) % d] = dp[i][1][j];
}
}cout << (dp[s.size()][0][0] + dp[s.size()][1][0] - 1 + MOD) %MOD << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int MAXN=10005;
int P=1e9+7,d,len;
char k[MAXN];
long long a[MAXN],dp[10005][105];
long long dfs(int pos,int tot,bool lim)
{
// cout<<pos<<' '<<tot<<' '<<lim<<endl;
if(pos==len+1)
{
if(tot==0) return 1;
return 0;
}
if(!lim&&dp[pos][tot]!=-1) return dp[pos][tot];
long long ret=0 , up=lim?a[pos]:9 ;
for(int i=0;i<= up ;++i)
{
ret=(ret+dfs(pos+1,(tot+i)%d, lim&&i==a[pos] ))%P;
//(ret+=dfs(pos+1,(tot+i)%d, lim&&i==a[pos] ) )%=P;
}
if(!lim) dp[pos][tot]=ret;
return ret;
}
int main()
{
memset(dp,-1,sizeof(dp));
scanf("%s",k+1);
scanf("%d",&d);
len=strlen(k+1);
for(int i=1;i<=len;++i)
{
a[i]=k[i]-'0';
}
long long ans=(dfs(1,0,1)-1+P)%P;
printf("%lld\n",ans);
return 0;
}
| 1 |
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
using namespace std;
int d[30],len,dp[30][30][30];
int DP(int n){
int ret=0;
memset(dp,0,sizeof(dp));
dp[0][0][0]=1;
for(int i=0;i<(n>>1);i++)
for(int j=0;j<10;j++)
for(int k=0;k<10;k++)
if(dp[i][j][k])
for(int x=0;x<10;x++){
int l1=x+d[i+1]+k,y=l1%10,l2=10*j+x-y-d[n-i];
l1/=10;
if(l2<0||l2>9||(!i&&(!x||!y)))
continue;
dp[i+1][l2][l1]+=dp[i][j][k];
}
if(n&1){
int mid=(n+1)>>1;
for(int i=0;i<10;i++)
for(int j=0;j<10;j++)
if(dp[n>>1][i][j])
for(int x=0;x<10;x++){
int y=x+d[mid]+j;
if(x==y%10&&y/10==i)
ret+=dp[n>>1][i][j];
}
}
else
for(int i=0;i<10;i++)
ret+=dp[n>>1][i][i];
return ret;
}
int getans(){
int ret=0;
for(int i=max(2,len);i<=20;i++)
ret+=DP(i);
return ret;
}
void Input(){
char c;
do c=getchar();
while(!isdigit(c));
do{
d[++len]=c^48;
c=getchar();
}while(isdigit(c));
reverse(d+1,d+len+1);
return;
}
int main(){
Input();
printf("%d",getans());
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll D,ans;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>D;
if(D%9){
cout<<0<<'\n';
return 0;
}
D/=9;ll pw=1;
for(int i=1;i<=17;++i){
ll tmp=1,d=D,lp=pw,rp=1;pw*=10;
ll b=(pw-1)/9;
for(int j=0;j+j<=i;++j){
tmp*=10-abs(d%(rp*10)/rp)-!j;
d-=b*(d%(rp*10)/rp);
b-=lp+rp;lp/=10;rp*=10;
}
if(!d)ans+=tmp;
}
cout<<ans<<'\n';
return 0;
}
| 1 |
#include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double, char*, const char*>> any;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs[xs.size()-1]))<<endl;
}
#ifdef DEBUG
#define debug(...) pr(any{__VA_ARGS__})
#define debugv(x) pr((x))
#else
#define debug(...)
#define debugv(x)
#endif
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
int sum = 0;
for(int i=0; i<N; i++) sum += A[i];
int diff = abs(sum-N*A[0]);
int idx = 0;
for(int i=1; i<N; i++) {
int d = abs(sum-N*A[i]);
debug(i, d);
if(d < diff){
diff = d;
idx = i;
}
}
cout << idx << endl;
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main() {
int N;
cin >> N;
vector<double> a(N);
REP(i,N) cin >> a[i];
double av = accumulate(ALL(a),double(0))/N;
int ans = 0;
double shortest = INF;
REP(i,N) {
if (chmin(shortest,abs(av-a[i]))) {
ans = i;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
int c;
while((c=a%b)!=0){
a=b;
b=c;
}
return b;
}
vector<int> divisor(int n){
vector<int> div;
for(int i=1;i<=n;i++){
if(n%i==0){
div.push_back(n/i);
}
}
sort(div.begin(),div.end());
return div;
}
int main(void){
int n,A[3],gcdA;
vector<int> div;
cin>>n;
if(n==2){
cin>>A[0]>>A[1];
gcdA=gcd(A[0],A[1]);
vector<int> div=divisor(gcdA);
for(int i=0;i<div.size();i++){
cout<<div[i]<<endl;
}
}else{
cin>>A[0]>>A[1]>>A[2];
gcdA=gcd(A[0],gcd(A[1],A[2]));
vector<int> div=divisor(gcdA);
for(int i=0;i<div.size();i++){
cout<<div[i]<<endl;
}
}
return 0;
}
| #include "bits/stdc++.h"
#define rep(i,a,n) for(int i = a;i < n;i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int main(){
int n,memo;
priority_queue<int,vector<int>,greater<int> > que;
cin >> n;
int a[n];
rep(i,0,n){
cin >> a[i];
}
sort(a,a+n);
rep(i,1,sqrt(a[n-1])+1){
rep(j,0,n){
if(a[j] % i)break;
else if(j == n-1)que.push(i);
}
if(a[n-1]/i == i)continue;
rep(j,0,n){
if(a[j] % (a[n-1]/i))break;
else if(j == n-1)que.push(a[n-1]/i);
}
}
while(!que.empty()){
if(que.top() == memo){
que.pop();
continue;
}
memo = que.top(); que.pop();
cout << memo << endl;
}
}
| 1 |
#include"bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first - r.first, l.second - r.second); }
lint N;
lint arr_A[100000], arr_B[100000];
plint arr[100000];
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> N;
lint sum = 0;
REP(i, N) {
cin >> arr_A[i] >> arr_B[i];
arr[i] = plint(arr_A[i] + arr_B[i], i);
sum -= arr_B[i];
}
sort(arr, arr + N);
reverse(arr, arr + N);
REP(i, (N + 1) / 2) {
sum += arr[2 * i].first;
}
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
int ii() { int x; if (scanf("%d", &x)==1) return x; else return 0; }
long long il() { long long x; if (scanf("%lld", &x)==1) return x; else return 0; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); } // 古い問題用
void od(double x) { printf("%.15f ", x); }
// long doubleで受け取り、fをLfなどに変えて出力すると、変な数値が出る
// それをなんとかするには独自の出力を作らなければならなそう
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}} //動作未確認
void br() { putchar('\n'); }
// #define gcd __gcd //llは受け取らない C++17~のgcdと違うので注意
// int lcm(int a, int b){return a / gcd(a, b) * b;}
#define begin_end(a) a.begin(),a.end() //sort(begin_end(vec));
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; i++ )
#define rep(i,n) REP(i,0,n)
#define m_p(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define p_b push_back
#define SZ(x) ((int)(x).size) //size()がunsignedなのでエラー避けに
// coutによるpairの出力（空白区切り）
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
// coutによるvectorの出力（空白区切り）
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " "; //"\t"に変えるとTabで見やすく区切る
}
return s;
}
// coutによる多次元vectorの出力（空白区切り）
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
//最大値、最小値の更新。更新したor等しければtrueを返す
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
//4近傍（上下左右） rep(i, 2) にすると右・下だけに進む
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
// -------- template end - //
// - library ------------- //
// --------- library end - //
int main(){
ll N = il();
vector<vector<ll> > abs;
rep(i,N){
ll a = il();
ll b = il();
abs.p_b(vector<ll>{a+b, a, b});
}
sort(abs.begin(), abs.end());
reverse(begin_end(abs));
ll ans;
rep(i, N){
if (i % 2 == 0) ans += abs[i][1];
else ans -= abs[i][2];
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1001001001;
int main(){
string str;
cin >> str;
vector<int> num;
for(int i=0;i<str.size();i++){
num.push_back(str.at(i)-'0');
}
reverse(num.begin(),num.end());
num.push_back(0);
int n=num.size();
// 下からi桁目までに使用する紙幣の最小
// j=0のときは繰り下がりなし、j=1のときは繰り下がりあり
vector<vector<int>> dp(n+1,vector<int>(2));
for(int i=0;i<n+1;i++){
for(int j=0;j<2;j++){
dp.at(i).at(j) = inf;
}
}
dp.at(0).at(0) = 0;
//状態(i,j)が確定しているときに状態(ni,nj)を計算する
for(int i=0;i<n;i++){
for(int j=0;j<2;j++){
int x = num.at(i);
x += j;
for(int a=0;a<10;a++){
int ni = i+1;
int nj = 0;
int b = a-x;
if(b<0){
b += 10;
nj = 1;
}
dp.at(ni).at(nj) = min( dp.at(ni).at(nj), dp.at(i).at(j)+a+b );
}
}
}
//n桁全て確定したときに繰り下がりはあってはいけない
cout << dp.at(n).at(0) << endl;
return(0);
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
string S; cin >> S;
S = "00" + S;
int N = S.length();
int ans = 0;
for(int i = N - 1; i >= 0; i--) {
if(S[i] > '9') {
S[i - 1]++;
S[i] -= 10;
}
if(S[i] <= '4' || (S[i] == '5' && S[i - 1] < '5')) {
ans += S[i] - '0';
} else {
ans += 10 - (S[i] - '0');
S[i - 1]++;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,y;
cin >> n >> y;
int tth=n,fth=0,th=0;
bool ok=false;
for(int i=0;i<=n;i++){
tth=i;
for(int j=0;j<=n-i;j++){
fth=j;
th=n-i-j;
if(tth*10000+fth*5000+th*1000==y){
ok=true;
break;
}
}
if(ok)
break;
}
if(ok)
cout << tth << " " << fth << " " << th << endl;
else
cout << "-1 -1 -1\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,N;
cin >> N >> K;
cout << N-K+1 << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll>pll;
ll n,x[100010]={0},y[100010]={0};
vector<pll>vx,vy;
vector<pll>edge[100010];
priority_queue<pll,vector<pll>,greater<pll>>q;
//priority_queue<pll>q;
bool used[100010];
ll res=0;
signed main(){
cin>>n;
for(int i=0;i<n;++i){
cin>>x[i]>>y[i];
vx.push_back(pll(x[i],i));
vy.push_back(pll(y[i],i));
}
sort(vx.begin(),vx.end());
sort(vy.begin(),vy.end());
for(int i=0;i<n-1;++i){
ll j=vx[i].second,k=vx[i+1].second;
ll wj=vx[i].first,wk=vx[i+1].first;
edge[j].push_back(pll(wk-wj,k));
edge[k].push_back(pll(wk-wj,j));
j=vy[i].second,k=vy[i+1].second;
wj=vy[i].first,wk=vy[i+1].first;
edge[j].push_back(pll(wk-wj,k));
edge[k].push_back(pll(wk-wj,j));
}
for(int i=0;i<n;++i){
used[i]=false;
}
int c=1;
for(int i=0;i<edge[0].size();++i)q.push(edge[0][i]);
used[0]=true;
while(c<n){
pll t=q.top();
q.pop();
if(!used[t.second]){
res+=t.first;
for(int i=0;i<edge[t.second].size();++i){
q.push(edge[t.second][i]);
}
used[t.second]=true;
c++;
//cout<<t.first<<" "<<t.second<<endl;
}
}
cout<<res<<endl;
return 0;
} | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<ll>
#define vp vector<pii>
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.size()
#define F first
#define S second
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define ROF(i,a,b) for(ll i=a;i>=b;--i)
#define trace(x) cerr<<#x<<": "<<x<<'\n';
typedef long long ll;
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
ll mexp(ll a, ll b){
ll ans=1;
a%=MOD;
while(b){
if(b&1) ans=ans*a%MOD;
b>>=1;
a=a*a%MOD;
}
return ans;
}
const int N = 100005;
bool cmp1(pair<int,pair<int,int>>a, pair<int,pair<int,int>>b){
return a.S.F<b.S.F;
}
bool cmp2(pair<int,pair<int,int>>a, pair<int,pair<int,int>>b){
return a.S.S<b.S.S;
}
pair<int,pair<int,int>>c[N];
int par[N],siz[N];
int find(int x){
while(par[x]!=x){
x=par[x];
}
return x;
}
void un(int a,int b){
a=find(a);
b=find(b);
if(siz[a]<siz[b]){
par[a]=par[b];
siz[b]+=siz[a];
}
else{
par[b]=par[a];
siz[a]+=siz[b];
}
}
int main(){
IOS
int n;
cin>>n;
FOR(i,1,n+1){
par[i]=i;
siz[i]=1;
c[i].F=i;
cin>>c[i].S.F>>c[i].S.S;
}
vector<pair<int,pair<int,int>>>v;
sort(c+1,c+n+1,cmp1);
FOR(i,1,n){
v.pb(mp(c[i+1].S.F-c[i].S.F,mp(c[i].F,c[i+1].F)));
}
sort(c+1,c+n+1,cmp2);
FOR(i,1,n){
v.pb(mp(c[i+1].S.S-c[i].S.S,mp(c[i].F,c[i+1].F)));
}
sort(all(v));
int cnt=0;
int i=0;
ll ans=0;
while(cnt<n-1){
int x=find(v[i].S.F),y=find(v[i].S.S);
if(x==y){
i++;
continue;
}
un(x,y);
ans+=v[i].F;
i++;
cnt++;
}
cout<<ans;
cerr<<"Time: "<<1.0/CLOCKS_PER_SEC<<" ms"<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define rap(p, a, b) for (ll p = a; p <= b; p++)
#define per(p, a, b) for (ll p = a; p >= b; p--)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll, ll> pll;
int main()
{
ll t, i, j, k, ans, n;
//cin>>t;
t = 1;
while (t--)
{
int a,b,c;
cin>>a>>b>>c;
set<ll> s;
s.insert(a);s.insert(b);s.insert(c);
if(s.sz==2)cout<<"Yes";
else cout<<"No";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
//setprecision(15)
int main() {
int a, b, c; cin >> a >> b >> c;
if ( a == b || b == c || c == a ) {
if (a == b && b == c) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} else {
cout << "No" << endl;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
const int MAX_N = 410;
const int MAX_X = 3e5+10;
const int MOD = 1e9+7;
int dp[MAX_N][MAX_X];
// i番目までで先頭の値がjの時の総和をdp[i][j]をおく
void modadd(int &a, int b ){
a = (a+b)%MOD;
}
signed main(void){
int N,X; cin >> N >> X;
vector<int> s(N);
map<int,int> mp;
for(int i = 0; i < N; i++){ cin >> s[i]; }
sort(s.begin(),s.end());
for(int i = 0; i < MAX_X; i++){ dp[0][i] = i;}
for(int i = 0; i < N; i++){
// 次にi+1コメを見る
for(int x = 0; x < MAX_X; x++){ //先頭の文字全体を探索する
//未更新から飛ばさない方がいい？
modadd(dp[i+1][x],dp[i][x%s[i]]);
modadd(dp[i+1][x],dp[i][x]*i);
}
}
cout << dp[N][X] << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60
int x[100001], y[100001];
ll sumx[100001], sumy[100001]; // sum[i] ; 1～iまでの和
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
sumx[0] = sumy[0] = 0LL;
for (int i = 1; i <= n; i++) {
cin >> x[i];
sumx[i] = sumx[i - 1] + x[i];
}
for (int i = 1; i <= m; i++) {
cin >> y[i];
sumy[i] = sumy[i - 1] + y[i];
}
ll L = 0LL;
for (int i = 1; i <= m; i++) {
L += sumy[m] - sumy[i] - (m - i)*ll(y[i]);
L %= MOD;
}
ll K = 0LL;
for (int i = 1; i <= n; i++) {
K += sumx[n] - sumx[i] - (n - i)*ll(x[i]);
K %= MOD;
}
cout << K * L % MOD << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll h,w,a,b;cin >> h >> w >> a >> b;
string s;
rep(i,a)s+='1';
rep(i,w-a)s+='0';
rep(i,b){
cout << s << endl;
}
rep(i,w)s[i]^='0'^'1';
rep(i,h-b){
cout << s <<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int H, W, A, B;
bool ans[1005][1005];
int main(){
cin >> H >> W >> A >> B;
for (int i = 0; i < B; i++){
for (int j = 0; j < W; j++){
if (j < A) cout << 0;
else cout << 1;
}
cout << endl;
}
for (int i = B; i < H; i++){
for (int j = 0; j < W; j++){
if (j < A) cout << 1;
else cout << 0;
}
cout << endl;
}
return 0;
}
| 1 |
#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);}
}
const int N=1e5+5;
int n,m,p,a[N],b[N],ans=1e9;
signed main(){
read(n,m,p);
for(int i=1;i<=n;i++) read(a[i]);
for(int i=1;i<=m;i++) read(b[i]);
ans=*min_element(a+1,a+1+n)+*min_element(b+1,b+1+n);
while(p--){
int x,y,z;
read(x,y,z);
ans=min(ans,a[x]+b[y]-z);
}
write(ans);
} | #include <iostream>
#include <algorithm>
using namespace std;
static const int N = 100;
int main() {
int n, p[N + 1], m[N + 1][N + 1];
scanf("%d", &n);
for ( int i = 1; i <= n; i++ ) {
cin >> p[i - 1] >> p[i];
}
for ( int i = 1; i <= n; i++ ) m[i][i] = 0;
for ( int l = 2; l <= n; l++ ) {
for ( int i = 1; i <= n - l + 1; i++ ) {
int j = i + l - 1;
m[i][j] = (1 << 21);
for ( int k = i; k <= j - 1; k++ ) {
m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
}
}
}
printf("%d\n", m[1][n]);
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl) vl.begin(),vl.end()
#define m_p make_pair
#define sz(a) sizeof(a)
#define forn(mp,it) for(it = mp.begin();it!=mp.end();it++)
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define FORE(i,a,n) FOR(i,a,n+1)
#define Endl endl
#define eNdl endl
#define enDl endl
#define endL endl
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll k;
cin>>k;
vector<ll> vl;
string s = "~abcdefghijklmnopqrstuvwxyz";
if(k<=26)
{
cout<<s[k]<<endl;
return 0;
}
while(k>=26)
{
ll yu = k%26;
k/=26;
if(yu == 0)
{
yu = 26;
k--;
}
vl.pb(yu);
}
if(k>0)
vl.pb(k);
reverse(all(vl));
FOR(i,0,vl.size())
{
if(vl[i]>0)cout<<s[vl[i]];
else cout<<"z";
}
cout<<endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
void insertionSort(vector<int> &a, int g, long &cnt)
{
int j;
int v;
for (int i = g; i < a.size(); i++)
{
v = a[i];
j = i - g;
while (j >= 0 && a[j] > v)
{
a[j + g] = a[j];
j = j - g;
cnt++;
if (cnt > (int)pow(a.size(), 1.5))
{
return;
}
}
a[j + g] = v;
}
}
int shellSort(vector<int> &a, vector<int> &g)
{
long cnt = 0;
for (int i = 0; i < g.size(); i++)
{
insertionSort(a, g[i], cnt);
if (cnt > (int)pow(a.size(), 1.5))
{
break;
}
}
return cnt;
}
int main()
{
int n;
long cnt = 0;
cin >> n;
vector<int> a(n, 0);
vector<int> org(a);
vector<int> g;
for (int i = 0; i < n; i++)
{
cin >> org[i];
}
for (int m = 100; m >= 1; m--)
{
a = org;
g.resize(m);
g[m - 1] = 1;
for (int i = 1; i < m; i++)
{
g[m - 1 - i] = 3 * g[m - i] + 1;
if ((g[m - 1 - i] <= 0) || (n <= g[m - 1 - i]))
{
g[0] = -1;
break;
}
}
if (g[0] < 0)
{
continue;
}
else
{
cnt = shellSort(a, g);
if (cnt <= pow(n, 1.5))
{
break;
}
}
}
cout << setprecision(10) << g.size() << endl;
for (int i = 0; i < g.size(); i++)
{
cout << g[i];
if (i == g.size() - 1)
{
cout << endl;
}
else
{
cout << " ";
}
}
cout << cnt << endl;
for (int i = 0; i < n; i++)
{
cout << a[i] << endl;
}
}
| 0 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
template<typename T>
struct BIT{
int n;
vector<T> d;
BIT(int n = 0):n(n),d(n+1){}
void add(int i,T x=1){
for(i++;i<=n;i += i&-i){
d[i] += x;
}
}
T sum(int i){
T x = 0;
for(i++;i>0;i -= i&-i){
x += d[i];
}
return x;
}
};
int main(){
int n,m,q;cin >> n >> m >> q;
vector<P> sche(m);
vector<pair<P,int>> query(q);
rep(i,m){
int l,r;cin >> l >> r;
sche[i] = make_pair(l,r);
}
sort(sche.rbegin(),sche.rend());
vector<int> ans(q);
rep(i,q){
int p,q;cin >> p >> q;
P temp = make_pair(p,q);
query[i] = make_pair(temp,i);
}
sort(query.rbegin(),query.rend());
int inds = 0;
int indq = 0;
BIT<int> tree(505);
for(int x = n;x >= 0;x--){
while(inds < m && sche[inds].first >= x) {
tree.add(sche[inds].second,1);
inds++;
}
while(indq < q && query[indq].first.first >= x){
ans[query[indq].second] += tree.sum(query[indq].first.second);
indq++;
}
}
rep(i,q) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,q; cin>>n>>m>>q;
vector<vector<int>> a(n,vector<int> (n,0));
for(int i=0;i<m;i++){
int l,r; cin>>l>>r;
l--; r--;
a[l][r]++;
}
vector<vector<int>> s(n+1,vector<int> (n+1,0));
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
s[i+1][j+1]=s[i][j+1]+s[i+1][j]-s[i][j]+a[i][j];
}
}
for(int i=0;i<q;i++){
int x,y; cin>>x>>y;
x--;
cout<<s[y][y]-s[x][y]-s[y][x]+s[x][x]<<endl;
}
} | 1 |
#include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
int in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}
int in() {return in(gcu());}
bool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}
bool scan(char &c){c=gcu();gcu();return c!=EOF;}
//bool scan(string &s){int c;s="";
// for(;;){c=gcu();if(c=='\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}
#define pcu putchar_unlocked
#define vo inline void out
template <typename T>
vo(T n){static char buf[20];char *p=buf;
if(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;
while (p!=buf)pcu(*--p);}
vo(const char *s){while(*s)pcu(*s++);}
vo(char c){pcu(c);}
//vo(string &s){for (char c: s) pcu(c);}
template <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}
//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);out('\n');}
#undef vo
int main() {
for (int e, m; (e = m = in());) {
for (int z = cbrt(e) + 0.00001; z >= 0; z--) {
int te = e - z * z * z;
int y = (int)sqrt(te);
int tm = z + y + te - y * y;
if (y > m)
break;
m = min(m, tm);
}
out(m, '\n');
}
}
| #include <iostream>
using namespace std;
static const int INF = 1000001;
int main() {
while (true) {
int e;
cin >> e;
if (e == 0) break;
int i;
for (i = 0; i * i * i <= e; i++)
;
int t = i - 1;
int m = INF;
for (int j = t; j >= 0; j--) {
int tz = j * j * j;
for (int k = 0; tz + k * k <= e; k++) {
int ty = k * k;
int tx = e - tz - ty;
if (tx + k + j < m)
m = tx + k + j;
}
}
cout << m << endl;
}
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main(){
int n;
long a, min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (n; n > 0; n--) {
cin >> a;
if ( a > max) max = a;
if ( a < min) min = a;
sum += a;
}
cout << min << " " << max << " " << sum << "\n";
return 0;
} | #include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
ll int tc=1;
while(tc--)
{
ll int n;
cin>>n;
string s;
while(n)
{
s+='a'+(n-1)%26;
n=(n-1)/26;
}
reverse(s.begin(),s.end());
cout<<s<<endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
void YN(bool flg){if(flg) cout << "YES" << endl; else cout << "NO" << endl;}
void Yn(bool flg){if(flg) cout << "Yes" << endl; else cout << "No" << endl;}
void yn(bool flg){if(flg) cout << "yes" << endl; else cout << "no" << endl;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main()
{
int n;
ll y;
cin >> n >> y;
int ansI = -1, ansJ = -1, ansK = -1;
rep(i, n+1) rep(j, n+1) {
int k = n-i-j;
if(k < 0) continue;
if(10000*i+5000*j+1000*k == y) {
ansI = i, ansJ = j, ansK = k;
}
}
cout << ansI << " " << ansJ << " " << ansK << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define deb(x) cerr<<"["#x<<" : "<<x<<" ]\n";
int main()
{
using ll = long long;
ll n, y;
cin >> n >> y;
ll k = y - 1000*n;
deb(k);
int b = 0, a = 0;
while(true) {
if((k - (4000*b)) < 0) {
puts("-1 -1 -1");
return 0;
}
if((k - 4000*b) % 9000 == 0) {
a = (k - 4000*b) / 9000;
deb(a);
deb(b);
break;
}
b++;
}
if((n - a - b) < 0) puts("-1 -1 -1");
else cout << a << ' ' << b << ' ' << n-a-b;
}
| 1 |
#include <iostream>
using namespace std;
long long d, t, s;
int main()
{
cin >> d >> t >> s;
if(t * s >= d)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int A,B;
string S,ans="No";
cin>>A>>B>>S;
int SS=S.size();
if((A+B+1)!=SS){
cout<<ans<<endl;
return 0;
}
rep(i,SS){
if(i!=A&&S[i]=='-'){
cout<<ans<<endl;
return 0;
}
}
if(S[A]=='-')ans="Yes";
cout<<ans<<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define ll long long
int ctoi(char c) {return c-'0';}/*char to int*/
int gcd(ll a,ll b){return b?gcd(b,a%b):a;}/*MAX*/
int lcm(ll a,ll b){return a*b/gcd(a,b);}/*MIN*/
bool primecheck(ll n){/*sosuu*/if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
int main(){
double n,sum=0;
cin >>n;
vector<double>a(n),b(n);
for(int i =0;i<n;i++){
double z;
cin >>z;
sum+=z;
a.at(i)=z;
b.at(i)=z;
}
sum/=n;
for(int i=0;i<n;i++){
a.at(i)=abs(a.at(i)-sum);
b.at(i)=a.at(i);
}
sort(a.begin(),a.end());
for(int i=0;i<n;i++){
if(a.at(0)==b.at(i)){
cout << i <<endl;
break;
}
}
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
cin >> n;
vector<double> a(n);
vector<double> b(n);
int sum=0;
rep(i,n){
cin >> a[i];
sum+=a[i];
}
double ave=(double)sum/n;
int ans=0;
rep(j,n){
b[j]=abs(ave-a[j]);
}
sort(b.begin(),b.end());
rep(i,n){
if(abs(ave-a[i])==b[0]){
ans=i;
break;
}
}
cout << ans << endl;
return 0;
} | 1 |
#include<cstdio>
using ull = unsigned long long;
const static int MOD = 1000000007;
const static int MAX_H = 100;
const static int MAX_W = 8;
ull dp[MAX_H+1][MAX_W], fibonacci[8] = {1, 1, 2, 3, 5, 8, 13, 21};
int main(){
unsigned H, W, K;
scanf("%u %u %u", &H, &W, &K);
if(W == 1){
printf("1\n");
return 0;
}
K--;
dp[0][0] = 1;
for (size_t i = 1; i <= H; i++){
dp[i][0] = (dp[i-1][0]*fibonacci[W-1] + dp[i-1][1]*fibonacci[W-2]) %MOD;
for (size_t j = 1; j < W-1; j++){
dp[i][j] = (dp[i-1][j-1]*fibonacci[j-1]*fibonacci[W - j - 1] + dp[i-1][j]*fibonacci[j]*fibonacci[W - j - 1] + dp[i-1][j+1]*fibonacci[j]*fibonacci[W - j - 2]) %MOD;
}
dp[i][W-1] = (dp[i-1][W-1]*fibonacci[W-1] + dp[i-1][W-2]*fibonacci[W-2]) %MOD;
}
printf("%llu\n", dp[H][K]);
return 0;
} | //#define NDEBUG
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
if(pvaspace) b << " "; pvaspace=true;\
b << pva;\
}\
b << "\n";}
//#define TEST
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
const ll MOD = 1000000007;
const ll MAX = 2147483647;
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
return o << '(' << p.F << ',' << p.S << ')';
}
int main(){
StarBurstStream
int h, w, k;
cin >> h >> w >> k;
vector<ll> dp(w + 2);
dp[1] = 1;
for(int i = 1; i <= h; i++){
vector<ll> dp2(w + 2);
for(int j = 1; j <= w; j++){
for(int t = 0; t < (1 << (w - 1)); t++){
// cerr << "test " << t << "\n";
t <<= 1;
bool tmp = true;
for(int l = 1; l < w; l++){
if((t & (1 << l)) && (t & (1 << (l + 1)))) tmp = false;
}
// cerr << "test " << t << " " << tmp << "\n";
if(tmp){
// cerr << t << "\n";
if(!(t & (1 << j)) && !(t & (1 << (j - 1)))) dp2[j] += dp[j];
if(t & (1 << (j - 1))) dp2[j] += dp[j - 1];
if(t & (1 << j)) dp2[j] += dp[j + 1];
dp2[j] %= MOD;
}
t >>= 1;
}
}
dp = dp2;
// printv(dp, cerr);
}
cout << dp[k] << "\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using vecll = vector<ll>;
using boost::irange;
int main()
{
int n,t;
cin>>n>>t;
vector<vecint> dp(n+1, vecint(t+3001, 0));
vector<tuple<int,int>> vt;
for(int i:irange(0,n)) {
int a,b;
cin>>a>>b;
vt.emplace_back(a,b);
}
boost::sort(vt);
for(int i:irange(0,n)) {
int a,b;
tie(a,b) = vt[i];
for(int j:irange(0,t+3001)) {
dp[i+1][j] = max(dp[i+1][j], dp[i][j]);
if (j < t) {
dp[i+1][j+a] = max(dp[i+1][j+a], dp[i][j] + b);
}
}
}
cout<<*boost::max_element(dp[n])<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
long long dp[2][3003];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector<string>vst;
set<long long>st,nt,tt; map<long long,long long>mp,nq,qr; string str,ttr,ntr;
scanf("%lld %lld",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%lld %lld",&a,&b); vct.push_back(make_pair(a,b));
}
sort(vct.begin(),vct.end());
long long idx,cap;
for(idx=n-1;idx>=0;idx--)
{
for(cap=1;cap<=k;cap++)
{
fr=idx%2; sc=(idx+1)%2; a=vct[idx].first; b=vct[idx].second;
p=0; q=0;
if(idx==n-1 || cap-a<=0){ p=b; }
else{ p=b+dp[sc][cap-a]; }
if(idx!=n-1){ q=dp[sc][cap]; }
dp[fr][cap]=max(p,q);
}
}
printf("%lld\n",dp[0][k]);
return 0;
}
| 1 |
// includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
// constants
const ll N = 1e5+5, M = 1e6+5, A = 1e7+5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
// io
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
void solve(){
ll n, m;
cin >> n >> m;
ll ans = 0;
for(ll i = 1; i <= sqrt(m); i++){
if(m%i == 0){
ll k = m/i;
if(k >= n) ans = max(ans, i);
k = i;
if(k >= n) ans = max(ans, m/i);
}
}
cout << ans;
}
int main(int argc, char const* argv[])
{
ll t = 1; //cin >> t;
while(t--) {
solve();
}
return 0;
}
| #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define LL long long
#define fgx cerr<<"--------------"<<endl;
#define dgx cerr<<"=============="<<endl;
inline int read(){
int x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
return x*f;
}
const int MAXN = 100010;
const int INF = 2147483600;
int N,D1,D2;
bool Vis[710][710];
inline void solve(int P){
int K=0; while(P%4==0) P>>=2,K++;
if(P%4==3) return ;
if(P%4==1) {
for(int i=0;i<N;i++)
for(int j=0;j<N;j++)
Vis[i][j]&=((((i>>K)^(j>>K))&1)^1);
} else{
for(int i=0;i<N;i++)
for(int j=0;j<N;j++)
Vis[i][j]&=(((i>>K)&1)^1);
} return ;
}
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
N=read(),D1=read(),D2=read();
int cnt=N*N;
N<<=1; memset(Vis,1,sizeof(Vis));
solve(D1); solve(D2);
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(Vis[i][j]){
printf("%d %d\n",i,j); --cnt;
if(!cnt) return 0;
}
}
}
return 0;
}
| 0 |
/*
Author : Devil088
*/
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define sep cout<<"\n";
#define Yes cout<<"Yes\n";
#define No cout<<"No\n";
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
inline string shift(string s){
int n = s.length();
string r = "";
r+=s[n-1];
for(int i=0;i<n-1;i++)r+=s[i];
return r;
}
int main(){
int n;
cin>>n;
if(n<1200){
cout<<"ABC\n";
}else if(n<2800){
cout<<"ARC\n";
}else cout<<"AGC\n";
}
/*
uday
adyu
7 46
45 6
*/
| /**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
int r; cin >> r;
if(r < 1200) cout << "ABC\n";
else if(r < 2800) cout << "ARC\n";
else cout << "AGC\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//int t; cin >> t; rep(i, t)solve();
solve();
return 0;
} | 1 |
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> parts_a(N);
for (int64_t n = 0; n < N; ++n) {
cin >> parts_a[n];
}
sort(parts_a.begin(), parts_a.end());
vector<int64_t> parts_b(N);
for (int64_t n = 0; n < N; ++n) {
cin >> parts_b[n];
}
vector<int64_t> parts_c(N);
for (int64_t n = 0; n < N; ++n) {
cin >> parts_c[n];
}
sort(parts_c.begin(), parts_c.end());
int64_t result = 0;
for (int64_t n = 0; n < N; ++n) {
auto it = lower_bound(parts_a.begin(), parts_a.end(), parts_b[n]);
int64_t a_num = (it - parts_a.begin());
auto it2 = upper_bound(parts_c.begin(), parts_c.end(), parts_b[n]);
int64_t b_num = (parts_c.end() - it2);
result += a_num * b_num;
}
cout << result << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdio>
#include <iomanip>
#include <utility>
#include <unordered_map>
using namespace std;
typedef long long int ll;
#define SP(x) setprecision((int)x)
#define SW(x) setw(x) // 桁数指定
#define SF(c) setfill(c) // 埋め文字指定('0')
#define ALL(v) v.begin(), v.end()
int main(int argc, char const *argv[])
{
ll n;
cin >> n;
vector<ll> a(n);
ll cnt = 0;
for (ll i = 0; i < n; i++)
{
cin >> a[i];
if (a[i] < 0)
cnt++;
}
for (ll i = 0; i < n; i++)
{
if (a[i] < 0)
a[i] *= -1;
}
if (cnt % 2 == 1)
{
sort(ALL(a));
a[0] *= -1;
}
ll ans = 0;
for (ll i = 0; i < n; i++)
{
ans += a[i];
}
cout << ans << endl;
} | 0 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int main() {
int n, m;
while (cin >> n >> m, n){
vector<int> point(n);
REP(i, n){
cin >> point[i];
}
point.push_back(0);
vector<int> sum = point;
REP(i, n + 1){
REP(j, n + 1){
sum.push_back(sum[i] + sum[j]);
}
}
SORT(sum);
int ma = 0;
REP(i, sum.size()){
int left = 0;
int right = sum.size() - 1;
while (left < right){
if (sum[left + (right - left) / 2] + sum[i] <= m){
ma = max(sum[left + (right - left) / 2] + sum[i], ma);
left = left + (right - left) / 2 + 1;
}
else{
right = left + (right - left) / 2 - 1;
}
}
}
cout << ma << endl;
}
} | #include <iostream>
#include <cstdint>
#include <vector>
#include <algorithm>
int main() {
std::int64_t n, m;
std::vector<std::int64_t> in, pairSum;
in.reserve(1000);
pairSum.reserve(1000 * 1000);
while (std::cin >> n >> m, n + m != 0) {
in.push_back(0);
for (int i = 0; i < n; ++i) {
int p;
std::cin >> p;
in.push_back(p);
}
for (auto x : in)
for (auto y : in)
pairSum.push_back(x + y);
std::sort(pairSum.begin(), pairSum.end());
std::int64_t ans = 0;
for (auto e : pairSum) {
if (e > m)
continue;
auto it = std::upper_bound(pairSum.begin(), pairSum.end(), m - e);
--it;
ans = std::max(ans, e + *it);
}
std::cout << ans << std::endl;
in.clear();
pairSum.clear();
}
} | 1 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define lb(x) (x&-x)
#define get(x) ((int)log2(x))
const int INF=0x3f3f3f3f;
const int N=66666;
int f[17][N],sum[N];
int v[17][17];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):v,ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
void upd(int &x,int v) {
(x<v)?(x=v):0;
}
int main(void) {
int n=read(),m=read();
int prt=0;
rep(i,1,m) {
int x=read()-1,y=read()-1;
v[x][y]=v[y][x]=read(),prt+=v[x][y];
}
for (int S=1;S<(1<<n);++S) {
int x=get(lb(S));
sum[S]=sum[S-(1<<x)];
rep(i,0,n-1) if (v[i][x]&&(S>>i&1)) {
sum[S]+=v[i][x];
}
}
rep(i,0,n-1) for (int S=0;S<(1<<n);++S) f[i][S]=-INF;
int ans=0; f[0][1]=0;
for (int S=1;S<(1<<n);++S) {
if (!(S&1)) continue;
rep(i,0,n-1) {
if (!((S>>i))&1) continue;
for (int T=S;T;T=(T-1)&S) {
if (T>>i&1) upd(f[i][S],f[i][S-T+(1<<i)]+sum[T]);
}
for (int T=(1<<n)-1-S,j;T;T-=lb(T)) {
j=get(lb(T));
if (v[i][j]) upd(f[j][S+(1<<j)],f[i][S]+v[i][j]);
}
}
if (S>>(n-1)&1) upd(ans,f[n-1][S]);
}
printf("%d\n", prt-ans);
return 0;
} | #include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=2010;
const int MOD=1e9+7;
int n,k;
long long fac[MAXN*MAXN],inv[MAXN*MAXN],f[MAXN][MAXN];
long long C(long long x,long long y)
{
return fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
long long qpow(long long x,long long y)
{
long long tmp=1;
for(;y;y>>=1,x=x*x%MOD)if(y&1)tmp=tmp*x%MOD;
return tmp;
}
int main()
{
// freopen("test.in","r",stdin);
// freopen("test.out","w",stdout);
scanf("%d%d",&n,&k);
if(k==1)
{
printf("1");
return 0;
}
fac[0]=1;
for(int i=1;i<=n*k;i++)fac[i]=fac[i-1]*i%MOD;
inv[n*k]=qpow(fac[n*k],MOD-2);
for(int i=n*k;i>=1;i--)inv[i-1]=inv[i]*i%MOD;
f[0][0]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<=i;j++)
{
f[i][j]=f[i-1][j];
if(!j)continue;
f[i][j]=(f[i][j]+f[i][j-1]*(n-j+1)%MOD*C(n-i+(n-j+1)*(k-1)-1,k-2))%MOD;
}
printf("%lld\n",f[n][n]);
return 0;
}
| 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define SF scanf
#define PF printf
#define MAXN 100010
using namespace std;
typedef long long ll;
ll a[MAXN];
int n,now,cnt0,cnt1;
ll gcd(ll x,ll y){
if(y==0)
return x;
return gcd(y,x%y);
}
bool solve(){
int cnt0=0,cnt1=0,now=0;
for(int i=1;i<=n;i++){
if(a[i]%2ll==0)
cnt0++;
else{
cnt1++;
now=i;
}
}
if(cnt1==1&&a[now]!=1){
ll g=0;
a[now]--;
for(int i=1;i<=n;i++)
g=gcd(g,a[i]);
for(int i=1;i<=n;i++)
a[i]/=g;
if(solve()==0)
return 1;
}
if(cnt0%2==1)
return 1;
else
return 0;
}
int main(){
//freopen("game.in","r",stdin);
//freopen("game.out","w",stdout);
SF("%d",&n);
for(int i=1;i<=n;i++)
SF("%lld",&a[i]);
if(solve())
PF("First");
else
PF("Second");
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
// freopen("AGC010-D.in", "r", stdin);
int n, cur = 0;
cin >> n;
vector<int> arr(n);
copy(istream_iterator<int>(cin), istream_iterator<int>(), arr.begin());
string str[] = {"First", "Second"}, ans;
while (ans.empty()) {
int cnt = count_if(arr.begin(), arr.end(), [&] (int x) { return x % 2 == 0; });
if (cnt & 1) {
ans = str[cur];
break;
}
cur ^= 1;
if (cnt != n - 1) {
ans = str[cur];
}
int g = 0;
for_each(arr.begin(), arr.end(), [&] (int x) {
if (x == 1) {
ans = str[cur];
}
x -= x & 1;
while (x) {
int r = g % x;
g = x;
x = r;
}
});
if (!g) {
break;
}
for_each(arr.begin(), arr.end(), [&] (int &x) { x /= g; });
}
cout << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define mp make_pair
#define timer ((double)clock() / CLOCKS_PER_SEC)
#define endl "\n"
#define spc " "
#define d1(x) cerr<<#x<<":"<<x<<endl
#define d2(x, y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl
#define d3(x, y, z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl
#define fast_io() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int lli;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<double, double> dd;
const int N = (int)(1e6 + 5);
const int LOG = (int)(20);
int n, nx[N], ans, k, f, nd[N], fl, one;
vector<int> v[N];
int dfs(int x) {
int re = 0;
for(auto i : v[x]) {
int val = dfs(i);
if(val == k)
ans++;
else
re = max(re, val);
}
return re + 1;
}
int main() {
fast_io();
// freopen("inp.in", "r", stdin);
cin >> n >> k;
if(k > n)
k = n + 10;
for(int i = 1; i <= n; i++)
cin >> nx[i];
if(nx[1] != 1) {
fl = 1;
nx[1] = 1;
}
for(int i = 1; i <= n; i++)
if(i != nx[i])
v[nx[i]].pb(i);
for(auto i : v[1])
dfs(i);
cout << ans + fl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
//世界の皆は頭ええな
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, D;
cin >> N >> D;
ll kotae = (N - 1) * D;
ll A[200001], C[200001];
C[0] = 1e18;
rep1(i, N) {
cin >> A[i];
kotae += A[i];
C[i] = min(C[i - 1] + D, A[i]);
}
ll mae = 1e18;
for (int i = N - 1; i > 1; i--) {
mae = min(mae + D, A[i + 1]);
ll kari = min(mae, C[i - 1]) + D;
kotae += min(A[i], kari);
}
co(kotae);
Would you please return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define MAX_V 200005
int V;
vector<int> nG[MAX_V], rG[MAX_V], G[MAX_V], vs; // 新しいグラフはG
bool used[MAX_V];
int cmp[MAX_V]; // ここに入る.
void add_edge(int from, int to){
nG[from].push_back(to);
rG[to].push_back(from);
}
void dfs(int v){
used[v] = 1;
for(int i = 0; i < nG[v].size(); i++) if(!used[nG[v][i]]) dfs(nG[v][i]);
vs.push_back(v);
}
void rdfs(int v, int k){
used[v] = 1;
cmp[v] = k;
for(int i = 0; i < rG[v].size(); i++) if(!used[rG[v][i]]) rdfs(rG[v][i],k);
}
int scc(){ // 新しい頂点数を返す
memset(used, 0, sizeof(used));
vs.clear();
for(int v = 0; v < V; v++) if(!used[v]) dfs(v);
memset(used, 0, sizeof(used));
int k = 0;
for(int i = vs.size() - 1; i >= 0; i--) if(!used[vs[i]]) rdfs(vs[i], k++);
rep(i,V){
int x = cmp[i];
rep(j,nG[i].size()){
int y = cmp[nG[i][j]];
if(x == y)continue;
G[x].push_back(y);
}
}
rep(i,k){
set<int> se;
rep(j,G[i].size()) se.insert(G[i][j]);
G[i].clear();
for(auto x : se) G[i].push_back(x);
}
return k;
}
int main(){
int n, m;
cin >> n >> m;
V = n;
for(int i = 0; i < m; i++){
int a, b;
scanf("%d %d", &a, &b);
// a--; b--;
add_edge(a, b);
}
int nn = scc();
/*
cout << nn << endl;
rep(i,n) cout << cmp[i] << ' ';
cout << endl;
rep(i,nn){
rep(j,G[i].size()) cout << G[i][j] << ' ';
cout << endl;
}
*/
int q;
cin >> q;
rep(i,q){
int a, b;
cin >> a >> b;
if(cmp[a] == cmp[b]){
cout << 1 << endl;
}else{
cout << 0 << endl;
}
}
return 0;
}
| #include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=100005;
int n,m;
int head[MAXN];
struct node
{
int from;
int to;
int next;
}edge[MAXN<<1];
int edge_cnt;
void add_edge(int fr,int to)
{
edge[++edge_cnt].from=fr;
edge[edge_cnt].to=to;
edge[edge_cnt].next=head[fr];
head[fr]=edge_cnt;
}
int col[MAXN];
bool flag;
void dfs(int x)
{
for(int i=head[x];i;i=edge[i].next)
{
int u=edge[i].to;
if(col[u]==-1)
{
col[u]=col[x]^1;
dfs(u);
}
else if(col[x]==col[u]) flag=1;
}
}
bool check()
{
for(int i=1;i<=n;i++) col[i]=-1;
for(int i=1;i<=n;i++)
{
if(col[i]==-1)
{
col[i]=0;
dfs(i);
}
}
return !flag;
}
long long ans;
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int u,v;
scanf("%lld%lld",&u,&v);
add_edge(u,v),add_edge(v,u);
}
if(check())
{
int temp=0;
for(int i=1;i<=n;i++)
{
if(col[i]) temp++;
}
ans=temp*(n-temp)-m;
}
else ans=n*(n-1)/2-m;
cout<<ans<<endl;
// system("pause");
return 0;
} | 0 |
#include <iostream>
#include <set>
using namespace std;
set<int> f(int x) {
set<int> s;
if (x == 0) s.insert(0);
while (x > 0) {
s.insert(x % 10);
x /= 10;
}
return s;
}
bool has_common(const set<int> &a, const set<int> &b) {
auto ai = a.begin(), bi = b.begin();
while (ai != a.end() && bi != b.end()) {
if (*ai < *bi) ai++;
else if (*ai > *bi) bi++;
else return true;
}
return false;
}
int main() {
int N, K;
cin >> N >> K;
set<int> D;
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
D.insert(d);
}
while (has_common(D, f(N))) N++;
cout << N << endl;
}
| #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n,k;
cin >> n >> k;
set<int> s;
rep(i,10) s.insert(i);
rep(i,k){
int m;cin >> m;
s.erase(s.find(m));
}
vector<int> temp(5);
int ans = 100000;
for(auto m:s)for(auto i:s)for(auto j:s)for(auto k:s)for(auto l:s){
temp[4] = 10000*m+1000*i+100*j+10*k+l;
temp[3] = temp[4]%10000;
temp[2] = temp[4]%1000;
temp[1] = temp[4]%100;
temp[0] = temp[4]%10;
rep(j,5){
if(temp[j]>=n) ans = min(ans,temp[j]);
}
}
cout << ans << endl;
} | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]=='R'){
if(s[1]=='R'){
if(s[2]=='R'){
cout<<"3"<<endl;
}
else{
cout<<"2"<<endl;
}
}
else{
cout<<"1"<<endl;
}
}
else{
if(s[1]=='R'){
if(s[2]=='R'){
cout<<"2"<<endl;
}
else{
cout<<"1"<<endl;
}
}
else{
if(s[2]=='R') cout<<"1"<<endl;
else cout<<"0"<<endl;
}
}
} | #include<iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0;i <= (signed)s.length() - 3;i++) {
if (s[i] == s[i + 1] || s[i] == s[i + 2] || s[i + 1] == s[i + 2]) {
cout << i + 1 << " " << i + 3 << endl;
return 0;
}
}
if (s.length() >= 2) {
if (s[s.length() - 1] == s[s.length() - 2]) {
cout << s.length() - 1 << " " << s.length() << endl;
return 0;
}
}
cout << "-1 -1\n";
} | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
set<pair<long long, long long>> st;
long long sum = 0;
int main() {
long long n, m;
cin >> n >> m;
long long ans = 0;
st.insert(make_pair(0, 1));
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
sum = (sum + a) % m;
pair<long long, long long> pa;
if (st.lower_bound(make_pair(sum, 0)) != st.end()) {
pa = *st.lower_bound(make_pair(sum, 0));
if (sum == pa.first) {
ans += pa.second;
st.erase(*st.lower_bound(make_pair(sum, 0)));
st.insert(make_pair(sum, pa.second + 1));
}
else {
st.insert(make_pair(sum, 1));
}
}
else {
st.insert(make_pair(sum, 1));
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
ll n, m; cin >> n >> m;
map<ll,ll> data;
ll sum = 0; data[0]++;
for(int i=0; i<n; i++){
ll a; cin >> a;
sum += a;
sum %= m;
data[sum]++;
}
ll ans = 0;
for(auto x : data) ans += x.second*(x.second-1)/2;
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<ll,P> event;
#define MOD 1000000007
const int MAX = 510000;
int main(){
ll N;
cin>>N;
ll num=N;
queue<char>memo;
for(ll i=35;i>=0;i--){
if(i%2==0){
ll k=i/2ll;
ll upper=((ll)pow(4,k+1)-1ll)/3ll;
ll neupper=((ll)pow(4,k)-1ll)/3ll;;
if(neupper<num&&num<=upper){memo.push('1');num-=(ll)pow(2,i);}
else{memo.push('0');}
}
if(i%2==1){
ll k=i/2ll;
ll lower=((-2)*((ll)pow(4,k+1)-1ll))/3ll;;
ll nelower=(-2)*((ll)pow(4,k)-1ll)/3ll;;
if(lower<=num&&num<nelower){num+=(ll)pow(2,i);memo.push('1');}
else{memo.push('0');}
}
}
while(!memo.empty()){
auto t=memo.front();
if(t=='1'){break;}
else{memo.pop();}
}
if(memo.empty()){cout<<0<<endl;}
else{
while(!memo.empty()){
cout<<memo.front();
memo.pop();
}
cout<<endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define INF (1ll<<60)
#define mod 1000000007
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
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; }
ll mypow(ll a,ll b){
ll ret=1;
while(b--){
ret*=a;
}
return ret;
}
int main(){
ll n;cin>>n;
vector<ll> ans;
if(n==0){
cout<<0<<endl;
return 0;
}
ll num=0;
while(n){
ans.push_back(abs(n%2));
n-=abs(n%2)*mypow(-1,num);
n/=2;
num++;
//cout<<n<<endl;
//if(num==10) break;
}
reverse(ans.begin(),ans.end());
rep(i,ans.size()) cout<<ans[i];
cout<<endl;
return 0;
} | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int Mod = 998244353;
int fpow(int x, int y) {
int res = 1;
while (y) {
if (y & 1) res = 1ll * res * x % Mod;
x = 1ll * x * x % Mod;
y >>= 1;
}
return res;
}
const int MAX_N = 1e6 + 5;
int N = 1e6, M, fac[MAX_N], ifc[MAX_N];
int C(int n, int m) {
if (n < m || n < 0 || m < 0) return 0;
else return 1ll * fac[n] * ifc[m] % Mod * ifc[n - m] % Mod;
}
int main () {
for (int i = fac[0] = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
ifc[N] = fpow(fac[N], Mod - 2);
for (int i = N - 1; ~i; i--) ifc[i] = 1ll * ifc[i + 1] * (i + 1) % Mod;
cin >> N >> M;
if (N > M) swap(N, M);
int ans = 0;
for (int i = 1; i <= N; i++) ans = (ans + 1ll * C(i << 1, i) * C(N - i + M - i, N - i)) % Mod;
ans = 1ll * ans * fpow(2 * C(N + M, M) % Mod, Mod - 2) % Mod;
printf("%d\n", (ans + M) % Mod);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int md = 998244353;
inline void add(int &a, int b) {
a += b;
if (a >= md) {
a -= md;
}
}
inline int mul(int a, int b) {
return (long long) a * b % md;
}
inline int power(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1) {
res = mul(res, a);
}
a = mul(a, a);
b >>= 1;
}
return res;
}
inline int inv(int x) {
return power(x, md - 2);
}
const int N = 2000010;
int fact[N], inv_fact[N];
inline int C(int n, int k) {
if (k < 0 || k > n) {
return 0;
}
return mul(fact[n], mul(inv_fact[k], inv_fact[n - k]));
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
fact[0] = inv_fact[0] = 1;
for (int i = 1; i <= n + m; i++) {
fact[i] = mul(fact[i - 1], i);
inv_fact[i] = inv(fact[i]);
}
int ans = 0;
int cur = 0;
int val = C(n + m, n);
for (int s = 1; s <= n + m; s++) {
add(cur, val);
add(ans, mul(cur, inv(s)));
int x = C(n + m - (s + 1), n - (s + 1) / 2);
int y = C(n + m - (s + 1), m - (s + 1) / 2);
int z = C(s - 1, s / 2);
int ways = mul(z, x + y);
if (s % 2 == 0) {
add(val, ways);
} else {
add(val, md - ways);
}
}
ans = mul(ans, inv(C(n + m, n)));
printf("%d\n", ans);
cerr << "time = " << clock() << " ms" << endl;
return 0;
}
| 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll mod=1e9+7;
int main(){
ll n;
cin >> n;
ll ans=0;
for(ll i=1;i<=100000;i++){
if(i*i<=n){
ans=i*i;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main () {
int x, ans = 0;
cin >> x;
ans += x/500*1000;
x -= x/500*500;
ans += x/5*5;
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for ( int i = 0; i < (n); i++ )
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
set<int> paper;
REP(i, N) {
int A;
cin >> A;
if ( paper.count(A) ) {
paper.erase(A);
} else {
paper.insert(A);
}
}
cout << paper.size() << endl;
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "IntMod.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif
#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif
int N;
int main() {
cin >> N;
string s[3];
REP(i, 0, 3) cin >> s[i];
int cnt = 0;
REP(i, 0, N) {
map<int, int> mp;
REP(k, 0, 3) {
++mp[s[k][i]];
}
int mx = 0;
for (auto p : mp) {
mx = max(mx, p.second);
}
cnt += 3 - mx;
}
cout << cnt << endl;
return 0;
}
| 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.