code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
string S,T;
cin >> S >> T;
bool isExist = false;
rep(i,S.length()-T.length()+1){
if(S[S.length()-1-i]==T[T.length()-1]||S[S.length()-1-i]=='?'){
ll cnt = 0;
rep(j,T.length()){
if(S[S.length()-1-i-j]==T[T.length()-1-j]||S[S.length()-1-i-j]=='?') cnt++;
else{
break;
}
}
if(cnt==T.length()){
rep(j,T.length()){
S[S.length()-1-i-j] = T[T.length()-1-j];
}
isExist = true;
break;
}
}
}
if(isExist){
rep(i,S.length()){
if(S[i]=='?') S[i] = 'a';
}
cout << S << endl;
}else cout << "UNRESTORABLE" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003;
template <typename T> inline bool chmin(T& x, const T& y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T& x, const T& y) {if (x < y) {x = y; return 1;} return 0;}
struct IOSET {IOSET() {cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n, vector<int>(n, inf));
rep(i, m) {
int a, b, c;
cin >> a >> b >> c;
--a; --b;
g[a][b] = c; g[b][a] = c;
}
rep(i, n) g[i][i] = 0;
vector<vector<int>> dist = g;
rep(k, n) rep(i, n) rep(j, n) chmin(dist[i][j], dist[i][k] + dist[k][j]);
int ans = m;
rep(i, n) rep(j, i + 1, n) {
if (g[i][j] == inf) continue;
rep(x, n) rep(y, n) {
if (dist[x][i] + g[i][j] + dist[j][y] == dist[x][y]) {
--ans;
goto ioi;
}
}
ioi:;
}
cout << ans << "\n";
}
| 0
| 90,601,212
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void to_adjacent_matrix(vector<vector<int> >& adjacent_list, vector<vector<int> >& adjacent_matrix);
int main()
{
int n;
cin >> n;
vector<vector<int> > vertex(n, vector<int>(n, -1));
for (int i = 0; i < n; ++i) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; ++j)
cin >> vertex[i][j];
}
vector<vector<int> > adjacent(n, vector<int>(n, 0));
to_adjacent_matrix(vertex, adjacent);
for (int i = 0; i < n; ++i) {
cout << adjacent[i][0];
for (int j = 1; j < n; ++j)
cout << ' ' << adjacent[i][j];
cout << '\n';
}
}
void to_adjacent_matrix(vector<vector<int> >& adjacent_list, vector<vector<int> >& adjacent_matrix)
{
int n = adjacent_list.size();
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n && adjacent_list[i][j] != -1; ++j) {
int adjacent = adjacent_list[i][j] - 1;
if (adjacent < 0 || adjacent > n)
continue;
adjacent_matrix[i][adjacent] = 1;
}
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define _GLIBCXX_DEBUG
#define DIVISOR 1000000007
using namespace std;
typedef pair<int,int> pii;
typedef pair<int64_t, int64_t> pII;
template<typename T>
void cins(vector<T>& arr) { for(T& e: arr) cin >> e; }
#ifdef DEBUG
#define debug(fmt, ...) \
printf("[debug: %s] " fmt, __func__, __VA_ARGS__)
#define ps(arr) \
debug("size %ld: ", arr.size()); \
for(auto e: arr) cout << e << " "; \
cout << endl;
#else
#define debug(fmt, ...)
#define ps(arr)
#endif
#define INF (1e+9)
int main(void) {
int num, cap, limit;
cin >> num >> cap >> limit;
vector<pii> ranges(num);
for(int i = 0; i < num; i++) {
int time;
cin >> time;
ranges[i] = make_pair(time, time+limit+1);
}
auto comp = [](pii a, pii b) {
return a.second < b.second;
};
sort(ranges.begin(), ranges.end(), comp);
int ans = 0;
int time = 0;
int ps = 0;
for(int i = 0; i < num; i++) {
pii r = ranges[i];
if(ps == cap) {
time = 0;
}
if(r.first < time) {
ps++;
} else {
ans++;
time = r.second;
ps = 1;
}
debug("[time: %d] %d\n", time, ans);
}
cout << ans << endl;
return 0;
}
| 0
| 81,840,346
|
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifdef FASTIO
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
int n, a, b;
cin >> n >> a >> b;
if (n > ll(a) * b || n < a + b - 1) {
cout << -1 << "\n";
return 0;
}
vector<int> vv;
for (int i = b; i >= 1; --i)
vv.push_back(i);
int cur = b + 1;
int left = n - b - (a - 1);
for (int i = 1; i < a; ++i) {
int go = min(b - 1, left);
for (int j = cur + go; j >= cur; --j)
vv.push_back(j);
left -= go;
cur += go + 1;
}
for (int i: vv)
cout << i << " ";
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef vector<string> vs;
const long long INF = 1LL << 58;
const int INT_INF = 1 << 28;
const double PI = acos(-1.0);
int main() {
int N;
cin >> N;
string S;
cin >> S;
auto solve = [&](int x, int y, int z) {
bool a = false, b = false, c = false;
rep(i, N) {
if (!a)
if (S[i] - '0' == x)
a = true;
else
continue;
else if (!b)
if (S[i] - '0' == y)
b = true;
else
continue;
else if (S[i] - '0' == z)
c = true;
}
if (a && b && c)
return true;
else
return false;
};
int ans = 0;
rep(i, 10) {
rep(j, 10) {
rep(k, 10) {
if (solve(i, j, k)) ans++;
}
}
}
cout << ans << endl;
}
| 0
| 60,467,221
|
#include <bits/stdc++.h>
#define MAX 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sync_with_stdio(false), cin.tie(NULL);
#define all(x) x.begin(), x.end()
#define read(x) freopen(x, "r", stdin)
#define write(x) freopen(x, "w", stdout)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define REP(i, a, n) for (int i = a; i <= n; i++)
#define inputArray(a,n) rep(i, 0, n) cin >> a[i];
#define copyArray(a,temp,n) rep(i, 0, n) temp[i]=a[i];
#define printArray(a,n) rep(i, 0, n) cout << a[i] << " "; cout << endl;
#define Cases cout << "Case " << ++Case << ": ";
#define __test int tt; int Case=0; cin >> tt; while(tt--)
#define dbgA2(A, n, m) {cout<<"--> "<<#A<<" = \n";rep(i, 0, n){rep(j, 0, n){cout<<A[i][j]<<" ";}cout<<"\n";}cout<<"\n";}
#define dbgA(A, n) {cout<<" --> "<<#A<<" = (";rep(i, 0, n)cout<<A[i]<<" ";cout<<")\n";}
#define dbg(args...) {string sss(#args);sss+=',';cout<<" --> ";debugger::call(all(sss), args);cout<<"\n";}
ll gcd(ll n, ll m) { return m ? gcd(m, n % m) : n; }
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
struct debugger {
typedef string::iterator si;
static void call(si it, si ed) {}
template<typename T, typename ... aT>
static void call(si it, si ed, T a, aT... rest) {
string b;
for(; *it!=','; ++it)
if(*it!=' ')
b+=*it;
cout << b << "=" << a << " ";
call(++it, ed, rest...);
}
};
void solve() {
ll n, m, sum = 0, count = 0;
cin >> n >> m;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
double res = (sum * (1 / (4.0 * m)));
for (int i = 0; i < n; i++) {
if(arr[i] >= res) {
count++;
}
}
if(count >= m) {
cout << "Yes\n";
return;
}
cout << "No\n";
}
int main() {
solve();
}
|
#include <iostream>
using namespace std;
int w,h;
int count;
int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};
char board[100][100];
void dfs(int x,int y){
count++;
board[y][x]='#';
for(int i=0;i<4;i++){
int nx=x+dx[i];int ny=y+dy[i];
if(nx>=0&&nx<w&&ny>=0&&ny<h&&board[ny][nx]=='.'){
dfs(nx,ny);
}
}
}
int main(){
while(1){
cin>>w>>h;
if(w==0&&h==0) break;
count=0;
for(int k=0;k<h;k++){
cin>>board[k];
}
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(board[i][j]=='@'){
dfs(j,i);
}
}
}
cout<<count<<endl;
}
return 0;
}
| 0
| 30,205,182
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i <= n; i++) {
string u = s + t.substr(n-i, i);
int m = u.size();
if (u.substr(m-n, n) == t) {
cout << u.size() << endl;
return 0;
}
}
}
|
#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++)
LL Z[51], Y[51];
LL part(int N, LL X) {
if (N == 0) { if (X == 0) return 0; else return 1; }
LL ans = 0;
if (X <= 1) return ans;
X--;
if (X <= Z[N - 1]) return part(N - 1, X);
ans += Y[N - 1]; X -= Z[N - 1];
if (X <= 1) return ans + 1;
ans++; X--;
if (X <= Z[N - 1]) return ans + part(N - 1, X);
ans += Y[N - 1]; X -= Z[N - 1];
return ans;
}
int main() {
int N; LL X; cin >> N >> X;
Z[0] = Y[0] = 1;
rep(i, N) Z[i + 1] = Z[i] * 2 + 3;
rep(i, N) Y[i + 1] = Y[i] * 2 + 1;
cout << part(N, X) << endl;
return 0;
}
| 0
| 97,837,240
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vii vector<int>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define take(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define takes(a,n,st) for(ll i=st;i<n+st;i++)cin>>a[i]
ll sum(ll a[],ll n,ll s){ for(ll i=0;i<n;i++)s+=a[i]; return s;}
#define mod 1000000009
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0){
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
ll a[200017];
void solve(){
ll n,i,x,tot;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
a[i]-=(i+1);
}
sort(a,a+n);
if(n%2 ==1)
x=a[n/2];
else{
x=(a[n/2]+a[(n/2)-1])/2;
}
tot=0;
for(i=0;i<n;i++){
tot+=abs(a[i]-x);
}
cout<<tot;
return;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll t,T;
T=1;
for(t=1;t<=T;t++){
solve();
}
return 0;
}
|
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <unordered_map>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ln cout << endl;
#define vi vector<int>
#define vll vector<long long>
#define sortl(vec) sort(vec.begin(), vec.end());
#define sortr(vec) sort(vec.rbegin(), vec.rend());
#define forn(i, x, n) for(long long i = x; i < n; i++)
#define revn(i, n, x) for(long long i = n; i >= x; i--)
#define in(vec) for(auto &it : vec) cin >> it;
#define loop(vec) for(auto &it : vec)
#define out(vec) for(auto &it : vec) cout << it << " "; ln
#define ll long long
#define mod 1000000007
#define pb emplace_back
#define mp make_pair
#define um unordered_map
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define pi 3.14159265359
#define o(x) cout << x << endl;
#define CLOCK cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
using namespace std;
ll bS(ll l, ll r, ll x, vll arr) {
while (l <= r) {
ll m = l + (r - l) / 2;
if (arr[m] == x)
return m;
if (arr[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}
void primeFactors(ll n) {
while (n % 2 == 0) {
n = n / 2;
}
for (ll i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
n = n / i;
}
}
if (n > 2)
cout << n << " ";
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modulo(ll a, ll b) {
ll c = a % b;
return (c < 0) ? c + b : c;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
fastio
ll t = 1;
while (t--) {
ll n;
cin >> n;
vll vec(n);
in(vec);
vll count(60, 0);
forn(i, 0, n) {
forn(j, 0, 60) {
if (vec[i] & 1LL << j) {
count[j]++;
}
}
}
ll sum = 0, zero, prod = 1;
forn(i, 0, 60) {
zero = n - count[i];
prod = ((zero % mod) * (count[i] % mod)) % mod;
sum += ((prod % mod) * ((1LL << i) % mod)) % mod;
sum %= mod;
}
o(sum)
}
CLOCK
return 0;
}
| 0
| 69,427,249
|
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
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;}
template<class T> T div_floor(T a, T b){
if(b < 0) a *= -1, b *= -1;
return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
if(b < 0) a *= -1, b *= -1;
return a>0 ? (a-1)/b+1 : a/b;
}
constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;
int main(){
int n;
scanf("%d", &n);
lint a[n], b[n];
rep(i, n) scanf("%lld", &a[i]);
rep(i, n) scanf("%lld", &b[i]);
lint tmp = 0;
rep(i, n) tmp += (b[i] >= a[i] ? (b[i]-a[i])/2 : b[i]-a[i]);
puts(tmp >= 0 ? "Yes" : "No");
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll mx = 0;
rep(i, n) mx = max(mx, a[i]);
int l = 0;
while (mx > 0) {
mx /= 2;
++l;
}
vector<ll> d(l, 0);
rep(i, n) {
rep(j, l) { d[j] += a[i] >> j & 1; }
}
ll ans = 0;
rep(i, l) {
ll x = 1;
rep(j, i) {
x *= 2;
x %= mod;
}
ans += (d[i] * (n - d[i]) % mod) * x % mod;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| 0
| 91,926,008
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, d, x, a;
cin >> r >> d >> x;
a = r*x - d;
for (int i = 0; i < 10; i++)
{
cout << a << endl;
a = r*a - d;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
ll K,A,B;
cin>>K>>A>>B;
if(A>=B-1||K<A+1) cout<<K+1<<endl;
else
{
K-=A-1;
cout<<B+(K/2-1)*(B-A)+K%2<<endl;
}
return 0;
}
| 0
| 13,978,208
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int a, b;
cin >> a >> b;
cout << 6 - a - b << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long N, M; cin >> N >> M;
vector<long long>A(N), B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
sort(A.begin(), A.end(), greater<long long>());
sort(B.begin(), B.end(), greater<long long>());
long long ans = 0;
for (long long i = 0; i < N; i++) {
if (B.at(i) > A.at(0)) {
M -= B.at(i);
ans++;
}
if (M <= 0) {
cout << ans << endl;
return 0;
}
}
ans += M / A.at(0);
if (M % A.at(0) != 0) ans++;
cout << ans << endl;
}
| 0
| 24,998,704
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int sll;
typedef double ld;
#define A 1000000007ll
#define D 100000000000000ll
#define B 998244353ll
#define C 1000000000000000000ll
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define oset tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define bs binary_search
#define lb lower_bound
#define ub upper_bound
#define ve vector
#define br break
#define PI acos(-1)
#define subt cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n"
int main()
{
FAST;
ll n,m;
cin>>n>>m;
if(n%2==1)
for(int i=1,j=n,k=0;i<j && k<m;i++,j--,k++)
cout<<i<<' '<<j<<'\n';
else
{
int k=0;
for(int i=1,j=n/2;i<j && k<m;i++,j--,k++)
cout<<i<<' '<<j<<'\n';
for(int i=(n/2)+2,j=n;i<j && k<m;i++,j--,k++)
cout<<i<<' '<<j<<'\n';
}
subt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
while(true){
cin>>n>>k;
if(n==0)break;
vector<int> a(n+1,0);
for (int i = 1; i <= n; ++i) {
cin>>a[i];
a[i]+=a[i-1];
}
int ans=0;
for (int i = 0; i+k < n; ++i) {
ans=max(ans,a[i+k]-a[i]);
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 51,978,089
|
#include <bits/stdc++.h>
using namespace std;
int main () {
int x,y,n,m;
cin>>x>>y>>n>>m;
int has = x-y;
if(has <=0 ) {
cout<<n*x<<endl;
} else {
cout<<y*n + has*m<<endl;
}
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n, k;
cin>>n>>k;
set<pair<int, int> > st;
for(int i = 1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
st.insert(make_pair(i, j));
}
}
if(k > (n-2)*(n-1)/2) {
cout<<-1<<endl;
return 0;
}
queue<pair<int, int> > que;
for(int i = 1;i<=n-2;i++){
for(int j = i+1;j<=n-1;j++){
que.push(make_pair(i, j));
}
}
rep(i, k){
auto p = que.front();que.pop();
st.erase(p);
}
cout<<st.size()<<endl;
for(auto p : st) {
cout<<p.first<<" "<<p.second<<endl;
}
return 0;
}
| 0
| 42,917,508
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int A[3];
for(int i = 0; i < 3; i++){
scanf("%d",&A[i]);
}
sort(A,A+3);
printf("%d\n",(A[1]-A[0])+(A[2]-A[1]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
const int mod = 1e9 + 7;
typedef long long ll;
int n;
ll gt[maxN], igt[maxN];
int a[maxN], vis[maxN];
ll Pow(ll a, ll b) {
if (b == 0) return 1;
ll t = Pow(a, b / 2);
t = (t * t) % mod;
if (b % 2) return (t * a) % mod;
return t;
}
void init() {
const int maxp = 1e5 + 1;
gt[0] = 1;
for (int i = 1; i <= maxp; ++i) {
gt[i] = (gt[i-1] * i) % mod;
}
igt[maxp] = Pow(gt[maxp], mod - 2);
for (int i = maxp - 1; i >= 0; --i) {
igt[i] = (igt[i+1] * (i+1)) % mod;
}
}
int mul(int x, int y) {
return (1ll * x * y) % mod;
}
int comb(int k, int n) {
if (k > n) return 0;
return mul(mul(gt[n], igt[k]), igt[n-k]);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
init();
cin >> n;
int vt1 = -1, vt2 = -1;
for (int i = 1; i <= n + 1; ++i) {
int x; cin >> x;
if (vis[x]){
vt1 = vis[x]; vt2 = i;
}
vis[x] = i;
}
for (int k = 1; k <= n + 1; ++k) {
cout << (0ll + comb(k, n + 1) - comb(k-1, n-vt2+vt1) + mod) % mod << '\n';
}
return 0;
}
| 0
| 79,561,573
|
#include<iostream>
using namespace std;
int rec(int n, int sum, int max) {
if(sum<0) return 0;
if(!n&&!sum) return 1;
int ans=0;
for(int i = max+1; i<=9; ++i)
ans += rec(n-1, sum-i, i);
return ans;
}
int main() {
int n,s;
while(cin>>n>>s, n||s) {
cout<<rec(n,s,-1)<<endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
ll lcm(ll a,ll b){
ll x = max(a,b);
ll y = min(a,b);
while(x % y != 0){
ll t = x % y;
x = y;
y = t;
}
return a*b/y;
}
int main()
{
ll N,M;
cin>>N>>M;
vector<ll> a(N);
vector<ll> ord(N,0);
for(ll i = 0; i < N; i++){
cin>>a[i];
ll k = a[i];
while(k % 2 ==0){
k /= 2;
ord[i]++;
}
if(ord[i] != ord[0]){
cout<<0<<endl;
return 0;
}
}
ll nLCM = 1;
for(ll i = 0; i < N; i++){
nLCM = lcm(nLCM,a[i]);
if(nLCM > 2*M){
cout<<0<<endl;
return 0;
}
}
ll halfLCM = nLCM / 2;
cout<< (M/halfLCM) - (M/nLCM)<<endl;
return 0;
}
| 0
| 1,049,080
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int r;
cin >> r;
if (r >= 2800) {
cout << "AGC" << endl;
} else if (r >= 1200) {
cout << "ARC" << endl;
} else {
cout << "ABC" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool solve() {
int n; cin >> n;
int cnt[110] = {};
int maxi = 0;
for(int i = 0; i < n; ++i) {
int a; cin >> a;
cnt[a]++;
maxi = max(maxi, a);
}
if(cnt[maxi] < 2) {
return false;
}
cnt[maxi] -= 2;
if(maxi % 2 == 0) {
if(cnt[maxi / 2] < 0) {
return false;
}
--cnt[maxi / 2];
}
for(int i = (maxi + 2) / 2; i < maxi; ++i) {
if(cnt[i] < 2) {
return false;
}
cnt[i] -= 2;
}
for(int i = (maxi + 1) / 2; i > 0; --i) {
if(cnt[i] > 0) {
return false;
}
}
return true;
}
int main() {
cout << (solve() ? "Possible" : "Impossible") << '\n';
return 0;
}
| 0
| 733,773
|
#include <iostream>
#include <vector>
using namespace std;
const int END = -1;
struct StNod
{
int m_nDept;
int m_nParnt;
int m_nLChd;
int m_nRSib;
StNod() :
m_nDept(END), m_nParnt(END), m_nLChd(END), m_nRSib(END)
{ }
};
void fnInput(vector<StNod> &rvoNod)
{
StNod oNod;
int nMaxSiz;
cin >> nMaxSiz;
rvoNod.resize(nMaxSiz, oNod);
for (int i = 0; i < nMaxSiz; i++)
{
int nParnt, nCCnt, nChd, nBChd = END;
cin >> nParnt >> nCCnt;
for (int j = 0; j < nCCnt; j++)
{
cin >> nChd;
rvoNod[nChd].m_nParnt = nParnt;
if (nBChd != END) rvoNod[nBChd].m_nRSib = nChd;
if (!j) rvoNod[nParnt].m_nLChd = nChd;
nBChd = nChd;
}
}
}
void fnSetDepth(vector<StNod> &rvoNod, int nx, int nDept)
{
rvoNod[nx].m_nDept = nDept;
if (rvoNod[nx].m_nRSib != END)
fnSetDepth(rvoNod, rvoNod[nx].m_nRSib, nDept);
if (rvoNod[nx].m_nLChd != END)
fnSetDepth(rvoNod, rvoNod[nx].m_nLChd, nDept + 1);
}
void fnRtdTree(vector<StNod> &rvoNod)
{
int nx = 0, nDept = 0;
while (rvoNod[nx].m_nParnt != END)
nx = rvoNod[nx].m_nParnt;
fnSetDepth(rvoNod, nx, nDept);
}
void fnResult(const vector<StNod> &cnrvoNod)
{
for (int i = 0; i < cnrvoNod.size(); i++)
{
cout << "node " << i << ": parent = " << cnrvoNod[i].m_nParnt << ", depth = " << cnrvoNod[i].m_nDept;
if (!cnrvoNod[i].m_nDept) cout << ", root, ";
else if (cnrvoNod[i].m_nLChd == END) cout << ", leaf, ";
else cout << ", internal node, ";
cout << "[";
if (cnrvoNod[i].m_nLChd != END)
{
int nx = cnrvoNod[i].m_nLChd;
cout << nx;
while (cnrvoNod[nx].m_nRSib != END)
{
cout << ", " << cnrvoNod[nx].m_nRSib;
nx = cnrvoNod[nx].m_nRSib;
}
}
cout << "]" << endl;
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
vector<StNod> voNod;
fnInput(voNod);
fnRtdTree(voNod);
fnResult(voNod);
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
string S; cin >> S;
string S1, S2;
int L = 0, R = 0;
rep(i, N) {
if (S[i] == '(') L++;
else if (S[i] == ')') R++;
if (L < R) {
S1 += '(';
L++;
}
}
while(R < L) {
S2 += ')';
R++;
}
cout << S1 << S << S2 << endl;
return 0;
}
| 0
| 42,144,652
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5,M=1e6+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a) memset(a,0,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
int main(){
int n,k,x,y;
cin>>n>>k>>x>>y;
int ans=0;
if(n<=k) ans+=n*x;
else if(n>k) ans+=k*x+(n-k)*y;
cout<<ans;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MMOD 998244353
#define MAX 2010101
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,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 main(){
ll N;
cin>>N;
ll X[N+2];
X[0]=0,X[N]=INF;
RREP(i,N) cin>>X[i];
ll L;
cin>>L;
ll DP[N+1][25];
RREP(i,N) DP[i][0]=upper_bound(X,X+N+2,X[i]+L)-X-1;
REP(i,20) RREP(j,N) DP[j][i+1]=DP[DP[j][i]][i];
ll Q;
cin>>Q;
REP(q,Q){
ll A,B;
cin>>A>>B;
if(A>B) swap(A,B);
ll ans=0;
for(ll i=20; i>=0; --i){
if(DP[A][i]<B){
A=DP[A][i];
ans+=(1<<i);
}
}
cout<<ans+1<<endl;
}
return 0;
}
| 0
| 89,207,165
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main(){
ll r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, 3001) rep(j, 3001){
if(i*r + j*g <= n && (n - (i*r + j*g))%b == 0) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define dmp(x) cerr << #x << ": " << x << endl;
template <class T>
void chmin(T &a, const T &b) {
if (a > b) a = b;
}
template <class T>
void chmax(T &a, const T &b) {
if (a < b) a = b;
}
template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T>
vector<T> vect(int len, T elem) {
return vector<T>(len, elem);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size()) os << ' ';
}
return os;
}
template <class T>
istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
#define endl "\n"
void solve() {
vector<int> a(4);
vector<int> b = {1,4,7,9};
cin >> a;
sort(all(a));
if(a==b)cout << "YES" << endl;
else cout << "NO" << endl;
return;
}
signed main() {
fastio();
solve();
return 0;
}
| 0
| 24,058,938
|
#include <stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
if (A==2 && B==1 || A==1 && B==2) {
printf("3");
}
else if (A==3 && B==1 || A==1 && B==3) {
printf("2");
}
else if (A==3 && B==2 || A==2 && B==3) {
printf("1");
}
return 0;
}
|
#include <iostream>
using namespace std;
bool a[101] = {0};
int main(){
int n, k;
cin >> n >> k;
while(k--){
int d; cin >> d;
for(int i=0; i<d; i++){
int ai; cin >> ai;
a[ai] = 1;
}
}
int res = 0;
for(int i=1; i<=n; i++)
if (a[i] == 0) res++;
cout << res << endl;
}
| 0
| 82,699,187
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
int main(){
int n,m,k;
while(cin>>n>>m>>k,n){
vi a(n);
rep(i,n)cin>>a[i];
sort(all(a),[](int a,int b){return a>b;});
int out=0;
int outa=0;
loop(i,m,k+1){
int t=a[i-1]-a[i];
if(out<=t){
out=t;
outa=i;
}
}
cout<<outa<<endl;
}
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
using namespace std;
int main()
{
int num = 0;
while (cin >> num && num != 0)
{
string dat;
int l = 0, r = 0, h = 0, ans = 0;
rep(i, num)
{
cin >> dat;
switch (dat[0])
{
case 'r':
if (dat[1] == 'u') { r++; h++; }
else { r--; h--; }
break;
case 'l':
if (dat[1] == 'u') { l++; h++; }
else { l--; h--; }
break;
}
if (r + l + h == 4) { ans++; r = 0; l = 0; h = 0; }
else if (r + l + h == -4) {ans++; r = 0; l = 0; h = 0;}
}
printf("%d\n", ans);
}
return 0;
}
| 0
| 33,967,949
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
int N, A, B, C;
int seq[4] = {0, 1, 2, 3};
int ANS = 100000;
int calcMP(map<int, int> m)
{
if (m[1] == 0 || m[2] == 0 || m[3] == 0)
return 10000;
return abs(A - m[1]) + abs(B - m[2]) + abs(C - m[3]);
}
int dfs(int depth, int l[], map<int, int> m, int mp)
{
if (depth == 0)
{
mp += calcMP(m);
return mp;
}
for (auto s : seq)
{
int tmp = mp;
map<int, int> mm = m;
if (mm[s] == 0)
{
mm[s] = l[depth - 1];
}
else
{
mm[s] += l[depth - 1];
if (s != 0)
tmp += 10;
}
tmp = dfs(depth - 1, l, mm, tmp);
ANS = min(ANS, tmp);
}
return ANS;
}
int main()
{
cin >> N >> A >> B >> C;
int l[N];
rep(i, N) cin >> l[i];
int mp = 0;
map<int, int> m{
{0, 0}, {1, 0}, {2, 0}, {3, 0}};
dfs(N, l, m, mp);
cout << ANS;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i, k , n) for(int i = k; i <= n; i++)
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int a, b; cin >> a >> b;
int ans = 0;
REP(i, a, b)
{
int tmp = i;
int res = 0;
while(tmp)
{
res = res*10 + tmp%10;
tmp /=10;
}
if(res== i)
ans++;
}
cout << ans << nl;
return 0;
}
| 0
| 41,265,044
|
#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline void open(const char *s)
{
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str,"%s.in",s);
freopen(str,"r",stdin);
#endif
}
inline int rd()
{
static int x,f;
x=0;f=1;
char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
return f>0?x:-x;
}
const int N=100010;
int n,L,T,a[N];
int main()
{
n=rd();L=rd();T=rd();
ll p=1;
fo(i,1,n){
int x=rd(),y=rd();
if(y==1){
a[i]=(x+T)%L;
p=(p+(x+T)/L%n)%n;
}
else{
a[i]=(x-T%L+L)%L;
p=(p+n-(T+L-1-x)/L%n)%n;
}
}
sort(a+1,a+n+1);if(p==0)p=n;
fo(i,p,n)printf("%d\n",a[i]);
fo(i,1,p-1)printf("%d\n",a[i]);
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> arr(n, 0);
int m;
cin >> m;
while(m--){
int x, y;
cin >> x >> y;
x--, y--;
arr[x]++, arr[y]++;
}
int f = 0;
for(int i = 0; i < n; i++){
if(arr[i] %2 == 1) f = 1;
}
cout << (f == 1? "NO" : "YES");
}
| 0
| 35,568,196
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
for(int i=0; i<n; i++) cin>>a[i];
int64_t kabu = 0;
int64_t money = 1000;
for(int i=0; i<n-1; i++) {
int64_t add = money/a[i];
kabu += add;
money -= add*a[i];
if(a[i]>a[i+1]) {
money += a[i]*kabu;
kabu = 0;
}
}
money += a[n-1]*kabu;
kabu = 0;
cout<<money<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long x[100009],y[100009];
long long use[1000];
char mp[4] = {'R','D','L','U'};
int main()
{
long long N,M,i,j,k = 0,now = 1;
vector<long long> temp;
cin >> N;
for(i = 0;i < N;i++)
{
cin >>x[i] >> y[i];
if((x[i] + y[i]) % 2 == 0)
{
k++;
}
}
if(k != N && k != 0)
{
cout << -1 <<endl;
return 0;
}
cout << 40 <<endl;
now = 1;
if(k == N)
{
use[0] = 1;
use[1] = 1;
for(i = 0;i < N;i++)
{
x[i]--;
}
}
else
{
use[0] = 1;
use[1] = 2;
}
cout << use[0] << " " << use[1] << " ";
for(i = 2;i < 40;i++)
{
use[i] = use[i-1]*2;
cout << use[i] << " ";
}
cout <<endl;
for(i = 0;i < N;i++)
{
temp.clear();
for(j = 39;j > 0;j--)
{
if(abs(x[i]) > abs(y[i]))
{
if(x[i] > 0)
{
temp.push_back(2);
x[i] -= use[j];
}
else
{
temp.push_back(0);
x[i] += use[j];
}
}
else
{
if(y[i] > 0)
{
temp.push_back(1);
y[i] -= use[j];
}
else
{
temp.push_back(3);
y[i] += use[j];
}
}
}
if(k == N)
{
temp.push_back(2);
}
else
{
if(abs(x[i]) > abs(y[i]))
{
if(x[i] > 0)
{
temp.push_back(2);
}
else
{
temp.push_back(0);
}
}
else
{
if(y[i] > 0)
{
temp.push_back(1);
}
else
{
temp.push_back(3);
}
}
}
for(j = temp.size()-1;j >= 0;j--)
{
cout << mp[(temp[j]+2) % 4];
}
cout << endl;
}
}
| 0
| 13,007,487
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>> a>>b;
if(a==1&&b!=1)
{
cout<<"Alice"<<"\n";
}
else if(b==1 && a!=1)
{
cout <<"Bob"<<"\n";
}
else if(a==b)
{
cout<<"Draw"<<"\n";
}
else if (a>b)
{
cout<<"Alice"<<"\n";
}
else
{
cout <<"Bob"<<"\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum = 0;
for(int i=0; i<n; i++) {
cin >> a[i];
sum += a[i];
}
bool ans = false;
double check = double(sum) / (4*double(m));
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int cnt = 0;
for(int i=0; i<m; i++) {
if(a[i] >= check) cnt++;
}
if(cnt == m) ans = true;
if(ans) puts("Yes");
else puts("No");
}
| 0
| 76,626,664
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
bool flag=false;
int len=s.size();
for(int i=1;i<s.size();i++){
if((len-i)%2!=0)continue;
else{
string str1=s.substr(0,(len-i)/2);
string str2=s.substr((len-i)/2,(len-i)/2);
if(str1==str2){
cout<<len-i<<endl;
return 0;
}
}
}
return 0;
}
|
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<set>
#include <valarray>
#include<stack>
#include<sstream>
#include<math.h>
using namespace std;
void Solution()
{
int H, W;
while(cin>>H>>W)
{
if (H == 0 || W == 0)
{
break;
}
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cout<<"#";
}
cout<<endl;
}
cout<<endl;
}
}
int main()
{
Solution();
return 0;
}
| 0
| 62,508,258
|
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
int main()
{
ll K;
ll a[50];
cin >> K;
ll t = (ll)(K/50);
cout << 50 << endl;
rep(i,50)
{
a[i] = i-K%50;
if(a[i]<0)
a[i]+=51;
cout << a[i]+t << " ";
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
using namespace std;
using ll = long long;
using ld = long double;
const int mxn = 110;
const int inf = 1e5+5;
int b[mxn];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ans = 0;
int n; cin>>n;
for(int i=0; i<n-1; i++) cin>>b[i];
b[n-1] = inf;
ans+=b[0];
for(int i=1; i<n; i++) ans+=min(b[i-1], b[i]);
cout << ans << '\n';
return 0;
}
| 0
| 75,950,487
|
#include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << x << std::endl
using ll = long long;
using ld = long double;
constexpr ll MOD = 1000000007LL;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 10;
std::mt19937 mt{std::random_device{}()};
int main()
{
int N;
std::cin >> N;
int n = 1;
for (int sum = 0; sum < N; n++) {
sum += n;
if (sum > N) { return std::cout << "No" << std::endl, 0; }
}
n--;
std::cout << "Yes\n"
<< n + 1 << std::endl;
std::vector<std::vector<int>> ans(n + 1);
int s = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i; j++, s++) {
ans[i].push_back(s);
ans[i + j + 1].push_back(s);
}
}
for (int i = 0; i <= n; i++) {
std::cout << n;
for (const int e : ans[i]) { std::cout << " " << e; }
std::cout << std::endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
vector<int> i;
vector<int> u;
int o[11000000];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long a=0,b,c,d=0,e=0,f=0,g;
string s;
cin >>a;
for(int n=1;n<=a;n++){
d+=n;
o[n]=1;
if(d>a){
o[d-a]=0;
break;
}
if(d==a) break;
}
for(int n=1;n<=a;n++){
if(o[n]==1) cout <<n<<'\n';
}
return (0);
}
| 0
| 15,924,929
|
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descsort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main(void)
{
int n;
cin>>n;
int ans=0;
rep(i,1,(n+1)/2){
if(i+(n-i)==n)ans++;
}
cout<<ans<<endl;
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 ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int main(){
int a,b,k;
cin >> a >> b >> k;
rep(i,k){
if(i%2==0){
b += a/2;
a /= 2;
}else{
a += b/2;
b /= 2;
}
}
cout << a << " " << b << endl;
return 0;
}
| 0
| 79,716,865
|
#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(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
bool ans = true;
sort(a.begin(), a.end());
rep(i, n){
if(a[i] == a[i+1]){
ans = false;
break;
}
}
if(ans) cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#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
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 = 1100000;
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; }
struct Timer{
chrono::system_clock::time_point start, end;
Timer(){ start = chrono::system_clock::now(); }
~Timer(){
end = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(end - start).count();
cerr<<"time : "<<msec<<" ms"<<endl;
}
};
void solve(){
ll n,m;
cin>>n>>m;
string a[60],b[60];
rep(i,n) cin>>a[i];
rep(i,m) cin>>b[i];
rep(i,n){
if(i+m>n) break;
rep(j,n){
if(j+m>n) break;
bool ok=true;
rep(k,m){
rep(l,m){
if(a[i+k][j+l]!=b[k][l]){
ok=false;
}
}
}
if(ok){
cout<<"Yes"<<endl;
return ;
}
}
}
cout<<"No"<<endl;
return ;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 0
| 33,916,441
|
#include<stdio.h>
#include<algorithm>
using namespace std;
#define NIL -2000000001
#define MAX 250
int A[MAX];
void printHeap(int n) {
for ( int i = 0; i < n; i++ ) {
printf("node %d: key = %d, ", i+1, A[i]);
if (i+1 != 1) {
printf("parent key = %d, ", A[(i+1)/2-1]);
}
if (A[2*(i+1)-1] != NIL && 2*(i+1)-1 < MAX) {
printf("left key = %d, ", A[2*(i+1)-1]);
}
if (A[2*(i+1)+1-1] != NIL && 2*(i+1)+1-1 < MAX) {
printf("right key = %d, ", A[2*(i+1)+1-1]);
}
printf("\n");
}
}
int main() {
for ( int i = 0; i < MAX; i++ ) {
A[i] = NIL;
}
int n;
scanf("%d", &n);
for ( int i = 0; i < n; i++ ) {
scanf("%d", &A[i]);
}
printHeap(n);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,s=0;
string str;
cin>>str;
for(int i=0;i<str.size();i++){
int j=str[i]-48;
s+=j;
}
if(s%9==0)
cout<<"Yes";
else cout<<"No";
}
| 0
| 23,829,151
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
intt N, K, R, S, P; std::cin >> N >> K >> R >> S >> P;
std::string T; std::cin >> T;
intt ans = 0;
for (int i = 0; i < K; ++i) {
std::string s;
int j = i;
while (j < N) {
s.push_back(T[j]);
j += K;
}
int t = 0;
for (int k = 0; k < s.size(); ++k) {
if (k > 0 && s[k] == s[k - 1] && t == 1) {
t = 0;
continue;
}
else {
if (s[k] == 'r')
ans += P;
else if (s[k] == 's')
ans += R;
else if (s[k] == 'p')
ans += S;
t = 1;
}
}
}
std::cout << ans << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
template<typename T = int>
class WeightedUnionFind
{
public:
WeightedUnionFind(int n = 0, T unity = 0) : m_data(n, -1), m_weight(n, unity), m_count(n) {}
int find(int x)
{
if (m_data[x] < 0) return x;
int root = find(m_data[x]);
m_weight[x] += m_weight[m_data[x]];
return m_data[x] = root;
}
T weight(int x)
{
find(x);
return m_weight[x];
}
bool unite(int x, int y, T w)
{
w += weight(x), w -= weight(y);
x = find(x), y = find(y);
if (x == y) return false;
if (m_data[x] > m_data[y]) {
swap(x, y);
w = -w;
}
m_data[x] += m_data[y];
m_data[y] = x;
m_weight[y] = w;
m_count--;
return true;
}
bool same(int x, int y) { return find(x) == find(y); }
T diff(int x, int y) { return weight(y) - weight(x); }
int size(int x) { return -m_data[find(x)]; }
int count(void) const { return m_count; }
private:
vector<int> m_data;
vector<T> m_weight;
int m_count;
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
WeightedUnionFind<int> uf(n);
for (int i = 0; i < m; i++) {
int l, r, d; cin >> l >> r >> d; l--, r--;
if (!uf.same(l, r)) {
uf.unite(l, r, d);
} else {
if (d != uf.diff(l, r)) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 35,547,339
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Y, k;
cin >> N >> Y;
string a = "no";
if(Y%1000==0){
for(int i=Y/10000;i>=0;i--){
for(int j=(Y-10000*i)/5000;j>=0;j--){
k= (Y-10000*i-5000*j)/1000;
if(i+j+k==N){
cout << i <<" " <<j <<" " << k <<endl;
a="Yes";
break;
}
}
if(a=="Yes")break;
}
}
if(a=="no"){
cout <<-1 <<" " << -1 << " " << -1 <<endl;
}
}
|
#include <iostream>
#define endl '\n'
#define pb push_back
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
void solve()
{
int a, b;
cin >> a >> b;
int pal = 0;
for(int i = a; i <= b; i++)
{
string s;
int temp = i, sz = 0;
while(temp != 0)
{
s.pb(temp%10 + 48);
temp /= 10;
++sz;
}
int half = sz/2;
bool palindrome = true;
for(int j = 0; j < half; j++)
{
if(s[j] != s[sz-j-1])
{
palindrome = false;
break;
}
}
if(palindrome)
pal++;
}
cout << pal;
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| 0
| 11,341,994
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
map<string,int>m;
map<string,int>:: iterator itr;
int n,chk1=0,chk2=0;
cin>>n;
cin>>s;
char last=s[s.length()-1];
m[s]=1;
for(int i=1; i<n; i++)
{
cin>>s;
m[s]++;
if(chk1==0)
{
if(s[0]==last)
{
chk1=0;
}
else if(s[0]!=last)
{
chk1=1;
}
last=s[s.length()-1];
}
}
if(chk1==1)
cout<<"No";
else
{
for(itr=m.begin();itr!=m.end();itr++){
if(itr->second>1){
chk2=1;
break;
}
}
if(chk2==0) cout<<"Yes";
else cout<<"No";
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD =1000000007;
ll modPow(ll a, ll n) {
if (n == 0) return 1;
if (n == 1) return a % MOD;
if (n % 2 == 1) return (a * modPow(a, n - 1)) % MOD;
ll t = modPow(a, n / 2);
return (t * t) % MOD;
}
ll modComb(ll n,ll a){
ll x=1,y=1;
rep(i,a){
x*=n-i;
x%=MOD;
y*=i+1;
y%=MOD;
}
y=modPow(y,MOD-2);
return (x*y)%MOD;
}
int main(){
ll N,ans=0;
cin >> N;
vector<ll> A(N),Pow(61);
vector<P> B(60,P(0,0));
rep(j,61){
Pow.at(j)=(ll)pow(2,j);
}
rep(i,N){
cin >> A.at(i);
rep(j,60){
if(A.at(i)%Pow.at(j+1)>A.at(i)%Pow.at(j)){
B.at(j).first++;
}else{
B.at(j).second++;
}
}
}
rep(j,60){
ans+=((B.at(j).first*B.at(j).second)%MOD)*modPow(2,j);
ans%=MOD;
}
cout << ans << endl;
}
| 0
| 93,039,896
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
VI a(n+2,0);
rep(i,n) cin >> a[i+1];
VI to(n+2,0), from(n+2,0);
rep(i,n+1){
to[i+1] = to[i] + abs(a[i+1] - a[i]);
int j = n-i;
from[j] = from[j+1] + abs(a[j+1] - a[j]);
}
rep(i,n){
int j = i+1;
cout << (to[j-1] + abs(a[j+1] - a[j-1]) + from[j+1]) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,x,m;
cin >> n >> x >> m;
vector<ll> spare(m, -1);
ll now = x;
rep(i,m){
if(spare[now] != -1) break;
else{
spare[now] = i;
now = now*now%m;
}
}
ll start = spare[now];
ll end = i;
ll shuuki = end-start;
now = x;
ll ans = 0;
for(i = 0;i < start;++i){
ans += now;
now = now*now%m;
--n;
if(n == 0){
cout << ans << endl;
return 0;
}
}
ll kurikaesi = 0;
for(i = start;i < end;++i){
kurikaesi += now;
now = now*now % m;
}
ans += n/shuuki*kurikaesi;
n %= shuuki;
while(n){
ans += now;
now = now*now%m;
--n;
}
cout << ans << endl;
return 0;
}
| 0
| 29,901,266
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans= c - a + b;
if(ans<0) ans=0;
cout << ans << endl;
}
|
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
int N,A,B,C;
int l[8];
int dfs(int k,int a,int b,int c){
while(k<=N){
if(k==N){
if(min(a,min(b,c))>0){
return abs(a-A)+abs(b-B)+abs(c-C)-30;
}
else{
return 9999999;
}
}
else{
int w=dfs(k+1,a,b,c);
int x=dfs(k+1,a+l[k],b,c)+10;
int y=dfs(k+1,a,b+l[k],c)+10;
int z=dfs(k+1,a,b,c+l[k])+10;
return min(min(w,x),min(y,z));
}
}
}
int main(){
cin>>N>>A>>B>>C;
for(int i=0;i<N;i++){
cin>>l[i];
}
cout<<dfs(0,0,0,0)<<endl;
return 0;
}
| 0
| 38,578,620
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
int main()
{
int n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100000];
int main() {
const int INF = 1e9;
int n, k;
while(~scanf("%d%d", &n, &k) && n) {
for(int i = 0; i < n; ++i) scanf("%d", a + i);
int sum = 0, ans = -INF;
for(int i = 0; i < n; ++i) {
sum += a[i];
if(i < k - 1) continue;
if(i >= k) sum -= a[i - k];
ans = max(ans, sum);
}
printf("%d\n", ans);
}
}
| 0
| 96,919,413
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int arr[n],pre[n]={0},suf[n]={0},w=0,min=INT_MAX;
for(int i=0;i<n;i++)
{
cin>>arr[i];
w+=arr[i];
pre[i]=w;
}
w=0;
for(int i=n-1;i>=0;i--)
{
w+=arr[i];
suf[i]=w;
}
for(int i=0;i<n-1;i++)
{
if(min>abs(pre[i]-suf[i+1]))
min=abs(pre[i]-suf[i+1]);
if(min==0)
{
cout<<0;
return 0;
}
}
cout<<min;
}
|
#include <stdio.h>
int ng[16][16];
int rec(int x, int y){
if(ng[x][y]) return 0;
if(x == 0 && y == 0) return 1;
if(x == 0) return rec(0, y-1);
if(y == 0) return rec(x-1, 0);
return rec(x-1, y) + rec(x, y-1);
}
int main(void){
int h, w, n, x, y, a, b;
while(scanf("%d%d", &h, &w) && (h||w)){
h--; w--;
for(x = 0; x <= h; x++){
for(y = 0; y <= w; y++){
ng[x][y] = 0;
}
}
scanf("%d", &n);
for(x = 0; x < n; x++){
scanf("%d%d", &a, &b);
ng[a-1][b-1] = 1;
}
printf("%d\n", rec(h, w));
}
return 0;
}
| 0
| 76,656,958
|
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
#define PI acos(-1)
typedef long long ll ;
typedef unsigned long long ull;
const double eps= (1e-9);
using namespace std;
int dcmp(long double a,long double b){ return fabsl(a-b)<=eps ? 0: (a>b)? 1:-1 ;}
int getBit(ll num, int idx) {return ((num >> idx) & 1ll) == 1;}
int setBit1(int num, int idx) {return num | (1<<idx);}
ll setBit0(ll num, int idx) {return num & ~(1ll<<idx);}
ll flipBit(ll num, int idx) {return num ^ (1ll<<idx);}
void GO(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
int countNumBit1(int mask) {int ret=0; while (mask) {mask &= (mask-1);++ret; }return ret;}
const int N=300000+5,mod=1e9+7;
int Cnt_r[N],Cnt_c[N],r[N],c[N],vis[N];
vector<int> v[N];
int main(){
GO();
int n,m;
cin>>n>>m;
int cnt;
cin>>cnt;
int mx=0;
for(int i=0;i<cnt;i++){
cin>>r[i]>>c[i];
Cnt_r[r[i]]++;
Cnt_c[c[i]]++;
mx=max(mx,Cnt_c[c[i]]);
v[c[i]].pb(r[i]);
}
int tot=0;
for(int i=1;i<=300000;i++){
if(Cnt_c[i]==mx){
for(int j=0;j<sz(v[i]);j++){
int rw=v[i][j];
vis[rw]++;
}
tot++;
}
}
int res=0;
for(int i=1;i<=300000;i++){
int ans= Cnt_r[i]+(vis[i]!=tot?mx:mx-1);
res=max(res,ans);
}
cout<<res<<"\n";
}
|
#include "bits/stdc++.h"
using namespace std;
const long long int MOD_JOHAN {1000000007};
const long long int MOD_LIGHT {998244353};
const long long int MAXN_EYEPATCH = 1e6 + 1LL;
const long long int MAXN_FULLMETAL = 501LL;
typedef long long int lld;
typedef unsigned long long int llu;
typedef vector<int> v_int;
typedef vector<lld> v_lld;
typedef vector<string> v_str;
typedef pair<int, int> p_int;
typedef pair<lld, lld> p_lld;
#define GREED_FOR_SPEED ios_base::sync_with_stdio(false); cin.tie(0)
#define TESTCASES_ARE_THERE() _SC4N(Test0xcs); TotalT35tC4ses = Test0xcs; while(Test0xcs--)
#define _INP47T(V3CT07_) for(auto &V3CT07____IT7T : V3CT07_) cin >> (V3CT07____IT7T)
#define mems(A77AY,V4LU) memset((A77AY), V4LU, sizeof((A77AY)))
#define FOR4WD(IT7T, ST47T, E9xD, St3P) for(auto IT7T = ST47T; IT7T < E9xD; IT7T += St3P)
#define FOR8WD(IT7T, ST47T, E9xD, St3P) for(auto IT7T = ST47T; IT7T > E9xD; IT7T -= St3P)
#define FOR4NGE(IT7T, ST47T, E9xD, St3P) for(auto IT7T = ST47T;((St3P<0) ? IT7T>E9xD : IT7T<E9xD); IT7T += St3P)
#define FOR34CH(V3CT07_, IT7T) for(auto IT7T = V3CT07_.begin(); IT7T != V3CT07_.end(); IT7T++)
#define FORA77L(V3CT07_s, IT7T) for (auto IT7T : V3CT07_s)
#define AL47L(V3CT07_t) V3CT07_t.begin(), V3CT07_t.end()
#define L3N(V3CT07_x, Typ30F) (Typ30F) V3CT07_x.size()
#define endl "\n"
#define PI 3.1415926535897932384626433832795
#define INF1N1TY 1000000000000000005LL;
#define un_map unordered_map
#define un_set unordered_set
template<typename T> void _SC4N(T &x) {
x = 0; bool neg = 0;
register T c = getchar();
if (c == '-') neg = 1, c = getchar();
while ((c < 48) || (c > 57)) c = getchar();
for ( ; c < 48||c > 57 ; c = getchar());
for ( ; c > 47 && c < 58; c = getchar() ) x= (x << 3) + ( x << 1 ) + ( c & 15 );
if (neg) x *= -1;
}
template <typename Type30F1, typename Type30F2> class _C0UN73R {
public: map <Type30F1, Type30F2> CountOfElements;
private: static bool asc(pair<Type30F1, Type30F2>& a, pair<Type30F1, Type30F2>& b) {
return (a.second < b.second);
}
private: static bool dsc(pair<Type30F1, Type30F2>& a, pair<Type30F1, Type30F2>& b) {
return (a.second > b.second);
}
public: _C0UN73R(vector<Type30F1> ArrayToCountValues) {
for (auto elementInArray : ArrayToCountValues) {
CountOfElements[elementInArray]++;
}
}
map <Type30F1, Type30F2> getCountAsMap() {
return CountOfElements;
}
vector<pair<Type30F1, Type30F2>> getSortedVectorPair(bool reverse = false) {
vector<pair<Type30F1, Type30F2>> SortedVector;
for (auto& it : CountOfElements) SortedVector.push_back(it);
if (reverse) {
sort(SortedVector.begin(), SortedVector.end(), dsc);
} else {
sort(SortedVector.begin(), SortedVector.end(), asc);
}
return SortedVector;
}
};
void printYesNo(bool Expr, int YNType = 1, string FirstChoice = "Ud", string SecondChoice = "Ud") {
if (YNType == 1) puts(Expr ? "YES" : "NO");
else if (YNType == 2) puts(Expr ? "Yes" : "No");
else if (YNType == 3) puts(Expr ? "yes" : "no");
else if (YNType == 4) cout << (Expr ? FirstChoice : SecondChoice);
}
void solveEach(lld T35TC453N = 1) {
lld n, m; cin >> n >> m;
v_lld arr(n); _INP47T(arr);
lld totalNumberOfVotes = accumulate(AL47L(arr), 0LL);
sort(AL47L(arr), greater<int>());
printYesNo((float)arr[m-1]>=((float)totalNumberOfVotes/(4*m)), 2);
return;
}
signed main() {
lld Test0xcs = 0, TotalT35tC4ses = 1;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solveEach(TotalT35tC4ses - Test0xcs);
return 0;
}
| 0
| 12,736,214
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, yard;
cin >> x >> y;
yard = (x * y) - (x + y) + 1;
cout << yard << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int w, h;
cin >> w >> h;
vector<pair<ll, bool>> v;
for (int i = 0; i < w; i++) {
int p;
cin >> p;
v.emplace_back(p, true);
}
for (int i = 0; i < h; i++) {
int q;
cin >> q;
v.emplace_back(q, false);
}
sort(v.begin(), v.end());
ll ret = 0;
for (auto x:v) {
if (x.second) {
ret += x.first * (h + 1);
w--;
} else {
ret += x.first * (w + 1);
h--;
}
}
cout << ret << endl;
return 0;
}
| 0
| 91,804,045
|
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};
int main() {
ll K;
cin >> K;
if (K < 50) {
cout << 50 << endl;
cout << 50 * K << " ";
for (int i = 0; i < 49; i++) {
cout << 0 << " ";
}
cout << endl;
return 0;
}
ll d = K / 50;
ll r = K % 50;
ll left = (50 + d - 1) - r;
ll leftsize = 50 - r;
ll right = left + 51;
ll rightsize = r;
cout << 50 << endl;
for (int i = 0; i < leftsize; i++) {
cout << left << " ";
}
for (int i = 0; i < rightsize; i++) {
cout << right << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
void yes(){
cout << "Yes" << endl;
}
void no (){
cout << "No" << endl;
}
ll cel (ll a, ll b){
if (a % b == 0) return a / b;
else return a / b + 1;
}
ll gcds(ll a, ll b){
ll c = a % b;
while (c != 0){
a = b;
b = c;
c = a % b;
}
return b;
}
int main() {
int n, m; cin >> n >> m;
if (n % m == 0) cout << 0 << endl;
else cout << 1 << endl;
}
| 0
| 87,900,465
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
string ss,t;
cin >> ss >> t;
reverse(all(ss));
reverse(all(t));
string ans = "";
rep(i,sz(ss) - sz(t) + 1)
{
string buf = ss.substr(i,sz(t));
bool is = true;
rep(j,sz(t))
{
if(buf[j] == '?') continue;
if(buf[j] == t[j]) continue;
is = false;
break;
}
if(is)
{
ans = ss.substr(0,i) + t + ss.substr(i + sz(t));
reverse(all(ans));
rep(i,sz(ans))
{
if(ans[i] == '?')
ans[i] = 'a';
}
break;
}
}
if(ans == "")
cout << "UNRESTORABLE" << endl;
else
cout << ans << endl;
return 0;
}
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
}
long long Combi::nPk_modp(long long n, long long k, long long p)
{
ll ans = 1;
for(long long i = k; i <= n; i++)
{
ans = (ans * i) % p;
}
return ans;
};
|
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define pb(x) push_back(x)
#define MP(x,y) make_pair(x,y)
using namespace std;
ll gcd(ll a,ll b)
{
if(a%b==0)
return b;
else
return gcd(b,a%b);
}
int hashe[5];
void solve()
{
int a,b;
cin>>a>>b;
hashe[a]++,hashe[b]++;
cin>>a>>b;
hashe[a]++,hashe[b]++;
cin>>a>>b;
hashe[a]++,hashe[b]++;
sort(hashe,hashe+5);
if(hashe[4]==2&&hashe[3]==2&&hashe[2]==1&&hashe[1]==1)
{
cout<<"YES";
}
else{
cout<<"NO";
}
}
int main()
{
int t=1;
while(t--)
solve();
return(0);
}
| 0
| 92,141,855
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int,int>;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
const double pi = acos(-1);
const double EPS = 1e-10;
vi solve(int i,int j,vii ans){
vi res(i);
if (j == 0) {
REP(k,i) res[k] = k+1;
return res;
} else {
for (int k = 0; k < i; k++) {
if(k < j){
res[k] = ans[k][j-1];
}else if(k == j){
res[k] = ans[j-1].back() + 1;
}else{
res[k] = res[k-1] + 1;
}
}
return res;
}
}
int main(){
int n;
cin >> n;
bool flag = false;
int i = 1;
for (; i*(i+1)/2 <= n; i++) {
if (i*(i+1)/2 == n) {
flag =true;
break;
}
}
if (flag) {
cout << "Yes" << endl;
cout << i+1 << endl;
vii ans;
REP(j,i+1){
cout << i;
ans.pb(solve(i,j,ans));
REP(k,i){
cout << " " << ans[j][k];
}
cout << endl;
}
} else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
vector<pair<char, int>> run_length_encoding(const string &s) {
vector<pair<char, int>> ans;
int num = 1;
for (int i = 0; i < (int)s.size() - 1; ++i) {
if (s[i] == s[i + 1]) {
num++;
}
else {
ans.emplace_back(make_pair(s[i], num));
num = 1;
}
}
ans.emplace_back(make_pair(s.back(), num));
return ans;
}
void solve() {
string s; cin >> s;
auto v = run_length_encoding(s);
ll res = 0;
rep(i, (int)v.size()){
if(i != v.size()-1 && v[i].first == '<' && v[i+1].first == '>'){
res -= min(v[i].second, v[i+1].second);
}
res += (ll)(v[i].second+1)*v[i].second/2;
}
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 59,215,076
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL<<60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
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; }
vector<int> compress(vector<int> &v){
int N = v.size(), mn = 1000000000;
vector<int> res(N);
vector<pair<int,int>> a(N);
for(int i=0; i<N; ++i){
a[i].first = v[i];
a[i].second = i;
mn = min(mn, v[i]);
}
sort(a.begin(), a.end());
int prev = mn-1, n = -1;
for(int i=0; i<N; ++i){
if(a[i].first == prev) res[a[i].second] = n;
else{
n++;
prev = a[i].first;
res[a[i].second] = n;
}
}
return res;
}
int main(void){
int N; cin >> N;
VI A(N); REP(i,N) cin >> A[i];
A = compress(A);
int ans = 0;
REP(i,N/2) if(A[2*i+1]%2 == 0) ans++;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = S.at(0)-'0';
int b = S.at(1)-'0';
int c = S.at(2)-'0';
int d = S.at(3)-'0';
if (a+b+c+d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'+',c,'+',d);
else if (a+b+c-d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'+',c,'-',d);
else if (a+b-c+d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'-',c,'+',d);
else if (a+b-c-d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'-',c,'-',d);
else if (a-b+c+d==7) printf("%d%c%d%c%d%c%d=7", a,'-',b,'+',c,'+',d);
else if (a-b+c-d==7) printf("%d%c%d%c%d%c%d=7", a,'-',b,'+',c,'-',d);
else if (a-b-c+d==7) printf("%d%c%d%c%d%c%d=7", a,'-',b,'-',c,'+',d);
else if (a-b-c-d==7) printf("%d%c%d%c%d%c%d=7", a,'-',b,'-',c,'-',d);
}
| 0
| 20,679,799
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
map<string, int> a;
for(int i=0; i<n; i++) {
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}
int64_t ans = 0;
vector<int64_t> memo(100001, -1);
for(pair<string, int64_t> p : a) {
if(p.second>1) ans += p.second*(p.second-1)/2;
}
cout << ans << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int A[100000];
int ch[100000] = {};
bool used[100000] = {};
vector<int> G[100000];
int dfs(int v) {
used[v] = true;
if (G[v].size() == 1) {
ch[v] = A[v];
}
int max_ch = 0;
for (int i = 0; i < G[v].size(); i++) {
if (!used[G[v][i]]) {
int cur_ch = dfs(G[v][i]);
ch[v] += cur_ch;
max_ch = max(max_ch, cur_ch);
}
}
if (v != 0 && G[v].size() >= 3 && ch[v] - A[v] > ch[v] - max_ch) {
return ch[v] = -1;
}
if ((v != 0 && G[v].size() == 2 && ch[v] != A[v]) || A[v] > ch[v]) {
return ch[v] = -1;
}
return ch[v] = 2 * A[v] - ch[v];
}
signed main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
G[a - 1].push_back(b - 1);
G[b - 1].push_back(a - 1);
}
if (dfs(0) != 0) {
cout << "NO" << endl;
return 0;
}
for (int i = 0; i < N; i++) {
if (ch[i] < 0) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 91,049,150
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <memory>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long int;
using vi = vector<int>;
using vvi = vector<vi>;
#define _LIBCPP_DEBUG 0
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
long long Q, H, S, D, N;
cin >> Q >> H >> S >> D >> N;
S = min(S, min(H*2, Q*4));
if (N == 1) cout << S << endl;
else {
if (D >= 2*S) cout << N*S << endl;
else {
if (N % 2 == 0) cout << N/2*D << endl;
else cout << N/2*D+S << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
if(b == 1){
if(a != n){
cout << -1 << endl;
return 0;
}else{
rep(i, n)cout << i + 1 << ' ';
cout << endl;
return 0;
}
}else if(a == 1){
if(b != n){
cout << -1 << endl;
return 0;
}else{
rep(i, n)cout << n - i << ' ';
cout << endl;
return 0;
}
}else{
if(n < a + b - 1 || n > a * b){
cout << -1 << endl;
return 0;
}
}
int c = (n - b) % (a - 1);
int d = (n - b) / (a - 1);
int cnt = 0;
rep(i, a){
if(i == 0){
rep(j, b){
cout << cnt + b - j << ' ';
}
cnt += b;
}else if(i <= c){
rep(j, d+1){
cout << cnt + d + 1 - j << ' ';
}
cnt += d + 1;
}else{
rep(j, d){
cout << cnt + d - j << ' ';
}
cnt += d;
}
}
cout << endl;
}
| 0
| 44,397,148
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
bool comp(P p1,P p2){
return (p1.first == p2.first && p1.second > p2.second) || p1.first < p2.first;
}
bool comp1(P p1,P p2){
return p1.second > p2.second;
}
int main(){
ll n,h;
cin >> n >> h;
ll i;
vector<P> p(n);
for(i=0;i<n;i++){
cin >> p[i].first >> p[i].second;
}
sort(p.begin(),p.end(),comp);
ll a=p[n-1].first,b=p[n-1].second;
ll ans=0,sum=0,res=0;
sort(p.begin(),p.end(),comp1);
for(i=0;i<n;i++){
if(sum>=h){
break;
}
if(a>p[i].second){
break;
}
if(res==0 && p[i].first==a && p[i].second==b){
res=1;
continue;
}
ans++,sum+=p[i].second;
}
if(sum>=h){
cout << ans << endl;
return 0;
}
sum+=b,ans++;
if(sum>=h){
cout << ans << endl;
return 0;
}
ans+=(h-sum-1)/a+1;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<rhs.size(); ++i){ std::cout<<rhs[i]<<' '; }
std::cout<<"]"<<std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>>& rhs){
std::cout<<" = "<<std::endl;
std::cout<<"[[ ";
for(uint p=0; p<rhs.size(); ++p){
if(p!=0){ std::cout<<" [ "; }
for(uint q=0; q<rhs[p].size(); ++q){
std::cout<<rhs[p][q]<<' ';
}
if(p!=rhs.size()-1){ std::cout<<"]"<<std::endl; }
}
std::cout<<"]]"<<std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR,TL>>& rhs){
std::cout<<" = [";
uint i=0;
for(; i<rhs.size()-1; ++i){ std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"], "; }
std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"]]" << endl;
}
#define printn(var) {printf("%s", #var);print(var);}
#define printn_all(var) {printf("%s(%d): ", __func__, __LINE__);printf("%s", #var);print(var);}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64 N, M; cin >> N >> M;
if (N==1 && M==1){ cout << 1 << endl;
}else if(N==1 && M>=2){ cout << (M-2) << endl;
}else if(N>=2 && M==1){ cout << (N-2) << endl;
}else if(N>=2 && M>=2){ cout << (N-2)*(M-2) << endl; }
return 0;
}
| 0
| 34,715,053
|
#include <cstdio>
int ns[5001];
int max(int a,int b){return a>b?a:b;}
int main(){
int n;
while(scanf("%d",&n),n){
for(int i=1; i<=n; i++)
scanf("%d",&ns[i]);
for(int i=2; i<=n; i++)
ns[i]+=ns[i-1];
int ans=-100001;
for(int i=0; i<=n; i++)
for(int j=0; j<i; j++)
ans=max(ans,ns[i]-ns[j]);
printf("%d\n",ans);
}
}
|
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
static vector<int64_t> vec;
static inline int32_t parent(uint32_t index)
{
if (index < 1) return -1;
return (index - 1) / 2;
}
static inline uint32_t left(uint32_t index)
{
return 2 * index + 1;
}
static inline uint32_t right(uint32_t index)
{
return 2 * index + 2;
}
int32_t main()
{
uint32_t num;
cin >> num;
for (uint32_t i = 0; i < num; i++) {
int64_t val;
cin >> val;
vec.push_back(val);
}
for (uint32_t i = 0; i < num; i++) {
cout << "node " << i + 1 << ": ";
cout << "key = " << vec[i] << ", ";
if (parent(i) >= 0) {
cout << "parent key = " << vec[parent(i)] << ", ";
}
if (left(i) < vec.size()) {
cout << "left key = " << vec[left(i)] << ", ";
}
if (right(i) < vec.size()) {
cout << "right key = " << vec[right(i)] << ", ";
}
cout << endl;
}
return 0;
}
| 0
| 75,902,223
|
#include<iostream>
using namespace std;
#define MAX 256
int miku(int x){
if(x > 36)return 0;
if(x < 10)return (x + 3)*(x + 2)*(x + 1) / 6;
if(x > 18)return miku(36 - x);
if(x > 9 && x < 19)return (x + 3)*(x + 2)*(x + 1) / 6 - (miku(x - 10) * 4);
}
int main(void){
int n,i = 0;
int ans[MAX];
while(cin >> n){
ans[i] = miku(n);
i++;
}
for(int j = 0;j < i;j++){
cout << ans [j] <<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> a(n+1);
vector<long long> b(n);
long long sum=0;
for (int i=0; i<n+1; i++) cin>>a[i];
for (int i=0; i<n; i++) cin>>b[i];
for (int i=0; i<n; i++){
if (a[i]<b[i]){
if (a[i+1]<(b[i]-a[i])){
sum+=a[i+1];
a[i+1] = 0;
}
else {
a[i+1] -= b[i]-a[i];
sum+=b[i]-a[i];
}
sum+=a[i];
}
else sum+=b[i];
}
cout<<sum<<endl;
}
| 0
| 68,350,071
|
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
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; }
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7ll;
const double PI=3.14159265358979323846;
int main(){
int N, K, R, S, P;
cin >> N >> K >> S >> P >> R;
string T;
cin >> T;
int res = 0;
for(int i = 0; i < K; i++) {
int flag = 0;
for(int j = i; j < T.size(); j+=K) {
if(flag) {
if(T[j] == T[j-K]) {flag = 0; continue;}
}
flag = 1;
if(T[j] == 'r') res += R;
else if (T[j] == 's') res += S;
else if(T[j] == 'p') res += P;
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
}
int ans = 10000000;
for (int i = -100; i <= 100; i++){
int ans_sub = 0;
rep(j,N){
ans_sub += (i - vec[j]) * (i - vec[j]);
}
ans = min(ans,ans_sub);
}
cout << ans << endl;
}
| 0
| 39,528,598
|
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
void solve()
{
ll a,b,c,d,m,n,p,q,r,x,y,z,aa,bb,cc,dd;
ll i,j,k,l;
ll cnt=0,cnt1=0,cnt2=0,cnt3=0,sum=0,mx=LLONG_MIN,mn=LLONG_MAX;
ll flag=0,flag2=0;
vector <ll> vec1,vec2,vec3;
string s1,s2,s3;
cin >> a >> b >> c >> d;
x=a*c;
y=a*d;
p=b*c;
q=b*d;
cout << max(x,max(y,max(p,q))) << endl;
}
int main()
{
RUN_FAST
ll t=1;
while(t--)
{
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
string a,ans;
int main(){
int n,s=0;cin>>n>>a;ans=a;
for(int i=0;i<a.size();i++){
s+=(a[i]=='(')?1:-1;
if(s<0) ans='('+ans,s++;
}
while(s--) ans=ans+')';
cout<<ans;
}
| 0
| 98,221,378
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
int main() {
int64_t N,ans=0; cin>>N;
vector<int64_t> S(N);
rep(i,N) cin>>S.at(i);
rep(i,N){
ans+=S.at(i)/2;
S.at(i)%=2;
if(i<N-1&&S.at(i)==1&&S.at(i+1)!=0){
ans++;
S.at(i+1)--;
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<int>(m,0));
#define Twovec(a,n,m) vector<vector<double>> a(n,vector<double>(m,0));
#define P pair<int,int>
#define All(a) (a).begin(),(a).end()
#define Sort(a) sort(All(a));
#define Reverse(a) reverse(All(a));
#define PQ(n) priority_queue<P,vector<P>,greater<P>> (n)
#define pq(n) priority_queue<int> (n)
#define print(a) cout << (a) << endl;
#define printD(a) cout << setprecision(10) << ans << endl;
using namespace std;
int max_int = 1000000007;
void Debug(auto a);
int nibul(auto a,auto b);
int nibuu(auto a,auto b);
void input(vector<int>& a,int n);
int n,m;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int 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;
}
};
signed main(){
int z,w;
cin >> n >> z >> w;
vec(a,n);
input(a,n);
if(n==1){
print(abs(a[0]-w));
}
else{
int tmpa = abs(a[n-1]-a[n-2]);
int tmpb = abs(w-a[n-1]);
print(max(tmpa,tmpb));
}
return 0;
}
void Debug(auto a){
cout << "{ ";
for(auto b: a){
cout << b << " ";
}
cout << "}" << endl;
}
int nibul(auto a,auto b){
int x = lower_bound(All(a),b) - a.begin();
return x;
}
int nibuu(auto a,auto b){
int x = upper_bound(All(a),b) - a.begin();
return x-1;
}
void input(vector<int>& a,int n){
REP(i,n){
cin >> a[i];
}
}
| 0
| 87,854,880
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll A,B;
cin >>A>>B;
ll ans=0;
rep(i,10){
rep(j,10){
rep(k,10){
rep(m,10){
rep(n,10){
ll num=i*10000+j*1000+k*100+m*10+n;
if(num<=B && num>=A){
if(i==n && j==m){
ans++;
}
}
}
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
ios_base::sync_with_stdio(false);
ll ans,mini=INF;
string s,t;
cin >> s >> t;
for(int i=0;i<=(s.size()-t.size());i++){
ans=0;
for(int j=0;j<t.size();j++){
if(s[j+i]!=t[j]){
ans++;
}
}
mini = min(ans,mini);
}
cout << mini << endl;
return 0;
}
| 0
| 10,987,762
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
string s;
cin >> s;
bool A = false;
bool B = false;
for (char c : s){
if (c == 'A'){
A = true;
}
else if (c == 'B')
{
B = true;
}
}
if (A && B){
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n_player, winner;
double P;
while (scanf(" %d %d %lf", &n_player, &winner, &P) == 3) {
if (n_player == 0 && winner == 0 && P == 0) break;
winner--;
int table[n_player];
double money = 0;
for (int i = 0; i < n_player; i++) {
scanf(" %d", &table[i]);
money += table[i] * 100;
}
if (table[winner] == 0) {
cout << 0 << endl;
continue;
}
money -= money * (double)(P/100);
cout << (int)(money / table[winner]) << endl;
}
return 0;
}
| 0
| 64,169,090
|
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
bool comp(const std::string& lh, const std::string& rh) {
return lh.length() < rh.length();
}
int main(){
int n;
cin >> n;
vector<int> ans(26, 100);
rep(i, n){
vector<int> vec(26, 0);
string str;
cin >> str;
rep(j, str.length()) vec[str[j]-'a']++;
rep(j, 26) ans[j] = min(ans[j], vec[j]);
}
string str = "";
rep(i, 26){
rep(j, ans[i]){
str += 'a'+i;
}
}
cout << str << endl;
return 0;
}
|
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
int main() {
int64_t N, K, R, S, P;
string T;
cin >> N >> K >> R >> S >> P >> T;
reverse(T.begin(), T.end());
int64_t point = 0;
for (int64_t k = 0; k < K; ++k) {
int64_t idx = k;
char pre = '-';
while (idx < N) {
if (T[idx] == 'r' && pre != 'r') {
point += P;
pre = T[idx];
} else if (T[idx] == 's' && pre != 's') {
point += R;
pre = T[idx];
} else if (T[idx] == 'p' && pre != 'p') {
point += S;
pre = T[idx];
} else {
pre = '-';
}
idx += K;
}
}
cout << point << endl;
return 0;
}
| 0
| 80,574,853
|
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf INT_MAX
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,y) fixed << setprecision(y) << x
#define pb push_back
#define mp make_pair
int a[105];
int32_t main()
{
fast;
int n, ans = inf, val; cin >> n;
For(i, 0, n) cin >> a[i];
sort(a, a+n);
int l = a[0], h = a[n-1];
Rep(j, l, h) {
val = 0;
For(i, 0, n) {
val += ((a[i] - j) * (a[i] - j));
}
ans = min(val, ans);
}
cout << ans;
return 0;
}
|
#include<cstdio>
using namespace std;
typedef long long ll;
const int MAX=2e5+10;
char str[MAX];
int main(){
while(~scanf("%s",str)){
ll ans=0,b=0;
for(int i=0;str[i];i++){
if(str[i]=='B') b++;
else ans+=b;
}
printf("%lld\n",ans);
}
return 0;
}
| 0
| 68,152,235
|
#include <bits/stdc++.h>
#define LL long long
#define P pair<int, int>
#define Fengexian cout<<"WZY%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%"<<endl
const LL N = 1e5 + 10;
const LL mod = 998244353;
const LL inf = 0x3f3f3f3f;
const double eps = 1e-9;
using namespace std;
template <typename tp>
inline void read(tp &x)
{
x = 0; char c = getchar(); bool f = 0;
for (; c < '0' || c > '9'; f |= (c == '-'), c = getchar()) ;
for (; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar()) ;
if (f) x = -x;
}
int n,a[N],num[N],maxn,flag;
signed main()
{
read(n);
for(int i=1;i<=n;i++) read(a[i]),num[a[i]]++,maxn=max(maxn,a[i]);
for(int i=maxn;i>=0;i--)
{
int zz=max(maxn-i,i);
if(!num[zz]) return 0*puts("Impossible");
num[zz]--;
}
for(int i=1;i<=((maxn+1)>>1);i++)
if(num[i])
return 0*puts("Impossible");
return 0*puts("Possible");
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Ten(int x){
ll ret=1;
while( x-- )ret*=10ll;
return ret;
}
int ask(ll n){
cout<<"? "<<n<<endl;
cout.flush();
char c;
cin>>c;
return c=='Y';
}
int main(){
if( ask( Ten(9) ) ){
for(int i=0;i<=10;i++){
if( ask( 2ll*Ten(i) ) ){
cout<<"! "<<Ten(i)<<endl;
return 0;
}
}
}else{
for(int i=0;i<=15;i++)
if( !ask( Ten(i) ) ){
ll low = Ten(i-1) , high=Ten(i)-1;
while( low < high ){
ll mid = low+high>>1;
if( ask(10ll*mid) )high=mid;
else low=mid+1;
}
cout<<"! "<<high<<endl;
return 0;
}
}
return 0;
}
| 0
| 36,348,701
|
#include <stdio.h>
#include <cstring>
main(){
while(1){
int w,h;
scanf("%d%d", &w,&h);
if(w==0&&h==0) break;
int dp[w][h];
memset(dp, -1, sizeof(dp));
int n;
scanf("%d", &n);
int x,y;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);
dp[x-1][y-1] = 0;
}
int k=1;
for(int i=0;i<w;i++){
if(!dp[i][0]) k=0;
dp[i][0] = k;
}
k=1;
for(int i=0;i<h;i++){
if(!dp[0][i]) k=0;
dp[0][i] = k;
}
for(int i=1;i<w;i++){
for(int j=1;j<h;j++){
if(dp[i][j]==-1){
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
}
printf("%d\n", dp[w-1][h-1]);
}
}
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ll long long int
#define MOD ((int)(1e9) + 7)
using namespace std;
class BSomeSums {
public:
void solve(istream& cin, ostream& cout) {
int n, a, b;
cin >> n >> a >> b;
ll cnt=0;
for(int i=1; i<=n; i++) {
string d = to_string(i);
int sum = 0;
for(auto k: d) {
sum += k - '0';
}
if(sum >= a && sum <=b) cnt+=i;
}
cout << cnt << '\n';
}
};
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
BSomeSums solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0
| 75,484,261
|
#include <iostream>
#include <cmath>
#include <utility>
void koch(int d, std::pair<double, double> p1, std::pair<double, double> p2){
if(d == 0) return;
std::pair<double, double> s;
s.first = (2*p1.first+1*p2.first)/3.0;
s.second = (2*p1.second+1*p2.second)/3.0;
std::pair<double, double> t;
t.first = (1*p1.first+2*p2.first)/3.0;
t.second = (1*p1.second+2*p2.second)/3.0;
std::pair<double, double> u;
u.first = (t.first-s.first)/2-sqrt(3.0)*(t.second-s.second)/2+s.first;
u.second = sqrt(3.0)*(t.first-s.first)/2+(t.second-s.second)/2+s.second;
koch(d-1, p1, s);
std::cout << s.first << " " << s.second << std::endl;
koch(d-1, s, u);
std::cout << u.first << " " << u.second << std::endl;
koch(d-1, u, t);
std::cout << t.first << " " << t.second << std::endl;
koch(d-1, t, p2);
}
int main(){
int n;
std::cin >> n;
std::cout << 0.0 << " " << 0.0 << std::endl;
std::pair<double, double> p1(0.0, 0.0);
std::pair<double, double> p2(100.0, 0.0);
koch(n, p1, p2);
std::cout << 100.0 << " " << 0.0 << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(ll i=0;i<n;i++)
using Graph = vector<vector<int>>;
using pint = pair<int,int>;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int main(){
ll n,l;cin>>n>>l;
ll a[n];
rep(i,n) cin>>a[i];
ll m=0,x;
rep(i,n-1){
m=max(a[i]+a[i+1],m);
if(a[i]+a[i+1]>=l){
x=i+1;
break;
}
}
if(m<l) {
cout<<"Impossible"<<"\n";
}
else{
cout<<"Possible"<<"\n";
for(int i=1;i<x;i++) cout<<i<<"\n";
for(int i=n-1;i>=x;i--) cout<<i<<"\n";
}
}
| 0
| 74,423,019
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
int main(){
int a;
cin >> a;
cout << "Christmas";
rep(i, 25-a) cout << " Eve";
cout <<endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define P pair<ll ,ll>
using namespace std;
int main(){
vector<int>vec(3);
cin >> vec[0] >> vec[1] >> vec[2];
sort(vec.begin() ,vec.end());
int ans = 0;
while(!(vec[0] == vec[1] && vec[1] == vec[2])){
if(vec[1]!=vec[2]){
vec[0]++;
vec[1]++;
ans++;
}else{
vec[0] += 2;
ans++;
}sort(vec.begin() ,vec.end());
}
cout << ans << endl;
}
| 0
| 4,257,044
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
const int INF=1e9;
const ll MX = 1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
int main() {
char c;
cin>>c;
printf("%c",(c+1));
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
using ld=long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
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;
}
struct Edge {
ll to, cap, rev;
Edge(ll _to, ll _cap, ll _rev) {
to = _to; cap = _cap; rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve(){
ll n;
cin>>n;
Array a(n);
REP(i,n) cin>>a[i];
map<ll,ll> mp;
REP(i,n) mp[a[i]]++;
auto it=mp.end();
it--;
ll ma=it->first;
if(it->second<2){
cout<<"Impossible"<<en;
return;
}
auto s=mp.begin();
if(s->first!=(ma+1)/2){
cout<<"Impossible"<<en;
return;
}
if(ma%2){
if(s->second!=2){
cout<<"Impossible"<<en;
return;
}
}else{
if(s->second!=1){
cout<<"Impossible"<<en;
return;
}
}
ll pre=s->first;
s++;
it++;
while(s!=it){
if(s->first!=pre+1||s->second<2){
cout<<"Impossible"<<en;
return;
}
pre=s->first;
s++;
}
cout<<"Possible"<<en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 8,977,208
|
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
int main(){
fast;
ll a, b;
cin >> a >> b;
if(abs(a - b) <= 1) cout << "Yay!";
else cout << ":(";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i = (m); i < (n); i++)
#define rrep(i,m,n) for(int i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1];}
#define printp(x,n) for(int i = 0; i < n; i++){ cout << "(" << x[i].first << ", " << x[i].second << ") "; } cout << endl;
#define INF (1e18)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
typedef pair<ll, ll> lpair;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll K;
cin >> K;
ll N = 50;
ll a[55] = {};
rep(i,0,N) a[i] = i;
ll v = K / N;
rep(i,0,N) a[i] += v;
ll amari = K % N;
rep(i,0,amari){
rep(j,0,N){
if(i == j){
a[j] += N;
}else{
a[j]--;
}
}
}
print(N);
printa(a,N);
}
| 0
| 89,701,192
|
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
int main()
{
int n;
while (cin >> n,n)
{
int max = 0; int min = INF;
int sum = 0;
REP(i, n)
{
int a;
cin >> a;
sum += a;
if (a > max) max = a;
if (a < min) min = a;
}
sum = sum - max - min;
cout << sum / (n - 2) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define ALL(a) (a).begin(),(a).end()
#define EACH(e,v) for(auto& e:v)
#define SORT(v) sort(ALL(v))
#define PERM(v) SORT(v);for(bool c##p=1;c##p;c##p=next_permutation(ALL(v)))
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<vii> viii;
typedef pair<int,int> P;
template <class T> void chmin(T & a, T const & b) { if (b < a) a = b; }
template <class T> void chmax(T & a, T const & b) { if (b > a) a = b; }
template <typename T>
string to_string(const T &n){ostringstream stm;stm << n;return stm.str();}
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
using ll = long long;
const ll mod = 1000'000'007;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int se[112345];
signed main(){
int n;
cin>>n;
vector<ll> avec;
rep(i,n+1){
ll a;cin>>a;avec.push_back(a);
}
COMinit();
int idx=0;
int idxb=0;
rep(i,n+1){
se[avec[i]]++;
if(se[avec[i]]==2)idx=i;
}
rep(i,n+1){
if(avec[idx]==avec[i]){
idxb=i;
break;
}
}
swap(idx,idxb);
int b=idxb-idx-1;int c=n-idxb;
ll ans=0LL;
rep(i,n+1){
int k=i+1;
if(i==0)cout<<n<<endl;
else {
ll ret=0;
ret+=COM(n-1,k)%mod;
ret+=COM(idx+c,k-1)%mod;
ret+=(COM(idx+b+c,k-1)-COM(idx+c,k-1))*2%mod;
ret+=COM(n-1,k-2)%mod;
cout<<(ret%mod+mod)%mod<<endl;
}
}
}
| 0
| 61,766,322
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e9+7;
int main()
{
ll n;
cin >> n;
ll digit1=n/100;
if(n<=digit1*111){
cout << digit1*111 << endl;
}
else{
cout << (digit1+1)*111 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
string text="abcdefghijklmnopqrstuvwxyz";
const int maxn=1e6+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
vector<ll>v;
for(int i=1;i<10;i++)v.push_back(i);
int cnt=0;
while(cnt<n){
ll x=v[cnt];
cnt++;
ll rem=x%10;
if(rem==0){
v.push_back(x*10);
v.push_back((x*10)+1);
}
else if(rem==9){
v.push_back((x*10)+9);
v.push_back((x*10)+8);
}
else{
v.push_back((x*10)+rem);
v.push_back((x*10)+rem-1);
v.push_back((x*10)+rem+1);
}
}
sort(v.begin(),v.end());
cout<<v[n-1]<<endl;
}
| 0
| 12,296,502
|
#include <bits/stdc++.h>
#define rep(begin, end) for (i=begin;i<end;i++)
#define init(arr, end, val) for (i=0;i<end;i++) arr[i] = val;
#define printint(i0, i1) printf("%d %d\n", i0, i1)
using namespace std;
const int inf = pow(10,9);
const int nil = -1;
const long long MOD = 998244353;
long long i, n, m, k, ans;
long long d[100001];
typedef long long ll;
ll modpow(ll a, ll n, ll mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
scanf(" %lld", &n);
init(d, n+1, 0);
scanf(" %lld", &k);
if (k != 0) {
printf("0\n"); exit(0);
}
d[0]++;
rep(1,n) {
scanf(" %lld", &k);
if (k == 0) {
printf("0\n"); exit(0);
} else {
d[k]++;
}
}
ans = 1;
rep(1, n) {
ans = ans * modpow(d[i-1], d[i], MOD) % MOD;
}
printf("%lld\n", ans);
}
|
#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
signed main(signed argc, char** argv){
int N;
cin >> N;
vector<int> X(N), Y(N);
for(int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
}
bool g = true;
int z = (abs(X[0]) + abs(Y[0])) % 2;
for(int i = 0; i < N; ++i) {
g = g && (abs(X[i]) + abs(Y[i])) % 2 == z;
}
if (!g) {
cout << -1 << endl;
return 0;
}
bool f = (X[0] + Y[0]) % 2 == 0;
if(f) {
for(int i = 0; i < N; ++i) {
X[i]--;
}
}
const int m = 31;
cout << (f ? m + 1: m) << endl;
if(f) cout << 1 << " ";
for(int i = 0; i < m; ++i) {
cout << (1LL << i) << (i == m - 1 ? "\n": " ");
}
for(int i = 0; i < N; ++i) {
int U = (X[i] + Y[i] + (1LL << m) - 1) / 2;
int V = (X[i] - Y[i] + (1LL << m) - 1) / 2;
int x = 0, y = 0;
if(f){
cout << "R";
}
for(int i = 0; i < m; ++i) {
if(((U >> i) & 1) && ((V >> i) & 1)) {
cout << "R";
x += 1LL << i;
} else if(((U >> i) & 1) && !((V >> i) & 1)) {
cout << "U";
y += 1LL << i;
} else if(!((U >> i) & 1) && ((V >> i) & 1)) {
cout << "D";
y -= 1LL << i;
} else if(!((U >> i) & 1) && !((V >> i) & 1)) {
cout << "L";
x -= 1LL << i;
}
}
if(x != X[i] || y != Y[i]) {
cout << x << " " << y << endl;
cout << "dead" << endl;
}
cout << endl;
}
return 0;
}
| 0
| 64,515,427
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main()
{
int n;cin >> n;
vector<ll> a(n);rep(i,n)cin >> a[i];
vector<ll> ruiseki(n);
ll temp = 0;
rep(i,n)
{
temp += a[i];
ruiseki[i] = temp;
}
map<ll,ll>mp;
rep(i,n)
{
mp[ruiseki[i]]++;
}
ll ans = 0;
for (auto &&i : mp)
{
if(i.first==0)
{
ans += i.second * (i.second + 1) / (ll)2;
continue;
}
ans += i.second*(i.second-1)/(ll)2;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#include<cstring>
using namespace std;
#define ll long long
int main()
{
ll h,w,x=1000000,a,b,c,y,z;
cin>>h>>w;
for(int i=1;i<h;i++){
a=i*w;
b=floor((h-i)/2.0)*w;
c=ceil((h-i)/2.0)*w;
y=max({a,b,c});
z=min({a,b,c});
x=min(x,y-z);
b=floor(w/2.0)*(h-i);
c=ceil(w/2.0)*(h-i);
y=max({a,b,c});
z=min({a,b,c});
x=min(x,y-z);
}
swap(h,w);
for(int i=1;i<h;i++){
a=i*w;
b=floor((h-i)/2.0)*w;
c=ceil((h-i)/2.0)*w;
y=max({a,b,c});
z=min({a,b,c});
x=min(x,y-z);
b=floor(w/2.0)*(h-i);
c=ceil(w/2.0)*(h-i);
y=max({a,b,c});
z=min({a,b,c});
x=min(x,y-z);
}
cout<<x<<endl;
}
| 0
| 89,080,868
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, t; cin >> s >> t;
bool flg = true;
for(int i = 0; i < t.size(); i++) s.push_back(s[i]);
for(int i = 0; i < t.size(); i++) {
if(s[i] != t[0]) continue;
for(int j = 0; j < t.size(); j++) {
if(s[i + j] != t[j]) {
flg = false; break;
}
}
if(flg) break;
}
if(flg) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define int long long
#define problem ""
template<typename A, typename B, typename C>
struct triple{
A X;
B Y;
C Z;
triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0){
return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b){
if (a.X != b.X)
return a.X < b.X;
if (a.Y != b.Y)
return a.Y < b.Y;
return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p){
ofs << "( " << p.F << " , " << p.S << " )";
return ofs;
}
template<typename T>
void print(T a){
for (auto i : a)
cout << i << ' ';
cout << '\n';
}
template<typename T>
T max(T a, T b, T c){
return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c){
return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a){
return *min_element(all(a));
}
template<typename T, typename D>
D max(T a){
return *max_element(all(a));
}
struct custom_hash{
static uint64_t splitmix64(uint64_t x){
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const{
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
void solve(){
int n; cin >> n;
int ans = 0;
rngi(i, n) ans += (i + 1) * (n - i);
rng(n - 1){
int x, y; cin >> x >> y;
if(x > y) swap(x, y);
ans -= x * (n - y + 1);
}
cout << ans << '\n';
};
signed main()
{
if(0){
freopen(problem".in", "r", stdin);
freopen(problem".out", "w", stdout);
}
srand(time(NULL));
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
int t = 1;
rng(t) solve();
}
| 0
| 91,173,800
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
#define INF (1e9)
int main() {
ld H, W;
ll ans;
cin >> H >> W;
if (H == 1 || W == 1) ans = 1;
else ans = ceil(H * W / 2);
cout << ans << endl;
}
|
#include <iostream>
int main() {
long long int h;
int n;
std::cin >> h >> n;
int a[100010];
long long int sum = 0;
for (int i = 0; i < n; ++i)
std::cin >> a[i], sum += a[i];
if (sum >= h)
std::cout << "Yes";
else
std::cout << "No";
}
| 0
| 15,924,425
|
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>
using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
template<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}
template<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
int main() {
int h, w, a, b; cin >> h >> w >> b >> a;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cout << ((i < a) ^ (j < b));
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef pair<int,int> pii;
const int N = 1e4+10;
string dp[N], val[15];
string num = "123456789";
int c[] = {2,5,5,4,5,6,3,7,6}, cs[200], n, m;
string a[15];
void update (string &x, string y, string z)
{
if (x.size() > y.size() + 1) return;
if (z[0] > y[0]) z += y, swap(y, z);
else y += z;
if (x.size() < y.size()) x = y;
else
{
for (int i=0; i<x.size(); i++)
{
if (x[i] > y[i]) return;
else if (x[i] < y[i])
{
x = y;
break;
}
}
}
}
signed main()
{
XinAi
for (int i=0; i<9; i++) cs[num[i]] = c[i];
cin >> n >> m;
for (int i=0; i<m; i++) cin >> a[i];
for (int i=0; i<n; i++)
for (int j=0; j<m; j++)
{
if (i!=0 && dp[i]=="") continue;
update(dp[i+cs[a[j][0]]], dp[i], a[j]);
}
cout << dp[n] << '\n';
}
| 0
| 38,916,884
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
bool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.first < secondElof.first;
}
bool pairCompareSecond(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.second < secondElof.second;
}
#define MAX_N 100100
#define MOD 998244353
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
int main(){
ll n,ans=0;
string s;
cin >> n >> s;
for (ll i=0;i<10;i++){
for (ll j=0;j<10;j++){
for (ll k=0;k<10;k++){
char a[3];
a[0]='0'+i;
a[1]='0'+j;
a[2]='0'+k;
ll c=0;
for (ll l=0;l<s.size();l++){
if (a[c]==s[l]){
a[c]='0'-1;
c++;
}
}
bool f=true;
for (ll l=0;l<3;l++){
if (a[l]!='0'-1)f=false;
}
if (f)ans++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
int N = 0;
cin >> N;
string in[N];
string out[N];
for(int i = 0; i < N; ++i){
cin >> in[i];
out[i] = in[i];
}
for(int i = 0; i < N; ++i){
for(int j = N - 1; j > i; --j){
if(out[j].at(1) < out[j - 1].at(1)){
string str = out[j];
out[j] = out[j - 1];
out[j - 1] = str;
}
}
}
for(int i = 0; i < N; ++i){
if(i != N - 1) cout << out[i] << " ";
else cout << out[i] << endl;
}
cout << "Stable" << endl;
for(int i = 0; i < N; ++i){
int minj = i;
for(int j = i; j < N; ++j){
if(in[j].at(1) < in[minj].at(1)){
minj = j;
}
}
string s = in[i];
in[i] = in[minj];
in[minj] = s;
}
for(int i = 0; i < N; ++i){
if(i != N - 1) cout << in[i] << " ";
else cout << in[i] << endl;
}
for(int i = 0; i < N; ++i){
if(in[i] != out[i]){
cout << "Not stable" << endl;
return 0;
}
}
cout << "Stable" << endl;
return 0;
}
| 0
| 21,490,419
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b,cu,out;
cin >> n;
cu = 0;
out = 0;
vector<int> vec(0);
for (int i = 0 ; i < n ; i++ ) {
cin >> a;
vec.push_back(a);
}
b = 1;
for (int i = 0;i < n ; i++){
cu++;
if (cu == n){
out = 1;
break;
}
if (vec.at(b-1) == 2){
break;
}
b = vec.at(b-1);
}
if (out == 1){
cout << -1;
}
else {
cout << cu;
}
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
ll DP[105][5][2];
int main() {
string N;
cin>>N;
int K;
cin>>K;
DP[0][1][1] = N[0]-'1';
DP[0][1][0] = 1;
for(int i=1;i<N.size();++i) {
for(int j=0;j<=K;++j) {
if(N[i]=='0') {
DP[i][j][0] = DP[i-1][j][0];
if(j>0) DP[i][j][1] = DP[i-1][j-1][1]*9 + DP[i-1][j][1];
else DP[i][j][1] = DP[i-1][j][1];
}
else {
if(j>0) DP[i][j][0] = DP[i-1][j-1][0];
if(j>0) DP[i][j][1] = DP[i-1][j][0] + DP[i-1][j][1] + DP[i-1][j-1][0]*(N[i]-'1') + DP[i-1][j-1][1]*9;
}
}
DP[i][1][1] += 9;
}
cout<<DP[N.size()-1][K][0]+DP[N.size()-1][K][1]<<endl;
}
| 0
| 38,394,239
|
#include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i,f,n) for(int i=(f); i<=(n); ++i)
using namespace std;
main()
{
int N, a[2000001], maxv = 0;
scanf("%d", &N);
rep(i, N)
scanf("%d", a+i),
maxv = max( maxv, a[i] );
int cnt[maxv + 1] = {-1};
int ret[N];
rep(i, N) ++cnt[ a[i] ];
reps(i, 1, maxv) cnt[i] += cnt[i-1];
for(int i=N-1; i>=0; --i){
int& p = cnt[ a[i] ];
ret[p] = a[i];
--p;
}
rep(i, N) printf("%d%c", ret[i], i+1 < N ? ' ' : '\n' );
}
|
#include <iostream>
using namespace std;
int main(){
int m;
while(cin >> m,m){
int c=0;
m=1000-m;
while(m-500>=0){
m=m-500;
c++;
}
while(m-100>=0){
m=m-100;
c++;
}
while(m-50>=0){
m=m-50;
c++;
}
while(m-10>=0){
m=m-10;
c++;
}
while(m-5>=0){
m=m-5;
c++;
}
while(m-1>=0){
m=m-1;
c++;
}
cout << c << endl;
}
return 0;
}
| 0
| 74,172,819
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int a, b;
cin >> a >> b;
cout << a * b - a - b + 1 << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <bitset>
#include <map>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
string result = "";
bool loopdfs(vector<int> & nums, int N, int sum) {
if (N == 4) {
if (sum != 7) return false;
result = "=7";
return true;
}
if (loopdfs(nums, N + 1, sum + nums[N])) {
result = to_string(nums[N]) + result;
if (N != 0) result = "+" + result;
return true;
}
if (loopdfs(nums, N + 1, sum - nums[N])) {
result = to_string(nums[N]) + result;
if (N != 0) result = "-" + result;
return true;
}
return false;
}
int main()
{
string S;
vector<int> nums(4);
cin >> S;
rep(i, 4) {
nums[i] = (int)(S[i] - '0');
}
loopdfs(nums, 0, 0);
cout << result << endl;
}
| 0
| 17,190,042
|
#include <bits/stdc++.h>
using namespace std;
long long X,Y;
int val=0;
int main (){
cin>>X>>Y;
while(Y>=X){
val++;
X*=2;
}
cout<<val;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
struct UnionFindTree {
vector<int> par;
UnionFindTree(int n) : par(n) {
rep(i, n) par[i] = i;
}
int root(int x) {
if ( par[x] == x ) return x;
else return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if ( rx != ry ) par[rx] = root(ry);
}
bool same(int x, int y) {
return (root(x) == root(y));
}
};
int main() {
int n, m;
cin >> n >> m;
vector<int> p(n);
rep(i, n) {
cin >> p[i];
--p[i];
}
UnionFindTree uf_tree(n);
rep(i, m) {
int x, y;
cin >> x >> y;
--x, --y;
uf_tree.unite(x, y);
}
int ans = 0;
rep(i, n) if ( uf_tree.same(i, p[i]) ) ++ans;
cout << ans << endl;
return 0;
}
| 0
| 49,929,158
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, c, k;
cin >> n >> c >> k;
int T[n];
for(int i=0; i<n; ++i) cin >> T[i];
sort(T, T+n);
int ans = 0;
for(int i=0; i<n;){
++ans;
int st = i;
while(i < n && T[i]-T[st] <= k && i-st < c) ++i;
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(ll int i=a;i<=b;++i)
#define rep(i,n) for(ll int i=0;i<n;i++)
#define rep3(i,a,b) for(int i=a;i>=b;i--)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
ll int MOD=1e9+7;
int INF=1e6;
ll int MAX_N=1e18;
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
ll int inv[1000000]={};
void calc_inv(ll int s){
inv[1]=1;
rep2(i,2,s-1){
inv[i]=(MOD-(MOD/i)*inv[MOD%i]%MOD);
}
}
main(){
ll int n;
calc_inv(200000);
cin>>n;
ll int a[200000];
ll int count[200000]={};
ll int left,right;
rep(i,n+1){
scanf("%lld",&a[i]);
if(!count[a[i]]) count[a[i]]=1;
else right=i;
}
rep(i,n+1){
if(a[i]==a[right]){ left=i; break;}
}
ll int comb1[110000],comb3[110000];
comb1[0]=1,comb3[0]=1;
rep2(i,1,n+2){
comb1[i]=comb1[i-1]*(n+2-i)%MOD;
comb1[i]=comb1[i]*inv[i]%MOD;
comb3[i]=comb3[i-1]*(n+1-right+left-i)%MOD;
comb3[i]=comb3[i]*inv[i]%MOD;
}
rep2(i,1,n+1){
ll int ans=0;
ans+=comb1[i];
ans-=comb3[i-1];
ans%=MOD;
cout<<(comb1[i]-comb3[i-1]+MOD)%MOD<<endl;
}
return 0;
}
| 0
| 9,409,116
|
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define fi first
#define se second
#define show(x) cout << #x << " = " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo {cout<<"Yes";}else{cout<<"No";}
#define YESNO {cout<<"YES";}else{cout<<"NO";}
#define v(T) vector<T>
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
template<class A, class B> istream& operator>>(istream& i, pair<A, B>& p) {
return i >> p.first >> p.second;
}
template<class A, class B, class C> istream& operator>>(istream& i, tuple<A, B, C>& t) {
return i >> get<0>(t) >> get<1>(t) >> get<2>(t);
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
F0R(i, v.size()) {
o << v[i] << ' ';
}
o << newl;
return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
for (auto& p : m) {
o << p.first << ": " << p.second << newl;
}
o << newl;
return o;
}
#if 1
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int H, W;
cin >> H >> W;
v(string) s(H);
string a(W, '.');
F0R(i, H) {
cin >> s[i];
}
F0R(i, H) {
if (s[i] == a) {
s.erase(s.begin() + i);
i--; H--;
}
}
F0R(c, W) {
bool del = true;
F0R(r, H) {
if (s[r][c] != '.') {
del = false;
break;
}
}
if (del) {
F0R(r, H) {
s[r].erase(s[r].begin() + c);
}
c--; W--;
}
}
F0R(r, H) {
cout << s[r] << newl;
}
}
#endif
|
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int cmp(int a,int b)
{
return a>b;
}
int main()
{
int a,b,k;
int c[200];
scanf("%d%d%d",&a,&b,&k);
int j=0;
int d=min(a,b);
for(int i=1;i<=d;i++)
{
if(a%i==0&&b%i==0)
{
c[j]=i;
j++;
}
}
sort(c,c+j,cmp);
printf("%d\n",c[k-1]);
}
| 0
| 62,063,316
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main()
{
vector<string> ans;
string E = "-";
while (1){
string s;
int m;
cin >> s;
if (s == E) break;
cin >> m;
REP(i, m){
int h;
cin >> h;
string tmp = s.substr(0, h);
s.erase(0, h);
s += tmp;
}
ans.push_back(s);
}
for (auto x : ans) cout << x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int n;
cin >> n;
int64_t h = 0;
int64_t hPrev = 0;
int count = 0;
int countMax = 0;
for(int i=0;i<n;i++){
cin >> h;
if(h<=hPrev){
count++;
countMax = max(countMax, count);
}
else{
count = 0;
}
hPrev = h;
}
cout << countMax << endl;
return 0;
}
| 0
| 27,576,313
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int> > VVI;
typedef vector< vector<ll> > VVL;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pf push_front
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ub upper_bound
#define lb lower_bound
int main(){
int W,H;
cin>>W>>H;
VL P(W),Q(H);
rep(i,W) cin>>P[i];
rep(i,H) cin>>Q[i];
vector<PLL> R(0);
rep(i,W) R.pb(mp(P[i],0));
rep(i,H) R.pb(mp(Q[i],1));
sort(all(R));
ll ans=0;
rep(i,R.size()){
if(R[i].second==0){
ans+=(H+1)*R[i].first;
W--;
}else{
ans+=(W+1)*R[i].first;
H--;
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li,li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i,l,r) for(li i=l;i<=r;++i)
#define fr(i,l,r) for(li i=l;i>=r;--i)
#define u_map unordered_map
#define endl "\n"
#define debug(x) cout<<#x<<" = "<<x<<endl;
li fastpow(li base,li exp,li M)
{
li res=1;
while(exp>0) {
if(exp&1)
res=(res*base)%M;
base=(base*base)%M;
exp>>=1;
}
return res;
}
void solve()
{
li x;
cin>>x;
li tp=x/200;
li s=10-tp*2;
cout<<tp+s;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
li t=1;
while(t--)
{
solve();
}
return 0;
}
| 0
| 53,548,768
|
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
#include <set>
#include <list>
#include <cmath>
using namespace std;
typedef long long ll;
int main()
{
ll n, m, d;
cin >> n >> m >> d;
double ans = ((d > 0 ? 2.0 : 1.0) * (n-d) / n) * (m-1) / (1.0*n);
printf("%.10f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(ki, k) {
vector<int> b(n+1);
rep(i,n) {
int l = max(0, i-a[i]);
int r = min(i+a[i]+1, n);
b[l]++;
b[r]--;
}
rep(i,n) b[i+1] += b[i];
b.pop_back();
if (a == b) break;
a = b;
}
rep(i,n) cout << a[i] << endl;
return 0;
}
| 0
| 53,537,333
|
#include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0) break;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int mindif = 10000000;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
mindif = min(mindif, abs(a[i] - a[j]));
}
}
cout << mindif << endl;
}
return 0;
}
|
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace std ;
const int N = 1e5+5 ;
int n ,l ,q ,x[N] ,nxt[N] ,lst[N] ;
int main(){
scanf("%d",&n);
int sq = sqrt(n) ;
for(int i=1;i<=n;++i) scanf("%d",x+i);
scanf("%d",&l);
for(int i=1;i<=n;++i){
int st = i ,en = n ;
while(st<en){
int mid = (st+en+1)/2 ;
if(x[mid]-x[i]>l) en = mid-1 ;
else st = mid ;
}
nxt[i] = st ;
}
for(int i=1;i<=n;++i){
int cur = i ;
for(int j=0;j<sq;++j){
if(cur==n){
cur = 1e9+5 ;
break ;
}
cur = nxt[cur] ;
}
lst[i] = cur ;
}
lst[n] = 1e9+5 ;
scanf("%d",&q);
while(q--){
int a,b;
scanf("%d%d",&a,&b);
if(a>b) swap(a,b);
if(a==b){
puts("0");
continue ;
}
int ans = 0 ;
while(lst[a]<=b){
a = lst[a] ;
ans += sq ;
}
while(a<b){
++ans ;
a = nxt[a] ;
}
printf("%d\n",ans);
}
return 0;
}
| 0
| 29,417,899
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
int main(){
string s;
int n, flag =0;
cin >> s;
n = s.size()-1;
for(int i=0; i<=n/4; i++){
if(s[i]==s[n-i] && s[i]==s[((n-2)/2)-i] && s[n-i]==s[((n+2)/2)+i]) flag =1;
else{
flag = 0;
break;
}
}
if (flag == 1) cout << "Yes";
else cout << "No";
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll> adj[200005];
ll cnt=0;
bool status[200005];
void dfs(int s)
{
cnt++;
status[s]=true;
for(auto it:adj[s])
{
if(!status[it])
{
dfs(it);
}
}
}
void solve()
{
ll n,m;
cin>>n>>m;
ll a,b;
for(ll i=0;i<m;i++)
{
cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
memset(status,false,sizeof(status));
ll maxx=-1;
for(int i=1;i<=n;i++)
{
if(!status[i])
{
cnt=0;
dfs(i);
maxx=max(maxx,cnt);
}
}
cout<<maxx<<endl;
}
int main()
{
solve();
}
| 0
| 84,400,449
|
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b;
c=a*b;
if(c%2==1)
{cout<<"Odd"<<endl;}
else cout<<"Even"<<endl;
}
|
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
int h,w,n;
char m[1001][1001];
int dx[4]={0,0,-1,1};
int dy[4]={-1,1,0,0};
bool bj[1001][1001];
int start_x;
int start_y;
int total;
int cnt;
struct Node{
int x,y;
int time;
};
bool pd(int a,int b)
{
if(a>=0&&a<h&&b>=0&&b<w)
return true;
return false;
}
void BFS(int a)
{
memset(bj,false,sizeof(bj));
int i;
Node start;
start.x=start_x;
start.y=start_y;
start.time=0;
cnt=0;
bj[start.x][start.y]=true;
queue<Node> Q;
Q.push(start);
while(!Q.empty())
{
Node q1;
q1=Q.front();
Q.pop();
if((int)(m[q1.x][q1.y]-'0')==a)
{
total+=q1.time;
start_x=q1.x;
start_y=q1.y;
return ;
}
for(i=0;i<4;i++)
{
Node q2;
q2.x=q1.x+dx[i];
q2.y=q1.y+dy[i];
if(pd(q2.x,q2.y))
{
if(m[q2.x][q2.y]!='X'&&!bj[q2.x][q2.y])
{
q2.time=q1.time+1;
if(!bj[q2.x][q2.y]){
bj[q2.x][q2.y]=true;
Q.push(q2);
}
}
}
}
}
}
int main()
{
cin>>h>>w>>n;
int i,j;
for(i=0;i<h;i++)
{
for(j=0;j<w;j++)
{
cin>>m[i][j];
if(m[i][j]=='S')
{
start_x=i;
start_y=j;
}
}
}
total=0;
for(i=1;i<=n;i++)
BFS(i);
cout<<total<<endl;
return 0;
}
| 0
| 55,088,616
|
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int main() {
int n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x, n){
vector<int> hit(n);
REP(i, n){
cin >> hit[i];
}
int ans;
int count = 0;
for(ans = 0; ans <= 10000;ans++){
if (hit[count] == x)
count++;
if (count == n)
break;
x = (a*x + b) % c;
}
if (ans == 10001)ans = -1;
cout << ans << endl;
}
}
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define Yes(condition) if(condition){ cout << "Yes" << '\n'; }else{ cout << "No" << '\n'; }
#define YES(condition) if(condition){ cout << "YES" << '\n'; }else{ cout << "NO" << '\n'; }
#define yes(condition) if(condition){ cout << "yes" << '\n'; }else{ cout << "no" << '\n'; }
int main() {
ll w, h;
cin >> w >> h;
vector<pair<ll, ll>> a(w + h);
REP(i, w + h){
ll t;
cin >> t;
a[i] = {t, (i < w)? 0 : 1};
}
sort(a.begin(), a.end());
ll x = w + 1, y = h + 1;
ll ans = 0;
REP(i, w + h){
if(a[i].second == 0){
ans += a[i].first * y;
x--;
}
else{
ans += a[i].first * x;
y--;
}
}
cout << ans << endl;
}
| 0
| 59,165,140
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int main() {
cout << fixed << setprecision(10);
int n,k;
cin >> n >> k;
vector<int> l(n);
rep(i,n) cin >> l.at(i);
sort(ALLR(l));
int ans = 0;
rep(i,k){
ans+=l.at(i);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
string S, T;
cin >> S >> T;
if (S==T)
{
cout << "Yes" << endl;
return 0;
}
for (int i = S.size()-1; i >= 1; i--)
{
string U;
for (int j = i; j < S.size(); j++)
{
U.push_back(S.at(j));
}
for (int k = 0; k < i; k++)
{
U.push_back(S.at(k));
}
bool ok = true;
rep(m, T.size()) {
if (T.at(m) != U.at(m)) {
ok = false;
break;
}
}
if (ok) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| 0
| 95,510,349
|
#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()
{
map<char,int> mp;
string S;cin>>S;
for(auto x:S) ++mp[x];
bool ok=true;
if(mp.size()!=2) ok=false;
for(auto &itr:mp){
if(itr.second!=2) ok=false;
}
cout<<(ok ? "Yes\n":"No\n");
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI=3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for(int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y) - 1) / (y))
#define MOD 1000000007ULL
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int m;
cin >> m;
s64 d, c;
s64 ans = 0;
s64 num = 0;
rep (i, m)
{
cin >> d >> c;
num += d * c;
ans += c;
}
--ans;
s64 u = num / 10;
d = num % 10;
while (u >= 10)
{
ans += u / 10 * 10;
u = u % 10 + u / 10;
}
while (u > 0)
{
ans += u;
s64 temp = u + d;
u = temp / 10;
d = temp % 10;
}
cout << ans << "\n";
return 0;
}
| 0
| 53,268,165
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<long double>;
using VPLD = vector<PLD>;
const int INF = numeric_limits<int>::max();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
LL n, y; cin >> n >> y;
for (int i=0; i<=n; i++) {
for (int j=0; j<=n-i; j++) {
if (i*9000+j*4000==y-n*1000) {
if (i*10000+j*5000+(n-i-j)*1000==y) {
cout << i << " " << j << " " << n-i-j << endl;
return 0;
}
}
}
}
cout << "-1 -1 -1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())
int main() {
ll n, d, a;
cin >> n >> d >> a;
vector<ll> x(n), h(n);
REP(i, n) {
cin >> x[i] >> h[i];
h[i] = (h[i] + a - 1) / a;
}
vector<ll> ord(n), cnt(n + 5, 0);
iota(ALL(ord), 0);
sort(ALL(ord), [&](ll i, ll j) { return x[i] < x[j]; });
ll ans = 0;
REP(i, n) {
ll j = ord[i];
ll t = max(h[j] - cnt[i], 0LL);
ans += t;
ll ok = -1, ng = n;
while (ok + 1 < ng) {
ll m = (ok + ng) / 2;
(x[ord[m]] <= x[j] + 2 * d ? ok : ng) = m;
}
cnt[i] += t;
cnt[ng] -= t;
cnt[i + 1] += cnt[i];
}
cout << ans << endl;
}
| 0
| 62,209,049
|
#include <iostream>
#include <cmath>
void makeKochCurve(double x1, double y1, double x2, double y2, int depth)
{
if (depth == 0) return;
double length = sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));
double angle = atan2(y2-y1, x2-x1);
double xa = (2.0 * x1 + x2) / 3;
double ya = (2.0 * y1 + y2) / 3;
double xb = (x1 + x2) / 2 - sqrt(3) * length * sin(angle) / 6.0;
double yb = (y1 + y2) / 2 + sqrt(3) * length * cos(angle) / 6.0;
double xc = (x1 + 2.0 * x2) / 3;
double yc = (y1 + 2.0 * y2) / 3;
makeKochCurve(x1, y1, xa, ya, depth-1);
std::cout << xa << " " << ya << std::endl;
makeKochCurve(xa, ya, xb, yb, depth-1);
std::cout << xb << " " << yb << std::endl;
makeKochCurve(xb, yb, xc, yc, depth-1);
std::cout << xc << " " << yc << std::endl;
makeKochCurve(xc, yc, x2, y2, depth-1);
}
int main()
{
int n;
std::cin >> n;
std::cout << std::fixed;
std::cout << 0.0 << " " << 0.0 << std::endl;
makeKochCurve(0.0, 0.0, 100.0, 0.0, n);
std::cout << 100.0 << " " << 0.0 << std::endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
string X;
string Y;
int calc(int x, int y, vector<vector<int> >& Memo){
if (X[x] == '\0' || Y[y] == '\0') return 0;
if (Memo[x][y] != -1) return Memo[x][y];
int unuse = calc(x + 1, y, Memo);
int use = 0;
int y_target = Y.find(X[x], y);
if (y_target == string::npos) {
use = 0;
} else {
use = calc(x + 1, y_target + 1, Memo) + 1;
}
return Memo[x][y] = max(unuse, use);
}
int main(){
int q;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> X;
cin >> Y;
vector<int> tmp(Y.size(), -1);
vector<vector<int> > Memo(X.size(), tmp);
cout << calc(0, 0, Memo) << endl;
}
return 0;
}
| 0
| 21,414,203
|
#include <string>
#include <iostream>
using namespace std;
int n;
string x, y;
bool mat[1000][1000];
int a[1000][1000];
int max(int i, int j) {
int r = (!mat[i - 1][j] ? a[i - 1][j] : 0);
r = ((!mat[i][j - 1] && a[i][j - 1] > r) ? a[i][j - 1] : r);
return r > a[i - 1][j - 1] ? r : a[i - 1][j - 1];
}
int main(){
cin >> n;
for (int ia = 0; ia < n; ia++) {
int ans = 0, p = 0;
cin >> x >> y;
for (int i = 0; i < x.length(); i++) {
mat[i][0] = x[i] == y[0] ? true : false;
a[i][0] = mat[i][0] ? 1 : 0;
}
for (int i = 1; i < y.length(); i++) {
mat[0][i] = x[0] == y[i] ? true : false;
a[0][i] = mat[0][i] ? 1 : 0;
}
for (int i = 1; i < x.length(); i++) {
for (int j = 1; j < y.length(); j++) {
mat[i][j] = x[i] == y[j] ? true : false;
a[i][j] = max(i, j) + (mat[i][j] ? 1 : 0);
if (a[i][j] > p) p = a[i][j];
}
}
if (a[x.length() - 1][0] > p) p = a[x.length() - 1][0];
if (a[0][y.length() - 1] > p) p = a[0][y.length() - 1];
cout << p << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
int n;cin>>n;
int d[n];
map<int,ll> mp;
rep(i,n){
cin>>d[i];
mp[d[i]]++;
}
if(d[0]!=0||mp[0]>1||(mp[0]>0&&d[0]!=0)){
cout<<0<<"\n";
return 0;
}
ll ans=1,mod=998244353;
for(int i=1;i<n;i++){
ans=(ans*mp[d[i]-1])%mod;
}
cout<<ans<<"\n";
}
| 0
| 36,025,812
|
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
long double x1,y1,x2,y2,ans;
cin >> x1 >> y1 >> x2 >> y2;
ans = (x2 - x1)*(x2 - x1)+(y2 - y1)*(y2 - y1);
ans = sqrtl(ans);
cout << setprecision(18) << ans << "\n";
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
#define lsc(x) scanf("%lld",&x)
#define sc(x) scanf("%d",&x)
#define lpr(x) printf("%lld ",(long long)x)
#define pr(x) printf("%d ",x)
#define n_l printf("\n")
#define VI vector<int>
#define VII vector<long long int>
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define mset(x,y) memset(x,y,sizeof(x))
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define fr(i, a, n) for(int i=a;i<=n;i++)
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
const int N=(int)1e6+5;
const int mod = 1000000007;
typedef long long ll;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
ll fmod(ll x){if (x<mod) return x;return x%mod;}
ll mul(ll a, ll b, ll c){
ll ret=0;while(b){if (b%2) ret=(ret+a)%c;a=(a*2)%c;b>>=1;}
return ret;
}
int modpow(ll a, ll b){
ll ret=1;while(b){if (b%2) ret=(ret*a)%mod;a=(a*a)%mod;b>>=1;}
return (int)ret;
}
inline int inv(int x){ return modpow(x, mod-2);}
int isprime[N];
void calc_prime(){
isprime[1]=1;for(ll i=2;i<N;i++) if (!isprime[i]) for(ll j=i*i;j<N;j+=i) isprime[j]=1;
}
int main(){
int x;sc(x);
int n;sc(n);
set<int> s;
fr(i, -100, 200) s.insert(i);
fr(i, 1, n){
int p;sc(p);
if (s.find(p)!=s.end()){
s.erase(p);
}
}
int ans = 0;
int diff = mod;
for(auto u: s){
int tmp = abs(u-x);
if (tmp < diff){
diff = tmp;
ans = u;
}
}
pr(ans);n_l;
return 0;
}
| 0
| 45,600,205
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool valid(int lx,int ux,int ly,int uy,int x,int y){
return lx<=x&&x<ux&&ly<=y&&y<uy;
}
ll power(ll x,ll p){
if(p==0)return 1;
ll res=power(x*x%mod,p/2);
if(p%2==1)res=res*x%mod;
return res;
}
int main()
{
int n,k;
cin>>n>>k;
vector<int> a(n);
rep(i,n)cin>>a[i];
ll ans=1e12;
rep(bit, (1<<n)){
if(__builtin_popcount(bit)<k)continue;
vector<int> pos, tmp=a;
rep(i,n){
if(bit&(1<<i))pos.push_back(i);
}
ll res=0;
int h=0;
for(auto p:pos){
if(tmp[p]<=h){
res+=h+1-tmp[p];
tmp[p]=h+1;
}
h=tmp[p];
}
bool is_valid=true;
h=0;
rep(i,n){
if(tmp[i]<=h&&(bit&(1<<i)))is_valid=false;
h=max(tmp[i],h);
}
if(is_valid)ans=min(ans,res);
}
cout<<ans<<endl;
return 0;
}
|
#include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define F first
#define S second
using namespace std;
template<class T> void max_self(T & a, const T & b) { if(a < b) a = b; }
template<class T> void min_self(T & a, const T & b) { if(a > b) a = b; }
typedef long long LL;
const int INF = 1e9 + 7;
const double PI = acos(-1.0);
const double EPS = (1e-9);
int N, M;
string A[55], B[55];
bool check(int row, int col){
for(int r = 0; r < M; ++r){
for(int c = 0; c < M; ++c){
if(B[r][c] != A[row + r][col + c]) return false;
}
}
return true;
}
inline bool solve(){
for(int r = 0; N - r >= M; ++r){
for(int c = 0; N - c >= M; ++c){
if(check(r, c)) return true;
}
}
return false;
}
int main(){
FAST_IO
cin >> N >> M;
for(int r = 0; r < N; ++r) cin >> A[r];
for(int r = 0; r < M; ++r) cin >> B[r];
if(solve()) cout << "Yes\n";
else cout << "No\n";
return 0;
}
| 0
| 73,268,099
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#define _GLIBCXX_DEBUG
#define DIVISOR 1000000007
using namespace std;
typedef pair<int,int> pii;
typedef pair<int64_t, int64_t> pII;
template<typename T>
void cins(vector<T>& arr) { for(T& e: arr) cin >> e; }
#ifdef DEBUG
#define debug(fmt, ...) \
printf("[debug: %s] " fmt, __func__, __VA_ARGS__)
#define ps(arr) \
debug("size %ld: ", arr.size()); \
for(auto e: arr) cout << e << " "; \
cout << endl;
#else
#define debug(fmt, ...)
#define ps(arr)
#endif
int main(void) {
int vs, es;
cin >> vs >> es;
vector<int> cnts(vs+1);
for(int i = 0; i < es; i++) {
int v1, v2;
cin >> v1 >> v2;
cnts[v1]++;
cnts[v2]++;
}
bool ans = 1;
for(int cnt: cnts) {
if(cnt%2) ans = 0;
}
cout << (ans ? "YES" : "NO") << endl;
return 0;
}
|
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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 fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b ;
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#pragma endregion
signed main() {
int n,m;cin >> n >> m;
priority_queue<int> pri;
rep(i, n) {
int a;cin >> a;
pri.push(a);
}
rep(i, m) {
int p = pri.top();pri.pop();
p/=2;
pri.push(p);
}
int sum = 0;
rep(i, n) {
int p = pri.top();pri.pop();
sum+=p;
}
cout << sum << endl;
return 0;
}
| 0
| 57,964,457
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());return ret;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int ctoi(char c) {return c-'0';}
ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
ll lcm(ll a,ll b){ll g = gcd(a,b);return a/g*b;}
bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
ll modpow(ll a,ll n, ll mod){ll res = 1;while(n>0){if (n%2==1){res = res * a % mod;}a = a * a % mod;n/=2;}return res;}
int main() {
ll n;
cin >> n;
ll ans = 0;
for(int i=1;i<=n;i++){
ll a = i;
ll b = n-i;
if(a!=b){
ans++;
}
}
ans/=2;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll INF = 1e12;
const ll MOD = 1000000000 + 7;
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl vector<pll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define mii map<int, int>
#define mci map<char, int>
#define mll map<ll, ll>
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pr_d(x) cout << fixed << setprecision(15) << x << endl
#define ud(c, x) distance(c.begin(), upper_bound(all(c), x))
#define ld(c, x) distance(c.begin(), lower_bound(all(c), x))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep3(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep4(i, a, b) for (int i = (a); i > (b); --i)
#define pb push_back
#define out(x) cout << x << "\n"
bool odd(int i) { return i % 2; }
#define all(v) v.begin(), v.end()
#define size(x) int(x.size())
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
void Yes_No(bool f) {
if (f)
printf("Yes\n");
else
printf("No\n");
}
void YES_NO(bool f) {
if (f)
printf("YES\n");
else
printf("NO\n");
}
template <typename T>
void deb1(T x) {
cout << "debug: " << x << "\n";
}
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void solve(void) {
int n;
cin >> n;
vector<map<char, int>> vmp;
rep(i, n) {
string tmp;
cin >> tmp;
map<char, int> mp;
rep(j, size(tmp)) mp[tmp[j]]++;
vmp.pb(mp);
}
string ans;
for (auto i : vmp[0]) {
int x = i.se;
rep2(j, 1, n) chmin(x, vmp[j][i.fi]);
rep(j, x) ans += i.fi;
}
out(ans);
}
int main(void) { solve(); }
| 0
| 30,277,032
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 1005;
ll x[N][3], a[N];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, m;
cin>>n>>m;
for(int i = 0; i < n; i++){
for(int j = 0; j < 3; j++){
cin>>x[i][j];
}
}
ll ans = 0;
for(int mask = 0; mask < 8; mask++){
for(int i = 0; i < n; i++){
a[i] = 0;
for(int j = 0; j < 3; j++){
if(mask&(1<<j))a[i] += x[i][j];
else a[i] -= x[i][j];
}
}
sort(a, a + n, greater<ll>());
ll sum = accumulate(a, a + m, 0LL);
ans = max(ans, sum);
}
cout<<ans<<'\n';
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct UnionFind{
int par[10005];
int rank[10005];
UnionFind(int n){ init(n);}
void init(int n){
for(int i=0;i<n;i++){
par[i] = i;
rank[i] = 0;
}
}
int find(int x){
if(x == par[x]) return x;
return par[x] = find(par[x]);
}
int same(int x, int y){
return find(x) == find(y);
}
void unite(int x, int y){
x = find(x); y = find(y);
if(x==y) return;
if(rank[x] < rank[y]){
par[x] = y;
}else{
par[y] = x;
if(rank[x] == rank[y]) rank[x]++;
}
}
};
int main(){
int n,q;
scanf("%d%d",&n,&q);
UnionFind uf(n);
while(q--){
int com, x,y;
scanf("%d%d%d",&com,&x,&y);
if(com) printf("%d\n", uf.same(x,y));
else uf.unite(x,y);
}
return 0;
}
| 0
| 17,709,817
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
int dc(char *n){
int idx=0;
int res=0;
int sz=strlen(n);
while(idx<sz){
int current=1;
if(n[idx]>='2' && n[idx]<='9'){
current = n[idx] - '0';
idx++;
}
switch(n[idx]){
case 'm': current*=1000; break;
case 'c': current*=100; break;
case 'x': current*=10; break;
}
idx++;
res+=current;
}
return res;
}
int main(){
int n;
cin >> n;
while(n-->0){
char n1[10], n2[10];
scanf("%s %s", n1, n2);
int num= dc(n1)+dc(n2);
string res;
rep(i,4){
int k[]={1000,100,10,1};
string c[]={"m","c","x","i"};
if(num>=2*k[i]){
res += (num/k[i]+'0');
res += c[i];
num%=k[i];
}
else if(num>=k[i]){
res += c[i];
num%=k[i];
}
}
cout << res<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int N, A, B;
int main() {
scanf("%d %d %d", &N, &A, &B);
if(A + B - 1 > N) {
printf("-1");
return 0;
}
if(N > 1LL * A * B) {
printf("-1");
return 0;
}
int pos = N;
for(int i = 0; i < B; i++) {
int nxt = max(B - i - 1, pos - A);
for(int j = nxt + 1; j <= pos; j++) {
printf("%d ", j);
}
pos = nxt;
}
}
| 0
| 81,782,851
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, k;
cin >> a >> b >> c >> k;
int op = 0;
while (b <= a) {
b *= 2;
op++;
}
while (c <= b) {
c *= 2;
op++;
}
cout << (op <= k ? "Yes" : "No");
}
|
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll w,h,n;
cin >> w >> h >> n;
std::vector<int> x(n);
std::vector<int> y(n);
int a;
ll light=0,right=w,botom=0,top=h;
rep(i,n){
cin >> x.at(i) >> y.at(i) >> a;
if(a==1){
if(light<x.at(i)){
light=x.at(i);
}
}
if(a==2){
if(right>x.at(i)){
right=x.at(i);
}
}
if(a==3){
if(botom<y.at(i)){
botom=y.at(i);
}
}
if(a==4){
if(top>y.at(i)){
top=y.at(i);
}
}
}
int ans,W,H;
W=right-light;
H=top-botom;
if(top<=botom || right<=light){
W=0; H=0;
}
ans=W*H;
cout << ans << endl;
}
| 0
| 54,418,489
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
int cnt[86401];
int toSec(string s) {
int h = (s[0] - '0') * 10 + (s[1] - '0');
int m = (s[3] - '0') * 10 + (s[4] - '0');
int sec = (s[6] - '0') * 10 + (s[7] - '0');
return h * 3600 + m * 60 + sec;
}
int main() {
while (cin >> n) {
if (!n) return 0;
int i;
for (i = 0; i < 86400; i++) cnt[i] = 0;
for (i = 0; i < n; i++) {
string s, t;
cin >> s >> t;
cnt[toSec(s)]++;
cnt[toSec(t)]--;
}
for (i = 1; i < 86400; i++) cnt[i] += cnt[i - 1];
int ans = 0;
for (i = 0; i < 86400; i++) ans = max(ans, cnt[i]);
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int fiboArray[44] = {0};
int fibonacci(int anySection) {
if (anySection == 0 || anySection == 1)
return (fiboArray[anySection] = 1);
if (fiboArray[anySection] == 0) {
fiboArray[anySection] = fibonacci(anySection - 1) + fibonacci(anySection - 2);
return fiboArray[anySection];
}
else
return fiboArray[anySection];
}
int main() {
int anySection;
cin >> anySection;
int answer = fibonacci(anySection);
cout << answer << endl;
return 0;
}
| 0
| 68,329,314
|
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll dp[2003][2003];
int main()
{
int n, m;
cin >> n >> m;
int s[2003], t[2003];
for(int i = 0; i < n; i++) cin >> s[i];
for(int i = 0; i < m; i++) cin >> t[i];
dp[0][0] = 1;
for(int i = 0; i <= n; i++){
for(int j = 0; j <= m; j++){
if(i == 0 || j == 0) dp[i][j] = 1;
else if(s[i - 1] == t[j - 1]) dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
else dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] + MOD - dp[i - 1][j - 1]) % MOD;
}
}
cout << dp[n][m] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
const i64 MOD = 998244353;
int main()
{
i64 N;
cin >> N;
vector<pair<i64, i64>> xy(N);
for (i64 i = 0; i < N; i++)
cin >> xy[i].first >> xy[i].second;
sort(xy.begin(), xy.end(), [](const pair<i64, i64> &l, const pair<i64, i64> &r) {
return atan2(l.second, l.first) < atan2(r.second, r.first);
});
i64 ans = 0;
for (i64 i = 0; i < N; i++)
for (i64 j = 1; j <= N; j++)
{
i64 x = 0, y = 0;
for (i64 k = 0; k < j; k++)
{
x += xy[(i + k) % N].first;
y += xy[(i + k) % N].second;
}
ans = max(ans, x * x + y * y);
}
cout << fixed << setprecision(11) << sqrt(ans) << endl;
return 0;
}
| 0
| 27,535,468
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e6;
int A[N+1];
int GCD(int a,int b){
return b==0?a:GCD(b,a%b);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int n,tmp,gcd=0;
cin>>n;
for(int i=0;i<n;++i){
cin>>tmp;
++A[tmp];
gcd=GCD(tmp,gcd);
}
for(int i=2;i<=N;++i){
int flag=0;
for(int j=i;j<=N;j+=i){
if(j<=N && A[j]>=1) flag+=A[j];
if(flag>=2) goto setwise;
}
}
cout<<"pairwise coprime"<<endl;
return 0;
setwise:
if(gcd==1) cout<<"setwise coprime"<<endl;
else cout<<"not coprime"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N;
cin>>N;
int is_reverse=0;
deque<int> deq;
rep(i,N)
{
int a;
cin>>a;
if(is_reverse)
{
deq.push_front(a);
}
else
{
deq.push_back(a);
}
(is_reverse+=1)%=2;
}
rep(i,N)
{
if(is_reverse) cout<<deq.back();
else cout<<deq.front();
if(i!=N) cout<<" ";
if(is_reverse) deq.pop_back();
else deq.pop_front();
}
cout<<endl;
return 0;
}
| 0
| 65,170,743
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
int main() {
int N;
cin >> N;
bool Prime[101];
rep(i, 101) Prime[i] = true;
Prime[0] = Prime[1] = false;
for (int i=2; i<=100; i++) {
if (Prime[i]) {
for (int j=i*2; j<=100; j+=i) Prime[j] = false;
}
}
int CntP[101] = {};
for (int n=1; n<=N; n++) {
for (int i=2; i<=N; i++) {
if ((Prime[i]) && (n%i==0)) {
int tmp = n;
while ((tmp > 1) && (tmp%i==0)) {
CntP[i]++;
tmp /= i;
}
}
}
}
int over3=0, over5=0, over15=0, over25=0, over75=0;
rep(i, N+1) {
if (CntP[i] >= 2) over3++;
if (CntP[i] >= 4) over5++;
if (CntP[i] >= 14) over15++;
if (CntP[i] >= 24) over25++;
if (CntP[i] >= 74) over75++;
}
int ans = 0;
ans += (over5 * (over5 - 1)) / 2 * (over3 - 2);
ans += over15 * (over5 - 1);
ans += over25 * (over3 - 1);
ans += over75;
cout << ans << endl;
return 0;
}
|
#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(){
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
int ans=0;
while(!(a[0]==a[1] && a[1]==a[2])){
sort(a.begin(),a.end());
if(a[1]==a[2]){
a[0]+=2;
++ans;
}
else if(a[0]==a[1]){
++a[0];
++a[1];
++ans;
}
else{
a[0]+=2;
++ans;
}
}
cout << ans << endl;
return 0;
}
| 0
| 90,409,596
|
#include<iostream>
using namespace std;
int main(void){
for(int i = 1;i < 10;i++){
for(int j = 1;j < 10;j++){
cout << i << 'x' << j << '=' <<i * j << "\n";
}
}
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>
#define int long long
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define reads(s) string s; cin >> s;
#define readarr(a, n) int a[(n) + 1] = {}; fori (i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; fori (i, 1, n) {fori (j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) fori (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) fori (i, 1, n) {fori (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define all(v) v.begin(), v.end()
#define sz(s) (int)(s.size())
#define pb push_back
#define fi first
#define se second
#define rz resize
#define fori(i, a, b) for (int i = (a); i <= (b); i++)
#define ford(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
#define setprec(x) cout << fixed << setprecision(x);
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair <int, int>> vpi;
typedef vector < vector <int> > vvi;
const int INF = 4e18;
const int mod = 1e9+7;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
readb(n, k) readarr(a, n)
int x[n+1] = {}, y[n+1] = {}, ans = 0;
fori (i, 1, n)
{
fori (j, 1, n) if(a[i] > a[j]) x[i]++;
fori (j, i+1, n) if(a[i] > a[j]) y[i]++;
}
fori (i, 1, n)
{
int z = (k*(k-1)/2) % mod;
ans += (y[i]*k % mod + x[i]*z % mod);
ans %= mod;
}
print(ans)
return 0;
}
| 0
| 50,010,587
|
#include <cstdlib>
#include <string>
#include <iostream>
std::string get_performace(int a, int b, int c) {
std::string res;
if (a < 0 || b < 0) {
res = "F";
} else if (a + b >= 80) {
res = "A";
} else if (a + b >= 65) {
res = "B";
} else if (a + b >= 50) {
res = "C";
} else if (a + b >= 30) {
if (c >= 50) {
res = "C";
} else {
res = "D";
}
} else {
res = "F";
}
return res;
}
int main() {
int a, b, c;
while (true) {
std::cin >> a >> b >> c;
if (a < 0 && b < 0 && c < 0) {
break;
}
std::cout << get_performace(a, b, c) << std::endl;
}
return EXIT_SUCCESS;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
struct card{
char suit;
int value;
};
void bubbleSort(card C[], int n);
void selectionSort(card C[], int n);
bool isSame(card A[], card B[], int n);
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
card A[36], B[36];
cin>>n;
for(int i=0; i<n; i++) {
cin>>A[i].suit>>A[i].value;
B[i]=A[i];
}
bubbleSort(A, n);
selectionSort(B, n);
for(int i=0; i<n-1; i++) cout<<A[i].suit<<A[i].value<<' ';
cout<<A[n-1].suit<<A[n-1].value<<'\n'<<"Stable\n";
for(int i=0; i<n-1; i++) cout<<B[i].suit<<B[i].value<<' ';
cout<<B[n-1].suit<<B[n-1].value<<'\n';
if(isSame(A, B, n)) cout<<"Stable\n";
else cout<<"Not stable\n";
return 0;
}
void bubbleSort(card C[], int n)
{
for(int i=0; i<n; i++) {
for(int j=n-1; j>i; j--) {
if(C[j].value<C[j-1].value) swap(C[j], C[j-1]);
}
}
}
void selectionSort(card C[], int n)
{
for(int i=0; i<n; i++) {
int mini=i;
for(int j=i+1; j<n; j++) {
if(C[j].value<C[mini].value) mini=j;
}
if(mini!=i) swap(C[mini], C[i]);
}
}
bool isSame(card A[], card B[], int n)
{
for(int i=0; i<n; i++) {
if(A[i].suit!=B[i].suit) return false;
}
return true;
}
| 0
| 8,862,379
|
#include <stdio.h>
int main(void) {
int i, j, x[100000], y[100000];
i = 0;
do {
scanf("%d %d", &x[i], &y[i]);
i++;
} while (!(x[i - 1] == 0 && y[i - 1] == 0));
for (j = 0; j < i- 1; j++) {
if (x[j] < y[j]) {
printf("%d %d\n", x[j], y[j]);
} else {
printf("%d %d\n", y[j], x[j]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N;
string S;
cin >> N >> S;
ll cnt = 0;
REP(i,0,10) {
REP(j,0,10) {
REP(k,0,10) {
ll p = 0;
while(p < N && S[p] - '0' != i) ++p;
++p;
while(p < N && S[p] - '0' != j) ++p;
++p;
while(p < N && S[p] - '0' != k) ++p;
if(p < N) ++cnt;
}
}
}
PR(cnt);
return 0;
}
| 0
| 9,429,128
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.