code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
using namespace std;
struct Node{
int key;
Node *prev,*next;
};
Node *NIL;
void initList(){
NIL = (Node *)malloc(sizeof(Node));
NIL -> prev = NIL;
NIL -> next = NIL;
}
void insert(int K){
Node *x;
x = (Node *)malloc(sizeof(Node));
x -> key = K;
x -> prev = NIL;
x -> next = NIL -> next;
x -> next -> prev = x;
x -> prev -> next = x;
}
Node* find(int K){
Node *Ser = NIL;
Ser = Ser -> next;
while (Ser != NIL) {
if (Ser -> key == K) {
return Ser;
}
Ser = Ser -> next;
}
return NIL;
}
void deleteNode(Node *t){
if (t == NIL) return;
t -> next -> prev = t -> prev;
t -> prev -> next = t -> next;
free(t);
}
void delete_x(int K){
deleteNode(find(K));
}
void delete_first(){
deleteNode(NIL -> next);
}
void delete_last(){
deleteNode(NIL -> prev);
}
void printList(){
Node *Ser = NIL;
Ser = Ser -> next;
if (Ser == NIL) return;
while (Ser != NIL) {
printf("%d",Ser -> key);
if (Ser -> next != NIL) {
printf(" ");
}
Ser = Ser -> next;
}
printf("\n");
}
int main(){
char op[20];
int N;
cin >> N;
initList();
for (int i = 0; i < N; i++) {
scanf("%s",op);
int x;
if (op[0] == 'i') {
scanf("%d",&x);
insert(x);
}else{
if (strlen(op) > 6) {
if (op[6] == 'F') {
delete_first();
}else{
delete_last();
}
}else{
scanf("%d",&x);
delete_x(x);
}
}
}
printList();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001;
int main()
{
int N;
cin >> N;
ll rem = 1;
ll A[N+1];
F0R(i, N+1)
{
cin >> A[i];
}
F0R(i, N+1)
{
rem -= A[i];
if (rem < 0)
{
cout << -1 << nl; return 0;
}
rem *= 2;
if (rem > 1e15) rem = 1e15;
}
rem = 0;
F0R(i, N+1)
rem += A[i];
ll cur = 1;
ll ans = 0;
F0R(i, N+1)
{
ans += min(cur, rem);
cur -= A[i];
cur *= 2;
if (cur > 1e15) cur = 1e15;
rem -= A[i];
}
cout << ans << nl;
return 0;
}
| 0
| 28,111,154
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
cin >> N;
int cmax = 0, Nmax = 1;
for (int i = 1; i <= N; i++) {
int c = 0;
int t = i;
while (t%2 == 0){
c++;
t /= 2;
}
if (c > cmax){
cmax = c;
Nmax = i;
}
}
cout << Nmax << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
const int INF = 1000100100;
int main(){
ll n,cnt=0,sum=0,ans;
string s;
cin>>s;
n=s.size();
rep(i,n){
if(s[i]=='B'){
cnt++;
sum+=n-i;
}
}
ans=sum-cnt*(cnt+1)/2;
cout<<ans;
}
| 0
| 15,722,032
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n+1);
vector<int> b(n);
for (int i = 0;i < n+1;i++){
cin >> a[i];
}
for (int i = 0;i < n;i++){
cin >> b[i];
}
long long ans = 0;
for (int i = 0;i < n;i++){
if (b[i] >= a[i]){
b[i] -= a[i];
ans += a[i];
a[i] = 0;
if (b[i] >= a[i+1]){
b[i] -= a[i+1];
ans += a[i+1];
a[i+1] = 0;
}
else{
a[i+1] -= b[i];
ans += b[i];
b[i] = 0;
}
}
else{
a[i] -= b[i];
ans += b[i];
b[i] = 0;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a, ll b) {
if (a > b) swap(a, b);
if (b % a == 0) {
return (b/a)*a*2-a;
}
return (b/a)*a*2+f(b%a, a);
}
int main () {
ll N, X;
cin >> N >> X;
if (X+X == N) {
cout << N/2*3 << endl;
return 0;
}
cout << N+f(X, N-X) << endl;
}
| 0
| 95,538,200
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
const int mod = 1000000007;
#define PI 3.14159265359;
void P(int x) {cout << x << endl;}
void P(long x) {cout << x << endl;}
void P(double x) {cout << x << endl;}
void P(ll x) {cout << x << endl;}
void P(string x) {cout << x << endl;}
void P(char x) {cout << x << endl;}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c >= a && c <= b) Yes;
else No;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(a) (a).begin(),(a).end()
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
map<int,int> mp;
rep(i,n) {
int a, b;
cin >> a >> b;
mp[a] += b;
}
int now = 0;
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
now += itr->second;
if (now >= k) {
cout << itr->first << endl;
return 0;
}
}
return 0;
}
| 0
| 9,214,815
|
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, string op, ll B) {
cout << A + B * (op == "+" ? 1 : -1) << endl;
}
int main() {
ll A;
cin >> A;
string op;
cin >> op;
ll B;
cin >> B;
solve(A, op, B);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define YN(flag) (flag?"Yes":"No")
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using P = pair<ll,ll>;
using graph = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
signed main (){
int n;cin>>n;
int right=0,left=n-1;
int ra;
cout<<right<<endl;
string s;cin>>s;
if(s=="Vacant")return 0;
ra=(s=="Male"?0:1);
cout<<left<<endl;
cin>>s;
if(s=="Vacant")return 0;
while(true){
int m=(right+left)/2;
cout<<m<<endl;
cin>>s;
if(s=="Vacant")return 0;
int ca=(s=="Male"?0:1);
if((m-right)%2==0){
if(ca==ra){
right=m;
ra=ca;
}else{
left=m;
}
}else{
if(ca!=ra){
right=m;
ra=ca;
}else{
left=m;
}
}
}
return 0;
}
| 0
| 91,426,642
|
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
int a, b, C;
double rad, S, L, h;
cin >> a >> b >> C;
rad = C * acos(-1) / 180;
S = a * b * sin(rad) / 2;
L = a + b + sqrt(pow(a, 2) + pow(b, 2) - 2 * a * b * cos(rad));
h = b * sin(rad);
printf("%f\n%f\n%f\n", S, L, h);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define mii map<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repe(i,a,b) for(int i=a;i<=b;i++)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
#define INF 100000000000
#define mod 1000000007
#define esp 10e-7
const int mx=100001;
signed main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
double d,t,s;
cin>>d>>t>>s;
double req=d/(s);
if((req)<=t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
| 0
| 16,791,261
|
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define mod 1000000007
#define int long long
int solve2(vector<vector<int>> &dp, vector<vector<int>> &a, int c, int src, int par) {
if (dp[src][c] != -1)return dp[src][c];
int ans = 0;
int c0 = 1, c1 = 1;
for (auto x : a[src]) {
if (x != par) {
c0 = (c0 * (solve2(dp, a, 0, x, src) % mod) ) % mod;
}
}
ans = (ans + c0) % mod;
if (c == 0) {
for (auto x : a[src]) {
if (x != par) {
c1 = (c1 * (solve2(dp, a, 1, x, src) % mod) ) % mod;
}
}
ans = (ans + c1) % mod;
}
return dp[src][c] = ans % mod;
}
void solve() {
int n;
cin >> n;
vector<vector<int>> a(n);
int i, j;
for (i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
a[u].push_back(v);
a[v].push_back(u);
}
vector<vector<int>> dp(n, vector<int>(2));
for (i = 0; i < n; i++) {
for (j = 0; j < 2; j++)dp[i][j] = -1;
}
cout << solve2(dp, a, 0, 0, -1);
}
int32_t main() {
std::ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define SZ(x) (int)(x).size()
#define BE(x) (x).begin(), (x).end()
#define SORT(x) sort(BE(x))
#define _1 first
#define _2 second
#define x1 gray_cat_x1
#define y1 gray_cat_y1
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define file "I1"
const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
vector<pii> g[MAXN];
int dis[MAXN];
int used[MAXN];
int dfs(int s) {
used[s] = 1;
REP(i, 0, SZ(g[s])) {
int to = g[s][i]._1, d = g[s][i]._2;
if (!used[to]) {
dis[to] = dis[s] + d;
if (dfs(to)) {
return 1;
}
} else {
if (dis[to] != dis[s] + d) {
return 1;
}
}
}
return 0;
}
void solve(){
int n, m, a, b, c;
scanf("%d%d", &n, &m);
REP(i, 0, m) {
scanf("%d%d%d", &a, &b, &c);
g[a].pb(mp(b, c));
g[b].pb(mp(a, -c));
}
REPN(i, 1, n) {
if (!used[i] && dfs(i)) {
printf("No\n");
return;
}
}
printf("Yes\n");
}
int main(){
int t = 1;
while(t--){
solve();
}
}
| 0
| 17,803,692
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI d(n);
rep(i,n){
cin >> d.at(i);
}
sort(d.begin(),d.end());
int ans=d.at(n/2) - d.at((n/2)-1);
cout << ans << endl;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=40;
int n;
char a[maxn][3];
char b[maxn][3];
char c[maxn][3];
void bubble_sort()
{
for(int i=0;i<n;i++)
{
for(int j=n-1;j>0;j--)
{
if(b[j][1]<b[j-1][1]) swap(b[j],b[j-1]);
}
}
}
void select_sort()
{
for(int i=0;i<n;i++)
{
int minh=i;
for(int j=i;j<n;j++)
{
if(c[j][1]<c[minh][1]) minh=j;
}
if(i!=minh) swap(c[i],c[minh]);
}
}
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",&a[i]);
}
memcpy(b,a,sizeof(a));
bubble_sort();
for(int i=0;i<n;i++)
{
if(i) printf(" ");
printf("%s",b[i]);
}
printf("\nStable\n");
memcpy(c,a,sizeof(a));
select_sort();
for(int i=0;i<n;i++)
{
if(i) printf(" ");
printf("%s",c[i]);
}
printf("\n");
bool flag=true;
for(int i=0;i<n;i++)
{
if(strcmp(b[i],c[i])!=0)
{
flag=false;
break;
}
}
if(flag)
{
printf("Stable\n");
}
else
{
printf("Not stable\n");
}
return 0;
}
| 0
| 57,739,299
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int a;
int remain;
cin >> n >> a;
remain = n % 500;
if (remain <= a)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
string o, e;
cin >> o >> e;
int n = max(o.size(), e.size());
rep(i, n)
{
if (i < o.size())
cout << o[i];
if (i < e.size())
cout << e[i];
}
cout << endl;
}
int main()
{
solve();
return 0;
}
| 0
| 83,818,522
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<bool> snukes(N);
rep(i, N) snukes.at(i) = false;
rep (i, K) {
int d;
cin >> d;
rep (j, d) {
int a;
cin >> a;
snukes.at(a - 1) = true;
}
}
int ans = 0;
rep(i, N) if(!snukes.at(i)) ans++;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int N, A, B, C, X;
while (scanf("%d %d %d %d %d", &N, &A, &B, &C, &X) == 5) {
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0) break;
int Y[N];
for (int i = 0; i < N; i++) {
scanf(" %d", &Y[i]);
}
int index = 0;
bool flag = true;
for (int i = 0; i <= 10000; i++, X = (A * X + B) % C) {
if (X == Y[index]) index++;
if (index == N) {
cout << i << endl;
flag = false;
break;
}
}
if (flag) {
cout << -1 << endl;
}
}
return 0;
}
| 0
| 60,529,975
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
getline(cin,a);
cin >>b;
a=a+a;
if(a.find(b)==-1)
{cout <<"No"<<endl;}
else{cout <<"Yes"<<endl;}
return 0;
}
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 100000000
#define INF 300000000000000000
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[5]={-1,0,1,0,0};
int dy[5]={0,-1,0,1,0};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll>a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi<b.fi;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll h,w,d;cin>>h>>w>>d;
ll a[310][310];
map<ll,Pll>address;
map<Pll,ll>cost;
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
cin>>a[i][j];
Pll tmp = mp(i,j);
address[a[i][j]]=tmp;
}
}
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
ll L = a[i][j];
if(L>d)continue;
ll co=0;
ll x=i,y=j;
ll cnt=0;
while(L+d<=h*w){
L+=d;
cnt++;
Pll new_place = address[L];
co+=abs(x-new_place.fi)+abs(y-new_place.se);
cost[mp(a[i][j],cnt)]=co;
x=new_place.fi;y=new_place.se;
}
}
}
ll q;cin>>q;
while(q--){
ll L,R;cin>>L>>R;
ll k=L/d;
if(L%d==0)k--;
ll M=L-k*d;
ll C1=(R-M)/d;
ll C2=(L-M)/d;
cout<<cost[mp(M,C1)]-cost[mp(M,C2)]<<endl;
}
return 0;
}
| 0
| 83,595,557
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> A(n);
for(int i=0; i<n; ++i) cin>>A[i];
long long current=1000;
for(int i=1; i<n; ++i){
long long stocks=0;
if(A[i-1]<A[i]) stocks = current/A[i-1];
current += (A[i]-A[i-1])*stocks;
}
cout<<current<<"\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m, a, b, c[9][9]{};
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
cin >> a >> b;
c[a][b] = c[b][a] = 1;
}
int p[8], ans = 0;
iota(begin(p), begin(p) + n, 1);
do
{
bool ok = true;
for (int i = 0; i < n - 1; i++)
if (!c[p[i]][p[i+1]])
ok = false;
if (ok)
ans++;
} while (next_permutation(begin(p) + 1, begin(p) + n));
cout << ans << endl;
}
| 0
| 7,540,580
|
#include <cstdio>
#include <cmath>
struct Point{double x, y;};
void koch(int n, Point p1, Point p2) {
if (n == 0) return;
Point s, t, u;
double rad_60 = M_PI * 60 / 180;
s.x = (2 * p1.x + 1 * p2.x) / 3;
s.y = (2 * p1.y + 1 * p2.y) / 3;
t.x = (1 * p1.x + 2 * p2.x) / 3;
t.y = (1 * p1.y + 2 * p2.y) / 3;
u.x = (t.x - s.x) * cos(rad_60) - (t.y - s.y) * sin(rad_60) + s.x;
u.y = (t.x - s.x) * sin(rad_60) + (t.y - s.y) * cos(rad_60) + s.y;
koch(n - 1, p1, s);
printf("%.8f %.8f\n", s.x, s.y);
koch(n - 1, s, u);
printf("%.8f %.8f\n", u.x, u.y);
koch(n - 1, u, t);
printf("%.8f %.8f\n", t.x, t.y);
koch(n - 1, t, p2);
}
int main() {
Point p1, p2;
int n;
scanf("%d", &n);
p1.x = 0;
p1.y = 0;
p2.x = 100;
p2.y = 0;
printf("%.8f %.8f\n", p1.x, p1.y);
koch(n, p1, p2);
printf("%.8f %.8f\n", p2.x, p2.y);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define maxn 100002
#define FOR(i, l, r) for (int i=l; i<=r; ++i)
#define FORD(i, r, l) for (int i=r; i>=l; --i)
#define REP(i, r) for (int i=0; i<(int)r; ++i)
#define REPD(i, r) for (int i=(int)r-1; i>=0; --i)
#define fi first
#define se second
#define mk make_pair
#define nil NULL
#define y0 y902
#define y1 y232
#define x0 x92
#define x1 x899
#define next asdfa
#define sz size
#define Debug(X) {cerr << #X << " = " << X << '\n';}
#define PR(A, n) {cerr << #A << " = "; FOR(i, 1, n) cerr << A[i] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; REP(i, n) cerr << A[i] << ' '; cerr << '\n';}
typedef long long ll;
typedef double db;
typedef pair<db, db> dd;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int inf = 1e9;
template<class T> int getbit(T x, int pos) {return (x>>(pos-1)) & 1;}
template<class T> void turn_on(T &x, int pos) {x = x | ((T)1<<(pos-1));}
template<class T> void turn_off(T &x, int pos) {x = x & ~((T)1<<(pos-1));}
template<class T> T sqr(T a) {return a*a;}
int n;
vector<int> a[maxn];
int grundy(int u, int par) {
int res = 0;
REP(i, a[u].sz()) {
int v = a[u][i];
if (v==par) continue;
res ^= (grundy(v, u)+1);
}
return res;
}
int main() {
scanf("%d", &n);
FOR(i, 1, n-1) {
int u, v; scanf("%d%d", &u, &v);
a[u].push_back(v); a[v].push_back(u);
}
if (grundy(1, 0)==0) printf("Bob");
else printf("Alice");
}
| 0
| 92,590,327
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(a) begin(a),end(a)
typedef long long ll;
typedef pair<int,int> P;
const int inf=1e+9;
const ll mod=1000000007;
const double PI=3.14159265358979323846;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
ll gcd(ll a, ll b){
if (b==0) return a;
else return gcd(b,a%b);
}
int cans(bool f){
if(f) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
int N,K;
vector<int> a;
vector<int> sum;
int main() {
while(cin >> N,cin >> K) {
if(N==0&&K==0) break;
a.resize(N);
sum.resize(N+1);
sum[0] = 0;
rep(i,N) {
cin >> a[i];
sum[i+1] = a[i] + sum[i];
}
ll ans = 0;
rep(i,N-K) {
ll tmp = sum[i+K] - sum[i];
ans = max(ans,tmp);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
int main() {
char b, ans;
cin >> b;
if(b == 'A') ans = 'T';
else if(b == 'T') ans = 'A';
else if(b == 'C') ans = 'G';
else ans = 'C';
cout << ans << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
| 0
| 20,965,384
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
int dp[1<<26];
int main(){
string s;cin>>s;
memset(dp,0x3f,sizeof(dp));
dp[0]=0;
int h=0;
rep(i,s.size()){
h^=1<<(s[i]-'a');
int Min=dp[h]+1;
rep(j,26){
dp[h]=min(dp[h],dp[h^(1<<j)]+1);
Min=min(Min,dp[h^(1<<j)]+1);
}
if(i==s.size()-1){
printf("%d\n",Min);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX_A = 1e5+1;
int N, M;
void solve() {
cin >> N >> M;
vector<P> jobs(N);
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
jobs[i] = P(a, b);
}
sort(jobs.begin(), jobs.end());
ll ans = 0;
priority_queue<int> q;
int start = 0;
for (int d = 1; d <= M; ++d) {
for (int i = start; i < N; ++i) {
P j = jobs[i];
if (j.first <= d) {
q.push(j.second);
start++;
} else {
start = i;
break;
}
}
if (!q.empty()) {
ans += q.top(); q.pop();
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 0
| 33,256,024
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N,ans=0;
cin >> N;
vector<ll> A(N),B(N),diff;
ll sum=0;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
if(A[i] >= B[i]) diff.push_back(A[i]-B[i]);
else{
sum += B[i] - A[i];
ans++;
}
}
sort(diff.begin(), diff.end());
reverse(diff.begin(), diff.end());
int flag=0;
if(sum == 0) ans = 0;
else{
for(int i=0; i<diff.size(); i++){
sum -= diff[i];
ans++;
if(sum <= 0) {flag = 1; break;}
}
if(flag == 0) ans = -1;
}
cout << ans;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <queue>
#include <math.h>
#include <bitset>
#define INF 100000000000
#define ll long long
using namespace std;
struct UnionFind {
vector<ll> par;
UnionFind(ll N) : par(N) {
for(ll i = 0; i < N; i++) par[i] = i;
}
ll root(ll x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
};
int main(){
ll n,q; cin>>n>>q;
UnionFind tree(n);
for(ll i=0; i<q; i++){
ll a,b,c; cin>>a>>b>>c;
if(a==0) tree.unite(b,c);
if(a==1){
if(tree.same(b,c)) cout<<"1"<<endl;
else cout<<"0"<<endl;
}
}
}
| 0
| 1,998,560
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const ll MOD = 998244353;
const double PI = acos(-1.0);
const double EPS = 1e-10;
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 solve(){
int N;
cin >> N;
vector<ll> A(N), B(N);
ll sum = 0;
ll mi = LINF;
REP(i,N){
cin >> A[i] >> B[i];
sum += A[i];
if(A[i] > B[i]) chmin(mi, B[i]);
}
if(A == B) cout << 0 << endl;
else cout << sum - mi << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
int divr[maxn];
void divisor()
{for(int i=2;i<sqrt(maxn);i++)
{
if(!divr[i])
{
for(int j=i*i;j<maxn;j+=i)if(!divr[j])divr[j]=i;
}
}
for(int i=1;i<maxn;i++)if(!divr[i])divr[i]=i;
}
int main()
{
int n,k;
cin>>n>>k;
ll left=0,right=0;
ll ans=0;
for(int i=1;i<=n+1;i++)
{
left+=i-1;
right+=n+1-i;
left%=mod;
right%=mod;
if(i>=k)
{
ans+=right-left+1+mod;
ans%=mod;
}
}
cout<<ans;
}
| 0
| 42,255,563
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void solve() {
int H, W; cin >> H >> W;
string a;
vector<vector<string>> q(H, vector<string>(W));
vector<vector<string>> p(H, vector<string>(W));
vector<vector<string>> ans(H, vector<string>(W));
int height = 0;
bool flg = true;
for (int i = 0; i < H; ++i) {
cin >> a;
for (int j = 0; j < a.size(); ++j) {
q[i][j] = a[j];
}
int cnt = 0;
for (int j = 0; j < a.size(); ++j) {
if (a[j] == '.') cnt++;
}
if (cnt != W) {
for (int j = 0; j < a.size(); ++j) {
p[height][j] = a[j];
}
height++;
}
}
int max_height = height;
int width = 0;
for (int i = 0; i < W; ++i) {
int cnt = 0;
for (int j = 0; j < max_height; ++j) {
if (p[j][i] == ".") cnt++;
}
if (cnt != max_height) {
for (int j = 0; j < max_height; ++j) {
ans[j][width] = p[j][i];
}
width++;
}
}
int max_width = width;
if (max_height == 0 && max_width == 0) flg = false;
if (flg) {
for (int i = 0; i < max_height; ++i) {
for (int j = 0; j < max_width; ++j) {
cout << ans[i][j];
}
cout << endl;
}
} else {
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
cout << q[i][j];
}
cout << endl;
}
}
return;
}
int main() {
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair
#define GCD(x,y) __gcd(x,y)
#define lb lower_bound
#define up upper_bound
#define setp setprecision
#define bs binary_search
#define all(x) x.begin(),x.end()
#define LCM(x,y) ((x*y)/__gcd(x,y))
#define spc(x) cout<<fixed<<setp(x)
const long long inf = 1e18;
const long long cs = 200005;
const long long mod = 1000000007;
const double PI = 2 * acos(0.0);
void solve()
{
ll t,n,m,a,b,c,d,e,i,j,k,x,y,z,cnt=0,cnt1=0;
bool flag = false;
cin>>n;
lve v(n),v1;
for(auto &ss:v) cin>>ss;
x=v[0];
for(i=1;i<n;i++)
{
if(v[i]<=x) {cnt++;x=v[i];}
else
{
x=v[i];
v1.pb(cnt);
cnt=0;
}
}
v1.pb(cnt);
x=*max_element(all(v1));
cout<<x<<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
return 0;
}
| 0
| 18,172,572
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
int N, K; cin >> N >> K;
vector<LP> tmp;
rep(i, N){
ll t, d; cin >> t >> d;
t--;
tmp.push_back(make_pair(d, t));
}
sort(all(tmp));
reverse(all(tmp));
unordered_map<int, int> um;
vector<ll> y0, y1;
for(auto a: tmp){
if(um[a.second] == 0){
y1.push_back(a.first);
um[a.second] = 1;
}else{
y0.push_back(a.first);
}
}
ll res = 0;
int Y = max(0, K-(int)y0.size());
ll X = 0;
rep(i, Y) X += y1[i];
rep(i, K-Y) X += y0[i];
while(1){
res = max(res, X + (ll)Y*Y);
if(Y >= K || Y >= y1.size()) break;
X += y1[Y];
X -= y0[K-Y-1];
Y++;
}
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
#define int long long
#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define csl ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
int32_t main()
{
csl;
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
bool v[n];
for(int i=0;i<n;i++) v[i]=false;
int count=0;
int i=0;
while(true)
{
if(i==1)
{
break;
}
if(v[i]==false)
{
v[i]=true;
count++;
i = arr[i]-1;
}
else
{
count=-1;
break;
}
}
cout << count << "\n";
}
| 0
| 58,221,282
|
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
int main() {
FOR(i, 1, 10) FOR(j, 1, 10) printf("%dx%d=%d\n", i, j, i * j);
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
int main() {
vector<vector<int>> A(3, vector<int>(3));
REP(i, 3) {
REP(j, 3) { cin >> A[i][j]; }
}
vector<int>::iterator itr;
int N;
int b;
cin >> N;
REP(i, N) {
cin >> b;
REP(j, 3) {
itr = find(A[j].begin(), A[j].end(), b);
if (itr != A[j].end()) {
size_t idx = distance(A[j].begin(), itr);
A[j][idx] = 0;
}
}
}
REP(i, 3) {
int sum = accumulate(A[i].begin(), A[i].end(), 0);
if (sum == 0) {
cout << "Yes" << endl;
return 0;
}
}
REP(i, 3) {
int sum = A[0][i] + A[1][i] + A[2][i];
if (sum == 0) {
cout << "Yes" << endl;
return 0;
}
}
if (A[0][0] + A[1][1] + A[2][2] == 0) {
cout << "Yes" << endl;
return 0;
} else if (A[0][2] + A[1][1] + A[2][0] == 0) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
}
| 0
| 32,984,399
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = (long long) 1e9+7;
vector<ll> fac(2000001);
vector<ll> ifac(2000001);
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % M;
x = x*x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b){
if(a == 0 && b == 0)return 1;
if(a < b || a < 0 || b<0)return 0;
ll tmp = ifac[a-b]* ifac[b] % M;
return (tmp * fac[a]) % M;
}
int main()
{
fac[0] = 1;
ifac[0] = 1;
for(ll i = 0; i<2000000; i++){
fac[i+1] = fac[i]*(i+1) % M;
ifac[i+1] = ifac[i]*mpow(i+1, M-2) % M;
}
ll S;
cin >> S;
ll n = S/3ll;
ll ans=0ll;
for(int i=1; i<=n; i++){
ll Srest = S - 3ll * i;
ans += comb( Srest+i-1, i-1 )%M;
ans %= M;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
const double EPS = 1e-10;
int
main()
{
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
while (n--) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if (fabs((x2 - x1) * (y4 - y3) - (x4 - x3) * (y2 - y1)) < EPS)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
| 0
| 86,910,897
|
#include <iostream>
#include <bits/stdc++.h>
#define mod 1000000007
#define point complex<long long>
#define pi acos(-1)
#define pb push_back
typedef long long ll;
using namespace std;
void Fastio(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
double dis(int x1, int x2, int y1, int y2){
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
bool check(int x1, int x2, int x3, int x4, int y1, int y2, int y3, int y4){
double res1, res2, res3, res4;
res1=dis(x1, x2, y1, y2);
res2=dis(x2, x3, y2, y3);
res3=dis(x3, x4, y3, y4);
res4=dis(x4, x1, y4, y1);
double res5, res6;
res5=dis(x1, x3, y1, y3);
res6=dis(x2, x4, y2, y4);
return (res1==res2 && res1==res3 && res1==res4 && res5==res6 && (sqrt(2*res1*res1))==res5);
}
int main()
{
Fastio();
int ttt=1;
while(ttt--){
ll x1, x2, y1, y2;
cin>>x1>>y1>>x2>>y2;
int dx=x2-x1, dy=y2-y1;
cout<<x2-dy<<" "<<y2+dx<<" "<<x1-dy<<" "<<y1+dx<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for(auto &i: s){
if(i >= 'a' && i <= 'z') cout << (char)(i-'a'+'A');
else
if(i >= 'A' && i <= 'Z') cout << (char)(i-'A'+'a');
else cout << (char)i;
}
while(cin >> s){
cout << " ";
for(auto &i: s){
if(i >= 'a' && i <= 'z') cout << (char)(i-'a'+'A');
else
if(i >= 'A' && i <= 'Z') cout << (char)(i-'A'+'a');
else cout << (char)i;
}
}
cout << '\n';
return 0;
}
| 0
| 88,034,463
|
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
int main() {
string s[10];
s[1] = ".,!? ";
s[2] = "abc";
s[3] = "def";
s[4] = "ghi";
s[5] = "jkl";
s[6] = "mno";
s[7] = "pqrs";
s[8] = "tuv";
s[9] = "wxyz";
int T; cin >>T;
REP(t, T){
string str; cin >>str;
int num = -1, cnt = -1;
REP(i, str.length()){
int n = str[i] - '0';
if(n == 0){
if(cnt != -1){
cout <<s[num][cnt % (int)s[num].length()];
cnt = -1;
num = -1;
}
} else{
if(num == -1) num = n;
++cnt;
}
}
cout <<endl;
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
int fu[100020];
int dis[100020];
bool success;
int findfu(int i)
{
if (fu[fu[i]] == fu[i])
return fu[i];
int h = findfu(fu[i]);
dis[i] = dis[i] + dis[fu[i]];
fu[i] = h;
return fu[i];
}
int hebing(int a,int b,int d)
{
int fua = findfu(a);
int fub = findfu(b);
if (fua != fub)
{
fu[fub] = fua;
dis[fub] = dis[a] + d - dis[b];
}
else
{
if (dis[b] - dis[a] != d)
{
success =false;
}
}
}
int main()
{
int n,m;
while (cin >>n >>m)
{
success =true;
int l,r,d;
for (int i=0; i<100005; i++)
{
fu[i] =i;
dis[i] = 0;
}
for (int i=0; i<m; i++)
{
scanf("%d%d%d",&l,&r,&d);
hebing(l,r,d);
}
if (success)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
#ifdef VSCode
system("pause");
#endif
return 0;
}
| 0
| 43,955,369
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str;
ll k;
ll w,x;
cin>>str;
rep(i,str.length()/2){
if(str[i]!=str[str.length()-1-i]) f=1;
}
rep(i,str.length()/4){
if(str[i]!=str[str.length()-1-i]) f=1;
}
rep(i,str.length()/4){
if(str[i+str.length()/2+1]!=str[str.length()-1-i]) f=1;
}
if(f) No;
else Yes;
return 0;
}
|
#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
typedef long long ll;
const int MAXN=2e5+7;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
ll ans=0;
for(ll i=1;i*i<=n;++i)
{
if(n%i==0)
{
if(i<(n/i-1))
{
ans+=n/i-1;
}
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 69,760,406
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
ll x, t; cin >> x >> t;
if(x<t){
cout << 0 << endl;
}
else{
cout << x-t << endl;
}
return 0;
}
|
#include<map>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<stack>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())
#define vll vector<ll>
#define MEMSET(a, n, m) for(ll i=0;i<=n;i++) a[i] = m
#define BIT(n) (ll(1)<<n)
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define UNIQUE_ARRAY(a,n) n = unique(a + 1, a + x + 1) - a - 1
#define SORT(a,n) sort(a+1,a+n+1)
#define SORT_O(a,n,order) sort(a+1,a+n+1,order)
#define PER(i,y,x) for(ll i=y;i>=x;i--)
typedef long long ll;
using namespace std;
ll const MAX = 200005;
ll a[MAX];
vll G[MAX];
ll parent[MAX]={};
ll ord[MAX];
void bfs(ll n) {
queue<ll> qu;
qu.push(1);
parent[1] = 1;
ll cnt = 1;
while (!qu.empty()) {
ll cur = qu.front();
qu.pop();
ord[cnt] = cur;
cnt++;
REP(i, 0, SIZE(G[cur]) - 1) {
ll next = G[cur][i];
if (parent[next] != 0)continue;
parent[next] = cur;
qu.push(next);
}
}
}
bool judge(ll i, ll n) {
if (i != 1 && SIZE(G[i]) == 1) {
return true;
}
ll c = 0;
ll max_c = 0;
REP(j, 0, SIZE(G[i]) - 1) {
ll chi = G[i][j];
if (chi != parent[i]) {
c += a[chi];
max_c = max(max_c, a[chi]);
}
}
ll s, t;
s = c - a[i];
t = a[i] - s;
if (s < 0 || t < 0) return false;
if (s > min(c - max_c, c / 2)) return false;
a[i] = t;
return true;
}
int main() {
ll n;
cin >> n;
REP(i, 1, n) {
cin >> a[i];
}
REP(i, 1, n - 1) {
ll x, y;
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
ll orig = a[1];
bfs(n);
PER(i, n, 1) {
ll cur = ord[i];
if (!judge(cur, n)) {
cout << "NO" << endl;
return 0;
}
}
if (a[1] == 0 && G[1].size() != 1) {
cout << "YES" << endl;
}
else if (a[1] == orig && G[1].size() == 1) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| 0
| 75,526,014
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin>>N;
int k = 0;
int j = 0;
int a = 0;
for(int n = 1;n <= N;n++){
a = n;
while (a != 0){
a /= 10;
j++;
}
if(j % 2 == 1){
k++;
}
j = 0;
}
cout<<k<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=500000;
char s[N+9];
int n;
void into(){
scanf("%s",s+1);
n=strlen(s+1);
}
int a[N+9];
LL ans;
void Dfs_a0(int p,int v){
a[p]=max(a[p],v);
if (p>1&&s[p-1]=='>') Dfs_a0(p-1,v+1);
}
void Dfs_a1(int p,int v){
a[p]=max(a[p],v);
if (p<=n&&s[p]=='<') Dfs_a1(p+1,v+1);
}
void Get_ans(){
for (int i=1;i<=n+1;++i) a[i]=-1;
for (int i=1;i<=n+1;++i)
if ((i==1||s[i-1]=='>')&&(i==n+1||s[i]=='<')){
a[i]=0;
Dfs_a0(i-1,1);
Dfs_a1(i+1,1);
}
for (int i=1;i<=n+1;++i) ans+=a[i];
}
void work(){
Get_ans();
}
void outo(){
printf("%lld\n",ans);
}
int main(){
into();
work();
outo();
return 0;
}
| 0
| 22,946,231
|
#include <iostream>
#include <cstring>
using namespace std;
int main(){
int n;
int mode[101];
memset(mode,0,sizeof(mode));
int a = 0;
while(cin >> n){
mode[n]++;
a = max(a,mode[n]);
}
for(int i=0; i<101; i++){
if(mode[i] == a)
cout << i << endl;
}
return 0;
}
|
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k,n,i;
cin>>k>>n;
int a[n+2];
a[n+1]=k;
a[0]=0;
for(i=1;i<n+1;i++)
cin>>a[i];
int sum=0,mx=0,j=1,kk=0,l,h;
mx=a[1]-a[0]+a[n+1]-a[n];
for(i=1;i<n;i++)
{
mx=max(mx,a[i+1]-a[i]);
}
cout<<(k-mx);
}
| 0
| 44,046,085
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % 2 == 0 || b % 2 == 0) cout << "Even";
else cout << "Odd";
}
|
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(#x".in", "r", stdin),freopen(#x".out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef queue <pii> qii ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 100010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
template <class T> void chmin(T &a, T b) { if (a > b) a = b ; }
template <class T> void chmax(T &a, T b) { if (a < b) a = b ; }
template <class T> void upd(T &a, T b) { (a += b) %= MOD ; }
template <class T> void mul(T &a, T b) { a = (ll) a * b % MOD ; }
signed main(){
int a, b, c ; scanf("%d%d%d", &a, &b, &c) ;
if (a == b && b == c) PRINT("Yes") ;
else PRINT("No") ;
return 0 ;
}
| 0
| 6,867,415
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, m, d[maxn];
int main() {
cin >> n >> m;
for (int i = 1, u, v; i <= m; i++) {
cin >> u >> v;
d[u]++, d[v]++;
}
for (int i = 1; i <= n; i++) {
if (d[i] & 1) { cout << "NO" << endl; exit(0); }
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int> a, pair<int, int> b) {
return (a.second < b.second);
}
const int MAX = 200005;
const long long MOD = 1000000007;
const long long MODMOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
long long gcd(long long a, long long b) {
if(a % b == 0) return b;
else return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
map<int, int> count;
vector<int> d(n);
rep(i, n) {
cin >> d[i];
}
bool yes = true;
if(d[0] != 0) yes = false;
sort(d.begin(), d.end());
rep(i, n) {
count[d[i]]++;
}
if(count[0] != 1) yes = false;
if(!yes) {
cout << 0 << endl;
return 0;
}
long long lim = d[n-1];
long long ans = 1;
long long prev = 1;
for(int i=1;i<=lim;i++) {
rep(j, count[i]) {
ans *= prev;
ans %= MODMOD;
}
prev = count[i];
}
cout << ans << endl;
return 0;
}
| 0
| 47,750,513
|
#include <bits/stdc++.h>
using namespace std;
#define maxn -20000000000
#define mod 1000000007
#define md(x) (x) % mod;
#define sc scanf
#define pr printf
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ps push
#define prt(x) cout << (#x) << " is " << (x) << endl
#define EPS 1e-9
#define INF 1e16
#define INFd 1e9
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef vector<double> vd;
int main()
{
ll n;
cin>>n;
vector<ll> v(n);
for(ll i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
ll ind=lower_bound(v.begin(),v.end(),0LL)-v.begin();
ind=max(0LL,ind-1);
ll ans=v[ind];
vector<pair<ll,ll> > res;
ll i;
for(i=ind+1;i+1<n;i++)
{
res.pb({ans,v[i]});
ans=ans-v[i];
}
if(ind!=(n-1)){
res.pb({v[i],ans});
ans=v[i]-ans;}
for(i=0;i<ind;i++)
{
res.pb({ans,v[i]});
ans=ans-v[i];
}
cout<<ans<<endl;
for(auto j:res)
{
cout<<j.fi<<" "<<j.se<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
int s = 0;
for (int i=0; i<n; i++){
cin >> a[i];
s += a[i];
}
int ans = 0;
if (s % n == 0) {
int x = s/n;
for (int i: a){
ans += (x - i)*(x - i);
}
}
else {
int x1 = ceil((double) s/n);
int x2 = floor((double) s/n);
int ans1 = 0;
int ans2 = 0;
for (int i: a){
ans1 += (x1 - i)*(x1 - i);
ans2 += (x2 - i)*(x2 - i);
}
if (ans1 > ans2){
ans = ans2;
}
else{
ans = ans1;
}
}
cout << ans;
}
| 0
| 8,140,307
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
ll a,b;
cin >> a >> b;
ll ans = 0;
if(a>b){
ans = b;
rep(i, a-1){
b *= 10;
ans += b;
}
}
else{
ans = a;
rep(i, b-1){
a *= 10;
ans += a;
}
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr,mp) for(auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define debug(x) cout << #x << " = " << (x) << endl;
typedef pair<int,int> P;
typedef vector<vector<P>> Graph;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
vector<int> cnt(n,0);
int mx = 0;
REP(i,n){
cnt[a[i]]++;
mx = max(mx,a[i]);
}
bool f = true;
REP(i,mx+1){
if(i < (mx+1)/2){
if(cnt[i] != 0) f = false;
}
else if(i == (mx+1)/2){
if(mx % 2 == 0 && cnt[i] != 1) f = false;
if(mx % 2 == 1 && cnt[i] != 2) f = false;
}
else if(cnt[i] == 0) f = false;
}
if(f) cout << "Possible" << endl;
else cout << "Impossible" << endl;
return 0;
}
| 0
| 30,595,089
|
#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9;
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
signed main(){
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int N, M, V, P;
cin>>N>>M>>V>>P;
vector<Int> A(N);
cin>>A;
sort(A.begin(), A.end(), greater<Int>());
auto check = [&](Int x)->Int{
if(x <= P-1) return 1;
if(A[x] + M < A[P-1]) return 0;
Int v = V - (P + (N - 1 - x));
if(v <= 0) return 1;
Int cap = 0;
for(Int i=P - 1;i<x;i++) cap += min(M, A[x] + M - A[i]);
return cap >= v * M;
};
Int L = 0, R = N;
while(L + 1 < R){
Int M = (L + R) / 2;
check(M)? (L = M):(R = M);
}
Int ans = L + 1;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
ll modpow(ll a, ll n, const ll &MOD = MOD){
ll ret = n == 0 ? 1 : modpow(a, n/2, MOD);
(ret *= ret) %= MOD;
if(n%2)((ret *= a) %= MOD);
return ret;
}
ll modinv(ll d, const ll &MOD = MOD){
return modpow(d, MOD-2, MOD);
}
vector<ll> fac, finv, inv;
void COMinit(const int MAX = 5000000, const ll &MOD = MOD){
fac.resize(MAX);finv.resize(MAX);inv.resize(MAX);
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
repd(i,2,MAX){
fac[i] = fac[i-1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
ll COM(int n, int k){
if(n < k)return 0;
if(n < 0 || k < 0)return 0;
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}
int n, a[110000], ans;
queue<P> que;
signed main(){
cin>>n;rep(i,n)cin>>a[i];
sort(a, a+n);
repd(i,1,n-1){
if(a[i] >= 0){
que.push(P(a[0], a[i]));
a[0] -= a[i];
}else{
que.push(P(a[n-1], a[i]));
a[n-1] -= a[i];
}
}
que.push(P(a[n-1], a[0]));
a[n-1] -= a[0];
ans = a[n-1];
cout << ans << endl;
while(!que.empty()){
cout << que.front().first << " " << que.front().second << endl;
que.pop();
}
}
| 0
| 17,357,283
|
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
vector<string> ans(100);
for (int i = 0; i < 50; i++)
ans[i].resize(100, '#');
for (int i = 50; i < 100; i++)
ans[i].resize(100, '.');
int x = 0, y = 0;
for (int i = 0; i < a - 1; i++)
{
ans[y][x] = '.';
x += 2;
if (99 < x)
{
y += 2;
x = 0;
}
}
x = 0, y = 51;
for (int i = 0; i < b - 1; i++)
{
ans[y][x] = '#';
x += 2;
if (99 < x)
{
y += 2;
x = 0;
}
}
cout << 100 << " " << 100 << endl;
for (int i = 0; i < 100; i++)
cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(0);
struct S{
int a,b; S(){}S(int _a,int _b)
{ a=_a; b=_b; }
const bool operator<(const S &o) const{
return a<o.a;}
};
string exm;
inline void exf(void){ cout<<exm<<"\n"; exit(0); }
template <typename T>
inline void showAll(vector<T> &v,string sep=""){
for(T &here:v) cout<<here<<sep;}
template <typename T>
inline void showAll(T a[],int st,int end,string sep=""){
for(int i=st ; i<=end ; i++) cout<<a[i]<<sep; }
template <typename T>
inline void showAll(T a[],int x,int y,int z,int w,string p,string q){
for(int i=x ; i<=y ; i++){for(int j=z ; j<=w ; j++)
{cout<<a[i][j]<<p;}cout<<q;}}
template <typename T>
inline vector<int> int_seperation(T N,int d=10){
vector<int> v; while(N){v.push_back(N%d); N/=d;}
reverse(v.begin(),v.end()); return v; }
int main(){
int n,s; scanf("%d %d",&n,&s);
ll ans = 0;
for(int i=0 ; i<=n ; i++){
for(int j=i ; j<=n ; j++){
if(i+j+n<s) continue;
int k = s-i-j;
if(k<j) continue;
if(i==j && j==k) ans++;
else if(i==j || j==k || i==k) ans+=3;
else ans+=6;
}
}
printf("%lld\n",ans);
return 0;
}
| 0
| 96,028,855
|
#include<iostream>
#include<algorithm>
using namespace std;
static const int MIN = -1 * (1 << 21);
int main() {
int i, j, n, a, maxa, max_so_far, max_ending_here;
while (1) {
cin >> n;
if (n == 0)break;
max_so_far = 0;
max_ending_here = 0;
maxa = MIN;
for (i = 0; i < n; i++) {
cin >> a;
maxa = max(maxa, a);
max_ending_here = max_ending_here + a;
if (max_ending_here < 0)max_ending_here = 0;
if (max_so_far < max_ending_here)max_so_far = max_ending_here;
}
if (max_so_far == 0)max_so_far = maxa;
cout << max_so_far << endl;
}
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string s, t, save;
cin >> s;
reverse(s.begin(), s.end());
for(char &c : s){
save += c;
if(save=="maerd"||save=="remaerd"||save=="esare"||save=="resare"){
t += save;
save = "";
}
}
if(s == t) cout << "YES\n";
else cout << "NO\n";
return 0;
}
| 0
| 48,078,790
|
#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 <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
while(true){
int N, A, B, C, X; cin >> N >> A >> B >> C >> X; if(!N) break;
VI Y(N);
REP(i,N) cin >> Y[i];
vector<bool> used(C);
int cnt = 0;
REP(i,N){
fill(ALL(used), false);
if(i > 0){
X = (A*X + B) % C;
++cnt;
}
while(true){
if(X == Y[i]) break;
if(used[X]){
cnt = -1;
break;
}
used[X] = true;
X = (A*X + B) % C;
++cnt;
}
if(cnt < 0 || cnt > 10000){
cnt = -1;
break;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
int h, w;
cin >> h >> w;
char paint[h][w];
rep(i, h){
rep(j, w){
cin >> paint[i][j];
}
}
int x[4] = {0, 0, -1, 1};
int y[4] = {-1, 1, 0, 0};
int check;
int f = 0;
rep(i, h){
rep(j, w){
check = 0;
if (paint[i][j] == '#'){
rep(k, 4){
int nx = i + x[k], ny = j + y[k];
if(nx >= 0 && ny >= 0 && nx <= h && ny <= w && paint[nx][ny] == '#'){
check ++;
}
}
if (check == 0) f = 1;
}
}
}
if (f == 0) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 42,198,992
|
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<ll> A(N);
for (auto i = 0; i < N; ++i)
{
cin >> A[i];
}
auto sum = 0ll;
for (auto i = 0; i < N; ++i)
{
sum += A[i] / 2;
if (A[i] % 2 > 0
&& i < N - 1
&& A[i + 1] > 0)
{
++sum;
--A[i + 1];
}
}
cout << sum << endl;
return 0;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int N, K; cin >> N >> K; N++;
ll H[N]; F0R(i, N-1) cin >> H[i];
H[N-1] = 0;
ll dp[N+1][K+1];
F0R(i, N+1) F0R(j, K+1) {
dp[i][j] = 1000000000000;
}
dp[0][0] = 0;
FOR(i, 1, N+1) {
F0R(j, K+1) {
F0R(k, j+1) {
int pos = i - 1 - k;
if (pos < 0) break;
int dif = 0;
int lst = 0; if (pos != 0) lst = H[pos-1];
dp[i][j] = min(dp[i][j], dp[pos][j-k] + max(0ll, H[i-1] - lst));
}
}
}
ll ans = 1000000000000;
F0R(j, K+1) ans = min(ans, dp[N][j]);
cout << ans << endl;
return 0;
}
| 0
| 26,822,425
|
#include <bits/stdc++.h>
using namespace std;
char a[1 << 10][1 << 10];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int H, W; cin >> H >> W;
for (int i = 1; i <= H; i++) cin >> a[i];
for (int i = 1; i <= H * 2; i++) {
for (int j = 0; j < W; j++) cout << a[(i + 1) / 2][j];
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
string L; cin >> L;
int n = L.length();
vector<vector<ll> > memo(n, vector<ll>(2));
memo[0][0] = 1;
memo[0][1] = 2;
for (int i = 1; i < L.length(); i++) {
if (L[i] == '1') {
memo[i][0] = (memo[i-1][0] * 3 + memo[i-1][1]) % MOD;
memo[i][1] = (memo[i-1][1] * 2) % MOD;
} else {
memo[i][0] = (memo[i-1][0] * 3) % MOD;
memo[i][1] = memo[i-1][1];
}
}
cout << (memo[n-1][0] + memo[n-1][1]) % MOD << endl;
}
| 0
| 62,928,535
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
ll sub(ll n){
if(n<=0){
return -1;
}
else{
vector<ll> list(n+1);
rep(i,n+1){
if(i==0){
list.at(i) = 0;
}
else if(i==1){
list.at(i) = 1;
}
else{
list.at(i) = (list.at(i-1)+list.at(i-2))%MOD;
}
}
return list.at(n);
}
}
ll ans(vector<ll> v,ll m){
ll ans=1;
for(ll i = 0;i<m;i++){
if(i==0){
ans *= sub(v.at(i));
ans %= MOD;
}
else{
ans *= sub(v.at(i)-v.at(i-1)-1);
ans %= MOD;
}
if(ans < 0){
ans = 0;
}
}
return ans;
}
int main(){
ll N,M;
cin >> N >> M;
vector<ll> A(M);
rep(i,M){
cin >> A.at(i);
}
ll ANS = ans(A,M);
if(M!=0){
ANS *= sub(N-A.at(M-1));
}
else{
ANS*=sub(N+1);
}
cout << ANS%1000000007 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int H;
cin >> H;
vector<int> V(H);
for (int i = 0; i < H; i++) cin >> V[i];
for (int i = 1; i <= H; i++) {
cout << "node " << i << ": " << "key = " << V[i - 1] << ", ";
if (i != 1)
cout << "parent key = " << V[i/2 - 1] << ", ";
if (2 * i - 1< H)
cout << "left key = " << V[2 * i - 1] << ", ";
if (2 * i < H)
cout << "right key = " << V[2 * i] << ", ";
cout << endl;
}
return 0;
}
| 0
| 51,106,896
|
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long int;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF = 1e11;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
int main(){
int x,y;
cin >> x >> y;
PRINT(x+y/2);
}
|
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<stack>
#include<cassert>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define mem(x,y) memset(x,y,sizeof x)
#define sqr(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
const int INF=2e9;
const db eps=1e-12;
template<typename T>
inline void read(T &x) {
x=0; int f=1; char ch=getchar();
while( (ch<'0' || ch>'9') && ch!='-') ch=getchar(); if(ch=='-') {f=-1; ch=getchar();}
while(ch>='0' && ch <='9') x=x*10+ch-'0',ch=getchar();
x*=f;
}
const int N=100010;
ll d[N];
int n;
map<ll,int> key;
pli seq[N];
int fa[N],sz[N];
ll ret[N];
signed main() {
read(n);
for(int i=1;i<=n;i++) read(d[i]);
for(int i=1;i<=n;i++) key[d[i]]=i;
for(int i=1;i<=n;i++) seq[i]=mp(d[i],i);
sort(seq+1,seq+n+1); reverse(seq+1,seq+n+1);
for(int i=1;i<=n;i++) sz[i]=1;
for(int i=1;i<n;i++) {
int u=seq[i].S;
ll delta=d[u]+sz[u]-(n-sz[u]);
if(!key.count(delta)) {puts("-1"); return 0;}
fa[u]=key[delta];
sz[fa[u]]+=sz[u];
ret[fa[u]]+=ret[u]+sz[u];
}
if(seq[n].F!=ret[seq[n].S]) {
puts("-1"); return 0;
}
for(int i=1;i<=n;i++)
if(fa[i]) {printf("%d %d\n",i,fa[i]);}
return 0;
}
| 0
| 56,690,641
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef unsigned long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const int N = 1e5 + 2;
int A[N];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n; cin >> n;
for (int i = 0; i < n + n; i++) cin >> A[i];
sort(A, A + n + n);
int ans = 0;
for (int i = 0; i < n; i++) ans += A[i + i];
cout << ans << endl;
return 0;
}
|
#pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#define NPN(V) next_permutation(ALL(V))
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define yes(n) cout << ((n) ? "yes" : "no" ) << endl
#define Yay(n) cout << ((n) ? "Yay!": ":(") << endl
#define RAPID cin.tie(0);ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a,b,c) (a) < (b) && (b) < (c)
#define MIDe(a,b,c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a,b) cin >> a >> b
#define IN3(a,b,c) cin >> a >> b >> c
#define IN4(a,b,c,d) cin >> a >> b >> c >> d
#define VIN(V) for(int i = 0; i < (V).size(); i++) {cin >> (V).at(i);}
#define OUT(n) cout << n << endl
#define VOUT(V) REP(i, (V).size()) {cout << (V)[i] << endl;}
#define VOUT2(V) REP(i, (V).size()) {cout << (V)[i] << " ";} cout<<endl;
#define FIX cout << fixed << setprecision(15)
#define int long long
#define P pair<ll,ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll,ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue<ll,V,greater<ll>
template<class T> inline bool chmin(T& a, T b) {if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if(a<b){a=b;return true;}return false;}
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a,int b){return b != 0 ? gcd(b, a % b) : a;}
int lcm(int a, int b){return a * b / gcd(a, b);}
string toStrUp(string str){char diff = 'A'-'a';REP(i,str.size()) str[i] += diff;return str;}
string gCh(string str, int key){return str.substr(key,1);}
signed main() {
RAPID;
int n=0,m=0,a=0,b=0,c=0,d=0,x=0,y=0,z=0;
string s="",t="";
IN2(a,b);
OUT(a-b+1);
}
| 0
| 17,622,657
|
#include <cstdio>
using namespace std;
int main() {
char c;
unsigned int cnt = 0;
unsigned int max_cnt = 0;
for (int i=0;i<3;i++) {
scanf("%c", &c);
if (c == 'R') {
cnt++;
} else {
cnt = 0;
}
if (cnt > max_cnt)
max_cnt = cnt;
}
printf("%d\n", max_cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,sum;
int frac,minfrac = 10;
sum = 0;
for(int i=0;i<5;i++) {
cin >>a;
if(a%10) {
sum += (((a/10)+1)*10);
frac = a %10;
if(minfrac > frac) {
minfrac = frac;
}
} else {
sum += ((a/10)*10);
}
}
if(minfrac % 10){
sum = sum - 10 + minfrac;
}
cout << sum << endl;
return 0;
}
| 0
| 96,766,443
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n;
cin>>n;
int d[60];
rep(i,n){
cin>>d[i];
}
ll umee;
rep(j,n){
for(int k=j+1;k<n;k++)
umee+=d[j]*d[k];
}
cout<<umee<<endl;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
else if (n == 1) return p % m;
else if (n % 2 == 1) return p * pow_mod(p, n - 1, m) % m;
else {
ll tmp = pow_mod(p, n / 2, m);
return (tmp * tmp) % m;
}
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
ll com_mod(ll n, ll k, ll m) {
if (k == 0) return 1;
else {
ll x = 1;
ll y = 1;
for (ll i = 0; i < k; i++) {
x = (x * (n - i)) % m;
y = (y * (i + 1)) % m;
}
ll res = (x * pow_mod(y, m - 2, m)) % m;
return res;
}
}
int main() {
int a, b, c, d; cin >> a >> b >> c >> d;
if (abs(c - a) <= d || (abs(b - a) <=d && abs(c - b) <= d)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 47,640,581
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
vector<vector<bool>> cnt;
vector<vector<ll>> nextr;
void path(int s, int g) {
vector<int> path;
for (int cur = s; cur != g; cur = nextr[cur][g]) {
path.push_back(cur);
}
path.push_back(g);
repd(i, 1, path.size()) {
cnt[path[i - 1]][path[i]] = false;
}
}
int main()
{
int N, M;
cin >> N >> M;
vector<vector<ll>> d(N, vector<ll>(N, INF));
nextr = vector<vector<ll>>(N, vector<ll>(N, 0));
cnt = vector<vector<bool>>(N, vector<bool>(N, false));
rep(i, N) d[i][i] = 0;
rep(i, M) {
ll a, b, c;
cin >> a >> b >> c;
a--; b--;
d[a][b] = c;
d[b][a] = c;
cnt[a][b] = true;
cnt[b][a] = true;
}
rep(i, N) {
rep(j, N) {
nextr[i][j] = j;
}
}
rep(k, N) {
rep(i, N) {
rep(j, N) {
if (d[i][j] > d[i][k] + d[k][j]) {
d[i][j] = d[i][k] + d[k][j];
nextr[i][j] = nextr[i][k];
}
}
}
}
ll ans = 0;
rep(i, N) {
rep(j, N) {
if (i == j) continue;
path(i, j);
}
}
rep(i, N) {
rep(j, N) {
if (i == j) continue;
if (cnt[i][j]) ans++;
}
}
cout << ans / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n";
#define mset(a); memset(a,0,sizeof(a));
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
ll n,d;cin>>n>>d;
vector<vi>v(n);
for(int i=0;i<n;i++){
for(int j=0;j<d;j++){
ll a;cin>>a;
v[i].pb(a);
}
}
ll cnt=0;
for(int i=0;i<n;i++){
for(int k=i+1;k<i+n;k++){
ll sum=0;
for(int j=0;j<d;j++){
ll a=v[i][j]-v[(k)%n][j];
sum+=(a*a);
}
ll t=(ll)sqrt((ld)sum);
if(sqrt((ld)sum)==t)cnt++;
}
}
cout<<cnt/2<<"\n";
}
| 0
| 45,790,997
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long,long> pl;
typedef pair<ll,ll> pll;
typedef vector<long> vl;
typedef vector<bool> vb;
typedef vector<ll> vll;
typedef vector<vl> vvl;
typedef vector<vb> vvb;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef unordered_map<ll,ll> umll;
#define FOR(i,a,b) for(long long i=a;i<b;++i)
#define REV(i,a,b) for(long long i=a;i>=b;i--)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define tc ll tests;cin>>tests;while(tests--)
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define coutv(v) for(auto it: (v))cout<<it<<" ";newl;
#define cout2d(v) for(auto it: (v)) {for(auto j:it) cout<<j<<" ";newl;}
#define cinv(v,n) vll (v)(n);FOR(i,0,(n)){cin>>v[i];}
#define cinvg(v,n) (v).resize(n);FOR(i,0,(n)){cin>>v[i];}
#define cin2d(v,n,m) vvll (v)(n,vll(m,0));FOR(i,0,n){FOR(j,0,m){cin>>v[i][j];}}
#define cin2dg(v,n,m) (v).resize(n,vll(m));FOR(i,0,n){FOR(j,0,m){cin>>v[i][j];}}
#define newl cout<<"\n"
#define mod 1000000007
#define INF LLONG_MAX/2
vll nums;
umll pf;
void pfact(ll n)
{
while(n%2==0)
{
n/=2;
pf[2]++;
}
for(ll i=3;i*i<=n;i+=2)
{
while(n%i==0)
{
n/=i;
pf[i]++;
}
}
if(n!=1)
{
pf[n]++;
}
}
int main()
{
io;
FOR(i,1,50)
{
nums.pb((i*(i+1))/2);
}
ll n,cnt=0;
cin>>n;
if(n==1){cout<<0;return 0;}
pfact(n);
for(auto x: pf)
{
ll ind=ub(all(nums),x.S)-nums.begin();
cnt+=ind;
}
cout<<cnt;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;
int main() {
int n;
cin >> n;
string ss[9] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs"
,"tuv", "wxyz"};
while(n--) {
string s;
cin >> s;
char n = '*';
int ct = 0;
REP(i,s.size()) {
if (s[i] == '0') {
if (ct > 0) {
cout << ss[n-'1'][(ct-1) % ss[n-'1'].size()];
}
ct = 0; n = '*';
} else if (s[i] != n) {
n = s[i];
ct = 1;
} else {
++ct;
}
}
cout << endl;
}
}
| 0
| 41,992,468
|
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
#define endl '\n'
const int N = 3*1e5+5;
set<pii> s;
int r[N], c[N];
vector<pii> R, L;
bool cmp(pii a, pii b){
return a.fi > b.fi;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int h, w, m, a, b; cin >>h >>w >>m;
for(int i = 0; i<m; i++){
cin >>a >>b;
r[a]++; c[b]++;
s.insert({a, b});
}
for(int i = 1; i<=h; i++){
R.push_back({r[i], i});
}
for(int i = 1; i<=w; i++){
L.push_back({c[i], i});
}
sort(R.begin(), R.end(), cmp);
sort(L.begin(), L.end(), cmp);
int ans = R[0].fi + L[0].fi - s.count({R[0].se, L[0].se});
for(int i = 0; i<h; i++){
for(int j = 0; j<w; j++){
if(R[i].fi + L[j].fi > ans){
ans = max(ans, R[i].fi + L[j].fi - (int) s.count({R[i].se, L[j].se}));
}
else break;
}
}
cout <<ans <<endl;
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAX_W (100000L)
#define MAX_H (100000L)
#define INF (1000000000L)
using namespace std;
int main(int argc, char *argv[]) {
long W, H, ps[MAX_W + 1], qs[MAX_H + 1];
scanf("%ld %ld", &W, &H);
for (int i = 0; i < W; i++) {
scanf("%ld", &ps[i]);
}
for (int j = 0; j < H; j++) {
scanf("%ld", &qs[j]);
}
ps[W] = INF;
qs[H] = INF;
sort(ps, ps + W + 1);
sort(qs, qs + H + 1);
long ans = 0, m = 0, n = 0;
while (m < W || n < H) {
const long p = ps[m], q = qs[n];
if (p < q) {
ans += p * (H + 1 - n);
m++;
} else {
ans += q * (W + 1 - m);
n++;
}
}
printf("%ld\n", ans);
return 0;
}
| 0
| 4,314,925
|
#include<bits/stdc++.h>
#define fo(i,a,b) for(int i= a ; i < b ; ++i)
#define rep(i,n) fo(i,0,n)
#define pln(n) printf("%lld\n",n)
#define sll(n) scanf("%lld",&n)
#define ss(n) scanf("%s",n)
#define vi vector < int >
#define pii pair < int , int >
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define dbg(x) { cout<< #x << ": " << (x) << endl; }
#define dbg2(x,y) { cout<< #x << ": " << (x) << " , " << #y << ": " << (y) << endl; }
#define dbg3(x,y,z) { cout<< #x << ": " << (x) << " , " << #y << ": " << (y) <<" , "<< #z <<": "<<(z)<<endl; }
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define vll vector<long long>
#define vvi vector<vector<int>>
#define si set<int>
#define tr(c, it) \
for(decltype(c.begin()) it = c.begin(); it!= c.end(); it++)
#define pis pair<int,string>
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c),x) != c.end())
#define mod (int)(1e9 + 7)
using namespace std;
int main(){
int m, t, s;
cin >> m >> t >> s;
float t1 = (float)m / s;
if(t - t1 >= -0.000001){
cout << "Yes";
}
else cout << "No";
}
|
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<long long,long long> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long nCr(long long n, long long r) {
long long A = 1, B = 1;
for (long long i = n - r + 1; i <= n; i++) {
A = A * i % MOD;
}
for (long long i = 1; i <= r; i++) {
B = B * i % MOD;
}
B = mod_pow(B, MOD - 2);
B %= MOD;
return (A * B) % MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
bool ok(long long key,long long index){
if(index > key) return true;
else if(index <= key) return false;
}
long long binary_search(long long key,long long size){
long long left = -1,right = size;
while(right - left > 1){
long long mid = left + (right-left)/2;
long long hantei = ok(key,mid);
if(hantei) right = mid;
else left = mid;
}
if(left == -1)return 0;
return left;
}
int main() {
string S;cin >> S;
int X = 0;
for(int i = 0;i<S.size();i++){
if(S.at(i) == 'x') X++;
}
if(X >= 8)cout << "NO" << endl;
else cout << "YES" << endl;
}
| 0
| 34,751,965
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
string s; cin >> s;
ll k; cin >> k;
for(int i = 0; i < (int)s.size(); i++){
if(s[i] == '1' && i == k - 1){
cout << 1 << endl;
return 0;
}
if(s[i] != '1'){
cout << s[i] << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int m;
ll ans, sum;
ll count(ll digit, ll times) {
if (times == 1) return digit;
else {
ll tmp = digit * 2, moves = 1;
if (tmp >= 10) {
++moves;
tmp = tmp % 10 + 1;
}
ans += (times / 2) * moves;
ll res = count(tmp, times / 2);
if (times % 2) {
tmp = digit + res, moves = 1;
if (tmp >= 10) {
++moves;
tmp = tmp % 10 + 1;
}
ans += moves;
res = tmp;
}
return res;
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> m;
for (int i = 0; i < m; ++i) {
ll d, c;
cin >> d >> c;
if (sum) ++ans;
sum += count(d, c);
if (sum >= 10) {
sum = sum % 10 + 1;
++ans;
}
}
cout << ans;
}
| 0
| 71,803,771
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j,k
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(),a.end())
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll ans=0;llfor;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
cout<<min(A,B)+min(C,D);
return 0;}
|
#include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define INF 10000000000000000LL
#define ll long long
const int inf =INT_MAX;
const int MAX=3e5+9;
const ll MOD=1e9+7;
const int TOT_PRIMES=1e6+9;
const int MAX_A=71;
const int LN=20;
using namespace std;
int main(){
string s, t;
cin >> s >> t;
int n = s.size();
while(n--){
rotate(s.rbegin(), s.rbegin()+1, s.rend());
if(s == t){
cout << "Yes" << "\n";
return 0;
}
}
cout << "No" << "\n";
return 0;
}
| 0
| 85,033,583
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
int dp[110][4][2];
string S;
int calc(int x, int k, int smaller) {
if(k < 0) return 0;
if(x < 0 && k == 0) return 1;
else if(x < 0 && k != 0) return 0;
if(dp[x][k][smaller] != -1) return dp[x][k][smaller];
if(smaller) {
return dp[x][k][smaller] = calc(x - 1, k, smaller) + calc(x - 1, k - 1, smaller) * 9;
} else {
if(S[x] == '0')
return dp[x][k][smaller] = calc(x - 1, k, 0);
else
return dp[x][k][smaller] = calc(x - 1, k - 1, 0) + calc(x - 1, k - 1, 1) * (S[x] - '0' - 1) + calc(x - 1, k, 1);
}
return -1;
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> S;
reverse(S.begin(), S.end());
int K; cin >> K;
rep(i, 110) rep(k, 4) rep(j, 2) dp[i][k][j] = -1;
cout << calc((int)S.length() - 1, K, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define forr(i, b, e) for(ll i = b; i < e; i++)
#define forite(i, b, e) for(auto i = b; i!=e; i++)
#define forg(i, b, e, m) for(ll i = b; i < e; i+=m)
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int INF = ll(1e9+7);
#define tam 320000
#define tamlog 61
#define ptr nodo*
typedef pair<ii,ll> iii;
bool say[tam],resp[tam];
int main()
{
int n;
cin>>n;
string txt;
cin>>txt;
forr(i,0,n)
{
if (txt[i]!='o')
say[i]=1;
else
say[i]=0;
}
forr(j,0,4)
{
resp[0]=j&1;
resp[1]=j&2;
bool valcond=(resp[0]^say[0])^resp[1];
forr(i,2,n)
{
bool valsay=(resp[i-1]^(say[i-1]))^resp[i-2];
resp[i]=valsay;
}
if (resp[n-1]==valcond && resp[n-1]^say[n-1]==resp[0]^resp[n-2])
{
forr(i,0,n)
{
if (resp[i]==0)
cout<<"S";
else
cout<<"W";
}
return 0;
}
}
cout<<"-1\n";
}
| 0
| 68,556,480
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitset>
#include <cassert>
#include <map>
#include <set>
#include <cassert>
#include <iomanip>
#include <random>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
#define __FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define __FileRead freopen ("input.txt", "r", stdin)
#define __FileWrite freopen ("output.txt", "w", stdout)
#define SET(a,v) memset(a,v,sizeof(a))
#define SZ(v) (int)v.size()
#define pii pair<int,int>
#define pil pair <int, ll>
#define pli pair <ll, int>
#define pll pair <ll, ll>
#define debug cout <<"######\n"
#define debug1(x) cout <<"### " << x << " ###\n"
#define debug2(x,y) cout <<"# " << x <<" : "<< y <<" #\n"
#define nl cout << "\n";
#define sp cout << " ";
#define sl(n) scanf("%lld", &n)
#define sf(n) scanf("%lf", &n)
#define si(n) scanf("%d", &n)
#define ss(n) scanf("%s", n)
#define pf(n) scanf("%d", n)
#define pfl(n) scanf("%lld", n)
#define all(v) v.begin(), v.end()
#define rall(v) v.begin(), v.end()
#define srt(v) sort(v.begin(), v.end())
#define r_srt(v) sort(v.rbegin(), v.rend())
#define rev(v) reverse(v.rbegin(), v.rend())
#define Sqr(x) ((x)*(x))
#define Mod(x, m) ((((x) % (m)) + (m)) % (m))
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define MAX 100005
#define INF 1000000009
#define MOD 1000000007
template<class T>
using min_heap = priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename T> string toString ( T Number ) {
stringstream ss;
ss << Number;
return ss.str();
}
template<typename T> int toInt (T str) {
stringstream ss;
ss << str;
int num;
ss >> num;
return num;
}
ll lcm ( ll a, ll b ) {
return ( a / __gcd ( a, b ) ) * b;
}
int main () {
__FastIO;
int n;
cin >> n;
vector<int>vec (n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
int cnt = 1;
for (int i = 1; i < n; i++) {
bool f = 0;
for (int j = 0; j < i; j++) {
if (vec[j] > vec[i]) f = 1;
}
if (!f) cnt++;
}
cout << cnt << "\n";
return 0;
}
|
#include<iostream>
using namespace std;
bool check(int n, int maxi){
for (int i = maxi; i > 0; i--) {
if(n >= i){
n -= i;
}
}
return (n == 0);
}
int main(){
int n;
std::cin >> n;
int l = 0, r = n, mid = (r + l)/2;
while(r - l > 1){
if(check(n, mid)){
r = mid;
}else{
l = mid;
}
mid = (l + r)/2;
}
for (int i = r; i > 0; i--) {
if(n >= i){
std::cout << i << std::endl;
n -= i;
}
}
return 0;
}
| 0
| 12,384,057
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
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 exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll w, h;
cin >> w >> h;
vector<P> v;
rep(i, w) {
ll p;
cin >> p;
v.pb(make_pair(p, 1));
}
rep(i, h) {
ll q;
cin >> q;
v.pb(make_pair(q, 2));
}
sort(all(v));
ll tate = h+1;
ll yoko = w+1;
ll ans = 0;
rep(i, h+w) {
if(v[i].second == 1) {
ans += v[i].first*tate;
yoko--;
}
else {
ans += v[i].first*yoko;
tate--;
}
}
out(ans);
re0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(n) cout << ( (n) ? "YES":"NO") << endl;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
int main(void)
{
IOS
int n; cin >> n;
map<int,int> m;
REP(i,n) {
int x;
cin >> x;
m[x]++;
}
priority_queue<int> pq;
for(auto p:m) {
pq.push(p.second);
}
while(pq.top() != 1) {
int t = pq.top(); pq.pop();
if (t > 2) {
t = t % 2 == 0 ? 2 : 1;
pq.push(t);
} else {
int s = pq.top(); pq.pop();
if (s == 2) {
REP(i,2) pq.push(1);
} else pq.push(1);
}
}
cout << pq.size() << endl;
return 0;
}
| 0
| 51,916,702
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T &t)
{
t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &... rest)
{
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &... rest)
{
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
template <class T>
T GCD(T a, T b)
{
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
bool yes = 0;
bool boo = 0;
int maxx = -100000, minn = 100000;
int sum = 0;
int ans = 0;
signed main()
{
int A[3][3];
rep(i, 3)
rep(j, 3)
cin >>
A[i][j];
VAR(int, N);
while (N--)
{
VAR(int, b);
rep(i, 3)
rep(j, 3) if (A[i][j] == b)
A[i][j] = 0;
}
rep(i, 3)
{
bool ok = true;
rep(j, 3) if (A[i][j])
ok = false;
if (ok)
{
Yes();
return 0;
}
}
rep(i, 3)
{
bool ok = true;
rep(j, 3) if (A[j][i])
ok = false;
if (ok)
{
Yes();
return 0;
}
}
if (!A[0][0] && !A[1][1] && !A[2][2])
{
Yes();
return 0;
}
if (!A[0][2] && !A[1][1] && !A[2][0])
{
Yes();
return 0;
}
No();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> P;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 200000;
ll N, M;
struct Edge {
ll to;
ll weight;
ll next;
};
vector<Edge> edges(MAXN);
vector<int> head(MAXN, -1);
vector<int> matchingx(MAXN, -1);
vector<int> matchingy(MAXN, -1);
vector<bool> check(MAXN);
vector<int> dis(MAXN);
vector<bool> vis(MAXN, false);
ll cnt = 1;
void addEdge(ll from, ll to, ll weight) {
edges[cnt].to = to;
edges[cnt].weight = weight;
edges[cnt].next = head[from];
head[from] = cnt++;
}
void dijkstra(const ll s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(dis.begin(), dis.end(), INF);
dis[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int u = p.second;
if (dis[u] < p.first) continue;
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (dis[v] > dis[u] + edges[i].weight) {
dis[v] = dis[u] + edges[i].weight;
que.push(P(dis[v], v));
}
}
}
}
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
int main() {
cin >> N;
for (int i = 1; i < N; ++i) {
if (i == N - 1) {
addEdge(i, 0, 1);
} else {
addEdge(i, i + 1, 1);
}
}
for (int i = 1; i < N; ++i) {
addEdge(i, i * 10 % N, 0);
}
dijkstra(1);
cout << 1 + dis[0] << endl;
return 0;
}
| 0
| 16,390,657
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (auto itr = s.rbegin(); itr != s.rend(); itr++) {
cout << *itr;
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
class Dice
{
private:
vector<int> dice;
public : Dice(vector<int> num) {
for (int i = 0; i < (int)num.size(); ++i) {
dice.push_back(num.at(i));
}
}
int getDiceRightNum(int top, int forward) {
int right = 0;
for(int i = 0; i < (int)dice.size(); ++i){
for(int j = 0; j < (int)dice.size(); ++j){
if (dice.at(i) == top && dice.at(j) == forward) {
if(i == 0 && j == 1) right = dice.at(2);
if(i == 0 && j == 2) right = dice.at(4);
if(i == 0 && j == 4) right = dice.at(3);
if(i == 0 && j == 3) right = dice.at(1);
if(i == 1 && j == 0) right = dice.at(3);
if(i == 1 && j == 3) right = dice.at(5);
if(i == 1 && j == 5) right = dice.at(2);
if(i == 1 && j == 2) right = dice.at(0);
if(i == 2 && j == 0) right = dice.at(1);
if(i == 2 && j == 1) right = dice.at(5);
if(i == 2 && j == 5) right = dice.at(4);
if(i == 2 && j == 4) right = dice.at(0);
if(i == 3 && j == 0) right = dice.at(4);
if(i == 3 && j == 4) right = dice.at(5);
if(i == 3 && j == 5) right = dice.at(1);
if(i == 3 && j == 1) right = dice.at(0);
if(i == 4 && j == 0) right = dice.at(2);
if(i == 4 && j == 2) right = dice.at(5);
if(i == 4 && j == 5) right = dice.at(3);
if(i == 4 && j == 3) right = dice.at(0);
if(i == 5 && j == 1) right = dice.at(3);
if(i == 5 && j == 3) right = dice.at(4);
if(i == 5 && j == 4) right = dice.at(2);
if(i == 5 && j == 2) right = dice.at(1);
}
}
}
return right;
}
};
int main(int argc, char *argv[])
{
vector<int> num(6);
int q, a, b;
for(int i = 0; i < 6; ++i){
cin >> num.at(i);
}
Dice dice(num);
cin >> q;
for (int j = 0; j < q; ++j) {
cin >> a >> b;
cout << dice.getDiceRightNum(a, b) << endl;
}
return 0;
}
| 0
| 69,616,142
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int x;
cin >> x;
if (x < 1200) {
cout << "ABC" << '\n';
} else {
cout << "ARC" << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
bool ifprime(int x){
if(x==1)return false;
if(x==2)return true;
if(x%2==0)return false;
for(int i=2;i*i<=x;i++){if(x%i==0)return false;}
return true;
}
ll mod(ll x, ll y){if(x>=0||x%y==0) return x%y;return y+x%y;}
ll dv0(ll x, ll y){if(x>=0||x%y==0)return x/y;return x/y-1;}
ll dv1(ll x, ll y){if(x%y==0) return dv0(x,y);return dv0(x,y)+1;}
int main(){
int N=in();
string S;
int a=0, b=0, c=0;
int cnt=0;
rep(i, N){
cin>>S;
rep(j, S.size()-1){
if(S.at(j)=='A'&&S.at(j+1)=='B'){
cnt++;
}
}
if(S.at(0)=='B'&&S.at(S.size()-1)=='A'){
c+=1;
}
else if(S.at(S.size()-1)=='A'){
a+=1;
}
else if(S.at(0)=='B'){
b+=1;
}
}
if(a>0||b>0||c==0){
cout<<cnt+c+min(a, b)<<endl;
}
else if(c>0){
cout<<cnt+c-1<<endl;
}
}
| 0
| 8,770,113
|
#include<bits/stdc++.h>
#define endl '\n';
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int N,K;
cin >> N >> K;
if((N-1)*(N-2)/2 < K){
cout << -1 << endl;
return 0;
}
vector<P> ans;
for(int i=2; i<=N; i++){
ans.emplace_back(1,i);
}
int vi=2,vj=3;
for(int i=0; i<(N-1)*(N-2)/2-K; i++){
ans.emplace_back(vi,vj);
if(vj == N){
vi++;
vj = vi;
}
vj++;
}
cout << ans.size() << endl;
for(int i=0; i<ans.size(); i++){
cout << ans[i].first << " " << ans[i].second << endl;
}
return 0;
}
|
#include<stdio.h>
#include<math.h>
int main(void)
{
double s,d,f,g,h,j,i,k,a,b,C,za;
scanf("%lf %lf %lf",&a,&b,&C);
k=0.5;
za=3.1415926535;
C=za/180*C;
g=k*a*b*sin(C);
f=a+b+(sqrt((a*a+b*b)-(2*a*b*cos(C))));
h=b*sin(C);
printf("%lf\n%lf\n%lf\n",g,f,h);
return 0;
}
| 0
| 18,263,941
|
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
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; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
int main(void){
int N, K; cin >> N >> K;
vector<int> a;
rep(i, N){
int t; cin >> t;
if(t<K) a.push_back(t);
}
sort(a.begin(), a.end());
N=a.size();
vector<vector<bool>> dpl(N+5, vector<bool>(K+5, false)), dpr(N+5, vector<bool>(K+5, false));
dpl[0][0]=true;
rep(i, N) rep(j, K+1){
dpl[i+1][j] = dpl[i+1][j] | dpl[i][j];
if(j-a[i]>=0) dpl[i+1][j] = dpl[i+1][j] | dpl[i][j-a[i]];
}
dpr[N+1][0]=true;
reprev(i, N) rep(j, K+1){
dpr[i+1][j] = dpr[i+1][j] | dpr[i+2][j];
if(j-a[i]>=0) dpr[i+1][j] = dpr[i+1][j] | dpr[i+2][j-a[i]];
}
int ans=0;
repr(i, 1, N+1){
vector<int> L, R;
rep(j, K+1){
if(dpl[i-1][j]) L.push_back(j);
if(dpr[i+1][j]) R.push_back(j);
}
bool flg=true;
rep(j, (int)L.size()){
int left=L[j];
if( lower_bound(R.begin(), R.end(), K-left) - lower_bound(R.begin(), R.end(), K-a[i-1]-left) > 0 ){
flg=false; break;
}
}
if(flg) ++ans;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(3, vector<int>(n));
for (int t = 0; t < n; t++) cin >> a[0][t] >> a[1][t] >> a[2][t];
vector<vector<int>> dp(3, vector<int>(n, numeric_limits<int>::min()));
dp[0][0] = a[0][0];
dp[1][0] = a[1][0];
dp[2][0] = a[2][0];
for (int t = 1; t < n; t++) {
for (int s = 0; s < 3; s++) {
for (int r = 0; r < 3; r++) {
if (s == r) continue;
dp[s][t] = max(dp[s][t], dp[r][t - 1] + a[s][t]);
}
}
}
cout << max(dp[0][n - 1], max(dp[1][n - 1], dp[2][n - 1]));
return 0;
}
| 0
| 69,640,395
|
#include <iostream>
#include <numeric>
int main(){
int n, x;
std::cin >> n >> x;
int ans = 0;
for (int i = 0; i < n; i++)
{
int x_;
std::cin >> x_;
x_ = abs(x - x_);
ans = std::gcd(ans, x_);
}
std::cout << ans << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d;
string s1,s2;
cin>>s1>>s2;k=0;j=0;
for(i=0;i<s1.size()+s2.size();i++){
if(k<s1.size()){cout<<s1[k++];}
if(j<s2.size()){
cout<<s2[j++];i++;
}
}
return EXIT_SUCCESS;
}
| 0
| 36,060,418
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, P,Q;
cin >> N >> K;
P=1;
Q=1;
while(N-Q>=0){
if(P<K){
P=P*2;
Q++;
}
else if(P>=K){
P=P+K;
Q++;
}
}
cout << P << endl;
}
|
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; 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; }
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
ll cnt[26];
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
string s;
cin >> s;
int n = s.size();
for(int i=0;i<n;i++){
int x = s[i] - 'a';
cnt[x]++;
}
ll ans = 1;
for(int i=0;i<26;i++){
if(cnt[i]){
ans += ((n - cnt[i]) * cnt[i]);
}
}
cout << ans/2 + 1 << endl;
}
| 0
| 58,902,001
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
vector<int> d(N, 0);
int recover = 0;
for (auto &x: d) cin >> x;
for (size_t i=0; i<d.size(); i++) {
for (size_t j=(i+1); j<d.size(); j++) {
recover += d[i] * d[j];
}
}
cout << recover << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> a(n), num(n + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
num[a[i]]++;
}
ll sum = 0;
for (ll i = 0; i <= n; i++) {
sum += num[i] * (num[i] - 1) / 2;
}
for (ll i = 0; i < n; i++) {
ll tmp = 0;
tmp += sum;
tmp -= num[a[i]] * (num[a[i]] - 1) / 2;
tmp += (num[a[i]] - 1) * (num[a[i]] - 2) / 2;
cout << tmp << endl;
}
return 0;
}
| 0
| 20,288,372
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
using namespace std;
const int num1 = 1046527;
const int num2 = 13;
char c[num1][num2];
inline int getInt(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
return 0;
}
inline int getKey(char str[]) {
int p = 1, sum = 0;
for (int i = 0; i < strlen(str); i++) {
sum += p*getInt(str[i]);
p *= 5;
}
return sum;
}
int h1(int key) { return key % num1; }
int h2(int key) { return 1 + key % (num1 - 1); }
inline int insert(char str[]) {
int i, key = getKey(str);
for (i = 0; ; i++) {
int h = (h1(key) + i*h2(key)) % num1;
if (strcmp(c[h], str) == 0) return 1;
else if (strlen(c[h]) == 0) {
strcpy(c[h], str);
return 0;
}
}
return 0;
}
inline int find(char str[]) {
int i;
int sum = 0, key = getKey(str);
for (i = 0; ; i++) {
int h = (h1(key) + i*h2(key)) % num1;
if (strcmp(c[h], str) == 0) return 1;
else if (strlen(c[h]) == 0) return 0;
}
return 0;
}
int main() {
int n;
char com[9], str[num2];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> com >> str;
if (com[0] == 'i')
insert(str);
else {
if (find(str))
cout << "yes" << endl;
else cout << "no" << endl;
}
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
#include <numeric>
using namespace std;
using ll = long long;
#define rep_init(i, init, n) for(int i = (init); i < (n); ++i)
#define rep(i, n) rep_init(i, 0, n)
int main()
{
int N, M;
cin >> N >> M;
vector<vector<bool>> edges(N, vector<bool>(N, false));
rep(i, M)
{
int a, b;
cin >> a >> b;
--a; --b;
edges[a][b] = true;
edges[b][a] = true;
}
vector<int> indices;
for (int i = 1; i < N; ++i)
{
indices.push_back(i);
}
int ans = 0;
do {
int index = 0;
bool isSatisfied = true;
rep(i, indices.size())
{
if (!edges[index][indices[i]])
{
isSatisfied = false;
break;
}
index = indices[i];
}
if (isSatisfied) ++ans;
} while (next_permutation(indices.begin(), indices.end()));
cout << ans << endl;
}
| 0
| 76,624,444
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int count=0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='o') count++;
}
if(15-s.size()+count>=8) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
|
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
vector< vector<int> > G(10001);
queue<int> que;
int n_v, n_e, u, v;
int in_degree[10001], ans[10001], idx;
int main(){
memset(in_degree, 0, sizeof(in_degree));
scanf("%d %d", &n_v, &n_e);
for(int i=0; i<n_e; i++){
scanf("%d %d", &u, &v);
G[u].push_back(v);
in_degree[v] += 1;
}
idx = 0;
for(int i=0; i<n_v; i++)
if(in_degree[i]==0){
ans[idx++] = i;
que.push(i);
}
while(!que.empty()){
u = que.front();
que.pop();
for(int i=0; i<G[u].size(); i++){
v = G[u][i];
in_degree[v] -= 1;
if(in_degree[v]==0){
ans[idx++] = v;
que.push(v);
}
}
}
for(int i=0; i<n_v; i++)
printf("%d\n", ans[i]);
return 0;
}
| 0
| 51,714,088
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
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;
}
void divisor(ll n,map<ll,ll>&mp){
for(long long i = 1; i * i <= n; i++) {
if(n%i==0){
mp[i]++;
if (!(i * i == n)) mp[n / i]++;
}
}
return;
}
int main(){
ll n;
cin >> n;
map<ll, ll> mp;
divisor(n,mp);
ll ans = 0;
for (auto i:mp){
if (i.first == 1) continue;
ll t = i.first;
t--;
if (n / t == n % t) ans += t;
}
cout << ans << 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 head(int base, int k) {
int dst = 0;
while(base < k) {
base *= 2;
dst++;
}
return dst;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> heads(n);
ll sum = 0;
int p = head(1,k);
rep(i,n) sum += 1<<(p-head(i+1,k));
ll d = (1<<p) * n;
cout << std::fixed << std::setprecision(15) << (double) sum/d << endl;
return 0;
}
| 0
| 40,343,925
|
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define RFOR(i,a,b) for(int i = (int)(b-1);i>=(int)(a);--i)
#define REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr,mp) for(auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int,int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout.precision(20);
stack<char> stack;
int ans = 0;
string s;
cin >> s;
stack.push(s[0]);
FOR(i, 1, s.length()){
if(!stack.empty()) {
if (stack.top() == s[i]) {
stack.push(s[i]);
} else if (stack.top() != s[i]) {
ans += 2;
stack.pop();
}
}
else{
stack.push(s[i]);
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
long long cnt=1;
long long n;cin>>n;
for(int i=1;i<=n;i++){
cnt*=i;
}
cout<<cnt<<endl;
}
| 0
| 15,607,358
|
#include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i,n) for(long long i=1;i<=(long long)(n);i++)
#define all(v) v.begin(),v.end()
#define Sort(v) sort(all(v))
#define Reverse(v) reverse(all(v))
#define Rsort(v) sort(all(v),greater)
#define pub(v) push_back(v)
#define pob(v) pop_back(v)
typedef long long ll;
typedef vector<ll> vel;
typedef vector<vector<ll>> vel2d;
typedef string str;
typedef pair<ll,ll> pal;
typedef vector<str> ves;
typedef vector<char> vech;
int main() {
ll H,W;cin>>H>>W;
vector<vector<char>> data(H,vech(W)),data2(2*H,vech(W));rep0(i,H){rep0(j,W){cin>>data[i][j];}}
rep0(i,2*H){
rep0(j,W){
cout<<data[i/2][j];
}
cout<<endl;
}
}
|
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
int main(){
ll n;cin>>n;
vector<ll>a(n);
rep(i,n)cin>>a[i];
sort(all(a));
if(n==2){
cout<<a[1]-a[0]<<endl;
cout<<a[1]<<' '<<a[0]<<endl;
return 0;
}
if(a[n-1]<=0){
ll m=0;
rep(i,n-1){
m+=abs(a[i]);
}
m-=abs(a[n-1]);
cout<<m<<endl;
cout<<a[n-1]<<' '<<a[0]<<endl;
ll s=a[n-1]-a[0];
REP(i,1,n-1){
cout<<s<<' '<<a[i]<<endl;
s-=a[i];
}
}else if(a[0]>=0){
ll m=0;
REP(i,1,n){
m+=a[i];
}
m-=a[0];
cout<<m<<endl;
ll s=a[0]-a[n-1];
cout<<a[0]<<' '<<a[n-1]<<endl;
ll p=a[n-2];
REP(i,1,n-2){
if(a[i]<=0){
cout<<p<<' '<<a[i]<<endl;
p-=a[i];
}else{
cout<<s<<' '<<a[i]<<endl;
s-=a[i];
}
}
cout<<p<<' '<<s<<endl;
}else{
ll m=0;
rep(i,n){
m+=abs(a[i]);
}
cout<<m<<endl;
ll s=a[0];
ll p=a[n-1];
REP(i,1,n-1){
if(a[i]<=0){
cout<<p<<' '<<a[i]<<endl;
p-=a[i];
}else{
cout<<s<<' '<<a[i]<<endl;
s-=a[i];
}
}
cout<<p<<' '<<s<<endl;
}
}
| 0
| 74,759,804
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<=n;i++)
#define FO(i,a,b) for(i=a;i<=b;i++)
#define FOR(i,a,b) for(i=a;i>=b;i--)
#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define si set<int>
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define vpii vector<pii>
#define vvi vector<vi>
#define usi unordered_set<int>
#define umii unordered_map<int,int>
#define pqmx priority_queue<int>
#define pqmn priority_queue<int,vi,greater<int> >
#define sp(x) cout<<setprecision(x)<<fixed;
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define in(a,n) vi a(n);fo(i,n)cin>>a[i];
#define in1(a,n) vi a(n+1);fo1(i,n)cin>>a[i];
#define w(t) int t;cin>>t;while(t--)
#define sz(v) (int)v.size()
#define gcd __gcd
#define lcm(x,y) x*(y/gcd(x,y))
#define endl '\n'
#define PI 3.14159265358979323846
const int inf = 1e18;
const int mod = 1e9+7;
void __p(int x) {cout<<x;}
void __p(int32_t x){cout<<x;}
void __p(float x){cout<<x;}
void __p(double x){cout<<x;}
void __p(ld x) {cout<<x;}
void __p(char x){cout <<'\''<<x<<'\'';}
void __p(const char *x){cout <<'\"' <<x<<'\"';}
void __p(const string &x) {cout<<'\"'<<x<<'\"';}
void __p(bool x) {cout<<(x?"true":"false");}
void _p() {cout << "]\n";}
template<typename T,typename V> void __p(const pair<T,V> &x) {cout<<'{';__p(x.first);cout<<',';__p(x.second);cout<<'}';}
template<typename T> void __p(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __p(i); cout << "}";}
template <typename T,typename... V> void _p(T t, V... v) {__p(t);if(sizeof...(v))cout<<", ";_p(v...);}
int po(int x,int p) {int ans=1;x%=mod;while(p>0){if(p&1)ans=(ans*x)%mod;p=p>>1;x=(x*x)%mod;}return ans;}
int inv(int x){return po(x,mod-2)%mod;}
#define dbg(x...) cout<<"["<<#x<<"]=[";_p(x)
const int N=1e6+6;
int n,m,k,x,y,z,a,b,c,d,i,j,l,r,f,q;
void sol()
{
cin>>a>>b>>n;
n-=a;
if(n<=0)cout<<-n<<" "<<b;
else
{
b-=n;
cout<<0<<" "<<max(0ll,b);
}
}
int32_t main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
sol();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define maxn 10000001
#define endl "\n"
#define inf INT_MAX
#define vec vector <ll>
#define mps map <ll,ll>
#define ppl vector<pair<ll,ll>>
#define fi first
#define si second
#define pr pair<ll,ll>
#define mvec map<ll,vector <ll>>
#define all(v) v.begin(),v.end()
#define infi LLONG_MAX
#define pi 3.141592653
#define ninf INT_MIN
#define ninfi LLONG_MIN
#define lbn lower_bound
#define ubn upper_bound
#define memset(a,b) memset(a,(b),sizeof(a))
ll modexpo(ll a, ll b, ll c)
{
if (a == 0)
return 0;
if (b == 0)
return 1;
ll y;
if (b % 2 == 0) {
y = modexpo(a, b / 2, c);
y = (y * y) % c;
}
else {
y = a % c;
y = (y * modexpo(a, b - 1, c) % c) % c;
}
return y;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
cin>>n>>k;
vec dp(k+1);
for(ll i=k;i>=1;i--)
{
ll q=modexpo(k/i,n,mod);
q%=mod;
dp[i]=q;
}
for(ll i=k;i>=1;i--)
{
for(ll j=2*i;j<=k;j+=i)
dp[i]-=dp[j];
}
ll sum=0;
for(ll i=1;i<=k;i++)
{
dp[i]=i*dp[i];
dp[i]%=mod;
sum+=dp[i];
sum%=mod;
}
cout<<sum<<endl;
return 0;
}
| 0
| 85,847,295
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using garph = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
signed main (){
int n;cin>>n;
vector<vector<int>>num(26,vector<int>(n,0));
rep(i,0,n){
string s;cin>>s;
rep(j,0,s.size())num[s[j]-97][i]++;
}
string ans;
rep(i,0,26){
int a = *min_element(range(num[i]));
rep(j,0,a)ans.pb(i+97);
}
if(ans.size()!=0)cout<<ans<<nnn;
else cout<<nnn;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>
bool ask(T x)
{
static int tot = 0;
++tot;
cerr << "ASK " << tot << endl;
cout << "? " << x << endl;
char c;
cin >> c;
return c == 'Y';
}
void ans(ll x)
{
cout << "! " << x << endl;
exit(0);
}
int main()
{
ll p10[11];
p10[0] = 1;
for (int i = 1; i < 11; ++i)
p10[i] = 10 * p10[i - 1];
int lo = 0, hi = 10;
while (lo <= hi) {
int mi = (lo + hi) / 2;
if (ask(p10[mi]))
lo = mi + 1;
else
hi = mi - 1;
}
if (lo == 11) {
if (ask(2))
ans(1);
for (int i = 1; i < 11; ++i)
if (ask(p10[i] + 1))
ans(p10[i]);
}
int len = hi + 1;
ll a = 0;
for (int i = 0; i < len - 1; ++i) {
lo = 0, hi = 9;
while (lo <= hi) {
int mi = (lo + hi) / 2;
if (ask(10 * a + mi))
lo = mi + 1;
else
hi = mi - 1;
}
a = 10 * a + hi;
}
lo = 0, hi = 9;
while (lo <= hi) {
int mi = (lo + hi) / 2;
if (ask(100 * a + 10 * mi))
hi = mi - 1;
else
lo = mi + 1;
}
ans(a * 10 + lo);
}
| 0
| 58,820,562
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int mxN = 105;
vector<int> adj[mxN];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for(int i = 0; i < n; ++i)
adj[(int)s[i]].push_back(i);
long long tot = 0;
vector<int> :: iterator it;
for(int i = 0; i < n; ++i) {
for(int j = i + 1; j < n; ++j) {
if(s[i] != s[j]) {
char c;
for(char x : {'R', 'G', 'B'}) {
if(x == s[i] || x == s[j])
continue;
c = x;
}
it = upper_bound(adj[(int)c].begin(), adj[(int)c].end(), j);
if(it != adj[(int)c].end()) {
tot += ((int)adj[(int)c].size() - (it - adj[(int)c].begin())) -
binary_search(adj[(int)c].begin(), adj[(int)c].end(), j + (j - i));
}
}
}
}
cout << tot;
}
|
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int k;
int n;
vector<int> a;
void solve() {
vector<int> diff;
diff.push_back(k+*a.begin()-a[n-1]);
for (auto i=a.begin();i!=a.end();i++) {
diff.push_back(*(i+1) - *i);
}
sort(diff.begin(), diff.end()-1);
int sum = accumulate(diff.begin(), diff.end()-2, 0);
printf("%d\n", sum);
}
int main() {
scanf("%d", &k);
scanf("%d", &n);
for (int i=0;i<n;i++) {
int tmp;
scanf("%d", &tmp);
a.push_back(tmp);
}
solve();
}
| 0
| 64,859,442
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define big 998244353
#define ff first
#define se second
#define pb push_back
#define pii pair<int,int>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define PSET(x,y) fixed<<setprecision(y)<<x
#define mp make_pair
#define pi 3.141592653589
int power(int x,int y){
int r=1,z=x;
while(y){
if(y & 1)r*=z;
z*=z;y=y>>1;}
return r;}
int powerm(int x,int y,int p){
int r=1;
while(y){
if(y & 1)r=(r*x)%p;
y=y>>1;
x=(x*x)%p;}
return r%p;}
int modinv(int x,int m){
return powerm(x,m-2,m);}
int logarithm(int a,int b){
int x=0;
while(a>1){
x++;
a/=b;}
return x;}
int32_t main(){
fast;
int n;
cin>>n;
vector<int> h(n),dp(n);
for(int i=0;i<n;i++){
cin>>h[i];
dp[i]=INT_MAX;
}
dp[0]=0;
for(int i=0;i<n;i++){
if(i+1<n)
dp[i+1]=min(dp[i+1],dp[i]+abs(h[i+1]-h[i]));
if(i+2<n)
dp[i+2]=min(dp[i+2],dp[i]+abs(h[i+2]-h[i]));
}
cout<<dp[n-1];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
int sum,i;
while(cin>>a)
{
i=0;
sum=0;
if(a[0]==48) break;
while(a[i]!=0){
sum=sum+(a[i]-48);
i++;
}
cout<<sum<<endl;
}
return 0;
}
| 0
| 52,161,883
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ll a[n + 1];
a[0] = 0;
rep(i, n) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
rep(i, n + 1) a[i] = (a[i] - i) % k;
map<int, int> mp;
int l = 0, r = 0;
mp[0]++;
ll ans = 0;
while (r != n + 1) {
if (r - l < k - 1) {
if (mp[a[++r]]) ans += mp[a[r]];
mp[a[r]]++;
} else {
mp[a[l++]]--;
if (mp[a[++r]]) ans += mp[a[r]];
mp[a[r]]++;
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define pb push_back
#define sz size()
using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
using Vl = vector<ll>;
const int MOD = 1e9 + 7;
const ll ZER = 0;
vector<ll>bitSearch(int bit,int n){
vector<ll>S;
rep(i,n)if(bit&(1<<i))S.push_back(i);
S.push_back(1e9);
return S;
}
ll dp1[3010][2], dp2[3010][2];
int main(){
ll r, g, b, n;
cin >> r >> g >> b >> n;
ll res = 0;
rep(i, 3001){
rep(j, 3001){
int rem = n - r * i - g * j;
ll k = rem / b;
if(rem < 0)continue;
if(rem % b != 0)continue;
if(r * i + g * j + b *k == n)res++;
}
}
cout << res << endl;
}
| 0
| 40,698,719
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
long long int n, t;
cin >> n >> t;
long long int res = 0;
long long int last = 0;
for (int i = 0; i < n; i++) {
long long int tt;
cin >> tt;
res += min(t, tt + t - last);
last = tt + t;
}
cout << res << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define vl vector
using namespace std;
int main()
{
ll n,a,b,i,j;
cin>>a>>b;
for(i=1;i<=1000000;i++)
{
long double x,y;
x=i*0.08;
y=i*0.1;
ll c,d;
c=floor(x);
d=floor(y);
if(c==a && d==b)
{
cout<<i;
return 0;
}
}
cout<<"-1";
return 0;
}
| 0
| 43,858,844
|
#include<bits/stdc++.h>
#define pii pair<int,int>
#define pb push_back
#define mk make_pair
using namespace std;
vector<pii > g;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
if(k>(n-1)*(n-2)/2) {printf("-1");return 0;}
for(int i=2;i<=n;++i) g.pb(mk(1,i));
int i=2,j=3;
k=(n-1)*(n-2)/2-k;
while(k--) {
g.pb(mk(i,j));
j++;
if(j==n+1) i++,j=i+1;
}
printf("%d\n",g.size());
for(int i=0;i<g.size();++i) printf("%d %d\n",g[i].first,g[i].second);
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
using namespace std;
#define fors(i,a,b) for(int i=(a);i<=(b);++i)
#define ford(i,a,b) for(int i=(a);i>=(b);--i)
#define min(x,y) ((x) < (y) ? (x) : (y))
#define max(x,y) ((x) < (y) ? (y) : (x))
#define swap(x,y) ((x)^=(y),(y)^=(x),(x)^=(y))
#define abs(x) ((x) < 0 ? -(x) : (x))
const int maxn=1e6+7;
typedef long long ll;
const int inf=1<<25;
int read(){
int s=0,f=1;
char c=getchar();
while(c<'0' || c>'9') {if(c=='-') f=-1; c=getchar();}
while(c>='0' && c<='9') {s=s*10+c-48;c=getchar();}
return s*f;
}
void write(int x){
if(x<0) {putchar('-');x=-x;}
if(x>9) write(x/10);
putchar(x%10+48);
}
int tree[101010];
long long d[101010];
int siz[101010],fa[101010];
bool cmp(const int &x,const int &y)
{
return d[x]<d[y];
}
map<long long,int> mp;
int main()
{
int n;
scanf("%d",&n);
mp.clear();
for(int i=1;i<=n;i++){
scanf("%lld",&d[i]);
siz[i]=1;
mp[d[i]]=i;
tree[i]=i;
}
sort(tree+1,tree+n+1,cmp);
for(int i=n;i>1;i--)
{
fa[tree[i]]=mp[d[tree[i]]+2*siz[tree[i]]-n];
if(!fa[tree[i]]){
printf("-1");
return 0;
}
siz[fa[tree[i]]]+=siz[tree[i]];
}
for(int i=2;i<=n;i++)
d[tree[1]]-=siz[tree[i]];
if(d[tree[1]]){
printf("-1");
return 0;
}
for(int i=2;i<=n;i++)
printf("%d %d\n",fa[tree[i]],tree[i]);
return 0;
}
| 0
| 23,535,601
|
# include <iostream>
# include <cstring>
# include <unordered_map>
using namespace std;
# define ll long long
unordered_map<ll, ll> cnt;
int main(){
cnt[0] = 1;
int n;
cin >> n;
ll ans = 0, cur = 0;
for(int i=0; i<n; i++){
ll num; cin >> num;
cur += num;
ans += cnt[cur];
cnt[cur]++;
}
cout << ans << endl;
return 0;
}
|
#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/gcd(a,b)*b;}
const int INF=1e9;
const ll MX = 1e18;
const ll MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define YN {puts("YES");}else{puts("NO");}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (ll i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}
long long COM(ll n, ll k){if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}
int main() {
int n;
cin>>n;
vi a(n);
rep(i,n) cin>>a[i];
int ans=a[0];
rrep(i,n-1){
ans=gcd(ans,a[i]);
}
cout<<ans<<endl;
}
| 0
| 92,677,325
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll s = 1;
if(b-a <= 2) {
cout << k+1 << endl;
return 0;
}
rep(i,k) {
if(s < a) { s++; continue;}
else if(k-i>=2){
s-=a;
s+=b;
i++;
continue;
}
else s++;
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
const ll MOD = 1e9+7;
const int inf = 1e8;
const ll INF = 1e16;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
pii f(pii a, pii b){
int p[] = {a.first, a.second, b.first, b.second};
sort(p, p+4, greater<int>());
return pii(p[0], p[1]);
}
int main(){
int N;
cin >> N;
int A[1<<N];
pii dp[1<<N];
rep(i, (1<<N)){
cin >> A[i];
dp[i] = pii(A[i], 0);
}
rep(j, N){
rep3(i, (1<<N)-1, 0){
if(i & (1<<j)){
dp[i] = f(dp[i], dp[i & ~(1<<j)]);
}
}
}
int now = 0;
rep2(i, 1, (1<<N)-1){
now = max(now, dp[i].first + dp[i].second);
cout << now << endl;
}
}
| 0
| 31,641,367
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int ans=0 ;
string s;
cin >> s;
for(int i;i<s.size();i++){
if(s.at(i)=='x'){
ans++;
}
}
if(ans>=8){
cout << "NO" << endl;
}else{
cout << "YES" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vll vector<ll>
#define vpll vector<pair<ll ,ll>>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
#define MAP map<ll ,ll>
#define UMAP unordered_map<ll , ll>
#define endl "\n"
#define SET set<ll>
#define SETC set<char>
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define fastcout ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define testcases int tt = 1 ; cin >> tt ; for(int i = 1 ; i <= tt ; ++i)
#define codejam cout << "Case #"<<i <<": ";
#define FOR(i,a,n) for(int i = a ; i <= n ; ++i)
#define FORback(i,a,n) for(int i = n ; i >= a ; --i)
#define time cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
#define ll long long int
const ll INF = 1e13+7;
const ll mod = 1e9+7;
vvll graph;
vvll dp;
ll doSome(int curr , int color , int parent){
ll ans= 0 ;
if(dp[curr][color] != -1){
return dp[curr][color];
}
ll temp = 1;
ll temp2 = 1;
for(auto x : graph[curr]){
if(x != parent){
temp *= doSome(x , 1 , curr);
temp %= mod;
if(color){
temp2 *= doSome(x , 0 , curr);
temp2 %= mod;
}
}
}
if(color){
ans += temp2;
ans %= mod;
}
ans += temp;
return dp[curr][color] = ans%mod;
}
void solv(){
ll n ;
cin >> n ;
graph.assign(n+2 , vll());
FOR(i , 1 ,n-1){
ll a , b ;
cin >> a >> b ;
graph[a].push_back(b);
graph[b].push_back(a);
}
ll ans = 0;
dp.assign(n+2 , vll(2 , -1));
ans += doSome(1 , 1 , -1);
cout << ans << endl;
}
int main(){
fast ;
solv();
}
| 0
| 91,798,837
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(),(A).end()
int check(int x){
string s;
cout << x << endl << flush;
cin >> s;
if(s == "Vacant")return 0;
else if(s == "Male")return 1;
else return 2;
}
int main(void){
int N;cin >> N;
int left = 0;
int right = N;
int x = check(0);
if(x == 0)return 0;
else if(x == 1){
while(true){
int mid = (left+right)/2;
int next = check(mid);
if(mid%2==0){
if(next==0)return 0;
else if(next==1)left = mid;
else right = mid;
}else{
if(next==0)return 0;
else if(next==2)left = mid;
else right = mid;
}
}
}else{
while(true){
int mid = (left+right)/2;
int next = check(mid);
if(mid%2==0){
if(next==0)return 0;
else if(next==2)left = mid;
else right = mid;
}else{
if(next==0)return 0;
else if(next==1)left = mid;
else right = mid;
}
}
}
}
|
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
typedef long long ll;
string s;
int a[2 * 100000+1], opt[2*100000], dp[1<<26], chara['z'-'a'+1], X['z'-'a'+2];
int main() {
cin >> s;
for (int i = 0; i < 26; i++) {
chara[i] = 1 << i;
X[i + 1] = 1 << i;
}
for (int i = 0; i < 1 << 26; i++)dp[i] = INT32_MAX;
dp[0] = 0;
for (int i = 0; i < s.length(); i++)opt[i] = INT32_MAX;
for (int i = 0; i < s.length(); i++) {
a[i+1] = a[i] ^ chara[s[i] - 'a'];
}
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j <= 26; j++) {
if(dp[a[i+1]^X[j]] != INT32_MAX)opt[i] = min(opt[i], dp[a[i + 1] ^ X[j]] + 1);
}
dp[a[i + 1]] = min(dp[a[i + 1]], opt[i]);
}
cout << opt[s.length() - 1] << endl;
}
| 0
| 8,547,007
|
#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 R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(i, N / R + 1) {
rep(j, (N - i * R) / G + 1) {
if ((N - i * R - j * G) % B == 0) ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x)))
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return 0;
}
template <typename T>
T lcm(T x, T y)
{
T z = gcd(x, y);
return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++)
{
if (n % i == 0)
{
return false;
}
i++;
}
return true;
}
const ll dx[4] = {0, 0, 1, 1};
const ll dy[4] = {0, 1, 0, 1};
int main()
{
cout << fixed << setprecision(30);
ll N;
string s;
cin >> N >> s;
bool exist = false;
vec ans;
loop(d, 4)
{
vector<ll> check(N, -1);
check[0] = dx[d];
check[1] = dy[d];
Loop(i, 1, N - 1)
{
if (s[i] == 'o')
{
if (check[i] == 1)
{
check[i + 1] = check[i - 1];
}
else
{
if (check[i - 1])
check[i + 1] = 0;
else
check[i + 1] = 1;
}
}
if (s[i] == 'x')
{
if (check[i] == 0)
{
check[i + 1] = check[i - 1];
}
else
{
if (check[i - 1])
check[i + 1] = 0;
else
check[i + 1] = 1;
}
}
}
if (s[0] == 'o')
{
if (check[0] == 1 && check[1] != check[N - 1])
continue;
if (check[0] == 0 && check[1] == check[N - 1])
continue;
}
if (s[0] == 'x')
{
if (check[0] == 1 && check[1] == check[N - 1])
continue;
if (check[0] == 0 && check[1] != check[N - 1])
continue;
}
if (s[N - 1] == 'o')
{
if (check[N - 1] == 1 && check[0] != check[N - 2])
continue;
if (check[N - 1] == 0 && check[0] == check[N - 2])
continue;
}
if (s[N - 1] == 'x')
{
if (check[N - 1] == 1 && check[0] == check[N - 2])
continue;
if (check[N - 1] == 0 && check[0] != check[N - 2])
continue;
}
exist = true;
ans = check;
}
if (exist)
{
loop(i, N)
{
if (ans[i])
cout << "S";
else
cout << "W";
}
putout("");
}
else
putout(-1);
return 0;
}
| 0
| 19,633,607
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define INF 9223372036854775806
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define PI 2*acos(0.0)
#define EPS 1e-9
ll max(ll a,ll b) {if(a>b) return a; else return b;}
ll min(ll a,ll b) {if(a<b) return a; else return b;}
int main()
{
char c;
cin>>c;
if(c>='A' && c<='Z'){
cout<<"A"<<endl;
}
else{
cout<<"a"<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, r, s, p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
for (int i = k; i < n; i++) {
if (t[i] == t[i-k]) t[i] = 'a';
}
int numr, nums, nump;
numr = 0;
nums = 0;
nump = 0;
for (int i = 0; i < n; i++) {
if (t[i] == 'r') numr++;
else if (t[i] == 's') nums++;
else if (t[i] == 'p') nump++;
}
int ans = numr*p + nums*r + nump*s;
cout << ans << endl;
}
| 0
| 61,831,856
|
#include <bits/stdc++.h>
int main() {
long min = 1000000000;
long max = -1000000000;
long sum = 0;
long N;
long temp;
std::cin >> N;
for(long i = 0; i < N; ++i) {
std::cin >> temp;
min = std::min(temp, min);
max = std::max(temp, max);
sum += temp;
}
std::cout << min << " " << max << " " << sum << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
int main() {
int N;
cin>>N;
vector<string> S(N);
for(int i=0;i<N;i++){
cin>>S[i];
}
int M;
cin>>M;
vector<string> T(M);
for(int j=0;j<M;j++){
cin>>T[j];
}
int ans=0;
for(int i=0;i<N;i++){
int check=0;
for(int j=0;j<N;j++){
if(S[i]==S[j]){
check++;
}
}
for(int j=0;j<M;j++){
if(S[i]==T[j]){
check--;
}
}
ans=max(ans,check);
}
cout<<ans<<endl;
}
| 0
| 57,728,023
|
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int r, ans;
cin >> r;
ans = pow(r, 2);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve () {
int n, m;
cin >> n >> m;
unordered_map <int , vector<int>> mp;
vector<pair <int, int>> a(m);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
mp[p].push_back(y);
a[i].first = p;
a[i].second = y;
}
for (auto t = mp.begin(); t != mp.end(); t++) {
sort((*t).second.begin(), (*t).second.end());
}
for (int i = 0; i < m; i++) {
int p = a[i].first;
int y = a[i].second;
printf("%06d", p);
int l = lower_bound(mp[p].begin(), mp[p].end(), y) - mp[p].begin();
printf("%06d\n", l + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 22,337,566
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B >> S;
bool ok = true;
int i = 0;
while(i < A + B + 1) {
if(i == A && S[i] != '-') {
cout<< "No" << endl;
ok = false;
break;
}
else if(i != A && S[i] == '-') {
cout << "No" << endl;
ok = false;
break;
}
i++;
}
if(ok == true) cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const int INF = 1000100100;
using Graph = vector<vector<ll>>;
Graph G;
vector<ll> memo(1e6 + 1, INF);
vector<bool> pressed(1e6 + 1, false);
ll min_cnt(ll from, ll cnt) {
if(from == 1) {
return cnt;
}
if(memo[from] != INF) {
return memo[from];
}
if(G.at(from).empty() || pressed[from]) {
memo[from] = -1;
} else {
pressed[from] = true;
ll res = INF;
REP(i, G.at(from).size()) {
ll n_from = G[from][i];
ll tmp = min_cnt(n_from, cnt + 1);
if(tmp != -1) {
res = min(res, tmp);
}
}
if(res == INF) {
memo[from] = -1;
} else {
memo[from] = res;
}
}
if(memo[from] == -1) {
pressed[from] = true;
}
return memo[from];
}
int main() {
ll N;
cin >> N;
G.resize(N + 1);
REP(i, N) {
ll a;
cin >> a;
G.at(i).emplace_back(a - 1);
}
ll ans = min_cnt(0, 0);
cout << ans << endl;
return 0;
}
| 0
| 99,989,300
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> ii;
const int N = 1e5+1;
int i,n,a[N],sz[N];
ll ans[N];
priority_queue<ii>pq;
int main()
{
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
pq.push(ii(a[i],i));
sz[i] = 1;
}
while(pq.size()>1)
{
int t1 = pq.top().first;
int i1 = pq.top().second;
pq.pop();
int t2 = pq.top().first;
int i2 = pq.top().second;
pq.pop();
ans[i1] += 1ll * sz[i1] * (t1 - t2);
pq.push(ii(t2,min(i1,i2)));
sz[min(i1,i2)] += sz[max(i1,i2)];
}
ans[1] += 1ll * n * pq.top().first;
for(i=1;i<=n;i++) printf("%lld\n",ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
map<int, ll> m;
rep(i,n){
m[a[i]]++;
}
ll ans = 0;
for(auto mi = m.begin(); mi != m.end(); mi++){
if (mi->second > mi->first){
ans += mi->second - mi->first;
}
else if (mi->second < mi->first){
ans += mi->second;
}
}
cout << ans << endl;
}
| 0
| 44,471,824
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
signed main() {
int n;
cin >> n;
int h[n];
rep (i, 0, n) cin >> h[i];
bool chk = 1;
int ans = 0;
while (chk) {
int cnt = 0;
int now = 0;
int sum = inf;
rep (i, 0, n) {
if (h[i] == 0) {
if (sum != inf) {
rep (j, now, i) h[j] -= sum;
ans += sum;
}
now = i + 1;
sum = inf;
} else {
sum = min (sum, h[i]);
}
}
if (sum != inf) {
rep (j, now, n) h[j] -= sum;
ans += sum;
}
chk = 0;
rep (i, 0, n) {
if (h[i] > 0) chk = 1;
}
cout << "\n";
}
cout << ans << "\n";
}
|
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<tuple>
#include<vector>
#include<cstdlib>
#include<cstdint>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<ctime>
#include<climits>
#include<random>
#include<queue>
#include<map>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
const double pi=acos(-1);
using ll = long long;
using db = long double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll =V<pair<ll,ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using graph = V<V<int>>;
using pq = priority_queue<ll>;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn,(a).en)
#define REV(a) reverse((a).bgn,(a).en)
#define fi first
#define se second
#define sz size()
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a);
#define ALL(a) (a).begin(),(a).end()
ll Sum(ll n) {
ll m=0;
while(n){
m+=n%10;
n/=10;
}
return m;
}
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void Comuse() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
#define comuse Comuse()
ll combi(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll perm(int n,int k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * (finv[k] % MOD) % MOD;
}
ll modpow(ll a,ll n,ll mod){
ll ans=1;
while(n>0){
if(n&1){
ans=ans*a%mod;
}
a=a*a%mod;
n>>=1;
}
return ans;
}
ll modinv(ll a, ll mod) {
return modpow(a, mod - 2, mod);
}
ll modcombi(int n,int k,int mod){
ll ans=1;
for(ll i=n;i>n-k;i--){
ans*=i;
ans%=mod;
}
for(ll i=1;i<=k;i++){
ans*=modinv(i,mod);
ans%=mod;
}
return ans;
}
ll lcm(ll a,ll b){
ll n;
n=a/gcd(a,b)*b;
return n;
}
vll div(ll n){
vll ret;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ret.push_back(i);
if(i*i!=n){
ret.push_back(n/i);
}
}
}
SORT(ret);
return (ret);
}
vector<bool> isprime(MAX+100,true);
void primeuse(){
isprime[0]=false;
isprime[1]=false;
for(int i=2;i<MAX+50;i++){
int up=sqrt(i)+1;
for(int j=2;j<up;j++){
if(i%j==0){
isprime[i]=false;
}
}
}
}
void bf(ll n,string s){
for(ll i=0;i<n;i++){
cout<<s;
}
cout<<"\n";
}
void Solve();
const int MAX_N = 131072;
int NN;
int seg[MAX_N*2-1];
void seguse(){
for(int i=0;i<2*NN-1;i++){
seg[i]=INT_MAX;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<setprecision(20)<<fixed;
Solve();
}
void Solve(){
string s;
cin>>s;
ll n=s.size();
FOR(i,0,n-1){
if(s[i]==s[i+1]){
cout<<i+1<<" "<<i+2<<"\n";
return;
}
}
FOR(i,0,n-2){
if(s[i]==s[i+2]){
cout<<i+1<<" "<<i+3<<"\n";
return;
}
}
cout<<"-1 -1\n";
}
| 0
| 96,558,682
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,x,n) for(int i = x; i < n; i++)
#define MAX 100
#define INF 1000000001
int k;
vector<pair<int,int>> adj[114514];
long long dis[114514];
bool processed[114514];
void dijkstra() {
priority_queue<pair<int,int>> q;
REP(i,0,114514) dis[i] = INF;
dis[1] = 0;
q.push({0,1});
while(!q.empty()) {
int a = q.top().second; q.pop();
if (processed[a]) continue;
processed[a] = true;
for (auto u : adj[a]) {
int b = u.first, w = u.second;
if (dis[a] + w < dis[b]) {
dis[b] = dis[a] + w;
q.push({-dis[b],b});
}
}
}
return;
}
int main(void){
cin >> k;
REP(i,0,k) {
adj[i].push_back({(i+1)%k,1});
}
REP(i,0,k) {
adj[i].push_back({(i*10%k),0});
}
dijkstra();
cout << dis[0] + 1 << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int main() {
int n,k;
cin>>n>>k;
vector<int> a(n);
rep(i,n) cin>>a[i];
bool ok=false;
rep(i,n){
if(k==a[i]){
cout<<"POSSIBLE"<<endl;
return 0;
}
if(k<a[i]) ok=true;
}
if(!ok){
cout<<"IMPOSSIBLE"<<endl;
return 0;
}
int g=a[0];
for(int i=1;i<n;i++){
g=gcd(g,a[i]);
}
if(k%g==0) cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
}
| 0
| 99,446,734
|
#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>>;
static long long INF = (1LL<<62);
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S, T, U;
cin >> N;
cin >> S >> T;
for(int i=0; i<N; i++){
U.push_back(S[i]);
U.push_back(T[i]);
}
printf("%s\n", U.c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n, m, r;
cin >> n >> m >> r;
vl v(r);
rep(i, r) {
cin >> v[i];
v[i]--;
}
vector<vl> g(n, vl(n, 1e18));
rep(i, m) {
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
g[a][b] = c;
g[b][a] = c;
}
rep(k, n) rep(i, n) rep(j, n) g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
ll ans = 1e18;
sort(all(v));
do {
ll now = 0;
rep(i, r - 1) now += g[v[i]][v[i + 1]];
ans = min(ans, now);
} while(next_permutation(all(v)));
cout << ans << endl;
}
| 0
| 69,727,523
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define mp make_pair
#define endl "\n"
#define N 100001
#define INF 1e9
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
ll n , i ;
cin >> n ;
pair<ll , ll > d[n] ;
ll siz[n+1] ;
for(i=0 ; i<n ; i++){
cin >> d[ i ].F ;
d[i].S = i+1 ;
siz[i+1]=1 ;
}
sort(d , d+n) ;
ll dis=0 ;
vector<pair<ll , ll > > ans ;
for(i=n-1 ; i>0 ; i--){
ll sum = d[i].F-n+2*siz[d[i].S] ;
ll pos = (ll)(lower_bound(d , d+n , mp(sum , 0LL)) - d) ;
if(d[pos].F!=sum){cout << -1 ; return 0 ;}
ll u = d[i].S , v = d[pos].S ;
ans.pb(mp(u , v)) ;
siz[v]+=siz[u] ;
dis+=siz[u] ;
}
if(dis!=d[0].F){cout << -1 ; return 0 ;}
for(i=0 ; i<n-1 ; i++){
cout << ans[i].F << " " << ans[i].S << endl ;
}
return 0 ;
}
|
#include <stdio.h>
int main () {
char S[100];
scanf("%s", S);
char Y[] = "YAKI";
for (int i = 0; i < 4; i++) {
if (S[i] != Y[i]) {
puts("No");
return 0;
}
}
puts("Yes");
}
| 0
| 78,951,631
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vii vector<int>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define take(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define takes(a,n,st) for(ll i=st;i<n+st;i++)cin>>a[i]
ll sum(ll a[],ll n,ll s){ for(ll i=0;i<n;i++)s+=a[i]; return s;}
#define mod 1000000009
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0){
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
void solve(){
ll n,i,x,cur,tot;
cin>>n;
cur=0;
tot=0;
for(i=0;i<n;i++){
cin>>x;
if(x!=0){
cur+=x;
}
else{
tot+=(cur/2);
cur=0;
}
}
tot+=(cur/2);
cout<<tot;
return;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll t,T;
T=1;
for(t=1;t<=T;t++){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i=0; i<n;i++)
s1+=s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b){
if (a == 0) return b;
return gcd(b % a, a);
}
void solve(){
string s;
cin>>s;
int n=s.length();
stack<int> st;
rep(i,0,n){
if(st.empty()) st.push(s[i]-'0');
else{
if(st.top()==0 && s[i]=='1') st.pop();
else if(st.top()==1 && s[i]=='0') st.pop();
else st.push(s[i]-'0');
}
}
cout<<n-st.size()<<endl;
}
int main(){
optimizeIO();
{ solve();
}
}
| 0
| 14,366,750
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> pll;
typedef long double ldouble;
typedef pair<double, double> pdd;
int n, A[200020];
void solve(){
scanf("%d", &n);
for(int i=1;i<=n;i++) scanf("%d", A+i);
ll ans = 0;
for(int i=1, p=1;i<=n;i++) {
int t = (A[i] - 1) / p;
ans += t;
if(A[i] == p || p == 1) ++p;
}
printf("%lld\n", ans);
}
int main(){
int T = 1;
while(T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long md=1000000007;
const int maxn=300100;
long long fac[maxn],inv[maxn];
long long powd(long long x,long long y){
long long res=1;
while(y){
if(y&1) res=res*x%md;
x=x*x%md;
y>>=1;
}
return res;
}
void csh(){
fac[0]=1;
for(int i=1;i<=300000;i++)
fac[i]=fac[i-1]*i%md;
inv[300000]=powd(fac[300000],md-2);
for(int i=300000;i>=1;i--)
inv[i-1]=inv[i]*i%md;
}
long long C(int x,int y){
if (x < y) return 0;
else return fac[x]*inv[y]%md*inv[x-y]%md;
}
int main(){
csh();
int n;
cin >> n;
vector<int> a(n+1);
for (int i=0; i<n+1; i++) cin >> a[i];
set<int> check;
int target = 0;
for (int i=0; i<n+1; i++){
if (check.find(a[i]) != check.end()) {target = a[i]; break;}
else check.insert(a[i]);
}
int f = -1, b = -1;
for (int i=0; i<n+1; i++){
if (a[i] == target){
if (f == -1) f = i;
else b = i;
}
}
for (int k=1; k<=n+1; k++){
long long ans = 0;
ans = (C(n+1,k) - C(n-b+f,k-1) + md)%md;
cout << ans << endl;
}
}
| 0
| 38,888,455
|
#include<iostream>
#include <stdio.h>
using namespace std;
int main(){
int alphabets[128], index;
char ch;
for(int i = 0; i < 128; i++){
alphabets[i] = 0;
}
while(cin >> ch){
if(ch == '\0') break;
if(!isalpha(ch)) continue;
if(isupper(ch)) ch = tolower(ch);
index = ch - 'a';
alphabets[index]++;
}
for(int i = 65; i < 91; i++){
putchar(i + 32);
cout << ' ' << ':' << ' ' << alphabets[i - 65]<< endl;
}
return 0;
}
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> x(n);
rep(i, n) cin >> x.at(i);
int ans = MOD;
rep(p, 300) {
int sum = 0;
rep(i, n) {
sum += (x.at(i) - p) * (x.at(i) - p);
}
ans = min(ans, sum);
}
cout << ans << endl;
return 0;
}
| 0
| 83,729,265
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string R="yhnujmikolp";
string L="qazwsxedcrfvtgb";
while(true)
{
string S;
int juge[50]={0};
int jugeL[50]={0};
int count=0;
cin>>S;
if(S=="#")
{
break;
}
int len=S.size();
for(int i=0;i<len;i++)
{
for(int k=0;k<=10;k++)
{
if(S[i]==R[k])
{
juge[i]=1;
}
}
}
for(int h=1;h<len;h++)
{
if(juge[h]!=juge[h-1])
{
count++;
}
}
cout<<count<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll k;
cin >> k;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
ll cou = 0;
ll q = 10e8 + 7;
for(int i = 0; i < n - 1; i++){
for(int j = i + 1; j < n; j++){
if(a[i] > a[j]){
cou++;
}
}
}
ll ans = 0;
ans = cou * k;
ans %= q;
ll t = k * (k - 1);
t /= 2;
t %= q;
for(int i = 0; i < n; i++){
cou = 0;
for(int j = 0; j < n; j++){
if(i != j){
if(a[i] > a[j]){
cou++;
}
}
}
ans += cou * t;
ans %= q;
}
cout << ans << endl;
}
| 0
| 36,017,684
|
#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++)
int main(){
ll N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
ll ans = 0;
rep(i, 0, N){
if(i + K < N && T[i + K] == T[i]){
T[i + K] = 'd';
}
{
if(T[i] == 's') ans += R;
if(T[i] == 'r') ans += P;
if(T[i] == 'p') ans += S;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n, long long modvalue) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2, modvalue);
return t * t % modvalue;
} else {
return modpow(m, n - 1, modvalue) * m % modvalue;
}
}
long long moddiv(long long a, long long b, ll modvalue) { return (a * modpow(b, mod - 2, modvalue)) % modvalue; }
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k, ll modvalue) {
ll numera = 1;
for (int i = n; i > n - k; i--) {
numera *= i;
numera %= modvalue;
}
ll denomi = 1;
REP(i, k) {
denomi *= (i + 1);
denomi %= modvalue;
}
return moddiv(numera, denomi, modvalue);
}
signed main() {
ll n;
cin >> n;
map<ll, ll> cnt;
vector<ll> as(n);
REP(i, n) {
cin >> as[i];
cnt[as[i]]++;
}
ll sum = 0;
for (auto x : cnt) {
sum += x.second * (x.second - 1) / 2;
}
REP(i, n) { cout << sum - cnt[as[i]] + 1 << endl; }
}
| 0
| 56,504,747
|
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n=0;
cin >> n;
if(n==0)break;
int time[1000000] = {};
for(int i=0;i<1000000;i++){
time[i] =0;
}
for(int i=0;i<n;i++){
int h,m,s;
char c;
c =0;
cin >> h >> c >> m >> c >> s;
int a = h * 3600 + m * 60 + s;
time[a]++;
cin >> h >> c >> m >> c >> s;
a = h * 3600 + m * 60 + s;
time[a]--;
}
int cnt,mx;
mx =0;
cnt= 0;
for(int i=0;i<1000000;i++){
cnt += time[i];
mx = max(mx,cnt);
}
cout << mx << endl;
}
}
|
#include<stdio.h>
#include<iostream>
using namespace std;
#include<queue>
int main(){
while(1){
int a,b,n,v,x,y,i,j,m[18][18]={0},c=0,o=0;
pair<int,int> p,t,g;
queue<pair<int,int> > q;
scanf("%d%d",&a,&b);
if(a==0&&b==0){
break;
}
g.first=a;
g.second=b;
for(i=0;i<=a+1;i++){
for(j=0;j<=b+1;j++){
if(i==0||i==a+1||j==0||j==b+1){
m[i][j]=1;
}
}
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d",&a,&b);
m[a][b]=1;
}
p.first=1;
p.second=1;
q.push(p);
while(!q.empty()){
t=q.front();
if(m[t.first+1][t.second]!=1){
t.first++;
q.push(t);
t.first--;
}
if(m[t.first][t.second+1]!=1){
t.second++;
q.push(t);
t.second--;
}
if(q.front()==g){
c++;
}
q.pop();
}
printf("%d\n",c);
}
return 0;
}
| 0
| 83,869,151
|
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
int n,v[111111],ans;
map<int,int>odd,even;
vector<pair<int,int>>o,e;
int main() {
cin>>n;
for(int i=0;i<n;i++){
cin>>v[i];
if(i&1)even[v[i]]++;
else odd[v[i]]++;
}
for(auto i:odd)o.push_back({i.second,i.first});
for(auto i:even)e.push_back({i.second,i.first});
sort(o.rbegin(),o.rend());
sort(e.rbegin(),e.rend());
o.push_back({0,0});
e.push_back({0,0});
if(o[0].second!=e[0].second)ans=n-o[0].first-e[0].first;
else ans=n-max(e[0].first+o[1].first,e[1].first+o[0].first);
cout<<ans<<endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <stack>
#include <string>
using namespace std;
int main(){
int A,B;
int flagA=0;
int K;
cin>>A>>B>>K;
while(K--){
if(flagA==0){
if(A%2==0){
}else{
A=A-1;
}
A=A/2;
B=B+A;
flagA=1;
}else{
if(B%2==0){
}else{
B=B-1;
}
B/=2;
A=A+B;
flagA=0;
}
}
cout<<A<<" "<<B<<endl;
}
| 0
| 45,992,398
|
#include<iostream>
#include <string>
using namespace std;
int main()
{
int iodd = 0;
int iedge = 0;
int patternsum = 0;
cin >> iodd >> iedge;
if (iodd == 0) {
patternsum = (iedge * (iedge - 1) / 2);
}
else if (iedge == 0) {
patternsum = (iodd * (iodd - 1) / 2);
}
else {
patternsum = (iodd * (iodd - 1) / 2) + iedge * (iedge - 1) / 2;
}
cout << patternsum;
return 0;
}
|
#include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
map<string, int>mp;
int n;
cin >> n;
vector<string>p;
rep(i, 0, n){
string s;
cin >> s;
p.push_back(s);
mp[s]++;
}
for(auto i:mp){
if(i.second>1){
cout << "No" << endl;
return 0;
}
}
rep(i, 1, n){
if(p[i][0]!=p[i-1][p[i-1].size()-1]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 28,458,146
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, total = 0, ans = 0;
cin >> N;
vector<int> A(N);
unordered_map<int, int> mp;
mp[0]++;
for (auto &x : A) {
cin >> x;
total += x;
mp[total]++;
}
for (auto &x : mp) {
ans += x.second * (x.second - 1) / 2;
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<climits>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define MOD 1000000007
#define EPS 1e-9
#define ll long long
#define Pll pair<ll, ll>
#define Pii pair<int, int>
using namespace std;
struct edge{int from, to; ll cost;};
int edit_distance(string s, string t){
int n = (int)s.length(), m = (int)t.length();
vector< vector<int> > dp(n+1, vector<int>(m+1, 1000000));
dp[0][0] = 0;
rep(n) dp[i+1][0] = i+1;
rep(m) dp[0][i+1] = i+1;
rep(n){
repp(j, m){
if(s[i] == t[j]){
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j]);
}else{
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j] + 1);
}
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i+1][j] + 1);
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j+1] + 1);
}
}
return dp[n][m];
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
string s,t;
cin >> s >> t;
cout << edit_distance(s, t) << endl;
}
| 0
| 26,779,961
|
#include<bits/stdc++.h>
#define nxt(x) bian[x].nxt
#define ed(x) bian[x].ed
using namespace std;
const int maxn=1e6;
struct edge{
int nxt,ed;
}bian[maxn];
int n;
int t[maxn],cnt=2;
int w[maxn];
bool bl[maxn];
void lj(int x,int y) {
ed(cnt)=y;
nxt(cnt)=t[x];
t[x]=cnt++;
w[x]++;
}
queue<int> q;
void bfs() {
while(!q.empty()) q.pop();
for (;;) {
bool wy=0;
for (int l=1;l<=n;l++) {
if (w[l]==1&&bl[l]==0) {
q.push(l);
}
}
while(!q.empty()) {
int u=q.front();
q.pop();
for (int l=t[u];l;l=nxt(l)) {
int v=ed(l);
if (bl[v]==1||w[v]!=2) continue;
for (int j=t[v];j;j=nxt(j)) {
int x=ed(j);
w[x]--;
if (w[x]==1&&bl[x]==0) q.push(x);
}
bl[u]=bl[v]=1;
wy=1;
}
}
if (wy==0) break;
}
}
int main() {
cin>>n;
for (int l=1;l<n;l++) {
int u,v;
cin>>u>>v;
lj(u,v);
lj(v,u);
}
bfs();
int ans=0;
for (int u=1;u<=n;u++) {
if (bl[u]==0) {
ans++;
}
}
if (ans!=2) cout<<"First"<<endl;
else cout<<"Second"<<endl;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define inf 1000000000000000000
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli n,k;
cin>>n>>k;
lli h[n], dp[n];
for(int i=0; i<n; i++)
{
dp[i]=inf;
cin>>h[i];
}
dp[0]=0, dp[1]=abs(h[1]-h[0]);
for(int i=2; i<n; i++)
{
for(int j=i-1; j>=max(0LL, i-k); j--)
dp[i]=min(dp[i], dp[j]+abs(h[i]-h[j]));
}
cout<<dp[n-1];
return 0;
}
| 0
| 42,070,980
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, x, y;
cin >> A >> B;
x = (A + B) % 2;
if(x == 1) {
y = (A + B) / 2 + 1;
}
else {
y = (A + B) / 2;
}
cout << y << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
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 (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
rep(i, n) a[i]--;
int cnt = 0;
rep(i, n) {
if (a[a[i]] == i) cnt++;
}
cnt /= 2;
cout << cnt << endl;
}
| 0
| 30,780,557
|
#include<iostream>
using namespace std;
int main(){
int n,i;
long long ans;
while(cin >> n){
ans=1;
for(i=0;i<n;i++){
ans=ans*(n-i);
}
cout << ans << endl;
}
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int M[101][101];
int main(){
int n,u,k,v;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&u,&k);
u--;
for(int j=0;j<k;j++){
scanf("%d",&v);
v--;
M[u][v]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j) printf(" ");
printf("%d",M[i][j]);
}
printf("\n");
}
return 0;
}
| 0
| 23,065,897
|
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <numeric>
#include <string.h>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define repn(i, x) for (int i = 1; i <= (int)(x); i++)
#define repr(i, x) for (int i = ((int)(x) - 1); i >= 0; i--)
#define reprn(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
void solve() {
int n, k; cin >> n >> k;
string s; cin >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
for (unsigned int i = 0; i < n; ++i) {
if (s[i] == (char)(now + '0')) cnt++;
else {
nums.push_back(cnt);
now = 1- now;
cnt = 1;
}
}
if (cnt != 0) nums.push_back(cnt);
if (nums.size() % 2 == 0) nums.push_back(0);
int add = 2 * k + 1;
int ans = 0;
vector<int> sum(nums.size() + 1, 0);
for (int i = 0; i < nums.size(); ++i) {
sum[i + 1] = sum[i] + nums[i];
}
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(i + add, (int)nums.size());
int tmp = sum[right] - sum[left];
ans = max(ans, tmp);
}
cout << ans << endl;
return;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
constexpr int MOD = 1000000007;
void warshal_floyd(vvi& G) {
int v = G.size();
rep(i, 0, v) { G[i][i] = 0; }
rep(k, 0, v) {
rep(i, 0, v) {
if (G[i][k] == INT_MAX) { continue; }
rep(j, 0, v) {
if (G[k][j] == INT_MAX) { continue; }
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
}
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int v, e;
cin >> v >> e;
vvi G(v, vi(v, INT_MAX));
rep(i, 0, e) {
int s, t, d;
cin >> s >> t >> d;
G[s][t] = d;
}
warshal_floyd(G);
rep(i, 0, v) {
if (G[i][i] < 0) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
rep(i, 0, v) {
rep(j, 0, v) {
if (G[i][j] == INT_MAX) {
cout << "INF";
} else {
cout << G[i][j];
}
if (j != v - 1) {
cout << " ";
} else {
cout << endl;
}
}
}
return 0;
}
| 0
| 39,012,377
|
#include<iostream>
using namespace std;
int main(){
int n,a,a2,b,b2,c,c2;
cin >> n;
for(int i=0;i<n;i++){
cin >> a >> b >> c;
a2=a*a; b2=b*b; c2=c*c;
if(a2+b2==c2||a2+c2==b2||b2+c2==a2)cout << "YES" <<endl;
else cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef array<int, 2> duo;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
int n, k; cin >> n >> k;
vector<int> h(n); cin >> h;
vector<bool> good(n, 1);
while (k--) {
int a, b; cin >> a >> b;
a--, b--;
if (h[a] >= h[b]) good[b] = 0;
if (h[b] >= h[a]) good[a] = 0;
}
cout << accumulate(all(good), 0);
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
| 0
| 58,100,552
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = a;i < b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(int i = b-1;i >= a;i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
#define DEBUG_PRINT(...) fprintf(stderr, __VA_ARGS__)
#ifdef ENABLE_DEBUG
#define DEBUG(a) cerr<<#a<<"="<<a<<endl
#define DEBUG_ARRAY(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define DEBUG(a)
#define DEBUG_ARRAY(a,n)
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
void print_pair(pi a){
cerr<<"("<<a.first<<", "<<a.second<<") ";
}
template<int T1, int T2>
void print_2d(int a[T1][T2], int x, int y){
For(i, x){
For(j, y){
cerr<<a[i][j]<<" ";
}
cerr<<endl;
}
}
template<class T>
void print_array(T a[],size_t n){
cerr<<"array:";
REP(n-1)cerr<<a[i]<<",";
cerr<<a[n-1]<<endl;
}
int N;
pll D[100000];
ll d[100000];
int childnumD[100000];
vector<ll> ans[100000];
ll dfs(ll index,ll depth){
ll ret = 0;
DEBUG(index);
for(auto&& i : ans[index])
{
DEBUG(i);
ret+=depth+1;
ret+=dfs(i,depth+1);
}
return ret;
}
int main(){
cin>>N;
REP(N){
ll tmp;
cin>>tmp;
D[i]=pll(tmp,i+1);
}
sort(D,D+N,greater<pll>());
REP(N){
d[i]=D[i].first;
DEBUG(d[i]);
}
for (int i = 0; i < N-1; i++) {
ll tmp=d[i]-(N-2)+2*childnumD[i];
DEBUG(tmp);
auto itr=lower_bound(d,d+N,tmp,greater<ll>());
DEBUG(*itr);
if(itr==d+N||*itr!=tmp){
cout<<-1<<endl;
return 0;
}
ans[itr-d].push_back(i);
childnumD[itr-d]++;
childnumD[itr-d]+=childnumD[i];
}
if(dfs(N-1,0)!=d[N-1]){
DEBUG(dfs(N-1,0));
cout<<-1<<endl;
return 0;
}
For(j,N){
DEBUG(j);
for(auto&& i : ans[j])
{
DEBUG(i);
cout<<D[j].second<<" "<<D[i].second<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define W(x, y) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << y;
#else
#define W(x, y)
#endif
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
using vl = vector<ll>;
using vll = vector<pll>;
using ld = long double;
#define ff first
#define ss second
const ld pi = acosl(-1);
const ll prime = 1000000000 + 7;
const ll INF = 1000000000;
struct UnionFind{
vl pai;
vl rank;
vl sum;
UnionFind(ll n): pai(n), rank(n), sum(n){
iota(pai.begin(), pai.end(), 0);
fill(rank.begin(), rank.end(), 1);
fill(sum.begin(), sum.end(), 1);
}
ll Find(ll x){
if(x == pai[x]){
return x;
}
return pai[x] = Find(pai[x]);
}
void Union(ll a, ll b){
a = Find(a);
b = Find(b);
if(a == b){
return;
}
if(rank[a] == rank[b]){
rank[a]++;
}
if(rank[a] < rank[b]){
sum[b] += sum[a];
pai[a] = b;
} else{
sum[a] += sum[b];
pai[b] = a;
}
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
ll n, m;
cin >> n >> m;
UnionFind uf(n+1);
for(int i = 0; i < m; ++i){
ll a, b;
cin >> a >> b;
uf.Union(a, b);
}
ll res = 0;
for(int i = 1; i <= n; ++i){
ll aux = uf.Find(i);
res = max(res, uf.sum[aux]);
}
cout << res << endl;
return 0;
}
| 0
| 65,386,434
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.