code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
const int INF = 0x3f3f3f3f, N = 1e5 + 5;
const ll LINF = 1e18 + 5;
int n;
ll Xor, c[N];
ll a[63], b[63];
int tot;
void insert(ll x)
{
for(int i=62;~i;i--)
{
if((x>>i)&1)
{
if(!a[i])
{
a[i] = x;
break;
}
x ^= a[i];
}
}
}
ll Max(ll x)
{
ll ans = x;
for(int i=62;~i;i--)
ans = max(ans,ans^a[i]);
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i=1; i<=n; i++)
{
cin >> c[i];
Xor ^= c[i];
}
for(int i=1; i<=n; i++)
insert((c[i]&(~Xor)));
ll A = Max(0);
ll B = Xor^A;
ll ans = A + B;
cout << ans;
return 0;
}
| #include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
typedef uint64_t ull;
typedef int64_t sll;
static const ull MOD = 1000000007LL;
int n;
int k;
int q;
ull a[200019];
ull umin (ull a, ull b) {
return (a < b) ? a : b;
}
ull umax (ull a, ull b) {
return (a > b) ? a : b;
}
ull solve () {
sll i, j, ki;
ull res = 0;
ull allxor = 0;
for (i = 0; i < n; i++) {
allxor ^= a[i];
}
for (i = 0; i < n; i++) {
a[i] &= ~allxor;
}
ull rank = 0;
for (i = 59; i >= 0; i--) {
for (j = rank; j < n; j++) {
if (a[j] & (1LL << i)) break;
}
if (j == n) {
continue;
}
if (j > rank) a[rank] ^= a[j];
for (j = rank + 1; j < n; j++) {
a[j] = umin(a[j], a[j] ^ a[rank]);
}
rank++;
}
ull x = 0;
for (i = 0; i < n; i++) {
x = umax(x, x ^ a[i]);
}
res = (x * 2) + allxor;
return res;
}
int main(void){
scanf("%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
printf("%lld\n", solve());
return 0;
}
| 1 |
#include <stdio.h>
int main(){
int a, b, c, d;
int K;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &K);
int diff1 = c - a;
int diff2 = d - b;
int min = (diff1 * 60) + diff2;
printf("%d", min - K);
return 0;
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
// freopen("input.txt", "r", stdin);
int main() {
vector<string> deck;
string s;
for(int i = 0; i < 3; i++) {
cin >> s;
reverse(s.begin(), s.end());
deck.push_back(s);
}
int idx = 0, nxt = 0;
while(!deck[idx].empty()) {
nxt = deck[idx].back()-'a';
deck[idx].pop_back();
idx = nxt;
// cout << idx << endl;
}
cout << char('A'+idx) << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main() {
int H,W,ans=0; cin>>H>>W;
vector<vector<char>> S(H,vector<char>(W));
queue<pair<int,int>> Q;
vector<vector<bool>> seen(H,vector<bool>(W,false));
rep(i,H){
rep(j,W){
cin>>S.at(i).at(j);
if(S.at(i).at(j)=='#'){
Q.push(make_pair(i,j));
seen[i][j]=true;
}
}
}
Q.push(make_pair(-1,-1));
while(!Q.empty()){
int x=Q.front().first,y=Q.front().second;
Q.pop();
if(x==-1&&y==-1){
if(Q.empty())continue;
ans++;
Q.push(make_pair(-1,-1));
continue;
}
rep(j,4){
int nx=x+dx[j],ny=y+dy[j];
if(nx<0 || nx>= H || ny<0 || ny>=W) continue;
if(seen[nx][ny]==false){
Q.push(make_pair(nx,ny));
seen[nx][ny]=true;
}
}
}
cout<<ans;
}
| #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 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
class Prints {
private:
class __Prints {
public:
__Prints(const char* sep, const char* term) : sep(sep), term(term) {}
template <class... Args>
void operator()(Args&&... args) const { print(std::forward<Args>(args)...); }
private:
const char *sep, *term;
void print() const { std::cout << term; }
void print_rest() const { std::cout << term; }
template <class T, class... Tail>
void print(T&& head, Tail&&... tail) const { std::cout << head, print_rest(std::forward<Tail>(tail)...); }
template <class T, class... Tail>
void print_rest(T&& head, Tail&&... tail) const { std::cout << sep << head, print_rest(std::forward<Tail>(tail)...); }
};
public:
Prints() {}
__Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
template <class T>
void print_vec(const std::vector<T>& vec, const char* sep = " ", const char* term = "\n") const {
const size_t sz = vec.size();
for (size_t i = 0; i < sz; i++) std::cout << vec[i] << (i == sz - 1 ? term : sep);
}
};
Prints prints;
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
void solve() {
ll N;
cin >> N;
Vl A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
Vl cum(N + 1);
for (ll i = 0; i < N; i++) {
cum[i + 1] = cum[i] + A[i];
}
ll ans = L_INF;
ll idx1 = 1, idx2 = 3;
for (ll i = 2; i < N - 1; i++) {
while (idx1 < i && cum[idx1] < cum[i] - cum[idx1]) {
++idx1;
}
while (idx2 < N - 1 && cum[idx2] - cum[i] < cum[N] - cum[idx2]) {
++idx2;
}
ll p1 = cum[idx1 - 1];
ll p2 = cum[idx1];
ll q1 = cum[i] - cum[idx1 - 1];
ll q2 = cum[i] - cum[idx1];
ll r1 = cum[idx2 - 1] - cum[i];
ll r2 = cum[idx2] - cum[i];
ll s1 = cum[N] - cum[idx2 - 1];
ll s2 = cum[N] - cum[idx2];
ll t = L_INF;
t = min(t, max({p1, q1, r1, s1}) - min({p1, q1, r1, s1}));
t = min(t, max({p2, q2, r1, s1}) - min({p2, q2, r1, s1}));
t = min(t, max({p1, q1, r2, s2}) - min({p1, q1, r2, s2}));
t = min(t, max({p2, q2, r2, s2}) - min({p2, q2, r2, s2}));
ans = min(ans, t);
}
prints()(ans);
}
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
int main() {
#ifdef FASTIO
cin.tie(0), cout.tie(0);
ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
ifstream ifs("./in_out/input.txt");
cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
ofstream ofs("./in_out/output.txt");
cout.rdbuf(ofs.rdbuf());
#endif
cout << setprecision(18) << fixed;
solve();
cout << flush;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n,q;
string s;
// int ans=0;
int k;
cin >>n>>s>>q;
V data(2);//d,dm
Vi sum(s.size()+1, 0);
rep(i, s.size()) {
sum[i] += (s[i] == 'M');
if(i!=0){
sum[i] += sum[i - 1];
}
}
// clog << sum << endl;
ll ans = 0LL;
rep(i, q) {
cin >> k;
ans = 0LL;
data[0] = 0LL;
data[1] = 0LL;
rep(i,s.size()){
if (i >= k) {
if (s[i - k] == 'D') {
data[0]--;
data[1] -= sum[i-1] - sum[i - k];
}
// clog << "(" << s[i - k] << ") ";
}
switch (s[i])
{
case 'D':
data[0]++;
break;
case 'M':
data[1] += data[0];
break;
case 'C':
ans += data[1];
break;
}
// clog << data << " "<<s[i]<<endl;
}
cout << ans << endl;
}
} | 0 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
int cnt = 0;
vector<int> insertion_sort(vector<int> a, int n, int g) {
for(int i=g; i<n; i++){
int key = a[i];
int j = i - g;
while(j >= 0 && a[j] > key){
a[j+g] = a[j];
j -= g;
cnt++;
}
a[j+g] = key;
}
return a;
}
vector<int> shell_sort(vector<int> a, int n){
cnt = 0;
int m = 11;
int mm = m;
int g[] = {1, 2, 8, 32, 128, 512, 2048, 2048*4, 2048*16, 2048*64, 2048*256};
REP(i, m){
if(g[m-1-i] > n)
mm--;
}
cout << mm << endl;
REP(i, mm-1){
cout << g[mm-1-i] << " ";
a = insertion_sort(a, n, g[mm-1-i]);
}
cout << g[0] << endl;
a = insertion_sort(a, n, g[0]);
return a;
}
/*
vector<string> selection_sort(vector<string> s){
int n = s.size();
vector<int> a;
REP(i, n)
a.push_back(atoi(s[i].substr(1, 1).c_str()));
REP(i, n){
int mini = i;
for(int j = i; j < n ; j++){
if(a[j] < a[mini])
mini = j;
}
if(i != mini){
swap(a[i], a[mini]);
swap(s[i], s[mini]);
}
}
return s;
}
vector<string> bubble_sort(vector<string> s) {
int n = s.size();
vector<int> a;
REP(i, n)
a.push_back(atoi(s[i].substr(1, 1).c_str()));
REP(i, n)
for(int j = n - 1; j > i; j--)
if(a[j] < a[j-1]){
swap(a[j], a[j-1]);
swap(s[j], s[j-1]);
}
return s;
}
int find(vector<string> target, string query){
int i = 0;
vector<string>::iterator iter = target.begin();
while(iter != target.end()){
if (*iter == query)
break;
i++;
iter++;
}
return i;
}
*/
int main() {
int n;
cin >> n;
int in[n];
vector<int> a;
REP(i, n) { cin >> in[i]; a.push_back(in[i]);}
a = shell_sort(a, n);
cout << cnt << endl;
REP(i, n)
cout << a[i] << endl;
return 0;
} | #define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define all(c) begin(c), end(c)
#define tr(i,c) for(auto i=begin(c);i!=end(c);i++)
#define rtr(i,c) for(auto i=(c).rbegin();i!=(c).rend();i++)
#define rep(i,b) for(auto i=0;i<(b);i++)
#define pb push_back
#define sz(c) int((c).size())
int cnt, m;
vi G;
void insertionSort(vi& A, int n, int g) {
for (int i = g; i < n; i++) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j+g] = A[j];
j = j - g;
cnt++;
}
A[j+g] = v;
}
}
void shellSort(vi& A, int n) {
cnt = 0;
G = vi(0);
int g = 1;
do {
G.pb(g);
g = g*3 + 1;
} while (g <= n);
reverse(all(G));
m = sz(G);
for (auto& g:G) {
insertionSort(A, n, g);
}
}
void dump(vi& A, const string& sep) {
string sp = "";
for (auto& a:A) {
cout << sp << a;
sp = sep;
}
cout << endl;
}
int main(int argc, char **argv)
{
vi A;
int n;
cin >> n;
A = vi(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
shellSort(A, n);
cout << m << endl;
dump(G, " ");
cout << cnt << endl;
dump(A, "\n");
return 0;
} | 1 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,a,b,i;
cin>>n;
vector<pair<pair<int,int>,int>> pts;
for (i=0;i<n;i++)
{
cin>>a>>b;
pts.pb(mp(mp(a,b),0));
}
for (i=0;i<n;i++)
{
cin>>a>>b;
pts.pb(mp(mp(a,b),1));
}
sort(pts.begin(),pts.end());
set<pair<int,int>> s;
int ans=0,mark[2*n]={0};
for (i=0;i<2*n;i++)
{
if (pts[i].ss==0)
s.insert(mp(pts[i].ff.ss,i));
else
{
int choose=-1;
for (auto e: s)
{
if (e.ff<pts[i].ff.ss && mark[e.ss]==0)
choose=e.ss;
}
if (choose!=-1)
{
ans++;
mark[i]=1;
mark[choose]=1;
}
}
}
cout<<ans<<endl;
}
| #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)
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(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
int m;
cin >> m;
vector<P> v(m);
for (P &p:v)cin >> p.first >> p.second;
ll n = 0, s = 0;
for (P p : v) n += p.second;
for (P p : v) s += (p.first * p.second);
ll start = 9 * n + s;
ll fin = s % 9;
if (fin == 0) fin += 9;
ll ans = (start - fin) / 9 - 1;
cout << ans << endl;
}
| 0 |
#include <iostream>
using namespace std;
int main(){
int n;
while( cin >> n, n ){
int pm, pe, pj;
while( n-- > 0 ){
cin >> pm >> pe >> pj;
if( pm == 100 || pe == 100 || pj == 100 ||
(pm+pe)/2 >= 90 || (pm+pe+pj)/3 >= 80 ){
cout << 'A' << endl;
}else if( (pm+pe+pj)/3 >= 70 || ((pm+pe+pj)/3 >= 50 && (pm >= 80 ||pe >=80))){
cout << 'B' << endl;
}else{
cout << 'C' << endl;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 11;
int a[N];
int main() {
ios :: sync_with_stdio(false);
int n;
while(cin >> n) {
if(n == 0) break;
for(int i = 0; i < n; i ++)
cin >> a[i];
int ans = a[0], pre = min(a[0], 0);
for(int i = 1; i < n; i ++) {
a[i] += a[i - 1];
ans = max(ans, a[i] - pre);
pre = min(pre, a[i]);
}
cout << ans << '\n';
}
return 0;
} | 0 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
const int MAX = 510000;
const int MOD = 1000000007;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
// 約数の列挙
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
return res;
}
int main(){
ll N;cin>>N;
ll a,b;cin>>a>>b;
ll c;
if(N==2){
c = gcd(a,b);
}
else{
c = gcd(a, gcd(b,c));
}
vector<ll> v = divisor(c);
sort(v.begin(),v.end());
rep(i,v.size()){
cout<<v[i]<<endl;
}
}
| #include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
int a,b,c = 100000001;
if(n == 2)cin >> a >> b;
if(n == 3)cin >> a >> b >> c;
int mn = min(a,min(b,c));
if(n == 2)c = 0;
for(int i = 1 ; i <= mn ; i++ ){
if(a%i == 0 && b%i == 0 && c%i == 0)cout << i << endl;
}
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
if (k > *max_element(v.begin(), v.end())) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
int g = v[0];
int flag = 0;
for (int i = 1; i < n; i++) {
g = gcd(g, v[i]);
if (v[i] == k) flag = 1;
}
if (abs(v[0] - k) % g == 0) flag = 1;
if (flag) {
cout << "POSSIBLE" << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
| #include<bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = int_fast64_t;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
void answer() {
int N;
cin >> N;
vpr L, R;
vector<string> vec(N);
rep(i, N) {
string s;
cin >> s;
vec[i] = s;
int sz = s.size();
int maxl = 0, maxr = 0, l = 0, r = 0;
rep(j, sz) {
if(s[j] == ')') l++;
else l--;
chmax(maxl, l);
if(s[sz-j-1] == '(') r++;
else r--;
chmax(maxr, r);
}
if(maxl <= maxr) L.push_back(make_pair(maxl, i));
else R.push_back(make_pair(maxr, i));
}
sort(ALL(L), less<pair<ll, ll>>());
sort(ALL(R), greater<pair<ll, ll>>());
copy(ALL(R), back_inserter(L));
int cnt = 0;
for(auto& l : L) {
int sz = vec[l.second].size();
rep(j, sz) {
if(vec[l.second][j] == '(') cnt++;
else cnt--;
if(cnt < 0) {
cout << "No\n";
return;
}
}
}
if(cnt == 0) cout << "Yes\n";
else cout << "No\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<62;
const int IINF = 1000000000;
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; }
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
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]--;
}
// vectorは末尾の削除は早いが、先頭は遅いのでreverse
reverse(A[i].begin(), A[i].end());
}
vector<pair<int,int>> 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<pair<int,int>> prevQ;
// prevQにqを入れて, qを空にする。
// vectorのswapは早い
swap(prevQ, q);
for (auto p : prevQ){
int i = p.first, j = p.second;
// 試合を行う。
// pop_back()は末尾の要素の削除
A[i].pop_back();
A[j].pop_back();
}
// 翌日の試合を登録
for (auto p : prevQ){
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i,N){
// 試合が残ってしまったら-1
if (A[i].size() != 0){
puts("-1");
return 0;
}
}
cout << day << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
ll n;
vector<vector<ll>> graph(1000*1000);
vector<ll> vdist(1000*1000,-1);
vector<ll> seen(1000*1000,-1);
ll dfs(ll now)
{
if(seen.at(now) == 2) return vdist.at(now);
seen.at(now) = 1;
ll tmp = 0;
for(auto next:graph.at(now)){
if(seen.at(next) == 1){
cout << -1 << endl;
exit(0);
}
tmp = max(tmp, dfs(next)+1);
}
seen.at(now) = 2;
return vdist.at(now) = tmp;
}
int main()
{
ll i,j;
cin >> n;
for(i = 0;i < n;++i){
ll p = 0;
rep(j,n-1){
ll k;
cin >> k;
--k;
ll ni = min(i,k);
ll nj = max(i,k);
ll next = ni*n + nj;
graph.at(p).push_back(next);
p = next;
}
}
vdist.at(0) = 0;
dfs(0);
cout << vdist.at(0) << endl;
return 0;
} | 1 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int N,i,j,k,ans=0;
cin>>N;
vector<int> L(N);
for (i=0;i<N;i++) cin>>L[i];
for (i=0;i<N-2;i++) {
for (j=i+1;j<N-1;j++) {
if (L[i]==L[j]) continue;
for (k=j+1;k<N;k++) {
if (L[i]==L[k] || L[j]==L[k]) continue;
if (L[i] < L[j]+L[k] && L[j] < L[i]+L[k] && L[k] < L[j]+L[i]) ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
/*
N=1000ならN*Nで順番付けできそう
違うかな
BFSみたいな
1-2
2-1ならOK
1-2
2-3
3-2
ならOK
みたいな
先頭同士でペアが作れるかどうか
a<bでpair{a,b}を格納して、ペアになったらOKとか
TLEなんだが
N^3になるのか
マッチしたやつだけ再検査すればいいのかな
毎回入れなおしがきつい
*/
int main(){
ll N; cin>>N;
ll end=N*(N-1);
end/=2;
vector<queue<ll>> Q(N+1);
queue<pair<ll,ll>> next_Q;
for(ll i=1; i<=N; i++){
for(ll j=1; j<N; j++){
ll a; cin>>a;
Q[i].emplace(a);
}
}
ll day=1,cnt=0;
//初期
for(ll i=1; i<=N; i++){
ll a=i, b=Q[i].front();
if(a>b) swap(a,b);
next_Q.push({a,b});
}
set<pair<ll,ll>> S;
while(!next_Q.empty()){
//cout<<"day:"<<day<<" cnt:"<<cnt<<endl;
ll Qsz=next_Q.size();
//cout<<"Qsz:"<<Qsz<<endl;
for(ll i=0; i<Qsz; i++){
auto n=next_Q.front();
ll n1=n.first, n2=n.second;
//cout<<"n1:"<<n1<<" n2:"<<n2<<endl;
next_Q.pop();
auto IT=S.find({n1,n2});
if(IT!=S.end()){
Q[n1].pop();
Q[n2].pop();
S.erase(IT);
cnt++;
ll m1=Q[n1].front();
if(m1>0){
if(n1>m1) swap(n1,m1);
next_Q.push({n1,m1});
}
ll m2=Q[n2].front();
if(m2>0){
if(n2>m2) swap(n2,m2);
next_Q.push({n2,m2});
}
}
else S.insert({n1,n2});
}
if(cnt==end) break;
day++;
}
if(cnt==end) cout<<day<<endl;
else cout<<-1<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename Graph>
struct StronglyConnectedComponents {
Graph &g;
int n;
vector<vector<int>> gg;
vector<vector<int>> rg;
vector<bool> used;
vector<int> order;
vector<int> comp;
StronglyConnectedComponents(Graph &g)
: g(g), n(g.n), gg(n), rg(n), used(n), order(n), comp(n, -1) {
for (int v = 0; v < n; v++) {
for (auto e : g[v]) {
gg[v].emplace_back(e.to);
rg[e.to].emplace_back(v);
}
}
}
void dfs1(int v) {
if (used[v]) return;
used[v] = true;
for (int u : gg[v]) dfs1(u);
order.push_back(v);
}
void dfs2(int v, int c) {
if (comp[v] != -1) return;
comp[v] = c;
for (int u : rg[v]) dfs2(u, c);
}
vector<int> build() {
for (int i = 0; i < n; i++) {
dfs1(i);
}
reverse(order.begin(), order.end());
int ptr = 0;
for (int v : order) {
if (comp[v] == -1) dfs2(v, ptr), ptr++;
}
return comp;
}
};
struct UnWeightedGraph {
struct Edge {
int to;
Edge(int to) : to(to) {}
};
vector<vector<Edge>> edges;
int n;
UnWeightedGraph(int n) : n(n) {
edges.assign(n, vector<Edge>());
}
void add_edge(int v, int u) {
edges[v].emplace_back(u);
}
vector<Edge> &operator[](int x) {
return edges[x];
}
};
int main() {
int V, E; cin >> V >> E;
auto graph = UnWeightedGraph(V);
for (int i = 0; i < E; i++) {
int s, t; cin >> s >> t;
graph.add_edge(s, t);
}
auto scc = StronglyConnectedComponents<UnWeightedGraph>(graph);
auto ans = scc.build();
int Q; cin >> Q;
for (int i = 0; i < Q; i++) {
int v, u; cin >> v >> u;
cout << (ans[v] == ans[u]) << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
#define DEBUG5(var0, var1, var2, var3, var4) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG4(var1,var2,var3,var4); }
#define DEBUG6(var0, var1, var2, var3, var4, var5) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG5(var1,var2,var3,var4,var5);}
typedef long long ll;
#define MAX_V 100100
int V;
vector <pair <int,ll> > edge[MAX_V];
vector <pair <int,ll> > Redge[MAX_V];
vector <int> vs;
bool used[MAX_V];
int cmp[MAX_V];
void reverse_edge(){
rep2(i,1,V+1){//1-indexedにしてます
rep(j,sz(edge[i])){
Redge[edge[i][j].fir].pb(mp(i,edge[i][j].sec));
}
}
}
void dfs(int now){
used[now] = true;
rep(i,sz(edge[now])){
if(!used[edge[now][i].fir]){
dfs(edge[now][i].fir);
}
}
vs.pb(now);
}
void rdfs(int now,int k){
used[now] = true;
cmp[now] = k;
rep(i,sz(Redge[now])){
if(!used[Redge[now][i].fir]){
rdfs(Redge[now][i].fir,k);
}
}
}
int scc(){
memset(used,0,sizeof(used));
vs.clear();
rep2(v,1,V+1){//1-indexed
if(!used[v]){
dfs(v);
}
}
memset(used,0,sizeof(used));
reverse_edge();
int k = 0;
for(int i = sz(vs)-1;i >= 0;i--){
if(!used[vs[i]]){
k += 1;
rdfs(vs[i],k);
}
}
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> V;
int E;
cin >> E;
rep(i,E){
int x,y;
cin >> x >> y;
x += 1;
y += 1;
edge[x].pb(mp(y,1));
}
scc();
int Q;
cin >> Q;
rep(i,Q){
int x,y;
cin >> x >> y;
x += 1;
y += 1;
if(cmp[x] == cmp[y]){
cout << 1 << endl;
}else{
cout << 0 << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
main(){
int e;
while(cin>>e,e){
int ans=1e9;
for(int z=0;;z++){
if(z*z*z>e)break;
for(int y=0;;y++){
if(z*z*z+y*y>e)break;
int a=e-z*z*z-y*y;
ans=min(ans,a+y+z);
}
}
cout<<ans<<endl;
}
}
| #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include <cctype>
#include <climits>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef vector<pair<int, int> > vpii;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define dbg(x) cout << #x"="<< (x) << endl
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back(a)
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second
using namespace std;
int sum[5001];
int main(){
int N;
int ans = 0;
while(cin>>N&&N){
int index=0;
ans = INT_MIN;
FOR(i,1,N+1){
cin>>sum[i];
sum[i] += sum[i-1];
}
FOR(i,1,N+1){
FOR(j,i,N+1){
ans = max(ans,sum[j]-sum[i-1]);
}
}
cout<< ans <<endl;
}
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int solve(int n, vector<int> & dims){
int dp[100][101] = {{0}};
for (int span = 2; span != n + 1; ++span){
for (int first = 0; first + span != n + 1; ++first){
for (int last = first + span; last != n + 1; ++last){
int record = 2000000000;
for (int mid = first + 1; mid != last; ++mid){
record = min(record, dp[first][mid] + dp[mid][last] + dims[first] * dims[last] * dims[mid]);
}
dp[first][last] = record;
}
}
}
return dp[0][n];
}
int main()
{
int n = 0;
cin >> n;
vector<int> dims(n + 1);
int r = 0;
int c = 0;
for (int i = 0; i != n; ++i){
cin >> r >> c;
dims[i] = r;
}
dims[n] = c;
cout << solve(n, dims) << endl;
return 0;
} | #include <cstdio>
#include <algorithm>
using namespace std;
const int kMax = 100 + 5;
int n;
int num[kMax], dp[kMax][kMax];
int main() {
scanf("%d", &n);
for(int i = 1;i <= n;++ i) scanf("%d%d", &num[i-1], &num[i]);
for(int l = 2;l <= n;++ l) {
for(int i = 1;i <= n - l + 1;++ i) {
int j = i + l - 1;
dp[i][j] = (1 << 30);
for(int k = i;k < j;++ k) dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + num[i-1] * num[k] * num[j]);
}
}
printf("%d\n", dp[1][n]);
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_postal_code(void) {
int a, b;
string s;
string msg = "Yes";
cin >> a >> b >> s;
if (s.size() != a + b + 1) msg = "No";
else if (s[a] != '-') msg = "No";
else {
for (int i = 0; i < a + b + 1; i++) {
if (i == a) continue;
if (s[i] == '-') {
msg = "No";
break;
}
}
}
cout << msg << endl;
}
int main()
{
b_postal_code();
return 0;
} | #include<stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
int sum = A + B + 1;
char str[sum];
scanf("%s", &str);
int ctr = 0;
for(int i = 0; i < sum; i++){
if(i == A){
if(str[i] != '-'){
printf("No\n");
return 0;
}
}else{
if(str[i] >= '0' && str[i] <= '9'){
++ctr;
}
}
}
if(ctr == A+B){
printf("Yes\n");
}else{
printf("No\n");
}
} | 1 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
using namespace std;
#define N 1001
#define M 20
#define mod 998244353
vector<int> adj[N];
int vis[N],par[N];
int depth[N];
int anc[N][M];
int outSize = 100000;
vector<int> ret;
void dfs(int node) {
vis[node] = 1;
for(int i=0;i<adj[node].size();++i) {
int ch = adj[node][i];
if(vis[ch] ) {
if(depth[node]<=depth[ch]) continue;
int diff = depth[node] - depth[ch];
int tmp = node;
for(int j= 0;j<M;++j) {
if(diff&(1<<j)) {
tmp = anc[tmp][j];
}
}
if(tmp!=ch || outSize <=diff) {
continue;
}
tmp = node;
ret.clear();
outSize = diff;
while(true) {
ret.push_back(tmp);
if(tmp==ch) break;
tmp = par[tmp];
}
} else {
depth[ch] = depth[node] + 1;
anc[ch][0] = node;
for(int j=1;j<M;++j) {
anc[ch][j] = anc[anc[ch][j-1]][j-1];
}
par[ch] = node;
dfs(ch);
}
}
}
void solve() {
int n,m;scanf("%d %d",&n,&m);
for(int i=0;i<m;++i) {
int a,b;scanf("%d %d",&a,&b);
adj[a].push_back(b);
}
for(int st=1;st<=n;++st) {
memset(vis,0,sizeof(vis));
depth[st] = 0;
for(int j=0;j<M;++j) anc[st][j] = 0;
dfs(st);
}
if(outSize==100000) {
printf("-1\n");
} else {
printf("%d\n",ret.size());
for(int i=0;i<ret.size();++i) {
printf("%d\n", ret[i]);
}
}
}
int main() {
//freopen("input.txt","r",stdin);
solve();
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <iomanip>
#include <complex>
#define rep(i, j, n) for (int i = (j); i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; i >= (j); --i)
using namespace std;
using ll = long long;
constexpr ll INF = 1LL << 60;
int n, m, a, b;
vector<int> g[1010];
int main()
{
int n, m;
cin >> n >> m;
rep(i, 0, m)
{
cin >> a >> b;
--a;
--b;
g[a].push_back(b);
}
ll ans = INF;
vector<int> out;
rep(i, 0, n)
{
// i スタートの最小のサイクル
vector<int> prev(n, -1);
vector<bool> seen(n, false);
queue<int> q;
bool cycle = false;
q.push(i);
while (q.size())
{
int v = q.front();
q.pop();
for (int nv : g[v])
{
if (nv == i)
{
prev[i] = v;
cycle = true;
break;
}
if (!seen[nv])
{
seen[nv] = true;
prev[nv] = v;
q.push(nv);
}
}
if (cycle)
break;
}
if (cycle)
{
int j = i;
vector<int> tmp;
while (prev[j] != i)
{
tmp.push_back(j);
j = prev[j];
}
tmp.push_back(j);
if ((int)tmp.size() < ans)
{
ans = (int)tmp.size();
out = tmp;
}
}
}
if (ans == INF)
cout << -1 << endl;
else
{
cout << out.size() << '\n';
for (int o : out)
cout << o + 1 << '\n';
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
n -= 2;
cout << n * 180 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table. at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < table.size(); i++) {
for (int j = 0; j < table.at(0).size(); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n,r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) {
return comb(n + r - 1, n - 1);
}
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
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 * b / gcd(a, b);
}
bool isprime(int n){
if (n < 2) return false;
else if (n == 2) return true;
else if (n % 2 == 0) return false;
for (int i = 3; i <= sqrt(n); i += 2){
if (n % i == 0){
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N/i != i) res.push_back(N/i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
/*long long N;
cin >> N;
vector<long long> res = divisors(N);
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << endl;*/
}
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
void sayYes(bool f) {
if (f) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
void sayYES(bool f) {
if (f) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
int main() {
int n;
cin >> n;
cout << (n-2)*180 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll M;
deque<ll> d;
deque<ll> c;
deque<ll> e;
int main(){
cin >> M;
for(int i=0;i<M;i++){
ll a,b;
cin >> a >> b;
d.push_back(a);
c.push_back(b);
}
ll count = 0;
while(d.size() > 0){
if(c[0] == 1){
e.push_back(d[0]);
c.pop_front();
d.pop_front();
continue;
}
ll dd = d[0];
ll cc = c[0];
c.pop_front();
d.pop_front();
if(dd < 5){
if(cc % 2 == 1){
c.push_front(1);
d.push_front(dd);
}
c.push_front(cc/2);
d.push_front(dd*2);
count += cc/2;
continue;
}
if(cc % 2 == 1){
c.push_front(1);
d.push_front(dd);
}
dd = (dd*2)/10 + (dd*2)%10;
c.push_front(cc/2);
d.push_front(dd);
count += cc/2 * 2;
}
while(e.size() > 1){
ll a = e[0];
ll b = e[1];
e.pop_front();
e.pop_front();
if(a+b < 10){
count++;
e.push_front(a+b);
}else{
count += 2;
e.push_front((a+b)/10 + (a+b)%10);
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
int main(){
int N; cin >> N;
ll nofd = 0, sum = 0;
rep(i,N){
ll d,c; cin >> d >> c;
nofd += c;
sum += d*c;
}
cout << (nofd - 1) + (sum-1)/9 << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
const int MOD_TYPE = 1;
const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const ld PI = acos(-1.0);
const ld EPS = 1e-11;
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(30) << setiosflags(ios::fixed);
int n;
cin >> n;
string s[3];
rep(i, 3) cin >> s[i];
int cnt = 0;
rep(i, n)
{
if (s[0][i] == s[1][i] && s[1][i] == s[2][i])
continue;
if (s[0][i] != s[1][i] && s[1][i] != s[2][i] && s[0][i] != s[2][i])
cnt += 2;
else
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll h,w;
ll direction2[4][2]={{1,0},{0,1},{0,-1},{-1,0}};
bool valid(int a,int b)
{
if(a>=1&&a<=h&&b>=1&&b<=w)return true;
else return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x=1000000;
cin>>n;
unordered_map<ll,ll>nw,ne;
string s;
cin>>s;
for(int i=0;i<n;i++){
if(s[i]=='W')nw[i]=1+nw[i-1];
else nw[i]=nw[i-1];
if(s[n-i-1]=='E')ne[n-i-1]=1+ne[n-i];
else ne[n-i-1]=ne[n-i];
}
for(int i=0;i<n;i++){
x=min(x,(nw[i-1]+ne[i+1]));
//cout<<nw[i-1]<<" "<<ne[i+1]<<endl;
}
cout<<x;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c) for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define mp make_pair
#define pb push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }
#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9
int n;
int a, b;
int main()
{
while((cin >> n) && n){
int res[2] = {0};
while(n--){
cin >> a >> b;
if(a > b){ res[0] += a + b; continue; }
if(a < b){ res[1] += a + b; continue; }
res[0] += a;
res[1] += b;
}
cout << res[0] << " " << res[1] << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
int m;
cin>>m;
if(n==0&&m==0){break;}
vector<vector<int>> v(n+1);//??¨?????????
vector<int> s(n+1,0);//??????
s[1]=1;
for(int i=0;i<m;i++){
int a;
cin>>a;
int b;
cin>>b;
v[a].push_back(b);
v[b].push_back(a);
}
vector<vector<int>> r(n+1);//?????°???????????¨
r[0].push_back(1);
int num=0;
while(1){
int change=0;
if(r[num].empty()==false){
for(unsigned int j=0;j<r[num].size();j++){
for(unsigned int i=0;i<v[r[num][j]].size();i++){
if(s[v[r[num][j]][i]]==0){
s[v[r[num][j]][i]]=1;
r[num+1].push_back(v[r[num][j]][i]);
change=1;
}
}
}
}
if(change==0){break;}
if(num==1){break;}
num++;
}
int kazu=0;
for(unsigned int i=0;i<s.size();i++){
if(s[i]==1){kazu++;}
}
cout<<kazu-1<<endl;
}
} | 0 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
cin >> n;cin.get( );
//n++;
string ss;
for(int j=0;j<n;j++)
{
getline(cin,ss);
int len =ss.size();
for(int i=6;i<len;i++)
{
//cout << ss[i];
if(ss.substr(i-6,7)=="Hoshino")
{
ss[i]='a';
}
//if(ss[i]=='\0')break;
}
/*for(int i=0;i<len;i++){
if(ss[i]=='\0')break;
cout <<ss[i];
}*/
cout <<ss << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
vector<int> antenna (5);
REP(i,5){
cin >> antenna[i];
}
int k;
cin >> k;
REP(i,4){
FOR(j,i,5){
if (antenna[j] - antenna[i] > k){
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | 0 |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<sstream>
#include<cstdlib>
using namespace std;
int main(){
while(1){
int n,k;
scanf("%d%d",&n,&k);
if(n==0)
break;
vector<int> card(n);
for(int i=0;i<n;i++){
scanf("%d",&card[i]);
}
sort(card.begin(),card.end());
vector<int> data;
do{
stringstream sst;
for(int i=0;i<k;i++){
sst<<card[i];
}
data.push_back(atoi(sst.str().c_str()));
reverse( card.begin()+k,card.end());
}while( next_permutation(card.begin(),card.end()) );
sort(data.begin(),data.end());
printf("%d\n",distance(data.begin(),unique(data.begin(),data.end())) );
}
} | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
using namespace std;
#define sz size()
#define lgt length()
#define rep(i,n) for (int i = 0; i < n; i++)
#define ALL(X) (X).begin(),(X).end()
#define RALL(X) (X).rbegin(),(X).rend()
#define pb push_back
#define SORT(a) sort(ALL(a));
#define RSORT(a) sort(RALL(a));
#define mp make_pair
#define dump(x) cerr<<#x<<" = "<<(x)<<endl;
#define fir first
#define sec second
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<string> vs;
int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
vs form(string a,char s){vs v;string b;rep(i,a.lgt){if(a[i]==s){v.pb(b);b="";}else b+=a[i];}v.pb(b);return v;}
vi formint(string a,char s){vi v;string b;rep(i,a.lgt){if(a[i]==s){v.pb(toInt(b));b="";}else b+=a[i];}v.pb(toInt(b));return v;}
const double EPS=1e-10,PI=acos(-1.0);
const int INF=2100000000;
int main(void)
{
int n, k;
while (cin >> n >> k, n && k){
string num[16];
vector <string> ans;
for (int i = 0; i < n; i++) cin >> num[i];
if (k == 2){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (i != j){
// cout << i << " " << j << endl;
string tmp;
tmp += num[i];
tmp += num[j];
// cout << "*" << tmp << endl;
ans.pb(tmp);
}
}
}
}
if (k == 3){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
for (int k = 0; k < n; k++){
if (i != j && j != k && i != k){
string tmp;
tmp += num[i];
tmp += num[j];
tmp += num[k];
ans.pb(tmp);
}
}
}
}
}
if (k == 4){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
for (int k = 0; k < n; k++){
for (int l = 0; l < n; l++){
if (i != j && i != k && i != l && j != k && j != l && k != l){
string tmp;
tmp += num[i];
tmp += num[j];
tmp += num[k];
tmp += num[l];
ans.pb(tmp);
}
}
}
}
}
}
ans.pb("2100000000");
SORT(ans);
int res = 0;
for (int i = 0; i < ans.sz - 1; i++){
if (ans[i] != ans[i + 1]) res++;
}
cout << res << endl;
}
return 0;
} | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define sint(n) scanf("%d",&n);
using namespace std;
int main(){
while(1){
int a,b,c;
sint(a)
sint(b)
sint(c)
if(a==0){break;}
int k;
sint(k)
int buhin[301]={0};
rep(i,301){
buhin[i]=2;
}
int e[1000],r[1000],t[1000],u[1000];
rep(i,k){
scanf("%d%d%d%d",&e[i],&r[i],&t[i],&u[i]);
if(u[i]==1){
buhin[e[i]]=buhin[r[i]]=buhin[t[i]]=1;
}
}
rep(i,k){
if(u[i]==0){
if(buhin[e[i]]==1 && buhin[r[i]]==1){
buhin[t[i]]=0;
}
if(buhin[e[i]]==1 && buhin[t[i]]==1){
buhin[r[i]]=0;
}
if(buhin[t[i]]==1 && buhin[r[i]]==1){
buhin[e[i]]=0;
}
}
}
rep(i,a+b+c){
printf("%d\n",buhin[i+1]);
}
}
}
/*
2 2 2
4
2 4 5 0
2 3 6 0
1 4 5 0
2 3 5 1
*/ | #include <iostream>
using namespace std;
struct results{
int a;
int b;
int c;
int result;
};
int main(){
while(true){
int parts[1000]={0};
int aa,bb,cc,n;
cin >> aa >> bb >> cc;
if(aa+bb+cc==0)
break;
cin >> n;
results data[1000];
for( int i=0 ; i<n ; i++ )
cin >> data[i].a >> data[i].b >> data[i].c >> data[i].result;
for( int all_counter=0 ; all_counter<2 ; all_counter++)
for( int i=0 ; i<n ; i++ ){
if(data[i].result){
parts[data[i].a]=1;
parts[data[i].b]=1;
parts[data[i].c]=1;
}
else{
int level=parts[data[i].a]+parts[data[i].b]+parts[data[i].c];
if(level>1){
parts[data[i].a]==0?parts[data[i].a]=-1:0;
parts[data[i].b]==0?parts[data[i].b]=-1:0;
parts[data[i].c]==0?parts[data[i].c]=-1:0;
}
}
}
for( int i=0+1 ; i<=aa+bb+cc ; i++ )
if(parts[i]==-1)
cout << 0 << endl;
else if(parts[i]==0)
cout << 2 << endl;
else
cout << 1 << endl;
}
return 0;
} | 1 |
//author rhythmicankur
//god_is_almighty
#pragma GCC optimize("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ll int
#define ld long double
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pip pair<int,pii>
#define vpi vector<pii>
#define sbcount(x) __builtin_popcountll(x)
#define REP(i,n) for (int i = 1; i <= n; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define fill(a,val) memset(a,val,sizeof(a))
#define PI acos(-1)
#define coud(a,b) cout<<fixed << setprecision((b)) << (a)
#define M1 998244353
#define M2 1000000007
#define mod 2038077799
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
template<typename T> T gcd(T a,T b) { if(a==0) return b; return gcd(b%a,a); }
#define test4(x,y,z,a) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<" | "<<#a<<": "<<a<<endl;
#define test1(x) cerr<<#x<<": "<<x<<endl
#define test2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define test3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
ll power(ll a,ll b,ll m=M2){ll answer=1;while(b){if(b&1)answer=(answer*a)%m;b/=2;a=(a*a)%m;}return answer;}
using namespace std;
void ctrl(){cout<<"Control"<<endl;}
int make_num(string p){stringstream geek(p); int x = 0; geek >> x;return x;}
string make_str(int x){ostringstream str1; str1 << x; string geek = str1.str(); return geek;}
signed main()
{ ios::sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int n;
cin>>n;
int A[n],B[n];
int dA[n],dB[n];
for(int i=0;i<n;i++)cin>>A[i];
for(int i=0;i<n;i++)cin>>B[i];
for(int i=0;i<n;i++)
{
dA[i] = A[(i+1)%n]^A[i];
dB[i] = B[(i+1)%n]^B[i];
}
int hashB=0;
int base = 1400312813;
for(int i=0;i<n;i++)
{
hashB*=base;
hashB%=mod;
hashB+=dB[i];
hashB%=mod;
}
int hashA=0;
for(int i=0;i<n;i++)
{
hashA*=base;
hashA%=mod;
hashA+=dA[i];
hashA%=mod;
}
int exp = power(base,n-1,mod);
vi ans;
for(int i=0;i<n;i++)
{
if(hashA==hashB)
ans.pb(i);
int val = exp*dA[i];
val%=mod;
hashA+=mod - val;
hashA%=mod;
hashA*=base;
hashA%=mod;
hashA+=dA[i];
hashA%=mod;
}
for(int i=0;i<ans.size();i++)
{
cout<<ans[i]<<" "<<(A[0]^B[(n-ans[i])%n])<<'\n';
}
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=2e6+100,mod=998244353;
ll power(ll n,ll k){
if (k==0) return 1;
if (k%2==1){
ll x=power(n,k/2);
return x*x%mod*n%mod;
}
ll x=power(n,k/2);
return x*x%mod;
}
ll fac[N],fm[N];
ll ent(ll k,ll n){
if (k<0 || k>n) return 0;
if (k==0 || k==n) return 1;
return fac[n]*fm[k]%mod*fm[n-k]%mod;
}
int32_t main(){
fac[0]=1;
for (int i=1;i<N;i++){
fac[i]=fac[i-1]*i%mod;
fm[i]=power(fac[i],mod-2);
}
// cout << ent(3,5) << endl;
ll ans=0;
ll n,m;
cin >> n >> m;
ll z=3*m;
for (int i=0;i<=min(n,m);i++){
ll t=z-i;
if (t%2==1) continue;
ans+=ent(i,n)*ent(n-1,n-1+t/2)%mod;
}
for (int i=2*m+1;i<=3*m;i++){
ll t=z-i;
ans-=n*ent(n-2,n-2+t)%mod;
ans+=mod;
ans%=mod;
}
cout << ans << endl;
}
| 0 |
#include<cstdio>
#include<iostream>
using namespace std;
char masu[50][50] = {{0}};
void saiki(int x,int y){
masu[y][x] = '0';
if(masu[y+1][x] == '1') saiki(x,y+1);
if(masu[y-1][x] == '1') saiki(x,y-1);
if(masu[y][x+1] == '1') saiki(x+1,y);
if(masu[y][x-1] == '1') saiki(x-1,y);
}
int main(){
while(1){
int cnt = 0;
for(int i = 0; i < 12; i++){
if(scanf("%s",masu[i]) == EOF)goto a;
}
for(int i = 0; i < 12; i++){
for(int j = 0; j < 12; j++){
if(masu[i][j] == '1'){
saiki(j,i);
cnt++;
}
}
}
cout << cnt << endl;
}
a:;
return 0;
} | #include <bits/stdc++.h>
#define ctz __builtin_ctz
const int N = 648;
int n, D1, D2;
int a[N][N];
void coloring(int dist, int bit) {
int i, j, L = ctz(dist) / 2; dist >>= 2 * L;
switch (dist & 3) {
case 0: throw "gg"; break;
case 1: for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) a[i][j] |= ((i ^ j) >> L & 1) << bit; break;
case 2: for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) a[i][j] |= (i >> L & 1) << bit; break;
}
}
int main() {
int i, j, c, d, col[4] = {0};
scanf("%d%d%d", &n, &D1, &D2), d = n * n, n *= 2, coloring(D1, 0), coloring(D2, 1);
for (i = 0; i < n; ++i)
for (j = 0; j < n; ++j) ++col[ a[i][j] ];
c = std::max_element(col, col + 4) - col;
for (i = 0; i < n && d; ++i)
for (j = 0; j < n && d; ++j)
if (a[i][j] == c) --d, printf("%d %d\n", i, j);
return 0;
} | 0 |
/*
-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;
}
| #include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
using P = pair<long long, long long>;
const long long MOD = 1000000007;
int main() {
long long N;
long long a[60] = {0};
cin >> N;
rep(i, N) {
long long temp;
cin >> temp;
long long x = 1;
rep(j, 60) {
if(temp & x) {
a[j]++;
// cout << j << endl;
}
x *= 2;
}
}
long long ans = 0;
long long x = 1;
rep(i, 60) {
ans += ((((a[i] * (N-a[i])) % MOD) * x));
ans %= MOD;
x *= 2;
x %= MOD;
}
cout << ans << endl;
return 0;
} | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
static const int MAX = 100;
#define INF 2000000000000ll
int V, E;
long long dp[MAX][MAX];
void Warshall_Floyd() {
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j =0 ; j < V; j++) {
if (dp[i][k] == INF || dp[k][j] == INF) {
continue;
}
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
}
int main() {
cin >> V >> E;
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (i == j) {
dp[i][j] = 0;
}
else {
dp[i][j] = INF;
}
}
}
for (int i = 0; i < E; i++) {
int from, to, cost;
cin >> from >> to >> cost;
dp[from][to] = cost;
}
Warshall_Floyd();
bool minus = false;
for (int i = 0; i < V; i++) {
if (dp[i][i] < 0) {
minus = true;
}
}
if (minus) {
cout << "NEGATIVE CYCLE" << endl;
}
else {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (j != 0) {
cout << " ";
}
if (dp[i][j] == INF) {
cout << "INF";
}
else {
cout << dp[i][j];
}
}
cout << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define dumplll(x1, x2, x3) fprintf(stderr, "#%s.%d (%s, %s, %s) = (%ld, %ld, %ld)\n", __func__, __LINE__, #x1, #x2, #x3, x1, x2, x3);
#define dumpd(x1) fprintf(stderr, "#%s.%d (%s) = (%lf)\n", __func__, __LINE__, #x1, x1);
#define dumpdd(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%lf, %lf)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define loop for(;;)
template<typename T> void scan1(T& x) { fprintf(stderr, "unknown type\n"); }
template<> void scan1(long& x) { if( scanf("%ld", &x) < 0 ) exit(0); }
void scan() {}
template<typename Head, typename... Tail>
void scan(Head& x, Tail&... xs) {
scan1(x); scan(xs...);
}
template<typename W>
struct N003 {
typedef std::vector<long> LI;
typedef std::vector<W> LW;
long n, e;
LI ss, ds;
LW ws;
std::vector<LI> iss;
N003(long n_, const LI& ss_, const LI& ds_, const LW& ws_)
: n(n_), e(ss_.size()), ss(ss_), ds(ds_), ws(ws_) {
iss.resize(n+1);
for(long i = 0; i < e; ++i) {
iss[ss[i]].push_back(i);
}
}
};
template<typename W>
struct N006 {
std::vector<std::vector<W>> xss;
bool negativeCycle;
N006(const N003<W>& g, W inf) : negativeCycle(false) {
xss.resize(g.n+1);
for(auto& xs : xss) xs.resize(g.n+1, inf);
for(long i = 0; i < g.n+1; ++i) xss[i][i] = 0;
for(long i = 0; i < g.e; ++i) {
xss[g.ss[i]][g.ds[i]] = g.ws[i];
}
for(long z = 0; z < g.n+1; ++z) {
for(long x = 0; x < g.n+1; ++x) {
for(long y = 0; y < g.n+1; ++y) {
W d = xss[x][y];
W nd = xss[x][z] + xss[z][y];
xss[x][y] = std::min(d, nd);
}
}
}
for(long x = 0; x < g.n+1; ++x) {
for(long y = 0; y < g.n+1; ++y) {
if( xss[x][y] >= inf / 2 ) {
xss[x][y] = inf;
}
}
if( xss[x][x] < 0 ) {
negativeCycle = true;
}
}
}
};
struct Solver {
Solver() { fprintf(stderr, "--------Solver begin--------\n"); }
~Solver() { fprintf(stderr, "--------Solver end--------\n"); }
void solve() {
typedef std::vector<long> LI;
long v, e;
scan(v, e);
LI ss(e+1), ds(e+1);
LI ws(e+1);
for(long i = 0; i < e; ++i) {
scan(ss[i], ds[i], ws[i]);
}
N003<long> g(v, ss, ds, ws);
N006<long> warshallfloyd(g, (1LL << 60));
if( warshallfloyd.negativeCycle ) {
puts("NEGATIVE CYCLE");
}
else {
for(long i = 0; i < v; ++i) {
for(long k = 0; k < v; ++k) {
if( warshallfloyd.xss[i][k] == (1LL << 60) ) {
printf("INF");
}
else {
printf("%ld", warshallfloyd.xss[i][k]);
}
putchar( k == v - 1 ? '\n' : ' ');
}
}
}
}
};
int main() {
loop std::unique_ptr<Solver>(new Solver())->solve();
} | 1 |
#include<bits/stdc++.h>
using namespace std;
template<class T>inline void read(T &re)
{
char ch;
while((ch=getchar())<'0'||ch>'9');
re=ch-48;
while((ch=getchar())>='0'&&ch<='9')
re=(re<<3)+(re<<1)+ch-48;
}
int n,m,Q,pt[4005][4005],eg[4005][4005];
char mp[2005][2005],s[4005][4005];
int main()
{
// freopen("duty.in","r",stdin);
// freopen("duty.out","w",stdout);
read(n);read(m);read(Q);
for(register int i=1;i<=n;++i){
scanf("%s",mp[i]+1);
for(register int j=1;j<=m;++j)
s[2*i-1][2*j-1]=mp[i][j];
}
for(register int i=1;i<=n;++i){
int x=2*i-1,y;
for(register int j=1;j<=m;++j){
y=2*j-1;
if(s[x][y]=='1'){
if(s[x+2][y]=='1')
s[x+1][y]='2';
if(s[x][y+2]=='1')
s[x][y+1]='2';
}
}
}
for(register int i=1;i<=2*n-1;++i){
for(register int j=1;j<=2*m-1;++j){
pt[i][j]=(s[i][j]=='1')+pt[i-1][j]+pt[i][j-1]-pt[i-1][j-1];
eg[i][j]=(s[i][j]=='2')+eg[i-1][j]+eg[i][j-1]-eg[i-1][j-1];
}
}
int u,v,w,z,ans1,ans2;
for(register int i=1;i<=Q;++i){
read(u);read(v);read(w);read(z);
u=2*u-1,v=2*v-1,w=2*w-1,z=2*z-1;
ans1=pt[w][z]+pt[u-1][v-1]-pt[u-1][z]-pt[w][v-1];
ans2=eg[w][z]+eg[u-1][v-1]-eg[u-1][z]-eg[w][v-1];
printf("%d\n",ans1-ans2);
}
} | #include<stdio.h>
#include<cstdio>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<functional>
#define pi 3.14159
#define Inf (int)pow(2., 12.)
using namespace std;
typedef std::pair<int, int> mypair;
queue<mypair> qu;
#define M 1000000
const int dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};
#define N 123456
int num = 0;
int ToInt(string str) {
int a = 0, n = (int)str.size();
for(int i = 0; i < n; i++) {
a += (str[i]-'0') * (int)pow(10., (double)(n-i-1));
}
return a;
}
string ToString(int a, int l) {
string str;
if(l == 6) str = "000000";
if(l == 5) str = "00000";
if(l == 4) str = "0000";
if(l == 3) str = "000";
if(l == 2) str = "00";
if(l == 1) str = "0";
for(int i = 0; i < l; i++) {
int n = a / (int)pow(10., (double)(l-i-1));
str[i] = n + '0';
a -= n * (int)pow(10., (double)(l-i-1));
}
return str;
}
int dia(int h, int w) {
return h*h + w*w;
}
void tan(int d) {
for(int i = 1; i < 150; i++) {
for(int j = i+1; j < 150; j++) {
if(dia(i, j) == d) {
cout << i << " " << j <<endl;
return;
} else if(dia(i, j) > d) break;
}
}
tan(d + 1);
}
int main(){
int h, w;
while(cin >> h >> w) {
if(h + w == 0) break;
bool bo2 = false;
for(int i = h+1; i < 150; i++) {
for(int j = i+1; j < 150; j++) {
if(dia(i, j) == dia(h, w)) {
h = i;
w = j;
bo2 = true;
break;
} else if(dia(i, j) > dia(h,w)) break;
}
if(bo2) break;
}
if(bo2) cout << h << " " << w <<endl;
else tan(dia(h, w) + 1);
}
return 0;
} | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define itfr(it,x) for(it=x.begin();it!=x.end();it++)
#define flash ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
int main()
{
flash;
//sieve();
int T=1,t,n,m,k,i;
// cin>>T;
while(T--)
{
cin>>n>>k;
int a[10]={0};
FOR(i,0,k){
cin>>t;
a[t]=1;
}
vector<int> vs;
FOR(i,0,10)
if(a[i]==0)
vs.pb(i);
// for(auto it:vs)cout<<it<<" ";cout<<endl;
int dg=0;
for(i=n;i>0;i/=10)dg++;
ll ans=0;
k = pow(10,dg-1);
int fl=0;
int num=n;
// cout<<dg<<" "<<k<<endl;
while(ans<num)
{
if(k==0){
ans = ans*10 + vs[0];
continue;
}
m = n/k;
n = n%k;
k/=10;
if(a[m]==0&fl==0){
ans = ans*10 + m;
continue;
}
dg=0;
if(fl==0)
{
for(auto it:vs)
if(it>=m)
{
dg=it;
break;
}
if(dg==0)
{
if(vs[0]!=0)
dg=vs[0];
else
{
if(ans==0)
dg=vs[1];
else
dg=vs[0];
}
}
ans = ans*10+dg;
fl=1;
}
else
{
ans = ans*10 + vs[0];
}
}
cout<<ans<<endl;
}
} | #include<bits/stdc++.h>
#define ll long long int
#define f first
#define s second
#define pb push_back
#define PII pair<ll,ll>
ll const MOD = 998244353;
ll const N = 1000005;
ll const LN = 20;
ll const inf = 8e18;
using namespace std;
ll n, m, a[N];
ll cnt[N];
ll fact[N];
ll ifact[N];
ll bexpo (ll x, ll n, ll m)
{
ll r = 1;
x = x % m;
while (n > 0)
{
if (n % 2) { r = (r * x) % m; }
x = (x * x) % m;
n = n / 2;
}
return r;
}
ll ncr (ll n, ll r)
{
if (r > n) { return 0; }
ll ans = fact[n];
ans = (ans * ifact[r]) % MOD;
ans = (ans * ifact[n - r]) % MOD;
return ans;
}
void pre()
{
fact[0] = 1;
ifact[0] = 1;
for (ll i = 1; i < N; i++) { fact[i] = (fact[i - 1] * i) % MOD; }
ifact[N - 1] = bexpo (fact[N - 1], MOD - 2, MOD);
for (ll i = N - 2; i > 0; i--)
{ ifact[i] = (ifact[i + 1] * (i + 1)) % MOD; }
}
int main()
{
ios::sync_with_stdio (false);
cin.tie (NULL);
pre();
ll n, k;
cin >> k >> n;
for (ll i = 2; i <= 2 * k; i++)
{
set<ll>st;
for (ll j = 1; j <= k; j++)
{
if (j >= i)
{
continue;
}
ll oo = i - j;
if (oo > k) { continue; }
st.insert (oo);
st.insert (j);
}
cnt[i] = (st.size() + 1) / 2;
}
for (ll i = 2; i <= 2 * k; i++)
{
if (1)
{
ll tot = ncr (n + k - 1, k - 1);
for (ll j = 1; j <= cnt[i]; j++)
{
ll temp = ncr (cnt[i], j);
temp *= ncr (n - 2 * j + k - 1, k - 1);
temp %= MOD;
if (j % 2) { tot -= temp; }
else { tot += temp; }
tot %= MOD;
if (tot < 0) { tot += MOD; }
}
cout << tot << '\n';
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
struct LowLink{
vector<vector<int>>& edges;
// 関節点
vector<int> art;
vector<pair<int,int>> bridge;
vector<int> used, ord, low;
int k;
void dfs(int idx, int par){
ord[idx] = k++;
low[idx] = ord[idx];
bool is_art = false;
int cnt = 0;
for(auto& to : edges[idx]){
if(ord[to] == -1){
++cnt;
dfs(to, idx);
low[idx] = min(low[idx], low[to]);
is_art |= par != -1 && low[to] >= ord[idx];
if(ord[idx] < low[to])
bridge.emplace_back(idx, to);
}else if(to != par)
low[idx] = min(low[idx], ord[to]);
}
is_art |= (par == -1 && cnt > 1);
if(is_art)
art.emplace_back(idx);
}
LowLink(vector<vector<int>>& edges) :
edges(edges),
ord(edges.size(), -1),
low(edges.size(), 0),
k(0)
{
for(int i = 0; i < edges.size(); ++i)
if(ord[i] == -1)
dfs(i, -1);
for(auto& b : bridge)
b = make_pair(min(b.first, b.second), max(b.first, b.second));
sort(art.begin(), art.end());
sort(bridge.begin(), bridge.end());
}
};
signed main(){
int n, m;
cin >> n >> m;
vector<pair<int,int>> v(m);
vector<vector<int>> edges(n);
for(int i = 0; i < m; ++i){
vector<int> l(2);
for(auto& x : l)
cin >> x;
sort(l.begin(), l.end());
v[i] = make_pair(l.front(), l.back());
edges[l[0]].emplace_back(l[1]);
edges[l[1]].emplace_back(l[0]);
}
LowLink ll(edges);
for(auto& x : ll.art)
cout << x << endl;
}
| #include <iostream>
#include <vector>
#include <set>
using namespace std;
struct ArticularPoint {
int n;
vector<vector<int>> g;
set<int> points;
vector<int> parent;
vector<int> discTime;
vector<int> lowTime;
vector<bool> visited;
vector<bool> isAp;
int time = 0;
ArticularPoint(int n): n(n) {
g.assign(n, vector<int>());
parent.assign(n, -1);
discTime.assign(n, 0);
lowTime.assign(n, n + 1);
visited.assign(n, false);
isAp.assign(n, false);
}
void addEdge(int from, int to) {
g[from].push_back(to);
g[to].push_back(from);
}
int solve() {
dfs(0, -1);
return points.size();
}
void dfs(int u, int p) {
discTime[u] = time++;
lowTime[u] = discTime[u];
visited[u] = true;
int child = 0;
for (int v : g[u]) {
if (!visited[v]) {
child++;
parent[v] = u;
dfs(v, u);
lowTime[u] = min(lowTime[u], lowTime[v]);
if (lowTime[v] >= discTime[u]) {
isAp[u] = true;;
}
}
else if (v != p) {
lowTime[u] = min(lowTime[u], discTime[v]);
}
}
//Remove root is it has only one child
if (p < 0 && child == 1) {
isAp[u] = false;
}
}
};
int main() {
int n, m;
cin >> n >> m;
ArticularPoint ap(n);
for (int i = 0; i < m; i++) {
int from, to;
cin >> from >> to;
ap.addEdge(from, to);
}
int ans = ap.solve();
for (int i = 0; i < n; i++) {
if (ap.isAp[i]) {
cout << i << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int h, w;
cin >> h >> w;
char s[h][w];
rep(i, h) rep(j, w) cin >> s[i][j];
rep(i, h) rep(j, w) {
if (s[i][j] == '.') continue;
bool ok = false;
for (int y = -1; y <= 1; y += 2) {
int dy = i + y;
if (dy >= 0 && dy < h && s[dy][j] == '#') ok = true;
}
for (int x = -1; x <= 1; x += 2) {
int dx = j + x;
if (dx >= 0 && dx < w && s[i][dx] == '#') ok = true;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
using namespace std;
typedef long long ll;
inline void open(const char *s)
{
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str,"in%s.txt",s);
freopen(str,"r",stdin);
// sprintf(str,"out%s.txt",s);
// freopen(str,"w",stdout);
#endif
}
inline int rd()
{
static int x,f;
x=0;f=1;
char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
return f>0?x:-x;
}
const int N=110;
int n,m,a[N],b[N],t=0;
int main()
{
n=rd();m=rd();
fo(i,1,m)a[i]=rd(),t+=(a[i]&1);
if(m==1){
if(a[1]==1)puts("1\n1\n1");
else printf("%d\n2\n%d %d",a[1],1,a[1]-1);
return 0;
}
if(t>2){puts("Impossible");return 0;}
fo(i,2,m)if(a[i]&1)a[1]&1?swap(a[m],a[i]):swap(a[1],a[i]);
t=0;
if(a[1]>1)b[t=1]=a[1]-1;
fo(i,2,m)b[++t]=a[i];b[t]++;
fo(i,1,m)cout<<a[i]<<' ';cout<<endl;
cout<<t<<endl;
fo(i,1,t)cout<<b[i]<<' ';cout<<endl;
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int, int> P;
int data[12][12] = {};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1 ,0 ,-1};
void dfs(int sx, int sy) {
queue<P> que;
data[sx][sy] = 2;
que.push(P(sx, sy));
while(que.size()) {
P p = que.front();
que.pop();
for(int i = 0; i < 4; i++) {
int nx = p.first + dx[i], ny = p.second + dy[i];
if(0 <= nx && nx < 12 && 0 <= ny && ny < 12 && data[nx][ny] == 1 ){
que.push(P(nx, ny));
data[nx][ny] = 2;
}
}
}
}
int main(){
while(~scanf("%1d", &data[0][0])) {
int cnt = 0, i, j = 1;
for(i = 0; i < 12; i++, j=0)
for(;j < 12; j++) {
scanf("%1d", &data[i][j]);
}
for(i = 0; i < 12; i++)
for( j = 0; j < 12; j++)
if(data[i][j] == 1){
dfs(i, j);
cnt++;
}
cout << cnt << endl;
}
return 0;
} | #include <iostream>
#include <string>
#define MAP 12
using namespace std;
int map[MAP][MAP];
bool valid(int y, int x) {
if ((0 <= y && y < MAP) && (0 <= x && x < MAP)) {
if (map[y][x] == 1)
return true;
}
return false;
}
void remove_island(int y, int x) {
int nx, ny;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
map[y][x] = 0;
for (int i = 0; i < 4; i++) {
ny = y + dy[i];
nx = x + dx[i];
if ((valid(ny, nx)))
remove_island(ny, nx);
}
}
int main() {
char c[13];
int ans;
while (1) {
for (int i = 0; i < MAP; i++) {
if (!(cin >> c))
return 0;
for (int j = 0; j < MAP; j++) {
map[i][j] = (int)(c[j] - '0');
}
}
ans = 0;
for (int i = 0; i < MAP; i++) {
for (int j = 0; j < MAP; j++) {
if (valid(i, j)) {
remove_island(i, j);
ans++;
}
}
}
cout << ans << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
long long min(long long x,long long y){return (x<y ? x:y);}
long long max(long long x,long long y){return (x>y ? x:y);}
#define ld long double
int stoi(string s) {return atoi(s.c_str());}
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
#define LINEY "YES\n"
#define Liney "Yes\n"
#define LINEN "NO\n"
#define Linen "No\n"
void func(ll* x,ll* y){
*x -= (*x%2);
*x /= 2;
*y += *x;
}
int main(){
ll A,B;
int K;
cin >> A>>B>>K;
bool turn_A = true;
REP(i,K){
if(turn_A){func(&A,&B);}
else{func(&B,&A);}
turn_A = !turn_A;
}
printf("%d %d\n",A,B);
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 300003
#define MOD 1000000007
#define INF 1000000000000000
int main(){
int A,B,C;
cin>>A>>B>>C;
if((C-A)*(B-C)>=0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
string s;
cin>>s;
if(s.length()==2)cout<<s<<endl;
else
{
for(int i=2;i>=0;i--)cout<<s[i];
cout<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>> n ;
double ans=4*acos(0.0)*(double)n ;
cout<<ans ;
}
int main(){
int y ;
y=1 ;
//cin>>y ;
while(y--)
{
solve() ;
}
} | 0 |
//https://atcoder.jp/contests/abc160/tasks/abc160_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin>>x;
ll a;
a=x/500;
ll fin1;
fin1=a*1000;
ll b;
b=x%500;
ll c;
c=b/5;
ll fin2;
fin2=c*5;
ll sum=0;
sum=fin1+fin2;
cout<<sum<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
double eps = 1e-9;
double pi = acos(-1);
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define en "\n"
#define ff first
#define ss second
#define sp(x) fixed << setprecision(x)
#define VECT(v) vector<int>v
#define SCAN(v) int temp; for(int i=0; i<n; i++) {cin>>temp; v.push_back(temp);}
#define PRINT(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " "; cout << en;
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.begin(), v.end(), greater<>())
#define CASEP(v) cout<<"Case "<<tc<<": "<<v<<"\n"
#define DEBUG(v) cout << v << " "; cout << en;
int main(void)
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
fast_io
int n, x;
cin >> n;
ll ans = 0;
if(n >= 500)
{
x = n / 500;
ans += 1000 * x;
n = n - x * 500;
}
if(n >= 5)
{
x = n/5;
ans += 5 * x;
}
cout << ans << en;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int matrix_rank(vector<unsigned long long> A){
int n=A.size(),r=0;
rep(i,64){
int piv=-1;
for(int j=r;j<n;j++) if(A[j]>>i&1) {
piv=j;
break;
}
if(piv==-1) continue;
for(int j=r;j<n;j++) if(j!=piv && A[j]>>i&1) {
A[j]^=A[piv];
}
swap(A[r],A[piv]);
r++;
}
return r;
}
void solve(){
int n; cin>>n;
vector<unsigned long long> a(n);
rep(i,n) cin>>a[i];
string s; cin>>s;
vector<unsigned long long> A;
int r=0;
for(int i=n-1;i>=0;i--){
A.emplace_back(a[i]);
int r2=matrix_rank(A);
if(r<r2 && s[i]=='1'){
puts("1");
return;
}
r=r2;
}
puts("0");
}
int main(){
int q; scanf("%d",&q); rep(_,q) solve();
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define sz(a) ((int)(a.size()))
using namespace std;
const int mod = 998244353;
int mult(int a, int b)
{
return a * (ll) b % mod;
}
int add(int a, int b)
{
return a + b >= mod ? a + b - mod : a + b;
}
int sub(int a, int b)
{
return a - b < 0 ? a - b + mod : a - b;
}
void Add(int &a, int b)
{
a = add(a , b);
}
vector<ll> b;
void add(ll x)
{
for(int i = 0; i < b.size(); i++)
{
ll t= b[i];
if((x ^ t) < x)
{
x ^= t;
}
}
if(x == 0)
return;
for(int i = 0; i < b.size(); i++)
{
if((x ^ b[i]) < b[i])
b[i] ^= x;
}
b.pb(x);
sort(b.begin() , b.end() , greater<ll>());
}
ll check(ll x)
{
for(int i = 0; i < b.size(); i++)
{
ll t = b[i];
if((x ^ t) < x)
{
x ^= t;
}
}
return x;
}
int main()
{
int t;
cin >> t;
while(t--)
{
int n;
cin >> n;
b.clear();
vector<ll> a(n);
for(auto & x : a)
cin >> x;
string s;
cin >> s;
reverse(a.begin() , a.end());
reverse(s.begin() , s.end());
bool pzdc = false;
for(int i = 0; i < n; i++)
if(s[i] == '0')
{
add(a[i]);
}
else
{
pzdc |= check(a[i]) != 0;
}
cout << pzdc << endl;
}
}
| 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong h, w;
llong a[100][100];
llong b[100][100];
llong v[100][100];
llong u[100][100];
bool dp[100][100][26000];
llong offset = 13000;
int main() {
cin >> h >> w;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> b[i][j];
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
v[i][j] = a[i][j] - b[i][j];
u[i][j] = b[i][j] - a[i][j];
}
}
dp[0][0][offset] = true;
dp[0][1][offset] = true;
dp[1][0][offset] = true;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
for (int k = 0; k < 26000; k++) {
if (dp[i - 1][j][k] == true) {
dp[i][j][k + v[i][j]] = true;
dp[i][j][k + u[i][j]] = true;
}
if (dp[i][j - 1][k] == true) {
dp[i][j][k + v[i][j]] = true;
dp[i][j][k + u[i][j]] = true;
}
}
}
}
llong ans = 1ll << 60ll;
for (int k = 0; k < 26000; k++) {
if (dp[h][w][k] == true) {
ans = min(ans, llabs(k - offset));
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int H, W;
vector<vector<char>> maze(51, vector<char>(51));
vector<vector<bool>> check(51, vector<bool>(51));
bool goal;
queue<pair<int, int>> BFS(queue<pair<int, int>> q, pair<int, int> p) {
int y = p.first, x = p.second;
//cout << y << " " << x <<endl;
if (y == H - 1 && x == W - 1) {
goal = true;
}
pair<int, int> tmp;
//上
if (y > 0 && maze[y - 1][x] == '.' && !check[y - 1][x]) {
check[y-1][x] = true;
tmp = make_pair(y - 1, x);
q.push(tmp);
}
//下
if (y < H - 1 && maze[y + 1][x] == '.' && !check[y + 1][x]) {
check[y+1][x] = true;
tmp = make_pair(y + 1, x);
q.push(tmp);
}
//左
if (x > 0 && maze[y][x - 1] == '.' && !check[y][x - 1]) {
check[y][x-1] = true;
tmp = make_pair(y, x - 1);
q.push(tmp);
}
//右
if (x < W - 1 && maze[y][x + 1] == '.' && !check[y][x + 1]) {
check[y][x+1] = true;
tmp = make_pair(y, x + 1);
q.push(tmp);
}
return q;
}
int clearMaze() {
queue<pair<int, int>> q, q2;
pair<int, int> start = make_pair(0, 0);
q2.push(start);
check[0][0] = true;
int i = 0;
while (true) {
if(goal){
return i;
}
if(q2.empty()){
return -1;
}
i++;
q.swap(q2);
while (!q.empty()) {
q2 = BFS(q2, q.front());
q.pop();
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
cin >> H >> W;
int white = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> maze[i][j];
if(maze[i][j] == '.'){
white++;
}
}
}
int root = clearMaze();
if(root > 0){
cout << white - root <<endl;;
} else{
cout << -1 <<endl;
}
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(int i=0,_i=(n);i<_i;++i)
#define _rep3(i,a,b) for(int i=(a),_i=(b),_ii=(b)>(a)?1:-1;abs(_i-i)>0;i+=_ii)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define all(f,c,...) (([&](decltype((c)) cccc) { return (f)(begin(cccc), end(cccc), ## __VA_ARGS__); })(c))
signed main() {
ll N, M, V, P;
ins(N, M, V, P);
vector<ll> A(N);
rep(i, N)
cin >> A[i];
all(sort, A); all(reverse, A);
int ok = -1, ng = N;
auto f = [&](int mid) {
if (mid < P) return true;
if (A[P-1] > A[mid]+M) return false;
ll tmp = 1LL * ((N-mid)+P-1) * M;
rep(i, P-1, mid)
tmp += min(1LL*M, max(0LL, A[mid]+M-A[i]));
return tmp >= M*V;
};
while (abs(ok - ng) > 1) {
int mid = ok + (ng-ok) / 2;
(f(mid) ? ok : ng) = mid;
}
cout << ok+1 << endl;
return 0;
}
| #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
ll N, M, V, P;
cin>>N>>M>>V>>P;
vector<ll> A(N);
for(int i=0;i<N;++i) cin>>A[i];
sort(A.begin(), A.end());
ll l=0, r=N-1, m;
ll score;
ll vote;
vector<ll> tmparr(N);
ll zero = 0;
int index;
while(l<r) {
m = (l+r)/2;
score = M+A[m];
vote = M*(V-1);
for(int i=0;i<N;++i) {
if(i!=m) vote -= min(M, max(zero, score-A[i]));
tmparr[i] = max(score, A[i]);
}
for(int i=N-1;i>=0;--i) {
if(vote>0) {
vote -= M-max(score-A[i], zero);
tmparr[i] = score+1;
}
}
index = upper_bound(tmparr.begin(), tmparr.end(), score)-tmparr.begin();
if(N-index<P) r = m;
else l=m+1;
}
cout<<N-l<<endl;
}
| 1 |
#include <iostream>
#define MX 1000000000
using namespace std;
int M[100][100],N; //M[i][j]:i©çjÜÅÌRXg
int dijkstra(int s , int g){
bool visited[100];
int d[100];
for(int i=0;i < N;i++) d[i] = MX , visited[i] = false;
d[s] = 0;
while(1){
int u;
int mincost = MX;
for(int i=0;i<N;i++)if(!visited[i] && d[i] < mincost) mincost = d[i] , u = i;
if(mincost == MX) break;
visited[u] = true;
for(int v=0;v<N;v++){
if(visited[v] || M[u][v] == MX) continue;
if(d[v] > d[u] + M[u][v]) d[v] = d[u] + M[u][v];
}
}
return d[g];
}
int main(){
int k;
while(cin >> N >> k){
for(int i=0;i<N;i++)for(int j=0;j<N;j++) M[i][j] = MX;
while(k--){
int x,a,b,c;
cin >> x;
if(!(x)){
int cost;
cin >> a >> b;
cost = dijkstra(a-1,b-1);
if(cost == MX) cout << "-1" << endl;
else cout << cost << endl;
}
else {
cin >> a >> b >> c;
if(M[a-1][b-1] > c && M[b-1][a-1] > c) M[a-1][b-1] = M[b-1][a-1] = c;
}
}
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
#define MAX_V 100
using namespace std;
typedef struct edge{
int to;
int cost;
edge(){
}
edge(int _to,int _cost){
to = _to;
cost = _cost;
}
bool operator<(const edge &a)const{
if(cost == a.cost) return to > a.to;
return cost > a.cost; //for asc
}
}edge;
int cost[MAX_V + 1];
vector<edge> G[MAX_V + 1];
priority_queue<edge> pque;
int V;
int K;
void solve(int s){
for(int i = 1;i <= V;i++){
cost[i] = INF;
}
pque.push(edge(s,0));
while(!pque.empty()){
edge e = pque.top();pque.pop();
if(cost[e.to] != INF) continue;
cost[e.to] = e.cost;
for(int i = 0;i < G[e.to].size();i++){
int _to = G[e.to][i].to;
int _cost = e.cost + G[e.to][i].cost;
pque.push(edge(_to,_cost));
}
}
return ;
}
int main (void){
while(true){
scanf("%d%d",&V,&K);
if(V == 0 && K == 0) break;
int query;
int _u,_v,_cost;
for(int i = 0;i < K;i++){
scanf("%d",&query);
if(query){
scanf("%d%d%d",&_u,&_v,&_cost);
G[_u].push_back(edge(_v,_cost));
G[_v].push_back(edge(_u,_cost));
}
else {
scanf("%d%d",&_u,&_v);
solve(_u);
if(cost[_v] == INF)puts("-1");
else printf("%d\n",cost[_v]);
}
}
for(int i = 1;i <= V;i++) G[i].clear();
}
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define drep(i, n) for(int i = n - 1; i >= 0; i--)
#define itrep(itr, base) for (auto itr = base.begin(); itr != base.end(); itr++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define yes cout << "yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define no cout << "no" << endl
#define PI 3.14159265359
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
void P(int x) {cout << x << endl;}
void P(long x) {cout << x << endl;}
void P(double x) {cout << x << endl;}
void P(ll x) {cout << x << endl;}
void P(string x) {cout << x << endl;}
void P(char x) {cout << x << endl;}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
int h[2], m[2], k;
cin >> h[0] >> m[0] >> h[1] >> m[1] >> k;
int up = h[0] * 60 + m[0];
int down = h[1] * 60 + m[1];
if (down - up - k < 0) {
P(0);
} else {
P(down - up - k);
}
return 0;
}
| #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef pair<int,int> pii;
const int N = 1e4+10;
string dp[N], val[15];
string num = "123456789";
int c[] = {2,5,5,4,5,6,3,7,6}, cs[200], n, m;
string a[15];
void update (string &x, string y, string z)
{
if (x.size() > y.size() + 1) return;
if (z[0] > y[0]) z += y, swap(y, z);
else y += z;
if (x.size() < y.size()) x = y;
else
{
for (int i=0; i<x.size(); i++)
{
if (x[i] > y[i]) return;
else if (x[i] < y[i])
{
x = y;
break;
}
}
}
}
signed main()
{
XinAi
for (int i=0; i<9; i++) cs[num[i]] = c[i];
cin >> n >> m;
for (int i=0; i<m; i++) cin >> a[i];
for (int i=0; i<n; i++)
for (int j=0; j<m; j++)
{
if (i!=0 && dp[i]=="") continue;
update(dp[i+cs[a[j][0]]], dp[i], a[j]);
}
cout << dp[n] << '\n';
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int bit[55][55];
void add(int x, int y){
for(int i=x;i>0;i-=(i&-i)){
for(int j=y;j>0;j-=(j&-j)){
bit[i][j]++;
}
}
}
ll get(int x, int y){
ll ret =0;
for(int i=x;i<55;i+=(i&-i)){
for(int j=y;j<55;j+=(j&-j)){
ret+=bit[i][j];
}
}
return ret;
}
ll get2(ll x){
ll ret = 1;
while(x%2==0){
ret++;
x/=2;
}
return ret;
}
ll get5(ll x){
ll ret = 1;
while(x%5==0){
ret++;
x/=5;
}
return ret;
}
void solve(){
int n;
cin>>n;
ll ans = 0;
for(int i=1;i<=n;i++){
ld inp;
cin>>inp;
ll trt = llround(inp*1e9);
ll x = get2(trt);
ll y = get5(trt);
ll xp = max(1ll,20-x);
ll yp = max(1ll,20-y);
ans+=get(xp,yp);
add(x,y);
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
| #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
unsigned int factorial(unsigned int n){
if (n==0) return 1;
else return n*factorial(n-1);
}
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> xy(n);
vector<int> a(n);
for(int i=0;i<n;i++) {
cin>>xy[i].first>>xy[i].second;
a[i]=i;
}
double l_sum=0;
do{
for(int i=0;i<n-1;i++){
l_sum+=sqrt(pow(xy[a[i]].first-xy[a[i+1]].first,2)+pow(xy[a[i]].second-xy[a[i+1]].second,2));
}
}while(next_permutation(a.begin(),a.end()));
cout<<fixed<<setprecision(10)<<l_sum/(double) factorial(n)<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) { // 発見できたとき
return 1;
}
else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
int A, B, C; cin >> A >> B >> C;
if(A <= C && C <= B) cout << "Yes" << endl;
else if(B <= C && C <= A) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int A,B,K;
cin >> A >> B >> K;
rep(i,K)
if(i%2) {
if(B%2)
--B;
B /= 2;
A += B;
} else {
if(A%2)
--A;
A /= 2;
B += A;
}
cout << A << " " << B << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N,K; cin >> N >> K;
vector<ll> v(N+1,0);
for(int i = 0; i < N; i++){
ll tmp; cin >> tmp;
v[i+1] = tmp;
}
for(int i = 1; i <= N; i++){
v[i] = v[i] + v[i-1];
}
ll max_val = 0;
for(int i = N; i - K >= 0; i--){
max_val = max(max_val, v[i] - v[i - K]);
}
cout << (double)(max_val+K) / 2.0 << endl;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a) ? "Yes" : "No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n;
int k;
cin >> n >> k;
vector<double> p(n);
double ans = 0.0, cnt = 0.0;
rep(i, n) {
cin >> p[i];
p[i] = (p[i]*(p[i]+1.0)/2.0) / p[i];
clog << p[i] << endl;
cnt += p[i];
if (i >= k) {
cnt -= p[i - k];
}
chmax(ans, cnt);
// clog << cnt << endl;
}
printf("%.9lf\n", ans);
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
#define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int M = 998244353;
const int N = 305;
int n,m,k;
vector<int> v,u;
vector<vector<int>> ans;
int dp[N][N][N];
int rec(int id,int carry,int can)
{
if(id == -1)
{
//if(!carry){ans.pb(u);}
return (carry == 0);
}
if(dp[id][carry][can] != -1)return dp[id][carry][can];
int has = v[id] + carry;
int ans = 0;
for(int give=0;give<=min(has,k);give++)
{
int left = has - give;
//u[id] = left;
int now = max(0LL,left-v[id]);
if(now > can)break;
ans += rec(id-1,give,can-now),ans %= M;
}
dp[id][carry][can] = ans;
return ans;
}
signed main()
{
FAST
int tc=1;
//cin>>tc;
for(int ti=1;ti<=tc;ti++)
{
for(int i=0;i<N;i++)for(int j=0;j<N;j++)for(int ii=0;ii<N;ii++)dp[i][j][ii]=-1;
string s;
cin>>s>>k;
n = s.length();
k = min(n,k);
int curr = 0;
for(int i=0;i<n;i++)
{
if(s[i] == '0')
{
v.pb(curr);
curr = 0;
}
else curr++;
}
if(curr)v.pb(curr);
m = v.size();
//u = v;
cout<<rec(m-1,0,k)<<endl;
//sort(all(ans));
//for(auto u:ans){for(auto i:u)cout<<i<<" ";cout<<endl;}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N_MAX = 302;
const int MOD = 998244353;
int n, k;
string s;
int m;
int a[N_MAX];
int spa[N_MAX];
int dp[N_MAX][N_MAX][N_MAX];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s >> k;
n = s.size();
s = " " + s;
for(int i = 1; i <= n; i++)
if(s[i] == '1')
a[i - (++m) + 1]++;
for(int i = 1; i <= n; i++)
spa[i] = spa[i - 1] + a[i];
k = min(k, n);
dp[0][0][0] = 1;
for(int i = 1; i <= n; i++)
for(int sp = spa[i]; sp <= spa[n]; sp++)
for(int sum = 0; sum <= k; sum++)
{
for(int x = 1; x <= sum && (a[i] - x) <= sp && x <= a[i]; x++)
{
dp[i][sp][sum] += dp[i - 1][sp - (a[i] - x)][sum - x];
if(dp[i][sp][sum] >= MOD)
dp[i][sp][sum] -= MOD;
}
for(int x = 0; (a[i] + x) <= sp; x++)
{
dp[i][sp][sum] += dp[i - 1][sp - (a[i] + x)][sum];
if(dp[i][sp][sum] >= MOD)
dp[i][sp][sum] -= MOD;
}
}
int ans = 0;
for(int i = 0; i <= k; i++)
{
ans += dp[n][spa[n]][i];
if(ans >= MOD)
ans -= MOD;
}
cout << ans << "\n";
return 0;
}
| 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
using namespace std;
inline int topbit(unsigned long long x){
return x?63-__builtin_clzll(x):-1;
}
inline int popcount(unsigned long long x){
return __builtin_popcountll(x);
}
void solve(){
int N;
cin>>N;
vector<int> A(N);
rep(i,N)cin>>A[i];
string S;cin>>S;
vector<int> T(60); //T[j]:=0がjビット目を0にできるときに使用する数。掃き出し法を用いて整理する。
for(int i=N-1;i>=0;i--){
int e=A[i];
for(int j=59;j>=0;j--){
if(T[j]==0)continue;
if((e&T[j])==0)continue;
if(topbit(e&T[j])==topbit(T[j]))e^=T[j]; //0がA[i]を0にできるかどうかを調べる
}
if(S[i]=='1'){
if(e){
cout<<1<<endl;
return;
}
}
else{
if(e){
rep(j,60){
if(T[j]==0)continue;
if((e&T[j])==0)continue;
if(topbit(e&T[j])==topbit(e))T[j]^=e;
}
T[topbit(e)]=e;
}
}
}
cout<<0<<endl;
}
signed main(){
int T;cin>>T;
while(T--)solve();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) //0.0000001 the value
#define PI (acos(-1))
#define MAXN (300006)
#define MAXK 26
#define MAXX 15000006
#define ll long long int
#define ld long double
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for(ll ii = ss; ii < ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll(x)
#define p2(x) (1LL<<(x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair <ll, ll> pi;
typedef pair <ll, pi> spi;
typedef pair <pi, pi> dpi;
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss
ll n, A[MAXN], dp[302*302], dp2[302*302];
const ll MOD=998244353;
ll qexp(ll x, ll e) {
if(e==0) return 1;
ll half = qexp(x,e/2);
half *= half;
half %= MOD;
if(e%2) half *= x;
half %= MOD;
return half;
}
int main()
{
cin>>n; FOR(i,0,n) cin>>A[i];
ll sum=accumulate(A,A+n,0);
dp[0]=1;dp2[0]=1;
for(ll i=0;i<n;i++) {
for(ll j=sum;j>=0;j--) {
// dp[j] = dp[j] + (dp[j]*2)%MOD; dp[j] %= MOD;
dp[j] *= 2; dp[j] %= MOD;
if(j>=A[i])dp[j] += dp[j-A[i]]; dp[j] %= MOD;
if(j>=A[i])dp2[j] += dp2[j-A[i]]; dp2[j] %= MOD;
}
}
ll ans = qexp(3,n-1);
for(ll i=(sum+1)/2;i<=sum;++i) {
ans -= (dp[i]);
ans += MOD;
ans %= MOD;
}
if(sum%2==0) {
ans += dp2[sum/2];
ans %= MOD;
}
cout<<(ans*3LL)%MOD<<'\n';
}
| 0 |
#include <iostream>
int main (){
std::string rightName = "Hoshina";
std::string wrongName = "Hoshino";
//num of data n
int n = 0;
std::cin >> n;
//skip "\n"
std::cin.ignore();
for(int i = 0; i < n; ++i){
std::string line;
//input string
getline(std::cin, line);
//find exist of wrongName
std::string::size_type pos = line.find(wrongName);
while(pos != std::string::npos){
//rename to rightName
line.replace(pos, wrongName.size(), rightName);
pos = line.find(wrongName, pos + rightName.size());
}
std::cout << line << std::endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(), x.end()
#define watch(x) cout<<#x<<" : "<<x<<endl
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define testCases int tt;cin>>tt; while(tt--)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<int, int>> vpii;
typedef vector<string> vs;
int main() {
fastio;
int n;
cin >> n;
set<int> s;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
s.insert(temp);
}
if (s.size() == n) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353;//786433;//998244353;
const double Pi = acos(-1);
void Fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n, m;
queue <pair <int, int> > BFS;
int Dist[1005][1005];
char a[1005][1005];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
Dist[i][j] = 1000000;
cin >> a[i][j];
if(a[i][j] == '#')
{
Dist[i][j] = 0;
BFS.push(mp(i, j));
}
}
}
while(BFS.empty() == false)
{
int x = BFS.front().fi, y = BFS.front().se;
BFS.pop();
for(int i = 0; i < 4; i++)
{
if(Dist[x + dx[i]][y + dy[i]] > Dist[x][y] + 1)
{
Dist[x + dx[i]][y + dy[i]] = Dist[x][y] + 1;
BFS.push(mp(x + dx[i], y + dy[i]));
}
}
}
int t = 0;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
t = max(t, Dist[i][j]);
}
}
cout << t;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
#define cout(val) cout << (val) << endl
using namespace std;
typedef long long ll;
int main(){
int h, w;
char t;
cin >> h >> w;
vector<vector<bool>> c(h, vector<bool>(w, false));
queue<pair<int, int>> que1, que2;
rep(i, h) rep(j, w){
cin >> t;
if(t == '#'){
que2.push(make_pair(i, j));
c[i][j] = true;
}
}
pair<int, int> p;
vector<int> dy ={1,0,-1,0}, dx={0,1,0,-1};
int tx, ty, result = 0;
while(!que2.empty()){
++result;
que2.swap(que1);
while(!que1.empty()){
p = que1.front();
que1.pop();
rep(i, 4){
ty = p.first + dy[i];
tx = p.second + dx[i];
if(ty==-1||tx==-1||ty==h||tx==w||c[ty][tx]) continue;
que2.push(make_pair(ty, tx));
c[ty][tx] = true;
}
}
}
cout(result-1);
}
| 1 |
#include <iostream>
using namespace std;
int main() {
int n,g,m;
cin>>n>>g;
m=(g*2)-n;
cout<<m<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int d = 2;
int sum = 0;
while(d--){
if(a>b){
sum+=a;
a=a-1;
}
else if(a<b){
sum+=b;
b=b-1;
}
else if(a==b && d==2){
sum = a+b;
}
else{
sum+=a;
}
}
cout << sum << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define REV(v) reverse(v.begin(), v.end())
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define SZ(v) (int)v.size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
class BIT {
int n;
vector<ll> node;
public:
BIT(int N) : n(N), node(N + 1) {}
void add(int i, ll x) {
for (++i; i <= n; i += i & -i) { node[i] += x; }
}
ll sum(int i) {
ll s = 0;
for (; i > 0; i -= i & -i) { s += node[i]; }
return s;
}
};
class RSQ {
int n;
BIT a, b;
public:
RSQ(int N) : n(N), a(N), b(N) {}
void add(int l, int r, ll x) {
int t = r - l;
a.add(l, -l * x);
a.add(r, r * x);
b.add(l, x);
b.add(r, -x);
}
ll sum(int i) { return a.sum(i) + i * b.sum(i); }
};
class Main {
int N, K;
vector<int> A;
void input() {
cin >> N >> K;
A.resize(N);
REP(i, N) { cin >> A[i]; }
}
void output() {
REP(_, K) {
vector<ll> imos(N + 2);
REP(i, N) {
imos[max(0, i - A[i]) + 1] += 1;
imos[min(N, i + A[i] + 1) + 1] -= 1;
}
REP(i, N) {
imos[i + 1] += imos[i];
A[i] = imos[i + 1];
}
if (*min_element(A.begin(), A.end()) == N) break;
}
REP(i, N) { cout << A[i] << " "; }
cout << endl;
}
public:
Main() {
input();
output();
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void Main()
{
int n, m;
cin >> n >> m;
int a[m], b[m];
int j = 0;
int sp = 0;
for (int i = 0; i < m/2; i++)
{
a[i] = j;
j++;
sp++;
}
int sp2 = sp;
if(m % 2 == 1){
a[sp] = j;
j++;
b[sp] = j;
j++;
sp++;
}
for (int i = 0; i < m/2; i++)
{
b[sp2-i-1] = j;
j++;
}
for (int i = 0; i < m/2; i++)
{
a[i+sp] = j;
j++;
}
j++;
for (int i = 0; i < m/2; i++)
{
b[sp2-i-1+sp] = j;
j++;
}
for (int i = 0; i < m; i++){
cout << a[i]+1 << " " << b[i]+1 << endl;
}
}
int main(int argc, char **argv)
{
Main();
return 0;
}
| 0 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = int_fast64_t;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
void answer() {
int n; cin>>n;
const ll INF = 1e18;
vector<ll> A(n);
rep(i,n) cin>>A[i];
vector<vll> dp(n+1, vll(5, -INF));
dp[0][0] = 0;
int k = n%2+1;
rep(i,n) repc(j,k) {
chmax(dp[i+1][j+1], dp[i][j]);
if((i+j)%2==0) chmax(dp[i+1][j], dp[i][j] + A[i]);
else chmax(dp[i+1][j], dp[i][j]);
}
cout << dp[n][k] << "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
bool prime[MAX];
int prime_numbers[9999999],pos;
void sieve()
{
prime[0]=1;
prime[1]=1;
for(int i=4; i<=MAX; i+=2)
prime[i]=1;
int root = sqrt(MAX);
for(int i=3; i<=root; i+=2)
{
if(prime[i]==0)
{
for(int j=i*i; j<=MAX; j+=i)
{
prime[j]=1;
}
}
}
prime_numbers[pos++]=2;
for(int i=3; i<MAX; i+=2)
if(prime[i]==0)
prime_numbers[pos++]=i;
}
map<int,int>mp;
void recur(int pos,int sum,int taken,vector<int>v)
{
if(pos>=20)
return;
if(taken==5)
{
if(sum==67)
{
for(int i=0;i<5;i++)
cout<<v[i]<<" ";
cout<<endl;
}
mp[sum]++;
return ;
}
v.push_back(prime_numbers[pos]);
recur(pos+1,sum+prime_numbers[pos],taken+1,v);
v.pop_back();
recur(pos+1,sum,taken,v);
}
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
sieve();
// for(int i=0; prime_numbers[i]<55555; i++)
// cout<<prime_numbers[i]<<" "<<mp[prime_numbers[i]]<<endl;
int n;
cin>>n;
for(int i=0;i<pos;i++){
if(prime_numbers[i]%10==7){
cout<<prime_numbers[i]<<" ";
n--;
}
if(n==0)
break;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int n;
long long int ans = 3;
cin >> n;
int a[n], rgb[3] = {0};
for(int i = 0; i < n; ++i) {
cin >> a[i];
}
if(a[0] != 0) {
cout << 0 << '\n';
return 0;
}
rgb[0] = 1;
for(int i = 1; i < n; ++i) {
int sum = 0;
for(int j = 0; j < 3; ++j) {
if(rgb[j] == a[i]) sum++;
}
ans *= sum;
ans %= MOD;
for(int j = 0; j < 3; ++j) {
if(rgb[j] == a[i]) {
rgb[j]++;
break;
}
}
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;
int a[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n;
for (int i=0; i<n; i++) {
cin>>a[i];
}
multiset<int> ms;
ms.insert(0);ms.insert(0);ms.insert(0);
ll res = 1;
for (int i=0; i<n; i++) {
res=res*ms.count(a[i])%mod;
if (res==0) out(0);
ms.erase(ms.find(a[i]));
ms.insert(a[i]+1);
}
cout<<res<<endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define pb push_back
#define Nmax 210
#define M 63
using namespace std;
typedef long long ll;
string s;
int N, n, T;
bitset<M> A[Nmax];
ll a[Nmax];
bool gauss() { //true if linearly dep
int i=0,j=0;
while(i<N && j<M) {
int k;
for(k=i;k<N;++k) if(A[k][j]) break;
if(k==N) { ++j; continue; }
if(k!=i) swap(A[i], A[k]);
for(int u=i+1;u<N;++u) {
for(int q=j+1;q<M;++q) A[u][q] = (A[u][q] ^ (A[u][j]*A[i][q]));
A[u][j]=0;
}
++i; ++j;
}
return (A[N-1] == 0);
}
int main() {
cin>>T;
while(T--) {
cin>>n;
N = 0;
for(int i=0;i<n;++i) cin>>a[i];
cin>>s;
if(s[N-1] == '1') {
cout<<"1\n";
continue;
}
bool ok = true;
for(int i=n-1;i>=0;--i) {
A[N++] = a[i];
if(s[i] == '1') {
if(!gauss()) {
ok = false;
break;
}
--N;
} else {
if(gauss()) {
--N;
}
}
}
if(!ok) {
cout<<"1\n";
} else {
cout<<"0\n";
}
}
return 0;
} | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
#define endl '\n'
#define ld long double
#define all(a) a.begin(),a.end()
#define int long long
#define pb push_back
#define pii pair <int, int>
#define ff first
#define ss second
#define sz(v) (int)v.size()
#define UB upper_bound
#define LB lower_bound
#define BP(x) __builtin_popcountll(x)
#define OST tree<pii, null_type,less<pii>, rb_tree_tag,tree_order_statistics_node_update>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r) {
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
const int INF = 1e18 + 0;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const int MAXLOG = 62;
struct basis {
int base[MAXLOG];
void clear() {
for(int i = MAXLOG - 1; i >= 0; i--) base[i] = 0;
}
void prepare(int val) {
for(int i = MAXLOG - 1; i >= 0; i--) {
if((val >> i) & 1) {
if(!base[i]) { base[i] = val; return; }
else val ^= base[i];
}
}
}
int size() {
int c = 0;
for(int i = 0; i < MAXLOG; i++) c += (bool)(base[i]);
return c;
}
int max_xor() {
int res = 0;
for(int i = MAXLOG - 1; i >= 0; i--)
if(!((res >> i) & 1) && base[i]) res ^= base[i];
return res;
}
bool possible(int val) {
for(int i = MAXLOG - 1; i >= 0; i--)
if(((val >> i) & 1) && base[i]) val ^= base[i];
return (val == 0);
}
};
void solve() {
int n; cin >> n;
int data[n+5];
for(int i = 0; i < n; i++) cin >> data[i];
basis b; b.clear();
string s; cin >> s;
for(int i = n-1; i >= 0; i--) {
if(s[i] == '1') {
if(!b.possible(data[i])) {
cout << "1\n"; return;
}
} else {
b.prepare(data[i]);
}
}
cout << "0\n";
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1; cin >> t;
for(int i = 1; i <= t; i++) {
solve();
}
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
int n, a, b, x[100000];
int main(){
//IO("input.txt", "output.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> a >> b >> x[0];
long long cnt = 0;
for(int i = 1; i < n; i++){
cin >> x[i];
cnt += min((long long)b, a * (long long)(x[i] - x[i - 1]));
}
cout << cnt << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_dimension_size),value)
#define FILL(n,first_dimension_size,value) fill((int*)n,(int*)(n+first_dimension_size),value)
#define INF (1 << 30)
#define MOD 1000000007
//int dy[4] = {-1,0,0,1};
//int dx[4] = {0,1,-1,0};
int main(){
int n,a,b;
cin >> n >> a >> b;
vector<ll> v(n);
REP(i,n)cin >> v[i];
vector<ll> dist(n);
REP(i,n-1)dist[i] = v[i+1]-v[i];
ll res = 0;
REP(i,n-1)dist[i]*a <= b ? res += dist[i]*a : res += b;
cout << res << endl;
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int Rates(int A){
if (A>=10){
return 0;
}else{
return 100*(10-A);
}
}
int main(){
int N,R;
cin >>N>>R;
cout <<R+Rates(N)<<endl;
}
| #include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#define ll long long
int main()
{
int N, R;
std::cin >> N >> R;
if(N >= 10) {
std::cout << R << std::endl;
}
else {
std::cout << R + (10-N)*100 << std::endl;
}
} | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
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 maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
vector<ll> pw2(51,1);vector<ll> pw10(19,1);
ll high_order_bit(ll n){
ll tmp=1,i=-1;
while(tmp<=n){
tmp*=2;
i++;
}
if(n==0) return 0;
else return i;
}
vector<ll> binary_expansion(ll n){
vector<ll> B(high_order_bit(n)+1);
ll tmp=n;
for(ll i=high_order_bit(n);i>=0;i--){
B[i]=tmp/pw2[i];
tmp%=pw2[i];
}
return B;
}
vector<ll> divisor(ll x){
vector<ll> div;
for(int i=1;i*i<=x;i++){
if(i*i!=x && x%i==0){
div.pb(i);
div.pb(x/i);
}
else if(x%i==0) div.pb(i);
}
return div;
}
vector<ll> vectorprime(ll x){
vector<bool> is_prime(x+1);
vector<ll> prime;
rep(i,x+1) is_prime[i]=true;
is_prime[0]=is_prime[1]=false;
for(int i=2;i<=x;i++){
if(is_prime[i]){
prime.pb(i);
}
for(int j=i*2;j<=x;j+=i) is_prime[j]=false;
}
return prime;
}
int main(){
{rep1(i,50) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N; cin>>N;
ll count=0;
vector<ll> V=vectorprime(55555);
rep(i,sz(V)){
if(V[i]%5==2){
cout<<V[i]<<" ";
count++;
}
if(count==N) break;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
string str = to_string(N);
int length= str.size();
int div=0;
for(int i=0; i<length; i++){
div+=(int)(str[i] - '0');
}
if(N%div == 0){
cout<< "Yes" <<endl;
}else{
cout<< "No" <<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
//#define fr(i,j,k) for(int i=j;i<k;i++)
//#define f(n) fr(i,0,n)
//#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const ll mod = 1e11 + 7;
const int maxn = 2e5+5;
#include<atcoder/all>
using namespace atcoder;
void solve() {
int n, m;
cin >> n >> m;
fenwick_tree<ll>b(n);
for(int i = 0 ; i < n ; i++) {
ll x;
cin >> x;
b.add(i,x);
}
while (m--) {
int op;
cin >> op;
if (!op) {
int p, x;
cin >> p >> x;
b.add(p,x);
}
else {
int l, r;
cin >> l >> r;
cout << b.sum(l, r) << '\n';
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int c = 0;
int t;
if (!c) {
t = 1;
}
else {
cin >> t;
}
while (t--) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define LOL cout<<'\n';
#define MOD 1000000007
#define sz(x) ((int)x.size())
#define INF LONG_LONG_MAX
#define NINF LONG_LONG_MIN
#define deb(x) cout << "[" << (#x) << "=" << x << "]" << '\n';
#define deb2(x,y) cout << "[" << (#x) << "=" << x << "] [" << (#y) << "=" << y << "]" << '\n';
#define deb3(x,y,z) cout << "[" << (#x) << "=" << x << "] [" << (#y) << "=" << y << "] [" << (#z) << "=" << z << "]" << '\n';
const int N=1e5+7;
int n,m,k,q,l,r,x,y,z;
int a[N],b[N],c[N];
string s,t;
int ans=0,cnt=0;
void solve(){
cin>>n>>m;
cout<<n*m;LOL
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int _=1; //cin>>_;
for(int i=1 ; i<=_ ; i++) solve();
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define TRACE
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
const ll inf = 2e18;
const int mod = 1e9 + 7;
const int N = 1e4 + 10;
int dp[N][2][100];
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string k;
int d;
cin >> k >> d;
int n = k.length();
dp[0][1][0] = 1;
for(int i = 1; i <= n; i++) {
int cur = k[i - 1] - '0';
for(int j = 0; j <= 9; j++) {
for(int rem = 0; rem < d; rem++) {
dp[i][0][(rem + j) % d] = (dp[i][0][(rem + j) % d] + dp[i - 1][0][rem]) % mod;
if(j < cur) {
dp[i][0][(rem + j) % d] = (dp[i][0][(rem + j) % d] + dp[i - 1][1][rem]) % mod;
}
if(j == cur) {
dp[i][1][(rem + j) % d] = (dp[i][1][(rem + j) % d] + dp[i - 1][1][rem]) % mod;
}
}
}
}
cout << (dp[n][0][0] + dp[n][1][0] - 1 + mod) % mod;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int64_t f(int64_t x,int64_t y){
if(y==0)
return 1;
else if(y%2==0)
return (f(x,y/2)*f(x,y/2))%mod;
else
return (x*((f(x,y/2)*f(x,y/2))%mod))%mod;
}
int64_t comb(int64_t n,int64_t k){
int64_t a=1;
for(int64_t i=1;i<=k;i++){
a=(a*(n+1-i))%mod;
a=(a*f(i,mod-2))%mod;
}return a;
}
int main(){
int64_t N,M,K;
cin>>N>>M>>K;
int64_t ans=0;
for(int64_t i=1;i<M;i++)
ans=(ans+i*(M-i))%mod;
ans=(((ans*N)%mod)*N)%mod;
int64_t ans1=0;
for(int64_t i=1;i<N;i++)
ans1=(ans1+i*(N-i))%mod;
ans1=(((ans1*M)%mod)*M)%mod;
ans=(ans+ans1)%mod;
ans=(ans*comb(N*M-2,K-2))%mod;
cout<<ans<<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>> n;
set<int>st;
int input;
int ans = 0;
for(int i = 1; i <= n; i++)
{
cin>> input;
st.insert(input);
if(input == *st.begin())
ans++;
}
cout<< ans;
return 0;
}
| #include<bits/stdc++.h> //---------------------------------------------------------------
# define ll long long
# define mod 1000000007
# define MAX 100005
# define PI 3.141592653589793238 //shortcut keys
# define pb push_back
# define mp make_pair
# define all(x) x.begin(),x.end()
# define fr(i,a,b) for(int i=a;i<=b;i++)
# define decimal(k) fixed<<setprecision(k)
# define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); //---------------------------------------------------------------
using namespace std;
int main()
{
int n;cin>>n;
ll a[n+1],b[n+1];
fr(i,1,n)cin>>a[i];
b[1]=a[1];
fr(i,2,n){
if(a[i]>=b[i-1]){
b[i]=a[i];
}
else b[i]=b[i-1];
}
//fr(i,1,n)cout<<b[i]<<' ';
ll ans=0;
fr(i,1,n)ans+=b[i]-a[i];
cout<<ans<<'\n';
return 0;
}
| 0 |
#include <stdio.h>
int main(void)
{
int day[13][32];
int i, j;
int n = 4;
int month;
int da;
for (i = 1; i <= 12; i++){
if (i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10 || i == 12){
for (j = 1; j <= 31; j++){
day[i][j] = n;
n++;
if (n == 8){
n = 1;
}
}
}
else if (i == 4 || i == 6 || i == 9 || i == 11){
for (j = 1; j <= 30; j++){
day[i][j] = n;
n++;
if (n == 8){
n = 1;
}
}
}
else if (i == 2){
for (j = 1; j <= 29; j++){
day[i][j] = n;
n++;
if (n == 8){
n = 1;
}
}
}
}
while (1){
scanf("%d %d", &month, &da);
if (month == 0){
return (0);
}
//printf("%d\n", day[month][da]);
switch (day[month][da]){
case 1:
printf("Monday\n");
break;
case 2:
printf("Tuesday\n");
break;
case 3:
printf("Wednesday\n");
break;
case 4:
printf("Thursday\n");
break;
case 5:
printf("Friday\n");
break;
case 6:
printf("Saturday\n");
break;
case 7:
printf("Sunday\n");
break;
}
}
} | #include <iostream>
#include <vector>
#include <string>
int main()
{
std::vector<std::string> day_of_week{
"Thursday",
"Friday",
"Saturday",
"Sunday",
"Monday",
"Tuesday",
"Wednesday"
};
std::vector<int> day_num_of_month{
31,
29,
31,
30,
31,
30,
31,
31,
30,
31,
30,
31
};
int month = 0;
int day = 0;
while (std::cin >> month >> day)
{
if (0 == month) { break; }
int days_elapsed = 0;
for (int m = 1; m < month; ++m)
{
days_elapsed += day_num_of_month[m - 1];
}
days_elapsed += day;
std::cout << day_of_week[(days_elapsed - 1) % 7] << std::endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll n,m,k,ans=0,tmp=1;
ll power(ll a,ll b) {return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
int main()
{
cin>>n>>m>>k;
for(ll i=0;i<=k;i++){
ans=(ans+(tmp*m%mod)*power(m-1,n-i-1))%mod;
tmp=tmp*(n-i-1)%mod*power(i+1,mod-2)%mod;
}
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define MAX 100001
#define MOD 1000000007
#define ll long long
#define ld long double
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
int main() {
fast;
int t = 1;
// cin >> t;
while(t--) {
int n, x, t;
cin >> n >> x >> t;
int ans = (n / x) * t;
if(n % x != 0) ans += t;
cout << ans << endl;
}
}
| 0 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
// ===============================================================
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
// ===============================================================
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
//最大公約数
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
//最小公倍数
ll box(double a)
{
ll b = a;
return b;
}
//切り捨て
ll fff(double a)
{
ll b = a + 0.5;
return b;
}
//四捨五入
ll sum(ll n) {
return (1 + n) * n / 2;
}
//1から整数nまでの合計
bool prime(ll a)//素数判定、primeならtrue,違うならfalse
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double sqrtNum = sqrt(a);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (a % i == 0)
{
return false;
}
}
// 素数である
return true;
}
//素数判定
// ===============================================================
int main() {
ll n;
cin >> n;
string a;
cin >> a;
vl x(n, 0);
vl y(n, 0);
for (int i = 0; i < n; i++) {
if (a[i] == 'E') {
if (i == 0) {
x[i] = 1;
y[i] = 0;
}
else {
x[i] = x[i - 1] + 1;
y[i] = y[i - 1];
}
}
if (a[i] == 'W') {
if (i == 0) {
y[i] = 1;
x[i] = 0;
}
else {
y[i] = y[i - 1] + 1;
x[i] = x[i - 1];
}
}
}//x=E y=W
ll count = 0;
ll ans = 100000000;
for (int i = 0; i < n; i++) {
if (i != 0) {
count = (x[n - 1] - x[i]) + y[i - 1];
}
else {
count = x[n - 1] - x[i];
}
if (min(ans, count) == count) {
ans = count;
}
count = 0;
}
cout << ans << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int N; string S; vi l,r;
void input()
{
cin>>N>>S;
}
void solve()
{
int count=0;
for(int i=0;i<N;++i) {
if(S[i]=='W') ++count;
l.emplace_back(count);
}
count=0;
for(int i=0;i<N;++i) {
if(S[N-1-i]=='E') ++count;
r.emplace_back(count);
}
int MIN=100000000;
for(int i=0;i<N;++i) {
int tmp=0;
if(i>0) tmp+=l[i-1];
if(i<N-1) tmp+=r[N-2-i];
MIN=min(MIN,tmp);
}
cout<<MIN<<endl;
}
int main()
{
cin.tie();
ios::sync_with_stdio(false);
input();
solve();
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl/*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); ++i)
#define rep2(i, n) for(ll i = 1; i <= ll(n); ++i)
//#define rep(i, k, n) for(ll i = k-1; i < ll(n); ++i)
//#define rep2(i, k, n) for(ll i = k; 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 = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 1e9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
cout << ((a-c)*(c-b)>=0 ? "Yes" : "No") << newl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if ((a < c && b > c) || (a > c&& b < c)) puts("Yes");
else puts("No");
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> void PrintVector(const vector<T> &vec) {for (auto val : vec) cout << val << " "; cout << endl;}
const long long INF = 1LL << 60;
const long long minusINF = -(1LL << 40);
const int MOD = 1000000007;
const double PI = acos(-1); //3.14~
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<ll> divisor(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
template<class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
int main()
{
ll n, m; cin >> n >> m;
vector<ll> a = divisor(m);
cout << a[former(a, m/n)] << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <cstdio>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
# define ll int64_t
# define str string
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define PI 3.141592653589793
# define vec vector
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define INF 2000000000
#define MAX_V 10
const int MAX_N =10000000;
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
bool my_compare(pair<ll,ll> a,pair<ll,ll> b){
if(a.first != b.first) return a.first<b.first;
if(a.second != b.second) return a.second>b.second;
else return true;
}
ll modpow(ll a,ll n,ll mod1) {
ll res=1;
while(n>0){
if(n&1) res=res*a%mod1;
a = a*a%mod1;
n >>= 1;
}
return res;
}
ll factorial(ll n){
ll x=1;
rrep(i,n) x*=i;
return x;
}
ll gcd(ll a,ll b) { return b ? gcd(b, a%b) : a; }
ll func(ll a,ll b,ll& ans_x,ll& ans_y){
if(b == 0){
ans_x = 1;
ans_y = 0;
return a;
}else{
ll ret = func(b,(a%b),ans_y,ans_x);
ans_y -= (a/b)*ans_x;
return ret;
}
}
ll par[MAX_N],ranking[MAX_N];
void init(ll n){
rep(i,n){
par[i]=i;
ranking[i]=0;
}
}
ll find(ll x){
if(par[x]==x) return x;
else return par[x]=find(par[x]);
}
void unite(ll x,ll y){
x=find(x);
y=find(y);
if(x==y) return;
if(ranking[x]<ranking[y]) par[x]=y;
else{
par[y]=x;
if(ranking[x]==ranking[y]) ranking[x]++;
}
}
bool same(ll x,ll y){
return find(x)==find(y);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m;
cin>>n>>m;
map<ll,ll> mp;
for(ll i=1;i*i<=m;i++){
if(m%i==0){
if(i==m/i) mp[i]+=m/i;
else {
mp[m/i]+=i;
mp[i]+=m/i;
}
}
}
ll maxi=1;
for(auto p:mp){
if(p.second>=n || p.first<=m/n) maxi=max(p.first,maxi);
}
cout<<maxi<<endl;
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
vector< pair<int,int> > V;
vector< pair< pair<int,int>,int> > E;
vector<pair<int,int> > G[500005];
int dist[500005];
map<pair<int,int>,int> mp;
int main(){
int N,M;
cin>>N>>M;
for(int i = 0;i < M;i++){
int p,q,c;
cin>>p>>q>>c;
E.push_back(make_pair(make_pair(p,q),c));
V.push_back(make_pair(p,c));
V.push_back(make_pair(q,c));
}
for(int i = 1;i <= N;i++){V.push_back(make_pair(i,0));}
for(int i = 0;i<500005;i++)dist[i]=-1;
sort(V.begin(),V.end());
V.resize(unique(V.begin(),V.end()) -V.begin());
int vsize = V.size();
for(int i = 0;i < vsize;i++){
mp[V[i]]=i;
}
for(int i = 0;i < E.size();i++){
int p,q,c;
p=E[i].first.first;
q=E[i].first.second;
c=E[i].second;
G[mp[make_pair(p,c)]].push_back(make_pair(0,mp[make_pair(q,c)]));
G[mp[make_pair(q,c)]].push_back(make_pair(0,mp[make_pair(p,c)]));
G[mp[make_pair(p,c)]].push_back(make_pair(0,mp[make_pair(p,0)]));
G[mp[make_pair(p,0)]].push_back(make_pair(1,mp[make_pair(p,c)]));
G[mp[make_pair(q,c)]].push_back(make_pair(0,mp[make_pair(q,0)]));
G[mp[make_pair(q,0)]].push_back(make_pair(1,mp[make_pair(q,c)]));
}
priority_queue<pair<int,int> ,vector<pair<int,int> > ,greater<pair<int,int> > > pq;
pq.push(make_pair(0,mp[make_pair(1,0)]));
while(!pq.empty()){
pair<int,int> top = pq.top();
pq.pop();
int d = top.first;
int v = top.second;
//cout<<"a: "<<d<<" "<<V[v].first<<" "<<V[v].second<<" "<<endl;
if(dist[v]==-1||dist[v] > d){
dist[v] = d;
for(int i = 0; i < G[v].size(); i++){
pq.push(make_pair(G[v][i].first + d, G[v][i].second));
}
}
}
cout<<dist[mp[make_pair(N,0)]]<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int>v(m + 3), v2, stick(12), val(12, -1), vis(12, 0);
stick[1] = 2, stick[2] = 5, stick[3] = 5, stick[4] = 4, stick[5] = 5, stick[6] = 6, stick[7] = 3, stick[8] = 7, stick[9] = 6;
for(int i = 0; i < m; i++){
cin >> v[i];
if(vis[stick[v[i]]] == 0){
vis[stick[v[i]]] = 1;
v2.push_back(stick[v[i]]);
}
val[stick[v[i]]] = max(val[stick[v[i]]], v[i]);
}
int dp[n + 3];
for(int i = 0; i <= n; i++){
dp[i] = -1;
}
dp[0] = 0;
for(int i = 0; i < v2.size(); i++){
for(int j = v2[i]; j <= n; j++){
if(dp[j - v2[i]] != -1){
dp[j] = max(dp[j], dp[j - v2[i]] + 1);
}
}
}
vector<pair<int, int> >vec;
for(int i = 0; i < v2.size(); i++){
vec.push_back(make_pair(val[v2[i]], v2[i]));
}
sort(vec.rbegin(), vec.rend());
string s;
int cnt = 0;
while(n > 0){
cnt++;
for(int j = 0; j < vec.size(); j++){
if(n - vec[j].second >= 0 && dp[n] == dp[n - vec[j].second] + 1){
s.push_back('0' + vec[j].first);
n = n - vec[j].second;
break;
}
}
}
cout << s;
return 0;
} | 0 |
#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 <math.h>
#include <cmath>
#include <ctime>
#include <stdlib.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define fir first
#define sec second
#define m_p make_pair
#define m_t make_tuple
#define rep(i,n) for(int i=0; i<(int) (n); i++)
typedef pair<int, int> P;
const double pai = 3.1415926535897;
const int mod = 1000000007;
const int INF = 1000000021;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
//x未満の要素数を返す二分探索関数
int b_s(vector<int>& vec, int xx) {
return lower_bound(all(vec), xx) - vec.begin();
}
template<typename T>void vecout(vector<T>& vec) { for (T t : vec) cout << t << " "; cout << endl; }
template<typename TT>void vecin(vector<TT>& vec) {
for (int i = 0; i < vec.size(); i++) {
cin >> vec[i];
}
}
// テーブルを作る前処理
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;
}
}
//n個を1個以上のx組のグループに分ける重複組み合わせはcom(n-1,x-1)
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;
}
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;
}
long long modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
bool chmax(int& xx, int yy) {
if (xx < yy) {
xx = yy;
return true;
}
return false;
}
bool chmin(int& xx, int yy) {
if (xx > yy) {
xx = yy;
return true;
}
return false;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) {
return xx * yy / gcd(xx, yy);
}
bool prime(int xx) {
if (xx <= 1) {
return 0;
}
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
signed main() {
int n,mi=INF,ans=1;
cin >> n;
for (int i = 1; i*i <= n; i++) {
if (n % i == 0) {
chmin(mi,n / i);
}
}
if (mi == INF)mi = n;
while (mi >= 10) {
mi /= 10;
ans++;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; j <= i; --i)
int main() {
ll n;
cin >> n;
ll m = (ll)sqrt((double)n);
auto d = [](ll x) {
ll res = 0;
while (x) {
x /= 10;
res++;
}
return res;
};
rrep(i, 1, m + 1) {
if (n % i == 0) {
cout << max(d(i), d(n / i)) << '\n';
return 0;
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
int minv = 1000;
for (int i = 0; i < s.size() - 2; ++i) {
minv = min(minv, abs(stoi(s.substr(i, 3)) - 753));
}
std::cout << minv << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main(){
int n;
cin >> n;
vector <int> s(4);
rep(i,4){
s[3-i] = n%10;
n /= 10;
}
vector <char> ansi(3);
for(int i=0; i<(1<<3); i++){
bitset<3> a(i);
int tmp = s[0];
for(int j=0; j<3; j++){
if(a.test(j)){
tmp += s[j+1];
ansi[j] = '+';
}
else{
tmp -= s[j+1];
ansi[j] = '-';
}
}
if(tmp == 7) break;
}
rep(i,3){
cout << s[i] << ansi[i];
}
cout << s[3];
cout << "=7" << endl;
}
| 0 |
#include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <cmath>
#include <set>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<25;
const double pi=acos(-1);
const double eps=1e-8;
const vi emp;
class Graph{
private:
int V;
public:
vvi Pro;
Graph(int v){
V=v;
Pro=vvi(v,vi(v,inf));
for(int i=0;i<v;i++) Pro[i][i]=0;
}
void add_edge(int x,int y,int c){
Pro[x][y]=c;
Pro[y][x]=c;
}
void Warshall(){
for(int k=0;k<V;k++){
for(int i=0;i<V;i++){
for(int j=0;j<V;j++){
Pro[i][j]=min(Pro[i][j],Pro[i][k]+Pro[k][j]);
}
}
}
}
};
int V,E,N;
int main(){
while(1){
cin>>E>>V;
if(!V&&!E) break;
Graph cost(V),time(V);
int s,t,c,l;
for(int i=0;i<E;i++){
cin>>s>>t>>c>>l;
s--;
t--;
cost.add_edge(s,t,c);
time.add_edge(s,t,l);
}
cost.Warshall();
time.Warshall();
cin>>N;
bool r;
for(int i=0;i<N;i++){
cin>>s>>t>>r;
s--;
t--;
if(r) cout<<time.Pro[s][t]<<endl;
else cout<<cost.Pro[s][t]<<endl;
}
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int n;
int ary[100][100];
while(1)
{
cin >> n;
int sumx = 0;
int sumy = 0;
int sumxy = 0;
if(n == 0)
{
break;
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)
{
cin >> ary[i][j];
}
}
for(int i = 0; i < n; i++){
sumx = 0;
for(int j = 0; j < n; j++)
{
sumx += ary[i][j];
sumxy += ary[i][j];
printf("%5d",ary[i][j] );
//ary[i][j] << " ";//????????´???
}
printf("%5d", sumx);
cout << endl;
}
for(int i = 0; i < n; i++){
sumy = 0;
for(int j = 0; j < n; j++)
{
sumy += ary[j][i];
}
printf("%5d", sumy);
}
printf("%5d\n", sumxy);
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;
}
int main(){
int n;
ll k;
cin >> n >> k;
ll a[n];
int flag = 0;
ll max = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
if(max < a[i]){
max = a[i];
}
if(a[i] == k){
flag = 1;
}
}
if(flag == 0){
ll b = a[0];
for(int i = 1; i < n; i++){
b = gcd(b, a[i]);
if(b == 1){
break;
}
}
if(k % b == 0 && k <= max){
flag = 1;
}
}
if(flag == 0){
cout << "IMPOSSIBLE" << endl;
}else{
cout << "POSSIBLE" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
int K;
cin >> K;
vector<int> A(N + 1,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i + 1);
}
for(int i = 1; i < N; i++) {
A.at(i + 1) += A.at(i);
}
int ans = 0;
for(int i = 0; i < N - K + 1; i++) {
ans = max(ans, A.at(i + K) - A.at(i));
}
cout << fixed << setprecision(15) << (double)(ans + K)/2 << endl;
return 0;
} | 0 |
#if 0
2019.12.30
朴素 dp 设 f[i][p][q] 表示前 i 次操作后当前棋子为 (p, q) 的最小代价。
事实上由于第 i 次操作后一定有一个棋子是 x[i] ，因此可以优化一维：
f[i][j] 表示前 i 次操作后当前棋子为 (j, x[i]) 的最小代价。
转移有两种：
1) f[i - 1][j] + |x[i - 1] - x[i]| -> f[i][j]
2) min(f[i - 1][k] + |x[i] - k|) -> f[i][x[i - 1]]
用线段树维护 f[~][j] ，第一种转移就是全局加，第二种是单点取 min 。
第二种转移可以把左边的绝对值拆开：
f[i - 1][k] - k + x[i] (k < x[i])
f[i - 1][k] (k = x[i])
f[i - 1][k] + k - x[i] (k > x[i])
线段树分别维护 f[~][j] - j, f[~][j], f[~][j] + j 即可。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
inline operator ll () { ll x; return scanf("%lld", &x), x; }
template<class T> inline void operator () (T &x) { x = *this; }
template<class T, class ...A> inline void operator () (T &x, A &...a)
{ x = *this; this -> operator ()(a...); }
} read;
const int maxn = 200005;
ll f[maxn << 2], fa[maxn << 2], fb[maxn << 2], tag;
void modify(int now, int L, int R, int p, ll x) {
f[now] = std::min(f[now], x);
fa[now] = std::min(fa[now], x + p);
fb[now] = std::min(fb[now], x - p);
if(L == R) return;
int M = (L + R) >> 1;
if(p <= M) modify(now << 1, L, M, p, x);
else modify(now << 1 | 1, M + 1, R, p, x);
}
void build(int now, int L, int R) {
f[now] = fa[now] = fb[now] = 1000000000000000000;
if(L == R) return;
int M = (L + R) >> 1;
build(now << 1, L, M);
build(now << 1 | 1, M + 1, R);
}
ll query(int now, int L, int R, int p) {
if(R < p) return p + fb[now];
if(L > p) return fa[now] - p;
if(L == R) return f[now];
int M = (L + R) >> 1;
return std::min(query(now << 1, L, M, p), query(now << 1 | 1, M + 1, R, p));
}
int main() {
int n = read, q = read, a = read, b = read;
build(1, 1, n);
modify(1, 1, n, a, 0);
/* modify(1, 1, n, b, 0); */
int last = b;
while(q --) {
int x = read;
ll qu = query(1, 1, n, x) + tag;
/* debug("qu = %lld\n", qu); */
tag += std::abs(x - last);
modify(1, 1, n, last, qu - tag);
last = x;
/* debug("tag=%lld\n", tag); */
}
printf("%lld\n", f[1] + tag);
}
| #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, x;
cin >> n >> x;
vector<ll> vec(n);
for (auto &v : vec)
cin >> v;
ll ans = 0;
for (ll i = 1; i< n; ++i) {
ll vsum = vec[i] + vec[i-1];
if (vsum <= x)
continue;
else if (vsum - x <= vec[i])
vec[i] -= vsum - x;
else
vec[i] = 0;
ans += vsum - x;
}
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
int main() {
string s;
cin>>s;
if(s=="hi"||s=="hihi"||s=="hihihi"||s=="hihihihi"||s=="hihihihihi"){
puts("Yes");
}else{
puts("No");
}
return 0;
} | #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<string,int>;
const double PI = acos(-1);
int main() {
string s;
cin >> s;
bool ans = true;
rep(i,s.size()){
if(s.size()%2!=0){
ans = false;
break;
}
if(s.at(i)!='h' || s.at(i+1)!='i') ans = false;
i++;
}
cout << (ans?"Yes":"No") << endl;
}
| 1 |
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
int n,a[111111]={},sum=0;
int main() {
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=abs(a[i]-a[i-1]);
}
sum+=abs(a[n]);
for(int i=1;i<=n;i++){
int tmp=abs(a[i-1]-a[i+1])-abs(a[i]-a[i-1])-abs(a[i+1]-a[i]);
cout<<sum+tmp<<endl;
}
return 0;
}
| #include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
int S[n];
for (int i = 0; i < n; i++)
{
scanf("%d", &S[i]);
}
int q;
scanf("%d", &q);
int T[q];
for (int i = 0; i < q; i++)
{
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i < q; i++)
{
for (int j = 0; j < n; j++)
{
if (S[j] == T[i])
{
cnt++;
break;
}
}
}
printf("%d\n", cnt);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int maxn = 4000 + 10;
int n, k;
ll inv[maxn], fac[maxn], facinv[maxn], ans[maxn];
void init()
{
inv[0] = inv[1] = 1;
fac[0] = facinv[0] = 1;
for(int i = 1; i < maxn; ++i)
fac[i] = fac[i - 1] * i % mod;
for(int i = 2; i < maxn; ++i)
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
for(int i = 1; i < maxn; ++i)
facinv[i] = facinv[i - 1] * inv[i] % mod;
}
ll C(ll m, ll n)
{
return fac[m] * facinv[m - n] % mod * facinv[n] % mod;
}
ll norm(ll x)
{
while(x > 0) x -= mod;
while(x < 0) x += mod;
return x;
}
int main()
{
init();
scanf("%d%d", &k, &n);
for(int j = 2; j <= k + 1; ++j)
{
ll ret = 0;
int t = j >> 1;
for(int i = 0; i <= t && n - 2 * i >= 0; ++i)
{
ll tmp = C(t, i) * C(n - 2 * i + k - 1, k - 1) % mod;
if(i & 1)
ret = norm(ret - tmp);
else
ret = norm(ret + tmp);
}
ans[j] = ans[2 * k - j + 2] = ret;
}
for(int j = 2; j <= 2 * k; ++j)
printf("%lld\n", ans[j]);
return 0;
} | // ※※※ 解答不能 ※※※
// 解き直し.
// scott_wu氏.
// https://atcoder.jp/contests/arc102/submissions/3114772
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL MOD = 998244353;
const int MAXN = 4100;
int K, N;
LL pascal[MAXN][MAXN];
int main(){
pascal[0][0] = 1;
for(int i = 1; i < MAXN; i++){
for (int j = 0; j < MAXN; j++){
pascal[i][j] = pascal[i - 1][j];
if(j) pascal[i][j] = (pascal[i][j] + pascal[i - 1][j - 1]) % MOD;
}
}
scanf("%d %d", &K, &N);
for(int i = 2; i <= 2 * K; i++){
int n2 = 0, n1 = 0;
for(int j = 1; j <= K; j++){
if(j * 2 == i) continue;
if((i - j) <= K && (i - j) >= 1) n2++;
else n1++;
}
n2 /= 2;
LL res = 0;
LL p2 = 1;
for(int j = 0; j <= n2; j++){
if(j) p2 = (p2 * 2) % MOD;
if(j > N) continue;
if(j == 0 && n1 == 0) continue;
res = (res + pascal[n2][j] * (p2 * pascal[N + n1 - 1][j + n1 - 1] % MOD)) % MOD;
if(i % 2 == 0) res = (res + pascal[n2][j] * (p2 * pascal[N+n1-2][j+n1-1] % MOD)) % MOD;
}
printf("%lld\n", res);
}
return 0;
} | 1 |
#include<iostream>
using namespace std;
class dice {
private:
int n[7];
public:
dice(int, int, int, int, int, int);
int getcur() { return n[1]; }
void rotate(char);
};
dice::dice(int n1, int n2, int n3, int n4, int n5, int n6) {
n[1] = n1;
n[2] = n2;
n[3] = n3;
n[4] = n4;
n[5] = n5;
n[6] = n6;
}
void dice::rotate(char op) {
dice copy(n[1], n[2], n[3], n[4], n[5], n[6]);
switch (op) {
case'W':
n[1] = copy.n[3];
n[3] = copy.n[6];
n[6] = copy.n[4];
n[4] = copy.n[1];
break;
case'E':
n[1] = copy.n[4];
n[3] = copy.n[1];
n[6] = copy.n[3];
n[4] = copy.n[6];
break;
case'S':
n[1] = copy.n[5];
n[2] = copy.n[1];
n[6] = copy.n[2];
n[5] = copy.n[6];
break;
case'N':
n[1] = copy.n[2];
n[2] = copy.n[6];
n[6] = copy.n[5];
n[5] = copy.n[1];
break;
}
}
int main() {
int n[7];
for (int i = 1; i <= 6; i++) {
cin >> n[i];
}
dice a(n[1], n[2], n[3], n[4], n[5], n[6]);
char op;
while (cin >> op) {
a.rotate(op);
//cerr << a.getcur() << endl;
}
cout << a.getcur() << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
template<typename T>
vector<T> read_vec(size_t n){
vector<T> tmp(n);
for(size_t i = 0; i < n; i++){
cin >> tmp[i];
}
return tmp;
}
//配列を区切って出力する
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
int main(){
Stream io;
int N;
io.read(N);
int ans;
for(ans = 1; (ans + 1) * (ans + 1) <= N; ans++);
cout << ans * ans;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; (i) >= (int) (b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x
#define TRUE__ "Yes"
#define FALSE__ "No"
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define RS resize
#define CINV(v, N) do {\
v.RS(N);\
rep(i, N) cin >> v[i];\
} while (0);
#define RCINV(v, N) do {\
v.RS(N);\
rrep(i, N) cin >> v[i];\
} while (0);
#define MOD 998244353
template<class T>
inline T GET() {
T x;
cin >> x;
return x;
}
void init();
void solve();
signed main()
{
init();
solve();
}
ll dp[2020][2020];
ll sum;
int K, N;
void init()
{
cin >> K >> N;
rep(i, K) {
dp[N-1][i] = 1;
}
rrep(i, N-1) {
ll a = 0;
rrep(j, K) {
a += dp[i+1][j];
a %= MOD;
dp[i][j] = a;
}
}
rep(i, K) {
sum += dp[0][i];
sum %= MOD;
}
}
struct comb {
#define MOD_COMB MOD
vector<ll> fact;
vector<ll> facti;
comb(int n) {
init(n);
}
void init(int n) {
fact.resize(n);
facti.resize(n);
fact[0] = 1;
for (int i = 1; i < n; i++) {
fact[i] = fact[i-1] * i % MOD_COMB;
}
facti[n-1] = po(fact[n-1], MOD_COMB - 2);
for (int i = n-2; i >= 0; i--) {
facti[i] = facti[i+1] * (i + 1) % MOD_COMB;
}
}
ll nCr(int a, int b) {
return (fact[a] * facti[b] % MOD_COMB) * facti[a-b] % MOD_COMB;
}
private:
ll po(ll next, int cnt) {
ll res = 1;
if (cnt == 0) return 1;
if (cnt & 1) res = res * next % MOD_COMB;
return res * po(next * next % MOD_COMB, cnt >> 1) % MOD_COMB;
}
};
void solve()
{
vector<ll> res;
comb co(2020);
if (K == 1) {
cout << 0 << endl;
return;
}
int i = 0;
reps(cnt, 3, K+3) {
ll hugo = 1;
ll ans = 0;
rep(j, i+1) {
ans += hugo * co.nCr(i+1, j+1) * dp[j*2+1][0];
ans %= MOD;
hugo *= -1;
}
res.PB(ans);
res.PB(ans);
cnt++;
i++;
}
if (K%2) res.pop_back();
rep(i, res.size()) {
cout << (sum - res[i] + MOD) % MOD << endl;
}
rrep(i, res.size()-1) {
cout << (sum - res[i] + MOD) % MOD << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int put(int a, int b)
{
int ans = 1;
while (b) {
if (b & 1)
ans = 1LL * ans * a % MOD;
a = 1LL * a * a % MOD;
b /= 2;
}
return ans;
}
const int NMAX = 2e6;
int fact[NMAX], invfact[NMAX];
void precalc()
{
fact[0] = 1;
for (int i = 1; i < NMAX; i++)
fact[i] = 1LL * i * fact[i - 1] % MOD;
invfact[NMAX - 1] = put(fact[NMAX - 1], MOD - 2);
for (int i = NMAX - 1; i >= 1; i--)
invfact[i - 1] = 1LL * invfact[i] * i % MOD;
}
int comb(int a, int b)
{
if (a < b || b < 0)
return 0;
return 1LL * fact[a] * invfact[b] % MOD * invfact[a - b] % MOD;
}
int main()
{
ios_base::sync_with_stdio(0);
precalc();
int N, M;
cin >> N >> M;
int ans = 0;
for (int nri = 0; nri <= min(N, M); nri++) {
/// sunt nri impare
int left = 3 * M - nri;
if (left % 2 == 1)
continue;
left /= 2;
int modurii = comb(N, nri);
int modurip = comb(N + left - 1, N - 1);
ans = (ans + 1LL * modurii * modurip) % MOD;
}
for (int toomuch = 2 * M + 1; toomuch <= 3 * M; toomuch++) {
int moduri = comb(N + 3 * M - toomuch - 2, N - 2);
ans = (ans - 1LL * moduri * N) % MOD;
}
if (ans < 0)
ans += MOD;
cout << ans << '\n';
return 0;
} | 0 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define nl '\n'
#define INF 1e9 + 5
#define f(i, n) for (int i = 0; i < n; ++i)
using namespace std;
pair<int, int> get(vector<int>& a, bool even, int skip) {
int n = a.size();
unordered_map<int, int> book;
pair<int, int> res = {0, 0};
if (even) {
for (int i = 0; i < n; ++i) {
if (i & 1 || a[i] == skip) continue;
if (book.count(a[i]))
book[a[i]]++;
else
book[a[i]] = 1;
if (res.second < book[a[i]]) {
res.first = a[i];
res.second = book[a[i]];
}
}
} else {
for (int i = 0; i < n; ++i) {
if (!(i & 1) || a[i] == skip) continue;
if (book.count(a[i]))
book[a[i]]++;
else
book[a[i]] = 1;
if (res.second < book[a[i]]) {
res.first = a[i];
res.second = book[a[i]];
}
}
}
return res;
}
void solve() {
int n;
cin >> n;
vector<int> a(n);
f(i, n) cin >> a[i];
int m = n / 2;
pair<int, int> one = get(a, true, INF);
pair<int, int> two = get(a, false, one.first);
pair<int, int> three = get(a, false, INF);
pair<int, int> four = get(a, true, one.first);
int ans = min({(m - one.second) + (m - two.second),
(m - three.second) + (m - four.second)});
cout << ans << nl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
} | #include<iostream>
using namespace std;
int m[101];
int main(){
int n,q;
int i,j;
int d,x;
int max,a,f;
while(1){
f=0;
max=-1;
for(i=0;i<101;i++){
m[i]=0;
}
cin >> n >> q;
if(n==0 && q==0)break;
q--;
for(i=0;i<n;i++){
cin >> d;
if(d==0)f=1;
for(j=0;j<d;j++){
cin >> x;
m[x]++;
}
}
a=0;
for(i=0;i<100;i++){
if(q<m[i]){
q=m[i];
a=i;
}
m[i]=0;
}
cout << a << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
int maxv = max(a, b);
int minv = min(a, b);
int c = minv - 1;
int d = maxv - c;
int count = 0;
bool da[100][100];
fill(da[0], da[0]+100*100, false);
for (int i = 0; i < 25; i++) {
for (int j = 0; j < 25; j++) {
if (!(count < c))
goto end;
int ox = j*4;
int oy = i*4;
da[oy+0][ox+0] = true;
da[oy+0][ox+1] = true;
da[oy+0][ox+2] = true;
da[oy+1][ox+0] = true;
da[oy+1][ox+2] = true;
da[oy+2][ox+0] = true;
da[oy+2][ox+1] = true;
da[oy+2][ox+2] = true;
count++;
}
}
end:
count = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 50; j++) {
if (!(count < d))
goto end2;
int oy = 80+i*2;
int ox = j*2;
da[oy][ox] = true;
count++;
}
}
end2:
printf("100 100\n");
for (int y = 0; y < 100; y++) {
for (int x = 0; x < 100; x++) {
if (minv == maxv) {
if (da[y][x])
putchar('#');
else
putchar('.');
} else {
if (maxv == b) {
if (da[y][x])
putchar('#');
else
putchar('.');
} else {
if (da[y][x])
putchar('.');
else
putchar('#');
}
}
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
// 最大公約数
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
// 最小公倍数
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
const int MAX = 1000000;
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;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
int main()
{
cout << fixed << setprecision(15);
ll N, M;
cin >> N >> M;
// for(auto p : prime_factor(N)) {
// while(p.second--) cout << " " << p.first;
// }
// cout << endl;
map<ll, ll> PR;
PR = prime_factor(M);
// 前処理
COMinit();
ll ans = 1;
for(auto p:PR){
// cout << p.second << endl;
ans = (ans * COM(p.second + N - 1, p.second)) % MOD;
ans = ans % MOD;
}
cout << ans << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
#define ll long long
#define N 20
#define inf 1e9
#define rep(i,j,k) for(ll i=j;i<=k;++i)
using namespace std;
inline ll read(){
ll x=0,f=0;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+ch-48;
return f?-x:x;
}
ll n,m,G[N][N],f[1<<N][N],s[1<<N],sum;
int main(){
n=read();m=read();
rep(i,1,m){
ll x=read()-1,y=read()-1;
G[x][y]=G[y][x]=read(); sum+=G[x][y];
}
rep(i,0,1<<n) rep(j,0,n) if((i>>j)&1)
rep(k,j+1,n) if((i>>k)&1) s[i]+=G[j][k];
rep(i,0,1<<n) rep(j,0,n) f[i][j]=-inf;
rep(i,0,1<<n) if(i&1) f[i][0]=s[i];
rep(i,0,1<<n) rep(j,0,n) if((i>>j)&1)
for(ll k=i;k;k=(k-1)&i) if(k&1)
rep(l,0,n) if(((k>>l)&1)&&((~k>>j)&1)&&G[l][j])
f[i][j]=max(f[i][j],f[k][l]+G[l][j]+s[i^k]);
printf("%d\n",sum-f[(1<<n)-1][n-1]);
return 0;
} | %:pragma GCC optimize "-O3"
%:pragma GCC optimize("Ofast")
%:pragma GCC optimize("inline")
%:pragma GCC optimize("fast-math")
%:pragma GCC optimize("unroll-loops")
%:pragma GCC optimize("inline-functions")
%:pragma GCC optimize("no-stack-protector")
%:pragma GCC optimize("inline-small-functions")
%:pragma GCC optimize("inline-functions-called-once")
%:pragma GCC target("sse3","sse2","sse")
#include<bits/stdc++.h>
#define ll long long
#define heap priority_queue
using namespace std;
const ll maxn=15+1;
const ll inf=9e17;
ll ans,sum,dp[maxn][1<<maxn],dis[1<<maxn],g[maxn][maxn],tmp,lim,n,m;
inline ll lowbit(ll x){
return x&-x;
}
int main()
{
cin>>n>>m;
ll u,v,w;
for(int i=1;i<=m;i++)
{
cin>>u>>v>>w;
--u;
--v;
g[u][v]=g[v][u]=w;
sum+=w;
}
lim=(1<<n)-1;
for(int i=1;i<=lim;i++)
{
tmp=log2(lowbit(i));
dis[i]=dis[i^(1<<tmp)];
for(int j=0;j<n;j++)
if(g[tmp][j]&&(i&(1<<j)))
dis[i]+=g[tmp][j];
}
memset(dp,0xc0,sizeof(dp));
dp[0][1]=0;
ans=-inf;
for(int i=1;i<=lim;i++)
{
if(!(i&1))
continue;
for(int j=0;j<n;j++)
if(i&(1<<j))
{
for(int k=i;k;k=(k-1)&i)
if(k&(1<<j))
dp[j][i]=max(dp[j][i],dp[j][i^k^(1<<j)]+dis[k]);
for(int k=lim^i;k;k-=lowbit(k))
{
tmp=log2(lowbit(k));
if(g[tmp][j])
dp[tmp][i^(1<<tmp)]=max(dp[tmp][i^(1<<tmp)],dp[j][i]+g[tmp][j]);
}
}
if(i&(1<<(n-1)))
ans=max(ans,dp[n-1][i]);
}
cout<<sum-ans<<"\n";
return 0;
} | 1 |
#include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll fceil(ll a, ll b) { return (a % b == 0 ? a / b : a / b + 1); }
int main()
{
int n, k;
cin >> n >> k;
cout << (n % k ? 1 : 0) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, long long K) {
if (N % K == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
solve(N, K);
return 0;
}
| 1 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
const long long INF = 1LL << 60; // 1.15x10^18
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using edge = pair<int, long long>;
using Graph = vector<vector<edge>>;
vector<long long> dijkstra(const Graph &g, int s) {
vector<long long> dist(g.size(), INF);
using Pi = pair<long long, int>;
priority_queue<Pi, vector<Pi>, greater<Pi>> que;
dist[s] = 0; que.emplace(dist[s], s);
while (!que.empty()) {
long long cost; int u; tie(cost, u) = que.top(); que.pop();
if (dist[u] < cost) continue;
for (auto &e: g[u]) {
int v; long long nc; tie(v, nc) = e;
if (chmin(dist[v], dist[u] + nc)) que.emplace(dist[v], v);
}
}
return dist;
}
int main() {
int n, k;
while (cin >> n >> k, n) {
Graph g(n);
while (k--) {
int com; cin >> com;
if (com == 0) {
int a, b; cin >> a >> b; a--, b--;
auto res = dijkstra(g, a)[b];
cout << (res == INF ? -1 : res) << endl;
} else if (com == 1) {
int c, d, e; cin >> c >> d >> e; c--, d--;
g[c].emplace_back(d, e);
g[d].emplace_back(c, e);
}
}
}
return 0;
}
| #include<stdio.h>
#define INF 1000000
void warshall_floyd();
int min(int,int);
int graph[101][101],n,c,d;
int main(){
int k,i,j,x,e,a,b;
while(scanf("%d %d",&n,&k),n,k){
for(i=0;i<=n;i++)
for(j=0;j<=n;j++)
graph[i][j]=i==j?0:INF;
for(i=0;i<k;i++){
if(scanf("%d",&x),x){
scanf("%d %d %d",&c,&d,&e);
if(graph[c][d]>e){
graph[c][d]=graph[d][c]=e;
warshall_floyd();
}
}else{
scanf("%d %d",&a,&b);
printf(graph[a][b]>=INF?"-1\n":"%d\n",graph[a][b]);
}
}
}
return 0;
}
void warshall_floyd(){
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
graph[i][j]=graph[j][i]=min(graph[i][j],graph[i][c]+graph[c][d]+graph[d][j]);
}
int min(int x,int y){
return x<y?x:y;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
vector<int> a(n);
for(auto& i:a) cin>>i;
unordered_map<int,int> m;
for(auto& i:a){ ++m[i]; if(m[i]>1){ cout<<"NO"; return 0;}}
cout<<"YES";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
set<ll> S;
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
if(S.count(A)) {
cout<<"NO"<<endl;
return 0;
}
S.insert(A);
}
cout<<"YES"<<endl;
}
| 1 |
#include <iostream>
using namespace std;
int main()
{
int date[13][32];
for(int i = 1;i<=31;i++)date[1][i] = i;
for(int i = 1;i<=28;i++)date[2][i] = i+3;
for(int i = 1;i<=31;i++)date[3][i] = i+4;
for(int i = 1;i<=31;i++)date[4][i] = i;
for(int i = 1;i<=31;i++)date[5][i] = i+2;
for(int i = 1;i<=31;i++)date[6][i] = i+5;
for(int i = 1;i<=31;i++)date[7][i] = i;
for(int i = 1;i<=31;i++)date[8][i] = i+3;
for(int i = 1;i<=31;i++)date[9][i] = i+6;
for(int i = 1;i<=31;i++)date[10][i] = i+1;
for(int i = 1;i<=31;i++)date[11][i] = i+4;
for(int i = 1;i<=31;i++)date[12][i] = i+6;
int month,day;
while(true)
{
cin >> month;
cin >> day;
if(month==0&&day==0)break;
switch (date[month][day] % 7)
{
case 0:
cout << "Wednesday" << endl;
break;
case 1:
cout << "Thursday" << endl;
break;
case 2:
cout << "Friday" << endl;
break;
case 3:
cout << "Saturday" << endl;
break;
case 4:
cout << "Sunday" << endl;
break;
case 5:
cout << "Monday" << endl;
break;
case 6:
cout << "Tuesday" << endl;
break;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main( void )
{
int days[13] = { 0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
string d[7] = { "Thursday", "Friday", "Saturday", "Sunday", "Monday", "Tuesday", "Wednesday" };
while (1)
{
int month;
int day;
cin >> month >> day;
if ( month == 0 && day == 0 )
break;
for ( int i = 1; i < month; i++ )
{
day += days[i];
}
day--;
int index = day % 7;
cout << d[index] << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
long long int P = 998244353;
int A[310] = {};
int S = 0;
for(int i = 1; i <= N; i++){
cin >> A[i];
S += A[i];
}
long long int dp[310][90010] = {}; // はじめi枚まででRがjになるようなRGBの組の個数
dp[0][0] = 1;
for(int i = 1; i <= N; i++){
for(int j = 0; j <= 300 * i; j++){
if(j >= A[i]) dp[i][j] = (dp[i-1][j-A[i]] + dp[i-1][j] * 2) % P;
else dp[i][j] = (dp[i-1][j] * 2) % P;
}
}
long long int exceed = 0;
for(int i = (S + 1)/2; i <= S; i++){
exceed += dp[N][i];
}
exceed = exceed % P;
dp[0][0] = 1; // はじめi枚まででRがjになるようなRの組の個を同じ配列で再計算
for(int i = 1; i <= N; i++){
for(int j = 0; j <= 300 * i; j++){
if(j >= A[i]) dp[i][j] = (dp[i-1][j-A[i]] + dp[i-1][j]) % P;
else dp[i][j] = dp[i-1][j];
}
}
long long int pow3[314] = {};
pow3[0] = 1;
for(int i = 1; i <= 310; i++){
pow3[i] = (pow3[i-1] * 3) % P;
}
if(S % 2 == 1) cout << (3 * P + pow3[N] - exceed * 3) % P << endl;
else cout << (3 * P + pow3[N] + dp[N][S / 2] * 3- exceed * 3) % P << endl;
} | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (300L)
#define MAX_A (300L)
#define NUM_MOD (998244353L)
long dp0ss[MAX_N + 1][2 * MAX_N * MAX_A + 1],
dp1ss[MAX_N + 1][2 * MAX_N * MAX_A + 1];
long mod(long n, long k) { return n % k >= 0 ? n % k : n % k + k; }
int main(int argc, char *argv[]) {
// read inputs
long N, as[MAX_N];
scanf("%ld", &N);
for (long i = 0; i < N; i++) {
scanf("%ld", &as[i]);
}
// solve dp
// init
dp0ss[0][0 + MAX_N * MAX_A] = 1;
dp1ss[0][0 + MAX_N * MAX_A] = 1;
// update
for (long i = 0; i < N; i++) {
const long a = as[i];
for (long d = -MAX_N * MAX_A; d <= MAX_N * MAX_A; d++) {
if (d - a >= -MAX_N * MAX_A) {
dp0ss[i + 1][d - a + MAX_N * MAX_A] =
mod(dp0ss[i + 1][d - a + MAX_N * MAX_A] +
2 * dp0ss[i][d + MAX_N * MAX_A],
NUM_MOD);
dp1ss[i + 1][d - a + MAX_N * MAX_A] = mod(
dp1ss[i + 1][d - a + MAX_N * MAX_A] + dp1ss[i][d + MAX_N * MAX_A],
NUM_MOD);
}
if (d + a <= MAX_N * MAX_A) {
dp0ss[i + 1][d + a + MAX_N * MAX_A] = mod(
dp0ss[i + 1][d + a + MAX_N * MAX_A] + dp0ss[i][d + MAX_N * MAX_A],
NUM_MOD);
dp1ss[i + 1][d + a + MAX_N * MAX_A] = mod(
dp1ss[i + 1][d + a + MAX_N * MAX_A] + dp1ss[i][d + MAX_N * MAX_A],
NUM_MOD);
}
}
}
// for (long i = 0; i < N; i++) {
// long s = 0;
// for (long d = -MAX_N * MAX_A; d <= MAX_N * MAX_A; d++) {
// s += dp0ss[i + 1][d + MAX_N * MAX_A];
// }
// printf("i = %ld, s = %ld\n", i, s);
// }
// subtract from 3^N to get answer
long ans = 1;
for (long i = 0; i < N; i++) {
ans = mod(ans * 3, NUM_MOD);
}
for (long d = 0; d <= MAX_N * MAX_A; d++) {
ans = mod(ans - 3 * dp0ss[N][d + MAX_N * MAX_A], NUM_MOD);
}
ans = mod(ans + 3 * dp1ss[N][0 + MAX_N * MAX_A], NUM_MOD);
printf("%ld\n", ans);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
template<class T> using V = vector<T>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
const int inf = (1<<30)-1;
const ll infll = (1LL<<62)-1;
ll ceil(const ll &a, const ll &b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){
int n;
cin >> n;
V<int> a(n);
rep(i,n) cin >> a[i];
V<ll> sums(n+1);
sums[1] = a[0];
for(int i = 2; i <= n; i++) {
sums[i] = a[i-1] + sums[i-1];
}
ll ans = infll;
for(int i = 2; i <= n-2; i++) {
auto func = [&](int L, int R) {
int l = L; int r = R;
while(abs(r-l) > 1) {
int mid = (r+l)/2;
ll p = sums[mid]-sums[L];
ll q = sums[R]-sums[mid];
if(p < q) l = mid;
else r = mid;
}
Pl res;
if(abs((sums[l]-sums[L])-(sums[R]-sums[l])) > abs((sums[r]-sums[L])-(sums[R]-sums[r])))
res = make_pair(sums[r]-sums[L], sums[R]-sums[r]);
else
res = make_pair(sums[l]-sums[L], sums[R]-sums[l]);
return res;
};
Pl a = func(0,i);
Pl b = func(i,n);
ll tmp = max({a.fi, a.se, b.fi, b.se}) - min({a.fi, a.se, b.fi, b.se});
chmin(ans, tmp);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
ll mod = 1e9 + 7;
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n;
ll ans=1LL;
cin >>n;
Vi a(n);
cin >> a;
map<int, ll> dis;
dis[-1] = 3LL;
rep(i, n) {
ans *= dis[a[i] - 1LL];
ans %= mod;
dis[a[i]]++;
dis[a[i] - 1]--;
}
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[101][101], b[101][101];
bitset<20001> f[101][101];
int main(int argc, char** argv)
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> a[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> b[i][j];
f[1][1].set(10000);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
int v1 = a[i][j] - b[i][j];
int v2 = b[i][j] - a[i][j];
if (v1 >= 0)
{
f[i + 1][j] |= (f[i][j] << v1);
f[i][j + 1] |= (f[i][j] << v1);
}
else
{
v1 = -v1;
f[i + 1][j] |= (f[i][j] >> v1);
f[i][j + 1] |= (f[i][j] >> v1);
}
if (v2 >= 0)
{
f[i + 1][j] |= (f[i][j] << v2);
f[i][j + 1] |= (f[i][j] << v2);
}
else
{
v2 = -v2;
f[i + 1][j] |= (f[i][j] >> v2);
f[i][j + 1] |= (f[i][j] >> v2);
}
}
int ans = 1e9;
for (int i = 0; i <= 20000; i++)
if (f[n][m].test(i))
{
int v1 = i + a[n][m] - b[n][m];
int v2 = i + b[n][m] - a[n][m];
ans = min(ans, min(abs(v1 - 10000), abs(v2 - 10000)));
}
cout << ans;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define INF 1000000000000000LL
using namespace std;
#define MAXN 88
#define MAXS 13000
int dp[MAXN][MAXN][MAXS];
int main(){
int h,w;cin>>h>>w;
vector<vector<int>> scores(h);
rep(i, h)rep(j, w){
int a;cin>>a;
scores[i].push_back(a);
}
rep(i, h)rep(j, w){
int a;cin>>a;
scores[i][j] -= a;
if(scores[i][j] < 0)scores[i][j] *= -1;
}
dp[0][0][scores[0][0]] = 1;
rep(i, h)rep(j, w)rep(k, MAXS){
int s = scores[i][j];
int mpre = k-s;
if(mpre<0)mpre *= -1;
if(i && dp[i-1][j][mpre]==1)dp[i][j][k]=1;
if(j && dp[i][j-1][mpre]==1)dp[i][j][k]=1;
int ppre = k+s;
if(ppre<=7000){
if(i && dp[i-1][j][ppre]==1)dp[i][j][k]=1;
if(j && dp[i][j-1][ppre]==1)dp[i][j][k]=1;
}
}
int result = 0;
rrep(i, MAXS)if(dp[h-1][w-1][i])result = i;
cout<<result<<endl;
return 0;
rep(i, h){
rep(j, w)cout<<scores[i][j]<<' ';cout<<endl;
}
cout<<"###"<<endl;
rep(k, 15){
cout<<k<<endl;
rep(i, h){
rep(j, w)cout<<dp[i][j][k]<<' ';cout<<endl;
}
cout<<"---"<<endl;
}
return 0;
}
| 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (int64_t)(n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
#define chmax(a, b) (a) = max(a, b)
#define chmin(a, b) (a) = min(a, b)
int main() {
int N;
cin >> N;
using D = tuple<int, int, int>;
vector<D> data;
rep(i, N) {
int x, y;
char d;
cin >> x >> y >> d;
int dir = 0;
if (d == 'D' || d == 'U') {
dir |= 2;
}
if (d == 'D' || d == 'L') {
dir |= 1;
}
data.push_back(D(x, y, dir));
}
constexpr int INF = numeric_limits<int>::max();
int result = INF;
constexpr int MAX = 200'000;
vector<vector<vector<int>>> tbl(4, vector<vector<int>>(MAX + 1));
vector<vector<vector<int>>> cross(4, vector<vector<int>>(2 * MAX + 1)),
cross2(4, vector<vector<int>>(2 * MAX + 1));
rep(i, N) {
int x, y, d;
tie(x, y, d) = data[i];
tbl[d][((d & 2) ? x : y)].push_back((d & 2) ? y : x);
cross[d][x + y].push_back(x - y + MAX);
cross2[d][x - y + MAX].push_back(x + y);
}
rep(i, 4) irep(j, MAX) { sort(tbl[i][j].begin(), tbl[i][j].end()); }
rep(i, 4) irep(j, 2 * MAX) {
sort(cross[i][j].begin(), cross[i][j].end());
sort(cross2[i][j].begin(), cross2[i][j].end());
}
rep(i, 2) {
irep(j, MAX) {
for (int v : tbl[i << 1][j]) {
const auto &tmp = tbl[(i << 1) ^ 1][j];
auto iter = lower_bound(tmp.begin(), tmp.end(), v);
if (iter != tmp.end()) {
// cerr << i << " " << j << " " << v << " " << *iter << "\n";
chmin(result, 5 * (*iter - v));
}
}
}
}
rep(i, 2) {
irep(j, 2 * MAX) {
for (int v : cross[i][j]) {
const auto &tmp = cross[i ^ 2][j];
auto iter = lower_bound(tmp.begin(), tmp.end(), v);
if (i == 0) {
if (iter != tmp.end()) {
cerr << i << " " << j << " " << v << " " << *iter << "\n";
chmin(result, 5 * (*iter - v));
}
} else {
if (iter != tmp.begin()) {
chmin(result, 5 * (v - *prev(iter)));
}
}
}
}
}
rep(i, 2) {
irep(j, 2 * MAX) {
for (int v : cross2[i][j]) {
const auto &tmp = cross2[i ^ 3][j];
auto iter = lower_bound(tmp.begin(), tmp.end(), v);
if (i == 0) {
if (iter != tmp.end()) {
chmin(result, 5 * (*iter - v));
}
} else {
if (iter != tmp.begin()) {
chmin(result, 5 * (v - *prev(iter)));
}
}
}
}
}
if (result == INF) {
cout << "SAFE" << endl;
} else {
cout << result << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define tmp(x) std::cout<<"& "<<(x)<<" &\n"
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
using namespace std;
const int maxn=3e5+100;
const int inf=(int)1e9+7;
int n;
vector<pair<int,char> > x[maxn],y[maxn],le[2*maxn],ri[2*maxn];
int ans=inf;
void work(vi v1,vi v2,int aa){
if(!v2.empty()&&!v1.empty()){
vector<int>::iterator it1,it2;
sort(v2.begin(),v2.end());
sort(v1.begin(),v1.end());
it2=v2.begin(),it1=v1.begin();
for(auto p1:v1){
for(auto p2:v2){
if(p2<p1)continue;
else {
ans=min(ans,abs(p1-p2)*10/aa);
break;
}
}
}
/*while(*it1!=*v1.end()&&*it2!=*v2.end()){
while(*it2!=*v2.end()&&*it2<*it1)++it2;
if(*it2==*v2.end())break;
ans=min(ans,abs(*it1-*it2)*10/aa);
++it1;
}*/
}
}
int main(){
// freopen("in.txt","r",stdin);
scanf("%d",&n);
int xx,yy;char c;
rep(i,1,n){
scanf("%d%d %c",&xx,&yy,&c);
x[xx].push_back(make_pair(yy,c));
y[yy].push_back(make_pair(xx,c));
le[xx-yy+200000].push_back(make_pair(xx,c));
ri[xx+yy].push_back(make_pair(xx,c));
}
rep(i,0,200000){
if(!x[i].empty()){
vector<int>up,down;
for(auto p:x[i]){
if(p.second=='U')up.push_back(p.first);
if(p.second=='D')down.push_back(p.first);
}
work(up,down,2);
}
if(!y[i].empty()){
vector<int>right,left;
for(auto p:y[i]){
if(p.second=='R')right.push_back(p.first);
if(p.second=='L')left.push_back(p.first);
}
work(right,left,2);
}
}
rep(i,0,400000){
if(!le[i].empty()){
vector<int> right,down,left,up;
for(auto p:le[i]){
if(p.second=='D')down.push_back(p.first);
else if(p.second=='R')right.push_back(p.first);
else if(p.second=='U')up.push_back(p.first);
else if(p.second=='L')left.push_back(p.first);
}
work(right,down,1);
work(up,left,1);
}
if(!ri[i].empty()) {
vector<int> right, up,left, down;
for (auto p:ri[i]) {
if (p.second == 'U')up.push_back(p.first);
else if (p.second == 'R')right.push_back(p.first);
else if (p.second == 'D')down.push_back(p.first);
else if (p.second == 'L')left.push_back(p.first);
}
work(right, up,1);
work(down, left,1);
}
}
if(ans==inf)printf("SAFE");
else printf("%d",ans);
return 0;
} | 1 |
// Author :
// Date :
// Problem:
// Solution:
// Comment:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
using namespace std;
void play(int n,int mm){
int ans[105] = {0};
int cur = -1;
int day = 0;
int q;
for(int i = 0 ; i < n ; i ++){
int m;
cin >> m;
for(int i = 0 ; i < m ; i++){
cin >> q;
ans[q]++;
}
}
for(int i = 0 ; i < 103 ; i++){
if(ans[i] > cur && ans[i] >=mm){
cur = ans[i];
day = i;
}
}
cout << day << endl;
}
main(){
int nn,mm;
while(cin >> nn >> mm){
if(nn == 0) break;
play(nn,mm);
}
#ifdef GEREL
for(;;);
#endif
return 0;
} |
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1144&lang=jp
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
using namespace std;
int W,H;
const int NONE=0, BLOCK=1, START=2, GOAL=3;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
int ans;
vector<vector<int>> field;
bool out_range(int x, int y){
return x < 0 || y < 0 || x >= W || y >= H;
}
void dfs(int x, int y, int depth)
{
if(depth + 1 >= ans){ return; }
REP( d, 0, 4 )
{
int nx = x + dx[d];
int ny = y + dy[d];
//次に移動する場所がBLOCKではなく、範囲内である。
if(!out_range(nx,ny) && field[ny][nx] != BLOCK)
{
//エリア外に出るまで移動する
while(!out_range(nx,ny))
{
//GOALならば、答えを更新する
if(field[ny][nx] == GOAL)
{
ans = min(ans,depth+1);
return;
}
//BLOCKならば、次の移動を行う
if(field[ny][nx] == BLOCK)
{
field[ny][nx] = NONE;
dfs(nx-dx[d], ny-dy[d], depth+1);
field[ny][nx] = BLOCK;
break;
}
nx = nx + dx[d];
ny = ny + dy[d];
}
}
}
return;
}
int main()
{
while(cin >> W >> H && W)
{
int sx,sy;
field.assign(H,vector<int>(W));
rep(y,H){
rep(x,W){
cin >> field[y][x];
if(field[y][x] == START){
sx = x;
sy = y;
field[y][x] = NONE;
}
}
}
ans = 11;
dfs(sx,sy,0);
cout << ((ans <= 10) ? ans : -1) << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
#define mod (long)(1e9 + 7)
using namespace std;
long dp[10000][2][100];
long solve(int curr, int tight, int sum, string &s, int d) {
if(curr == s.size()) {
return (sum == 0);
}
if(dp[curr][tight][sum] != -1) return dp[curr][tight][sum];
if(tight) {
long res = 0;
for(int i = 0; i <= (s[curr] - '0'); ++i) {
res = (res + solve(curr + 1, tight & (i == (s[curr]-'0')), (sum + i) % d, s, d)) % mod;
}
return dp[curr][tight][sum] = res;
}
long res = 0;
for(int i = 0; i < 10; ++i) {
res = (res + solve(curr + 1, tight, (sum + i) % d, s, d)) % mod;
}
return dp[curr][tight][sum] = res;
}
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
string k;
int d;
cin >> k >> d;
memset(dp, -1, sizeof dp);
cout << (solve(0, 1, 0, k, d) - 1 + mod) % mod;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong h, w;
llong a[100][100];
llong b[100][100];
llong v[100][100];
llong u[100][100];
bool dp[100][100][26000];
llong offset = 13000;
int main() {
cin >> h >> w;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> b[i][j];
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
v[i][j] = a[i][j] - b[i][j];
u[i][j] = b[i][j] - a[i][j];
}
}
dp[0][0][offset] = true;
dp[0][1][offset] = true;
dp[1][0][offset] = true;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
for (int k = 0; k < 26000; k++) {
if (dp[i - 1][j][k] == true) {
dp[i][j][k + v[i][j]] = true;
dp[i][j][k + u[i][j]] = true;
}
if (dp[i][j - 1][k] == true) {
dp[i][j][k + v[i][j]] = true;
dp[i][j][k + u[i][j]] = true;
}
}
}
}
llong ans = 1ll << 60ll;
for (int k = 0; k < 26000; k++) {
if (dp[h][w][k] == true) {
ans = min(ans, llabs(k - offset));
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
using namespace __gnu_pbds;
using ordered_set =
tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>;
//find_by_order(k):returns iterator to kth element starting from 0
//order_of_key(k):returns count of elements strictly smaller than k
typedef long long ll;typedef pair<int, int> pii;
typedef vector<int> vi;typedef long double ld;
template<class T>
using min_heap = priority_queue<T,vector<T>,greater<T>>;
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
template<class T> void re(T& x) { cin >> x; }
template<typename T>
void remdup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)), v.end());
}
template<typename T> void re(vector<T> &v) {trav(i,v) cin >> i;}
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
#ifdef np
#include "/home/wjex/cp/pr.h"
#else
#define trace(...)
#endif
#define MOD 1000000007
void solve(){
int k ;
string s ;
re(k,s);
if(k>=s.length()){
cout << s << endl;
}
else if (s.length()>k){
rep(i,0,k) cout << s[i];
cout << "...";
}
}
signed main() {
unsyncIO();
int tt =1 ;
//cin >> tt;
rep(i,0,tt) solve();
#ifdef np
cout <<endl<<endl<< "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long get_rev(long long x) {
long long nx = 0;
while (x) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
long long get_rev(long long x, int len) {
long long nx = 0;
while (len--) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
int cnt;
long long solve(long long d, long long len) {
long long tmp = len >> 1, pw = 1;
while (tmp--) pw *= 10;
long long ans = 0;
for (int i = 0; i < pw; i++) {
long long tmp = (d + i) % pw;
tmp = get_rev(tmp, len >> 1);
if (len & 1) tmp = tmp * 10;
long long n = tmp * pw + i;
if ((cnt ? get_rev(n, len) : get_rev(n)) == n + d) ans++;
}
if (len & 1) ans *= 10;
return ans;
}
int main () {
int d; cin >> d;
cnt = 0;
while (d % 10 == 0) d /= 10, cnt++;
int len = 0, D = d;
while (D) len++, D /= 10;
long long ans = solve(d, len) + solve(d, len + 1) + solve(d, len + 2) + solve(d, len + 3) + solve(d, len + 4) + solve(d, len + 5) + solve(d, len + 6);
if (cnt) cnt--, ans *= 9;
while (cnt--) ans *= 10;
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int x;
x = 1;
for(int i = 0; i < N; i++){
if(2 * x > x + K)
x = x + K;
if(2 * x <= x + K)
x = 2 * x;
}
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll N, K;
cin >> N >> K;
ll value = 1;
for (ll i = 0; i < N; ++i) {
if (value < K) {
value *= 2;
} else {
value += K * (N - i);
break;
}
}
cout << value << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int64_t f(int64_t x,int64_t y){
if(y==0)
return 1;
else if(y%2==0)
return (f(x,y/2)*f(x,y/2))%mod;
else
return (f(x,y/2)*((x*f(x,y/2))%mod))%mod;
}
int64_t comb(int64_t x,int64_t y){
int64_t ans=1;
for(int64_t i=y;1<=i;i--){
ans=(f(i,mod-2)*((ans*(x-y+i))%mod))%mod;
}return ans;
}
int main(){
int64_t N,M;
cin>>N>>M;
int64_t m=M;
vector<int64_t>A={};
for(int64_t i=2;i*i<=m;i++){
if(M%i==0){
int64_t a=0;
while(M%i==0){
M/=i; a++;
}A.push_back(a);
}
}if(M!=1)
A.push_back(1);
int L=A.size();
int64_t ans=1;
for(int i=0;i<L;i++){
int64_t a=A.at(i);
ans=(ans*comb(N-1+a,a))%mod;
}cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int maxn=(1e5)+10;
const int mod=(1e9)+7;
const int M=(1e7)+9;
int n,m,tot,d[maxn],iv[maxn],ivjc[maxn],jc[maxn];
int dp[40][maxn],ans;
vector<int> g[maxn];
struct Haxi {
int to[maxn],tot,head[M],nxt[maxn],w[maxn];
void insert(int x,int y) {
tot++; nxt[tot]=head[x%M];
head[x%M]=tot; to[tot]=x; w[tot]=y;
}
int find(int x) {
for (int i=head[x%M];i;i=nxt[i])
if (to[i]==x) return w[i];
return 0;
}
} Map;
int C(int x,int y) {
if (x<y||y<0) return 0;
return (ll)jc[x]*ivjc[y]%mod*ivjc[x-y]%mod;
}
void update(int &x,int y) {
x+=y; if (x>=mod) x-=mod;
}
int main() {
read(n); read(m);
iv[0]=jc[0]=ivjc[0]=iv[1]=jc[1]=ivjc[1]=1;
for (int i=2;i<maxn;i++) {
jc[i]=(ll)jc[i-1]*i%mod;
iv[i]=(ll)(mod-mod/i)*iv[mod%i]%mod;
ivjc[i]=(ll)ivjc[i-1]*iv[i]%mod;
}
for (int i=1;(ll)i*i<=m;i++)
if (m%i==0) {
d[++tot]=i;
if (m/i!=i) d[++tot]=m/i;
}
sort(d+1,d+tot+1);
int x;
for (int i=1;i<=tot;i++) {
Map.insert(d[i],i);
x=d[i];
for (int j=1;(ll)j*j<=d[i];j++)
if (x%j==0) {
g[Map.find(j)].push_back(i);
if (x/j!=j) g[Map.find(x/j)].push_back(i);
}
}
int mx=min(n,35);
dp[0][1]=1;
for (int i=0;i<mx;i++)
for (int j=1;j<=tot;j++) if (dp[i][j]) {
for (int k=0;k<g[j].size();k++) if (g[j][k]!=j) {
update(dp[i+1][g[j][k]],dp[i][j]);
}
}
for (int i=0;i<=mx;i++) {
update(ans,(ll)dp[i][tot]*C(n,i)%mod);
}
printf("%d\n",ans);
return 0;
}
/*
0. Enough array size? Enough array size? Enough array size? Interger overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
*/ | 1 |
#include <bits/stdc++.h>
using namespace std;
// [l, r)
int cnt_w(vector<int> &csum, int l, int r) { return csum[r] - csum[l]; }
int cnt_e(vector<int> &csum, int l, int r) {
return (r - l) - (csum[r] - csum[l]);
}
int main(int argc, const char *argv[]) {
int n;
string s;
cin >> n >> s;
vector<int> csum(n + 1, 0);
for (int i = 1; i <= n; ++i) {
csum[i] = csum[i - 1];
if (s[i - 1] == 'W') {
csum[i]++;
}
}
int ans;
for (int i = 0; i < n; ++i) {
int cnt = cnt_w(csum, 0, i) + cnt_e(csum, i + 1, n);
if (i == 0 || ans > cnt) {
ans = cnt;
}
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,mn=1000000;
string s;
cin>>n>>s;
vector<int> v(n+2);
vector<int> u(n+2);
v[0]=0;u[0]=0;
for(int i=0;i<n;i++){
if(s[i]=='W'){v[i+1]=v[i]+1;}
else v[i+1]=v[i];
}
reverse(s.begin(),s.end());
for(int j=0;j<n;j++){
if(s[j]=='E'){u[j+1]=u[j]+1;}
else u[j+1]=u[j];
}
reverse(u.begin(),u.end());
u.push_back(0);
for(int k=0;k<=n;k++){
mn=min(v[k]+u[k+1],mn);
}
cout<<mn;
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int tmp;
int dp[100];
cin>> tmp;
do{
fill(dp,dp+100,0);
dp[0] = 1;
for (int i = 0; i<tmp;i++)
{
for(int j = 1;j < 4;j++)
dp[i+j] += dp[i];
}
cout << dp[tmp]/3650 + 1<<endl;
cin >> tmp;
}while(tmp);
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int a[3],k;
cin>>a[0]>>a[1]>>a[2]>>k;
sort(a,a+3);
for (int i = 0; i < k; ++i)
{
a[2]*=2;
}
cout<<a[0]+a[1]+a[2];
return 0;
}
| 0 |
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 998244353;
int main() {
// freopen("input.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll ans = 1;
vector<int> d(n);
for (int& i : d) {
cin >> i;
}
sort(d.begin() + 1, d.end());
vector<int> cnt(n + 1);
for (int i = 1; i < n; i++) {
cnt[d[i - 1]]++;
if (d[i] == 0) {
ans = 0;
break;
}
ans = ans * cnt[d[i] - 1] % mod;
}
cout << ans << endl;
return 0;
}
| #include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <tuple>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
using namespace std;
using ll=long long;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<string,int> si;
typedef pair<int,ii> iii;
typedef vector <si> vsi;
typedef vector <ii> vii;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <vll> vl2d;
typedef vector <vi> vi2d;
typedef vector <char> vc;
typedef vector <bool> vb;
typedef vector <string> vs;
typedef map <string,vs> msvs;
typedef map <string,int> msi;
typedef map <char,int> mci;
typedef map <int,int> mii;
typedef map <long,long> ml;
typedef map <string,string> mss;
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
#define foreach(x,arr) for(auto& x:arr)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define endl '\n' // Normal `cout << endl` flushes the output every time wich hit performance badly
#define INF 1000000000LL
#define MOD 1000000007ll
#define deb(x) cout<<#x<<": "<<x<<endl;
#define printArray(arr) for(auto x: arr) { cout<<x<<"\t"; }
#define printMatrix(mat) for(auto x: mat) { cout<<" "; printArray(x); cout<<endl; }
#define printMap(mmap) for(auto p: mmap) { cout<< p.first<<": "<<p.second<<endl; }
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define forch(ch,str) for(char& c : str)
#define FILL(a,b) memset(a,b,sizeof(a))
//Swift related stuff
#define append push_back
#define nil nullptr
#define guard(_condition) if (bool(_condition)){}
#define count size()
#define let const auto
#define var auto
#define startsWith(str) rfind(str, 0)
#define prq priority_queue
#define tostr(argument) to_string(argument)
#define alphabet "abcdefghijklmnopqrstuvwxyz"
ll modulo(ll a, ll b, ll n){
long long x=1, y=a;
while (b > 0) {
if (b%2 == 1) {
x = (x*y) % n; // multiplying with base
}
y = (y*y) % n; // squaring the base
b /= 2;
}
return x % n;
}
int main() {
ll n;
cin>>n;
vll arr(n);
bool wrong = false;
map<ll, ll> dic;
ll mx = 0;
rep(i,0,n) {
ll num;
cin>>num;
if(i==0 && num != 0) {
wrong = true;
}
if(i != 0 && num == 0) {
wrong = true;
}
dic[num] += 1;
mx = MAX(mx, num);
}
ll res = 1;
rep(i,1,mx+1) {
guard(dic[i-1] != 0 && dic[i] != 0) else {
wrong = true;
break;
}
ll p = modulo(dic[i-1], dic[i],998244353);
res = (res * p)%998244353;
}
if(wrong) {
cout<<0<<endl;
return 0;
}
cout<<res<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string a, b, c;
cin >> a >> b >> c;
if (a.at(a.length() - 1) == b.at(0) && b.at(b.length() - 1) == c.at(0))cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl vector<pll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pr_d(x) cout << fixed << setprecision(15) << x << endl
#define ud(c, x) distance(c.begin(), upper_bound(all(c), x))
#define ld(c, x) distance(c.begin(), lower_bound(all(c), x))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep3(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep4(i, a, b) for (int i = (a); i > (b); --i)
#define pb push_back
#define out(x) cout << x << "\n"
bool odd(int i) { return i % 2; }
#define all(v) v.begin(), v.end()
#define size(x) int(x.size())
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
void Yes_No(bool f) {
if (f)
printf("YES\n");
else
printf("NO\n");
}
void deb_p(pii p) { printf("pair = %d %d\n", p.fi, p.se); }
void deb_i(int i) { printf("i = %d\n", i); }
void deb_v(vector<int> v) {
printf("v = ");
for (auto i : v) printf("%d ", i);
printf("\n");
}
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//-------------------ここから回答する-----------------------
void solve(void) {
string a, b, c;
cin >> a >> b >> c;
Yes_No(a[size(a)-1]==b[0]&&b[size(b)-1]==c[0]);
}
int main(void) { solve(); } | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
class Dice_c{
private:
int me[4];
int topbot[2]; // top,bottom
public:
void Input();
void Roll(char c);
void Output();
};
int main(){
Dice_c dice;
char com;
dice.Input();
while(1){
scanf("%c",&com);
if(com=='\n')
break;
dice.Roll(com);
}
dice.Output();
return 0;
}
///////////////////////////////////////
void Dice_c::Input(){
cin >> me[1] >> topbot[1] >> me[2] >> me[0] >> topbot[0] >> me[3];
getchar();
}
void Dice_c::Roll(char c){
int tmp;
if(c == 'W'){
tmp = me[0];
me[0]=me[1] , me[1]=me[2] , me[2]=me[3] , me[3]=tmp;
}
else if(c == 'E'){
tmp = me[3];
me[3]=me[2] , me[2]=me[1] , me[1]=me[0] , me[0]=tmp;
}
else if(c == 'N'){
tmp = topbot[1];
topbot[1]=me[3] , me[3]=topbot[0] , topbot[0]=me[1] , me[1]=tmp;
}
else{
tmp = topbot[0];
topbot[0]=me[3] , me[3]=topbot[1] , topbot[1]=me[1] , me[1]=tmp;
}
/*
cout << " " << topbot[0] << endl;
for(int i=0; i<4; i++)
cout << me[i] << ' ';
cout << endl << " " << topbot[1] << endl;
*/
}
void Dice_c::Output(){
cout << me[1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
vector<bool> app(26);
rep(i, s.size()) app[s[i] - 'a'] = true;
rep(i, 26) if(!app[i]) {
cout << string(1, i + 'a') << "\n";
return 0;
}
cout << "None" << "\n";
return 0;
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <complex>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
const double PI = 3.141592653589793238462643383279502884L;
const int LARGE_PRIME = 1000000007;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i,a,cont,next) \
for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i,a,b,s) repfn(i,a,i<b,i+s)
#define repab(i,a,b) repby(i,a,b,1)
#define rep(i,b) repab(i,0,b)
#define pb push_back
#define sz(c) int((c).size())
int main(int argc, char **argv)
{
for (;;) {
int n;
vi v;
cin >> n;
if (!n)
break;
while (n--) {
int tmp;
cin >> tmp;
v.pb(tmp);
}
vi w(v);
for (int i = 1; i < sz(v); i++) {
v[i] = max(v[i-1] + v[i], v[i]);
}
cout << *max_element(all(v)) << endl;
}
return 0;
} | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <deque>
#include <array>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define range(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
#define all(x) x.begin(), x.end()
#define PI 3.1415926536
using namespace std;
const int MAX_N = 5000;
array<int, MAX_N + 1> bit;
int sets, n;
int sum(int i){
int ret = 0;
while(i > 0){
ret += bit[i];
i -= i & -i;
}
return ret;
}
void add(int i, int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
void solve(){
cin >> n;
if(n == 0) exit(0);
bit.fill(0);
for (int i = 1; i <= n; ++i) {
int t; cin >> t;
add(i, t);
}
int ans = -1e9;
for (int i = 0; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
ans = max(ans, sum(j) - sum(i));
}
}
cout << ans << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
for(;;) solve();
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
int main() {
int n;
cin >> n;
int ans = n*n*n;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int r;
cin >> r;
if(r<1200){
cout << "ABC";
}else if(1200<=r&&r<2800){
cout << "ARC";
}else{
cout << "AGC";
}
} | 0 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
int cx = M + 1, cnts = 0;
for (int i = M; i >= 1; i--) {
if (N % 2 == 0 && (cx - i) * 2 >= N && cnts == 0) { cx++; cnts = 1; }
cout << i << " " << cx << endl;
cx++;
}
return 0;
} | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define REP(i,b,e) for(ll i=b; i<e; i++)
#define ALL(vec) vec.begin(),vec.end()
#define PRINT(vec) printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");
#define SCAN(vec) for(auto &i:vec)scanf("%ld",&i)
#define fi first
#define se second
const int MOD = 1e9+7;
const ll INF = 1e18;
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int main(){
int n, m;
scanf("%d %d", &n, &m);
if((n-2*m)%2){
REP(i, 0, m) printf("%ld %ld\n", i+1, n-i);
} else {
REP(i, 0, (m+1)/2){
printf("%ld %ld\n", i+1, n-i);
}
REP(i, (m+1)/2, m){
printf("%ld %ld\n", i+2, n-i);
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main() {
int N;
cin>>N;
int zero;
cin>>zero;
if(zero!=0){cout<<0<<endl;return 0;}
vector<int> D(N-1);
rep(i,N-1){cin>>D.at(i);}
sort(D.begin(),D.end());
int num=1,before=1,now=0;
ll ans=1;
rep(i,N-1){
if(D.at(i)==num){
now++;
ans*=before;
ans%=MOD2;
}
else{
num++;
before=now;
ans*=before;
ans%=MOD2;
now=0;
if(D.at(i)==num){
now++;
}
else{cout<<0<<endl;return 0;}
}
//cout<<ans<<" "<<endl;
}
cout<<ans<<endl;
return 0;
} | #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=998244353;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
ll pow_mod(ll n,ll k,ll m){
ll res=1;
for(;k>0;k>>=1){
if(k&1){
res=(res*n)%m;
}
n=(n*n)%m;
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin >> n;
vector<ll> d(n),c(n);
REP(i,n){
cin >> d[i];
c[d[i]]++;
}
if(d[0]!=0||c[0]!=1){
cout << 0 << endl;
return 0;
}
ll ans=1;
FOR(i,1,n){
if(!c[i]) continue;
(ans*=pow_mod(c[i-1],c[i],mod))%=mod;
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define sayyes cout<<"Yes"<<endl;
#define sayno cout<<"No"<<endl;
using namespace std;
typedef long long ll;
const double PI=acos(-1);
typedef pair<int,int>P;
const int mod =1e9+7;
int main()
{
int a,b;
cin>>a>>b;
cout<<max(max(a+b,a-b),a*b);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(){
ll A,B;
cin >> A >> B;
if(max(A+B,A*B) > A-B) cout << max(A+B,A*B) << endl;
else cout << A-B << endl;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.