code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include<iostream>
#include<bits/stdc++.h>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
long long int sum=0,count=0;
int i;
string s;
cin >> s;
for(i=s.size(); i>0; i--)
{
if(s[i-1]=='W')
count++;
if(s[i-1]=='B')
sum+=count;
}... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) { for (auto it = c.begin(); it != c.end(); ++it) if (it ==... | 0 | 38,907,810 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int l=1;
int N;
int K;
cin>>N;
cin>>K;
for(int i=0;i<N;i++)
{
if(l<K)l*=2;else l+=K;
}
cout<<l<<endl;
} | #include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | 0 | 93,409,520 |
#include <stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
printf("%d\n", 6 - A - B);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
long long int ans=0;
if(n%2==0)
{
n=n>>1;
while(n>0)
{
ans+=n/5;
n/=5;
}
}
cout<<ans<<endl;
} | 0 | 61,792,042 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for(int i=0; i<N; ++i) {
cin >> A[i];
if(i > 0) A[i] += A[i-1];
}
long long res = 1001001001001001;
for(int i=0; i+1<N; ++i) {
res = min(res, abs(A[N-1] - A[i] - A[i]))... | 0 | 72,831,371 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long Int;
Int n, k, sum, res;
Int a[108000];
int main(){
while(true){
cin >> n >> k;
if(n == 0 && k == 0)break;
for(int i = 0;i < n;i++){
cin >> a[i];
}
sum = 0;
for(int i = 0;i < k;i++){
sum += a[i];
}
res = sum;
for(int i... | #include<stdio.h>
#include<ctype.h>
int main(){
int i,c;
int cnt[128]={0};
while((c=getchar())!=EOF){
if(isupper(c)){
c=tolower(c);
}
cnt[c]++;
i++;
}
for(i=0;i<26;i++){
cnt[i+97]+=cnt[i+65];
printf("%c : %d\n",i+97,cnt[i+97]);
}
re... | 0 | 80,618,461 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
long long X, Y;
cin >> X >> Y;
long long ans = 0;
long long value = X;
while (value <= Y) {
value = value * 2;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define Rep(i,j,n) for(int i=j; i<n; i++)
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,P>
#define T tuple<int,int,int>
using n... | 0 | 39,832,425 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
string s,ans;
signed main(){
ios_base::sync_with_stdio(0);
cin>>s;
ans=""... | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
while(cin>>n>>m,n||m){
vector<P> v;
for(int i=0;i<n;i++){
int d,p;cin>>d>>p;
v.push_back(P(p,d));
}
int res=0;
... | 0 | 56,587,994 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int before_rating = 0;
int target_rating = 0;
cin >> before_rating >> target_rating;
double performance = 2 * target_rating - before_rating;
cout << performance << endl;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
vector<pair<double,double>> v;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); co... | 0 | 74,984,557 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int x = 0;
vector<int> dp(1<<26, 1e9);
dp[0] = 0;
for (char c : s) {
x ^= 1 << (c-'a');
for (int i = 0; i < 26; ++i) dp[x] = min(dp[x], dp[x ^ (1<<i)] + 1);
}
cout << max(1,dp[x]) << endl;
return 0;
} | #include <iostream>
int main() {
while( true ) {
int h , w ;
std::cin >> h >> w ;
if( h == 0 && w == 0 ) {
break ;
} else {
for( int i = 0 ; i < h ; i++ ) {
for( int ii = 0 ; ii < w ; ii++ ) {
std::cout << "#" ;
... | 0 | 39,480,418 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <ios>
#include <iomanip>
int main() {
int N,M;
std::cin >> N >> M;
std::vector<std::vector<int>> City(N+1,std::vector<int>(0,0));
std::vector<std::pair<int,int>> Input(M+1);
for(int i=1;i<M+1;i++){
int P_i... | 0 | 96,657,618 |
#include <stdio.h>
int main(){
int N;
char S[N];
scanf("%d", &N);
scanf("%s", S);
int yes = 0, no = 0;
if(N % 2 == 0){
for(int i = 0; i < (N / 2); i++){
if(S[i] == S[i + (N / 2)]){
yes++;
}else{
no++;
}
}
if(yes == N / 2){
printf("Yes");
}else{
printf("No");
}
}else{
printf("No... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,mod2;
cin >> N >> mod2;
int Nodd = 0;
int Neven= 0;
int buf;
for(int i=0; i<N; i++){
cin >> buf;
if(buf%2==1){ Nodd++; }
else { Neven++; }
}
int64_t ans= (Nodd==0) ? ((mod2==0) ? (1LL<<Neven)
... | 0 | 18,947,787 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,m;
cin >> n >> m;
if(n%2==1){
for(int i=1;i<=m;i++){
cout << i << " " << (n-i) << endl;
}
}
else{
int k = (m+1)/2;
for(int i=1;i<=k;i++){
cout << i << " " ... | 0 | 39,794,644 |
#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int *F;
int f(int n){
if(n == 0 || n == 1){
return F[n] = 1;
}
if(F[n] != 0){
return F[n];
}
return F[n] = f(n - 2) + f(n - 1);
}
int main(){
int n;
cin >> n;
F = new int[n + 1];
for(int i = 0; i <= n; i++){
F[i] = 0... | #include<bits/stdc++.h>
#define ll long long int
#define ff first
#define ss second
#define eps 1e-9
using namespace std;
int main()
{
ll t,n,m,f,a,b,c,l,r,q,k,x,y,z,ans,mn,mx,sum=0;
cin>>n;
vector< ll > arr(n+1),hr(n);
for(int i=0; i<=n; i++)
{
cin>>arr[i];
}
for(int i=0; i<n; i++)
... | 0 | 78,789,239 |
#include<iostream>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
bool dp1[17000][4001];
bool ch1[17000][4001];
bool dp2[17000][4001];
bool ch2[17000][4001];
vector<int> vt;
int n, m;
bool func1(int ch, int x)
{
if (x*2 >= vt.size())
{
if (ch == n) {
return 1;
}
... | #define rep(i,n) for (int i=0;i<n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N;
string S,T;
bool torf=false;
int i=0,j=0;
cin >> N >> S >> T;
while(i<N){
if(T.at(0)==S.at(i)){
while(j+i<N && T.at(j)==S.at(j+i)){
if(T.at(N-i-1)==S.at(N-1))
tor... | 0 | 7,541,132 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
ll X, Y, Z, K, ans=0, tmp=0;
vector<ll> Xs, Ys, Zs, XYs;
signed main(){
cin >> X >> Y >> Z >> K;
for(int i=0;i<X;i++) {
ll a;
cin >> a;
Xs.push_bac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin >> n >> m;
ll a[n][3];
for(ll i=0;i<n;i++){
for(ll j=0;j<3;j++){
cin >> a[i][j];
}
}
ll ans=-1e18;
for(ll bit=0;bit<(1<<3);bit++){
vector<ll> vec;
for(ll i=... | 0 | 63,499,045 |
#include <bits/stdc++.h>
template <typename T>
void update(T &x, const T &y) {
if (x > y) x = y;
}
const int MAX_N = 110, INF = 0x3f3f3f3f;
int n, m;
char s[MAX_N][MAX_N];
int dp[MAX_N][MAX_N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
}
dp[1][1] = s[1][1] == '#';
... | #include <bits/stdc++.h>
using namespace std;
void fail(){
cout << "Impossible" << endl;
exit(0);
}
int main(){
int N;
cin >> N;
int num[101] = {0};
int mx = 0;
for(int i=0; i<N; i++){
int a;
cin >> a;
mx = max(mx, a);
num[a]++;
}
if(num[mx] < 2) fail(... | 0 | 68,434,571 |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 6,273,470 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | #include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#define INF 999999999
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)... | 0 | 78,679,641 |
#include <stdio.h>
#include <vector>
#include <functional>
#include <queue>
#include <iostream>
using namespace std;
const int MAX_V=100000;
const int INF=1000000000;
int K;
struct edge {int to, cost;};
typedef pair<int,int> P;
vector<edge> G[MAX_V];
int d[MAX_V];
void dijkstra(int s){
priority_queue<P,vector<P>,grea... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typed... | 0 | 68,955,704 |
#include <iostream>
#define _USE_MATH_DEFINES
#include <cmath>
#include <utility>
#include <iomanip>
const double rad60 = 60 * M_PI / 180;
void koch_curve(std::pair<double, double> p1, std::pair<double, double> p2, int n) {
if (n == 0) return;
std::pair<double, double> s, t, u;
s.first = (2.0 * p1.first + 1... | #include<iostream>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c",&ch);
if(islower(ch) != 0){
ch =toupper(ch);
}
else if(isupper(ch)!=0){
ch=tolower(ch);
}
printf("%c",ch);
if(ch=='\... | 0 | 57,176,552 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
class Point {
public:
double x, y;
};
void koch(int n, Point a, Point b) {
if (n == 0)
return;... | #include <bits/stdc++.h>
using namespace std;
char s[200005];
long long ps[200005], pw[200005];
unordered_map <long long, int> cnt;
int main() {
int n, p;
scanf("%d%d", &n, &p);
scanf("%s", s);
if (p == 2 || p == 5) {
long long res = 0;
int cnt = 0;
for (int i = n - 1; i >= 0; i-... | 0 | 55,710,801 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
long long suma = 0, sumb = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
suma += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
sumb += b[i];
}
if (sumb > suma) {
... | #include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main()
{
#ifdef LOCAL_RUN
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
int n = s.size(), m... | 0 | 23,542,246 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> station;
for(int i=0; i<s.size(); i++){
station.insert(s.at(i));
}
if(station.size() == 2)
cout << "Yes";
else
cout << "No";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long int> vec(n);
for (int i = 0; i < n; i++){
long int a;
cin >> a;
vec.at(i) = a;
if(vec.at(i) == 0){
cout << 0 << endl;
return 0;
}
}
sort(vec.begin(),vec.end());
reverse(vec.begin(),vec.end... | 0 | 89,657,193 |
#include<iostream>
int main(){
for (size_t i = 1; i < 10; i++) {
for (size_t j = 1; j < 10; j++) {
std::cout << i <<"x"<<j<<"="<<i*j << '\n';
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());... | 0 | 99,066,677 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long lon... | #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 vec... | 0 | 64,376,499 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
ll sum(int n);
void go(){
string s,t;cin>>s>>t;
int a,b;cin>>a>>b;
string u;cin>>u;
if(u==t) b--;
if(u==s)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 1; i < (int)(n); i++)
#define invrep(i,n) for(int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
if (a >= k) ... | 0 | 12,789,726 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int A ,B, K;
string S ;
cin >> A >> B >> K;
if(K < A)cout << A - K << " " << B <<endl;
else if(K < A + B) cout << 0 << " " << A + B - K << endl;
else cout << 0 << " " << 0 << endl;
} | #include<iostream>
using namespace std;
int main() {
int n, a,b,c,d, r[5][4][12] = { 0 };
cin >> n;
while (n--) {
cin >> a >> b >> c >> d;
r[a][b][c] += d;
}
for (int i = 1; i <= 4; i++) {
for (int j = 1; j <= 3; j++) {
for (int k = 1; k <= 10; k++) {
cout << ' ' << r[i][j][k];
}
cout << endl;
... | 0 | 67,170,984 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[2010][2010];
ll sum[2010][2010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;
cin>>n>>m;
ll s[n+1];
ll t[m+1];
for(ll i=1;i<=n;i++)
cin>>s[i];
for(ll i=1;i<=m;i++)
cin>>t[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
unsigned gcd(unsigned a, unsigned b) {
while(1) {
if(a < b) swap(a, b);
if(!b) break;
a %= b;
}
return a;
}
int main(void){
ll n,k;
cin>>n>>k;
vector<ll>a(n);
ll m=0,g;
rep(0,... | 0 | 44,123,686 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) (int)x.size()
#define szc(x) (int)strlen(x)
#define all(x) x.begin(), x.end()
#define debug c... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 998244353;
const ll INF = 1e9;
ll gcd(... | 0 | 16,620,398 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++... | #include <bits/stdc++.h>
using namespace std;
long long D[302][301], H[302];
int main()
{
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> H[i];
}
H[n+1] = 0;
for (int i = 0; i <= k; i++)
{
D[0][i] = 0;
}
for (int i = 1; i <= n+1; i++)
{
... | 0 | 50,741,241 |
#include <iostream>
using namespace std;
int main() {
int K, S;
cin >> K >> S;
int pattern = 0;
for (int x=0; x<=K; ++x) {
for (int y=0; y<=K; ++y) {
int z = S - (x + y);
if ((z >= 0) && (z <= K)) {
++pattern;
}
}
}
cout << patt... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 11,030,044 |
#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()
vector<ll> enum_divisors(ll n){
vector<ll> res;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
res.push_ba... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | 0 | 28,060,454 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
string A_Z = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int ansH;
char ansW;
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
string S;
cin >> S;
if (S == "snuke")
{
ansH = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n; cin >> n;
vector<string> w;
bool flag = true;
string s; cin >> s;
w.push_back(s);
for (int i=1; i<n; i++) {
cin >> s;
if (find(w.begin(), w.end(), s) != w.end()) {
flag = false;
break;
}
if (w[i-1][w[i-1].lengt... | 0 | 94,903,061 |
#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 =(1e9)+7;
using P = pair<ll,ll>;
int main(){
ll n,m,x,y;cin >>n>>m>>x>>y;
vector<ll>a(n);
vector<ll>b(m);
ll mint=INF,mx=-INF;
for (int i = ... | #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>
#... | 0 | 45,789,333 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int K,N;
cin>>K>>N;
vector<ll> A(N);
rep(i,N)
{
cin>>A[i];
}
ll mx=0;
rep(i,N-1)
{
mx=max(mx,A[i+1]-A[i]);
}
mx=max(mx,K-A[N-1]+A[0]);... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int n = 0;
cin >> n;
vector<int> count(100);
for(int i = 0;i < 100;i++)count[i... | 0 | 28,781,697 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n,k;
cin >> n >> k;
int r = min(n,k);
vector<int> v(n);
for(int i=0;i<n;i++) cin >> v[i];
int ans = -1001001001;
for(int a=0;a<=r;a++){
for(int b=0;b<=r-a;b++){
vector<int> pos;
... | #include <stdio.h>
using namespace std;
int main(){
int m,f,r;
char grade;
while(true){
scanf("%d %d %d",&m,&f,&r);
if(m == -1 && f == -1 && r == -1) break;
if(m == -1 || f == -1){
grade = 'F';
}else if(m+f >= 80){
grade = 'A';
}else if(m+f >= 65){
grade = 'B';
}else if(m+f >= 50){
grade = 'C... | 0 | 55,156,204 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
scanf("%lld",&n);
long long int x1,y1,x2,y2;
bool p=1 ;
long long int j=0;
long long int i =sqrt(n);
x1 = sqrt(n)+0.9;
y1=1;
y2=sqrt(n)+0.9;
x2=x1*y2-n;
printf("0 0 %lld %lld %lld %lld",x1,y1,x2,y2);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJK... | 0 | 57,471,120 |
#pragma GCC optimize("Ofast,O3,inline")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define reg register
#define ALL(x) (x).begin(),(x).end()
#define mem(x,y) memset(x,y,sizeof x)
#define sz(x) (int)(x).size()
#define ln puts("")
#define lsp putchar(32)
#define pb push_back
#define MP make_pair
#define dbg(... | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 2e5 + 5;
int main()
{
int N; scanf("%d", &N);
static LL a[MAXN]; LL sum = 0;
for (int i = 1; i <= N; i++)
{
scanf("%lld", &a[i]);
sum += a[i];
}
LL pre = a[1], mDif = llabs(sum - 2 * a[1]);
for (int i = 2; i < N; i++)
{
pre += a[i];
mDif = ... | 0 | 3,553,874 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int div, mod;
div = x/100;
mod = x%100;
if (mod <= div*5) cout << 1 << endl;
else cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> cnt(n, 0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
a--;
cnt[a]++;
}
vector<int> v;
for (int i ... | 0 | 3,387,738 |
#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 34,850,661 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define umap unordered_map
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define MN(a,b,c) min(a,min(b,c))
#define pr pair<ll,ll>
#define F first
#define S second
#define mP... | 0 | 46,611,874 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " <... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 0 | 81,895,101 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
vector<long long> A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
map<long long,int> result;
for(int i=0;i<N;i++){
result[A[i]]++;
}
vector<long long> ans;
long long temp=0;
for(auto x:result){
if(x.s... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> divisor(ll n){
vector<ll> vec;
for(ll i=1;i*i<= n;i++){
if(n%i==0){
vec.push_back(i);
if(i*i!=n) vec.push_back(n/i);
}
}
return vec;
}
int main(void){
int n;
cin >> n;
ll ans... | 0 | 17,245,093 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, int> P... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 0 | 24,346,173 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
#define BE(x) (x).begin(), (x).end()
int main() {
int n, x, a;
cin >> n >> x;
if (n > 1000) {
cin >> a;
a = abs(a-x);
vector<int> b = {1, a};
for (int i = 2; i*i <= a; i++) {
if (a%i == 0) {
b.push_back... | 0 | 35,790,206 |
#include <iostream>
using namespace std;
int sum2(int n, int total, int stage)
{
int count = 0;
if (stage == 4) {
if (total == n) return 1;
return 0;
}
if (total > n) return 0;
for (int i = 0; i < 10; i++) {
count += sum2(n, total + i, stage + 1);
}
return count;
}
int sum(int n)
{
int count... | #include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int s;
cin >> s;
ll dp[s];
dp[0]=1;
dp[1]=0;
dp[... | 0 | 29,516,984 |
#include <bits/stdc++.h>
using namespace std;
#define N 200000
#define INF 0x3f3f3f3f
char str[N + 2];
int sum[26][N + 2];
int dp[N + 2];
map<int, int> m[2];
int n;
int convert(int p){
int ans, i;
for (i = 0, ans = 0; i < 26; i++){
if (sum[i][p] % 2){
ans |= (1 << i);
}
}
return ans;
}
int main(){
int i, j,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int N;
long double t[110], v[110], lim[110];
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> t[i];
rep(i, N) cin >> v[i];
for (int i=... | 0 | 20,929,453 |
#include<cstdio>
using namespace std;
int cnt(int y,int m,int d){
int res = 0;
while(y<1000){
d++; res++;
if(m&1 && d>20 || ( !(m&1) && ( (y%3 && d>19) || (!(y%3) && d>20)) ) ){
m++; d=1;
}
if(m>10){
m = 1; y++;
}
}
return res;
}
int main(){
int n,y,m,d;
scanf("%d",&n);
whi... | #include <bits/stdc++.h>
using namespace std;
#define INF (1<<31)-1
#define LINF (1LL<<63)-1LL
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#defi... | 0 | 37,521,965 |
#include<iostream>
using namespace std;
int main(){
long long D = 0, S = -1, S_cnt = 0;
int M;
cin >> M;
for(int i = 0; i < M; i++){
long long d, c;
cin >> d >> c;
D += c;
S += d * c;
S_cnt += S / 9;
S %= 9;
}
cout << D - 1 + S_cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end... | 0 | 50,501,757 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
if (s.size() + 1 == t.size()) {
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == t.at(i)) {
count++;
}
else {
cout << "No" << endl;
return 0;
}
}
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 998244353;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define rep(i,n) for(ll i=(ll)0; i<(ll)n; i++)
#define REP(i,m,n) for(ll i=(ll)m; i<(ll)n; i++)
#define... | 0 | 4,964,027 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
vector<bool> visited;
void dfs(vector<vector<int>>& graph, int start, vector<int... | #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>;
typedef vector<int> vi;
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int main() {
string S;
cin >> S;
reverse(S.begin(), S.end());
for (int i = 0; i < ... | 0 | 93,938,609 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int ans = (h2 - h1) * 60 + m2 - m1 - k;
cout << ans << '\n';
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int i,m,nmin,nmax,Diff,num;
while(1){
num = 0;
Diff = 0;
cin >> m >> nmin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0){
break;
... | 0 | 76,716,865 |
#include <iostream>
using namespace std;
int main (){
int a,b,c;
cin >> a >> b >> c;
if (a<b && b<c) cout << "Yes" <<'\n';
else if (!(a<b && b<c)) cout << "No" <<'\n';
return 0;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int... | 0 | 16,449,947 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
inline int gi() {
register int data = 0, w = 1;
register char ch = 0;
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') w = -1, ch = getchar();
... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | 0 | 5,379,867 |
#include<stdio.h>
int main (){
int i,j,z;
scanf("%d%d%d",&i,&j,&z);
if(i<j&&j<z){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
double condition = 0.0;
void func()
{
int K,N;
cin >> K >> N;
vector<int>A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int diff = K-A[N-1]+A[0];
for (int i = 1; ... | 0 | 29,342,147 |
#include<bits/stdc++.h>
using namespace std;
#define long long int lld
#define MAX 2000000
#define MAX_A 10000
int main(void){
int num;
cin >> num;
int c[MAX_A], *a,*b;
a = new int[num];
b = new int[num];
memset(c,0,sizeof(c));
for(int i = 0 ; i < num ; i++){
cin >> a[i];
}
for(int i = 0 ; i < num ; i++){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
vector<int> b(5);
vector<int> c(5);
for (int i=0;i<5;i++){
cin >> a.at(i);
b.at(i)=a.at(i)%10;
if (b.at(i)==0){
b.at(i)=10;
}
c.at(i)=a.at(i)/10;
}
sort(b.begin(),b.end());
for (int i=1;i<5;i++){
if (b.at(i)==10){
... | 0 | 185,285 |
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e5 + 9;
bool valid(const vector<int> &v) {
int cnt = 0, table[109];
for (int i = 0; i < 109; i++) {
table[i] = 0;
}
for (auto ch : v) {
if (ch == INF) continue;
table[ch]++;
cnt++;
}
if (cnt == 1 && table[0] == 1) return true;
if... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string dream = "maerd", dreamer = "remaerd", erase = "esare", eraser = "resare";
int index = 0;
while(index != s.size()) {
string sub = s.subs... | 0 | 1,944,049 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
string s;
cin>>s;
char s1,s2,s3;
for(int i=0;i<s.size()-1;i++)
{
s1=s[i];
s2=s[i+1];
if(s1==s2)
{
cout<<i+1<<" "<<i+2<<endl;
return 0;
}
if(i+2<s.size())
{
s3=s[i+2];
if(s1==s3)
{
cout<<i+1<<" "<<i+3... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
vector <int> dp(n);
for(int i = 0; i < n; i++){
cin >> a[i];
dp[a[i]-1]=i+1;
}
for(int i = 0; i < n; i++){
cout << dp[i] << " ";
}
cout << endl;
return 0;
} | 0 | 36,454,752 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int N, ans;
int A[202020];
vector<pii> S;
bool f(int k){
S.clear();
for (int i=2; i<=N; i++){
if (A[i-1] < A[i]) continue;
if (k <= 1) return false;
while (!S.empty() && S.back().first > A[i]) S.pop_back();
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> p(n); for(int i = 0; i < n; i++) cin >> p[i];
vector<int> a(n), pa(n), b(n), pb(n);
for(int i = 0; i < n; i++) a[i] = i + 1, b[i] = n - i;
int mk = 1;
for(int i = n - 1; i >= 0; i--){
p[i]--;
int val = (i + 1) * mk;
pa[p[... | 0 | 42,922,873 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <boost/multiprecision/cpp_int.hpp>
#define repi(i,a,b) for(ll i=(a);i<(b)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<pair<int,int>> p;
long long a,b;
for ( int i = 0; i < n; i++){
cin >> a >> b;
p.push_back(make_pair(a,b));
}
sort(p.begin(),p.end());
long long cnt = 0,price = 0;
for ( int i = 0; i < n; i++){
tie(a,b... | 0 | 14,126,674 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define LINT long long
class unionfind{
public:
int Num;
vector<int> par;
vector<int> height;
vector<int> diff_weight;
unionfind(int N):
par(... | #include <bits/stdc++.h>
using namespace std;
int main(){
string str;
while(getline(cin,str)){
if(str==".") break;
stack<char> stk;
string res = "yes";
for(int i=0;i<str.size();i++){
if(str[i]=='(') stk.push('(');
if(str[i]=='[') stk.push('[');
if... | 0 | 34,644,490 |
#include <cassert>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#incl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | 0 | 17,108,470 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define asc(a) sort(a.begin(), a.end())
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i,n) {
cin >> s[i];
}
asc(s);
rep(i,n) {
cout << s[i];
}
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);... | 0 | 44,109,203 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | #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>
#inc... | 0 | 28,864,498 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#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() {
ll A, B, K;
cin >> A >> B >> K;
ll res = K - A;
if (res >= 0)... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 | 54,846,930 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string a;
cin>>a;
for(int i=0;i<19;i++){
if(a.at(i)==',')
a.at(i)=' ';
}
cout<<a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
ll dp[105][100005], sum[100005];
ll add(ll u, ll v){
if ((u + v) >= mod) return u + v - mod;
else return u + v;
}
int main(){
ios_base::sync_with_stdio(false);
... | 0 | 78,563,155 |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define pii pair<ll, ll>
#define pb push_back
#define rep0(i, n) for(ll i = 0;i<n;i++)
#define rep1(i, n) for(ll i = 1;i<n;i++)
#define all(v) v.begin(),v.end()
#define fast \
ios_base::sy... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) {rep(i,x.size()) cout << x[i] << " "; cout << endl;}
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b... | 0 | 58,494,089 |
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | 0 | 18,797,554 |
#include<bits/stdc++.h>
using namespace std;
#define T top()
#define E end()
#define PS push
#define Q queue
#define PP pop()
#define L0 (LL)0
#define V vector
#define ST stack
#define FI first
#define MAX 4e18
#define MIN -MAX
#define DQ deque
#define RE rend()
#define SZ size()
#define C clear()
#define B begin()
#de... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | 0 | 87,105,331 |
#include<iostream>
#include<cmath>
#include<iomanip>
#include<stack>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<limits>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
s1 = s1 + s1;
int sz = s2.size();
for( int i=0;i<sz;i++)
if (s1.compare(i,sz, s2) == 0) {
... | #include<iostream>
using namespace std;
int main(){
int H , W ;
while(1)
{
cin >> H >> W ;
if ( H == 0 && W == 0 ){
break ;
}else{
}
for (int i = 1; i <= H ; i = i + 1 )
{
for (int j = 1; j <= W ; j = j + 1 )
{
if ( j == ... | 0 | 17,450,685 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int>A(1+N);
vector<int>B(1+N);
for(int i = 0; i <= N; i++) {
cin >> A[i];
}
B[N] = 0;
for(int i = N; i > 0; i--) {
B[i-1] = B[i]+A[i];
}
int ans = 0;
int c... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
string S;
cin >> N;
cin >> S;
int a = 0;
int b = 0;
int cnta = 0;
for (char c : S)
{
if ('(' == c)
{
cnta += 1;
}else
{
i... | 0 | 72,530,088 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
int main()
{
int n;
std::cin >> n;
std::vector<int> a(n);
std::set<int> as;
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
as.insert(a[i]);
}
std::sort(a.begin(), a.end());
in... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#def... | 0 | 84,368,934 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
ll mod = 1000000000 + 7;
ll ans = 0;
for (ll i = k; i <= n; i++) {
ans += (n*(n+1)/2 - (n-i)*(n-i+1)/2 - i*(i-1)/2 + 1) % mod;
ans %= mod;
}
ans += 1;
ans %= mod;
cout << ans << endl;
} | #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 R... | 0 | 17,942,087 |
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main(){
int n;
cin >> n;
string s;
cin >> s;
vector<vector<bool>> l(n, vector<bool>(10)), r(n, vector<bool>(10));
l[0][s[0] - '0'] = true;
for(int i=1;i<n;i++){
for(int j=0;j<10;j++){
l[i][j] = l[i-1][... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ra... | 0 | 13,485,879 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\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 ... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 39,943,960 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 56,241,067 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int a,b;
char op;
cin>>a>>op>>b;
if(op=='+') cout<<a+b<<"\n";
else cout<<a-b<<"\n";
return 0;
} | #include<stdio.h>
#include<iostream>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
char s[50],t[50];
vector<int>ques(50);
scanf("%s",s);
scanf(" %s",t);
int slen,tlen;
slen=strlen(s);
tlen=strlen(t);
i... | 0 | 89,471,357 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
void func(int n){
int table[n];
for(int i = 0; i < n; i++)scanf("%d",&table[i]);
int ans = 2000000;
for(int i = 0; i < n-1; i++){
for(int k = i+1; k < n; k++){
ans = min(ans,abs(tab... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 96,574,089 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main(void) {
int n;
cin >> n;
int ans[n];
for(int i = 0; i < n; i++) {
int b;
cin >> b;
ans[b - 1] = i + 1;
}
for(int i = 0; i < n - 1; i++) {
cout <<... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | 0 | 34,784,172 |
#include <stdio.h>
int n, m, r;
int a, b, c, e, f, z;
int k[9];
int p[8];
int q[8];
int x[8];
int y[8];
int d[200][200];
int main() {
scanf("%d%d%d", &n, &m, &r);
for (int i = 0; i < r; i++) {
scanf("%d", p + i);
p[i]--;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i][j] = 100000000;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
... | 0 | 74,017,244 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define vi vector<ll>
#define pb push_back
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define pii pair<ll,ll>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
typedef long lo... | 0 | 49,054,264 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | #include<bits/stdc++.h>
using namespace std;
map<char,char> ma;
int main(){
ios_base::sync_with_stdio(false);
int n,m;
char a,b;
while(1){
cin >> n;
if(n==0) break;
for(int i=0;i<n;i++){
cin >> a >> b;
ma[a]=b;
}
cin >> m;
char temp;
for(int i=0;i<m;i++){
cin >> tem... | 0 | 34,088,076 |
#include<iostream>
using namespace std;
int main(void){
int train[100];
int count = 0;
int n;
while(cin >> n){
if(n > 0){
train[count] = n;
count++;
}else if(n == 0){
count--;
cout << train[count] << endl;
}
}
return 0;
} | #include<iostream>
int main(){
int n;
std::cin >> n;
int taro_points = 0, hanako_points = 0;
for(int i = 0; i < n; i++){
std::string taro;
std::string hanako;
std::cin >> taro;
std::cin >> hanako;
if(taro > hanako){
taro_points += 3;
}else if(taro < hanako){
hanako_points += ... | 0 | 78,748,359 |
#include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <string>
#include <vector>
#include <limits.h>
#include <stack>
#include <queue>
#define maxn 1e9
#define pi acos(-1)
using namespace std;
double aabs(double x)
{
if(x<0)return -x;
return x;
}
int gcd(int a,int b)... | 0 | 22,847,219 |
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <limits>
#include <bitset>
#include <stack>
#include <queue>
#include <ctype.h>
typedef long long int lli;
#define rep(i,s,N) for(i... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--... | 0 | 22,852,306 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;... | 0 | 34,540,196 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> AtoB(M+1);
for (int i = 0; i < N; ++i) {
int A, B;
cin >> A >> B;
if (A > M) continue;
AtoB[A].push_back(B);
}
long long result = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i,n) for(_loop_int i=0; i<(_loop_int)(n); i++)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a); i<(_loop_int)(b); i+... | 0 | 9,073,216 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
templa... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define all(v) v.bigin(),v.end()
#define MAX(a,b) a=a>b?a:b
#define MIN(a,b) a=a<b?a:b
#define R(a) a=sqrt(a)
... | 0 | 90,612,037 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int IN... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <functional>
#include <map>
#include <queue>
#include <list>
#include <set>
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) ... | 0 | 68,886,137 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> A;
vector<ll> B;
for (int i = 0; i < N; ++i)
{
ll temp;
cin >> temp;
A.push_back(temp);
B.push_back(temp);
}
sort(B.begin(), B.end());
for (auto... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define PER(i,b,a) for(ll i=b;i>a;i--)
#define forit(it,x) for(auto it=(x).begin();it!=(x).end();++it)
#define ull unsigned long ... | 0 | 54,439,146 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string A,B;
cin>>A>>B;
string ans;
for(int i=0;i<N;i++){
cout<<A.at(i)<<B.at(i);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | 0 | 78,249,574 |
#include<bits/stdc++.h>
const int M=300000;
typedef long long int ll;
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string s,t,u;
int a,b;
cin>>s>>t>>a>>b>>u;
if(s==u)
{
cout<<a-1<<" "<<b;
}else cout<<a<<" "<<b-1;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
const ll INF = 1e9;
int main() {
int a,b; cin >> a >> b;
vector<vector<char>> grid1(50,vector<char>(100,'#'));
vector<vector<char>> grid2(50,vector<char>(100,'.'));
int i1 = 1;
in... | 0 | 81,212,722 |
#include <iostream>
#include <map>
using namespace std;
int main(void){
int n;
while(cin >> n && n){
char x,y;
map<char,char> m;
for(int i=0;i<n;i++){
cin >> x >> y;
m[x] = y;
}
cin >> n;
for(int i=0;i<n;i++){
cin >> x;
if(m.find(x) == m.end()){
cout << x;
}else{
cout << m[x];
}
... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 25,546,262 |
#include <bits/stdc++.h>
#define lint long long
using namespace std;
int main(){
int N;
cin >> N;
vector<lint> A(N);
for(int i = 0; i < N; ++i){
cin >> A[i];
}
sort(A.begin(), A.end(), greater<lint>());
lint longest = 0;
for(int i = 0; i < N - 1; ++i){
if(A[i] == A[i + 1]... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 32,841,406 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int to, cost;
};
signed main() {
int K;
cin >> K;
vector<bool> vis(K, false);
deque<pair<int, int>> dq;
dq.push_back({1, 1});
while (!dq.empty()) {
pair<int, int> p = dq.front();
dq.pop_front();
int x = p.first, ... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned 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... | 0 | 20,414,890 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define FF first
#define SS second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).siz... | #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... | 0 | 66,874,690 |
#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>
#includ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
#define vi vec... | 0 | 78,360,142 |
#include <bits/stdc++.h>
#define ipair pair<int,int>
#define rep(i,n) for(i=0;i<n;i++)
#define repj(i,j,n) for(i=j;i<n;i++)
#define PB(a,i) (a).push_back(i)
#define ALL(a) (a).begin(),(a).end()
#define SIZE(a,n) (a).resize(n)
#define SORT(a) sort(ALL(a))
#define RSORT(a, type) sort(ALL(a),greater<type>())
#define MAPIN... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | 0 | 26,839,343 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string S, ans = "None", alp = "abcdefghijklmnopqrstuvwxyz";
bool found = true;
cin >> S;
vector<int> a(26);
for(char i : S){
a[i - 'a']++;
}
for(int j; j < 26; j++){
if(a... | #include<bits/stdc++.h>
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case... | 0 | 57,649,238 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <iostream>
using namespace std;
int combination(int n)
{
int count = 0;
for (int i = 0; i <= 9; i++)
{
for (int j = 0; j <= 9; j++)
{
for (int k = 0; k <= 9; k++)
{
for (int l = 0; l <= 9; l++)
{
if (i + j + k + l == n)
{
count++;
}
}
}
}
}
return count;
}
i... | 0 | 38,600,942 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.