code1
stringlengths 54
12k
| code2
stringlengths 71
12k
| similar
int64 0
1
| __index_level_0__
int64 0
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S;
cin >> S;
string ans = "No";
if (S == "abc" || S == "acb" || S == "bca" || S == "bac" || S == "cab" || S == "cba") ans ="Yes";
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long K;
cin >> n >> K;
vector<long long> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i) >> b.at(i);
}
vector<long long> nk = {K};
for (int i = 0; i < 30; i++) {
if (!(K & (1ll << i))) continue;
nk.push_back((K & ~(1ll << i)) | ((1ll << i) - 1));
}
long long maxi = 0;
for (long long ki: nk) {
long long sum = 0;
for (int j = 0; j < n; j++) {
bool ok = true;
for (int k = 0; k < 30; k++) {
if (!(ki & (1ll << k)) && (a.at(j) & (1ll << k))) ok = false;
}
if (ok) sum += b.at(j);
}
maxi = max(maxi, sum);
}
cout << maxi << endl;
}
| 0
| 72,804,744
|
#include<iostream>
using namespace std;
int main(){
int W, H, x, y, r;
int a, b, i, j;
cin >> W >> H >> x >> y >> r;
a = x - r;
b = y - r;
i = x + r;
j = y + r;
if( 0<=a && 0<=b){
if( i<=W && j<=H){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}else{
cout << "No" << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
int h,m,s;
cin >> a >> b >> c;
if(a < b){
if(b < c){
cout << a << " " << b << " " << c << endl;
}else{
if(a < c){
cout << a << " " << c << " " << b << endl;
}else{
cout << c << " " << a << " " << b << endl;
}
}
}else{
if(a < c){
cout << b << " " << a << " " << c << endl;
}else{
if(b < c){
cout << b << " " << c << " " << a << endl;
}else{
cout << c << " " << b << " " << a << endl;
}
}
}
return 0;
}
| 0
| 45,136,728
|
#include <iostream>
using namespace std;
int P[10010];
void init(int N);
int root(int a);
bool is_same_set(int a,int b);
void unite(int a,int b);
int main() {
int n,q;
cin >> n >> q;
init(n);
for (int i=0;i<q;++i) {
int com,x,y;
cin >> com >> x >> y;
if (com==0) unite(x,y);
else if (com==1) cout << is_same_set(x,y) << endl;
}
}
void init(int N) {
for (int i=0;i<N;++i) P[i] = i;
}
int root(int a) {
if (P[a]==a) return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b) {
return root(a)==root(b);
}
void unite(int a,int b) {
P[root(a)] = root(b);
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
void Main()
{
ll n, K;
cin >> n >> K;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
vector<vector<char> > dp(n+1, vector<char>(K+1));
dp[0][0] = 1;
repi(i, n+1) {
rep(j, K+1) {
if (j-a[i-1] >= 0) {
dp[i][j] = max(dp[i][j], dp[i-1][j-a[i-1]]);
}
dp[i][j] = max(dp[i][j], dp[i-1][j]);
}
}
vector<vector<char> > dpi(n+2, vector<char>(K+1));
dpi[n+1][0] = 1;
for (int i = n; i >= 0; i--) {
rep(j, K+1) {
if (j-a[i-1] >= 0) {
dpi[i][j] = max(dpi[i][j], dpi[i+1][j-a[i-1]]);
}
dpi[i][j] = max(dpi[i][j], dpi[i+1][j]);
}
}
ll res = 0;
vector<ll> S(K+2);
rep(i, n) {
repi(j, K+2) {
S[j] = S[j-1] + dpi[i+2][j-1];
}
bool necessary = false;
rep(j, K+1) {
if (0 == dp[i][j]) {
continue;
}
ll sum = i - 1 >= 0 ? j + a[i] : a[i];
if (sum > K) {
necessary = true;
break;
}
ll v1 = K - sum;
ll v2 = K + a[i] - 1 - sum;
ll cnt = S[v2+1] - S[v1];
if (cnt > 0) {
necessary = true;
break;
}
}
if (!necessary) {
res++;
}
}
put(res);
}
signed main(){ Main();return 0;}
| 0
| 56,740,999
|
#include<cstdio>
int main(){
unsigned N, K;
scanf("%u %u", &N, &K);
printf("%u\n", (N-2)/(K-1) + 1);
return 0;
}
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
ll x, y; cin >> x >> y;
ll res = 10e12;
if (x <= y) {
res = min(res, y-x);
}
if (-x <= y) {
res = min(res, y+x+1);
}
if (x <= -y) {
res = min(res, -y-x+1);
}
if (-x <= -y) {
res = min(res, -y+x+2);
}
cout << res << endl;
return 0;
}
| 0
| 19,297,814
|
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
int main(){
int ai,am,as,ae,bi,bm,bs,be;
scanf("%d%d%d%d%d%d%d%d",&ai,&am,&as,&ae,&bi,&bm,&bs,&be);
int S = ai + am + as + ae;
int T = bi + bm + bs + be;
printf("%d\n",S > T ? S : T);
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#define LL long long
using namespace std;
int x, y;
int main()
{
cin >> x >> y;
if (x == y) cout << "0\n";
else if (x < y) cout << min(y - x, abs(y + x) + 1) << '\n';
else cout << min(abs(x + y) + 1, x - y + 2) << '\n';
}
| 0
| 66,724,249
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a==b && b==c && a==c ? "Yes" : "No") <<endl;
}
|
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0), ios::sync_with_stdio(false);
int H,W,M; cin >> H >> W >> M;
vi cnth(H),cntw(W),h(M),w(M);
set<pair<int,int>> s;
rep(i,M){
cin >> h[i] >> w[i];
h[i]--; w[i]--;
cnth[h[i]]++;
cntw[w[i]]++;
s.insert({h[i],w[i]});
}
int mxy = 0, mxx = 0;
rep(i,H) chmax(mxy,cnth[i]);
rep(i,W) chmax(mxx,cntw[i]);
vi y,x;
rep(i,H) if(mxy == cnth[i]) y.push_back(i);
rep(i,W) if(mxx == cntw[i]) x.push_back(i);
int ans = mxy+mxx;
for(auto a : y) for(auto b : x){
if(s.count({a,b})) continue;
cout << ans;
return 0;
}
cout << ans-1;
cout << "\n";
return 0;
}
| 0
| 97,852,842
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <stack>
#include <ctype.h>
#include <numeric>
#include <sstream>
#include <unistd.h>
#include <unordered_map>
#include <unordered_set>
#include <limits>
#include <random>
#include <chrono>
#include <iomanip>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
#define endl '\n'
#define debug(name) DEBUG(#name, (name))
template<typename T>
void DEBUG(string label, T value) {
cerr << "[" << label << " = " << value << "]\n";
}
void solve(){
string a, b;
cin >> a >> b;
if(a.size() != b.size()){
if(a.size() > b.size()){
cout << "GREATER" << endl;
}
else{
cout << "LESS" << endl;
}
}
else{
for(int i = 0; i < (int)a.size(); ++i){
if(a[i] < b[i]){
cout << "LESS" << endl;
return;
}
else if(a[i] > b[i]){
cout << "GREATER" << endl;
return;
}
}
cout << "EQUAL" << endl;
}
}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
}
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.fr>>a.sc;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.fr<<" "<<a.sc;return out;}
template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}
const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;
const int N=0;
void solve(){
int n,m,k;
cin>>n>>m>>k;
rep(x,0,n+1){
rep(y,0,m+1){
int c = x*m + y*n - 2*x*y;
if(k==c){
cout<<"Yes";
return;
}
}
}
cout<<"No";
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
#ifdef SIEVE
sieve();
#endif
#ifdef NCR
init();
#endif
int t=1;
while(t--) solve();
return 0;
}
| 0
| 52,632,620
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<ll,ll> pll;
const int N = 18;
ll a[1<<N];
pll res[1<<N];
void merge(int x,int y)
{
if(res[y].second>=res[x].first)
{
res[x].first = res[y].first;
res[x].second = res[y].second;
}
else if(res[y].second<=res[x].first&&res[y].first>=res[x].first)
{
res[x].second = res[x].first;
res[x].first = res[y].first;
}
else if(res[y].first<=res[x].first&&res[y].first>=res[x].second)
{
res[x].second = res[y].first;
}
}
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<(1<<n);i++) scanf("%lld",&a[i]);
for(i=0;i<(1<<n);i++)
{
res[i].first = a[i];
res[i].second = -1ll;
}
for(i=0;i<n;i++)
{
for(j=0;j<(1<<n);j++)
{
if((j&(1<<i))==0)
{
merge(j|(1<<i),j);
}
}
}
ll ans = 0ll;
for(i=1;i<(1<<n);i++)
{
ans = max(ans,res[i].first+res[i].second);
printf("%lld\n",ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N,K;
cin>>N>>K;
vector<pair<ll,int>> dt(N);
for(int i=0;i<N;i++){
cin>>dt.at(i).second>>dt.at(i).first;
}
sort(dt.begin(),dt.end());
reverse(dt.begin(),dt.end());
set<int> other;
set<int> l_index;
set<int> neta;
ll sum=0;
for(int i=0;i<K;i++){
if(neta.count(dt.at(i).second)==0){
neta.insert(dt.at(i).second);
l_index.insert(i);
sum+=dt.at(i).first;
}else{
other.insert(i);
sum+=dt.at(i).first;
}
}
ll ans=sum+(ll)neta.size()*(ll)neta.size();
for(int i=K;i<N;i++){
if(other.size()==0){
break;
}
if(neta.count(dt.at(i).second)==0){
l_index.insert(i);
neta.insert(dt.at(i).second);
sum+=dt.at(i).first;
int k=*rbegin(other);
sum-=dt.at(k).first;
other.erase(k);
ans=max<ll>(ans,sum+(ll)neta.size()*(ll)neta.size());
}
}
cout<<ans<<endl;
}
| 0
| 10,153,104
|
#include <stdio.h>
#include <algorithm>
#include <vector>
int n,m,p[100003],y[100003];std::vector<int> a[100003];
main(){
scanf("%d%d",&n,&m);for(int i=1;i<=m;i++) scanf("%d%d",&p[i],&y[i]),a[p[i]].push_back(y[i]);
for(int i=1;i<=n;i++) std::sort(a[i].begin(),a[i].end());
for(int i=1;i<=m;i++) printf("%012lld\n",p[i]*1000000ll+(std::lower_bound(a[p[i]].begin(),a[p[i]].end(),y[i])-a[p[i]].begin()+1));
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int>vec;
typedef vector<vec> mat;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin>>n>>s;
bool a[4][101010] = {{false,false},{false,true},{true,false},{true,true}};
for(int i=2;i<n;i++){
for(int j=0;j<4;j++){
a[j][i] = a[j][i-1] ^ a[j][i-2] ^ (s[i-1]=='o');
}
}
int k=-1;
for(int i=0;i<4;i++){
if((s[n-1]=='o')==(a[i][n-2]^a[i][n-1]^a[i][0]) && (s[0]=='o') == (a[i][n-1]^a[i][0]^a[i][1])){
k=i;
break;
}
}
if(k==-1){
cout<<-1<<endl;
}
else{
for(int i=0;i<n;i++){
cout<<"WS"[a[k][i]];
}
cout<<endl;
}
return 0;
}
| 0
| 36,646,877
|
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namespace std;
#define mod 1000000007
int main()
{
int n;
cin >> n;
int graph[101][101] = {};
for(int i = 0; i < n; i++){
int u, k;
cin >> u >> k;
u--;
for(int j = 0; j < k; j++){
int v;
cin >> v;
v--;
graph[u][v] = 1;
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cout << graph[i][j];
if(j == n - 1) cout << endl;
else cout << " ";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
vector<vector<char>> upper(50, vector<char>(100, '.'));
vector<vector<char>> lower(50, vector<char>(100, '#'));
int sx = 0, sy = 0;
for(int i=0; i<b-1; i++){
upper[sx][sy] = '#';
sy += 2;
if(sy == 100){
sx += 2;
sy = 0;
}
}
sx = 49; sy = 0;
for(int i=0; i<a-1; i++){
lower[sx][sy] = '.';
sy += 2;
if(sy == 100){
sx -= 2;
sy = 0;
}
}
cout << 100 << " " << 100 << endl;
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
cout << upper[i][j];
}cout << endl;
}
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
cout << lower[i][j];
}cout << endl;
}
return 0;
}
| 0
| 38,772,953
|
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;
cin>>n>>k;
ll ans=k;
reps(i,n,1){
ans*=(k-1);
}
cout<<ans<<endl;
return 0;
}
|
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
class TLcsSolver
{
typedef std::vector<std::vector<int> > TTable;
TTable FTable;
std::string FArray1;
std::string FArray2;
int Count(int i, int j)
{
if(i == 0 || j == 0) return 0;
if(FArray1[i-1] == FArray2[j-1]){
return FTable[i-1][j-1] + 1;
}
return std::max(FTable[i-1][j], FTable[i][j-1]);
}
void Solve()
{
for(std::size_t i = 1; i < FTable.size(); ++i){
for(std::size_t j = 1; j < FTable[i].size(); ++j){
FTable[i][j] = Count(i, j);
}
}
}
public:
TLcsSolver(const std::string& a, const std::string& b)
: FArray1(a), FArray2(b)
, FTable(a.size()+1, std::vector<int>(b.size()+1, 0))
{
Solve();
}
int Answer()const
{
return FTable[FArray1.size()][FArray2.size()];
}
void Print()const
{
for(std::size_t i = 0; i < FTable.size(); ++i){
for(std::size_t j = 0; j < FTable[i].size(); ++j){
std::cout << FTable[i][j] << '\t';
}
std::cout << '\n';
}
}
};
int main()
{
int n;
std::cin >> n;
for(int i = 0; i < n; ++i){
std::string a, b;
std::cin >> a >> b;
std::cout << TLcsSolver(a, b).Answer() << std::endl;
}
return 0;
}
| 0
| 23,530,766
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long,long>;
using veci = vector<int>;
using vecl = vector<long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const ll MOD = 1000000007;
int main() {
int N; ll K; cin >> N >> K;
veci A(N);
REP(i,N) cin >> A[i];
ll ans = 0;
REP(i,N) {
int r = 0;
int l = 0;
for(int j = i+1; j < N; j++) if(A[i] > A[j]) r++;
for(int j = i-1; j >= 0; j--) if(A[j] < A[i]) l++;
ll total = K*(K+1)/2;
total %= MOD;
ans += r * total;
ans %= MOD;
total = K*(K-1)/2;
total %= MOD;
ans += l * total;
ans %= MOD;
}
for(int i = N-1; i >= 0; --i) {
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int f(int x) {
int ans = 0;
while(x % 2 == 0) {
ans++;
x /= 2;
}
return ans;
}
int g(int64_t x, int64_t y) {
if(x > y) {
return g(y, x);
}
else if(y % x == 0) {
return x;
}
else {
return g(y % x, x);
}
}
int main() {
int N, M;
cin >> N >> M;
vector<int> b(N);
for(int i = 0; i < N; i++) {
int a;
cin >> a;
b.at(i) = a / 2;
}
vector<int> count(N);
for(int i = 0; i < N; i++) {
count.at(i) = f(b.at(i));
}
sort(count.begin(), count.end());
if(count.at(0) != count.at(N - 1)) {
cout << 0 << endl;
}
else {
for(int i = 0; i < N; i++) {
b.at(i) /= pow(2, count.at(i));
}
bool check = true;
int64_t a = b.at(0);
for(int i = 1; i < N; i++) {
int m = g(a, b.at(i));
a = a * b.at(i) / m;
if(a > 1000000000) {
check = false;
break;
}
}
if(!check) {
cout << 0 << endl;
}
else {
int x = a * pow(2, count.at(0));
if((M / x) % 2 == 0) {
cout << M / x / 2<< endl;
}
else {
cout << M / x / 2 + 1 << endl;
}
}
}
}
| 0
| 57,885,978
|
#include<iostream>
using namespace std;
int main() {
char rec;
cin >> rec;
char ans;
if (rec == 'A') {
ans = 'T';
}
else if (rec == 'C') {
ans = 'G';
}
else if (rec == 'G') {
ans = 'C';
}
else {
ans = 'A';
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vector<ll>>;
template<class T> inline bool chmin(T &a, T b) { if(a > b){ a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b) { if(a < b){ a = b; return true;} return false;}
int main() {
ll n, m;
cin >> n >> m;
if(n == 1 && m == 1){
cout << 1 << endl;
return 0;
}else if(n == 1){
cout << m-2 << endl;
return 0;
}else if(m == 1){
cout << n-2 << endl;
return 0;
}
cout << (n-2) * (m-2) << endl;
return 0;
}
| 0
| 59,437,521
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
const int mod=1000000007;
int main(){
int n;cin>>n;
int t[n],a[n];
rep(i,n)cin>>t[i];
rep(i,n)cin>>a[i];
int com[n];
rep(i,n)com[i]=min(t[i],a[i]);
com[0]=com[n-1]=1;
rep(i,n-1){
if(t[i]!=t[i+1]){
com[i+1]=1;
if(t[i+1]>a[i+1])com[i+1]=0;
}
}
rep(i,n-1){
if(a[i]!=a[i+1]){
com[i]=1;
if(a[i]>t[i])com[i]=0;
}
}
ll ans=1;
rep(i,n){
ans*=com[i]%mod;
ans%=mod;
}
cout<<ans*(t[n-1]==a[0]?1:0)<<endl;
}
|
#include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0) break;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int mindif = 10000000;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
mindif = min(mindif, abs(a[i] - a[j]));
}
}
cout << mindif << endl;
}
return 0;
}
| 0
| 71,050,451
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<int> even(100000 + 10, 0), odd(100000 + 10, 0);
for (int i = 0; i < n; i += 2) {
odd[v[i]]++;
}
for (int i = 1; i < n; i += 2) {
even[v[i]]++;
}
class Max {
public:
int cntmax = -1;
int cntsecond = -1;
int nummax = -1;
Max(int cm, int cs, int nm) {
cntmax = cm;
cntsecond = cs;
nummax = nm;
}
};
Max odds(odd[0], odd[1], 0), evens(even[0], even[1], 0);
for (int i = 1; i < 100000 + 10; i++) {
if (odds.cntmax < odd[i]) {
odds.cntsecond = odds.cntmax;
odds.cntmax = odd[i];
odds.nummax = i;
} else if (odds.cntsecond < odd[i]) {
odds.cntsecond = odd[i];
}
if (evens.cntmax < even[i]) {
evens.cntsecond = evens.cntmax;
evens.cntmax = even[i];
evens.nummax = i;
} else if (evens.cntsecond < even[i]) {
evens.cntsecond = even[i];
}
}
int ans;
if (odds.nummax == evens.nummax) {
ans = n -
max(odds.cntmax + evens.cntsecond, odds.cntsecond + evens.cntmax);
} else {
ans = n - odds.cntmax - evens.cntmax;
}
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 < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
int main(){
ll H,W;cin>>H>>W;
if(H%3==0 || W%3==0) cout<<0<<endl;
else{
ll tmp=1e18;
rep(i,W){
ll block1,block2,block3;
block1=i*H;
block2=(W-i)*((H+1)/2);
block3=(W-i)*(H/2);
tmp = min(tmp,max(block1,max(block2,block3))-min(block1,min(block2,block3)));
}
rep(i,W){
ll block1,block2,block3;
block1=i*H;
block2=((W-i+1)/2)*H;
block3=((W-i)/2)*H;
tmp = min(tmp,max(block1,max(block2,block3))-min(block1,min(block2,block3)));
}
rep(j,H){
ll block1,block2,block3;
block1=j*W;
block2=(H-j)*((W+1)/2);
block3=(H-j)*(W/2);
tmp = min(tmp,max(block1,max(block2,block3))-min(block1,min(block2,block3)));
}
rep(j,W){
ll block1,block2,block3;
block1=j*W;
block2=((H-j+1)/2)*W;
block3=((H-j)/2)*W;
tmp = min(tmp,max(block1,max(block2,block3))-min(block1,min(block2,block3)));
}
cout << tmp << endl;
}
}
| 0
| 21,904,944
|
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define INF 1000000005
#define LINF 1000000000000000005
int a,b,c;
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
cin >> a >> b >> c;
if(a==b && b==c) cout << "Yes";
else cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
for(int i=0; i<s.size()-1; i++)
if(s[i]==s[i+1])
return cout << i+1 << ' ' << i+2, 0;
for(int i=0; i<s.size()-2; i++)
if(s[i]==s[i+2])
return cout << i+1 << ' ' << i+3, 0;
cout << "-1 -1";
return 0;
}
| 0
| 12,926,425
|
#include <iostream>
using namespace std;
int graph[101][101];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
int u,k,v; cin>>u>>k;
for(int j=1;j<=k;j++){
cin>>v;
graph[u][v]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(j-1) cout<<" ";
cout<<graph[i][j];
}
cout<<"\n";
}
}
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.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, class U>T rem(T a, U b) { return a - b*floor(a/b); }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
string s, t;
cin >> s >> t;
sort(all(s));
sort(t.rbegin(), t.rend());
if (s < t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| 0
| 15,535,920
|
#include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.14159265358979323846264338327950L
#define VI vector<int>
#define VLL vector<long long>
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
const ll MOD = 1e9 + 7;
using namespace std;
template<typename T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template<typename T>
T lcm(T a, T b) {
ll g = gcd(a, b);
return a / g * b;
}
template<typename T>
T binarysearch(vector<T> A, T key) {
ll left = 0;ll right = 4;ll mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid]) return 1;
if (key > A[mid]) left = mid + 1;
else if (key < A[mid]) right = mid;
}
return 0;
}
template<typename T>
T finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
ll frac(ll n)
{
if (n == 0) {
return 1;
}
return (n * frac(n - 1)) % MOD;
}
template<typename T>
T keta(T a) {
ll kazu = 1;
while (1) {
if (a / 10 != 0) { a /= 10;kazu++; }
else break;
}
return kazu;
}
template<typename T>
bool IsPrime(T num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
template<typename T>
T nCr(ll n, T r) {
ll ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans * i;
}
for (int i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int main() {
ll N, M;cin>>N>>M;
ll ooo, oooo;
bool ok = false;
map<ll, ll>a;
for (ll i = 0;i < M;i++) {
cin >> ooo >> oooo;
if (ooo == 1) {
if (a[oooo] == 0||a[oooo]==1)a[oooo] = 1;
else if(a[oooo]==N){
ok = true;
break;
}
}
if (oooo == 1) {
if (a[ooo] == 0 || a[ooo] == 1)a[oooo] = 1;
else if (a[ooo] == N) {
ok = true;
break;
}
}
if (ooo == N) {
if (a[oooo] == 0 || a[oooo] == N)a[oooo] = N;
else if (a[oooo] == 1) {
ok = true;
break;
}
}
if (oooo == N) {
if (a[ooo] == 0 || a[ooo] == N)a[ooo] = N;
else if (a[ooo] == 1) {
ok = true;
break;
}
}
}
if (ok)cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#define DIV 1000000007
using namespace std;
bool cmp(const pair<int, int>& a, const pair<int, int>& b)
{
return b.second < a.second;
}
int main() {
int N;
cin >> N;
vector<pair<int,int>> red(N);
for (int i = 0; i < N; i++)
cin >> red[i].first>>red[i].second;
vector<pair<int, int>> blue(N);
for (int i = 0; i < N; i++)
cin >> blue[i].first >> blue[i].second;
sort(red.begin(), red.end(),cmp);
sort(blue.begin(), blue.end());
int ans = 0;
vector<bool> red_used(N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (red_used[j]) continue;
if (blue[i].first > red[j].first&& blue[i].second > red[j].second) {
ans++;
red_used[j] = true;
break;
}
}
}
cout << ans << endl;
}
| 0
| 4,133,636
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void)
{
int a, b, c;
int k;
cin >> a >> b >> c >> k;
int cnt = 0;
while (true)
{
if (a < b)
{
break;
}
b <<= 1;
cnt++;
}
while (true)
{
if (b < c)
{
break;
}
c <<= 1;
cnt++;
}
if (k < cnt)
{
cout << "No" << endl;
}
else
{
cout << "Yes" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool chk(ll a,ll b,ll k){
if(b+k>=a*b)return 0;
if(k*(b+1)>=a*b)return 0;
if(b+k+1>=2*k)return 1;
if((b+k+1)*(b+k+1)<4*a*b)return 1;
return 0;
}
void solve(){
ll a,b;cin>>a>>b;
if(a<b)swap(a,b);
ll s=1,e=a-1,ans=0;
while(s<=e){
ll mid=(s+e)>>1;
if(chk(a,b,mid))ans=mid,s=mid+1;
else e=mid-1;
}
cout<<ans+b-1<<"\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;cin>>t;
while(t--)solve();
}
| 0
| 90,491,332
|
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
string S, T="";
cin >> S;
for (char c:S) {
if (c=='B') {
if (T.size()==0) {continue;}
else {T.erase(T.size()-1);}
}
else {T.push_back(c);}
}
cout << T << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int next(int n)
{
n++;
int res = n;
int add = 1;
while(n)
{
if(n%10==4)
{
res -= add*4;
res += add*10;
n+=10;
}
add*=10;
n/=10;
}
return res;
}
int ten(int n)
{
int res = 1;
for(int i = 0;i<n;i++)
{
res*=10;
}
return res;
}
int main()
{
int n;
cin >> n;
int tn = ten(n);
int bit = 0;
int A[4];
cin >> A[1] >> A[2] >> A[3];
vector<int> l(n);
for(int i =0 ;i<n;i++)
{
cin >> l[i];
}
int ans = 1001001001;
for(int i = 0;bit<tn;i++)
{
bit = next(bit);
int B = bit;
int cnt[4]={};
int add[4]={};
int j = 0;
while(B)
{
add[B%10]+=l[j++];
cnt[B%10]++;
B/=10;
}
int cost = 0;
for(int i = 1;i<=3;i++)
{
if(cnt[i]==0)cost= 1e9;
cost += 10*max(0,cnt[i]-1);
cost += abs(add[i]-A[i]);
}
ans = min(ans,cost);
}
cout<<ans<<endl;
}
| 0
| 12,917,746
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <sstream>
using namespace std;
int main() {
vector<int>c(26);
while (true) {
string x;
getline(cin, x);
if (x == "")break;
for (int i = 0; i < x.size(); i++) {
if ('a' <= x[i] && x[i] <= 'z')c[x[i] - 'a']++;
if ('A' <= x[i] && x[i] <= 'Z')c[x[i] - 'A']++;
}
}
for (int i = 'a'; i <= 'z'; i++) {
cout << (char)i << " : " << c[i - 'a'] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define _ <<' '<<
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define Vout(a) rep(lZ,0,a.size()-1)cout<<a[lZ]<<' ';cout<<a.back()<<endl
#define VVout(a) rep(lY,0,a.size()){if(!a[lY].empty()){Vout(a[lY]);}else cout<<endl;}
#define VPout(a) rep(lX,0,a.size())cout<<a[lX].FI<<' '<<a[lX].SE<<endl
#define Verr(a) rep(iZ,0,a.size()-1)cerr<<a[iZ]<<' ';cerr<<a.back()<<endl
#define VVerr(a) rep(J,0,a.size()){if(!a[J].empty()){Verr(a[J]);}else cerr<<'.'<<endl;}
#define VPerr(a) rep(iX,0,a.size())cerr<<a[iX].FI<<' '<<a[iX].SE<<endl
#define INF 3000000000000000000
#define MAX LLONG_MAX
#define MOD 1000000007
using namespace std;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
void press(auto &v){v.erase(unique(ALL(v)),v.end());}
int mypow(int x, int n, int m){
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
signed main() {
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
int w,b;
cin >> w >> b;
if(w==1&&b==1) {cout<<"1 2"<<endl<<".#"<<endl;return 0;}
cout<<"100 100"<<endl;
vector<string> ans;
string white="";
string black="";
rep(i,0,100){
white.pb('.');
black.pb('#');
}
int ct=0;
if(w==1){
rep(i,0,100) ans.pb(white);
rep(i,0,50){
rep(j,0,50){
if(ct==b) {
rep(QW,0,100){
cout<<ans[QW]<<endl;
}
return 0;
}
ans[i*2][j*2] = '#';
ct++;
}
}
}
if(b==1){
rep(i,0,100) ans.pb(black);
rep(i,0,50){
rep(j,0,50){
if(ct==w) {
rep(QW,0,100){
cout<<ans[QW]<<endl;
}
return 0;
}
ans[i*2][j*2] = '.';
ct++;
}
}
}
rep(i,0,50){
ans.pb(white);
}
rep(i,0,50){
ans.pb(black);
}
ct = 0;
bool ok = false;
rep(i,0,50){
rep(j,0,50){
if(ct==b-1) {ok=true;break;}
ans[i*2][j*2] = '#';
ct++;
}
if(ok) break;
}
reverse(ALL(ans));
ct=0;
ok=false;
rep(i,0,50){
rep(j,0,50){
if(ct==w-1) {ok=true;break;}
ans[i*2][j*2] = '.';
ct++;
}
if(ok) break;
}
rep(i,0,100){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 79,119,206
|
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void c_not_so_diverse(void) {
int n, k;
int *a;
cin >> n >> k;
a = (int*)(calloc(n, sizeof(int)));
for (int i = 0; i < n; i++) cin >> a[i];
int* b;
b = (int*)(calloc(n+1, sizeof(int)));
for (int i = 0; i < n; i++) b[a[i]]++;
sort(b, b + n+1);
int type_cnt = 0;
int k_cnt = 0;
for (int i = 0; i < n+1; i++) {
if (b[i] == 0) continue;
type_cnt++;
}
int cnt = 0;
for (int i = 0; i < n+1; i++) {
if (k_cnt >= (type_cnt - k)) break;
if (b[i] == 0)continue;
cnt += b[i];
k_cnt++;
}
cout << cnt << endl;
}
int main()
{
c_not_so_diverse();
return 0;
}
|
#include<bits/stdc++.h>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
using namespace std;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
bool divid[1000006];
int freq[1000006];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,ans=0;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i],freq[v[i]]++;
sort(v.begin(),v.end());
v.resize(unique(v.begin(),v.end())-v.begin());
for(int i=0;i<v.size();i++)
for(int j=v[i]+v[i];j<=1000000;j+=v[i])
divid[j]=1;
for(int i=0;i<v.size();i++)
ans+=(freq[v[i]]==1&&divid[v[i]]==0);
cout<<ans;
return 0;
}
| 0
| 14,162,647
|
#include <iostream>
#include <algorithm>
using namespace std;
long long INF = 1001001001001;
long long score(long long a, long long b, long long c) {
return max({a, b, c}) - min({a, b, c});
}
int main() {
long long h, w;
cin >> h >> w;
long long ans = INF;
if (h >= 3) ans = min(ans, (h+2)/3*w - h/3*w);
if (w >= 3) ans = min(ans, (w+2)/3*h - w/3*h);
for (long long a = 1; a < w; a++) {
long long now = score(h*a, h/2*(w-a), (h+1)/2*(w-a));
ans = min(ans, now);
}
for (long long a = 1; a < h; a++) {
long long now = score(a*w, w/2*(h-a), (w+1)/2*(h-a));
ans = min(ans, now);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
const int mod = 1e9 + 7;
int main() {
int h, w, d;
cin >> h >> w >> d;
vector<P> place(h * w);
rep (i, h) {
vector<int> x(w);
rep (j, w) {
cin >> x[j];
x[j]--;
}
rep (j, w) {
place[x[j]] = make_pair(i, j);
}
}
vector<vector<int>> dist(d);
rep (i, d) {
dist[i].push_back(0);
}
rep (i, h * w) {
if (i / d == 0) {
dist[i % d].push_back(0);
} else {
int x = abs(place[i].first - place[i-d].first);
int y = abs(place[i].second - place[i-d].second);
dist[i % d].push_back(x + y);
}
}
rep (i, d) {
rep (j, dist[i].size() - 1) {
dist[i][j+1] += dist[i][j];
}
}
int q;
cin >> q;
rep (i, q) {
int start, goal;
cin >> start >> goal;
if (start == goal) {
cout << 0 << endl;
continue;
}
start--; goal--;
int row = start % d;
start /= d;
goal /= d;
cout << dist[row][goal+1] - dist[row][start+1] << endl;
}
}
| 0
| 77,342,995
|
#include <cstdio>
using namespace std;
int KetanoWa(char ch[])
{
int sum = 0;
for(int i = 0; ch[i]; ++i){
sum += ch[i] - 48;
}
return sum;
}
int main()
{
char ch[1001];
while(true){
scanf("%s", ch);
int sum = KetanoWa(ch);
if(sum == 0) break;
printf("%d\n", sum);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
string s;
cin>>s;
if(s[2]==s[3] && s[4]==s[5])
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
}
| 0
| 76,901,391
|
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
int main(){
string S;
cin >> S;
ll s = S.size();
for(ll i = s - 1;i >= 0;i--){
if(i % 2 == 0){
if(S.substr(0,i / 2) == S.substr(i/2,i/2)){
cout << i << endl;
break;
}
}
}
}
|
#include <stdio.h>
#include <string.h>
int main(){
char str1[25];
char str2[25];
char str3[25];
scanf("%s %s %s", str1, str2, str3);
if (str1[strlen(str1)-1] == str2[0]){
if (str2[strlen(str2)-1] == str3[0]){
printf("YES\n");
}
else
{
printf("NO\n");
}
}
else
{
printf("NO\n");
}
return 0;
}
| 0
| 28,561,454
|
#include<stdio.h>
int main()
{
int n;
int ctr[26] = {0}, flag = 1;
scanf("%d", &n);
char str[n + 1];
scanf("%s", &str);
for(int i = 0; str[i] != '\0'; i++){
if(str[i] >= 'a' && str[i] <= 'z'){
++ctr[str[i] - 'a'];
}
}
if(n % 2 != 0){
printf("No\n");
return 0;
}else{
for(int i = 0; i < 26; i++){
if(ctr[i] > 0){
if(ctr[i] % 2 != 0){
flag = 0;
}
}
}
}
if(flag == 1){
printf("Yes\n");
}else{
printf("No\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define All(x) (x).begin(), (x).end()
#define mp make_pair
#define Task "abc"
typedef long long ll;
const int maxn = 1e4 + 10;
const ll mod = 1e9 + 7;
int n, m;
int c[] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int num[10], cost[10], ma[8];
int f[maxn], tr[maxn];
void Trace(int i){
if (i == 0) return;
int t = tr[i];
cout << ma[i - t];
Trace(t);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < 10; ++i){
cost[i+1] = c[i];
}
for (int i = 0; i < m; ++i){
cin >> num[i];
ma[cost[num[i]]] = max(ma[cost[num[i]]], num[i]);
}
sort(num, num + m);
const int inf = 2e9;
fill(f, f + maxn, -inf);
f[0] = 0;
for (int i = 2; i <= n; ++i) for (int j = 0; j < m; ++j){
int l = cost[num[j]];
if (num[j] != ma[l]) continue;
if (i < l) continue;
if (f[i] <= f[i-l] + 1){
f[i] = f[i-l] + 1;
tr[i] = i-l;
}
}
Trace(n);
return 0;
}
| 0
| 52,192,551
|
#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 = 510, M = 1010;
int a, b, n = 100;
char g[N][N];
int main()
{
cin >> a >> b;
a -- , b -- ;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= n; j ++ )
g[i][j] = i <= 50 ? '#' : '.';
for (int i = 1; a && i <= n / 2 - 1; i += 2)
for (int j = 1; a && j <= n; j += 2, a -- )
g[i][j] = '.';
for (int i = n / 2 + 2; b && i <= n; i += 2)
for (int j = 1; b && j <= n; j += 2, b -- )
g[i][j] = '#';
puts("100 100");
for (int i = 1; i <= n; i ++ ) puts(g[i] + 1);
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 PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9+7LL;
long long dp0[101][4];
long long dp1[101][4];
int main() {
string N; cin >> N;
int K; cin >> K;
int L = N.size();
fill( ( long long * )dp0, ( long long * )dp0 + sizeof( dp0 ) / sizeof( long long ), 0 );
fill( ( long long * )dp1, ( long long * )dp1 + sizeof( dp1 ) / sizeof( long long ), 0 );
dp0[0][0] = 1;
dp1[0][1] = 1;
dp0[0][1] = N.at(0)-'1';
for ( int i = 0; i < L-1; ++i ){
for ( int j = 0; j < K+1; ++j ){
dp0[i+1][j] = dp0[i][j];
if(j>0) dp0[i+1][j] += 9*dp0[i][j-1];
if(N[i+1]=='0'){
dp1[i+1][j] = dp1[i][j];
}
else{
if(j>0){
dp0[i+1][j] += (N[i+1]-'1')*dp1[i][j-1];
dp1[i+1][j] += dp1[i][j-1];
}
dp0[i+1][j] += dp1[i][j];
}
}
}
cout << dp0[L-1][K] + dp1[L-1][K] << endl;
}
| 0
| 67,595,876
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long long num_order(long long X){
long long ans=0;
while(true){
if(X==0){
break;
}
else{
X/=10;
ans++;
}
}
return ans;
}
int main() {
long long N;
cin>>N;
cout<<N*(N-1)/2<<endl;
}
|
#include<bits/stdc++.h>
#define pi pair<int,int>
#define mk make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define fo(i,a,n) for(int i=a;i<n;i++)
#define fr(i,a,n) for(int i=a;i>=n;i--)
#define ll long long
#define N 1000000007
using namespace std;
int h,w;
vector<vector<int>> dp(1005,vector<int> (1005,-1));
char grid[1005][1005];
ll path_cost(int i,int j)
{
if(i==h&&j==w)
return 1;
if(grid[i][j]=='#')
return 0;
if(i>h||j>w)
return 0;
if(dp[i][j]==-1)
dp[i][j] = (path_cost(i+1,j)+path_cost(i,j+1))%N;
return dp[i][j];
}
int main()
{
cin>>h>>w;
fo(i,1,h+1)
{
fo(j,1,w+1)
{
cin>>grid[i][j];
}
}
ll ans=path_cost(1,1);
cout<<ans;
}
| 0
| 805,645
|
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int main(){
ll n,m;
cin >> n >> m;
ll ans=0;
ans+=min(n,m/2);
ans+=max(0LL,(m-2*n)/4);
cout << ans;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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 rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(bit)
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 long double pi = acos(-1.0);
const int MAX = 1000010;
const int INF = 1LL << 60;
const int MOD = 1000000007;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k; cin >> n >> k;
if (n == 1) {cout << k << endl; return 0;}
else {
int ans = k;
rep(i,n-1) ans *= k-1;
cout << ans << endl;
return 0;
}
}
| 0
| 20,013,139
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL<<60;
int main(int, char**) {
map<char, int> dics;
map<char, int> dict;
string s, t;
cin >> s >> t;
int n = s.size();
int cnt1 = 1;
int cnt2 = 1;
for (int i=0; i<n; i++) {
char c1 = s[i];
int now1;
if (dics.count(c1)) {
now1 = dics[c1];
} else {
dics[c1] = cnt1;
now1 = cnt1;
cnt1++;
}
char c2 = t[i];
int now2;
if (dict.count(c2)) {
now2 = dict[c2];
} else {
dict[c2] = cnt2;
now2 = cnt2;
cnt2++;
}
if (now1!=now2) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int len = S.size();
map<char, int>m;
for (int i=0; i < len; i++) {
if (m.count(S[i]) > 0) {
m[S[i]] = m[S[i]] + 1;
} else {
m[S[i]] = 1;
}
}
for (int i=1; i<N; i++) {
string n;
cin >> n;
map<char, int> hikaku;
int n_size = n.size();
for (int j=0; j < n_size; j++) {
if (m.count(n[j]) > 0) {
if (hikaku.count(n[j]) > 0) {
hikaku[n[j]] = 1 + hikaku[n[j]];
} else {
hikaku[n[j]] = 1;
}
}
}
for (const auto j: m){
int count = hikaku[j.first];
hikaku[j.first] = min(j.second, count);
}
m = hikaku;
}
vector<string>vec;
for (const auto j:m) {
int count = m[j.first];
while (count > 0) {
vec.emplace_back(string() + j.first);
count -= 1;
}
}
sort(vec.begin(), vec.end());
int vec_size = vec.size();
for (int i=0; i < vec_size; i++) {
cout << vec[i];
}
cout << endl;
return 0;
}
| 0
| 64,427,255
|
#include<cstdint>
#include<limits>
#include<cstdbool>
#include<cmath>
#include<iostream>
#include<vector>
#include<array>
#include<list>
#include<string>
#include<sstream>
#include<algorithm>
int main(){
int n;
std::cin>>n;
std::cin.get();
std::vector<int> x;
x.reserve(n);
std::string buff;
getline(std::cin,buff);
std::stringstream ss(buff);
int temp;
while(!ss.eof()){
ss>>temp;
x.push_back(temp);
}
std::sort(x.begin(), x.end());
std::cout<<x[n/2]-x[n/2-1];
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;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(void){
int n;
cin >> n;
int d[n];
REP(i,n) cin >> d[i];
ll ans=0;
REP(i,n-1){
FOR(j,i+1,n){
ans+=d[i]*d[j];
}
}
cout << ans;
return 0;
}
| 0
| 48,101,300
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
long long a;
string b;
cin >> a >> b;
int aa,bb,cc,dd;
string aaa,bbb,ccc;
aaa=b[0];
bbb=b[2];
ccc=b[3];
aa=stoi(aaa)*100;
bb=stoi(bbb)*10;
cc=stoi(ccc);
dd=aa+bb+cc;
long long ans;
ans=dd*a/100;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll K,S;
cin >> K>>S;
ll ans = 0;
REP(i,K+1){
REP(j,K+1){
ll tmp = S - i - j;
if(tmp>=0&&tmp<=K){
ans++;
}
}
}
cout << ans << endl;
}
| 0
| 62,419,524
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
for(int i=0; i<s.length(); i++){
if(s.at(i) != t.at(i)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 62;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
return f.second > s.second;
}
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;
}
ll nCr(ll n, ll r){
if(r == 0 || r == n){
return 1;
} else if(r == 1){
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r){
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--) ret *= i;
return ret;
}
int main(void){
ll n, K;
cin >> n >> K;
vector<ll> x(n);
vector<ll> y(n);
vector<pair<ll,ll>> vec(n);
rep(i, n){
cin >> x[i] >> y[i];
vec[i] = {x[i], y[i]};
}
sort(all(x));
sort(all(y));
ll ans = INF;
for(int x1 = 0; x1 < n; x1++){
for(int x2 = x1 + 1; x2 < n; x2++){
for(int y1 = 0; y1 < n; y1++){
for(int y2 = y1 + 1; y2 < n; y2++){
int cnt = 0;
for(int i = 0; i < n; i++){
if(vec[i].first >= x[x1] && vec[i].first <= x[x2]){
if(vec[i].second >= y[y1] && vec[i].second <= y[y2]){
cnt++;
}
}
}
if(cnt >= K){
ans = min(ans, abs(x[x1] - x[x2]) * abs(y[y1] - y[y2]));
}
}
}
}
}
cout << ans << endl;
}
| 0
| 56,734,346
|
#include"iostream"
#include"vector"
using namespace std;
int main()
{
int n;
cin>>n;
vector< vector<int> > matrix (n, vector<int>(n) );
vector<int> visit;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)matrix[i][j]=0;
int y;
cin>>y;
int num;
cin>>num;
for(int j=0;j<num;j++)
{
int x;
cin>>x;
matrix[y-1][x-1]=1;
}
}
for(int i=0;i<n;i++)
{
cout<<matrix[i][0];
for(int j=1;j<n;j++)
{
cout<<" "<<matrix[i][j];
}
cout<<endl;
}
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
char S[304][304];
int main(){
int N;
scanf("%d", &N);
for (int i=0; i<N; i++){
std::string s;
std::cin >> s;
for (int j=0; j<N; j++){
S[i][j]=s[j];
}
}
int ans = 0;
for (int d=-N+1; d<=N-1; d++){
bool ok=true;
for (int i=0; i<N; i++){
for (int j=0; j<N; j++){
int I = j+d;
if (I<0) I+=N;
if (I>=N) I-=N;
int J = i-d;
if (J<0) J+=N;
if (J>=N) J-=N;
if (S[i][j]!=S[I][J]) {
ok=false;
break;
}
}
}
if (ok){
ans += N-abs(d);
}
}
std::cout << ans << std::endl;
return 0;
}
| 0
| 5,380,216
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long long num_order(long long X){
long long ans=0;
while(true){
if(X==0){
break;
}
else{
X/=10;
ans++;
}
}
return ans;
}
int main() {
string S;
int W;
cin>>S>>W;
for(int i=0;i<S.size();i+=W){
cout<<S[i];
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
long long sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i+1; j < n; j++) {
sum += d[i]*d[j];
}
}
cout << sum << endl;
}
| 0
| 25,680,418
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
static const long long INF = 1000000;
using p = pair<int,int>;
int main(){
char s;
cin >> s;
char ans;
ans = s + 1;
cout << ans << endl;
}
|
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define sum(x) accumulate(ALL(x), 0LL)
#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))
#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))
using namespace std;
const int MOD = (int)(1e9 + 7);
const int INF = (int)(1e13 + 7);
const double EPS = 1e-14;
const double PI = acos(-1);
int CEIL(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
int mod(int a, int b) { return a >= 0 ? a % b : a - (b * CEIL(a, b)); }
int bpm(int a, int b) {
int res = 1;
for (a %= MOD; b; a = a * a % MOD, b >>= 1)
if (b & 1) res = res * a % MOD;
return res;
}
class DKatanaThrower {
public:
static void solve(istream &cin, ostream &cout) {
int N, H;
cin >> N >> H;
vector<int> a(N);
vector<int> b(N);
rep(i, N) {
cin >> a[i] >> b[i];
}
if (MAX(a) >= MAX(b)) {
cout << CEIL(H, MAX(a)) << endl;
} else {
int ans = 0;
sort(ALL(a));
sort(ALL(b));
while (b[b.size() - 1] > a[a.size() - 1]) {
H -= b[b.size() - 1];
b.pop_back();
ans++;
if (H <= 0) {
cout << ans << endl;
return;
} else if (b.size() == 0) {
break;
}
}
ans += CEIL(H, a[a.size() - 1]);
cout << ans << endl;
}
}
};
signed main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(15);
DKatanaThrower solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0
| 71,073,784
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int table[1001][1001] = {};
int main()
{
string a, b;
cin >> a >> b;
for (int i = 0; i < a.size() + 1; i++)
{
table[i][0] = i;
}
for (int j = 0; j < b.size() + 1; j++)
{
table[0][j] = j;
}
for (int i = 1; i < a.size() + 1; i++)
{
for (int j = 1; j < b.size() + 1; j++)
{
if (a[i - 1] == b[j - 1])
table[i][j] = min({ table[i - 1][j - 1], table[i - 1][j] + 1, table[i][j - 1] + 1 });
else
table[i][j] = min({ table[i - 1][j - 1] + 1, table[i - 1][j] + 1, table[i][j - 1] + 1 });
}
}
cout << table[a.size()][b.size()] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
bool isOkmx(ll a,vector<int> v){
rep(i,v.size()){
a /= v[i];
a *= v[i];
}
return a >= 2;
}
bool isOkmin(ll a,vector<int> v){
rep(i,v.size()){
a /= v[i];
a *= v[i];
}
return a <= 2;
}
int main()
{
int k;
cin >> k;
vector<int> a(k);
rep(i,k){
cin >> a[i];
}
ll ok = 1e+18;
ll ng = 1;
ll lx = 0, rx = 0;
while (abs(ok - ng)>1)
{
ll mid = (ng+ok)/2;
if(isOkmx(mid,a)){
ok = mid;
}else{
ng = mid;
}
}
lx = ok;
ok = 1;
ng = 1e+18;
while (abs(ok - ng)>1)
{
ll mid = (ng + ok) / 2;
if (isOkmin(mid, a))
{
ok = mid;
}
else
{
ng = mid;
}
}
rx = ok;
if(lx > rx){
cout << -1 << endl;
}else{
cout << lx << " " << rx << endl;
}
}
| 0
| 54,336,465
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <fstream>
using namespace std;
long long mod = 1000000007;
void dfs(int p, int prev, vector<int> &a, vector<int> &dp, int dpl, vector<vector<int>> &v, vector<int> &res)
{
int l = -1, r = dpl, mid;
while (r - l > 1)
{
mid = (l + r) / 2;
if (dp[mid] >= a[p])
{
r = mid;
}
else
{
l = mid;
}
}
int temp = dp[r];
dp[r] = a[p];
if (temp == -1)
{
dpl++;
}
res[p] = dpl;
for (int i = 0; i < v[p].size(); i++)
{
if (v[p][i] == prev)
{
continue;
}
dfs(v[p][i], p, a, dp, dpl, v, res);
}
dp[r] = temp;
}
int main()
{
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
string s, v;
cin >> s >> v;
for (int i = 0; i < s.size(); i++)
{
if (s[i] != v[i])
{
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i,N) cin >> H.at(i);
int ans = 0;
int cnt = 0;
rep(i,N-1) {
if (H.at(i) >= H.at(i+1)) cnt++;
if (H.at(i) < H.at(i+1) || i == N - 2) {
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
}
| 0
| 19,984,664
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
string str;
string target = "keyence";
int main(){
cin>>str;
if(str == target){
puts("YES");
return 0;
}
int n = str.size();
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
string S = "";
for(int k=0;k<n;k++){
if(i<=k && k<=j){
continue;
}
else S.push_back(str[k]);
}
if(S == target){
puts("YES");
return 0;
}
}
}
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
string s; ll k; cin >> s >> k;
ll n = s.size();
unordered_map<char, int> m;
rep(i, n){
m[s[i]]++;
}
if(m.size() == 1){
cout << n*k/2 << endl;
return;
}
vec memo(n);
ll cnt1 = 0;
rep(i, n-1){
if(memo[i] == 0 && s[i] == s[i+1]){
memo[i+1] = 1;
cnt1++;
}
}
if(k == 1){
cout << cnt1 << endl;
return;
}
string t = s+s;
vec tmemo(t.size());
ll cnt2 = 0;
rep(i, t.size()-1){
if(tmemo[i] == 0 && t[i] == t[i+1]){
tmemo[i+1] = 1;
cnt2++;
}
}
cout << (cnt2-cnt1)*(k-1) + cnt1 << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 82,381,911
|
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int,int> > vp;
int main()
{
while(1)
{
string s;
getline(cin,s);
if(s==".") break;
stack<char> pot;
int sql=0,sqr=0,cil=0,cir=0;
bool miss=false;
bool psql=false,pcil=false;
for(int i=0;i<s.size();i++)
{
if(s[i]=='(')
{
cil++;
pot.push('(');
}
else if(s[i]==')')
{
cir++;
if(pot.empty() || pot.top()!='(')
{
cout << "no" << endl;
miss=true;
break;
}
pot.pop();
}
else if(s[i]=='[')
{
sql++;
pot.push('[');
}
else if(s[i]==']')
{
sqr++;
if(pot.empty() || pot.top()!='[')
{
cout << "no" << endl;
miss=true;
break;
}
pot.pop();
}
if(sqr>sql || cir>cil)
{
cout << "no" << endl;
miss=true;
break;
}
}
if(!miss)
{
if(sql==sqr && cil==cir)
{
cout << "yes" << endl;
}
else
{
cout << "no" << endl;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<char>> data(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> data.at(i).at(j);
}
}
vector<int> dx={-1,0,1,0};
vector<int> dy={0,1,0,-1};
bool jd = true;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(data.at(i).at(j)=='#'){
bool found=false;
for(int k=0;k<4;k++){
int x=i+dx.at(k);
int y=j+dy.at(k);
if(x>=0&&x<h&&y>=0&&y<w&&data.at(x).at(y)=='#'){found=true;}
}
if(!found){jd=false;}
}
}
}
if(jd){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| 0
| 54,373,299
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
char c[10][10];
int main(void){
c[1][0]='.';
c[1][1]=',';
c[1][2]='!';
c[1][3]='?';
c[1][4]=' ';
char alpha='a';
for(int i=2;i<=9;i++){
int index=0;
if(i==7|| i==9){
while(index<4){
c[i][index]=alpha;
index++;
alpha++;
}
}
else{
while(index<3){
c[i][index]=alpha;
index++;
alpha++;
}
}
}
int n;
string s;
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
int cnt=0;
char d='0';
for(int i=0;i<s.length();i++){
if(s[i]=='0'){
if(d!='0'){
int x=d-'0';
if(x==7||x==9){
cout<<c[x][(cnt-1)%4];
cnt=0;
d='0';
}
else if(x==1){
cout<<c[x][(cnt-1)%5];
cnt=0;
d='0';
}
else{
cout<<c[x][(cnt-1)%3];
cnt=0;
d='0';
}
}
}
else{
d=s[i];
cnt++;
}
}
cout<<endl;
}
return 0;
}
|
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
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; }
template <class T> void swap(T& a, T& b) { T t = std::move(a); a = std::move(b); b = std::move(t); }
int main(void)
{
ll N, K, i, j, A[2000], in=0, ex=0, ans;
cin >> N >> K;
for(i=0; i<=N-1; i++){
cin >> A[i];
}
for(i=0; i<=N-2; i++){
for(j=i+1; j<=N-1; j++){
if(A[i] > A[j]){
in++;
}
}
}
for(i=0; i<=N-1; i++){
for(j=0; j<=N-1; j++){
if(A[i] > A[j]){
ex++;
}
}
}
ans = (in * K) % div1;
ans += (K*(K-1)/2)%div1 * ex % div1;
ans = ans % div1;
cout << ans << endl;
return 0;
}
| 0
| 11,179,258
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
#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())
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int MOD = 1000000007;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
int main(int argc, char const* argv[])
{
int n,i;
cin >> n;
for ( i = 1;i*(i+1)/2 < n; i++) {
}
for (int j = 1; j <= i; j++) {
if (j == i*(i+1)/2 - n) {
continue;
}
cout << j << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Dp(int n , int k,int h[] , bool vis[] , long long dp[]){
if(vis[n]){
return dp[n];
}else{
vector <int> back;
for(int step = 1 ; step <= k ; step++){
if(n - step >= 0){
int x = Dp(n-step,k,h,vis,dp) + abs(h[n] - h[n-step]);
back.push_back(x);
}
}
sort(back.begin(),back.end());
vis[n] = true;
dp[n] = back[0];
return dp[n];
}
}
void init(int n , bool vis[]){
vis[0] = true;
for(int i = 1; i < n ; i++){
vis[i] = false;
}
}
int main(){
int n,k;
cin >> n >> k;
int h[n];
bool vis[n];
long long dp[n];
dp[0] = 0;
init(n,vis);
for(int i = 0 ; i < n ; i++){
cin >> h[i];
}
long long ans = Dp(n-1,k,h,vis,dp);
cout << ans;
return 0;
}
| 0
| 66,290,419
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, k; cin >> n >> k;
vector<ll> sum(n + 1);
for(int i = 0; i < n; i++) {
int a; cin >> a; sum[i + 1] = sum[i] + a;
}
vector<ll> a;
for(int i = 0; i < n; i++){
for(int j = i + 1; j <= n; j++)a.push_back(sum[j] - sum[i]);
}
ll res = 0;
for(int i = 60; i >= 0; i--) {
vector<ll> nxt;
for(auto j : a) {
if(j & (1LL << i))nxt.push_back(j);
}
if((int)nxt.size() >= k) {
res |= (1LL<<i);
a = nxt;
}
}
cout << res << endl;
}
|
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define rep(i, N) for(int i = 0; i < N; i++)
#define rep2(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000000000000
#define MAX 200001
const ll MOD = 1000000007;
template <typename T > inline string toString(const T &a) {ostringstream oss; oss << a; return oss.str();};
int main(){
int K,N;
cin >> K >> N;
vector<int> A(N);
int ans;
rep(i,N) cin >> A[i];
rep(i,N){
if(i==0){
ans = A[N-1]-A[0];
}
else{
ans = min(K-A[i] + A[i-1], ans);
}
}
cout << ans << endl;
}
| 0
| 68,533,962
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
s1[0] = toupper(s1[0]);
s2[0] = toupper(s2[0]);
s3[0] = toupper(s3[0]);
cout << s1[0] << s2[0] << s3[0];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n,i;
string out;
cin >> n;
switch(n){
case 1:
out = "1";
break;
case 2:
out = "2";
break;
case 3:
out = "6";
break;
case 4:
out = "24";
break;
case 5:
out = "120";
break;
case 6:
out = "720";
break;
case 7:
out = "5040";
break;
case 8:
out = "40320";
break;
case 9:
out = "362880";
break;
case 10:
out = "3628800";
break;
case 11:
out = "39916800";
break;
case 12:
out = "479001600";
break;
case 13:
out = "6227020800";
break;
case 14:
out = "87178291200";
break;
case 15:
out = "1307674368000";
break;
case 16:
out = "20922789888000";
break;
case 17:
out = "355687428096000";
break;
case 18:
out = "6402373705728000";
break;
case 19:
out = "121645100408832000";
break;
case 20:
out = "2432902008176640000";
break;
}
cout << out <<endl;
return 0;
}
| 0
| 41,537,297
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
const ll mod = 1000000007;
const int INF = 1001001001;
int main(){
int n, m;
cin >> n >> m;
int arr[9] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> a(m);
rep(i, m) cin >> a[i];
sort(whole(a));
reverse(whole(a));
vector<int> x(m);
rep(i, m) x[i] = arr[a[i]-1];
vector<P> dp(n+1, P(-INF, -1));
dp[0] = P(0, -1);
rep(i, n+1) {
for (int j=0; j<x.size(); j++) {
int e = x[j];
if (i-e>=0 && dp[i-e].first>=0) {
if (dp[i].first<dp[i-e].first+1) {
dp[i].first = dp[i-e].first + 1;
dp[i].second = a[j];
}
}
}
}
int keta = dp[n].first;
int index = n;
map<int, int> mp;
while (index) {
mp[dp[index].second]++;
index -= arr[dp[index].second-1];
}
string ans;
for (auto m: mp) {
rep(i, m.second) {
ans += m.first+'0';
}
}
reverse(whole(ans));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<typename T> using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class S, class T> void map_init(map<S, T> &m, S k, T v){if(!m.count(k)) m[k] = v;}
void R_YESNO(bool p) { cout << (p ? "YES" : "NO") << endl; }
void R_YesNo(bool p) { cout << (p ? "Yes" : "No") << endl; }
const i64 MOD = 1e9 + 7;
struct int_m {
static int64_t mod;
int64_t v;
int_m() {}
int_m(int64_t x) : v(x) {}
int_m operator+(const int_m &y) { return (v + y.v) % mod; }
int_m operator-(const int_m &y) { return (v - y.v + mod) % mod; }
int_m operator*(const int_m &y) { return (v * y.v) % mod; }
void operator+=(const int_m &y) { *this = *this + y; }
void operator-=(const int_m &y) { *this = *this - y; }
void operator*=(const int_m &y) { *this = *this * y; }
friend istream &operator>>(istream &ist, int_m &m) { return ist >> m.v; }
friend ostream &operator<<(ostream &ost, int_m &m) { return ost << m.v; }
};
int64_t int_m::mod = MOD;
int main() {
int n, m;
cin >> n >> m;
vector<i64> x(n), y(m);
for(auto &a : x) cin >> a;
for(auto &a : y) cin >> a;
sort(WHOLE(x)), sort(WHOLE(y));
int_m ans = 1;
for(int b = 0; b < 2; b++) {
int_m S = 0;
int_m acc = 0;
for(int i = n - 1; i > 0; i--) {
acc += x[i];
S += acc - int_m((n - i) * x[i - 1]);
}
ans *= S;
swap(x, y);
swap(n, m);
}
cout << ans << endl;
return 0;
}
| 0
| 69,460,792
|
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
long long int gcd(long long int bdda,long long int chota)
{
if(chota==0)
return bdda;
return gcd(chota,bdda%chota);
}
void solve()
{
int n;
cin>>n;
int h[n],ans=0,val=0;
for(int i=0;i<n;i++)cin>>h[i];
for(int i=0;i<n-1;i++)
{
if(h[i]>=h[i+1])
{
val++;
}
else
{
ans=max(ans,val);
val=0;
}
}
ans=max(ans,val);
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define countof(a) (sizeof(a)/sizeof((a)[0]))
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i < (n); i++)
#define all(a) begin(a),end(a)
signed main()
{
cin.tie(0); ios::sync_with_stdio(false);
int N,A,B; cin >> N >> A >> B;
int counter[3] = {0, 0, 0};
int P;
rep(i, N) {
cin >> P;
if (P <= A) counter[0]++;
else if (P <= B) counter[1]++;
else counter[2]++;
}
cout << min(counter[0], min(counter[1], counter[2])) << endl;
}
| 0
| 97,116,013
|
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
using namespace std;
string s, t;
set<string> S;
void Work()
{
int lens = s.size();
int lent = t.size();
for(int i = 0; i < lens; i++)
{
if(s[i] == '?' || s[i] == t[0])
{
string tmp = s;
for(int j = 0; j < i; j++)
if(tmp[j] == '?')
tmp[j] ='a';
bool can = false;
for(int j = 0; j < lent; j++)
{
if(tmp[i+j]!= '?' && tmp[i+j] != t[j])
break;
tmp[i+j] = t[j];
if(j == lent - 1) can = true;
}
if(can)
{
for(int j = i + lent; j < lens; j++) if(tmp[j] == '?') tmp[j] = 'a';
S.insert(tmp);
}
}
}
if(S.size() == 0) cout << "UNRESTORABLE" << endl;
else cout << *S.begin() << endl;
}
int main()
{
cin >> s >> t;
Work();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define LOG(...) fprintf (stderr, __VA_ARGS__)
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
const int INF = 0x3f3f3f3f, N = 1005, M = 45;
const LL INFL = 0x3f3f3f3f3f3f3f3fll;
int n, x[N], y[N];
char s[N][M];
int main() {
scanf("%d", &n);
int cc = 0;
for (int i = 1; i <= n; i++)
scanf ("%d%d", &x[i], &y[i]), cc += (abs(x[i]) + abs(y[i])) % 2;
if (cc != 0 && cc != n) return puts("-1"), 0;
int m = 31 + (cc == 0); cout << m << endl;
for (int i = 0; i <= 30; i++) cout << (1 << i) << " ";
if (m == 32) cout << "1";
cout << endl;
for (int i = 1; i <= n; i++) {
if (cc == 0) s[i][31] = 'R', x[i]--;
for (int d = 30; d >= 0; d--) {
if (abs(x[i]) > abs(y[i])) {
if (x[i] < 0) s[i][d] = 'L', x[i] += (1 << d);
else s[i][d] = 'R', x[i] -= (1 << d);
} else {
if (y[i] < 0) s[i][d] = 'D', y[i] += (1 << d);
else s[i][d] = 'U', y[i] -= (1 << d);
}
}
puts(s[i]);
}
return 0;
}
| 0
| 22,827,584
|
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
const long long mod = 1e9+7;
int main() {
int h1, m1, h2, m2, k; cin >> h1 >> m1 >> h2 >> m2 >> k;
int s = h1 * 60 + m1;
int e = h2 * 60 + m2;
cout << max(e - s - k, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string s,t;cin>>s>>t;
vector<int> cha1(26, -1), cha2(26,-1);
bool ans = true;
for(int i=0; i<s.size(); i++){
int S = s[i] - 'a', T = t[i] - 'a';
if(cha1[S]==T&&cha2[T]==S)continue;
else if(cha1[S]==-1&&cha2[T]==-1){
cha1[S]=T, cha2[T]=S;
}else{
ans = false;
break;
}
}
cout<<(ans?"Yes":"No");
return 0;
}
| 0
| 47,381,605
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, pimp, comp;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
pimp = a.size();
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
comp = a.size();
if (pimp == comp) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}
int main(){
while(1){
int n,a,b,c,x;
cin>>n>>a>>b>>c>>x;
if(n==0&&a==0&&b==0&&c==0&&x==0) break;
int ans=0;
int j,i;
for(i=0;i<n;i++){
int rand;
cin>>rand;
for(j=0;j<10001;j++){
if(x==rand){
rand=-1;
break;
}
x=(a*x+b)%c;
ans++;
if(ans>10000){
ans=-1;
break;
}
}
if(ans==-1){
ans=-1; break;
}
if(rand!=-1){
ans=-1; break;
}
x=(a*x+b)%c;
ans++;
}
if(i==n-1) 1;
else lp(k,n-1-i){
int rand;
cin>>rand;
}
if(ans==-1) cout<<"-1"<<endl;
else cout<<ans-1<<endl;
}
return 0;
}
| 0
| 18,875,444
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b,c;
cin >> a >> b >> c;
int x,y;
x = min(min(a,b),c);
y = max(max(a,b),c);
cout << y-x << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
using vpint=vector<pint>;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
template<class A,class B>
ostream& operator<<(ostream& ost,const pair<A,B>&p){
ost<<"{"<<p.first<<","<<p.second<<"}";
return ost;
}
template<class T>
ostream& operator<<(ostream& ost,const vector<T>&v){
ost<<"{";
for(int i=0;i<v.size();i++){
if(i)ost<<",";
ost<<v[i];
}
ost<<"}";
return ost;
}
int msb(int x){
return 63-__builtin_clzll(x);
}
int N;
int A[111111];
signed main(){
cin>>N;
rep(i,N)cin>>A[i];
int base=0;
rep(i,N)base^=A[i];
rep(i,60){
if(!(base>>i&1))continue;
rep(j,N)if(A[j]>>i&1)A[j]^=1ll<<i;
}
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(A[i]<A[j])swap(A[i],A[j]);
}
if(A[i]==0)break;
for(int j=0;j<N;j++){
if(i==j)continue;
if(A[j]>>msb(A[i])&1)A[j]^=A[i];
}
}
int X=0;
rep(i,N)X^=A[i];
int Y=base^X;
cout<<base+(X&Y)*2<<endl;
return 0;
}
| 0
| 60,869,259
|
#include<bits/stdc++.h>;
using namespace std;
int main(){
int a[5];
for( int s = 0; s < 5; s++){
cin >> a[s];
}
sort( a, a + 5, greater<int>());
for(int i = 0; i < 5; i++){
if( i < 4 ){
cout << a[i] << " ";
}else{
cout << a[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=a;i<b;i++)
#define fore(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define INF ll(1e18)
#define MOD 998244353
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define MAXN 1000000007
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
ll n;
cin>>n;
ll arr[n+1];
ll brr[n];
for (ll i=0;i<n+1;i++) {
cin>>arr[i];
}
for (ll i=0;i<n;i++) {
cin>>brr[i];
}
ll counter=0;
for (ll i=0;i<n;i++) {
counter+=min(brr[i],(arr[i]+arr[i+1]));
if (min(brr[i],(arr[i]+arr[i+1]))==brr[i]) {
if (arr[i]<brr[i]) {
arr[i+1]-=(brr[i]-arr[i]);
}
}
else {
arr[i+1]=0;
}
}
cout<<counter;
}
| 0
| 14,590,393
|
#include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000
#define MOD 10000007
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define Vec(K, L, N, S) vector<L> K(N, S)
#define rt sqrt
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vs = vector<string>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
uli a, b, c, h, k, n, w, ans = 0, count = 0;
string s, t;
cin >> n >> k;
ans = k * pow(k - 1, n - 1);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
signed main(){
string s, t, u;
int a, b;
cin >> s >> t;
cin >> a >> b;
cin >> u;
if(s == u){
cout << a - 1 << " " << b << endl;
}else if(t == u){
cout << a << " " << b -1 << endl;
}else{
cout << a << " " << b << endl;
}
}
| 0
| 50,642,578
|
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
const int inf=1e8;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int dx[]={0,0,-1,1};
int dy[]={-1,1,0,0};
int n,m,a;
int solve(){
vector<int>x(a+1);
vector<int>y(a+1);
vector<vector<char> >in(n+2,vector<char>(m+2));
rep(i,n+2)rep(j,m+2){
if(!i||!j||i==n+1||j==m+1)in[i][j]='X';
else cin>>in[i][j];
if(in[i][j]=='S')in[i][j]='0';
if(isdigit(in[i][j])){
int d=in[i][j]-'0';
x[d]=i;y[d]=j;
}
}
int out=0;
rep(i,a){
vector<vector<int> >tmp(n+2,vector<int>(m+2));
vector<int>nx;
vector<int>ny;
rep(j,n+2)rep(k,m+2)tmp[j][k]=inf;
tmp[x[i]][y[i]]=0;
nx.pb(x[i]);
ny.pb(y[i]);
while(nx.size()){
if(nx[0]==x[i+1]&&ny[0]==y[i+1]){out+=tmp[nx[0]][ny[0]];break;}
rep(j,4){
if(in[nx[0]+dx[j]][ny[0]+dy[j]]!='X'&&tmp[nx[0]+dx[j]][ny[0]+dy[j]]>tmp[nx[0]][ny[0]]+1){
tmp[nx[0]+dx[j]][ny[0]+dy[j]]=tmp[nx[0]][ny[0]]+1;
nx.pb(nx[0]+dx[j]);
ny.pb(ny[0]+dy[j]);
}
}
nx.erase(nx.begin());
ny.erase(ny.begin());
}
}
return out;
}
int main(){
cin>>n>>m>>a;
cout<<solve()<<endl;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int n,a[10000],min,max,sum;
long long int sum_ll;
min=1000000;
max=(-1000000);
sum_ll=0;
scanf("%d",&n);
for (int i=0;i<=n-1;i++){
scanf("%d",&a[i]);
if (min>a[i]){
min=a[i];
}
if (max<a[i]){
max=a[i];
}
sum_ll+=a[i];
}
printf("%d %d %lld\n",min,max,sum_ll);
return 0;
}
| 0
| 38,784,536
|
#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);
int main(){
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
REP2(i,1,n){
a[i] = __gcd(a[i],a[i-1]);
}
cout << a[n-1] << endl;
return 0;
}
|
#include<iostream>
#include<map>
using namespace std;
int main(){
long H,W,N;
cin >> H >> W >> N;
long ans[10];
for(int i=0; i<10; i++) ans[i] = 0;
ans[0] = (H-2)*(W-2);
map<pair<int,int>,int> m;
for(int t=0; t<N; t++){
long a, b;
cin >> a >> b;
for(int i = -1; i < 2; i++){
for(int j=-1; j<2; j++){
if (a+i < 2 || b+j < 2 || a+i > H-1 || b+j > W-1) continue;
pair<int,int> s = make_pair(a+i,b+j);
m[s] = m[s] + 1;
ans[m[s]] += 1;
ans[m[s]-1] -= 1;
}
}
}
for(int i=0; i<10; i++){
cout << ans[i] << endl;
}
}
| 0
| 86,048,646
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
string s;
cin >> s;
int check[3];
for(int i = 0; i < 3; i++) check[i] = 0;
for(auto c : s){
if(c == 'a') check[0] = 1;
if(c == 'b') check[1] = 1;
if(c == 'c') check[2] = 1;
}
bool flag = true;
for(int i = 0; i < 3; i++){
if(check[i] == 0) flag = false;
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
bool check(int x) {
string S = to_string(x);
auto first = S.begin();
auto last = S.end();
--last;
while (first < last) {
if(*first != *last) {
return false;
}
++first;
--last;
}
return true;
}
int main() {
int A, B;
cin >> A >> B;
int num = 0;
for (int x=A; x<=B; ++x) {
if (check(x)) {
++num;
}
}
cout << num << endl;
}
| 0
| 87,139,863
|
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(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)=(n)-1; (i)>=(m); i--)
#define debug(x) cerr << #x << " = " << x << endl
typedef long long ll;
ll const MOD = 1e9+7;
int const inf = 1e9;
ll const INF = 1e18;
inline void ios_(){cin.tie(0); ios::sync_with_stdio(false);}
template<typename T> int size(const T& a){return (int)a.size();}
template<typename T> T Div(T a, T b){return (a + b - 1) / b;}
template<typename T> bool chmin(T& a, const T& b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, const T& b){if(a < b){a = b; return true;} return false;}
ll BinarySearch(ll ng, ll ok, const function<bool(ll)>& judge){
while(abs(ok - ng) > 1){
ll mid = (ok + ng) / 2;
if(judge(mid)) ok = mid;
else ng = mid;
}
return ok;
}
signed main(){
ll k;
cin >> k;
vector<ll> v(k);
for(auto&& i : v) cin >> i;
ll rem = 2;
auto fn = [&](ll x){
REP(i, k){
x -= x % v[i];
if(x < rem){
return false;
}
}
return true;
};
ll mi = BinarySearch(0, 1e18, fn);
rem = 3;
ll ma = BinarySearch(0, 1e18, fn) - 1;
if(mi > ma){
cout << -1 << endl;
}else{
cout << mi << " " << ma << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M,cnt=0;
cin >> N >> M;
vector<bool> c(N,true);
int tmpl = 1;
int tmpr = N;
for(int i=0; i<M; i++){
int l,r;
cin >> l >> r;
if(l > tmpl){
for(int j=tmpl-1; j<l-1; j++){
c.at(j) = false;
}
tmpl = l;
}
if(r < tmpr){
for(int j=r; j<tmpr; j++){
c.at(j) = false;
}
tmpr = r;
}
}
for(int i=0; i<N; i++){
if(c.at(i) == true)
cnt++;
}
cout << cnt << endl;
return 0;
}
| 0
| 93,629,118
|
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#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 srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 100005;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int q;
cin >> q;
rep(i,q){
ll a,b;
cin >> a >> b;
if(a == 1 && b == 1){
cout << "0\n";
continue;
}
ll mul = a * b;
ll sub = 0;
ll l = 1, r = ceil(sqrt(mul));
while(r-l>1){
ll mid = (l+r)/2;
if(mid*mid <= mul-1){
l = mid;
}else{
r = mid;
}
}
if(a <= l || b <= l){
sub++;
}
if(l == (mul-1)/l){
sub++;
}
cout << 2*l-sub << "\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k,n;
cin>>k>>n;
int mario[n];
long sum=0;
for(int i=0;i<n;i++){
cin>>mario[i];
sum+=mario[i];
}
if(k-sum<0)
puts("-1");
else
cout<<k-sum;
}
| 0
| 84,372,206
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(){
ll mod = pow(10,9) + 7;
int n = 0;
cin >> n;
string str;
cin >> str;
ll res = 0;
res = 1;
for(int i = 0;i <= 25;i++){
ll count = 0;
for(int j = 0;j <= n - 1;j++){
if(str[j] == 'a' + i)count++;
}
res = (res * (count + 1)) % mod;
}
res--;
if(res < 0)res += mod;
cout << res << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <bitset>
#include<iomanip>
#include <map>
#include<set>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define INF 2000000000
#define INF2 1000000000000000000
#define PI 3.1415926535
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int, int> P;
const ll MOD = 1000000007;
using Graph = vector<vector<int>>;
#define MAX_N 50005
#define MAX_K 100005
double max(double a, double b) {
if (a > b) return a;
return b;
}
int main() {
int k, s;
cin >> k >> s;
int ans = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if (z >= 0 && z <= k) ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 98,929,421
|
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
while (true) {
int t; cin >> t;
if (t == 0) break;
int x = 1000 - t;
int cnt = 0;
while (x > 0) {
if (x / 500 > 0) {
cnt += x / 500;
x %= 500;
} else if (x / 100 > 0) {
cnt += x / 100;
x %= 100;
} else if (x / 50 > 0) {
cnt += x / 50;
x %= 50;
} else if (x / 10 > 0) {
cnt += x / 10;
x %= 10;
} else if (x / 5 > 0) {
cnt += x / 5;
x %= 5;
} else if (x / 1 > 0) {
cnt += x / 1;
x %= 1;
}
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
ll myctoi(char C) {return C - '0';}
char myitoc(ll N) {return '0' + N;}
#define FINALANS(A) {cout << (A) << '\n'; exit(0);}
int main()
{
ll N;
cin >> N;
vector<pair<ll, ll>> Pi(N);
for (ll i = 0; i < N; i++)
{
cin >> Pi.at(i).first;
Pi.at(i).second = i + 1;
}
sort(Pi.begin(), Pi.end(), greater<pair<ll, ll>>());
ll ans = 0;
multiset<ll> st = {0, 0, N + 1, N + 1};
for (ll i = 0; i < N; i++)
{
ll p = Pi.at(i).first;
ll c = Pi.at(i).second;
st.emplace(c);
auto it = st.lower_bound(c);
it--;
ll l1 = *it;
it--;
ll l0 = *it;
it++, it++;
it++;
ll r0 = *it;
it++;
ll r1 = *it;
ll tmp = p * ((l1 - l0) * (r0 - c) + (c - l1) * (r1 - r0));
ans += tmp;
}
cout << ans << endl;
}
| 0
| 59,894,773
|
#include<stdio.h>
int dat[100];
int main(){
int a,b,c,d,e;
while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&e),a){
for(int i=0;i<a;i++)scanf("%d",dat+i);
int now=0;
int frame=-1;
int x=e;
while(frame<=10001&&now<a){
frame++;
if(dat[now]==x){
now++;
x=(x*b+c)%d;
}else{
x=(x*b+c)%d;
}
}
if(frame>10000)printf("-1\n");
else printf("%d\n",frame);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main( )
{
char a, b;
cin >> a >> b;
if (a == 'H') {
cout << b << '\n';
}
else {
if (b == 'H') {
cout << "D\n";
}
else {
cout << "H\n";
}
}
return 0;
}
| 0
| 99,827,604
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
const vector<int> che={6,9};
int main(){
int n; cin>>n;
int ans=0;
vector<int> p(n+5,-1);
p[0]=0;
rep(i,n){
vector<int> cnt;
rep(j,2){
int a=che[j];
rep(k,8){
if((i+1)<pow(a,(k+1))) break;
if(p[i+1-pow(a,k+1)]!=-1) cnt.push_back(p[i+1-pow(a,k+1)]+1);
}
}
if(p[i]!=-1) cnt.push_back(p[i]+1);
if(!cnt.empty()){
sort(btoe(cnt));
p[i+1]=cnt[0];
}
}
cout<<p[n]<<endl;
}
|
#include<iostream>
#include <map>
#include<algorithm>
#include <string>
#include<vector>
#include <set>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, x, m;
cin >> n >> x >> m;
vector<int>r;
map<int, int>ar;
int cur = 0;
for (int i = 0; i < min(n, 200000ll); i++) {
r.push_back(x);
if (ar.find(x) != ar.end()) {
int j = ar[x];
int d = i - ar[x];
int vv = 0;
for (int q = j; q < i; q++) {
vv += r[q];
}
cur += vv * ((n - i) / d);
for (int q = j; q < j + (n - i) % d; q++) {
cur += r[q];
}
cout << cur;
return 0;
}
cur += x;
ar[x] = i;
x = (x * x) % m;
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += r[i];
}
cout << ans;
return 0;
}
| 0
| 83,086,385
|
#include <iostream>
using namespace std;
int n, s, cnt;
void dfs(int depth, int num, int sum) {
if (depth == 0 && sum == s) {
cnt++;
return;
}
if (num == 10 || depth == 0) return;
dfs(depth, num + 1, sum);
dfs(depth - 1, num + 1, sum + num);
}
int main() {
while (cin >> n >> s, n | s) {
cnt = 0;
dfs(n, 0, 0);
cout << cnt << endl;
}
}
|
#include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define all(c) (c).begin(), (c).end()
using namespace std;
int main() {
int N,M,P;
double X[120];
long long sum,ans;
double zyun_money_per;
while(cin >> N >> M >> P) {
if (N==0 && M==0 && P==0) { break; }
sum=0;
REP(i,1,N+1) {
cin >> X[i];
sum+=X[i];
}
if (X[M] == 0) {
cout << "0" << endl;
}
else {
zyun_money_per = (100-P)*0.01;
ans = (sum/X[M])* 100 * zyun_money_per;
cout << ans << endl;
}
}
return 0;
}
| 0
| 34,854,499
|
#include <stdio.h>
int main(){
int H1, M1, H2, M2, K;
scanf("%d %d %d %d %d",&H1, &M1, &H2, &M2, &K);
int hours = H2 - H1;
int minutes = M2 - M1;
int sum = (hours * 60) + minutes;
int total = sum - K;
printf("%d\n", total);
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1e15;
const int MOD = 1e9 + 7;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
int h, w, n;
vector<int> a, b;
map<P, int> mp;
int ans[10];
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w >> n;
a.resize(n);
b.resize(n);
REP(i, n) cin >> a[i] >> b[i];
REP(i, n) a[i]--, b[i]--;
REP(i, n){
if(a[i] < h-2 && b[i] < w-2) mp[P(a[i], b[i])]++;
if(a[i]-2 < h-2 && b[i] < w-2 && a[i] - 2 >= 0) mp[P(a[i] - 2, b[i])]++;
if(a[i]-1 < h-2 && b[i] < w-2 && a[i] - 1 >= 0) mp[P(a[i] - 1, b[i])]++;
if(a[i] < h-2 && b[i]-2 < w-2 && b[i] - 2 >= 0) mp[P(a[i], b[i] - 2)]++;
if(a[i] < h-2 && b[i]-1 < w-2 && b[i] - 1 >= 0) mp[P(a[i], b[i] - 1)]++;
if(a[i]-2 < h-2 && b[i]-2 < w-2 && a[i] - 2 >= 0 && b[i] - 2 >= 0) mp[P(a[i] - 2, b[i] - 2)]++;
if(a[i]-2 < h-2 && b[i]-1 < w-2 && a[i] - 2 >= 0 && b[i] - 1 >= 0) mp[P(a[i] - 2, b[i] - 1)]++;
if(a[i]-1 < h-2 && b[i]-2 < w-2 && a[i] - 1 >= 0 && b[i] - 2 >= 0) mp[P(a[i] - 1, b[i] - 2)]++;
if(a[i]-1 < h-2 && b[i]-1 < w-2 && a[i] - 1 >= 0 && b[i] - 1 >= 0) mp[P(a[i] - 1, b[i] - 1)]++;
}
ans[0] = (h-2) * (w-2);
for(auto x: mp){
ans[x.second]++;
}
FOR(i, 1, 10) ans[0] -= ans[i];
REP(i, 10) cout << ans[i] << endl;
}
| 0
| 95,731,153
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
#include <atcoder/all>
using namespace atcoder;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...)
#endif
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __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; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;
int main (void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, q; cin >> n >> q;
dsu uf(n);
rep (_, q) {
int c, u, v; cin >> c >> u >> v;
if (c == 0) uf.merge(u, v);
else cout << uf.same(u, v) << "\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
int n,m;
cin>>n>>m;
vector<double> arr;
double total=0;
for(int i=0;i<n;i++) {
double num;
cin>>num;
total+=num;
arr.push_back(num);
}
sort(arr.begin(), arr.end(), greater<int>());
int count=0;
double limit=(1/(4*double(m)));
for(int i=0;i<m;i++) {
double percentage=(arr[i]/double(total));
if(percentage>=limit) {
count++;
}
}
if(count==m) {
cout<<"Yes"<<endl;
}
else {
cout<<"No"<<endl;
}
}
| 0
| 45,653,054
|
#include<iostream>
#include<stack>
#include<cstdlib>
#include<string>
#include <utility>
#include<queue>
#include<algorithm>
#include<list>
using namespace std;
void print_list(const list<int>& dlist){
const list<int>::const_iterator itEnd = dlist.end();
for(list<int>::const_iterator it =dlist.begin();it !=itEnd;++it){
if(it!=dlist.begin())cout <<" ";
cout << *it;
}
cout << endl;
}
int main(){
int n = 0;
cin >> n;
string command;
int num;
list<int> dlist;
list<int>::iterator it;
list<int>::iterator l;
for(int i=0;i<n;i++){
cin >> command ;
if(command=="insert"){
cin >> num;
dlist.push_front(num);
}
else if(command =="delete"){
cin >> num;
for(it=dlist.begin(),l=dlist.end();it!=l;++it){
if(*it == num){
dlist.erase(it);
break;
}
}
}
else if(command =="deleteFirst"){
dlist.pop_front();
}
else{
dlist.pop_back();
}
}
print_list(dlist);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> piipi;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
char s[100005];
int dp[100005];
int main(){
int n;
scanf("%d", &n);
scanf("%s", s);
for(int j=0;j<2;j++){
for(int k=0;k<2;k++){
memset(dp, -1, sizeof(dp));
dp[n-1] = j;
dp[0] = k;
bool ok = 1;
for(int i=0;i<n;i++){
if(dp[i] == 0){
if(s[i] == 'o'){
if(dp[(i+1)%n] == -1) dp[(i+1)%n] = dp[(i-1+n)%n];
else if(dp[(i+1)%n] != dp[(i-1+n)%n]) ok = 0;
}
else{
if(dp[(i+1)%n] == -1) dp[(i+1)%n] = 1-dp[(i-1+n)%n];
else if(dp[(i+1)%n] != 1-dp[(i-1+n)%n]) ok = 0;
}
}
else{
if(s[i] == 'x'){
if(dp[(i+1)%n] == -1) dp[(i+1)%n] = dp[(i-1+n)%n];
else if(dp[(i+1)%n] != dp[(i-1+n)%n]) ok = 0;
}
else{
if(dp[(i+1)%n] == -1) dp[(i+1)%n] = 1-dp[(i-1+n)%n];
else if(dp[(i+1)%n] != 1-dp[(i-1+n)%n]) ok = 0;
}
}
}
if(ok){
for(int i=0;i<n;i++){
if(dp[i] == 0 ) printf("S");
else printf("W");
}
return 0;
}
}
}
printf("-1\n");
}
| 0
| 63,107,092
|
#include<iostream>
using namespace std;
int main(){
long long H,W;
cin >> H >> W;
bool iswrite=false;
int ncases=6;
long long S[ncases];
long long Vline, Hline;
long long Smax, Smin, Smid;
long long Stmp, ans;
if( W%3==0 ){
cout << 0 << endl;
return 0;
}else if( W%3!=0 ){
S[0]=H;
if(W<3){
S[0]=W*H;
}
}
if(iswrite) cout << "case 1 vertical S= " << S[0] << endl;
if( H%3==0 ){
cout << 0 << endl;
return 0;
}else if( H%3!=0 ){
S[1]=W;
if(H<3){
S[1]=W*H;
}
}
if(iswrite) cout << "case 2 horizontal S= " << S[1] << endl;
Vline = (long long) W/3 + 1;
Smax = H*Vline;
Hline = (long long) H/2;
Smin = (W-Vline)*Hline;
S[2]= Smax-Smin;
if(iswrite) cout << "case 3 V(large)-H, S= " << S[2] << endl;
Vline = (long long) W/3;
Smax = H*Vline;
Hline = (long long) H/2;
Smin = (W-Vline)*Hline;
Smid = (W-Vline)*(H-Hline);
Stmp = Smax;
Smax = max(Smax,Smid);
Smin = min(Stmp,Smin);
S[3]= Smax-Smin;
if(iswrite) cout << "case 4 V(small)-H, S= " << S[3] << endl;
Hline = (long long) H/3 + 1;
Smax = W*Hline;
Vline = (long long) W/2;
Smin = (H-Hline)*Vline;
S[4]= Smax-Smin;
if(iswrite) cout << "case 5 H(large)-V, S= " << S[4] << endl;
Hline = (long long) H/3;
Smax = W*Hline;
Vline = (long long) W/2;
Smin = (H-Hline)*Vline;
Smid = (H-Hline)*(W-Vline);
Stmp = Smax;
Smax = max(Smax,Smid);
Smin = min(Stmp,Smin);
S[5]= Smax-Smin;
if(iswrite) cout << "case 5 H(small)-V, S= " << S[5] << endl;
for(int i=0; i<ncases; i++){
if(i==0){
ans = S[i];
}else if( ans > S[i] ){
ans = S[i];
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int n;
ll k;
cin >> n >> k;
ll sum=0;
vector<ll>cnt(100000);
rep(i, 0, n){
int a, b;
cin >> a >> b;
a--;
cnt[a] += b;
}
rep(i, 0, 100000){
sum += cnt[i];
if(sum >= k){
cout << i+1 << endl;
return 0;
}
}
}
| 0
| 21,792,737
|
#pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#include <x86intrin.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define in insert
#define er erase
#define con continue
#define pb push_back
#define sc scanf
#define pr printf
#define ub upper_bound
#define lb lower_bound
#define s second
#define f first
#define int long long
const long long infl = 1e18;
const int N = 3e5 + 300, N2 = 2e3, inf = 1e9 + 200, mod = 1e9 + 7;
set <int> S;
vector <int> g;
int n, m, k;
int a[N], ans[N], us[N];
string ss;
int bin_pow(int x, int y){
int res = 1;
while (y){
if (y & 1) (res *= x) %= mod;
(x *= x) %= mod;
y >>= 1;
}
return res;
}
int f(int x){
return bin_pow((k / x), n);
}
int rec(int x){
if (us[x]) return ans[x];
us[x] = 1;
ans[x] = f(x);
for (int i = 2; i * x <= k; i++){
ans[x] -= rec(i * x);
ans[x] = (ans[x] + mod) % mod;
}
return ans[x];
}
main (){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k;
int res = 0;
for (int i = 1; i <= k; i++){
(res += (rec(i) * i) % mod) %= mod;
}
cout << res;
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>;
ll N, M, A, B;
void search(int start, vector<vector<ll>> &path, vector<ll> &dis, vector<ll> &prev) {
priority_queue<P, vector<P>, greater<P>> pq;
dis.at(start) = 0;
pq.emplace(dis.at(start), start);
while (!pq.empty()) {
P p = pq.top();
pq.pop();
int room = p.second;
if (dis.at(room) < p.first) continue;
for (auto &x : path.at(room)) {
if (dis.at(x) > dis.at(room) + 1) {
dis.at(x) = dis.at(room) + 1;
prev.at(x) = room;
pq.emplace(dis.at(x), x);
}
}
}
}
int main() {
cin >> N >> M;
vector<vector<ll>> path(N+1);
vector<ll> dis(N+1, INFINITY), prev(N+1, -1);
rep(i,M) {
cin >> A >> B;
path.at(A).push_back(B);
path.at(B).push_back(A);
}
for (int i = 1; i <= N; ++i) {
if (path.at(i).empty()) {
cout << "No" << endl;
return 0;
}
}
search(1, path, dis, prev);
cout << "Yes" << endl;
for (int i = 2; i <= N; ++i) cout << prev.at(i) << endl;
}
| 0
| 28,767,692
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
string S; cin >> S;
string T;
rep(i, S.length()) {
if(S[i] != 'B') T += S[i];
else if(!T.empty()) T.pop_back();
}
cout << T << 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 INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<string> S(N);
rep(i,N) cin >> S[i];
int headB = 0;
int tailA = 0;
int AB = 0;
int other = 0;
rep(i,N){
if(S[i][0]=='B'&&S[i][S[i].size()-1]=='A') AB++;
else if(S[i][0]=='B')headB++;
else if(S[i][S[i].size()-1]=='A') tailA++;
else other++;
}
int ans = 0;
rep(i,N){
rep(c,S[i].size()-1){
if(S[i][c]=='A'&&S[i][c+1]=='B') ans++;
}
}
if(AB==0){
ans+=min(headB,tailA);
}else{
if(headB==0&&tailA==0) ans+=AB-1;
else ans += AB+min(headB,tailA);
}
cout << ans << endl;
return 0;
}
| 0
| 7,026,495
|
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A <= C && C <= B) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,M,A;
cin>>N>>M;
vector<int> D(N+100,-1000000),Z(0,0);
D[0]=0;
int set[10]={0,2,5,5,4,5,6,3,7,6};
unordered_map<int,int> MtoP;
for(int i=0; i<M; i++){
int A;
cin>>A;
MtoP[set[A]]=max(MtoP[set[A]],A);
Z.push_back(set[A]);
}
sort(Z.begin(), Z.end());
Z.erase(unique(Z.begin(), Z.end()), Z.end());
int x=Z.size();
for(int i=0; i<x; i++)
D[Z[i]]=1;
for(int i=0; i<=N; i++){
for(int j=0; j<x; j++){
if(i-Z[j]<0)
continue;
D[i]=max(D[i],D[i-Z[j]]+1);
}
}
vector<vector<int>> Y(x,vector<int>(2,0));
for(int i=0; i<x; i++){
Y[i][0]=Z[i];
Y[i][1]=MtoP[Z[i]];
}
sort(Y.begin(), Y.end(), [](auto& h, auto&k){return h[1] > k[1];});
while(N>0){
for(int j=0; j<x; j++){
if(N-Y[j][0]<0)
continue;
if(D[N]==D[N-Y[j][0]]+1){
N-=Y[j][0];
cout<<Y[j][1];
break;
}
}
}
cout<<endl;
}
| 0
| 16,060,624
|
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
int x=0,y=0,a=0;
for (a=1;;a++){
cin >> x;
cin >> y;
if ((x == 0)&&(y==0))break;
if (x<=y){
cout << x << " " << y << endl;
}
else{
cout << y << " " << x << endl;
}
}
}
|
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
#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 SQ(a) ((a)*(a))
#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,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
class UnionFind {
public:
vector <int> par;
vector <int> siz;
UnionFind(int sz_): par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(int sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) {
return root(x) == root(y);
}
int size(int x) {
return siz[root(x)];
}
};
ll modPow(ll x, ll n, ll mod = MOD){
ll res = 1;
while(n){
if(n&1) res = (res * x)%mod;
res %= mod;
x = x * x %mod;
n >>= 1;
}
return res;
}
#define SIEVE_SIZE 5000000+10
bool sieve[SIEVE_SIZE];
void makeSieve(){
for(int i=0; i<SIEVE_SIZE; ++i) sieve[i] = true;
sieve[0] = sieve[1] = false;
for(int i=2; i*i<SIEVE_SIZE; ++i) if(sieve[i]) for(int j=2; i*j<SIEVE_SIZE; ++j) sieve[i*j] = false;
}
bool isprime(ll n){
if(n == 0 || n == 1) return false;
for(ll i=2; i*i<=n; ++i) if(n%i==0) return false;
return true;
}
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a%b, y, x);
y -= a/b * x;
return d;
}
inline long long mod(long long a, long long m) {
return (a % m + m) % m;
}
long long modinv(long long a, long long m) {
long long x, y;
extGCD(a, m, x, y);
return mod(x, m);
}
ll GCD(ll a, ll b){
if(b == 0) return a;
return GCD(b, a%b);
}
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A, mat &B) {
mat C(A.size(), vec((int)B[0].size()));
for(int i=0; i<A.size(); ++i){
for(int k=0; k<B.size(); ++k){
for(int j=0; j<B[0].size(); ++j){
C[i][j] = (C[i][j] + A[i][k] * B[k][j] %MOD) % MOD;
}
}
}
return C;
}
mat matPow(mat A, ll n) {
mat B(A.size(), vec((int)A.size()));
for(int i=0; i<A.size(); ++i){
B[i][i] = 1;
}
while(n > 0) {
if(n & 1) B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int N; cin >> N;
vector<pair<ll,ll>> vp;
REP(i,N){
ll A, B; cin >> A >> B;
vp.push_back(make_pair(B+A, A));
}
sort(all(vp));
reverse(all(vp));
ll ans = 0;
for(int i=0; i<N; i++){
if(i%2 == 0){
ans += vp[i].second;
}else{
ans -= vp[i].first - vp[i].second;
}
}
cout << ans << endl;
return 0;
}
| 0
| 60,080,206
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int grid_n;
int paint_a;
cin >> grid_n >> paint_a;
cout << pow(grid_n, 2) - paint_a << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<lint>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
int n, k;
cin >> n >> k;
vec a(n);
rep(i, n) cin >> a[i];
vec s(n+1);
rep(i, n) s[i+1] = (s[i] + a[i]);
vec t(n+1);
rep(i, n+1) t[i] = (s[i] - i) % k;
rep(i, n+1) t[i] = ((t[i] % k) + k) % k;
lint res = 0;
map<int, int> mp;
queue<int> que;
rep(i, n+1) {
res += mp[t[i]];
mp[t[i]]++;
que.push(t[i]);
if (que.size() >= k) {
mp[que.front()]--;
que.pop();
}
}
cout << res << endl;
return 0;
}
| 0
| 42,911,908
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N,K;
vector<pair<ll, ll>>v;
int main(){
cin>>N>>K;
for(int i=0;i<N;i++){
ll x,y;
cin>>x>>y;
v.push_back(make_pair(x,y));
}
sort(v.begin(),v.end());
ll ans=4*1000000000000000000;
for(int i=0;i<v.size()-1;i++){
for(int j=i+1;j<v.size();j++){
int num=j-i+1;
if(num<K)continue;
vector<ll>y;
for(int k=i;k<=j;k++){
y.push_back(v[k].second);
}
sort(y.begin(),y.end());
ll ydis=10000000000;
for(int k=0;k<=y.size()-K;k++){
ydis=min(ydis,y[k+K-1]-y[k]);
}
ll xdis=v[j].first-v[i].first;
ans=min(ans,xdis*ydis);
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long n,q;cin>>n>>q;
vector<vector<long>> graph(n+1);
for(int i=1;i<n;i++){
long a,b;cin>>a>>b;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<long> score(n+1,0);
vector<long> scoredp(n+1,0);
for(long i=0;i<q;i++){
long p,x;cin>>p>>x;
scoredp[p]+=x;
}
stack<long> s;s.push(1);
vector<long> prev(n+1,0);
while(s.size()!=0){
long a=s.top();
s.pop();
score[a]+=scoredp[a];
prev[a]=1;
for(int i=0;i<graph[a].size();i++){
if(prev[graph[a][i]]==0){
score[graph[a][i]]+=score[a];
s.push(graph[a][i]);
}
}
}
for(long i=1;i<n;i++)cout<<score[i]<<" ";
cout<<score[n]<<endl;
}
| 0
| 70,189,240
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main(){
char C;
cin >> C;
cout << (char)(C + 1) << "\n";
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()
int ans[999999];
bool isprime(int n) {
if (n == 2) return true;
if (n % 2 == 0) return false;
for(int i = 3; i <= sqrt(n); i+=2) {
if (n % i == 0) return false;
}
return true;
}
int main() {
FOR(i, 1, 999999) {
ans[i] = ans[i-1] + isprime(i+1);
}
int i;
while(cin >> i) {
cout << ans[i-1] << endl;
}
return 0;
}
| 0
| 47,791,501
|
#include <iostream>
#include <bitset>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
int main() {
int N, K; cin >> N >> K;
int a[N];
for (int i = 0; i < N; i++) cin >> a[i];
ll ans = INF;
for (int bit = 0; bit < (1<<N); bit++) {
int t = bitset<15>(bit).count();
if (t < K) continue;
int highest = a[0];
ll cost = 0;
for (int i = 1; i < N; i++) {
if ((bit >> i) & 1 && a[i] <= highest) {
cost += ++highest - a[i];
} else {
highest = max(highest, a[i]);
}
}
ans = min(ans, cost);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <functional>
#include <cmath>
#include <numeric>
#include <iomanip>
#define REP(i,n) for(lint i{}, i##_len=(n); i<i##_len; ++i)
#define DREP(i, h, j, w) for(lint i{}; i < (lint)(h); ++i)for(lint j{}; j < (lint)(w); ++j)
#define DREP2(i, j, n) for(lint i{}; i < (lint)(n - 1); ++i)for(lint j{i + 1}; j < (lint)(n); ++j)
#define SZ(x) ((lint)(x).size())
using lint = long long; lint N, M, H, W;
using namespace std;
const long long INF{ 1LL << 60 };
const long double PI{ 3.1415926535897932 };
const long long NUM97{ 1000000007 };
template<class T> inline bool chmax(T& x, T y) { if (x < y) { x = y; return 1; } return 0; }
template<class T> inline bool chmin(T& x, T y) { if (x > y) { x = y; return 1; } return 0; }
std::vector<std::string> field;
std::vector<std::vector<bool>> seen(H, std::vector<bool>(W));
const std::vector<int> dx{ 1, 0, -1, 0 };
const std::vector<int> dy{ 0, 1, 0, -1 };
bool first_larger(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.first != b.first) return{ a.first > b.first };
else return { a.second > b.second };
}
bool second_smaller(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.second != b.second) return{ a.second < b.second };
else return { a.first < b.first };
}
bool second_larger(std::pair<lint, lint>& a, std::pair<lint, lint>& b) {
if (a.second != b.second) return{ a.second > b.second };
else return { a.first > b.first };
}
bool is_prime(lint N) {
if (N == 1) return false;
for (lint i = 2; i * i <= N; ++i) { if (N % i == 0) return false; }
return true;
}
lint toInt(char c) {
return (lint)(c - '0');
}
lint StoInt(std::string s) { lint num{};
for (int i = 0; i < s.size(); ++i) { if (i > 0) num *= 10; num += (lint)(s[i] - '0');}
return num;
}
lint get_digit(lint n) {
return log10(n) + 1;
}
lint factorial(lint n) { lint sum = 1;
for (int i = 1; i <= n; ++i) sum *= i;
return sum;
}
lint combination(lint a, lint b) {
lint ans{ 1 }, ta{ a }, tb{ b };
while (ta > a - b) ans *= ta; --ta;
while (tb > 0) ans /= tb; --tb;
return ans;
}
lint count_divisors(lint N) { lint count{};
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) { ++count; if (N / i != i) ++count; } }
return count;
}
lint count_prime_divisors(lint N) { lint count{};
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) { if (is_prime(i)) ++count;
if (N / i != i) { if (is_prime(N / i)) ++count; } } }
return count;
}
std::vector<lint> divisors(lint N) { std::vector<lint> divisor;
for (lint i = 1; i * i <= N; ++i) {
if (N % i == 0) { divisor.push_back(i);
if (N / i != i) divisor.push_back(N / i); }
} std::sort(divisor.begin(), divisor.end());
divisor.erase(std::unique(divisor.begin(), divisor.end()), divisor.end());
return divisor;
}
std::vector<lint> prime_divisors(lint N) { std::vector<lint> p_divisor;
for (lint i{ 1 }; i * i <= N; ++i) {
if (N % i == 0) { if (is_prime(i)) { p_divisor.push_back(i); }
if (N / i != i) { if (is_prime(N / i)) { p_divisor.push_back(N / i); } } }
} std::sort(p_divisor.begin(), p_divisor.end());
p_divisor.erase(std::unique(p_divisor.begin(), p_divisor.end()), p_divisor.end());
return p_divisor;
}
std::vector<std::pair<lint, lint>> prime_factorize(lint N) {
vector<pair<lint, lint>> factorize;
for (lint a{ 2 }; a * a <= N; ++a) {
if (N % a != 0) continue;
lint ex{ 0 };
while (N % a == 0) { ++ex; N /= a; }
factorize.push_back({ a, ex }); }
if (N != 1) factorize.push_back({ N, 1 });
return factorize;
}
void divide(lint N, lint& a, lint& b) {
if (N % 2 == 1) { a = N / 2 + 1; b = N / 2; }
else { a = N / 2; b = N / 2; }
}
string func(lint a) {
string s = "";
lint p = get_digit(a);
REP(i, 6 - a) s.push_back('0');
string ss = std::to_string(a);
s += ss;
return s;
}
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int N, M; cin >> N >> M;
vector<int>P(M), Y(M); vector<vector<int>>D(N);
for (int i = 0; i < M; ++i) { cin >> P.at(i) >> Y.at(i);
D.at(P.at(i) - 1).emplace_back(Y.at(i));
}
for (int i = 0; i < N; ++i) {
sort(D.at(i).begin(), D.at(i).end());
}
for (int i = 0; i < M; ++i) {
cout << setfill('0') << setw(6) << P.at(i)
<< setfill('0') << setw(6) <<
lower_bound(D.at(P.at(i) - 1).begin(), D.at(P.at(i) - 1).end(), Y.at(i)) - D.at(P.at(i) - 1).begin() + 1 << endl;
}
}
| 0
| 52,871,815
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p && n) {
int sum = 0;
int dl[n];
rep(i, n) {
cin >> dl[i];
sum += dl[i];
}
if (dl[m - 1] == 0) {
cout << 0 << endl;
} else {
cout << sum * (100 - p) / dl[m - 1] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
void solve(){
int a,b;
cin>>a>>b;
int cur = 1;
while(true){
db x = cur*0.08;
db y = cur*0.1;
int w = (int)x;
int z = (int)y;
if(w == a && z == b){
cout<<cur<<endl;
return;
}
if(w > a){
cout<<-1<<endl;
return;
}
cur++;
}
}
signed main(){
io;
int tests;
tests = 1;
while(tests--){
solve();
}
return 0;
}
| 0
| 57,144,485
|
#include<bits/stdc++.h>
using namespace std;
string s;
int N, K;
long long com(long long n, long long r) {
if(r < 0 || r > n) return 0;
else if(r == 1) return n;
else if(r == 2) return n * (n-1) / 2;
else return n * (n-1) * (n-2) / 6;
}
long long mypow(long long n, long long k) {
long long res = 1;
for(int i = 0; i < k; i++) res *= n;
return res;
}
long long solve(int i, int k, bool smaller) {
if(i == N) {
if(k == 0) return 1;
else return 0;
}
if(k == 0) return 1;
if(smaller) return com(N-i, k) * mypow(9, k);
else {
if(s[i] == '0') return solve(i+1, k, false);
else {
long long zero = solve(i+1, k, true);
long long aida = solve(i+1, k-1, true) * (s[i] - '1');
long long icchi = solve(i+1, k-1, false);
return zero + aida + icchi;
}
}
}
int main() {
cin >> s >> K;
N = s.size();
cout << solve(0, K, false) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<long long, int> mp;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
mp[x]++;
}
long long a = 0, b = 0;
for (auto it = mp.rbegin(); it != mp.rend(); it++) {
if (it->second > 1) {
if (a == 0) {
a = it->first;
it->second -= 2;
}
if (b == 0 && it->second > 1) {
b = it->first;
break;
}
}
}
cout << a * b;
return 0;
}
| 0
| 2,112,166
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,ans=0;
cin>>n;
ans+=n-1;
for(ll i=2;i<n;i++)
{
if(n%i==0)
ans+=(n/i - 1);
else
ans+=(n/i);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N, M;
cin >> N >> M;
vector<int> a(M), b(M), c(M);
vector<vector<int>> d(N, vector<int> (N, inINF));
for (int i = 0; i < M; i++) {
cin >> a[i] >> b[i] >> c[i];
a[i]--;
b[i]--;
d[a[i]][b[i]] = c[i];
d[b[i]][a[i]] = c[i];
}
for (int i = 0; i < N; i++) {
d[i][i] = 0;
}
for (int k = 0; k < N; k++) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
int ans = 0;
for (int i = 0; i < M; i++) {
if(d[a[i]][b[i]] < c[i]){
ans++;
}
}
printf("%d\n", ans);
}
| 0
| 3,941,108
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 5, P = 1e9 + 7;
int n, m, x[N], y[N];
int main() {
scanf("%d%d", &n, &m);
ll ans = 0, psum = 0;
for (int i = 1; i <= n; ++i) {
scanf ("%d", &x[i]);
ans += 1ll * (i - 1) * x[i] - psum;
ans %= P;
psum += x[i];
}
ll ans1 = 0;
psum = 0;
for (int i = 1; i <= m; ++i) {
scanf ("%d", &y[i]);
ans1 += 1ll * (i - 1) * y[i] - psum;
ans1 %= P;
psum += y[i];
}
cout << (ll)ans1 * ans % P << '\n';
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int main(){
int n,id=1,nv,ch,index,syuryo=1;
scanf("%d\n",&n);
int *A = new int[100040];
bool *B = new bool[100040];
int *C = new int[100040];
string *D = new string[100040];
int st,ed;
for(int i=0;i<=100040;i++){
A[i]=0;
C[i]=-1;
B[i]=false;
}
for(int i=0;i<n;i++){
scanf("%d",&id);
getline(cin,D[id]);
syuryo=1;
for(int r=1;r<=D[id].length();r++){
if(D[id][r] == ' '){
syuryo = r-1;
break;
}
}
index = atoi(D[id].substr(1,syuryo).c_str());
if(index != 0)B[id]=true;
if(index != 0){
st = syuryo+2;
for(int d = syuryo+2;d<=D[id].length();d++){
if(D[id][d] == ' ' || d == D[id].length()){
A[atoi(D[id].substr(st,d-st).c_str())]=A[id]+1;
C[atoi(D[id].substr(st,d-st).c_str())]=id;
if(B[atoi(D[id].substr(st,d-st).c_str())]){
int st2=3;
for(int j = syuryo+2;j<=D[atoi(D[id].substr(st,d-st).c_str())].length();j++){
if(D[atoi(D[id].substr(st,d-st).c_str())][j] == ' ' || j == D[atoi(D[id].substr(st,d-st).c_str())].length()){
A[atoi(D[atoi(D[id].substr(st,d-st).c_str())].substr(st2,j-st2).c_str())]=A[atoi(D[id].substr(st,d-st).c_str())]+1;
st2=j+1;
}
}
}
st = d+1;
}
}
}
}
for(int i=0;i<n;i++){
printf("node %d: parent = %d, depth = %d, ",i,C[i],A[i]);
int cou=0;
if(C[i] == -1){printf("root, [");}
else if(!B[i])printf("leaf, [");
else printf("internal node, [");
syuryo=1;
for(int r=1;r<=D[i].length();r++){
if(D[i][r] == ' '){
syuryo = r-1;
break;
}
}
index = atoi(D[i].substr(1,syuryo).c_str());
st=syuryo+2;
if(index != 0){
for(int j=syuryo+2;j<=D[i].length();j++){
if(D[i][j] == ' ' || D[i].length() == j ){
printf("%d",atoi(D[i].substr(st,j-st).c_str()));
if(j != D[i].length())printf(", ");
st=j+1;
}
}
}
printf("]\n");
}
delete [] A;
delete [] B;
delete [] C;
delete [] D;
return 0;
}
| 0
| 39,519,722
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while(getline(cin, s)) {
if(s[0] == '.') break;
bool b = true;
int x = 0, y = 0;
char c[1000];
int top = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] == '(') {
x++;
c[top] = s[i];
top++;
}
else if(s[i] == ')') {
x--, top--;
if(c[top] != '(') {
b = false;
break;
}
}
else if(s[i] == '[') {
y++;
c[top] = s[i];
top++;
}
else if(s[i] == ']') {
y--, top--;
if(c[top] != '[') {
b = false;
break;
}
}
if(x < 0 || y < 0) {
b = false;
break;
}
}
if(x == 0 && y == 0 && b) cout << "yes" << endl;
else cout << "no" << endl;
}
}
|
#include <stdio.h>
#pragma warning(disable : 4996)
int N, Y, M, D;
int main()
{
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
scanf("%d", &Y);
scanf("%d", &M);
scanf("%d", &D);
if (Y == 0 && M == 0 && D == 0) break;
int ret = 0;
for (int i = 1; i < Y; i++)
{
if (i % 3 == 0)
{
ret += 200;
}
else
{
ret += 195;
}
}
for (int i = 1; i < M; i++)
{
if (Y % 3 != 0 && i % 2 == 0)
{
ret += 19;
}
else
{
ret += 20;
}
}
ret += D;
printf("%d\n", 196471 - ret);
}
return 0;
}
| 0
| 93,787,956
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <climits>
#include <iomanip>
using namespace std;
int main() {
int n, m,p;
cin >> n >> m;
vector<int> h(n+1);
for (int i = 0; i < n; i++)cin >> h[i+1];
vector<vector<int> > arr(m, vector<int>(2));
for (int i = 0; i < m; i++) {
for (int j = 0; j < 2; j++) {
cin >> arr[i][j];
}
}
vector<int> point(n+1);
for (int i = 0; i < m; i++) {
if (h[arr[i][0]]>h[arr[i][1]]) {
point[arr[i][1]]++;
}
if (h[arr[i][0]] < h[arr[i][1]]) {
point[arr[i][0]]++;
}
if (h[arr[i][0]] == h[arr[i][1]]) {
point[arr[i][0]]++;
point[arr[i][1]]++;
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (point[i] == 0)ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
using namespace std;
using P = pair<int,int>;
const long long INF = 1LL << 60;
const int IINF=100000000;
const int MOD = (int)1e9 + 7;
typedef long long ll;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
return ret;
}
vector<int> dx={1,0,-1,0};vector<int> dy={0,-1,0,1};
int n,m;
vector<vector<ll>> dp;
signed main () {
scanf("%d %d",&n,&m);
dp.assign(n,vector<ll>(n,INF));
for(int i= 0;i<n;i++)dp[i][i] = 0;
REP(i,m){
ll a,b,c;scanf("%lld %lld %lld",&a,&b,&c);
dp[a][b] = c;
}
REP(k,n){
REP(i,n){
REP(j,n){
if(dp[i][k] != INF && dp[k][j] != INF){
dp[i][j]=min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
}
REP(i,n){
if(dp[i][i] < 0 ){
printf("NEGATIVE CYCLE\n");
return 0;
}
}
REP(i,n){
REP(j,n){
if(dp[i][j]==INF){
printf("INF");
} else {
printf("%lld",dp[i][j]);
}
if(j!=n-1){
printf(" ");
} else {
printf("\n");
}
}
}
}
| 0
| 62,428,432
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int a,b,x;
cin>>a>>b>>x;
if(a<=x&&a+b>=x) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
|
#include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
long long modpow(long long a,long long n,long long mod){
long long res = 1;
while(n > 0){
res = res*a%mod;
n -= 1;
}
return res;
}
int main(){
int N;
cin >> N;
int D[N];
long long mod = 998244353;
map<long long,int> d;
for(int i = 0; i < N;i++){
cin >> D[i];
d[D[i]]++;
}
long long ans = 1;
bool flag = false;
for(int i = N -1; i >= 1;i--){
if(d[i]!=0)flag = true;
if(flag&&d[i]==0){
cout << 0 << endl;
return 0;
}
}
if(d[0]!=1){
cout << 0 << endl;
return 0;
}
if(D[0]!= 0){
cout << 0 << endl;
return 0;
}
for(int i = 1; i <N;i++){
ans *= modpow(d[i-1],d[i],mod);
ans %= mod;
}
cout << ans << endl;
return 0;
}
| 0
| 43,786,039
|
#include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int c=a*500;
if(c>=b)
cout<< "Yes"<<endl;
if(c<b)
cout<< "No"<<endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <ios>
#include <iomanip>
#include <numeric>
#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; }
typedef long long ll;
using namespace std;
const long long LINF =1e18;
const int INF = 1e9;
ll gcd(ll a,ll b){
if(b == 0){
return a;
}
return gcd(b,a %b);
}
int main() {
int n;
cin>>n;
int x;
cin>>x;
ll t;
cin>>t;
t = abs(t-x);
ll ans = t;
for (int i = 1; i < n; ++i) {
ll t;
cin>>t;
t = abs(t-x);
ans = gcd(ans,t);
}
cout<<ans<<endl;
return 0;
}
| 0
| 25,407,658
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long N;cin>>N;
long long A[N],B[N-1];
for(long long i=0;i<N-1;i++){
cin>>B[i];
}
A[0]=B[0];
for(long long i=1;i<N;i++){
if(i==N-1){
A[i]=B[i-1];
}
else{
A[i]=min(B[i],B[i-1]);
}
}
long long ans=0;
for(long long i=0;i<N;i++){
ans+=A[i];
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, P;
string S;
cin >> N >> P >> S;
int64_t ans = 0;
if(10 % P == 0) {
for(int i=0; i<N; i++) {
if((S[i]-'0') % P == 0) {
ans += i+1;
}
}
} else {
vector<int64_t> v(P);
int t = 0;
int ten = 1;
for(int i=0; i<N; i++) {
t += (S[N-1-i]-'0') * ten;
ten *= 10;
t %= P;
ten %= P;
v[t]++;
}
for(auto e: v) {
ans += e * (e-1) / 2;
}
ans += v[0];
}
cout << ans << endl;
return 0;
}
| 0
| 74,352,739
|
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, n) for (int i = a; i <= (n); ++i)
int main() {
int X, t; cin >> X >> t;
cout << max(X - t, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define f(i, a, n) for (int i = a; i < n; i++)
using namespace std;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vll> vvll;
typedef vector<string> vs;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int s, w;
cin >> s >> w;
if (s <= w)
cout << "unsafe";
else
cout << "safe";
return 0;
}
| 0
| 39,537,927
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string a,b;cin>>a>>b;
int a1,b1;
if(a[0]=='H')a1=1;
else a1=-1;
if(b[0]=='H')b1=1;
else b1=-1;
if(a1*b1==1)cout<<'H'<<endl;
else cout<<'D'<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define Mx 1000000000005
#define ll long long
#define pi 3.141592653
#define vi vector<ll>
#define Mo 1000000007
#define mp make_pair
#define M map<ll,ll>
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define vii vector<pair<ll,ll> >
#define fi first
#define se second
#define pb push_back
#define ld long double
#define fill(a,x) memset(a,x,sizeof(a))
using namespace std;
bool comp(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return a.second<b.second;
}
ll func(ll a[],ll n,ll k)
{
if(k==0) return 1;
if(k<0 || n==0) return 0;
ll ans=0;
fr(i,0,a[n-1]+1)
{
ans+=func(a,n-1,k-i);
ans%=Mo;
}
return ans;
}
int main()
{
ll n,k,l,r; cin>>n>>k;
ll a[n];
fr(i,0,n)
cin>>a[i];
ll dp[n+1][k+1],p[n+1][k+1];
fill(dp,0);
fill(p,0);
fr(i,0,n+1)
{
dp[i][0]=1;
p[i][0]=1;
}
fr(j,1,k+1)
p[0][j]+=p[0][j-1];
fr(i,1,n+1)
{
fr(j,1,k+1)
{
r=j; l=j-a[i-1];
dp[i][j]+=p[i-1][r];
dp[i][j]%=Mo;
if(l>0) dp[i][j]-=p[i-1][l-1];
if(dp[i][j]<0) dp[i][j]+=Mo;
p[i][j]=p[i][j-1]+dp[i][j];
p[i][j]%=Mo;
}
}
cout<<dp[n][k];
}
| 0
| 66,579,599
|
#include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
string s[9]={".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int main(){
int n;
string input;
cin >> n;
for(int i=0; i<n; i++){
char output[76] = "";
cin >> input;
char num = '0';
int kaisu = 0;
int outlength = 0;
for(int j=0; j<(int)input.length(); j++){
if(input[j] != '0'){
num = input[j];
kaisu++;
}else if(input[j] == '0' && kaisu != 0){
output[outlength] = s[atoi(&num)-1][(kaisu-1)%s[atoi(&num)-1].length()];
kaisu = 0;
num = '0';
outlength++;
}
}
output[outlength] = '\0';
cout << output << endl;
}
return 0;
}
|
#include <iostream>
int main() {
int i, j, num, count, min, min_index, temp;
int ary[110];
std::cin >> num;
for (i = 0; i <= num - 1; i++) std::cin >> ary[i];
count = 0;
for (i = 0; i <= num - 2; i++) {
min = ary[i];
min_index = i;
for (j = i; j <= num - 1; j++) {
if (min > ary[j]) {
min = ary[j];
min_index = j;
}
}
if (ary[i] != ary[min_index]) {
temp = ary[i];
ary[i] = ary[min_index];
ary[min_index] = temp;
count ++;
}
}
for (i = 0; i <= num - 2; i++) std::cout << ary[i] << " ";
std::cout << ary[num - 1] << std::endl;
std::cout << count << std::endl;
return 0;
}
| 0
| 5,791,410
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, ans = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++){
cin >> A.at(i);
}
for (int i = 0; i < N - 1; i++){
if (A.at(i) == A.at(i + 1)){
ans++;
A.at(i + 1) = 10001;
}
}
cout << ans << endl;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)
#define rrep(i,x) for(int i=(int)x-1;i>=0;--i)
#define rrep1(i,x) for(int i=(int)x;i>=1;--i)
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int, int>;
using vpii=vector<pii>;
template<class T,class U>ostream&operator<<(ostream&os,const pair<T,U>p){os<<"("<<p.fst<<", "<<p.scd<<")";return os;}
template<class T>ostream&operator<<(ostream&os,const vector<T>v){rep(i,v.size()){if(i)os<<", ";os<<v[i];}return os;}
template<typename T>T&max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T&min(T&a,T&b){if(a < b)return a;return b;}
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;}
constexpr ll TEN(ll n){return n==0?1:10ll*TEN(n-1);}
constexpr ll inf = TEN(9)+5;
constexpr ll linf = 3*TEN(18);
signed main()
{
map<string, int> m;
int n; cin >> n;
int sum = 0;
rep(i, n) {
string s; cin >> s;
int a; cin >> a;
sum += a;
m[s] = sum;
}
string X; cin >> X;
cout << sum - m[X] << endl;
}
| 0
| 4,808,786
|
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=1;i<=N;i++)
signed main(){
int N;
cin>>N;
int ans=0;
rep(i,N){
int yaku=0;
rep(j,i){
if(i%j==0)yaku+=1;
}
if(i%2==1&&yaku==8)ans+=1;
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int N;
bool judge=false;
cin>>N;
for(int a=0;a<=N/4;++a){
for(int b=0;b<=N/7;++b){
if(4*a+7*b==N){
judge=true;
break;
}
}
}
if(judge==false){cout<<"No";
}
else{
cout<<"Yes";
}
}
| 0
| 40,222,897
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int A,B,K;
cin>>A>>B>>K;
rep(i,100){
if(A%(100-i)==0&&B%(100-i)==0){
K--;
}
if(K==0){
cout<<100-i<<endl;
break;
}
}
}
|
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
const long double eps = 1e-2;
const long double pi = acos(-1.0);
using namespace std;
const int N = 1e5 + 1;
const int LOG = 20;
int n, l;
int x[N];
int up[LOG][N];
void solve(){
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i];
cin >> l;
for (int i = 1; i <= n; i++){
if (i == n){
up[0][i] = i;
continue;
}
int p = upper_bound(x + 1, x + n + 1, x[i] + l) - x;
p--;
up[0][i] = p;
}
for (int k = 1; k < LOG; k++){
for (int i = 1; i <= n; i++)
up[k][i] = up[k - 1][up[k - 1][i]];
}
int q;
cin >> q;
while (q--){
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
int ans = 0;
for (int i = LOG - 1; i >= 0; i--)
if (up[i][a] < b){
ans += (1 << i);
a = up[i][a];
}
cout << ans + 1 << endl;
}
}
int main() {
ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
cout.setf(ios::fixed), cout.precision(3);
int step;
step = 1;
for (int i = 1; i <= step; i++){
solve();
}
}
| 0
| 48,276,648
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int x;
cin >> x;
vector<int> kyu={400,600,800,1000,1200,1400,1600,1800,2000};
int ans = 0;
rep(i,9){
for(int j=kyu[i];j<kyu[i+1];j++){
if(j <= x) ans = i;
}
}
cout << 8-ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std ;
int n ;
pair < long long , int > d[100010] ;
int nChild[100010] ;
map < long long , int > f;
vector < pair < int , int > > lis ;
int main(){
#define NAME "example"
ios_base :: sync_with_stdio(false) ;
cin >> n ;
for (int i = 1; i <= n; ++ i) cin >> d[i].first, d[i].second = i ;
sort(d + 1, d + n + 1) ;
long long total = 0 ;
for (int i = 1; i <= n; ++ i) f[d[i].first] = d[i].second ;
for (int i = n; i >= 2; -- i){
long long foo = d[i].first + 2ll * (nChild[d[i].second] + 1) - 1ll * n ;
int bar = f[foo] ;
if(!bar) return cout << -1 , 0 ;
nChild[bar] += nChild[d[i].second] + 1 ;
if(bar != d[1].second && 2 * nChild[bar] >= n) return cout << -1, 0 ;
lis.push_back(make_pair(d[i].second, bar)) ;
total += 1ll * (nChild[d[i].second] + 1) ;
}
if(total != d[1].first) return cout << -1, 0 ;
for (int i = 0; i < (int)lis.size(); ++ i) cout << lis[i].first << " " << lis[i].second << endl ;
return 0 ;
}
| 0
| 66,538,702
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define INIT2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define umap unordered_map
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
int solve(){
ll H,W,A,B; cin>>H>>W>>A>>B;
REP(i,B){
cout << string(A,'1') << string(W-A,'0') <<"\n";
}
REP(i,H-B){
cout << string(A,'0') << string(W-A,'1') <<"\n";
}
return 0;
}
int main(){
solve();
}
|
#line 1 "../lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
using namespace std;
#line 2 "tmp.cpp"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a;
REP(i, n) {
int r, c;
cin >> r >> c;
if (i == 0)
a.push_back(r);
a.push_back(c);
}
vector<vi> dp(n + 1, vi(n + 1, 1e9));
REP(k, n + 1) {
REP(i, n + 1 - k) {
if (k < 2) {
dp[i][i + k] = 0;
} else {
REP(j, k) { dp[i][i + k] = min(dp[i][i + k], dp[i][i + j] + dp[i + j][i + k] + a[i] * a[i + j] * a[i + k]); }
}
}
}
cout << dp[0][n] << endl;
return 0;
}
| 0
| 87,457,048
|
#include<iostream>
#include<vector>
#include<set>
#include<unordered_map>
using namespace std;
int gcd(int a,int b){
if(a==0||b==0){
return a+b;
}
return gcd(b%a,a);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
long long int a,b;
cin>>a>>b;
int k = gcd(a,b);
cout<<(a*b*1ll)/k;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef vector<si> vsi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pi;
typedef queue<int> qi;
typedef queue<pi> qpi;
typedef pair<ll, ll> pll;
typedef queue<pll> qpll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const int mod = 1000000007;
const int INF = 1001001001;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
struct edge {
int from;
int to;
int cost;
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned Euclidean_gcd(unsigned a, unsigned b) {
if(a < b) return Euclidean_gcd(b, a);
unsigned r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
int digit_sum(int n) {
int sum=n%10;
while(n!=0) {
n/=10;
sum+=n%10;
}
return sum;
}
vpll PrimeFactorization(ll n) {
vpll res;
for (ll i=2; i*i<=n; i++) {
if(n%i!=0) continue;
ll ex=0;
while(n%i==0) {
ex++;
n/=i;
}
res.push_back(pll(i,ex));
}
if(n!=1) res.push_back(pll(n,1));
return res;
}
int main() {
int n, k;
cin >> n >> k;
vi l(n);
REP(i,n) cin >> l[i];
sort(ALL(l),greater<int>());
int ans=0;
REP(i,k) {
ans+=l[i];
}
cout << ans << endl;
return 0;
}
| 0
| 65,469,059
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n,m,k;
cin >> n >> m >> k;
bool a=false;
rep(i,n+1){
rep(j,m+1){
if(k==i*j+(n-i)*(m-j)){
a=true;
}
}
}
if(a){
cout << "Yes" << endl;
}
else
cout << "No" << endl;
}
|
#include <iostream>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[])
{
int n,k;
while (cin >> n >> k)
{
if (n == 0 && k==0)
{
break;
}
vector<int> vec(n);
int sum_max=0;
int j;
int sum=0;
for (int i = 0; i < n; i++)
{
cin >> vec[i];
if (k == i + 1)
{
for (j = 0; j < k; j++)
{
sum += vec[i - j];
}
sum_max = max(sum ,sum_max);
sum -= vec[i-k+1];
}
else if (k < i + 1)
{
sum += vec[i];
sum_max = max(sum ,sum_max);
sum -= vec[i-k+1];
}
}
cout << sum_max << endl;
}
return 0;
}
| 0
| 32,202,432
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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 (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
ll ans = 0;
repr(i, n - 1) {
if ((a[i] + ans) % b[i] != 0) {
ans += b[i] - (a[i] + ans) % b[i];
}
}
cout << ans << '\n';
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
int n = 0;
for (auto e : vec) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& st) {
int n = 0;
for (auto e : st) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) {
int n = 0;
for (auto e : mp) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& e : vec) is >> e;
return is;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out() { std::cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
std::cerr << head;
if (sizeof...(Tail) != 0) std::cerr << ", ";
debug_out(std::forward<Tail>(tail)...);
}
using namespace std;
using int64 = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
cin >> v;
map<int, int> mp_even;
map<int, int> mp_odd;
mp_even[-1] = 0;
mp_odd[-1] = 0;
for (int i = 0; i < n; i += 2) {
if (mp_even.count(v[i])) {
mp_even[v[i]]++;
} else {
mp_even[v[i]] = 1;
}
}
vector<pair<int, int>> v_even(mp_even.begin(), mp_even.end());
sort(v_even.begin(), v_even.end(), [](const auto& x, const auto& y) {
if (x.second == y.second)
return x.first > y.first;
else
return x.second > y.second;
});
for (int i = 1; i < n; i += 2) {
if (mp_odd.count(v[i])) {
mp_odd[v[i]]++;
} else {
mp_odd[v[i]] = 1;
}
}
vector<pair<int, int>> v_odd(mp_odd.begin(), mp_odd.end());
sort(v_odd.begin(), v_odd.end(), [](const auto& x, const auto& y) {
if (x.second == y.second)
return x.first > y.first;
else
return x.second > y.second;
});
debug(v_even);
debug(v_odd);
if (v_even[0].first != v_odd[0].first) {
cout << n - v_even[0].second - v_odd[0].second << endl;
} else {
cout << n - max(v_even[0].second + v_odd[1].second,
v_even[1].second + v_odd[0].second)
<< endl;
}
return 0;
}
| 0
| 64,274,410
|
#include <bits/stdc++.h>
using namespace std;
struct dat {
int a,b,c;
};
int G[100][100];
int main() {
int n,m; cin >> n >> m;
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
G[i][j]=1e9;
for(int i=0;i<n;++i) G[i][i]=0;
vector<dat> abc(m);
for(auto &e:abc) {
cin >> e.a >> e.b >> e.c;
--e.a; --e.b;
G[e.a][e.b]=G[e.b][e.a]=e.c;
}
for(int k=0;k<n;++k)
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
G[i][j]=min(G[i][j],G[i][k]+G[k][j]);
int ans=0;
for(auto e:abc)
if(G[e.a][e.b]<e.c) ++ans;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <string>
void alphabetCase(char &moji);
void change(std::string &str);
int main(void) {
std::string target;
std::getline(std::cin, target);
change(target);
std::cout << target << std::endl;
return EXIT_SUCCESS;
}
void alphabetCase(char &c) {
int ascii = (int)(c);
int diff = int('a') - int('A');
if (ascii >= int('A') && ascii <= int('Z')) {
ascii += diff;
} else if (ascii >= ('a') && ascii <= ('z')) {
ascii -= int('a') - int('A');
}
c = (char)(ascii);
return;
}
void change(std::string &str) {
int size = (int)(str.size());
for (int loop = 0; loop < size; loop++) {
alphabetCase(str[loop]);
}
return;
}
| 0
| 10,211,822
|
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll C(ll N) {
return N * (N - 1) / 2;
}
const double PI = 3.14159265358979323846;
int main() {
string a, b,c; cin >> a >> b >> c;
transform(a.begin(), a.end(), a.begin(), ::toupper);
transform(b.begin(), b.end(), b.begin(), ::toupper);
transform(c.begin(), c.end(), c.begin(), ::toupper);
cout << a[0] << b[0] << c[0] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,K; cin>>n>>K;
vector<int> p(n),q(n,0);
rep(i,n) cin>>p[i];
rep(i,min(K,50)){
rep(j,n){
int a=max(0,j-p[j]), b=min(n-1,j+p[j]);
q[a]++;
if(b!=n-1) q[b+1]--;
}
rep(j,n-1) q[j+1]=q[j+1]+q[j];
p=q;
q=vector<int>(n,0);
}
rep(i,n) cout<<p[i]<<" ";
cout<<endl;
return 0;
}
| 0
| 21,027,503
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep0(i, n) for (int i = 0; i <= (n); i++)
#define rep2(a, n) for (int i = a; i < (n); i++)
#define rep3(i, a, n) for (int i = a; i < (n); i++)
#define maxs(x, y) (x = max(x, y))
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
const int NUM = 100010;
int dp[NUM][3];
int main(void) {
int n;
cin >> n;
rep(i, n) {
vector<int> a(3);
rep(i, 3) cin >> a[i];
rep(j, 3) rep(k, 3) if (j != k) { maxs(dp[i + 1][j], dp[i][k] + a[j]); }
}
int ans = 0;
rep(i, 3) maxs(ans, dp[n][i]);
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
int main(){
fastIO;
int N;
cin >> N;
vector<long long> x(N+1,0);
vector<long long> y(N+1,0);
vector<long long> t(N+1,0);
for(int i=1; i<N+1; i++){
cin >> t[i] >> x[i] >> y[i];
int dt = abs(t[i]-t[i-1]);
int dx = abs(x[i]-x[i-1]);
int dy = abs(y[i]-y[i-1]);
if(dt%2!=(dy+dx)%2 || dt < dx+dy){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 75,823,253
|
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 2e5 + 10;
const int INF = 0x3f3f3f3f;
const int Mod= 1000000007;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
#define dbg(x1) cout<<#x1<<" = "<<(x1)<<endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<(x1)<<" "<<#x2<<" = "<<(x2)<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<(x1)<<" "<<#x2<<" = "<<(x2)<<" "<<#x3<<" = "<<(x3)<<endl
int n;
int a[maxn];
int pos[maxn];
ll Fac[maxn],Inv[maxn],inv[maxn];
void init()
{
Fac[0]=Inv[0]=Fac[1]=Inv[1]=inv[1]=1;
for(int i=2;i<maxn;i++)
{
Fac[i]=Fac[i-1]*i%Mod;
inv[i]=inv[Mod%i]*(Mod-Mod/i)%Mod;
Inv[i]=Inv[i-1]*inv[i]%Mod;
}
}
ll c(ll n,ll m)
{
if(n<m||m<0) return 0;
return Fac[n]*Inv[m]%Mod*Inv[n-m]%Mod;
}
int main() {
init();
scanf("%d",&n);
n++;
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int flag1=0,flag2=0;;
for(int i=1;i<=n;i++)
{
if(pos[a[i]]!=0)
{
flag1=pos[a[i]];
flag2=i;
}
pos[a[i]]=i;
}
for(int i=1;i<=n;i++)
{
ll ans = (c(n,i) - c(flag1-1+n-flag2,i-1) +Mod)%Mod;
printf("%lld\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = int(x); i <= int(n); ++i)
#define for1(i, n, x) for (int i = int(n); i >= int(x); --i)
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef long double ld;
typedef vector <ll> vi;
const int N = 2e6 + 1;
const ll INF = 1e18 + 9;
const int B = 1e9 + 7;
int n, m;
vi g[N];
int shit, cnt;
int u[N], c[N];
void dfs(int x) {
u[x] = 1;
++cnt;
for (auto to : g[x]) {
if (u[to] && c[to] == c[x]) shit = 1;
if (!u[to]) {
c[to] = c[x] ^ 1;
dfs(to);
}
}
}
int main() {
#ifdef black
freopen("in", "r", stdin);
#endif
ios_base :: sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
forn(i, 1, m) {
int f, t;
cin >> f >> t;
g[f].pb(t);
g[t].pb(f);
}
ll a = 0, b = 0, c = 0;
forn(i, 1, n) {
if (u[i]) continue;
if (g[i].size() == 0) {
++c;
continue;
}
shit = 0;
dfs(i);
if (!shit) ++a;
else ++b;
}
cout << 2 * a * a + 2 * a * b + b * b + (2 * c * n - c * c) << "\n";
return 0;
}
| 0
| 43,125,946
|
#include<bits/stdc++.h>
using namespace std;
vector<string> ss;
int n;
bool works(int a, int b) {
bool ans = true;
for(int i=0;i<n;i++) {
for(int j=i;j<n;j++) {
int x1 = (i + a) % n;
int y1 = (j + b) % n;
int x2 = (j + a) % n;
int y2 = (i + b) % n;
ans = ans && (ss[x1][y1] == ss[x2][y2]);
}
}
return ans;
}
int main() {
cin >> n;
ss.resize(n);
for(int i=0;i<n;i++) {
cin >> ss[i];
}
long long ans = n * works(0, 0);
for(int i=1;i<n;i++) {
bool x = works(i, 0);
ans += (n - i) * x;
x = works(0, i);
ans += (n - i) * x;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s, t;
cin >> s >> t;
int m = s.length(), n = t.length(), same, ans = 0;
for(int i = 0; i <= m-n; i++)
{
same = 0;
for(int j = 0; j < n; j++)
if(s[i+j] == t[j])
same++;
ans = max(ans, same);
}
cout << n-ans;
return 0;
}
| 0
| 36,791,200
|
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int ps,pt;
int sdiff(string sx, string tx)
{
if(sx == tx)
{ps=1; pt=1;}
else if(sx > tx)
{ps=3; pt=0;}
else
{ps=0; pt=3;}
return 0;
}
int main(void)
{
int n,k,is,it;
string s[1001]={},t[1001]={};
cin >> n;
is=0; it=0;
for(k = 1; k <= n; k++){
cin >> s[k] >> t[k];
sdiff(s[k],t[k]);
is=is+ps; it=it+pt;
}
cout << is << " " << it << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i < (int)n;++i)
int main() {
int n,m;cin>>n>>m;
pair<ll,ll>a[n];
rep(i,n){
cin>>a[i].first;
cin>>a[i].second;
}
sort(a,a+n);
ll ans = 0;
ll cc = 0;
rep(i,n){
if(cc + a[i].second > m){
ans+=a[i].first * (m - cc);
break;
}
else {
cc += a[i].second;
ans += a[i].first * a[i].second;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 77,147,369
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.