code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
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>;
const int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
int main() {
vector<vector<int>> v(3, vector<int>(3));
rep(i, 3) {
rep(j, 3) {
cin >> v.at(i).at(j);
}
}
int N; cin >> N;
rep(i, N) {
int temp; cin >> temp;
rep(j, 3) {
rep(k, 3) {
if (v.at(j).at(k) == temp) {
v.at(j).at(k) = 0;
}
}
}
}
rep(i, 3) {
if (v.at(i).at(0) != 0) {
continue;
}
if (v.at(i).at(1) == 0 && v.at(i).at(2) == 0) {
goto BINGO;
}
}
rep(i, 3) {
if (v.at(0).at(i) != 0) {
continue;
}
if (v.at(1).at(i) == 0 && v.at(2).at(i) == 0) {
goto BINGO;
}
}
if (v.at(0).at(0) == 0 && v.at(1).at(1) == 0 && v.at(2).at(2) == 0) {
goto BINGO;
}
if (v.at(2).at(0) == 0 && v.at(1).at(1) == 0 && v.at(0).at(2) == 0) {
goto BINGO;
}
cout << "No" << endl;
return 0;
BINGO:
cout << "Yes" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N],b[N];
int main(){
int A,B,m,ans,Amin=1e5,Bmin=1e5;
cin>>A>>B>>m;
for(int i=1;i<=A;++i)
cin>>a[i],Amin=min(Amin,a[i]);
for(int i=1;i<=B;++i)
cin>>b[i],Bmin=min(Bmin,b[i]);
int x,y,c;
ans=Amin+Bmin;
for(int i=1;i<=m;++i){
cin>>x>>y>>c;
ans=min(ans,a[x]+b[y]-c);
}
cout<<ans;
return 0;
}
| 0
| 91,814,704
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[N], B[N];
REP(i, N) cin >> A[i] >> B[i];
ll count = 0;
for (int i = N - 1; i >= 0; i--) {
if ((A[i] + count) % B[i] == 0) continue;
count += B[i] - ((A[i] + count) % B[i]);
}
cout << count << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 100000;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<int> backet(MAX+1, 0);
for(int i = 0; i < n; i++) backet[a[i]]++;
int ansmax = 0;
int ans = 0;
for(int i = 0; i <= MAX; i++){
if(i-3 >= 0) ans -= backet[i-3];
ans += backet[i];
if(ansmax < ans) ansmax = ans;
}
cout << ansmax << endl;
return 0;
}
| 0
| 6,443,751
|
#include<iostream>
using namespace std;
char ans[2][10]={
"No\n",
"Yes\n"
};
int main(){
int a,b,c;
cin>>a>>b>>c;
bool flag=0;
if(a<b)if(b<c)flag=1;
cout<<ans[flag];
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int r;
cin >> r;
if(r < 1200) cout << "ABC" << endl;
else if(r < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
return 0;
}
| 0
| 30,609,361
|
#include<iostream>
#include<cstdio>
long long ans,sum[200050],arr[200050],xro[200050];
int n,l=1;
int main()
{
std::scanf("%d",&n);
for(register int i=1;i<=n;++i) std::scanf("%lld",&arr[i]),sum[i]=sum[i-1]+arr[i],xro[i]=xro[i-1]^arr[i];
for(register int r=1;r<=n;++r)
{
while((sum[r]-sum[l-1])!=(xro[r]^xro[l-1])) l++;
ans+=r-l+1;
}
std::printf("%lld",ans);
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
using namespace std;
int N, M, P, X[105];
int main() {
while(1){
cin>>N>>M>>P;
if(N==0 && M==0 && P==0) break;
int sum=0;
map<int,int> m;
REP(i,0,N){
cin>>X[i];
m[i] = X[i];
sum += X[i]*100;
}
if(m[M-1] != 0) cout<<sum*(100-P)/100/m[M-1]<<endl;
else cout<<0<<endl;
}
return 0;
}
| 0
| 26,172,339
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str1,str2,p;
char x;
int q,a,b;
getline(cin, str1);
cin >> q;
for (int i = 0; i < q; i++){
cin >> str2;
if (str2 == "replace"){
cin >> a >> b >> p;
for (int j = 0; j < p.length(); j++)
str1[j + a] = p[j];
}
else if(str2 == "reverse"){
cin >> a >> b;
for (int j = a; j < ((b - a) / 2)+a+1; j++){
swap(str1[j],str1[b-(j-a)]);
}
}
else if(str2=="print"){
cin >> a >> b;
for (int j = a; j < b+1; j++){
cout << str1[j];
}cout << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if(a < b) {a = b; return true;} return false;}
const ll INF = 1LL << 60;
const double pi = acos(-1.0);
ll dp[1100][11000];
int main() {
ll h, n; cin >> h >> n;
rep(i, 1100) rep(j, 11000) {
if(j == 0) dp[i][j] = 0;
else dp[i][j] = INF;
}
rep(i, n) {
ll a, b; cin >> a >> b;
rep(j, h+1) {
chmin(dp[i+1][j], dp[i][j]);
if(j <= a) chmin(dp[i+1][j], b);
else chmin(dp[i+1][j], dp[i+1][j-a] + b);
}
}
cout << dp[n][h] << endl;
}
| 0
| 64,076,427
|
#include <iostream>
using namespace std;
int a, b;
bool shouldDrawWhite(int x, int y) {
if (y < 50) {
if (a == 0) {
return false;
}
if (y % 2 == 0 && x % 2 == 0) {
a--;
return true;
}
return false;
}
if (b == 0) {
return true;
}
if (y % 2 == 1 && x % 2 == 0) {
b--;
return false;
}
return true;
}
void solve() {
a--;b--;
cout << 100 << " " << 100 << endl;
for (int y=0;y<100;y++) {
for (int x=0;x<100;x++) {
if (shouldDrawWhite(x, y)) {
cout << '.';
} else {
cout << '#';
}
}
cout << endl;
}
}
int main() {
cin >> a >> b;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define dfs_black 1
#define dfs_white -1
#define pr pair
#define vt vector
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef double db;
typedef long long li;
typedef long double ld;
typedef pr<int, int> ii;
typedef pr<ld,ld> dd;
typedef vt<int> vi;
typedef vt<li> vli;
typedef vt<ld> vld;
typedef vt<ii> vii;
typedef map<int, int> mii;
typedef map<int, bool> mib;
typedef map<int, char> mic;
typedef set<int> s_i;
typedef set<char> s_c;
const int MOD = 1e9+7;
const li INF = 1e18;
const ld PI = 4*atan((ld)1);
int s[2005], t[2005];
li dp[2005][2005];
signed main()
{
int n, m;
cin>>n>>m;
dp[0][0]=1;
for(int i=1; i<=n; i++)
{
cin>>s[i];
dp[i][0]=1;
}
for(int j=1; j<=m; j++)
{
cin>>t[j];
dp[0][j]=1;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if(s[i]==t[j]) dp[i][j]=(dp[i-1][j]+dp[i][j-1])%MOD;
else dp[i][j]=(dp[i][j-1]+dp[i-1][j]-dp[i-1][j-1]+MOD)%MOD;
}
}
cout<<dp[n][m];
}
| 0
| 16,776,127
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <functional>
#define rep(i,n,m) for(int i=n;i<(int)(m);i++)
using namespace std;
int main() {
int H, W, i, j;
string str[26][26];
string s = "snuke";
char w;
cin >> H >> W;
for (i = 0; i < H; i++) {
for (j= 0; j < W; j++) {
cin >> str[i][j];
}
}
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
if (str[i][j] == s) {
w = j + 65;
cout << w << i + 1;
}
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(int argc, char** argv) {
if (argc == 2 && atoi(argv[1]) == 123456789)
freopen("d:\\code\\cpp\\stdin", "r", stdin);
int n;
scanf("%d", &n);
int k=1;
while(k*(k-1)/2 < n)
k++;
if (k*(k-1)/2 == n){
printf("Yes\n");
printf("%d\n", k);
vector<vector<int>> Ss(k);
int row1 = 0, row2 = 1;
const int m = k-1;
for(int i=1; i<=n; i++){
if (Ss[row1].size()==m){
row1++;
row2 = row1+1;
}
Ss[row1].push_back(i);
Ss[row2++].push_back(i);
}
for(int kk=0;kk<k; kk++) {
printf("%d ",k-1);
for (int x : Ss[kk])
printf("%d ", x);
printf("\n");
}
}
else{
printf("No\n");
}
return 0;
}
| 0
| 13,700,778
|
#include<bits/stdc++.h>
#include<string>
signed main() {
int h,w,a,b;
scanf("%d%d%d%d",&h,&w,&a,&b);
std::string s(a,'0');
std::string t(w-a,'1');
std::string S(a,'1');
std::string T(w-a,'0');
for(int i=0;i<h;++i){
if(i<b){
printf("%s%s\n",s.c_str(),t.c_str());
}
else{
printf("%s%s\n",S.c_str(),T.c_str());
}
}
}
|
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
class Solve {
public:
void input() {
}
void solve() {
input();
int N;
cin >> N;
string S;
cin >> S;
int K;
cin >> K;
char c = S[K - 1];
for(auto e : S){
if(e == c) cout << e;
else cout << "*";
}
cout << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| 0
| 31,889,361
|
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const long long MAXN = 300005;
long long N, n, a[MAXN], cnt[MAXN];
long long sum[MAXN];
long long ans[MAXN];
bool check(long long k, long long x) {
long long pos = upper_bound(a + 1, a + n + 1, x) - a;
return sum[pos - 1] + (n - pos + 1) * x >= k * x;
}
int main() {
cin >> N;
for(long long i = 1, x; i <= N; i++)
cin >> x, cnt[x]++;
for(long long i = 1; i <= N; i++)
if(cnt[i])
a[++n] = cnt[i];
sort(a + 1, a + n + 1);
for(long long i = 1; i <= n; i++)
sum[i] = sum[i - 1] + a[i];
long long now = 0;
for(long long k = n; k >= 1; k--) {
while(now < N && check(k, now + 1))
now++;
ans[k] = now;
}
for(long long i = 1; i <= N; i++)
cout << ans[i] << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define LL long long
int n;
vector<vector<int>> v;
int main(){
cin>>n;
int k=0;
FOR(i,1,10000){
k+=i;
if(n<k){
cout<<"No"<<endl;
return 0;
}
if(n==k){
k=i;
break;
}
}
if(k==1){
cout<<"Yes"<<endl;
cout<<2<<endl;
cout<<1<<" "<<1<<endl;
cout<<1<<" "<<1<<endl;
return 0;
}
k+=1;
v.resize(k);
int su=0;
FOR(i,1,k){
REP(j,i){
su+=1;
v[j].push_back(su);
v[i].push_back(su);
}
}
cout<<"Yes"<<endl;
cout<<k<<endl;
REP(i,v.size()){
cout<<k-1;
REP(j,v[i].size()){
cout<<" "<<v[i][j];
}
cout<<endl;
}
return 0;
}
| 0
| 32,369,517
|
#include<bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
long long MOD = 1000000007;
long long INF = 1e18;
typedef long long ll;
typedef long double ld;
#define pii pair<int, int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define fr(i,a,b) for(int i=a;i<b;i++)
#define out2(a,b) cout<<a<<" "<<b<<"\n";
#define all(v) v.begin(), v.end()
#define pb emplace_back
void solve()
{
ll n, ans, d;
cin>>n;
ans = n-1;
for(int i=2;i<=n-1;i++){
d = n/i;
ans+=(d);
if(n%i==0) ans--;
}
cout<<ans;
}
int main() {
FIO;
int test;
test=1;
for(int t=1;t<=test;t++){
solve();
}
return 0;
}
|
#include<bits
using namespace std;
int main(){
long long x,y;
cin >> x >> y;
long long temp = x;
long long ans = 0;
while(x <= y){
x = x * 2;
ans++;
}
cout << ans << endl;
}
| 0
| 50,097,638
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
int count=0;
if(s.size()+1==t.size()){
for(int i=0;i<s.size();i++){
if(s.at(i)==t.at(i))count++;
if(count==s.size()){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int n; cin >> n;
vector<int> a(n); rep(i, n) cin >> a[i];
ll ans = a[0]-1;
int num = 2;
for (int i = 1; i < n; ++i) {
int p = a[i] / num;
int q = a[i] % num;
if (a[i] == num) {
num++;
} else if (q > 0) {
ans += p;
} else {
ans += p-1;
}
}
cout << ans << endl;
return 0;
}
| 0
| 17,966,165
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll S;cin>>S;
cout<<0<<" "<<0<<" "<<1000000000<<" "<<1<<" "<<((S+1000000000-1)/1000000000)*1000000000-S<<" "<<(S+1000000000-1)/1000000000<<endl;
}
|
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int gcd(long long s,long long t){
if(s%t==0){
return t;
}
else{
return gcd(t,s%t);
}
}
int main(){
long long a,b,c,d;
cin>>a>>b>>c>>d;
long long e=c*d/gcd(d,c);
long long ac=(a-1)/c,ad=(a-1)/d,ae=(a-1)/e;
long long bc=b/c,bd=b/d,be=b/e;
long long ans=(b-a+1)-(bc-ac)-(bd-ad)+(be-ae);
cout<<ans<<endl;
return 0;
}
| 0
| 768,059
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll Q, H, S, D;
ll N;
cin >> Q >> H >> S >> D >> N;
S = min(S, min(2*H, 4*Q));
cout << min(2*S, D)*(N/2) + (N%2)*S << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N, M; cin >> N >> M;
pair<int,int>P[N];
rep(i, N) {
int A,B;
cin >> A >> B;
P[i].first=A;
P[i].second=B;
}
long long ans = 0;
sort(P,P+N,greater<pair<int,int>>());
int j=N-1;
rep(i, M) {
if (P[j].second == 0)j--;
ans += P[j].first;
P[j].second--;
}
cout << ans << endl;
}
| 0
| 94,686,409
|
#include<iostream>
using namespace std;
string inp;
char buff[6];
int main(){
std::cin >> inp;
inp.copy(buff, 6);
if(buff[2]==buff[3]&&buff[4]==buff[5]){
std::cout << "Yes";
}else{
std::cout << "No";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if((A.at(0) == A.at(1)) && (A.at(1) == A.at(2))) {
cout << "No" << endl;
}
else if(A.at(0) == A.at(1)) {
if(A.at(2) == A.at(3)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else if(A.at(0) == A.at(2)) {
if(A.at(1) == A.at(3)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else if(A.at(0) == A.at(3)) {
if(A.at(1) == A.at(2)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else {
cout << "No" << endl;
}
}
| 0
| 53,619,778
|
#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;
vector<int> p(n),q(n);
REP(i,n) cin >> p[i];
REP(i,n) cin >> q[i];
vector<int> v(n);
iota(ALL(v),1);
int a,b,cnt=0;
do{
cnt++;
REP(i,n){
if(v==p)a=cnt;
if(v==q)b=cnt;
}
}while(next_permutation(ALL(v)));
cout << abs(a-b);
return 0;
}
|
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include <queue>
#include<boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace boost::multiprecision;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldb = long double;
#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIF(v, n) printf("%."#n"f\n", v)
#define PRIY PRI("Yes")
#define PRIN PRI("No")
template<typename A, typename B>
void mins(A & a, const B & b) { a = min(a, (A)b); };
template<typename A, typename B>
void maxs(A & a, const B & b) { a = max(a, (A)b); };
double eps = 1e-4;
double integ(double v1, double v2, double dx) {
return (v1 + v2) * dx / 2.0;
}
int main() {
double inf = 1e18;
ll N; cin >> N;
vector<double> T(N+1);
vector<double> V(N);
T[0] = 0;
REP(i, 1, N+1) {
cin >> T[i];
T[i] += T[i - 1];
}
REP(i, 0, N) cin >> V[i];
vector<double> val(2 * T.back() + 1);
vector<double> tbl_r(N), tbl_l(N);
tbl_l[0] = inf;
tbl_r[N - 1] = inf;
REP(i, 1, N)tbl_l[i] = min(tbl_l[i - 1], V[i - 1] - T[i]);
for (int i = N - 2; i >= 0; --i) tbl_r[i] = min(tbl_r[i + 1], V[i + 1] + T[i + 1]);
val[0] = 0;
int area = 0;
REP(i, 1, 2 * T.back() + 1) {
double t = (double)i / 2.0;
if (t > T[area+1]) ++area;
double ceil_val = min(t, T.back() - t);
mins(ceil_val, V[area]);
mins(ceil_val, tbl_l[area] + t);
mins(ceil_val, tbl_r[area] - t);
if (val[i - 1] + 0.5 < ceil_val + eps) val[i] = val[i - 1] + 0.5;
else if (val[i - 1] < ceil_val + eps) val[i] = val[i - 1];
else val[i] = val[i - 1] - 0.5;
}
double ans = 0;
REP(i, 1, 2 * T.back() + 1) ans += integ(val[i], val[i - 1], 0.5);
PRIF(ans, 5);
return 0;
}
| 0
| 18,721,465
|
#include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
a[i] -= (i+1);
}
sort(a.begin(), a.end());
int x = a[n/2];
if(n%2==0){
x = a[n/2-1] + a[n/2];
x/= 2;
}
ll ans = 0;
for(auto i : a) {
ans += abs(i - x);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
const ll mod = 1000000007;
const ll N = 300005;
const ll inf = 10000000000000000;
void print(vector<ll> v) {
ll i;
fo(i, v.size())cout << v[i] << " ";
cout << "\n";
}
vector<ll> read(ll n) {
ll i;
vector<ll> arr(n, 0);
fo(i, n)cin >> arr[i];
return arr;
}
vector<ll> read(ll n, ll k) {
ll i;
vector<ll> arr(n + k, 0);
Fo(i, k, n + k)cin >> arr[i];
return arr;
}
bool isEven(ll n) {
return n % 2 == 0;
}
bool isOdd(ll n) {
return n % 2 != 0;
}
void solve() {
ll t;
cin >> (t);
while (t--) {
ll i, j, k, n, m, p, q, x, y, a, b, l, r;
}
}
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);
ll i, j, k, n, m, p, q, x, y, a, b, l, r;
string s1,s2;
cin>>s1>>s2;
ll ans = 0;
fo(i,3){
if(s1[i] == s2[i]){
ans++;
}
}
cout<<ans;
return 0;
}
| 0
| 44,980,245
|
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void)
{
string str;
int sum;
int i;
while (1) {
cin >> str;
sum = 0;
for (i=0; str[i]!='\0'; i++) {
sum += (str[i] - '0');
}
if (sum == 0) {
break;
}
else {
cout << sum << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite) for(auto ite=begin(que) ; ite!=end(que) ; ite++)
const int max_n = 1e5;
const ll mod = 1e9+7;
const ll INF = 1e17;
const int inf = 1e5;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return a ? gcd(b%a, a) : b; }
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
ll mo = 998244353;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
struct SegmentTree{
int N;
vector<int> node;
public :
void intit(vector<int>v){
int sz = v.size();
N=1;
while(N<sz) N*=2;
node.resize(N);
for(int i=0 ; i<sz ; i++) node[i+N-1] = v[i];
for(int i=N-2 ; i>=0 ; i--) node[i] = min(node[i*2+1], node[i*2+2]);
}
void update(int x, int val){
x += N-1;
node[x+N-1] = val;
while(x>0){
x = (x-1)/2;
node[x] = min(node[x*2+1], node[x*2+2]);
}
}
int getmin(int a, int b, int k, int l, int r){
if(b<=l || r<=a) return inf;
else if(a<=l && r<=b) return node[k];
else{
int vl = getmin(a, b, 2*k+1, l, (l+r)/2);
int vr = getmin(a, b, 2*k+2, (l+r)/2, r);
return min(vl, vr);
}
}
};
ll func(ll k){
ll res=0;
switch (k%4) {
case 0: res=k;
break;
case 1: res=1LL;
break;
case 2: res=k+1;
break;
case 3: res=0;
break;
}
return res;
}
int main(){
ll a,b; cin>>a>>b;
if(a!=0) a--;
ll ans = func(a)^func(b);
cout<<ans<<endl;
return 0;
}
| 0
| 17,547,636
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using Matrix = vector<vector<T>>;
const ll inf = 1LL<<60;
const ll mod = 1000000007;
ll gcd(ll a, ll b){return b==0 ? a : gcd(b, a%b);}
ll lcm(ll a, ll b){return a / gcd(a,b) * b;}
int main()
{
ll a,b; cin>>a>>b;
cout << lcm(a, b) << endl;
return 0;
}
|
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(long long int i = 1;i <= n; i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
typedef long long int ll;
typedef long double ld;
const ll INF = (1LL << 60);
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
fill((T*)array, (T*)(array + N), val);
}
int main() {
ll n, k, a[15], sum, ans = INF; cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, (1 << n)) {
int cnt = 0;
rep(j, n) {
if (i & (1 << j))cnt++;
}
if (cnt == k) {
sum = 0; ll h = a[0];
req(l, n - 1) {
if (i & (1 << l)) {
sum += max((ll)0, h - a[l] + 1);
h = max(h + 1, a[l]);
}
else h = max(h, a[l]);
}
ans = min(ans, sum);
}
}cout << ans << endl;
}
| 0
| 35,984,826
|
#include<iostream>
using namespace std;
int ans;
void SofI(int num, int n) {
if (num > n * 9) { return; }
else if (num < 0) { return; }
else if (num != 0 && n == 0) { return; }
else if (num == 0) {
ans++;
return;
}
else {
for (int i = 0; i < 10; i++) {
SofI(num - i, n - 1);
}
}
}
int main(void) {
int num;
while (cin >> num) {
if (num == 0) break;
ans = 0;
SofI(num, 4);
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
const ll mod = 1000000007;
int main(){
string L; cin >> L;
int N = sz(L);
ll dp[101000][2];
dp[0][0] = 1;
rep(i,N){
if(L[i]=='0'){
dp[i+1][1] = dp[i][1]*3;
dp[i+1][0] = dp[i][0];
}
if(L[i]=='1'){
dp[i+1][1] = dp[i][0] + dp[i][1]*3;
dp[i+1][0] = dp[i][0]*2;
}
dp[i+1][0]%=mod;
dp[i+1][1]%=mod;
}
cout << (dp[N][0]+dp[N][1])%mod << endl;
return 0;
}
| 0
| 97,523,420
|
#include<iostream>
using namespace std;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int ans=0;
if (A>=B){
ans+=B;
}
else ans+=A;
if (C>=D){
ans+=D;
}
else ans+=C;
cout<< ans << endl;
return 0;}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define se second
const int N = 2e5+5;
string s;
int n,k,cst[3];
int cnt[N];
void solve(){
cin>>n>>k;
for(int i=0;i<3;i++)cin>>cst[i];
cin>>s;
for(int i=0;i<n;i++){
if(i<k)cnt[i] = 1;
else {
if(s[i]==s[i-k])cnt[i] = cnt[i-k]+1;
else cnt[i] = 1;
}
}
ll ans = 0;
for(int i=0;i<n;i++){
if(cnt[i]%2){
if(s[i]=='r')ans+=cst[2];
if(s[i]=='s')ans+=cst[0];
if(s[i]=='p')ans+=cst[1];
}
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--){
solve();
}
return 0;
}
| 0
| 66,269,344
|
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
string s; cin >> s;
int n = (int)s.size();
bool ok = 1;
if(s[0] != 'A') ok = 0;
int cnt = 0;
for(int i = 2; i < n - 1; ++ i) {
if(s[i] == 'C') ++ cnt;
}
if(cnt != 1) ok = 0;
rep(i, n) {
if('A' <= s[i] && s[i] <= 'Z' && s[i] != 'A' && s[i] != 'C') {
ok = 0;
}
}
cout << (ok ? "AC" : "WA") << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
vi diff(n);
rep(i, n) diff[i] = a[i] - b[i];
sort(diff.begin(), diff.end());
int neg = lower_bound(diff.begin(), diff.end(), 0) - diff.begin();
ll neg_sum = 0;
rep(i, neg) {
neg_sum += diff[i];
}
int ans = neg;
for (int i = n-1; i >= 0 ; --i) {
if (neg_sum >= 0) {
break;
}
if (diff[i] <= 0) {
ans = -1;
break;
} else {
neg_sum += diff[i];
ans++;
}
}
cout << ans << endl;
}
| 0
| 33,233,436
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define show(a, n) rep(i,n) {cout<<a[i]<<' ';} cout<<endl
#define show2(a, n, m) rep(i, n) { rep(j, m) {cout << a[i][j] << ' ';} cout << endl;}
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;
typedef long double ld;
const int INF = 1 << 30;
const long long INFL = 1LL << 60;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100010;
int main() {
int n;
cin >> n;
cout << n / 3 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table. at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < table.size(); i++) {
for (int j = 0; j < table.at(0).size(); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n,r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) {
return comb(n + r - 1, n - 1);
}
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b){
if (a % b == 0){
return(b);
}else{
return(gcd(b, a % b));
}
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
bool isprime(int n){
if (n < 2) return false;
else if (n == 2) return true;
else if (n % 2 == 0) return false;
for (int i = 3; i <= sqrt(n); i += 2){
if (n % i == 0){
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
sort(res.begin(), res.end());
return res;
}
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
void sayYes(bool f) {
if (f) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
void sayYES(bool f) {
if (f) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
int main() {
int n,a,b;
cin >> n >> a >> b;
vector<int> p=input(n);
int p1=0,p2=0,p3=0;
rep(i,n){
if(p[i]<=a){
p1++;
}
else if(a<p[i]&&p[i]<=b){
p2++;
}
else{
p3++;
}
}
cout << min(min(p1,p2),p3) << endl;
}
| 0
| 19,109,636
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1e9+7;
int main() {
int N;
vector<string> vec_s;
vector<int> vec_t;
string X;
cin >> N;
vec_s.resize(N);
vec_t.resize(N);
for (int i=0; i < N; i++) cin >> vec_s[i] >> vec_t[i];
cin >> X;
int idx=0;
for (auto s: vec_s) {
if (s == X) break;
idx++;
}
auto beg = next(vec_t.begin(), idx+1);
cout << accumulate(beg, vec_t.end(), 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
int main()
{
string s;
cin >> s;
vector<ll> a(3);
for (ll i = 0; i < 3; i++)
{
a[s[i] - 'a']++;
}
string res = "Yes";
for (ll i = 0; i < 3; i++)
{
if (a[i] != 1)
{
res = "No";
}
}
println(res);
}
| 0
| 47,792,277
|
#include <cstdio>
int main()
{
int a,b,total;
scanf("%d %d",&a,&b);
if(a > b)
{
total = a - b;
}
else
{
total = 0;
}
printf("%d",total);
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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;
int main(void){
ll n,k;cin>>n>>k;
ll r,s,p;cin>>r>>s>>p;
string t;cin>>t;
ll d[3]={p,r,s};
char g[3]={'r','s','p'};
ll res=0;
vector<char> l;
rep(i,n){
char c=t[i];
rep(j,3){
if(c==g[j]){
if(i<k||l[i-k]!=g[j]){
res+=d[j];
l.push_back(c);
}else{
l.push_back('n');
}
}
}
}
cout<<res<<endl;
}
| 0
| 20,525,560
|
#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) cerr << _x << ", "; cerr << endl
#define dba(a, n) cerr << #a << "="; for (int _i = 0; _i < (n); ++_i) cerr << a[_i] << ", "; cerr << endl
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& x) {
return os << "(" << x.first << "," << x.second << ")";
}
typedef long long ll;
typedef long double ld;
int main() {
int n, L;
scanf("%d%d", &n, &L);
vector<int> A(n);
int p = -1;
for (int i = 0; i < n; ++i) {
scanf("%d", &A[i]);
if (i && A[i] + A[i - 1] >= L) {
p = i - 1;
}
}
if (p == -1) printf("Impossible\n");
else {
vector<int> ans;
for (int j = p; j + 1 < n; ++j) ans.push_back(j + 1);
for (int j = p - 1; j >= 0; --j) ans.push_back(j + 1);
reverse(ans.begin(), ans.end());
printf("Possible\n");
for (int x : ans) printf("%d\n", x);
}
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
ll n;
vector<ll> r(100), c(100);
vector<vector<ll> > dp(101, vector<ll>(101, -1));
int dfs(int v, int w) {
if(dp[v][w] != -1) {
return dp[v][w];
} else {
ll tmp = INT_MAX / 3;
for(int i = v + 1; i < w; i++) {
tmp = min(tmp, dfs(v, i) + dfs(i, w) + r[v] * r[i] * c[w - 1]);
}
dp[v][w] = tmp;
return tmp;
}
}
int main() {
cin >> n;
for(int i = 0; i < n; i++) {
cin >> r[i] >> c[i];
}
for(int i = 0; i < n; i++) {
dp[i][i] = 0;
dp[i][i + 1] = 0;
}
dfs(0, n);
cout << dp[0][n] << endl;
}
| 0
| 100,323,112
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
int X;
cin >> K >> X;
if (X<=K*500) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
int main(){
int n,tmp,rem=-1,ans=0;cin>>n;
for(int i=0;i<n;i++){
cin>>tmp;
if(tmp==rem){
ans++;
rem=-1;
}
else rem=tmp;
}
cout<<ans<<endl;
}
| 0
| 37,936,682
|
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n" : "IMPOSSIBLE\n" )
#define ANS(n) cout << (n) << "\n"
#define REP(i,n) for(int64 i=0;i<(n);++i)
#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)
#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)
#define ALL(obj) (obj).begin(),(obj).end()
#define pii pair<int32,int32>
#define pll pair<int64,int64>
#define pb(a) push_back(a)
#define mp make_pair
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int32 m,k;
cin >> m >> k;
if(k >= (1 << m)){
ANS(-1);
return 0;
}
if(m == 0){
if(k == 0)
ANS("0 0");
return 0;
}
if(m == 1){
if(k == 0){
ANS("0 0 1 1");
}else{
ANS(-1);
}
return 0;
}
REP(i,1<<m){
if(i == k)continue;
cout << i << " ";
}
cout << k << " ";
FORR(i,(1<<m)-1,0){
if(i == k)continue;
cout << i << " ";
}
cout << k << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 9 * 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
}
return ret;
}
ll mod(ll val) {
ll res = val % MOD;
if(res < 0) {
res += MOD;
}
return res;
}
ll dp[2020][2020];
int main() {
int N,M;
cin >> N >> M;
vector<int> S(N);
for(int i = 0;i < N;i++) {
cin >> S.at(i);
}
vector<int> T(M);
for(int i = 0;i < M;i++) {
cin >> T.at(i);
}
for(int i = 0;i < 2020;i++) {
for(int j = 0;j < 2020;j++) {
if(i == 0 || j == 0) {
dp[i][j] = 1;
}
else {
dp[i][j] = 0;
}
}
}
for(int i = 0;i < N;i++) {
for(int j = 0;j < M;j++) {
if(S.at(i) == T.at(j)) {
dp[i + 1][j + 1] = mod(dp[i][j + 1] + dp[i + 1][j]);
}
else {
dp[i + 1][j + 1] = mod(dp[i][j + 1] + dp[i + 1][j] - dp[i][j]);
}
}
}
cout << dp[N][M] % MOD << endl;
}
| 0
| 72,712,488
|
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int a[4]={0},t;
for(int i=0;i<6;i++)
{
cin>>t;
a[t-1]++;
if(a[t-1]==3)
{
cout<<"NO";
return 0;
}
}
cout<<"YES";
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
a.emplace(a.begin(), 0);
a.emplace(a.end(), 0);
n += 2;
auto d = [&](int i, int j) {
return abs(a[i] - a[j]);
};
int sum = 0;
for (int i = 0; i + 1 < n; i++) sum += d(i, i + 1);
for (int i = 1; i + 1 < n; i++) {
cout << sum - d(i - 1, i) - d(i, i + 1) + d(i - 1, i + 1) << endl;
}
return 0;
}
| 0
| 59,542,553
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N = 2e5 + 100;
char s[N];
int main() {
scanf("%s", s + 1);
int num = 0;
long long ans = 0;
int n = strlen(s + 1);
for(int i = 1; i <= n; i++) {
if(s[i] == 'W') {
num++;
ans += i-num;
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string n;
cin >> n;
for(int i=0; i<3; i++){
if(n.at(i) == '1'){
cout << '9';
}else{
cout << '1';
}
}
cout << endl;
return 0;
}
| 0
| 12,644,110
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N;
cin >> N;
string M;
cin >> M;
ll ans;
ll r=0,g=0,b=0;
for(ll i=0;i<N;i++){
if(M[i]=='R'){
r++;
}
if(M[i]=='G'){
g++;
}
if(M[i]=='B'){
b++;
}
if(i==N-1){
ans=r*g*b;
}
}
for(ll i=0;i<N;i++){
for(ll j=i+1;2*j-i<N;j++){
if(M[j]==M[i]){
continue;
}
else{
if(M[2*j-i]!=M[j] && M[2*j-i]!=M[i]){
ans--;
}
}
}
}
cout << ans <<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int d[N];
for (int i = 0; i < N; i++)
{
d[i] = 0;
cin >> d[i];
}
int ans = 0;
for (int i = 0; i < N; i++)
{
for (int j = i + 1; j < N; j++){
ans += d[i] * d[j];
}
}
cout << ans << endl;
return 0;
}
| 0
| 80,947,628
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n,m; cin>>n>>m;
vpll xy(n);
vll xs(n), ys(n);
rep(i,n){
ll x,y; cin>>x>>y;
xy[i]={x,y};
xs[i]=x, ys[i]=y;
}
vsort(xs);
vsort(ys);
ll ans=5*LINF;
rep(i,n){
irep(j,i+1,n){
rep(k,n){
irep(l,k+1,n){
ll cnt=0;
rep(ki,n){
ll x=xy[ki].first, y=xy[ki].second;
if(xs[i]<=x&&x<=xs[j] && ys[k]<=y&&y<=ys[l]) cnt++;
}
if(cnt>=m){
ll s=(xs[j]-xs[i])*(ys[l]-ys[k]);
if(chmin(ans,s)){
}
}
}
}
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n,m,k;cin >>n>>m>>k;
bool flg=false;
for (int i = 0; i <=n; ++i) {
for (int j = 0; j <=m; ++j) {
int now=n*j+m*i-2*i*j;
if(now==k)flg=true;
}
}
if(flg)puts("Yes");
else puts("No");
}
| 0
| 86,227,046
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,x,t,dot;
cin>>n>>x>>t;
dot=n/x;
if (n%x>0){
dot++;
}
cout<<dot*t;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
string s;ll k;cin>>s>>k;
ll n=s.size();
ll dp[110][110][2];
rep(i,110) rep(j,110) rep(k,2) dp[i][j][k]=0;
dp[0][0][0]=1;
rep(i,n){
rep(j,n){
dp[i+1][j+1][1]+=dp[i][j][1]*9;
dp[i+1][j][1]+=dp[i][j][1];
if(s[i]=='0') dp[i+1][j][0]+=dp[i][j][0];
else{
dp[i+1][j][1]+=dp[i][j][0];
dp[i+1][j+1][1]+=dp[i][j][0]*(s[i]-'0'-1);
dp[i+1][j+1][0]+=dp[i][j][0];
}
}
}
cout<<dp[n][k][0]+dp[n][k][1]<<endl;
}
| 0
| 70,311,550
|
#include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+2,0);
for(int i=0;i<n;i++){
cin>>a[i+1];
}
int sum=0;
for(int i=0;i<n+1;i++){
sum+=abs(a[i+1]-a[i]);
}
for(int i=0;i<n;i++){
cout<<sum-abs(a[i+2]-a[i+1])-abs(a[i+1]-a[i])+abs(a[i+2]-a[i]) <<endl;
}
return 0;
}
|
#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;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const ll INF = 4e18;
const long double EPS = 1e-10;
int main() {
int n, K;
cin >> n >> K;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].first >> p[i].second;
vector<int> x(n), y(n);
rep(i, n) {
x[i] = p[i].first;
y[i] = p[i].second;
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
vector<vector<int>> c(n + 1, vector<int>(n + 1, 0));
rep(i, n) {
rep(j, n) {
rep(k, n) {
if (p[i].first == x[j] && p[i].second == y[k]) {
c[j + 1][k + 1]++;
}
}
}
}
rep(i, n) {
rep(j, n) {
c[i + 1][j + 1] += c[i + 1][j] + c[i][j + 1] - c[i][j];
}
}
ll ans = INF;
rep(i, n) {
FOR(j, i, n) {
rep(k, n) {
FOR(l, k, n) {
if (c[j + 1][l + 1] - c[i][l + 1] - c[j + 1][k] + c[i][k] >= K) {
ll rx = max(1, x[j] - x[i]), ry = max(1, y[l] - y[k]);
ans = min(ans, rx * ry);
}
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 26,853,443
|
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <utility>
#include <numeric>
#include <iterator>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
int main()
{
ll a, b, c;
cin >> a >> b >> c;
if (a <= c && c <= b)
{
println("Yes");
}
else
{
println("No");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C;
cin >> A >> B >> C;
bool a=false;
if(A.at(A.size()-1)==B.at(0)){
if(B.at(B.size()-1)==C.at(0)) a=true;
}
if(a)cout << "YES" << endl;
else cout << "NO" << endl;
}
| 0
| 86,192,832
|
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
string s;
ll a[128];
ll ans;
int main()
{
cin>>s;
ll n = s.size();
for(ll i = 0; i < n; i++)
{
a[s[i]]++;
}
for(ll i = 'a'; i <= 'z'; i++)
{
ans -= a[i] * (a[i] - 1) / 2;
}
ans += n * (n - 1) / 2;
printf("%lld\n", ans + 1);
return 0;
}
|
#include <iostream>
#include <stack>
using namespace std;
int main(){
string s;
while(getline(cin,s)){
if(s[0]=='.'&&s.size()==1)break;
stack<char> st;
int flag=1;
for(int i=0;i<s.size();i++){
if(s[i]=='(')st.push('(');
if(s[i]=='[')st.push('[');
if(s[i]==')'){
if(st.empty()!=true&&st.top()=='('){
st.pop();
}else{
flag=0;
break;
}
}
if(s[i]==']'){
if(st.empty()!=true&&st.top()=='['){
st.pop();
}else{
flag=0;
break;
}
}
}
if(flag==1&&st.empty()){
cout<<"yes"<<endl;
}else{
cout<<"no"<<endl;
}
}
return 0;
}
| 0
| 44,853,062
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
#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))
int main(){
int N;
cin>>N;
vector<ll> T(N),A(N);
REP(i,N) cin>>T[i];
REP(i,N) cin>>A[i];
vector<ll> difT(N,-1),difA(N,-1);
difT[0]=T[0];
difA[N-1]=A[0];
REP2(i,1,N){
if(T[i-1]!=T[i]){
difT[i]=T[i];
}
}
REPD2(i,N-2,-1){
if(A[i]!=A[i+1]){
difA[i]=A[i];
}
}
ll ans=1;
bool ok=true;
REP(i,N){
if(difT[i]!=-1&&difA[i]!=-1){
if(difT[i]!=difA[i]) ok=false;
if(difT[i]>A[i]) ok=false;
}
if(difT[i]!=-1&&difA[i]==-1){
if(difT[i]>A[i]) ok=false;
}
if(difT[i]==-1&&difA[i]!=-1){
if(difA[i]>T[i]) ok=false;
}
if(difT[i]==-1&&difA[i]==-1){
ans*=min(A[i],T[i]);
ans%=MOD;
}
}
if(ok) cout<<ans<<endl;
else cout<<0<<endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int N;
vector <pair <int, int> > G[200005];
int root, Cost[200005], A[200005];
bool ok = 1;
void Read()
{
cin >> N;
for(int i = 1; i <= N; i++)
cin >> A[i];
for(int i = 1; i < N; i++)
{
int x, y;
cin >> x >> y;
G[x].push_back(make_pair(y, i));
G[y].push_back(make_pair(x, i));
}
}
void precalcRoot()
{
for(int i = 1; i <= N; i++)
{
if(G[i].size() >= 2)
{
root = i;
break;
}
}
}
void DFS(int node, int father, int e)
{
int val = A[node];
if(G[node].size() > 1)
{
val *= 2;
}
for(int i = 0; i < G[node].size(); i++)
{
int neighb = G[node][i].first, edge = G[node][i].second;
if(neighb == father)
continue;
DFS(neighb, node, edge);
val -= Cost[edge];
}
Cost[e] = val;
if(Cost[e] < 0)
{
ok = 0;
return;
}
}
void Solve()
{
DFS(root, 0, 0);
if(ok == 0)
return;
if(Cost[0] != 0)
{
ok = 0;
return;
}
for(int i = 1; i <= N; i++)
{
if(G[i].size() == 1)
continue;
int sum = 0;
for(int j = 0; j < G[i].size(); j++)
{
int neighb = G[i][j].first, edge = G[i][j].second;
sum += Cost[edge];
}
if(sum % 2 == 1)
{
ok = 0;
return;
}
for(int j = 0; j < G[i].size(); j++)
{
int neighb = G[i][j].first, edge = G[i][j].second;
if(sum / 2 < Cost[edge])
{
ok = 0;
return;
}
}
}
}
int main()
{
Read();
if(N == 2)
{
if(A[1] == A[2])
{
cout << "YES\n";
return 0;
}
cout << "NO\n";
return 0;
}
precalcRoot();
Solve();
if(ok == 0)
{
cout << "NO\n";
}
else
cout << "YES\n";
return 0;
}
| 0
| 73,503,248
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin>>N>>M;
vector<vector<bool>>C(N,vector<bool>(N,false));
for(int i=0;i<M;i++){
int a,b; cin>>a>>b;
C[a-1][b-1]=true;
C[b-1][a-1]=true;
}
int count=1;
for(int i=1;i<N;i++)count*=i;
int ans=0;
vector<int>B(N);
for(int i=0;i<N;i++)B[i]=i+1;
for(int i=0;i<count;i++){
for(int j=1;j<N;j++){
if(!C[B[j]-1][B[j-1]-1])break;
if(j==N-1)ans++;
}
next_permutation(B.begin(),B.end());
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll q,h,s,d;
cin >> q >> h >> s >> d;
q *= 4;
h *= 2;
ll n;
cin >> n;
s = min({q,h,s});
ll ans;
if(s*2<=d){
ans = n*s;
}else if(n%2==1){
ans = d*(n/2) + s;
}else{
ans = d*(n/2);
}
cout << ans << endl;
return 0;
}
| 0
| 39,621,649
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
#ifdef LOCAL
#include "/media/brayand/BrayanD/debugger.h"
#else
#define db(...) false
#define dbl(...) false
#define dbg(...) false
#endif
const int MAXN = 1e5 + 100;
bool mk[MAXN];
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int N, X, M;
cin >> N >> X >> M;
int cont = 0;
int sum = 0;
int pt = X;
for(int i = 1 ; i <= min(N, M) ; i++)
{
if(mk[pt])
{
break;
}
mk[pt] = true;
sum += pt;
cont++;
pt = pt*pt % M;
}
N -= cont;
db(pt);
db(sum);
db(cont);
for(int i = 0 ; i < MAXN ; i++)
{
mk[i] = false;
}
int sumtemp = 0;
cont = 0;
for(int i = 1 ; ; i++)
{
if(mk[pt])
{
break;
}
mk[pt] = true;
sumtemp += pt;
cont++;
pt = pt*pt % M;
}
sum += (N/cont)*sumtemp;
N %= cont;
for(int i = 0 ; i < MAXN ; i++)
{
mk[i] = false;
}
for(int i = 1 ; i <= N; i++)
{
if(mk[pt])
{
break;
}
mk[pt] = true;
sum += pt;
pt = pt*pt % M;
}
cout << sum << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pair;
const int INF = 0x3fffffff;
int N;
char S[200001];
int type[200001];
int dp[200001];
int nxt[200001];
queue<int> qs[200001];
vector<int> es[200001];
map<int, vector<int>> belong;
int main() {
scanf("%s", S);
N = strlen(S);
type[0] = 0;
belong[0].emplace_back(0);
int bit = 0;
for (int i=0; i<N; i++) {
es[i].reserve(26);
bit ^= (1 << int(S[i]-'a'));
belong[bit].emplace_back(i+1);
type[i+1] = bit;
}
for (auto &itr : belong) {
auto &v = itr.second;
if (v.empty()) continue;
for (int i=0; i<v.size()-1; i++) {
nxt[v[i]] = v[i+1];
}
for (int j=0; j<26; j++) {
int t = itr.first ^ (1<<j);
auto &vec = belong[t];
auto itr = upper_bound(vec.begin(), vec.end(), v.front());
if (itr == vec.end()) continue;
for (int g : v) {
while (itr != vec.end() && *itr < g) itr++;
if (itr == vec.end()) break;
es[g].emplace_back(*itr);
}
}
}
fill(dp, dp+N+1, INF);
dp[0] = 0;
qs[0].push(0);
for (int i=0; i<N; i++) {
while (!qs[i].empty()) {
int v = qs[i].front(); qs[i].pop();
if (v == N) continue;
if (nxt[v] != -1) {
int u = nxt[v];
if (dp[u] > dp[v]) {
dp[u] = dp[v];
qs[i].push(u);
}
}
for (int u : es[v]) {
if (dp[u] > dp[v]+1) {
dp[u] = dp[v]+1;
qs[i+1].push(u);
}
}
}
}
if (!dp[N]) dp[N]++;
printf("%d\n", dp[N]);
}
| 0
| 39,632,656
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[j]) * (x[i] - x[j]);
int dy = (y[i] - y[j]) * (y[i] - y[j]);
return sqrt(dx+dy);
}
int main(){
int a,b,c;
cin >> a >> b >> c;
int x(min({a,b,c}));
int z(max({a,b,c}));
int y(a+b+c-x-z);
int ans(0);
if(z%2==x%2 && x%2==y%2){
int t = min(z-x,z-y);
ans += t;
x += t; y += t;
ans += max(z-x,z-y)/2;
}else if(x%2==y%2){
ans = z-y + (y-x)/2;
}else{
if(z%2==x%2){
ans++; z++; x++;
ans += z-y + (y-x)/2;
}else{
ans++; z++; y++;
ans += z-y + (y-x)/2;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
#define rep(i,n) for (int i=0, i##_len=(n); i<i##_len; ++i)
#define SZ(x) ((int)(x).size())
#define all(x) begin(x),end(x)
template<class T>
bool chmax(T& a, const T& b) {
if (a < b) { a = b; return true; }
return false;
}
template<class T>
bool chmin(T& a, const T& b) {
if (b < a) { a = b; return true; }
return false;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "[";
for (auto& e : v) os << e << ", ";
return os << "]";
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
return os << "(" << p.first << " " << p.second << ")";
}
template<typename T>
T inf() { return numeric_limits<T>::max(); }
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int,int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
const ll MOD = 1e9+7;
const ld EPS = 1e-9;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
for (;;) {
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if (n == 0) break;
vi y(n);
rep (i, n) cin >> y[i];
int now = 0, ans = -1;
rep (i, 10001) {
if (y[now] == x) {
if (++now == n) {
ans = i;
break;
}
}
x = (a * x + b) % c;
}
cout << ans << endl;
}
return 0;
}
| 0
| 69,059,429
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a+3);
int ans = 0;
ans += a[2]-a[1];
a[0] += ans;
a[1] += ans;
ans += ((a[2]-a[0])/2)+((a[2]-a[0])%2)+((a[2]-a[0])%2);
cout << ans << '\n';
return 0;
}
|
#include<iostream>
#include<list>
using namespace std;
int main()
{
list<int> l;
int n;
cin>>n;
char s[20];
int value;
for(int j=0;j<n;j++)
{
cin>>s;
if(s[0]=='i')
{
cin>>value;
l.push_front(value);
}else if(s[6]=='F')
{
l.pop_front();
}else if(s[6]=='L')
{
l.pop_back();
}else
{
cin>>value;
for(list<int>::iterator ite=l.begin();ite!=l.end();ite++)
{
if(*ite==value)
{
l.erase(ite);
break;
}
}
}
}
int i=0;
for(list<int>::iterator ite=l.begin();ite!=l.end();ite++,i++)
{
if(i)
{
cout<<" ";
}
cout<<*ite;
}
cout<<endl;
return 0;
}
| 0
| 87,236,116
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for(int i=0; i<N; i++) {
int a;
cin >> a;
if(a>0)
pls.push_back(a);
else
mns.push_back(a);
}
sort(mns.begin(), mns.end());
sort(pls.begin(), pls.end());
reverse(pls.begin(), pls.end());
if(pls.size() == 0) {
int k = mns.back();
mns.pop_back();
pls.push_back(k);
}
if(mns.size() == 0) {
int k = pls.back();
pls.pop_back();
mns.push_back(k);
}
vector<PII> output;
while(pls.size() >= 2) {
int k = mns.back();
mns.pop_back();
int j = pls.back();
pls.pop_back();
output.push_back(PII(k, j));
k -= j;
mns.push_back(k);
}
while(mns.size() >= 1) {
int k = pls.back();
pls.pop_back();
int j = mns.back();
mns.pop_back();
output.push_back(PII(k, j));
k -= j;
pls.push_back(k);
}
cout << pls[0] << endl;
for(auto elem: output) {
int a = elem.first;
int b = elem.second;
cout << a << " " << b << endl;
}
return 0;
}
|
#include <iostream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <numeric>
#include <cmath>
#include <cctype>
#include <unordered_map>
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 FILL(a,x); REP(i,sizeof(a)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(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 );}
int __stoi(string s){ return atoi(s.c_str()); }
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 main(){
int N; cin>>N;
umap<int,int> mp;
for(int i=2;i<=N;++i){
int temp = i;
while(temp>1){
for(int x=2;x<=temp;++x){
if(temp%x==0){
++mp[x];
temp /= x;
break;
}
}
}
}
int over74 = 0;
int over24 = 0;
int over14 = 0;
int over4 = 0;
int over2 = 0;
for(int i=2;i<N;++i){
if(mp[i]>=74){++over74;}
if(mp[i]>=24){++over24;}
if(mp[i]>=14){++over14;}
if(mp[i]>=4){++over4;}
if(mp[i]>=2){++over2;}
}
int ans = 0;
ans += over74;
ans += over24*(over2-1);
ans += over14*(over4-1);
ans += over4*(over4-1)/2*(over2-2);
cout << ans << "\n";
}
| 0
| 4,091,141
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,k;
cin>>n>>k;
bool ac[100010]={false};
ll wa[100010]={};
ll ans=0;
for(ll i=0;i<k;i++){
ll x;string s;
cin>>x>>s;
x--;
if(ac[x]){
continue;
}
if(s=="AC"){
ac[x]=true;
ans++;
}
else{
wa[x]++;
}
}
ll cnt=0;
for(ll i=0;i<n;i++){
if(ac[i]){
cnt+=wa[i];
}
}
cout << ans<<" "<<cnt;
return 0;
}
|
#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 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 TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
double a,b,x;
cin >> a >> b >> x;
if(x > a*a*b / 2){
double tan = 2*(a*a*b - x) / (a*a*a);
double res = atan(tan);
res = res * (180 / M_PI);
printf("%.12lf\n",res);
}
else{
double tan = (a * b * b) / (2 * x);
double res = atan(tan);
res = res * (180 / M_PI);
printf("%.12lf\n",res);
}
return 0;
}
| 0
| 72,307,740
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
const int NIL = -1;
struct Node { int parent, left, right;};
struct Node T[MAX];
int n, D[MAX];
void print(int u) {
cout << "node " << u << ": ";
cout << "parent = " << T[u].parent << ", ";
cout << "depth = " << D[u] << ", ";
if (T[u].parent == NIL) cout << "root, ";
else if (T[u].left == NIL) cout << "leaf, ";
else cout << "internal node, ";
cout << "[";
int cur = T[u].left;
while (cur != NIL) {
cout << cur;
cur = T[cur].right;
if (cur == NIL) break;
cout << ", ";
}
cout << "]" << endl;
}
void rec(int u, int p) {
D[u] = p;
if (T[u].right != NIL) rec(T[u].right, p);
if (T[u].left != NIL) rec(T[u].left, p + 1);
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
T[i].parent = T[i].left = T[i].right = NIL;
}
for (int i = 0; i < n; i++) {
int u, m;
cin >> u >> m;
int prev = NIL;
for (int j = 0; j < m; j++) {
int c;
cin >> c;
T[c].parent = u;
if (prev == NIL) T[u].left = c;
else T[prev].right = c;
prev = c;
}
}
int root = NIL;
for (int i = 0; i < n; i++) {
if (T[i].parent == NIL) {
root = i;
break;
}
}
rec(root, 0);
for (int i = 0; i < n; i++) {
print(i);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> v) {os << "(" << v.first << ", " << v.second << ")"; return os;}
void solve() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(all(A));
int ii, jj;
for (int i = 1; i < N; i++) {
int j = lower_bound(all(A), A[i] / 2) - A.begin();
double mi = 1e9 + 10;
if (i != j + 1 && j + 1 < N) {
if (mi > fabs(A[i] / 2.0 - A[j + 1])) {
mi = fabs(A[i] / 2.0 - A[j + 1]);
ii = i;
jj = j + 1;
}
}
if (i != j - 1 && j - 1 >= 0) {
if (mi > fabs(A[i] / 2.0 - A[j - 1])) {
mi = fabs(A[i] / 2.0 - A[j - 1]);
ii = i;
jj = j - 1;
}
}
if (i != j && mi > fabs(A[i] / 2.0 - A[j])) {
mi = fabs(A[i] / 2.0 - A[j]);
ii = i;
jj = j;
}
}
cout << A[ii] << " " << A[jj] << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
return 0;
}
| 0
| 13,758,444
|
#include <bits/stdc++.h>
int main() {
int h, w, d;
char t[] = { 'R', 'Y', 'G', 'B' };
std::cin >> h >> w >> d;
std::vector<std::vector<int>> b(500, std::vector<int>(500));
if (d % 2) {
for (int i = 0; i < 500; i++) {
for (int j = 0; j < 500; j++) {
b[i][j] = (i + j) % 2;
}
}
} else {
for (int i = 0; i < 500; i++) {
for (int j = 0; j < 500; j++) {
int p = (i - j + 500 * d) % (d * 500) / d % 2,
q = (i + j) / d % 2;
b[i][j] = (p << 1) + q;
}
}
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) std::cout << t[b[i][j]];
std::cout << std::endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define L(a) scanf("%lld",&a)
#define L2(a,b) scanf("%lld%lld",&a,&b)
#define L3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define PI(a) printf("%d",a)
#define PL(a) printf("%lld",a)
#define PT(t) printf("Case %d: ",t)
#define PB push_back
#define x first
#define y second
#define xx first.first
#define xy first.second
#define yx second.first
#define yy second.second
#define SC scanf
#define PC printf
#define NL printf("\n")
#define SET(a) memset(a,0,sizeof a)
#define SETR(a) memset(a,-1,sizeof a)
#define SZ(a) ((int)a.size())-1
#define f(i,a,b) for(int i=a;i<=b; i++)
#define fr(i,a,b) for(int i=a;i<=b; i++)
#define frr(i,a,b) for(int i=a;i>=b; i--)
#define frv(i,a) for(int i=0;i<a.size();i++)
#define pi 2.0*acos(0.0)
#define R(a) freopen(a, "r", stdin);
#define W(a) freopen(a, "w", stdout);
#define CB(x) __builtin_popcount(x)
#define STN(a) stringtonumber<ll>(a)
#define lol printf("BUG\n")
#define Endl "\n"
#define mk make_pair
using namespace std;
template <class T> inline T BM(T p, T e, T M)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T mul(T p, T e, T M)
{
ll ret = 0;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret + p) ;
p = (p + p) ;
if(ret>=M)ret-=M;
if(p>=M)p-=M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b)
{
if(b == 0)return a;
return gcd(b, a % b);
}
template <class T> inline T mdINV(T a, T M)
{
return BM(a, M - 2, M);
}
template <class T> inline T PW(T p, T e)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T>bool ISLEFT(T a, T b, T c)
{
if(((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)return 1;
else return 0;
}
#define mx 200004
#define base 193ll
typedef pair<int,int >P;
#define F(i,a,b) for(int i=a;i<b; i++)
#define LL long long
#define MX 200007
#define md 998244353ll
int main(){
int n;
I(n);
set<string > s;
string s1;
string a[n+2];
cin>> a[1];
s.insert(a[1]);
bool fl = 0;
for(int i = 2;i <= n;i ++){
cin>>a[i];
int l = a[i-1].size();
if(a[i][0] != a[i-1][l-1]){
fl = 1;
}
s.insert(a[i]);
}
if( s.size() != n)fl = 1;
if(!fl)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| 0
| 17,187,644
|
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL<<60;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
int ans = s.size() + t.size();
int tot = 0;
for(int i = n - 1; i >= 0; i--) {
bool check = true;
for(int j = i; j < n; j++) {
if(s[j] != t[j - i]) check = false;
}
if(check) tot = n - i;
}
cout << ans - tot << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
rep(i,n) cin >> h[i];
ll ans = 0;
for (ll i = 0; i < n;) {
ll t = 0, j = i+1;
for(; j < n; j++) {
if (h[j-1] < h[j]) break;
++t;
}
ans = max(ans, t);
i += t+1;
}
cout << ans << endl;
return 0;
}
| 0
| 91,666,824
|
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int x, y;
cin >> x >> y;
int ans = 0;
if( x != 0 && y != 0 && x != y && abs(x) == abs(y) ) ans++;
else if( x > y ) {
if( (x < 0 && y < 0) || (x > 0 && y > 0) ) {
ans += abs(x - y);
ans += 2;
} else if( x >= 0 && y <= 0 ) {
ans++;
ans += abs(x - abs(y));
}
} else if( x < y ) {
if( (x <= 0 && y <= 0) || (x >= 0 && y >= 0) ) {
ans += abs(y - x);
} else if( x < 0 && y > 0 ) {
ans += abs(abs(x) - y);
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
int n = s.size();
rep(bit, 1 << n - 1)
{
int sum = s[0] - '0';
vector<char> op(n - 1);
rep(i, n - 1)
{
if (bit & (1 << i))
{
sum += s[i + 1] - '0';
op[i] = '+';
}
else
{
sum -= s[i + 1] - '0';
op[i] = '-';
}
}
if (sum == 7)
{
int j = 1;
rep(i, n - 1)
{
s.insert(s.begin() + j, op[i]);
j += 2;
}
cout << s << "=7" << endl;
break;
}
}
}
| 0
| 255,807
|
#include<stdio.h>
int main(void) {
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
if(x < y && y < z) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
|
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
static char buf[20];
int len=0;
if(x<0)putchar('-'),x=-x;
for(;x;x/=10)buf[len++]=x%10+'0';
if(!len)putchar('0');
else while(len)putchar(buf[--len]);
}
inline void writesp(ll x){write(x); putchar(' ');}
inline void writeln(ll x){write(x); putchar('\n');}
int a[maxn],pos[maxn];
int n,L;
int main()
{
n=read(); L=read();
for(int i=1;i<=n;i++)
a[i]=read();
for(int i=1;i<n;i++)
if(a[i]+a[i+1]>=L){
puts("Possible");
for(int j=1;j<i;j++)
writeln(j);
for(int j=n-1;j>i;j--)
writeln(j);
writeln(i);
return 0;
}
puts("Impossible");
return 0;
}
| 0
| 25,381,796
|
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
string s;
ll k;
cin >> s >> k;
vector<pair<char,ll>> z;
set<char> se;
rep(i,sz(s))
{
se.insert(s[i]);
pair<char,ll> one;
if(i == 0)
{
one.first = s[i];
one.second = 1;
z.push_back(one);
}
else
{
one = z[sz(z) - 1];
if(one.first == s[i])
{
z[sz(z) - 1].second++;
}
else
{
one.first = s[i];
one.second = 1;
z.push_back(one);
}
}
}
ll ans = 0;
if(sz(se) == 1)
{
ll len = sz(s);
ans = len * k / 2;
}
else
{
ll once = 0;
rep(i,sz(z))
{
once += z[i].second / 2;
}
ans = once * k;
if(s[0] == s[sz(s) - 1])
{
ll minus = (z[0].second + z[sz(z) - 1].second) / 2 - z[0].second / 2 - z[sz(z) - 1].second / 2;
ans += minus * (k - 1);
}
}
cout << ans << endl;
return 0;
}
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
#define pll pair<ll,ll>
#define pii pair<int,int>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define TEST ll t;cin>>t;while(t--)
ll sizes[100001];
ll arr[100001];
bool ok=true;
ll A[100001];
pll B[100001];
ll root(ll i){
while(i!=arr[i]) i=arr[i];
return(i);
}
void Union(ll i,ll j){
ll root_i=root(i),root_j=root(j);
if(root_i==root_j) return;
if(sizes[root_i]>sizes[root_j]) swap(root_i,root_j);
sizes[root_j]+=sizes[root_i];
arr[root_i]=arr[root_j];
return;
}
bool prime[10000];
vector<ll> v;
void era(){
memset(prime,true,sizeof prime);
for(ll p=2;p*p<=10000;p++){
if(prime[p]){
for(ll q=p*p;q<=10000;q+=p){
prime[q]=false;
}
}
}
return;
}
ll count_div[101];
void cnt(ll N){
for(ll i=0;i<v.size();i++){
if(v[i]>N) break;
while(N%v[i]==0){
N/=v[i];
count_div[v[i]]++;
}
}
return;
}
int main(){
IO
ofstream fout("a.out");
ll N,ans=0;
cin>>N;
memset(count_div,0,sizeof count_div);
era();
for(ll i=2;i<=100;i++) if(prime[i]) v.push_back(i);
for(ll i=2;i<=N;i++) cnt(i);
ll M=v.size();
for(ll i=0;i<M;i++) if(count_div[v[i]]+1>=75) ans++;
for(ll i=0;i<M;i++){
for(ll j=0;j<M;j++){
if(i==j) continue;
if(count_div[v[i]]+1>=3 && count_div[v[j]]+1>=25) {
ans++;
}
if(count_div[v[i]]+1>=5 && count_div[v[j]]+1>=15) {
ans++;
}
}
}
for(ll i=0;i<M;i++)
for(ll j=i+1;j<M;j++)
for(ll k=0;k<M;k++){
if(i==j || j==k || i==k) continue;
if(count_div[v[i]]+1>=5 && count_div[v[j]]+1>=5 && count_div[v[k]]+1>=3) {
ans++;
}
}
cout<<ans;
return(0);
}
| 0
| 60,215,653
|
#include<iostream>
using namespace std;
int main(){
int num[100] = {0}, max = 0, input;
while(cin>>input){
num[input-1]++;
}
for(int i=0;i<100;i++){
if(max<num[i])
max = num[i];
}
for(int i=0;i<100;i++){
if(max == num[i])
cout << i+1 << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<map>
#define ran(x) (x).begin(),(x).end()
using namespace std;
int main() {
string s,t;
cin >> s;
for(int i = 0; i < s.size(); ++i) {
if(s[i] == 'B') {
if(t.size() > 0)
t.pop_back();
}
else
t.push_back(s[i]);
}
cout << t << endl;
}
| 0
| 39,789,212
|
#include<cstdio>
using namespace std;
const int maxn=10+2;
char str[maxn];
int main(){
scanf("%s",str+1);
if (str[1]=='Y'&&str[2]=='A'&&str[3]=='K'&&str[4]=='I') printf("Yes");
else printf("No");
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
for(int i = 0; i < s.size(); i++){
string tmp = s;
for(int j = 0; j < s.size(); j++){
tmp[j] = s[(j+i)%s.size()];
}
if(tmp == t){
puts("Yes");
return 0;
}
}
puts("No");
return 0;
}
| 0
| 66,900,266
|
#include <iostream>
int main() {
int N, K;
std::cin >> N >> K;
int M = N * (N - 1) / 2 - K;
if (M < N - 1) {
std::cout << "-1\n";
return 0;
}
std::cout << M << "\n";
for (int i = 2; i <= N; i++)
std::cout << 1 << " " << i << "\n";
int count = N - 1;
for (int i = 2; i <= N - 1; i++)
for (int j = i + 1; j <= N; j++) {
if (M <= count)
break;
std::cout << i << " " << j << "\n";
count++;
}
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
int a, b, c, d;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c >> d;
for(int i = 0; i <= d; i++)
for(int j = 0; j <= d - i; j++)
for(int k = 0; k <= d - i - j; k++)
if(a * (1 << i) < b * (1 << j) && b * (1 << j) < c * (1 << k)){
cout << "Yes\n";
return 0;
}
cout << "No\n";
return 0;
}
| 0
| 26,364,589
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
class Solution {
public:
vector<pair<int,int>> solve(int n, int K) {
int N = (n - 1) * (n - 2) / 2;
if (K > N) {
return {};
}
vector<pair<int,int>> res;
for (int i = 1; i < n; ++i) {
res.emplace_back(0, i);
}
for (int i = 1; i < n && K < N; ++i) {
for (int j = i + 1; j < n && K < N; ++j) {
res.emplace_back(i, j);
--N;
}
}
return res;
}
};
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
int k;
cin >> n >> k;
Solution sol;
auto res = sol.solve(n, k);
if (res.empty()) {
cout << -1 << "\n";
} else {
cout << res.size() << "\n";
for (auto& r : res) {
cout << r.first + 1 << " " << r.second + 1 << "\n";
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn = 10;
const int maxe = 100;
int ecnt;
struct Edge{
int to;
int val;
int nxt;
}edge[maxe];
int node[maxn];
void init()
{
memset(node,-1,sizeof node);
ecnt = 0;
}
void addedge(int from,int to,int val)
{
edge[ecnt].nxt = node[from];
edge[ecnt].to = to;
edge[ecnt].val = val;
node[from] = ecnt++;
}
int d[maxn];
int V;
const int INF = 0x3f3f3f3f;
bool bellman_ford(int s){
for(int i=0;i<V;++i) d[i]=INF;
d[s]=0;
bool update;int now;
for(int i=0;i<V;++i){
update=false;
for(int j=0;j<V;++j){
now=node[j];
while(now!=-1)
{
Edge &e=edge[now];
if(d[e.to]>d[j]+e.val)
{
d[e.to]=d[j]+e.val;
update=true;
}
now=e.nxt;
}
}
if(!update) return false;
}
return true;
}
bool vis[maxn];
int D[maxn];
int main()
{
ios::sync_with_stdio(false);
int m;
V=10;
while(cin>>m&&m)
{
init();
int u,v,w;
memset(vis,0,sizeof vis);
while(m--)
{
cin>>u>>v>>w;
addedge(u,v,w);
addedge(v,u,w);
vis[u]=vis[v]=true;
}
for(int i=0;i<10;++i)
{
if(!vis[i]) continue;
D[i]=0;
bellman_ford(i);
for(int j=0;j<10;++j)
if(vis[j])
D[i]+=d[j];
}
int sm=0;
for(int i=1;i<10;++i) if(vis[i]&&D[sm]>D[i]) sm=i;
cout<<sm<<" "<<D[sm]<<endl;
}
return 0;
}
| 0
| 28,027,189
|
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) {return (!b ? a : gcd(b, a % b));}
bool cmp(int a,int b){return a>b;}
const ll mod = 1e9 + 7;
const int INF32 = 1<<30;
const ll INF64 = 1LL<<60;
const ld pi = 3.141592653589793;
void solve(){
vector<int>a(3);
for(int i = 0;i<3;i++) cin >> a[i];
sort(a.rbegin(),a.rend());
cout <<a[0]*10+a[1]+a[2]<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
solve();
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1;
return right;
}
vector<ll> prime;
void Prime(ll n){
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
#define MOD ((ll)1e+9 + 7)
int main(){
int n,m;
cin>>n>>m;
vector<int> a(m);
rep(i,m){
cin>>a[i];
if(i!=0){
}
}
vector<ll> cnt(n+1,0);
cnt[0]=1;
int c=0;
rep(i,n+1){
cnt[i]%=MOD;
if(c<m && a[c]==i){
c++;
continue;
}
if(i+1<=n){
cnt[i+1]+=cnt[i];
}
if(i+2<=n){
cnt[i+2]+=cnt[i];
}
}
cout<<cnt[n]<<endl;
return 0;
}
| 0
| 65,268,803
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
bool ans=true;
int x=0;
int y=0;
int t=0;
for(int i=0;i<n;i++)
{
int it,ix,iy;
cin>>it>>ix>>iy;
int tt=it-t;
int dd=abs(x-ix)+abs(y-iy);
if(tt==dd||(tt>dd&&abs(dd-tt)%2==0))
{
x=ix;
y=iy;
t=it;
}
else
{
ans=false;
}
}
puts(ans?"Yes":"No");
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;
using ll = long long;
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; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
constexpr int INF = 1e9 + 5;
constexpr long long INFLL = 1LL << 62;
constexpr double eps = (1e-9);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
vector<ll> lu;
queue<ll> q;
for (int i = 1; i <= 9; i++) {
lu.push_back(i);
q.push(i);
}
while (lu.size() < k && !q.empty()) {
ll n = q.front(); q.pop();
ll b = n % 10;
ll ne = n * 10;
if (b != 0) {
lu.push_back(ne + b - 1LL);
q.push(ne + b - 1LL);
}
lu.push_back(ne + b);
q.push(ne + b);
if (b != 9) {
lu.push_back(ne + b + 1LL);
q.push(ne + b + 1LL);
}
}
cout << lu[k-1] << endl;
return 0;
}
| 0
| 84,754,989
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i,a) for(int i=0;i<(a);++i)
#define clr(a,v) memset((a),(v),sizeof(a))
const int MAX_H = 24, MAX_M = 60, MAX_S = 60;
int n;
int S[MAX_H*MAX_M*MAX_S];
int main()
{
while( scanf( "%d", &n ), n )
{
clr( S, 0 );
rep( i, n )
{
int hh, mm, ss;
scanf( "%d:%d:%d", &hh, &mm, &ss );
++S[hh*60*60+mm*60+ss];
scanf( "%d:%d:%d", &hh, &mm, &ss );
--S[hh*60*60+mm*60+ss];
}
int ans = S[0];
rep( i, MAX_H*MAX_M*MAX_S-1 )
{
S[i+1] += S[i];
ans = std::max( ans, S[i+1] );
}
printf( "%d\n", ans );
}
return 0;
}
|
#include <cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
while(true){
int n,m,p,all=0,y=-1;
scanf("%d%d%d",&n,&m,&p);
if(n==0) break;
rep(i,n){
int x;
scanf("%d",&x);
if(i+1==m) y=x;
all+=x*100;
}
if(y==0){
printf("0\n");
continue;
}
printf("%d\n",all*(100-p)/100/y);
}
return 0;
}
| 0
| 26,107,155
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans{0};
for(int i=0;i<3;i++){
if(s[i] == 'R') ans = 1;
}
for(int i=1;i<3;i++){
if(s[i-1] == s[i] && s[i] == 'R') ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define repr(i, a, n) for (ll i = n - 1; (ll)a <= i; i--)
#define lb lower_bound
#define ub upper_bound
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll INF = 1000000099;
const ll LINF = (ll)(1e18 + 99);
vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T>
T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T>
T mpow(T a, T n)
{
T res = 1;
for (; n; n >>= 1)
{
if (n & 1)
res = res * a;
a = a * a;
}
return res;
}
signed main()
{
int n, nowmx = 0;
cin >> n;
vector<ll> v(n), ans(n, 0);
vector<int> mx(n, 0);
rep(i, 0, n)
{
cin >> v[i];
if (nowmx < v[i])
{
mx[i] = i;
nowmx = v[i];
}
else
{
mx[i] = mx[i - 1];
}
}
int mxi = mx[n - 1], ind = n - 1, nmxi = mxi, cnt = 0, pmxi=0;
priority_queue<ll> q;
while (1)
{
if (0 < mxi)
{
nmxi = mx[mxi - 1];
}
else
{
while (mxi < ind)
{
ans[0]+=v[ind];
ind--;
}
while (!q.empty())
{
ans[0] += q.top();
q.pop();
}
ans[0] += v[0];
ans[0] += (v[mxi]) * cnt;
break;
}
ans[mxi] += (v[mxi] - v[nmxi]) * cnt;
while (mxi < ind)
{
if (v[nmxi] <= v[ind])
{
ans[mxi] += v[ind] - v[nmxi];
cnt++;
}
else
{
q.push(v[ind]);
}
ind--;
}
ind--;
while (!q.empty() && q.top() > v[nmxi])
{
ans[mxi] += q.top() - v[nmxi];
q.pop();
cnt++;
}
ans[mxi] += v[mxi] - v[nmxi];
cnt++;
pmxi = mxi;
mxi = nmxi;
}
rep(i, 0, n) cout << ans[i] << endl;
}
| 0
| 12,141,881
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <iomanip>
#include <map>
#include <queue>
#include <tuple>
using namespace std;
typedef long long ll;
typedef tuple<int,int,int> P;
int main(){
int A[3][3];
for(int i=0;i<3; i++){
for(int j=0; j<3; j++){
cin >> A[i][j];
}
}
int N;
cin >> N;
for(int i=0; i<N; i++){
int b;
cin >> b;
for(int i=0;i<3; i++){
for(int j=0; j<3; j++){
if(A[i][j]==b)A[i][j]=-1;
}
}
}
bool flag=false;
for(int i=0; i<3; i++){
if(A[i][0]==-1 && A[i][1]==-1 && A[i][2]==-1) flag=true;
if(A[0][i]==-1 && A[1][i]==-1 && A[2][i]==-1) flag=true;
}
if(A[0][0]==-1 && A[1][1]==-1 && A[2][2]==-1) flag=true;
if(A[2][0]==-1 && A[1][1]==-1 && A[0][2]==-1) flag=true;
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin >> n;
vl a(n);
rep(i,0,n) {
cin >> a[i];
}
ll k = 2;
ll ret = a[0] - 1;
rep(i,1,n) {
if(k == a[i]) {
k++;
} else if(k < a[i]) {
if(a[i]%k) {
ret += a[i]/k;
} else {
ret += (a[i]/k)-1;
}
}
}
cout << ret << '\n';
return 0;
}
| 0
| 44,259,547
|
#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long int li;
typedef long long ll;
typedef long double ld;
int main()
{
ll r, g, b, k;
cin >> r >> g >> b >> k;
ll s = 0;
while (g <= r)
{
g *= 2;
s++;
}
while (b <= g)
{
b *= 2;
s++;
}
if (s <= k)
cout << "Yes\n";
else
cout << "No\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int n, m, a[101], sum, temp, i, c;
int main()
{
cin >> n >> m;
for(i=0;i<n;i++)
{
cin >> a[i];
sum += a[i];
}
sort(a, a+n);
temp = sum /(4*m) + (sum%(4*m)>0);
for(i=0;i<n;i++)
{
if(a[i]>=temp)
c++;
}
if(c>=m)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 0
| 79,844,206
|
#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
#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 Rep(i, n) for (long long i = 0; i< (long long)(n); i++)
#define RRep(i,n) for (long long i = ((long long)(n)-1); i>=0; i--)
#define all(v) (v).begin(),(v).end()
struct Edge{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w){ }
};
using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
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>
T gcd(T a, T b){
if( b==0 ) return a;
return gcd(b, a%b);
}
template <class T>
T lcm(T a, T b){
return (a*b)/gcd(a,b);
}
const int INF = 1e9+7;
vector<int> dx = {-1,0,1,0};
vector<int> dy = {0,-1,0,1};
int main(){
int n,m;
cin >> n >> m;
vector<int> c(n,0);
rep(i,m){
int a,b;
cin >> a >> b;
c[a-1]++;
c[b-1]++;
}
rep(i,n){
if(c[i]%2==1){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
using pll = pair<long, long>;
#define fix20 cout << fixed << setprecision(20);
#define rep(i,n) for(int i=0; i<(int)(n);i++)
#define MOD 1000000007
int main(){
int a,b;
cin >> a >> b;
a--;b--;
vector<vector<char>> data1(50,vector<char>(100,'.'));
vector<vector<char>> data2(50,vector<char>(100,'#'));
rep(i,(a/50)+1){
long tmp;
if(i == a/50) tmp = a%50;
else tmp = 50;
rep(j,tmp){
data2[i*2][j*2] = '.';
}
}
rep(i,(b/50)+1){
long tmp;
if(i == b/50) tmp = b%50;
else tmp = 50;
rep(j,tmp){
data1[i*2][j*2] = '#';
}
}
cout << 100 << " " << 100 << endl;
rep(i,50){
rep(j,100) cout << data1[i][j];
cout << endl;
}
rep(i,100) cout << "#";
cout << endl;
rep(i,49){
rep(j,100) cout << data2[i][j];
cout << endl;
}
}
| 0
| 82,130,036
|
#include<bits/stdc++.h>
using namespace std;
int mod=1e9+7;
int solve(vector<string>& graph, int R, int C){
vector<vector<int>> ans(R,vector<int>(C,0));
for (int i=0;i<R;i++){
if (graph[i][0]=='#') break;
else ans[i][0]=1;
}
for (int i=0;i<C;i++){
if (graph[0][i]=='#') break;
else ans[0][i]=1;
}
for (int i=1;i<R;i++){
for (int j=1;j<C;j++){
if (graph[i][j]!='#'){
ans[i][j]=(ans[i-1][j]%mod+ans[i][j-1]%mod)%mod;
}
}
}
return ans[R-1][C-1];
}
signed main() {
int R,C;
cin>>R>>C;
vector<string> graph(R);
for (int i=0;i<R;i++){
cin>>graph[i];
}
cout<< solve(graph,R,C)<<endl;
return 0;
}
|
#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; }
vector<string> vec;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
string S,T;
cin >> S>>T;
bool flag = true;
bool flag1 = true;
if(S.size()<T.size()){
cout << "UNRESTORABLE" << endl;
}
else{
REP(i,S.size()-T.size()+1){
REP(j,T.size()){
char S_tmp = S.at(i + j);
char T_tmp = T.at(j);
flag = true;
if(S_tmp=='?'){
}
else if(S_tmp==T_tmp){
}
else{
flag = false;
break;
}
}
if(flag){
string U = S;
REP(j,T.size()){
U.at(i + j) = T.at(j);
}
REP(j,U.size()){
if (U.at(j) == '?')
{
U.at(j) = 'a';
}
}
vec.push_back(U);
}
}
sort(vec.begin(), vec.end());
if(vec.size()==0){
cout << "UNRESTORABLE" << endl;
}
else{
cout << vec.at(0) << endl;
}
}
}
| 0
| 63,025,282
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
if(a+b-1 > n || (ll)a*b < n){
cout << -1 << endl;
return 0;
}
vector<int> ans;
int l = n - (a+b-1);
int num = b;
rrep(i, b) ans.push_back(i+1);
rep2(i, 1, a){
int nx = num + min(l, b-1) + 1;
l -= min(l, b-1);
rrep2(j, num+1, nx+1){
ans.push_back(j);
}
num = nx;
}
rep(i, n){
if(i != 0) cout << " ";
cout << ans.at(i);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string s, t;
cin >> N;
cin >> s;
cin >> t;
int res = N * 2;
for(int i = 1; i <= N; ++i) {
bool f = true;
for(int j = N - i, k = 0; j < N; ++j, ++k) {
if(s[j] != t[k]) {
f = false;
break;
}
}
if(f) res = N * 2 - i;
}
cout << res << endl;
return 0;
}
| 0
| 17,473,142
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
void solve(int test_case) {
string s;
cin>>s;
stack<char> d;
for(char c:s) {
if(c!='B')d.PU(c);
else if(!d.empty())d.PO();
}
string sol = "";
while(!d.empty()) {
sol+=d.top();
d.PO();
}
reverse(sol.begin(),sol.end());
cout<<sol;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,L,T;
int a[N],x[N],w[N];
int main()
{
scanf("%d%d%d",&n,&L,&T);
int rk=0;
for(int i=0;i<n;i++){
scanf("%d%d",&a[i],&w[i]);
if(w[i]==1){
x[i]=(a[i]+T)%L;
rk+=(a[i]+T)/L;
}
else{
x[i]=(a[i]-T)%L;
rk+=(a[i]-T)/L;
if(x[i]<0){
x[i]+=L;
rk--;
}
}
}
rk=(rk%n+n)%n;
sort(x,x+n);
for(int i=rk;i<n;i++)
printf("%d\n",x[i]);
for(int i=0;i<rk;i++)
printf("%d\n",x[i]);
}
| 0
| 28,654,231
|
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18+7)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T,vector<T>,greater<T>>
#define vecunique(vec) sort(vec.begin(), vec.end());decltype(vec)::iterator result = std::unique(vec.begin(), vec.end());vec.erase(result, vec.end())
using namespace std;
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)return false;
}
return x > 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x * y / gcd(x, y);
}
int kai(int x) {
if (x == 0)return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mod_) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod_;
}
x = x * x % mod_;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
return kai(x)* mod_pow(kai(x - y), mod - 2, mod) % mod * mod_pow(kai(y), mod - 2, mod) % mod;
}
int n, ans, mi_ = inf;
signed main() {
cin >> n;
rep(i, n) {
int a, b; cin >> a >> b;
ans += a;
if (a > b)mi_ = min(mi_, b);
}
if (mi_ == inf)cout << 0 << endl;
else cout << ans - mi_ << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9+10;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
string s; cin>>s;
ll n=s.size();
n--;
for(ll i=n; i>=0; i--){
if(i%2!=0) continue;
ll m=i/2;
if(s.substr(0,m)==s.substr(m,m)){
cout<<i<<endl;
return 0;
}
}
}
| 0
| 25,581,925
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(void)
{
int N; cin >> N;
vector<int> v(N,-1);
auto q = [&](int i) {
cout << i << endl;
cout.flush();
string s; cin >> s;
if (s == "Male") v[i] = 1;
else if (s == "Female") v[i] = 2;
else v[i] = 0;
return;
};
int l = 0;
int r = N;
q(0);
if(v[0] == 0) return 0;
int Q = 19;
while(Q > 0) {
int mid = (l+r) / 2;
q(mid);
if (v[mid] == 0) return 0;
else {
if ((mid-l) % 2 == 0) {
if (v[mid] == v[l]) l = mid;
else r = mid;
} else {
if (v[mid] == v[l]) r = mid;
else l = mid;
}
}
Q--;
}
return 0;
}
|
#include<cstdio>
#include<stack>
using namespace std;
int main() {
int n;
stack<int> S;
while(~scanf("%d",&n)) {
if(n)
S.push(n);
else {
printf("%d\n",S.top());
S.pop();
}
}
return 0;
}
| 0
| 76,949,328
|
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
bool ans = true;
cin >> n;
string before, now;
set<string>dist;
cin >> before;
dist.insert(before);
rep(i, n-1) {
cin >> now;
if (dist.count(now)) {
ans = false;
break;
}
if (before.back() != now[0]) {
ans = false;
break;
}
dist.insert(now);
before = now;
}
if (ans) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main()
{
string S;
vector<string> vc;
map<string, int> cnt;
while( cin >> S ){
vc.emplace_back( S );
cnt[ S ]++;
}
int MAX{}, MAX2{};
string res, res2;
for( const auto &x: cnt )
{
if( MAX < x.second )
{
MAX = x.second;
res = x.first;
}
if( MAX2 < (int)(x.first).size() )
{
MAX2 = (int)(x.first).size();
res2 = x.first;
}
}
cout << res << " " << res2 << endl;
return 0;
}
| 0
| 61,965,536
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
LL fac[SIZE], finv[SIZE], inv[SIZE];
void combInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for( int i = 2; i < SIZE; ++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;
}
}
LL comb(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;
}
vector< int > Div( int n ) {
vector< int > ret;
for( int i = 1; i * i <= n; ++i ) {
if( n % i == 0 ) {
ret.pb( i );
if( i * i != n ) ret.pb( n / i );
}
}
sort( all( ret ) );
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int sum = 0;
vector< int > v;
v.pb(0);
for( int i = 0; i < n; ++i ) {
int a;
cin >> a;
v.pb(a);
}
v.pb(0);
int npos = 0;
for( int i = 1; i <= n + 1; ++i ) {
sum += abs(npos - v[i]);
npos = v[i];
}
for( int i = 1; i <= n; ++i ) {
int asum = abs(v[i - 1] - v[i]) + abs(v[i] - v[i + 1]);
int bsum = abs(v[i - 1] - v[i + 1]);
cout << sum - (asum - bsum) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = unordered_map<T, K>;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll e5 = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = ll(n - 1); i >= 0; i--)
#define each(i, mp) for (auto &i : mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
template <class T> ostream &operator<<(ostream &out, const vector<T> &list) {
ll n = list.size();
rep(i, n) out << list[i] << ' ';
return out;
}
template <class T> istream &operator>>(istream &in, vector<T> &list) {
ll n = list.size();
rep(i, n) in >> list[i];
return in;
}
template <class T> ostream &operator<<(ostream &out, const vector<vector<T>> &list) {
ll n = list.size();
rep(i, n) out << list[i] << '\n';
return out;
}
void solve() {
ll h, w;
cin >> h >> w;
if (h == 1 || w == 1)
cout << 1 << '\n';
else
cout << ll(ceil(h / 2.0) * ceil(w / 2.0) + h / 2 * (w / 2)) << endl;
}
int main() {
#ifdef MY_DEBUG
while (true) {
#endif
solve();
#ifdef MY_DEBUG
}
#endif
return 0;
}
| 0
| 34,084,576
|
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
bool hantei( vector<int>& x, vector<int>& y ) {
rep( Z, -100, 100+1 ) {
bool flag = true;
rep( i, 0, x.size() ) {
if ( x.at(i) >= Z ) flag = false;
}
rep( i, 0, y.size() ) {
if ( y.at(i) < Z ) flag = false;
}
if (flag) return false;
}
return true;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> x(N+1), y(M+1);
cin >> x.at(0) >> y.at(0);
rep(i, 1, N+1) cin >> x.at(i);
rep(i, 1, M+1) cin >> y.at(i);
cout << ( hantei(x, y) ? "War" : "No War" ) << endl;
}
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#define NDEBUG
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout cout
#define din cin
#else
stringstream dummy;
#define dout dummy.str(""); dummy.clear(stringstream::goodbit); dummy
#endif
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif
#define disp(A) dout << #A << " = " << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define dispAll(A,n) dout << #A << " = "; rep(j, 0, (n)) {disP(A[j]);} dout << endl
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef unsigned long long ll;
const int INF = 1e9-1;
int completeBinaryTree[251];
int parentOf(int i) {
return i/2;
}
int leftChildOf(int i) {
return i*2;
}
int rightChildOf(int i) {
return i*2+1;
}
int main(){
int N; cin >> N;
rep(i,1,N+1) din >> completeBinaryTree[i];
string parentKeyStr;
string leftKeyStr;
string rightKeyStr;
ostringstream oss;
rep(i,1,N+1) {
if(parentOf(i)>0) {
parentKeyStr = "parent key = ";
oss << completeBinaryTree[parentOf(i)];
parentKeyStr += oss.str();
parentKeyStr += ", ";
oss.str("");
} else parentKeyStr = "";
if(leftChildOf(i)<=N) {
leftKeyStr = "left key = ";
oss << completeBinaryTree[leftChildOf(i)];
leftKeyStr += oss.str();
leftKeyStr += ", ";
oss.str("");
} else leftKeyStr = "";
if(rightChildOf(i)<=N) {
rightKeyStr = "right key = ";
oss << completeBinaryTree[rightChildOf(i)];
rightKeyStr += oss.str();
rightKeyStr += ", ";
oss.str("");
} else rightKeyStr = "";
dout << "node " << i << ": key = " << completeBinaryTree[i] << ", "
<< parentKeyStr << leftKeyStr << rightKeyStr << endl;
}
#ifdef INPUTFILE
inputfile.close();
#endif
#ifdef OUTPUTFILE
outputfile.close();
cout << "\"" << OutputFilePath << "\"" << endl;
#endif
return 0;
}
| 0
| 31,310,006
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans=0;
if(n>=10){
if(n>=1000){
if(n>=10000 && n!=100000){
ans += n-9999;
ans += 909;
} else if(n==100000){
ans = 90909;
} else {
ans += 909;
}
} else if(n>=100){
ans += n-99;
ans += 9;
} else {
ans = 9;
}
} else {
ans = n;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
EACH(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
REP(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
REP(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N; cin >> N;
set<string> s;
REP(i, N) {
string op; cin >> op;
string target; cin >> target;
if (op == "insert") {
s.insert(target);
}
else {
if (s.count(target) > 0) {
cout << "yes" << endl;
}
else {
cout << "no" << endl;
}
}
}
}
| 0
| 27,451,955
|
#include <cstdio>
#include <cmath>
using namespace std;
int main (void)
{
int h, w;
int i, j;
while (scanf("%d %d", &h, &w) != EOF && h != 0 || w != 0){
for (i=0; i<h; i++){
for (j=0; j<w; j++){
if (j!=0 && j!=w-1){
if(i!=0 && i!=h-1)
printf(".");
else
printf("#");
}
else
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int MOD = 1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> x(n), y(m);
Rep (i, n) cin >> x[i];
Rep (i, m) cin >> y[i];
sort(x.begin(), x.end());
sort(y.begin(), y.end());
ll width = 0, height = 0;
Rep (i, n-1) {
ll tmp = x[i+1] - x[i];
tmp = tmp * (i+1) % MOD * (n-i-1) % MOD;
width += tmp;
width %= MOD;
}
Rep (i, m-1) {
ll tmp = y[i+1] - y[i];
tmp = tmp * (i+1) % MOD * (m-i-1) % MOD;
height += tmp;
height %= MOD;
}
ll ans = width * height % MOD;
cout << ans << endl;
}
| 0
| 32,138,417
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
int count = 0;
int i;
vector<bool> list(1e6, false);
for(i=1; count<n; i++){
count+=i;
list[i]=true;
}
int diff = count-n;
for(int j=i; j>0; j--){
if(j<=diff){
diff -= j;
list[j] = false;
}
if(diff==0) break;
}
for(int j=1; j<i; j++){
if(list[j]){
cout << j << endl;
}
}
return 0;
}
|
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
int n;
int m;
vi a;
vector<set<int>> g;
void input() {
a.clear();
g.clear();
cin >> n >> m;
a.resize(n);
g.resize(n);
for (auto&& i : a)
cin >> i;
for (int i = 0; i < m; ++i) {
int u;
int v;
cin >> u >> v;
--u;
--v;
g[u].insert(v);
g[v].insert(u);
}
}
void solve() {
int ans = 0;
for (int i = 0; i < n; ++i) {
bool ok = true;
for (auto&& j : g[i]) {
if (a[j] >= a[i]) {
ok = false;
break;
}
}
ans += ok;
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(16);
cout << fixed;
int _times = 1;
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
_times = 2;
#endif
while (_times--) {
input();
solve();
}
}
| 0
| 87,154,746
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5;
char s[2 * N + 5];
ll a[2 * N + 5], d[2 * N + 5];
const ll mod = 1e9 + 7;
int main()
{
ll n;
cin >> n;
getchar();
ll offset = 0;
d[0] = 1;
for (ll i = 1; i <= n * 2; i++)
{
scanf("%c", &s[i]);
a[i] = (s[i] == 'W' ? 0 : 1);
d[i] = a[i] ^ a[i - 1] ^ (d[i - 1] == 0);
}
ll cnt = 0ll;
ll ans = 1ll;
for (ll i = 1; i <= n * 2; i++)
{
if (d[i] == 1)
{
cnt++;
}
else
{
if (cnt <= 0)
{
cout << 0;
return 0;
}
ans = ans * cnt % mod;
cnt--;
}
}
if (cnt > 0)
{
cout << 0;
return 0;
}
for (ll i = n; i >= 1; i--)
{
ans = ans * i % mod;
}
cout << ans;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
using namespace std;
struct data{ int x, y, count; };
const int INF = 10000000;
int w, h, n;
int sx, sy;
int gx, gy;
int vx[] = { 1, 0, -1, 0, };
int vy[] = { 0, 1, 0, -1, };
char field[1001][1001];
int d[1001][1001][11];
int bfs(){
queue<data> que;
for (int i = 1; i <= h; i++)
for (int j = 1; j <= w; j++)
for (int k = 0; k <= n + 1; k++) d[j][i][k] = INF;
que.push({ sx, sy, 1 });
d[sx][sy][1] = 0;
field[sx][sy] = '.';
while (que.size()){
data p = que.front(); que.pop();
if (p.count == n + 1) break;
for (int i = 0; i < 4; i++){
int nx = p.x + vx[i], ny = p.y + vy[i], c = p.count;
if (0 < nx && nx < w + 1 && 0 < ny && ny < h + 1 && field[nx][ny] != 'X'
&& d[nx][ny][c] == INF){
if (field[nx][ny] != '.' && c == field[nx][ny] - '0'){
que.push({ nx, ny, c + 1 });
d[nx][ny][c] = d[nx][ny][c + 1] = d[p.x][p.y][c] + 1;
continue;
}
que.push({ nx, ny, c });
d[nx][ny][c] = d[p.x][p.y][c] + 1;
}
}
}
return d[gx][gy][n];
}
int main(void){
cin >> h >> w >> n;
for (int i = 1; i <= h; i++){
for (int j = 1; j <= w; j++){
cin >> field[j][i];
if (field[j][i] == 'S'){
sx = j; sy = i;
}
else if (n == field[j][i] - '0'){
gx = j; gy = i;
}
}
}
int ans = bfs();
cout << ans << endl;
}
| 0
| 42,921,298
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int b = 0, cnt = 0;
for (int i = 0; i < n; ++i) {
int h;
cin >> h;
if (b <= h) cnt++;
b = max(b, h);
}
cout << cnt << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int se(char s){
int r;
if(s=='a'||s=='t'||s=='g'||s=='r'||s=='f'||s=='v'||s=='c'||s=='e'||s=='d'||s=='s'||s=='w'||s=='x'||s=='q'||s=='z'||s=='b')r=1;
else r=0;
return r;
}
int main(){
string s;
int i,r,j,sum;
while(cin>>s,s!="#"){
j=se(s[0]);
sum=0;
for(int i=1;i<s.size();i++){
r=se(s[i]);
if(j!=r){sum++;
j=r;}
}
cout<<sum<<endl;
}
return 0;
}
| 0
| 10,126,390
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string O,E;
cin >> O >> E;
vector<char> o(O.size());
for (int i = 0; i < O.size(); i++) {
o.at(i) = O.at(i);
}
vector<char> e(E.size());
for (int i = 0; i < E.size(); i++) {
e.at(i) = E.at(i);
}
for (int i = 0; i < E.size(); i++) {
cout << o.at(i) << e.at(i);
}
if (O.size() > E.size()){
cout << o.at(O.size()-1) << endl;
}
else {
cout << endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
int const nmax = 300;
char v[1 + nmax][1 + nmax];
int main() {
int n;
std::cin >> n;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
std::cin >> v[i][j];
int result = 0;
for(int h = -n + 1; h <= n - 1; h++) {
int valid = 1;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
valid &= (v[i][(n + j - h) % n] == v[j][(n + i - h) % n]);
if(valid == 1)
for(int i = 0; i < n; i++)
result += (0 <= (i + h) && (i + h) < n);
}
std::cout << result;
return 0;
}
| 0
| 91,780,891
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long sum = accumulate(A.begin(), A.end(), 0LL);
long long m = N * (N + 1) / 2;
if (sum % m != 0) {
cout << "NO" << endl;
return 0;
}
long long num = sum / m;
for (int i = 0; i < N; i++) {
long long gap = 0;
if (i != N - 1) {
gap = A[i + 1] - A[i] - num;
} else {
gap = A[0] - A[N - 1] - num;
}
if (gap % N != 0 || gap > 0) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s; cin >> s;
bool a = 1, b = 1, c = 1;
if(s[0] != 'A')a = 0;
int cnt = 0;
for(int i = 2; i < s.length()-1; i++){
if(s[i] == 'C')cnt++;
}
if(cnt == 1)b = 1;
else b = 0;
int lcnt = 0;
for(int i = 0; i < s.length(); i++){
if((int)s[i]-'a' < 26 && (int)s[i]-'a' >= 0)lcnt++;
}
if(s.length()-lcnt == 2)c = 1;
else c = 0;
if(a && b && c)cout << "AC" << endl;
else cout << "WA" << endl;
return 0;
}
| 0
| 33,640,546
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
char c[H][W];
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> c[i][j];
}
}
int ans = 0;
for (unsigned short int h_bits = 0; h_bits < (1 << H); h_bits++) {
for (unsigned short int w_bits = 0; w_bits < (1 << W); w_bits++) {
int count = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (!((h_bits & (1 << i)) || (w_bits & (1 << j))) && c[i][j] == '#') count++;
}
}
if (count == K) ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int n,k,m;
int ans=0;
vector<int>s(10);
void bfs(int nn,int sum,int min){
if(nn==0&&sum==0){
ans++;
return;
}
for(int i=min;i<10&&n>0;i++){
if(sum-i>=0){
bfs(nn-1,sum-i,i+1);
}
}
}
int main(){
while(cin>>n>>m){
if(n==0 && m==0)break;
bfs(n,m,0);
cout<<ans<<endl;
ans=0;
}
return 0;
}
| 0
| 30,947,050
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;
template<class T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; }
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
string A, B; cin >> A >> B;
if(A.length() > B.length())
{
cout << "GREATER" << endl;
return 0;
}
else if(A.length() < B.length())
{
cout << "LESS" << endl;
return 0;
}
else
{
REP(i, (int)A.length())
{
if(A[i] > B[i])
{
cout << "GREATER" << endl;
return 0;
}
if(A[i] < B[i])
{
cout << "LESS" << endl;
return 0;
}
}
}
cout << "EQUAL" << endl;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; }
vector<int> parse(int n, string& s) {
char c = s[0];
int tmp = 1;
vector<int> res;
for (int i = 1; i < n; i++) {
if (s[i] != c) {
c = s[i];
res.push_back(tmp);
tmp = 1;
} else {
tmp++;
}
}
res.push_back(tmp);
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> par = parse(n, s);
int m = par.size(), ans = 0;
if(s[0] == '1') ans += par[0];
if(m%2 != (s[0]-'0')) par.push_back(0);
int sum = 0, cnt = 0;
queue<int> q;
for(int i = (s[0] - '0'); i < m; i+=2){
if(cnt >= k){
int now = q.front();
q.pop();
sum -= now;
if(cnt != k){
now = q.front();
q.pop();
sum -= now;
}
}
++cnt;
q.push(par[i]);
q.push(par[i+1]);
sum += par[i] + par[i+1];
chmax(ans, sum);
}
cout << ans << endl;
return 0;
}
| 0
| 4,469,152
|
#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <bitset>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <string.h>
#include <cmath>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <cctype>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <cstring>
using namespace std;
using ll = long long;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800 / 2
#define ALL(a) (a).begin(), (a).end()
#include <iostream>
#include <cmath>
using namespace std;
bool isPrimeNum(ll x)
{
if (x <= 1)
{
return false;
}
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++)
{
if (x % i == 0)
{
return false;
}
}
return true;
}
ll myPow(ll x, ll n, ll 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;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b)
{
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr double dabs(double a, double b)
{
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b)
{
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b)
{
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dx8[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
class UnionFind
{
public:
vector<int> Parent;
UnionFind(int N)
{
Parent = vector<int>(N, -1);
}
int root(int A)
{
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
int size(int A)
{
return -Parent[root(A)];
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool connect(int A, int B)
{
A = root(A);
B = root(B);
if (A == B)
{
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; 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 modinv(long long a, long long m)
{
long long b = m, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to)
{
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty())
{
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos)
{
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag)
{
if (flag)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return;
}
void YN(bool flag)
{
if (flag)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
return;
}
std::vector<ll> enum_div(ll n)
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i != 1 && i * i != n)
{
ret.push_back(n / i);
}
}
}
ret.push_back(n);
return ret;
}
void Ssort(int no, char *month[])
{
int i, j;
char *temp;
for (i = 0; i < no; i++)
{
for (j = i + 1; j < no; j++)
{
if (strcmp((month[i]), (month[j])) > 0)
{
temp = *(month + i);
*(month + i) = *(month + j);
*(month + j) = temp;
}
}
}
}
struct Edge
{
ll to;
ll weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<int>>;
int main()
{
ll N, K;
cin >> N;
ll A[N];
FOR(i, 0, N - 1)
{
ll tp;
cin >> tp;
A[tp - 1] = i;
}
ll P = 30000;
FOR(i, 0, N - 1)
{
cout << P * i + A[i] + 1 << " ";
}
cout << endl;
FOR(i, 0, N - 1)
{
cout << P * (N -i+ 1) + 1 << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
int n, m;
cin >> n >> m;
map<int, int> mp;
rep(i,m){
int a, b;
cin >> a >> b;
a--; b--;
mp[a]++;
mp[b]++;
}
rep(i,n){
if (mp[i] % 2 != 0){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 65,701,971
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<ll> a(n+1);
rep(i,n+1) cin>>a[i];
if(n==0){
if(a[0]==1) cout<<1<<endl;
else cout<<-1<<endl;
return 0;
}
if(a[0]!=0){
cout<<-1<<endl;
return 0;
}
ll cur=1;
ll ans=1;
ll tot=0;
rep(i,n+1) tot+=a[i];
for(int i=1;i<n+1;i++){
cur*=2;
if(cur<a[i]){
cout<<-1<<endl;
return 0;
}
ans+=min(cur,tot);
cur=min(cur,tot)-a[i];
tot-=a[i];
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int main() {
int n;
cin >> n;
vector<int>dp(n+10000,n);
dp[0] = 0;
for(int i = 0;i<n;i++) {
for(int pow6 = 1;i+pow6<=n;pow6 *= 6) {
chmin(dp[i+pow6],dp[i]+1);
}
for(int pow9 = 1;i+pow9<=n;pow9 *= 9) {
chmin(dp[i+pow9],dp[i]+1);
}
}
cout << dp[n] << endl;
}
| 0
| 84,375,715
|
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=2e5+100;
vector <int> g[N];
ll vis[N];
void dfs(ll v,ll p){
for (auto u : g[v]){
if (u==p) continue;
dfs(u,v);
if (vis[u]==0 && vis[v]==0){
vis[u]=1;
vis[v]=1;
}
}
}
int32_t main(){
sync;
ll n;
cin >> n;
for (int i=0;i<n-1;i++){
ll u,v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
dfs(1,1);
for (int i=1;i<=n;i++) if (vis[i]==0) kill("First");
kill("Second");
}
|
#include <stdio.h>
int main (){
long long int n;
scanf ("%lld", &n);
long long int arr[n];
for (long long int i = 0; i < n; i++){
scanf ("%lld", &arr[i]);
}
for (long long int i = 0; i < n; i++){
if (arr[i] == 0){
printf("0\n");
return 0;
}
}
long long int sum = 1;
for (long long int i = 0; i < n; i++){
if (arr[i] <= 1000000000000000000 / sum){
sum *= arr[i];
}
else {
printf ("-1\n");
return 0;
}
}
printf ("%lld\n", sum);
return 0;
}
| 0
| 14,522,457
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string in;
int cnt[26];
for (int i = 0; i < 26; i++){
cnt[i] = 0;
}
while (1){
getline(cin, in);
if (in.empty()) break;
for (int i = 0; i < in.size(); i++){
for (int j = 0; j < 26; j++){
if (in[i] == 'A' + j || in[i] == 'a' + j){
cnt[j]++;
}
}
}
}
for (int i = 0; i < 26; i++){
cout << (char)('a' + i) << " : " << cnt[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
const int maxm = 2e5+10;
typedef long long LL;
LL A[maxn]; int n, edgecnt, head[maxn];
struct edge{int v, nxt;} E[maxm];
inline int read()
{
int x = 0 , f = 1; char ch = getchar();
while(ch<'0'||ch>'9') {if(ch=='-')f*=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
return x * f;
}
inline void addedge(int u, int v)
{
E[++edgecnt].v = v, E[edgecnt].nxt = head[u], head[u] = edgecnt;
E[++edgecnt].v = u, E[edgecnt].nxt = head[v], head[v] = edgecnt;
}
LL dfs(int u, int fa)
{
int cnt = 0;
for(int i = head[u]; ~i; i = E[i].nxt)
if(u != E[i].v && fa != E[i].v) cnt++;
if(!cnt)
return A[u];
LL tot = 0, x1 = 0, x2 = 0, maxw = 0, sumw;
for(int i = head[u]; ~i; i = E[i].nxt){
int v = E[i].v;
if(v == fa) continue;
sumw = dfs(v, u);
maxw = max(maxw, sumw);
tot += sumw;
}
x2 = tot - A[u];
x1 = A[u] - x2;
if(x1 < 0 || x2 < 0 || A[u] < maxw || (x1 > 0 && fa == -1))
{
puts("NO");
exit(0);
}
return x1;
}
int main(){
memset(head,-1,sizeof head);
n = read();
for(int i = 1; i <= n; i++)
scanf("%lld", &A[i]);
for(int i = 1; i < n; i++)
addedge(read(),read());
if(n == 2)
if(A[1] == A[2])
printf("YES\n");
else
printf("NO\n");
else
{
for(int i = 1; i <= n; i++)
{
int num = 0;
for(int j = head[i]; ~j; j = E[j].nxt)
if(E[j].v != i)
num++;
if(num > 1){
dfs(i, -1);
break;
}
}
printf("YES\n");
}
return 0;
}
| 0
| 26,554,616
|
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int n, m, x;
int c[20];
vector<vector<int>> v, ans;
vector<int> temp;
void rec(int idx){
if(idx >= n){
ans.push_back(temp);
return;
}
temp.push_back(idx);
rec(idx + 1);
temp.pop_back();
rec(idx + 1);
}
int main()
{
Hello
v.resize(20);
cin >> n >> m >> x;
for(int i = 0; i < n; i++){
cin >> c[i];
for(int j = 0, a; j < m; j++){
cin >> a;
v[i].push_back(a);
}
}
rec(0);
int mn = 2e9;
for(int i = 0; i < ans.size(); i++){
int arr[m + 5] = {}, amount = 0;
for(int j = 0; j < ans[i].size(); j++){
amount += c[ans[i][j]];
for(int k = 0; k < m; k++){
arr[k] += v[ans[i][j]][k];
}
}
bool ok = true;
for(int j = 0; j < m; j++)
if(arr[j] < x)
ok = false;
if(ok)
mn = min(mn, amount);
}
if(mn == 2e9)
cout << -1;
else
cout << mn;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define Fast ios::sync_with_stdio(false); cin.tie(0)
#define pb push_back
#define pf push_front
#define pp pop
#define ppb pop_back
#define ppf pop_front
#define mp make_pair
#define S second
#define F first
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 5;
ll inf = 1e18;
ll tmp = 0;
vector <ll> vec[N];
pair <ll ,ll> p[N];
bool vst[N];
void dfs(int v){
vst[v] = true;
tmp ++;
for(int i = 0 ; i < vec[v].size(); i ++){
if(!vst[vec[v][i]]){
dfs(vec[v][i]);
}
}
}
int main(){
Fast;
int n , m;
cin >> n >> m;
for(int i = 0 ; i < m; i ++){
cin >> p[i].F >> p[i].S;
}
sort(p , p + m);
int x = p[0].F , y = p[0].S;
vec[p[0].F].pb(p[0].S);
vec[p[0].S].pb(p[0].F);
for(int i = 1; i < m ;i ++){
if((x == p[i].F && y == p[i].S) || (x == p[i].S && y == p[i].F));
else{
x = p[i].F;
y = p[i].S;
vec[x].pb(y);
vec[y].pb(x);
}
}
ll ans = 0;
for(int i = 1; i <= n ;i ++){
if(!vst[i]){
dfs(i);
ans = max(ans , tmp);
tmp = 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 72,240,182
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
cout << ((d + s - 1) / s <= t ? "Yes" : "No") << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)/2)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1ll<<(x))
#define inf 1000000000
#define MOD 1000000007
#define N 100005
#define M 10000001
#define LOG 16
#define KOK 650
#define EPS 0.00001
using namespace std;
int n,m,x[N],y[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>x[i];
for(int i=1;i<=m;i++) cin>>y[i];
int ax=0,ay=0;
int s=0;
for(int i=1;i<=n;i++) {
ax=(ax+(ll)(i-1)*x[i]-s)%MOD;
s=(s+x[i])%MOD;
}
s=0;
for(int i=1;i<=m;i++) {
ay=(ay+(ll)(i-1)*y[i]-s)%MOD;
s=(s+y[i])%MOD;
}
cout<<(ll)ax*ay%MOD;
}
| 0
| 62,415,081
|
#include<stdio.h>
int main(void){
char kazu[1001];
int kazu2[1001];
int t,wa=0;
for(;;){
scanf("%s",kazu);
if(kazu[0]=='0'){
break;
}
for(t=0;kazu[t]!='\n'&&kazu[t]!='\0';t++){
wa+=kazu[t]-'0';
}
printf("%d\n",wa);
wa=0;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
long long n, fn;
int main() {
cin >> n;
fn = 1;
for (int i = 0; n > 1; n--) {
fn *= n;
}
cout << fn << endl;
return 0;
}
| 0
| 78,354,339
|
#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()
{
string S;
ll K;
cin >> S;
cin >> K;
ll days = 5000000000000000;
char ans;
rep(i, S.size())
{
char c = S.at(i);
int num = (int)(c - '0');
ll digit = days * log10(num);
if (log10(K) <= digit)
{
ans = c;
break;
}
else
{
K -= pow(num, days);
}
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
int vali[100100];
int a[1000][1000];
int main()
{
for(int i=1;i*(i-1)/2<=100000;++i)
vali[i*(i-1)/2]=i;
int n;
scanf("%d",&n);
if(!vali[n])
{
puts("No");
return 0;
}
puts("Yes");
printf("%d\n",vali[n]);
int t=1,l=2*n/vali[n];
for(int i=1;i<=vali[n];++i)
{
printf("%d ",l);
for(int j=1;j<i;++j)
{
printf("%d ",a[j][i-1]);
a[i][j]=a[j][i-1];
}
for(int j=i;j<=l;++j)
{
printf("%d ",t);
a[i][j]=t++;
}
puts("");
}
return 0;
}
| 0
| 8,593,482
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
int taroPoint=0,hanakoPoint=0;
string taroCard,hanakoCard;
cin>>n;
for(int i=0;i<n;i++){
cin>>taroCard>>hanakoCard;
if(taroCard > hanakoCard){
taroPoint += 3;
}else if(taroCard < hanakoCard){
hanakoPoint += 3;
}else{
taroPoint += 1;
hanakoPoint += 1;
}
}
cout<<taroPoint<<" "<<hanakoPoint<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
#include <bits/stdc++.h>
#define rep(i,a,n) for(ll i = a;i < n;i++)
typedef long long ll;
using namespace std;
int main(){
ll n,a,b;
cin >> n >> a >> b;
ll p[n] = {};
ll cnt[3] = {};
rep(i,0,n){
cin >> p[i];
if(p[i] <= a) cnt[0]++;
else if(p[i] <= b) cnt[1]++;
else cnt[2]++;
}
cout << min(cnt[0],min(cnt[1],cnt[2])) << endl;
return 0;
}
| 0
| 90,532,668
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n+1),b(n+1);
for(ll i=1;i<=n;i++){
cin >> a[i] >> b[i];
}
ll ans=0;
ll times=0;
for(ll i=n;i>=1;i--){
ll tmp = (a[i]+times) % b[i];
if(tmp != 0){
ans += b[i] - tmp;
times += (b[i] - tmp);
}
}
cout << ans << endl;
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int w,h,n;
cin >> w >> h >> n;
vector<vector<bool>> p(h, vector<bool>(w, true));
for(int i = 0; i < n; i++) {
int x,y,a;
cin >> x >> y >> a;
if(a==1){
for(int j = 0; j < h; j++) {
for(int k = 0; k < x; k++) {
p.at(j).at(k)=false;
}
}
}
if(a==2){
for(int j = 0; j < h; j++) {
for(int k = x; k < w; k++) {
p.at(j).at(k)=false;
}
}
}
if(a==3){
for(int j = 0; j < y; j++) {
for(int k = 0; k < w; k++) {
p.at(j).at(k)=false;
}
}
}
if(a==4){
for(int j = y; j < h; j++) {
for(int k = 0; k < w; k++) {
p.at(j).at(k)=false;
}
}
}
}
int ans=0;
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(p.at(i).at(j)==true) ans ++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 84,649,864
|
#include <iostream>
#include <cstring>
using namespace std;
const int INF = -1;
int main()
{
int a, b;
while (cin >> a >> b, a || b) {
int n;
int dp[20][20] = {0};
dp[1][1] = 1;
cin >> n;
while (n--) {
int x, y;
cin >> x >> y;
dp[y][x] = INF;
}
for (int y = 1; y <= b; y++)
for (int x = 1; x <= a; x++) {
if (dp[y][x] != INF) {
if (y != 1 && dp[y - 1][x] != INF)
dp[y][x] += dp[y - 1][x];
if (x != 1 && dp[y][x - 1] != INF)
dp[y][x] += dp[y][x - 1];
}
}
cout << dp[b][a] << endl;
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define REP(i, a, b) for(int i = a; i >= b; i--)
#define maxN 200005
#define inf (int) 1e9
#define mode (int) 1000000007
#define ll long long
using namespace std;
int n;
int f[10000005];
void enter() {
scanf("%d", &n);
FOR(i, 1, n)
FOR(j, 1, n / i) {
int k = i * j;
f[k]++;
}
}
void solve() {
ll ans = 0;
FOR(i, 1, n)
ans += 1ll * i * f[i];
printf("%lld", ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
enter();
solve();
}
| 0
| 51,105,304
|
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int sum = 0;
for (auto c : s)
sum += c - '0';
cout << (sum % 9 == 0 ? "Yes" : "No");
}
|
#include<bits/stdc++.h>
using namespace std;
#define E end()
#define B begin()
#define sz size()
#define EM empty()
#define fi first
#define se second
#define cl clear()
#define sqr(a) (a*a)
#define mk make_pair
#define po pop()
#define pu push
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
string en="\n";
string sp=" ";
string t="hello";
string Y="YES\n";
string N="NO\n";
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define per(i,n) for(i=n-1;i>=0;i--)
#define peR(i,n) for(i=n;i>0;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define all(cont) cont.begin(),cont.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define pi 3.1415926535897932384626433832795
#define vi vector<long long>
#define vs vector<string>
#define MX LLONG_MAX
#define MN LLONG_MIN
#define MOD 1000000007
#define vp(vi,x) cin>>x; vi.pb(x);
#define bsearch(a,x) binary_search(all(a),x)
#define LB(a,x) (lower_bound(all(a),x)-a.B)
#define UB(a,x) (upper_bound(all(a),x)-a.B)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
bool isprm(LL a){if(a==1)return false; for(LL i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
bool palin(string a){for(int i=0;i<a.sz;i++){if(a.at(i)!=a.at(a.sz-i-1))return 0;} return 1;}
bool isVowel(char ch){ ch=toupper(ch); if(ch=='A'||ch=='U'||ch=='I'||ch=='O'||ch=='E') return true; return false;}
int toInt(string s){int sm;stringstream ss(s);ss>>sm;return sm;}
LL ceil2(LL a,LL b){LL c=a/b; if(a%b)c++; return c; }
LL bpow(LL a,LL b){if(b==0)return 1;LL r=bpow(a,b/2);if(b%2)return r*r*a;else return r*r;}
LL binpow(LL a,LL b){LL r=1;while(b>0){if(b&1)r=r*a;a=a*a;b>>=1;}return r;}
LL binpow(LL a,LL b,LL m){a%=m;LL r=1;while(b>0){if(b&1) r=r*a%m;a=a*a%m; b>>=1;}return r;}
template<typename T>inline T gcd(T a,T b){if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<typename T>inline T lcm(T a,T b) {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
int main()
{
LL i,j,k,n,m,l,s=0,x,y,tc=1,p,q,a,b,c=0;
bool f=0,ff=0;string st,s1,s2,s3; char ch;
while(cin>>a>>b)
{
if(a<b)
{
rep(i,b)cout<<a;
cout<<en;
}
else
{
rep(i,a)cout<<b;
cout<<en;
}
}
return 0;
}
| 0
| 21,798,075
|
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
cout << (n - k + 1) << 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 <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
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;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll 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(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
void dfs() {
}
int main() {
string n;
ll k;
cin >> n >> k;
ll b = n.size();
vector<vector<ll>> dp(b + 1, vector<ll>(k + 2));
vector<vector<ll>> same(b + 1, vector<ll>(k + 2));
same[0][1] = 1;
for (int i = 0; i < b; i++) {
for (int j = 1; j < k+2; j++) {
if (n[i] == '0') {
dp[i + 1][j] = dp[i][j] + dp[i][j - 1] * 9;
same[i + 1][j] = same[i][j];
}
else {
dp[i + 1][j] = dp[i][j] + dp[i][j - 1] * 9 + same[i][j]+same[i][j-1]*((n[i]-'0')-1);
same[i + 1][j] = same[i][j-1];
}
}
}
cout << same[b][k+1] + dp[b][k+1] << endl;
}
| 0
| 86,702,080
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
double sum = 0.0;
for (int i = 0; i < n; i++) {
double x; cin >> x;
string u; cin >> u;
if (u == "JPY") {
sum += x;
} else {
sum += x * 380000.0;
}
}
printf("%.10lf\n", sum);
return 0;
}
|
#include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
using ll = long long;
ll n, p;
string s;
cin >> n >> p >> s;
ll ans = 0;
if (p == 2 || p == 5) {
for (int i = 0; i < s.size(); ++i) {
int d = s[i] - '0';
if (d % p != 0) {
continue;
}
ans += i + 1;
}
cout << ans << '\n';
return 0;
}
vector<ll> mods(p, 0);
mods[0] = 1;
ll md = 0, pow10 = 1;
for (int i = s.size() - 1; i >= 0; --i) {
ll d = s[i] - '0';
md = (pow10 * d + md) % p;
mods[md]++;
pow10 = pow10 * 10 % p;
}
for (int i = 0; i < mods.size(); ++i) {
if (mods[i] >= 2) {
ans += mods[i] * (mods[i] - 1) / 2;
}
}
cout << ans << "\n";
}
| 0
| 93,693,900
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<vector<int> > S(M);
int P[M];
for(int i=0;i<M;i++){
int k=0;
cin >> k;
S[i].resize(k);
for(int j=0;j<k;j++){
int s;
cin >> s;
S[i][j]=s-1;
}
}
for(int p=0;p<M;p++){
cin>>P[p];
}
int goal = 0;
for (int bit = 0; bit < (1<<N); ++bit){
bool sw = true;
for (int j=0;j<M;j++){
int ans =0;
for (int i = 0; i < (int)S[j].size(); ++i) {
if (bit & (1<<S[j][i])) {
ans += 1;
}
}
if (ans%2 != P[j]){
sw = false;
break;
}
}
if(sw) goal++;
}
cout << goal <<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void hr() {
cerr << "--------------" << endl;
}
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
int mx = (n - 1) * (n - 2) / 2;
if (mx < k) {
puts("-1");
return 0;
}
vector<P> ans;
rep(i, 0, n - 1) { ans.push_back(P(i + 1, n)); }
int add = mx - k;
vector<P> edge;
rep(i, 0, n - 1) rep(j, 0, i) edge.push_back(P(i + 1, j + 1));
rep(i, 0, add) ans.push_back(edge[i]);
cout << ans.size() << endl;
rep(i, 0, ans.size()) {
cout << ans[i].first << " " << ans[i].second << endl;
}
return 0;
}
| 0
| 10,596,445
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
int n;
cin >> n;
int sum = 0;
for(int i = 1; i<= n ;i++){
sum+=i;
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int> >
#define pii pair<int,int>
#define piii pair<int,pair<int,int> >
#define pll pair<ll,ll>
#define vii vector<pii>
#define min_pq priority_queue<int,vector<int>,greater<int> >
#define sz(v) ((int)(v).size())
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define unq(c) (sort(all(c)), c.resize(distance(c.begin(),unique(all(c)))))
#define get_pos(c,x) (lower_bound(all(c),x)-c.begin())
#define MS0(v) memset((v), 0, sizeof((v)))
#define MS1(v) memset((v), -1, sizeof((v)))
#define LEN(v) strlen(v)
#define MP make_pair
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define sc scanf
#define pf printf
#define endl "\n"
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define shuffle(v) (random_shuffle(all(v)))
#define min_ele(v) (*min_element(all(v)))
#define max_ele(v) (*max_element(all(v)))
#define is_equal(x, y) (abs(x-y)<eps)
#define cnt_ele(v, x) (count(all(v), x))
#define sum_ele(v) (accumulate(all(v),0))
#define pro_ele(v) (accumulate(all(v),1, multiplies<int>()))
#define init_range(v, x) (iota(all(v),x))
#define ran(a, b) ((((rand() << 15) ^ rand()) % ((b) - (a) + 1)) + (a))
inline int random(int _min, int _max) { static bool first = true; if (first) { srand(time(NULL)); first = false; } return _min + rand() % (( _max + 1 ) - _min); }
#define TEST_CASE int ___T; cin>>___T; for(int cs=1;cs<=___T;cs++)
#define PRINT_CASE cout << "Case " << cs << ": ";
#define PRINT_CASEN cout << "Case " << cs << ":\n";
template<class T>inline bool read(T &x) {int c=getchar();int sgn=1;while(~c&&c<'0'||c>'9'){if(c=='-')sgn=-1;c=getchar();}for(x=0;~c&&'0'<=c&&c<='9';c=getchar())x=x*10+c-'0'; x*=sgn; return ~c;}
#define vpf(v) for(int i=0;i<v.size();i++){cout<<v[i];if(i!=v.size()-1)cout<<" ";else cout<<"\n";}
#define vsc(v) for(int i=0;i<v.size();i++)cin>>v[i];
#define FOR(i, a, b, stp) for(int i = (a); i <= (b); i+=stp)
#define ROF(i, a, b, stp) for(int i = (a); i >= (b); i-=stp)
#define intmx INT_MAX
#define inf 1llu<<61
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
#define MAX 100010
#define eps 1e-9
inline ll exp(ll a, ll b) { a %= MOD; ll res = 1; while (b > 0) { if(b & 1) { res = res * a % MOD; } a = a * a % MOD; b >>= 1; } return res; }
inline int add(int a, int b) { a += b; if(a >= MOD) a -= MOD; return a; }
inline int sub(int a, int b) { a -= b; if(a < 0) a += MOD; return a; }
inline int multi(ll a, ll b) { a *= b; if(a >= MOD) a %= MOD; return a; }
inline int on_bit(int N,int pos) {return N = N | (1<<pos);}
inline int off_bit(int N,int pos) {return N = N & ~(1<<pos);}
inline bool check_bit(ll N,int pos) {return (bool)(N & (1<<pos));}
#define on_bit_cnt(x) (__builtin_popcount(x))
#define on_bit_cntll(x) (__builtin_popcountll(x))
#define start_clock clock_t tStart = clock()
#define end_clock printf("\n>>Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fileio freopen("in.txt","r",stdin);freopen("out.txt","w",stdout)
bool used[200005];
vi adj[200005];
int dfs(int u) {
used[u] = 1;
int ret = 1;
for(auto v : adj[u]) {
if(!used[v]) {
ret += dfs(v);
}
}
return ret;
}
int main() {
int n, m; cin >> n >> m;
for(int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
int ans = 0;
for(int i = 1; i <= n; i++) {
if(!used[i]) {
ans = max(ans, dfs(i));
}
}
cout << ans << "\n";
return 0;
}
| 0
| 11,180,279
|
#include <cstdio>
long long n, m, a, x, y, M=1e9+7;
int main() {
int i;
scanf("%lld%lld", &n, &m);
for(i=0; i<n; i++) {
scanf("%lld", &a);
x += a * (i-(n-1-i));
}
x %= M;
for(i=0; i<m; i++) {
scanf("%lld", &a);
y += a * (i-(m-1-i));
}
y %= M;
printf("%lld", x*y%M);
return 0;
}
|
#include<iostream>
using namespace std;
void bubbleSort( int* a, int n )
{
for( int i = 0; i < n; i++ )
for( int j = n - 1; j >= i + 1; j-- )
{
if( a[j] < a[j-1] )
{
int t = a[j];
a[j] = a[j-1];
a[j-1] = t;
}
}
}
int main()
{
int n, a[1000];
while( cin >> n )
{
if( !n )
break;
for( int i = 0; i < n; i++ )
cin >> a[i];
bubbleSort( a, n );
int min = 1000000000;
for( int i = 0; i < n - 1; i++ )
if( a[i+1] - a[i] < min )
min = a[i+1] - a[i];
cout << min << endl;
}
return 0;
}
| 0
| 100,576,812
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
string s;
cin >> s;
cout << (s[0] == s[1] && s[1] == s[2] ? "No" : "Yes") << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int H, W;
cin >> H >> W ;
while(H!=0 || W!=0){
for (int h = 0; h< H; h++){
for ( int w = 0; w < W; w++){
if (h==0 || h==H-1 ||w==0 ||w==W-1){
cout << '#';
}else
{
cout << '.';
}
}
cout << endl;
}
cout << endl;
cin >> H >> W ;
}
}
| 0
| 15,905,496
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
string s;
int c = 0;
cin >> s;
string t = s;
int a = s.size();
rep(i,a){
t[s.size() - i-1] = s[i];
}
int counts =0;
rep(i,a){
if(s[i] == t[i]) counts++;
}
if(counts != a) cout << "No" << endl;
else{
int b = (a-1)/2;
rep(i,b){
if(s[i] == t[i+b+1] && s[i+b+1] == t[i]) c++;
}
if(c == b) cout << "Yes" << endl;
else cout << "No" << endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int n;cin>>n;
vector<ll> a(n),b(n);
for(auto &i:a)cin>>i;
for(auto &i:b)cin>>i;
if(accumulate(a.begin(),a.end(),0ll)>accumulate(b.begin(),b.end(),0ll)){cout<<"No";return 0;}
for(int i=0;i<n;i++)b[i]-=a[i];
ll aa=0,bb=0;
for(int i=0;i<n;i++){
if(b[i]>0)aa+=(b[i])/2;
else if(b[i]<0)bb+=-b[i];
}
if(aa>=bb)cout<<"Yes";
else cout<<"No";
}
| 0
| 15,918,010
|
#include<iostream>
#include<vector>
using namespace std;
void func(int &y, int &m, int &d){
d++;
if(y%3==0){
if(d>20)m++,d=1;
}
else if(m%2==1){
if(d>20)m++,d=1;
}
else if(d>19)m++,d=1;
if(m>10)y++,m=1;
}
int main(void){
int n;
cin >> n;
while(n--){
int y,m,d;
cin >> y >> m >> d;
int ans=0;
while(!(y==1000 && m==1 && d==1)){
func(y,m,d);
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n,i,l=1e4,m=0,c=1e9,j,s; cin>>n;
vector<ll>a;
for(i=0;i<n;i++)
{cin>>l; a.pb(l); }
sort(a.begin(),a.end());
for(i=a[0];i<=a[n-1];i++)
{ s=0;
for(j=0;j<n;j++)
{
s+=(i-a[j])*(i-a[j]);
}
c=min(c,s);
}
cout<<c;
return 0;
}
| 0
| 64,394,957
|
#include "bits/stdc++.h"
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
using LL = long long int;
using LD = long double;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;
const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
if (y + r <= h && x + r <= w && y - r >= 0 && x- r >= 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main(int argc, char **argv)
{
int N, K;
string S;
cin >> N >> K >> S;
int c[N + 2];
REP(i, N + 2) c[i] = 0;
int itr = 0;
bool f = (S[0] == '0')? true : false;
if (f) {
c[0] = 0;
itr++;
}
c[itr]++;
FOR(i, 1, N) {
if (S[i] == S[i - 1]) {
c[itr]++;
}
else {
itr++;
c[itr]++;
}
}
itr++;
if (S[N - 1] == '0') {
c[itr] = 0;
itr++;
}
int sum = c[0];
for (int i = 0; i < K; ++i) {
if (i * 2 + 1 < itr) sum += c[i * 2 + 1];
if (i * 2 + 2 < itr) sum += c[i * 2 + 2];
}
int maxSum = sum;
int start = 2 * K + 1;
int rstart = 0;
for (int i = start; i < itr; i += 2, rstart += 2) {
sum -= c[rstart];
sum -= c[rstart + 1];
sum += c[i];
sum += c[i + 1];
if (sum > maxSum) maxSum = sum;
}
cout << maxSum << endl;
return 0;
}
| 0
| 22,003,161
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
set<int> S;
for (int i=1; i<=N; i++){
S.insert(i);
}
for (int i=0; i<K; i++){
int d;
cin >> d;
for (int j=0; j<d; j++){
int e;
cin >> e;
S.erase(e);
}
}
cout << S.size() << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF=1e18;
const int MOD=1e9+7;
signed main(){
string L;cin>>L;
int N=L.size();
int dpk[N+1];
int dpm[N+1];
REPS(i,N){
int d=L[i-1]-'0';
if(i==1){
dpk[1]=1;
dpm[1]=2;
}
else{
dpk[i]=dpk[i-1]*3%MOD;
dpm[i]=dpm[i-1];
if(d==1){
dpk[i]+=dpm[i-1];
dpm[i]+=dpm[i-1];
dpk[i]%=MOD;
dpm[i]%=MOD;
}
}
}
cout<<(dpk[N]+dpm[N])%MOD<<endl;
}
| 0
| 43,646,868
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int n;
vector<vi> a;
vi now;
void dfs(int d) {
if (d == n) {
a.pb(now);
return;
}
rep1(i, n) {
bool used = false;
rep(j, d) if (now[j] == i) used = true;
if (used) continue;
now[d] = i;
dfs(d+1);
}
}
int main(){
cin >> n;
vi p(n), q(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
now = vi(n);
dfs(0);
int pnum = 0, qnum = 0;
rep(i, sz(a)) {
if (a[i] == p) pnum = i;
if (a[i] == q) qnum = i;
}
cout << abs(pnum-qnum) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
ll add(ll a,ll b)
{
a%=M;
b%=M;
ll p = (a+b)%M;
return (p+M)%M;
}
ll mul(ll a,ll b)
{
a%=M;
b%=M;
ll p = (a*b)%M;
return (p+M)%M;
}
int main()
{
fastio;
string str;
cin>>str;
if((str[2]==str[3])&&(str[4]==str[5]))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
| 0
| 17,448,408
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const ll INF = 2e15;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main(){
ll n, k;
cin >> n >> k;
vl a(n);
rep(i,n){
cin >> a[i];
}
ll sum = 0;
rep(i,n){
ll p = 0;
ll q = 0;
for (ll j = i + 1; j < n; j++){
if(a[i]>a[j]){
p++;
}
}
for (ll j = 0; j < i+1;j++){
if(a[i]>a[j]){
q++;
}
}
sum += p * k;
sum %= MOD;
sum += (p+q) * (k * (k - 1) / 2 %MOD);
sum %= MOD;
}
sum %= MOD;
print(sum);
}
|
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
int main(){
int n;
cin>>n;
vector<int> a(n);
vector<bool> flags(10000000,false);
for(int i=0;i<n;i++){
cin>>a[i];
flags[a[i]]=true;
}
sort(a.begin(),a.end());
for(int now=a[0];now<1000005;){
now+=a[0];
flags[now]=false;
}
for(int i=1;i<n;i++){
int now=a[i];
if(now==a[i-1]){
flags[now]=false;
continue;
}
while(now<1000005){
now+=a[i];
flags[now]=false;
}
}
int ans=0;
for(int i=0;i<1000005;i++){
if(flags[i]) ans++;
}
cout<<ans<<endl;
}
| 0
| 34,763,433
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.