code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
int64_t answer = A[0] - 1;
int offset = 2;
for (int i = 1; i < N; ++i) {
if (A[i] <= offset) {
offset = max(offset, A[i] + 1);
continue;
}
answer += (int64_t)((A[i] - 1) / offset);
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long Q,H,S,D,N,n;cin>>Q>>H>>S>>D>>n;
N=n*100;
if((Q*8<=H*4)&&(Q*8<=S*2)&&(Q*8<=D)){
cout<<Q*(N/25)<<endl;
return 0;
}
else if((H*4<=Q*8)&&(H*4<=S*2)&&(H*4<=D)){
cout<<H*(N/50)<<endl;
return 0;
}
else if((S*2<=Q*8)&&(S*2<=H*4)&&(S*2<=D)){
cout<<S*n<<endl;
return 0;
}
else if((D<=Q*8)&&(D<=H*4)&&(D<=S*2)){
if(n%2==0){
cout<<D*(N/200)<<endl;
return 0;
}
else{
long long ans=0;
ans+=D*(N/200);
long long rest=N%200;
if((Q*8<=H*4)&&(Q*8<=S*2)){
ans+=(rest/25)*Q;
cout<<ans<<endl;
return 0;
}
if((H*4<=Q*8)&&(H*4<=S*2)){
ans+=(rest/50)*H;
cout<<ans<<endl;
return 0;
}
if((S*2<=Q*8)&&(S*2<=H*4)){
ans+=(rest/100)*S;
cout<<ans<<endl;
return 0;
}
}
}
return 0;
}
| 0
| 60,739,719
|
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
struct Node{
int value;
Node *prev,*next;
};
Node *nil;
void insert(int x){
Node *now;
now=(Node *)malloc(sizeof(Node));
now->value=x;
now->prev=nil;
now->next=nil->next;
nil->next->prev=now;
nil->next=now;
return;
}void _delete(int x){
Node *now=nil->next;
while(now!=nil){
if(now->value==x)break;
now=now->next;
}
if(now->value!=x)return;
now->next->prev=now->prev;
now->prev->next=now->next;
free(now);
return;
}void first(){
nil->next->next->prev=nil;
nil->next=nil->next->next;
return;
}void last(){
nil->prev->prev->next=nil;
nil->prev=nil->prev->prev;
return;
}
int main(){
nil=(Node*)malloc(sizeof(Node));
nil->prev=nil->next=nil;
int N,x;
string str;
cin >> N;
for(int i=0 ; i<N ; i++ ){
cin >> str;
if(str=="deleteFirst"){
first();
}else if(str=="deleteLast"){
last();
}else{
cin >> x;
if(str=="insert"){
insert(x);
}else{
_delete(x);
}
}
}
Node *now=nil->next;
while(now!=nil){
cout << now->value;
now=now->next;
if(now!=nil)cout<<" ";
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int main() {
char C[1000][1000];
char color[2][2] = { {'R', 'Y'}, {'G', 'B'} };
int H,W,D;
cin >> H >> W >> D;
for ( int i = 0; i < H+W; i++ ) {
for ( int j = 0; j < H+W; j++ ) {
C[i][j] = color[ (i/D)%2 ][ (j/D)%2 ];
}
}
for ( int i = 0; i < H; i++ ) {
for ( int j = 0; j < W; j++ ) {
cout << C[i+j][i-j+W];
}
cout << endl;
}
return 0;
}
| 0
| 31,043,056
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int main() {
int64_t S; cin >> S;
auto OK = [&](int64_t x) -> bool {
return x * 1e9 < S;
};
int64_t l = 0, r = 1e9;
while(r - l > 1) {
int64_t c = (l + r) / 2;
if(OK(c)) l = c;
else r = c;
}
int64_t x1 = 1e9;
int64_t y1 = 1;
int64_t y2 = r;
int64_t x2 = x1 * y2 - S;
printf("0 0 %ld %ld %ld %ld\n", x1, y1, x2, y2);
cerr << x1 * y2 - x2 * y1 << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
template<typename T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
const int MAX_ROW = 110;
const int MAX_COL = 100005;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
int n;
void GaussJordan(BitMatrix &A, bool is_extended = false) {
vector<bool> used(A.H, 0);
for (int col = 0; col < A.W; ++col) {
if (is_extended && col == A.W - 1) break;
int pivot = -1;
for (int row = 0; row < A.H; ++row) {
if (used[row]) continue;
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1) continue;
for (int row = 0; row < A.H; ++row) {
if (row != pivot && A[row][col]) A[row] ^= A[pivot];
}
used[pivot] = true;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<int> odd(61);
ll res = 0;
BitMatrix B(61, n + 1);
for (ll i = 60; i >= 0; --i) {
int cnt = 0;
rep(j, n) {
if (a[j] & (1LL << i)) cnt++;
}
if (cnt & 1) {
odd[i] = 1;
res += (1LL << i);
} else if (cnt == 0) {
odd[i] = 1;
} else {
rep(j, n) {
if (a[j] & (1LL << i)) B[60 - i][j] = 1;
}
B[60 - i][n] = 1;
}
}
GaussJordan(B, true);
for (int i = 60; i >= 0; --i) {
if (odd[i]) continue;
bool ok = false;
rep(j, n) if (B[60 - i][j]) ok = true;
if (!B[60 - i][n]) ok = true;
if (ok) { res += (2LL << i); }
}
cout << res << endl;
}
| 0
| 69,549,536
|
#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define M 1000000007
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define all(a) (a).begin(),(a).end()
#define sz(x) (ll)x.size()
#define endl '\n'
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b)) / gcd((a),(b))
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ini(a,n,b) for(ll int i=0;i<n;i++) a[i]=0;
#define F first
#define S second
#define DB(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl
#define TIME cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
using namespace std;
bool DEBUG = 0;
void solve()
{
ll a,b,k;cin>>a>>b>>k;
if (k <= a)
{
cout<<(a-k)<<" "<<b<<"\n";
}
else if (k <= (a+b))
{
cout<<0<<" "<<(a+b - k)<<"\n";
}
else
{
cout<<0<<" "<<0<<"\n";
}
}
int main(void)
{
ios
int t=1;
while(t--)
{
solve();
}
}
|
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#include <bitset>
#define rep(i, a, b) for ( ll i = (a); i < (b); i++ )
#define per(i, a, b) for ( ll i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define bg begin()
#define en end()
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<int, int>;
static const long long MOD = 1000000007;
static const long long LINF = (ll)(1e18+99);
static const int INF = 1e9+99;
const int MAX_ROW = 100005;
const int MAX_COL = 100;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int h = 1, int w = 1) : H(h), W(w) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
int xor_elimination(BitMatrix &A) {
int COL = A.W, ROW = A.H;
int rank = 0;
for (int col = COL-1; col>=0; col--) {
int pivot = -1;
for (int row = rank; row<ROW; row++) {
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1) continue;
swap(A[pivot], A[rank]);
for (int row = 0; row<ROW; row++) {
if (row != rank && A[row][col]) A[row] ^= A[rank];
}
rank++;
}
return rank;
}
int n;
ll a[100005], ans;
int main(void) {
cin >> n;
BitMatrix M(n, MAX_COL);
rep (i, 0, n) {
cin >> a[i];
M[i] = a[i];
}
for (int d=61; d>=0; d--) {
int num = 0;
for (int i=0; i<n; i++) num += M[i][d];
if (num%2) {
ans += (1LL<<d);
for (int i=0; i<n; i++) M[i][d] = 0;
}
}
int rank = xor_elimination(M);
bitset<MAX_COL> b;
rep(i, 0, rank) b ^= M[i];
rep(i, 0, 62) ans += (1LL<<(i+1))*b[i];
cout << ans << endl;
return 0;
}
| 0
| 25,956,634
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector <int> a(n);
for (auto &i : a) cin >> i;
int ans = 0, A, b;
vector <vector <int> > edge(n);
for (int i = 0; i < m; i++) {
cin >> A >> b;
--A, --b;
edge[A].pb(b);
edge[b].pb(A);
}
for (int i = 0; i < n; i++) {
bool ok = true;
for (auto &j : edge[i]) {
if (a[i] <= a[j]) {
ok = false;
break;
}
}
if (ok) ++ans;
}
cout << ans << '\n';
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define INF 0x3f3f3f3f
#define NIL (-1)
#define M 1046527
using namespace std;
int T[M+1];
void trans(char *s){
for(int i = 0; i < strlen(s); i++){
if(s[i] == 'A') s[i] = '4';
else if(s[i] == 'C') s[i] = '1';
else if(s[i] == 'G') s[i] = '2';
else if(s[i] == 'T') s[i] = '3';
}
}
int stringToInt(char s[]){
int t = 0;
int p = 1;
for(int i = strlen(s)-1; i >= 0; i--){
t += (s[i]-'0')*p;
p *= 5;
}
return t;
}
int h1(int a){
return (int)(a % M);
}
int h2(int a){
return 1+(int)(a % (M-1));
}
int h(int a, int i){
return (h1(a) + i * h2(a))%M;
}
void insert(int c){
int i = 0;
while(true){
int temp = h(c, i);
if(T[temp] == NIL){
T[temp] = c;
return ;
}
else{
i++;
}
}
}
int find(int d){
int i = 0;
while(true){
int temp = h(d, i);
if(T[temp] == NIL){
return -1;
}
else if(T[temp] == d){
return 1;
}
else{
i++;
if(i >= M) return -1;
}
}
}
int main(){
for(int i = 0; i < M; i++) T[i] = NIL;
int n;
scanf("%d", &n);
while(n--){
char a[10], b[14];
scanf("%s %s", a, b);
if(a[0] == 'i'){
trans(b);
int c = stringToInt(b);
insert(c);
}
else{
trans(b);
int d = stringToInt(b);
if(find(d) != -1){
printf("yes\n");
}
else{
printf("no\n");
}
}
}
return 0;
}
| 0
| 69,357,869
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7;
#define INF 1e9+9;
#define ps(x,y) fixed<<setprecision(y)<<x
# define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int k,s,c=0;
cin>>k>>s;
for(int i=0;i<=k;i++){
for(int j=0;j<=k;j++){
if(s-(i+j)>=0 && s-(i+j)<=k)
c++;
}
}
cout<<c<<endl;
return 0;
}
|
#include <bits
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin>>n>>m;
int h[n];
rep(i,n)cin>>h[i];
map<int,bool>mp;
rep(i,n)mp[i]=true;
rep(i,m){
int j,k;
cin>>j>>k;
if(h[j-1]>h[k-1])mp[k-1]=false;
else if(h[j-1]==h[k-1]){
mp[j-1]=false;
mp[k-1]=false;
}
else mp[j-1]=false;
}
int sum=0;
rep(i,n)if(mp[i])sum++;
cout<<sum<<endl;
return 0;
}
| 0
| 85,668,377
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main() {
int W,H,N;
cin >> W >> H >> N;
vector<vector<int>> L(N, vector<int>(3));
rep(i,N) cin >> L[i][0] >> L[i][1] >> L[i][2];
int left=0,right=W,bottom=0,top=H;
rep(i,N) {
if(L[i][2]==1) left = max(left,L[i][0]);
if(L[i][2]==2) right = min(right,L[i][0]);
if(L[i][2]==3) bottom = max(bottom,L[i][1]);
if(L[i][2]==4) top = min(top,L[i][1]);
}
if(left >= right || top <= bottom) cout << 0 << endl;
else cout << (right-left)*(top-bottom) << endl;
}
|
#include <bits/stdc++.h>
#include <math.h>
#include <regex>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
ld n , d;
vector<vector<ld>> x(n,vector<ld>(d));
int main(){
ll n ; cin >> n;
ll ans = 0;
for(int i=1;i<=1000001;i++){
if(n%i==0){
ll m = (n/i) - 1;
if(m>i) ans+=m;
}
}
cout << ans << endl;
}
| 0
| 36,295,457
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n,count=0;
cin>>n;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
if(n/i-1>i) count+=n/i-1;
else break;
}
}
cout<<count<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string l;
cin >> l;
ll dp[2];
dp[0] = 0;
dp[1] = 1;
for(int i = 0; i < l.size(); i++){
if(l[i] == '1'){
dp[0] = (dp[0]*3+dp[1])%1000000007;
dp[1] = (dp[1]*2)%1000000007;
}
else{
dp[0] *= 3;
dp[0] %= 1000000007;
}
}
cout << (dp[0] + dp[1])%1000000007 << endl;
}
| 0
| 32,203,989
|
#include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
#define lson (rt<< 1)
#define rson (rt<< 1 | 1)
#define gmid ((l+r)>> 1 )
using namespace std;
const int p=1e9+7;
int f[2002];
int main()
{
int n;
cin>>n;
f[0]=1;
for(int i=0;i<=n;++i)
for(int j=3;j+i<=n;++j)
f[i+j]=(f[i+j]+f[i])%p;
cout<<f[n]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
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; }
int N, M;
vector<vint> G(100005);
bool flag[100005] = {};
int color[100005];
int dfs(int v, int c = 0) {
int ret = 1;
if (color[v] != -1 && c != color[v]) return (0);
color[v] = c;
if (flag[v]) return (1);
flag[v] = true;
for (auto &u : G[v]) ret &= dfs(u, 1 - c);
return (ret);
}
int main() {
cin >> N >> M;
fill_n(color, 100005, -1);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v; --u, --v;
G[u].push_back(v);
G[v].push_back(u);
}
int colorable = 0;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (!flag[i] && G[i].size() > 0) {
if (dfs(i)) colorable++;
else cnt++;
}
}
int rem = count(flag, flag + N, false);
ll ans = (ll)rem * 2 * N - (ll)rem * rem;
ans += 2 * (ll)colorable * colorable;
ans += 2 * (ll)colorable * cnt + cnt * cnt;
cout << ans << endl;
return (0);
}
| 0
| 9,813,111
|
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main()
{
lol result{0};
lol n; cin >> n;
result = (n-2)*180;
cout << result << endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n+1);
for(int i=0; i<n+1; i++){
cin >> a[i];
}
vector<long long> b(n);
for(int i=0; i<n; i++){
cin >> b[i];
}
long long ans=0;
long long tmp1, tmp2;
for(int i=0; i<n; i++){
tmp1 = min(a[i],b[i]);
b[i] = b[i] - tmp1;
tmp2 = min(a[i+1],b[i]);
a[i+1] = a[i+1] - tmp2;
ans = ans + tmp1 + tmp2;
}
cout << ans << endl;
}
| 0
| 9,044,079
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int ans = 0;
for(int i = 0; i <= x; ++i){
ans = 2*i + 4*(x-i);
if(ans == y){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 50000;
const int MAXM = 20;
const int INF = 50000;
int res;
vector<int> nums(MAXM);
vector<int> dp(MAXN);
int main()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> nums[i];
}
for (int i = 0; i <= n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j + nums[i] <= n; j++) {
dp[j + nums[i]] = min(dp[j + nums[i]], dp[j] + 1);
}
}
cout << dp[n] << endl;
return 0;
}
| 0
| 61,739,803
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int A,B,C;
cin>>A>>B>>C;
cout<<max(B+C-A,0LL)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(int i = 0; i < n; ++i) cout << UIET[i]
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vpp vector<pair< int, int > >
#define pll pair<int , int >
#define ppll pair < pll , pll >
#define debug(n1) cout << n1 << endl
#define len(a) ((int) (a).size())
#define endl "\n"
#define mod 1000000007
const int INF=(1LL<<60)-1;
const int maxN = 1000001;
string extractStringAtKey(string str, int key){
char *s = strtok((char *)str.c_str(), " ");
while(key > 1){
s = strtok(NULL, " ");
key--;
}
return (string)s;
}
bool prime[maxN + 1];
void seive(){
memset(prime, true, sizeof(prime));
for(int i = 2; i * i <= maxN; ++i){
if(prime[i]){
for(int j = i * i; j <= maxN; j += i){
prime[j] = false;
}
}
}
}
int32_t main(){
SPEED;
int n, k;
cin >> n >> k;
int ans = k;
if(n == 1) {
cout << ans;
return 0;
}
ans *= pow(k - 1, n - 1);
cout << ans ;
}
| 0
| 33,857,633
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
vector<vector<int>> bingo(3,vector<int>(3));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++)
cin >> bingo[i][j];
}
int n;
cin >> n;
vector<int> b(n);
for(auto &x:b)cin >> x;
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
for(int k=0;k<3;k++){
if(b[i]==bingo[j][k]){
bingo[j][k]=-1;
break;
}
}
}
}
int ans=0;
for(int i=0;i<3;i++){
if(bingo[i][0]==bingo[i][1] && bingo[i][1]==bingo[i][2])ans++;
if(bingo[0][i]==bingo[1][i] && bingo[1][i]==bingo[2][i])ans++;
}
if(bingo[0][0]==bingo[1][1] && bingo[1][1]==bingo[2][2])ans++;
if(bingo[0][2]==bingo[1][1] && bingo[1][1]==bingo[2][0])ans++;
if(ans)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
long long *a{};
int n, k;
bool need(long long, long long, int, int);
int main()
{
scanf("%d%d", &n, &k);
a = new long long[n];
for (int i = 0; i < n; i++) scanf("%lld", a + i);
std::sort(a, a + n, std::greater<long long>());
int left{-1}, right{n};
while (left + 1 < right)
{
int mid{(left + right) / 2};
if (need(k - a[mid], k, n - 1, mid)) left = mid;
else right = mid;
}
printf("%d\n", n - left - 1);
delete[] a;
return 0;
}
bool need(long long left, long long right, int a_index, int ignore)
{
if (left <= 0 && right > 0) return true;
if (a_index == -1 || right <= 0) return false;
if (a_index == ignore)
return need(left, right, a_index - 1, ignore);
if (right - a[a_index] >= left)
return need(left - a[a_index], right, a_index - 1, ignore);
return need(left, right, a_index - 1, ignore) || need(left - a[a_index], right - a[a_index], a_index - 1, ignore);
}
| 0
| 45,638,785
|
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
class Prints {
private:
class __Prints {
public:
__Prints(const char* sep, const char* term) : sep(sep), term(term) {}
template <class... Args>
void operator()(Args&&... args) const { print(std::forward<Args>(args)...); }
private:
const char *sep, *term;
void print() const { std::cout << term; }
void print_rest() const { std::cout << term; }
template <class T, class... Tail>
void print(T&& head, Tail&&... tail) const { std::cout << head, print_rest(std::forward<Tail>(tail)...); }
template <class T, class... Tail>
void print_rest(T&& head, Tail&&... tail) const { std::cout << sep << head, print_rest(std::forward<Tail>(tail)...); }
};
public:
Prints() {}
__Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
template <class T>
void print_vec(const std::vector<T>& vec, const char* sep = " ", const char* term = "\n") const {
const size_t sz = vec.size();
for (size_t i = 0; i < sz; i++) std::cout << vec[i] << (i == sz - 1 ? term : sep);
}
};
Prints prints;
void solve() {
ll N, M;
cin >> N >> M;
ll ans = (M * 1900 + (N - M) * 100) * (1ll << M);
prints()(ans);
}
int main() {
#ifdef FASTIO
cin.tie(0), cout.tie(0);
ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
ifstream ifs("./in_out/input.txt");
cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
ofstream ofs("./in_out/output.txt");
cout.rdbuf(ofs.rdbuf());
#endif
cout << setprecision(18) << fixed;
solve();
cout << flush;
return 0;
}
|
#include <bits/stdc++.h>
#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 VPLL = vector<PLL>;
using VPLD = vector<PLD>;
const int INF = numeric_limits<int>::max();
const unsigned long long int ULLINF = numeric_limits<unsigned long long int>::max();
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;
}
};
int main(){
LL n, m;
cin >> n >> m;
UnionFind tree(n);
REP(i,m) {
LL num1, num2;
cin >> num1 >> num2;
tree.unite(num1-1, num2-1);
}
VLL v(n, -1);
for (LL i=0; i<n; i++) {
LL r = tree.root(i);
if (v[r] == -1) v[r] = 1;
else v[r] += 1;
}
LL ans = 0;
for (LL i=0; i<n; i++) {
ans = max(ans, v[i]);
}
cout << ans << endl;
return 0;
}
| 0
| 43,960,410
|
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll DIV = 1000000007;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
string N;
cin >> N;
bool ok = false;
for(size_t i=2;i<4; i++)
{
if(N[i]==N[i-1] && N[i-1] == N[i-2]) ok = true;
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count() / 1000.0) << "[ms]" << endl;
#endif
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
int main() {
int N;
cin >> N;
V<int> a(N);
rep(i, N) cin >> a[i];
V<pii> vec(N);
rep(i, N) vec[i] = mp(a[i], i);
sort(ALL(vec));
reverse(ALL(vec));
int la = TEN(9) + 10, pos = N;
ll num = 0;
V<ll> ans(N);
for (int pt = 0; pt < N; ++pt) {
ans[pos] += num * (la - vec[pt].fi);
la = vec[pt].fi;
chmin(pos, vec[pt].se);
num++;
}
ans[pos] += la * num;
for (ll x : ans) {
cout << x << '\n';
}
return 0;
}
| 0
| 61,718,172
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int result,i,j,n,m,c[21],t[50001];
cin >> n >> m;
for(i = 0; i < m; i++){
cin >> c[i];
}
for(j = 0; j <= n; j++){
t[j]=10001;
}
t[0]=0;
for(i = 0; i < m; i++){
for(j = c[i]; j <= n; j++){
t[j]=min(t[j],t[j-c[i]]+1);
}
}
result = t[n];
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
bool query(ll n) {
char c;
cout << "? " << n << endl;
cin >> c;
return c == 'Y';
}
int main() {
int d;
ll n, l, r, m;
for (d = 1, n = 1; d < 11 && query(n); d++, n *= 10) {}
if (d == 11) {
for (d = 1, n = 1; d < 11 && !query(n * 10 - 1); d++, n *= 10) {}
cout << "! " << n << endl;
return 0;
}
l = n / 10;
r = n;
m = (l + r + 1) / 2;
while (r - l > 1) {
if (query(m * 10)) {
r = m;
} else {
l = m;
}
m = (l + r + 1) / 2;
}
cout << "! " << m << endl;
return 0;
}
| 0
| 49,769,999
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long M, std::vector<long long> A, std::vector<long long> B)
{
vector<vector<ll>> baito(M);
for (ll i = 0; i < N; i++) {
if (M - A[i] >= 0) {
baito[M - A[i]].push_back(B[i]);
}
}
priority_queue<ll> que;
ll ans = 0;
for (ll i = M - 1; i >= 0; i--) {
for (auto reward : baito[i]) {
que.push(reward);
}
if (!que.empty()) {
ans += que.top();
que.pop();
}
}
cout << ans << endl;
}
#pragma GCC diagnostic ignored "-Wunused-result"
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long N;
scanf("%lld",&N);
long long M;
scanf("%lld",&M);
std::vector<long long> A(N);
std::vector<long long> B(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
scanf("%lld",&B[i]);
}
solve(N, M, std::move(A), std::move(B));
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int INF = 1e9 + 1;
int main() {
int N;
cin >> N;
vector<double> t(N), v(N);
rep(i, N) cin >> t[i];
rep(i, N) cin >> v[i];
int T = 0;
rep(i, N) T += t[i];
vector<double> maxV(2 * T + 1, (double) INF);
int nowT = 0;
rep(i, N) {
rep(ti, t[i]) {
int t1 = nowT + ti * 2;
int t2 = nowT + ti * 2 + 1;
chmin(maxV[t1], v[i]);
chmin(maxV[t2], v[i]);
}
nowT += t[i] * 2;
chmin(maxV[nowT], v[i]);
}
maxV[0] = maxV[T * 2] = 0.0;
rep(ti, 2 * T) maxV[ti + 1] = min(maxV[ti + 1], maxV[ti] + 0.5);
for (int ti = 2 * T - 1; ti >= 0; ti--) maxV[ti] = min(maxV[ti], maxV[ti + 1] + 0.5);
double ans = 0.0;
rep(i, 2 * T) ans += (maxV[i] + maxV[i + 1]) * 0.5 / 2.0;
printf("%.4f\n", ans);
}
| 0
| 4,274,966
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vector<int>>;
typedef long long LL;
static LL INF = (1LL<<62);
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
LL K, A, B;
cin >> K >> A >> B;
LL ans = 0;
if(A >= B - 1){
ans = K+1;
printf("%lld\n", ans);
return 0;
}
if(K <= A - 1 || K == A){
ans = K+1;
printf("%lld\n", ans);
return 0;
}
K -= (A - 1);
ans = A;
LL k = K / 2;
ans += ((B - A) * k);
LL r = K % 2;
if(r != 0){
ans++;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
#define mod 1000000007
int main() {
int n,a,b;
cin>>n>>a>>b;
int cnta=0,cntb=0,cntc=0;
rep(i,n){
int p;
cin>>p;
if(p<=a){
cnta++;
}
else if (p<=b) {
cntb++;
}
else {
cntc++;
}
}
int ans=min({cnta,cntb,cntc});
cout<<ans<<endl;
}
| 0
| 58,194,685
|
#include <bits/stdc++.h>
using namespace std;
main(){
int N;
vector<int> A(N);
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
int mx=A[0];
int mn=A[0];
for(int i=0;i<N;i++){
if(mx<A[i]) mx=A[i];
if(mn>A[i]) mn=A[i];
}
cout << mx-mn <<endl;
}
|
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i <= (n); ++i)
#define rep2(i, n) for(int i = 2; i < (n); ++i)
#define repr(i, n) for(int i = n; i >= 0; --i)
#define reprm(i, n) for(int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2)
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg)/360.0)*2.0*PI)
#define rad_to_deg(rad) (((rad)/2.0/PI)*360.0)
#define Please return
#define AC 0
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
void scans(string& str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')scanf("%c", &c);
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char& str) {
char c;
scanf("%c", &c);
if (c == -1)return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) {
return PI / 2 - atan(x);
}
int main() {
int a;
scanf("%d", &a);
printf("%d\n", 180 * (a - 2));
Please AC;
}
| 0
| 30,432,196
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#include"atcoder/all"
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using namespace atcoder;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
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; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
struct UnionFind {
int N;
vector<int> siz;
vector<int> par;
vector<int> Rank;
UnionFind(int n) : siz(n, 1), par(n), Rank(n, 0) {
N = n;
for (int i = 0; i < N; i++) par[i] = i;
}
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (Rank[x] < Rank[y]) {
par[x] = y;
siz[x] += siz[y];
siz[y] = siz[x];
}
else {
siz[y] += siz[x];
siz[x] = siz[y];
par[y] = x;
if (Rank[x] == Rank[y]) Rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
};
void solve() {
int N, Q; cin >> N >> Q;
UnionFind uf(N);
REP(_, Q) {
int t, u, v; cin >> t >> u >> v;
if (t == 0)uf.unite(u, v);
else {
if (uf.same(u, v))print(1);
else print(0);
}
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
long long MAX = 1000000000000000000;
int main(){
int N,M;
cin >> N >> M;
vector<string> v(N);
vector<string> w(M);
for(int i =0; i < N; i++){
cin >> v[i];
}
for(int i =0; i < M; i++){
cin >> w[i];
}
bool ans_flg = false;
for(int i = 0; i < N-M+1; i++){
for(int j = 0; j < N-M+1; j++){
bool flg = true;
for(int k = 0; k < M; k++){
for(int l = 0; l < M; l++){
if(v[i+k][j+l] != w[k][l]){
flg = false;
break;
}
}
if(!flg) break;
}
if(flg){
ans_flg = true;
break;
}
if(!flg){
continue;
}
}
if(ans_flg){
break;
}
}
cout << (ans_flg ? "Yes" : "No") << endl;
}
| 0
| 13,688,023
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N, M;
cin >> N >> M;
long long ans;
if(N>M/2) ans = M/2;
else ans = max(N, N+(M-2*N)/4);
cout << ans << endl;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
int main(){
char c;
while((c=getchar())!='.'){
if(c=='.')break;
int cnthi=0;
int cnthika=0;
vector<int>hkf;
bool ans=true;
if(c=='('){cnthi++;hkf.pb(1);}
else if(c=='['){cnthika++;hkf.pb(2);}
else if(c==')')ans=false;
else if(c==']')ans=false;
char c2;
while((c2=getchar())!='\n'){
if(c2=='('){cnthi++;hkf.pb(1);}
else if(c2=='['){cnthika++;hkf.pb(2);}
else if(c2==')'){cnthi--;if(hkf.empty()){ans=false;}
else if(hkf[hkf.size()-1]==1){hkf.pop_back();}
else if(hkf[hkf.size()-1]!=1){ans=false;}}
else if(c2==']'){cnthika--;if(hkf.empty()){ans=false;}
else if(hkf[hkf.size()-1]==2){hkf.pop_back();}
else if(hkf[hkf.size()-1]!=2){ans=false;}
}
if(cnthi<0||cnthika<0)
ans=false;
}
if(cnthi!=0||cnthika!=0)
ans=false;
if(ans)
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
return 0;
}
| 0
| 48,804,873
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define endl '\n'
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
void solve() {
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int tot = (h2 - h1) * 60 + (m2 - m1);
cout << tot - k;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input2.txt", "r", stdin);
freopen("output2.txt", "w", stdout);
#endif
IOS;
int t = 1;
while (t--) {
solve();
}
#ifndef ONLINE_JUDGE
cout << "\nTime Elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " sec\n";
#endif
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
#define pow10(n) int(1e##n + n)
typedef long long LL;
typedef pair<int, int> P;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
template <typename number> number numpow(number a, LL b)
{
if (b == 0)
return 1;
if (b % 2 == 0)
{
number d = numpow(a, b / 2);
return (d * d);
}
return (a * numpow(a, b - 1));
}
void solve()
{
LL n, m, d;
cin >> n >> m >> d;
double avg_pair = (d >= 1 ? 2 * double(n - d) : double(n)) / double(n * n);
std::cout << avg_pair * (m - 1) << endl;
}
int main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
solve();
return 0;
}
| 0
| 59,738,663
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,L; cin >> N >> L;
vector<int> a(N);
for(auto&e:a) cin >> e;
for(int i=1;i<N;++i) {
if(a[i-1]+a[i]>=L) {
cout << "Possible" << endl;
for(int j=1;j<i;++j) cout << j << endl;
for(int j=N-1;j>=i;--j) cout << j << endl;
return 0;
}
}
cout << "Impossible" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define no cout << "no" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define AC cout << "AC" << endl;
#define WA cout << "WA" << endl;
#define out(s) cout << s << endl;
#define ll long long
#define ull unsigned long long
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
unsigned GetDigit(ull num) {
return log10(num);
}
void nextPernutationPrint(const vector<int>& v) {
for_each(v.begin(), v.end(), [](int x) { cout << x << " "; });
cout << endl;
}
int main() {
int N = 3, ans;
string A, S = "";
cin >> A;
for (int bit = 0; bit < (1 << N); bit++) {
S = A[0];
ans = A[0] - '0';
for (int i = 0; i < N; i++) {
if (!(bit & (1 << i))) {
S += '+';
S += A[i + 1];
ans += A[i + 1] - '0';
} else {
S += '-';
S += A[i + 1];
ans -= A[i + 1] - '0';
}
}
if (ans == 7) {
cout << S << "=7" << endl;
return 0;
}
}
}
| 0
| 18,718,627
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
vector<vl> graph;
ll A[101010];
ll n;
ll dfs(ll p,ll r)
{
if(graph[p].size() == 1) return A[p];
vector <ll> X;
ll s = 0;
for(auto t: graph[p])
{
if(t != r)
{
ll x = dfs(t, p);
s += x;
X.push_back(x);
}
}
if(s < A[p] || A[p] * 2 < s)
{
printf("NO");
exit(0);
}
if(*max_element(X.begin(), X.end()) > A[p])
{
printf("NO");
exit(0);
}
return A[p] * 2 - s;
}
int main()
{
ll i, u, v;
scanf("%d",&n);
graph.assign(n+1,vl());
for(i=1;i<=n;i++) scanf("%lld",&A[i]);
for(i=1; i<n; i++)
{
scanf("%lld %lld",&u,&v);
graph[u].push_back(v);
graph[v].push_back(u);
}
if(n == 2)
{
if(A[1] == A[2]) printf("YES");
else printf("NO");
return 0;
}
for(i=1; i<=n; i++)
{
if(graph[i].size() > 1)
{
break;
}
}
int res = dfs(i,0);
if(res==0) printf("YES");
else printf("NO");
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
string S;
cin>>S;
int N=S.size();
vector<int> A(N+1,0),B(N+1,0);
for(int i=0;i<N;i++){
if(S[i]=='<')
A[i+1]=A[i]+1;
else
A[i+1]=0;
}
for(int i=N;i>0;i--){
if(S[i-1]=='>')
B[i-1]=B[i]+1;
else
B[i-1]=0;
}
int ans=0;
for(int i=0;i<=N;i++)
ans+=max(A[i],B[i]);
cout<<ans<<endl;
}
| 0
| 42,345,501
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>;
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI=3.14159265358979323846;
template <typename T>
int getIndexOfLowerBound(vector <T> &v, T x){
return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T>
int getIndexOfUpperBound(vector <T> &v, T x){
return upper_bound(v.begin(),v.end(),x)-v.begin();
}
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; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b; is >> a >> b; p = Point(a, b); return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT<<'{';
os << pair_var.first;
DUMPOUT<<',';
os << " "<< pair_var.second;
DUMPOUT<<'}';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT<<'[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT<<']';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto& vec : df) os<<vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
int n; cin>>n;
vector <int> a(n), b(n);
cin>>a>>b;
int suma = SUM(a) , sumb = SUM(b);
int d = sumb - suma;
if(d < 0) {print("No"); return 0;}
else if(d == 0){
if(a == b) print("Yes");
else print("No");
return 0;
}
int da = d, db = d;
for(int i=0;i<n;i++){
if(a[i] < b[i]){
int use = (b[i]-a[i]+1)/2;
a[i] += use * 2;
da -= use;
if(da < 0){print("No"); return 0;}
}
if(a[i] > b[i]){
int use = a[i] - b[i];
b[i] = a[i];
db -= use;
if(db<0){print("No"); return 0;}
}
}
if(da * 2 == db) print("Yes");
else print("No");
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<pair<string, int> > a;
for(int i = 0; i < n; ++i) {
string r1; int r2;
cin >> r1 >> r2;
a.push_back({r1, r2});
}
string use;
cin >> use;
int ans = 0, fl = 0;
for(int i = 0; i < n; ++i) {
if(fl == 0 && a[i].first != use) continue;
if(fl == 0 && a[i].first == use) {
fl = 1;
continue;
}
ans += a[i].second;
}
cout << ans;
return 0;
}
| 0
| 31,826,159
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N[4];
int main() {
for (int i = 0; i < 4; i++) cin >> N[i];
sort(N, N+4);
if (N[0] == 1 && N[1] == 4 && N[2] == 7 && N[3] == 9) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> next(n), c(n);
for (int i = 0; i < n; ++i) {
cin >> next[i]; next[i]--;
}
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
long long ans = -1e17;
for (int i = 0; i < n; ++i) {
int now = i;
long long cycle_sum = 0;
int cycle_len = 0;
while (true) {
cycle_sum += c[now];
cycle_len++;
now = next[now];
if (now == i) break;
}
long long path_sum = 0;
int path_len = 0;
while (true) {
path_sum += c[now];
path_len++;
if (path_len > k) break;
int laps = (k - path_len) / cycle_len;
long long score = path_sum + max(cycle_sum, 0ll) * laps;
ans = max(ans, score);
now = next[now];
if (now == i) break;
}
}
cout << ans << endl;
}
| 0
| 54,214,954
|
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long long int , int>
#define ll long long
ll int f_shikaku(ll int A,ll int B){
ll int a=max(A,B);
ll int b=min(A,B);
if(a%b==0)return 2*(ll int)(a/b)*b-b;
return f_shikaku(a%b,b)+2*(ll int)(a/b)*b;
}
int main(void){
ll int N,X;
scanf("%lld %lld",&N,&X);
ll int ans;
ans=f_shikaku(X,N-X)+N;
printf("%lld\n",ans);
}
|
#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() {
int n;
string s,t;
cin>>n>>s>>t;
rep(i,n){
cout<<s[i]<<t[i];
}
cout<<endl;
}
| 0
| 72,076,164
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll K, A, B;
cin >> K >> A >> B;
if (A + 1 >= B || A >= K) {
cout << K + 1 << endl;
return 0;
}
ll dis = B - A;
K -= (A - 1);
cout << A + (dis * (K / 2)) + (K % 2) << endl;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
long long int n,m,k;
long long int x,y;
long long int mod = 1000000007;
long long int factorial(long long int n){
long long int res;
if (n == 0) return 1;
res = (n%mod)*factorial(n-1)%mod;
return res;
}
long long int f(long long int n, long long int m){
long long int res;
if(m == 1){
return n;
}
if(m%2){
res = n*f(n*n%mod, m/2)%mod;
}
else{
res = f(n*n%mod, m/2)%mod;
}
return res;
}
int main(){
cin >> x >> y;
if((x+y) % 3 != 0 || 2*x-y < 0 || 2*y - x < 0) {
cout << 0 << endl;
return 0;
}
n = (2*x - y)/3;
m = (2*y - x)/3;
long long int nf, mf, nmf, nr, mr;
nf = factorial(n);
mf = factorial(m);
nmf = factorial(n+m);
nr = f(nf,mod-2);
mr = f(mf,mod-2);
long long int ans;
ans = (nr%mod)*(mr%mod);
ans = (ans%mod)*(nmf%mod)%mod;
cout << ans << endl;
return 0;
}
| 0
| 74,658,357
|
#include<iostream>
using namespace std;
int main() {
int n,oki[1111],ok,ans[11111],an;
ok = 0;
an = 0;
while(cin >> n) {
if (n == 0) {
an = an + 1;
ans[an] = oki[ok];
ok = ok - 1;
}
else {
ok = ok + 1;
oki[ok] = n;
}
}
for (int i = 1; i <= an; i++) {
cout << ans[i] << endl;
}
}
|
#include <stdio.h>
int main(void)
{
int i,n,m;
char array[256];
char a[2];
char b[2];
char input[2];
while(1)
{
for(i=0;i<256;i++)
{
array[i] = i;
}
scanf("%d",&n);
if(n == 0)return 0;
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
array[a[0]] = b[0];
}
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%s",input);
printf("%c",array[input[0]]);
}
printf("\n");
}
return 0;
}
| 0
| 50,475,454
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair< int, int > pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
template < typename T, typename U >
bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() {
cout << fixed << setprecision(11);
}
};
initializer _____;
int N, M, K, T, Q;
signed main() {
cin >> N;
vector< int > A(N);
int S = 0;
rep(i, N) {
cin >> A[i];
S += A[i];
}
K = N * (N + 1) / 2;
if (S % K) {
cout << "NO" << endl;
return 0;
}
K = S / K;
vector< int > B(N);
rep(i, N) B[i] = A[(i + 1) % N] - A[i] - K;
rep(i, N) {
if (B[i] > 0 || B[i] % N) {
cout << "NO" << endl;
return 0;
}
K += B[i] / N;
}
if (K)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
int main(){
long long k;
cin>>k;
cout<<50<<endl;
long long a=k/50;
long long ans[50];
REP(i,50)ans[i]=49+a;
long long b=k%50;
REP(i,b){
REP(j,50){
if(ans[j]+50<=10000000000001000){
ans[j]+=50;
REP(k,50)if(j!=k)ans[k]--;
break;
}
}
}
REP(i,50)cout<<ans[i]<<" ";cout<<endl;
}
| 0
| 32,443,852
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
int main(){
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
cout << 180 * (n - 2);
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T>
void print(const vector<T> &x) {
int n = x.size();
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i,n) {
rep(j,x[i].size()) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<typename T>
void print(const vector<T> &x, int n) {
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x, int n, int m) {
rep(i,n) {
rep(j,m) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void input_init() {
cin.tie(0); ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
ll n; cin>>n;
ll v = 0, s = 0;
ll e = 0;
rep(i,n) {
s += (i+1);
v += s;
}
rep(i,n-1) {
ll a,b; cin>>a>>b;
if (a > b) swap(a,b);
ll tmp = a * (n-b+1);
e += tmp;
}
cout << v-e << '\n';
return 0;
}
| 0
| 34,556,959
|
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N
#define bit(x,y) ((x>>y)&1LL)
#define loop(x) for(int xv=1; xv<=x; xv++)
#define what_is(x) cerr << #x << " is " << x << endl;
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
return os << '(' << a.first << ", " << a.second << ')';
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &a) {
os << '[';
for (unsigned int i = 0; i < a.size(); i++)
os << a[i] << (i < a.size() - 1 ? ", " : "");
os << ']';
return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &a) {
os << '{';
for (typename set<T>::iterator it = a.begin(); it != a.end(); it++) {
typename set<T>::iterator jt = it;
os << *it << (++jt != a.end() ? ", " : "");
}
os << '}';
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, map<T1, T2> &a) {
os << "{\n";
for (typename map<T1, T2>::iterator it = a.begin(); it != a.end(); it++) {
typename map<T1, T2>::iterator jt = it;
os << " " << it->first << ": " << it->second << (++jt != a.end() ? ",\n" : "\n");
}
os << '}';
return os;
}
int n;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
bool equal = true;
int sum = 0; int mn = 2e9;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
if (x != y) equal = false;
sum += x;
if (x > y)
mn = min(mn, y);
}
if (equal) cout << 0 << endl;
else cout << sum - mn << endl;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace std;
bool prime_(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b){
if(a<b){
swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd_(b,a%b);
}
}
long long lcm_(long long x, long long y){
return (x/gcd_(x,y))*y;
}
int main(){
string s;
cin>>s;
string ans = "";
for(int i=0;i<4;i++){
ans += s[i];
}
ans += ' ';
for(int i=4;i<12;i++){
ans += s[i];
}
cout<<ans<<endl;
return 0;
}
| 0
| 8,998,749
|
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, r;
cin >> n >> r;
if(n >= 10){
cout << r << endl;
}else{
cout << r + 100 * (10 - n) << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <fstream>
#include <unordered_map>
#include <time.h>
using namespace std;
#define ms(a, x) memset(a, x, sizeof(a))
#define fore(i, a, n) for (ll ll i = a; i < n; i++)
#define ford(i, a, n) for (ll ll i = n - 1; i >= a; i--)
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%lld", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define siii(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define sll(a, b) scanf("%lld%lld", &a, &b)
#define slll(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define ss(a) scanf("%s", a);
#define debug(a) cout << a << endl
#define pr(a) printf("%d ", a)
#define endl '\n'
#define pi acos(-1.0)
#define tr t[root]
#define IO ios::sync_with_stdio(false), cin.tie(0)
#define ull unsigned long long
#define py puts("Yes")
#define pn puts("No")
#define pY puts("YES")
#define pN puts("NO")
#define re(i, a, b) for (int i = a; i <= b; ++i)
#define de(i, a, b) for (int i = a; i >= b; --i)
#define all(x) (x).begin(), (x).end()
#define ls(x) x.resize(unique(all(x)) - x.begin())
const double eps = 1e-3;
inline int sgn(const double &x) { return x < -eps ? -1 : x > eps; }
typedef long long ll;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 0x3f3f3f3f;
template <class T>
inline void cmin(T &a, T b) { ((a > b) && (a = b)); }
template <class T>
inline void cmax(T &a, T b) { ((a < b) && (a = b)); }
long long PRIMES[223] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409};
const int maxn = 2e5 + 5;
const ll mode = 1e9 + 7;
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll GC(pll x)
{
ll a = x.first;
ll b = x.second;
return b ? gcd(b, a % b) : a;
}
ll Pow(ll a, ll b)
{
ll sum = 1;
a = a % mode;
b = b % (mode - 1);
while (b)
{
if (b & 1)
sum = sum * a % mode;
b >>= 1;
a = a * a % mode;
}
return sum;
}
ll mul(ll a, ll b)
{
ll ans = 0;
a %= mode, b %= mode;
while (b)
{
if (b & 1)
ans = (ans + a) % mode;
a = (a * 2) % mode;
b >>= 1;
}
return ans;
}
int pre[maxn];
void init(int n){
for(int i=1;i<=n;i++) pre[i]=i;
}
int find(int x){
if(pre[x]==x) return x;
return pre[x]=find(pre[x]);
}
void join(int x,int y){
int fx = find(x), fy = find(y);
if(fx!=fy) pre[fy]=fx;
}
map<ll,ll>mp;
int main()
{
IO;
int n,m;
cin>>n>>m;
init(n+10);
re(i,1,m)
{
int x,y;
cin>>x>>y;
join(x,y);
}
re(i,1,n)
{
mp[find(i)]++;
}
ll ans=0;
for(auto it:mp)ans=max(ans,it.second);
cout<<ans<<endl;
}
| 0
| 28,512,713
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
using namespace std;
#define ll long long
#define re register
#define file(a) freopen(a".in",,"r",stdin);freopen(a".out","w",stdout)
#define int ll
inline int gi(){
int f=1,sum=0;char ch=getchar();
while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9'){sum=sum*10+ch-'0';ch=getchar();}
return f*sum;
}
int n,x;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
signed main(){
n=gi();x=gi();
printf("%lld\n",3*(n-gcd(n,x)));
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = (1ll << 61);
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r;
cin >> r;
if (r < 1200) cout << "ABC" << endl;
else if (r < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
return 0;
}
| 0
| 9,075,366
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,k,a,b,s;
cin>>n>>k>>a>>b;
if(k>=n)
{
s=n*a;
}
else
{
s=k*a+(n-k)*b;
}
cout<<s<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
const ll C = 1000000000+7;
int main() {
int N, K;
cin >> N >> K;
vector<ll> num(K, 0);
for(int i=1; i<=N; i++) num[i%K]++;
ll res = 0;
for(int a = 0; a < K; a++) {
int b = (K-a)%K;
int c = (K-a)%K;
if((b+c) % K != 0) continue;
res += num[a] * num[b] * num[c];
}
cout << res << endl;
}
| 0
| 17,481,493
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,k,r,s,p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
int ans = 0;
for (int i = 0; i < n; i++) {
if(i - k >= 0 && t[i] == t[i - k]) {
t[i] = '?';
continue;
}
if(t[i] == 'r') ans += p;
if(t[i] == 's') ans += r;
if(t[i] == 'p') ans += s;
}
cout << ans << '\n';
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
template<typename T>
class RangeUpdateQuery {
public:
explicit RangeUpdateQuery(int n, T def) : N(calcN_(n)) {
mVal.assign(2*N+1, make_pair(-1, def));
}
void update(int l, int r, T value, int ts){
l = max(0, l);
r = min(N, r);
int offset = N;
while(offset > 0){
if(l >= r) break;
if(l&1){ mVal[offset+l-1].first = ts; mVal[offset+l-1].second = value; l++; }
if(r&1){ mVal[offset+r-2].first = ts; mVal[offset+r-2].second = value; }
l /= 2;
r /= 2;
offset /= 2;
}
}
T get(int idx){
int i = N + idx - 1;
auto res = mVal[i];
while(i > 0){
i = (i-1)/2;
res = max(mVal[i], res);
}
return res.second;
}
private:
int calcN_(int n){
int res = 1;
while(res < n) res *= 2;
return res;
}
void updateImpl_(int l, int r, pair<int, T> value, int idx, int rangeL, int rangeR){
if(r <= rangeL || rangeR <= l) return;
if(l <= rangeL && rangeR <= r){
mVal[idx] = value;
} else {
int rangeM = (rangeL+rangeR)/2;
updateImpl_(l, r, value, 2*idx+1, rangeL, rangeM);
updateImpl_(l, r, value, 2*idx+2, rangeM, rangeR);
}
}
const int N;
vector<pair<int,T>> mVal;
};
bool valid(const vector<int>& a, const vector<int>& upper){
const int N = a.size();
RangeUpdateQuery<int> seg(N, 0);
for(int i=1;i<a.size();i++){
if(a[i] <= a[i-1]){
int c = a[i];
while(c >= 0){
int v = seg.get(c);
if(v == upper[c]-1){
seg.update(c, c+1, 0, i);
--c;
} else {
seg.update(c, c+1, v+1, i);
break;
}
}
if(c < 0) return false;
} else {
seg.update(a[i-1]+1, a[i]+1, 0, i);
}
}
return true;
}
long long pow(long long a, long long p){
if(a == 1) return 1;
if(p == 0) return 1;
auto res = pow(a, p/2);
res *= res;
if(p%2 == 1) res *= a;
return min(res, 200000LL);
}
int main(){
int N; cin >> N;
vector<int> a(N);
vector<int> v;
for(auto& t : a){
cin >> t;
v.push_back(t);
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
map<int, int> idx;
for(int i=0;i<v.size();i++) idx[v[i]] = i;
for(auto& t : a) t = idx[t];
int L = 0, R = N;
vector<int> upper(N);
while(R-L > 1){
int mid = (L+R)/2;
upper[0] = pow(mid, v[0]);
for(int i=1;i<N;i++) upper[i] = pow(mid, v[i]-v[i-1]);
if(valid(a, upper)) R = mid;
else L = mid;
}
cout << R << endl;
}
| 0
| 24,649,195
|
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int ans = 0;
int n,m;
void dfs(v2_int g, v_bool seen, int node, int cnt)
{
bool ok = true;
irep(i, n) {
if(!seen[i]) { ok = false; }
}
if(ok && cnt == n) { ans++; return; }
for(int i = 0; i < g[node].size(); i++) {
int to = g[node][i];
if(seen[to]) { continue; }
seen[to] = true;
dfs(g, seen, to, cnt+1);
seen[to] = false;
}
return ;
}
int main(void)
{
cin >> n >> m;
v2_int g(n, v_int(n));
irep(i, m) {
int a,b;
cin >> a >> b;
g[a-1].push_back(b-1);
g[b-1].push_back(a-1);
}
v_bool seen(n,false);
seen[0] = true;
dfs(g, seen, 0, 1);
cout << ans << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
ll N,M; cin>>N>>M;
vector<vector<ll>> s(M,vector<ll>(0));
rep(i,M)
{
ll k; cin>>k;
rep(j,k)
{
ll ss; cin>>ss; ss--;
s.at(i).push_back(ss);
}
}
vector<ll> p(M);
rep(i,M)
{
cin>>p.at(i);
}
ll ans=0;
rep(i,1<<N)
{
bitset<10> i2(i);
bool judge=true;
rep(j,M)
{
ll sum=0;
for(auto ss:s.at(j))
{
if(i2.test(ss)) sum++;
}
sum%=2;
if(p.at(j)!=sum) judge=false;
}
if(judge) ans++;
}
cout<<ans<<endl;
return 0;
}
| 0
| 26,678,998
|
#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 ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
void solve(){
int n;
cin>>n;
int a;
int mn = inf;
int ans = 0;
for(int i=0;i<n;i++){
cin>>a;
if(a < mn) mn = a, ans++;
}
cout<<ans;
}
signed main(){
io;
int tests;
tests = 1;
while(tests--){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S,ans="";
cin >> S;
bool f = false;
if (S == "zyxwvutsrqponmlkjihgfedcba") ans = "-1";
else{
if (S.length()<26){
for(int i='a';i<'z'+1;i++){
for(auto &v:S){
if(i==v){
break;
}
if (v==S[S.length()-1]){
f = true;
ans = S + (char)i;
}
}
if (f) break;
}
}else{
int pos = -1;
int min_str = 1 + 'z';
for(int i=24;i>=0;i--){
if(S[i] < S[i+1]){
for(int j = i + 1;j<26;j++){
if(S[i] < S[j])min_str = min(min_str,(int)S[j]);
}
pos = i;
S[i] = (char)min_str;
break;
}
}
for(int i=0;i<pos+1;i++){
ans += S[i];
}
}
}
cout << ans << endl;
}
| 0
| 5,449,897
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
int MAX;
for (int i=1; i<=N; i*=2){
if(i*2>N){
MAX=i;
break;
}
}
cout<<MAX<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
string pluszero(int N){
string T=to_string(N);
if(T.size()>=6){
return T;
}
else{
int k=T.size();
rep(i,6-k){
T="0"+T;
}
return T;
}
}
int main(){
int N,M;
cin>>N>>M;
vector<ll>mark(N,0);
vector<string>Ans(M);
vector<tuple<ll,ll,ll>>city(M);
rep(i,M){
ll P,Y;
cin>>P>>Y;
P--;
get<0>(city[i])=Y;
get<1>(city[i])=i;
get<2>(city[i])=P;
}
sort(city.begin(),city.end());
rep(i,M){
mark[get<2>(city[i])]++;
Ans[get<1>(city[i])]=pluszero(get<2>(city[i])+1)+pluszero(mark[get<2>(city[i])]);
}
rep(i,M){
cout<<Ans[i]<<endl;
}
}
| 0
| 18,561,761
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
cout<<(n*(n+1))/2;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
#define INF (1e9)
int main() {
int H,N;cin>>H>>N;
vi A(N),B(N);
for (int i = 0; i < N; i++){
cin>>A[i]>>B[i];
}
vi dp(H+1,INF);
dp[H]=0;
for (int h = H; h >=0 ; h--){
for (int i = 0; i < N; i++){
if(h-A[i]<0)dp[0]=min(dp[0],dp[h]+B[i]);
else dp[h-A[i]]=min(dp[h-A[i]],dp[h]+B[i]);
}
}
cout<<dp[0]<<endl;
}
| 0
| 90,784,948
|
#include<stdio.h>
#include<string.h>
int main(){
int i, j;
int n;
int a, b;
char str[1000];
char op[10];
char p[1000];
scanf("%s", str);
scanf("%d", &n);
for(i=0; i<n; i++){
scanf("%s %d %d", op, &a, &b);
if(strcmp(op, "print")==0){
for(j=a; j<=b; j++){
printf("%c", str[j]);
}
printf("\n");
}
else if(strcmp(op, "reverse")==0){
char tmp;
int l=b;
for(j=a;j<=(b+a)/2;j++){
tmp=str[j];
str[j]=str[l];
str[l]=tmp;
l--;
}
}
else if(strcmp(op, "replace")==0){
int k=0;
scanf("%s", p);
for(j=a; j<=b; j++)str[j]=p[k++];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
ll sum = 0;
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
sum += arr[i] * arr[j];
}
}
cout << sum << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}
| 0
| 81,246,067
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
string S;
signed main()
{
cin >> N;
cin >> S;
int ans = 0;
rep(i,1000)
{
int mem = 1;
rep(j,N)
{
if('0' + ((i / mem) % 10) == S[j])
{
mem *= 10;
if(mem == 1000)
{
ans++;
break;
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
long long x,n,v,sum=0;
cin >> x >> n;
while(n-->0)
{
cin >> v;
sum= sum+v;
}
if(x-sum>=0)
{
cout << x-sum << endl;
}
else
{
cout << "-1" << endl;
}
return 0;
}
| 0
| 95,675,475
|
#include <bits/stdc++.h>
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(long long A, long long B, long long C)
{
cout << ((A + B >= C) ? YES : NO) << endl;
}
int main()
{
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
solve(A, B, C);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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; }
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using M = map<int, int>;
using Ml = map<ll, ll>;
ll const INF = 1ll<<61;
double pi = 3.141592653589793238;
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
repI(i, a, b+1) {
ll div = 0;
ll tmp = i;
while(tmp!= 0) {
div *= 10;
div += tmp % 10;
tmp /= 10;
}
if (div == i) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 79,983,220
|
#include <bits/stdc++.h>
#define N 100000
using namespace std;
int child[N][20];
int parent[N];
int depth[N];
int k[N];
int root;
char str[3][20] = {"root","internal node","leaf"};
void pr(int id){
int type;
if(parent[id] == -1) type = 0;
else if(k[id] > 0) type = 1;
else if(k[id] == 0) type = 2;
printf("node %d: parent = %d, depth = %d, %s, [", id, parent[id], depth[id], str[type]);
for(int i=0;i<k[id];i++){
if(i)printf(", ");
printf("%d",child[id][i]);
}
printf("]\n");
}
void dfs(int id,int dep){
depth[id] = dep;
for(int i=0;i<k[id];i++)dfs(child[id][i],dep+1);
}
int main(){
int n;
cin>>n;
memset(parent,-1,sizeof(parent));
for(int i=0,id;i<n;i++){
cin>>id;
cin>>k[id];
for(int j=0;j<k[id];j++){
cin>>child[id][j];
parent[ child[id][j] ] = id;
}
}
for(int i=0;i<n;i++) if(parent[i] == -1) root = i;
dfs(root,0);
for(int i=0;i<n;i++)pr(i);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int dfs(int v,int N,vector<bool>seen,const Graph G){
bool all_visited=true;
rep(i,N){
if(seen[i]==false){
all_visited=false;
}
}
if(all_visited){
return 1;
}
int ret=0;
rep(i,N){
if(G[v][i]==0){
continue;
}
if(seen[i]){
continue;
}
seen[i]=true;
ret+=dfs(i,N,seen,G);
seen[i]=false;
}
return ret;
}
int main(){
int N,M;cin>>N>>M;
Graph G(N,vector<int>(N,0));
rep(i,M){
int a,b;cin>>a>>b;
a--;b--;
G[a][b]=1;
G[b][a]=1;
}
vector<bool>seen(N,false);
seen[0]=true;
cout<<dfs(0,N,seen,G)<<endl;
}
| 0
| 96,619,458
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
ll n, m, r;
ll dist[222][222];
ll town[10];
ll ans = LINF;
bool used[222] = {};
void dfs(ll pos, ll path_dist, ll depth){
if(depth == r){
ans = min(ans, path_dist);
}
rep(i, r)if(!used[town[i]]){
used[town[i]] = true;
dfs(town[i], path_dist+dist[pos][town[i]], depth+1);
used[town[i]] = false;
}
}
int main(){
cin >> n >> m >> r;
rep(i, r){
cin >> town[i];
town[i]--;
}
rep(i, n)rep(j, n)dist[i][j] = LINF;
rep(i, m){
ll a, b, c;
cin >> a >> b >> c;
a--, b--;
dist[a][b] = dist[b][a] = min(dist[a][b], c);
}
rep(k, n){
rep(i, n){
rep(j, n){
dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
}
}
}
rep(i, r){
used[town[i]] = true;
dfs(town[i], 0, 1);
used[town[i]] = false;
}
cout << ans << endl;
}
|
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f3f3f3f3f
#define pi 3.1415926535898
#define N 200010
using namespace std;
struct A
{
int x;
int y;
}a[N];
char s[110][110];
int dp[110][110];
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
scanf("%s",s[i]+1);
}
memset(dp,inf,sizeof(dp));
dp[1][1]=(s[1][1]=='#');
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(s[i][j+1]=='.')
{
dp[i][j+1]=min(dp[i][j+1],dp[i][j]);
}
else
{
dp[i][j+1]=min(dp[i][j+1],dp[i][j]+(s[i][j]=='.'));
}
if(s[i+1][j]=='.')
{
dp[i+1][j]=min(dp[i+1][j],dp[i][j]);
}
else
{
dp[i+1][j]=min(dp[i+1][j],dp[i][j]+(s[i][j]=='.'));
}
}
}
cout<<dp[n][m]<<endl;
return 0;
}
| 0
| 56,581,749
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,m; cin >> n >> m;
vector<string> a(n); rep(i,n) cin >> a[i];
vector<string> b(m); rep(i,m) cin >> b[i];
bool exist = false;
rep(ay,n){
rep(ax,n){
if(ax+m-1>=n || ay+m-1>=n) continue;
bool match = true;
rep(y,m){
rep(x,m){
if(a[ay+y][ax+x] != b[y][x]) match = false;
}
}
if(match) exist = true;
}
}
if(exist) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
static const int INF = 1<<30;
static const int SIZE = 100000+10;
int main(){
int n;
cin>>n;
vector<int> dp(SIZE,INF);
dp[0] = 0;
for(int i=1; i<=n; i++){
for(int six=1; six<=i; six *= 6){
if(i-six < 0) continue;
dp[i] = min(dp[i],dp[i-six]+1);
}
for(int nine=1; nine<=i; nine *= 9){
if(i-nine < 0) continue;
dp[i] = min(dp[i],dp[i-nine]+1);
}
}
cout<<dp[n]<<endl;
return 0;
}
| 0
| 47,212,622
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
const int N=100010;
int main()
{
struct Point {LL x, y;};
LL N;
cin >> N;
vector<Point> P(N);
for(auto& p: P) cin >> p.x >> p.y;
auto parity = abs(P[0].x+P[0].y)&1;
for(const auto& p: P) if((abs(p.x+p.y)&1) != parity) {
cout << -1 << endl;
exit(0);
}
auto m = 31ll;
vector<LL> d;
for(auto i=m-1; 0<=i; --i) d.emplace_back(1ll<<i);
if(!parity) d.emplace_back(1ll), ++m;
cout << m << endl;
for(auto i: d) cout << (i==d.front() ? "" : " ") << i;
cout << endl;
for(const auto& p: P) {
auto x = p.x;
auto y = p.y;
for(auto i: d) {
if(abs(x)<abs(y)) {
if(y<0) {y += i; cout << "D";}
else {y -= i; cout << "U";}
} else {
if(x<0) {x += i; cout << "L";}
else {x -= i; cout << "R";}
}
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<pair<string,P> >vec;
void solve(long long N, vector<long long> A){
ll k = 0;
rep(i, N) {
k += A[i];
}
bool flg = true;
if (k * 2 % (N * (N + 1)) != 0) flg = false;
k = k * 2 / (N * (N + 1));
ll cnt = 0;
rep(i, N) {
ll e = -1 * (A[(i+1)%N] - A[i%N] - k);
if (e < 0 || e % N != 0) {
flg = false;
break;
}
cnt += e / N;
}
if (cnt == k && flg) cout << "YES" << endl; else cout << "NO" << endl;
}
int main(){
long long N;
scanf("%lld",&N);
vector<long long> A(N-1+1);
for(int i = 0 ; i <= N-1 ; i++){
scanf("%lld",&A[i]);
}
solve(N, A);
return 0;
}
| 0
| 20,848,878
|
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string s; cin >> s;
map<char,int> mp;
for(int i = 0; i < 4; i++){
mp[s[i]]++;
}
for(auto& x:mp){
if(x.second != 2){
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n, x;
for(int i=0;;i++){
cin >> n >> x;
int c=0;
if(n==0&&x==0){
break;
}else{
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
for(int l=1;l<=n;l++){
if(j+k+l==x){
c++;
if(j==k||k==l||l==j){
c--;
}
}
}
}
}
}
c=c/6;
cout << c << endl;
}
}
| 0
| 61,555,745
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll mod=1e9+7;
int main(){
ll n,m;
cin >> n >> m;
vector<pll> d(n);
rep(i,m){
ll a,b;
cin >> a >> b;
a--; b--;
if(a==0) d[b].fi=1;
if(b==n-1) d[a].se=1;
}
bool ok=false;
rep(i,n){
if(d[i].fi==1 && d[i].se==1) ok=true;
}
if(ok) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
return 0;
}
|
#include <cstdio>
#include<iostream>
#include <algorithm>
#include <cstring>
using namespace std;
char s[200005];
int main()
{
scanf("%s",s);
int len=strlen(s);
int num=0;
for(int i=0;i<len;i++)
{
num+=s[i]-'0';
}
if(num%9==0)
puts("Yes");
else
{
puts("No");
}
return 0;
}
| 0
| 24,815,247
|
#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<string> w(n);
rep(i, n) cin >> w[i];
bool ok = true;
rep(i, n) rep(j, n) {
if (i == j) continue;
if (w[i] == w[j]) ok = false;
}
rep(i, n-1) if (w[i][w[i].size()-1] != w[i+1][0]) ok = false;
if (ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
void solve() {
int n, w, h, xi, yi, ai;
cin >> w >> h >> n;
int ans;
int xl_max, xr_min, yu_min, yl_max;
xl_max = yl_max = 0;
xr_min = yu_min = max(w,h);
for (int i = 0; i < n ; ++i) {
cin >> xi >> yi >> ai;
switch (ai) {
case 1:
if (xi > xl_max)
xl_max = xi;
break;
case 2:
if (xi < xr_min)
xr_min = xi;
break;
case 3:
if (yi > yl_max)
yl_max = yi;
break;
case 4:
if (yi < yu_min)
yu_min = yi;
break;
}
}
ans = ((xr_min - xl_max> 0) && (yu_min - yl_max > 0)) ? (xr_min - xl_max) * (yu_min - yl_max) : 0;
cout << ans;
}
int main() {
solve();
return 0;
}
| 0
| 13,293,415
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
int start,end,ans;
start = max(a,c);
end = min(b,d);
ans = end - start;
if(ans > 0)
cout << ans;
else
cout << 0;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int count = 0, count_max = 0;
int tmp;
int i;
int N, N_out = 1;
cin >> N;
for (i = 1; i <= N; i++)
{
tmp = i;
while (tmp%2 == 0 && tmp != 0)
{
count++;
tmp /= 2;
}
if (count >= count_max)
{
count_max = count;
N_out = i;
}
count = 0;
}
cout << N_out << endl;
}
| 0
| 61,887,990
|
#include<bits/stdc++.h>
using namespace std;
int p[100003];
int main(){
int n,m,i,j,c,t,s=0;
scanf("%d%d%d",&n,&m,&t);
for(i=1;i<=n;++i){
scanf("%d %d",&p[i],&c);
if(c==1)p[i]+=t;else p[i]-=t;
s+=p[i]/m,(s-=((p[i]%=m)<0))%=n,(p[i]+=m)%=m;
}
sort(p+1,p+n+1),(s+=n)%=n;
for(i=s+1;i<=n;++i)printf("%d ",p[i]);
for(i=1;i<=s;++i)printf("%d ",p[i]);
return 0;
}
|
#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 R;
cin >>R;
if(R<1200){
cout<<"ABC"<<endl;
}else if(R<2800){
cout<<"ARC"<<endl;
}else{
cout<<"AGC"<<endl;
}
return 0;
}
| 0
| 26,025,180
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) cout << "Possible" << endl;
else cout << "Impossible" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
#define N 1000000007
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 2 * 1e18;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
vll adj[MAX5];
ll T = 1;
ll n, x, y, q, m, k;
string s, t, d;
ll sum = 0;
ll cou = 0;
void MAIN() {
cin >> n >> x >> y;
vll a(n);
for (ll i = 0; i < n; i++) cin >> a[i];
if (n == 1) {
cout << abs(y - a[0]);
}
else {
cout << max(abs(y - a[n - 1]), abs(a[n - 1] - a[n - 2]));
}
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
}
| 0
| 68,159,022
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n, 0);
for(ll i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end(), greater<ll>());
vector<ll> leng(n, 0);
ll tmp = 0;
for(int j = 0; j < 2; j++){
for(ll i = tmp; i < n - 1; i++){
if(a[i] == a[i + 1]){
leng[j] = a[i];
tmp = i + 2;
break;
}
}
}
cout << leng[0] * leng[1] << endl;
}
|
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+7;
const ll inf = 1e18;
ll popcount(ll num){
num = num - ((num >> 1) & 0x55555555);
num = (num & 0x33333333) + ((num >> 2) & 0x33333333);
return ((num + (num >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
vector<pair<ll,ll>> factor_arr;
void myfactor(ll num){
ll count = 0;
while (!(num % 2)) {
num >>= 1; count++;
}
if (count) factor_arr.push_back({2,count});
for (auto i = 3; i <= sqrt(num); i += 2) {
count = 0;
while (num % i == 0) {
count++;
num /= i;
}
if (count) factor_arr.push_back({i,count});
}
if (num > 2) factor_arr.push_back({num,1});
}
void virus(){
ll len;
cin>>len;
string seq,ans="";
cin>>seq;
ans += seq[0];
for(auto i=1; i<len; i++){
if(ans.back() != seq[i]) ans += seq[i];
}
cout<<ans.size();
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t=1;
while(t--){
auto start = high_resolution_clock::now();
virus();
auto stop = high_resolution_clock::now();
auto duration = duration_cast<seconds>(stop - start);
}
return 0;
}
| 0
| 87,294,752
|
#include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
deque<pair<int, int>> que;
typedef vector<vector<int> > Matrix;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
map<ll, ll> v1, v2;
REP(i, n){
if(i%2==0){
ll v;
cin >> v;
v1[v]++;
}
else {
ll v;
cin >> v;
v2[v]++;
}
}
vector<pair<ll, ll>> v1_, v2_;
for(auto itr = v2.begin(); itr != v2.end(); ++itr) {
v2_.push_back({itr->second, itr->first});
}
for(auto itr = v1.begin(); itr != v1.end(); ++itr) {
v1_.push_back({itr->second, itr->first});
}
sort(v1_.begin(), v1_.end(), greater<pair<ll, ll>>());
sort(v2_.begin(), v2_.end(), greater<pair<ll, ll>>());
ll ans;
if(v1_[0].second == v2_[0].second){
if(v1_.size()==1 && v2_.size()==1){
ans = n/2;
}else{
ll ans1 = (n/2 - v1_[0].first) + (n/2 - v2_[1].first);
ll ans2 = (n/2 - v2_[0].first) + (n/2 - v1_[1].first);
ans = min(ans1,ans2);
}
}else{
ans = (n/2 - v1_[0].first) + (n/2 - v2_[0].first);
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
int l = 0, r = n;
string left, right;
cout << 0 << endl;
fflush(stdout);
cin >> left;
right = left;
while(true){
string center;
int c = (l + r) / 2;
cout << c << endl;
fflush(stdout);
cin >> center;
if(center == "Vacant") return 0;
if(center == right){
if((r - c) % 2){
l = c;
left = center;
}
else{
r = c;
right = center;
}
}
else{
if((r - c) % 2){
r = c;
right = center;
}
else{
l = c;
left = center;
}
}
if(r - l <= 1) return 0;
}
}
| 0
| 85,234
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
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; }
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, 1000) {
vector<int> num(3);
int tmp = i;
for (int j = 2; j >= 0; j--) {
num[j] = tmp%10;
tmp /= 10;
}
int idx = 0;
rep(j, n) {
if (num[idx] == s[j]-'0')
idx++;
if (idx == 3) {
ans++;
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<climits>
#include<map>
#include<string>
#include<functional>
#include<iomanip>
#include<deque>
#include<random>
using namespace std;
typedef long long ll;
typedef double lldo;
#define mp make_pair
#define pub push_back
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
ll gcd(ll a, ll b) { if (a % b == 0) { return b; } else return gcd(b, a % b); }
ll lcm(ll a, ll b) { if (a == 0) { return b; }return a / gcd(a, b) * b; }
template<class T>ll LBI(vector<T>& ar, T in) { return lower_bound(ar.begin(), ar.end(), in) - ar.begin(); }
template<class T>ll UBI(vector<T>& ar, T in) { return upper_bound(ar.begin(), ar.end(), in) - ar.begin(); }
ll N, num[2] = {}, L = 0, ans = 1;
string S;
bool isLeft[200000] = {};
ll fact(ll num) {
if (num == 1) {
return 1;
}
else {
return (num * fact(num - 1)) % 1000000007;
}
}
int main() {
cin >> N;
cin >> S;
rep(i, sz(S)) {
if (i % 2 == 0) {
if (S[i] == 'W') {
isLeft[i] = false;
}
else {
isLeft[i] = true;
}
}
else {
if (S[i] == 'W') {
isLeft[i] = true;
}
else {
isLeft[i] = false;
}
}
num[isLeft[i]]++;
}
if (num[0] != num[1] || S[0] == 'W' || S[sz(S) - 1] == 'W') {
cout << 0 << endl;
return 0;
}
rep(i, sz(S)) {
if (isLeft[i]) {
L++;
}
else {
ans *= L;
ans %= 1000000007;
L--;
}
}
cout << (ans* fact(N)) % 1000000007 << endl;
return 0;
}
| 0
| 44,434,496
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t max_rest = INT32_MIN;
int32_t time = 0;
for (int32_t i = 0; i < 5; ++i) {
int32_t a;
cin >> a;
int32_t rest = 10 - a % 10;
if (rest == 10) {
rest = 0;
}
max_rest = max(rest, max_rest);
const int32_t rounded = (a % 10 == 0) ? a : ((a / 10) + 1) * 10;
time += rounded;
}
time -= max_rest;
cout << time << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const ll LINF = 1e15;
const int MOD = 1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
if (K == N) {
puts("0");
return 0;
}
vector<vector<ll>> dp(N + 1, vector<ll>(N + 1, LINF));
dp[0][0] = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
ll res = LINF;
int a = H[j - 1];
rep(k, j) {
int b = (k > 0)? H[k - 1] : 0;
int x = max(0, a - b);
res = min(res, dp[i - 1][k] + x);
}
dp[i][j] = res;
}
}
ll ans = LINF;
for (int i = 1; i <= N; ++i) {
ans = min(ans, dp[N - K][i]);
}
cout << ans << endl;
}
| 0
| 78,283,896
|
#include <bits/stdc++.h>
#define SIZE 10
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int S,W;
int i,j;
int tmp;
int answer=0;
int counter=0;
vector<int> given;
cin >> S >> W;
if(S>W)
cout << "safe" << endl;
else
cout << "unsafe" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 105;
const int mod = 1e9+7;
int n;
int m;
int dist[N][N];
vector < pair < pair < int , int > , int > > ed;
int main() {
memset(dist , '?' , sizeof dist);
scanf("%d%d" , &n , &m);
for(int i = 1; i <= n; i++)
dist[i][i] = 0;
for(int i = 1; i <= m; i++){
int a, b , c;
scanf("%d%d%d" , &a , &b , &c);
ed.push_back({{a , b} , c});
dist[a][b] = c;
dist[b][a] = c;
}
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
dist[i][j] = min(dist[i][j] , dist[i][k] + dist[k][j]);
}
}
}
int cnt = 0;
for(auto e : ed){
int a = e.first.first;
int b = e.first.second;
int c = e.second;
bool yes = 1;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(dist[i][j] == dist[i][a] + c + dist[b][j]){
yes = 0;
}
}
}
if(!yes){
cnt++;
}
}
printf("%d\n" , m - cnt);
return 0;
}
| 0
| 28,100,524
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define fori(i, m, n) for(int i = m; i < (int)n; i++)
#define forl(i, m, n) for(ll i = m; i < (ll)n; i++)
#define all(v) v.begin(), v.end()
ll gcd(ll a,ll b) {
return b? gcd(b,a%b): a;
}
ll lcm(ll a,ll b) {
return a*b/gcd(a,b);
}
bool isLowerCase(char c){
return (c>='a'&&c<='z');
}
const string yesno(bool ans){
return (ans?"Yes":"No");
}
int main() {
int x,a,b;cin>>x>>a>>b;
int c=b-a;
string ans;
if(c<=0){
ans="delicious";
}else if(c<=x){
ans="safe";
}else{
ans="dangerous";
}
cout<<ans<<endl;
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++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
int main() {
ll s;
cin>>s;
vector<bool> judge(1000000,false);
ll a=s;
ll ans;
judge[s]=true;
for(int i=2;i<10000000;i++){
if(a%2==0){
a/=2;
if(judge[a]){
ans=i;
break;
}
else{
judge[a]=true;
}
}
else{
a=3*a+1;
if(judge[a]){
ans=i;
break;
}
else{
judge[a]=true;
}
}
}
cout<<ans<<endl;
}
| 0
| 48,221,411
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int X,Y,Z,K; cin >> X >> Y >> Z >> K;
vector<long long> A(X),B(Y),C(Z);
for(int i=0; i<X; i++) cin >> A[i];
for(int i=0; i<Y; i++) cin >> B[i];
for(int i=0; i<Z; i++) cin >> C[i];
vector<long long> D(X*Y);
for(int i=0; i<X; i++){
for(int j=0; j<Y; j++){
D[i*Y+j]=A[i]+B[j];
}
}
sort(D.begin(),D.end(),greater<long long>());
D.resize(min(X*Y,K));
vector<long long> E(D.size()*Z);
for(int i=0; i<D.size(); i++){
for(int j=0; j<Z; j++){
E[i*Z+j]=D[i]+C[j];
}
}
sort(E.begin(),E.end(),greater<long long>());
E.resize(K);
for(auto s:E) cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define CL(x) ((x) * (x))
#define CR(x) (((x) * (x)) + 1)
typedef long long cc;
typedef pair <int, int> pii;
string s;
int res;
int dp[70000007];
int n;
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> s;
n = s.size();
for (int i = 1; i < (1 << 26); i++)
dp[i] = n;
for (int i = 0; i < n; i++) {
res ^= (1 << (s[i] - 'a'));
for (int j = 0; j < 26; j++)
dp[res] = min(dp[res], dp[res^(1<<j)] + 1);
}
if (dp[res])
cout << dp[res];
else
cout << 1;
return 0;
}
| 0
| 83,274,696
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5, mod = 1e9 + 7;
int n, m;
vector<int> v[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++){
int t, c;
cin >> t >> c;
v[t].push_back(c);
}
priority_queue<int> pq;
int ans = 0;
for(int i = 1; i <= m; i++){
while(v[i].size()){
pq.push(v[i].back());
v[i].pop_back();
}
if(pq.size()){
ans += pq.top();
pq.pop();
}
}
cout << ans;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll power(ll base, ll exponent){ if(exponent % 2){ return power(base, exponent - 1) * base % mod; }else if(exponent){ ll root_ans = power(base, exponent / 2); return root_ans * root_ans % mod; }else{ return 1; }}
ll inverse(ll x){ return power(x, mod - 2);}
ll gcd(ll a, ll b) {if(a < b) gcd(b, a);ll r;while(r=a%b) {a=b;b=r;}return b;}
template<typename T> ll sum(T begin, T end) {return accumulate(begin, end, 0ll);}
struct combination{ vector<ll> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } ll C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) { return -par[root(x)]; }
};
int bsearch(const vector<ll>& a, ll x){
int lft = 0;
int rgt = a.size();
while (rgt - lft > 1) {
int mid = (lft + rgt) / 2;
if(a[mid] < x) {
lft = mid;
}
else {
rgt = mid;
}
}
return lft;
}
signed main() {
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<map<int, ll>> a(n);
REP(i, n) a[i][i] = 0;
UnionFind tree(n);
REP(i, m) {
ll l, r, d;
cin >> l >> r >> d;
l--;r--;
if(tree.same(l, r)) {
int root = tree.root(l);
if(a[root][r] - a[root][l] != d) {
cout << "No" << endl;
return 0;
}
continue;
}
if(tree.size(l) < tree.size(r)) {
swap(l, r);
d = -d;
}
int root_l = tree.root(l);
ll base = a[tree.root(l)][l] - a[tree.root(r)][r] + d;
for(const auto value: a[tree.root(r)]) {
a[tree.root(l)][value.first] = value.second + base;
}
tree.unite(l, r);
if(root_l != tree.root(l)) {
a[tree.root(l)] = a[root_l];
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 51,158,170
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <map>
const int MOD = 1e9+7;
typedef long long ll;
using namespace std;
ll llmax(ll x, ll y){
if (x > y) return x;
return y;
}
int main(){
int x, y;
cin >> x >> y;
cout << x + y/2 << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define vec vector
int main(void)
{
while(1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0) break;
vec<int> x(11, 0);
rep(i, n) {
int p, q;
cin >> p >> q;
x[q] += p;
}
int ok = 0;
int ans = 0;
for (int i = 10; i >= 0; i--) {
if (ok) {
ans += x[i] * i;
continue;
}
m -= x[i];
if (m < 0) {
ans += - m * i;
ok = 1;
}
}
cout << ans << endl;
}
return 0;
}
| 0
| 78,726,780
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int N, M;
cin >> N >> M;
if(N%2){
REP(i, M){
cout << i+1 << " " << N-i << "\n";
}
}else{
REP(i, M){
if(i < M/2){
cout << i+1 << " " << N/2-i-1 << "\n";
}else{
cout << N/2+i-M/2 << " " << N-(i-M/2)-1 << "\n";
}
}
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main(){
int n,i,j,k,l,m;
cin >> n;
int A[4][3][10];
for(i=0;i<4;i++){
for(j=0;j<3;j++){
for(k=0;k<10;k++){
A[i][j][k]=0;
}
}
}
for(i=0;i<n;i++){
cin >> j>>k>>l>>m;
A[j-1][k-1][l-1] += m;
}
for(i=0;i<4;i++){
if(i){
for(j=0;j<20;j++) cout << "#";
cout << endl;
}
for(j=0;j<3;j++){
for(k=0;k<10;k++){
cout << " " << A[i][j][k];
}
cout << endl;
}
}
return 0;
}
| 0
| 31,316,496
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[101][101];
memset(a,0,sizeof(a));
cin>>n;
int u,k;
for(int i = 0;i < n;i++){
cin>>u>>k;
u--;
for(int j=0;j<k;j++){
int x;
cin>>x;
x--;
a[u][x]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j)cout<<" ";
cout<<a[i][j];
}
cout<<endl;
}
}
|
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
typedef pair<int , int> ii;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int N;
string S;
ll fac[maxn];
int main(){
cin >> N;
cin >> S;
fac[0] = 1;
for(int i = 1; i < maxn; ++i)fac[i] = fac[i - 1] * i % mod;
ll ret = 1;
ll cnt = 0;
for(int i = 0; i < 2 * N; ++i){
char cc;
if(cnt & 1){
if(S[i] == 'W'){
cc = 'L';
}
else{
cc = 'R';
}
}
else{
if(S[i] == 'W'){
cc = 'R';
}
else{
cc = 'L';
}
}
if(cc == 'R'){
ret = (ret * cnt) % mod;
--cnt;
}
else ++cnt;
if(cnt < 0){
cout << 0 << endl;
return 0;
}
}
if(cnt)cout << 0 << endl;
else cout << (ret * fac[N] % mod + mod) % mod << endl;
return 0;
}
| 0
| 43,488,533
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> a(n);
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma = max(ma, a[i]);
}
int r = 0;
for (int i = 0; i < n; i++) {
if (abs(a[i] - ma / 2) < abs(r - ma / 2)) r = a[i];
}
cout << ma << " " << r << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <stack>
#include <climits>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
int main()
{
int n;
cin >> n;
ll a[n],b[n];
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
bool same = true;
for(int i = 0; i < n; i++){
if(a[i] != b[i]) same = false;
}
if(same){
cout << 0 << endl;
}else{
ll sum = 0,sub = INF;
for(int i = 0; i < n; i++){
sum += a[i];
if(sub > b[i] && a[i] > b[i]) sub = b[i];
}
cout << sum - sub << endl;
}
}
| 0
| 85,712,232
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main()
{
int n;
cin >> n;
vector<ll> A(n),B(n),Z(n);
rep(i,n)cin >> A[i];
rep(i,n)cin >> B[i];
rep(i,n)Z[i]=A[i]-B[i];
sort(ALL(Z));
int left=0,right=n-1;
ll now = 0;
int ans = 0;
while(Z[left]<0)
{
if(now+Z[left]<0)
{
now += Z[right--];
ans ++;
}
now +=Z[left++];
ans ++;
}
if(now<0)
cout<<-1<<endl;
else
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string s, p;
std::cin >> s >> p;
int s_len, p_len;
bool flag = false;
s_len = s.length();
p_len = p.length();
for (int i=0; i<s_len; ++i){
if(flag){
break;
}
for (int j=0; j<p_len; ++j){
if (i+j < s_len && (char)(s[i+j] - p[j]) != 0){
break;
}
else if (i+j >= s_len && (char)(s[i+j-s_len] - p[j]) != 0){
break;
}
if (j == p_len-1 && ((i+j < s_len && (char)(s[i+j] - p[j]) == 0) || (i+j >= s_len && (char)(s[i+j-s_len] - p[j]) == 0))){
std::cout << "Yes" << endl;
flag = true;
}
}
}
if(!flag){
std::cout << "No" << endl;
}
return 0;
}
| 0
| 64,128,551
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n = 0;
cin >> n;
ll res = 0;
for(int i = 1;i <= n;i++){
string s = to_string(i);
if(s.size() % 2 == 1)res++;
}
cout << res << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <climits>
#include <bitset>
#include <numeric>
using namespace std;
const long double PI = 3.14159265358979323846264338327950;
const int N = 2 * 1e5;
template <class T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, ans;
cin >> a >> b;
for (int i = 1; i <= 1250; ++i) {
if (2 * i / 25 == a && i / 10 == b) {
cout << i << '\n';
return 0;
}
}
cout << -1 << '\n';
}
| 0
| 68,870,920
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define sz(x) ((int)(x).size())
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INF = INT_MAX / 2;
const ll inf = LLONG_MAX / 2;
const int mod = 1000000007;
const int MAX_N = 101010;
const long double PI = acos(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
string s;
cin >> s;
int ans = 0;
int pre = s[0];
rep(i, sz(s)) {
if (pre != s[i]) {
ans++;
pre = s[i];
}
}
out(ans);
return 0;
}
|
#include <complex>
#include <iostream>
using xy_t = std::complex<double>;
double cross_product(xy_t a, xy_t b);
bool isInsideTriangle(xy_t a, xy_t b, xy_t c, xy_t p);
int main()
{
double x[4], y[4];
while (true)
{
for (size_t i {}; i < 4; ++i)
std::cin >> x[i] >> y[i];
if (!std::cin)
break;
xy_t a {x[0], y[0]}, b {x[1], y[1]}, c {x[2], y[2]}, p {x[3], y[3]};
std::cout << (isInsideTriangle(a, b, c, p) ? "YES" : "NO") << std::endl;
}
}
double cross_product(xy_t a, xy_t b)
{
return (std::conj(a) * b).imag();
}
bool isInsideTriangle(xy_t a, xy_t b, xy_t c, xy_t p)
{
double area[3];
area[0] = cross_product(a - p, b - p);
area[1] = cross_product(b - p, c - p);
area[2] = cross_product(c - p, a - p);
if ((area[0] > 0 && area[1] > 0 && area[2] > 0)
|| (area[0] < 0 && area[1] < 0 && area[2] < 0))
return true;
else
return false;
}
| 0
| 6,450,498
|
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int* a = new int[n];
int* b = new int[n];
for (int i = 0;i < n;i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (int i = 0;i < n;i++) {
if (a[i] == b[n - 1]) {
cout << b[n - 2] << endl;
}
else {
cout << b[n - 1] << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int M = 1e9+7;
const int N = 1005;
int dp[N][N];
int main(){
int h , w;
cin >> h >> w;
vector<string> s(h);
memset(dp , 0 , sizeof(dp));
for(int i = 0 ; i < h ; i++){
cin >> s[i];
}
dp[0][0] = 1;
for(int i = 0 ; i < h ; i++){
for(int j = 0 ; j < w ; j++){
if (s[i][j] == '#'){
dp[i][j] = 0;
continue;
}
if (i >= 1){
dp[i][j] += dp[i-1][j];
dp[i][j] %= M;
}
if (j >= 1){
dp[i][j] += dp[i][j-1];
dp[i][j] %= M;
}
}
}
cout << dp[h-1][w-1] << endl;
return 0;
}
| 0
| 77,196,013
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdio>
using namespace std;
int A[251];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> A[i];
}
for (int i = 1; i <= n; ++i) {
cout << "node " << i << ": "
<< "key = " << A[i] << ", ";
if (i > 1) {
int parent = i / 2;
cout << "parent key = " << A[parent] << ", ";
}
int left = i * 2;
int right = i * 2 + 1;
if (left <= n) {
cout << "left key = " << A[left] << ", ";
}
if (right <= n) {
cout << "right key = " << A[right] << ", ";
}
cout << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define orz 1000000007
using namespace std;
int n,l,t,x[100005],w[100005];
ll ans;
int main(){
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;++i)scanf("%d%d",x+i,w+i);
for(int i=1;i<=n;++i){
if(w[i]==1){
ans+=(x[i]+t)/l;
(x[i]+=t)%=l;
}
else{
ans+=(x[i]-t)/l;
(x[i]-=t)%=l;
if(x[i]<0)x[i]+=l,--ans;
}
}
ans=(ans%n+n)%n+1;
sort(x+1,x+n+1);
for(int i=ans;i<=n;++i)printf("%d\n",x[i]);
for(int i=1;i<ans;++i)printf("%d\n",x[i]);
return 0;
}
| 0
| 46,299,709
|
#include <string>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main()
{
vector<bool> table(1000000000);
int n;
cin >> n;
rep(i,n){
long long a;
cin >> a;
if(table[a]){
cout << "NO" << endl;
return 0;
}
table[a] = true;
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll nature(ll a){
return max(a,-1*a);
}
int main(){
ll N;
cin>>N;
vector<ll> A(N);
ll sumprice;
for(ll i=0;i<N;i++){
cin>>A.at(i);
if(i==0){sumprice=max(A.at(0),-1*A.at(0));}
if(i>0){sumprice+=max(A.at(i)-A.at(i-1),A.at(i-1)-A.at(i));}
if(i==N-1){sumprice+=max(A.at(N-1),-1*A.at(N-1));}
}
ll memo=sumprice;
for(ll i=0;i<N;i++){
if(i==0){
sumprice+=nature(A.at(1))-nature(A.at(0))-nature(A.at(1)-A.at(0));
}
else if(i==N-1){
sumprice+=nature(A.at(N-2))-nature(A.at(N-1))-nature(A.at(N-2)-A.at(N-1));
}
else{
sumprice+=nature(A.at(i+1)-A.at(i-1))-nature(A.at(i)-A.at(i-1))-nature(A.at(i)-A.at(i+1));
}
cout<<sumprice<<endl;
sumprice=memo;
}
}
| 0
| 89,428,823
|
#include<bits/stdc++.h>
using namespace std;
#define long long long
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
}
vector<int> C;
long S=0, S1=0;
int ans=0;
for(int i=0; i<N; i++){
if(A[i]>=B[i]){
S1+=A[i]-B[i];
C.push_back(A[i]-B[i]);
}else{
S+=B[i]-A[i];
ans++;
}
}
if(ans==0){
cout << "0" << endl;
return 0;
}else if(S1<S){
cout << "-1" << endl;
return 0;
}
sort(C.begin(), C.end(), greater<int>());
for(int i=0; i<C.size(); i++){
S=S-C[i];
ans++;
if(S<=0) break;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Mc = N/4+1;
int Md = N/7+1;
for(int i=0;i<Mc;i++){
for(int j=0;j<Md;j++){
if(i*4+j*7 == N){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 16,840,966
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
ll N, A, B;
cin >> N >> A >> B;
ll ans = B*(N-1) + A - B - A*(N-1) + 1;
ans = max(ans, (ll)0);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
item += ch;
}
}
if (!item.empty()) {
elems.push_back(item);
}
return elems;
}
string to_str_with_zero(int i, int w) {
ostringstream sout;
sout << std::setfill('0') << std::setw(w) << i;
string s = sout.str();
return s;
}
int letter_to_int(char c) {
return tolower(c) - 'a';
}
int compare_array(vector<int> a1, vector<int>a2) {
if (a1.size() != a2.size()) {
return a1.size() - a2.size();
}
for (int i=0; i<a1.size(); i++) {
if (a1.at(i) != a2.at(i)) {
return a1.at(i) - a2.at(i);
}
}
return 0;
}
int gcd(int a, int b) {
if (a == b) {
return a;
}
else if (a > b) {
return gcd(a - b, b);
}
else {
return gcd(a, b - a);
}
}
char int_to_char(int a) {
if (a == -1) {
return 'z';
}
else {
return 'a' + a;
}
}
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans*i;
}
for (int i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int divide_count(int a, int divider) {
int r = 0;
while(a % divider == 0) {
a /= divider;
r++;
}
return r;
}
bool is_prime(int a) {
int i = 2;
while(i * i <= a) {
if(a % i == 0) {
return false;
}
i++;
}
return true;
}
int main() {
std::cout << std::setprecision(9);
int n, k;
cin >> n >> k;
vector<int> h(n);
for(int i=0; i<n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
long ans = 0;
for(int i=0; i<n - k; i++) {
ans += h[i];
}
cout << ans << endl;
}
| 0
| 68,303,652
|
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define ALL(v) v.begin(),v.end()
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; }
#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
using PI = P<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, n; cin >> h >> n;
V<PI> ab(n);
for (int i = 0; i < n; i++) cin >> ab[i].first >> ab[i].second;
V< V<int> > dp(2, V<int>(h + 1, INF));
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
dp[1] = V<int>(h + 1, INF);
for (int j = 0; j <= h; j++) {
chmin(dp[1][j], dp[0][j]);
chmin(dp[1][min(j + ab[i].first, h)], dp[1][j] + ab[i].second);
}
swap(dp[0], dp[1]);
}
cout << dp[0][h] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int n, d, x, ans = 0;
cin >> n >> d >> x;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
for (int j = 1;; j += a) {
if (j > d)
break;
ans++;
}
}
cout << ans + x << endl;
return 0;
}
| 0
| 52,600,363
|
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
#if !ONLINE_JUDGE
freopen("in1.txt", "r", stdin);
freopen("out1.txt", "w" , stdout);
#endif
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
}
else if (a == 1)
{
cout << "Alice" << endl;
}
else if (b == 1)
{
cout << "Bob" << endl;
}
else {
if (a > b) {
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<int,int>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=1e18;
const int mod=1e9+7;
const int M=100009;
inline int bigmod(int B,int P){int R=1;while(P>0){if(P&1){R=(R*B)%mod;}P>>=1;B=(B*B)%mod;}return R;}
inline int ad(int x,int y){int ret=(x%mod+y%mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int sub(int x,int y){int ret=((x%mod)-(y%mod)+mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int gun(int x,int y){int ret=((x%mod)*(y%mod))%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
main()
{
fast
string s;
cin>>s;
int sz=s.size();
int ses=0;
int a[sz+2];
s="#"+s;
a[0]=0;
int last=0;
for(int i=1;i<=sz;i++)
{
char ch=s[i];
int lft=i,rgt=i;
for(int j=i+1;j<=sz;j++)
{
if(s[j]==ch)rgt++;
else break;
}
if(ch=='<')
{
for(int j=lft,k=1;j<=rgt;j++,k++)
{
a[j]=k;
}
}
else
{
for(int j=rgt,k=0;j>=lft;j--,k++)
{
a[j]=k;
}
if(a[lft]>=a[lft-1])
{
a[lft-1]=a[lft]+1;
}
}
i=rgt;
}
f(i,0,sz)
{
ses+=a[i];
}
cout<<ses<<endl;
return 0;
}
| 0
| 91,854,050
|
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int Grundy(int v, int from, const vector<vector<int>>& g) {
int result = 0;
for (int x : g[v]) if (x != from) result ^= 1 + Grundy(x, v, g);
return result;
}
int main()
{
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
if (Grundy(0, -1, g) > 0) {
cout << "Alice\n";
} else {
cout << "Bob\n";
}
return 0;
}
|
#include <cstring>
#include <vector>
#include <list>
#include <map>
#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 <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)
const int MXN = 2e5 + 1;
const long long MNN = 5e3 + 100;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
int n;
int t, q;
llong ans = 0;
pair<int, int> p[MXN];
vector<pair<int, int> > lss, eql, grt;
bool cmp(pair<int, int> a, pair<int, int> b){
return a.F - a.S < b.F - b.S;
}
int main () {
cin >> q;
for(int i = 1; i <= q; i++){
cin >> p[i].F >> p[i].S;
ans += p[i].F;
if(p[i].F == p[i].S){
eql.pb({p[i].F, p[i].S});
}
else if(p[i].F > p[i].S){
grt.pb({p[i].S, p[i].F});
}
}
if(eql.size() == q) return cout << 0, 0;
sort(grt.begin(), grt.end());
cout << ans - grt[0].F;
return 0;
}
| 0
| 69,142,464
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7;
#define INF 1e9+9;
#define ps(x,y) fixed<<setprecision(y)<<x
# define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n,k;
cin>>n>>k;
double ans=0.0;
for(int i=1;i<=n;i++){
double p=(double)1/n;
int sum=i;
while(sum<k){
sum*=2;
p=p*(0.500);
}
ans+=p;
}
cout<<ps(ans,20)<<endl;
return 0;
}
|
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define endl "\n"
int main() {
string s, t;
cin >> s;
cin >> t;
int count = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] != t[i]) {
++count;
}
}
cout << count << endl;
return 0;
}
| 0
| 92,117,190
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i <= (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i >= 0; i--)
#define be(v) (v).begin(), (v).end()
#define dcout cout << fixed << setprecision(20)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int h,n; cin >> h >> n;
vint a(n);
int ans=0;
rep(i,n) {
cin >> a[i];
ans+=a[i];
}
if(ans>=h) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#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,m;cin>>n>>m;
vector<vector<int>>s(m);
rep(i,m){
int k;cin>>k;
s[i].resize(k);
rep(j,k){
cin>>s[i][j];
--s[i][j];
}
}
vector<int>p(m);
rep(i,m)cin>>p[i];
int ans=0;
for(int i=0;i<(1<<n);i++){
bool ok=true;
rep(j,m){
int count=0;
for(int id:s[j]){
if((i>>id)&1)count++;
}
if(count%2!=p[j])ok=false;
}
if(ok)ans++;
}
cout<<ans << endl;
}
| 0
| 23,385,118
|
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 305
#define inf 1e18
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x:-x;
}
ll dp[maxn][maxn],a[maxn],n,k;
int main()
{
n=read(); k=read(); rep(i,1,n) a [i]=read();
rep(i,1,n) rep(j,1,n) dp[i][j]=inf;
rep(i,1,n) dp[i][1]=a[i];
rep(i,2,n)
{
rep(j,2,i)
{
ll tmp=inf;
for(int k=1;k<=i-1;k++)
{
ll p=dp[k][j-1]; if(p==inf) continue;
if(a[i]>a[k]) p+=(a[i]-a[k]);
tmp=min(tmp,p);
}
dp[i][j]=tmp;
}
}
ll ans=inf;
for(int i=n;i>=n-k;i--) ans=min(ans,dp[i][n-k]); cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pi pair<int,int>
map<pll,int> black;
int dx[3] = {0,-1,-2}, dy[3] = {0,-1,-2};
map<pi,int> found;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll h, w;
cin >> h >> w;
int n;
cin >> n;
ll R[n], C[n];
for(int i = 0; i < n; i++)
{
cin >> R[i] >> C[i];
black[pll(R[i],C[i])] = 1;
}
ll ans[10];
memset(&ans,0,sizeof(ans));
ll tt = 0;
int total = 0;
for(int i = 0; i < n; i++)
{
for(int px = 0; px < 3; px++)
{
if(R[i]+dx[px] > h-2 || R[i]+dx[px] <= 0) continue;
int cnt = 0;
int st = 0;
for(int py = 0; py < 3; py++)
{
if(C[i]+dy[py] > w-2 || C[i] + dy[py] <= 0) continue;
pi rect;
rect.first = R[i]+dx[px], rect.second = C[i]+dy[py];
if(found.count(rect))
{
continue;
}
if(st == 0)
{
cnt = 0;
for(int r = 0; r < 3; r++)
{
for(int c = 0; c < 3; c++)
{
int blck_cnt = black.count(pll((R[i]+dx[px])+r,(C[i]+dy[py])+c));
if(blck_cnt)
{
cnt ++;
}
}
}
}
else
{
for(int r = 0; r < 3; r++)
{
int blck_cnt = black.count(pll((R[i]+dx[px])+r,(C[i]+dy[py-1]+2)));
int blck_cnt2 = black.count(pll((R[i]+dx[px])+r,(C[i]+dy[py])));
cnt -= blck_cnt;
cnt += blck_cnt2;
}
}
found[rect]=cnt;
ans[cnt]++;
tt++;
st++;
}
}
}
ans[0] = ((h-2)*(w-2))-tt;
for(int j = 0; j <= 9; j++)
{
cout << ans[j] << endl;
}
return 0;
}
| 0
| 3,723,745
|
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#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 <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}
constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
constexpr double pi = acos(-1);
constexpr double EPS = 1e-10;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
vector<int> a(n);
for(int i=0; i<n; i++) cin>>a[i];
int ng = 0, ok = n;
while(ok - ng > 1){
int mid = (ng + ok) / 2;
bool valid = true;
stack<P> st;
for(int i=0; i+1<n; i++){
if(a[i] >= a[i+1]){
while(st.size() && !(st.top().first <= a[i+1])) st.pop();
if(st.size() && st.top().first == a[i+1]) st.top().second++;
else st.emplace(a[i+1], 1);
while(st.top().second == mid){
int digit = st.top().first;
if(digit == 1) {valid = false; break;}
st.pop();
if(st.size() && st.top().first == digit - 1) st.top().second++;
else st.emplace(digit-1, 1);
}
if(!valid) break;
}
}
END:;
if(valid) ok = mid;
else ng = mid;
}
cout << ok << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define repi(i,x,n) for(ll i=x;i<(ll)(n);i++)
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const ll mod = 1000000007;
const ll INF = 1000000099;
vector<ll> dx={-1,1,0,0},dy={0,0,-1,1};
signed main(){
ll n,bmin=0;cin>>n;
vector<ll> sumi(n),a(n,0),b(n,0);
rep(i,n){
ll x;cin>>x;
sumi.at(x-1)=i;
}
ll A=0,B=0,mnb=0;
rep(i,n){
if(A+B>=sumi[i]){
A++;
B=sumi[i]-A;
}else{
B--;
A=sumi[i]-B;
}
a[i]=A;b[i]=B;
mnb=min(mnb,B);
}
mnb--;
rep(i,n){
cout<<a[i]-mnb<< (i==n-1 ? '\n':' ');
}
rep(i,n){
cout<<b[i]-mnb<< (i==n-1 ? '\n':' ');
}
}
| 0
| 16,199,498
|
#include <iostream>
#include <string>
#include <list>
#include <algorithm>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string s;
int n,i,a;
list<int> li;
list<int>::iterator p=li.begin();
cin >> n;
for(i=0;i<n;i++){
cin >> s;
if(s=="insert"){
cin >> a;
li.push_front(a);
}
else if(s=="delete"){
cin >> a;
p=find(li.begin(),li.end(),a);
if(p!=li.end()) li.erase(p);
}
else if(s=="deleteFirst"){
li.pop_front();
}
else if(s=="deleteLast"){
li.pop_back();
}
}
p=li.begin();
while(p != li.end()){
cout << *p;
p++;
if(p!=li.end()) cout << " ";
else cout << endl;
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> P;
#define F first
#define S second
int N,M;
P p[10003];
int main(){
while(1){
scanf("%d %d",&N,&M);
if(!N && !M) break;
for(int i=0;i<N;i++){
int d,pa;
scanf("%d %d",&d,&pa);
p[i]=P(pa,d);
}
sort(p,p+N);
int res=0;
for(int i=N-1;i>-1;i--){
if(M==0) res+=p[i].S*p[i].F;
else if(M>p[i].S) M-=p[i].S;
else if(M<=p[i].S){
p[i].S-=M;
M=0;
res+=p[i].S*p[i].F;
}
}
printf("%d\n",res);
}
}
| 0
| 80,918,468
|
#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,i;
cin >> n >> i;
cout << n-i+1 << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
const ll SZ = 2009, INF = 1e9 * 1e9 + 10;
char grid[SZ][SZ];
vector<pair<ll, ll>> dir = { {-1, 0}, {1, 0}, {0, 1}, {0, -1}};
bool used[SZ][SZ];
ll dist[SZ][SZ];
int main()
{
fastInp;
ll h, w;
cin >> h >> w;
queue<pair<ll, ll>> q;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> grid[i][j];
if (grid[i][j] == '#') {
used[i][j] = 1;
dist[i][j] = 0;
q.push({i, j});
}
}
}
while (!q.empty()) {
pair<ll, ll> v= q.front();
q.pop();
for (auto cur : dir) {
if (cur.first + v.first >= 0 && cur.second + v.second >= 0 && cur.first + v.first < h && cur.second + v.second < w) {
if (!used[cur.first + v.first][cur.second + v.second]) {
used[cur.first + v.first][cur.second + v.second] = 1;
dist[cur.first + v.first][cur.second + v.second] = dist[v.first][v.second] + 1;
q.push({cur.first + v.first, cur.second + v.second});
}
}
}
}
ll ans = 0;
for (int i= 0; i < h; i++) {
for (int j= 0; j < w; j++) {
ans = max(ans, dist[i][j]);
}
}
cout << ans;
return 0;
}
| 0
| 62,883,529
|
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (r[x] > r[y]) swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) {
return -r[root(x)];
}
};
int main(void){
int N, M;
cin >> N >> M;
UnionFind UF(N);
rep(i,M){
int A, B;
cin >> A >> B;
A --; B --;
UF.unite(A, B);
}
int ans = 0;
rep(i,N) ans = max(ans, UF.size(i));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0 ,-1};
signed main(){
int N;
cin >> N;
vector<vector<P>>ki(N);
for(int i = 0; i < N-1; i++) {
int a,b,c;
cin >> a >> b >> c;
a--;b--;
ki[a].push_back({b,c});
ki[b].push_back({a,c});
}
int Q,K;
cin >> Q >> K;
vector<int>cnt(N,-1);
cnt[K-1] = 0;
queue<int> que;
que.push(K-1);
while(!que.empty()) {
int X = que.front();
que.pop();
for(int i = 0; i < ki[X].size(); i++) {
if(cnt[ki[X][i].first] == -1) {
que.push(ki[X][i].first);
cnt[ki[X][i].first] = cnt[X]+ki[X][i].second;
}
}
}
for(int i = 0; i < Q; i++) {
int x,y;
cin >> x >> y;
x--;y--;
cout << cnt[x]+cnt[y] << endl;
}
}
| 0
| 40,661,644
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
getline(cin, str);
while (str[0] != '0') {
int n = 0;
for (unsigned int i = 0; i < str.size(); i++)
n += str[i] - '0';
cout << n << endl;
getline(cin, str);
}
return 0;
}
|
#include<bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
bool solve(vint a, int b){
set<int> s, ss;
s.insert(0);
for(auto t : a){
ss.clear();
for(auto u : s){
ss.insert(u+t);
ss.insert(u-t);
}
s = ss;
}
return s.count(b);
}
int main(){
string s;
int x, y;
cin >> s; cin >> x >> y;
vint X, Y;
bool f = true;
int start = 0;
while(start < s.size() && s[start] == 'F'){
x--;
start++;
}
for(int i = start;i < s.size();i++){
int d = 0;
while(s[i] == 'F'){
d++;
i++;
if(i == s.size()) break;
}
if(d > 0) {if(f) X.push_back(d); else Y.push_back(d);}
f = !f;
}
bool ans = solve(X, x) && solve(Y, y);
if(ans) cout << "Yes" << endl; else cout << "No" << endl;
}
| 0
| 85,517,890
|
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void)
{
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << endl;
return (0);
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if(s=="A")
{
cout<<"T"<<endl;
}
if(s=="T")
{
cout<<"A"<<endl;
}
if(s=="C")
{
cout<<"G"<<endl;
}
if(s=="G")
{
cout<<"C"<<endl;
}
return 0;
}
| 0
| 47,260,772
|
#include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
priority_queue<int> pq;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define mins(x,y) x=min(x,y)
#define maxs(x,y) x=max(x,y)
#define ALL(a) a.begin(), a.end()
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define pb push_back
#define sz(x) (int)(x).size()
#define mod 1000000007
#define reps(i,s,n) for(int i = s; i < n; i++)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
deque<int> deq;
#define fi first
#define se second
const ll MOD = (1e+9) + 7;
typedef pair<int, int> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
ll D=0;
ll S=0;
int m;
cin >> m;
rep(i,m){
ll d,c;
cin >> d>> c;
D+=c;
S+=d*c;
}
ll ans=D-1+(S-1)/9;
cout<<ans<<endl;
return 0;
}
|
#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(){
char a,b;
cin >> a >> b;
if(a=='H'){
cout << b << endl;
}else{
if(b=='H'){
cout << "D" << endl;
}else{
cout << "H" << endl;
}
}
return 0;
}
| 0
| 4,455,644
|
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#define all(c) (c).begin(),(c).end()
using namespace std;
int main(void){
int n;
while(cin >> n,n){
vector<int>a(n);
for(int i=0;i<n;i++)cin >> a[i];
sort(all(a));
int ans = 1<<29;
for(int i=0;i+1<n;i++)
ans = min(ans,a[i+1]-a[i]);
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
typedef long long LL;
using namespace std;
int main(){
LL n;
LL k;
cin >> n >> k;
vector<LL> v(n);
for(LL i=0; i<n; i++){
cin >> v[i];
}
LL lim=min(n,k);
LL ans=0;
LL sum;
for(LL i=0; i<=lim; i++){
for(LL j=0; j<=i; j++){
sum=0;
multiset<LL> get_val;
for(LL l=0; l<=j; l++){
if(l==0){
continue;
}
sum+=v[l-1];
get_val.insert(v[l-1]);
}
for(LL l=0; j+l<=i; l++){
if(l==0){
continue;
}
sum+=v[n-l];
get_val.insert(v[n-l]);
}
LL tmp=k-i;
while(tmp>0){
auto itr=get_val.begin();
if(*itr>=0){
break;
}
sum-=*itr;
get_val.erase(itr);
tmp--;
}
ans=max(ans,sum);
}
}
cout << ans << endl;
return 0;
}
| 0
| 4,036,449
|
#include<iostream>
#include<algorithm>
using namespace std;
int b[2000000];
void countingSort(int a[], int n, int maxa);
int main() {
int i, j, n, maxa, a[2000000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)maxa = a[0];
else maxa = max(maxa, a[i]);
}
countingSort(a, n, maxa);
for (i = 0; i < n; i++) {
cout << b[i];
if (i != n - 1)cout << " ";
}
cout << endl;
return 0;
}
void countingSort(int a[], int n, int maxa) {
int i, c[10001] = {};
for (i = 0; i < n; i++) c[a[i]]++;
for (i = 1; i < 10001; i++)c[i] += c[i - 1];
for (i = n - 1; i >= 0; i--) {
b[c[a[i]] - 1] = a[i];
c[a[i]]--;
}
}
|
#include<iostream>
#include<vector>
int main(void)
{
std::vector<int> incar;
int n;
while(std::cin >> n)
{
size_t isize=incar.size();
if(n==0)
{
std::cout << incar[isize-1] << '\n';
incar.pop_back();
}
else
{
incar.push_back(n);
}
}
}
| 0
| 20,594,466
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return b;
}
int main(){
ll N; cin >> N;
VL a(N); rep(i,0,N) cin >> a[i];
ll g = a[0];
rep(i,1,N) g = gcd(g, a[i]);
ll ans = g;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
#define INF 10000000000000000
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
signed main(void){
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
int h,w; cin>>h>>w;
vector<P> a(h+w);
rep(i,h){
cin>>a[i].first;
a[i].second=0;
}
rep(i,w){
cin>>a[i+h].first;
a[i+h].second=1;
}
sort(all(a));
int ans=0,vert=h+1,side=w+1;
rep(i,h+w){
if(a[i].second==0){
ans+=a[i].first*side;
vert--;
}else{
ans+=a[i].first*vert;
side--;
}
}
cout<<ans<<endl;
}
| 0
| 87,172,609
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
#define INF 1000000000
void solve_abc_c() {
ll n, k;
ll ans = 0;
cin >> n >> k;
map<ll, ll> m;
V a(n);
rep(i, n) {
cin >> a[i];
m[a[i]]++;
}
V val;
for (auto p : m) {
val.push_back(p.second);
}
sort(ALL(val));
rep(i, m.size() - k) {
ans += val[i];
}
cout << ans << "\n";
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
solve_abc_c();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (long long)(n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
string s;
cin >> s;
int K;
cin >> K;
K--;
for (int i = 0; i < N; i++)
if (s[i] != s[K]) s[i] = '*';
cout << s << '\n';
return 0;
}
| 0
| 43,148,134
|
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <tuple>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
using namespace std;
using ll=long long;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<string,int> si;
typedef pair<int,ii> iii;
typedef vector <si> vsi;
typedef vector <ii> vii;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <vll> vl2d;
typedef vector <vi> vi2d;
typedef vector <char> vc;
typedef vector <bool> vb;
typedef vector <string> vs;
typedef map <string,vs> msvs;
typedef map <string,int> msi;
typedef map <char,int> mci;
typedef map <int,int> mii;
typedef map <long,long> ml;
typedef map <string,string> mss;
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
#define foreach(x,arr) for(auto& x:arr)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define endl '\n'
#define INF 1000000000LL
#define MOD 1000000007ll
#define deb(x) cout<<#x<<": "<<x<<endl;
#define printArray(arr) for(auto x: arr) { cout<<x<<"\t"; }
#define printMatrix(mat) for(auto x: mat) { cout<<" "; printArray(x); cout<<endl; }
#define printMap(mmap) for(auto p: mmap) { cout<< p.first<<": "<<p.second<<endl; }
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define forch(ch,str) for(char& c : str)
#define FILL(a,b) memset(a,b,sizeof(a))
#define append push_back
#define nil nullptr
#define guard(_condition) if (bool(_condition)){}
#define count size()
#define let const auto
#define var auto
#define startsWith(str) rfind(str, 0)
#define prq priority_queue
#define tostr(argument) to_string(argument)
#define alphabet "abcdefghijklmnopqrstuvwxyz"
ll modulo(ll a, ll b, ll n){
long long x=1, y=a;
while (b > 0) {
if (b%2 == 1) {
x = (x*y) % n;
}
y = (y*y) % n;
b /= 2;
}
return x % n;
}
int main() {
ll n;
cin>>n;
vll arr(n);
bool wrong = false;
map<ll, ll> dic;
ll mx = 0;
rep(i,0,n) {
ll num;
cin>>num;
if(i==0 && num != 0) {
wrong = true;
}
if(i != 0 && num == 0) {
wrong = true;
}
dic[num] += 1;
mx = MAX(mx, num);
}
ll res = 1;
rep(i,1,mx+1) {
guard(dic[i-1] != 0 && dic[i] != 0) else {
wrong = true;
break;
}
ll p = modulo(dic[i-1], dic[i],998244353);
res = (res * p)%998244353;
}
if(wrong) {
cout<<0<<endl;
return 0;
}
cout<<res<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x=0,y=0,z=0,l=0,m=0;
int p[] = { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47 };
int n;
cin >> n;
int a[16];
fill(a,a+16,0);
for (int i = 2; i <= n; i++) {
int j = 0, temp = i;
while (temp > 1 && j < 15) {
if (temp%p[j]) j++;
else {
temp /= p[j];
a[j]++;
}
}
}
for(int i=0;i<15;i++){
if(a[i]>=2){
x++;
}
if(a[i]>=4){
y++;
}
if(a[i]>=14){
z++;
}
if(a[i]>=24){
l++;
}
if(a[i]>=74){
m++;
}
}
cout << m + l * (x - 1) + z * (y - 1) + y * (y - 1) / 2 * (x - 2) << endl;
return 0;
}
| 0
| 5,293,068
|
#include<iostream>
#include<cmath>
int main(){
int n;
double x1,y1,x2,y2,x3,y3,x4,y4;
const double e = 1e-10;
std::cin >> n;
for(int i=0;i<n;i++){
std::cin >> x1 >> y1
>> x2 >> y2
>> x3 >> y3
>> x4 >> y4;
if(std::fabs((x1*y3+x2*y4+y2*x3+y1*x4)-(x2*y3+x1*y4+y1*x3+y2*x4))<e){
std::cout << "YES" << std::endl;
}else{
std::cout << "NO" << std::endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount
#define INF INT_MAX/3
ll n;
vector<ll> g[101010];
ll dfs(ll v,ll pre){
ll res=0;
for(ll nv : g[v]){
if(nv==pre)continue;
ll tmp=dfs(nv,v);
res^=tmp+1;
}
return res;
}
int main(){
cin>>n;
rep(i,n-1){
ll a,b;
cin>>a>>b;
a--;b--;
g[a].push_back(b); g[b].push_back(a);
}
if(dfs(0,-1)==0)cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
return 0;
}
| 0
| 91,197,494
|
#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int b[n];
for(int i=0;i<n;i++){
cin>>a[i];
b[a[i]-1]=i+1;
}
for(int i=0;i<n;i++){
cout<<b[i]<<" ";
}
return 0;;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string w;
int a;
int b;
while(1){
cin >> w;
if(w=="-") break;
cin >> a;
for (int i=0; i<a; i++) {
cin >>b;
w += w.substr(0,b);
w.erase(0,b);
}
cout << w << endl;
}
}
| 0
| 5,524,524
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
LL a,b,k;
cin >> a >> b >> k;
if(a+b <= k){
cout << '0' << ' ' << '0' << endl;
return 0;
}
if(a >= k){
cout << a-k << ' ' << b << endl;
return 0;
}
cout << '0' << ' ' << b-(k-a) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
int n;
cin>>n;
if(n<1200)cout<<"ABC";
else if(n>=1200&&n<2800)cout<<"ARC";
else cout<<"AGC";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
| 0
| 94,640,004
|
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int x, p;
};
bool cmp(Node a, Node b)
{
return a.x < b.x;
}
int main()
{
Node a[100005], b[100005];
int n;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i].x;
a[i].p = i;
}
sort(a+1,a+n+1,cmp);
int ans = 0;
for(int i = 1; i <= n; i++)
{
if( abs(a[i].p-i) % 2 != 0) ans++;
}
cout << ans/2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin_popcountll(x)
#define f first
#define se second
#define inc(v,n,x) v.assign(n,x)
#define incd(v,n) v.resize(n)
#define iniz(n) memset(n,0,sizeof(n))
#define inin(n) memset(n,-1,sizeof(n))
#define inimi(n) memset(n,0xc0,sizeof(n))
#define inima(n) memset(n,0x3f,sizeof(n))
#define all(v) (v).begin(),(v).end()
using namespace std;
template<typename T1,typename T2>istream &operator>>(istream &is, vector<pair<T1,T2>> &v) { for (pair<T1,T2> &t : v) is >> t.f>>t.se; return is; }
template<typename T>istream &operator>>(istream &is, vector<T> &v) { for (T &t : v) is >> t; return is; }
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v) { for (const T &t : v) {os << t <<" ";} os << '\n'; return os; }
const int N=200001;
double pi=acos(-1.0);
int md=1e9+7;
const int INF=1e15;
int dx1[]={0,0,-1,1};
int dy1[]={1,-1,0,0};
template<class T>
T abst(T a)
{return a<0?-a:a;}
template<class T>
T max2(T a,T b){return a>b?a:b;}
template<class T>
T min2(T a,T b){return a<b?a:b;}
vp v[201];
int dis[201][201];
vi r;
int dp[1000][10];
int fun(int mask,int i)
{
if(setbits(mask)==size(r))return 0;
if(dp[mask][i]!=-1)return dp[mask][i];
int ans=INT_MAX;
for(int j=0;j<size(r);j++)
if(!((1<<j)&mask))
ans=min2(ans,dis[r[i]][r[j]]+fun(mask|(1<<j),j));
return dp[mask][i]=ans;
}
void solve()
{
inin(dp);
int n,m,r1;cin>>n>>m>>r1;
inima(dis);
for(int i=1;i<=n;i++)
dis[i][i]=0;
incd(r,r1);cin>>r;
while(m--)
{
int x,y,z;
cin>>x>>y>>z;
dis[x][y]=z;
dis[y][x]=z;
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
dis[i][j]=min2(dis[i][k]+dis[k][j],dis[i][j]);
}
}
int ans=INT_MAX;
for(int i=0;i<r1;i++)
ans=min2(ans,fun(1<<i,i));
cout<<ans;
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int t=1;
for(int i=1;i<=t;i++)
{
solve();
}
return 0;
}
| 0
| 82,976,344
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
int n,m;
vector <int> g[200005];
int boat[200005] ;
bool vis[200005] , ok=false;
void bfs(){
queue <int> q;
q.push(1);
while (q.size()){
int u=q.front();
q.pop();
vis[u] = true ;
for (auto &it: g[u]){
boat[it]=min(boat[it],boat[u]+1);
if (!vis[it]) q.push(it);
}
}
}
signed main()
{
cin>>n>>m;
for (int i=0;i<m;i++){
int u,v;
cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
for (int i=2;i<=n;i++) boat[i] = 1000000000 ;
boat[0]=boat[1]=0;
bfs();
if (boat[n]==2) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
vector<int> x = {1,-1,0,0};
vector<int> y = {0,0,-1,1};
int main(){
string s;
cin >> s;
string head,tail;
string ans = "keyence";
head = s.substr(0,7);
tail = s.substr(s.size()-7);
string a,b,c,d,e,f;
a = s.substr(0,1)+s.substr(s.size()-6);
b = s.substr(0,2)+s.substr(s.size()-5);
c = s.substr(0,3)+s.substr(s.size()-4);
d = s.substr(0,4)+s.substr(s.size()-3);
e = s.substr(0,5)+s.substr(s.size()-2);
f = s.substr(0,6)+s.substr(s.size()-1);
if(a==ans||b==ans||c==ans||d==ans||e==ans||f==ans||head==ans||tail==ans){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
}
| 0
| 46,033,904
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define pii pair<int,int>
using namespace std;
inline void solve(){
string s; cin>>s;
int len=sz(s),c=0;
map <char,bool> mp;
for (int i=0;i<len;i++){
if (!mp[s[i]]) c++;
mp[s[i]]=true;
}
if (c==len) cout << "yes" << endl;
else cout << "no" << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
|
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool charmatch(string s,string t){
if(s.length()!=t.length())return false;
int ans=0;
for(int i=0;i<s.length();i++){
ans+=(s[i]==t[i]||s[i]=='?'||t[i]=='?');
}
if(ans==s.length())return true;
else return false;
}
int main(){
string s,t;
in(s,t);
int ans=0;
for(int i=s.length()-t.length()+1;i>=0;i--){
if(charmatch(t,s.substr(i,t.length()))){
for(int j=0;j<t.length();j++){
s[j+i]=t[j];
}
ans=1;
break;
}
}
if(ans==0)out("UNRESTORABLE");
else{
for(int i=0;i<s.length();i++){
if(s[i]=='?')cout<<'a';
else cout<<s[i];
}
cout<<endl;
}
}
| 0
| 46,593,240
|
#include <iostream>
#include <cstdio>
#include <bitset>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s,a,b) for(long long s = a;s < b;s++)
#define forllde(s,a) for(long long s = a;s > 0;s--)
int main()
{
ll a,b;
scanf("%lld %lld", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
}
|
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<queue>
#define pr(x) cout<<#x<<" "<<x;
#define pl(x) cout<<#x<<" "<<x<<endl;
#include<math.h>
#include<algorithm>
using namespace std;
char maze[1005][1005];
int dx[] = {-1,1,0,0};
int dy[] = {0,0,-1,1};
int d[1005][1005];
const int INF = 0x7f7f7f7f;
typedef pair <int ,int > p;
queue <p> que;
int h,w;
void chushihua(){
for(int i = 0;i<1005;i++){
for(int j = 0;j<1005;j++){
d[i][j] = INF;
}
}
}
int bfs(int x,int y,int gx,int gy){
chushihua();
d[x][y] = 0;
que.push(p(x,y));
while(que.size()){
p cp = que.front();
que.pop();
if(cp.first==gx&&cp.second==gy){break;}
for(int i = 0;i<4;i++){
int nx = cp.first + dx[i];
int ny = cp.second + dy[i];
if(nx>=0&&nx<h&&ny>=0&&ny<w&&maze[nx][ny]!='X'&&d[nx][ny]==INF){
que.push(p(nx,ny));
d[nx][ny] = d[cp.first][cp.second] + 1;
}
}
}
while(que.size()){que.pop();}
return d[gx][gy];
}
int main(){
int n;
cin>>h>>w>>n;
int indexmap[n+5][4];
getchar();
for(int i = 0;i<h;i++){
scanf("%s",&maze[i]);
}
for(int i = 0;i<h;i++){
for(int j = 0;j<w;j++){
if(maze[i][j]=='S'){
indexmap[0][0] = i;
indexmap[0][1] = j;
}
else if((int)maze[i][j]>=49&&(int)maze[i][j]<=57){
int index = maze[i][j]-'0';
indexmap[index][0] = i;
indexmap[index][1] = j;
}
}
}
int ans = 0;
for(int i=0;i<n;i++){
ans += bfs(indexmap[i][0],indexmap[i][1],indexmap[i+1][0],indexmap[i+1][1]);
}
cout<<ans<<endl;
}
| 0
| 11,853,821
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
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; }
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 5e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
int main() {
init();
ll N;
string S;
cin >> N >> S;
string H;
ll d = 0;
rep(i,N){
d += (S[i] == '(' ? 1 : -1);
if (d < 0) H += '(', d++;
}
H += S;
H += string(d, ')');
cout << H << endl;
}
|
#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<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#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"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007;
#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; }
void Main(){
int N; cin >> N;
VI a(N); REP(i,N) cin >> a[i]; SORT(a);
int r = a.back();
int half = (r+1) / 2;
VI n(r+1,0);
REP(i,N) n[a[i]]++;
REP(i,N){
if(a[i] < half){
cout << "Impossible" << en;
return;
}
}
FOR(i,half,r+1){
if(r%2 == 0 && i == half){
if(n[i] != 1){
cout << "Impossible" << en;
return;
}
}
else if(r%2 == 1 && i == half){
if(n[i] != 2){
cout << "Impossible" << en;
return;
}
}
else if(n[i] < 2){
cout << "Impossible" << en;
return;
}
}
cout << "Possible" << en;
return;
}
int main(void){
cin.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
int t=1;
REP(_,t){
Main();
}
return 0;
}
| 0
| 27,014,221
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 3000005;
const int maxm = maxn*2;
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
int n,m,cnt;
map<pair<int,int>,int>mp;
ll ans[10];
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>m>>cnt;
for(int i = 1;i<=cnt;i++) {
int x,y; cin>>x>>y;
for(int i = max(1,x-2);i<=min(x,n-2);i++)
for(int j = max(1,y-2);j<=min(m-2,y);j++) mp[make_pair(i,j)]++;
}
ans[0] = 1ll*(n-2)*(m-2);
map<pair<int,int>,int> :: iterator it;
for(it = mp.begin();it!=mp.end();it++) {
ans[it->second] ++;
ans[0] --;
}
for(int i = 0;i<10;i++) cout<<ans[i]<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define endl '\n'
const ll MOD = 1000000007;
int main() {
int n; scanf("%d", &n);
vector<int> a(n);
for (int &i : a)
scanf("%d", &i);
int m = *max_element(all(a));
vector<int> check(m + 1);
for (int i : a)
check[i]++;
int ans = 0;
for (int i = 1; i <= m; i++) {
if (check[i] >= 1) {
if (check[i] == 1) ans++;
for (int j = 2 * i; j <= m; j += i)
check[j] = 0;
}
}
printf("%d", ans);
return 0;
}
| 0
| 18,088,941
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.