code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
/*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define co(x) cout << x << '\n'
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bitcount(x) (int)__builtin_popcount(x)
#define sz(x) (int)x.size()
#define all(a) a.begin(),a.end()
#define ff first
#define ss second
#define inf 1000000007;
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
int I[100005],L[100005];
inline void solve(){
int n; cin>>n;
int a[n+1], lis = 0 ;
I[0] = -inf ;
for (int i=1;i<=n;i++){
cin >> a[i] ;
I[i] = inf ;
L[i] = 1 ;
}
reverse (a+1,a+n+1);
for (int i=1;i<=n;i++) {
int l = 0, r = lis ;
while (l <= r){
int mid = ( l + r ) >> 1 ;
if (I[mid] <= a[i]) l = mid + 1 ;
else r = mid - 1 ;
}
I[l] = a[i] ;
if (l > lis) lis = l ;
}
co (lis) ;
}
signed main()
{
int n=1; // cin>>n;
while (n--) solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
int n; cin >> n;
vector<int> b(n), dp(n+1, -1);
rep(i, n) cin >> b[i];
rep(i, n){
int p = lower_bound(dp.rbegin(), dp.rend(), b[i]) - dp.rbegin() - 1;
p = n - p;
// pr(p);
if(p==-1) dp[0] = b[i];
else dp[p] = b[i];
// prvec(dp);
}
rep(i, n+1){
if(dp[i]==-1) {pr(i); break;}
}
vector<int> a = {8,5,2};
// pr(3 - 1 - ((upper_bound(a.rbegin(), a.rend(), 1) - a.rbegin()) - 1));
return 0;} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) num = num * 10 + (ch & 15);
if(neg) num = -num;
}
int N, K;
int main(){
getint(N), getint(K);
return printf("%d\n", N - K + 1), 0;
}
| // A - Rated for Me
#include <bits/stdc++.h>
using namespace std;
int main(){
int r; cin>>r;
if(r < 1200) puts("ABC");
else if(2800 <= r) puts("AGC");
else puts("ARC");
}
| 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define show(a, n) rep(i,n) {cout<<a[i]<<' ';} cout<<endl
#define show2(a, n, m) rep(i, n) { rep(j, m) {cout << a[i][j] << ' ';} cout << endl;}
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;
typedef long double ld;
const int INF = 1 << 30;
const long long INFL = 1LL << 60;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100010;
int main() {
// cout << fixed << setprecision(15);
int n;
cin >> n;
cout << n / 3 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
const int INF=1001001001;
int main() {
int64_t N;
cin>>N;
int x=N;
string t;
while(x){
int r=x%(-2);
if(r<0){r+=2;}
x-=r;
x/=(-2);
t+=(char)('0'+r);
}
reverse(t.begin(),t.end());
if(t==""){t='0';}
cout<<t<<endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long int n , id , price , num, cnt;
while(cin >> n , n!=0){
vector<long long int> p(4001,0);
vector<int> a;
while(n--){
cin>>id>>price>>num;
if(find(a.begin(),a.end(),id)==a.end()) a.push_back(id);
p[id]+=price*num;
}
cnt=0;
for(int i=0;i<a.size();i++){
if(p[a[i]]>=1000000){
cout << a[i] << endl;
cnt++;
}
}
if (cnt==0) cout << "NA" << endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
using namespace std;
int main(void) {
int n;
while(cin >> n){
if( n == 0 ) break;
vector<int> a(n);
for(int i=0; i<n; i++) cin >> a[i];
vector<int> dp(n+5, 0);
for(int i=1; i<=n; i++){
dp[i] = max( a[i-1], dp[i-1] + a[i-1] );
}
int ans = dp[1];
for(int i=1; i<=n; i++){
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
bool flag = false;
if(i % 3 == 0) {
flag = true;
}
int j = i;
while(1) {
int r = j % 10;
j /= 10;
if(r == 3) {
flag = true;
break;
}
if(j == 0) break;
}
if(flag) cout << " " << i;
}
cout << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void readin(T &x) {
x = 0;
T fh = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') fh = -1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);
x *= fh;
}
inline void d_read(double &x) {
x = 0.0;
int fh = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') fh = -1;
for (; isdigit(ch); ch = getchar()) x = x * 10 + (ch ^ 48);
if (ch == '.') {
double num = 1.0;
ch = getchar();
for (; isdigit(ch); ch = getchar()) x = x + (num /= 10) * (ch ^ 48);
}
x *= fh;
}
template <typename T>
inline void wt(T x) {
if (x > 9) wt(x / 10);
putchar(x % 10 + 48);
}
template <typename T>
inline void writeln(T x, char c) {
if (x < 0) {
putchar('-');
x = -x;
}
wt(x);
putchar(c);
}
const int N = 2e5 + 5;
int a[N << 2], t[N << 2], tg[N << 2];
inline void up(int p) {
a[p] = min(a[p << 1], a[p << 1 | 1]);
t[p] = min(t[p << 1], t[p << 1 | 1]);
}
inline void work(int p, int l, int r, int k) {
a[p] = k;
t[p] = k + l;
tg[p] = k;
}
inline void build(int p, int l, int r) {
tg[p] = -1e9;
if (l == r) {
a[p] = -l;
t[p] = a[p] + l;
}
else {
int mid = l + r >> 1;
build(p << 1, l, mid);
build(p << 1 | 1, mid + 1, r);
up(p);
}
}
inline void down(int p, int l, int r) {
if (tg[p] != -1e9) {
int mid = l + r >> 1;
a[p << 1] = a[p << 1 | 1] = tg[p];
tg[p << 1] = tg[p << 1 | 1] = tg[p];
t[p << 1] = tg[p] + l;
t[p << 1 | 1] = tg[p] + mid + 1;
tg[p] = -1e9;
}
}
int sum;
inline void ask(int p, int l, int r, int pos) {
if (l == pos && pos == r) {
sum = a[p];
}
else {
down(p, l, r);
int mid = l + r >> 1;
if (pos <= mid) ask(p << 1, l, mid, pos);
else ask(p << 1 | 1, mid + 1, r, pos);
}
}
inline void modify(int p, int l, int r, int ql, int qr, int k) {
if (l >= ql && r <= qr) {
a[p] = k;
t[p] = a[p] + l;
tg[p] = k;
}
else {
down(p, l, r);
int mid = l + r >> 1;
if (ql <= mid) modify(p << 1, l, mid, ql, qr, k);
if (mid < qr) modify(p << 1 | 1, mid + 1, r, ql, qr, k);
up(p);
}
}
int n, m;
int main() {
readin(n); readin(m);
int x, y;
build(1, 1, m);
for (int i = 1; i <= n; i ++) {
readin(x); readin(y);
sum = 1e8;
if (x > 1) ask(1, 1, m, x - 1);
modify(1, 1, m, x, y, sum);
if (t[1] + i >= 1e8) puts("-1");
else writeln(t[1] + i, '\n');
}
return 0;
} | 0 |
// Written by newbiechd
#include <cstring>
#include <iostream>
#include <string>
const int maxN = 13;
int n;
char col[maxN][maxN];
bool vis[26];
void dfs(int x, int y, char c) {
if (x > n) {
int val = 0;
memset(vis, 0, sizeof(vis));
for (int j = 1; j <= n; ++j) vis[col[1][j] - 'a'] = 1;
for (char t = 'a'; t <= c; ++t) val += vis[t - 'a'];
if (val != 3)
return ;
for (int i = 2; i <= n; ++i) {
memset(vis, 0, sizeof(vis));
int tmp = 0;
for (int j = 1; j <= n; ++j) vis[col[i][j] - 'a'] = 1;
for (char t = 'a'; t <= c; ++t) tmp += vis[t - 'a'];
if (tmp != val)
return ;
}
for (int j = 1; j <= n; ++j) {
memset(vis, 0, sizeof(vis));
int tmp = 0;
for (int i = 1; i <= n; ++i) vis[col[i][j] - 'a'] = 1;
for (char t = 'a'; t <= c; ++t) tmp += vis[t - 'a'];
if (tmp != val)
return ;
}
for (int i = 1; i <= n; ++i)
printf("%s\n", col[i] + 1);
putchar('\n'), fflush(stdout);
return ;
}
if (y > n) {
dfs(x + 1, 1, c);
return ;
}
if (col[x][y - 1] == '.') {
col[x][y] = col[x][y - 1] = c;
dfs(x, y + 1, c + 1);
col[x][y] = col[x][y - 1] = '.';
}
if (col[x - 1][y] == '.') {
col[x][y] = col[x - 1][y] = c;
dfs(x, y + 1, c + 1);
col[x][y] = col[x - 1][y] = '.';
}
dfs(x, y + 1, c);
}
const std::string ans[][7] = {
{
"aabc",
"ddbc",
"efgg",
"efhh"
},
{
"aabbd",
"ccf.d",
"eefgg",
"..hij",
"..hij"
},
{
"aabbcc",
"ddeeff",
"ghi...",
"ghi...",
"...jkl",
"...jkl"
},
{
"aabbcc.",
"ddee..h",
"ffgg..h",
"....ijk",
"....ijk",
"....lmn",
"....lmn"
}
};
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cin >> n;
/*
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
col[i][j] = '.';
dfs(1, 1, 'a');
*/
if (n < 3) {
printf("-1\n");
return 0;
}
if (n == 3) {
std::cout << "aa.\n..a\n..a\n";
return 0;
}
int k = (n & 3) + 4;
for (int i = 0; i < n - k; ++i) {
std::string str(n, '.');
str.replace(i / 4 * 4, 4, ans[0][i % 4]);
std::cout << str << '\n';
}
for (int i = n - k; i < n; ++i) {
std::string str(n, '.');
str.replace(n - k, k, ans[k - 4][i + k - n]);
std::cout << str << '\n';
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int N = 123456;
int n, a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int type = 1;
while (1) {
int even = 0;
for (int i = 1; i <= n; ++i) {
if (!(a[i] & 1)) {
++even;
}
}
if (even & 1) {
cout << (type == 1 ? "First" : "Second") << '\n';
exit(0);
} else if (!(even & 1) && n - even >= 2) {
cout << (type == 1 ? "Second" : "First") << '\n';
exit(0);
} else {
for (int i = 1; i <= n; ++i) {
if (a[i] & 1) {
if (a[i] == 1) {
cout << (type == 1 ? "Second" : "First") << '\n';
exit(0);
} else {
--a[i];
}
}
}
int gcd = 0;
for (int i = 1; i <= n; ++i) {
gcd = __gcd(gcd, a[i]);
}
for (int i = 1; i <= n; ++i) {
a[i] /= gcd;
}
}
type = !type;
}
return 0;
} | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 1000000007;
int cnt[345678];
signed main() {
int n; cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <utility> // pair, make_pair
#include <vector> // vector
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sin, cos, tan
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
//桁数
ll GetDigit(ll num)
{
return log10(num) + 1;
}
//約数全列挙
vector<ll> enum_div(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(begin(ret), end(ret));
return ret;
}
//累乗(xのn乗%mod)
ll modpow(ll x, ll n, ll mod = MAX)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
//階乗
ll factorial(ll n)
{
if (n > 0)
return n * factorial(n - 1);
else
return 1;
}
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
void Main()
{
str s;
cin >> s;
set<char> flag;
rep(i, s.size())
{
flag.insert(s[i]);
}
for (char i = 'a'; i <= 'z'; i++)
{
if (!flag.count(i))
fin(s + i);
}
if (s == "zyxwvutsrqponmlkjihgfedcba")
fin(-1);
vc SS;
SS.pb(s[s.size() - 1]);
s.pop_back();
while(1)
{
sort(all(SS));
for(ll i = 0;i < SS.size();i++)
{
if(s[s.size() - 1] < SS[i])
{
s.pop_back();
cout << s << SS[i] << endl;
return;
}
}
SS.pb(s[s.size() - 1]);
s.pop_back();
}
}
//前処理
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);
cout << fixed << setprecision(20); //高精度少数表示
//cout << setfill('0') << internal << setw(4); 0埋め４桁
Main();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
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 a,b;
cin >> a >> b;
int ans=0;
if(4-a>0){
ans+=(4-a)*1e5;
}
if(4-b>0){
ans+=(4-b)*1e5;
}
if(a==1&&b==1){
ans+=4e5;
}
cout << ans << endl;
}
| #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <iomanip>
#include <fstream>
using namespace std;
//abcdefghijklmnopqrstuvwxyz
//ABCDEFGHIJKLMNOPQRSTUVWXYZ
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
// ll INF = INT_MAX;
// ll mod = 1000000007;
// lld PI = 3.141592653;
// const int N = 2e5 + 5;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// ifstream cin("input.txt");
int n,k;
cin>>n>>k;
vector<int> a(n);
for (int i = 0;i<n;i++) cin>>a[i];
vector<ll> pref(n);
pref[0] = a[0];
for (int i = 1;i<n;i++) pref[i] = pref[i-1] + a[i];
lld ans = lld((k+pref[k-1]))/2;
for (int i = k;i<n;i++){
ll sum = pref[i] - pref[i-k];
ans = max(ans, (lld(k)+sum)/2);
}
cout<<setprecision(20)<<ans<<"\n";
} | 0 |
#include <cstdio>
using namespace std;
typedef long long int LLI;
LLI d;
int main() {
while (1) {
if (scanf("%lld", &d) != 1) break;
LLI ans = 0;
for (LLI i=0; i<600; i+=d) {
ans += i*i*d;
}
printf("%lld\n", ans);
}
} | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int f(int);
int integral(int);
int main(void) {
int a, b;
while(cin >> a >> b) {
cout << integral(a) << endl;
cout << integral(b) << endl;
}
return 0;
}
int integral(int d){
int n = 600 / d;
int sum = 0;
for (int i = 1; i < n; i++) {
sum = sum + f(d * i) * d;
}
return sum;
}
int f(int a) {
return a * a;
} | 1 |
#include<stdio.h>
int main(){
int A, B;
int mark =0;
scanf("%d %d", &A, &B);
char in[A+B+1];
scanf("%s", in);
int ctr = 0;
for(int i = 0; i < A+B+1 ; i++){
if(in[i] == '-' && i == A){
mark = 1;
}else if(in[i] >= '0' && in[i] <= '9' ){
++ctr;
}
}
if( mark == 1 && ctr == A+B){
printf("Yes\n");
}else{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてからつかうこと
constexpr ll MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
vector<pair<long long, long long>> primeFactorize(long long N) {
vector<pair<long long, long long>> res;
for (long long i = 2; i * i <= N; ++i) {
if (N % i != 0)
continue;
long long powInd = 0;
while (N % i == 0) {
powInd++;
N /= i;
}
res.push_back({i, powInd});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
signed main() {
cin >> A >> B;
N = gcd(A, B);
auto v = primeFactorize(N);
dump(v);
cout << v.size() + 1 << endl;
} | 0 |
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n, m;
int p[1003];
void solve() {
sort(p, p + n);
reverse(p, p+n);
int ans = 0;
rep(i, n) ans += p[i];
for (int i = 0; i + m - 1 < n; i += m) {
ans -= p[i + m - 1];
}
cout << ans << endl;
}
int main() {
while (cin >> n >> m) {
rep(i, n) cin >> p[i];
if (n == 0 && m == 0) break;
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
///**************************DONE****************************///
int a[mx5], c[mx5];
int main()
{
int n;
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
c[i - 1] = abs(a[i] - a[i - 1]);
ans += c[i - 1];
}
c[n] = abs(a[n] - 0);
ans += c[n];
for(int i = 1; i <= n; i++){
if(i == n)
cout << ans - (c[i - 1] + c[i]) + abs(a[i - 1] - 0) << '\n';
else
cout << ans - (c[i - 1] + c[i]) + abs(a[i - 1] - a[i + 1]) << '\n';
}
return 0;
}
| 0 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323;
long long int N,W,H;
string S[200];
int main()
{
cout << fixed << setprecision(18);
cin>>N>>H>>W;
cout<<(N-H+1)*(N-W+1)<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
map<ll,int> prf(ll n){
map<ll,int> ret;
for(ll i=2;i*i<=n;i++){
while(n%i==0){
ret[i]++;
n/=i;
}
}
if(n!=1){
ret[n]=1;
}
return ret;
}
int main(){cout<<fixed<<setprecision(10);
int n,h,w;
cin>>n>>h>>w;
n++;
cout<<(n-w)*(n-h)<<endl;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
ll gcd(ll n, ll m)
{
ll tmp;
while (m != 0)
{
tmp = n % m;
n = m;
m = tmp;
}
return n;
}
ll lcm(ll n, ll m)
{
return abs(n) / gcd(n, m) * abs(m); //gl=xy
}
using namespace std;
void solve(){
int n;
cin>>n;
string s;
cin>>s;
int q;
cin>>q;
vector<ll>cnt_m(n+1);
rep(i,n){
cnt_m[i+1]=cnt_m[i]+ll(s[i]=='M');
}
while(q--){
int k;
cin>>k;
vector<vector<ll>>dp(2,vector<ll>(4));
dp[0][0]=1;
rep(i,k){
rep(j,4){
dp[(i+1)%2][j]+=dp[i%2][j];
}
if(s[i]=='D'){
dp[(i+1)%2][1]+=dp[i%2][0];
}
else if(s[i]=='M'){
dp[(i+1)%2][2]+=dp[i%2][1];
}
else if(s[i]=='C'){
dp[(i+1)%2][3]+=dp[i%2][2];
}
rep(j,4)dp[i%2][j]=0;
}
for(int i=k;i<n;++i){
if(s[i-k]=='D'){
dp[i%2][2]-=(cnt_m[i]-cnt_m[i+1-k]);
dp[i%2][1]--;
}
rep(j,4){
dp[(i+1)%2][j]+=dp[i%2][j];
}
if(s[i]=='D'){
dp[(i+1)%2][1]+=dp[i%2][0];
}
else if(s[i]=='M'){
dp[(i+1)%2][2]+=dp[i%2][1];
}
else if(s[i]=='C'){
dp[(i+1)%2][3]+=dp[i%2][2];
}
rep(j,4)dp[i%2][j]=0;
}
cout<<dp[n%2][3]<<"\n";
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<int>> campas(h, vector<int>(w));
for (int i=0; i<h; i++){
string s;
cin >> s;
for (int j=0; j<w; j++){
if (s[j] == '#') campas[i][j] = 1;
else campas[i][j] = 0;
}
}
for (int i=0; i<h; i++){
for (int j=0; j<w; j++){
if (campas[i][j] == 0) continue;
if ((0 <= i+1) && (i+1 < h)) {if (campas[i+1][j] > 0) campas[i][j] += 1;}
if ((0 <= i-1) && (i-1 < h)) {if (campas[i-1][j] > 0) campas[i][j] += 1;}
if ((0 <= j+1) && (j+1 < w)) {if (campas[i][j+1] > 0) campas[i][j] += 1;}
if ((0 <= j-1) && (j-1 < w)) {if (campas[i][j-1] > 0) campas[i][j] += 1;}
}
}
string ans="Yes";
for (int i=0; i<h; i++){
for (int j=0; j<w; j++){
if (campas[i][j] == 1) ans = "No";
}
}
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;
int main()
{
// cut here before submit
// freopen("testcase.wdt", "r", stdin);
// 2004/01/01 is Thursday
const string week[] = {
"Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday" };
const int days[] = { 0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
string str = "";
while (1){
int month = 0;
int day = 0;
cin >> month >> day;
if (month == 0 && day == 0){
break;
} // end if
int num = 0;
for (int i = 0; i < month; ++i){
num += days[i];
} // end for
num += day;
cout << week [( num - 1 + 3 ) % 7 ] << endl;
} // end while
return 0;
} | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
using namespace std;
void b_power_socket(void) {
int a, b;
cin >> a >> b;
int sum = 1;
int cnt = 0;
while (sum < b) {
sum += (a - 1);
cnt++;
}
cout << cnt << endl;
}
int main()
{
b_power_socket();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
string m = to_string(n);
int cnt = 0;
rep(i,m.size()){
cnt += m.at(i) - '0';
}
if(n % cnt == 0)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int num(int N){
int a = 0 , b = 1, c;
for(int i = 0 ; i < 9 ; i++){
a += N / b % 10;
b *= 10;
}
c = N % a;
return c;
}
int main(){
int N;
cin >> N;
if(num(N) == 0){
cout << "Yes" <<endl;
}
else if(num(N) != 0){
cout << "No" << endl;
}
} | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define MAXN 100000
using namespace std;
typedef long long LL;
vector<int> turns[MAXN+5];//用vector来记录每一个循环
LL k;
int n,m,tcnt=0,chs[MAXN+5],id[MAXN+5],id2[MAXN+5];
//id存的是单次操作之后的状态,id2存的是k次操作之后的操作
LL x[MAXN+5],a[MAXN+5];
LL a2[MAXN+5],x2[MAXN+5];
//a2是之后的差分序列，x2是之后的兔子位置
bool vis[MAXN+5];
int main()
{
// freopen("rabbit.in","r",stdin);
// freopen("rabbit.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld",&x[i]),id[i]=i;
for(int i=1;i<=n;i++)
a[i]=x[i]-x[i-1];
scanf("%d %lld",&m,&k);
for(int i=1;i<=m;i++)
scanf("%d",&chs[i]),swap(id[chs[i]],id[chs[i]+1]);
for(int i=1;i<=n;i++)
{
int p=i;
if(vis[p]==true)
continue;
tcnt++;
while(vis[p]==false)
{
vis[p]=true;
turns[tcnt].push_back(p);
p=id[p];
}
}
for(int i=1;i<=tcnt;i++)
{
int T=(int)turns[i].size();//对于每一个循环单独计算
int pos=k%T;
//处理出开头位置所对应的最终位置，然后向后挪到来求出这个循环里的其他元素所对应的答案
for(int j=0,p=pos;j<(int)turns[i].size();j++,p=(p+1)%T)
id2[turns[i][j]]=turns[i][p];
}
for(int i=1;i<=n;i++)
a2[i]=a[id2[i]];
for(int i=1;i<=n;i++)
x2[i]=x2[i-1]+a2[i];
for(int i=1;i<=n;i++)
printf("%lld.0\n",x2[i]);//因为题目要求，强行加一个.0
return 0;
}
| #include<bits/stdc++.h>
//#include<tr1/unordered_map>
//#include"Bignum/bignum.h"
//#define lll bignum
#define ls(x) ( x << 1 )
#define rs(x) ( x << 1 | 1 )
//#define mid ( ( l + r ) >> 1 )
#define lowbit(x) ( x & -x )
#define debug(x) (cout << "#x = " << x << endl)
#define re register
#define For(i, j, k) for(re int i = (j); i <= (k); i++)
#define foR(i, j, k) for(re int i = (j); i >= (k); i--)
#define Cross(i, j, k) for(re int i = (j); i; i = (k))
using namespace std;
typedef long long ll;
const ll N = 100011;
const ll inf = 0x3f3f3f3f3f3f;
ll n, m, k, x, a[N], b[N], c[N], B[N];
double res = 0;
namespace IO {
#define dd ch = getchar()
inline ll read() {
ll x = 0; bool f = 0; char dd;
for (; !isdigit (ch); dd) f ^= (ch == '-');
for (; isdigit (ch); dd) x = (x << 3) + (x << 1) + (ch ^ 48);
return f? -x: x;
}
#undef dd
inline void write( ll x ) {
if ( x < 0 ) putchar ( '-' ), x = -x;
if ( x > 9 ) write ( x / 10 ); putchar ( x % 10 | 48 );
}
inline void wrn ( ll x ) { write (x); putchar ( ' ' ); }
inline void wln ( ll x ) { write (x); putchar ( '\n' ); }
inline void wlnn ( ll x, ll y ) { wrn (x), wln (y); }
}
using namespace IO;
inline void Redouble ( ll x ) {
for (; x; x >>= 1) {
if (x & 1) {
For ( i, 1, n ) B[i] = a[b[i]];
For ( i, 1, n ) a[i] = B[i];
}
For ( i, 1, n ) B[i] = b[b[i]];
For ( i, 1, n ) b[i] = B[i];
}
}
int main()
{
n = read();
For ( i, 1, n ) a[i] = read(), b[i] = i;
foR ( i, n, 1 ) a[i] = a[i] - a[i - 1];
m = read(), k = read();
For ( i, 1, m ) x = read(), swap ( b[x], b[x + 1] );
Redouble (k);
For ( i, 1, n )
res += a[i], printf ("%.1lf\n", res);
return 0;
}
/*
*/
| 1 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0), ios::sync_with_stdio(false);
int k,t; cin >> k >> t;
int mx = 0;
vi a(t);
rep(i,t){
cin >> a[i];
chmax(mx,a[i]);
}
if((k+1)/2 < mx){
cout << (mx-(k+1)/2)*2-1;
}else{
cout << 0;
}
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w;
cin >> h >> w;
vector<string> s(h);
int white_cnt = 0;
for (int i = 0; i < h; i++)
{
cin >> s[i];
for (int j = 0; j < w; j++)
{
if(s[i][j] == '.')white_cnt++;
}
}
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
vector<vector<int>> seen(h, vector<int>(w, -1));
queue<pair<int, int>> que;
seen[0][0] = 0;
que.push(make_pair(0, 0));
while (!que.empty())
{
pair<int ,int> pos = que.front();
int x = pos.first, y = pos.second;
que.pop();
for (int i = 0; i < 4; i++)
{
int nx = x + dx[i], ny = y + dy[i];
if(nx < 0 || nx >= h || ny < 0 || ny >= w)continue;
if(s[nx][ny] == '#')continue;
if(seen[nx][ny] == -1)
{
que.push(make_pair(nx, ny));
seen[nx][ny] = seen[x][y] + 1;
}
}
}
if(seen[h - 1][w - 1] == -1)cout << -1 << endl;
else cout << white_cnt - seen[h - 1][w - 1] - 1 << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main()
{
string s;
cin >> s;
smatch smatch;
if (regex_search(s,smatch,regex("^A[a-z]+C[a-z]+$")))
{
cout << "AC" << endl;
}
else
{
cout << "WA" << endl;
}
} | #include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
string S;
cin >> S;
string ans="AC";
if(S.at(0)!='A') ans="WA";
if('A'<=S.at(1) && S.at(1)<='Z') ans="WA";
int count_C=0;
for(int i=2;i<S.size()-1;++i){
if('A'<=S.at(i) && S.at(i)<='Z'){
if(S.at(i)!='C'){
ans="WA";
break;
}
else{
if(count_C==0) ++count_C;
else{
ans="WA";
break;
}
}
}
}
if('A'<=S.at(S.size()-1) && S.at(S.size()-1)<='Z') ans="WA";
if(count_C!=1) ans="WA";
cout << ans << endl;
return 0;
}
| 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
struct UnionFind{
vector<int> par;
UnionFind(int n):par(n,-1){}
int find(int x){
if(par[x]<0)return x;
return par[x]=find(par[x]);
}
bool unite(int x,int y){
x=find(x);
y=find(y);
if(x==y)return false;
if(par[x]>par[y]){
par[y]+=par[x];
par[x]=y;
}
else{
par[x]+=par[y];
par[y]=x;
}
return true;
}
bool same(int x,int y){
return find(x)==find(y);
}
};
vector<pair<ll,pint>> edges;
ll a[202020],d;
ll dist(int x,int y){
return d*abs(x-y)+a[x]+a[y];
}
void dfs(int l,int r){
if(l+1>=r)return;
ll mini=longinf,idx=-1;
int m=(l+r)/2;
for(int i=l;i<m;++i){
if(dist(i,m)<mini)mini=dist(i,m),idx=i;
}
for(int i=m;i<r;++i){
edges.push_back({dist(idx,i),{idx,i}});
}
mini=longinf;idx=-1;
for(int i=m;i<r;++i){
if(dist(i,l)<mini)mini=dist(i,l),idx=i;
}
for(int i=l;i<m;++i){
edges.push_back({dist(idx,i),{idx,i}});
}
dfs(l,m);
dfs(m,r);
}
int main(){
int n;cin>>n>>d;
rep(i,n)cin>>a[i];
dfs(0,n);
sort(edges.begin(),edges.end());
UnionFind uf(n);
ll ans=0;
for(auto e:edges){
if(uf.unite(e.second.first,e.second.second))ans+=e.first;
}
cout<<ans<<endl;
return 0;
} | #include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 1100000
using namespace std;
char s[N],t[N];
int p[N],head,tail,n,f[N],ans;
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
scanf("%s",t+1);
bool bo=1;
for(int i=1;i<=n;i++) if(s[i]!=t[i]) {bo=0;break;}
if(bo) {printf("0\n");return 0;}
int j=n;
for(int i=n;i>=1;i--)
{
j=min(j,i);
while(j && s[j]!=t[i]) j--;
if(j==0) {printf("-1\n");return 0;}
f[i]=j;
}
head=1;tail=0;
for(int i=n;i>=1;i--)
{
while(head<=tail && p[head]-(tail-head)>i) head++;
if(f[i]!=f[i+1]) p[++tail]=f[i];
ans=max(ans,tail-head+1);
}
printf("%d\n",ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
//const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
double n, m, d;
cin >> n >> m >> d;
double ans = [&]() -> double {
if (d == 0) {
return 1.0 / n * (m - 1);
} else {
return 2.0 * (n - d) / n / n * (m - 1);
}
}();
cout << setprecision(20) << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cctype>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%f\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
return 0;
} | 0 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int d, x, y, Y[600];
int i, sum = 0;
for(i = 0;i < 600;i++){
Y[i] = 0;
}
while(cin >> d){
for(i = 1;d*i < 600;i++){
x = d * i;
y = x * x;
Y[i] = y * d;
}
for(i = 1;i < 600;i++){
sum += Y[i];
}
cout << sum << endl;
sum = 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int d;
while (cin >> d)
{
cout << 72000000 - 180000 * d + 100 * d * d << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long K, x;
string S;
cin >> K >> S;
x = S.size();
if (x > K) S = S.substr(0, K) + "...";
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin>>a>>b>>c>>d;
string ans;
if(a+b>c+d){
ans="Left";
}
else if(a+b<c+d){
ans="Right";
}
else{
ans="Balanced";
}
cout<<ans<<endl;
} | 0 |
#include<stdio.h>
int main(){
char word1[105];
char word2[105];
scanf ("%s %s", &word1, &word2);
printf("%s%s\n",word2,word1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}//MAX
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
//MIN
main() {
string s;
cin >> s;
for(int i=0;i<s.size()-8;i++){
cout << s.at(i);
}
cout << endl;
}
| 0 |
#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rep(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////
ll n,m;
Vi a;
ll cal(ll n){
switch(n){
case 1:
return 2;
break;
case 2:
case 3:
case 5:
return 5;
break;
case 4:
return 4;
break;
case 6:
return 6;
break;
case 7:
return 3;
break;
case 8:
return 7;
break;
case 9:
return 6;
break;
default:
return 0;
break;
}
}
vector<string> dp;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
cin>>n>>m;
a.resize(m);
rep(i,m){
cin>>a[i];
}
dp.resize(n+10,"-1");
dp[0]="";
rep(i,n){
if(dp[i]=="-1")continue;
rep(j,a.size()){
ll tmp = i+cal(a[j]);
string fig = dp[i]+(char)('0'+a[j]);
string now = dp[tmp];
if(now=="-1" || now.size()<fig.size()){
dp[tmp] = fig;
}else if(now.size()>fig.size()){
}else{
chmax(dp[tmp],fig);
}
}
}
print(dp[n]);
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##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define umap unordered_map
//cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
int __stoi(string s){ return atoi(s.c_str()); }
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
template<class T> void chmax(T& a, T b){ if(a<b){a=b;} }
template<class T> void chmin(T& a, T b){ if(a>b){a=b;} }
int main(){
ll inf = pow(10,5);
// 各数について使うマッチ棒の数を記憶
umap<int,int> mp;
mp[1] = 2;
mp[2] = 5;
mp[3] = 5;
mp[4] = 4;
mp[5] = 5;
mp[6] = 6;
mp[7] = 3;
mp[8] = 7;
mp[9] = 6;
int N,M; cin>>N>>M;
int a[M]; CINA(a,M);
sort(a,a+M,greater<int>());
// i本使い切った時の最大桁数をdpで求める
int dp[N+1]; FILL(dp,N+1,-inf);
dp[0] = 0LL;
for(int i=1;i<=N;++i){
REP(j,M){
int x = a[j];
int num = mp[x];
if(i-num>=0){ chmax(dp[i],dp[i-num]+1); }
}
}
// 上位の桁から順に、条件を満たす最大の数を並べていく
while(N>0){
REP(j,M){
int x = a[j];
int num = mp[x];
if( N-num<0){ continue;}
if( dp[N-num] == dp[N]-1 ){
cout << x;
N -= num;
break;
}
}
}
cout << "\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i=0; i<N; i++) {
cin >> s;
if (S.count(s)) S.at(s) += 1;
else S[s] = 1;
}
int M;
cin >> M;
for (int i=0; i<M; i++) {
cin >> s;
if (S.count(s)) S.at(s) -= 1;
}
using pis = pair<int, string>;
priority_queue<pis> cnt;
for (auto x : S) { // 要素はキーと値のpair
cnt.push(pair(x.second, x.first));
}
if (cnt.top().first < 0) cout << 0 << endl;
else cout << cnt.top().first << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
int N;
int M;
map<string, int> S;
map<string, int> T;
signed main()
{
cin >> N;
REP(i, N)
{
string s;
cin >> s;
if (CONTAINS_MAP(S, s))
{
S[s]++;
}
else
{
S[s] = 1;
}
}
cin >> M;
REP(i, M)
{
string s;
cin >> s;
if (CONTAINS_MAP(T, s))
{
T[s]++;
}
else
{
T[s] = 1;
}
}
int ma = 0;
for (auto pair : S)
{
int n = pair.second;
if (CONTAINS_MAP(T, pair.first))
{
n -= T[pair.first];
}
ma = max(ma, n);
}
cout << ma << endl;
}
| 1 |
//#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
#define mp make_pair
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int N, U, V;
vector <int> Graph[int(1e5 + 5)];
int DistT[int(1e5 + 5)], DistA[int(1e5 + 5)];
int Prepare(){
scanf("%d%d%d", &N, &U, &V);
fill(DistT, DistT + N + 1, -1);
fill(DistA, DistA + N + 1, -1);
for (int i = 0; i < N - 1; i++){
int A, B; scanf("%d%d", &A, &B);
Graph[A].push_back(B);
Graph[B].push_back(A);
}
return 0;
}
int BFS(){
queue <int> que;
que.push(U); DistT[U] = 0;
while (!que.empty()){
int Q = que.front(); que.pop();
for (int i = 0; i < Graph[Q].size(); i++){
int next = Graph[Q][i];
if (DistT[next] != -1) continue;
DistT[next] = DistT[Q] + 1;
que.push(next);
}
}
que.push(V); DistA[V] = 0;
while (!que.empty()){
int Q = que.front(); que.pop();
for (int i = 0; i < Graph[Q].size(); i++){
int next = Graph[Q][i];
if (DistA[next] != -1) continue;
DistA[next] = DistA[Q] + 1;
que.push(next);
}
}
return 0;
}
int main(){
Prepare(); BFS();
int ans = 0;
for (int i = 1; i <= N; i++){
if (DistA[i] >= DistA[U] && DistT[i] < DistA[i]){
ans = max(ans, DistA[i] - 1);
}
}
cout << ans << endl;
return 0;
}
| // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
//PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define repp(I, A, B) for(int I = A; I <= B; I++)
#define rep(I, A, B) for(int I = A; I < B; I++)
#define rrep(I, B, A) for(int I = B; I >= A; I--)
#define pb emplace_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define LB lower_bound
#define UB upper_bound
#define MP make_pair
#define mem(A, B) memset(A, B, sizeof(A));
#define mem0(A) memset(A, 0, sizeof(A));
#define quickio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(this) cerr<<"> "<<#this<<" : "<<this<<"\n"
#define bitsf(n) __builtin_popcount(n)
#define in_edges(M) repp(I, 1, M){ll A, B; cin >> A >> B; v[A].pb(B), v[B].pb(A);}
#define in_edges2(M) repp(I, 1, M){ll A, B; cin >> A >> B; v[A].pb(B);}
#define endl "\n"
ll power(ll x, ll y);
const ll MOD = 1000000007;
const int MX = 1e5 + 5;
vector<int> v[MX];
void bfs(vector<int> &level, int s){
queue<int> q;
q.push(s);
while(q.size()){
auto p = q.front();
q.pop();
for(auto i : v[p]) if(!level[i]){
level[i] = level[p] + 1;
q.push(i);
}
}
}
int main() //PointBlank's code ¯\_(ツ)_/¯
{
int n, late, early;
cin >> n >> late >> early;
in_edges(n - 1);
vector<int> A(MX, 0), B(MX, 0);
bfs(A, late);
bfs(B, early);
int mx = 1;
repp(i, 1, n) if(B[i] >= A[i] && B[i] >= mx) mx = B[i];
for(auto i : v[late]) if(i == early) mx = 1;
cout << mx - 1;
}
ll power(ll x, ll y)
{
ll res = 1; x %= MOD;
while(y > 0){if(y & 1) res = (res*x) % MOD; y = y>>1, x = (x*x) % MOD;}
return res;
} | 1 |
/*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB iBBB
BBQ BQB BBD QBBi
BBB BQB iQBi 1BBv
sBBg wBBB QBB iBBB
7BBBBBBBBBi BBR wBBBBBBBBBBBBB
irvi ii ii i i iii
i5U
BBB
BB7
1BB
iPBBBBBKBBR JBR1 rQBO BR UBQP iBBQi
7BBBGs7sXBBBi QBBr gBBE rBB BB2BB7HBZQBB
QBBi sBQ BBB iBBB SQBBR BBBB cBQ
gBQ BBg BBB KBBi MBBH BBB BBs
iBBv iBBi QBBBL BBR pBB iBB
pBB BBB iBBBB iBB BBL KBB
MBB BBBR BBB JBBi DBR iBQ BBL
GBB 7BBBB2 PBBH BBBi BQr DBB iBB
BQBXwgBBP BB7 1BBB BBQ7 1BB BBc BBB
2BBBBw BB EBBS QBBi HBa iBB BB7
*/
#include<bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define x0 x0123456789
#define y0 y0123456789
#define x1 x1234567890
#define y1 y1234567890
#define x2 x2345678901
#define y2 y2345678901
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 7;
const int maxn = 205;
const int maxm = 1e5 + 5;
int n, x;
int a[maxn], dp[maxn][maxm];
/*
sort them in the increasing order
then for ai (after sorted), if it works,
it must be in front of all the elements that are smaller than it
otherwise it won't cause any influence
so we have dp(i, j) representing if you feed the first i elements with j,
what's the answer:
dp(i, j) = dp(i - 1, j mod a[i]) + dp(i - 1, j) * i
*/
int main(){
scanf("%d%d", &n, &x);
FOR(i, 0, n)
scanf("%d", a + i);
sort(a, a + n);
FOR(i, 0, n) FOR(j, 0, maxm){
if(!i){
dp[i][j] = j % a[i];
continue;
}
dp[i][j] = (dp[i - 1][j % a[i]] + 1ll * dp[i - 1][j] * i % INF) % INF;
}
printf("%d\n", dp[n - 1][x]);
return 0;
}
| #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 35000;
const int K = 19;
int mod = 1e9 + 7;
int n, dp[210][100200], a[N], f[N], invf[N];
int solve(int m, int x){
if (m > n) return dp[m][x] = x;
if (dp[m][x] != 0) return dp[m][x];
int cnt = 0;
int l = m;
while (l <= n && a[l] > x){
cnt++;
l++;
}
if (cnt != 0) return dp[m][x] = f[n - m + 1] * invf[n - m - cnt + 1] % mod * solve(m + cnt, x) % mod;
int res = 0;
for (int i = m; i <= n; i++){
res = (res + f[n - m] * invf[n - i] % mod * solve(i + 1, x % a[i])) % mod;
}
return dp[m][x] = res;
}
int binpow(int x, int y){
if (y == 0) return 1;
if (y % 2) return x * binpow(x, y - 1) % mod;
int z = binpow(x, y / 2);
return z * z % mod;
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("input.txt", "r", stdin);
int x;
cin >> n >> x;
f[0] = 1;
invf[0] = 1;
for (int i = 1; i <= n; i++) f[i] = f[i - 1] * i % mod;
for (int i = 1; i <= n; i++) invf[i] = binpow(f[i], mod - 2);
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
cout << solve(1, x);
}
| 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<queue>
#include<stack>
#include<complex>
#include<utility>
#include<cmath>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pi acos(-1)
#define all(v) v.begin(),v.end()
using namespace std;
const double eps = 1e-8;
const double INF = 1e12;
typedef pair<int,int> P;
typedef double Real;
typedef complex<Real> Point;
typedef vector<Point> G;
double cross(const Point& a,const Point& b){//calculate ad-bc(vector product)
return imag(conj(a)*b);
}
struct L:public vector<Point>{//line data
L(const Point &a,const Point &b){
push_back(a);
push_back(b);
}
};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
string s[12];
int dt[12][12];
while(cin>>s[0]){
loop(i,1,12)cin>>s[i];
rep(i,12){
rep(j,12){
dt[i][j]=(int)(s[i][j]-'0');
}
}
int ans=0;
rep(i,12){
rep(j,12){
if(dt[i][j]){
ans++;
queue<P> que;
P now(j,i);
que.push(now);
while(!que.empty()){
now=que.front();
que.pop();
if(now.second>=12 ||now.first<0 || now.second<0 || now.first>=12)continue;
if(dt[now.second][now.first]==0)continue;
dt[now.second][now.first]=0;
rep(k,4){
now.first+=dx[k];
now.second+=dy[k];
que.push(now);
now.first-=dx[k];
now.second-=dy[k];
}
}
}
}
}
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i,a,b) for(ll i=(a);i<ll(b);i++)
#define rep(i,b) loop(i,0,b)
void draw(char g[20][20], int ci, int cj){
g[ci][cj] = '0';
int di[] = {0,0,1,-1};
int dj[] = {1,-1,0,0};
rep(d,4){
int ni = ci + di[d];
int nj = cj + dj[d];
if(ni >= 12 || nj >= 12 || ni < 0 || nj < 0 || g[ni][nj] == '0') continue;
draw(g,ni,nj);
}
}
int solve(char g[20][20]){
int ans = 0;
rep(i,12)rep(j,12){
if(g[i][j] == '1'){
++ans;
draw(g,i,j);
}
}
return ans;
}
int main(){
char g[20][20];
while(~scanf("%s",g[0])){
rep(i,11) scanf("%s",g[i+1]);
printf("%d\n",solve(g));
}
} | 1 |
#include <iostream>
#include <cmath>
using namespace std;
struct Point
{
double x, y;
Point(double x=0, double y=0) : x(x), y(y) {}
double distance (const Point &o) const
{
return sqrt((x - o.x) * (x - o.x) + (y - o.y) * (y - o.y));
}
Point operator+(const Point &o) const
{
return Point(x+o.x, y+o.y);
}
Point operator-(const Point &o) const
{
return Point(x-o.x, y-o.y);
}
Point operator*(const double m) const
{
return Point(x*m, y*m);
}
Point operator/(const double d) const
{
return Point(x/d, y/d);
}
double cross(const Point &o) const
{
return x * o.y - y * o.x;
}
double dot(const Point &o) const
{
return x * o.x + y * o.y;
}
double atan() const
{
return atan2(y, x);
}
double norm() const
{
return dot(*this);
}
double area(const Point &a,const Point &b) const
{
double t = (a.x - x) * (b.y - y);
double t2 = (a.y - y) * (b.x - x);
double areas = abs(t-t2);
return areas/2;
}
};
int main()
{
Point p1,p2;
cin >> p1.x >> p1.y >> p2.x >> p2.y;
cout << fixed;
cout.precision(6);
cout << p1.distance(p2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
pair<double,double> p1,p2;
cin >> p1.first >> p1.second;
cin >> p2.first >> p2.second;
double dis;
dis=sqrt(pow(p2.first-p1.first,2.0)+pow(p2.second-p1.second,2.0));
printf("%f\n",dis);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
constexpr int INF = 1 << 25;
constexpr int MOD = 1000000007;
int main() {
int n, q;
cin >> n;
vector<int> S(n);
REP(i, n) cin >> S[i];
cin >> q;
int cnt = 0, t;
REP(i, q) {
cin >> t;
if (find(ALL(S), t) != S.end()) ++cnt;
}
cout << cnt << endl;
}
| #include <iostream>
#include <algorithm>
#include <vector>
typedef std::vector<int> TList;
TList Input()
{
int Count;
std::cin >> Count;
TList List(Count);
for(int i = 0; i < Count; ++i){
std::cin >> List[i];
}
return List;
}
int Count(const TList& S, const TList& T)
{
int Sum = 0;
for(TList::const_iterator It = T.begin(); It != T.end(); ++It){
Sum += std::find(S.begin(), S.end(), *It) != S.end() ? 1 : 0;
}
return Sum;
}
int main()
{
TList S = Input();
TList T = Input();
std::cout << Count(S, T) << std::endl;
} | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vector<vector<long long int> >;
int main(void) {
Int a, b;
cin >> a >> b;
cout << a * b << endl;
return 0;
}
| #include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
#include <utility>
typedef long long ll;
#define pi 3.14159265358979323846
#define VI vector<int>
#define VLL vector<long long>
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
const ll MOD = 1e9 + 7;
using namespace std;
template<typename T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template<typename T>
T lcm(T a, T b) {
return a * b / gcd(a, b);
}
template<typename T>
T binarysearch(vector<T> A, T key) {
ll left = 0;ll right = 4;ll mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid]) return 1;
if (key > A[mid]) left = mid + 1;
else if (key < A[mid]) right = mid;
}
return 0;
}
template<typename T>
T finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
}
else { // 発見できなかったとき
return 0;
}
}
ll frac(ll n)//階乗
{
if (n == 0) {
return 1;
}
return (n * frac(n - 1)) % MOD;
}
template<typename T>
T keta(T a) {
ll kazu = 1;
while (1) {
if (a / 10 != 0) { a /= 10;kazu++; }
else break;
}
return kazu;
}//桁数
template<typename T>
T nCr(ll n, T r) {
ll ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans * i;
}
for (int i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
/*char r[4];
int yaju[4];
char op[3];
int sum = 0;
scanf("%s", r);
for (int i = 0;i < 4;i++) {
yaju[i] = r[i] - '0';
}
*///map < string, ll> s;
/*i++ずつずらす
a[0] a[1] a[2]//a[1] a[2] a[3]
a[0] a[2] a[4]//a[1] a[3] a[5]
/*if (N % 2 != 0)a = N / 2;
else a = N / 2 - 1;
for (int i = 1;i <= a;i++) {
for (int j = 0;j < N - (i * 2);j++) {
if (S[j] != S[j + i] && S[j + i * 2] != S[j] && S[j + i] != S[j + i * 2]) sum--;
if (sum == 0)break;
}
}*/
//mapの使い方
/*map<int, int> mp;
for (int i = 0; i < N; i++)
mp[a[i]]++;
int ans = 0;
for (auto p : mp) {
int x = p.first;
int n = p.second;
if (n < x) ans += n;
else ans += n - x;
}*/
//cout << std::fixed << std::setprecision(12) <<<< endl;
int main() {
ll A,B;
cin>>A>>B;
cout<<(A*B)<<endl;
} | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
struct test{
int Math;
int English;
int Japanese;
};
int n;
double total;
test student;
while(1){
total=0;
cin >> n;
if(n==0)break;
for(int i=0;i<n;i++){
char rank='A';
while(1){
cin >> student.Math >> student.English >> student.Japanese;
if(student.Math==100||student.English==100||student.Japanese==100)break;
total=student.Math+student.English;
total=total/2;
if(total>=90)break;
total=student.Math+student.English+student.Japanese;
total=total/3;
if(total>=80)break;
rank='B';
if(total>=70){
break;
}
if(total>=50&&(student.Math>=80||student.English>=80))break;
rank='C';
if(1)break;
}
cout << rank << endl;
}
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void){
int n;
while(cin >> n){
int mat, eng, jap;
rep(i, n){
cin >> mat >> eng >> jap;
int sum = mat + eng + jap;
if(mat == 100 || eng == 100 || jap == 100 || sum >= 240 || sum-jap >= 180){
cout << "A" << endl;
continue;
}else if(sum >= 210||(sum >= 150 && (mat >= 80 || eng >= 80))){
cout << "B" << endl;
continue;
}else{
cout << "C" << endl;
}
}
}
return 0;
}
int StrToInt(string s){
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i){
stringstream ss;
ss << i;
return ss.str();
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
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; }
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
ll n, m;
struct numinfo {
int digit;
int match;
int min_match;
int n;
};
vector<numinfo> nums;
bool dfs( int i, int remain_match, int remain_keta ){
if ( i == SZ(nums) ){
eprintf( "remain=%d %d ", remain_match, remain_keta );
rep(k,SZ(nums)){
eprintf( "%d ", (int)nums[k].n );
}
eprintf( "\n" );
if ( remain_match == 0 && remain_keta <= 0 )
return true;
return false;
}
for ( int k = remain_match/nums[i].match; k >= 0; k-- ){
nums[i].n = k;
int creatable_keta = (remain_match-k*nums[i].match)/nums[i].min_match;
if ( remain_keta-k-creatable_keta > 0 )
continue;
if ( dfs( i+1, remain_match-k*nums[i].match, remain_keta-k ) )
return true;
}
return false;
}
int main(){
cin >> n >> m;
vector<int> a(m);
rep(i,m){
cin >> a[i];
}
sort(a.rbegin(),a.rend());
int digit_to_match[] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
set<int> s;
rep(i,m){
int match = digit_to_match[a[i]];
if ( s.count(match) == 0 )
nums.push_back({a[i],match,100,0});
s.insert(match);
}
m = nums.size();
int min_match = 100;
for ( int i = nums.size()-1; i >= 0; i-- ){
nums[i].min_match = min_match;
chmin(min_match, nums[i].match);
eprintf( "digit,=%d match=%d min_match=%d\n", nums[i].digit, nums[i].match, nums[i].min_match );
}
for ( int keta = n / min_match; keta > 0; keta-- ){
eprintf( "\n\nketa=%d\n", keta );
if ( dfs( 0, n, keta ) ){
sort(nums.begin(), nums.end(), [](numinfo &l, numinfo &r){
return l.digit>r.digit;
});
rep(i,m){
rep(j,nums[i].n){
cout << nums[i].digit;
}
}
cout << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
cout << (expr ? "Yes" : "No") << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, M;
cin >> N >> M;
vector<int> A(M);
REP(i, M) cin >> A[i];
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
vector<string> dp(N+1, "x");
dp[0] = "";
FOR(i, 1, N+1) {
REP(j, M) {
if(i-num[A[j]] >= 0) {
if(dp[i-num[A[j]]] == "x") continue;
if(dp[i] == "x" || dp[i-num[A[j]]].size() >= dp[i].size()) {
dp[i] = dp[i-num[A[j]]] + (char)(A[j] + '0');
} else if(dp[i-num[A[j]]].size() + 1 == dp[i].size()) {
dp[i] = max(dp[i], dp[i-num[A[j]]] + (char)(A[j] + '0'));
}
}
}
//cout << dp[i] << endl;
}
cout << dp[N] << endl;
} | 1 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c,a,b) *min_element(c+a,c+b)
#define maxi(c,a,b) *max_element(c+a,c+b)
//printf("%.12Lf\n",);
int keta(int x){
rep(0,i,30){
if(x<10){
return i+1;
}
x=x/10;
}
}
int gcd(int x,int y){
int aa=x,bb=y;
rep(0,i,1000){
aa=aa%bb;
if(aa==0){
return bb;
}
bb=bb%aa;
if(bb==0){
return aa;
}
}
}
int lcm(int x,int y){
int aa=x,bb=y;
rep(0,i,1000){
aa=aa%bb;
if(aa==0){
return x/bb*y;
}
bb=bb%aa;
if(bb==0){
return x/aa*y;
}
}
}
bool p(int x){
if(x==1)return false;
rep(2,i,sqrt(x)+1){
if(x%i==0&&x!=i){
return false;
}
}
return true;
}
int max(int a,int b){
if(a>=b)return a;
else return b;
}
int min(int a,int b){
if(a>=b)return b;
else return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n,int y){
int ni=1;
for(int i=0;i<41;i++){
n2[i]=ni;
ni*=2;
}
int bunsi=1,bunbo=1;
rep(0,i,y)bunsi=(bunsi*(n-i))%mod;
rep(0,i,y)bunbo=(bunbo*(i+1))%mod;
mody[0]=bunbo;
rep(1,i,41){
bunbo=(bunbo*bunbo)%mod;
mody[i]=bunbo;
}
rep(0,i,41)nis[i]=0;
nn=mod-2;
for(int i=40;i>=0;i-=1){
if(nn>n2[i]){
nis[i]++;
nn-=n2[i];
}
}
nis[0]++;
rep(0,i,41){
if(nis[i]==1){
bunsi=(bunsi*mody[i])%mod;
}
}
return bunsi;
}
int yakuwa(int n){
int sum=0;
rep(1,i,sqrt(n+1)){
if(n%i==0)sum+=i+n/i;
if(i*i==n)sum-=i;
}
return sum;
}
bool hei(int n){
rep(0,i,100){
if(i*i==n){
return true;
}
}
return false;
}
int pow(int b,int a){
int aa=1;
rep(0,i,a)aa*=b;
return aa;
}
int a[114514];
int sum[114514];
signed main(){
ic(n) ic(k)
c(n-k+1)
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int main(){
int a,b; cin >> a >> b;
cout << a-b+1<< endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll & a, ll b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll & a, ll b) { if (b > a) { a = b; return 1; } return 0; }
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N=500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans;
int main() {
cin>>n;
vl beki;
multiset<ll> A;
beki.push_back(1);
rep(i,40){
beki.push_back(beki.back()*2);
}
rep(i,n){
cin>>x;
A.insert(x);
}
while(!A.empty()){
auto ite=A.end();
ite--;
x=*ite;
A.erase(ite);
k=upper_bound(all(beki),x*2)-beki.begin()-1;
if(!A.empty()&&A.count(beki[k]-x)>0){
auto ite2=A.lower_bound(beki[k]-x);
A.erase(ite2);
ans++;
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll i=0; i<N; i++) {
cin >> A[i];
}
string ans = "YES";
sort(A.begin(),A.end());
/*
for (ll i=0; i<N; i++) {
cout << A[i];
}
cout << endl;
*/
for (ll i=0; i<N-1; i++) {
if (A[i]==A[i+1]) {
ans = "NO";
break;
}
}
cout << ans << endl;
} | 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k, t;
cin >> k >> t;
vi a(t);
int ma = 0;
rep(i, t) {
cin >> a[i];
ma = max(ma, a[i]);
}
if(ma <= k/2) {
cout << 0 << endl;
} else {
if(k&1) {
cout << ma-1-(k-ma) << endl;
} else {
cout << ma-1-(k-ma) << endl;
}
}
} | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int perform(Int x){
return (x*(x+1))/2LL;
}
int main()
{
cin>>N>>M;
--M;--N;
cout<<ceilS(M,N)<<"\n";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int k;
int numShow = 1;
int minNumber = 9999999;
cin >> n >> k;
for (int i = 0; i < n; i++) {
// 操作Aの処理
for (int a = i; a < n; a++) {
numShow *= 2;
//cout << "a";
// if (numShow > minNumber) {
// break;
// }
}
// 操作Bの処理
for (int b = n - i; b < n; b++) {
numShow += k;
//cout << "b";
// if (numShow > minNumber) {
// break;
// }
}
//cout << numShow << endl;
if (numShow < minNumber) {
minNumber = numShow;
}
numShow = 1;
}
cout << minNumber << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
int A=1;
cin>>N>>K;
for(int i=0;i<N;i++) {
if (A<K)
A*=2;
else
A+=K;
}
cout<<A<<endl;
} | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int cnt = 0;
while (1) {
rep(i, n) {
if (a[i] % 2 != 0) {
cout << cnt << endl;
return 0;
}
a[i] *= 0.5;
}
cnt++;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
vector<int> a(5);
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
int mx = a[4], mn = a[0];
int k;
cin >> k;
if (abs(mx - mn) <= k)
{
cout << "Yay!" << endl;
}
else
cout << ":(" << endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
struct data_t {
string name;
double eff;
bool operator<(const data_t& right) const {
if (eff == right.eff) {
return ( name < right.name ) || ( name == right.name );
}
else {
return ( eff > right.eff );
}
}
};
int main(void) {
int N;
cin >> N;
while ( N != 0 ) {
vector<data_t> LS(N);
vector<int> T(N,0);
int p,temp,d,e,f,s,m;
for (int i = 0; i < N; i++) {
cin >> LS[i].name;
cin >> p;
for (int j = 0; j < 3; j++) {
cin >> temp;
T[i] += temp;
}
cin >> d >> e >> f >> s >> m;
T[i] += m * (d+e);
LS[i].eff = (double)((m*f*s)-p)/T[i];
}
std::sort(LS.begin(), LS.end());
for (int i = 0; i < N; i++) {
cout << LS[i].name << endl;
}
cout << "#" << endl;
cin >> N;
}
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int u[150][150],p,v[150][150],xg,yg,q,dx[]={1,0,-1,0},dy[]={0,1,0,-1},w,h;
void ret(int x,int y){
int a,b,i;
v[y][x]=1;
if(xg==x&&yg==y)
p++;
else
for(i=0;i<4;i++){
a=x+dx[i];
b=y+dy[i];
if(a<1||a>w||b<1||b>h||v[b][a]==1)
continue;
else if(u[b][a]==q)
ret(a,b);
}
}
int main(){
int xs,ys,c,d,x,y,n;
while(cin>>w>>h,w||h){
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j++)
v[i][j]=0;
scanf("%d %d",&xs,&ys);
scanf("%d %d",&xg,&yg);
scanf("%d",&n);
for(int k=0;k<n;k++){
scanf("%d %d %d %d",&c,&d,&x,&y);
if(d==0)
for(int i=0;i<2;i++)
for(int j=0;j<4;j++)
u[i+y][j+x]=c;
else
for(int i=0;i<4;i++)
for(int j=0;j<2;j++)
u[i+y][j+x]=c;
}
q=u[ys][xs];
p=0;
ret(xs,ys);
if(p>0)
printf("OK\n");
else printf("NG\n");
}
return 0;
} | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#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>
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 R, G;
io.read(R, G);
cout << G + G - R;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
char S;
int mix=0;
int a=0;
for(int i=0; i<3;i++){
cin >> S;
if (S=='R'){
a++;
mix=max(a,mix);
} else {
a=0;
}
}
cout << mix << endl;
} | 0 |
#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 all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define yn(x, ok, ng) cout << ((x)?(ok):(ng)) << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
ll 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 const INF = 1001001001;
struct BipartiteMatching {
vector< vector< int > > graph;
vector< int > match, alive, used;
int timestamp;
BipartiteMatching(int n) : graph(n), alive(n, 1), used(n, 0), match(n, -1), timestamp(0) {}
void add_edge(int u, int v) {
graph[u].push_back(v);
graph[v].push_back(u);
}
bool dfs(int idx) {
used[idx] = timestamp;
for(auto &to : graph[idx]) {
int to_match = match[to];
if(alive[to] == 0) continue;
if(to_match == -1 || (used[to_match] != timestamp && dfs(to_match))) {
match[idx] = to;
match[to] = idx;
return true;
}
}
return false;
}
int bipartite_matching() {
int ret = 0;
for(int i = 0; i < graph.size(); i++) {
if(alive[i] == 0) continue;
if(match[i] == -1) {
++timestamp;
ret += dfs(i);
}
}
return ret;
}
void output() {
for(int i = 0; i < graph.size(); i++) {
if(i < match[i]) {
cout << i << "-" << match[i] << endl;
}
}
}
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vi a(n),b(n),c(n),d(n);
rep(i,n) cin >> a[i] >> b[i];
rep(i,n) cin >> c[i] >> d[i];
BipartiteMatching bm(2*n);
rep(i,n) {
rep(j,n) {
if(a[i] < c[j] && b[i] < d[j]) bm.add_edge(i, n+j);
}
}
cout << bm.bipartite_matching() << endl;
return 0;
} | #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;
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#define MAX 2000200
#define MIN -2000000300
#define INF 1<<30
using namespace std;
int n;
int A[1000][1000];
int d[1000];
bool used[1000];
void Init(int n){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
A[i][j] = INF;
}
}
}
int prime(){
for(int i=0;i<n;i++){
d[i] = INF;
used[i]=false;
}
int ans=0;
d[0] = 0;
while(true){
int v = -1;
for(int i=0;i<n;i++){
if(!used[i] && (v == -1 || d[v] > d[i]))v = i;
}
if(v == -1)break;
ans+=d[v];
used[v] = true;
for(int i=0;i<n;i++){
d[i] = min(d[i],A[v][i]);
}
}
return ans;
}
int main(){
scanf("%d",&n);
// Init(n);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
scanf("%d",&A[i][j]);
if(A[i][j] == -1)A[i][j] = INF;
}
}
printf("%d\n",prime());
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int P[10010];
void init(int N){
for (int i=0; i<N; i++) P[i] = i;
}
int root (int a){
if (P[a] == a) return a;
else {
P[a] = root(P[a]);
return P[a];
}
}
bool is_same_set(int a, int b){
return root(a) == root(b);
}
void unite(int a, int b){
P[root(a)] = root(b);
}
int main(){
int N;
cin >> N;
pair <int, int> edge[10010];
for (int i=0; i<N; i++){
for (int j=0; j<N; j++){
cin >> edge[i*N+j].first;
edge[i*N+j].second = i*N+j;
}
}
sort(edge, edge+N*N);
init(N);
int ans = 0;
int b = 0;
for (int k=0; k<N*N; k++){
while(edge[k].first < 0) k++;
int i = edge[k].second / N;
int j = edge[k].second % N;
if (is_same_set(i,j)){}
else{
unite(i,j);
ans += edge[k].first;
}
}
cout << ans << endl;
} | 1 |
#include <iostream>
#include<map>
using namespace std;
const int maxn = 2e6 + 10;
typedef pair<int, int> P;
int fa[maxn], ma[maxn];
void init(int n)
{
for (int i = 0; i <= n; ++i)
{
fa[i] = i;
ma[i] = i;
}
}
int find(int* fa, int x)//找到根节点
{
if (fa[x] == x)
{
return fa[x];
}
return fa[x] = find(fa, fa[x]);
}
void unin(int a, int b, int* fa)
{
a = find(fa, a);//找到a根节点
b = find(fa, b);//找到b跟节点
fa[a] = b;//a为b的父节点
}
map<P, int>ans;
int main()
{
int n, k, l;
while (scanf("%d%d%d", &n, &k, &l) != EOF)
{
init(n);
ans.clear();
for (int i = 0; i < k; ++i)
{
int a, b;
scanf("%d%d", &a, &b);
unin(a, b, ma);
}
for (int i = 0; i < l; ++i)
{
int a, b;
scanf("%d%d", &a, &b);
{
unin(a, b, fa);
}
}
for (int i = 1; i <= n; ++i)
{
ans[make_pair(find(ma, i), find(fa, i))]++;
}
for (int i = 1; i <= n; ++i)
{
i == n ? printf("%d\n", ans[make_pair(find(ma, i), find(fa, i))]) : printf("%d ", ans[make_pair(find(ma, i), find(fa, i))]);
}
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
int main() {
int n;
while (~scanf("%d", &n)) {
if (n == 0) break;
std::vector<unsigned int> v;
std::map<unsigned int, unsigned long long int> m;
unsigned int a;
unsigned long long int b, c;
for (int i = 0; i < n; ++i) {
scanf("%u %llu %llu", &a, &b, &c);
v.push_back(a);
m[a] += b * c;
}
std::set<unsigned int> dup;
bool found = false;
for (auto i : v) {
if (m[i] >= 1000000 && dup.count(i) == 0) {
printf("%u\n", i);
dup.insert(i);
found = true;
}
}
if (!found) {
printf("NA\n");
}
}
} | 0 |
#include <cstdio>
typedef long long lint;
int const N=1e5+10;
int n,a[N];
int gcd(int x,int y)
{
if(x==-1 || y==-1) return -x*y;
if(x==0) return y;
else return gcd(y%x,x);
}
int g1[N],g2[N];
int main()
{
scanf("%d",&n);
lint sum=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum+=a[i];
if(n%2==0)
{
if(sum%2==1) printf("First");
else printf("Second");
return 0;
}
if(sum%2==0) {printf("First"); return 0;}
int cur=0;
while(true)
{
bool flag=false;
sum=0;
for(int i=1;i<=n;i++) sum+=a[i];
g1[0]=-1; g2[n+1]=-1;
for(int i=2;i<=n;i++) g1[i]=gcd(g1[i-1],a[i]);
for(int i=n-1;i>=1;i--) g2[i]=gcd(g2[i+1],a[i]);
int g;
for(int i=1;i<=n&&!flag;i++)
{
if(a[i]==1) continue;
g=gcd(gcd(g1[i-1],g2[i+1]),a[i]-1);
if(((sum-1)/g)%2==1) flag=true;
}
if(flag)
for(int i=1;i<=n;i++) a[i]/=g;
else
{
if(cur==0) printf("Second");
else printf("First");
return 0;
}
cur^=1;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
inline int read()
{
int data = 0, w = 1;
char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
}
const int N(100010);
int a[N], cnt[2], n;
void trans()
{
for (int i = 1; i <= n; i++) if (a[i] & 1) --a[i]; int g = a[1];
for (int i = 2; i <= n; i++) g = std::__gcd(g, a[i]);
for (int i = 1; i <= n; i++) a[i] /= g;
}
int check()
{
cnt[0] = cnt[1] = 0;
for (int i = 1; i <= n; i++) ++cnt[a[i] & 1];
if (cnt[0] & 1) return 1; else if (cnt[1] > 1) return 0;
else
{
for (int i = 1; i <= n; i++) if (a[i] == 1) return cnt[0] & 1;
return trans(), check() ^ 1;
}
}
int main()
{
n = read();
for (int i = 1; i <= n; i++) a[i] = read();
puts(check() ? "First" : "Second");
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
const LL MOD = 1e9 + 7;
LL dp[10005][105][2], D;
vector<int> arr;
LL solve(int i, int d, int op) {
if (i == -1) return d == 0;
if (~dp[i][d][op]) return dp[i][d][op];
dp[i][d][op] = 0;
int up = op ? arr[i] : 9;
for (int k = 0 ; k <= up ; k++)
(dp[i][d][op] += solve(i - 1, (d + k) % D, op && (k == arr[i]))) %= MOD;
return dp[i][d][op];
}
void marmot0814() {
string s; cin >> s >> D;
for (auto &c : s)
arr.push_back(c - '0');
reverse(arr.begin(), arr.end());
memset(dp, -1, sizeof(dp));
cout << (solve(arr.size() - 1, 0, 1) + MOD - 1) % MOD << '\n';
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int t = 1, kase = 0; // cin >> t;
while (t--) {
// cout << "Case #" << ++kase << ":";
marmot0814();
}
} | #include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using usize = std::size_t;
i32 a[200000];
auto main() -> i32 {
i32 n, k;
scanf("%d%d", &n, &k);
for (i32 i = 0; i < n; i += 1) {
scanf("%d", a + i);
}
i32 b[200001];
for (i32 step = 0; step < std::min(64, k); step += 1) {
std::fill(b, b + n + 1, 0);
for (i32 i = 0; i < n; i += 1) {
b[std::max(0, i - a[i])] += 1;
b[std::min(n, i + a[i] + 1)] -= 1;
}
a[0] = b[0];
for (i32 i = 1; i < n; i += 1) {
b[i] += b[i - 1];
a[i] = b[i];
}
}
for (i32 i = 0; i < n; i += 1) {
printf("%d%c", a[i], i == n - 1 ? '\n' : ' ');
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T;
char c = 'W';
for (int i = 0; i < N * 2; i++){
if (S[i] != c){
T += 'L';
c = 'B' + 'W' - c;
} else {
T += 'R';
c = 'B' + 'W' - c;
}
}
int cnt = 0;
for (int i = 0; i < N * 2; i++){
if (T[i] == 'L'){
cnt++;
}
}
if (cnt != N){
cout << 0 << endl;
} else {
int L = 0;
long long ans = 1;
for (int i = 0; i < N * 2; i++){
if (T[i] == 'L'){
L++;
} else {
ans *= L;
ans %= MOD;
L--;
}
}
for (int i = 1; i <= N; i++){
ans *= i;
ans %= MOD;;
}
cout << ans << endl;
}
} | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x, std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 1000000007;
ll power(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x *= x; p /= 2; } else { a *= x; p--; } }return a; }
ll mpower(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x = x * x % mod; p /= 2; } else { a = a * x % mod; p--; } }return a; }
ll ac(ll n, ll k) { ll a = 1; rep(i, 1, k) { a *= n - i + 1; a /= i; }return a; }
ll mc(ll n, ll m) { ll k = 1, l = 1; rep(i, n - m + 1, n + 1) k = k * i % mod; rep(i, 1, m + 1) l = l * i % mod; l = mpower(l, mod - 2); return k * l % mod; }
typedef struct {
int y, x, y2, x2;
}p4;
int main()
{
int h, w;
ll M = 0;
vector<p4> k;
string ans = "";
cin >> h >> w;
vector<vector<int>> c(h, vector<int>(w));
rep(i, 0, h) {
rep(i2, 0, w) {
cin >> c[i][i2];
}
}
int x, y, px = -1, py;
rep(i, 0, h) {
rep(i2, 0, w) {
y = i, x = i % 2 ? (w - i2 - 1) : i2;
if (px != -1 && c[py][px] % 2) {
c[py][px]--;
c[y][x]++;
k.push_back({py+1,px+1, y+1, x+1});
M++;
}
px = x, py = y;
}
}
printf("%lld\n", M);
for (auto it : k) {
printf("%d %d %d %d\n", it.y, it.x, it.y2, it.x2);
}
return 0;
}
| 0 |
#include <iostream>
using namespace std;
int prime_number(int n){
int i;
if(n<=1) return 0;
for(i=2;i<=n/2;i++) if(n%i==0) return 0;
return 1;
}
int main(){
int i,j,k,n[10000],a=0;
for(j=0;j<10000;j++){
cin >> n[j];
if(n[j]==0) break;
}
for(k=0;k<j;k++){
for(i=n[k];i>4;i--) if(prime_number(i)) if(prime_number(i-2)){
a=i;
break;
}
if(a!=0) cout << i-2 << " " << i << endl;
}
return 0;
}
| #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#define ll long long int
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
using namespace std;
int mx4[] = {0,1,0,-1};
int my4[] = {1,0,-1,0};
int mx2[] = {1,0};
int my2[] = {0,1};
class CXYetAnotherDieGame {
public:
void solve(istream& in, ostream& out) {
ll x;
in >> x;
if(x <= 6) out << 1 << endl;
else if(x % 11 > 6) out << (x / 11) * 2 + 2 << endl;
else if(x % 11 <= 6 && x % 11 != 0) out << (x / 11) * 2 + 1 << endl;
else if(x % 11 == 0) out << (x / 11) * 2 << endl;
}
};
int main() {
CXYetAnotherDieGame solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
#define LINF 1e18
#define mod 1e9+7
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n; cin >> n;
vector<int> p(n);
rep(i,n) cin >> p[i];
int mini = n+1;
int ans = 0;
rep(i,n) {
if (p[i] <= mini) {
mini = p[i];
ans++;
}
}
cout << ans << endl;
} | ////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - [email protected]
#include<bits/stdc++.h>
using namespace std;
#define E end()
#define B begin()
#define sz size()
#define EM empty()
#define fi first
#define se second
#define cl clear()
#define sqr(a) (a*a)
#define mk make_pair
#define po pop()
#define pu push
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
string en="\n";
string sp=" ";
string t="hello";
string Y="YES\n";
string N="NO\n";
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define per(i,n) for(i=n-1;i>=0;i--)
#define peR(i,n) for(i=n;i>0;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define all(cont) cont.begin(),cont.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define pi 3.1415926535897932384626433832795
#define vi vector<long long>
#define vs vector<string>
#define MX LLONG_MAX
#define MN LLONG_MIN
#define MOD 1000000007
#define vp(vi,x) cin>>x; vi.pb(x);
#define bsearch(a,x) binary_search(all(a),x)
#define LB(a,x) (lower_bound(all(a),x)-a.B)
#define UB(a,x) (upper_bound(all(a),x)-a.B)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
bool isprm(LL a){if(a==1)return false; for(LL i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
bool palin(string a){for(int i=0;i<a.sz;i++){if(a.at(i)!=a.at(a.sz-i-1))return 0;} return 1;}
bool isVowel(char ch){ ch=toupper(ch); if(ch=='A'||ch=='U'||ch=='I'||ch=='O'||ch=='E') return true; return false;}
int toInt(string s){int sm;stringstream ss(s);ss>>sm;return sm;}
LL ceil2(LL a,LL b){LL c=a/b; if(a%b)c++; return c; }
LL bpow(LL a,LL b){if(b==0)return 1;LL r=bpow(a,b/2);if(b%2)return r*r*a;else return r*r;}
LL binpow(LL a,LL b){LL r=1;while(b>0){if(b&1)r=r*a;a=a*a;b>>=1;}return r;}
LL binpow(LL a,LL b,LL m){a%=m;LL r=1;while(b>0){if(b&1) r=r*a%m;a=a*a%m; b>>=1;}return r;}
template<typename T>inline T gcd(T a,T b){if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<typename T>inline T lcm(T a,T b) {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
int main()
{
// fast;
LL i,j,k,n,m,l,s=0,x,y,tc=1,p,q,a,b,c=0;
bool f=0,ff=0;string st,s1,s2,s3; char ch;
while(cin>>n)
{
c=0,a=MX;
rep(i,n)
{
cin>>x;
if(x<a)c++,a=x;
}
cout<<c<<en;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;
using namespace std;
/*
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
*/
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
#define mod 100003
//1e9+7
#define pll pair<ll,ll>
#define pii pair<int,int>
#define piii pair<int,pii>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FO ifstream fin("a.in");ofstream fout("a.out");
#define TEST int testcase;cin>>testcase;while(testcase--)
#define all(x) (x).begin(),(x).end()
#define mset0(x) memset((x), 0, sizeof((x)));
#define mset1(x) memset((x), -1, sizeof((x)));
#define endl "\n"
#define plll pair<ll,pll>
#define piiii pair<int,piii>
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
FO
#define no {cout<<"NO"<<endl;return;}
#define yes {cout<<"YES"<<endl;return;}
void solve(){
int n,k;
cin>>n>>k;
long double maxx=0,sum=0;
long double p[n+1];
for(int i=1;i<=n;i++) cin>>p[i];
for(int i=1;i<=k;i++){
sum+=0.5*(p[i]+1);
}
maxx=max(maxx,sum);
for(int j=k+1;j<=n;j++){
//cout<<i<<" "<<j<<endl;
sum-=0.5*(p[j-k]+1);
sum+=0.5*(p[j]+1);
maxx=max(maxx,sum);
}
cout<<setprecision(12)<<maxx;
return;
}
int main(){
IO
//TEST
solve();
return(0);
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(){
ios::sync_with_stdio(false);
int n,k;
cin >> n >> k;
vector<int> p(n);
rep(i,n) {
cin >> p[i];
}
vector<int> s(n-k+1,0);
rep(i,k) s[0] += p[i];
rep(i,n-k) s[i+1] = s[i] - p[i] + p[i+k];
int ans = 0;
rep(i,n-k+1) chmax(ans, s[i]);
cout << std::fixed << (ans+k)/2.0 << endl;
}
| 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define eprintf(...) 42
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
clock_t startTime;
double getCurrentTime() {
return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const ll MOD = (ll)1e9 + 7;
ll add(ll x, ll y) {
x += y;
if (x >= MOD) return x - MOD;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0) return x + MOD;
return x;
}
ll mult(ll x, ll y) {
return (x * y) % MOD;
}
ll bin_pow(ll x, ll p) {
if (p == 0) return 1;
if (p & 1) return mult(x, bin_pow(x, p - 1));
return bin_pow(mult(x, x), p / 2);
}
ll rev(ll x) {
return bin_pow(x, MOD - 2);
}
const int N = (1 << 16) + 7;
int dp[2][N];
int n, m, W;
void read() {
int x, y, z;
scanf("%d%d%d%d", &n, &x, &y, &z);
m = x + y + z - 1;
W = (1 << (x + y + z - 1)) ^ (1 << (y + z - 1)) ^ (1 << (z - 1));
}
int main()
{
startTime = clock();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
read();
dp[0][0] = 1;
while(n--) {
for (int i = 0; i <= (1 << m); i++)
dp[1][i] = 0;
dp[1][1 << m] = add(dp[1][1 << m], mult(dp[0][1 << m], 10));
for (int mask = 0; mask < (1 << m); mask++) {
for (int x = 1; x <= 10; x++) {
int nmask = (mask << x) ^ (1 << (x - 1));
if ((nmask & W) == W)
nmask = 1 << m;
else
nmask &= (1 << m) - 1;
dp[1][nmask] = add(dp[1][nmask], dp[0][mask]);
}
}
for (int i = 0; i <= (1 << m); i++)
dp[0][i] = dp[1][i];
}
printf("%d\n", dp[0][1 << m]);
return 0;
}
| #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>
using namespace std;
#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
int main()
{
vi w(10),k(10);
rep(i,10)
cin>>w[i];
rep(i,10)
cin>>k[i];
sort(allof(w),greater<int>());
sort(allof(k),greater<int>());
cout<<accumulate(allof(w)-7,0)<<" "<<accumulate(allof(k)-7,0)<<endl;
return 0;
} | 0 |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
string ans = "-1 -1 -1";
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N; ++j) {
int k = N - j - i;
if (k < 0) continue;
if (i * 10000 + j * 5000 + k * 1000 == Y) {
ans = to_string(i) + ' ' + to_string(j) + ' ' + to_string(k);
break;
}
}
if (ans != "-1 -1 -1") break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
string x,y;
int sum = 0;
for(;a<=b;a++){
y = x = to_string(a);
reverse(y.begin(),y.end());
if(x==y) sum++;
}
cout<<sum;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, LOG = 30;
int A[N], B[N], cnt[N], f[N], w[N], n;
bool a[N], b[N];
void Check() {
int curr = 0;
for (int i = 2; i <= n; i ++) {
while (curr && b[curr] != b[i - 1]) curr = f[curr];
if (b[curr] == b[i - 1]) curr++;
f[i] = curr;
}
curr = 0;
for (int i = 1; i <= n; i++) {
while (curr && b[curr] != a[i - 1]) curr = f[curr];
if (b[curr] == a[i - 1]) curr++;
}
memset(w, 0, sizeof w);
while (curr) w[curr] = 1, curr = f[curr];
w[0] = 1;
for (int i = 2; i <= n; i ++) {
while (curr && a[curr] != a[i - 1]) curr = f[curr];
if (a[curr] == a[i - 1]) curr++;
f[i] = curr;
}
curr = 0;
for (int i = 1; i <= n; i++) {
while (curr && a[curr] != b[i - 1]) curr = f[curr];
if (a[curr] == b[i - 1]) curr++;
}
while (curr) {
if (w[n - curr] == 1) cnt[curr]++;
curr = f[curr];
}
if (w[n] == 1) cnt[0]++;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> A[i];
for (int i = 0; i < n; i++) cin >> B[i];
for (int j = 0; j < LOG; j++) {
for (int i = 0; i < n; i++) a[i] = (A[i]>>j)&1, b[i] = (B[i]>>j)&1;
Check();
for (int i = 0; i < n; i++) a[i] ^= 1;
Check();
}
for (int i = 0; i < n; i++) if (cnt[i] == LOG) cout << i << " " << (A[i]^B[0]) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
constexpr int B = 100000007;
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
cout << (expr ? "Yes" : "No") << "\n";
}
lint power(lint x, lint n, lint mod) {
lint ret = 1;
while(n > 0) {
if(n & 1) (ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vector<lint> a(N);
REP(i, N) cin >> a[i];
vector<lint> b(N);
REP(i, N) cin >> b[i];
vector<lint> pa(N);
vector<lint> pb(N);
REP(i, N) {
pa[i] = a[i] ^ a[(i+1)%N];
pb[i] = b[i] ^ b[(i+1)%N];
}
lint hash = 0;
lint target = 0;
REP(i, N) {
hash = (hash + pa[i]*power(B, i, MOD)) % MOD;
target = (target + pb[i]*power(B, i, MOD)) % MOD;
}
vector<pair<lint, lint>> ans;
REP(i, N) {
//cout << hash << " " << target << endl;
if(hash == target) {
lint x = b[0] ^ a[i];
ans.push_back(make_pair(i, x));
}
hash = hash * power(B, MOD-2, MOD) % MOD;
hash = (hash - pa[i]*power(B, MOD-2, MOD) % MOD + pa[i]*power(B, N-1, MOD) + MOD) % MOD;
}
sort(ans.begin(), ans.end(), [](auto const &a, auto const &b) { return a.first < b.first; });
REP(i, ans.size()) {
cout << ans[i].first << " " << ans[i].second << "\n";
}
} | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
}
const int N(2e5 + 10), Mod(1e9 + 7);
int fac[N], inv[N], f[N], n, m, A, B;
int C(int n, int m) { return 1ll * fac[n + m] * inv[m] % Mod * inv[n] % Mod; }
int fastpow(int x, int y)
{
int ans = 1;
for (; y; y >>= 1, x = 1ll * x * x % Mod)
if (y & 1) ans = 1ll * ans * x % Mod;
return ans;
}
int main()
{
n = read() - 1, m = read() - 1, A = read() - 1, B = read() - 1, fac[0] = inv[0] = 1;
if (A == n || B == m) return puts("0"), 0;
for (int i = 1; i <= n + m; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
inv[n + m] = fastpow(fac[n + m], Mod - 2);
for (int i = n + m - 1; i; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % Mod;
int ans = C(n, m);
for (int i = 0; i <= A; i++)
ans = (ans - 1ll * C(i, m - B - 1) * C(n - i, B) % Mod + Mod) % Mod;
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int wh, bk; cin >> wh >> bk;
int h = 100 / 2, w = 100;
cout << h * 2 << " " << w << endl;
auto func = [&](char c0, char c1, int cnt) {
vector<string> s(h, string(w, c0));
for (int i = 1; i < h - 1; i += 2) for (int j = 0; j < w; j += 2) {
if (cnt) s[i][j] = c1, cnt--;
}
for (auto &si: s) cout << si << endl;
};
func('.', '#', bk - 1);
func('#', '.', wh - 1);
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll) (x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#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 ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
#define int ll
// #define ll int
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll MAX = 2100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[8] ={1,0,-1,0,1,-1,1,-1};
ll dy[8] ={0,1,0,-1,1,-1,-1,1};
template<class T>
inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>
inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve(){
ll n;
ll x[200010],y[200010];
char u[200010];
set<ll> v[200010],w[200010];
ll ans=LLINF;
cin>>n;
rep(i,n){
cin>>x[i]>>y[i]>>u[i];
}
rep(i,n){
if(u[i]=='D') v[x[i]].insert(y[i]);
else if(u[i]=='L') w[y[i]].insert(x[i]);
}
rep(i,n){
if(u[i]=='U'){
if(v[x[i]].lower_bound(y[i])==v[x[i]].end()) continue;
ll z=*v[x[i]].lower_bound(y[i]);
chmin(ans,(z-y[i])*5);
}
else if(u[i]=='R'){
if(w[y[i]].lower_bound(x[i])==w[y[i]].end()) continue;
ll z=*w[y[i]].lower_bound(x[i]);
chmin(ans,(z-x[i])*5);
}
}
set<pll> a[400010],b[400010];
set<pll> c[400010],d[400010];
rep(i,n){
ll X=x[i]+y[i],Y=x[i]-y[i]+200000;
if(u[i]=='U'){
a[X].insert({x[i],y[i]});
}
else if(u[i]=='D'){
c[Y].insert({x[i],y[i]});
}
else if(u[i]=='L'){
b[X].insert({x[i],y[i]});
d[Y].insert({x[i],y[i]});
}
}
rep(i,n){
ll X=x[i]+y[i],Y=x[i]-y[i]+200000;
if(u[i]=='R'){
if(a[X].lower_bound({x[i],y[i]})==a[X].end()){}
else {
pll z=*a[X].lower_bound({x[i],y[i]});
chmin(ans,(y[i]-z.sc+z.fi-x[i])*5);
}
if(c[Y].lower_bound({x[i],y[i]})==c[Y].end()){}
else {
pll z=*c[Y].lower_bound({x[i],y[i]});
chmin(ans,(z.sc-y[i]+z.fi-x[i])*5);
}
}
else if(u[i]=='U'){
if(d[Y].lower_bound({x[i],y[i]})==d[Y].end()){}
else{
pll z=*d[Y].lower_bound({x[i],y[i]});
chmin(ans,(z.fi-x[i]+z.sc-y[i])*5);
}
}
else if(u[i]=='D'){
if(b[X].lower_bound({x[i],y[i]})==b[X].end()){}
else {
pll z=*b[X].lower_bound({x[i],y[i]});
chmin(ans,(z.fi-x[i]+y[i]-z.sc)*5);
}
}
}
if(ans==LLINF) cout<<"SAFE"<<endl;
else cout<<ans<<endl;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| // This code wrote by chtholly_micromaker(MicroMaker)
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define reg register
using namespace std;
const int MaxN=2050;
const int dir[4][2]={1,0,0,1,-1,0,0,-1};
template <class t> inline void read(t &s)
{
s=0;
reg int f=1;
reg char c=getchar();
while(!isdigit(c))
{
if(c=='-')
f=-1;
c=getchar();
}
while(isdigit(c))
s=(s<<3)+(s<<1)+(c^48),c=getchar();
s*=f;
return;
}
char G[MaxN][MaxN];
int f[MaxN][MaxN],g[MaxN][MaxN],h[MaxN][MaxN];
int n,m;
signed main(void)
{
// freopen("big.in","r",stdin);
int q;
cin>>n>>m>>q;
for(int i=1;i<=n;++i)
scanf("%s",G[i]+1);
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
{
f[i][j]=f[i-1][j]+f[i][j-1]-f[i-1][j-1]+(G[i][j]=='1'?1:0);
g[i][j]=g[i-1][j]+g[i][j-1]-g[i-1][j-1];
h[i][j]=h[i-1][j]+h[i][j-1]-h[i-1][j-1];
if(G[i][j]=='1')
{
if(G[i-1][j]=='1')
++g[i][j];
if(G[i][j-1]=='1')
++h[i][j];
}
}
reg int U,V,X,Y;
for(int qq=0;qq<q;++qq)
{
read(U);read(V);read(X);read(Y);
reg int ans=f[X][Y]-f[U-1][Y]-f[X][V-1]+f[U-1][V-1];
// printf("t1 %d\n",f[X][Y]-f[U-1][Y]-f[X][V-1]+f[U-1][V-1]);
ans-=g[X][Y]-g[U][Y]-g[X][V-1]+g[U][V-1];
// printf("t2 %d\n",g[X][Y]-g[U][Y]-g[X][V-1]+g[U][V-1]);
ans-=h[X][Y]-h[U-1][Y]-h[X][V]+h[U-1][V];
// printf("t3 %d\n",h[X][Y]-h[U-1][Y]-h[X][V]+h[U-1][V]);
printf("%d\n",ans);
}
return 0;
}
| 0 |
#include<iostream>
using namespace std;
int a;
int main() {
while (cin >> a) {
cout << (900 - a)*(900 - a) * 100 - 9000000 << endl;
}
} | #include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int f(int x) {
return x * x;
}
int main() {
int d;
int D = 600;
while (cin >> d) {
int s = 0;
for (int i = 1; i * d < D; i++)
s += f(i * d) * d;
cout << s << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
int a, b, c, d, e, k;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> a >> b >> c >> d >> e >> k;
bool flg = true;
if(e - a > k) {
flg = false;
}
if(flg) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
//#include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
//printf("%.10f\n", n);
ll yo[12345678], ta[12345678];
signed main() {
ll n = 0, m;
string s; cin >> s;
if (s.size() % 2 == 1) { cout << "No" << endl; return 0; }
for (int h = 0; h < s.size(); h++) {
if (h % 2 == 0) {
if (s[h] != 'h') { n++; }
}
else {
if (s[h] != 'i') { n++; }
}
}
if (n == 0) { cout << "Yes" << endl; }
else { cout << "No" << endl; }
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
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;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>; // クラスカル法とかで、{cost, {from, to}}的に使う。
const ll INF = 1001001001001001001;
const double pi = acos(-1);
int main()
{
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
//左からi個取り出す
//右からj個取り出す
ll ans = 0;
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n; j++)
{
if (i + j > k || i + j > n)
{
break;
}
ll tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int l = 0; l < i; l++)
{
tmp += v[l];
que.push(v[l]);
}
for (int l = 0; l < j; l++)
{
tmp += v[n - 1 - l];
que.push(v[n - 1 - l]);
}
for (int l = 0; l < k - i - j; l++)
{
if (que.empty())
{
break;
}
int x = que.top();
if (x >= 0)
{
break;
}
que.pop();
tmp -= x;
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
//ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
////Read:
//Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),
int n,c,dp[55][55][55][55];
vi v;
int f(int i,int cnt,int mxgap,int lst){
if(i==n){
mxgap=max(mxgap,i-lst-1);
if(cnt+(n-cnt-mxgap)*2<=c)return 0;
return -INF;
}
int &ans=dp[i][cnt][mxgap][lst+1];
if(ans!=-INF)return ans;
ans=v[i]+f(i+1,cnt+1,max(mxgap,i-lst-1),i);
ans=max(ans,f(i+1,cnt,mxgap,lst));
return ans;
}
signed main(){
FASTER;
cin>>n>>c;
v=vi(n);cin>>v;
for(int i=0;i<55;i++){
for(int j=0;j<55;j++){
for(int k=0;k<55;k++){
for(int l=0;l<55;l++){
dp[i][j][k][l]=-INF;
}
}
}
}
cout<<f(0,0,0,-1);
}
| 1 |
#include <iostream>
#include <regex>
using namespace std;
int main() {
string S;
cin >> S;
cout << (regex_search(S.begin(), S.end(), regex("AC")) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"A"下一个是不是"C"
{
cout<<"Yes"<<endl;
break; //跳出循环
}
pos++; //下一次从pos+1找起
}
return 0;
} | 1 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <math.h> // sqrt
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <iomanip> // setprecision
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int N;
int f(vector<vector<pair<int, int>>> &data, vi &bit, int n) {
if (n == 0) {
int ans = 0;
bool check = false;
for (int i = 0; i < N; i++) {
if (bit[i] == 0) {
continue;
}
ans++;
for (pair<int, int> p : data[i]) {
if (bit[p.first - 1] != p.second) {
return 0;
}
}
}
return ans;
}
bit[N - n] = 1;
int a = f(data, bit, n - 1);
bit[N - n] = 0;
int b = f(data, bit, n - 1);
return max(a, b);
}
int main() {
cin >> N;
vi a(N);
vector<vector<pair<int, int>>> data(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
vector<pair<int, int>> v(a[i]);
for (int j = 0; j < a[i]; j++) {
int x, y;
cin >> x >> y;
v[j] = {x, y};
}
data[i] = v;
}
vi bit(N, 0);
int ans = f(data, bit, N);
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
#define N 8
bool row[N], col[N], dpos[2 * N - 1], dneg[2 * N - 1];
bool X[N][N];
void print_board() {
rep(i, 0, N) {
rep(j, 0, N) {
if (X[i][j])cout << 'Q';
else cout << '.';
}
cout << endl;
}
}
void dfs(int i) {
if (i == N) {
print_board();
return;
}
rep(j, 0, N) {
if (X[i][j]) {
dfs(i + 1);
return;
}
}
rep(j, 0, N) {
if (row[i] || col[j] || dpos[i + j] || dneg[i - j + N - 1])continue;
X[i][j] = true;
row[i] = col[j] = dpos[i + j] = dneg[i - j + N - 1] = true;
dfs(i + 1);
X[i][j] = false;
row[i] = col[j] = dpos[i + j] = dneg[i - j + N - 1] = false;
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
rep(i, 0, n) {
int y, x; cin >> y >> x;
X[y][x] = true;
row[y] = col[x] = dpos[y + x] = dneg[y - x + N - 1] = true;
}
dfs(0);
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
void fnInput(int &rnMaxSiz, vector<int> &rvnNum)
{
cin >> rnMaxSiz;
rvnNum.resize(rnMaxSiz);
for (int i = 0; i < rnMaxSiz; i++)
cin >> rvnNum[i];
}
void fnPartition(vector<int> &rvnNum, int nStart, int nEnd, int &nCur)
{
for (int i = nStart; i < nEnd; i++)
if (rvnNum[i] <= rvnNum[nEnd])
swap(rvnNum[nCur++], rvnNum[i]);
swap(rvnNum[nCur], rvnNum[nEnd]);
}
void fnResult(const vector<int> &cnrvnNum, int nCur)
{
for (int i = 0; i < cnrvnNum.size(); i++)
{
if (i) cout << " ";
if (i == nCur) cout << "[";
cout << cnrvnNum[i];
if (i == nCur) cout << "]";
}
cout << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int nMaxSiz;
vector<int> vnNum;
fnInput(nMaxSiz, vnNum);
int nStart = 0;
int nEnd = vnNum.size() - 1;
int nCur = nStart;
fnPartition(vnNum, nStart, nEnd, nCur);
fnResult(vnNum, nCur);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
int partition(vector<int>&a, int l, int r) {
int v = a[r];
int i(l - 1);
rep(j, l, r) {
if (a[j] <= v) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> v(N); rep(i, 0, N) { cin >> v[i]; }
int x = partition(v, 0, N - 1);
rep(i, 0, N) {
if (i == x)cout << '[' << v[i] << ']';
else cout << v[i];
cout << (i == N - 1 ? '\n' : ' ');
}
return 0;
} | 1 |
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
int main(){
int N,Q,M,Date[101],i,l,k;
while(0<=scanf("%d%d",&N,&Q)){
for(i=0;i<101;i++){
Date[i]=0;
}
if((N==0) && (Q==0)){
break;
}
for(k=0;k<N;k++){
scanf("%d",&M);
if(M==0){
continue;
}else{
for(i=0;i<M;i++){
scanf("%d",&l);
++Date[l];
}
}
}
l=0;
i=0;
for(k=0;k<100;k++){
if(i<Date[k] && Date[k]>=Q){
i=Date[k];
l=k;
}
}
printf("%d\n",l);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
char m[50][50];
int dist[100][100];
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
int main() {
int h,w;
cin >> h >> w;
int numOfW = 0;
rep(i,h) rep(j,w) {
cin >> m[i][j];
if (m[i][j] == '.') numOfW++;
}
rep(i,h) rep(j,w) dist[i][j] = -1;
queue<P> q;
q.push({0,0});
dist[0][0] = 1;
while (!q.empty())
{
P p = q.front(); q.pop();
int x = p.first, y = p.second;
rep(i,4) {
int nx = x+dx[i], ny = y+dy[i];
if (nx<0||nx>=h||nx<0||ny>=w) continue;
if (m[nx][ny]=='#'||dist[nx][ny]!=-1) continue;
dist[nx][ny] = dist[x][y] + 1;
q.push({nx,ny});
}
}
if (dist[h-1][w-1] == -1) cout << -1 << endl;
else cout << numOfW - dist[h-1][w-1] << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2 * 1e5;
ll bpow(ll a, ll b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int n;
map<int, int> compressed, cnt;
bitset<N> isHalf, halfCon;
set<int> halves;
vi conn[N];
int depth[N];
int ans = 0;
void count(int v, int m) {
if (isHalf[v] && m) return;
if (halfCon[v] && m) return;
if (!cnt[v]) return;
for (int u : conn[v]) {
if (isHalf[u] || !cnt[u]) continue;
if (halfCon[u] && m) return;
int lim = min(cnt[u], cnt[v]);
cnt[u] -= lim, cnt[v] -= lim;
ans += lim;
}
if (isHalf[v]) {
ans += cnt[v] / 2;
cnt[v] %= 2;
}
}
struct Comp
{
// Compare 2 Player objects using name
bool operator ()(const int& a, const int& b)
{
if (halfCon[a]) return false;
if (halfCon[b]) return true;
return depth[a] <= depth[b];
}
};
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
vi a(n);
rep(i, 0, n) {
cin >> a[i];
compressed[a[i]];
}
int pos = 0;
for (auto& x : compressed) {
if (!(bpow(2, ceil(log2(x.first))) - x.first)) {
isHalf[pos] = 1;
halves.insert(pos);
}
x.second = pos++;
}
rep(i, 0, n) {
a[i] = compressed[a[i]];
++cnt[a[i]];
}
for (pii i : compressed) {
ll nxt = bpow(2, ceil(log2(i.first))) - i.first;
if (nxt != i.first && compressed.count(nxt)) {
conn[i.second].push_back(compressed[nxt]);
conn[compressed[nxt]].push_back(i.second);
}
}
queue<int> q, rq;
vector<bool> vis(pos, false);
rep(i, 0, pos) {
if (sz(conn[i]) == 1) {
q.push(i);
vis[i] = true;
}
}
while (!q.empty()) {
int v = q.front();
rq.push(v);
q.pop();
for (auto u : conn[v]) {
if (!vis[u]) {
q.push(u);
depth[u] = depth[v] + 1;
vis[u] = true;
}
}
}
halfCon.reset();
set<int> semiHalves;
for (int i : halves) {
for (int u : conn[i]) {
halfCon[u] = true;
semiHalves.insert(u);
}
}
rep(i, 0, n) {
sort(all(conn[i]), Comp());
}
while (!rq.empty()) {
int v = rq.front();
rq.pop();
count(v, 1);
}
for (int i : semiHalves) {
count(i, 0);
}
for (int i : halves) {
count(i, 0);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
int n;
cin >> n;
multiset<ll> st;
rep(i, n) {
ll a;
cin >> a;
st.insert(a);
}
ll ans = 0;
ll p2 = pow(2, 34);
while(!st.empty()) {
auto it = st.end();
it--;
ll p = p2;
while(p > *it) {
p /= 2;
auto jt = st.lower_bound(p - *it);
if(jt == it || jt == st.end() || *jt != p - *it) continue;
st.erase(jt);
ans++;
break;
}
st.erase(it);
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R, G;
cin >> R >> G;
if(0 <= R){
if(4500 >= G){
cout << (G - R) * 2 + R << endl;
}else{
cout << "Please input number (goal rating) under 4500." << endl;
}
}else{
cout << "Please input number (rating) over 0." << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
int R,G; cin>>R>>G;
cout<<(G+G-R)<<endl;
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>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
signed main() {
int N;
while (cin>>N, N!=0) {
if (N < 3) {
cout << 1 << endl;
continue;
}
int dp[N];
dp[0] = 1;
dp[1] = dp[0]+1;
dp[2] = dp[1]+dp[0]+1;
for (int i = 3; i < N; i++) {
dp[i] = dp[i-3] + dp[i-2] + dp[i-1];
}
cout << ceil((dp[N-1]/10.0)/365.0) << endl;
}
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
#include <tuple>
constexpr long long mod = static_cast<long long>(1e9 + 7);
void dfs1(int i, const std::vector<std::vector<int>>& edges, std::vector<std::pair<int, int>>& memo, int& cnt) {
memo[i] = {i, 0};
for(auto v: edges[i]) {
if(memo[v].second < 0) dfs1(v, edges, memo, cnt);
}
memo[i].second = cnt++;
}
void dfs2(int i, const std::vector<std::vector<int>>& edges, std::vector<int>& memo, int cnt) {
memo[i] = cnt;
for(auto v: edges[i]) {
if(memo[v] < 0) dfs2(v, edges, memo, cnt);
}
}
int main() {
int V, E;
std::cin >> V >> E;
std::vector<std::vector<int>> edges(V);
std::vector<std::vector<int>> redges(V);
while(E--) {
int s, t;
std::cin >> s >> t;
edges[s].push_back(t);
redges[t].push_back(s);
}
int cnt = 0;
std::vector<std::pair<int, int>> memo(V, {-1, -1});
for(int i = 0; i < V; ++i) {
if(memo[i].second < 0) dfs1(i, edges, memo, cnt);
}
std::sort(begin(memo), end(memo), [](auto x, auto y){return x.second > y.second;});
std::vector<int> ans(V, -1);
cnt = 0;
for(auto val: memo) {
if(ans[val.first] < 0) {
dfs2(val.first, redges, ans, cnt++);
}
}
int Q;
std::cin >> Q;
while(Q--) {
int u, v;
std::cin >> u >> v;
std::cout << (ans[u] == ans[v] ? 1 : 0) << "\n";
}
std::cout << std::flush;
return 0;
}
| #include <climits>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
void dfs(int u, vector<vector<int> >& G, int& t, vector<int>& ord, vector<int>& low, int& k, vector<int>& cmp, stack<int>& s) {
ord[u] = low[u] = t++;
s.push(u);
for (int v: G[u]) {
if (ord[v] == -1) {
dfs(v, G, t, ord, low, k, cmp, s);
low[u] = min(low[u], low[v]);
}
else if (cmp[v] == -1)
low[u] = min(low[u], ord[v]);
}
if (ord[u] == low[u]) {
for (;;) {
int v = s.top(); s.pop();
cmp[v] = k;
if (v == u) break;
}
k++;
}
}
vector<int> scc(vector<vector<int> >& G) {
int N = G.size(), t = 0, k = 0;
vector<int> ord(N, -1), low(N), cmp(N, -1);
stack<int> s;
for (int u = 0; u < N; u++)
if (ord[u] == -1)
dfs(u, G, t, ord, low, k, cmp, s);
return cmp;
}
int main() {
int N; cin >> N;
vector<vector<int> > G(N);
int M; cin >> M;
while (M--) {
int u, v; scanf("%d%d", &u, &v);
G[u].push_back(v);
}
vector<int> cmp = scc(G);
int Q; cin >> Q;
while (Q--) {
int u, v; scanf("%d%d", &u, &v);
printf("%d\n", cmp[u] == cmp[v]);
}
} | 1 |
/*
Motto - try hard to become an expert
*/
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
//define
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(int i=k;i>=n;i--)
#define se second
#define fi first
#define pb push_back
#define mp make_pair
#define INF (int)INT_MAX
#define all(v) v.begin(), v.end()
#define endl "\n"
//typedef
typedef long long int ll;
typedef long double ld;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector< pii > vii;
typedef std::vector< ll > vll;
typedef std::vector< std::pair < pii, int > > vpp;
const int N = 3*1e5 +5 ;
const long long MOD = 1e9 + 7;
const long long inf = 1e18;
using namespace std;
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%MOD;
x=x*x%MOD;
n>>=1;
}
return res;
}
ll modFact(ll n, ll p)
{
if (n >= p)
return 0;
ll result = 1;
for (ll i = 1; i <= n; i++)
result = (result * i) % p;
return result;
}
bool isPrime(int x)
{
if(x%2==0)
return 0;
for(int i=3;i<=sqrt(x);i+=2)
{
if(x%i==0)
return 0;
}
return 1;
}
ll binomialCoeff(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1] +
C[i - 1][j])%MOD;
}
}
return C[n][k];
}
bool compare(const pair<int,int> &a , const pair<int,int>&b){
//set<pair<int,int> , decltype(&compare)>s(&compare) ;
if(a.fi!=b.fi)return a.se<b.se ;
return a.fi<b.fi;
}
// struct compare{
// // for priority_queue
// bool operator()(const int &a , const int&b){
// return a<b ;
// }
// };
void solve()
{
int n , m ;
cin>>n>>m;
vector<int>L(m) , R(m) ;
rep(i , m){
cin>>L[i]>>R[i] ;
}
int mal = INT_MIN ;
int mir = INT_MAX ;
rep(i , m){
mal = max(L[i] , mal) ;
mir = min(mir , R[i]) ;
}
int ans= 0 ;
repu(i , 1 , n){
if(mal<=i && mir>=i){
ans++;
}
}
cout<<ans<<endl;
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int t = 1;
//cin>>t;
while(t--)
{
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
} | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<vector<char>> G;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
long long bfs(int sx, int sy, vector<vector<bool>> &vis, G &g) {
int h = g.size();
int w = g[0].size();
queue<pair<int, int>> que;
que.push(make_pair(sx, sy));
vis[sy][sx] = true;
long long cnt_w = 0, cnt_b = 0;
while (!que.empty()) {
auto cur = que.front();
que.pop();
int cur_x = cur.first;
int cur_y = cur.second;
if (g[cur_y][cur_x] == '#') {
cnt_b++;
} else {
cnt_w++;
}
for (int i = 0; i < 4; i++) {
int nx = cur_x + dx[i];
int ny = cur_y + dy[i];
if (nx < 0 || ny < 0 || nx >= w || ny >= h) {
continue;
}
if (vis[ny][nx]) {
continue;
}
if (g[cur_y][cur_x] == g[ny][nx]) {
continue;
}
vis[ny][nx] = true;
que.push(make_pair(nx, ny));
}
}
return cnt_b * cnt_w;
}
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> grid(h, vector<char>(w));
for (int y = 0; y < h; y++) {
string tmp_s;
cin >> tmp_s;
for (int x = 0; x < w; x++) {
grid[y][x] = tmp_s[x];
}
}
long long ans = 0;
vector<vector<bool>> is_visited(h, vector<bool>(w, false));
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
if (!is_visited[y][x]) {
ans += bfs(x, y, is_visited, grid);
}
}
}
cout << ans << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k, dig = 0;
cin >> n >> k;
int d;
for (int i = 0; i < k; i++) {
cin >> d;
dig |= 1 << d;
}
for (int i = n; ; i++) {
string num = to_string(i);
bool bad = false;
for (auto c : num)
if (dig & (1 << (c - '0'))) {
bad = true;
break;
}
if (!bad) {
cout << num << endl;
break;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i = 0;i<((ll)(n));i++)
#define reg(i,a,b) for(ll i = ((ll)(a));i<=((ll)(b));i++)
#define irep(i,n) for(ll i = ((ll)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(ll i = ((ll)(b));i>=((ll)(a));i--)
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T = int> void print(vector<T> v){for(auto a:v)cout<<a<<" ";cout<<endl;}
/*
*/
ll n,m;
int main(void){
cin>>n>>m;
if(n%2==1){
rep(i,m)cout<<i+1<<" "<<n-i<<endl;
}else{
rep(i,min(m,n/4))cout<<i+1<<" "<<n/2-i<<endl;
m-=n/4;
if(m>0){
rep(i,m)cout<<i+n/2+2<<" "<<n-i<<endl;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int x[20][20], y[20][20],a[20];
int main() {
int n;
cin >> n;
rep(i,n) {
cin >> a[i];
rep(j,a[i]) {
cin >> x[i][j] >> y[i][j];
x[i][j]--;
}
}
int ans = 0;
rep(bit, (1<<n)) {
bool ok = true;
rep(i,n) {
if (!((bit >> i) & 1)) continue;
rep(j,a[i]) {
if (((bit>>x[i][j]) & 1) ^ y[i][j]) ok = false;
}
}
if (ok) ans = max(ans, __builtin_popcount(bit));
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
int N, A[110], cnt;
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
cin>> N;
REP(i,N) cin >> A[i];
bool flag = true;
while (flag) {
flag = false;
RFOR(j,1,N){
if (A[j] < A[j-1]) {
swap(A[j], A[j-1]);
flag = true;
++cnt;
}
}
}
REP(i,N){
cout << A[i];
if (i != N-1) {
cout << " ";
} else {
cout << "\n";
}
}
cout << cnt << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n;
if(n == 1) cout << "Hello World" << "\n";
else cin >> a >> b, cout << a + b << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0, before;
cin >> before;
bool HasNoAns = (before > 0);
for (int i = 1; i < N; i++) {
int now;
cin >> now;
if (now == 0) {
before = now;
continue;
}
if (now == before + 1) ans++;
else {
if (now <= before) ans += now;
else HasNoAns = true;
}
before = now;
}
cout << (HasNoAns ? -1 : ans) << endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a+b==c+d)cout<<"Balanced"<<endl;
else if(a+b>c+d)cout<<"Left"<<endl;
else cout<<"Right"<<endl;
return 0;
}
| #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
rep(i,h){
bool rev_fl = i<b;
rep(j,w){
if(j<a){
if(rev_fl) cout << 1;
else cout << 0;
}else {
if(rev_fl) cout << 0;
else cout << 1;
}
}
cout << endl;
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define NOT -100000*2100
#define VMAX 100
#define EMAX 9900
int main(void){
int V,E;
int s,t,d;
long long v[VMAX][VMAX];
int cnt;
vector<int> ed[VMAX];
vector<int> edco[VMAX];
queue<int> no;
cin>>V>>E;
for(int i=0;i<V;i++){
for(int j=0;j<V;j++){
v[i][j]=NOT;
}
}
;
for(int i=0;i<E;i++){
cin>>s>>t>>d;
ed[s].push_back(t);
edco[s].push_back(d);
}
for(int r=0;r<V;r++){
no.push(r);
v[r][r]=0;
cnt=0;
while(!no.empty()){
if(cnt>EMAX*10){
cout<<"NEGATIVE CYCLE"<<endl;
return 0;
}
for(int i=0;i<ed[no.front()].size();i++){
if(v[r][no.front()]+edco[no.front()][i]<v[r][ed[no.front()][i]]||v[r][ed[no.front()][i]]==NOT){
v[r][ed[no.front()][i]]=v[r][no.front()]+edco[no.front()][i];
cnt++;
no.push(ed[no.front()][i]);
}
}
no.pop();
}
}
for(int i=0;i<V;i++){
for(int j=0;j<V;j++){
if(v[i][j]!=NOT) cout<<v[i][j];
else cout<<"INF";
if(j==V-1) cout<<endl;
else cout<<" ";
}
}
} | #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;
bool isEven(int x){return x%2==0;}
bool solve(vector<int> a){
int n=a.size();
int oneCnt=count(a.begin(),a.end(),1);
int evenCnt=count_if(a.begin(),a.end(),isEven);
if(oneCnt || evenCnt<n-1){
return !isEven(evenCnt);
}
else{
int g=a[0];
for(int i=0;i<n;i++) g=__gcd(a[i]/2,g);
for(int i=0;i<n;i++) a[i]/=(g*2);
return !solve(a);
}
}
void output(bool x){
cout<<(x ? "First" : "Second")<<endl;
}
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
if(n==1){
output(a[0]!=1);
}
else if(n==2){
output(isEven(a[0]) || isEven(a[1]));
}
else{
output(solve(a));
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long int infLL = 9000000000000000000;
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(a) (a).begin(),(a).end()
#define mx_int_prime 999999937
const int inf = 2000000000;
const double PI = acos(-1);
const double eps = 1e-9;
typedef long double ld;
#define MOD 1000000007
typedef long long ll;
const int mx=2e5+125;
ll p[mx],a[mx],b[mx];
#define PB push_back
#define endl '\n'
#define S second
#define F first
int main()
{
faster();
ll n;
cin>>n;
set<ll>s;
for(int i=0; i<n; i++)
{
ll x;
cin>>x;
s.insert(x);
}
if(s.size()==n)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
| 0 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string a;
getline(cin, a);
int len = a.length();
for (int i = len-1; i >=0; i--) {
cout << a[i];
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll MOD=1000000007;
ll ReturnDigit(ll n){
int keta=1;
while(n/10!=0){
n /= 10;
keta++;
}
return keta;
}
int main(){
ll n; cin>>n;
ll ans = 100000000000;
for (ll i=1; i*i<=n; i++){
if (n%i==0){
ll A = i;
ll B = n/i;
//cout << "A" << A << endl;
//cout << "B" << B << endl;
ans = min(ans, max(ReturnDigit(A),ReturnDigit(B)));
}
}
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
//#define INF 100000000
//#define MOD (int) (1e9+7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
//そのまま計算すると負の値になるのでMODを足す
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
long long int n, m;
cin >> n >> m;
if(m == 1){
//全部1の1通りしかありえない
cout << 1 << endl;
return 0;
}
long long int i;
map<long long int, long long int> prime;
//素因数分解
long long int tmp = m;
for(i = 2; i * i <= m; i++){
long long int count = 0;
while(tmp%i == 0){
tmp /= i;
count++;
}
prime[i] = count;
}
if(tmp*tmp > m) prime[tmp] += 1;
COMinit();
long long int ans = 1;
for(auto itr = prime.begin(); itr != prime.end(); itr++){
long long int val = itr->second;
ans = (ans * COM(n+val-1, val))%MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define range(i,a,n) for(ll i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}
int sgn(const double&r){return (r>EPS)-(r<-EPS);} // a>0 : sgn(a)>0
int sgn(const double&a,const double&b){return sgn(a-b);} // b<=c : sgn(b,c)<=0
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m;
cin>>n>>m;
rep(i,m){
if(n%2==0){
puta(i+1,(i+1>((m+1)/2)?n-i-1:n-i));
}
else{
puta(i+1,n-i-1);
}
}
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
string s;
int ans=INF;
cin >> s;
rep(i,s.size()-2){
int now = (s[i]-'0')*100 + (s[i+1]-'0')*10 + (s[i+2]-'0')*1;
ans = min(ans,abs(753-now));
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve()
{
ll s;
cin >> s;
ll ans = s;
while(s >= 100)
{
ans = min(ans, abs((s % 1000) - 753));
s /= 10;
}
cout << ans;
}
int main()
{
fastio;
solve();
return 0;
} | 1 |
#include<bits/stdc++.h>
#include<string>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define mod (ll)(1e9+7)
#define nax (ll)(1e5)
#define INFL LLONG_MAX
#define NINFL LLONG_MIN
#define INF INT_MAX
#define disp(a,n,arr) for(int i=a;i<(ll)n;i++) cout << arr[i] << " "; cout << "\n";
#define check cout << "Working\n";
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vpl vector<pl>
#define vpi vector<pi>
#define vb vector<bool>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(a) a.begin(),a.end()
using namespace std;
int main() {
FIO;
int t = 1;
//cin >> t;
while (t--) {
ll n,m;
cin >> n >> m;
vl v(n,0);
for(int i=0;i<m;i++){
ll l,r;
cin >> l >> r;
l--;
v[l]++;
if(r < n) v[r]--;
}
ll ans = 0;
if(v[0] == m) ans++;
for(int i=1;i<n;i++){
v[i] += v[i-1];
if(v[i] == m) ans++;
}
cout << ans << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
rep(i, m) {
int a, b;
cin >> a >> b;
if (l < a) {
l = a;
}
if (b < r) {
r = b;
}
}
if (r < l) {
cout << 0 << endl;
} else {
cout << r - l + 1 << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<b;i++)
#define fast_io std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define trace(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char* name, Arg1&& arg1) {std::cerr << name << " = " << arg1 << endl;}
template <typename Arg1, typename... Args>void ZZ(const char* names, Arg1&& arg1, Args&&... args)
{
const char* comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1;
ZZ(comma, args...);
}
void solve() {
string a, b, c;
cin >> a >> b >> c;
if (a[a.size() - 1] == b[0] && b[b.size() - 1] == c[0]) {
cout << "YES";
}
else cout << "NO";
}
int main() {
fast_io;
int t = 1;
// cin>>t;
while (t--) {
solve();
}
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
} | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
const dd PI = 3.1415926435;
class UnionFind
{
public:
UnionFind(int N) : par(N)
{
for (ll i = 0; i < N; i++)
{
par[i] = i;
}
}
int root(int x)
{
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y)
{
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y)
{
int rx = root(x);
int ry = root(y);
return rx == ry;
}
private:
vector<int> par;
};
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
ll fact(ll n)
{
if (n == 0)
{
return 1;
}
if (n == 1)
{
return 1;
}
return n * fact(n - 1) % MOD;
}
ll pow_fast(ll n, ll k)
{
if (k == 0)
{
return 1;
}
if (k == 1)
{
return n;
}
if (k % 2 == 0)
{
ll tmp = pow_fast(n, k / 2LL);
return tmp * tmp % MOD;
}
else
{
ll tmp = pow_fast(n, k / 2LL);
tmp *= tmp;
tmp %= MOD;
return tmp * n % MOD;
}
}
map<ll, ll> sosuu(ll n)
{
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
res[i] += 1;
n /= i;
}
}
if (n != 1)
{
res[n] += 1;
}
return res;
}
int main()
{
string S;
cin >> S;
bool ok = false;
bool ok2 = false;
bool ok3 = true;
if (S[0] == 'A') {
ok = true;
}
for (ll i = 2; i < S.size() - 1; i++)
{
if (ok2 && S[i] == 'C') {
ok2 = false;
break;
}
if (S[i] == 'C') {
ok2 = true;
}
}
for (ll i = 0; i < S.size(); i++)
{
if (i == 0 || S[i] == 'C') {
continue;
}
if ('a' > S[i] || S[i] > 'z') {
ok3 = false;
}
}
if (ok && ok2 && ok3) {
cout << "AC" << endl;
} else {
cout << "WA" << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
//const int MOD=1e9+7;
const int MOD=998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
if(!(n%3)){
vector<string> ans(n,string(n,'.'));
for(int i=0; i<n; i+=3){
ans[i][i]='a';
ans[i][i+1]='a';
ans[i+1][i+2]='a';
ans[i+2][i+2]='a';
}
for(auto s:ans){
cout<<s<<'\n';
}
return 0;
}
if(!(n%4)){
vector<string> vs={"aacd","bbcd","cdaa","cdbb"};
for(int i=0; i<n; i++){
for(int j=0; j<n; j+=4){
cout<<vs[i%4];
}
cout<<'\n';
}
return 0;
}
if(!(n%5)){
vector<string> vs={"xyycc","xaa.w","i..aw","i..au","ssttu"};
for(int i=0; i<n; i++){
for(int j=0; j<n; j+=5){
cout<<vs[i%5];
}
cout<<'\n';
}
return 0;
}
int a=-1,b=-1;
for(int i=0; i<1000 && a==-1; i++){
for(int j=0; j<1000; j++){
if(5*i+4*j==n){
a=i;
b=j;
break;
}
}
}
if(a!=-1){
//cout<<a<<' ';
vector<string> vs4={"aacd","bbcd","cdaa","cdbb"};
vector<string> vs5={"xyycc","xaa.w","i..aw","i..au","ssttu"};
vector<string> ans(n,string(n,'.'));
int pos=0;
while(pos<b*4){
for(int i=0; i<4; i++){
for(int j=0; j<4; j++){
ans[pos+i][pos+j]=vs4[i%4][j];
}
}
pos+=4;
}
while(pos<b*4+a*5){
for(int i=0; i<5; i++){
for(int j=0; j<5; j++){
ans[pos+i][pos+j]=vs5[i%5][j];
}
}
pos+=5;
}
for(auto s:ans){
cout<<s<<'\n';
}
return 0;
}
for(int i=0; i<1000 && a==-1; i++){
for(int j=0; j<1000; j++){
if(7*i+4*j==n){
a=i;
b=j;
break;
}
}
}
if(a!=-1){
//cout<<a<<' ';
vector<string> vs7={"abb...x","a.c...x","ddc...y","...abby","...a.cz","...ddcz","xxyyzz."};
vector<string> vs4={"aacd","bbcd","cdaa","cdbb"};
vector<string> ans(n,string(n,'.'));
int pos=0;
while(pos<b*4){
for(int i=0; i<4; i++){
for(int j=0; j<4; j++){
ans[pos+i][pos+j]=vs4[i%4][j];
}
}
pos+=4;
}
while(pos<b*4+a*7){
for(int i=0; i<7; i++){
for(int j=0; j<7; j++){
ans[pos+i][pos+j]=vs7[i%7][j];
}
}
pos+=7;
}
for(auto s:ans){
cout<<s<<'\n';
}
return 0;
}
cout<<-1;
return 0;
}
| #include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
char three[3][4] = {
"xx.",
"..y",
"..y"
};
char four[4][5] = {
"aacd",
"bbcd",
"cdaa",
"cdbb"
};
char five[5][6] = {
"aabbc",
"dx..c",
"dx..b",
"a.yyb",
"accdd"
};
char six[6][7] = {
"aacd..",
"bbcd..",
"..aacd",
"..bbcd",
"cd..aa",
"cd..bb"
};
char seven[7][8] = {
"aabbcc.",
"xx.xx.a",
"..y..ya",
"..y..yb",
"xx.xx.b",
"..y..yc",
"..y..yc"
};
char ans[1000][1000 + 1];
int main() {
int n;
scanf("%d", &n);
if (n == 2) return !puts("-1");
if (n == 3) {
for(int i = 0; i < 3; i++)
puts(three[i]);
}
else {
for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) ans[i][j] = '.';
for(int st = 0; st < n;) {
if (n - st == 5) {
for (int i = 0; i < 5; i++) for (int j =0; j < 5; j++) {
ans[st + i][st + j] = five[i][j];
}
st += 5;
}
else if (n - st == 6) {
for (int i = 0; i < 6; i++) for (int j = 0; j < 6; j++) {
ans[st + i][st + j] = six[i][j];
}
st += 6;
}
else if (n - st == 7) {
for (int i = 0; i < 7; i++) for (int j = 0; j < 7; j++) {
ans[st + i][st + j] = seven[i][j];
}
st += 7;
}
else {
for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) {
ans[st + i][st + j] = four[i][j];
}
st += 4;
}
}
for (int i = 0; i < n; i++)
puts(ans[i]);
}
return 0;
} | 1 |
#include <iostream>
using namespace std;
static const int MOD = 1000000007;
int main() {
int N;
cin >> N;
long long sum, A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
sum = (sum + A[i]) % MOD;
}
// sum = A1 + A2 + ... + An
// A1(A2+A3+...+An) + A2(A3+A4+...+An) + ... + An-2(An-1+An) + An-1An
long long ans = 0;
for (int i = 0; i < N - 1; i++) {
sum -= A[i];
if (sum < 0) sum += MOD;
ans += A[i] * sum;
ans %= MOD;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define int long long
#define ll long long
#define ld long double
#define pii pair<ll,ll>
#define read(t) ll t;cin>>t;
#define all(x) x.begin(),x.end()
#define f(a,b,c) for(ll a=b;a<c;a++)
#define For(i,n) for(ll i=0;i<n;i++)
#define what(x) cerr << #x << " is " << x << endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) ;
typedef tree<pair<ll,ll>, null_type,less<pair<ll,ll>>, rb_tree_tag,tree_order_statistics_node_update> omultiset;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> oset;
typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> oset1;
/*.....................................................................................................................*/
const ll mod=(ll)1e9+ 7;
ll add(ll x,ll y) {return (x+y)%mod;}
ll mult(ll x, ll y){return ((x%mod )* (y%mod)) % mod;}
long long binpow(long long x, long long p)
{
if (p == 0) {return 1;}
if (p == 2 || (p & 1)) {return mult(x, binpow(x, p - 1));}
return binpow(binpow(x, p / 2), 2);
}
ll modinv(ll a) {return binpow(a,mod-2);}
//A.erase(unique(A.begin(),A.end()),A.end());
double pi=3.141592653589793238462641;
ll dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
const ll man = (int)2e6+2 , inf = 1e18;
/*......................................................................................................................*/
signed main()
{
fast;
int n,ans=0;
cin>>n;
vector<long double>a(n);
for(int i=0;i<n;i++)cin>>a[i];
map<pair<int,int>,int>cnt;
for(int i=0;i<n;i++)
{
long double y=a[i];
y*=1000000000;
ll x=round(y);
pair<int,int>p;
while(x%2==0)
{
x/=2;
p.first++;
}
while(x%5==0)
{
x/=5;
p.second++;
}
cnt[p]++;
}
for(auto x:cnt)
{
for(auto y:cnt)
{
if((x.first.first+y.first.first>=18))
{
if(x.first.second+y.first.second>=18)
{
if(x<y)
{
ans+=(x.second*y.second);
}
else if(x==y)
{
ans+=(x.second*(x.second-1))/2;
}
}
}
}
}
cout<<ans<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set 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; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);
char rev(char c){
if(c=='B'){
return 'W';
}else{
return 'B';
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
// input
ll N;
cin >> N;
string s;cin>>s;
ll L = s.size();
rep(i, L){
if(i%2==0){
s[i] = rev(s[i]);
}
}
debug(s);
ll bl = 0;
ll wh = 0;
for(char c : s){
if(c=='B'){
bl++;
}else{
wh++;
}
}
if(bl!=wh){
debug("1");
p(0);
return 0;
}
ll ans = 1;
ll cnt = 0;
for(char c : s){
if(c=='W'){
cnt++;
}else{
ans *= cnt;
ans %= mod;
cnt--;
if(cnt<0){
debug("2");
p(0);
return 0;
}
}
}
// N!
FOR(i, 1, N+1){
ans *= i;
ans %= mod;
}
p(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n; ll MOD; cin >> n >> MOD;
vector<vector<ll>> dp(3 * n + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
for (ll i = 0; i < 3 * n; i++) {
for (ll j = 0; j <= n; j++) {
if (i + 1 <= 3 * n) ( dp[i+1][j] += dp[i][j] ) %= MOD;
if (i + 2 <= 3 * n && j + 1 <= n) ( dp[i+2][j+1] += dp[i][j] * (i + 1) ) %= MOD;
if (i + 3 <= 3 * n && j + 1 <= n) ( dp[i+3][j+1] += dp[i][j] * (i + 1) * (i + 2) ) %= MOD;
}
}
ll ans = 0;
for (int i = 0; i <= n; i++) ( ans += dp[3*n][i] ) %= MOD;
cout << ans << endl;
return 0;
} | 0 |
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn=100000+10;
int fa[maxn],co[maxn];
bool bz[maxn],pd[maxn];
int i,j,k,l,r,t,n,m,cnt;
ll ans;
int getfa(int x){
if (!fa[x]) return x;
int t=getfa(fa[x]);
co[x]^=co[fa[x]];
return fa[x]=t;
}
int main(){
scanf("%d%d",&n,&m);
fo(i,1,m){
scanf("%d%d",&j,&k);
bz[j]=1;bz[k]=1;
l=getfa(j);r=getfa(k);
if (l<r){
swap(l,r);
swap(j,k);
}
if (l==r&&co[j]==co[k]) pd[l]=1;
if (l==r) continue;
pd[r]|=pd[l];
fa[l]=r;
co[l]=co[j]^co[k]^1;
}
fo(i,1,n)
if (!bz[i]) cnt++;
ans=(ll)cnt*(n-cnt)*2+(ll)cnt*cnt;
cnt=0;
fo(i,1,n)
if (bz[i]&&!fa[i]) cnt++;
ans+=(ll)cnt*cnt;
cnt=0;
fo(i,1,n)
if (bz[i]&&!fa[i]&&!pd[i]) cnt++;
fo(i,1,n)
if (bz[i]&&!fa[i]&&!pd[i]) ans+=(ll)cnt;
printf("%lld\n",ans);
} | #include <bits/stdc++.h>
#include <algorithm>
#include <time.h>
#define l(x) x<<1
#define r(x) ((x<<1) | 1)
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
const int inf = 2*(1e9) + 10;
const long long MOD =998244353;
const int NMAX = 1000005;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
vector<int> G[NMAX];
int viz[NMAX], color[NMAX];
bool bip;
int dfs(int v, int p){
for(auto el: G[v]){
if(el == p){
continue;
}
if(viz[el]){
if(color[el] != 1-color[v]){
bip = 0;
}
} else {
color[el] = 1 - color[v];
viz[el] = 1;
dfs(el, v);
}
}
}
int main(){
int n, m;
cin>>n>>m;
for(int i = 1; i<=m; ++i){
int a, b;
cin>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
LL ans = 0;
LL sum = 0;
LL ons = 0;
LL bp = 0;
LL bm = 0;
for(int i=1; i<=n; ++i){
if(G[i].size() == 0){
ons++;
continue;
}
if(viz[i]){ continue;}
bip = 1;
viz[i] = 1;
dfs(i, 0);
if(bip){
bp++;
} else bm++;
}
cout<<2*ons*n - ons*ons + bm*bm + 2*bm*bp + 2*bp*bp<<"\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,a,b) for(int i=int(a);i>int(b);--i)
using namespace std;
using ll = long long;
int p[2][200010];
map<int, int> mp[200010];
void init(int t, int n){
rep(i,n) p[t][i]=i;
}
int root(int t, int x){
if(p[t][x]==x) return x;
else return p[t][x]=root(t,p[t][x]);
}
bool same(int t, int x, int y){
return root(t,x)==root(t,y);
}
void unite(int t, int x, int y){
x = root(t,x);
y = root(t,y);
if(x==y) return;
p[t][x] = y;
}
int main()
{
int N,K,L;
cin >> N >> K >> L;
init(0,N);
init(1,N);
int p,q;
rep(i,K){
cin >> p >> q;
unite(0,p-1,q-1);
}
rep(i,L){
cin >> p >> q;
unite(1,p-1,q-1);
}
rep(i,N) mp[root(0,i)][root(1,i)]++;
rep(i,N) cout << mp[root(0,i)][root(1,i)] << ((i==N-1)?"\n":" ");
}
| #include<bits/stdc++.h>
using namespace std;
bool check(vector<string> board)
{
for (int i=0;i<8;i++)
{
if (count(board[i].begin(),board[i].end(),'Q')!=1) return false;
int cnt=0,cnt1=0,cnt2=0,cnt3=0,cnt4=0;
for (int j=0;j<8;j++)
{
if (board[i][j]=='Q') cnt++;
}
if (cnt!=1) return false;
for (int j=0;j<i+1;j++)
{
if (board[i-j][j]=='Q') cnt1++;
if (board[i-j][7-j]=='Q') cnt2++;
}
if (cnt1>1 || cnt2>1) return false;
for (int j=0;j<8-i;j++)
{
if (board[i+j][j]=='Q') cnt3++;
if (board[i+j][7-j]=='Q') cnt4++;
}
if (cnt3>1 || cnt4>1) return false;
}
return true;
}
int main()
{
int K;cin >> K;
vector<pair<int,int>> state(K);
int x,y;
for (int i=0;i<K;i++)
{
cin >> x >>y;
state[i]=make_pair(x,y);
}
vector<int> num={0,1,2,3,4,5,6,7};
do
{
bool can=true;
for (int i=0;i<K;i++)
{
x=state[i].first;
y=state[i].second;
if (num[x]!=y) can=false;;
}
if (!can) continue;
vector<string> board(8,"........");
for (int i=0;i<8;i++) board[i][num[i]]='Q';
if (check(board))
{
for (int i=0;i<8;i++)
{
cout << board[i] << endl;
}
break;
}
} while (next_permutation(num.begin(),num.end()));
return 0;
}
| 0 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
vector<vector<int> > f;
for (;;) {
scanf("%d %d", &n, &m);
if (!n && !m) break;
f = vector<vector<int> >(n + 1);
rep(i, m) {
int a, b;
scanf("%d %d", &a, &b);
f[a].push_back(b);
f[b].push_back(a);
}
set<int> friends, friends_2;
friends.insert(1);
friends_2.insert(1);
rep(i, f[1].size()) friends.insert(f[1][i]);
for (auto ff : friends) {
rep(i, f[ff].size()) friends_2.insert(f[ff][i]);
}
printf("%d\n", friends_2.size() - 1);
}
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int n,m,a[100];
cin >> n >> m;
while ((n!=0)||(m!=0)){
for (int i=0;i<100;i++)
a[i]=0;
for (int i=1;i<=n;i++){
int b,c;
cin >> b;
for (int j=1;j<=b;j++){
cin >> c;
a[c]++;
}
}
int max=0;
for (int i=1;i<100;i++){
if ((a[i]>a[max])&&(a[i]>=m))
max=i;
}
cout << max << endl;
cin >> n >> m;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int M = 0;
cin >> M;
vector<int> s(M,0);
vector<int> c(M,0);
if(M == 0) {
cout << (int)pow(10, N - 1)*(N != 1) << endl;
return 0;
}
for(int i = 0; i < M; i++) {
cin >> s.at(i);
cin >> c.at(i);
}
for(int i = pow(10, N - 1)*(N != 1); i < pow(10, N); i++) {
int check = 1;
for(int j = 0; j < M; j++) {
if((i/(int)pow(10, N - s.at(j)))%10 == c.at(j)) {
continue;
}
check = 0;
}
if(check) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9+7;
#define REP(i,n) for (int i = 0; i <(n); ++i)
//debug
#ifdef _DEBUG
#define debug(var) do{cout << #var << " :";view(var);}while(0)
#else
#define debug(...)
#endif
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vector<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vector<vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
int main(){
//input
int n, m;
cin >> n >> m;
vector<int> s(m), c(m);
REP(i,m) {
int sx, cx;
cin >> sx >> cx;
sx--;
s[i] = sx;
c[i] = cx;
}
debug(s);
debug(c);
vector<int> a(n, -1);
debug(a);
REP(i,m){
// if((s[i] == 0) && (c[i] == 0)){
// cout << -1 << endl;
// return 0;
// }
if((a[s[i]] != -1) && (a[s[i]] != c[i])){
cout << -1 << endl;
return 0;
}
a[s[i]] = c[i];
debug(a);
}
if(n == 1){
if(a[0] == -1) a[0] = 0;
cout << a[0] << endl;
return 0;
}
if(a[0] == 0){
cout << -1 << endl;
return 0;
}
REP(i,n){
if(a[i] == -1){
if(i == 0) a[i] = 1;
else a[i] = 0;
}
}
int ans = 0;
REP(i,n){
ans *= 10;
ans += a[i];
}
cout << ans << endl;
return 0;
} | 1 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string s;
cin >> s;
s.replace(s.begin(), s.begin() + 4, "2018");
cout << s << endl;
return 0;
}
| //#include "stdafx.h"
#include<bits/stdc++.h>
#include<iostream>
#include<queue>
#include<string>
using namespace std;
string s;
int ans[26],f;
int main()
{
cin>>s;
for(int i=0;i<(int)s.size();i++){
ans[s[i]-'a']++;
}
for(int i=0;i<26;i++){
if(ans[i]==0){
cout<<char('a'+i)<<"\n";
f=1;
break;
}
}
if(f==0)
cout<<"None\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
string s;
cin >> s;
vector<long long> b;
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
long long cur = a[i];
for (auto& x : b) {
cur = min(cur, cur ^ x);
}
if (cur > 0) {
if (s[i] == '1') {
ans = 1;
break;
} else {
b.push_back(cur);
}
}
}
cout << ans << '\n';
}
return 0;
}
| /*
Creator : bizarre
*/
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define bizarre ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define ll long long
#define ld long double
#define pi acos(-1)
#define point complex<double>
const int N = 3e5 + 9, inf = 1e18, mod = 1e9 + 7;
vector<int> prime_Numbers;
bool primes[1000005];
double dot(point a, point b)
{
return (conj(a) * b).real();
}
double cross(point a, point b)
{
return (conj(a) * b).imag();
}
/*
void prime(int n)
{
primes[1]=primes[0]=0;
for(int i=2; i<=n; i++)
primes[i]=true;
for(int i=2; i<=n; i++)
{
if(primes[i]==true)
{
prime_Numbers.push_back(i);
for(int j=i+i; j<=n; j+=i)
primes[j]=false;
}
}
}
void move1step(long long& a, long long& b, long long q)
{
long long c= a-q*b;
a=b;
b=c;
}
long long egcd(long long r0,long long r1,long long& x0,long long& y0)
{
long long x1=0,y1=1;
x0=1;
y0=0;
while(r1)
{
long long q=r0/r1;
move1step(r0,r1,q);
move1step(x0,x1,q);
move1step(y0,y1,q);
}
return r0;
}
bool solve (long long a, long long b, long long c,long long&x, long long& y)
{
long long g=egcd(a,b,x,y);
int m=c/g;
x*=m;
y*=m;
return c%g==0;
}
int gcd(int a, int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
void PrimeFactorization(int n)
{
for(int i=2; i*i<=n; i++)
{
int c=0;
if(n%i==0)
{
while(n%i==0)
{
n/=i;
}
}
}
}
long long ncrtane(long long n, long long r)
{
long long ans=1,cntr=1;
for(int i=n; i>n-r; i--)
{
ans*=i;
ans/=cntr;
cntr++;
}
return ans;
}
int ncr(long long n, long long r)
{
return (((fact[n] * inv[n - r]) % mod) * inv[r]) % mod;
}
int npr(long long n, long long r)
{
return (fact[n] * inv[n - r]) % mod;
}
long long fact[N], inv[N];
long long fp(long long base, long long exp)
{
if (exp == 0)
return 1;
long long ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
return ans;
}
void pre(long long n)
{
fact[0] = 1;
inv[0] = 1;
for (long long i = 1; i <= n; i++)
{
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
*/
/*
ll lfts,lftw;
ll p,f,cnts,cntw,s,w;
ll ss(ll cnts, ll cntw, ll mxmp)
{
for(int i = 0;i<=cnts;i++)
{
ll var = i*s,s = 0,e = cntw,mid,ans;
if(var>p)break;
while(s<=e)
{
mid = (s+e)/2;
if((mid*w)+var<=p)ans = mid,s = mid+1;
else e = mid-1;
}
if(mxmp<i+mid)mxmp = i+mid,lfts-=i,lftw-=mid;
}
return mxmp;
}
ll ww(ll cnts, ll cntw, ll mxmp)
{
for(int i = 0;i<=cnts;i++)
{
ll var = i*s,s = 0,e = cntw,mid,ans;
if(var>f)break;
while(s<=e)
{
mid = (s+e)/2;
if((mid*w)+var<=f)ans = mid,s = mid+1;
else e = mid-1;
}
if(mxmp<i+mid)mxmp = i+mid;
}
return mxmp;
}
*/
int main()
{
bizarre
int t = 1;
//cin >> t;
while(t--)
{
int n;
cin >> n;
int mnm = 1e9;
for(int i = 0;i<n;i++)
{
ll x;
cin >> x;
int cntr = 0;
while(x%2==0)
{
x/=2;
cntr++;
}
mnm = min(mnm,cntr);
}
cout << mnm;
}
return 0;
}
| 0 |
#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define CHMIN(a,b) (a) = min((a),(b))
#define CHMAX(a,b) (a) = max((a),(b))
int main()
{
int n,p;
while(1==1)
{
scanf("%d %d\n",&n,&p);
if(n==0&&p==0)return 0;
int ko[55]={};
int zan=p;
int poi=0;
int judge=0;
while(judge==0)
{
for(int i=0;i<n;i++)ko[i]+=zan/n;
zan-=(zan/n)*n;
while(zan>0)
{
ko[poi]++;
if(ko[poi]==p)
{
printf("%d\n",poi);
judge=1;
break;
}
zan--;
poi++;
if(poi>=n)poi-=n;
}
if(judge==1)break;
while(zan==0)
{
if(ko[poi]>0)
{
zan=ko[poi];
ko[poi]=0;
}
poi++;
if(poi>=n)poi-=n;
}
}
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> ansvec;
for(;;){
int n, p;
cin >> n >> p;
if (n == 0) break;
int bowlp = p;
int turn = 0;
int mayors[50]{0};
for(;;){
if (bowlp == 1 && mayors[turn] == p - 1) break;
else if (bowlp == 0){
bowlp += mayors[turn];
mayors[turn] = 0;
}
else{
mayors[turn]++;
bowlp--;
}
if (turn == n - 1) turn = 0;
else turn++;
}
ansvec.push_back(turn);
}
for (int ans : ansvec){
cout << ans << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 5;
int dp[1000005][2];
int main(){
string s;
cin >> s;
reverse(s.begin(), s.end());
s += '0';
int n = s.size();
rep(i,n+1)rep(j,2) dp[i][j] = INF;
dp[0][0] = 0;
rep(i,n)rep(j,2){
int x = s[i] - '0';
x += j;
if(x < 10) chmin(dp[i+1][0], dp[i][j] + x);
if(x > 0) chmin(dp[i+1][1], dp[i][j] + (10 - x));
}
int ans = dp[n][0];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed main(){
string A; cin>>A;
//ナイーブに考えれば答えはnC2通り
// ただし、選択した部分が回文になっていればそれは同じ結果になるのと、
// 両端の文字が同じならばその両端を除いた部分をひっくり返すのと同じ結果になる
// したがって
// 回文の数
// (各文字に関して同じペアの数 C 2)の和 - そのうち回文の数
// をnC2から差っ引けばよい
// と思ったんだけれど、これって回文の数がキャンセルするから、a-zの数を数えればOKなもんだいじゃね?
char alphabet[26] = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
map<char, int> char_num;
for(int i=0;i<26;i++){
char_num[alphabet[i]] = 0;
}
int length= A.size();
rep(i, length){
char_num[A[i]] +=1;
}
int answer = length*(length-1)/2;
for(int i=0;i<26;i++){
answer -= char_num[alphabet[i]]*(char_num[alphabet[i]]-1)/2;
}
cout<<answer+1<<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll MOD=1e9+7;
ll f(pair<string,ll>&x ,pair<string,ll>&y)
{
if(x.first == y.first)
{
return x.second>y.second;
}
else
{
return x.first<y.first;
}
}
void solve()
{
ll a,b;
cin>>a>>b;
cout<<max(a+b,2*max(a,b)-1);
return;
}
int main()
{
fast;
ll q;
q=1;
// cin>>q;
while(q--)
solve();
return 0;
}
| #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vector<vector<long long int> >;
int main(void) {
Int r;
cin >> r;
cout << fixed << setprecision(10) << 2 * r * M_PI << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF=1e9;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
vector<ll> s(n+1);
s[0]=0;
rep(i,n){
ll a;
cin >> a;
s[i+1]=s[i]+a;
}
ll ans=1e18;
ll l=1,r=3;
for(int i=2;i<n-1;i++){
if(r<=i)r=i+1;
while(l+1<i && abs(s[i]-2*s[l+1])<=abs(s[i]-2*s[l])){
l++;
}
while(r+1<n && abs(s[r+1]-s[i]-(s[n]-s[r+1]))<=abs(s[r]-s[i]-(s[n]-s[r]))){
r++;
}
ll M = max({s[l],s[i]-s[l],s[r]-s[i],s[n]-s[r]});
ll m = min({s[l],s[i]-s[l],s[r]-s[i],s[n]-s[r]});
ans = min(ans,M-m);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define ppi pair<pii,int>
#define pip pair<int,pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#define mkp make_pair
#define M_PI 3.14159265358979323846
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define LOR(i,l,r) for (ll i=l;i<=r;i++)
#define FORD(i,r,l) for (int i=r;i>=l;i--)
#define LORD(i,r,l) for (ll i=r;i>=l;i--)
#define INF 1000000000
#define CL(x) memset(x,0,sizeof(x))
#define DEB(x) cout << #x << " : " << x << '\n'
#define ALL(x) x.begin(), x.end()
#define SZ(x) x.size()
#define UI(x) (int)(x-'A')
#define LI(x) (int)(x-'a')
typedef long long ll;
#define MXN 500005
int N,A[MXN];
map<pii,ll> DP;
//for x|x specially
ll psum[MXN];
map<int,ll> lsta;
map<int,int> lstp;
//===
ll Ans;
int xb;
ll modexp(ll x, ll y)
{
ll Pow = x%MOD, rtn = 1;
while(y)
{
if(y&1)rtn=(rtn*Pow)%MOD;
y>>=1;
Pow=(Pow*Pow)%MOD;
}
return rtn;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>N;
FOR(i,1,N)
{
cin>>A[i];
xb^=A[i];
}
int xf=0;
Ans=1;
FOR(i,1,N-1)
{
xf^=A[i];
xb^=A[i];
//0|0 case
psum[i]=psum[i-1]+( xf==0 && xb==0 );
ll za[4];
za[1]=DP[mkp(xb?xb:xf,1)];
za[2]=DP[mkp(xb?xb:xf,2)];
za[3]=DP[mkp(xb,3)];
//(even x)|x case
if( xf==0 && xb!=0 )
{
Ans=(Ans+za[2])%MOD;
DP[mkp(xb,1)]=(za[1]+za[2])%MOD;
}
//(odd x)|0 case
if( xf!=0 && xb==0 )
{
DP[mkp(xf,2)]=(za[1]+za[2]+1)%MOD;
}
//(odd x)|x case
if( xf==xb && xf )
{
if( lstp.find(xf)!=lstp.end() )
{
int lp = lstp[xf];
ll la = lsta[xf];
ll na = (la+za[3]*(psum[i-1]-psum[lp]))%MOD;
Ans=(Ans+na)%MOD;
lsta[xf]=na;
DP[mkp(xf,3)]=(za[3]+na)%MOD;
}
else
{
DP[mkp(xf,3)]=lsta[xf]=1;
Ans=(Ans+1)%MOD;
}
lstp[xf]=i;
}
}
if(psum[N-1])
{
ll Zans=modexp(2,psum[N-1]);
Ans=(Ans+Zans-1)%MOD;
}
cout<<Ans<<'\n';
return 0;
}
/*
3
1 2 3
5
0 0 0 0 0
*/
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
const double EPS = 1e-10;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
}
| /**
* created: 23.06.2020 23:17:01
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
if (n == 1) cout << "Hello World" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | 0 |
//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <deque>
#include <map>
using namespace std;
#define ii pair <int, int>
#define lli long long
#define pb push_back
#define X first
#define Y second
const int Mod = 1E9 + 7;
const int Inf = 1E9 + 7;
const int N = 80 + 10;
const int M = 80 * 160 + 1;
int n, m, a[N][N], b[N][N];
bool F[N][N][M][2];
void Input()
{
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];
}
void Solve()
{
memset(F, 0, sizeof(F));
int Sum = a[1][1] - b[1][1];
Sum = abs(Sum);
F[1][1][Sum][1] = F[1][1][Sum][0] = true;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int k = 0; k < M; k++)
for (int l = 0; l <= 1; l++){
if (F[i][j][k][l] == true) {
int sign = 1;
if (l == 0) sign = -1;
int k1 = k * sign + a[i + 1][j] - b[i + 1][j];
int k2 = k * sign + a[i][j + 1] - b[i][j + 1];
if (k1 >= 0) F[i + 1][j][k1][1] = true;
else F[i + 1][j][-k1][0] = true;
if (k2 >= 0) F[i][j + 1][k2][1] = true;
else F[i][j + 1][-k2][0] = true;
///
k1 = k * sign - a[i + 1][j] + b[i + 1][j];
k2 = k * sign - a[i][j + 1] + b[i][j + 1];
if (k1 >= 0) F[i + 1][j][k1][1] = true;
else F[i + 1][j][-k1][0] = true;
if (k2 >= 0) F[i][j + 1][k2][1] = true;
else F[i][j + 1][-k2][0] = true;
}
}
for (int k = 0; k < M; k++) if (F[n][m][k][0] == true || F[n][m][k][1] == true) {
cout << k << " ";
return ;
}
}
#define task "test"
int main()
{
if (fopen(task ".inp", "r")) {
freopen(task ".inp", "r", stdin);
freopen(task ".out", "w", stdout);
}
int testcase = 1;
/// cin >> testcase;
while (testcase--) {
Input();
Solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#ifdef LOCAL//compile with -DLOCAL
#define debug(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<(x)<<endl
#define debug_vec(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = ";\
rep(i,sz(x)){cerr<<x[i]<<" ";}cerr<<endl
#define debug_mat(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<endl;\
rep(i,sz(x)){rep(j,sz(x[i])){cerr<<x[i][j]<<" ";}cerr<<endl;}cerr<<endl
#else
#define debug(x) void(0)
#define debug_vec(x) void(0)
#define debug_mat(x) void(0)
#endif
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int H,W;
cin >> H >> W;
vector<vector<int>> A(H,vector<int>(W));
rep(i,H){
rep(j,W) cin >> A.at(i).at(j);
}
vector<vector<int>> B(H,vector<int>(W));
rep(i,H){
rep(j,W) cin >> B.at(i).at(j);
}
int base=100*(H+W);
vector<vector<vector<bool>>> dp(H,vector<vector<bool>>(W,vector<bool>(2*base,false)));
dp.at(0).at(0).at(base+A.at(0).at(0)-B.at(0).at(0))=true;
dp.at(0).at(0).at(base-A.at(0).at(0)+B.at(0).at(0))=true;
rep(i,H){
rep(j,W){
int tmp=A.at(i).at(j)-B.at(i).at(j);
rep(k,2*base){
if(i-1>=0 && dp.at(i-1).at(j).at(k)){
if(k+tmp <2*base) dp.at(i).at(j).at(k+tmp)=true;
if(k-tmp >=0) dp.at(i).at(j).at(k-tmp)=true;
}
if(j-1>=0 && dp.at(i).at(j-1).at(k)){
if(k+tmp <2*base) dp.at(i).at(j).at(k+tmp)=true;
if(k-tmp >=0) dp.at(i).at(j).at(k-tmp)=true;
}
}
}
}
int ans=1e9;
rep(i,2*base){
if(!dp.at(H-1).at(W-1).at(i)) continue;
chmin(ans,abs(i-base));
}
cout << ans << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,l[52],i,j,sum=0;
cin>>n>>k;
for(i=0;i<n;i++){
cin>>l[i];
}
sort(l,l+n);
for(j=n-1;j>=n-k;j--){
sum+=l[j];
}
cout<<sum;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,n) for(int i = l; i <= (int)(n); i++)
#define drep(i,n) for(int i = (int)(n-1); i >= 0; i--)
#define drepn(i,n) for(int i = (int)(n); i >= 0; i--)
#define size(s) (int)s.size()
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
template<typename T> inline istream& operator>>(istream &i, vector<T> &v) {rep(j, size(v)) i >> v[j]; return i;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T> T gcd(T a, T b) {if(b==0)return a; else return gcd(b,a%b);}
template<class T> T lcm(T a, T b) {return a/gcd(a,b)*b;}
template<class T = int> using V = vector<T>;
template<class T = int> using VV = vector<V<T>>;
bool isIn(int i, int j, int h, int w) {return i >= 0 && i < h && j >= 0 && j < w;}
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void err() {cout << -1 << endl;}
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ep emplace_back
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
V<> a(n);
cin >> a;
sort(rall(a));
int ans = accumulate(a.begin(), a.begin() + k, 0);
cout << ans << endl;
} | 1 |
/*
?§???????????????°???????????°
goto ?????????C/C++?¨????????????§???????????¨?????§???????????§????????????????????¨????????¶????????????????????????????????????????£?????????????????????° goto CHECK_NUM; ??¨?????????????????????????????¨???????????°??????????????§ CHECK_NUM: ??¨????????????????????????????§?????????????????????????????????£????????°?????????????????????????????????????????¨?????§????????????
?????????goto ???????????±??????????????????????????°?????????????????§?????±??????????????????????????????????????????????????¨?????¨?\¨?????????????????????
?¬????C++?¨???????????????°????????¨?????????????????????????????°????????????????????????????????????????????????goto ????????????????????§????£?????????????????????????
void call(int n){
int i = 1;
CHECK_NUM:
int x = i;
if ( x % 3 == 0 ){
cout << " " << i;
goto END_CHECK_NUM;
}
INCLUDE3:
if ( x % 10 == 3 ){
cout << " " << i;
goto END_CHECK_NUM;
}
x /= 10;
if ( x ) goto INCLUDE3;
END_CHECK_NUM:
if ( ++i <= n ) goto CHECK_NUM;
cout << endl;
}
*/
#include <iostream>
#include <math.h>
bool power(int x) {
if (x % 10 == 3) {
return true;
}
else if (x == 0) {
return false;
}
else {
power(x / 10);
}
}
int main() {
int n;
bool inc3;
std::cin >> n;
for (int i = 1; i <= n; i++)
{
if (i % 3 == 0) {
std::cout << " " << i;
}
else {
if (power(i)) {
std::cout << " " << i;
}
/*
for (int j = 0; j < 4; j++)
{
int d = pow(10, j);
if ((i / d) % 10 == 3) {
std::cout << " " << i;
break;
}
}*/
}
}
std::cout << std::endl;
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
char str1[12], str2[12], str3[12];
scanf("%s%s%s", str1, str2, str3);
int len1 = strlen(str1), len2 = strlen(str2), len3 = strlen(str3);
if (str1[len1 - 1] == str2[0] && str2[len2 - 1] == str3[0]) {
puts("YES");
}
else {
puts("NO");
}
return 0;
} | 0 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <utility>
#include <numeric>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
const ullong MOD = 1000000000 + 7;
int main()
{
string s;
for (; cin >> s;)
{
vector<int> a(14);
stringstream ss;
ss << s;
for (int i = 0; i < 5; i++)
{
int x;
ss >> x;
a.at(x - 1)++;
if (x == 1)
{
a.at(13)++;
}
ss.ignore();
}
int maxn = 0;
int cnt = 0;
int len = 0;
bool str = false;
for (int i = 0; i < 14; i++)
{
if (a.at(i) > 0)
{
maxn = max(maxn, a.at(i));
if (i < 13)
{
cnt++;
}
len++;
if (len >= 5)
{
str = true;
}
}
else
{
len = 0;
}
}
if (maxn == 4)
{
cout << "four card" << endl;
}
else if (maxn == 3)
{
if (cnt == 2)
{
cout << "full house" << endl;
}
else
{
cout << "three card" << endl;
}
}
else if (maxn == 2)
{
if (cnt == 3)
{
cout << "two pair" << endl;
}
else
{
cout << "one pair" << endl;
}
}
else
{
if (str)
{
cout << "straight" << endl;
}
else
{
cout << "null" << endl;
}
}
}
}
| #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<string>
using namespace std;
int a[5];
string S;
string poker(int p, int q, int r, int s, int t)
{
if (p == q && q == r && r == s)
{
return "four card";
}
if (s == t && q == r && r == s)
{
return "four card";
}
if (p == q && q == r && s == t)
{
return "full house";
}
if (p == q && r == s && s == t)
{
return "full house";
}
if (p == q - 1 && q == r - 1 && r == s - 1 && s == t - 1)
{
return "straight";
}
if (p == 1 && q == 10 && r == 11 && s == 12 && t == 13)
{
return "straight";
}
if (p == q && q == r)
{
return "three card";
}
if (r == s && q == r)
{
return "three card";
}
if (r == s && s == t)
{
return "three card";
}
if (p == q && r == s)
{
return "two pair";
}
if (p == q && s == t)
{
return "two pair";
}
if (q == r && s == t)
{
return "two pair";
}
if (p == q)
{
return "one pair";
}
if (q == r)
{
return "one pair";
}
if (r == s)
{
return "one pair";
}
if (s == t)
{
return "one pair";
}
return "null";
}
int main() {
while (cin >> S)
{
int cnt = 0;
string U = "";
S += ',';
for (int i = 0; i < S.size(); i++)
{
if (S[i] == ',')
{
a[cnt] = stoi(U);
U = "";
cnt++;
}
else
{
U += S[i];
}
}
sort(a, a + 5);
cout << poker(a[0], a[1], a[2], a[3], a[4]) << endl;
}
} | 1 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#define INF 1000000
void cWarshall_Floyd();
void tWarshall_Floyd();
int glid_cost[101][101];
int glid_tim[101][101];
int n,m,a,b,tim,cost,qs,p,q,r;
using namespace std;
void cWarshall_Floyd()
{
int i,j,k;
for(k=0;k<m;k++) {
for(i=0;i<m;i++) {
for(j=0;j<m;j++) {
glid_cost[i][j]=min(glid_cost[i][j],glid_cost[i][k]+glid_cost[k][j]);
}
}
}
}
void tWarshall_Floyd()
{
int i,j,k;
for(k=0;k<m;k++) {
for(i=0;i<m;i++) {
for(j=0;j<m;j++) {
glid_tim[i][j]=min(glid_tim[i][j],glid_tim[i][k]+glid_tim[k][j]);
}
}
}
}
int main(void)
{
ios::sync_with_stdio(false);
int i,j,k;
while(1) {
cin>>n>>m;
if(n==0&&m==0) break;
for(i=0;i<m;i++) {
for(j=0;j<m;j++) {
glid_cost[i][j]=INF;
glid_tim[i][j]=INF;
}
}
for(i=0;i<m;i++) {
glid_cost[i][i]=0;
glid_tim[i][j]=0;
}
for(i=0;i<n;i++) {
cin>>a>>b>>cost>>tim;
a--;b--;
glid_cost[a][b]=cost;
glid_cost[b][a]=cost;
glid_tim[a][b]=tim;
glid_tim[b][a]=tim;
}
cWarshall_Floyd();
tWarshall_Floyd();
cin>>qs;
for(i=0;i<qs;i++) {
cin>>p>>q>>r;
p--;q--;
if(r==0) cout<<glid_cost[p][q]<<endl;
else cout<<glid_tim[p][q]<<endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n,q;
bool x[50][100];
while(cin >> n >> q,n||q){
for(int i = 0; i < n; i++){
for(int j = 0; j < 100; j++) x[i][j] = false;
}
for(int i = 0; i < n; i++){
int m;
cin >> m;
for(int j = 0; j < m; j++){
int date;
cin >> date;
x[i][date] = true;
}
}
bool ok = true;
int sum = -1, ans;
for(int i = 1; i < 100; i++){
int cnt = 0;
for(int j = 0; j < n; j++){
if(x[j][i]) cnt++;
}
if(cnt > sum){
sum = cnt;
ans = i;
}
}
if(sum >= q) cout << ans << endl;
else cout << 0 << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long total = 0;
for (int i = 1; i <= n; i++){
if(i % 5 != 0 && i % 3 != 0){
total = total + i;
}
}
cout << total << endl;
} | #include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
/////////////////////////////////////////////////////
ll N;
ll i, j, k;
char S[1010][1010];
const char mk[10][20][20]={
{},{},{},{},
{
"aacd",
"bbcd",
"cdaa",
"cdbb"
},
{
"aabba",
"b..ca",
"b..cb",
"acc.b",
"abbaa"
},
{
"aabbaa",
"c.c.c.",
"c.c.c.",
".c.c.c",
".c.c.c",
"aabbaa"
},
{
".aabbaa",
"a.cc.cc",
"ac..c..",
"bc..c..",
"b.cc.cc",
"ac..c..",
"ac..c.."
},
};
void crS(ll a,ll p){
ll i,j;
fornum(i,0,a){
fornum(j,0,a){
S[p + i][p + j] = mk[a][i][j];
}
}
}
int main(){
scanf("%lld", &N);
if(N==2){
printf("-1");
return 0;
}
if(N==3){
printf("aa.\n");
printf("..a\n");
printf("..a\n");
return 0;
}
i = N % 4 + 4;
crS(i, 0);
while(i<N){
crS(4, i);
i+= 4;
}
fornum(i,0,N){
fornum(j,0,N){
printf("%c", S[i][j] ? S[i][j] : '.');
}
printf("\n");
}
return 0;
} | 0 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cstdlib>
using namespace std;
inline int to_int(string s) {int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string to_str(T x) {ostringstream sout; sout << x; return sout.str();}
typedef long long ll;
int main()
{
string s;
map<char, int> ex;
ex['I'] = 1; ex['V'] = 5; ex['X'] = 10; ex['L'] = 50;
ex['C'] = 100; ex['D'] = 500; ex['M'] = 1000;
while(cin >> s)
{
int sum = 0;
for(int i = 0; i < s.size()-1; i++)
{
char now = s[i], next = s[i+1];
if(ex[now] < ex[next])
{
sum -= ex[now];
}
else
{
sum += ex[now];
}
}
sum += ex[s[s.size()-1]];
cout << sum << endl;
}
} | #include<iostream>
#include<string>
int main() {
std::string s;
while (std::cin >> s){
int sum = 0;
for (int i = 0; i != s.size(); i++){
if (s[i] == 'I'){
if (s[i + 1] == 'V') {
sum += 4;i++;
}
else if (s[i + 1] == 'X'){
sum += 9; i++;
}
else sum++;
}
else if (s[i] == 'V')sum += 5;
else if (s[i] == 'X'){
if (s[i + 1] == 'L'){
sum += 40;i++;
}
else if (s[i + 1] == 'C'){
sum += 90;i++;
}
else sum += 10;
}
else if (s[i] == 'L')sum += 50;
else if (s[i] == 'C') {
if (s[i + 1] == 'D'){
sum += 400; i++;
}
else if (s[i + 1] == 'M'){
sum += 900; i++;
}
else sum += 100;
}
else if (s[i] == 'D')sum += 500;
else if (s[i] == 'M')sum += 1000;
}
std::cout << sum << std::endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
//container util
#define all(x) (x).begin(),(x).end()
//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};
//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
int n,m;
const int maxM = 202020;
const int INF = 1e9;
vector<PII> edge[3*maxM];
map<PII, int> sid;
int lastId = 0;
// 頂点と色を引数に持って新しく追加する頂点との間にエッジを張る
// 今まで出てきた端点と同じものがあったら同じグループに追加する
int getid(int v, int c){
PII p(v,c);
if( sid.find(p) != sid.end()) return sid[p];
return sid[p] = lastId++;
}
void addEdge(int a, int b, int c){
// 同じ辺の要素はコスト0の辺を貼ったのでそれぞれの端点で独立に考える
int v = getid(a,c), u = getid(b,c);
edge[v].emplace_back(u,0);
edge[u].emplace_back(v,0);
}
void dijkstra(){
int dist[n + lastId];
rep(i,n+lastId) dist[i] = INF;
dist[lastId] = 0;
priority_queue< PII, vector<PII>, greater<PII>> que;
que.push({0,lastId});
while(que.empty() == false){
PII p = que.top(); que.pop();
int cdist = p.first, current = p.second;
if(dist[current] < cdist) continue;
for(PII e: edge[current]){
if(dist[e.first] > cdist + e.second){
que.push({cdist + e.second,e.first});
dist[e.first] = e.second + cdist;
}
}
}
if(dist[lastId+n-1] == INF){
cout << -1 << endl;
return;
}else cout << dist[lastId+n-1]/2 << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int a[m],b[m],c[m];
rep(i,m){
cin >> a[i] >> b[i] >> c[i];
a[i]--,b[i]--;
addEdge(a[i],b[i],c[i]);
}
// 作成した頂点と入力の辺の端点からコスト1の辺を張る
rep(i,m){
edge[getid(a[i], c[i])].emplace_back(lastId+a[i], 1);
edge[getid(b[i], c[i])].emplace_back(lastId+b[i], 1);
edge[lastId+a[i]].emplace_back(getid(a[i], c[i]), 1);
edge[lastId+b[i]].emplace_back(getid(b[i], c[i]), 1);
}
dijkstra();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
int main() {
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> t;
rep(i, n) {
int l, r, x;
cin >> l >> r >> x;
l -= x;
r -= x;
t.push_back(make_tuple(l, 1, x));
t.push_back(make_tuple(r, 0, x));
}
rep(i, q) {
int d;
cin >> d;
t.push_back(make_tuple(d, 2, 0));
}
sort(all(t));
set<int> st;
for(auto v : t) {
int l, b, x;
tie(l, b, x) = v;
if(b == 2)
cout << (st.empty() ? -1 : *st.begin()) << endl;
else if(b == 1)
st.insert(x);
else
st.erase(x);
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int N, A[int(2e5+5)], now[int(2e5+5)];
vector <int> ans;
int main(){
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
for (int i = N; i >= 1; i--){
if (now[i] % 2 == A[i]) continue;
ans.push_back(i);
for (int j = 1; j * j <= i; j++){
if (i % j != 0) continue;
now[j]++;
if (j * j != i) now[i/j]++;
}
}
if (now[1] % 2 != A[1]){
cout << -1 << endl;
return 0;
}
int M = ans.size();
cout << M << endl;
if (M > 0){
cout << ans[0];
for (int i = 1; i < M; i++) cout << " " << ans[i];
cout << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;
//------------↓------------- M -------------- E ---------------- M --------------- O ---------------↓--------------//
// コンパイル
// g++ -std=c++1z
//
// -------型変換--------
// int を string に変換
// string s = to_string(n);
// string を int に変換
// int n = stoi(s);
//
// -------二分探索---------
// k以上の値が最初に現れる時のイテレータ
// lower_bound(data.begin(), data.end(), k)
// kより大きい値が最初の現れる時のイテレータ O(logN)
// upper_bound(data.begin(), data.end(), k)
// kがdataに存在するかをtrue or falseで返す O(logN)
// binary_search(data.begin(), data.end(), k)
//
//
//
//
//
//
//
//------------↑------------- M -------------- E ---------------- M --------------- O ---------------↑--------------//
int main() {
int N; cin >> N;
int a[N+1];
for (int i = 1; i <= N; ++i) cin >> a[i];
int b[N+1]; rep(i,N+1) b[i] = -1;
vector<int> ans;
for (int i = N; i >= 1; --i) {
int j = 2;
int sum = 0;
while (i*j <= N) {
sum += b[i*j];
++j;
}
b[i] = (a[i] + sum) % 2;
if (b[i] == 1) ans.push_back(i);
}
cout << ans.size() << endl;
rep(i,ans.size()) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.