code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
using pint = pair<ll, ll>;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> out;
for (int i = 0; i < N; ++i) cin >> A[i];
sort(... | 0 |
#include <bits/stdc++.h>
// #include "ane.cpp"
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 100005;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
// comment to disable debug functions
#define DEBUG
// frequently used macros
#if __cplusplus >= ... | #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
using namespace s... | 1 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int l = (m+1)/2, r = m/2;
rep(i,l) cout << i+1 << " " << 2*l - i << endl;
rep(i,r) cout << 2*l + i+1 << " " << 2*(l+r) - i + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
int target = 0;
for (int i=0 ; i<n ; i++)
target += l + i;
int ans;
vector<int> pie(n);
for (int i=0 ; i<n ; i++){
for (int j=0 ; j<n ; j++){
if (i == j)
continue;
pie.at(i) += l + j;
... | 0 |
#include<iostream>
#include<string>
#include<array>
#include<algorithm>
#define MAX 50
using namespace std;
typedef struct {
string name;
double rate;
}hurvest;
bool cmp(const hurvest &a,const hurvest &b){
return a.rate > b.rate;
}
int main(){
array<hurvest,MAX> data;
int n,seed_cost,time_sum,time,value,F,... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll a[110];
int main(){
ll n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
ll ans=0;
for(int i=0;i<=min(n,k);i++)for(int j=0;j<=min(n,k)-i;j++){
vector<ll>v;
ll sum=0;
for(int l=1;l<=n;l++){
if((1<=l&&l<=i)||(... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 100... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
void addWordCount(const vector<string>& cards, unordered_map<string, int>& wordCount);
void subWordCount(const vector<string>& cards, unordered_map<string, int>& wordCount);
int main() {
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, point = 0, max = 0;
cin >> N;
vector<string> blue(N);
set<string> ch;
for (int i = 0; i < N; ++i)
{
cin >> blue.at(i);
ch.insert(blue.at(i));
}
cin >> M;
vector<string> red(M);
for (int i = 0; i... | 1 |
#include <iostream>
#include <climits>
using namespace std;
int main() {
int n; cin >> n;
int N[n], n_min = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> N[i];
if (N[i] < n_min) n_min = N[i];
}
for (int j = 1; j <= n_min; j++) {
bool div_all = true;
for (int i = 0; i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
#define all(x) begin((x)), end((x))
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#define all(c) (c).begin(),(c).end()
using namespace std;
int mergecount(vector<int> &a) {
int count=0,n=a.size();
if (n>1){
vector<int>b(a.begin(),a.begin()+n/2);
vector<int>c(a.begin()+n/2,a.end());
count+=mergecount(b);
count+=mergecount(c... | #include <cstdio>
#include <iostream>
using namespace std;
namespace {
// BubbleSort sorts the array |a| in ascending order, and then returns
// the number of swap operations.
int BubbleSort(int* a, int n) {
int nswap = 0;
bool flag = true;
while (flag) {
flag = false;
for (int j = n - 1; j >= 1; --j) ... | 1 |
#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)
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
while (cin >> n, n) {
ll data[4001] = {};
bool uni[4001] = {};
vi order;
REP(i, n) {
ll a, b, c;
scanf("%lld %lld... | #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <sstream>
using namespace std;
#defi... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
typedef long long ll;
ll a[N],n,m,v,p;
int ans;
bool cmp(ll x,ll y) {
return x>y;
}
int main() {
scanf("%lld%lld%lld%lld",&n,&m,&v,&p);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
sort(a+1,a+n+1,cmp);
ll d=a[p];
ans=p;
for(ll i=p+1;i<=n;i++) {
... | #include <iostream>
using namespace std;
long long numOfInvs(int a[], int from, int to, int t[]) {
if (from == to) {
return 0LL;
}
int mid = (from + to) / 2;
long long n = numOfInvs(a, from, mid, t) + numOfInvs(a, mid + 1, to, t);
int i = from, j = mid + 1, k = 0;
while (i <= mid && j <= to) {
if (a[i] <= a[... | 0 |
#include <bits/stdc++.h>
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
using namespace std;
int main(){
io
string s;
cin >> s;
int smaller = INT_MAX;
for(int i(0); i<s.length()-2; i++){
char temp[3... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(stri... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 5e5 + 2;
int main() {
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n, x;
cin >> n >> x;
ll a[n];
for (int i = 0; i < n; i++) cin >> a[i];... | #include "bits/stdc++.h"
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const long long INF = 100000000;
int dp[300100][2];
int main()
{
int N; cin >> N;
string S; cin >> S;
dp[0][0] = 0;
dp[0][1] = 0;
for (int i = 1; i < N; i++) if (S.at... | 0 |
#include<iostream>
int main() {
int N,X,T;
std::cin >> N >> X >> T;
int tmp;
tmp = N / X;
if (N%X != 0) { tmp += 1; }
std::cout << tmp * T << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using V = vector<T>;
template<class T, class U> ... | #include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | 0 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
using lld = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b)
{
if (a < b)
{
return gcd(b, a);
}
while (b != 0)
... | #include <iostream>
using namespace std;
int main(){
int n;
int a[100001];
bool b[100001];
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int x = a[n - 1];
int i = -1;
for(int j = 0; j < n - 1; j++){
if(a[j] <= x){
i++;
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
int tmp = a[i + 1];... | 0 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define SZ 1234567
int n,h_[SZ+SZ],*h=h_,dt=0; char s[SZ],t[SZ];
int main()
{
scanf("%d%s%s",&n,s+1,t+1);
if(strcmp(s+1,t+1)==0)
{
puts("0");
return 0;
}
int cr=n,cl=n+1,ans=0;
for(int i=n;i>=1;--i)
{
if(t[i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
using namespace std;
int n;
vector < vector<int>... | 0 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double x1, x2, y1, y2, dis;
cin >> x1 >> y1 >> x2 >> y2;
dis = sqrt(pow(x2 - x1,2.0) + pow(y2 - y1,2.0));
cout << fixed << dis <<endl;
return 0;
} | //AOJ:Daice 1
//??????????????£?????¬?????????????????????????\?
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
int main(){
//nwes
int scube[4][6]={{2,6,3,4,1,5},{3,2,6,1,5,4},{4,2,1,6,5,3},{5,1,3,4,6,2}};
int cube[6],kcube[6];
char sk[102];
for(int i=1;i<=6;i++) scanf("%d",&cube[i])... | 0 |
#include <stdio.h>
int main()
{
int j,i,n,ice[10],in;
scanf("%d",&n);
while(n != 0){
for(i = 0; i < 10; i++){
ice[i] = 0;
}
for(i = 0; i < n; i++){
scanf("%d",&in);
ice[in]++;
}
for(i = 0; i < 10; i++){
if(ice[i] == 0){
printf("-");
}
for(j = 0; j < ice[i]; j++){
printf("*");... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b)... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a,b; cin >> a >> b;
if(a<9&&b<9){
cout << "Yay!";
}
else{
cout << ":(";
}
}
| #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; ... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const char ok = '1';
const char no = '0';
struct P{
int x;
int y;
int z;
};
int main()
{
int a, b, c, n, v;
char ch[301];
P p;
while(cin>>a>>b>>c && (a+b+c)){
cin >> n;
fill(ch, ch+301, '2');
vector<P> vec;
while(n--... | #include<bits/stdc++.h>
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define re register
#define rep(i,m,n) for(int i=m;i<=n;i++)
#define per(i,n,... | 0 |
#include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 7;
int n, k;
int bit[N];
int ar[N];
void add(int x, int val)
{
while (x < N)
bit[x] += val, x += (x & -x);
}
int sum(int x)
{
int res = 0;
while (x)
res += bit[x], x -= (x & -x);
return res;
}
//Lamps with N radius
int getMax()
{
int res = 0... | #include <bits/stdc++.h>
#if DEBUG
template <typename Iter>
void debug_iter(Iter begin, Iter end);
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, size_t N>
void debug(const std::array<T, N>& a) {
debug_iter(a.begin(), a.end());
}
template <typename T>
void debug(cons... | 1 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;
#define NUM 2147483647
int N = 1;
int* data;
void init(int first_N){
wh... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define INIVAL 2147483647
int *a, *ts, c, s, t, v;
void update(int k, int l, int r)
{
if (r<s || t<=l) return;
if (s<=l && r<=t) {
a[k] = v;
ts[k] = c;
} else if (l<r-1) {
update(((k+1)<<1)-1, l, (l+r)>>1);
update((k+1)<<1, (l+r)>>1, r);
... | 1 |
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
string str;
cin>>str;
for(int i = 0;i<str.length();i++)
cout<<str[str.length()-(i+1)];
cout<<"\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
while(1){
cin>>str;
if (cin.eof())
break;
for(int i = (str.size()-1); i>=0; i--)
cout<<str[i];
cout<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
double kitaichi(vector<int> p, int start, int k){
double ans;
for (int i = 0; i < k; i++){
double sum = 0;
for (int j = 1; j <= p[start+i]; j++){
sum += j;
}
ans += sum/p[start+i];
}
return ans;
}
int main() {
cin >> n >> k;
... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | 0 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
while(1){
int n,a,u[10]={0,1,2,3,4,5,6,7,8,9},p[10]={};
cin >> n;
if(n==0)return 0;
for(int i=0;i<n;i++){
cin >> a;
for(int i=0;i<10;i++){
if(a==u[i])p[i]=p[i]+1;
/*cout << "p["<< i << "]=" << p[i];*/
}
/*cout << endl;*... | #include<iostream>
using namespace std;
int main(){
int n[20];
int c[20][10];
int l =0;
int k;
while(cin >> n[l]){
if(n[l] == 0){break;}
for (int i = 0; i< 10; i++){
c[l][i] = 0;
}
for(int i= 0;i < n[l] ;i++){
cin >> k;
c[l][k] ++;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES"... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >>t;
int ans = s.size() + t.size();
int i = n;
int j = 0;
int leng = 1;
int counts = 0;
int kouho = 0;
int kotae = s.s... | 0 |
#include<bits/stdc++.h>
#define maxn 100005
using namespace std;
int n,m;
int main()
{
int x,y,l=0,r=maxn;
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
l=max(x,l),r=min(y,r);
}
if(l>r)printf("0");
else printf("%d\n",r-l+1);
return 0;
} | #include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
int m,n;
int mp[100005];
scanf("%d %d",&m,&n);
memset(mp,0,sizeof(mp));
int t=n;
while(t--)
{
int l,r;
scanf("%d %d",&l,&r);
for(int i=l;i<=r;i++)
{
mp[i]++;
}
}
int sum=0;
for(int ... | 1 |
#include <cstdio>
int a[100010],sum[2],n;
bool flag;
int gcd(int a,int b)
{
if (b==0) return a;
else return gcd(b,a%b);
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if (a[i]>1) sum[a[i]&1]++;
}
if (n==1)
{
if (a[1]&1) printf("Second\n");
else printf("First\n");
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 510000;
static const ll MOD = 1000000007;
int main(){
int N;
cin>>N;
vector<ll> A(N);
for(int i=0; i<N; i++) cin>>A[i];
vector<ll> color(3,0);
ll ans = 1;
for(int i=0; i<N; i++){
ll kake = ... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
double a[10];
double v[2];
double ans;
while(scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9],&v[0],&v[1]) != EOF)
{
double all = 0;
double kari = 0;
for(int i = 0;i ... | #include <iostream>
#include <stack>
using namespace std;
int main(){
double l[10], t[10], a, b;
char c;
while(cin >> l[0] >> c){
t[0] = l[0];
for(int i = 1;i< 10;i++){cin >> l[i] >> c;t[i] = t[i-1] + l[i];}
cin >> a >> c >> b;
double tmp = t[9]/(a+b)*a;
int ans = 1;
while(tmp > t[ans-1]){
ans++;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
int w;
cin >> s >> w;
string result;
for (int i = 0; i < s.size(); i += w) {
result += s[i];
}
cout << result << '\n';
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll A,ll B){
if (A%B==0)return(B);
else return(gcd(B,A%B));
}
ll keta(ll N){
int tmp{};
wh... | 1 |
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int main() {
double PI = 3.14159265358979, R; cin >> R;
printf("%.12lf\n", 2.0 * R * PI);
return 0;
} | #include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | #include<bits/stdc++.h>
using namespace std;
int read() {
char cc = getchar(); int cn = 0, flus = 1;
while(cc < '0' || cc > '9') { if( cc == '-' ) flus = -flus; cc = getchar(); }
while(cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
return cn * flus;
}
const int N = 1000 + 5 ;
#def... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
long long n=s.size();
for(long long i=0;i<n-1;i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2 << endl;
return 0;
}
}
for(long long i=0;i<n-2;i++){
... | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼ [￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣ 仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／ | 「ときめき」みたいなものを感じて... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
int N; cin >> N;
vector<int> A(N); for(int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
ll ans = 0;
for(int i = N-1; i >= 0; i--){
for(int j =... | //include
//------------------------------------------
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <ss... | 1 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T... | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>... | #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 = 1e6 ... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// Optimization
//#pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#d... | #include<iostream>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//1000000000000223
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, m, vis[1009], vis2[1009],par[1009],go[1009][1009] ;
vector<int> v[1009];
vecto... | 0 |
#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;
int main() {
string n;
cin >> n;
string ans = "No";
rep(i, 3) if (n[i] == '7') ans = "Yes";
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
if(n%10==7||n/10%10==7||n/100%10==7) cout<<"Yes"; else cout<<"No";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
#define dint long double
// tourist
bool cmp(pii a, pii b) {
return (a.first + a.second < b.first + b.second);
}
const int inf = 1e18;
void solve() {
int n; cin >> n... | #include <bits/stdc++.h>
using namespace std;
void recursive_comb(int *indexes, int s, int rest, function<void(int *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0) return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}... | 0 |
//%std
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read()
{
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-')
fh = -1, jp = getchar();
while (jp >= '0' && jp <= '9')
out = out * 10 + jp - '0', jp = getchar();... | #include <bits/stdc++.h>
using namespace std;
const int N = 305, M = 998244353;
int dp[N][N][N];
vector<int> a;
int k;
int solve(int x, int cur, int rem) {
if (cur > k || rem < 0) return 0;
if (x == -1) return (rem == 0);
int &ret = dp[x][cur][rem];
if (~ret) return ret;
ret = 0;
for (int i = 0; i <= a[x... | 1 |
#include <vector>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m = min(__builtin_ctz(a), m);
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N, A;
cin >> N;
int times = 0;
int answer = 30;
for (int i=0; i < N; i++) {
cin >> A;
while (A % 2 == 0) {
times +=1;
A /=2;
}
if (times <= answer) answer ... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n=2;
vector<int> p[2];
int ans[2];
for(int i=0;i<n;++i){
for(int j=0,point;j<10;++j){
cin>>point;
p[i].push_back(point);
}
sort(p[i].begin(),p[i].end(),greater<int>());
ans[i]=p[i][0]+p[i][1]+p[i][2];
}
f... | #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
int main(){
int a[12];
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d"
,&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9],&a[10],&a[... | 0 |
#include <iostream>
using namespace std;
int main() {
string s;
while(cin>>s){
int l=s.length();
for(int i=0;i<l;i++){
if(i==0) cout<<'2';
else if(i==1) cout<<'0';
else if(i==2) cout<<'1';
else if(i==3) cout<<'8';
else cout<<s[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int P,Q,R,a,b,c,d;
cin>>P>>Q>>R;
a=P+Q;
b=Q+R;
c=R+P;
d=min({a,b,c});
cout<<d<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
vector<ll> v;
for(int i = 0; i < n; i++){
auto itr = lower_bound(v.begin(), v.end(), a[i]);
if(i == 0){
v... | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>
usin... | 0 |
#include <stdio.h>
int main() {
int rows, columns, n, tempR = 1, tempC = 1;
scanf("%d %d %d", &rows, &columns, &n);
int i = 1, j = 1;
while(tempR < n && i <= rows) {
tempR = i * columns;
i++;
}
while(tempC < n && j <= columns) {
tempC = j * rows;
j++;
}
if(i == 1 && j == 1) printf ("1... | #include<bits/stdc++.h>
using namespace std;
#define maxn 1000010
template <typename T>inline T read()
{
register T sum=0;
register char cc=getchar();
int sym=1;
while(cc!='-'&&(cc>'9'||cc<'0'))cc=getchar();
if(cc=='-')sym=-1,cc=getchar();
sum=sum*10+cc-'0';
cc=getchar();
while(cc>='0'&&... | 0 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int i,a[10],b[10],s,ss;
for(i=0;i<10;i++){
scanf("%d",&a[i]);
// printf("a=%d\n",a[i]);
}
sort(a,a+10);
for(i=0;i<10;i++){
}
for(i=0;i<10;i++){
scanf("%d",&b[i]);
}
sort(b,b+10);
for(i=0;i<10;i++){
}
s=a[7]+a[8]+a[9];
s... | #include <iostream>
using namespace std;
int getResult(int N, int H, int W){
int hPattern = N - H + 1;
int wPattern = N - W + 1;
if(hPattern <= 0 || wPattern <= 0) return 0;
return hPattern * wPattern;
}
int main(){
int N, H, W;
cin >> N >> H >> W;
int result = getResult(N, H, W);
cout << result;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) (V).begin(),(V).end()
#define MOD 1000000007
#define mod 998244353
int rw[100010];
vector<int> W[100010];
int main(){
for (int i = 0;i < 100010;i++)rw[i] = -1;
ll N, L;
cin >> N;
vector<ll> X(N);
for (int i = 0;i < N;i++)
cin >> ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int line[110][110],col[110][110];
short dp[101][101][101][101];
int main()
{
int n,m,x,y;scanf("%d%d\n",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
line[i][j]=line[i][j-1];col[i][j]=col[i-1][j];
char ch=getchar();
if (ch=='E') {x=i;y=j;}
else if (ch==... | #include <bits/stdc++.h>
using namespace std;
void chmax(int& a, int b){
a = max(a, b);
}
int main(){
int H, W;
cin >> H >> W;
string S[101];
S[0] = string('!', W+1);
int ER, EC;
for(int i=1; i<=H; i++){
cin >> S[i];
S[i].insert(0, "!");
if(S[i].find('E') != -1){
... | 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> ii;
int fact[2000005];
int mod = 998244353;
long long qexp(long long b, long long p){
long long res = 1;
while(p){
if(p&1) res = (res * b) % mod;
b = (b * b) % mod;
p >>= 1;
}
return res;
... | //c++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#inclu... | 1 |
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using namespace atcoder;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll a[500010];
int main(){
... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(in... | 0 |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vii = vector<vi>;
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
#defi... | 1 |
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int,P> Pa;
int a, b, c, n;
vector<Pa> test;
int A[100], B[100], C[100];
int main(){
while(scanf("%d%d%d", &a, &b, &c)){
if(a == 0 && b == 0 && c == 0) break;
vector<Pa> test;
for(int i = 0; i < 100; i... | #include <iostream>
using namespace std;
int main(){
while(1){
int a, b, c, n, list[1001][4], parts[301], judge, defect;
cin >> a >> b >> c >> n;
if(a == 0 && b == 0 && c == 0){
break;
}
for(int i = 1; i <= a + b + c; i++){
parts[i] = 2;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char arr[10];
scanf("%s", arr);
int rCount = 0, ans = 0;
for (int i = 0; i < 3; ++i) {
if (arr[i] == 'R') {
rCount++;
} else {
ans = max(ans, rCount);
rCount = 0;
}
}
ans = max(ans, rCount);
printf("%d\n", ans);
... | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int N;
cin >> N;
cout << N / 3 << endl;
}
| 0 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1001, M = 2001;
int n, m, a, b;
vector<int> edge[N];
vector<int> path;
unordered_map<int, int> mp;
bool check(int from, int to) {
int s = mp[from];
int e = mp[to];
// index [s, e] in path
for (int i =... | 1 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | //Name: Baseball Simulation
//Level: 1
//Category: やるだけ
//Note:
/**
* 仕様のとおりに実装する。
*
* オーダーは O(E)。
* ただし、Eはイベントの個数。
*/
#include <iostream>
#include <string>
using namespace std;
bool solve() {
int out = 0;
int b1 = 0, b2 = 0, b3 = 0;
int score = 0;
while(out < 3) {
string event;
... | 0 |
#define _GLIBCXX_DEBUG //vectorの範囲外アクセスなどのエラーメッセージが分かりやすくなるらしい
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
//#include <algorithm>
// using namespace std;
#include<numeric>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<s... | #include <iostream>
#include<iomanip>
using namespace std;
int main() {
int n;
while (cin >> n) {
if(n == 0)
break;
int A[51][51] = {};
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
cin >> A[i][j];
A[i][n] += A[i][j];
A[n][j] += A[i][j];
}
... | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <cstdint>
#include <istream>
#include <sstream>
#include <cctype>
#include <functional>
#include <iomanip>
#define rep(i,N) for(ll i=0;i<N;i++)
#define disp(a) cou... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=(a),_ed=(b);i<=_ed;++i)
#define DREP(i,a,b) for(int i=(a),_ed=(b);i>=_ed;--i)
typedef long long ll;
inline int read(){
register int x=0,f=1;register char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch... | 0 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
bool Solve(int n, const vector<int>& xs) {
if (n == 1) {
return false;
}
int even_count = 0;
for (int x : xs) {
if (x % 2 == 0) even_count++;
}
if (n % 2 == 0) {
return even_count % 2 == 1;
} e... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
constexpr ll mod = 1000000007;
int main() {
int n;
scanf("%d",&n);
map<int,int> mp;
for(int i = 2; i <= n; i++) {
int m = i;
for(int j = 2; j <= n; j++) {
... | 0 |
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fitr(it,it1,itr2) for(auto it=itr1;it!=itr2;++it)
#define fall(a) a.begin(),a.end()
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x;
cin >> x;
int64_t a = x/11*2;
if(x%11 == 0){
cout << a << endl;
}
else if(x%11 <= 6){
cout << a+1 << endl;
}
else{
cout << a+2 << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
ll x;
cin>>x;
ll d=x/11;
ll r=x%11;
if(0==r){
cout<<2*d<<endl;
}else{
if(r<7){
cout<<2*d+1ll<<endl;
... | 1 |
/**
* Sergey Kopeliovich (burunduk30@gmail.com)
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 998244353;
typedef long long ll;
inline void add( int &a, int b ) { if ((a += b) >= MOD) a -= MOD; }
inline void sub( int &a, int b ) { if ((a -=... | #include<bits/stdc++.h>
#define fi first
#define se second
#define R register
#define mp make_pair
#define pb push_back
#define LL long long
#define Ldb long double
#define pii pair<int, int>
using namespace std;
const int N = 1e6 + 10;
const int mod = 998244353;
template <typename T> void read(T &x) {
int f = 0;
R ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int N = s.size();
bool b = true;
int l = 0, r = 0, eli = 0;
for (int i = 0; i < N; i++) {
if (!b && s[i] == 'S') {
b = true;
int p = min(l,r);
eli += 2*p;
l -= p; r = 0;
}
if (s[i] == 'S') l++... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 1000000007
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)... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n,m;
cin >> n >> m;
vector<int> box(n,10);
int ans = 0;
rep(i,m){
int s;
int c;
cin >> s >>c;
s--;
if(s==0&&c==0&&n!=1) ans = -1;
if(box[s]==c)continue;
if(box[s]==10)box[s]=c;
... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int MAXN=1e7+5;
int n,ans;
int deq[MAXN],l,r;
char s[MAXN],t[MAXN];
int main(){
scanf("%d%s%s",&n,s+1,t+1);
if(strcmp(s+1,t+1)==0) return puts("0"),0;
l=1,r=0;
for(int i=n,j=n... | 0 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long a,b[2],c[2],d[2];
string bb,cc,dd,s[2];
s[0]="+";
s[1]="-";
cin>>a;
b[0]=(a/100)%10;
b[1]=(-1)*b[0];
c[0]=(a/10)%10;
c[1]=(-1)*c[0];
d[... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep01(i, n) for(int i = 0; i < (n) + 1; i++)
#define rep10(i, n) for(int i = 1; i < (n);... | 1 |
#include <stdio.h>
#include <string.h>
int
main(void)
{
char line[100];
char res[100];
auto chksep = [](char c) -> bool {
return (c == ' ' || c == '.' || c == '\n');
};
while (fgets(line, sizeof line, stdin)) {
int len = strlen(line);
int state = 0;
for (int s = 0; s < 26; s++) {
for (int i = 0... | #include <cstdio>
#include <iostream>
using namespace std;
int main(){
int days[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
char week2[7][10] = {"Thursday","Friday","Saturday","Sunday","Monday","Tuesday","Wednesday"};
int month,day;
int sum;
cin >> month >> day;
while((month != 0) && (day != 0)){
sum = 0;
... | 0 |
/*input
abracadabra
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for... | #include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int main(){
string s;
cin >> s;
map<char, long long> T;
for(long long i = 0; i < s.size(); i++){
if(T.find(s[i]) == T.end()) T[s[i]] = 1;
else T[s[i]]++;
}
map<char, long long>::iterator it;
long lon... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, std::string S, long long Q, std::vector<long long> k)
{
for (ll i = 0; i < Q; i++) {
ll D = 0;
ll M = 0;
ll DM = 0;
ll DMC = 0;
ll ans = 0;
for (ll j = 0; j < N; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
using ll = long long;
using V = vector<int>;
using Vll = vector<ll>;
using VV = vector<V>;
using VVll = vector<Vll>;
char s[1000000];
ll t[3][1000001];
int main() {
int n, q;
scanf(... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | #include <bits/stdc++.h>
using namespace std;
typedef pair<char,int> P;
char S[1000001];
vector<P> V;
int main() {
scanf("%s",S);
char ch=S[0];
int cnt=0;
for(int i=0;S[i]!='\0';i++) {
if(ch==S[i]) {
cnt++;
}else {
V.push_back(P(ch,cnt));
cnt=1;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
... | #include <cstdio>
typedef long long ll;
inline ll rd(){
ll x=0,p=1;
char a=getchar();
while((a<48||a>57)&&a!='-')a=getchar();
if(a=='-')p=-p,a=getchar();
while(a>47&&a<58)x=(x<<1)+(x<<3)+(a&15),a=getchar();
return x*p;
}
const int N=2002;
const ll mod=1e9+7;
inline ll fpow(ll b,ll p,ll mod){
ll... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int> A(N), B(N), C(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
sort(A.begin(), A.end());
sort(B.b... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(true){
int n,m;
cin >> n ;
if(cin.eof()) break;
cin >> m;
vector<int> a(1000);
vector<int> b(1000);
vector<int> c(1000);
vector<bool> u(1000);
vector<int> ans(1000);
fill... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main(){
int n,m,r,q,w=0;
vector<int> a;
vector<int> c;
cin>>n>>m;
for(int i=0; i<n; ++i){
cin>>q;
a.push_back(q);
c.push_back(0);
}
for(int i=0; i<m; ++i){
cin>>q;
for(int ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
string S;
cin >> S;
string ans = "WA";
vector<int> up;
for (int i = 0; i < S.size(); ++i) {
if ('a' > S[i] || S[i] > 'z') {
up.push_back(i);
}
}
if (up.size() == 2 && up[0] == 0 && S[up[0]] =... | #include <bits/stdc++.h>
using namespace std;
int i,j,k,count1=0,count2=0;
int main(void){
int ans=0;
string s;
cin>>s;
if(s.length()%2==0){
for(i=0;i<s.length();i+=2){
if(s[i]=='h'&&s[i+1]=='i')count1++;
}
}
if(count1==s.length()/2)ans=1;
if(s.length()==1)ans=0;... | 0 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserv... | #include <bits/stdc++.h>
#define trans(x) add(nxt[ d[i][x] ], cur[i])
const int N = 300054, mod = 1000000007;
const int d[8][2] = {{2, 3}, {6, 6}, {4, 5}, {6, 7}, {2, 2}, {2, 3}, {1, 3}, {7, 7}};
int dp_[2][8], *cur = *dp_, *nxt = dp_[1];
char s[N];
inline int & add(int &x, const int y) {return x += y - mod, x += x ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll cnt[66][2];
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
ll a;cin>>a;
int bit=0;
while(a){
if(a&1){
cnt[bit][1]++;
}else cnt[bit][0]++;
a/=2;
bit++;
}
for(int j=bit;j<=64;j++)cnt[j][0]++;
}
ll an... | #include<bits/stdc++.h>
//#include<iostream>
using namespace std;
typedef long long ll;
const int N = 2000006;
const ll MOD = 1000000007;
ll a[N];
int bts[66];
int stb[66];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
ll ans = 0;
... | 1 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;
cin>>n;
int cn... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
const double PI = 3.14159265... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
printf("%d %d %d", z, x, y);
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define EPS 1e-6
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 10;
int T;
int main()
{
int a, b, c;
while(cin >> a >> b >> c){
cout << c << " " << a << " " << b << endl;
}
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int order[4000];
bool search(int);
class Member {
public:
Member() {sum = 0;}
void add(long price, long num) {
sum += (long long int)price*num;
}
bool milion()
{
if (sum >= 1000000) return true;
else return false;
}
private:
long long int sum;
int id;
};
... | #include <iostream>
using namespace std;
typedef long long ll;
//vector<pair<bool, ll>> v(4001);
unsigned long long int a[4001];
int main(){
int n, num, p, q;
while(cin >> n, n){
//fill(a, a+4001, 0);
int f = 1;
for(int i = 0;i < 4001;i++)a[i] = 0;
for(int i = 0;i < n;i++){
cin >> num >> p >> q;
a[num]... | 1 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define si short int
using namespace std;
const int N=101;
si n,m,x,y,ans,dp[N][N][N][N],sum[N][N];
char g[N][N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
... | #include<bits/stdc++.h>
using namespace std;
#define MAX 102
int h;
int w;
char buf[MAX][MAX];
short dp[MAX][MAX][MAX][MAX];
pair<int, int> E;
int im[MAX][MAX];
int gt(int a, int b){
if (a < 0 || b < 0){
return 0;
}
return im[a][b];
}
int rect(int x1, int x2, int y1, int y2){
return gt(x2, y2) + gt(x1 - 1, y1... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n),asum(n+1,0),bsum(n+1,0);
rep(i,n){
cin >> a[i];
asum[a[i]]++;
}
rep(i,n){
cin >> b[i];
bsum[b[i]]++;
}
rep(i,n+1){
if(asum[i] ... | #include <bits/stdc++.h>
#define maxn 200086
using namespace std;
int n;
int a[maxn], b[maxn];
int main(){
scanf("%d", &n);
for(int i = 1;i <= n;i++) scanf("%d", &a[i]);
for(int i = 1;i <= n;i++) scanf("%d", &b[i]);
reverse(b + 1, b + 1 + n);
int l = n, r = 1;
for(int i = 1;i <= n;i++){
if(a[i] == b[i]) l = ... | 1 |
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<climits>
#include<string.h>
using namespace std;
int main(){
int m,n1,n2;
while(cin>>m>>n1>>n2,m){
int p[202];
vector<pair<int,int> >v;
for(int i=... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | 0 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=100005;
int n,m,v,p,a[maxn],ans;
ll b[maxn];
inline int cmp1(int x,int y){
return x>y;
}
inline int read(){
int res=0,f_f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f_f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') res=(res<<3)... | 0 |
// time-limit: 2000
// 23
#include <bits/stdc++.h>
using namespace std;
#define coutc "\033[48;5;196m\033[38;5;15m"
#define endc "\033[0m"
#define endl '\n'
#define M(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) \
M(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep4(_, x, n, s) \
for (int _ = x; (s ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
int count = 0;
int ans = 1;
for (int i = 0; b > ans; i++)
{
ans += (a - 1);
count++;
}
cout <... | 1 |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX ... | #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int card[20000],i,j,a=0,b=0,c=1,n;
cin>>n;
while(n!=0){
for(i=0;i<2*n;i++){
cin>>card[i];
}
for(i=0;i<2*n;i=i+2){
if(card[i]>card[c]){
a=a+card[i]+card[c];
}
else if (card[i]==card[c]){
a=a+card[i];
b=b+card[c];
}
else{
b=b+card[i]+card[c];
}
c=c+2;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<int> r,p;
UnionFind(){}
UnionFind(int size){init(size);}
void init(int size){
r.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++) r[i]=1,p[i]=i;
}
int find(int x){
return (x==p[x]?x:p[x]=find(p[x]));
}
bool sam... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
... | #include <bits/stdc++.h>
using namespace std;
#define pr(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
#define mod 1000000007 // ((a- b)% mod+ mod)% mod... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300 + 10;
typedef long long ll;
const ll mod = 998244353;
int tot, K;
char s[maxn];
int a[maxn];
ll f[maxn][maxn][maxn];
ll ans;
inline ll norm(const ll & x) { return x >= mod ? x - mod : x;}
int main()
{
scanf("%s%d", s + 1, &K);
K = min(K, 300);
int le... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,L;
int result = 0;
int mini = 10000;
cin >> N >> L;
for(int a = 0;a < N;a++){
result += a + L;
if(abs(mini) > abs(a + L))mini = a + L;
}
cout << result - mini << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
... | #include<bits/stdc++.h>
#define ford(i,a,b) for(int i=(a);i>=b;i--)
#define rep1(i,a,b) for(int i=(a);(i)<=(b);(i)++)
#define rep(i,a,b) for(int i=(a);(i)<(b);(i)++)
#define ll long long
#define N 300005
#define pql priority_queue<ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define ... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
bool three(int x){
if(x%3==0)return true;
while(x>0){
if(x%10==3)return true;
x/=10;
}
return false;
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
if(three(i))cout<<" "<<i;
}
cout<<endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
string S;
int N;
int main(void)
{
cin >> S;
N = S.length();
int offset = 0;
int result = 0;
while(offset < N)
{
if(S[offset] == 'O')
{
int of = offset;
int c_O = 0;
while(S[of] == 'O')
{
of++;
c_O++;
}
bool OK = true;
f... | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef vector <bool> VB;
typedef vector <VB> VVB;
int main( void )
{
int n, m;
while ( cin >> n >> m && n && m )
{
VVB G( n+1, VB( n+1, false ) );
for ( int i = 0; i < m; i++ )
{
int a, b; // a-bツづ債友ツ達
cin >> a >> b;
G[a][b] = G[b][a] = tru... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int friends[500];
int n,m;
pair<int, int> student[10000];
int result[100];
int I = 0;
for (int i = 0;; i++)
{
cin >> n;
cin >> m;
if (m == 0 && n == 0)
{
break;
}
for (int a = 0; a < 500; a++)
{
friends[a] = 0;
stu... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1000000007;
const long double PI=3.1415926535;
int main() {
ll N;
cin>>N;
ll a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
ll ans=0,cnt=0,c=1;
if(a[0]!=0){
c=0;
}
for(int i=0;i<N;i++){
if(i==N-1){
ans+=a[i];
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define V(a) a.begin(), a.end()
typedef vector<int> vi;
int main()
{
vi a[2], C;
for (auto &i : a) {
int n;
cin >> n;
i = vi(n);
for (int &j : i)
cin >> j;
sort(V(i));
}
set_intersection(V(a[0]), V(a[1]), inserter(C, C.... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long double ld;
const int inf = 1e9;
const ll inf64 = 1e18;
const int mod = 998244353;
inline int _mul(int a, int ... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
/*
ID: skipian1
PROB:
LANG: C++11
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF = 2000000000
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define X first
#define Y second
ll MOD = 1e9+7;
int main() {
ll n;
cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll ... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 111;
r... | //#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i<=n ; i++)
#define... | 0 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli n, k;
int main(void){
cin >>... | #include <bits/stdc++.h>
#include <string>
using namespace std;
vector<bool> d(10, true);
bool isvalid(int n)
{
int dec = n % 10;
if(!d[dec]) return false;
if(n/10 != 0) return isvalid(n/10);
return true;
}
int main()
{
int k, n;
cin >> n >> k;
for (int i = 0; i < k; i++){
int tmp; cin >> tmp;
d[tmp] = f... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int d = INT_MAX;
for (int i = 0, n = s.length() - 3; i <= n; i++)
d = min(d, abs(atoi(s.substr(i, 3).c_str()) - 753));
cout << d << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
using namespace std;
using ll = long long;
using ... | 0 |
#include<stdio.h>
int GCD(int a, int b) {
int A, B, buff;
// A >= B
if (b > a) {
A = b; B = a;
}
else { A = a; B = b; }
while (A%B) {
buff = B;
B = A % B;
A = buff;
}
return B;
}
int main() {
int N, a, b, c;
int G;
int GC[1000000];
scanf("%d", &N);
if (!(N - 2)) {
scanf("%d %d", &a, &b);
G ... | #include<cstdio>
#include<algorithm>
#define N 100000
#define MAX (1<<31)-1
using namespace std;
int A[N], T[4*N], lazy[4*N];
void build(int l, int r, int k) {
if (l == r) {
T[k] = A[l];
return;
}
int mid = (l + r) / 2;
build(l, mid, k * 2);
build(mid + 1, r, k * 2 + 1);
T[k] = ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string s;
cin >> s;
long n=s.size();
vector<int>a(26);
rep(i,n){
a.at(s.at(i)-'a')++;
}
long ans=0;
rep(i,n){
ans+=n-a.at(s.... | #include <bits/stdc++.h>
using namespace std;
template<typename T, typename U>
using pv=vector<pair<T,U>>;
template<typename T>
using matrix=vector<vector<T>>;
template<typename T>
using pque=priority_queue<T>;
template<typename T>
using lpque=priority_queue<T,vector<T>,greater<T>>;
using ll=long long;
using intpair=... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.