code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int64_t, int64_t> m;
int64_t sum = 0;
m[sum]++;
int64_t res = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
sum += x;
res += m[sum];
m[sum]++;
}
cout << res << endl;
} | 1 | 7,647,267 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repbit(bit,n) for (int bit = 0; bit < (1<<n); bit++)
using namespace std;
typedef long long ll;
double dist(pair<int,int> a, pair<int,int> b){
double dx, dy;
dx = a.first - b.first;
dy = a.second - b.second;
return sqrt(dx*dx + dy*dy);
... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_ba... | 1 | 49,247,507 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int s;
cin >> s;
if(s == 25){
cout << "Christmas" << endl;
}else if(s == 24){
cout << "Christmas Eve" << endl;
}else if(s == 23){... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main(void)
{
int D;
cin >> D;
switch(D){
case 25:
cout << "Christmas" << endl;
break;
case 24:
... | 1 | 110,976 |
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
map<ll, ll> m;
vector<ll> sum(n+1, 0);
for(int i = 0; i < n; i++)
{
sum[i+1] = sum[i] + a[i];
... | 1 | 82,807,829 |
#include <iostream>
using namespace std;
#define NIL -1
struct node {
int parent;
int left;
int right;
};
node tree[100001];
int getDepth(int n) {
int d = 0;
while (tree[n].parent != NIL) {
d++;
n = tree[n].parent;
}
return d;
}
int main() {
int n, id, k, tmp;
int d[100001];
cin >> n;
for ... | #include <iostream>
#include <vector>
using namespace std;
struct Node
{
int Parent;
int Depth;
std::vector<int> Child;
};
int main(void){
int Num;
std::cin >> Num;
std::vector<Node> List;
List.resize(Num);
for(int i = 0; i < Num; i++){
List[i].Parent = -1;
}
int Id, Jisu... | 1 | 27,634,485 |
#include <bits/stdc++.h>
using namespace std;
bool test = true;
int tt = 1;
#define ll long long
#define all(x) x.begin(), x.end()
#define sz(s) (int)(s.size())
struct fio
{
fio()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(10);
}
} fio;
const int... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define ld long double
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
const int N = 1e6 + 100... | 1 | 86,440,260 |
#include<iostream>
#include<vector>
#include<string>
int pow(int m){
int ret = 1;
while(m > 0){
ret *= 2;
m--;
}
return ret;
}
int main(){
int n, m;
std::cin >> n >> m;
int base = 100 * (n - m);
int r = pow(m);
std::cout << (1900 * m + base) * r << std::endl;
retu... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 1 | 52,349,770 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll h,w;cin>>h>>w;
if(h%3==0 || w%3==0){
cout<<0<<endl;
}
else{
ll ans = h*w;
rep(i,h-1){
ll ws=w/2;
ll tmp=max((h-i-1)*w-abs(i+1... | #include<iostream>
#include<cmath>
using namespace std;
int min_one_way(int h, int w){
return min(h,w);
}
int min_two_way(int h, int w){
int divh = h/3;
int divw = w/2;
int s1 = divh*w;
int s2 = (h-divh)*divw;
int s3 = (h-divh)*(w-divw);
int min_horizon1 = min(min(s1,s2),s3);
int max_hor... | 1 | 60,087,451 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int t = 1900 * M + 100 * (N - M);
printf("%d\n", t * (int)pow(2, M));
} | 1 | 26,640,236 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;
ll A[100002], B[100002];
bool active[100002];
int main(){
ll N, K;
cin >> N >> K;
ll total = 0;
for(int i=0;i<N;i++){
cin >> A[i] >> B[i];
if(A[i] <= K){
t... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 1 | 14,439,494 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007;
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,1,-1,1,-1};
void chmin(long long &a, long long b) { if (a > b) a = b; }
const long long INF = 1LL<<60;
ll gcd(ll a,ll b){
if(b == 0) return a;
... | #include <iostream>
int main() {
int num;
std::cin >> num;
std::cout << (num - 1) / 2 << std::endl;
} | 1 | 60,257,905 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
string s , t;
cin>>s>>t;
ll ans =2*n;
for(int i=0;i<n;i++)
{
int len = n -i;
string temp = t.substr( 0 , len);
string temp2 = s.substr( i ,len);
if( temp == temp2 )
{
... | 1 | 51,658,054 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
void solve();
int main() { solve(); return 0; }
#define ld long double
void solve() {
... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
string abc = "";
abc = abc + a.at(0) + b.at(0) + c.at(0);
transform(abc.begin(), abc.end(), abc.begin(), ::toupper);
cout << abc << endl;
} | 1 | 27,468,294 |
#include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(aut... | #include <bits/stdc++.h>
using namespace std;
int main() {
int d,t,s;
cin >> d >> t>> s;
if(d > t * s){
cout << "No";
}else{
cout << "Yes";
}
return 0;
} | 1 | 88,510,629 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n , k , h[N] , f[N];
int main()
{
cin >> n >> k;
for(int i = 1 ; i <= n; ++i)
{
cin >> h[i];
f[i] = INT_MAX;
}
f[1] = 0;
for(int i = 2 ; i <= n; ++i)
{
for(int j = 1 ; j <= k; ++j)
{
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
using namespace std;
int Go(int *a,int n,int k){
vector<int> dp(n,INT_MAX);
dp[0]=0;
for(int i=0;i<n;i++)
for(int j=i+1;j<n && j<=i+k;j++)
dp[j]=min(dp[j],dp[i]+abs(a[j]-a[i]));
return dp[n-1];
}
int main(){
int n,k... | 1 | 12,306,932 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for(int i = 0; i < k; i++) {
if(i % 2 == 0) {
if(a % 2 != 0) {
a--;
}
int h = a / 2;
a = h;
b += h;
} else {
if(... | 1 | 998,111 |
#include <cstdio>
#include <cmath>
#include <limits>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdint>
#include <functional>
#define rep(i, s, g) for (i = s; i < g; i++)
u... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | 1 | 84,832,560 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
vi v(3);
rep(i,3) cin >> v[i];
sort(v.begin(),v.end());
cout << v[0]+v[1] << endl;
} | #include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int a[3],i;
for(i=0;i<3;i++) scanf("%d",&a[i]);
sort(a,a+3);
printf("%d\n",a[0]+a[1]);
return 0;
} | 1 | 3,696,457 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main()
{
int p,q,r;
cin >> p >> q >> r;
int ans = p+q+r - max({p,q,r});
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll a,b,c;
cin>>a>>b>>c;
ll ans=a+b+c;
ans-=max({a,b,c});
cout <<ans;
return 0;
} | 1 | 39,199,620 |
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
void bubbleSort(std::vector<std::string> &Cards) {
unsigned short N = Cards.size();
for (size_t i = 0; i < N; i++) {
for (size_t j = N - 1; j >= i + 1; j--) {
if (Cards[j][1] < Cards[j - 1][1]) {
std::swap(Cards[j], Cards... | #include<stdio.h>
#include<iostream>
using namespace std;
struct card{char suit,value;};
void bu(struct card a[],int n)
{
for(int i=0;i<n;i++)
{
for(int j=n-1;j>=i+1;j--)
{
if(a[j].value<a[j-1].value)
{
card t=a[j];a[j]=a[j-1];a[j-1]=t;
}
... | 1 | 47,677,626 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char i;
cin >> i;
if (i == 'a' || i == 'i' || i == 'u' || i == 'e' || i == 'o') {
cout << "vowel" << endl;
}
else {
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
char c; cin >> c;
string ans = "consonant";
if (c == 'a') ans = "vowel";
if (c == 'e') ans = "vowel";
if (c == 'i') ans = "vowel";
if (c == 'o') ans = "vowel";
if (c == 'u') ans = "vowel";
cout << ans << endl;
return 0;
} | 1 | 49,769,928 |
#include <iostream>
using namespace std;
int N;
int main(){
cin >> N;
int m = (N/3);
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int div = n / 3;
cout << div << endl;
return 0;
} | 1 | 31,436,286 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll N;
cin >> N;
ll A[N];
ll ans = 0;
ll pw[62];
pw[0] = 1;
for (int i = 1; i < 62; i++) {
pw[i] = pw[i-1] * 2;
pw[i] %= Mod;
}
for (int i = 0; i < N; i++) {
cin >... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
signed main(){
int N;
cin >> N;
vector<int> A(N);
for( int i = 0; i < N; i++ ) cin >> A.at(i);
int ans = 0;
int now = 1;
for( int j = 0; j <= 60; j++ ){
... | 1 | 5,019,824 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a = 0, b = 0;
int in;
for(int i = 0; i < 8; i++){
cin >> in;
if(i < 4) a += in;
else b += in;
}
cout << max(a, b) << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(void){
int tmp, a, b;
a = b = 0;
for(int i = 0; i < 8; i++){
cin >> tmp;
if(i < 4)
a += tmp;
else
b += tmp;
}
cout << ((a >= b)? a : b) << endl;
return 0;
} | 1 | 98,560,305 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
ll now = 1;
ll ans = 0;
rep(i,n){
ll a;
cin >> a;
if(now == a){
++ans;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i... | 1 | 48,177,875 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N, Z, W;
cin >> N >> Z >> W;
vector<ll> a(N);
rep(i, 0, N) cin >> a[i];
if(N == 1){
cout << abs(W-a[0]) << endl;
return 0;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,z,w;
cin>>n>>z>>w;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
if(n==1) cout<<abs(w-a[0])<<endl;
else cout<<max(abs(a[n-1]-a[n-2]),abs(w-a[n-1]))<<endl;
} | 1 | 33,701,510 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
const int dx[] = { 1, -1, 0, 0, 1, 1, -1, -1 };
const int dy[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
const char dir[] = {'D', 'U', 'R', 'L'};
void Fast() { cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); }
void File()
{
#ifndef ON... | 1 | 37,070,917 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
int cnt = 0;
int max = -1;
ll bh;
for(int i=0;i<n;i++){
ll h;
cin >> h;
if(i == 0){
bh = h - 1;
}
if( h <= bh ){
cnt++;
}else{
... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | 1 | 27,987,827 |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
void print(ll a, ll digit=30){
string s = "";
while(a){
s += (a & 1 ? '1' : '0');
a = a >> 1;
}
while(s.size() < digit) s += '0';
reverse(s.begin(), s.end());
cout << s << endl;
}
int main(){
ll N, K;
cin >>... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<ll> b(n);
ll res = 0;
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
if((a[i] | k) == k) res += b[i];
}
for(int i = 0; i < 30; i++){
if(k < (1 << i)) break;
int num = (k... | 1 | 18,762,403 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define FOR(i,a,b) for(ull i=a;i<b;i++)
#define FORit(it,a) for(auto it=a.begin();it!=a.end();it++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define vec vector
#define vi vec<int>
#define vll vec<ll>
#define pb push... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
int x, m;
cin >> n >> x >> m;
long long ans = x;
vector<int> rep(m + 1, -1);
rep[x] = 0;
vector<long long> ac(m + 1, ... | 1 | 84,189,705 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int before, after;
cin >> before;
cin >> after;
cout << 2*after - before << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | 1 | 78,594,777 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1<<30
#define LINF 1LL<<60
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll N; cin >> N;
vector<ll> a(N);
for(auto& in:a) cin >> in;
vector<ll> cusum(N+1,... | #include<bits/stdc++.h>
using namespace std;
#define itn int
#define endl "\n"
int main(void){
int n;
cin >> n;
long long int a[n],num[n];
for(int i = 0;i < n;i++)cin >> a[i];
num[0] = a[0];
for(int i = 1;i < n;i++)num[i] = num[i-1] + a[i];
long long int sum = abs(num[0] - (num[n-1] - num[0]... | 1 | 91,291,227 |
#include<bits/stdc++.h>
using namespace std;
void sieve(int spf[],int mx){
spf[1] = 1;
for(int i=2;i<=mx;i++){
spf[i] = i ;
}
for(int i = 4;i<=mx;i+=2)
spf[i] = 2;
for(int i = 3;i*i<=mx;i++){
if(spf[i]==i){
for(int j = i*i;j<=mx;j+=i){
if(spf[j] =... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 1e6 + 10, OO = 0x3f3f3f3f, mod = 100000007;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#... | 1 | 45,508,859 |
#include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
string s;
cin >> s;
if(s == "0") return 0;
int num=0;
for(int i=0;i<s.size();i++) num+=s[i]-'0';
cout<<num<<endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string num;
int ans, digit;
ans = 0;
while(1){
cin >> num;
if(num == "0") break;
for (int i = 0; i < num.length(); ++i)
{
digit = num[i] -'0';
ans += digit;
}
... | 1 | 42,298,600 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
ll a,n;
ll tresh = 1000000000000000000;
void solve(){
cin >> n;
ll ans = 1;
bool flag = false;
for (int i = 0; i < n; i++)
{
cin >> a;
if(a <= tresh/ans){
ans = ans * a;
}
... | 1 | 16,725,144 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
string S;
cin >> S;
char before = S[0];
int cnt = 0;
for(int i=0;i<S.size();i++){
if(before != S[i]){
cnt++;... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | 1 | 94,177,605 |
#include <iostream>
int main(){
int k, s;
std::cin >> k >> s;
int count = 0;
for (int i = 0; i <= k; i++)
{
for (int j = 0; j <= k; j++)
{
if ((s - i - j <= k) && (i + j <= s))
{
count++;
}
}
}
std::cout << count << ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int K,S;
cin >> K >> S;
int ans = 0;
for(int i = 0; i <= K; i++) {
for(int j = 0; i+j <= S && j <=... | 1 | 29,865,469 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
int p = 0;
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; ++i)
{
cin >> a[i];
}
int res = INT_MAX;
for(int i = 0; i < 101; ++i)
{
int sum = 0;
for(int j = 0; j < n; ++j)
{
... | 1 | 71,890,946 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
int main() {
ll n, a, b;
cin >> n >> a >> b;
if(a == b && n == 1) {
cout << 1 << endl;
return 0;
}
if... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n, a, b;
cin >> n >> a >> b;
if(a > b || (n == 1 && a != b))
{
cout << 0;
return 0;
}
cout << (n - 2)*(b-a) + 1;
} | 1 | 2,620,459 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long n,m,d;
cin >> n >> m >> d;
long k;
if(d==0) k = n;
else k = 2*(n-d);
cout << fixed << setprecision(10) << double(k*(m-1))/double(n*n) << endl;
} | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | 1 | 63,604,786 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
ll nCr(ll n,ll r){
ll x=1;
for(ll i=n; i>n-r; i--) x*=i;
for(ll i=1; i<=r; i++) x/=i;
return x;
}
int main() {
ll n,p;
cin>>n>>p;
ll a;
ll e... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N,P;
cin >> N >> P;
vector<int>A(N);
int count = 0;
long long sum = 1;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum *= 2;
if (A.at(i) % 2 == 1){
count = 1;
}
}
if (count == 1){
cout << sum/2 << endl;
}
els... | 1 | 83,491,475 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string bottan[]={
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int cnt[] = {0,5,3,3,3,3,3,4,3,4};
cin >> n;
while(n--){
string str; cin >> str;
int len = str.... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<vector<char>> ch = {{}, {'.', ',', '!', '?', ' '}, {'a', 'b', 'c'}, {'d', 'e', 'f'}, {'g', 'h', 'i'}, {'j', 'k', 'l'}, {'m', 'n', 'o'}, {'p', 'q', 'r', 's'}, {'t', 'u', 'v'}, {'w', 'x', 'y', 'z'}};
int T;
cin >> T;
for (int i = 0; i < T; i++){
... | 1 | 18,828,188 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
vector<int> cntOdd(110000);
for (int i = 0; i < N; i += 2) {
cntOdd.at(A.at(i))++;
}
vector<int> cntEven(110000);
for (int i = 1; i < N; i += 2) {
cntEven.a... | 1 | 67,711,719 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
bool ok = false;
for (auto s : v[0]) {
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
ty... | 1 | 40,710,424 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a < b) cout << 0 << endl;
else cout << a - b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, t;
cin >> x >> t;
if ((x-t) < 0){
cout << 0 << endl;}
else{
cout << x-t << endl;}
} | 1 | 60,924,071 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | #include <bits/stdc++.h>
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<cl... | 1 | 5,966,043 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
int main() {
char b;
cin >> b;
char ans;
if(b == 'A') {
ans = 'T';
}
if(b == 'T') {
ans = 'A';
}
if(b == 'G') {
ans = 'C';
}
if(b == 'C') {
... | 1 | 86,930,546 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
#include<deque>
#include<functional>
#include<utility>
using na... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<queue>
#include <climits>
#include <map>
#include <set>
const int mod = 1e9 + 7;
const int INF = 1 << 20;
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int n,m;
... | 1 | 92,899,995 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N;
ll count = 0;
vector<set<ll>> A;
cin >> N;
A.resize(N);
for(ll i = 0;i < N;i++) {
ll temp;
cin >> temp;
A[i].insert(temp - 1);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI a(n);
rep(i,n)cin >> a.at(i);
int ans=0;
rep(i,n){
if(a.at(a.at(i)-1)==i+1)... | 1 | 88,719,933 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int c(int n, int k, vector<int> a) {
if((n-1) % (k-1) == 0) {
return (n-1) / (k-1);
}
return (n-1) / (k-1) + 1;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i=0;i<n;i++) {
cin >> a[i];
}
cout << c(n, k, a);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
double n , k ;
cin >> n >> k;
double arr[(int)n] , x=0;
for(int i = 0 ; i < n ; i++)
{
cin >> arr[i];
if(arr[i]==1)
x=i;
}
cout << ceil((n-1)/(k-1)) ;
} | 1 | 73,423,240 |
#include <stdio.h>
int main()
{
int n;
int i,j,k,l;
int ans;
while(scanf("%d",&n) != EOF){
ans = 0;
for(i = 0; i < 10; i++){
for(j = 0; j < 10; j++){
for(k = 0; k < 10; k++){
for(l = 0; l < 10; l++){
if(i + j + k + l == n)ans++;
}
}
}
}
printf("%d\n",ans);
}
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | 1 | 80,565,758 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<tuple>
#include<bitset>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define req(i,n) for(ll i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,k;
cin>>n>>k;
string s;
cin>>s;
s+='2';
ll l=0,r=0,cnt=0;
if(s[r]=='0'){
cnt++;
for(ll i=0;i<n;i++){
r=i;
if(s[i]=='1'&&s[i+1]=='0'){
break;
}
}
}
if(cnt!=k){
for... | 1 | 94,563,565 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 1 | 69,597,949 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
struct node
{
int c;
int a[15];
}book[15];
int b[15];
int main()
{
int n,m,x;
cin>>n>>m>>x;
for(int i=0;i<n;i++)
{
cin>>book[i].c;
for(int j=0;j<m;j++) cin>>book[i].a[j];
}
int ans=-1;
for(int i=0;i<(1<<n);i+... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 1 | 93,306,096 |
#include <bits/stdc++.h>
#include <boost/integer/common_factor_rt.hpp>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
for(int i=0;i<n;i++){
cin >> h.at(i);
}
int x=0;
int ans=0;
while(true){
while(h.at(x)==0){
x++;
i... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
c... | 1 | 54,941,389 |
#include<bits/stdc++.h>
#include<iostream>
#include<queue>
#include<string>
#include<algorithm>
using namespace std;
int r,g;
int main()
{
cin>>r>>g;
cout<<(g*2)-r<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a = 0;
double b = 0;
double c = 0;
cin >> a >> b;
c = 2 * b - a;
cout << c << endl;
} | 1 | 73,480,836 |
#include <bits/stdc++.h>
using namespace std;
long long const MOD = 1000000007;
long long dp[2010][2010] = {};
int main() {
int N, M; cin >> N >> M;
vector<int> S(N), T(M);
for(int i=0; i<N; ++i) cin >> S[i];
for(int j=0; j<M; ++j) cin >> T[j];
for(int j=0; j<=M; ++j) dp[0][j] = 1;
for(int i=0; ... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 1 | 57,108,947 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
unordered_map<int,int> a,b;
for(int i=0;i<n;i++){
int j;
cin>>j;
if(i%2==0){
if(a.count(j))
a[j]++;
else
a[j]=1;
}
else{
if(b.count(j))
b[j]++;
else
b[j]=1;
}
... | 1 | 36,705,250 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
int tmp = b - a;
if (tmp <= 0) return cout << "delicious" << "\n", 0;
if (tmp <= x) return cout << "safe" << "\n", 0;
cout << "dangerous" << "\n";
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
int X, A, B;
cin >> X >> A >> B;
if (B - A <= 0) {
cout << "delicious" << endl;
}
else if (B - A <= X) {
cout << "safe" << endl;
}
else {
cout << "dangerous" << endl;
}
}
int main() {
std::cout << std... | 1 | 71,279,299 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N, K;
long a[5000];
int main(){
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> N >> K;
for(int i=0; i < N; ++i) cin >> a[i];
sort(a, a + N);
long s = 0;
int ans = N;
for(int i=N-1; i >= 0; --i) {
... | #include <cstdio>
#include<bitset>
#include<algorithm>
#include<iostream>
#include<string>
#define ll long long
using namespace std;
long long n,k;
ll a[5010];
bitset<5010> bs;
bool check(int x)
{
bs.reset();
bs[0]=1;
for(int i=1;i<=n;i++)
if(i!=x) bs|=(bs<<a[i]);
for(int i=k-a[x];i<k;i++)
if(bs[i]==1) return fa... | 1 | 1,237,504 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
int main() {
int N,K; cin>>N>>K;
vector<ll> a(N);
for (int i = 0; i < N; ++i) {
cin>>a[i];
}
vector<ll> ruiseki(N+1,0ll),ruisekip(N+1,0ll);
for (int i = 0; i < N; ++i) {
ruiseki[i+1]=ruiseki... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defin... | 1 | 92,932,437 |
#include <iostream>
using namespace std;
int main(){
int m,n,r;
int result;
while(cin >> m >> n >> r, m >= 0 || n >= 0 || r >= 0){
result=m+n;
if(m == -1 || n == -1)
cout << "F" << endl;
else if(result>=80)
cout << "A" << endl;
else if(result<80 && result>=65)
cout << "B" << endl;
else if(result<6... | #include<iostream>
using namespace std;
int main() {
int a, b, c, x;
char r[10000];
for (int i = 0;; i++) {
cin >> a >> b >> c;
if (a == b&&b == c&&c == -1){
x = i;
break;
}
else if (a == -1 || b == -1){
r[i] = 'F';
}else if (a + b >= 80){
r[i] = 'A';
}else if (65 <= a + b) {
r[i] = 'B';
... | 1 | 70,608,254 |
#include <iostream>
using namespace std;
int main(void)
{
int n;
int ans[100]={0};
int kari;
while(cin>>n)
ans[n]++;
kari=ans[0];
for(int i=1;i<99;i++)
{
if(kari<ans[i])
kari=ans[i];
}
for (int i=0; i<100; i++)
{
if(kari==ans[i])
co... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<int> v(101, 0);
int x,m = 0;
while(cin >> x){
v[x]++;
m = max(m, v[x]);
}
for(int i = 1 ; i <= 100 ; i++){
if(m == v[i]){
cout << i << endl;
}
}
return 0;
} | 1 | 16,225,676 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
char* s = (char*)calloc(n+1, sizeof(char));
char* t = (char*)calloc(n+1, sizeof(char));
char* s_t = (char*)calloc(n+n+1, sizeof(char));
for(int i = 0; i < n; i++){
cin >> s[i];
}
for(int i = 0; i < n; i++){
cin >> t[i];
}
int s_index = ... | #pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
string t;
... | 1 | 56,417,883 |
#include <cstdio>
#include <vector>
using namespace std;
#define MAXN 100001
int N;
vector<int> conj[MAXN];
int visited[MAXN];
int sg(int id)
{
int ret = 0;
visited[id] = 1;
for(auto p : conj[id])
if(!visited[p])
ret ^= sg(p)+1;
return ret;
}
int main(void)
{
int i = 0;
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5+5;
int n, s[MAXN];
vector<int> g[MAXN];
int dfs(int v, int f = -1) {
for (int u : g[v])
if (u != f)
s[v] ^= (1 + dfs(u, v));
return s[v];
}
int main() {
cin >> n;
for (int i = 0; i < n-1; ++i) {
int a, b;
cin >> a >> b... | 1 | 99,785,270 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
ll r,D,x;
cin >> r >> D >> x;
rep(i,10){
x = r*x - D;
cout << x <<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 repa(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
#define COUT(x) cout<<(x)<<endl
#define YES(x) cout<<(x?"YES":"NO")<<e... | 1 | 27,307,228 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c,S,L,h;
cin >> a >> b >> c;
c = c * M_PI / 180;
S = ((a * b) * sin(c)) / 2;
L = a + b + sqrt(pow(a, 2) + pow(b, 2) - (2 * a * b * cos(c)));
h = b * sin(c);
cout.precision(15);
cout << S << endl;
cout... | #include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
main(){
double a,b,C;
double S,L,h;
cin >> a >> b >> C ;
C=C/180*M_PI;
S=(a*b*sin(C))/2;
L=a+b+sqrt(a*a+b*b-2*a*b*cos(C));
h=b*sin(C);
printf("%.8f\n%.8f\n%.8f\n",S,L,h);
} | 1 | 51,068,826 |
#include<iostream>
int main(){int a,D,X,x;std::cin>>a>>D>>X;while(std::cin>>x)a+=(D-1)/x;std::cout<<a+X<<"\n";} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<string> vs;
#define fo(i, a, b) for (int i = a; i < b; i++)
#define re(i, n) fo(i, 0, n)
#define pb push_back
#define mp make_pair... | 1 | 22,300,268 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
for(auto &i: s){
if(i == '9')i = '1';
else if(i == '1')i = '9';
}
cout << s << endl;
} | #include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for(auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#de... | 1 | 5,096,916 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
unordered_map<string,long long> s;
long long ans=0;
for(int i=0;i<n;i++){
string t; cin >> t;
sort(t.begin(),t.end());
if(s.count(t)) s[t]+=1;
else s[t]=1;
}
for(auto p:s){
long long x=p.second;
ans+=x*(x-1)/2... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 16,874,193 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin>>S;
int K;
cin>>K;
bool ans=false;
rep(i,S.size()){
if(S[i]=='1'&&K!=i+1){
}
else{
cout<<S... | 1 | 4,230,872 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return (a / gcd(a, b)) * b;
}
ll solve(ll x, ll c, ll d) {
return x - (x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll x, ll y){
if(x < y) swap(x, y);
while(y){
ll r = x % y;
x = y;
y = r;
}
return x;
}
ll lcm(ll x, ll y){
ll g = gcd(x, y);
return (x / g) * (y / g) * g;
}
int main(){
ll a, b, c, d;
cin >... | 1 | 1,138,387 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
double s=0;
for(int i=0;i<n;i++){
double x;
string u;
cin>>x>>u;
s+=(u=="JPY"?x:380000*x);
}
cout<<fixed<<setprecision(10)<<s<<endl;
} | 1 | 95,227,403 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 1 | 88,166,887 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using lint = int64_t;
int main() {... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define SIZ... | 1 | 80,408,757 |
#include<cstdio>
#include<cctype>
#include<cstring>
int main(void){
char ch, seq[1200];
int count[26] = {};
int l = 0;
while( scanf("%c", &ch) != EOF){
seq[l] = ch;
l++;
}
for(int i= 0;i < strlen(seq); i++){
if (isalpha(seq[i])){
seq[i] = tolower(seq[i]);
int num = seq[i] - 'a';
count[num] += 1;
... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
int arr[26] = {0};
while (getline(cin, s))
{
for (int i = 0; i < s.length(); i++)
{
if(65 <= s[i] && s[i] <= 90)
arr[s[i] - 65]++;
else if(97 <= s[i] && s[i] <= 122)
arr[s[i] - 97]++;
}
}
for (int i = 0; i < 26; ... | 1 | 98,455,310 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | 1 | 87,863,387 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
ll N;
cin >> N;
ll sum = (1+N)*N/2;
cout << sum-N << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
void solve() {
cin >> N;
N--;
cout << (1 + N) * N / 2 << endl;
}
int main() {
solve();
return 0;
} | 1 | 24,834,284 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
using ll = long long;
using ld = lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int N=0;
for(int i=0;i<S.size();i++){
if(S.at(i)=='x') N++;
}
cout<<(N>=8? "NO":"YES")<<endl;
} | 1 | 68,481,210 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<double,double> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define se... | #include<cstdio>
#include<algorithm>
int min(int,int);
int main(void){
int i,j,k,x,y;
int n, m;
int c[20];
int a[50001];
int b[50001];
scanf("%d%d",&n,&m);
for(i=0;i<m;i++){
scanf("%d",&c[i]);
}
if(m == 1){
printf("%d\n", n);
return 0;
}
std::sort(c,c+m);
for(i=0;i<=n;i++){
a[i]=i/c[1] + i%c[1];
b... | 1 | 82,257,447 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <fun... | 1 | 46,909,331 |
#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)(n);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 1 | 78,160,142 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<tuple>
#include<map>
using namespace std;
bool check (string s){
int n = s.length();
if (n%2==1){
return false;
}
else {
return (s.substr(0,n/2-1)==s.substr(n/2));
}
}
int main(){
long long x, y;
cin >> x >> y;
int... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x, y;
cin >> x >> y;
int count = 0;
while(true) {
x *= 2;
count++;
if (x > y) break ;
}
cout... | 1 | 57,185,280 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | #include <bits/stdc++.h>
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 FOR(i, m, n) for(ll i = (m); i < (n); ++i)
#define INF 1e9
int main(){
string A;
cin >> A;
vector<int> cnt(26, 0);
REP(i, A.size()){
cnt[A[i] ... | 1 | 48,428,960 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
typedef long long ll;
int main(){
int N; cin >> N;
vector <ll> T(N), A(N);
for (int i = 0; i < N; i++)... | #include <bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
void cntr(){ cout << 0 << "\n"; }
int main(){
int N; cin >> N; int L=N-1;
unsigned long long T[N], A[N], ans=1;
for(int i=0; i<N; i++){ cin >> T[i]; }
for(int i=0; i<N; i++){ cin >> A[i]; }
if(N==1){ if(A[0]==T[0]){ cout << 1 << "\n"; }else{ cn... | 1 | 75,340,535 |
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#define llint long long
using namespace std;
llint W, H;
vector<pair<llint, int> > vec;
int main(void)
{
cin >> W >> H;
int p, q;
for(int i = 0; i < W; i++){
cin >> p;
vec.push_back( make_pair(p, 0) );
}
for(int i = 0; i < H; i++){
... | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 1 | 73,933,770 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n,m; cin>>n>>m;
cout<<(ll)abs(n-2)*abs(m-2)<<endl;
} | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#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 = 100100100100100100;
const ll MOD = 1000000007;
ll combination(ll n, ll r){
if(n < r) return 0;
if(r == 0||r == n) return 1;
... | 1 | 59,579,050 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <bits/stdc++.h>
#define ln "\n"
#define SORT(X) sort(X.begin(), X.end())
#define SORTi(X) sort(X.begin(), X.end(), greater<ll>())
#define REP(x, a, b) for (auto x = a; x <= b; x++)
#define REPi(x, b, a) for (auto x = b; x >= a; x--)
#define REPit(x, A) for (auto x = A.begin(); x != A.end(); x++)
#define REPr(x... | 1 | 57,512,830 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
struct stu
{
int x,y;
};
stu vp[90005];
int k[90005];
int main()
{
int h,w,d,num;
scanf("%d %d %d",&h,&w,&d);
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
scanf("%d",&num);
vp[num].x=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;
vector<pair<long long, long l... | 1 | 72,233,889 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
for (int i = 1; i < n; i++) {
if (a[i] < a[i-1]) {
ans += a[i-1]-a[i];
a[... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 1 | 377,692 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while (cin >> n, n) {
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int mi = 999999999;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
... | #include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<map>
#include<algorithm>
#include<set>
#include <stdexcept>
#include<queue>
#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;
t... | 1 | 42,068,079 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
bool ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
string s;
cin>>n>>s;
int ans=0;
for(int i=0;i<1000;i++) {
bool i0=false,i1=false,i2=false;
string I="";
if(i<100) I+='0';
if(i<10) I+='0';
I+=to_string(i);
for(int j=0;j<n;j++) {
if(s[j]==I[2]... | 1 | 8,189,065 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod=1000000007;
const double PI = 3.14159265359;
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define INF 1000000000000
#define pb push_back
#define pf push_front
#define... | #include <bits/stdc++.h>
#include<string.h>
#define ll long long
#include<vector>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main(){
IOS;
int n,m;
cin>>n>>m;
int votes=0;
vector<int> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
votes+=v[i];}
sort(v.begin(),v.end(),greater<int>()... | 1 | 13,605,459 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() < 4 || s.substr(0, 4) != "YAKI") {
cout << "No\n";
} else {
cout << "Yes\n";
}
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | 1 | 58,968,206 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
double x[3],y[3],px,py;
while(cin>>x[0]>>y[0]){
for(int i=1;i<3;i++)cin>>x[i]>>y[i];
cin>>px>>py;
bool ok=true;
for(int i=0;i<3;i++){
bool plus=false;
if(x[(i+1)%3]==x[(i+2)%3]){
if(x[i]>x[(i+1)%3])plus=true;
}
else{
d... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include ... | 1 | 82,471,120 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1<<29;
typedef long long ll;
int dp[100][2][100];
struct UnionFind {
vi parent;
UnionFind(i... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n,a,b; cin>>n>>a>>b;
vec... | 1 | 14,651,539 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string s;
cin>>s;
int n=s.size()+1;
int a[n];
for(int i=0;i<n;++i) a[i]=0;
for(int i=0;i<(n-1);++i)
{
if(s[i]=='<')
{
... | 1 | 53,156,095 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
int a[N];
for(int i=0; i<N; i++){
cin >> a[i];
}
long ans = 10000000000000;
for(int i=0; i<pow(2,N); i++){
int max = a[0];
long t = 0;
int cnt = 1;
for(int j... | #include <algorithm>
#include<iostream>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
vector<vector<int>> combi(int n,in... | 1 | 16,899,047 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = N - K;
if (K == 1) ans = 0;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 1 | 79,129,584 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
typedef pair<int, int> P;
bool rev(string s) {
string t = s;
reverse(t.begin(), t.end());
return s == t;
}
signed main() {
string s; cin >> s;
string remx;
rep(i, s.size())if (s[i] != 'x')remx.push_back(s[i]);... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
string t;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'x') t.push_back(s[i]);
}
for (int i = 0; i < t.size(); i++) {
if (t[i] != t[t.size() - 1 - i... | 1 | 54,910,961 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.