code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, M;
cin >> N >> M;
vector<unsigned long> uf(2 * N), sz(2 * N);
iota(uf.begin(), uf.end(), 0UL);
fill(sz.begin(), sz.begin() + N, 1);
const auto& find = [&uf](unsigned long i) -> unsigned long {
while(i != uf[i])i = uf[i] = uf[uf[i]];
return i;
};
const auto& unite = [&uf, &sz, &find](unsigned long i, unsigned long j) -> unsigned long {
i = find(i);
j = find(j);
if(i == j)return 0;
if(sz[i] < sz[j])swap(i, j);
sz[i] += sz[j];
uf[j] = i;
return 1;
};
const auto& add_edge = [&N, &unite](unsigned long i, unsigned long j) -> void { unite(i, j + N); unite(i + N, j); };
for(unsigned long i{0}, u, v; i < M; ++i){
cin >> u >> v;
add_edge(u - 1, v - 1);
}
if(find(0) == find(N))cout << N * (N - 1) / 2 - M << endl;
else cout << sz[find(0)] * sz[find(N)] - M << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//freopen("in.txt", "r", stdin);
int n, m;
cin >> n >> m;
vector<vi> adj(n);
rep(i,0,m) {
int a,b;
cin >> a >> b;
a--;
b--;
adj[a].pb(b);
adj[b].pb(a);
}
vi side(n, -1);
bool is_bipartite = true;
queue<int> q;
q.push(0);
side[0] = 0;
while(!q.empty()) {
int v = q.front();
q.pop();
for(int u : adj[v]) {
if(side[u] == -1) {
side[u] = (side[v] ^ 1);
q.push(u);
} else {
is_bipartite &= (side[u] != side[v]);
}
}
}
if(is_bipartite) {
int b, w;
b = w = 0;
rep(i,0,n) {
if(side[i] == 0) {
b++;
} else {
w++;
}
}
cout << (ll)b * w - m << '\n';
} else {
cout << (ll)(n-1)*n / 2 - m << '\n';
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define fi first
#define se second
#define INF 1000000009
#define LLINF 1000000000000000009LL
using ll = long long;
int main(){
int r,g;
cin>>r>>g;
cout<<2*g-r<<endl;
return(0);
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll a,b;
cin >> a >> b;
cout << b - a + b << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
int main(){
long x,y;cin>>x>>y;
if(x<0&&y==0){
cout<< -x;
}
if(x>=0&&y>=0){
(y>x)?cout<<y-x:cout<<min(2+x-y,1+y+x);return 0;
}
else if(x<0&&y>0){
(-x>y)?cout<<-x-y+1:cout<<1+x+y;return 0;
}
else if(x<0&&y<0){
(y>x)?cout<<y-x:cout<<2+x-y;return 0;
}
else if(x>=0&&y<0){
(-y>x)?cout<<-y-x+1:cout<<x+y+1;return 0;
}
}
| #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve()
{
int a, b;
cin >> a >> b;
cout << (a > 8 || b > 8 ? ":(" : "Yay!");
}
int main()
{
fastio;
solve();
return 0;
} | 0 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
int main() {
int N; cin >>N;
if(N == 2){
int a, b; cin >>a >>b;
FOR(i, 1, max(a, b) + 1) if(a % i == 0 && b % i == 0) cout <<i <<endl;
} else{
int a, b, c; cin >>a >>b >>c;
FOR(i, 1, max(a, max(b, c)) + 1) if(a % i == 0 && b % i == 0 && c % i == 0) cout <<i <<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define sz(obj) ((int)(obj).size())
#define pf push_front
#define pb push_back
int main()
{
int n;
cin >> n;
int a[3] = {0};
REP(i, n) cin >> a[i];
if (n == 2){
FOR(i, 1, min(a[0], a[1]) + 1){
if (a[0] % i == 0 && a[1] % i == 0) cout << i << endl;
}
}
else {
FOR(i, 1, min(min(a[0], a[1]), a[2]) + 1){
if (a[0] % i == 0 && a[1] % i == 0 && a[2] % i == 0) cout << i << endl;
}
}
} | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
ll M;
cin >> M;
vector<pair<ll,ll>> A;
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
A.push_back(make_pair(a,b));
}
ll sum = 0;
ll dig = 0;
for (int i = 0; i < M; ++i) {
sum += A[i].first * A[i].second;
dig += A[i].second;
}
cout << (dig-1) + (sum-1)/9 << endl;
}
| #include<bits/stdc++.h>
#define N 100010
#define ll long long
using namespace std;
ll n, sum, ans, res;
ll a[N], p[70];
void rd(ll &ans)
{
ans = 0; ll f = 1;
char x = getchar();
while(x > '9' || x < '0') {if(x == '-') f = -1; x = getchar();}
while(x >= '0' && x <= '9') ans = ans * 10 + x - '0', x = getchar();
ans *= f;
}
void insert(ll x)
{
for(int i = 60; ~i; i --)
if(x & (1LL << i))
{
if(p[i]) x ^= p[i];
else {p[i] = x; break;}
}
}
int main()
{
rd(n);
for(int i = 1; i <= n; i ++) rd(a[i]), sum ^= a[i];
for(int i = 0; i < 60; i ++)
{
if((sum & (1LL << i)) == 0) continue;
ans += (1LL << i);
for(int j = 1; j <= n; j ++)
if(a[j] & (1LL << i)) a[j] ^= (1LL << i);
}
for(int i = 1; i <= n; i ++) insert(a[i]);
for(int i = 60; ~i; i --) res = max(res, res ^ p[i]);
printf("%lld", ans + (res << 1));
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin >>s;
if(s.size()%2)cout << "No" << endl;
else{
bool ok = true;
for(int i=0; i<s.size(); i++){
if(i%2==0 && s[i]!='h'){
ok = false;
break;
}
if(i%2==1 && s[i]!='i'){
ok = false;
break;
}
}
if(ok)cout << "Yes" << endl;
else cout << "No" << 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
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
string S; cin >> S;
if(S.length() == 3)
reverse(S.begin(), S.end());
cout << S << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
FASTINOUT;
int x,k;
cin>>x>>k;
ll y[x];
for (int i=0;i<x;i++){
cin>>y[i];
}
ll ans=1e18;
for (int i=0;i<x-k+1;i++){
ll l=y[i],r=y[i+k-1];
if (l<0&&r<0)
ans=min(ans,-l);
else if (r>0&&l>0)
ans=min(ans,r);
else if (abs(l)>abs(r))
ans=min(ans,2*abs(r)+abs(l));
else
ans=min(ans,abs(r)+2*abs(l));
}
cout<<ans;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(int i=0; i<(int)in.size(); i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2050) cout << 0 << endl;
else {
ll ans = 2018;
for (ll i = L; i < R; i++)
for (ll j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
cout << ans << endl;
}
} | 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(long long i=0;i<n;++i)
#define FOR(i,a,b) for(long long i=a;i<b;++i)
using namespace std;
using point = pair< int,int >;
using ll = long long;
int main(){
int n;
int m, e, j;
bool hund;
while (~scanf("%d", &n)) {
REP(i, n) {
hund = false;
scanf("%d%d%d", &m, &e, &j);
if (m == 100 || e == 100 || j == 100) hund = true;
if (hund || (m + e) / 2 >= 90 || (m + e + j) / 3 >= 80) {
puts("A");
} else if ((m + e + j) / 3 >= 70 || (m + e + j) / 3 >= 50 && (m >= 80 || e >= 80)) {
puts("B");
} else {
puts("C");
}
}
}
return 0;
}
| #include<cstdio>
int main(){
int n;
for(;;){
scanf("%d",&n);
if(n==0) break;
for(int i=0;i<n;i++){
int p[3];
char r='C';
for(int j=0;j<3;j++){
scanf("%d",&p[j]);
}
int sum=0,sumb=0;
for(int j=0;j<3;j++){
if(p[j]==100){
r='A';
}
sum+=p[j];
if(j!=2) sumb+=p[j];
}
if(r=='C'){
if(sumb/2>=90||sum/3>=80) r='A';
else if(sum/3>=70) r='B';
else if(sum/3>=50 && (p[0]>=80 || p[1]>=80)) r='B';
}
printf("%c\n",r);
}
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << ' ' << H;
dbg_out(T...);
}
int a, b;
string s;
int main() {
#ifdef LOCAL
freopen("c.txt", "r", stdin);
// freopen("main.txt", "w", stdout);
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
ios::sync_with_stdio(0);
cin.tie(0);
#define endl '\n'
#define dbg(...) 18
#endif
bool ans = true;
cin >> a >> b >> s;
if (SZ(s) <= a)
ans = false;
else if (s[a] != '-')
ans = false;
dbg(ans);
for (int i = 0; i < SZ(s) && ans; i++) {
if (i == a) continue;
ans = s[i] >= '0' && s[i] <= '9';
}
dbg(ans);
ans = ans && (SZ(s) == (a + b + 1));
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(int i = 0; i < n; ++i) cout << UIET[i] << " "
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vpp vector<pair< int, int > >
#define pll pair<int , int >
#define ppll pair < pll , pll >
#define debug(n1) cout << n1 << endl
#define len(a) ((int) (a).size())
#define endl "\n"
#define mod 1000000007
const int INF=(1LL<<60)-1;
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
bool isPrime(int x){
for(int i = 2; i * i <= x; ++i){
if(x % i == 0) return 0;
}
return 1;
}
int fun(int n){
if(n & 1) return 3 * n + 1;
else return n/2;
}
int32_t main(){
SPEED;
int a, b;
cin >> a >> b;
string s;
cin >> s;
int cnt = 0;
for(char c: s) if(c == '-') cnt++;
a--;
if(s[a + 1] == '-' && cnt == 1) cout << "Yes";
else cout << "No" ;
} | 1 |
// Written by newbiechd
#include <cstring>
#include <iostream>
#include <string>
const int maxN = 13;
int n;
char col[maxN][maxN];
bool vis[26];
void dfs(int x, int y, char c) {
if (x > n) {
int val = 0;
memset(vis, 0, sizeof(vis));
for (int j = 1; j <= n; ++j) vis[col[1][j] - 'a'] = 1;
for (char t = 'a'; t <= c; ++t) val += vis[t - 'a'];
if (val != 3)
return ;
for (int i = 2; i <= n; ++i) {
memset(vis, 0, sizeof(vis));
int tmp = 0;
for (int j = 1; j <= n; ++j) vis[col[i][j] - 'a'] = 1;
for (char t = 'a'; t <= c; ++t) tmp += vis[t - 'a'];
if (tmp != val)
return ;
}
for (int j = 1; j <= n; ++j) {
memset(vis, 0, sizeof(vis));
int tmp = 0;
for (int i = 1; i <= n; ++i) vis[col[i][j] - 'a'] = 1;
for (char t = 'a'; t <= c; ++t) tmp += vis[t - 'a'];
if (tmp != val)
return ;
}
for (int i = 1; i <= n; ++i)
printf("%s\n", col[i] + 1);
putchar('\n'), fflush(stdout);
return ;
}
if (y > n) {
dfs(x + 1, 1, c);
return ;
}
if (col[x][y - 1] == '.') {
col[x][y] = col[x][y - 1] = c;
dfs(x, y + 1, c + 1);
col[x][y] = col[x][y - 1] = '.';
}
if (col[x - 1][y] == '.') {
col[x][y] = col[x - 1][y] = c;
dfs(x, y + 1, c + 1);
col[x][y] = col[x - 1][y] = '.';
}
dfs(x, y + 1, c);
}
const std::string ans[][7] = {
{
"aabc",
"ddbc",
"efgg",
"efhh"
},
{
"aabbd",
"ccf.d",
"eefgg",
"..hij",
"..hij"
},
{
"aabbcc",
"ddeeff",
"ghi...",
"ghi...",
"...jkl",
"...jkl"
},
{
"aabbcc.",
"ddee..h",
"ffgg..h",
"....ijk",
"....ijk",
"....lmn",
"....lmn"
}
};
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cin >> n;
/*
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
col[i][j] = '.';
dfs(1, 1, 'a');
*/
if (n < 3) {
printf("-1\n");
return 0;
}
if (n == 3) {
std::cout << "aa.\n..a\n..a\n";
return 0;
}
int k = (n & 3) + 4;
for (int i = 0; i < n - k; ++i) {
std::string str(n, '.');
str.replace(i / 4 * 4, 4, ans[0][i % 4]);
std::cout << str << '\n';
}
for (int i = n - k; i < n; ++i) {
std::string str(n, '.');
str.replace(n - k, k, ans[k - 4][i + k - n]);
std::cout << str << '\n';
}
return 0;
}
| #include<iostream>
using namespace std;
#include<string>
class dice
{
public:
int F[6];
int q1, q2;
dice();
void input();
void roll_a();
void roll_b();
bool check(const dice& d);
bool equal(const dice& d);
};
dice::dice(){}
void dice::input()
{
int i;
for(i = 0; i < 6; i++) cin >> F[i];
q1 = F[0] + F[1] + F[2] + F[3] + F[4] + F[5];
q2 = F[0] * F[5] + F[1] * F[4] + F[2] * F[3];
}
void dice::roll_a()
{
int i;
i = F[0]; F[0] = F[2]; F[2] = F[1]; F[1] = i;
i = F[3]; F[3] = F[4]; F[4] = F[5]; F[5] = i;
}
void dice::roll_b()
{
int i;
i = F[0]; F[0] = F[5]; F[5] = i;
i = F[1]; F[1] = F[3]; F[3] = i;
i = F[2]; F[2] = F[4]; F[4] = i;
}
bool dice::check(const dice& d)
{
int l, m;
if((d.F[0] != F[0]) || (d.F[5] != F[5])) return false;
for(l = 1; l <= 4; l++){
for(m = 1; m <= 4; m++){
if(d.F[m] != F[(l * m) % 5]) break;
}
if(m == 5) return true;
}
return false;
}
bool dice::equal(const dice& d)
{
bool eq;
if((q1 != d.q1) || (q2 != d.q2)) return false;
for(int i = 0; i < 2; i++){
eq = check(d);
if(!eq){ roll_a(); eq = check(d); }
if(!eq){ roll_a(); eq = check(d); }
if(eq || i == 1) break;
roll_b();
}
return eq;
}
int main()
{
dice d[100];
int n, i, j;
cin >> n;
for(i = 0; i < n; i++){ d[i].input(); }
for(i = 0; i < n; i++){
for(j = i + 1; j < n; j++){
if(d[i].equal(d[j])) break;
}
if(j < n) break;
}
if(i + j == 2 * n){ cout << "Yes"; }else{ cout << "No"; }
cout << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
long long INF=1e7;
double EPS = 1e-12;
const long long lim = 2e5+100;
typedef long long int lld;
typedef long long ll;
#define rep(i,a,n) for(long long int i = (a); i <= (n); ++i)
#define mset(a, v) memset(a, v, sizeof(a))
#define Error(x...) { cout << "(" << #x << ")" << " = ( "; printIt(x); }
template <typename T1> void printIt(T1 t1) { cout << t1 << " )" << endl; }
template <typename T1, typename... T2>
void printIt(T1 t1, T2... t2) { cout << t1 << " , "; printIt(t2...); }
#define popcount __builtin_popcountll
ll powP(ll x, ll y) {
ll ans = 1, po = x % mod;
while(y > 0) {
if(y & 1) ans = ans * po % mod;
y >>= 1; po = po * po % mod;
}
return ans;
}
vector<ll> Ans, Adj[lim];
ll Array[lim], C[lim],dp[600][600];
pair<ll,ll> P[lim];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output1.txt", "w", stdout);
#endif
lld T,i,p,j,l,e,r,b,c,k,m,q,a,d,w,x,y,u,v,z,t,curr,prev,sum=0,val,countA=0,indicator=0,pos,h,minA,maxA,type,n,ans=0,left,right;
string A,B; a=b=0;
cin>>n>>k;
rep(i,1,k) { cin>>x; Array[x]=1; }
while(1) {
val=n; indicator=0;
while(val>0) {
if(Array[val%10]==1) indicator=1;
val/=10;
}
if(indicator==0) break;
n++;
}
cout<<n<<endl;
return 0;
}
| #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0), ios::sync_with_stdio(false);
int n; cin >> n;
vi v(n); rep(i,n) cin >> v[i];
map<int,int> odd,even;
rep(i,n){
if(i % 2 == 0) even[v[i]]++;
else odd[v[i]]++;
}
int mx_odd1 = 0, mx_even1 = 0, num_odd1, num_even1;
for(auto x : odd) if(chmax(mx_odd1,x.second)) num_odd1 = x.first;
for(auto x : even) if(x.first != num_odd1 && chmax(mx_even1,x.second)) num_even1 = x.first;
int mx_odd2 = 0, mx_even2 = 0, num_odd2, num_even2;
for(auto x : even) if(chmax(mx_even2,x.second)) num_even2 = x.first;
for(auto x : odd) if(x.first != num_even2 && chmax(mx_odd2,x.second)) num_odd2 = x.first;
int res = max(mx_odd1+mx_even1,mx_odd2+mx_even2);
cout << n - res;
cout << "\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int main,temp,count=0;
cin>>main;
temp=floor(main/500);
main=main-temp*500;
count=count+temp*1000;
count=count+floor(main/5)*5;
cout<<count;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int t=1;
//cin>>t;
while(t--) solve();
}
| #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>
#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#define REPR(i, n) for(int i = (n); i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
#define LL long long int
#define LD long double
#define PI 3.14159265358979
using namespace std;
//================================================
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S; cin >> S; reverse(ALL(S)); cout << S << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if(n < 10){
cout << m + (10 - n)*100 << endl;
}else{
cout << m << endl;
}
} | #include<stdio.h>
int main(){
int N;
int R;
scanf("%d %d",&N,&R);
int x;
x = 10 - N;
int inner;
inner = 100 * x;
if(N>100 || N<1 || R<0 || R>4111){
printf("eror");
}
else if(N<10){
printf("%d",inner + R);
}
else if(N>=10){
printf("%d",R);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if ((A + B) > (C + D)){
cout << "Left" << endl;
}
if ((A + B) == (C + D)){
cout << "Balanced" << endl;
}
if ((A + B) < (C + D)){
cout << "Right" << endl;
}
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) SORT(V);REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define yes(n) cout << ((n) ? "yes" : "no" ) << endl
#define Yay(n) cout << ((n) ? "Yay!": ":(") << endl
#define RAPID cin.tie(0);ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a,b,c) (a) < (b) && (b) < (c)
#define MIDe(a,b,c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a,b) cin >> a >> b
#define IN3(a,b,c) cin >> a >> b >> c
#define IN4(a,b,c,d) cin >> a >> b >> c >> d
#define VIN(V) for(int i = 0; i < (V).size(); i++) {cin >> (V).at(i);}
#define OUT(n) cout << n << endl
#define VOUT(V) REP(i, (V).size()) {cout << (V)[i] << endl;}
#define VOUT2(V) REP(i, (V).size()) {cout << (V)[i] << " ";} cout<<endl;
#define FIX cout << fixed << setprecision(15)
// 型マクロ定義
#define int long long
#define P pair<ll,ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll,ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue<ll,V,greater<ll>
//
template<class T> inline bool chmin(T& a, T b) {if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if(a<b){a=b;return true;}return false;}
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a,int b){return b != 0 ? gcd(b, a % b) : a;} //最大公約数
int lcm(int a, int b){return a * b / gcd(a, b);}
string toStrUp(string str){char diff = 'A'-'a';REP(i,str.size()) str[i] += diff;return str;}
string gCh(string str, int key){return str.substr(key,1);}
signed main() {
RAPID;
// デフォルト変数定義
int n=0,m=0,a=0,b=0,c=0,d=0,x=0,y=0,z=0;
string s="",t="";
//
// ここから
IN(s);
if(s.size()==3){
REV(s);
OUT(s);
} else OUT(s);
} | 0 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a,b,azb,abb,amb;
cin>>a>>b;
azb=a*b;
abb=a+b;
amb=a-b;
cout << fmax(fmax(azb,abb),amb);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
int main() {
int N; cin >> N;
int result = 180 * (N-2);
cout << result << endl;
return 0;
} | 0 |
#include<cstdio>
#include<cmath>
#include <stdlib.h>
#include<algorithm>
using namespace std;
int main(){
int ans;
char sen[100];
while( scanf("%s",&sen) != EOF ){
ans=0;
for(int i=0;sen[i]!='\0';i++){
if(sen[i]=='I'){
if(sen[i+1]=='V'||sen[i+1]=='X'){
ans--;
}
else{
ans++;
}
}
if(sen[i]=='V'){
ans+=5;
}
if(sen[i]=='X'){
if(sen[i+1]=='L'||sen[i+1]=='C'){
ans-=10;
}
else{
ans+=10;
}
}
if(sen[i]=='L'){
ans+=50;
}
if(sen[i]=='C'){
if(sen[i+1]=='D'||sen[i+1]=='M'){
ans-=100;
}
else{
ans+=100;
}
}
if(sen[i]=='D'){
ans+=500;
}
if(sen[i]=='M'){
ans+=1000;
}
}
printf("%d\n",ans);
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<vector>
using namespace std;
#define INF (1<<20)
map<string,int> m;
vector<int> num;
main(){
m["I"]=1;
m["II"]=2;
m["III"]=3;
m["IV"]=4;
m["V"]=5;
m["VI"]=6;
m["VII"]=7;
m["VIII"]=8;
m["IX"]=9;
m["X"]=10;
m["XI"]=11;
m["XII"]=12;
m["XIII"]=13;
m["XIV"]=14;
m["XV"]=15;
m["XVI"]=16;
m["XVII"]=17;
m["XVIII"]=18;
m["XIX"]=19;
m["XX"]=20;
m["XXX"]=30;
m["XL"]=40;
m["L"]=50;
m["LX"]=60;
m["LXX"]=70;
m["LXXX"]=80;
m["XC"]=90;
m["C"]=100;
m["D"]=500;
m["M"]=1000;
string str;
while(cin >> str){
int res=0;
int tmp;
for(int i=0;i<(int)str.size();i++){
for(int j=4;j>0;j--){
if(i+j>str.size()) continue;
if(m[str.substr(i,j)]>0){
num.push_back(m[str.substr(i,j)]);
i+=(j-1);
break;
}
}
}
int i=0;
for(i=0;i<num.size()-1;i++){
// cout << num[i] << endl;
if(num[i]>=num[i+1]) res += num[i];
else{ res += (num[i+1]-num[i]); i++;}
}
// cout << num.back() << endl;
if(i==num.size()-1)
res += num.back();
cout << res << endl;
num.clear();
}
} | 1 |
#include<iostream>
using namespace std;
int x, i = 1;
int n;
void check_num();
void include3();
void end_check_num();
void check_num() {
x = i;
if (x % 3 == 0){
cout << " " << i;
end_check_num();
}else include3();
}
void include3() {
if (x % 10 == 3){
cout << " " << i;
end_check_num();
}else{
x /= 10;
if (x)include3();
else end_check_num();
}
}
void end_check_num() {
if (++i <= n) check_num();
}
int main() {
cin >> n;
check_num();
cout << endl;
char c;
cin >> c;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
for (int i=3;i<=n;i++) {
int x=i;
if (i%3==0 || i%10==3) {
printf(" %d",i);
} else {
while (x>0) {
if (x%10==3) {
printf(" %d",i);
break;
}
x/=10;
}
}
}
printf("\n");
return 0;
}
| 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
cout << 0 << endl;
string ss;
cin >> ss;
if (ss == "Vacant") return 0;
int l = 0, r = n;
while(true){
int mid = (l+r)/2;
cout << mid << endl;
string s;
cin >> s;
if (s == "Vacant") return 0;
if (mid % 2 == 1 && s != ss || mid % 2 == 0 && s == ss)
l = mid + 1;
else
r = mid;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
auto bsearch = [&]() {
bool fin = false;
string s0;
auto query = [&](int k) {
cout << k << endl;
string s;
cin >> s;
return s;
};
auto test = [&](int k) {
string s = query(k);
if(s == "Vacant") {
return fin = true;
} else if((k%2==1 && s!=s0) || (k%2==0 && s==s0)) {
return true;
} else {
return false;
}
};
int ok = 0, ng = N;
s0 = query(0);
while(abs(ok-ng)>1) {
int mid = (ok+ng)/2;
if(test(mid)) {
if(fin) return;
ok = mid;
} else {
ng = mid;
}
}
};
bsearch();
return 0;
}
| 1 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int a[5];
int kari;
char d;
while (cin >> a[0] >> d >> a[1] >> d >> a[2] >> d >> a[3] >> d >> a[4]) {
for (int i = 4; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j] > a[j+1]) {
kari = a[j];
a[j] = a[j+1];
a[j+1] = kari;
}
}
}
if (a[0] == a[1] || a[1] == a[2] || a[2] == a[3] || a[3] == a[4]) {
if ((a[0] == a[1] && a[1] == a[2]) || (a[1] == a[2] && a[2] == a[3]) || (a[2] == a[3] && a[3] == a[4])) {
if (((a[0] == a[1] && a[1] == a[2]) && (a[3] == a[4])) || ((a[0] == a[1]) && (a[2] == a[3] && a[3] == a[4]))) {
cout << "full house" << endl;
} else if ((a[0] == a[1] && a[1] == a[2] && a[2] == a[3]) || (a[1] == a[2] && a[2] == a[3] && a[3] == a[4])){
cout << "four card" << endl;
}else {
cout << "three card" << endl;
}
} else if ((a[0] == a[1] && a[2] == a[3]) || (a[0] == a[1] && a[3] == a[4]) || (a[1] == a[2] && a[3] == a[4])) {
if ((a[0] == a[1] && a[1] == a[2] && a[2] == a[3]) || (a[1] == a[2] && a[2] == a[3] && a[3] == a[4])) {
cout << "four card" << endl;
} else {
cout << "two pair" << endl;
}
} else {
cout << "one pair" << endl;
}
} else if ((a[1] == a[0] + 1 && a[2] == a[1] + 1 && a[3] == a[2] + 1 && a[4] == a[3] + 1) || (a[0] == 1 && a[1] == 10 && a[2] == a[1] + 1 && a[3] == a[2] + 1 && a[4] == a[3] + 1)){
cout << "straight" << endl;
} else {
cout << "null" << endl;
}
}
return 0;
} | #include<queue>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include <cstring>
#include <string.h>
#include <cmath>
#include <math.h>
#include <time.h>
#define ll long long
#define N 100003
#define M 103
#define db double
#define P putchar
#define G getchar
#define inf 998244353
using namespace std;
char ch;
void read(int &n)
{
n=0;
ch=G();
while((ch<'0' || ch>'9') && ch!='-')ch=G();
ll w=1;
if(ch=='-')w=-1,ch=G();
while('0'<=ch && ch<='9')n=(n<<3)+(n<<1)+ch-'0',ch=G();
n*=w;
}
int max(int a,int b){return a>b?a:b;}
int min(int a,int b){return a<b?a:b;}
ll abs(ll x){return x<0?-x:x;}
ll sqr(ll x){return x*x;}
void write(ll x){if(x>9) write(x/10);P(x%10+'0');}
int n,a[N],ans,s;
bool pd;
int gcd(int x,int y){return y==0?x:gcd(y,x%y);}
bool dfs(int x)
{
s=pd=0;
for(int i=1;i<=n;i++)
{
if(a[i]==1)pd=1;
if(a[i]&1)s++;
}
if((n-s)&1)return x;
if(pd || s>1)return !x;
for(int i=1;i<=n;i++)
if(a[i]%2)
{
a[i]--;
break;
}
int gc=a[1];
for(int i=2;i<=n;i++)
gc=gcd(gc,a[i]);
for(int i=1;i<=n;i++)
a[i]/=gc;
return dfs(!x);
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
read(n);
for(int i=1;i<=n;i++)
read(a[i]);
if(dfs(1))puts("First");
else puts("Second");
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for(int i = (a); i <=(n); ++i)
#define repst(i, n) for(auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for(int i = (n); i >= (a); --i)
#define sp(x) fixed << setprecision(x)
#define ordered_set tree<int , null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int inf = int(1e9);
const int mod = inf + 7;
const int N = 1e6 + 555; // TL MB
const double PI = acos(-1.0);
void mul(ll &x, ll y){
x *= y;
if(x >= mod) x %= mod;
}
void add(ll &x, ll y){
x += y;
if(x >= mod) x -= mod;
if(x < 0) x += mod;
}
ll bp(ll a, ll n){
ll r = 1;
while(n){
if(n & 1) mul(r, a);
mul(a, a);
n >>= 1;
}
}
void solve()
{
int n;
cin >> n;
ll a[n];
vector<ll> p;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, n){
if(i && a[i] == a[i - 1]) p.pb(a[i++]);
}
sort(p.rbegin(), p.rend());
if(sz(p) <= 1) cout << 0;
else cout << p[0] * p[1];
}
int main()
{
// freopen("crosses.in", "r", stdin);
// freopen("crosses.out", "w", stdout);
Red;
int T = 1;
// cin >> T;
for(int i = 1; i <= T; ++i){
solve();
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define pb push_back
using namespace std;
const int INF = 1e9;
typedef long long ll;
int main(){
int n,q;
cin >> n >> q;
vector <int> res;
int a[n];
int sq = sqrt(n);
int nsq = n/sq+1;
int lazy[nsq];
fill(a,a+n,2147483647);
fill(lazy,lazy+nsq,-1);
REP(i,q){
int z;
cin >> z;
if(z == 0){
int s,t,x;
cin >> s >> t >> x;
/*if(s == t){
a[s] = x;
}*/
if(t/sq == s/sq){
if(lazy[t/sq] >= 0){
fill_n(a+(t/sq)*sq,sq,lazy[t/sq]);
lazy[t/sq] = -1;
}
if(t-s+1 == sq){
lazy[t/sq] = x;
}
else{
fill_n(a+s,t-s+1,x);
}
//cout << "debug1" <<endl;
}
else{
//cout << "debug3" << endl;
int f = s,to = t;
while(to%sq != (sq - 1)){
to--;
}
while(f%sq != 0){
f++;
}
if(lazy[t/sq] >= 0){
fill_n(a+(t/sq)*sq,sq,lazy[t/sq]);
}
if(lazy[s/sq] >= 0){
fill_n(a+(s/sq)*sq,sq,lazy[s/sq]);
}
fill_n(a+to+1,t-to,x);
lazy[t/sq] = -1;
fill_n(a+s,f-s,x);
lazy[s/sq] = -1;
f = f/sq;
to = to/sq;
if(f <= to){
fill_n(lazy+f,to-f+1,x);
}
}
/*REP(i,n)
cout << a[i] << " ";
cout << endl;*/
}
else{
int x;
cin >> x;
int te = x / sq;
if(lazy[te] < 0){
//cout << a[x] << endl;
res.pb(a[x]);
}
else{
fill_n(a+te*sq,sq,lazy[te]);
lazy[te] = -1;
//cout << a[x] << endl;
res.pb(a[x]);
}
}
}
for(int i = 0;i < res.size();i++){
cout << res[i] << endl;
}
//cout << res.size() << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, k; cin >> n >> k;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(a.begin(), a.end());
bool odd, even;
odd = even = true;
REP(i, n) {
if (a[i] % 2) even = false;
else odd = false;
}
bool allSame = true;
bool diffFlag = true;
int diff = INT_MAX;
REP(i, n - 1) {
if (abs(a[i] - a[i+1]))
diff = min(diff, abs(a[i] - a[i+1]));
}
REP(i, n - 1) {
if (a[i] != a[i+1])
allSame = false;
if (abs(a[i] - a[i+1]) % diff)
diffFlag = false;
}
if (k > *max_element(a.begin(), a.end())) {
cout << "IMPOSSIBLE" << '\n';
}
else if (find(a.begin(), a.end(), k) != a.end()) {
cout << "POSSIBLE" << '\n';
}
else if (allSame) {
cout << ((k == a[0]) ? "POSSIBLE" : "IMPOSSIBLE") << '\n';
}
else if (diffFlag) {
cout << ((k % diff == 0) ? "POSSIBLE" : "IMPOSSIBLE") << '\n';
}
else {
if (k % 2) {
bool ok = true;
if (even) ok = false;
if (k == 1 && (even || odd)) ok = false;
cout << ((ok) ? "POSSIBLE" : "IMPOSSIBLE") << '\n';
}
else {
cout << "POSSIBLE" << '\n';
}
}
return 0;
}
| /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
// std::cout << std::setprecision(20) << 1.1 << endl;
int64_t GreatestCommonDivisor(const int64_t a, const int64_t b) {
// GCD. O(log(min(a, b))). 最大公約数.
int64_t result = -1LL;
if (a < 0) {
std::cerr << "ERROR: GreatestCommonDivisor(): a is out of range: " << a << std::endl;
throw 1;
} else if (b < 0LL) {
std::cerr << "ERROR: GreatestCommonDivisor(): b is out of range: " << b << std::endl;
throw 1;
} else if (a == 0LL) {
result = b;
} else if (b == 0LL) {
result = a;
} else {
const int64_t new_a = std::min(a, b);
const int64_t new_b = std::max(a, b) % new_a; // Euclidean Algorithm
result = GreatestCommonDivisor(new_a, new_b);
}
return result;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; ++i) {
cin >> A[i];
}
int64_t temp = A[0];
for (int64_t i = 1; i < N; ++i) {
temp = GreatestCommonDivisor(temp, A[i]);
}
if (K % temp == 0 && K <= (*max_element(A.begin(), A.end()))) {
cout << "POSSIBLE" << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
}
| 1 |
#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>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){
int len=d.size();
rep(i,len){
s<<d[i];if(i<len-1) s<<" ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){
int len=d.size();
rep(i,len){
s<<d[i]<<endl;
}
return s;
}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){
s<<"{ ";
for(auto itr=v.begin();itr!=v.end();++itr) {
if (itr!=v.begin()) {s<< ", ";}
s<<(*itr);
}
s<<" }";
return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){
s<<"{"<<endl;
for(auto itr=m.begin();itr!=m.end();++itr){
s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;
}
s<<"}"<<endl;
return s;
}
const ll mod=1e9+7;
const ll inf=1e17;
const int INF=1e9;
const double PI=acos(-1);
const double EPS=1e-10;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string a,b,c;
cin>>n>>a>>b>>c;
int ans=0;
rep(i,n){
set<char> cnt;
cnt.insert(a[i]),cnt.insert(b[i]),cnt.insert(c[i]);
if(cnt.size()==3) ans+=2;
else if(cnt.size()==2) ans+=1;
}
cout<<ans<<endl;
} | 0 |
#include <iostream>
#include<algorithm>
using namespace std;
int g[100],jyunni[100];
int n;
void katimake(int a,int b,int c,int d){
if(c>d){g[a-1]+=3;}
else if(d>c){g[b-1]+=3;}
else{
g[a-1]++;
g[b-1]++;
}
}
int main() {
cin>>n;
for(int i = 0;i<100;i++){
g[i]=0;
}
int p,q,r,s;
while(cin>>p>>q>>r>>s){katimake(p,q,r,s);}
int jyu = 1;
int saidai=0;
for(int i= 0;i<n;i++){saidai=max(saidai,g[i]);}
for(int p=saidai;saidai>=0;saidai--){
int y=0;
for(int i =0;i<n;i++){
if(g[i]==saidai){
jyunni[i]=jyu;
y++;
}
}
jyu+=y;
}
for(int i = 0;i<n;i++){
cout<<jyunni[i]<<endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
using namespace std;
int main()
{
int n, team1, team2, score1, score2, point[101] = {0};
vector<int> rank;
cin >> n;
for(int i = 0; i < n * (n - 1) / 2; i++){
cin >> team1 >> team2 >> score1 >> score2;
if(score1 > score2)
point[team1] += 3;
else if(score1 < score2)
point[team2] += 3;
else{
point[team1]++;
point[team2]++;
}
}
for(int i = 0; i < n; i++)
rank.push_back(point[i + 1]);
stable_sort(rank.begin(), rank.end(), greater<int>());
for(int i = 1; i <= n; i++){
for(int j = 0; j < n; j++){
if(point[i] == rank[j]){
cout << j + 1 << endl;
break;
}
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
i64 pow(i64 x, i64 n, i64 m) {
i64 ret = 1;
while(n) {
if(n & 1) (ret *= x) %= m;
(x *= x) %= m;
n >>= 1;
}
return ret;
}
i64 inv(i64 n, i64 m) {
return pow(n, m - 2, m);
}
int main() {
i64 n, m; scanf("%lld%lld", &n, &m);
i64 N = 1;
for(i64 i = 1; i <= 3 * n; i++) N = N * i % m;
std::vector<int> tan(3 * n + 1);
for(i64 i = 0; i < tan.size(); i++) tan[i] = inv(i, m);
int offset = 3 * n;
auto dp = make_v<int>(3 * n + 1, 6 * n + 1); dp[0][offset] = N;
for(int i = 0; i < 3 * n; i++) {
for(int j = 0; j < 6 * n; j++) {
i64 from = dp[i][j];
if(!from) continue;
if(i + 1 <= 3 * n) (dp[i + 1][j + 1] += from * tan[i + 1] % m) %= m;
if(i + 2 <= 3 * n)(dp[i + 2][j - 1] += from * tan[i + 2] % m) %= m;
if(i + 3 <= 3 * n)(dp[i + 3][ j ] += from * tan[i + 3] % m) %= m;
}
}
i64 ans = 0;
for(int i = offset; i < 6 * n + 1; i++) (ans += dp[3 * n][i]) %= m;
printf("%lld\n", ans);
return 0;
}
| #define _GLIBCXX_DEBUG //エラーを出すためのおまじない
#include <bits/stdc++.h>
#include <algorithm>
//#include <cstdlib> // abs() for integer
#include <cmath> // abs() for float, and fabs()
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
//#define cocount cout << count << endl;
#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 Cinint(n) int n;\
cin >> n;
#define Cinvecint(a, n) vector<int> a(n);\
for (int i = 0; i < (int)(n); i++) {\
int num;\
cin >> num;\
a.at(i) = num;\
}
#define Cinstring(s) string s;\
cin >>s;
int main() {
Cinint(n);
Cinstring(s);
int64_t count = 0;
int64_t Rcount = 0;
int64_t Gcount = 0;
int64_t Bcount = 0;
rep(i, n) {
if (s.at(i) == 'R') {
Rcount++;
}
else if (s.at(i) == 'G') {
Gcount++;
}
else {
Bcount++;
}
}
count = Rcount*Gcount*Bcount;
rep(i, n-2) {
for (int j = i+1; j < n-1; j++) {
int sa = j-i;
int k = j+sa;
if (k <= n-1) {
if (s.at(i) == 'R') {
if (s.at(j) == 'G') {
if (s.at(k) == 'B') {
count--;
}
}
else if (s.at(j) == 'B') {
if (s.at(k) == 'G') {
count--;
}
}
}
else if (s.at(i) == 'G') {
if (s.at(j) == 'B') {
if (s.at(k) == 'R') {
count--;
}
}
else if (s.at(j) == 'R') {
if (s.at(k) == 'B') {
count--;
}
}
}
else {
if (s.at(j) == 'R') {
if (s.at(k) == 'G') {
count--;
}
}
else if (s.at(j) == 'G') {
if (s.at(k) == 'R') {
count--;
}
}
}
}
}
}
cout << count << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(15);
int a,b;
cin>>a>>b;
a--;
b--;
cout<<(b+a-1)/a<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k=1;
cin >> a >> b;
for(int i=0;i<100000;i++){
if(a*i+k-->=b){
cout << i << endl;
break;
}
}
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int>so;
vector<bool>un(N + 1, true);
const long long mo = 1e9 + 7;
for (int i = 2; i <= N; i ++) {
if (un[i]) {
so.push_back(i);
for (int j = 0; j <= N / i; j ++) {
un[i * j] = false;
}
}
}
long long ans = 1;
int si = (int)so.size();
for (int i = 0; i < si; i ++) {
int n = N;
long long kj = 0;
while (n) {
kj += (long long) n / so[i];
n /= so[i];
kj %= mo;
}
ans *= kj + 1;
ans %= mo;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define peek(v) \
for (auto i : v) \
cout << i << ' ';
void solve()
{
vector<ll> v(1001, 0);
ll n, k;
cin >> n;
for (ll i = 2; i <= n; i++)
{
k = i;
for (ll j = 2; k > 1;)
{
if (k % j == 0)
k /= j, v[j]++;
else
j++;
}
}
ll res = 1;
for (ll i : v)
res = res * (i + 1) % MOD;
cout << res;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
cerr << "\n\n~" << 500 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
} | 1 |
#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;
}
}
}
}
| /**
* author: souzai32
* created: 05.08.2020 01:20:01
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int n=s.size();
vector<bool> alphabet(26);
if(n==26){
int i=1;
while(1){
if(s.at(n-i)<s.at(n-1-i)) i++;
else{
int j=0;
while(1){
if(s.at(n-1-i)<s.at(n-1-j)){
s.at(n-1-i)=s.at(n-1-j);
break;
}
else j++;
}
for(int j=0; j<i; j++) s.pop_back();
break;
}
if(i==26){
s="-1";
break;
}
}
}
else{
rep(i,n){
alphabet.at(s.at(i)-'a')=true;
}
int i=0;
char a='a';
while(1){
if(alphabet.at(i)) i++;
else{
a+=i;
s.push_back(a);
break;
}
}
}
cout << s << endl;
//cout << s.size() << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
typedef pair<int,int> P;
//最大公約数
int gcd(int a,int b){
if (a%b == 0){
return b;
}
else{
return gcd(b,a%b);
}
}
//最小公倍数
int lcm(int a,int b){
return a /gcd(a,b) * b;
}
//素数判定
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
// 素因数分解
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
// 10進数から2進数
int binary(int bina){
int ans = 0;
for (int i = 0; bina>0 ; i++)
{
ans = ans+(bina%2)*pow(10,i);
bina = bina/2;
}
return ans;
}
int main() {
int n;
cin >> n;
ll x,a[n+1];
cin >> x;
rep (i,n){
cin >> a[i];
}
int res = 0;
sort (a,a+n);
rep (i,n){
if (x >= a[i]) {
res ++;
x -= a[i];
}
else break;
}
if (res == n && x) --res;
cout << res << endl;
} | // #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
using VV = vector<V>;
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 A = (1<<2) | (1<<3) | (1<<5) | (1<<7);
//~ for (int bit=A; ; bit=(bit-1)&A){
//~ if (!bit) break;
//~ }
int next_combination(int sub) {
int x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
//~ int n=5;
//~ int k=3; // nCkの組み合わせ、ただしk=0には対応してない
//~ int bit=(1<<k)-1; // 1000 -> 0111
//~ for(; bit < (1<<n); bit=nex_combination(bit){
//~ }
bool isPrime(int a) {
if (a == 2) return true;
if (a <= 1 || a % 2 == 0) return false;
for (int i = 3; i * i <= a; i += 2) {
if (a % i == 0) return false;
}
return true;
}
//~ vector<int> a = {1, 14, 32, 51, 51, 51, 243, 419, 750, 910};
vector<int> aaa;
// index が条件を満たすかどうか
bool isOK(int index, int key) {
if (aaa[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索のテンプレ
int binary_search(int key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
(int)aaa
.size(); // 「index =
// a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//~ int v[100100];
//~ int INF = 1 << 30;
//~ vector<vector<int>> dp(310, vector<int>(310));
//~ ll dp[110][100100];
//~ vector<int> dp(100100, 0));
//~ int seen[110];
//~ int ans[110][2];
//~ ll MOD = 1e9 + 7;
void memo() {
// int n = 100;
// vector<int> a(n);
// rep(i, n) {
// cin >> a[i];
// a[i]--;
// }
// vector<int> ans(n);
// iota(ans.begin(), ans.end(), 0);
// sort(ans.begin(), ans.end(), [&](int i, int j) { return a[i] < a[j]; });
// double t1 = 0.1;
// cout << fixed << setprecision(6) << t1 << endl;
// int x;
// cin >> x;
// int n1 = 200001;
// vector<int> ans1;
// vector<int> primes(n, 1);
// int i;
// for (i = 2; i * i <= n; i++) {
// if (primes[i]) ans1.push_back(i);
// for (int j = i; j <= n; j += i) { primes[j] = 0; }
// }
// for (; i < n; i++) {
// if (primes[i]) { ans1.push_back(i); }
// }
// cout << *lower_bound(ans1.begin(), ans1.end(), x) << endl;
}
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
vector<int> acted(n, 0);
rep(i, n) {
if (a[i] <= x) {
x -= a[i];
acted[i] = a[i];
} else {
break;
}
}
acted.back() += x;
int ans = 0;
rep(i, n) {
if (a[i] == acted[i]) ans++;
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin >> n;
map<ll,ll> mp;
ll ans=0;
vector<ll> a(n);
REP(i,n){
cin >> a[i];
}
sort(ALL(a));
reverse(ALL(a));
REP(i,n){
bool f=false;
REPR(j,32){
if((1LL<<j)<=a[i]){
break;
}
if(mp[(1LL<<j)-a[i]]){
ans++;
mp[(1LL<<j)-a[i]]--;
f=true;
break;
}
}
if(!f){
mp[a[i]]++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
string A;
cin >> A;
ll ans = A.size() * (A.size() - 1) / 2;
char c = 'a';
rep(i,26)
{
ll cnt = 0;
rep(j,A.size())
{
if (A[j] == c) cnt++;
}
if (cnt != 0) ans -= cnt * (cnt - 1) / 2;
c++;
}
ans++;
cout << ans << endl;
return 0;
} | 0 |
#include<iostream>
using namespace std;
int main(){
int ans[31]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,3,6,10,19,34,62,113,207,381,701,1288,2369,4357,8014,14740};
while(1){
cin>>ans[0];
if(!ans[0])
return 0;
cout<<ans[ans[0]]<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
vector<long long int>D;
int main() {
long long int N;
D.push_back( 1 );
D.push_back( 1 );
D.push_back( 2 );
D.push_back( 4 );
while( cin >> N, N ) {
while( D.size() <= N ) {
D.push_back( D[D.size() - 1] + D[D.size() - 2] + D[D.size() - 3] );
}
cout << D[N] / 3650 + 1 << endl;
}
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N,K; cin >> N >> K;
int D[K]; rep(i,K) cin >> D[i];
int ans = N;
while (true) {
int tmp = ans;
bool check = true;
while (check && tmp >0) {
int a = tmp % 10;
rep(i,K) if (a == D[i]) {
check = false;
break;
}
if (check) {
tmp /= 10;
} else {
ans++;
break;
}
}
if (check) break;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,ll >
#define vps vector< pair< string, string> >
#define vpi vector< pair< int, int> >
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn(i,a,n) for(ll i=a;i<n;i++)
#define forr(i,n,a) for(ll i=n-1;i>=a;i--)
#define scan(arr,a,n) for(int i=(a);i<(n);i++)cin>>(arr)[i];
#define print(arr,a,n) for(int i=(a);i<(n);i++)cout<<(arr)[i]<<' ';
const ll inf = 1e18;
ll add(ll x, ll y) {ll res = x + y; return (res >= mod ? res - mod : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= mod ? res % mod : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + mod : res);}
ll power(ll x, ll y) {ll res = 1; x %= mod; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, mod - 2);}
int main(){
fast;
ll n, k;
cin>>n>>k;
ll d;
map<ll, ll> m;
forn(i, 0, k){
cin>>d;
m[d]++;
}
ll ans;
forn(i, n, n+100000){
ll x = i, f = 1;
while(x){
if(m[x%10]>0){
f = 0;
break;
}
x/=10;
}
if(f == 1){
ans = i;
break;
}
}
cout<<ans<<endl;
} | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
const int INF = 1001001001;
int n;
vector<int> to[1005];
vector<int> bfs(int sv) {
vector<int> dist(n,INF), pre(n,-1);
queue<int> q;
dist[sv] = 0;
q.push(sv);
while (!q.empty()) {
int v = q.front(); q.pop();
for (int u : to[v]) {
if(dist[u] != INF) continue;
pre[u] = v;
dist[u] = dist[v] + 1;
q.push(u);
}
}
pair<int, int> best(INF, -1);
rep(v,n) {
if (v == sv) continue;
for (int u : to[v]) {
if (u == sv) {
best = min(best, make_pair(dist[v],v));
}
}
}
if(best.first == INF) return vector<int>(n+1);
int v = best.second;
vector<int> res;
while(v != -1){
res.push_back(v);
v = pre[v];
}
return res;
}
int main(){
int m;
cin >> n >> m;
rep(i, m){
int a, b;
cin >> a >> b;
a--; b--;
to[a].push_back(b);
}
vector<int> ans(n+1);
rep(s, n){
auto now = bfs(s);
if(now.size() < ans.size()) ans = now;
}
if(ans.size() == n + 1){
cout << -1 << endl;
return 0;
}
cout << ans.size() << endl;
for (int v: ans){
cout << v+1 << endl;
}
} | #include<cstdio>
#include<utility>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int, int> P;
const int INF = 1050;
struct vertex {
vector<int> to;
int dist = INF;
};
int n, m;
int sd[1000], prv[1000];
vertex ver[1000];
priority_queue<P, vector<P>, greater<P>> q;
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d %d", &a, &b);
ver[a - 1].to.emplace_back(b - 1);
}
for (int i = 0; i < n; i++) sd[i] = INF;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) ver[j].dist = INF;
ver[i].dist = 0;
q.emplace(0, i);
while(!q.empty()) {
P p = q.top(); q.pop();
if (p.second != i && ver[p.second].dist != p.first) continue;
if (p.second == i && p.first != 0 && sd[i] != p.first) continue;
for (auto &j : ver[p.second].to) {
if (j != i && p.first + 1 < ver[j].dist) {
ver[j].dist = p.first + 1;
q.emplace(ver[j].dist, j);
}
if (j == i && p.first + 1 < sd[i]) {
sd[i] = p.first + 1;
q.emplace(sd[i], i);
}
}
}
}
int minsd = INF, ind;
for (int i = 0; i < n; i++) {
if (sd[i] < minsd) {
minsd = sd[i];
ind = i;
}
}
if (minsd == INF) {
printf("-1\n");
return 0;
}
for (int i = 0; i < n; i++) ver[i].dist = INF;
ver[ind].dist = 0;
sd[ind] = INF;
q.emplace(0, ind);
while(!q.empty()) {
P p = q.top(); q.pop();
if (p.second != ind && ver[p.second].dist != p.first) continue;
if (p.second == ind && p.first != 0 && sd[ind] != p.first) continue;
for (auto &i : ver[p.second].to) {
if (i != ind && p.first + 1 < ver[i].dist) {
ver[i].dist = p.first + 1;
q.emplace(ver[i].dist, i);
prv[i] = p.second;
}
if (i == ind && p.first + 1 < sd[ind]) {
sd[ind] = p.first + 1;
q.emplace(sd[ind], ind);
prv[i] = p.second;
}
}
}
printf("%d\n", minsd);
for (int i = 0, j = ind; i < minsd; i++) {
printf("%d\n", j + 1);
j = prv[j];
}
return 0;
}
| 1 |
//marico el que lo lea
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> ii;
void fastIO() {
std::ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
}
#define FOR(i,f,t) for(int i=f; i<(int)t; i++)
#define FORR(i,f,t) for(int i=f; i>(int)t; i--)
#define FORE(i,c) for(auto i = (c).begin(); i != (c).end(); i++)
#define pb push_back
#define all(obj) obj.begin(), obj.end()
#define ms(obj, val) memset(obj, val, sizeof(obj))
#define ms2(obj, val, sz) memset(obj, val, sizeof(obj[0])*sz)
#define fst first
#define snd second
template<typename T, typename U> inline void mnze(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void mxze(T &x, U y) { if(x < y) x = y; }
void _scan( int &x ) { scanf("%d",&x); }
void _scan( long long &x ) { scanf("%lld",&x); }
void _scan( double &x ) { scanf("%lf",&x); }
void _scan( char &x ) { scanf(" %c",&x); }
void _scan( char *x ) { scanf("%s",x); }
void scan() {}
template<typename T, typename... U>
void scan( T& head, U&... tail ) { _scan(head); scan(tail...);}
template<typename T> void _dbg(const char* sdbg, T h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename T, typename... U> void _dbg(const char* sdbg, T h, U... t) {
while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(_i, (x)) cerr <<*_i <<", "; cerr <<"\n"; }}
#define debuga(x, sz) {{cerr <<#x <<" = "; FOR(_i, 0, sz) cerr << x[_i] <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define debuga(x, sz)
#define cerr if(0)cout
#endif
///////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////
int dig, D[46];
ll dp[50][2][2];
ll f(int d, int cl, int cr){
int d2 = dig-1-d;
if(d2 < d) return cl==cr;
if(d2 == d) return (10*cl-cr == D[d])*10;
ll &ret = dp[d][cl][cr];
if(ret!=-1) return ret;
ret = 0;
FOR(dl,0,10) FOR(dr,0,10) FOR(ncl,0,2) FOR(ncr,0,2){
if(dr - cr + 10*ncr - dl == D[d] && dl + 10*cl - ncl - dr == D[d2]){
if(!d && !dr) continue;
//debug(dl, dr, ncl, ncr);
ret += f(d+1, ncl, ncr);
}
}
return ret;
}
int main(){
int d, mnd=0; scan(d);
FOR(_,0,49){
if(d) mnd = _+1;
D[_] = d%10;
d/=10;
}
ll ans = 0;
FOR(i,mnd,49){
ms(dp,-1);
dig = i;
ans += f(0,0,0);
}
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long ;
void solve() {
ll k; cin >> k;
ll x = k/50;
int j = k%50;
vector<ll> a(50, 50+x);
j = (50-j);
for (int i = 0; i < j; i++) {
a[i] += -50+j-1;
}
for (int i = j; i < 50; i++) {
a[i] += j;
}
cout << "50\n";
for (auto& x: a) {
cout << x << ' ';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| 0 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
vector<int> get_bits(int mask) {
vector<int> bb;
while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
reverse(all(bb));
return bb;
}
int get_mask(vector<int> v) {
int mask = 0;
for(int x : v) { mask ^= (1 << x); }
return mask;
}
template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r){
uniform_int_distribution<ll> uid(l, r);
return uid(rng);
}
void sc() {}
template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// #ifndef LOCAL
// string to_string(__int128 x) {
// string s = "";
// bool neg = 0;
// if(x < 0) { s += "-"; neg = 1; x = -x; }
// if(!x) s += '0';
// while(x) {
// int rem = x % 10;
// s += to_string(rem);
// x /= 10;
// }
// reverse(s.begin() + neg, s.end());
// return s;
// }
// #endif
const int mod = 1e9 + 7; // 998244353;
int pwr(int a,ll b) {
int ans = 1;
while(b) {
if(b & 1) ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
/*
Lookout for overflows!!
Check array sizes!!
Clear before test cases!!
Use the correct modulo!!
Check for corner cases!!
Are you forgetting something?!
Read problem statement carefully!!!
*/
const int N = 1e5 + 5;
int dsu[N], sz[N];
bool odd[N], par[N];
int root(int u) {
while(u != dsu[u]) u = dsu[u];
return u;
}
int get_par(int u) {
int p = 0;
while(u != dsu[u]) {
p ^= par[u];
u = dsu[u];
}
return p;
}
void uni(int u,int v) {
int uu = root(u), vv = root(v);
if(uu == vv) {
if(get_par(u) == get_par(v))
odd[uu] = 1;
return;
}
if(sz[uu] > sz[vv]) {
swap(uu, vv), swap(u, v);
}
dsu[uu] = vv;
sz[vv] += sz[uu];
odd[vv] |= odd[uu];
par[uu] = get_par(u) ^ get_par(v) ^ 1;
}
void solve() {
int n, m;
sc(n, m);
fr(i, 1, n) {
sz[i] = 1;
dsu[i] = i;
odd[i] = 0;
par[i] = 0;
}
fr(i, 1, m) {
int u, v;
sc(u, v);
uni(u, v);
}
int c1 = 0, c2 = 0, c3 = 0;
fr(i, 1, n) {
if(i == dsu[i]) {
if(sz[i] == 1) {
c1++;
}
else if(odd[i]) {
c2++;
}
else {
c3++;
}
}
}
ll ans = 0;
while(c1) {
ans += 2 * n - 1;
n--;
c1--;
}
while(c2) {
ans += 2 * (c2 + c3) - 1;
c2--;
}
ans += (c3 * 1LL * (c3 - 1)) * 2 + 2LL * c3;
cout << ans;
}
int main() {
ios :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for(int tt = 1; tt <= t; tt++) {
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll t;
cin >> t;
while(t--) {
ll n;
cin >> n;
vec a(n);
for(ll i=0;i<n;i++) cin >> a[i];
string s;
cin >> s;
vec al;
ll f=0;
for(ll i=n-1;i>=0;i--) {
for(ll t:al) {
a[i]=min(a[i],a[i]^t);
}
al.push_back(a[i]);
if(a[i]&&s[i]=='1') {
f=1;
}
}
cout << f << endl;
}
} | 0 |
// 有點不耐煩會破壞偉大的計劃
#include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e14 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0, 0, -1, -1, 1, -1, 1};
const int dy[] = {0, 1, -1, 0, -1, 1, 1, -1};
void debug() {
cerr << "\n";
}
template<typename Type1, typename... Type2>
void debug(Type1 a, Type2... b) {
cerr << a << " ";
debug(b...);
}
int main() {
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
long long n, curMin = INF, ans = 0; cin >> n;
vector<long long> a(n);
for(long long i = 0; i < n; i++) {
cin >> a[i];
curMin = min(curMin, a[i]);
if(curMin >= a[i]) ans++;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
class SegTree {
constexpr static int DEFAULT = INT_MAX;
int Combine(int l, int r) { return min(l,r); }
vector<int> seg_tree;
int n = 0;
void Build(vector<int>& A, int v, int tl, int tr) {
if (tl == tr) {
seg_tree[v] = A[tl];
} else {
int tm = tl + (tr - tl) / 2;
Build(A, v*2, tl, tm);
Build(A, v*2+1, tm+1, tr);
seg_tree[v] = Combine(seg_tree[v*2], seg_tree[v*2+1]);
}
}
public:
SegTree(vector<int>& A) {
n = A.size();
seg_tree.resize(4*n);
Build(A, 1, 0, n-1);
}
SegTree(int _n) : n(_n) {
//seg_tree.resize(4*n);
seg_tree.resize(4*n, DEFAULT);
}
int Query(int l, int r, int tl, int tr, int v) {
if (l > r) return DEFAULT;
if (l == tl && r == tr) return seg_tree[v];
int tm = tl + (tr - tl) / 2;
return Combine(Query(l, min(r, tm), tl, tm, v*2),
Query(max(l, tm+1), r, tm+1, tr, v*2+1));
}
int Query(int l, int r) {
return Query(l, r, 0, n-1, 1);
}
void Update(int pos, int new_val, int tl, int tr, int v) {
if (tl == tr) {
seg_tree[v] = new_val;
return;
}
int tm = tl + (tr - tl) / 2;
if (pos <= tm) {
Update(pos, new_val, tl, tm, v*2);
} else {
Update(pos, new_val, tm+1, tr, v*2+1);
}
seg_tree[v] = Combine(seg_tree[v*2], seg_tree[v*2+1]);
}
void Update(int pos, int new_val) {
Update(pos, new_val, 0, n-1, 1);
}
};
int main() {
ios::sync_with_stdio(0); cin.tie(0);
ll n;
cin >> n;
vector<int> A(n);
for (auto& _a : A) cin >> _a;
SegTree stree(A);
int ans = 0;
for (int i = 0; i < n; ++i) {
if (stree.Query(0, i) == A[i]) ++ans;
}
cout << ans << endl;
}
| 1 |
#include <stdio.h>
int main(){
int n,m,i,j,x[20],y[20],z[30],p[31],q[31],a[20],b[20],c[20],s;
char d[i];
while(1) {
scanf("%d",&n);
if (n==0) break;
for (i=0;i<n;i++) {
scanf("%d %d",&x[i],&y[i]);
}
scanf("%d",&m);
for (i=0;i<m;i++) {
getchar();
scanf("%c %d",&d[i],&z[i]);
}
p[0]=10;
q[0]=10;
for (i=0;i<m;i++) {
p[i+1]=p[i];
q[i+1]=q[i];
if (d[i]=='N') {q[i+1]=q[i]+z[i];}
if (d[i]=='S') {q[i+1]=q[i]-z[i];}
if (d[i]=='E') {p[i+1]=p[i]+z[i];}
if (d[i]=='W') {p[i+1]=p[i]-z[i];}
}
s = 1;
for (i=0;i<n;i++) {
c[i] = 0;
for (j=0;j<m;j++) {
a[i] = b[i] = 0;
if ((x[i]<=p[j]&&x[i]>=p[j+1])||(x[i]>=p[j]&&x[i]<=p[j+1])) {
a[i]=1;
}
if ((y[i]<=q[j]&&y[i]>=q[j+1])||(y[i]>=q[j]&&y[i]<=q[j+1])) {
b[i]=1;
}
c[i] |= a[i]*b[i];
}
}
for (i=0;i<n;i++) {
s*=c[i];
}
if (s==1) {printf("Yes\n");}
if (s!=1) {printf("No\n");}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int map[21][21],n,a,b,c,d,x,y,n2;
char h;
while(cin>>n){
if(n==0)break;
for(int i=0;i<21;i++)for(int j=0;j<21;j++)map[i][j]=0;
for(int i=0;i<n;i++){cin>>a>>b;map[b][a]++;}
cin>>n2;c=0;x=y=10;
for(int i=0;i<n2;i++){
cin>>h;
cin>>d;
if(h=='N')for(int j=0;j<d;j++){y++;if(map[y][x]!=0){map[y][x]=0;c++;}}
else if(h=='S')for(int j=0;j<d;j++){y--;if(map[y][x]==1){map[y][x]=0;c++;}}
else if(h=='E')for(int j=0;j<d;j++){x++;if(map[y][x]==1){map[y][x]=0;c++;}}
else if(h=='W')for(int j=0;j<d;j++){x--;if(map[y][x]==1){map[y][x]=0;c++;}}
}
if(c==n)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
vector<int> v(s.size());
for(int i=0; i<s.size(); i++) {
v[i] = s[i]-'0';
sum += v[i];
}
if(stoi(s)%sum==0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int f(int n) {
int ret = 0;
while (n >= 1) {
ret += n % 10;
n /= 10;
}
return ret;
}
int main() {
int n;
cin >> n;
if (n % f(n) == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define int long long
const int MOD = 998244353;
const int N = 1e5 + 5;
int add(int a, int b) {
return (a + b) % MOD;
}
int mul(int a, int b) {
return (a * b) % MOD;
}
int binpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = mul(res, a);
a = mul(a, a);
b >>= 1;
}
return res;
}
int divv(int a, int b) {
return mul(a, binpow(b, MOD - 2));
}
int f[N];
void init() {
f[0] = 1;
for (int i = 1; i < N; i++) {
f[i] = mul(i, f[i - 1]);
}
}
int C(int n, int k) {
return divv(f[n], mul(f[k], f[n - k]));
}
int cnt_array(int cnt, int n) {
if (cnt == 0) return 0;
return C(n + cnt - 1, n);
}
int solve(int db, int on, int n, int rk) {
rk -= db;
int ans = 0;
for (int sel = 0; sel <= db && sel <= n; sel++) {
int cnt = cnt_array(on + sel, n - sel);
cnt = mul(cnt, C(db, sel));
cnt = mul(cnt, binpow(2, sel));
ans = add(ans, cnt);
}
return ans;
}
int n, k;
int solve_i(int i) {
int db = 0;
int on = 0;
int mid = 0;
for (int x = 1; x <= k; x++) {
if (1 <= (i - x) && (i - x) <= k) {
if (2 * x == i) {
mid = 1;
} else {
db++;
}
} else {
on++;
}
}
db /= 2;
if (mid) {
int ff = solve(db, on, n, k - 1);
int ss = solve(db, on, n - 1, k - 1);
return add(ff, ss);
} else {
return solve(db, on, n, k);
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
init();
cin >> k >> n;
for (int i = 2; i <= 2 * k; i++) {
cout << solve_i(i) << '\n';
}
}
| #include <bits/stdc++.h>
#define mp make_pair
#define X first
#define Y second
#define FOE(x, a) for(auto x : a)
#define FOR(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;
typedef pair <int, int> ii;
const int N = 2010;
const int MOD = 998244353;
void add(int &x, int y){
x += y;
x -= (x >= MOD) * MOD;
}
void sub(int &x, int y){
x -= y;
x += (x < 0) * MOD;
}
int n, k, d[2 * N], C[2 * N][2 * N], pow2[N];
int nCk(int n, int k){
if (n < 0 || n < k || k > n || k < 0)
return 0;
return C[n][k];
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> k >> n;
C[0][0] = 1;
FOR(i, 1, 2 * max(n, k)){
C[i][0] = 1;
FOR(j, 1, i){
add(C[i][j], C[i - 1][j]);
add(C[i][j], C[i - 1][j - 1]);
}
}
pow2[0] = 1;
FOR(i, 1, max(n, k))
pow2[i] = (ll) pow2[i - 1] * 2 % MOD;
FOR(i, 1, k)
FOR(j, i + 1, k)
d[i + j]++;
FOR(x, 2, 2 * k)
if (x % 2 == 1){
int ans = 0;
FOR(i, 0, d[x])
add(ans, (ll) pow2[i] * nCk(k - 2 * d[x] + n - 1, n - i) % MOD * nCk(d[x], i) % MOD);
cout << ans << endl;
} else {
int ans = 0;
FOR(i, 0, d[x]){
add(ans, (ll) pow2[i] * nCk(k - 2 * d[x] + n - 2, n - i) % MOD * nCk(d[x], i) % MOD);
add(ans, (ll) pow2[i] * nCk(k - 2 * d[x] + n - 3, n - i - 1) % MOD * nCk(d[x], i) % MOD);
}
cout << ans << endl;
}
int ans = 0;
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<cstring>
using namespace std;
typedef long long ll;
int a[100100];
int c[100100];
bool check(int x,int i)
{
if(c[x]<a[i])
{
return 1;
}
else
{
return 0;
}
}
int bs(int l, int r,int i)
{
while (l < r)
{
int mid = l + r >> 1;
if (check(mid,i)) r = mid; // check()判断mid是否满足性质
else l = mid + 1;
}
return l;
}
int main()
{
int n;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> a[i];
}
int cnt=1;
c[1] = a[1];
for(int i=2;i<=n;i++)
{
int pos = bs(1,cnt,i);
if(c[pos]<a[i])
{
c[pos] = a[i];
}
else
{
cnt++;
c[cnt] = a[i];
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main(){
ll n; cin>>n;
vector<ll> v(5);
rep(i,5) cin>>v[i];
sort(all(v));
cout<<(n+v[0]-1)/v[0]+4<<endl;
} | 0 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define N 600000
#define NIL -1
//array
int key[N];
int parent[N];
int leftc[N];
int rightc[N];
//root
int root=NIL;
//function insert
void insert(int z){
int x,y;
y=NIL;
x=root;
while(x!=NIL){
y=x;
if(key[z]<key[x]) x=leftc[x];
else x=rightc[x];
}
parent[z]=y;
if(y==NIL) root=z;
else if(key[z]<key[y]) leftc[y]=z;
else rightc[y]=z;
}
//function search
int find(int now,int data){
if(now==NIL ||data==key[now]) return now;
if(data<key[now]) return find(leftc[now],data);
else return find(rightc[now],data);
}
int treeminimum(int x){
while(leftc[x]!=NIL){
x=leftc[x];
}
return x;
}
int treesuccessor(int x){
int y;
if(rightc[x]!=NIL) return treeminimum(rightc[x]);
y=parent[x];
while(y!=NIL &&x==rightc[x]){
x=y;
y=parent[y];
}
return y;
}
//function delete
void treedelete(int z){
int x,y;
if(leftc[z]==NIL ||rightc[z]==NIL) y=z;
else y=treesuccessor(z);
if(leftc[y]!=NIL) x=leftc[y];
else x=rightc[y];
if(x!=NIL) parent[x]=parent[y];
if(parent[y]==NIL) root=x;
else if(y==leftc[parent[y]]) leftc[parent[y]]=x;
else rightc[parent[y]]=x;
if(y!=z) key[z]=key[y];
}
//print
void inorderprint(int now){
if(now!=NIL){
inorderprint(leftc[now]);
printf(" %d",key[now]);
inorderprint(rightc[now]);
}
}
void preorderprint(int now){
if(now!=NIL){
printf(" %d",key[now]);
preorderprint(leftc[now]);
preorderprint(rightc[now]);
}
}
int main(){
int n,i,j,data;
int z=0;
int del;
char str[10];
//initialize array
for(i=0;i<N;i++){
parent[i]=NIL;
key[i]=NIL;
rightc[i]=NIL;
leftc[i]=NIL;
}
//load n
scanf("%d",&n);
//load commnad and key
for(i=0;i<n;i++){
scanf("%s",str);
if(strcmp(str,"insert")==0) {
scanf("%d",&data);
key[z]=data;
insert(z);
z++;
}
else if(strcmp(str,"find")==0){
scanf("%d",&data);
if(find(root,data)!=NIL) printf("yes\n");
else printf("no\n");
}
else if(strcmp(str,"delete")==0){
scanf("%d",&data);
del=find(root,data);
treedelete(del);
}
else if(strcmp(str,"print")==0){
inorderprint(root);
cout <<endl;
preorderprint(root);
cout <<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Node {
int key;
Node *parent, *left, *right;
};
Node *NIL, *root;
void insert(int x) {
Node *p = NIL;
Node *u = root;
Node *in = (Node *)malloc(sizeof(Node));
in->key = x;
in->left = NIL;
in->right = NIL;
while (u != NIL) {
p = u;
if (in->key < u->key) {
u = u->left;
} else {
u = u->right;
}
}
in->parent = p;
if (p == NIL) {
root = in;
} else if (in->key < p->key) {
p->left = in;
} else {
p->right = in;
}
}
bool find(Node *u, int x) {
while (u != NIL && u->key != x) {
if (x < u->key) {
u = u->left;
} else {
u = u->right;
}
}
if (u == NIL) {
return false;
} else {
return true;
}
}
Node * findP(Node *u, int x) {
while (u != NIL && u->key != x) {
if (x < u->key) {
u = u->left;
} else {
u = u->right;
}
}
return u;
}
Node * getMinimum(Node *u) {
while (u->left != NIL) {
u = u->left;
}
return u;
}
Node * getSuccessor(Node *u) {
if (u->right != NIL) {
return getMinimum(u->right);
}
Node *d = u->parent;
while (d != NIL && u == d->right) {
u = d;
d = d->parent;
}
return d;
}
void deleteNode(Node *u) {
Node *d, *x;
if (u->left == NIL || u->right == NIL) {
d = u;
} else {
d = getSuccessor(u);
}
if (d->left != NIL) {
x = d->left;
} else {
x = d->right;
}
if (x != NIL) {
x->parent = d->parent;
}
if (d->parent == NIL) {
root = x;
} else if (d == d->parent->left) {
d->parent->left = x;
} else {
d->parent->right = x;
}
if (d != u) {
u->key = d->key;
}
}
void printPre(Node *u) {
if (u == NIL) {
return;
}
printf(" %d", u->key);
printPre(u->left);
printPre(u->right);
}
void printIn(Node *u) {
if (u == NIL) {
return;
}
printIn(u->left);
printf(" %d", u->key);
printIn(u->right);
}
int main() {
int m;
cin >> m;
for (int i = 0; i < m; i++) {
string com;
cin >> com;
if (com == "insert") {
int x;
scanf("%d", &x);
insert(x);
} else if (com == "find") {
int x;
scanf("%d", &x);
if (find(root, x)) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
} else if (com == "delete") {
int x;
scanf("%d", &x);
auto u = findP(root, x);
deleteNode(u);
} else {
printIn(root);
printf("\n");
printPre(root);
printf("\n");
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using vc = vector<char>;
using pll = pair<ll, ll>;
template<class T> void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T> void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U> bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U> bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool even(T n) { return ! (n & 1); }
template<class T> bool odd(T n) { return n & 1; }
template<class T> ll rup(T a, T b) { return a % b ? a / b + 1 : a / b; }
template<class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll intpow(ll a, ll n, ll _mod=numeric_limits<ll>::max()) { ll p=1; while (n) { if (n&1) p=p*a%_mod; a=a*a%_mod; n>>=1; } return p; }
ll modc(ll a, char op, ll b, ll _mod=mod) { a %= _mod; b %= _mod; ll res = 1; switch(op) {
case '+': res = (a + b) % _mod; break;
case '-': res = (a - b) % _mod; break;
case '*': res = a * b % _mod; break;
case '/': res = modc(a, '*', modc(b, '^', _mod-2, _mod), _mod); break;
case '^': res = intpow(a, b, _mod); break;
case 'P': rep(i, a-b+1, a+1) res = modc(res, '*', i, _mod); break;
case 'C': res = modc(modc(a, 'P', b, _mod), '/', modc(b, 'P', b, _mod)); break; } if (res < 0) res += _mod; return res; }
int main()
{
ll H, W, N;
cin >> H >> W >> N;
ll bigger = max(H, W);
cout << rup(N, bigger) << endl;
}
| #include <stdio.h>
int main() {
int h, w, g, result;
scanf("%d %d %d", &h, &w, &g);
result = (h > w) ? (g+h-1)/h : (g+w-1)/w;
printf("%d\n", result);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int soredake(int point, int kazu, int bonasu, int goal) {
int tokukazu = goal / point;
if (goal % point > 0) {
tokukazu++;
}
if (tokukazu > kazu) {
tokukazu = kazu;
}
return tokukazu;
}
int search(vector<vector<int>> questions, int goal) {
int minimum = 0;
for (int i = 0; i < questions.size(); i++) {
minimum += questions.at(i).at(1);
}
for (int i = 0; i < questions.size(); i++) {
int point = questions.at(i).at(0);
int kazu = questions.at(i).at(1);
int bonasu = questions.at(i).at(2);
int goukei = questions.at(i).at(3);
vector<vector<int>> q = questions;
q.erase(q.begin() + i);
if (goukei < goal) {
int nokori = search(q, goal - goukei) + kazu;
if (nokori < minimum) {
minimum = nokori;
}
} else {
int nokori = soredake(point, kazu, bonasu, goal);
if (nokori < minimum) {
minimum = nokori;
}
}
}
return minimum;
}
int main() {
int d, g;
cin >> d >> g;
vector<vector<int>> questions(d, vector<int>(4));
for (int i = 0; i < d; i++) {
questions.at(i).at(0) = 100 * (i + 1);
cin >> questions.at(i).at(1);
cin >> questions.at(i).at(2);
questions.at(i).at(3) =
questions.at(i).at(0) * questions.at(i).at(1) + questions.at(i).at(2);
}
cout << search(questions, g) << endl;
}
| #include"bits/stdc++.h"
using namespace std;
int main() {
int D, G;
cin >> D >> G;
vector<int> p(D), c(D);
for (int i = 0; i < D; i++)
{
cin >> p.at(i) >> c.at(i);
}
int min_cnt = 1<<30;
for (int bit = 0; bit < (1<<D); bit++)
{
int pnt = 0;
int cnt = 0;
for (int i = 0; i < D; i++)
{
if ((bit >> i) & 1)
{
pnt += p.at(i) * 100 * (i + 1) + c.at(i);
cnt += p.at(i);
}
}
if (pnt >= G) { min_cnt = min(cnt, min_cnt); continue; }
else
{
for (int i = D-1; i >= 0; i--) {
if ((bit >> i) & 1) continue;
for (int j = 0; j < p.at(i)-1; j++)
{
if (pnt >= G) { min_cnt = min(cnt, min_cnt); continue; }
pnt += 100 * (i + 1);
cnt++;
}
}
if (pnt >= G) min_cnt = min(cnt, min_cnt);
}
}
cout << min_cnt << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(3);
int k, y;
for(int i=0;i<3;i++) cin >> x.at(i);
cin >> k;
sort(x.begin(), x.end());
y = x.at(2);
for(int i=0;i<k;i++) y = 2*y;
cout << x.at(0) + x.at(1) + y << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
rep(i,k){
if(max({a,b,c}) == a) a *= 2;
else if(max({a,b,c}) == b) b *= 2;
else c *= 2;
}
cout << a+ b + c << endl;
} | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int n,m,x1[4]={0,0,1,-1},y1[4]={1,-1,0,0};
char island[13][13];
int serch(int x,int y)
{
island[x][y]='0';
for(int i=0;i<4;i++){
int x2=x+x1[i],y2=y+y1[i];
if(x2>=0&&x2<=11&&y2>=0&&y2<=11&&island[x2][y2]=='1')serch(x2,y2);
}
//cout<<"end\n";
}
int main(void)
{
int A=0;
while(1){
A=0;
for(int i=0;i<12;i++){
if(scanf("%s",island[i])==EOF)goto end1;
}
for(int i=0;i<12;i++){
for(int j=0;j<12;j++){
if(island[i][j]=='1'){
// cout<<"str\n";
serch(i,j);
A++;
}
}
}
cout<<A<<"\n";
}
end1:;
} | # include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
# define rep(i,n) for(int i=0;i<n;++i)
# define forn(i,n) for(int i=1;i<=n;++i)
# define lr(i,l,r) for(int i=l;(l>r?i>=r:i<=r);(l>r?--i:++i))
using namespace std;
template<class T> void umin(T &a, T b) { a = min(a, b); }
template<class T> void umax(T &a, T b) { a = max(a, b); }
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9+7;
const int N = 2e5+5;
void solve(){
int a,b;
cin>>a>>b;
if(b==1){
cout<<0;
}
else{
int ans=1;
int cur=a;
while(cur<b){
int prev=cur;
for(int i=1;i<=prev && cur<b;++i){
cur--;
cur+=a;
ans++;
}
}
cout<<ans;
}
}
int main(){
Speed();
int T=1;
//cin>>T;
while(T--)
solve();
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=305;
int a,b,c,tmp;
double n,dp[N][N][N];
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>tmp;
if(tmp==1)a++;
else if(tmp==2)b++;
else c++;
}
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
for(int k=0;k<=n;k++)
{
if(!i&&!j&&!k)continue;
if(i)dp[i][j][k]+=dp[i-1][j+1][k]*i;
if(j)dp[i][j][k]+=dp[i][j-1][k+1]*j;
if(k)dp[i][j][k]+=dp[i][j][k-1]*k;
dp[i][j][k]=dp[i][j][k]/(i+j+k);
dp[i][j][k]+=n/(i+j+k);
}
}
}
cout<<fixed<<setprecision(12)<<dp[c][b][a]<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long dp[200003][3];
long long ara[200003],n;
long long solve(long long idx,long long sta,long long lim)
{
long long rr=lim-sta;
if(idx+rr==n)return ara[idx];
else if(dp[idx][sta]!=-1)return dp[idx][sta];
else
{
long long p;
p=ara[idx]+solve(idx+2,sta,lim);
if(sta+1<=lim)
{
p=max(p,ara[idx]+solve(idx+3,sta+1,lim));
}
dp[idx][sta]=p; return dp[idx][sta];
}
}
int main()
{
long long a,i,j,st=1,ans=LLONG_MIN;
scanf("%lld",&n);
for(i=1;i<=n;i++)
{
scanf("%lld",&a); ara[i]=a; dp[i][0]=-1; dp[i][1]=-1; dp[i][2]=-1;
}
if(n%2==1)
{
ans=max(ans,solve(1,0,2));
st=2;
}
if(st==2){memset(dp,-1,sizeof dp);}
ans=max(ans,solve(st,0,1));
memset(dp,-1,sizeof dp);
ans=max(ans,solve(st+1,0,0));
printf("%lld\n",ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> num, pos;
set<int> s;
vector<int> v;
const int N = 1e5+10;
const int k = 30;
int up[N][k];
int L;
void calc(int i) {
//cout << "this->" << *s.lower_bound(-(v[i]+L)) << endl;
up[i][0] = num[*s.lower_bound(-(v[i]+L))];
//cout << up[i][0] << endl;
for(int j = 1; j < k; j++) {
up[i][j] = up[up[i][j-1]][j-1];
}
/*cout << "i=" << i << ": " << endl;
for(int j = 0; j < k; j++) cout << "k=" << j << " " << up[i][j] << endl;
cout << endl;
*/
}
int solve(int a, int b) {
if(a>b) swap(a, b);
int sum = 0;
int cur = a;
while(cur != b) {
for(int j = 0; j < k-1; j++) {
if(up[cur][j] >= b) {
if(j==0) {
sum++;
cur = b;
} else {
cur = up[cur][j-1];
sum += (1<<(j-1));
}
break;
}
}
}
return sum;
}
int main() {
int n; cin >> n;
v.resize(n+1);
int cnt = 1;
for(int i = 1; i <= n; i++) {
int xi; cin >> xi;
num[-xi] = cnt;
pos[cnt] = xi;
cnt++;
s.insert(-xi);
v[i] = xi;
}
cin >> L;
for(int i = 0; i < k; i++) up[n+1][i] = n;
for(int i = n; i > 0; i--) {
calc(i);
}
int q; cin >> q;
while(q--) {
int a, b; cin >> a >> b;
cout << solve(a, b) << "\n";
}
} | // Date: 2020-03-19
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define FIO ios::sync_with_stdio(false);cin.tie(0)
#define rep(i, a, b) for(int i = int(a); i <= int(b); ++i)
#define per(i, b, a) for(int i = int(b); i >= int(a); --i)
#define mem(x, y) memset(x, y, sizeof(x))
#define all(x) (x).begin(),(x).end()
#define D(x) cout<<#x<<" = "<<x<<endl;
#define SZ(x) ((int)x.size())
#define mk make_pair
#define pb push_back
#define fi first
#define se second
const LL INF = 1e18;
const LL mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int N = 1e5 + 10;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
LL qpow(LL x, LL y, LL MOD) {LL a=1; while(y){ if(y&1) a=a*x%MOD; x=x*x%MOD; y>>=1; } return a;}
int r[N][30], x[N], n, L, Q, dep;
void init() {
rep(i, 1, n) r[i][0] = upper_bound(x+i, x+n+1, x[i]+L)-x-1;
rep(d, 1, 20) {
rep(i, 1, n) {
r[i][d] = r[r[i][d-1]][d-1];
}
}
}
int main() {
FIO;
cin >> n;
rep(i, 1, n) cin >> x[i];
cin >> L >> Q;
init();
while(Q--) {
int u, v;
cin >> u >> v;
if(u > v) swap(u, v);
int ans = 0;
for(int i = 20; i >= 0; --i) {
if(r[u][i] < v) {
ans += (1 << i);
u = r[u][i];
}
}
cout << ans+1 << '\n';
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}
ll N, M;
vector<int> to[100010];
int idx[100010];
int edge[100010];
int node[100010];
int oe[100010];
int judge[100010];
int es[200010];
ll ans = 0;
void dfs(int v, int id, int type){
idx[v] = id;
node[id]++;
oe[v] = type;
for(auto u : to[v]){
if(idx[u] != 0){
if(oe[u] == type) judge[id] = true;
}else{
dfs(u, id, (type + 1) & 1);
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M;
ans = N * N;
for(int i = 0; i < M; i++){
int u, v;
cin >> u >> v;
es[i] = u;
to[u].emplace_back(v);
to[v].emplace_back(u);
}
int id = 1;
for(int i = 1; i <= N; i++){
if(idx[i] == 0) dfs(i, id++, 0);
}
for(int i = 0; i < M; i++){
edge[idx[es[i]]]++;
}
ll nsum = 0, graph = 0, oc = 0;
for(int i = 1; i < id; i++){
if(node[i] == 1) continue;
nsum += node[i];
graph++;
if(!judge[i]) oc++;
}
cout << ans - (nsum * nsum) + (graph * graph) + (oc * oc) << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=100010;
bool w[N],v[N];
int fa[N],sz[N];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
}
inline int find(int x,int &y) {
if(fa[x]==x) return x;
fa[x]=find(fa[x],y);
return v[x]^=y,y=v[x],fa[x];
}
int main() {
int n,m,A=0,B=0,C=0;
cin>>n>>m;
for(int i=1;i<=n;i++) fa[i]=i,sz[i]=1;
for(int i=1;i<=m;i++) {
int X=0,Y=0,x=find(gi(),X),y=find(gi(),Y);
if(x!=y) fa[x]=y,v[x]=X^Y^1,w[y]|=w[x],sz[y]+=sz[x];
else w[x]|=X^Y^1;
}
for(int i=1;i<=n;i++)
if(fa[i]==i) {
if(sz[i]==1) ++A;
else if(w[i]) ++B;
else ++C;
}
cout<<B+C+C+2LL*B*C+2LL*C*(C-1)+2LL*A*n-1LL*A*A+1LL*B*(B-1);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n,q;
cin >> n >> q;
string s;
cin >> s;
vector<int> sum(n+1);
vector<int> l(q),r(q);
rep(i,q) cin >> l[i] >> r[i];
sum[0] = 0;
for(int i=1; i<s.size(); i++){
if(s[i-1]=='A' && s[i]=='C') sum[i+1]=sum[i]+1;
else
sum[i+1] = sum[i];
}
for(int i=0; i<q; i++){
int ans = sum[r[i]]-sum[l[i]];
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <map>
#include <set>
using namespace std;
int main()
{
for(;;){
int n;
cin >> n;
if(n==0) break;
multimap< double,set<string> > list;
for(int i=0; i<n; i++){
string name;
int p,a,b,c,d,e,f,s,m;
cin >> name >> p >> a >> b >> c >> d >> e >> f >> s >> m;
int num = f + f * (m-1);
int time = a + b + c + (d + e) * m;
double value = (num * s - p) / (double)time;
multimap< double,set<string> >::iterator it = list.find(value);
if(it != list.end()){
(*it).second.insert(name);
}else{
set<string> s;
s.insert(name);
list.insert(make_pair< double,set<string> >(value,s));
}
}
multimap< double,set<string> >::reverse_iterator rit = list.rbegin();
while(rit != list.rend()){
for(set<string>::iterator it = (*rit).second.begin(); it != (*rit).second.end(); it++){
cout << (*it) << endl;
}
rit++;
}
cout << "#" << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
multiset<int> s;
int main() {
int n;
cin >> n;
s.clear();
for (int i = 1; i <= n; i++) {
int tmp;
scanf("%d", &tmp);
auto id = s.lower_bound(tmp);
if (id != s.begin()) s.erase(--id);
s.insert(tmp);
}
cout << s.size();
} | #include <iostream>
#include <math.h>
using namespace std;
int main(void){
int X;
cin >> X;
X = pow(X, 3);
cout << X << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int n, k;
string s[][7] = {{"aacd","bbcd","cdaa","cdbb"}, {"aa.ab",".bbab","a.cca","a.a.a","bbabb"}, {"aacd..","bbcd..","cd..aa","cd..bb","..aacd","..bbcd"},{"aacd...","bbcd...","cd.aa..","cd...bb","..a.baa","..a.b.b","..bbaab"}};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
k = n%4;
if(n < 3) cout << -1 << '\n';
else if(n == 3) cout << "aab\nb.b\nbaa\n";
else rep(i,n){
string b(n,'.');
if(i<n-k-4) b.replace(i/4*4,4,s[0][i%4]);
else b.replace(n-k-4,k+4,s[k][i-n+k+4]);
cout << b << '\n';
}
} | #include<bits/stdc++.h>
using namespace std;
const int N = 1003;
int n;
char ans[N][N];
char m4[4][5] = {
"aacd",
"bbcd",
"cdaa",
"cdbb"
};
char m5[5][6] = {
"aabbc",
"hii.c",
"h..jd",
"g..jd",
"gffee"
};
char m6[6][7] = {
"aacd..",
"bbcd..",
"..aacd",
"..bbcd",
"ab..aa",
"ab..bb"
};
char m7[7][8] = {
"aabbcc.",
"dd.dd.a",
"..d..da",
"..d..db",
"dd.dd.b",
"..d..dc",
"..d..dc",
};
char get(int x, int y, int type) {
switch (type) {
case 0 : return m4[x][y];
case 1 : return m5[x][y];
case 2 : return m6[x][y];
case 3 : return m7[x][y];
default : return '.';
}
}
int main() {
memset(ans, '.', sizeof(ans));
scanf("%d", &n);
if(n == 2) {printf("-1\n"); return 0;}
else if(n == 3) {printf("aa.\n..a\n..a"); return 0;}
for(int i = 0; i < 4 + n % 4; i++)
for(int j = 0; j < 4 + n % 4; j++)
ans[n - n % 4 - 4 + i][n - n % 4 - 4 + j] = get(i, j, n % 4);
for(int k = 0; k * 4 < n / 4 * 4 - 4; k++)
for(int i = 0; i < 4; i++)
for(int j = 0; j < 4; j++)
ans[4 * k + i][4 * k + j] = get(i, j, 0);
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++)
printf("%c", ans[i][j]);
printf("\n");
}
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
#include<set>
#define MAX 30
#include<string>
#include<vector>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int k;
cin>>k;
vector<string> vec;
vector<int> ind;
set<string> st;
bool isDone[10001];
for(int i=0;i<10001;i++){
isDone[i] = false;
}
for(int i=0;i<n;i++){
string s;
cin>>s;
vec.push_back(s);
ind.push_back(i);
}
sort(vec.begin(),vec.end());
// cout<<"---"<<endl;
do{
int hash = 0;
for(int i=0;i<k;i++){
hash = hash*10 + ind[i];
}
if(isDone[hash]) continue;
isDone[hash] = true;
string t="";
for(int i=0;i<k;i++){
t+=vec[ind[i]];
}
st.insert(t);
// cout<<"------"<<endl;
}while(next_permutation(ind.begin(),ind.end()));
cout<<st.size()<<endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int n,k,a[10],power[6];
vector<string>vec;
int main(){
while(true){
cin>>n>>k;vec.clear();power[0]=1;for(int i=1;i<5;i++)power[i]=power[i-1]*n;
if(n==0 && k==0)break;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<power[k];i++){
int bit[4];for(int j=0;j<k;j++)bit[j]=(i/power[j])%n;
bool OK=true;
if(k==2 && (bit[0]==bit[1]))OK=false;
if(k==3 && (bit[0]==bit[1] || bit[0]==bit[2] || bit[1]==bit[2]))OK=false;
if(k==4 && (bit[0]==bit[1] || bit[0]==bit[2] || bit[1]==bit[2]))OK=false;
if(k==4 && (bit[0]==bit[3] || bit[1]==bit[3] || bit[2]==bit[3]))OK=false;
if(OK==true){
string S="";
for(int j=0;j<k;j++)S+=to_string(a[bit[j]]);
vec.push_back(S);
}
}
sort(vec.begin(),vec.end());int cnt=1;
for(int i=1;i<vec.size();i++){
if(vec[i-1]!=vec[i])cnt++;
}
cout<<cnt<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//cout << fixed << setprecision(10);//
//最小公倍数//
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
//逆元mod(mを法とするaの逆元)//
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
//Cmonp//
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//nが大
ll com(ll n,ll m){
if(n<=0 || m<=0 || n==m){
return 1;
}
if(n<m){
return 0;
}
ll k=1;
for(ll i=1;i<=m;i++){
k*=(n-i+1);
k%=MOD;
k*=modinv(i,MOD);
k%=MOD;
}
return k;
}
////////////////////////////////////////////////////////////////////
int main() {
ll n,m,k;
cin>>n>>m>>k;
ll ml=com(n*m-2,k-2);
ll ans=0;
for(int i=1;i<=n-1;i++){
ans+=i*m*m*(n-i);
ans%=MOD;
}
for(int i=1;i<=m-1;i++){
ans+=i*n*n*(m-i);
ans%=MOD;
}
ans*=ml;
ans%=MOD;
cout<<ans<<endl;
return 0;
}
| #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
long long n, m, k; cin >> n >> m >> k;
COMinit();
long long ans = 0;
for (int i=0; i < n; ++i) {
for (int j=0; j < m; ++j) {
if (i * j == 0) {
ans += (((n - i) * (m - j)) % MOD) * (i + j);
} else {
ans += 2 * ((((n - i) * (m - j)) % MOD) * (i + j) % MOD);
}
ans %= MOD;
}
}
cout << (ans * COM(n*m-2, k-2)) % MOD << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int n;
cin>>n;
cout<<(n-2)*180<<endl;
}
signed main(){
//while(1)
solve();
} | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Int = long long;
//INT_MAX = 2147483647;
//LLONG_MAX = 9223372036854775807;
//ULLONG_MAX = 18446744073709551615;
const int MOD = 1000000007;
const ll INF = numeric_limits<ll>::max();
const int inf = 1e8;
typedef pair<int,int> P;
typedef std::priority_queue<int> IntPrioQueue;
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue;
//少数点表示
//cout << std::fixed << std::setprecision(14) << 値
int main(){
cin.tie( 0 ); ios::sync_with_stdio( false );
string ans="";
ll n,m;
cin >> n;
m = n;
while(m>0){
m--;
char s = 'a'+ m%26;
ans.push_back(s);
m /= 26;
}
reverse(ans.begin(),ans.end());
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for(int i = 0; i < h; i++) cin >> a.at(i);
vector<vector<int>> check(h, vector<int>(w));
int ans = -1;
queue<pair<int, int>> bfs;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(a.at(i).at(j) == '.') continue;
bfs.push({i, j});
check.at(i).at(j) = 1;
}
}
vector<int> dx = {0, 0, -1, 1}, dy = {1, -1, 0, 0};
while(bfs.size() > 0){
ans++;
queue<pair<int, int>> next;
while(bfs.size() > 0){
next.push(bfs.front());
bfs.pop();
}
while(next.size() > 0){
int y = next.front().first, x = next.front().second;
next.pop();
for(int i = 0; i < 4; i++){
int nx = x + dx.at(i), ny = y + dy.at(i);
if(nx < 0 || nx >= w || ny < 0 || ny >= h) continue;
if(check.at(ny).at(nx)) continue;
check.at(ny).at(nx) = 1;
bfs.push({ny, nx});
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int H, W, ans=1; cin >> H >> W; string A[H];
REP(i, H){ cin >> A[i]; }
int B[H][W]={}; vector< pair<int, int> > C;
REP(i, H){ REP(j, W){
if(A[i][j]=='#'){ B[i][j]=1; C.push_back(make_pair(i, j)); }
} }
REP(i, H*W){
if((int)C.size()==H*W){ cout << ans-1 << "\n"; return 0; }
int a=C[i].first, b=C[i].second, c=B[a][b]+1;
if(a>0&&!B[a-1][b]){ B[a-1][b]=c; C.push_back(make_pair(a-1, b)); }
if(b>0&&!B[a][b-1]){ B[a][b-1]=c; C.push_back(make_pair(a, b-1)); }
if(a<H-1&&!B[a+1][b]){ B[a+1][b]=c; C.push_back(make_pair(a+1, b)); }
if(b<W-1&&!B[a][b+1]){ B[a][b+1]=c; C.push_back(make_pair(a, b+1)); }
ans=c;
}
} | 1 |
// REDO
#include <iostream>
using namespace std;
int main() {
int N, x;
cin >> N >> x;
long long cnt = 0, b = 0, a;
for (int i = 0; i < N; ++i) {
cin >> a;
if (a > x) {
cnt += a - x;
a = x;
}
if (b + a > x) {
cnt += b + a - x;
b = x - b;
} else {
b = a;
}
}
cout << cnt << endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a[4],e,f;
for(int i=0;i<4;i++){
cin>>a[i];
}
cin>>f>>e;
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(a[j]<a[j+1]){
swap(a[j],a[j+1]);
}
}
}
if(e<f){
swap(e,f);
}
cout<<a[0]+a[2]+a[1]+e<<endl;
return 0;
} | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
const int MAX= 10000100;
#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()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}
int m[100][100];
int sx,sy,gx,gy;
int w,h;
bool dfs(int x,int y,int c){
if(x==gx&&y==gy)return true;
if(m[y][x] == 0)return false;
m[y][x] = 0;
//cout<<x<<" "<<y<<" "<<c<<endl;
int dx[] = {0,0,-1,1}, dy[] = {1,-1,0,0};
bool judge=false;
rep(i,4){
if(m[y+dy[i]][x+dx[i]] == c)
judge |= dfs(x+dx[i],y+dy[i],c);
}
return judge;
}
int main(void){
while(cin>>h>>w,h+w){
rep(i,h)rep(j,w)m[i][j]=0;
cin>>sx>>sy>>gx>>gy;
int n,c,d,x,y;
cin>>n;
rep(i,n){
cin>>c>>d>>x>>y;
//cout<<c<<" "<<d<<" "<<x<<" "<<y<<endl;
if(d){
rep(i,4)rep(j,2)m[i+y][j+x] = c;
}else{
//cout<<x<<" "<<y<<endl;
rep(i,2)rep(j,4)m[i+y][j+x] = c;
}
}
//m[sy][sx] = 8; m[gy][gx] = 9;
//cout<<" ";rep(i,w)cout<<i%10<<" ";cout<<endl;
//rep(i,h){cout<<i%10<<" ";rep(j,w)cout<<m[i][j]<<" ";cout<<endl;}
cout<<(dfs(sx,sy,m[sy][sx])?"OK":"NG")<<endl;
}
} | #include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <numeric>
using namespace std;
typedef unsigned int UI;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef istringstream ISS;
typedef ostringstream OSS;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define EACH( v, c ) for ( auto &v : c )
#define ITER( c ) __typeof( (c).begin() )
#define IREP( c, it ) for ( ITER(c) it = c.begin(); it != c.end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl
const int dir[][2] = {
1, 0,
0, 1,
-1, 0,
0, -1
};
string solve( VVI board, int sy, int sx, int gy, int gx )
{
const int H = board.size(), W = board[0].size();
int color = board[ sy ][ sx ];
queue< PII > que;
que.push( MP( sy, sx ) );
set< PII > visited;
visited.insert( MP( sy, sx ) );
while ( !que.empty() )
{
auto cur = que.front();
que.pop();
if ( cur == MP( gy, gx ) )
{
return "OK";
}
REP( d, 0, 4 )
{
auto next = cur;
next.fst += dir[d][0];
next.snd += dir[d][1];
if ( !( 0 <= next.fst && next.fst < H && 0 <= next.snd && next.snd < W ) ||
EXIST( visited, next ) ||
board[ next.fst ][ next.snd ] != color )
{
continue;
}
que.push( next );
visited.insert( next );
}
}
return "NG";
}
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
while ( true )
{
int w, h;
cin >> w >> h;
if ( !( w | h ) )
{
break;
}
int sx, sy, gx, gy, n;
cin >> sx >> sy >> gx >> gy >> n;
sx--;
sy--;
gx--;
gy--;
VVI board( h, VI( w, 0 ) );
REP( i, 0, n )
{
int c, d, x, y;
cin >> c >> d >> x >> y;
x--;
y--;
if ( !d )
{
REP( j, 0, 2 )
{
REP( k, 0, 4 )
{
board[ y + j ][ x + k ] = c;
}
}
}
else
{
REP( j, 0, 4 )
{
REP( k, 0, 2 )
{
board[ y + j ][ x + k ] = c;
}
}
}
}
cout << solve( board, sy, sx, gy, gx ) << endl;
}
return 0;
} | 1 |
// #Sazaの1日1AC
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
const int INF=mod;
const double PI=3.14159265358979323846;
//マクロ
//型エイリアス
using ll = long long;
using P=pair<int, int>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
//ショートカット
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep2(i,k,n) for(int i = k; i < n; i++) //半開区間
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define mkp make_pair
//入力
#define vin(v,N) for(long long id=0;id<N;id++) cin>>v.at(id)
#define lin(n) long long n;cin>>n
#define chin(x) char x;cin>>x;
#define sin(s) string s;cin>>s;
#define vlin(v,N) vector<long long>v(N);for(long long i=0;i<N;i++)cin>>v.at(i)
//関数
//最大公約数
long long gcd(long long m, long long n){
long long a=max(m,n);
long long b=min(m,n);
long long r=a%b;
while(r!=0){
a=b; b=r; r=a%b;
}
return b;
}
// 最小公倍数
long long lcd(long long m, long long n){
return m*n/gcd(m,n);
}
//繰り返し二乗法
long long repeat_squaring(long long x, long long n){
if(n==0) return 1;
else if(n%2==0){
long long t=repeat_squaring(x,n/2);
return t*t%mod;
}
else
return x*repeat_squaring(x,n-1);
}
//素因数分解(mapで返す)
map<long long,long long> factor(long long p){
ll p1=p;
map<long long,long long>ret;
for(long long i=2;i*i<=p1;i++){
while(p%i==0){
ret[i]++;
p/=i;
}
}
if(p!=1)
ret[p]++;
return ret;
}
//素数判定
bool is_prime(long long N){
for(long long i=2;i*i<=N;i++){
if(N%i==0)
return false;
}
return true;
}
//最大値更新
void chmax(long long &a,long long b){
a=max(a,b);
}
//最小値更新
void chmin(long long &a,long long b){
a=min(a,b);
}
//構造体
/////////////////⊂('ω'⊂ )))Σ≡GO!/////////////////
int dh[] = {1, 0, -1, 0};
int dw[] = {0, 1, 0, -1};
int main(){
int H, W; cin >> H >> W;
vector<vector<char>> grid(H, vector<char>(W));
rep(i, H) rep(j, W) cin >> grid[i][j];
vector<vector<int>> table(H, vector<int>(W, -1));
queue<P> Q;
rep(i, H){
rep(j, W){
if(grid[i][j] == '#'){
Q.push(mkp(i, j));
table[i][j] = 0;
}
}
}
while(Q.size() > 0){
int h, w;
tie(h, w) = Q.front(); Q.pop();
rep(i, 4){
int nh = h + dh[i], nw = w + dw[i];
if(0 <= nh && nh < H && 0 <= nw && nw < W && table[nh][nw] == -1){
table[nh][nw] = table[h][w] + 1;
Q.push(mkp(nh, nw));
}
}
}
int res = -1;
rep(i, H){
rep(j, W){
res = max(res, table[i][j]);
//cout << table[i][j];
}
}
cout << res << endl;
}
| #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N,T;
cin >> N >> T;
int A[N],B[N];
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
int DP[N][T+1];
int invDP[N][T+1];
for (int i = 0; i <= T; i++) {
if (A[0] <= i) {
DP[0][i] = B[0];
} else {
DP[0][i] = 0;
}
}
for (int i = 0; i <= T; i++) {
if (A[N-1] <= i) {
invDP[N-1][i] = B[N-1];
} else {
invDP[N-1][i] = 0;
}
}
for (int i = 1; i < N; i++) {
for (int j = 0; j <= T; j++) {
if (A[i] > j) {
DP[i][j] = DP[i-1][j];
} else {
DP[i][j] = max(DP[i-1][j],DP[i-1][j-A[i]] + B[i]);
}
}
}
for (int i = N-2; i >= 0; i--) {
for (int j = 0; j <= T; j++) {
if (A[i] > j) {
invDP[i][j] = invDP[i+1][j];
} else {
invDP[i][j] = max(invDP[i+1][j],invDP[i+1][j-A[i]] + B[i]);
}
}
}
int ans = 0;
for (int i = 1; i < N-1; i++) {
int res = 0;
for (int j = 0; j <= T-1; j++) {
res = max(res,DP[i-1][j] + invDP[i+1][T-1-j]);
}
ans = max(ans,res+B[i]);
}
ans = max(ans,B[0] + invDP[1][T-1]);
ans = max(ans,B[N-1] + DP[N-2][T-1]);
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
using namespace std;
struct node{
int key;
node *p,*l,*r;
};
int n;
node *N;
void tree_insert(node *z){
node *y=NULL;
node *x=N;
while(x!=NULL){
y=x;
if(x->key>z->key)x=x->l;
else if(x->key<z->key)x=x->r;
}
z->p=y;
if(y==NULL)N=z;
else if(y->key<z->key)y->r=z;
else y->l=z;
}
node *find_num(int num){
node *x=N;
while(x!=NULL){
if(x->key==num){
return x;
}
if(x->key>num)x=x->l;
else x=x->r;
}
return x;
}
void tree_find(int num){
node *x=find_num(num);
if(x!=NULL)cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
void in(node *x){
if(x->l!=NULL)in(x->l);
cout<<" "<<x->key;
if(x->r!=NULL)in(x->r);
}
void pre(node *x){
cout<<" "<<x->key;
if(x->l!=NULL)pre(x->l);
if(x->r!=NULL)pre(x->r);
}
node* successor(node *z){
node *x;
x=z->r;
while(x->l!=NULL)x=x->l;
return x;
}
void tree_delete(node *z){
node *y;
if(z->l==NULL||z->r==NULL)y=z;
else y=successor(z);
node *x;
if(y->l!=NULL)x=y->l;
else x=y->r;
if(x!=NULL)x->p=y->p;
if(y->p==NULL) N=x;
else if(y==y->p->l)y->p->l=x;
else y->p->r=x;
if(y!=z) z->key=y->key;
delete(y);
}
void print(){
node *x=N;
in(x);
cout<<endl;
pre(x);
cout<<endl;
}
int main()
{
N=NULL;
cin>>n;
int i;
for(i=0;i<n;i++){
string s;
cin>>s;
if(s=="insert"){
int num;
cin>>num;
node *z=new node();
z->key=num;z->l=z->r=z->p=NULL;
tree_insert(z);
}
if(s=="find"){
int num;
cin>>num;
tree_find(num);
}
if(s=="print"){
print();
}
if(s=="delete"){
int num;
cin>>num;
node *z=find_num(num);
tree_delete(z);
}
}
return 0;
} | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
void dout() { cerr << '\n'; }
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
cerr << " " << H;
dout(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << #__VA_ARGS__, dout(__VA_ARGS__)
#else
#define dbg(...) ;
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;
const int N = 1003;
char ans[4][7][7], m[N][N];
string arr[4] = {"adeeadffbbghccgh",
"adf..adf..beehhb.giiccgjj",
"adgg..adhh..beii..be..jjcf..kkcf..ll",
"adg....adg....be.ii..be.jj..cff..llc.h..mm..hkknn"
};
void parse(int r) {
int a = 4 + r;
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
ans[r][i][j] = arr[r][i * a + j];
}
}
}
void spread(int x, int r) {
int a = 4 + r;
for (int i = x; i < x + a; i++) {
for (int j = x; j < x + a; j++) {
m[i][j] = ans[r][i - x][j - x];
}
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
for (int i = 0; i < 4; i++) {
parse(i);
}
int n;
cin >> n;
if (n <= 2) {
cout << -1;
return 0;
}
if (n == 3) {
cout << "acc\na.d\nbbd";
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
m[i][j] = '.';
}
}
int rem = n % 4;
spread(0, rem);
int times = (n - (4 + rem)) / 4, cur = 4 + rem;
while (times--) {
spread(cur, 0);
cur += 4;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << m[i][j];
}
cout << '\n';
}
}
| 0 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B;
cin >> A >> B;
int mx;
mx = std::max(A+B, std::max(A-B, A*B));
cout << mx << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
int tmp = A + B;
tmp = max(tmp, A - B);
tmp = max(tmp, A * B);
cout << tmp << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
const int mod = 998244353;
const int max_N = 305;
using LL = long long;
int n, K, a[max_N];
LL dp[max_N][max_N][max_N];
// 前 i 个空隙, 共 j 个 1, 用了 k 步
char s[max_N];
int main() {
scanf("%s", s);
n = 1;
for (int i = 0; i < max_N && s[i]; ++i) {
if (s[i] == '0') {
++n;
} else {
++a[n];
}
}
for (int i = 2; i <= n; ++i) {
a[i] += a[i - 1];
}
scanf("%d", &K);
K = std::min(K, a[n]);
dp[0][0][0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = a[i - 1]; j <= a[n]; ++j) {
for (int k = 0; k <= K; ++k) {
// 不移动 i, 且从后往 i 移动 m 步
for (int m = 0; j + a[i] - a[i - 1] + m <= a[n] && k + m <= K; ++m) {
int j1 = j + a[i] - a[i - 1] + m;
dp[i][j1][k + m] = (dp[i][j1][k + m] + dp[i - 1][j][k]) % mod;
}
// 移动 i, 且从 i 往前移动 m 步
for (int m = a[i] - a[i - 1]; m && j + a[i] - a[i - 1] - m <= a[n]; --m) {
int j1 = j + a[i] - a[i - 1] - m;
dp[i][j1][k] = (dp[i][j1][k] + dp[i - 1][j][k]) % mod;
}
}
}
}
/*
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= a[n]; ++j) {
for (int k = 0; k <= K; ++k) {
if (dp[i][j][k]) {
printf("dp[%d][%d][%d] = %lld\n", i, j, k, dp[i][j][k]);
}
}
}
}*/
LL ans = 0;
for (int k = 0; k <= K; ++k) {
ans = (ans + dp[n][a[n]][k]) % mod;
}
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << endl;}
#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,ll> P;
//ａをbで割る
long long mod_div(long long a,long long b){
if(a % b == 0)return a/b;
long long tmp = MOD - 2,c = b,ret = 1;
while(tmp > 0){
if(tmp & 1){
ret *= c;ret %= MOD;
}
c *= c;c %= MOD;tmp >>= 1;
}
return a*ret%MOD;
}
#define MAX_K 333333
vector<long long> kaijo(MAX_K);
long long combination(long long n, long long r){
if(n < r || n < 0 || r < 0)
return 0;
if(kaijo[0] != 1){
kaijo[0] = 1;
for(long long i = 1;i < MAX_K;i++)kaijo[i] = (kaijo[i-1] * i) % MOD;
}
long long ret = kaijo[n];
long long tmp = (kaijo[r] * kaijo[n-r]) % MOD;
return mod_div(ret,tmp);
}
ll mpow(ll a,ll b){
ll ret = 1;
ll tmp = a;
for(ll i = 0;i <= 60;i++){
if(b & (1LL << i)){
ret *= tmp;
ret %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ret;
}
ll comb[1111][1111];
ll dp[1111][1111];
int main(){
ll n,a,b,c,d;cin >> n >> a >> b >> c >> d;
dp[0][0] = 1;
REP(i,1111){
REP(j,1111){
if(j == 0 || i == j)comb[i][j] = 1;
else comb[i][j] = (comb[i-1][j] + comb[i-1][j-1]) % MOD;
}
}
REP(i,b+1){
REP(j,n+1)if(dp[i][j]){
dp[i+1][j] += dp[i][j];
dp[i+1][j] %= MOD;
if(i < a)continue;
ll kake = 1;
for(ll k = 1;k <= d;k++){
ll tmp = i * k;
if(j + tmp > n)break;
kake = (kake * comb[n-j-tmp+i][i]) % MOD;
kake = mod_div(kake, k);
if(k < c)continue;
dp[i+1][j+tmp] += (dp[i][j] * kake) % MOD;
dp[i+1][j+tmp] %= MOD;
}
}
}
SHOW2d(comb,10,10);
SHOW2d(dp,10,10);
cout << dp[b+1][n] << endl;
return 0;
}
| 0 |
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
int gcd(int a, int b) {
if(a < b) {
swap(a, b);
}
if(b < 1)
return -1;
if(a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N)
cin >> A[i];
if(A.size() == 1) {
if(A[0] != K) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << "POSSIBLE" << endl;
}
return 0;
}
sort(A.begin(), A.end());
if(A.back() < K) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
int gcd_val = A[0];
for(int i=1; i<N; ++i) {
gcd_val = gcd(gcd_val, A[i]);
}
rep(i, N) {
if(A[i] == K) {
cout << "POSSIBLE" << endl;
return 0;
}
if(A[i] < K) {
continue;
}
A[i] -= K;
if( A[i] % gcd_val == 0) {
cout << "POSSIBLE" << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
//素因数分解
template <typename T>
vector<pair<T, T>> prime_factor(T n) {
vector<pair<T, T>> ret;
T tmp=0;
if(n%2==0){
tmp=0;while(n%2==0){tmp++;n/=2;}
ret.push_back(make_pair(2, tmp));
}
if(n%3==0){
tmp=0;while(n%3==0){tmp++;n/=3;}
ret.push_back(make_pair(3, tmp));
}
for (T i=5;i*i<=n;i+=4) {
if(n%i==0){
tmp=0;while(n%i==0){tmp++;n/=i;}
ret.push_back(make_pair(i,tmp));
}
i+=2;
if(n%i==0){
tmp=0;while(n%i==0){tmp++;n/=i;}
ret.push_back(make_pair(i,tmp));
}
}
if(n!=1)ret.push_back(make_pair(n,1));
return ret;
}
int main(){
ll a,b;
in(a,b);
ll gcdv=__gcd(a,b);
vector<pair<ll,ll>> prime=prime_factor(gcdv);
out(prime.size()+1);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 最大公約数
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
// mod m におけるa の逆元
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
// 素因数分解
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N; cin >> N;
vector<ll> a(N + 1); rep1(i, N) cin >> a[i];
vector<ll> b(N + 1, 0);
ll ans = 0;
bool ok = true;
for(ll i = N; i > 0; i--) {
ll cnt = 0;
for(ll j = i; j <= N; j += i) {
cnt += b[j];
}
b[i] = (cnt + a[i]) % 2 ;
// cerr << i << "]" << cnt << "->" << b[i] << endl;
ans += b[i];
}
cout << ans << endl;
if(ans > 0) {
rep1(i, N) {
if(b[i] == 1) cout << i << " " ;
}
cout << endl;
}
}
int main(void)
{
// ll t; cin >> t; rep(i, t)
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
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 int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
vector<ll> enum_divisors(ll n){
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0){
res.push_back(i);
if (n/i != i) res.push_back(n/i);
}
}
sort(res.begin(), res.end());
return res;
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> sum(n+1, 0);
vector<int> num(n+1, -1);
vector<int> res;
for (int i = n-1; i >= 0; --i) {
int tmp;
if (sum[i+1] % 2 != a[i]) {
tmp = 1;
} else {
tmp = 0;
}
if (num[i+1] != -1 && num[i+1] != tmp) {
cout << -1 << endl;
return 0;
}
num[i+1] = tmp;
if (tmp == 1) {
res.push_back(i+1);
auto V = enum_divisors(i+1);
for (auto v : V) {
sum[v]++;
}
}
}
cout << res.size() << endl;
for (auto v : res) {
cout << v << endl;
}
} | 1 |
/**
* @FileName a.cpp
* @Author kanpurin
* @Created 2020.08.18 17:43:20
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int m;cin >> m;
ll total = 0;
ll ans = 0;
for (int i = 0; i < m; i++) {
ll d,c;cin >> d >> c;
ans += c;
total += (d * c - 1) % 9 + 1;
ans += (d * c - 1) / 9;
}
ans += (total - 1) / 9;
cout << ans - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define FORV(i, v) for (auto i = v.begin(); i != v.end(); i++)
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
const ll INF = 1e9;
const long long INFL = 1LL<<60;
int main() {
int m;
cin >> m;
map<ll, ll> mp;
rep(i, m) {
ll d, c;
cin >> d >> c;
mp[d] += c;
}
ll ans = 0;
bool flag = true;
while (flag) {
flag = false;
rep(i, 10) {
if (mp[i] > 1) flag = true;
ll num = mp[i] / 2;
ans += num;
mp[i] -= num * 2;
if (i + i < 10) mp[i+i] += num;
else {
mp[1] += num;
mp[(i + i) % 10] += num;
}
}
}
vector<ll> a;
rep(i, 10) {
if (mp[i] != 0) a.push_back(i);
}
while (a.size() > 1) {
int x = a.back(); a.pop_back();
int y = a.back(); a.pop_back();
if (x + y < 10) a.push_back(x + y);
else {
a.push_back(1);
a.push_back((x + y) % 10);
}
ans++;
}
cout << ans << endl;
return 0;
}
| 1 |
#include<stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r){
int tmp,x = A[r];
int j,i = p - 1;
for (j = p; j < r; j++){
if (A[j] <= x){
i = i + 1;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i + 1;
}
int main(){
int i,j;
scanf("%d", &n);
for (i = 0; i < n; i++){
scanf("%d", &A[i]);
}
j = partition(0, n-1);
for (i = 0; i < n; i++){
if (i){
printf(" ");
}
if (i == j){
printf("[%d]", A[i]);
}
else{
printf("%d", A[i]);
}
}
printf("\n");
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int partition(vector<int>& A, int p, int r){
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= A[r]) {
i++;
swap(A[i], A[j]);
}
}
i++;
swap(A[i], A[r]);
return i;
}
int main(){
int n;
cin >> n;
vector<int> A(n);
for (auto& a : A) cin >> a;
int pos = partition(A, 0, n - 1);
for (int i = 0; i < pos; i++) {
cout << A[i] << " ";
}
cout << "[" << A[pos] << "] ";
for (int i = pos + 1; i < n; i++) {
cout << A[i] << (i < n - 1 ? " " : "\n");
}
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
template <typename T>
struct RUQ //calculateはminimum
{
int n;
const T ex = 1 << 30; //dat 初期値(minなので)
const T em = 1 << 30; //lazy 初期値(minなので)
vector<T> dat, lazy; //tree本体
RUQ(vector<T> v){
int x = 1;
int i;
n = v.size();
while(x < n) x <<= 1;
n = x;
dat.resize(2*n-1, ex);
lazy.resize(2*n-1, em);
for(i = 0;i < v.size();++i){
dat[i + n - 1] = v[i];
}
for(i = n-2;i >= 0;--i){
dat[i] = calculate(dat[2*i+1], dat[2*i+2]);
}
}
T calculate(T a, T b){
return min(a, b); //minで使う
}
void eval(int now){
if(lazy[now] == em) return;
if(now < n - 1){ //最小値なのでそのまま代入
lazy[2*now + 1] = lazy[now];
lazy[2*now + 2] = lazy[now];
}
dat[now] = lazy[now];
lazy[now] = em;
}
void update(int a, int b, T x, int now, int l, int r){
eval(now);
if(a <= l && r<= b){
lazy[now] = x; //上から書き換える。最小値なので代入する
eval(now);
}else if(a < r && l < b){
update(a, b, x, 2*now + 1, l, (l + r)/2);
update(a, b, x, 2*now + 2, (l + r)/2, r);
dat[now] = calculate(dat[2*now + 1], dat[2*now + 2]);
}
}
void update(int a, int b, T x){update(a, b, x, 0, 0, n);}
T query(int a, int b){return query_sub(a, b, 0, 0, n);}
T query_sub(int a, int b, int now, int l, int r){
eval(now);
if(r <= a || b <= l) return ex;
else if(a <= l && r <= b) return dat[now];
else{
T vl = query_sub(a, b, 2*now + 1, l, (l + r)/2);
T vr = query_sub(a, b, 2*now + 2, (l + r)/2, r);
return calculate(vl, vr);
}
}
inline T operator[](int a) { return query(a, a + 1); }
void print() {
for (int i = 0; i < 2 * n - 1; ++i) {
cout << (*this)[i];
if (i != n) cout << ",";
}
cout << endl;
}
};
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
int i;
int h,w;
cin >> h >> w;
vector<int> v(w, 0);
const int INF = 1e9;
set<int> st;
rep(i,w) st.insert(i);
RUQ<int> ruq(v);
rep(i,h){
int a,b;
cin >> a >> b;
--a; --b;
auto x = st.lower_bound(a);
auto y = st.upper_bound(b);
if(x == y){
ruq.update(a, b+1, INF);
int ans = ruq.query(0, w);
if(ans == INF) cout << -1 << endl;
else cout << ans + i + 1 << endl;
}else if(b+1 == w){
st.erase(x, y);
ruq.update(a, b+1, INF);
int ans = ruq.query(0, w);
if(ans == INF) cout << -1 << endl;
else cout << ans + i + 1 << endl;
}else{
auto it = prev(y);
int ind = *it;
st.erase(x, y);
st.insert(b+1);
int tmp = ruq.query(ind, ind+1) + (b + 1 - ind);
ruq.update(b+1, b+2, min(tmp, ruq.query(b+1, b+2)));
ruq.update(a, b+1, INF);
int ans = ruq.query(0, w);
if(ans == INF) cout << -1 << endl;
else cout << ans + i + 1 << endl;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef pair<long,long> P;
int main(){
long H,W;cin>>H>>W;
set<P> S,T;
for(long i=0;i<W;i++){S.insert(P(i,0));T.insert(P(0,i));}
for(long k=0;k<H;k++){
long a,b;cin>>a>>b;a--;
long y=LONG_MAX;
for(auto itr=S.lower_bound(P(a,-1));itr!=S.end()&&(itr->first)<b;){
P x=*itr;
y=min(y, x.second+b-x.first);
T.erase(P(x.second,x.first));
itr=S.erase(itr);
}// ゴール: 移動回数 i,jとして, b, j+b-i, このうち, 最も移動回数が少ないものだけ残す
if(y!=LONG_MAX&&b<W){S.insert(P(b,y)); T.insert(P(y,b));}
cout<<(T.size()?(T.begin()->first)+k+1:-1)<<endl;
}
}
/*
S: ゴール, 何回の移動でいけるか
T: 何回の移動でいけるか, ゴール
T.begin()を持って来ればいける
Sで更新を素早くみる
*/ | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string a;
int num[101],cou=0,ans;
while(cin>>a){
for(int i=0;i<a.size();i++){
if(a[i]=='I')num[i]=1;
if(a[i]=='V')num[i]=5;
if(a[i]=='X')num[i]=10;
if(a[i]=='L')num[i]=50;
if(a[i]=='C')num[i]=100;
if(a[i]=='D')num[i]=500;
if(a[i]=='M')num[i]=1000;
}
ans=num[a.size()-1];
for(int i=a.size()-1;i>0;i--){
if(num[i]>num[i-1])ans=ans-num[i-1];
if(num[i]<=num[i-1])ans=ans+num[i-1];
}
cout<<ans<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int convert( char c )
{
switch ( c )
{
case 'I': return 1;
case 'V': return 5;
case 'X': return 10;
case 'L': return 50;
case 'C': return 100;
case 'D': return 500;
case 'M': return 1000;
}
}
int main( void )
{
string input;
int answer, prev;
while ( cin >> input )
{
answer = 0;
prev = 0;
for ( string ::reverse_iterator it = input.rbegin(); it != input.rend(); it++ )
{
int next = convert( *it );
if ( prev <= next )
{
answer += next;
}
else
{
answer -= next;
}
prev = next;
}
cout << answer << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define re register
#define SIZE 10005
#define LL long long
#define MOD 1000000007
using namespace std;
string k;
int d;
int maxn[SIZE],cnt;
LL dp[SIZE][105];
inline LL dfs(int pos,int sta,bool lim)
{
if(pos>cnt)
return sta==0?1:0;
if(!lim && dp[pos][sta]!=-1)
return dp[pos][sta];
int up=lim?maxn[pos]:9;
LL ret=0;
for(re int i=0;i<=up;++i)
ret=(ret+dfs(pos+1,(sta+i)%d,lim&&(i==maxn[pos])))%MOD;
if(!lim)
dp[pos][sta]=ret;
return ret;
}
inline LL work()
{
memset(dp,-1,sizeof(dp));
cnt=k.size()-1;
for(re int i=0;i<=cnt;++i)
maxn[i]=k[i]-'0';
return dfs(0,0,1);
}
int main()
{
cin>>k;
cin>>d;
LL ans=(work()-1+MOD)%MOD;
printf("%lld\n",ans);
return 0;
}
//3373 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
bool Check(ll num, ll pos) {
return (bool)(num & (1LL << pos));
}
long long int sumXOR(ll arr[], int n)
{
long long int sum = 0;
for (int i = 0; i <=60; i++)
{
// Count of zeros and ones
long long zc = 0, oc = 0;
// Individual sum at each bit position
long long int idsum = 0;
for (int j = 0; j < n; j++)
{
/* if (arr[j] % 2 == 0)
zc++;
else
oc++;
arr[j] /= 2;*/
if(Check(arr[j],i))zc++;
else oc++;
}
// calculating individual bit sum
idsum = (oc * ((zc * ((1ll << i)%Mod))%Mod))%Mod;
// final sum
sum =(sum+ idsum)%Mod;
}
return sum%Mod;
}
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;
bool flag=false;
string str;
cin>>n;
long long ara[n+2];
for(i=0; i<n; i++)
cin>>ara[i];
cout<<sumXOR(ara,n)<<endl;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int N = 0, M = 0;
int points[1001];
int scores[1002001];
bool check(int a, int c){
if(a >= (N + 2) * (N + 1) / 2 - 1){
return true;
}
return (scores[a] <= c && scores[a + 1] > c);
}
int search2(int a, int b, int c){
int pib = a + b - b / 2;
if(check(pib, c)){
return pib;
}else if(scores[pib] < c){
return search2(pib, b / 2, c);
}else{
return search2(a, b / 2, c);
}
}
int main(){
for(;;){
for(int i = 0; i < 1001; i++){
points[i] = 0;
}
for(int i = 0; i < 1002001; i++){
scores[i] = 0;
}
if(cin >> N){
if(N == 0){
break;
}
cin >> M;
for(int i = 1; i <= N; i++){
cin >> points[i];
}
for(int i = 0; i <= N; i++){
for(int j = i; j <= N; j++){
scores[(2 * N - i + 1) * i / 2 + j] = points[i] + points[j];
}
}
int mxsco = 0;
sort(scores, scores + ((N + 2) * (N + 1)) / 2);
for(int i = 0; i < (N + 2) * (N + 1) / 2; i++){
if(scores[i] > M){
break;
}
int nosco = scores[i] + scores[search2(0, (N + 2) * (N + 1) / 2, M - scores[i])];
if(nosco >= mxsco && nosco <= M){
mxsco = nosco;
}
}
cout << mxsco << endl;
}else{
break;
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m&&!(n==0&&m==0)){
int scores[1001];
vector<int> comb;
for(int i = 0; i < n; i++){
cin>>scores[i];
}
scores[n]=0;
for(int i = 0; i < n+1; i++){
for(int j = 0; j < n+1; j++){
int sum=scores[i]+scores[j];
if(sum<=m)
comb.push_back(sum);
}
}
sort(comb.begin(),comb.end());
comb.erase(unique(comb.begin(),comb.end()));
int maxNum=0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
int left = (scores[i]+scores[j]);
if(left<=m&&comb[0]+left<=m){
vector<int>::iterator it = lower_bound(comb.begin(),comb.end(),m-left);
if(it==comb.end()){
maxNum=max(maxNum,comb[comb.size()-1]+left);
}
else{
if(*it==(m-left)){
maxNum=m;
}
else{
it--;
maxNum=max(maxNum,*it+left);
}
}
}
}
}
cout<<maxNum<<endl;
}
return 0;
} | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
int n,m;
ll x,sum,ans;
map<ll,int>mmp;
int main()
{
scanf("%d%d",&n,&m);
sum=0;
ans=0;
for(int i=0;i<n;i++)
{
scanf("%lld",&x);
sum+=x;
ans+=mmp[sum%m];
if(sum%m==0) ans++;
mmp[sum%m]++;
}
printf("%lld\n",ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int n,q;
int c[500005],pre[500005],ans[500005];
vector<pair<int,int>> qs[500005];
int bit[2000005];
int sum(int pos){
int res=0;
while(pos>0){
res+=bit[pos];
pos-=pos&-pos;
}
return res;
}
void add(int pos,int val){
while(pos<=n){
bit[pos]+=val;
pos+=pos&-pos;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>q;
for(int i=1;i<=n;i++)cin>>c[i];
for(int i=1;i<=q;i++){
int l,r;
cin>>l>>r;
qs[r].emplace_back(l,i);
}
for(int i=1;i<=n;i++){
add(i,1);
if(pre[c[i]])add(pre[c[i]],-1);
pre[c[i]]=i;
for(pair<int,int> &p:qs[i]){
ans[p.second]=sum(i)-sum(p.first-1);
}
}
for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define P pair<int,int>
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
const int MAXN = 1010;
const int MAXV = MAXN*(MAXN-1)/2;
vint to[MAXV];
int id[MAXN][MAXN];
bool visited[MAXV];
int dp[MAXV];
bool calculated[MAXV];
int dfs(int a){
if(visited[a]){
if(!calculated[a]){
return -1;
}
return dp[a];
}
visited[a] = true;
dp[a] = 1;
for(int p:to[a]){
int u = dfs(p);
if(u == -1){
return -1;
}
dp[a] = max(dp[a],u+1);
}
calculated[a] = true;
return dp[a];
}
int toID(int a,int b){
if(a < b) swap(a,b);
return id[a][b];
}
signed main(){
int n;
cin >> n;
vvint A(n,vint(n-1));
rep(i,0,n){
rep(j,0,n-1){
cin >> A[i][j];
A[i][j]--;
}
}
int v = 0;
rep(i,0,n){
rep(j,0,n){
if(i > j){
id[i][j] = v;
v++;
}
}
}
rep(i,0,n){
rep(j,0,n-1){
A[i][j] = toID(i,A[i][j]);
}
}
rep(i,0,n){
rep(j,0,n-2){
to[A[i][j+1]].push_back(A[i][j]);
}
}
int ans = 0;
rep(i,0,v){
int res = dfs(i);
if(res == -1){
cout << -1 << endl;
return 0;
}
ans = max(ans,res);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
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; }
//Write From this Line
int main()
{
int n;
cin >> n;
vector<vector<int>> a(n, vector<int> (n-1));
rep(i,n){
rep(j,n-1){
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i].begin(), a[i].end());
}
vector<P> q;
auto check = [&](int i){
if(a[i].size() == 0) return;
int j = a[i].back();
if(a[j].size() == 0) return;
if(a[j].back() == i){
P p(i,j);
if(p.second < p.first) swap(p.first, p.second);
q.push_back(p);
}
};
rep(i,n){
check(i);
}
int day = 0;
while(q.size() > 0){
day++;
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
vector<P> prevQ;
swap(prevQ, q);
for(P p: prevQ){
int i = p.first, j = p.second;
a[i].pop_back();
a[j].pop_back();
}
for(P p: prevQ){
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i,n){
if(a[i].size() != 0){
cout << -1 << endl;
return 0;
}
}
cout << day << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i<k;i++)
int w,h,xs,ys,xg,yg,n;
int m[102][102];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool DFS(int x,int y,int c){
if(m[x][y]!=c)return false;
if(x==xg && y == yg)return true;
m[x][y]=-1;
bool ans =false;
rep(i,0,4){
ans = max(ans,DFS(x+dx[i],y+dy[i],c));
}
return ans;
}
int main(){
cin >>w>>h;
while(w!=0){
cin>>xs>>ys>>xg>>yg>>n;
xs++;
ys++;
xg++;
yg++;
rep(i,0,102)rep(j,0,102)m[i][j]=-1;
rep(i,0,n){
int c,d,x,y;
cin >>c>>d>>x>>y;
x++;
y++;
if(d==0){
rep(j,x,x+4)rep(k,y,y+2)m[j][k]=c;
}else{
rep(j,x,x+2)rep(k,y,y+4)m[j][k]=c;
}
}
string ans[2]={"NG","OK"};
if(m[xs][ys]==-1)cout <<"NG"<<endl;
else cout << ans[DFS(xs,ys,m[xs][ys])]<<endl;
cin >> w>>h;
}
return 0;
}
| #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
//const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
class MatrixSum {
vector<vector<ll>> sum;
public:
MatrixSum(ll x, ll y) {
sum = vector<vector<ll>>(x, vector<ll>(y));
}
void add(ll x, ll y) {
sum[x][y]++;
}
ll get(ll x, ll y) {
if (x == -1 || y == -1) {
return 0;
}
if (x == sum.size() || y == sum[x].size()) {
return 0;
}
return sum[x][y];
}
void setUp() {
for (ll x = 0; x < sum.size(); x++) {
for (ll y = 0; y < sum[x].size(); y++) {
sum[x][y] += get(x - 1, y) + get(x, y - 1) - get(x - 1, y - 1);
}
}
}
ll getSum(ll xs, ll ys, ll xe, ll ye) {
return get(xe, ye) - get(xs - 1, ye) - get(xe, ys - 1) + get(xs - 1, ys - 1);
}
};
int main() {
int h, w, q;
cin >> h >> w >> q;
vector<vector<char>> grid(h, vector<char>(w));
rep(y, h) rep(x, w) cin >> grid[y][x];
MatrixSum b(h, w), bv(h, w), bh(h, w);
rep(y, h) rep(x, w) if (grid[y][x] == '1') b.add(y, x);
rep(y, h) rep(x, w - 1) if (grid[y][x] == '1' && grid[y][x + 1] == '1') bh.add(y, x);
rep(y, h - 1) rep(x, w) if (grid[y][x] == '1' && grid[y + 1][x] == '1') bv.add(y, x);
b.setUp();
bv.setUp();
bh.setUp();
rep(_, q) {
int y1, x1, y2, x2;
cin >> y1 >> x1 >> y2 >> x2;
y1--;
x1--;
y2--;
x2--;
int bc = b.getSum(y1, x1, y2, x2);
int bvc = y1 == y2 ? 0 : bv.getSum(y1, x1, y2 - 1, x2);
int bhc = x1 == x2 ? 0 : bh.getSum(y1, x1, y2, x2 - 1);
int ans = bc - bvc - bhc;
cout << ans << endl;
}
}
| 0 |
#include<stdio.h>
#define N 8
#define FREE -1
#define NOT_FREE 1
int row[N],col[N],dpos[2*N-1],dneg[2*N-1];
int x[N][N];
void initialize(void);
void printBoard(void);
void recursive(int);
int main(){
int i,j;
initialize();
for( i = 0 ; i < N ; i++ ){
for(j = 0 ; j < N ; j++ ){
x[i][j] = 0;
}
}
int k;
int r,c;
scanf("%d",&k);
for( i = 0 ; i < k ; i++ ){
scanf("%d%d",&r,&c);
x[r][c] = 1;
}
recursive(0);
return 0;
}
void initialize(){
int i,j;
for( i = 0 ; i < N ; i++ ) {
row[i] = FREE;
col[i] = FREE;
}
for( i = 0 ; i < 2*N-1 ; i++ ){
dpos[i] = FREE;
dneg[i] = FREE;
}
}
void printBoard(){
int i,j;
for( i = 0 ; i < N ; i++ ){
for( j = 0 ; j < N ; j++ ){
if(x[i][j]){
if(row[i] != j) return;
}
}
}
for( i = 0 ; i < N ; i++ ){
for( j = 0 ; j < N ; j++ ){
if(row[i] == j ) printf("Q");
else printf(".");
}
printf("\n");
}
}
void recursive(int i){
if( i == N ){
printBoard();
return;
}
int j;
for( j = 0 ; j < N ; j++ ){
if( NOT_FREE == col[j] || NOT_FREE == dpos[i+j] || NOT_FREE == dneg[i-j+N-1]) continue;
row[i] = j;
col[j] = dpos[i+j] = dneg[i-j+N-1] = NOT_FREE;
recursive(i+1);
row[i] = col[j] = dpos[i+j] = dneg[i-j+N-1] = FREE;
}
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#define int long long
#define dotimes(i, n) for (int i : range(n))
using namespace std;
class range {
class iterator {
int i, s;
public:
iterator(int i, int s): i(i), s(s) {}
int& operator*() {
return i;
}
void operator++() {
i += s;
}
bool operator!=(iterator const& that) {
return i < that.i;
}
};
iterator b, e;
public:
range(int e): b({0, 1}), e({e, 1}) {}
range(int b, int e): b({b, 1}), e({e, 1}) {}
range(int b, int e, int s): b({b, s}), e({e, s}) {}
iterator begin() {
return b;
}
iterator end() {
return e;
}
};
int rint() {
int n;
scanf("%lld", &n);
return n;
}
void wint(int n) {
printf("%lld\n", n);
}
template<typename T>
inline int size(T container) {
return static_cast<int>(container.size());
}
template<typename T>
inline bool maxs(T& a, T const& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T>
inline bool mins(T& a, T const& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
const int k = rint();
int rf[8] = {}, p[8 - k];
bool cf[8] = {};
dotimes(i, k) {
int r = rint();
int c = rint();
rf[r] = c + 1;
cf[c] = true;
}
for (int i = 0, j = 0, c = 0; i < 8; i++)
if (!rf[i]) {
while (cf[c])
c++;
p[j++] = ++c;
}
int a[8];
for (;; next_permutation(p, p + 8 - k)) {
for (int i = 0, j = 0; i < 8; i++)
a[i] = rf[i] ? rf[i] : p[j++];
dotimes(i, 8)
dotimes(j, i)
if (abs(a[j] - a[i]) == abs(j - i))
goto failed;
break;
failed:
;
}
dotimes(i, 8) {
dotimes(j, 8)
putchar(a[i] == j + 1 ? 'Q' : '.');
putchar('\n');
}
return 0;
}
| 1 |
#include<stdio.h>
#include<string.h>
#define N 8
int board[N][N];
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_13_A -- backtracking
//chech previous part but there are fixed point before that
//so check all of them
bool safe(int row, int col){
//chec the column
if(board[row][col]==1) return true;
for(int i = 0; i<N; i++){
if(board[row][i] == 1) return false;
}
//check the row
for(int i = 0; i<N; i++){
if(board[i][col] == 1) return false;
}
//check the diagional
int i = row, j = col;
while(i>=0 && j>=0){
if(board[i][j]==1) return false;
i--; j--;
}
i = row, j = col;
while(i<N && j<N){
if(board[i][j]==1) return false;
i++; j++;
}
i = row, j = col;
while(i>=0 && j<N){
if(board[i][j]==1) return false;
i--; j++;
}
i = row, j = col;
while(i<N && j>=0){
if(board[i][j]==1) return false;
i++; j--;
}
//printf("check\n");
return true;
}
//for each row([0,7]),check the column
bool solve_board(int col){
//all chess placed
if(col>=N) return true;
for(int i = 0; i<N; i++){
if(board[i][col]==1){
if(solve_board(col+1)) return true;
}
else {
if(safe(i,col)){
//printf("%d %d\n",i,col);
board[i][col] = 1;
//recur--key points
if(solve_board(col+1)) return true;
board[i][col] = 0;
}}
}
return false;
}
int main(){
int n = 0;
memset(board,0,sizeof(board));
scanf("%d",&n);
for(int i = 0; i<n; i++){
int a, b;
scanf("%d %d",&a,&b);
board[a][b] = 1;
}
//for each column, check the row
solve_board(0);
for(int i = 0; i<N; i++){
for(int j = 0; j< N; j++){
if(board[i][j]==0) printf(".");
else printf("Q");
}
printf("\n");
}
}
| //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
int V, E, Q, a, b;
vector<int> G[100001];
vector<int> rG[100001];
vector<int> vs;
bool used[100001];
int cmp[100001];
auto dfs(int v) -> void {
used[v] = true;
for (int i = 0; i < G[v].size(); ++i)
if (!used[G[v][i]])
dfs(G[v][i]);
vs.push_back(v);
}
auto rdfs(int v, int k) -> void{
used[v] = true;
cmp[v] = k;
for (int i = 0; i < rG[v].size(); i++)
if (!used[rG[v][i]])
rdfs(rG[v][i], k);
}
/**
* ?????£?????????????§£
* @return ?????£???????????????????????????????????????????????§???
*/
auto scc() -> int {
fill(used, used + V, false);
vs.clear();
for (int v = 0; v < V; v++) {
if (!used[v]) dfs(v);
}
fill(used, used + V, false);
int k = 0;
for (int i = vs.size() - 1; i >= 0; i--)
if (!used[vs[i]])
rdfs(vs[i], k++);
return k;
}
auto main() -> signed {
cin >> V >> E;
for (int i = 0; i < E; i++) {
cin >> a >> b;
G[a].push_back(b);
rG[b].push_back(a);
}
int k = scc();
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> a >> b;
cout << ((cmp[a] == cmp[b]) ? 1 : 0) << endl;
}
return 0;
} | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <string>
#include <cstring>
#include <numeric>
#include <iomanip>
using namespace std;
//
const int inf=1e9+7;//0x3f
//
struct UnionFind{
//
vector<int> par,ran;
//
UnionFind(int n){
init(n);
}
//
void init(int n){
par.resize(n);
ran.resize(n,0);
for(int i=0;i<n;i++){
par[i]=i;
}
}
//
int find(int x){
return (x==par[x]?x:par[x]=find(par[x]));
}
//
bool same(int x,int y){
return find(x)==find(y);
}
//
void unite(int x,int y){
x=find(x);
y=find(y);
if(x==y){
return;
}else{
if(ran[x]<ran[y]){
par[x]=y;
}else{
par[y]=x;
if(ran[x]==ran[y]){
ran[x]++;
}
}
}
}
//
};
//
int main(){
int N,K,L;
cin>>N>>K>>L;
UnionFind road(N),train(N);
for(int i=0;i<K;i++){
int p,q;
cin>>p>>q;
p--;q--;
road.unite(p,q);
}
for(int i=0;i<L;i++){
int r,s;
cin>>r>>s;
r--;s--;
train.unite(r,s);
}
int r[200000],t[200000];
for(int i=0;i<N;i++){
r[i]=road.find(i);
t[i]=train.find(i);
}
map<pair<int,int>,int> M;
for(int i=0;i<N;i++){
M[make_pair(r[i],t[i])]++;
}
for(int i=0;i<N;i++){
if(i){
cout<<" ";
}
cout<<M[make_pair(r[i],t[i])];
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) _back
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int T = 2e5 + 3;
int pai[3][T];
int peso[3][T];
vii g[T];
int n,k,l;
void init() {
for(int i = 0; i < 3; i++)
for(int j = 0; j <= n; j++) {
pai[i][j] = j;
peso[i][j] = 1;
}
}
int find(int op, int x) {
return (pai[op][x] == x? x : pai[op][x] = find(op,pai[op][x]));
}
void join(int op, int x, int y) {
x = find(op,x);
y = find(op,y);
if(x == y) return;
if(peso[op][x] < peso[op][y]) swap(x,y);
pai[op][y] = x;
peso[op][x] += peso[op][y];
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k >> l;
init();
while(k--) {
int a,b; cin >> a >> b;
if(find(0,a) != find(0,b)) join(0,a,b);
}
while(l--) {
int a,b; cin >> a >> b;
if(find(1,a) != find(1,b)) join(1,a,b);
}
for(int i = 1; i <= n; i++)
g[find(0,i)].eb(find(1,i),i);
for(int i = 1; i <= n; i++) {
sort(g[i].begin(), g[i].end());
for(int j = 1; j < g[i].size(); j++)
if(g[i][j].fi == g[i][j-1].fi)
join(2,g[i][j].se,g[i][j-1].se);
}
for(int i = 1; i <= n; i++) cout << peso[2][find(2,i)] << " ";
cout << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int MAX_N = 1e5+20;
int n;
int a[MAX_N],b[MAX_N],c[MAX_N];
int Q, K;
int x[MAX_N], y[MAX_N];
struct edge { int to, cost; };
vector<edge> G[MAX_N];
ll dist[MAX_N];
void add_edge(int from, int to, int cost)
{
G[from].push_back(edge{to, cost});
G[to].push_back(edge{from, cost});
}
void dfs(int x, ll d)
{
dist[x] = d;
for(auto e : G[x]){
int t = e.to, c = e.cost;
if(dist[t] == INF){
dfs(t, d+c);
}
}
}
void solve()
{
for(int i=0;i<n-1;++i) add_edge(a[i],b[i],c[i]);
memset(dist,0x3f,sizeof(dist));
dfs(K, 0);
for(int i=0;i<Q;++i){
cout<<dist[x[i]]+dist[y[i]]<<'\n';
}
}
int main()
{
cin >> n;
for(int i=0;i<n-1;++i){
cin >> a[i] >> b[i] >> c[i];
}
cin >> Q >> K;
for(int i=0;i<Q;++i){
cin >> x[i] >> y[i];
}
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 100010
#define INFTY 1e18
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
struct edge{ll to, cost;};
ll n;
ll dist[MAX];
bool check[MAX];
vector<edge> G[MAX];
void dijkstra(ll s)
{
priority_queue<P, vector<P>, greater<P>> pq;
for(ll i = 0; i < n; i++)
{
dist[i] = INFTY;
check[i] = false;
}
pq.push(P(0, s));
dist[s] = 0;
while (!pq.empty())
{
P p = pq.top(); pq.pop();
ll minv = p.first;
ll u = p.second;
check[u] = true;
if (dist[u] < minv) continue;
rep(i, G[u].size())
{
if (check[G[u][i].to]) continue;
if (dist[G[u][i].to] > dist[u] + G[u][i].cost)
{
dist[G[u][i].to] = dist[u] + G[u][i].cost;
pq.push(P(dist[G[u][i].to], G[u][i].to));
}
}
}
}
signed main(void)
{
cin >> n;
rep(i, n - 1)
{
int a, b;
ll c;
cin >> a >> b >> c;
a--; b--;
G[a].push_back({b, c});
G[b].push_back({a, c});
}
int q, k;
cin >> q >> k;
k--;
dijkstra(k);
rep(i, q)
{
int x, y;
cin >> x >> y;
x--; y--;
cout << dist[x] + dist[y] << endl;
}
return 0;
}
| 1 |
#include<iostream>
#include <climits>
#include<vector>
#include<list>
#include<numeric>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> S(n);
REP(i, n) cin >> S[i];
sort(S.begin(), S.end());
int q;
cin >> q;
vector<ll> T(q);
REP(i, q) cin >> T[i];
int res = 0;
REP(i, q) {
if (binary_search(S.begin(), S.end(), T[i])) res++;
}
cout << res << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 1e5 + 5;
int n;
int a[MAXN];
int main(){
scanf("%d",&n);n <<= 1;
FOR(i,1,n) scanf("%d",a+i);
std::sort(a+1,a+n+1);
int ans = 0;
for(int i = 1;i <= n;i += 2) ans += a[i];
printf("%d\n",ans);
return 0;
} | 0 |
#include <iostream>
#include <cstring>
using namespace std;
int main() {
string teks;
getline(cin,teks);
int n=teks.size();
for (int i=n-1; i>=0; i--) {
cout << teks[i];
}
cout << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
string input;
int num = 0;
int i = 0;
int count = 0;
char temp[1];
cin >> input;
num = input.size();
char str[num]; //= input.toCharArray();
sprintf(str,"%s",input.c_str());
if(num % 2 == 0)
{
count = num / 2;
}
else
{
count = (num - 1) / 2;
}
for(i = 0;i < count;i++)
{
temp[0] = str[i];
str[i] = str[num - 1 - i];
str[num - 1 - i] = temp[0];
}
string output = string(str);
cout << output << endl;
} | 1 |
#include<iostream>
#include<stdio.h>
using namespace std;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
const int mod=1000000007;
int main(){
int N;
cin>>N;
vector<int>A(N);
rep(i,N)cin>>A[i];
sort(A.begin(),A.end());
int ans=0;
rep(i,N){
rep(j,i){
rep(k,j){
if(A[i]!=A[j]&&A[j]!=A[k]&&A[i]<A[j]+A[k])ans++;
}
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define debug(x) cout << #x << '=' << x << '\n'
const long long MOD=1e9+7;
//const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};
template<typename T>
istream &operator>>(istream &is,vector<T> &v){
for (T &x:v) is >> x;
return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
for (int i=0;i<v.size();++i){
os << v[i] << (i+1==v.size()?"": " ");
}
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
if (a<b){a=b; return true;} return false;
}
vector<ll> po(19,1);
ll calc(int i,int j,ll e){
if (j>i-1-j) return (e==0?1:0);
ll res=0;
int diff=(j==i-1-j?0:e/(po[i-1-j]-po[j]));
for (ll d=diff-1;d<=diff+1;++d){
if (j==i-1-j&&d!=0) continue;
ll ne=e-(po[i-1-j]-po[j])*d;
if (ne<-(po[i-1-j]-po[j])||po[i-1-j]-po[j]<ne) continue;
for (int k=(!j?1:0),cnt=0;k<10;++k){
if (k+d>=0&&k+d<10) ++cnt;
if (k==9) res+=calc(i,j+1,ne)*cnt;
}
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
for (int i=0;i<18;++i) po[i+1]=po[i]*10;
ll D; cin >> D;
ll ans=0;
for (int i=2;i<=19;++i){
ans+=calc(i,0,D);
}
cout << ans << '\n';
} | 0 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <bitset>
#include <string>
using namespace std;
#define REP(i,n) for(int i=0; i<n; i++)
#define RPA(i,s,e) for(int i=s; i<=e; i++)
#define RPD(i,s,e) for(int i=s; i>=e; i--)
#define PB(a) push_back(a)
#define MP(i,s) make_pair(i,s)
#define ALL(a) (a).begin(), (a).end()
#define PRT(a) cout << (a) << endl
typedef pair<int,int> P;
const int INF = 1000000009;
const int MAX_V = 101;
struct edge { int to, cost; };
vector<edge> G[MAX_V];
int N,K,L;
int f,t,c;
int dist[MAX_V];
void add_edge(int from, int to, int cost) {
edge e1 = { to, cost };
edge e2 = { from, cost };
G[from].PB(e1);
G[to].PB(e2);
}
int dijkstra(int from, int to) {
fill(dist, dist+MAX_V, INF);
priority_queue<P, vector<P>, greater<P> > que;
dist[from] = 0;
que.push(MP(0, from));
while(!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if(dist[v] < p.first) continue;
REP(i,G[v].size()) {
edge& e = G[v][i];
if(dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
que.push(MP(dist[e.to], e.to));
}
}
}
return dist[to] == INF ? -1 : dist[to];
}
void coding() {
while(scanf("%d%d", &N, &K) != EOF) {
REP(i,N) G[i].clear();
REP(i,K) {
scanf("%d", &L);
if(L == 0) {
scanf("%d%d", &f, &t);
f--; t--;
printf("%d\n", dijkstra(f, t));
} else if(L == 1) {
scanf("%d%d%d", &f, &t, &c);
f--; t--;
add_edge(f, t, c);
} else {
PRT("unknown");
}
}
}
}
// #define _LOCAL_TEST
int main() {
#ifdef _LOCAL_TEST
clock_t startTime = clock();
freopen("a.in", "r", stdin);
#endif
coding();
#ifdef _LOCAL_TEST
clock_t elapsedTime = clock() - startTime;
cout << endl;
cout << (elapsedTime / 1000.0) << " sec elapsed." << endl;
cout << "This is local test" << endl;
cout << "Do not forget to comment out _LOCAL_TEST" << endl << endl;
#endif
} | #include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
#define INF 1000000000
int main(){
int n,m,flg;
ll a,b,c;
while(cin >> n >> m && n && m){
vector<P> node[101];
for(int k=0;k<m;k++){
cin >> flg;
if(flg){
cin >> a >> b >> c;
P p; p.first=b; p.second=c;
node[a].push_back(p);
p.first = a;
node[b].push_back(p);
}
else {
bool f = true;
cin >> a >> b;
ll used[102];
used[a] = 0;
for(int j=1;j<=n;j++) used[j] = INF;
priority_queue<P, vector<P>, greater<P> > que;
que.push(P(0,a));
while(!que.empty()){
P p = que.top(); que.pop();
ll cost = p.first;
ll now = p.second;
if(now == b) {
cout << cost << endl;
f = false;
break;
}
int len = node[now].size();
for(int i=0;i<len;i++){
P p = node[now][i];
ll next = p.first;
ll nc = p.second;
if(used[next]==INF || used[next] > cost+nc){
used[next] = cost+nc;
que.push(P(cost+nc,next));
}
}
}
if(f) cout << "-1" << endl;
}
}
}
} | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define MN 505
using namespace std;
typedef long long ll;
int n,pr[MN<<2],tt;bool p[MN*MN];
ll a[MN][MN];
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
int main(){
scanf("%d",&n);
for(int i=2;i<=1e5;i++){
if(!p[i]){
pr[++tt]=i;
if(tt>=4*n)break;
}
for(int j=1;j<=tt;j++){
if(i*pr[j]>1e5)break;
p[i*pr[j]]=1;
if(i%pr[j]==0)break;
}
}ll tt=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if((i+j)%2==0){
a[i][j]=1ll*pr[i+j>>1]*pr[(i-j)/2+n];
}else {
a[i][j]=1ll*pr[i+j>>1]*pr[(i+j+1)>>1];
if(i-j<0)a[i][j]*=1ll*pr[(i-j)/2+n]*pr[(i-j-1)/2+n];
else a[i][j]*=1ll*pr[(i-j)/2+n]*pr[(i-j+1)/2+n];a[i][j]++;
tt=max(a[i][j],tt);
}//printf("%lld\n",tt);
/* for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int k=0;k<4;k++){
int tx=i+dx[k],ty=j+dy[k];
if(tx>=1&&tx<=n&&ty>=1&&ty<=n){
if(max(a[i][j],a[tx][ty])%min(a[i][j],a[tx][ty])!=1)printf("%d %d %d %d\n",i,j,tx,ty);
}
}*/
for(int i=1;i<=n;i++){for(int j=1;j<=n;j++)printf("%lld ",a[i][j]);puts("");}
}
| #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=502;
int n,ar[N][N],lis[1006],dx[]={0,0,-1,1},dy[]={-1,1,0,0},ar1[N][N];
bool check(int x,int y){
if(x>0&&x<=n){
if(y>0&&y<=n){
return true;
}
}
return false;
}
bool check1(int x){
int i;
for(i=2;i*i<=x;i++){
if(x%i==0){
return false;
}
}
return true;
}
int LCM(int x,int y){
return (x/__gcd(x,y)) * y;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int i,j,k,l,num=0,hichic=0;
cin>>n;
if(n==2){
cout<<"4 7\n23 10";
return 0;
}
for(i=2;i<=10000;i++){
//cout<<i<<endl;
if(check1(i)){
num++;
lis[num]=i;
//cout<<num<<' '<<i<<endl;
if(num==1002){
//cout<<num<<' '<<"cac"<<endl;
break;
}
}
}
//cout<<num<<endl;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(!((i+j)&1)){
continue;
}
if(i-1&&j-1){
ar[i][j]=ar[i-1][j-1];
}
else{
hichic++;
ar[i][j]=lis[hichic];
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(!((i+j)&1)){
continue;
}
if(i-1&&j+1<=n){
ar1[i][j]=ar1[i-1][j+1];
ar[i][j]*=ar1[i][j];
}
else{
hichic++;
ar[i][j]*=lis[hichic];
ar1[i][j]=lis[hichic];
}
}
}
//cout<<"cac"<<endl;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(!((i+j)&1)){
ar[i][j]=1;
for(l=0;l<4;l++){
if(check(i+dx[l],j+dy[l])){
ar[i][j]=LCM(ar[i][j],ar[i+dx[l]][j+dy[l]]);
}
}
cout<<ar[i][j]+1<<' ';
}
else{
cout<<ar[i][j]<<' ';
}
}
cout<<'\n';
}
} | 1 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
int main(){
int n ;cin>> n;
cout<<(n-2)*180<<endl ;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef set<int> si;
typedef set<string> ss;
typedef map<int,int> mii;
typedef map<string,int>msi;
typedef map<string,string>mss;
void solve(){
string inp,weeks[7];
weeks[0]="MON";
weeks[1]="TUE";
weeks[2]="WED";
weeks[3]="THU";
weeks[4]="FRI";
weeks[5]="SAT";
weeks[6]="SUN";
cin>>inp;
int n;
for(int i=0;i<7;i++){
if(weeks[i]==inp){
n=i;
}
}
int res = 6-n;
if(res==0){
res=7;
}
cout<<res<<endl;
}
int main(){
int t;
t=1;
while(t--){
solve();
}
return 0;
}
| 0 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> b(N, 0);
for (int i = N; i >= 1; i--) {
int j = i;
int count = 0;
while (j <= N) {
if (b[j - 1] == 1) count++;
j += i;
}
if (count % 2 != a[i - 1]) b[i - 1] = 1;
}
vector<int> output;
for (int i = 0; i < N; i++) {
if (b[i] != 0) output.push_back(i + 1);
}
cout << output.size() << endl;
for (int i = 0; i < output.size(); i++) {
cout << output[i] << " ";
}
cout << endl;
return 0;
}
| #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 N, A[int(2e5+5)], ans[int(2e5+5)];
vector <int> res;
int main(){
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
for (int i = N; i >= 1; i--){
if (ans[i] % 2 == A[i]) continue;
res.push_back(i);
for (int j = 1; j * j <= i; j++){
if (i % j != 0) continue;
ans[j]++;
if (j * j != i) ans[i/j]++;
}
}
for (int i = 1; i <= N; i++){
if (ans[i] % 2 != A[i]){
cout << -1 << endl;
return 0;
}
}
int M = res.size();
cout << M << endl;
for (int i = 0; i < M; i++){
cout << res[i];
if (i < M - 1) cout << " ";
else cout << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll & a, ll b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll & a, ll b) { if (b > a) { a = b; return 1; } return 0; }
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N=500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans;
int main() {
cin>>n;
vl beki;
multiset<ll> A;
beki.push_back(1);
rep(i,40){
beki.push_back(beki.back()*2);
}
rep(i,n){
cin>>x;
A.insert(x);
}
while(!A.empty()){
auto ite=A.end();
ite--;
x=*ite;
A.erase(ite);
k=upper_bound(all(beki),x*2)-beki.begin()-1;
if(!A.empty()&&A.count(beki[k]-x)>0){
auto ite2=A.lower_bound(beki[k]-x);
A.erase(ite2);
ans++;
}
}
cout<<ans<<endl;
}
| #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<functional>
using namespace std;
#define maxn long long(5*1e8)
int main(){
long long n=0;
scanf("%d",&n);
map<long long,long long,greater<long long>> num;
for(long long i=1;i<=n;++i){
long long temp=0;
scanf("%d",&temp);
num[temp]++;
}
long long j=pow(2.0,31),ans=0;
for(auto iter=num.begin();iter!=num.end();++iter){
while(iter->first<j/2) j/=2;
if(num[iter->first]>0&&num[j-iter->first]>0){
if(j==iter->first*2){
ans+=num[iter->first]/2;
num[iter->first]=num[iter->first]%2;
}
else{
ans+=min(num[iter->first],num[j-iter->first]);
num[j-iter->first]-=min(num[iter->first],num[j-iter->first]);
}
}
}
cout<<ans<<endl;
}
//5 1 2 2 2 3
| 1 |
#include <algorithm>
#include <cstdio>
#define upd(x, y) (x) = std::max(x, y)
char str[105];
int dp[105][105][105][105], row_pre[105][105], col_pre[105][105];
int main()
{
// freopen("AGC004-E.in", "r", stdin);
int n, m, x, y;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", str);
for (int j = 0; j < m; j++)
{
row_pre[i][j] = (j ? row_pre[i][j - 1] : 0) + (str[j] == 'o');
col_pre[j][i] = (i ? col_pre[j][i - 1] : 0) + (str[j] == 'o');
if (str[j] == 'E')
{
x = i;
y = j;
}
}
}
auto calc_row = [&] (int row, int l, int r)
{
int L = std::max(l, r - y), R = std::min(r, l + m - y - 1);
return L <= R ? row_pre[row][R] - (L ? row_pre[row][L - 1] : 0) : 0;
};
auto calc_col = [&] (int col, int l, int r)
{
int L = std::max(l, r - x), R = std::min(r, l + n - x - 1);
return L <= R ? col_pre[col][R] - (L ? col_pre[col][L - 1] : 0) : 0;
};
for (int i = 0; i <= x; i++)
{
for (int j = n - 1; j >= x; j--)
{
for (int k = 0; k <= y; k++)
{
for (int t = m - 1; t >= y; t--)
{
if (j - i < x)
upd(dp[i][j][k][t], dp[i - 1][j][k][t] + calc_row(i - 1, k, t));
if (j - i < n - x - 1)
upd(dp[i][j][k][t], dp[i][j + 1][k][t] + calc_row(j + 1, k, t));
if (t - k < y)
upd(dp[i][j][k][t], dp[i][j][k - 1][t] + calc_col(k - 1, i, j));
if (t - k < m - y - 1)
upd(dp[i][j][k][t], dp[i][j][k][t + 1] + calc_col(t + 1, i, j));
}
}
}
}
printf("%d\n", dp[x][x][y][y]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N=110, M=5e3+300;
int h,w,F[M][M],idh[N][N],idw[N][N];
char mp[N][N]; int stx,sty,s[N][N];
inline int& f(int l,int r,int u,int d) {return F[idh[l][r]][idw[u][d]];}
inline int getarea(int xc1,int xc2,int yc1,int yc2) {
return s[xc2][yc2]-s[xc1-1][yc2]-s[xc2][yc1-1]+s[xc1-1][yc1-1];
}
inline int calcl(int p,int up,int dn,int l,int r,int u,int d) {
if(p<=r || p+l>w) return 0;
up=max(up,d+1); dn=min(dn,h-u);
if(up>dn) return 0;
return getarea(up,dn,p,p);
}
inline int calcr(int p,int li,int ri,int l,int r,int u,int d) {
if(p<=d || p+u>h) return 0;
li=max(li,r+1); ri=min(ri,w-l);
if(li>ri) return 0;
return getarea(p,p,li,ri);
}
int main() {
cin>>h>>w;
for(int i=1;i<=h;i++) cin>>(mp[i]+1);
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j++) {
if(mp[i][j]=='o') s[i][j]=1;
if(mp[i][j]=='E') stx=i, sty=j;
s[i][j]=s[i][j-1]+s[i-1][j]-s[i-1][j-1]+s[i][j];
}
for(int l=0,cnt=0;l<=sty;++l)
for(int r=0;sty+r<=w;++r)
idh[l][r]=cnt++;
for(int u=0,cnt=0;u<=stx;++u)
for(int d=0;d+stx<=h;++d)
idw[u][d]=cnt++;
int ans=0;
for(int l=0;l<=sty;++l)
for(int r=0;sty+r<=w;++r)
for(int u=0;u<=stx;++u)
for(int d=0;d+stx<=h;++d) {
int &s=f(l,r,u,d);
if(l) s=max(s,f(l-1,r,u,d)+calcl(sty-l,stx-u,stx+d,l-1,r,u,d));
if(r) s=max(s,f(l,r-1,u,d)+calcl(sty+r,stx-u,stx+d,l,r-1,u,d));
if(u) s=max(s,f(l,r,u-1,d)+calcr(stx-u,sty-l,sty+r,l,r,u-1,d));
if(d) s=max(s,f(l,r,u,d-1)+calcr(stx+d,sty-l,sty+r,l,r,u,d-1));
ans=max(ans,s);
}
cout<<ans<<'\n';
} | 1 |
#include <iostream>
#include <cmath>
int n;
int cnt(int i){
if(i == 1) return 1;
if(i == 2) return 2;
if(i == 3) return 4;
return cnt( i-3 ) + cnt( i-2 ) + cnt( i-1 );
}
int main(void){
while(1){
std::cin >> n;
if(n == 0) return 0;
std::cout << std::ceil(cnt(n) / 10.0 / 365.0) << std::endl;
}
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
#include<functional>
using namespace std;
int main(){
int N;
while(cin>>N,N){
int dp[31] = {}; dp[0] = 1;
for(int i=0;i<N;i++){
for(int j=1;j<=3;j++) if(i+j<=N) dp[i+j] += dp[i];
}
printf("%d\n",((dp[N]-1)/10)/365+1);
}
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int l, r, i, j, ans;
scanf("%d%d", &l, &r);
if (r - l >= 2019 || l % 2019 > r % 2019)
{
printf("0\n");
return (0);
}
ans = 2019;
i = l % 2019;
while (i < r % 2019)
{
j = i + 1;
while (j <= r % 2019)
{
if (ans > i * j % 2019)
ans = i * j % 2019;
j++;
}
i++;
}
printf("%d\n", ans);
return 0;
} | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int x, y;
cin >> x >> y;
if (x <= 8 && y <= 8) {
cout << "Yay!" << endl;
}
else {
cout << ":(" <<endl;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main(){
int t = 1; //cin >> t;
while(t--){
int n; cin >> n;
map<int,int> mp;
while(n--)
{
int x; cin >> x;
if(mp[x] == 0)
mp[x] = 1;
else mp[x] = 0;
}
int ans = 0;
for(auto x:mp)
if(x.second)
ans++;
cout << ans;
}
} | #include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
size_t isort(vector<int> &A, size_t g) {
size_t count_=0;
for (size_t i=g; i<A.size(); ++i) {
int v=A[i], j;
for (j=i-g; j>=0&&v<A[j]; j-=g) {
A[j+g] = A[j];
++count_;
}
A[j+g] = v;
}
return count_;
}
size_t shsort(vector<int> &A) {
size_t count_=0;
size_t m=A.size();
vector<size_t> g; g.push_back(1);
for (size_t h=4; h<=m&&g.size()<100; ++(h*=3))
g.push_back(h);
reverse(g.begin(), g.end());
printf("%zu\n", g.size());
for (size_t i=0; i<g.size(); ++i)
printf("%zu%c", g[i], i<g.size()-1? ' ':'\n');
for (size_t d: g)
count_ += isort(A, d);
return count_;
}
int main() {
size_t N;
scanf("%zu", &N);
vector<int> A(N);
for (size_t i=0; i<N; ++i)
scanf("%d", &A[i]);
size_t t=shsort(A);
printf("%zu\n", t);
for (size_t i=0; i<N; ++i)
printf("%d\n", A[i]);
return 0;
} | 0 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define ll long long
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
static int buf[20],len; len=0;
if(x<0)x=-x,putchar('-');
for(;x;x/=10)buf[len++]=x%10;
if(!len)putchar('0');
else while(len)putchar(buf[--len]+'0');
}
inline void writeln(ll x){write(x); putchar('\n');}
inline void writesp(ll x){write(x); putchar(' ');}
int a[maxn],d[maxn];
int cur[maxn],ans[maxn];
int n,m;
ll k;
int mul(int* a,int* b,int n)
{
static int t[maxn];
for(int i=1;i<=n;i++)
t[i]=a[b[i]];
for(int i=1;i<=n;i++)
a[i]=t[i];
}
int main()
{
n=read();
for(int i=1;i<=n;i++)
a[i]=read();
int S=a[1];
for(int i=1;i<n;i++)
d[i]=a[i+1]-a[i];
m=read(); k=read();
for(int i=1;i<n;i++)
cur[i]=ans[i]=i;
for(int i=1;i<=m;i++){
int x=read();
std::swap(cur[x-1],cur[x]);
}
for(;k;k>>=1,mul(cur,cur,n-1))
if(k&1)mul(ans,cur,n-1);
ll X=a[1];
for(int i=1;i<=n;i++){
writeln(X);
X+=d[ans[i]];
}
return 0;
} | #include<bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long long mod=1e9+7;
const long double PI = acos(0);
template <class T>void UNIQUE(vector<T> &x){
sort(all(x));
x.erase(unique(all(x)), x.end());
}
// }}} End Header
int main() {
int n, ans = 0;
cin >> n;
vector<ll> l(n);
map<ll, ll> dict;
rep(i,n){
cin >> l[i];
dict[l[i]]++;
}
UNIQUE(l);
if(l.size()<3){
cout << 0 << endl;
return 0;
}
rep(i,l.size()-2){
loop(j, i+1, l.size()-1){
loop(k, j+1, l.size()){
if(l[i]+l[j] > l[k]){
//cout << l[i] << l[j] << l[k] << endl;
ans+=(dict[l[i]]*dict[l[j]]*dict[l[k]]);
}
}
}
}
cout << ans << endl;
return 0;
} | 0 |
#include<stdio.h>
#include<map>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
P s[101];
int r[100];
int main(){
int n;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)s[i]=P(0,i);
for(i=0;i<n*(n-1)/2;i++){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
a--;b--;
if(c>d)s[a].first+=3;
if(c<d)s[b].first+=3;
if(c==d){
s[a].first+=1;
s[b].first+=1;
}
}
s[n]=P(-1,-1);
sort(s,s+n);
reverse(s,s+n);
int p=0;
int pr=0;
while(p<n){
r[s[p].second]=pr;
while(s[p].first==s[p+1].first){
p++;
r[s[p].second]=pr;
}
p++;
pr=p;
}
for(i=0;i<n;i++)printf("%d\n",r[i]+1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
typedef pair<int,int> P;
//最大公約数
int gcd(int a,int b){
if (a%b == 0){
return b;
}
else{
return gcd(b,a%b);
}
}
//最小公倍数
int lcm(int a,int b){
return a /gcd(a,b) * b;
}
//素数判定
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
// 素因数分解
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
// 10進数から2進数
int binary(int bina){
int ans = 0;
for (int i = 0; bina>0 ; i++)
{
ans = ans+(bina%2)*pow(10,i);
bina = bina/2;
}
return ans;
}
int main() {
int n;
cin >> n;
ll x,a[n+1];
cin >> x;
rep (i,n){
cin >> a[i];
}
int res = 0;
sort (a,a+n);
rep (i,n){
if (x >= a[i]) {
res ++;
x -= a[i];
}
else break;
}
if (res == n && x) --res;
cout << res << endl;
} | 0 |
#include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))
#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)
struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
const int N=100007;
int n,t[N][3],s[N];
int main()
{
in,n;
fo0(l,3)fo1(i,n)in,t[i][l];
fo1(i,n)
{
int p=(t[i][0]-1)/3;
//out,p,'\n';
bool f1=1,f2=1;
fo0(j,3)f1&=t[i][j]==p*3+j+1;
fo0(j,3)f2&=t[i][j]==p*3+3-j;
if((!f1&&!f2)||(~(i^p)&1))return puts("No"),0;
s[i]=f1?p+1:-p-1;
}
//fo1(i,n)out,s[i],' ';out,'\n';
int a[2]={0,0},b[2]={0,0};
fo1(i,n)a[i&1]^=s[i]<0;
fo1(i,n)while(abs(s[i])!=i)std::swap(s[i],s[abs(s[i])]),b[i&1]^=1;
out,a[0]==b[1]&&a[1]==b[0]?"Yes":"No",'\n';
} | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=100005;
int n,a[5][N],i,j,k,x,y,b[N],c[2];
int main()
{
scanf("%d",&n);
for(i=1;i<=3;++i)
for(j=1;j<=n;++j)
scanf("%d",a[i]+j);
for(i=1;i<=n;++i)
{
x=y=a[1][i];
for(j=2;j<=3;++j)
x=max(x,a[j][i]),y=min(y,a[j][i]);
if(x-y!=2||y+1!=a[2][i])
{
printf("No");
return 0;
}
b[i]=x/3;
if(a[1][i]!=y)
c[i&1]=!c[i&1];
if((x/3-i)%2)
{
printf("No");
return 0;
}
}
for(i=1;i<=n;++i)
while(i!=b[i])
{
swap(b[i],b[b[i]]);
c[i&1^1]=!c[i&1^1];
}
if(c[0]||c[1])
printf("No");
else
printf("Yes");
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
# define rep(i,n) for(int i=0;i<n;i++)
void solve(){
lli n,x,t;
cin>>n>>x>>t;
lli y = (t*n)/x;
if(y%t==0)
cout<<y<<endl;
else{
y +=t;
cout<<y - y%t<<endl;
}
}
int main()
{
int t;
// cin>>t;
t=1;
while(t--){
solve();
}
} | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod = 1e9+7;
#define ll long long
signed main() {
int n;
string s,t;
cin >> n >> s >>t;
int sz = s.length();
int tz = t.length();
if(sz+tz<=n) {
cout << n << endl;
return 0;
}
int ma = 0;
rrep(i,tz) {
int ss = sz-1;
int tmp=0;
while(i>=0 && ss>=0) {
// cout << s[ss]<<t[i]<<ss<<" "<<i<<" " << endl;
if(s[ss]==t[i]) {
if(i==0) {
cout << sz+tz-(sz-ss) << endl;
return 0;
}
ss--;
tmp++;
}else {
if(tmp>0) i++;
break;
}
i--;
}
ma=max(tmp,ma);
//cout << ma << endl;
}
cout << sz+tz-ma << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
str a[60];
#define fi first
#define se second
#define DIRMAX 4
pair<int,int> dir[4]=
{
{ 0,-1},
{-1, 0},
{ 1, 0},
{ 0, 1},
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int h,w;cin>>h>>w;
ss maketop;
for(int i=0;i<w+2;i++)maketop<<".";
a[0]=maketop.str();
a[h+1]=maketop.str();
for(int i=0;i<h;i++)
{
str s;
cin>>s;
ss makemid;
makemid<<"."<<s<<".";
a[i+1]=makemid.str();
}
bool ans=true;
for(int i=1;i<=h;i++)for(int j=1;j<=w;j++)
{
if(a[i][j]=='#')
{
bool c=true;
for(int k=0;k<DIRMAX;k++)
if(a[i+dir[k].fi][j+dir[k].se]=='#')
{
c=false;
break;
}
if(c)
{
ans=false;
break;
}
}
}
puts(ans?"Yes":"No");
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n, m;
cin >> n >> m;
char c[n][m];
rep(i, n){
rep(j, m) cin >> c[i][j];
}
string s = "Yes";
int cnt;
rep(i, n){
rep(j, m){
if(c[i][j] == '.') continue;
cnt = 0;
if(i != 0 && c[i - 1][j] == '#') cnt++;
if(i != n - 1 && c[i + 1][j] == '#') cnt++;
if(j != 0 && c[i][j - 1] == '#') cnt++;
if(j != m - 1 && c[i][j + 1] == '#') cnt++;
if(cnt == 0) {
s = "No";
}
}
}
cout << s << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int N, S;
vector<pii> P, Q;
vector<int> sol;
int main() {
scanf("%d %d", &N, &S);
for(int i = 0; i < N; i++) {
int x, p; scanf("%d %d", &x, &p);
if(x < S) P.push_back({x, p});
else Q.push_back({x, p});
}
reverse(Q.begin(), Q.end());
if(P.size() == 0) {
printf("%d", Q[0].first - S);
return 0;
}
if(Q.size() == 0) {
printf("%d", S - P[0].first);
return 0;
}
int pos1 = 1, pos2 = 1, dir = (P[0].second < Q[0].second);
ll sum = 0;
sol.push_back(P[0].first);
sol.push_back(Q[0].first);
sum += P[0].second + Q[0].second;
if(P[0].second >= Q[0].second) swap(sol[0], sol[1]);
while(1) {
if(dir) {
while(pos1 < P.size() && sum > P[pos1].second) {
sum += P[pos1++].second;
}
if(pos1 < P.size() && sum <= P[pos1].second) {
sol.push_back(P[pos1].first);
sum += P[pos1].second;
pos1++;
dir ^= 1;
}
else break;
}
else {
while(pos2 < Q.size() && sum >= Q[pos2].second) {
sum += Q[pos2++].second;
}
if(pos2 < Q.size() && sum < Q[pos2].second) {
sol.push_back(Q[pos2].first);
sum += Q[pos2].second;
pos2++;
dir ^= 1;
}
else break;
}
}
sol.push_back(S);
ll ans = 0;
for(int i = 0; i < (int)sol.size() - 1; i++) {
ans += abs(sol[i] - sol[i + 1]);
}
printf("%lld", ans);
}
| #include <iostream>
using namespace std;
long long p[100001],x[100001],ans=0;
int n,s,l,r;
int main(){
cin>>n>>s;
for (int i=1;i<=n;i++)
cin>>x[i]>>p[i];
l=1;r=n;
while (l<=r){
if (s<=x[l]){
cout<<x[r]-s+ans;
return 0;
}
else if (s>=x[r]){
cout<<ans+s-x[l];
return 0;
} //所有住处都在s的一侧，可以直接开过去
if (p[l]>=p[r]){
ans+=x[r]-x[l];
while (l<r&&p[l]>=p[r]) p[l]+=p[r--];
}
else{
ans+=x[r]-x[l];
while (l<r&&p[l]<p[r]) p[r]+=p[l++];
}
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int n, m;
int a[1020], b[1020];
int vote[1020];
int main()
{
while(cin >> n>> m)
{
memset(vote, 0, sizeof vote);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=m;i++) scanf("%d",&b[i]);
for(int i=1;i<=m;i++)
{
int j = 1;
while(a[j] > b[i]) j++;
vote[j]++;
}
printf("%d\n",max_element(vote+1,vote+n+1)-vote);
}
return 0;
} | #include<stdio.h>
int main(){
int i,j,x,N,M,a[1000],b,c[1000];
scanf("%d%d",&N,&M);
//syokika
for(i=0;i<1000;i++){
c[i]=0;
}
//
for(i=0;i<N;i++){
scanf("%d",&a[i]);
}
for(i=0;i<M;i++){
scanf("%d",&b);
for(j=0;j<N;j++){
if(a[j]<=b){
c[j]++;
break;
}
}
}
x=0;
for(i=0;i<M;i++){
if(c[x]<c[i])x=i;
}
printf("%d\n",x+1);
return 0;
} | 1 |
#include<iostream>
int power[101];
int motor[101];
int cable[101];
int a, b, c, N;
int la[1024], lb[1024], lc[1024], lr[1024];
void print(){
int i;
for( i = 1; i <= a; i++ ){
std::cout << power[i] << std::endl;
}
for( i = 1; i <= b; i++ ){
std::cout << motor[i] << std::endl;
}
for( i = 1; i <= c; i++ ){
std::cout << cable[i] << std::endl;
}
return;
}
int input(){
int i;
std::cin >> a >> b >> c;
std::cin >> N;
for( i = 1; i <= a; i++ ){
power[i] = 2;
}
for( i = 1; i <= b; i++ ){
motor[i] = 2;
}
for( i = 1; i <= c; i++ ){
cable[i] = 2;
}
for( i = 0; i < N; i++ ){
std::cin >> la[i] >> lb[i] >> lc[i] >> lr[i];
}
return (a+b+c);
}
void check(){
int x, y, z, i;
for( i = 0; i < N; i++ ){
if( lr[i] == 0 ){ continue; }
x = la[i];
y = lb[i] - a;
z = lc[i] - a - b;
power[x] = 1;
motor[y] = 1;
cable[z] = 1;
}
for( i = 0; i < N; i++ ){
if( lr[i] == 1 ){ continue; }
x = la[i];
y = lb[i] - a;
z = lc[i] - a - b;
if( motor[y] == 1 && cable[z] == 1 ){
power[x] = 0;
}else if( power[x] == 1 && cable[z] == 1 ){
motor[y] = 0;
}else if( power[x] == 1 && motor[y] == 1 ){
cable[z] = 0;
}
}
return;
}
int main(){
while( input() != 0 ){
check();
print();
}
return 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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
vector<int> c2is[26];
vector<int> ls,rs;
int N;
string S,T;
int solve(){
cin>>N;
cin>>S>>T;
if(S==T){
return 0;
}
rep(i,N){
c2is[S[i]-'a'].pb(i);
}
int now=N-1;
int r=N-1;
for(int i=N-2;i>=-1;i--){
if(i==-1 || T[i]!=T[i+1]){
int l=i+1;
int c = T[i+1] -'a';
int id = upper_bound(all(c2is[c]),min(now,l))-c2is[c].begin()-1;
if(id==-1){
return -1;
}
int v = c2is[c][id];
// show(l);
// show(r);
// show(v);
// puts("");
ls.pb(v);
rs.pb(r);
r=i;
now=v-1;
}
}
reverse(all(ls));
reverse(all(rs));
int K=ls.size();
// show(ls);
// show(rs);
rep(i,K) ls[i]-=i;
int ans=0;
rep(i,K){
int r = rs[i];
int id = lower_bound(all(ls),r-i)-ls.begin()-i;
// show(id);
chmax(ans,id);
}
return ans;
}
int main(){
cout<<solve()<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Y;
cin >> N >> Y;
int a10000 = -1, b5000 = -1, c1000 = -1;
for(int a = 0; a <= N; a++){
for(int b = 0; a + b <= N; b++){
int c = N - a - b;
int total = 10000*a + 5000*b + 1000*c;
if(Y == total){
a10000 = a;
b5000 = b;
c1000 = c;
}
}
}
cout << a10000 << " " << b5000 << " " << c1000 << endl;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-19;
int main() {
ll n, y;
cin >> n >> y;
y /= 1000;
ll yc = 0;
for (ll i = 0; i < n+1; i++) {
for(ll j = 0; j < n+1; j++) {
if (i+j > n) continue;
yc = 10*i+5*j+(n-(i+j));
if (yc == y) {
printf("%lld %lld %lld", i, j, n-(i+j));
re0;
}
}
}
mes("-1 -1 -1");
} | 1 |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60) //1LL<<63でオーバーフロー
#define inf (1<<29) //1<<29でオーバーフロー
int main(int argc,char* argv[]){
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
int n;
ll y;
cin >> n >> y;
for(ll i=0;10000*i<=y;i++){
ll x=y-10000*i;
for(ll j=0;5000*j<=x;j++){
ll k=(x-5000*j)/1000;
if(i+j+k==n){
cout << i << " " << j << " " << k << endl;
return 0;
}
}
}
cout << -1 << " " << -1 << " " << -1 << endl;
return 0;
}
| #include<iostream>
#include<cmath>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
string ans = "-1 -1 -1";
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N; ++j) {
int k = N - j - i;
if (k < 0) continue;
if (i * 10000 + j * 5000 + k * 1000 == Y) {
ans = to_string(i) + ' ' + to_string(j) + ' ' + to_string(k);
break;
}
}
if (ans != "-1 -1 -1") break;
}
cout << ans << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string str;
cin>>k;
cin.ignore();
getline(cin,str);
int len = str.length();
if(len>k){
str[k]='.';
k++;
str[k] ='.';
k++;
str[k]='.';
for(int i=0;i<k+1;i++)
cout<<str[i];
}
else
cout<<str;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
//cin>>t;
while( t-- )
{
int k;
cin>>k;
string s;
cin>>s;
if( s.size()<=k )
cout<<s;
else
{
for( int i=0 ; i<k ; i++ )
cout<<s[i];
cout<<"..."<<endl;
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
int M;
cin >> M;
ll S = 0;
ll C = 0;
rep(i, M) {
ll d, c;
cin >> d >> c;
S += d * c;
C += c;
}
ll ans = C - 1;
ans += (S - 1) / 9;
cout << ans << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int main(){
long long a;
cin>>a;
vector<long long>v(2*a);
for(long long i=0;i<2*a;i++){
cin>>v[i];
}
priority_queue<long long> p(v.begin(),v.end());
long long sum=0;
while(!p.empty()){
p.pop();
sum+=p.top();
p.pop();
}
cout<<sum;
} | 0 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long int n;
cin >> n;
string ans;
do {
ans.push_back(97 + (--n % 26));
n /= 26;
} while (n > 0);
reverse(ans.begin(), ans.end());
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
vector<int> cnt(26, 0);
for (char c : s) {
cnt.at(c - 'a')++;
}
bool exists = false;
string res(s);
bool nextExists = false;
char next;
rep(i, cnt.size()) {
if (cnt.at(i) == 0) {
nextExists = true;
next = 'a' + i;
break;
}
}
if (nextExists) {
res.push_back(next);
exists = true;
} else {
while (!res.empty()) {
char c = res.substr(res.size() - 1, 1).c_str()[0];
res.pop_back();
cnt.at(c - 'a')--;
bool replaceExists = false;
char replace;
for (int i = c - 'a' + 1; i < cnt.size(); i++) {
if (cnt.at(i) == 0) {
replaceExists = true;
replace = 'a' + i;
break;
}
}
if (replaceExists) {
res.push_back(replace);
exists = true;
break;
}
}
}
if (exists) {
cout << res << endl;
} else {
cout << -1 << endl;
}
return 0;
}
| 0 |
Subsets and Splits