code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int p[n-1];
for(int i=0;i<n-1;i++) p[i]=i+2;
int a[m],b[m];
for(int i=0;i<m;i++) cin>>a[i]>>b[i];
int ans=0;
do{
int count=0;
for(int j=0;j<m;j++){
if(1==a[j]&&p[0]==b[j]) count++;
else if(1==b[j]&&p[0]==a[j]) count++;
}
for(int i=0;i<n-2;i++){
for(int j=0;j<m;j++){
if(p[i]==a[j]&&p[i+1]==b[j]) count++;
else if(p[i]==b[j]&&p[i+1]==a[j]) count++;
}
}
if(count==n-1) ans++;
}while(next_permutation(p,p+n-1));
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define pr1(a) (#a)<<"="<<(a)
#define pr2(a,b) pr1(a)<<", "<<pr1(b)
#define pr3(a,b,c) pr2(a,b)<<", "<<pr1(c)
#define pr4(a,b,c,d) pr3(a,b,c)<<", "<<pr1(d)
#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<", "<<pr1(e)
#define int long long
#define double long double
using namespace std;
const int N = 100010;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
typedef pair<int,int> P;
typedef long long ll;
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);}
ostream& operator<<(ostream& o,P p){return o<<"("<<p.first<<","<<p.second<<")";}
istream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}
ostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?" ":"")<<t;return o;}
istream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}
void prArr(auto a,string s=" "){int i=0;for(auto t:a)cout<<(i++?s:"")<<t;cout<<endl;}
signed main(){
int n,m;
cin>>n>>m;
vector<int> A(n),B(m);
cin>>A>>B;
auto calc = [](vector<int> A){
int n = A.size();
int res = 0;
for(int i=1;i<n;i++) {
int len = A[i] - A[i-1];
int l = i;
int r = n - i;
res = (res + len * l * r % mod) % mod;
}
return res;
};
int a = calc(A);
int b = calc(B);
int ans= a * b % mod;
cout<<ans<<endl;
return 0;
}
| 0
| 99,383,059
|
#include <iostream>
#include <cstdio>
#include <string>
#define MAX 1001
using namespace std;
string a,b;
int lcs_memo[1001][1001];
int lcs(int i,int j){
if(i==0 || j==0) return 0;
if(lcs_memo[i][j]!=-1) return lcs_memo[i][j];
if(a[i]==b[j]){
lcs_memo[i][j] = lcs(i-1,j-1)+1;
}else{
lcs_memo[i][j] = max(lcs(i,j-1),lcs(i-1,j));
}
return lcs_memo[i][j];
}
void clear(){
for(int i=0;i<1001;i++){
for(int j=0;j<1001;j++){
lcs_memo[i][j] = -1;
}}
}
int main(){
int n; cin>>n;
for(int i=0;i<n;i++){
clear();
cin>>a>>b;
a = ' ' + a;
b = ' ' + b;
cout<<lcs(a.size()-1,b.size()-1)<<endl;
}
}
|
#include<stdio.h>
int main(void)
{
int i,a,cnt[101],max=-1;
for(i=1;i<=100;i++){
cnt[i]=0;
}
while(scanf("%d",&a)!=EOF){
cnt[a]++;
}
for(i=1;i<=100;i++){
if(max<cnt[i]){
max=cnt[i];
}
}
for(i=1;i<=100;i++){
if(cnt[i]==max){
printf("%d\n",i);
}
}
return 0;
}
| 0
| 63,212,383
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << int( (a + b) / 2.0 + 0.5) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
using ld = long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
template <class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
struct Edge {
ll to, rev;
long double cap;
Edge(ll _to, long double _cap, ll _rev) {
to = _to;
cap = _cap;
rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,
long double revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if(revFlag)
G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve() {
ll n, k;
cin >> n >> k;
vec<ll> a(n);
REP(i, n) {
cin >> a[i];
}
ll all = 1LL << n;
ll ans = INF;
REP(bit, all) {
ll ma = 0;
ll con = 0;
ll cost = 0;
REP(i, n) {
if((bit >> i) & 1) {
con++;
ma = max(a[i], ma + 1);
cost += ma - a[i];
} else {
if(ma < a[i]) {
con++;
ma = a[i];
}
}
}
if(con >= k) {
chmin(ans, cost);
}
}
cout << ans << en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 0
| 35,422,858
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) sort(v.begin(), v.end())
typedef long long ll;
using Graph = vector<vector<int>>;
float prob(int i,int k){
int cnt = 0;
while (i < k)
{
i *= 2;
cnt++;
}
return cnt;
}
int main(){
double n, k;
cin >> n >> k;
if(n<k){
double p = 0;
for (int i = 1; i <= n;i++)
{
double a = 1.0 / n;
double b = pow(0.50, prob(i, k));
p += a * b;
}
cout << fixed << setprecision(12) << p << endl;
}else{
double p = 0;
for (int i = 1; i <= k; i++)
{
double a = 1.0 / n;
double b = pow(0.50, prob(i, k));
p += a * b;
}
p += (1.0 - k / n);
cout << fixed<<setprecision(12)<<p << endl;
}
}
|
#include<iostream>
using namespace std;
int main() {
int n, y, m, d;
int totalDays = 999*(5*19+5*20) + 333*5;
cin>>n;
for(int i=0; i<n; i++) {
int ans = totalDays;
cin>>y>>m>>d;
for(int a=1; a<=y; a++) {
if(a != y) {
for(int b=1; b<=10; b++) {
if(a%3==0 || b%2==1) {
ans -= 20;
}
else {
ans -= 19;
}
}
}
else {
for(int b=1; b<m; b++) {
if(a%3==0 || b%2==1) {
ans -= 20;
}
else {
ans -= 19;
}
}
ans -= d-1;
}
}
cout<<ans<<endl;
}
}
| 0
| 14,634,854
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
const int MAX_N = 100;
const int MAX_T = 10000;
int ys[MAX_N];
int main() {
for (;;) {
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if (n == 0) break;
for (int i = 0; i < n; i++) cin >> ys[i];
int min_t = -1;
int k = 0;
for (int t = 0; t <= MAX_T; t++) {
if (x == ys[k]) k++;
if (k >= n) {
min_t = t;
break;
}
x = (a * x + b) % c;
}
cout << min_t << endl;
}
return 0;
}
|
#include <algorithm>
#include <climits>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <type_traits>
#include <vector>
#include <stdio.h>
using ll = long long;
using namespace std;
ll to5(ll a) { return a * a * a * a * a; }
int main() {
ios::sync_with_stdio(false);
int n, y;
cin >> n >> y;
for (int i = 0; i <= y / 10000; i++) {
for (int j = 0; j <= (y - 10000 * i) / 5000; j++) {
int k = n - i - j;
if (10000 * i + 5000 * j + 1000 * k == y) {
printf("%d %d %d\n", i, j, k);
return 0;
}
}
}
printf("-1 -1 -1\n");
return 0;
}
| 0
| 92,072,843
|
#include <bits/stdc++.h>
using namespace std;
int facctorialMethod(int k){
int sum = 1;
for (int i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
void solve(){
int n,m,x,count=0,r[2];
scanf("%d",&n);
int a[2][n];
for (int i = 0; i < n; i++)
{
scanf("%d",&a[0][i]);
}
for (int i = 0; i < n; i++)
{
scanf("%d",&a[1][i]);
}
vector<int> v;
for(int i=0;i<2;i++){
r[i]=1;
for (int i = 1; i <= n; i++)
{
v.push_back(i);
}
for(int j=0;j<n;j++){
auto x=find(v.begin(),v.end(),a[i][j]);
int a=distance(v.begin(),x);
r[i]+=facctorialMethod(v.size()-1)*a;
v.erase(x);
}
}
printf("%d",abs(r[0]-r[1]));
}
int main(){
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(m) for(int i=0; i<m; i++)
#define frj(m) for(int j=0; j<m; j++)
#define frr(n) for(int i=n; i>=0; i--)
#define pb push_back
#define orr ||
#define nl \n
#define sci(n) scanf("%lld ", &n)
#define pri(n) printf("%d", n)
#define prl(n) printf("%lld", n)
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
bool compare(ll a, ll b){
return(a>b);
}
int main()
{
ll n;
cin>>n;
ll arr[n];
fr(n) cin>>arr[i];
ll maxi=*max_element(arr,arr+n),mini=*min_element(arr,arr+n),current,sum=0,ans=INT_MAX;
ll a=-100;
fr(201){
sum=0;
current=a++;
frj(n){
sum+=(abs(arr[j]-current)*abs(arr[j]-current));
}
ans=min(ans,sum);
}
cout<<ans<<endl;
return 0;
}
| 0
| 64,628,665
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int H,W;
scanf("%d %d",&H,&W);
for (int k=0;k<10000;k++){
if (H==0 && W==0){
break;
}
else{
for (int i=0;i<=H-1;i++){
for (int j=0;j<=W-1;j++){
printf("#");
}
printf("\n");
}
printf("\n");
scanf("%d %d",&H,&W);
}
}
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
int a, b;
int r;
int d;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (double)a / b;
printf("%d %d %f\n", d, r, f);
return 0;
}
| 0
| 45,357,173
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
string s;
int main()
{
_FastIO;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(s[i] == '1')
cout << '9';
else
cout << '1';
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> finalpos;
long long initpos[100005];
long long finpos[100005];
bool clockwise[100005];
long long finalans[100005];
long long n,l,T;
int main(){
scanf("%lld%lld%lld",&n,&l,&T);
for (int x = 0; x<n; x++){
int t;
scanf("%lld%d",&initpos[x],&t);
clockwise[x]= (t==1);
}
for (int x = 0; x<n; x++){
finalpos.push_back(((initpos[x]+(clockwise[x]?T:(-T)))+T*l)%l);
finpos[x] = finalpos[x];
}
sort(finalpos.begin(),finalpos.end());
int finalnum = 0;
for (int x = 1; x<n; x++){
if (clockwise[0]&&!clockwise[x]) {
finalnum += 2*(T/l);
int dist1 = initpos[x]-initpos[0];
int dist2 = dist1+l;
if ((T%l)*2<=dist1) ;
else if ((T%l)*2<=dist2) finalnum++;
else finalnum += 2;
}
if (clockwise[x]&&!clockwise[0]){
finalnum -= 2*(T/l);
int dist1 = initpos[0]+l-initpos[x];
int dist2 = dist1+l;
if ((T%l)*2<dist1) ;
else if ((T%l)*2<dist2) finalnum--;
else finalnum -= 2;
}
finalnum%=n;
}
finalnum+=n;
finalnum%=n;
int t = lower_bound(finalpos.begin(),finalpos.end(),finpos[0])-finalpos.begin();
finalans[finalnum] = finalpos[t];
for (int x = 1; x<n; x++){
finalans[(finalnum+x)%n] = finalpos[(t+x)%n];
}
for (int x = 0; x<n; x++){
printf("%d\n",finalans[x]);
}
}
| 0
| 10,704,865
|
#include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
constexpr int NINF = std::numeric_limits<int>::min();
using namespace std;
void solve() {
int N; cin >> N;
int ans = N*(N-1)/2;
cout << ans << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
int rp = 0;
ll ans = 0;
ll sum = 0;
ll xsum = 0;
for ( int lp = 0; lp < n; ++lp ) {
while(1) {
if ( rp >= n || (sum + a[rp]) != (xsum ^ a[rp]) ) break;
sum += a[rp];
xsum ^= a[rp];
++rp;
}
ans += rp - lp;
if ( rp == lp ) ++rp;
else {
sum -= a[lp];
xsum ^= a[lp];
}
}
cout << ans << endl;
return 0;
}
| 0
| 51,969,570
|
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
struct edge { int to, cost; };
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> P;
const int INF = 1e9;
const double EPS = 1e-10;
const int MOD = 1e9+7;
const double PI = acos(-1.0);
int main()
{
int a,b,c;
cin >> a >> b >> c;
cout << (a == b && b == c ? "Yes" : "No") << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define jfor(stt,llim) for(int j=stt;j<llim;j++)
#define eifor(st,lim) for(int i=st;i<=lim;i++)
#define ejfor(stt,llim) for(int j=stt;j<=llim;j++)
#define blank cout<<'\n'
void solve()
{
string s; cin>>s;
int sum = 0;
for(char c : s) sum+=c-'0';
if(sum%9 == 0) cout<<"Yes";
else cout<<"No";
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
while(t--){
solve();
}
}
| 0
| 46,895,728
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a<b&&b<c) printf("Yes\n");
else printf("No\n");
return 0;
}
|
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define putr(a) rep(testIncrement,0,a.size()) {puts(a[testIncrement]);} cout << endl
#define putrr(a) rep(Incr1,0,a.size()) {rep(Incr2,0,a[Incr1].size()) {puts(a[Incr1][Incr2]);} cout<<endl;} cout<<endl;
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define PI (acos(-1))
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
SINT64 N; cin >> N;
SINT64 M; cin >> M;
SINT64 K; cin >> K;
vector<SINT64> data1(N);
vector<SINT64> data2(M);
vector<Pll> data3;
SINT64 ma1 = 0;
SINT64 ma2 = 0;
rep(i,0,K) {
SINT64 a,b;
cin >> a >> b;
a--; b--;
data1[a]++;
ma1 = MAX(ma1,data1[a]);
data2[b]++;
ma2 = MAX(ma2,data2[b]);
data3.emplace_back(Pll(a,b));
}
SINT64 ans = ma1+ma2;
SINT64 ct1 = 0;
SINT64 ct2 = 0;
rep(i,0,N) {
if (data1[i] == ma1) ct1++;
}
rep(i,0,M) {
if (data2[i] == ma2) ct2++;
}
if ((ct1 * ct2) > K) {
put(ans);
return 0;
}
ct1 *= ct2;
rep(i,0,K) {
if ((data1[data3[i].F] == ma1) && (data2[data3[i].S] == ma2)) {
ct1--;
} else {
}
}
if (ct1 == 0) {
put(ans-1);
} else {
put(ans);
}
return 0;
}
| 0
| 31,357,839
|
#include <iostream>
#include<vector>
using namespace std;
int h[105];
int cnt=0;
int main()
{
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int left = 1;
while (left <= n) {
if (h[left] == 0) {
left++;
continue;
}
for (int i = left; i <= n; i++) {
if (h[i] == 0 ) {
cnt++;
break;
}
h[i]--;
if (i == n) {
cnt++;
}
}
}
cout << cnt << endl;
return 0;
}
|
#include <set>
#include <vector>
#include <iostream>
using namespace std;
#define int long long
const int N = 3e5 + 10;
int c[N];
vector<int> r[N];
set<pair<int, int>> sc;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h, w, m;
cin >> h >> w >> m;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
r[x].push_back(y);
++c[y];
}
for (int i = 1; i < N; ++i) {
sc.insert({c[i], i});
}
int ans = 0;
for (int i = 1; i < N; ++i) {
for (int &y : r[i]) {
sc.erase(sc.find({c[y], y}));
sc.insert({c[y] - 1, y});
}
auto it = sc.end();
--it;
ans = max(ans, it->first + (int)r[i].size());
for (int &y : r[i]) {
sc.erase(sc.find({c[y] - 1, y}));
sc.insert({c[y], y});
}
}
cout << ans;
return 0;
}
| 0
| 39,566,736
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#define _GLIBCXX_DEBUG
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
int max_cnt=0;
int cnt=0;
int H;
cin >> H;
for(int i=1;i<N;i++){
int h;
cin >> h;
if(h <= H){
cnt++;
}
else{
cnt = 0;
}
if(max_cnt < cnt){
max_cnt = cnt;
}
H = h;
}
cout << max_cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j); i < (N);i++)
const int maxn = 100;
char G[maxn][maxn];
void print(){
printf("100 100\n");
_for(i,0,maxn){
_for(j,0,maxn){
printf("%c",G[i][j]);
}
printf("\n");
}
}
int main()
{
int A,B;
scanf("%d %d",&A,&B);
_for(i,0,maxn){
_for(j,0,100){
if(j < 50) G[i][j] = '.';
else G[i][j] = '#';
}
}
int r = 0,l = 0;
_for(i,1,B){
G[r][l] = '#';
l+=2;
if(l >= 48){
l = 0;
r+=2;
}
}
r = 0,l = 51;
_for(i,1,A){
G[r][l] = '.';
l+=2;
if(l >= 99){
l = 51;
r+=2;
}
}
print();
return 0;
}
| 0
| 41,029,209
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <string>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <fstream>
using namespace std;
long long mod=1e9+7;
int main(){
int n;
string s;
cin>>n>>s;
vector<int> c[26];
for(int i=0;i<n;i++){
c[s[i]-'a'].push_back(i);
}
long long ans=1;
for(int i=0;i<26;i++){
(ans*=(1+c[i].size()))%=mod;
}
(ans+=mod-1)%=mod;
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
ll f[3000000] = {0};
ll mod_pow(ll x, ll n){
ll res = 1LL;
while(n > 0){
if(n & 1) res = res * x % mod;
x = x*x % mod;
n >>= 1;
}
return res;
}
ll mod_inv(ll x){
return mod_pow(x, mod-2) % mod;
}
ll comb(int n, int r){
return (((f[n] * mod_inv(f[r])) % mod) * mod_inv(f[n-r])) % mod;
}
int main(){
int x,y;
cin >> x >> y;
if((x+y)%3!=0) cout<<0<<endl;
else{
int n1 = (2*x-y)/3;
int n2 = (2*y-x)/3;
if(n1<0 || n2<0){
cout<<0<<endl;
return 0;
}else{
f[0] = f[1] = 1;
for(int i=2; i<=n1+n2+1000; ++i) f[i] = (i * f[i-1]) % mod;
cout<<comb(n1+n2,n1)<<endl;
}
}
return 0;
}
| 0
| 51,003,744
|
#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>;
const int MOD=1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll ans=0;
rep(i,n-1) {
for(int j=i+1; j<n; j++) {
if(a[i]>a[j]) ans+=(ll)(k+1)*k/2%MOD;
ans%=MOD;
}
}
rep(i,n) {
for(int j=0; j<i; j++) {
if(a[i]>a[j]) ans+=(ll)k*(k-1)/2%MOD;
ans%=MOD;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<ll>> a(n, vector<ll>(3));
for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1] >> a[i][2];
ll res = 0;
for (int i = 0; i <= (1 << 3); i++) {
vector<int> state(3, 1);
for (int j = 0; j < 3; j++)
if ((1 << j) & i)
state[j] = -1;
vector<ll> nums;
for (int j = 0; j < n; j++) {
ll cur = 0;
for (int k = 0; k < 3; k++) {
if (state[k] * a[j][k] > 0) cur += abs(a[j][k]);
else cur -= abs(a[j][k]);
}
nums.push_back(cur);
}
sort(nums.rbegin(), nums.rend());
ll ans = 0;
for (int j = 0; j < m; j++)
ans += nums[j];
res = max(res, ans);
}
cout << res << '\n';
return 0;
}
| 0
| 12,724,137
|
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x)),(x).end()))
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#ifdef LOCAL
#define debug(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<(x)<<endl
#define debug_vec(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = ";\
rep(i,sz(x)){cerr<<x[i]<<" ";}cerr<<endl
#define debug_mat(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<endl;\
rep(i,sz(x)){rep(j,sz(x[i])){cerr<<x[i][j]<<" ";}cerr<<endl;}cerr<<endl
#else
#define debug(x) void(0)
#define debug_vec(x) void(0)
#define debug_mat(x) void(0)
#endif
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N,Q;
cin >> N >> Q;
dsu d(N);
rep(_,Q){
int t,u,v;
cin >> t >> u >> v;
if(t==0){
d.merge(u,v);
}
else if(t==1){
if(d.same(u,v)) cout << 1 << endl;
else cout << 0 << endl;
}
}
return 0;
}
|
#include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bitset>
#include <utility>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll x, ll y) {
ll tmp = 0;
if (x < y){
tmp=x;
x=y;
y=tmp;
}
while (y > 0) {
ll r = x % y;
x = y;
y = r;
}
return x;
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
const int MAX = 1e6+1;
const int MOD = 1e9+7;
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;
}
ll kaijo(ll k){
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum *= i;
sum%=1000000000+7;
}
return sum;
}
ll lmax(ll s,ll t){
if(s>t){
return s;
}
else{
return t;
}
}
ll lmin(ll s,ll t){
if(s<t){
return s;
}
else{
return t;
}
}
long long modpow(long long res,long long a, long long n, long long mod) {
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
vector<bool> IsPrime;
void sieve(size_t max){
if(max+1 > IsPrime.size()){
IsPrime.resize(max+1,true);
}
IsPrime[0] = false;
IsPrime[1] = false;
for(size_t i=2; i*i<=max; ++i)
if(IsPrime[i])
for(size_t j=2; i*j<=max; ++j)
IsPrime[i*j] = false;
}
int main(){
int x,y;
cin>>x>>y;
if(x%y==0) cout<<-1<<endl;
else cout<<x<<endl;
return 0;
}
| 0
| 1,179,104
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, ex, area, r;
scanf("%d %d", &a, &b);
area = a*b;
ex = a+b-1;
r = area-ex;
printf("%d\n", r);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
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; }
using namespace std;
vector<pair<char, long long>> RunLengthEncoding(string s){
vector<pair<char, long long>> ret;
long long i = 0, n = s.size();
while(i<n){
char tmp = s[i];
long long cnt = 1;
while(i<n){
i++;
if(tmp == s[i]) cnt++;
else break;
}
ret.push_back(make_pair(tmp, cnt));
}
return ret;
}
int main(){
Init();
string s; ll k;
cin >> s >> k;
auto rle = RunLengthEncoding(s);
if(rle.size() == 1){
cout << (s.size()*k)/2 << endl;
}
else{
ll loopCnt = 0;
rep(i, s.size()-1){
if(s[i] == s[i+1]){
loopCnt++;
i++;
}
}
if(rle[0].first != rle[rle.size()-1].first){
cout << loopCnt*k << endl;
}
else{
ll sub = (rle[0].second/2 + rle[rle.size()-1].second/2 - (rle[0].second+rle[rle.size()-1].second)/2)*(k-1);
cout << loopCnt*k-sub << endl;
}
}
}
| 0
| 49,982,832
|
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#define pii pair<int,int>
#define infinity 10000000000000000
#define mod 1000000007
int fx[]={0,0,+1,-1};
int fy[]={+1,-1,0,0};
using namespace std;
const int maX=1e5+1;
vector<ll>Graph[maX],cost[maX];
ll visit[maX];
ll x[10];
ll y[10];
int main()
{
ll n,i,j;
cin>>n;
double sum=0.0,cc=0.0;
for(i=1;i<=n;i++){
string str;
double x;
cin>>x>>str;
if(str=="JPY")sum+=x*1.0;
else{
sum+=(x*380000.0);
}
}
cout<<sum<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,x,i,j;
cin>>n;
set<ll>st;
for( i=0; i<n; i++)
{
cin>>x;
st.insert(x);
}
if(st.size()==n)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
| 0
| 62,193,022
|
#include<bits/stdc++.h>
#include <cstdlib>
using namespace std;
int N,M,i,cnt;
int main(void){
cin >> N >> M;
int a[M];
for(i=0;i<M;i++){
cin >> a[i];
}
int b[N+1];
for(i=0;i<=N;i++){
b[i]=1;
}
for(i=0;i<M;i++){
b[a[i]]=0;
}
int dp[N+1];
for(i=0;i<=N;i++){
dp[i]=0;
}
dp[0]=1;
if(b[0]==1){
dp[1]=1;
}
for(i=2;i<=N;i++){
if(b[i-1]==1){
dp[i] = dp[i] + dp[i-1];
}
if(b[i-2]==1){
dp[i] = dp[i] + dp[i-2];
}
dp[i] = dp[i]%1000000007;
}
cnt = dp[N];
printf("%d\n",cnt);
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
struct Event {
int64_t x;
int64_t num;
};
int main() {
int N, D, A;
cin >> N >> D >> A;
using P = pair<int, int>;
vector<P> enemy(N);
rep(i, N) {
int x, h;
cin >> x >> h;
enemy[i] = P(x, h);
}
sort(enemy.begin(), enemy.end());
auto cmp = [](const Event& lh, const Event& rh) { return lh.x > rh.x; };
priority_queue<Event, vector<Event>, decltype(cmp)> q(cmp);
int64_t result = 0;
int64_t cnt = 0;
rep(i, N) {
int x, h;
tie(x, h) = enemy[i];
while (!q.empty() && q.top().x <= x) {
cnt -= q.top().num;
q.pop();
}
int64_t res = (h + A - 1) / A - cnt;
if (res > 0) {
result += res;
cnt += res;
Event bomb = {(int64_t)x + 2 * D + 1, res};
q.push(bomb);
}
}
cout << result << endl;
return 0;
}
| 0
| 70,618,179
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
vector<int> S(4);
for(int i=0;i<4;i++){
cin >> S[i];
}
sort(S.begin(),S.end());
if(S.size()==4 && S[0]==1 && S[1]==4 && S[2]==7 && S[3]==9){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i, n) cin >> v[i];
int ab = 0, ba = 0, bx = 0, xa = 0;
for (string s: v) {
rep(i, s.size() - 1) {
if (s.substr(i, 2) == "AB") ab++;
}
}
for (string s: v) {
if (s.front() == 'B' && s.back() == 'A') ba++;
else if (s.front() == 'B') bx++;
else if (s.back() == 'A') xa++;
}
if (ba == 0) {
int add = min(bx, xa);
cout << add + ab << endl;
} else {
ll c = ba - 1 + ab;
if (xa > 0) {
xa--;
c++;
}
if (bx > 0) {
bx--;
c++;
}
c += min(xa, bx);
cout << c << endl;
}
}
| 0
| 50,331,596
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
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; }
void func(long long N, std::vector<long long> A){
SORT(A);
lli start = 0;
lli nowSize = A[0];
lli now = 1;
while(now<N){
if(nowSize*2 < A[now]){
start = now;
}
nowSize += A[now];
now++;
}
cout<<N-start<<endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
func(N, std::move(A));
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define scout cout << fixed << setprecision(20)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int h,w;
cin >> h >> w;
char s[h][w];
rep(i,h)rep(j,w) cin >> s[i][j];
bool ok=true;
for(int i=1;i<h-1;i++) {
for(int j=1;j<w-1;j++) {
if(s[i][j]=='#') {
if(s[i-1][j]=='.'&&s[i][j-1]=='.'&&s[i+1][j]=='.'&&s[i][j+1]=='.') ok = false;
}
}
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 24,294,757
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES"<<endl;
#define Yes cout<<"Yes"<<endl;
#define NO cout<<"NO"<<endl;
#define No cout<<"No"<<endl;
#define yes cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a,a+n);
#define sr() sort(a,a+n,greater<ll>());
#define v() sort(v.begin(),v.end());
#define vr() sort(v.begin(),v.end(),greater<ll>());
#define mod 1000000007
#define fast() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll gcd(ll a, ll b){if(!b)return a;return gcd(b, a % b);}
ll power(ll x,ll y,ll p){ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
int main() {
fast();
{
string s,t;
cin>>s>>t;
ll f=0,n=0,m,count=0;
n=s.length();
m=t.length();
map<char,char>ss,tt;
set<char>sett;
if(n!=m)
No
else
{
for(int i=0;i<m;i++)
{
if(!ss[s[i]])
ss[s[i]]=t[i];
else if(ss[s[i]]!=t[i])
f=1;
if(!tt[t[i]])
tt[t[i]]=s[i];
else if(tt[t[i]]!=s[i])
f=1;
}
if(f)
No
else
Yes
}
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int memo[100000]; for(int i=0;i<m;i++) memo[i]=0;
int ac=0,wa=0;
for(int i=0;i<m;i++)
{
int p;
char s[3];
scanf("%d%s",&p,s);
if(memo[p]!=-1)
if(strcmp(s,"WA")==0)
{
memo[p]++;
}
else
{
wa+=memo[p];
memo[p]=-1;
ac++;
}
}
printf("%d %d\n",ac,wa);
}
| 0
| 11,805,907
|
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
#include <bits/stdc++.h>
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define rrep(i,x) for(long long i=x-1;i>=0;i--)
#define rrepn(i,x) for(long long i=x;i>1;i--)
#define REP(i,n,x) for(long long i=n;i<x;i++)
#define REPN(i,n,x) for(long long i=n+1;i<x;i++)
#define pr printf
#define re return
#define mod 1000000007
#define INF 1e18+5
const double PI=3.14159265358979323846;
#define fi first
#define se second
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
typedef long long int ll;
typedef pair<long long, long long> P;
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
vector<long long> calc_divisor(long long n) {
vector<long long> res;
for (long long i = 1LL; i*i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
long long j = n / i;
if (j != i) res.push_back(j);
}
}
sort(res.begin(), res.end());
return res;
}
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int gcd(const vector<int> &v) {
int ret = v[0];
for (int i = 1; i < v.size(); i++)
ret = gcd(ret, v[i]);
return ret;
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int lcm(const vector<int> &v) {
int ret = v[0];
for (int i = 1; i < v.size(); i++)
ret = lcm(ret, v[i]);
return ret;
}
vector<pair<long long,long long>> g[200020];
ll s[200020];
bool used[200020];
bool dp[100005];
ll A,B,C,D,H,K,M,N,Q,T,W,X,Y;
double dA,dB,dC,dH,dK,dM,dN,dQ,dT,dW,dX,dY;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
long long ans,sum,cnt,cnt1,flg,flg1,flg2;
long long max,max1;
long long min,min1;
long long wk,wk1;
max=max1=wk=wk1=sum=ans=cnt=cnt1=flg1=flg2=0;
min=min1=INF;
double dwk,dwk1,dsum,dsum1,dans,dans1;
dwk=dwk1=dsum=dsum1=dans=dans1=0;
string s;
cin >> s;
rep(i,s.size()){
if(s[i]=='0'){
cnt++;
}
}
pr("%lld",(MIN(cnt,s.size()-cnt))*2);
re 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
bool cmp(pair<long long int ,long long int > a , pair<long long int ,long long int > b){
return a.x > b.x || ((a.x == b.x )&&(a.y>b.y));
}
int main(){
long long int n,m,v,p;
cin >> n >> m >> v >> p;
long long int a[n];
for(long long int i =0;i<n;i++){
cin >> a[i];
}
long long int ans = 0;
sort(a,a+n);
reverse(a,a+n);
auto ok = [&](long long int mid){
if(mid<p) return true;
if(a[mid]+m<a[p-1]) return false;
long long int tot = 0;
for(int i =n-1;i>=mid;i--)
tot+=m;
for(int i =0;i<p-1;i++)
tot+=m;
for(int i = p-1;i<mid;i++)
tot+=(m+a[mid]-a[i]);
return tot>=m*v;
};
long long int lo = 0,hi = n-1;
while(lo<=hi){
long long int mi = (lo+hi)/2;
if(ok(mi))lo=mi+1;
else hi = mi-1;
}
ans = hi+1;
cout << ans << endl;
}
| 0
| 83,657,155
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9+7;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
bool ok = false;
if(abs(a-c) <= d) ok = true;
if(abs(a-b) <= d && abs(b-c)<= d) ok = true;
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <bits/stdc++.h>
#include <ctime>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define TT int test_cases; cin >> test_cases; while(test_cases--)
#define TT1 int test_cases=1; while(test_cases--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long int ll;
int main() {
FAST;
TT1{
int x,y;cin>>x>>y;
if(y%2==1)
{
cout<<"No"<<"\n";continue;
}
int y1=y/2;
int b=y1-x;
if(b>=0 && x>=b) cout<<"Yes"<<"\n";
else cout<<"No"<<"\n";
}
}
| 0
| 51,088,778
|
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n, m, x, mn = 1e18, c[15], arr[15][15];
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m >> x;
for(int i = 0;i < n;++i)
{
cin >> c[i];
for(int j = 0;j < m;++j)
cin >> arr[i][j];
}
for(int i = 1;i < (1LL << n);++i)
{
ll tmp[m], cost = 0;
memset(tmp, 0, sizeof tmp);
for(int j = 0;j < n;++j)
{
if(i & (1LL << j))
{
cost += c[j];
for(int k = 0;k < m;++k)
tmp[k] += arr[j][k];
}
}
bool valid = 1;
for(int j = 0;j < m;++j)
if(tmp[j] < x)
valid = 0;
if(valid) mn = min(mn, cost);
}
cout << (mn == 1e18 ? -1 : mn);
return 0;
}
|
#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<vector<int> > dp(n,vector<int>(3,0));
for(int i=0;i<n;i++){
int a,b,c;
cin>>a>>b>>c;
if(i==0)
dp[i][0]=a,dp[i][1]=b,dp[i][2]=c;
else{
dp[i][0]=max(dp[i-1][1],dp[i-1][2])+a;
dp[i][1]=max(dp[i-1][0],dp[i-1][2])+b;
dp[i][2]=max(dp[i-1][0],dp[i-1][1])+c;
}
}
cout<<max(dp[n-1][0],max(dp[n-1][1],dp[n-1][2]));
return 0;
}
| 0
| 4,819,959
|
#include <cstring>
#include <algorithm>
#include <iostream>
struct Card {
char suit;
unsigned int rank;
};
static void print_cards(const Card cards[], const unsigned int n)
{
const char* sep = "";
for (unsigned int i = 0u; i < n; ++i) {
const Card* const cardp = &cards[i];
std::cout << sep << cardp->suit << cardp->rank;
sep = " ";
}
std::cout << std::endl;
}
static void bubble_sort(Card cards[], const unsigned int n)
{
for (unsigned int j = 0u; j < n-1; ++j) {
for (unsigned int i = n-1; i > j; --i) {
if (cards[i].rank < cards[i-1].rank) {
std::swap(cards[i], cards[i-1]);
}
}
}
}
static void selection_sort(Card cards[], const unsigned int n)
{
for (unsigned int i = 0u; i < n-1; ++i) {
unsigned int min_j = i;
for (unsigned int j = i+1; j < n; ++j) {
if (cards[j].rank < cards[min_j].rank) {
min_j = j;
}
}
if (i != min_j) {
std::swap(cards[i], cards[min_j]);
}
}
}
int main()
{
unsigned int n;
std::cin >> n;
Card cards1[n], cards2[n];
for (unsigned int i = 0u; i < n; ++i) {
std::cin >> cards1[i].suit;
std::cin >> cards1[i].rank;
}
std::memcpy(cards2, cards1, sizeof(cards1));
bubble_sort(cards1, n);
print_cards(cards1, n);
std::cout << "Stable" << std::endl;
selection_sort(cards2, n);
print_cards(cards2, n);
if (std::memcmp(cards1, cards2, sizeof(cards1)) == 0) {
std::cout << "Stable" << std::endl;
} else {
std::cout << "Not stable" << std::endl;
}
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
int N;
cin>>N;
vector<string> S(N);
for (string &s: S)
cin>>s;
int ans = 0;
for (int A=0; A<N; A++)
{
bool ok = true;
for (int i=0; i<N; i++)
for (int j=0; j<N; j++)
if (S[(i+A)%N][j] != S[(j+A)%N][i])
ok = false;
if (ok)
ans += N;
}
cout<<ans<<endl;
}
| 0
| 99,551,294
|
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = Y-1;(X) >= 0;--(X))
#define repa(X,A,Y) for (int (X) = A;(X) <= (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define mod(n, m) (((n)%(m)+(m))%m)
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
const int INFINT = 1 << 30;
const ll INFLL = 1LL << 60;
const double EPS = 1e-10;
const int MOD = 1000000007;
ll N, A, B;
int main() {
std::ios::sync_with_stdio(false);std::cin.tie(0);
cin >> N >> A >> B;
if (N < A+B-1 || N > A*B) {
cout << -1 << endl;
return 0;
}
vector<int> ans;
for (int i = 1; i <= A; ++i) ans.push_back(N-A+i);
int remain = N-A;
if (B != 1) {
int size = remain/(B-1);
int rest = remain%(B-1);
for (int i = 1; i <= B-1; ++i) {
if (i <= rest) {
for (int i = 1; i <= size+1; ++i) {
ans.push_back(remain-size-1+i);
}
remain -= size+1;
} else {
for (int i = 1; i <= size; ++i) {
ans.push_back(remain-size+i);
}
remain -= size;
}
}
}
for (int i = 0; i < ans.size(); ++i) cout << ans[i] << (i+1 == ans.size() ? '\n' : ' ');
return 0;
}
|
#include<iostream>
#include<complex>
using namespace std;
int main(){
for(;;){
complex<double> p[4];
for(int i=0;i<4;i++){
double x,y;
if(!(cin>>x>>y))return 0;
p[i]=complex<double>(x,y);
}
int s=0;
for(int i=0;i<3;i++){
complex<double> e=p[(i+1)%3]-p[i],c=p[3]-p[i];
s|=(e.real()*c.imag()-e.imag()*c.real()>0)<<i;
}
cout<<((s==0||s==7)?"YES":"NO")<<endl;
}
return 0;
}
| 0
| 52,967,354
|
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
int c, d;
if (a%2 == 0) {
c = a/2 * 25;
d = c+12;
} else {
d = (a+1)/2 * 25;
c = d-12;
d--;
}
int e = b * 10;
int f = (b+1)*10;
bool found = false;
for (int i = c; i <= d; i++) {
if (i >= e && i < f) {
cout << i << endl;
found = true;
break;
}
}
if (!found)
cout << -1 << endl;
return 0;
}
|
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#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 repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
ll n;
ll proc(vector<string>& mp, ll cy, ll cx) {
ll ans = 0;
ll st = 0;
while (cx <= n - 1 && cy <= n - 1) {
bool ok = true;
if (st == 0) {
repLRE(i, 1, n - 1) {
rep(j, i) {
if (mp[cy + j][cx + i] != mp[cy + i][cx + j]) {
ok = false;
cx = cx + i + 1, cy = cy + i + 1;
st = 0;
break;
}
}
if (!ok) break;
}
if (ok) {
st = 1, ans++, cx++, cy++;
}
} else {
rep(j, n - 1) {
if (mp[cy + j][cx + n - 1] != mp[cy + n - 1][cx + j]) {
ok = false;
cx = cx + n, cy = cy + n;
st = 0;
break;
}
}
if (ok) {
st = 1, ans++, cx++, cy++;
}
}
}
return ans;
}
int main() {
cout << fixed << setprecision(15);
cin >> n;
if (n == 1) {
cout << 1 << endl;
return 0;
}
vector<string> mp(2 * n);
rep(i, n) {
cin >> mp[i];
mp[i] += mp[i];
mp[n + i] = mp[i];
}
ll ans = 0;
repLRE(i, 0, n - 1) {
ll cy = 0, cx = i;
ans += proc(mp, cy, cx);
}
repLRE(i, 1, n - 1) {
ll cy = i, cx = 0;
ans += proc(mp, cy, cx);
}
cout << ans << endl;
}
| 0
| 78,005,015
|
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(ll i=0;i<(n);++i)
#define _rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define _repe2(i,n) for(ll i=0;i<=(ll)(n);++i)
#define _repe3(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);++i)
#define repe(...) _overload3(__VA_ARGS__,_repe3,_repe2)(__VA_ARGS__)
#define _rrep2(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define _rrep3(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2)(__VA_ARGS__)
#define _rrepe2(i,n) for(ll i=(ll)(n);i>=0;i--)
#define _rrepe3(i,a,b) for(ll i=(ll)(b);i>=(ll)(a);i--)
#define rrepe(...) _overload3(__VA_ARGS__,_rrepe3,_rrepe2)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
template<class T>
bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
template<class T>
using pq=priority_queue<T,vector<T>,greater<T>>;
vl H;
vl M;
ll K;
void solve();
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
H = vl(2);
M = vl(2);
for(int i = 0; i < 2; ++i){
cin >> H[i];
cin >> M[i];
}
cin >> K;
solve();
}
void solve(){
ll t=H[1]*60+M[1]-(H[0]*60+M[0]);
cout<<t-K<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
while((H!=0)||(W!=0)){
for(int i=0; i<W; i++) cout << "#";
cout << endl;
for(int i=0; i<H-2; i++){
cout << "#";
for(int j=0; j<W-2; j++){
cout << ".";
}
cout << "#" << endl;
}
for(int i=0; i<W; i++) cout << "#";
cout << endl;
cout << endl;
cin >> H >> W;
}
return 0;
}
| 0
| 7,008,844
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
void bfs(vector<vector<int>> &gr, vector<bool> &chk, vector<int> °, vector<int> &ans, int i){
queue<int> q;
q.push(i);
chk.at(i) = true;
while(!q.empty()){
int now = q.front(); q.pop();
ans.push_back(now);
for(auto nx : gr.at(now)){
deg.at(nx)--;
if(deg.at(nx) == 0 && chk.at(nx) == false){
chk.at(nx) = true;
q.push(nx);
}
}
}
}
int main(){
int v, e;
cin >> v >> e;
vector<int> deg(v, 0);
vector<vector<int>> gr(v, vector<int>());
rep(i, e){
int s, t;
cin >> s >> t;
gr.at(s).push_back(t);
gr.at(t).push_back(s);
deg.at(t)++;
}
vector<bool> chk(v, false);
vector<int> ans;
rep(i, v){
if(deg.at(i) == 0 && chk.at(i) == false){
bfs(gr, chk, deg, ans, i);
}
}
for(int i : ans){
cout << i << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
long long n, m, a, b, ans = 0;
cin >> n >> m;
vector<pair<long long, long long>> e;
for(long long i = 0; i < n; ++i){
cin >> a >> b;
e.push_back(make_pair(a,b));
}
sort(e.begin(), e.end());
long long i = 0, rest = m;
while(rest > 0){
if(rest >= e.at(i).second){
ans += e.at(i).first * e.at(i).second;
rest -= e.at(i).second;
}
else{
ans += e.at(i).first * rest;
break;
}
i++;
}
cout << ans << endl;
return 0;
}
| 0
| 56,813,320
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9+7;
const ll inf_l = 1e18;
const int MAX = 1e6;
int main() {
string s; cin >> s;
int k; cin >> k;
int ct = 1;
int n = s.size();
set<char> st;
rep(i,n) st.insert(s[i]);
if (st.size() == 1) {
cout << (ll)n*k/2 << endl;
return 0;
}
int n_1 = 0;
rep(i,n-1) {
if (s[i] == s[i+1]) ct++;
else {
n_1 += ct/2;
ct = 1;
}
}
n_1 += ct/2;
ct = 1;
int n_2 = 0;
rep(i,2*n-1) {
if (s[i%n] == s[(i+1)%n]) ct++;
else {
n_2 += ct/2;
ct = 1;
}
}
n_2 += ct/2;
int diff = n_2 - n_1;
ll ans = n_1 + (ll)diff*(k-1);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<rhs.size(); ++i){ std::cout<<rhs[i]<<' '; }
std::cout<<"]"<<std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>>& rhs){
std::cout<<" = "<<std::endl;
std::cout<<"[[ ";
for(uint p=0; p<rhs.size(); ++p){
if(p!=0){ std::cout<<" [ "; }
for(uint q=0; q<rhs[p].size(); ++q){
std::cout<<rhs[p][q]<<' ';
}
if(p!=rhs.size()-1){ std::cout<<"]"<<std::endl; }
}
std::cout<<"]]"<<std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR,TL>>& rhs){
std::cout<<" = [";
uint i=0;
for(; i<rhs.size()-1; ++i){ std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"], "; }
std::cout<<"[f: "<<rhs[i].first<<", s: "<<rhs[i].second<<"]]" << endl;
}
#define printn(var) {printf("%s", #var);print(var);}
#define printn_all(var) {printf("%s(%d): ", __func__, __LINE__);printf("%s", #var);print(var);}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64 N, M; cin >> N >> M;
if (N==1 && M==1){ cout << 1 << endl;
}else if(N==1 && M>=2){ cout << (M-2) << endl;
}else if(N>=2 && M==1){ cout << (N-2) << endl;
}else if(N>=2 && M>=2){ cout << (N-2)*(M-2) << endl; }
return 0;
}
| 0
| 65,432,954
|
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 18;
int sum[MAXN+1][1<<MAXN];
int boro[MAXN+1][1<<MAXN];
int main() {
int n;
cin >> n;
for (int i = 0; i < (1<<n); i++) {
cin >> boro[0][i];
sum[0][i] = -1;
}
for (int p = 1; p <= n; p++) {
for (int msk = 0; msk < (1<<n); msk++) {
boro[p][msk] = boro[p-1][msk];
sum[p][msk] = sum[p-1][msk];
if (msk&(1<<(p-1))) {
boro[p][msk] = max(boro[p][msk], boro[p-1][msk^(1<<(p-1))]);
sum[p][msk] = max(sum[p][msk], boro[p-1][msk]+boro[p-1][msk^(1<<(p-1))]);
}
}
}
int mx = -1;
for (int i = 1; i < (1<<n); i++) {
mx = max(mx, sum[n][i]);
cout << mx << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int main(){
int n;
ll L;
cin >> n >> L;
vector<ll> a(n);
rep(i,n) cin >> a[i];
int id = -1;
rep(i,n-1){
if(a[i]+a[i+1]>=L){
id = i;
break;
}
}
if(id==-1){
cout << "Impossible" << endl;
return 0;
}else{
cout << "Possible" << endl;
}
for(int i=0;i<id;i++){
cout << i+1 << endl;
}
for(int i=n-2;i>=id;i--){
cout << i+1 << endl;
}
return 0;
}
| 0
| 98,698,554
|
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) {return (!b ? a : gcd(b, a % b));}
const ll mod = 1e9 + 7;
const int INF32 = 1<<30;
const ll INF64 = 1LL<<60;
const ld pi = 3.141592653589793;
void solve(){
int n;cin >> n;
vector<int>a(n);
for(int i = 0;i<n;i++) cin >> a[i];
int ans = 1;
int mini = a[0];
for(int i = 1;i<n;i++)
if(a[i]<mini){
ans++;
mini = a[i];
}
cout << ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
string s; cin >> s;
int n = (int)s.size();
bool ok = 1;
if(s[0] != 'A') ok = 0;
int cnt = 0;
for(int i = 2; i < n - 1; ++ i) {
if(s[i] == 'C') ++ cnt;
}
if(cnt != 1) ok = 0;
rep(i, n) {
if('A' <= s[i] && s[i] <= 'Z' && s[i] != 'A' && s[i] != 'C') {
ok = 0;
}
}
cout << (ok ? "AC" : "WA") << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 99,974,070
|
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge{
ll to, cost;
};
ll gcd(ll a,ll b){
if(b == 0){
return a;
}else{
return gcd(b, a%b);
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll keta(ll N){
int tmp{};
while( N > 0 ){
tmp += ( N % 10 );
N /= 10;
}
N = tmp;
return N;
}
vector<bool> IsPrime;
void sieve(size_t max){
if(max+1 > IsPrime.size()){
IsPrime.resize(max+1,true);
}
IsPrime[0] = false;
IsPrime[1] = false;
for(size_t i=2; i*i<=max; ++i){
if(IsPrime[i]){
for(size_t j=2; i*j<=max; ++j){
IsPrime[i*j] = false;
}
}
}
}
ll modpow(ll a, ll n){
ll res = 1;
while(n){
if(n & 1){
res = res * a % MOD;
}
a = a * a % MOD;
n = n >> 1;
}
return res;
}
ll MAXN = 2e5+10;
vector<ll> inv(MAXN);
ll nCk(ll n, ll k) {
ll res = 1;
for(ll i = 1; i <= k; i++) {
res = res*(n-i+1) % MOD;
}
for(ll i = 1; i <= k; i++) {
res = res*inv[i] % MOD;
}
return res;
}
bool kai(string S){
bool flag = true;
for(ll i=0;i<S.size()/2;++i){
if(S[i] != S[S.size()-i-1]){
flag = false;
break;
}
}
return flag;
}
int main(){
ll n;
cin>>n;
vector<ll> a(n);
for(ll i=0;i<n;++i){
cin>>a[i];
}
sort(a.begin(), a.end());
ll ansn = a[n-1];
ll ansr = 0;
for(ll i=0;i<n-1;++i){
if(max(ansn - ansr, ansr) - min(ansn - ansr, ansr) > max(ansn - a[i], a[i]) - min(ansn - a[i], a[i])){
ansr = a[i];
}
}
cout<<ansn<<' '<<ansr<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
int a, b;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
a = i;
b = n / i;
}
}
string A, B;
A = to_string(a);
B = to_string(b);
cout << max(SZ(A), SZ(B)) << endl;
}
| 0
| 59,967,882
|
#include<bits/stdc++.h>
using namespace std;
int T;
long long sum,a,b,Min=1e9,flag;
int main(){
scanf("%d",&T);
while(T--){
scanf("%lld%lld",&a,&b);
sum+=b;
if(b<a&&Min>b)Min=b;
if(b!=a)flag=1;
}
if(flag==1)printf("%lld",sum-Min);
else puts("0");
}
|
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define FOR(i,l,r) for( li i = l-(l>r); i != r-(l>r); i += 1-2*(l>r) )
int main() {
li m,k; cin>>m>>k;
li u = (1ll<<m)-1;
if( k > u || ( k == 1 && m <= 1 ) ) {
cout<<"-1\n";
return 0;
}
if( k == 0 ) {
FOR(i,0,u+1) cout<<i<<" "<<i<<" ";
cout<<"\n";
return 0;
}
int a = 1;
if( k == 1 ) a++;
cout<<0<<" "<<k<<" "<<0<<" "<<a<<" "<<(k^a);
deque<li> q;
q.push_back(k);
FOR(i,0,u+1) {
if( i != k && i != 0 && i != a && i != (k^a) ) {
q.push_back(i);
q.push_front(i);
}
}
while( !q.empty() ) {
cout<<" "<<q.front();
q.pop_front();
}
cout<<" "<<(k^a)<<" "<<a<<"\n";
return 0;
}
| 0
| 5,855,361
|
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
using P = pair<int, int>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
const int inf = 1e9;
int n, a, b, c, l[8], ans;
void dfs(int i, int j, int x, int y, int z) {
if (i == n) {
if (x > 0 && y > 0 && z > 0) {
chmin(ans, abs(a - x) + abs(b - y) + abs(c - z) + j - 30);
}
return;
}
dfs(i + 1, j, x, y, z);
dfs(i + 1, j + 10, x + l[i], y, z);
dfs(i + 1, j + 10, x, y + l[i], z);
dfs(i + 1, j + 10, x, y, z + l[i]);
}
void answer() {
cin >> n >> a >> b >> c;
rep(i, n) cin >> l[i];
ans = inf;
dfs(0, 0, 0, 0, 0);
cout << ans << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,a,b;
bool test(int num)
{
int total=0;
while (num)
{
total = total +num%10;
num = num/10;
}
if(total >=a&&total<=b)
{
return true;
}
else
{
return false;
}
}
int main()
{
cin>>n>>a>>b;
int answer=0;
for (size_t i = 1; i <= n; i++)
{
if(test(i))
{
answer = answer + i;
}
}
cout<<answer<<endl;
}
| 0
| 5,312,285
|
#include <iostream>
#include<bits/stdc++.h>
#include <cstring>
using namespace std;
int main()
{
int i, a = 0, b= 0 ;
string s;
cin >> s;
int l= s.size();
for(i = 0; i < l; i+=2)
{
if(s[i]!= '0') a++;
}
for(i = 1; i < l; i+=2)
{
if(s[i]!= '1') b++;
}
int ans = a+b;
if(ans <= l/2) cout << ans;
else cout << l- ans;
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int maN = 1e6+5;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i< n; ++i)
{
cin >> a[i];
}
ll sum = 0;
for(int i = 1; i < n; ++i)
{
if(a[i] < a[i-1] )
{
sum += a[i-1]-a[i];
a[i] += a[i-1]-a[i];
}
}
cout << sum;
return 0;
}
| 0
| 80,501,219
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
int n,sum=0,tmp;
cin >> n;
vector<vector<int> > vec(n,vector<int>(3));
rep(i,n){
cin >> vec.at(i).at(0);
if(!i){
vec.at(i).at(1)=0;
sum+=abs(vec.at(i).at(0));
}
else{
vec.at(i).at(1)=vec.at(i-1).at(0);
vec.at(i-1).at(2)=vec.at(i).at(0);
sum+=abs(vec.at(i).at(0)-vec.at(i).at(1));
}
}
vec.at(n-1).at(2)=0;
sum+=abs(vec.at(n-1).at(0));
rep(i,n){
if(!i)tmp=sum-abs(vec.at(i).at(0))-abs(vec.at(i).at(2)-vec.at(i).at(0))+abs(vec.at(i).at(2));
else tmp=sum-abs(vec.at(i).at(0)-vec.at(i).at(1))-abs(vec.at(i).at(2)-vec.at(i).at(0))+abs(vec.at(i).at(2)-vec.at(i).at(1));
cout << tmp << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (long long i = 0; i < (n); i++)
#define repj(n) for (long long j = 0; j < (n); j++)
#define repk(n) for (long long k = 0; k < (n); k++)
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define itr(itr) for (auto&& v : (itr))
#define updatemax(t, v) (t = std::max(t, (v)))
#define updatemin(t, v) (t = std::min(t, (v)))
ll c[20], a[20][20];
int main() {
ll n, m, x;
cin >> n >> m >> x;
repi(n) {
cin >> c[i];
repj(m) cin >> a[i][j];
}
ll re = LLONG_MAX;
repi(1ll << n) {
vector<ll> xs(m, 0);
ll cost = 0;
repj(n) {
if ((i >> j) & 1) {
cost += c[j];
repk(m) xs[k] += a[j][k];
}
}
bool valid = true;
repj(m) if (xs[j] < x) valid = false;
if (valid) updatemin(re, cost);
}
cout << (re == LLONG_MAX ? -1 : re) << endl;
}
| 0
| 5,252,933
|
#include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, K;
cin >> N >> K;
vector<pair<long long, long long>> ps(N, make_pair(0, 0));
vector<long long> X(N, 0), Y(N, 0);
for (long long i = 0; i < N; ++i) {
long long x, y;
cin >> x >> y;
ps[i].first = x;
ps[i].second = y;
X[i] = x;
Y[i] = y;
}
sort(X.begin(), X.end());
sort(Y.begin(), Y.end());
long long ans = 2000000000LL * 2000000000LL + 10LL;
for (long long i = 0; i < N - 1; ++i) {
for (long long j = 0; j < N - 1; ++j) {
long long x0 = X[i];
long long y0 = Y[j];
bool less = false;
for (long long in = i + 1; in < N; ++in) {
for (long long jn = j + 1; jn < N; ++jn) {
long long xn = X[in];
long long yn = Y[jn];
long long np = 0;
bool ok = true;
for (long long p = 0; p < N; ++p) {
long long x = ps[p].first;
long long y = ps[p].second;
if (x0 <= x && x <= xn && y0 <= y && y <= yn) {
++np;
if (np > K) {
ok = false;
break;
}
}
}
if (ok && np == K) {
ans = min(ans, (xn - x0) * (yn - y0));
}
}
}
}
}
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
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(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<pair<int,int>> c[n+1];
rep(i,m) {
int p, y;
cin >> p >> y;
c[p].push_back(make_pair(y,i+1));
}
rep2(i,1,n+1) sort(all(c[i]));
vector<string> num(m+1);
rep2(i,1,n+1) {
rep(j,c[i].size()) {
string s = to_string(1000000000000 + 1000000 * i + j+1);
num[c[i][j].second] = s.substr(1,12);
}
}
rep2(i,1,m+1) {
cout << num[i] << endl;;
}
return 0;
}
| 0
| 6,210,791
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
rep(i, 0, n) cin >> t[i];
sort(t.begin(), t.end());
int first = t[0], count = 1, ans = 1;
rep(i, 1, n) {
if (t[i] - first > k || count == c) {
first = t[i];
ans++;
count = 1;
} else {
count++;
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define PI 3.1415926535897932384626
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,a,b) for(i=a;i<b;i++)
#define ll long long
#define pb push_back
#define popb pop_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define ini(a) memset(a,-1,sizeof(a))
#define M (ll)(1e9+7)
#define chk(a) cout << endl << #a << " : " << a << endl
#define chk2(a,b) cout << endl << #a << " : " << a << "\t" << #b << " : " << b << endl
#define chk3(a,b,c) cout << endl << #a << " : " << a << "\t" << #b << " : " << b << "\t" << #c << " : " << c << endl
#define chk4(a,b,c,d) cout << endl << #a << " : " << a << "\t" << #b << " : " << b << "\t" << #c << " : " << c << "\t" << #d << " : " << d << endl
using namespace std;
typedef pair<int, int> pi;
typedef pair<int,pi> pii;
typedef pair<ll, ll> pl;
typedef pair<ll,pl> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
void add_self_modulo(ll &a,ll b){
a+=b;
if(a>=M){
a-=M;
}
}
void sub_self_modulo(ll &a,ll b){
a-=b;
if(a<0LL){
a+=M;
}
}
void solve(){
ll n,k,K,i,j,aj;
cin>>n>>K;
ll a[n];
fo(i,n){cin>>a[i];}
vector<ll> dp(K+1,0);
dp[0]=1LL;
fo(i,n){
vector<ll> fake(K+2,0LL);
for(ll used_candies=0;used_candies<=K;used_candies++){
ll limit=min(a[i],K-used_candies);
ll L=used_candies+1;
ll R=used_candies+limit;
if(L>R)continue;
add_self_modulo(fake[L],dp[used_candies]);
sub_self_modulo(fake[R+1],dp[used_candies]);
}
ll prefix_sum=0LL;
for(j=0;j<=K;j++){
add_self_modulo(prefix_sum,fake[j]);
add_self_modulo(dp[j],prefix_sum);
}
}
cout<<dp[K]<<endl;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll t=1;
while(t--){
solve();
}
return 0;
}
| 0
| 60,017,821
|
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n, m;
LL x[N], y[N], z[N];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> x[i] >> y[i] >> z[i];
LL res = 0;
for (int i = 0; i < 1 << 3; i ++ )
{
vector<LL> t;
for (int j = 0; j < n; j ++ )
{
LL sum = 0;
if ((i >> 0) & 1) sum += x[j];
else sum -= x[j];
if ((i >> 1) & 1) sum += y[j];
else sum -= y[j];
if ((i >> 2) & 1) sum += z[j];
else sum -= z[j];
t.PB(sum);
}
sort(t.begin(), t.end());
reverse(t.begin(), t.end());
LL sum = 0;
for (int j = 0; j < m; j ++ ) sum += t[j];
res = max(res, sum);
}
cout << res << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int h, w;
cin >> h >> w;
vector<vector<char>> M(h, vector<char>(w));
rep(i, h){
rep(j, w){
cin >> M[i][j];
}
}
vector<vector<int>> cnt1(h, vector<int>(w, 0)), cnt2(h, vector<int>(w, 0));
rep(i, h){
rep(j, w){
int cnt = 0;
if(M[i][j] == '.'){
for (int k = j; k < w; ++k) {
if(M[i][k] == '.'){
cnt++;
}else{
break;
}
}
for (int k = j; k < w; ++k) {
if(M[i][k] == '.'){
cnt1[i][k] = cnt;
}else{
break;
}
}
j += cnt;
}
}
}
rep(i, w){
rep(j, h){
int cnt = 0;
if(M[j][i] == '.'){
for (int k = j; k < h; ++k) {
if(M[k][i] == '.'){
cnt++;
}else{
break;
}
}
for (int k = j; k < h; ++k) {
if(M[k][i] == '.'){
cnt2[k][i] = cnt;
}else{
break;
}
}
j += cnt;
}
}
}
int ans = 0;
rep(i, h){
rep(j, w){
if(M[i][j] == '.'){
ans = max(ans, cnt1[i][j] + cnt2[i][j] - 1);
}
}
}
cout << ans << "\n";
return 0;
}
| 0
| 65,733,316
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n,q ;
cin>>n>>q ;
unordered_map<int,int> mp ;
rep(i,q){
int x ;
cin>>x ;
rep(i,x){
int c ;
cin>>c ;
mp[c]++ ;
}
}
int count=0 ;
for(int i=1;i<=n;i++){
if(mp.find(i)==mp.end()){
count++ ;
}
}
cout<<count ;
}
int main(){
int y ;
y=1 ;
while(y--)
{
solve() ;
}
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int plus[n];
for (int i=0; i<n; i++) {
int pi;
cin >> pi;
plus[pi-1] = i;
}
for (int i=0; i<n; i++)
cout << n * i + plus[i] + 1 << (i < n-1 ? ' ' : '\n');
for (int i=0; i<n; i++)
cout << n * (n-i-1) + plus[i] + 1 << (i < n-1 ? ' ' : '\n');
return 0;
}
| 0
| 58,508,187
|
#include<bits/stdc++.h>
using namespace std;
long long N, M;
vector<long long> tree[100005];
struct UnionFind
{
vector<int> par;
vector<int> sizes;
UnionFind(int n) : par(n), sizes(n, 1) {
for(int i = 0; i < n; i++){
par[i] = i;
}
}
int find(int x) {
if (x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (sizes[x] < sizes[y]) swap(x, y);
par[y] = x;
sizes[x] += sizes[y];
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return sizes[find(x)];
}
};
long long colarr[100005];
bool nibuhelp(long long pa, long long idx, long long col){
if(colarr[idx] != 0 && colarr[idx] != col){
return false;
}
if(colarr[idx] != 0){
return true;
}
colarr[idx] = col;
for(long long i = 0; i < tree[idx].size(); i++){
if(tree[idx][i] == pa){
continue;
}
if(nibuhelp(idx, tree[idx][i], -1 * col) == false){
return false;
}
}
return true;
}
bool nibu(long long idx){
return nibuhelp(-1, idx, 1);
}
int main(){
cin >> N >> M;
UnionFind uf(N);
for(long long i = 0; i < M; i++){
long long u, v;
cin >> u >> v;
u--;v--;
tree[u].push_back(v);
tree[v].push_back(u);
uf.unite(u, v);
}
set<long long> single;
for(long long i = 0; i < N; i++){
if(uf.size(i) == 1){
single.insert(i);
}
}
long long nibunum = 0;
long long nonnibunum = 0;
set<long long> done;
for(long long i = 0; i < N; i++){
if(single.count(i) != 0){
continue;
}
if(done.count(uf.find(i)) != 0){
continue;
}
done.insert(uf.find(i));
if(nibu(i) == true){
nibunum++;
}else{
nonnibunum++;
}
}
long long ans = 0;
ans += single.size() * N;
ans += N * single.size();
ans -= single.size() * single.size();
ans += nibunum * nibunum * 2;
ans += nibunum * nonnibunum;
ans += nonnibunum * nibunum;
ans += nonnibunum * nonnibunum;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define testcase int t;cin>>t;while(t--)
#define fast_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define pb push_back
#define P pair<int,int>
int dp[1000000];
int dfs(vector<vector<int>> g,int n)
{
if(g[n].size()==0) return 0;
if(dp[n]!=-1) return dp[n];
for(auto x:g[n])
{
dp[n]=max(dp[n],1+dfs(g,x));
}
return dp[n];
}
void solve()
{
lli a,b;
cin>>a>>b;
char arr[a][b];
lli dp[a][b];
for(int i=0;i<a;i++)
{
for(int j=0;j<b;j++)
{
cin>>arr[i][j];
}
}
dp[0][0]=1;
for(lli i=0;i<a;i++)
{
for(lli j=0;j<b;j++)
{
if(i==0&&j==0) continue;
if(arr[i][j]=='#') dp[i][j]=0;
else if(i==0)
{
dp[i][j]=dp[i][j-1];
}
else if(j==0)
{
dp[i][j]=dp[i-1][j];
}
else{
dp[i][j]=(dp[i-1][j]+dp[i][j-1])%1000000007;
}
}
}
cout<<dp[a-1][b-1];
}
int main()
{
fast_io;
solve();
}
| 0
| 1,978,980
|
#include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void write(int x) {if(!x) putchar('0');else print(x);putchar('\n');}
#define lf double
#define ll long long
#define pii pair<int,int >
#define vec vector<int >
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define data asd09123jdf02i3h
#define FOR(i,l,r) for(int i=l,i##_r=r;i<=i##_r;i++)
const int maxn = 1e6+10;
const int inf = 1e9;
const lf eps = 1e-8;
const int mod = 1e9+7;
char s[maxn];
int a,b,n;
int main() {
scanf("%s",s+1);n=strlen(s+1);
ll ans=0;
for(int i=1;i<=n;i++)
if(s[i]=='B') b++;
else ans+=b;
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define FOR(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 1000000000000
#define inf 2,147,483,647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) {
if (b==0) return a;
else return gcd(b, a%b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main() {
ll n,a,b;cin>>n>>a>>b;
if(a>b){
cout<<0<<endl;
}else if(n==1){
if(a!=b){
cout<<0<<endl;
}else{
cout<<1<<endl;
}
}else{
ll tt=b*(n-2);
ll ttt=a*(n-2);
cout<<tt-ttt+1<<endl;
}
return 0;
}
| 0
| 37,189,985
|
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> lig(n+1);
repe(i,1,n)
{
cin >> lig[i];
}
int lighting = 1;
repe(i,1,n)
{
lighting = lig[lighting];
if (lighting == 2) {
cout << i;
return 0;
}
}
cout << -1;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
ll const INF = 1LL << 60;
ll const MAX_N = 510000;
ll const MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
rep(i, N) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll sumA = 0;
ll sumB = 0;
rep(i, N) {
sumA += A[i];
sumB += B[i];
}
if (sumA < sumB) {
cout << "-1" << endl;
return 0;
}
vector<ll> D(N);
rep(i, N) { D[i] = A[i] - B[i]; }
sort(D.begin(), D.end(), greater<ll>());
ll cnt = 0;
ll diff = 0;
for (ll i = N - 1; i >= 0; i--) {
if (D[i] < 0) {
diff += D[i];
cnt++;
} else {
break;
}
}
for (ll i = 0; i < N; i++) {
if (D[i] > 0 && diff < 0) {
diff += D[i];
cnt++;
} else {
break;
}
}
cout << cnt << endl;
return 0;
}
| 0
| 6,143,265
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(i%2 == 0) cout << s[i];
}
cout << endl;
}
|
#include<bits/stdc++.h>
typedef long long ll;
const ll mod=1e9+7;
const ll inf=0x3f3f3f3f;
const int N=1e5+5;
using namespace std;
ll l[N],r[N];
ll a[N];
int main()
{
int n;cin>>n;
for(int i=0;i<=n;i++) cin>>a[i];
if(n==0)
{
if(a[0]==1) cout<<1<<endl;
else cout<<-1<<endl;
return 0;
}
for(int i=n;i>=0;i--)
{
l[i]=(l[i+1]+1)/2+a[i];
r[i]=r[i+1]+a[i];
}
if(l[0]!=1)
{
cout<<-1<<endl;
return 0;
}
ll ans=1,t=1;
for(int i=1;i<=n;i++)
{
t-=a[i-1];
t=min(r[i],t*2);
ans+=t;
}
cout<<ans<<endl;
return 0;
}
| 0
| 75,506,764
|
#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 s;
cin >> s;
int a[1000005];
a[1] = s;
int i = 1;
while(1){
if (a[i]%2 == 0) a[i+1] = a[i]/2;
else a[i+1] = 3*a[i] + 1;
rep (j,i) {
if (a[i+1] == a[j]){
cout << i+1 << endl;
return 0;
}
}
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve() {
int n; cin >> n;
map<int,set<int>> mp;
for (int i = 0; i < n; i++) {
int x; cin >> x;
mp[x].insert(i);
}
vector<ll> res(n, 0);
int sz = 0;
int i = n;
for (auto rit = mp.rbegin(); rit != mp.rend(); rit++) {
auto &ids = rit->second;
auto j = next(rit);
sz += ids.size();
int pre = j==mp.rend()?0:j->first;
int d = rit->first - pre;
i = min(i, *ids.begin());
res[i] += 1ll*d*sz;
}
for (auto& x: res) {
cout << x << ' ';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| 0
| 79,464,563
|
#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)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll H, W;
cin >> H >> W;
vector<vector<char>> S(H+1, vector<char>(W+1,'.'));
for(ll i=1; i<=H; i++){
for(ll j=1; j<=W; j++){
cin >> S[i][j];
}
}
vector<vector<ll>> dp(H+1, vector<ll>(W+1, INF));
if(S[1][1] == '#') dp[1][1] = 1;
if(S[1][1] == '.') dp[1][1] = 0;
for(ll i=1; i<=H; i++){
for(ll j=1; j<=W; j++){
if(S[i][j] == '.'){
dp[i][j] = min(dp[i][j], dp[i-1][j]);
dp[i][j] = min(dp[i][j], dp[i][j-1]);
}
else{
if(S[i-1][j] == '#'){
dp[i][j] = min(dp[i][j], dp[i-1][j]);
}
else{
dp[i][j] = min(dp[i][j], dp[i-1][j]+1);
}
if(S[i][j-1] == '#'){
dp[i][j] = min(dp[i][j], dp[i][j-1]);
}
else{
dp[i][j] = min(dp[i][j], dp[i][j-1]+1);
}
}
}
}
cout << dp[H][W] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) cerr << #v << ":"; rep(i, v.size()) cerr << " " << v[i]; cerr<<endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int n, k;
cin >> n >> k;
vector<int> P(n);
rep(i, n) cin >> P[i];
sort(all(P));
int ans = 0;
rep(i, k) {
ans += P[i];
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 0
| 84,794,270
|
#include<iostream>
#include<cstdio>
using namespace std;
char Cb( char a ){
return a - 32;
}
char Cs( char a ){
return a + 32;
}
int main(){
char a[1200];
fgets(a, 1200, stdin);
for(int i = 0; a[i] != '\0'; i++){
if( a[i] >= 'a' && a[i] <= 'z' )
cout << Cb(a[i]) ;
else if( a[i] >= 'A' && a[i] <= 'Z' )
cout << Cs(a[i]) ;
else
cout << a[i] ;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = long long unsigned;
using P = pair<int,int>;
const int INF=1001001;
const int NMAX=8;
struct pcake{
ll a;
ll b;
ll c;
pcake(ll a1,ll b1,ll c1){
a=a1;b=b1;c=c1;
}
bool operator<(const pcake& other) const {
return a < other.a;
}
};
int main()
{
int x,y,z,k;
cin>>x>>y>>z>>k;
vector<ll> A(x);
vector<ll>B(y);
vector<ll> C(z);
rep(i,x)cin>>A[i];
rep(i,y)cin>>B[i];
rep(i,z)cin>>C[i];
sort(A.begin(),A.end());
sort(B.begin(),B.end());
sort(C.begin(),C.end());
ll now=A[x-1]+B[y-1]+C[z-1];
priority_queue <pair<ll,pcake>> q;
pcake p1(x-1,y-1,z-1);
q.push(make_pair(now,pcake(x-1,y-1,z-1)));
set<ll>s;
rep(i,k){
auto qnow=q.top();
q.pop();
cout<<qnow.first<<endl;
ll a1=qnow.second.a;
ll b1=qnow.second.b;
ll c1=qnow.second.c;
ll hash=a1*100000000+b1*10000+c1;
s.insert(hash);
if (a1>0){
ll s1=A[a1-1]+B[b1]+C[c1];
pcake pnow1(a1-1,b1,c1);
if (s.find((a1-1)*100000000+b1*10000+c1)==s.end())
q.push(make_pair(s1,pnow1));
s.insert((a1-1)*100000000+b1*10000+c1);
}
if (b1>0){
ll s2=A[a1]+B[b1-1]+C[c1];
pcake pnow2(a1,b1-1,c1);
if (s.find(a1*100000000+(b1-1)*10000+c1)==s.end())
q.push(make_pair(s2,pnow2));
s.insert(a1*100000000+(b1-1)*10000+c1);
}
if (c1>0){
ll s3=A[a1]+B[b1]+C[c1-1];
pcake pnow3={a1,b1,c1-1};
if (s.find(a1*100000000+b1*10000+c1-1)==s.end())
q.push(make_pair(s3,pnow3));}
s.insert(a1*100000000+b1*10000+c1-1);
}
}
| 0
| 56,651,715
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
string s;
cin >> s;
if(s.front() != 'A'){
cout << "WA" << endl;
return 0;
}
bool ok1 = false;
bool ok2 = false;
for(int i=2;i<s.size()-1;i++){
if(s[i]=='C'){
if(!ok1) ok1 = true;
else ok2 = true;
}
}
if(!ok1){
cout << "WA" << endl;
return 0;
}
if(ok2){
cout << "WA" << endl;
return 0;
}
int cnt = 0;
for(int i=0;i<s.size();i++){
if(isupper(s[i])) cnt++;
}
if(cnt == 2){
cout << "AC" << endl;
}else{
cout << "WA" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
#define MAX_V 210
int d[MAX_V][MAX_V];
int N;
int main(){
int N,M,R;cin>>N>>M>>R;
vector<int> r(R);rep(i,R){cin>>r[i];r[i]--;}
rep(i,N)rep(j,N)d[i][j]=1e9;
rep(i,M){
int a,b,c;cin>>a>>b>>c;a--,b--;
d[a][b] = c;
d[b][a] = c;
}
rep(k,N){
rep(i,N){
rep(j,N){
d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
}
}
}
ll ans = 1e9;
sort(all(r));
do{
ll ans_tmp = 0;
rep(i,r.size()-1){
ans_tmp += d[r[i]][r[i+1]];
}
ans = min(ans, ans_tmp);
}while(next_permutation(all(r)));
cout << ans << endl;
}
| 0
| 50,511,262
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1000000000000;
int main() {
int v,e,s,t,d;
cin >> v >> e;
long long int table[v][v];
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
table[i][j] = INF;
}
}
for(int i=0;i<v;i++){
table[i][i] = 0;
}
while(e--){
cin >> s >> t >> d;
table[s][t] = d;
}
for(int r=0;r<v;r++){
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
if(table[i][j] > table[i][r] + table[r][j]){
if( ( (table[i][r] == INF) && (table[r][j] < 0 ) ) || ( (table[r][j] == INF) && (table[i][r] < 0 ) ) ) {}
else{
table[i][j] = table[i][r] + table[r][j];
}
}
}
}
}
for(int i=0;i<v;i++){
if(table[i][i] != 0){
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
for(int i=0;i<v;i++){
if(table[i][0] != INF) {
cout << table[i][0];
}
else{
cout << "INF";
}
for(int j=1;j<v;j++){
if(table[i][j] != INF) {
cout << ' ' << table[i][j];
}
else{
cout << ' ' << "INF";
}
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
const int TIME = 24*60*60;
int train_t[TIME+1];
int timeset(string s,int mode){
int h = (s[0] - '0') * 10 + s[1] - '0';
int m = (s[3] - '0') * 10 + s[4] - '0';
int ss = (s[6] - '0') * 10 + s[7] - '0';
int t = h * 60 * 60 + m * 60 + ss;
if(mode)train_t[t] += 1;
else train_t[t] -= 1;
}
int main(){
int n;
while(cin >> n){
if(!n)break;
REP(i,TIME)train_t[i] = 0;
string s;
REP(i,n){
cin >> s;
timeset(s,1);
cin >> s;
timeset(s,0);
}
int max_vehicle = 0;
REP(i,TIME){
train_t[i+1]+= train_t[i];
max_vehicle = max(max_vehicle,train_t[i+1]);
}
cout << max_vehicle << endl;
}
return 0;
}
| 0
| 98,333,073
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
if (n <= 1)
return 1;
if (n <= 3)
return 2;
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return 1;
return 2;
}
ll fact(ll n){ll res = 1;for (ll i = 2; i <= n; i++)res = res * i,res%=1000000007;
return res; }
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll findlcm(ll arr[], int n)
{
ll ans = arr[0];
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) /
(gcd(arr[i], ans)));
return ans;
}
int main()
{
fast;
ll t=1;
while(t--)
{
ll x,t;
cin>>x>>t;
if(x-t<=0)
cout<<"0";
else
cout<<x-t;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int n;
cin>>n;
map<string,int> dict;
rep(i,n){
string s;
cin>>s;
dict[s]++;
}
int m;
cin>>m;
rep(i,m){
string t;
cin>>t;
dict[t]--;
}
int maxv=0;
for(auto itr=dict.begin();itr!=dict.end();itr++){
maxv=max(maxv,itr->second);
}
cout<<maxv<<"\n";
return 0;
}
| 0
| 53,644,745
|
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <cstring>
using namespace std;
long long x[100000];
int next_hotel[30][100000];
int main(){
int N;
cin >> N;
for(int i = 0; i < N; i++){
cin >> x[i];
}
long long L;
cin >> L;
for(int i = 0; i < N; i++){
auto it = upper_bound(x, x + N, x[i] + L);
next_hotel[0][i] = it - x - 1;
}
for(int i = 1; i < 30; i++){
for(int j = 0; j < N; j++){
next_hotel[i][j] = next_hotel[i - 1][next_hotel[i - 1][j]];
}
}
int Q;
cin >> Q;
for(int i = 0; i < Q; i++){
int a;
int b;
cin >> a >> b;
if(a > b){
int tmp = a;
a = b;
b = tmp;
}
a--;
b--;
long long ans = 0;
int cur_hotel = a;
for(int j = 29; j >= 0; j--){
if(next_hotel[j][cur_hotel] < b){
ans += (1 << j);
cur_hotel = next_hotel[j][cur_hotel];
}
}
cout << ans + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<long long,int> P;
int main(){
int n;
cin >> n;
vector<pair<int, int>> r(n), b(n);
rep(i, n){
int x, y;
cin >> x >> y;
r[i] = make_pair(y, x);
}
rep(i, n){
int x, y;
cin >> x >> y;
b[i] = make_pair(x, y);
}
sort(r.begin(), r.end());
sort(b.begin(), b.end());
int cnt = 0;
bool used[n];
rep(i, n) used[i] = false;
rep(i, n){
rrep(j, n){
if(!used[j] && b[i].first > r[j].second && b[i].second > r[j].first){
used[j] = true;
cnt ++;
break;
}
}
}
cout << cnt << endl;
return 0;
}
| 0
| 13,663,550
|
#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>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
struct custom_hash
{
template<class T>
unsigned long long operator()(T v) const
{
unsigned long long x = v;
x += FIXED_RANDOM; x += 11400714819323198485ull;
x = (x ^ (x >> 30)) * 13787848793156543929ull;
x = (x ^ (x >> 27)) * 10723151780598845931ull;
return x ^ (x >> 31);
}
};
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;
template<class T>
void readi(T &x)
{
x = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
x = x * 10 + (c - '0');
c = getchar();
}
if (negative)
{
x = -x;
}
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int buf[20], n = 0;
while(output)
{
buf[n] = ((output % 10));
output /= 10;
n++;
}
for (n--; n >= 0; n--)
{
putchar(buf[n] + '0');
}
return;
}
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << x << endl
#define SZ(x) ((int) (x.size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) x.begin(), x.end()
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 200013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;
int N;
vi arr;
bool check(int x)
{
cerr << "check " << x << endl;
set<pair<pii, int> > s;
s.insert({{0, arr[0] - 1}, 0});
FOR(i, 1, N)
{
if (s.rbegin() -> fi.se < arr[i] - 1)
{
s.insert({{s.rbegin() -> fi.se + 1, arr[i] - 1}, 0});
continue;
}
while(!s.empty() && s.rbegin() -> fi.se >= arr[i])
{
auto p = *s.rbegin();
s.erase(prev(s.end()));
if (p.fi.fi < arr[i])
{
s.insert({{p.fi.fi, arr[i] - 1}, p.se});
}
}
if (s.rbegin() -> se == x - 1)
{
int lt = 0;
while(!s.empty() && s.rbegin() -> se == x - 1)
{
lt = s.rbegin() -> fi.se;
s.erase(prev(s.end()));
}
if (s.empty())
{
return false;
}
if (s.rbegin() -> fi.fi == s.rbegin() -> fi.se)
{
auto p = *s.rbegin();
s.erase(prev(s.end()));
s.insert({{p.fi.se, p.fi.se}, p.se + 1});
}
else
{
auto p = *s.rbegin();
s.erase(prev(s.end()));
s.insert({{p.fi.fi, p.fi.se - 1}, p.se});
s.insert({{p.fi.se, p.fi.se}, p.se + 1});
}
s.insert({{lt, arr[i] - 1}, 0});
}
else
{
if (s.rbegin() -> fi.fi == s.rbegin() -> fi.se)
{
auto p = *s.rbegin();
s.erase(prev(s.end()));
s.insert({{p.fi.se, p.fi.se}, p.se + 1});
}
else
{
auto p = *s.rbegin();
s.erase(prev(s.end()));
s.insert({{p.fi.fi, p.fi.se - 1}, p.se});
s.insert({{p.fi.se, p.fi.se}, p.se + 1});
}
}
if (s.rbegin() -> fi.se < arr[i] - 1)
{
s.insert({{s.rbegin() -> fi.se + 1, arr[i] - 1}, 0});
}
}
return true;
}
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N;
FOR(i, 0, N)
{
int x; cin >> x; arr.PB(x);
}
int lo = 1, hi = N;
while(hi > lo)
{
int mid = (hi + lo) >> 1;
if (check(mid)) hi = mid;
else lo = mid + 1;
}
cout << lo << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
scanf("%d", &n);
vector<long> a(n+1);
rep(i, n+1) {
cin >> a[i];
}
vector<long> b(n);
rep(i, n) {
cin >> b[i];
}
long cnt = 0;
rep(i, n) {
if (a[i] + a[i+1] < b[i]) {
cnt += a[i] + a[i+1];
a[i] = 0;
a[i+1] = 0;
} else {
cnt += b[i];
if (a[i] > b[i]) {
a[i] -= b[i];
} else {
a[i+1] -= b[i] - a[i];
a[i] = 0;
}
}
}
cout << cnt << endl;
}
| 0
| 96,335,048
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
long long white_num = 0;
long long count = 0;
for(int i = 0; i < (int)S.size(); i++){
if(S[i] == 'W'){
count += i - white_num;
white_num++;
}
}
cout << count << endl;
}
|
#include <iostream>
using namespace std;
int main() {
while(true){
int n,m;
float p;
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0)break;
p = (100-p)*0.01;
int x[n+1];
int sum = 0;
for(int i = 1;i <= n;i++){
cin >> x[i];
sum += x[i];
}
int ans = 0;
ans = sum * 100 * p;
if(x[m] == 0) ans = 0;
else ans /= x[m];
cout << ans << "\n";
}
return 0;
}
| 0
| 46,762,018
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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 <fstream>
#include <complex>
#include <math.h>
using namespace std;
inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
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)
#define CLR(a) memset((a), 0 ,sizeof(a))
const long double EPS = 1e-12;
const int INF = 10000;
char mp[22][22];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
bool flag[22][22];
int bfs(int s,int t){
int sum=0;
queue<PII>pi;
pi.push(MP(s,t));
flag[s][t]=true;
while(!pi.empty()){
PII p=pi.front();pi.pop();
sum++;
REP(i,4){
int y=p.first+dy[i],x=p.second+dx[i];
if(mp[y][x]!='#'&&!flag[y][x]){
flag[y][x]=true;
pi.push(MP(y,x));
}
}
}
return sum;
}
int main(){
int W,H;
while(cin>>W>>H){
if(W==0&&H==0)break;
REP(i,22)REP(j,22){
mp[i][j]='#';
}
CLR(flag);
int y,x;
REP(i,H)REP(j,W){
cin>>mp[i+1][j+1];
if(mp[i+1][j+1]=='@'){
mp[i+1][j+1]='.';
y=i+1;x=j+1;
}
}
cout<<bfs(y,x)<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int t;
const int mod=1e9+7;
void add_self(int &a, int b){
a+=b;
if(a>=mod)a-=mod;
}
void test_case(){
int h,w;
cin>>h>>w;
vector<vector<char>>grid(h,vector<char>(w));
vector<vector<int>>dp(h,vector<int>(w));
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin>>grid[i][j];
}
}
dp[0][0]=1;
for(int row=0; row<h; row++){
for(int col=0; col<w; col++){
if(col<w-1&&grid[row][col+1]=='.'){
add_self(dp[row][col+1], dp[row][col]);
}
if(row<h-1&&grid[row+1][col]=='.'){
add_self(dp[row+1][col], dp[row][col]);
}
}
}
cout<<dp[h-1][w-1]<<endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
t=1;
while(t--){
test_case();
}
return 0;
}
| 0
| 1,200,682
|
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typedef long long ll;
using namespace std;
int main() {
int n,ans=0;
cin>>n;
int a[n];
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
if(i==a[a[i]]){
ans++;
}
}
cout<<ans/2;
}
|
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
map<string,int> word_map;
map<string,int>::iterator it;
string s,freq_word,long_word;
int freq_count=0;
while (cin >> s) {
it = word_map.find(s);
if(it == word_map.end()){
word_map.insert(map<string,int>::value_type(s,1));
it = word_map.find(s);
}
else{
(*it).second += 1;
}
if ((*it).second > freq_count) {
freq_count = (*it).second;
freq_word = s;
}
if (s.size() > long_word.size())
long_word = s;
}
cout << freq_word << " " << long_word << endl;
}
| 0
| 33,408,728
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 2147483647;
const ll LINF = 9223372036854775807;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
ll n, x; cin >> n >> x;
VI p(n+1); p[0]=1;
REP(i,n) p[i+1]=p[i]*2+1;
VI a(n+1); a[0]=1;
REP(i,n) a[i+1]=a[i]*2+3;
ll ans=0;
for(int i=n;i>0;i--){
if(x>=a[i]){
ans+=p[i];
x-=a[i];
if(x>=1){
ans++;
x--;
}
}
x--;
}
x=max((ll)0,x);
cout << ans+min((ll)3,x) << endl;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a,b;
int cnt=0;
int m[16]={0};
while(scanf("%d%d",&a,&b),a,b){
int ro[32][32]={{0}};
ro[0][1]=1;
int n;
scanf("%d",&n);
int x,y;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);
ro[y][x]=1;
}
for(int i=1;i<=b;i++){
for(int j=1;j<=a;j++){
if(ro[i][j]==1)ro[i][j]=0;
else ro[i][j]=(ro[i-1][j]+ro[i][j-1]);
}
}
m[cnt]=ro[b][a];
cnt++;
}
for(int i=0;i<cnt;i++){
printf("%d\n",m[i]);
}
return 0;
}
| 0
| 94,852,223
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define Cinint(n) int n;\
cin >> n;
#define Cinvecint(a, n) vector<int> a(n);\
for (int i = 0; i < (int)(n); i++) {\
int num;\
cin >> num;\
a.at(i) = num;\
}
#define Cinstring(s) string s;\
cin >>s;
int main() {
Cinint(s);
Cinint(w);
if (w >= s) {
cout << "unsafe" << endl;
}
else {
cout << "safe" << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string t; int l; cin >> l >> t;
int ans = 0;
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
for (int k = 0; k <= 9; k++) {
bool flag = false;
int l = 0;
for (; l < t.length(); l++) {
if (t[l]-'0' == i) {
flag = true;
l++;
break;
}
}
if (flag == false)
break;
flag = false;
for (; l < t.length(); l++) {
if (t[l]-'0' == j){
flag = true;
l++;
break;
}
}
if (flag == false)
break;
flag = false;
for (; l < t.length(); l++) {
if (t[l]-'0' == k) {
flag = true;
l++;
break;
}
}
if (flag)
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 99,888,863
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int h,w;
cin >> h >> w;
string s;
vector<string> ans;
rep(i,h){
cin >> s;
rep(j,2) ans.push_back(s);
}
rep(i,h*2){
cout << ans[i] << endl;
}
return 0;
}
|
bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define ncouts(x) numout(x),outst[outst_N++] = ' '
#define ncoutn(x) numout(x),outst[outst_N++] = '\n'
#define scouts(x) strout(x),outst[outst_N++] = ' '
#define scoutn(x) strout(x),outst[outst_N++] = '\n'
#define dcouts(x) if(DBG) couts(x)
#define dcoutn(x) if(DBG) coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x,a) (((x)>>(a))&1LL)
#define IBIT(x,a) (((x)>>(a))&1)
#define BCOUNT(x) (__builtin_popcount(x))
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1,T2> &p){is >> p.first >> p.second; return is; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec){ os << "deque["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<class T> using V = vector<T>;
template<class T> using V2 = V<V<T>>;
template<class T> using V3 = V<V2<T>>;
template<class T> using V4 = V<V3<T>>;
char outst[20'000'000]; int outst_N = 0;
char outst_tmp[200];
template<class NUM >
void numout(NUM n){
if(n<0) { n*=-1; outst[outst_N++] = '-';}
if(n==0){ outst[outst_N++] = '0'; return;}
int cnt = 0;
while(n>0){
outst_tmp[cnt++] = '0' + (n % 10);
n /= 10;
}
IFOR(i,0,cnt){
outst[outst_N++] = outst_tmp[i];
}
}
void strout(std::string s){
for(auto x: s){
outst[outst_N++] = x;
}
}
constexpr ll LINF = 1LL << 60;
constexpr int IINF = 1 << 28;
constexpr ll mod = 1'000'000'007;
int dh[] = {1, -1, 0, 0};
int dw[] = {0, 0, 1, -1};
void solve(){
int h, w; cin >> h >> w;
V<string> s(h); cin >> s;
bool able = true;
FOR(i,0,h){
FOR(j,0,w){
if(s[i][j]=='.') continue;
bool ok = false;
FOR(k,0,4){
if(i+dh[k]<0 || i+dh[k]>=h || j+dw[k]<0 || j+dw[k]>=w) continue;
if( s[i+dh[k]][j+dw[k]]=='#') ok = true;
}
if(!ok) {able = false; break;}
}
if(!able) break;
}
if(able) cout << "Yes";
else cout << "No";
}
int main(void){
cin.tie(0);
solve();
return 0;
}
| 0
| 26,594,347
|
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
int a=0,b=0,c;
cin>>c;
rep(i,c){
string d,e;
cin>>d>>e;
if(d<e){b+=3;}
else if(d==e){a++;b++;}
else {a+=3;}
}
cout<<a<<" "<<b<<endl;
}
|
#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;
}
| 0
| 85,714,163
|
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+1-b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
int main(){
int n;
cin >> n;
vector<int> a(n), p(n);
for(int i=0; i<n; ++i){
cin >> a[i];
}
int d = a[0], cnt=1;
for(int i=1; i<n; ++i){
if(a[i] <= d){
cnt++;
d=a[i];
}
}
cout << cnt;
}
| 0
| 19,000,854
|
#include<bits/stdc++.h>
#define INF (1e9)
#define N 1005
using namespace std;
int main(){
int n,a[N];
while(1){
cin>>n;
if(!n)break;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int ans=INF;
for(int i=0;i<n-1;i++)
ans=min(ans,a[i+1]-a[i]);
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int main() {
int a, b, c;
while (cin >> a >> b >> c) {
if (a == 0 && b == 0 && c == 0) break;
int in[a]; rep(i, a) cin >> in[i];
int table[a - 1]; rep(i, a - 1) table[i] = in[i] - in[i + 1];
int ans = 0, num = 0;
rrep(i, b - 1, c) {
if (table[i] == 0) continue;
if (table[i] >= ans) {
ans = table[i];
num = i;
}
}
cout << num + 1 << endl;
}
}
| 0
| 5,410,584
|
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 55, M = 110;
int n, m;
int x[N], y[N];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> x[i] >> y[i];
LL res = 1LL << 62;
for (int i = 0; i < n; i ++ )
for (int j = 0; j < n; j ++ )
for (int k = 0; k < n; k ++ )
for (int l = 0; l < n; l ++ )
if (x[i] <= x[j] && y[k] <= y[l])
{
int cnt = 0;
for (int u = 0; u < n; u ++ )
if (x[u] <= x[j] && x[u] >= x[i] && y[u] <= y[l] && y[u] >= y[k])
cnt ++ ;
if (cnt >= m) res = min(res, (LL)(x[j] - x[i]) * (y[l] - y[k]));
}
cout << res << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
#define jck 3.141592
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
int dp[10100];
int main(){
int N,M; cin >> N >> M;
vector<Pi> A(M);
rep(i,M){
cin >> A[i].first;
}
rep(i,M){
if(A[i].first == 1) A[i].second = 2;
else if(A[i].first == 4) A[i].second = 4;
else if(A[i].first == 6 || A[i].first == 9) A[i].second = 6;
else if(A[i].first == 7) A[i].second = 3;
else if(A[i].first == 8) A[i].second = 7;
else A[i].second = 5;
}
rep(i,10100) dp[i] = -1;
dp[0] = 0;
rep(i,N+1)rep(j,M){
if(i-A[j].second >= 0) dp[i] = max(dp[i],dp[i-A[j].second]+1);
}
sort(A.begin(),A.end(),greater<Pi>());
string ans = "";
int k = dp[N];
while(N > 0){
rep(i,M){
if(N-A[i].second >= 0){
if(dp[N-A[i].second] == k-1){
ans += A[i].first+'0';
k--;
N -= A[i].second;
break;
}
}
}
}
cout << ans << endl;
}
| 0
| 5,723,779
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, dex, A, B, a[N];
int f(int dex) {
return min(abs(a[dex] - A), abs(a[dex] - B));
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
A = a[n - 1] >> 1, B = (a[n - 1] + 1) >> 1;
for (int i = 1; i < n - 1; i++)
if(f(i) < f(dex))
dex = i;
cout << a[n - 1] << ' ' << a[dex];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
string b;
vector<int> a(n);
rep(i,n) cin >> a[i];
if(n%2==0){
for(int i=0; i<n; i+=2){
cout << a[n-1-i] << ' ';
}
for(int i=0; i<n; i+=2){
cout << a[i] << ' ';
}
cout << endl;
return 0;
}
else{
for(int i=0; i<n; i+=2){
cout << a[n-1-i] << ' ';
}
for(int i=1; i<n; i+=2){
cout << a[i] << ' ';
}
cout << endl;
return 0;
}
}
| 0
| 59,608,081
|
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
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; }
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
}
ll ans=a[0]-1;
ll num=2;
for(int i=1;i<n;i++){
if(a[i]==num){
num++;
}
else if(a[i]<num){
continue;
}
else{
ans+=a[i]/num;
if(a[i]%num==0) ans--;
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <functional>
#include <numeric>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
#define REP(i, n) for(int i = 0;i < n;i++)
const long long INF = 1LL << 60;
int MOD = 1000000007;
int main(){
std::ios_base::sync_with_stdio(false);
string s; int x,y;
cin >> s >> x >> y;
vector<int> h; vector<int> v;
int start = 0;
while(start<s.length()&&s[start]=='F'){
start++;
}
x-=start;
bool hor = true;
for(int j=start; j<s.length(); ++j){
if(s[j]=='T'){
hor = !hor;
}else{
int cnt=0;
while(j<s.length()&&s[j]=='F'){
cnt++; j++;
}
--j;
if(hor) h.push_back(cnt);
else v.push_back(cnt);
}
}
vector<bool> ph(8020, false); ph[0]=true;
vector<bool> pv(8020, false); pv[0]=true;
REP(i,h.size()){
vector<bool> t(8020, false);
REP(j, 8020){
if(ph[j]){
t[j+h[i]] = true;
t[abs(j-h[i])] = true;
}
}
ph = t;
}
REP(i,v.size()){
vector<bool> t(8020, false);
REP(j, 8020){
if(pv[j]){
t[j+v[i]] = true;
t[abs(j-v[i])] = true;
}
}
pv = t;
}
if(ph[abs(x)] && pv[abs(y)]) cout << "Yes" << endl;
else cout<<"No"<<endl;
return 0;
}
| 0
| 98,943,869
|
#include<iostream>
using namespace std;
int main(){
int n, y, m, d;
cin>>n;
for(n;n;n--){
cin>>y>>m>>d;
int ans=0;
for(int i=y+1;i<1000;i++){
if(i%3==0) ans+=20*10;
else ans+=(20+19)*5;
}
if(y%3==0) ans+=20*(10-m);
else{
for(int i=m+1;i<=10;i++){
if(i%2) ans+=20;
else ans+=19;
}
}
if(y%3==0) ans+=20-d;
else{
if(m%2) ans+=20-d;
else ans+=19-d;
}
cout<<ans+1<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
void
dfs(int node, ll count, G &arr, vector<bool> seen, vector<long> &to_K)
{
seen[node] = true;
for(auto child: arr[node]){
if(seen[child.first]) continue;
to_K[child.first] = count + child.second;
dfs(child.first, count + child.second, arr, seen, to_K);
}
}
int
main() {
int N; cin >> N;
G arr(N + 1);
rep(i, 0, N - 1){
int a, b, c; cin >> a >> b >> c;
arr[a][b] = c;
arr[b][a] = c;
}
vector<long> to_K(N + 1);
int Q, K; cin >> Q >> K;
vector<pair<int, int>> q(Q);
rep(i, 0, Q){
cin >> q[i].first;
cin >> q[i].second;
}
vector<bool> seen(N + 1, false);
queue<int> que;
que.push(K);
seen[K] = true;
to_K[K] = 0;
while(!que.empty()){
int node = que.front();
que.pop();
for(auto child : arr[node]){
if(seen[child.first]) continue;
to_K[child.first] = arr[node][child.first] + to_K[node];
seen[child.first] = true;
que.push(child.first);
}
}
rep(i, 0, Q){
cout << to_K[q[i].first] + to_K[q[i].second] << endl;
}
}
| 0
| 16,220,342
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>B(N+1);
B[0] = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];
B[i+1] = B[i]+A[i];
}
int ans = 0;
int cnt = 1;
sort(B.begin(),B.end());
for(int i = 1; i <= N; i++) {
if(B[i] == B[i-1]) {
cnt++;
}
else {
ans+=(cnt*(cnt-1))/2;
cnt = 1;
}
}
ans+=(cnt*(cnt-1))/2;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<ll> A(N), B(N);
REP(i, 0, N) cin >> A[i];
REP(i, 0, N) cin >> B[i];
ll cnta = 0, cntb = 0;
REP(i, 0, N) {
if (A[i] > B[i]) {
cntb += A[i] - B[i];
} else if (A[i] < B[i]) {
if ((B[i] - A[i]) % 2 == 0) {
cnta += (B[i] - A[i]) / 2;
} else {
cnta += (B[i] - A[i]) / 2 + 1;
cntb++;
}
}
}
if (cnta >= cntb) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 3,708,945
|
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
template<typename T>
vector<T> make_vec_nd(T init, ll size) {
return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, ll size, Args... rest) {
auto inner = make_vec_nd(init, rest...);
return vector<decltype(inner)>(size, inner);
}
#define rep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrep(i,a,b) for(ll i=(a)-1;i>=(b);i--)
int main() {
ll K;
cin >> K;
vector<ll> Ais(K);
rep(i,0,K) {
cin >> Ais[i];
}
ll start = 2;
ll last = 2;
rrep(i,K,0) {
ll Ai = Ais[i];
start = (start / Ai + (start % Ai != 0)) * Ai;
last = (last / Ai) * Ai + (Ai - 1);
if (last < start) {
cout << -1 << endl;
return 0;
}
}
cout << start << " " << last << endl;
}
|
#include <cstdio>
using namespace std;
int main() {
int n[101]={};
int mode=0;
while (true) {
int a;
if (scanf("%d", &a) == EOF)
break;
++n[a];
if (mode < n[a])
mode = n[a];
}
for (size_t i=1; i<=100; ++i)
if (n[i] == mode)
printf("%zd\n", i);
return 0;
}
| 0
| 7,651,334
|
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() < 4) cout << "No\n";
else {
if (s[0] == 'Y' && s[1] == 'A' && s[2] == 'K' && s[3] == 'I') cout << "Yes\n";
else cout << "No\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vs = vector<string>;
using vll = vector<long long>;
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);
string s;
ll k;
cin >> s >> k;
ll n = s.size();
vector<pair<char, ll>> cnt;
cnt.emplace_back(s[0], 0);
rep(i, n) {
if (s[i] == cnt.back().first) cnt.back().second++;
else cnt.emplace_back(s[i], 1);
}
int m = cnt.size();
ll ans = 0;
if (m == 1) ans = (k*n)/2;
else {
rep(i, m) {
ans += k * (cnt[i].second/2);
}
if (s[0] == s[n-1]) {
ans -= (k-1) * (cnt[0].second/2);
ans -= (k-1) * (cnt[m-1].second/2);
ans += (k-1) * ((cnt[0].second+cnt[m-1].second)/2);
}
}
cout << ans << endl;
}
| 0
| 35,544,933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, answer;
answer = 0;
cin >> N >> K;
vector<int> p(N);
for(int i = 0; i < N; i++){
cin >> p[i];
}
sort(p.begin() , p.end() );
for(int i = 0; i < K; i++){
answer += p[i];
}
cout << answer << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
template<class T> using V=vector<T>;
using Graph = vector<vector<int>>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
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 ll INF=1e18;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
string s,t;
cin>>s>>t;
queue<char> que;
rep(i,t.size()){
que.push(s[i]);
que.push(t[i]);
}
if(s.size()!=t.size()) que.push(s[s.size()-1]);
while(!que.empty()){
cout<<que.front();
que.pop();
}
cout<<endl;
}
| 0
| 24,428,079
|
#include <iostream>
#include <vector>
using namespace std;
int n, m;
int mod = 1000000007;
vector<long long> fac, inv, finv;
void combinit()
{
fac.resize(n + m + 1);
inv.resize(n + m + 1);
finv.resize(n + m + 1);
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < n + m + 1; 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 combination(int n, int k){
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main(int argc, char const *argv[])
{
long long X, Y;
cin >> X >> Y;
int ans;
if ((X + Y) % 3 == 0)
{
m = (2 * Y - X) / 3;
n = Y - 2 * m;
if (n < 0 || m < 0)
{
ans = 0;
cout << ans << endl;
return 0;
}
combinit();
ans = (int)combination(n + m, n);
}else
{
ans = 0;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int t = 0;
vector<int> k;
reps(i, 1, n + 1) {
k.push_back(i);
t += i;
if (t > n) break;
}
int r = t - n;
rrep(i, sz(k)) {
if (k[i] <= r) {
r -= k[i];
k[i] = 0;
if (r == 0) break;
}
}
rep(i, sz(k)) {
if (k[i] > 0) printf("%d\n", k[i]);
}
return 0;
}
| 0
| 6,223,809
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = V<V<V<T>>>;
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) rep2(i, 0, n)
#define rep1(i, n) rep1(i, 1, n + 1)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
const long long mod = 1e9 + 7;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, -1, 1, 1, -1};
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
long long A;
std::cin >> A;
long long B;
std::cin >> B;
long long C;
std::cin >> C;
long long D;
std::cin >> D;
if (A + B > C + D)
cout << "Left" << endl;
else if (A + B < C + D)
cout << "Right" << endl;
else
cout << "Balanced" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N , M;
cin >> N;
int goukei = 0;
int MAX = 0;
vector<string> ao(N);
for (int i = 0; i < N; i++){
cin >> ao.at(i);
}
cin >> M;
vector<string> aka(M);
for (int i = 0; i < M; i++){
cin >> aka.at(i);
}
for (int i = 0; i < N; i++){
goukei = 0;
for(int b = 0; b < N; b++){
if (ao.at(i) == ao.at(b)){
goukei++;
}
}
for(int b = 0; b < M; b++){
if (ao.at(i) == aka.at(b)){
goukei--;
}
}
if (goukei > MAX){
MAX = goukei;
}
}
cout << MAX << endl;
}
| 0
| 89,085,909
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define p_ll pair<ll, ll>
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
int main() {
int a, b; cin >> a >> b;
string result;
if (a+b==15) result = "+";
else if (a*b==15) result = "*";
else result = "x";
cout << result << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw_2(62,1);
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,61) pw_2[i]=-2*pw_2[i-1];}
ll N; cin>>N;
vector<ll> h(N);
rep(i,N) cin>>h[i];
ll ans=0;
while(1){
bool c=true;
bool water=false;
rep(i,N){
if(h[i]==0) water=false;
else{
if(!water){
water=true;
c=false;
ans++;
}
h[i]--;
}
}
if(c) break;
}
cout<<ans<<endl;
}
| 0
| 87,972,178
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
bool isTrue = false;
for(int i=0;i<=x;i++)
{
if(i*4+(x-i)*2==y)
{
cout<<"Yes";
return 0;
}
}
cout<<"No";
}
|
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;
template <typename T, typename L>
void readVector(vector<T> & _data, L & _size, bool _shift) {
_data.resize(_size + (ll)_shift);
for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
cin >> _data[i];
}
template <typename T, typename L>
void readMatrix(vector<vector<T>> & _data, L & _rows, L & _cols, bool _shiftRows, bool _shiftCols) {
_data.resize(_rows + (ll)_shiftRows);
for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
_data[i].resize(_cols + (ll)_shiftCols);
for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
cin >> _data[i][j];
}
ll n;
vll a, b;
void solve() {
cin >> n;
a.resize(n);
b.resize(n);
ll sum = 0;
rep(i, 0, n) {
cin >> a[i] >> b[i];
sum += a[i];
}
ll ans = INF;
rep(i, 0, n) {
if (a[i] > b[i])
ans = min(ans, b[i]);
}
if (ans == INF) {
cout << 0 << endl;
}
else {
cout << sum - ans;
}
}
int main() {
bool _multipleTestCases = false;
if (_multipleTestCases) {
ll t; cin >> t;
while (t--)
solve();
}
else {
solve();
}
return 0;
}
| 0
| 17,828,618
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
char ntoc[9][6] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
cin >> n;
while(n-- && cin >> s) {
int len = s.size();
int p = -1;
for(int i = 0; i < len; ++i) {
if(p == -1) {
if(s[i] != '0') {
p = (s[i] - '1') * 10;
}
} else {
if(s[i] == '0') {
cout << ntoc[p / 10][p % 10];
p = -1;
} else {
p = (p / 10 * 10) + (p % 10 + 1) % strlen(ntoc[p / 10]);
}
}
}
cout << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n && n!=0){
string s[n];
bool d=true;
for(int i=0;i<n;i++){
cin>>s[i];
}
int cnt=0;
for(int i=0;i<n-1;){
if(d){
if(s[i][1]=='u' && s[i+1][1]=='u'){
d=false;
cnt++;
i+=2;
continue;
}
else{
i++;
continue;
}
}
else {
if(s[i][1]=='d' && s[i+1][1]=='d'){
d=true;
cnt++;
i+=2;
continue;
}
else {
i++;
continue;
}
}
}
cout<<cnt<<endl;
}
}
| 0
| 98,293,489
|
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
const int N = 105;
int n, a[N];
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = 0;
int cnt = 1;
for (int i = 2; i <= n; i++) {
if (a[i] == a[i - 1]) cnt++;
else {
ans += cnt / 2;
cnt = 1;
}
}
cout << ans + cnt / 2;
return 0;
}
|
#include<bits/stdc++.h>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define endl '\n'
#define vs vector<string>
#define mii map<int,int>
#define msi map<string,int>
#define vpii vector< pair<int, int > >
#define vpsi vector< pair< string ,int > >
#define forci(p,q) for(int i=p;i<q;i++)
ll gcd(ll a,ll b){ if(b==0) return a; return gcd(b,a%b);}
ll lcm(ll a,ll b) { return (a/gcd(a,b)*b);}
ull power(ull a, ull b) {a %= mod; ull res = 1; while (b > 0) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res%mod; }
ll modmul(ll x, ll y){return (x*y)%mod;}
ll modadd(ll x, ll y){return (x+y)%mod;}
ll modsub(ll x, ll y){return (x-y+mod)%mod;}
ll fact[1000007]={0};
void facto() {fact[0]=1;fact[1]=1;for(int i=2;i<1000007;i++)fact[i]=(fact[i-1]*i)%mod;}
ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(power(fact[r],mod-2)))%mod; res=(res*(power(fact[n-r],mod-2)))%mod; return res;}
ll npr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(power(fact[n-r],mod-2)))%mod; return res;}
inline long long toint(const std::string &s) {std::stringstream ss; ss << s; long long x; ss >> x; return x;}
inline std::string tostring(long long number) {std::stringstream ss; ss << number; return ss.str();}
inline std::string tobin(long long x) {return std::bitset<63>(x).to_string();}
using namespace std;
int solve()
{
int n;
cin>>n;
int a[n+1];
int b[n];
int tot=0,sum=0;
for(int i=0;i<=n;i++) cin>>a[i], tot+=a[i];
for(int i=0;i<n;i++) cin>>b[i];
for(int i=0;i<n;i++){
int hero=b[i];
if(hero>=a[i]){
hero-=a[i];
a[i]=0;
if(hero>=a[i+1]){
hero-=a[i+1];
a[i+1]=0;
}
else{
a[i+1]-=hero;
}
}
else
a[i]-=hero;
}
for(int i=0;i<=n;i++) sum+=a[i];
cout<<tot-sum<<endl;
return 0;
}
signed main()
{
fastio;
solve();
}
| 0
| 42,616,512
|
#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,v) for(auto i=v.begin();i!=v.end();++i)
#define REACH(i,v) for(auto i=v.rbegin();i!=v.rend();++i)
#define LB(c,x) distance((c).begin(),lower_bound(ALL(c),x))
#define UB(c,x) distance((c).begin(),upper_bound(ALL(c),x))
#define COUNT(c,x) (lower_bound(ALL(c),x)-upper_bound(ALL(c),x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl;
#define NL cerr<<endl;
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T sum(vector<T>&v){return accumulate(ALL(v),T());}
template<typename T>T sum(vector<T>&v,int a,int b){return accumulate(v.begin()+a,v.begin()+b,T());}
template<typename T>T max(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T min(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T max_index(vector<T>&v){return distance((v).begin(),max_element(ALL(v)));}
template<typename T>T min_index(vector<T>&v){return distance((v).begin(),min_element(ALL(v)));}
struct edge { int to, cost; };
template<typename T>auto&operator<<(ostream&s,const vector<T>&v){s<<"[";bool a=1;for(auto e:v){s<<(a?"":" ")<<e;a=0;}s<<"]";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const pair<T,U>&p){s<<"("<<p.first<<","<<p.second<<")";return s;}
template<typename T>auto&operator<<(ostream&s,const set<T>&st){s<<"{";bool a=1;for(auto e:st){s<<(a?"":" ")<<e;a=0;}s<<"}";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const map<T,U>&m){s<<"{";bool a=1;for(auto e:m){s<<(a?"":" ")<<e.first<<":"<<e.second;a=0;}s<<"}";return s;}
const int INF = 1e18;
const int MOD_N = 1e9+7;
int LevenshteinDistance(const string& s1, const string& s2) {
int n1 = s1.size(), n2 = s2.size();
V<V<int>> dp(n1+1, V<int>(n2+1));
FORE(i, 0, n1) dp[i][0] = i;
FORE(j, 0, n2) dp[0][j] = j;
REP(i, n1) {
REP(j, n2) {
dp[i+1][j+1] = min(
dp[i][j] + (s1[i] == s2[j] ? 0 : 1),
min(dp[i+1][j] + 1,
dp[i][j+1] + 1));
}
}
return dp[n1][n2];
}
signed main()
{
string s1, s2; cin >> s1 >> s2;
cout << LevenshteinDistance(s1, s2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i ++){
int _a;
cin >> _a;
a[i] = _a;
}
sort(a.begin(), a.end());
int now_num = 0;
int now_cnt = 0;
int ans = 0;
for (auto num : a){
if (now_num != num){
if (now_cnt < now_num){
ans += now_cnt;
}
now_cnt = 0;
}
if (now_cnt == 0){
now_num = num;
}
now_cnt += 1;
if (now_cnt > now_num){
ans += 1;
}
}
if (now_cnt < now_num){
ans += now_cnt;
}
cout << ans << endl;
}
| 0
| 54,759,596
|
#include <iostream>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
cout << max(c-(a-b),0) << endl;
}
|
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <string>
using namespace std; typedef long long ll; const int INF=1e9; typedef pair<int,int> P;
int main() {
string s; cin>>s;
int n=s.size();
if (n<26) {
bool u[26]; fill(u,u+n,false);
for(int i=0;i<n;i++) u[s[i]-'a']=true;
for(int i=0;i<26;i++) {
if (!u[i]) {
cout<<s<<(char)('a'+i)<<endl;
break;
}
}
} else {
int a[n], b[n];
for(int i=0;i<n;i++) a[i]=s[i]-'a', b[i]=a[i];
if (next_permutation(a,a+n)) {
for(int i=0;i<n;i++) {
cout<<(char)('a'+a[i]); if (a[i] != b[i]) break;
} cout<<endl;
} else {
cout<<-1<<endl;
}
}
}
| 0
| 82,871,865
|
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()
template<typename T> inline void chmax(T& t, T f){if(t < f)t = f;}
vector<string> split(const string& input, char delimiter){
istringstream stream(input);
string field;
vector<string> result;
while(getline(stream, field, delimiter))result.push_back(field);
return result;
}
int main(){
int n;
while(cin >> n, n){
typedef pair<vector<string>, vector<string> > Time;
vector<Time> table;
rep(i, n){
string s, t;
cin >> s >> t;
table.emplace_back(split(s, ':'), split(t, ':'));
}
sort(all(table));
int ans = 1;
rep(i, n){
chmax(ans, 1 + (int)count_if(table.begin(), table.begin() + i,
[&](Time& t){return table[i].first < t.second;}));
}
cout << ans << '\n';
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = 0x3F3F3F3F;
const int NEGINF = 0xC0C0C0C0;
const int NULO = -1;
const double EPS = 1e-10;
const ll mod = 961748941;
inline int cmp(double x, double y = 0)
{
if(fabs(x - y) < EPS)
return 0;
return x > y ? 1 : -1;
}
ll exp(ll a, ll b)
{
ll ans = 1;
while(b)
{
if(b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
const int maxn = 2e5 + 5;
ll fat[maxn], inv[maxn];
ll C(int n, int k)
{
if(n < k)
return 0;
if(n < 0 || k < 0)
return 0;
return (((fat[n] * inv[k]) % mod) * inv[n - k]) % mod;
}
void initFactorials()
{
fat[0] = 1;
inv[0] = 1;
for(int i = 1; i < maxn; i++)
{
fat[i] = (i * fat[i-1]) % mod;
inv[i] = exp(fat[i], mod - 2);
}
}
int l[maxn], r[maxn], pos[maxn];
int a[maxn];
int main()
{
ios::sync_with_stdio(0);
int n;
cin >> n;
for(int i = 1 ; i <= n ; i++)
{
cin >> a[i];
pos[a[i]] = i;
}
multiset<ll>s;
s.insert(0);
s.insert(0);
s.insert(n+1);
s.insert(n+1);
ll ans = 0;
for(ll i = n; i >= 1; i--)
{
auto it = s.lower_bound(pos[i]);
--it;
--it;
auto a = *it;
it++;
auto b = *it;
it++;
auto c = *it;
it++;
auto d = *it;
s.insert(pos[i]);
ans += ((b - a) * (c - pos[i]) + (d - c) * (pos[i] - b)) * i;
}
cout << ans << endl;
return 0;
}
| 0
| 30,289,940
|
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N;
cin >> N;
vector <int> X(N);
rep(i,N) cin >> X[i];
int ans = inf;
for (int i = 1; i <= 100; i++){
int sum = 0;
rep(j,N) sum += (X[j] - i) * (X[j] - i);
ans = min(ans, sum);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define lb lower_bound
#define fi first
#define ub upper_bound
#define se second
#define mp make_pair
#define vll vector<ll>
#define mod 1000003
#define endl "\n"
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define sz size()
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define inp(V,n) for(int i=0;i<n;i++){cin >> V[i];}
#define oup(V,n) {for(int i=0;i<n;i++){cout << V[i] << " " ;} cout << endl;}
using namespace std;
ll factorial(ll n)
{
return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b)
{
return (a*b)/gcd(a, b);
}
bool sortByVal(const pair<double,double> &a,
const pair<double,double> &b)
{
if(a.fi==b.fi)
{
return (a.second >b.second);
}
else
return (a.fi<b.fi);
}
int main()
{ int t=1;
while(t--)
{ ll n,i,j,k;
string s;
cin>>s;ll c=0;vll v;
for(i=0;i<s.size();i++)
{ if(s[i]=='R')
c++;
else{
v.pb(c);
c=0;
}
}
v.pb(c);
sort(allr(v));
cout<<v[0]<<endl;
}
return 0;
}
| 0
| 6,965,877
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, g;
cin >> r >> g;
cout << 2.0 * g - r << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
ll gcd(ll x, ll y){
if(y == 0) return x;
return gcd(y, x % y);
}
int main(){
int n, m;
cin >> n >> m;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i] /= 2;
}
ll lcm = 1;
for (int i = 0; i < n; ++i) {
lcm = lcm / gcd(lcm, a[i]) * a[i];
if (lcm > m){
cout << 0 << endl;
return 0;
}
}
for (int i = 0; i < n; ++i) {
if ((lcm / a[i]) % 2 == 0){
cout << 0 << endl;
return 0;
}
}
cout << (m / lcm + 1) / 2 << endl;
}
| 0
| 93,659,166
|
#include <iostream>
using namespace std;
int main(void)
{
while (true) {
int m, f, r;
cin >> m >> f >> r;
if (m + f + r == -3) break;
else if (m == -1 || f == -1) cout << 'F' << endl;
else if (m + f >= 80) cout << 'A' << endl;
else if (m + f >= 65) cout << 'B' << endl;
else if (m + f >= 50) cout << 'C' << endl;
else if (m + f >= 30 ) cout << ((r < 50)? 'D' : 'C') << endl;
else cout << 'F' << endl;;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> students, pos;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
students.push_back(make_pair(a, b));
}
for (int i = 0; i < M; i++) {
int c, d;
cin >> c >> d;
pos.push_back(make_pair(c, d));
}
for (int i = 0; i < N; i++) {
int dis_min = INT_MAX;
int ans = INT_MAX;
for (int j = 0; j < M; j++) {
int dis = abs(students[i].first - pos[j].first) +
abs(students[i].second - pos[j].second);
if (dis < dis_min) {
dis_min = dis;
ans = j + 1;
}
}
cout << ans << endl;
}
}
| 0
| 33,097,860
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main()
{
int l;
double d,ans;
cin >> l;
d = (double)l / 3.0;
ans = d * d * d;
std::cout << fixed << setprecision(12) << ans << endl;
}
|
#include<stdio.h>
int main(){
long long int n,a=10,b=0;
scanf("%lld\n",&n);
if(n%2==0){
while(a<=n){
b=b+n/a;
a=a*5;
}
}
printf("%lld\n",b);
}
| 0
| 77,450,572
|
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
ll n;cin>>n;
vector<ll> t(n+2,0), a(n+2,0);
rep(i,n){cin>>t.at(i+1);}
rep(i,n){cin>>a.at(i+1);}
t.at(n+1) = t.at(n);
a.at(0) = a.at(1);
ll res = 1;
ll max_now = 0;
ll cur_from = 1;
while(cur_from<=n+1&&t[cur_from]!=a[cur_from]){
if(t.at(cur_from-1)<t.at(cur_from)){
max_now = t.at(cur_from);
}else{
res *= max_now;
res %= MOD;
}
DEBUG{
cout << res << endl;
}
cur_from++;
}
ll cur_to = n;
max_now = 0;
while(cur_to>=0&&t[cur_to]!=a[cur_to]){
if(a.at(cur_to)>a.at(cur_to+1)){
max_now = a.at(cur_to);
}else{
res *= max_now;
res %= MOD;
}
DEBUG{
cout << res << " max : " << max_now << endl;
}
cur_to--;
}
if(cur_from>=n+1||cur_to<=0||t.at(n)!=a.at(1)||t.at(cur_from)!=t.at(n)||a.at(1)!=a.at(cur_to)){
cout << 0 << endl;
return 0;
}
for(int i=cur_from+1;i<cur_to;i++){
res *= t.at(i);
res %= MOD;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEBUG(x) cout<<#x<<":"<<x<<"\n"
#define DEBUGS(v) cout << #v << ":";for(auto x:v){cout<<x<<" ";}cout<<"\n"
#endif
#ifndef __DEBUG__
#define CH_P(a)
#define DEBUG(x)
#define DEBUGS(v)
#endif
#define TIMER_S(start) chrono::system_clock::time_point start = chrono::system_clock::now();
#define TIMER_E(end) chrono::system_clock::time_point end = chrono::system_clock::now();
#define TIME(start, end) cout << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count()) << "ms" << "\n";
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
REP(i, n) { cin >> a[i]; }
REP(j, k) {
vector<int> imos(n, 0);
REP(i, n) {
imos[max(i - a[i], 0ll)] += 1;
if (i + a[i] + 1 < n) imos[i + a[i] + 1] -= 1;
}
REP(i, n) {
if (i == 0)
a[i] = imos[i];
else
a[i] = a[i - 1] + imos[i];
}
bool f = true;
REP(i, n) {
if (a[i] != n) {
f = false;
break;
}
}
if (f) {
REP(i, n) {cout << n << " ";}
cout << "\n";
return 0;
}
}
REP(i, n) { cout << a[i] << " "; }
cout << "\n";
return 0;
}
| 0
| 44,216,663
|
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
int main() {
int N; cin >>N;
bool flag=false;
rep_eq(i,0,100/4) {
rep_eq(j,0,100/7) {
if (i*4+j*7==N) {flag=true; break;}
}
if (flag) break;
}
cout <<(flag ? "Yes":"No") <<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 vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define PI 2*acos(0.0)
#define dbg(a) cout<<#a<<" ->->->-> "<<a<<"\n"
#define N 200005
int dirx[] = {1, -1,0, 0}, diry[] = {0, 0, 1, -1};
ll bigmod(ll x, ll p)
{
ll res = 1;
while(p)
{
if(p&1)
res = (res*x)%mod;
x = (x*x)%mod;
p >>= 1;
}
return res;
}
int32_t main()
{
io;
int n;
cin>>n;
vi inp(n);
for(auto& x: inp) cin>>x;
int ans = INT_MAX;
for(int i = 1; i<= 100; i++)
{
int ac = 0;
for(auto x: inp)
ac += (x-i)*(x-i);
ans = min(ans, ac);
}
cout<<ans;
return 0;
}
| 0
| 28,413,818
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
int main(){
ll N; cin >> N;
vector<ll> A(N); for(ll i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
vector<ll> D(N); D[0] = A[0];
for(ll i = 1; i < N; i++) D[i] = D[i-1] + A[i];
ll ans = 1;
for(ll i = N-2; i >= 0; i--){
if(2*D[i] >= A[i+1]) ans++;
else break;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll n;
cin>>n;
ll a[n];
ll mx = 0;
for(int i=0;i<n;i++){
cin>>a[i];
mx = max(mx,a[i]);
}
ll ans1 = -1;
long long low=-1,up=1e15+7,mid;
while(up-low>1){
mid=(up+low)/2;
ll k = mid;
for(int i=0;i<n;i++){
k -= k%a[i];
}
if(k<=1){
low=mid;
}
else{
up=mid;
}
}
ans1 = up;
low=-1,up=1e15+7;
while(up-low>1){
mid=(up+low)/2;
ll k = mid;
for(int i=0;i<n;i++){
k -= k%a[i];
}
if(k<=2){
low=mid;
}
else{
up=mid;
}
}
ll ans2 = low;
if(ans1>ans2){
cout << -1 << endl;
return 0;
}
cout << ans1 << " " << ans2<< endl;
}
| 0
| 34,101,745
|
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <stack>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
const int mxn = 1e6+10;
long long gcdlike(long long a, long long b) {
long long ret = a+b;
if(a<b) swap(a, b);
while(b) {
long long q = a/b;
long long r = a%b;
ret+=2*q*b;
if(r==0) ret-=b;
a = b; b = r;
}
return ret;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
long long n,x; cin>>n>>x;
cout << gcdlike(n-x, x) << '\n';
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int n,k,a[5000];
int dp[5050][5050]={1};
bool C(int m)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<k;j++)dp[i+1][j]=0;
for(int j=0;j<k;j++)
{
if(dp[i][j]){
dp[i+1][j]=1;
if(i!=m&&j+a[i]<k)dp[i+1][j+a[i]]=1;
}
}
}
for(int i=max(0,k-a[m]);i<k;i++)if(dp[n][i])return true;
return false;
}
main()
{
cin>>n>>k;
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int l=0,f=n+1,m;
while(f-l>1)
{
m=(f+l)/2;
(C(m-1)?f:l)=m;
}
cout<<l<<endl;
}
| 0
| 2,227,695
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N;
cin >> N;
int P[N];
rep(i,N) cin >> P[i];
int Q[N];
int minl = P[0];
rep(i,N){
minl = min(minl,P[i]);
Q[i] = minl;
}
int ans = 0;
rep(i,N){
if (Q[i]>=P[i]) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf=vector<vector<int>>;
#define MAX 1000000007
class Calc_Mod{
public:
unsigned int mod=1000000007;
ll plus_mod(ll a,ll b){
return (a+b)%mod;
}
ll minus_mod(ll a,ll b){
return (a-b)%mod;
}
ll multi_mod(ll a,ll b){
return a*b%mod;
}
ll LSM(ll a,int b){
queue<int> q;
while(b>=1){
q.push(b%2);
b/=2;
}
ll ans=1;
while(!q.empty()){
if(q.front()==1){
ans=multi_mod(ans,a);
}
a=multi_mod(a,a);
q.pop();
}
return ans;
}
ll div_mod(ll a,ll b){
return multi_mod(a,LSM(b,mod-2));
}
ll combi(ll a,ll b){
ll ans=1;
ll kaijo=1;
rep(i,b){
ans=multi_mod(ans,a-i);
kaijo=multi_mod(kaijo,b-i);
}
ans=div_mod(ans,kaijo);
return ans;
}
};
int gcd(int a, int b){
if(a%b == 0){
return b;
}else{
return gcd(b, a%b);
}
}
int lcm(int a, int b){
return a*b / gcd(a, b);
}
int main()
{
int x;
cin >> x;
int num=lcm(x,360);
cout << num/x << endl;
}
| 0
| 9,746,944
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long int ull;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=100000;
const int MAXE=100000;
const int MAXV=10000;
const ll INF=2e18;
const ll MOD=1e9+7;
int main(){
int H,W,D;cin>>H>>W>>D;
int A[H][W];
vector<int> X(H*W+1,0),Y(H*W+1,0);
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin>>A[i][j];
X[A[i][j]]=i;
Y[A[i][j]]=j;
}
}
vector<int> SX(H*W+1,0),SY(H*W+1,0);
for(int i=D+1;i<=H*W;++i){
SX[i]=SX[i-D]+abs(X[i]-X[i-D]);
SY[i]=SY[i-D]+abs(Y[i]-Y[i-D]);
}
int Q;cin>>Q;
while(Q--){
int L,R;cin>>L>>R;
cout<<(SX[R]-SX[L])+(SY[R]-SY[L])<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef pair<ll,ll> Pi;
typedef tuple<ll,ll,ll> Tu;
typedef tuple<ll,ll,ll> Tu;
const int INF=(ll)(1LL<<30)-1;
const double INFd=100000000000.0;
const ll INFl=(ll)9223372036854775807;
const int MAX=10000;
const ll MOD=(ll)1e9+7;
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 dx[4]={0,-1,0,1},dy[4]={-1,0,1,0};
int mdx[8]={0,1,0,-1,1,1,-1,-1},mdy[8]={-1,0,1,0,1,-1,1,-1};
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll n;
int main(){
cin>>n;
int t=-1;
for(int i=1;i*(i+1)<=1e5*2;i++){
if(i*(i+1)/2==n){
t=i;
}
}
if(t==-1){
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
cout<<t+1<<endl;
int ans[t+1][t];
int co=1;
REP(i,t+1){
for(int j=i;j<t;j++){
ans[i][j]=co;
ans[j+1][i]=co;
co++;
}
}
REP(i,t+1){
cout<<t<<" ";
REP(j,t){
cout<<ans[i][j]<<" ";
}
cout<<endl;
}
return 0;
}
| 0
| 31,939,298
|
#include <cstdio>
#include <ctype.h>
using namespace std;
int main(){
char str[1200];
gets(str);
int i = 0;
while(str[i] != '\0'){
char uc, lc;
uc = toupper(str[i]);
lc = tolower(str[i]);
if(lc == str[i]) printf("%c", uc);
else printf("%c", lc);
++i;
}
printf("\n");
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int memo[100000]; for(int i=0;i<m;i++) memo[i]=0;
int ac=0,wa=0;
for(int i=0;i<m;i++)
{
int p;
char s[3];
scanf("%d%s",&p,s);
if(memo[p]!=-1)
if(strcmp(s,"WA")==0)
{
memo[p]++;
}
else
{
wa+=memo[p];
memo[p]=-1;
ac++;
}
}
printf("%d %d\n",ac,wa);
}
| 0
| 85,905,237
|
#include <iostream>
using namespace std;
int main() {
for(;;){
int m, f, r;
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1) break;
if(m == -1 || f == -1) cout << "F";
else if(m + f >= 80) cout << "A";
else if(m + f >= 65) cout << "B";
else if(m + f >= 50 || r >= 50) cout << "C";
else if(m + f >= 30) cout << "D";
else cout << "F";
cout << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,x;cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
REP(i,n){
cin >> c[i];
REP(j,m){
cin >> a[i][j];
}
}
int ans=inf;
REP(t,1<<n){
vector<int> b(m);
int res=0;
REP(i,n){
if(t&(1<<i)){
res+=c[i];
REP(j,m){
b[j]+=a[i][j];
}
}
}
bool f=true;
REP(i,m){
if(b[i]<x) f=false;
}
if(f) chmin(ans,res);
}
cout << (ans==inf?-1:ans) << endl;
}
| 0
| 26,091,640
|
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int x;
cin >> x;
long min, max, sum;
min = max = sum = x;
for (int i = 1; i < n; ++i)
{
cin >> x;
if (x < min) min = x;
if (max < x) max = x;
sum += x;
}
cout << min << ' ' << max << ' ' << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define all(x) x.begin(),x.end()
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
const int INF=INT_MAX;
const ld PI=acos(-1);
const ld E=2.71828183;
const int MOD=1e9+7;
vi bfs(vector<vi>adj,int src){
queue<int>q;
q.push(src);
vi dst(adj.size(),INF);
dst[src]=0;
while(!q.empty()){
int c=q.front();
q.pop();
for(int nbr:adj[c]){
if(dst[nbr]==INF){
dst[nbr]=dst[c]+1;
q.push(nbr);
}
}
}
return dst;
}
vi bfsParents(vector<vi>adj,int src){
vi parents=vi(adj.size(),INF);
parents[src]=-1;
queue<int>q;
q.push(src);
vi dst(adj.size(),INF);
dst[src]=0;
while(!q.empty()){
int c=q.front();
q.pop();
for(int nbr:adj[c]){
if(dst[nbr]==INF){
parents[nbr]=c;
dst[nbr]=dst[c]+1;
q.push(nbr);
}
}
}
return parents;
}
vi shortestPath(vector<vi>adj,int src,int dst){
vi bfsParetns=bfsParents(adj,src);
vi ans;
while(src!=dst){
if(bfsParetns[src]==INF)
return {};
ans.push_back(src);
src=bfsParetns[src];
}
return ans;
}
int powMod(int base,int exp,int mod){
int ans=1;
for(int i=0; i<exp; i++)
ans=((ans%mod)*(base%mod))%mod;
return ans;
}
vi divisorsOf(int n){
vi ans;
for(int i=1; i*i<=n; i++){
if(n%i==0)
ans.push_back(i);
if(i*i!=n && i!=1)
ans.push_back(n/i);
}
return ans;
}
ll gcd(ll a,ll b){if(a%b==0) return b; else return gcd(b,a%b);}
ld log (ld a,ld b){return log(b)/log(a);}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
ll power(ll base, ll exp){ll res=1;while(exp){exp--;res*=base;}return res;}
void solve();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
while(t--)
solve();
return 0;
}
void solve (){
ll a,b;
cin >> a >> b;
cout << lcm(a,b)<<"\n";
}
| 0
| 68,111,642
|
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define FOR(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };
using LL = long long int;
using LD = long double;
const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
int main() {
int h, w;
cin >> h >> w;
REP(i, h) {
REP(j, w) {
string s;
cin >> s;
if ("snuke" == s) {
printf("%c%d\n", 'A' + j, i + 1);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N;
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
sort(a.rbegin(), a.rend());
ll sum = accumulate(a.begin(), a.end(), 0LL);
int ans = 0;
for (int i = 0; i < N; i++) {
sum -= a[i];
ans++;
if (a[i] > 2 * sum) break;
}
cout << ans << '\n';
}
| 0
| 6,280,233
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
string s[N];
int a = 0;
int b = 0;
int c = 0;
int ans = 0;
for (int i= 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < N; i++) {
if (s[i][0] == 'B' && s[i][s[i].size()-1] == 'A') {
c++;
} else if (s[i][0] == 'B') {
b++;
} else if (s[i][s[i].size()-1] == 'A') {
a++;
}
for (int j = 1; j < s[i].size(); j++) {
if (s[i][j-1] == 'A' && s[i][j] == 'B') {
ans++;
}
}
}
int ab = min(a,b);
if (ab >= 1) {
ans += ab + c;
} else if (a == 0 && b != 0) {
ans += c;
} else if (a != 0 && b == 0) {
ans += c;
} else if (a == 0 && b == 0 && c != 0) {
ans += c-1;
} else if (c == 0) {
ans += 0;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
using namespace std;
const int N = 1e5+5;
int h[N],n,k,ans[N];
main() {
cin >> n;
k = 2;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
ans[i] = 1000000000;
for (int j = max(1,i - k); j < i; j++)
ans[i] = min(ans[i],ans[j] + abs(h[i] - h[j]));
}
cout << ans[n];
}
| 0
| 72,041,125
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
signed main(void){
int n; cin>>n;
vector <int> p(n);
rep(i,n) cin>>p[i];
vector <int> a(n);
vector <int> b(n);
a[0] = 20000;
rep(i,n){
if(i==0) continue;
a[i] = a[i-1] + 20000;
}
b[n-1] = 20000;
rrep(i,n){
if(i==n-1) continue;
b[i] = b[i+1] + 20000;
}
rep(i,n){
a[p[i]-1] += i;
}
rep(i,n) cout<<a[i]<<' ';
cout<<endl;
rep(o,n) cout<<b[o]<<' ';
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define MAXN 200
#define INF 1000000000
void WarshallFloyd(int n, int dist[MAXN][MAXN])
{
for (int k = 0; k < n; ++k)
{
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
}
int main()
{
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
REP(i, R)
{
cin >> r[i];
r[i]--;
}
sort(ALL(r));
int dist[MAXN][MAXN];
REP(i, N) REP(j, N) dist[i][j] = INF;
REP(i, N) dist[i][i] = 0;
REP(i, M)
{
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
dist[a][b] = c;
dist[b][a] = c;
}
WarshallFloyd(N, dist);
int minCost = INT32_MAX;
do{
int cost = 0;
REP(i, R - 1)
{
int src = r[i], dst = r[i + 1];
cost += dist[src][dst];
}
minCost = min(minCost, cost);
} while(next_permutation(ALL(r)));
cout << minCost << endl;
}
| 0
| 22,897,604
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,m;
cin>>a>>b>>m;
vector<int>aprice(a);
vector<int>bprice(b);
vector<vector<int>> data(m, vector<int>(3));
for(int i=0;i<a;i++){
cin>>aprice[i];
}
for(int i=0;i<b;i++){
cin>>bprice[i];
}
for (int j = 0; j < m ; j++) {
for (int k = 0; k < 3; k++) {
cin >> data.at(j).at(k);
}
}
int pp=aprice.at(data.at(0).at(0)-1)+bprice.at(data.at(0).at(1)-1)-data.at(0).at(2);
for(int i=0;i<m;i++){
int x=aprice.at(data.at(i).at(0)-1)+bprice.at(data.at(i).at(1)-1)-data.at(i).at(2);
if(x <=pp){
pp =x;
}
}
sort(aprice.begin(),aprice.end());
sort(bprice.begin(),bprice.end());
int t=aprice[0]+bprice[0];
if(t<=pp){
pp=t;
}
cout<<pp<<endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma optimize O3
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int LL;
typedef LL ll;
typedef long double ld;
typedef string str;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef stringstream strs;
#define X first
#define Y second
#define PB push_back
#define For(i,a,b) for (int i=a;i<b;i++)
#define Ford(i,a,b) for (int i=a;i>=b;i--)
#define smax(a,b) a=max(a,b)
#define smin(a,b) a=min(a,b)
#define SZ(a) ((ll)a.size())
#define ER(a) cout << #a << ' ' << a << endl
#define LB(a,n,x) (lower_bound(a,(a)+(n),x)-(a))
#define RET(x) { cout << x; exit(0); }
#define RETD(x) { cout << fixed << setprecision(15) << x; exit(0); }
const ll M=2e5+5,LG=32,SM=600+5,inf=1e18+5;
ll mod=1e9+7;
ll n;
vll g[M];
str z[2]={"First","Second"};
ll dfs(ll x,ll p)
{
if (SZ(g[x])==1) return 1;
ll f=0;
for (ll y:g[x])
{
if (y==p) continue;
f+=dfs(y,x);
}
if (f>1) RET(z[0]);
if (f==1) return 0;
return 1;
}
int main()
{
cin >> n;
if (n==2) RET(z[1]);
if (n==1) RET(z[0]);
ll x;
For(i,1,n)
{
ll u,v;
cin >> u >> v;
u--;v--;
g[u].PB(v);g[v].PB(u);
}
For(i,0,n) if (SZ(g[i])>1) x=i;
RET(z[!dfs(x,x)]);
}
| 0
| 44,875,877
|
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <array>
#include <bitset>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
vector<int> org;
set<int> nz;
vector<int> ds,ds0,fs;
int f(int K)
{
if(ds.size()<K){
return 0;
}
auto p=[&](int t,int d){
if(fs[t]!=K){
org.push_back(t);
fs[t]=K;
}
ds[t]+=d;
if(abs(ds[t])==1){
nz.insert(t);
}
else if(ds[t]==0){
nz.erase(t);
}
#if 0
for(auto v:ds){
cerr << v << ", ";
}
cerr << endl;
for(auto n:nz){
cerr << n << endl;
}
if((ds[t]!=0)!=(nz.count(t)!=0)){
cerr << t << ", " << ds[t] << ", " << nz.count(t) << ", " << d << endl;
}
#endif
};
org.clear();
int s=K-1,t=K-1;
int ret=0;
while(1){
if(ds[t]==0){
auto it=lower_bound(nz.begin(),nz.end(),t);
if(it==nz.end()){
t=ds.size()-1;
}
else{
t=*it;
}
}
if(s>0&&ds[s-1]==0){
auto it=lower_bound(nz.begin(),nz.end(),s);
if(it==nz.begin()){
s=0;
}
else {
it--;
s=*it+1;
}
}
if(t==s){
p(t,-1);
}
else{
p(t,-1);
if(s>0){
p(s-1,-1);
}
int u=t-(K-s);
if(u>=0){
p(u,1);
}
if(u<K-1)
{
s=u+1;
}
else{
t=u;
}
}
if(ds.back()<0)break;
ret++;
}
for(auto t:org){
ds[t]=ds0[t];
if(ds[t]){
nz.insert(t);
}
else{
nz.erase(t);
}
}
return ret;
}
void solve(long long N, std::vector<long long> A){
sort(A.begin(),A.end());
int k=1;
for(int i=1;i<N;i++){
if(A[i]==A[i-1]){
k++;
}
else{
ds.push_back(k);
k=1;
}
}
ds.push_back(k);
sort(ds.begin(),ds.end(),greater<int>());
for(int i=0;i<ds.size()-1;i++)
{
ds[i]-=ds[i+1];
if(ds[i]){
nz.insert(i);
}
}
nz.insert(ds.size()-1);
#if 0
cerr << "aaa ";
for(int i=0;i<ds.size();i++){
cerr << ds[i];
}
cerr << endl;
#endif
ds0=ds;
fs.resize(ds.size());
#if 0
for(auto v:ds){
cerr << v << ", ";
}
cerr << endl;
for(auto n:nz){
cerr << n << endl;
}
#endif
for(int i=1;i<=N;i++){
printf("%d\n",f(i));
}
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, std::move(A));
return 0;
}
|
#include <iostream>
using namespace std;
struct Card { char suit; int value;};
void selectionsort(struct Card A[], int N) {
for (int i = 0; i< N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j].value < A[minj].value) minj = j;
}
swap(A[i], A[minj]);
}
}
void bubblesort(struct Card A[], int N) {
int flag = 1;
while (flag) {
flag = 0;
for (int i = N-1; i > 0; i--) {
if (A[i].value < A[i-1].value) {
swap(A[i], A[i-1]);
flag = 1;
}
}
}
}
void print(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
if (i != N-1) cout << A[i].suit << A[i].value << " ";
else cout << A[i].suit << A[i].value << endl;
}
}
bool isstable(struct Card A[], struct Card B[], int N) {
for(int i = 0; i < N; i++) {
if (A[i].suit != B[i].suit) return false;
}
return true;
}
int main() {
Card C1[100], C2[100];
int N;
cin >> N;
for (int i=0; i < N; i++) {
cin >> C1[i].suit >> C1[i].value;
}
for (int i = 0; i < N; i++) C2[i] = C1[i];
bubblesort(C1, N);
selectionsort(C2, N);
print(C1, N);
cout << "Stable" << endl;
print(C2, N);
if (isstable(C2, C1, N)) cout << "Stable" << endl;
else cout << "Not stable" << endl;
return 0;
}
| 0
| 56,635,777
|
#include <iostream>
#include <string>
using namespace std;
string check(int num);
int main(){
int n,c = 0,d = 0;
string a,b;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a >> b;
if(a > b){
c += 3;
}
else if(b > a){
d += 3;
}
else{
c++;
d++;
}
}
cout << c << ' ' << d << "\n";
return 0;
}
|
#pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(1, 1E8); \
auto rnd = bind(__dis, __gen)
const int INF = 1E18;
const int mod = 1E9 + 7;
int32_t main() {
fastIO();
int n;
cin >> n;
if (n < 1200) cout << "ABC\n";
else if (n < 2800) cout << "ARC\n";
else cout << "AGC\n";
return 0;
}
| 0
| 73,925,266
|
#include <iostream>
#include <vector>
#include <numeric>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<int> a(n);
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
}
int sum = std::accumulate(a.begin(), a.end(), 0);
int count = 0;
for (int i = 0; i < n; i++)
{
if (sum <= 4 * m * a[i])
{
count++;
}
}
if (m <= count)
{
std::cout << "Yes" << std::endl;
}
else
{
std::cout << "No" << std::endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int i,j;
int check=0;
int ans=-1;
for(i=S.length()-T.length(); i>=0; i--){
for(j=0; j<T.length(); j++){
if(S[i+j]!='?' && S[i+j]!=T[j]) check=1;
}
if(check==0){
for(j=0; j<T.length(); j++){
S[i+j]=T[j];
}
ans=i;
i=-1;
}
else check=0;
}
if(ans==-1) cout << "UNRESTORABLE" << endl;
else{
for(i=0; i<S.length(); i++){
if(S[i]=='?') S[i]='a';
cout << S[i];
}
cout << endl;
}
return 0;
}
| 0
| 22,262,463
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.